| blob | a50aae1e57ab1379ac24aa898738275a44ef6b98 |
1 /* Subroutines shared by all languages that are variants of C.
2 Copyright (C) 1992-2013 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
9 version.
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14 for more details.
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
49 /* The following symbols are subsumed in the c_global_trees array, and
50 listed here individually for documentation purposes.
52 INTEGER_TYPE and REAL_TYPE nodes for the standard data types.
54 tree short_integer_type_node;
55 tree long_integer_type_node;
56 tree long_long_integer_type_node;
57 tree int128_integer_type_node;
59 tree short_unsigned_type_node;
60 tree long_unsigned_type_node;
61 tree long_long_unsigned_type_node;
62 tree int128_unsigned_type_node;
64 tree truthvalue_type_node;
65 tree truthvalue_false_node;
66 tree truthvalue_true_node;
68 tree ptrdiff_type_node;
70 tree unsigned_char_type_node;
71 tree signed_char_type_node;
72 tree wchar_type_node;
74 tree char16_type_node;
75 tree char32_type_node;
77 tree float_type_node;
78 tree double_type_node;
79 tree long_double_type_node;
81 tree complex_integer_type_node;
82 tree complex_float_type_node;
83 tree complex_double_type_node;
84 tree complex_long_double_type_node;
86 tree dfloat32_type_node;
87 tree dfloat64_type_node;
88 tree_dfloat128_type_node;
90 tree intQI_type_node;
91 tree intHI_type_node;
92 tree intSI_type_node;
93 tree intDI_type_node;
94 tree intTI_type_node;
96 tree unsigned_intQI_type_node;
97 tree unsigned_intHI_type_node;
98 tree unsigned_intSI_type_node;
99 tree unsigned_intDI_type_node;
100 tree unsigned_intTI_type_node;
102 tree widest_integer_literal_type_node;
103 tree widest_unsigned_literal_type_node;
105 Nodes for types `void *' and `const void *'.
107 tree ptr_type_node, const_ptr_type_node;
109 Nodes for types `char *' and `const char *'.
111 tree string_type_node, const_string_type_node;
113 Type `char[SOMENUMBER]'.
114 Used when an array of char is needed and the size is irrelevant.
116 tree char_array_type_node;
118 Type `int[SOMENUMBER]' or something like it.
119 Used when an array of int needed and the size is irrelevant.
121 tree int_array_type_node;
123 Type `wchar_t[SOMENUMBER]' or something like it.
124 Used when a wide string literal is created.
126 tree wchar_array_type_node;
128 Type `char16_t[SOMENUMBER]' or something like it.
129 Used when a UTF-16 string literal is created.
131 tree char16_array_type_node;
133 Type `char32_t[SOMENUMBER]' or something like it.
134 Used when a UTF-32 string literal is created.
136 tree char32_array_type_node;
138 Type `int ()' -- used for implicit declaration of functions.
140 tree default_function_type;
142 A VOID_TYPE node, packaged in a TREE_LIST.
144 tree void_list_node;
146 The lazily created VAR_DECLs for __FUNCTION__, __PRETTY_FUNCTION__,
147 and __func__. (C doesn't generate __FUNCTION__ and__PRETTY_FUNCTION__
148 VAR_DECLS, but C++ does.)
150 tree function_name_decl_node;
151 tree pretty_function_name_decl_node;
152 tree c99_function_name_decl_node;
154 Stack of nested function name VAR_DECLs.
156 tree saved_function_name_decls;
158 */
161 \f
162 /* Switches common to the C front ends. */
164 /* Nonzero means don't output line number information. */
168 /* Nonzero causes -E output not to be done, but directives such as
169 #define that have side effects are still obeyed. */
173 /* Nonzero means dump macros in some fashion. */
177 /* Nonzero means pass #include lines through to the output. */
181 /* Nonzero means process PCH files while preprocessing. */
185 /* The file name to which we should write a precompiled header, or
186 NULL if no header will be written in this compile. */
190 /* Nonzero if an ISO standard was selected. It rejects macros in the
191 user's namespace. */
194 /* C/ObjC language option variables. */
197 /* Nonzero means allow type mismatches in conditional expressions;
198 just make their values `void'. */
202 /* Nonzero means enable C89 Amendment 1 features. */
206 /* Nonzero means use the ISO C99 (or C11) dialect of C. */
210 /* Nonzero means use the ISO C11 dialect of C. */
214 /* Nonzero means that we have builtin functions, and main is an int. */
219 /* ObjC language option variables. */
222 /* Tells the compiler that this is a special run. Do not perform any
223 compiling, instead we are to test some platform dependent features
224 and output a C header file with appropriate definitions. */
228 /* Tells the compiler what is the constant string class for ObjC. */
233 /* C++ language option variables. */
236 /* Nonzero means generate separate instantiation control files and
237 juggle them at link time. */
241 /* The C++ dialect being used. C++98 is the default. */
245 /* Maximum template instantiation depth. This limit exists to limit the
246 time it takes to notice excessively recursive template instantiations.
248 The default is lower than the 1024 recommended by the C++0x standard
249 because G++ runs out of stack before 1024 with highly recursive template
250 argument deduction substitution (g++.dg/cpp0x/enum11.C). */
254 /* The elements of `ridpointers' are identifier nodes for the reserved
255 type names and storage classes. It is indexed by a RID_... value. */
260 /* Nonzero means don't warn about problems that occur when the code is
261 executed. */
264 /* Whether we are building a boolean conversion inside
265 convert_for_assignment, or some other late binary operation. If
266 build_binary_op is called for C (from code shared by C and C++) in
267 this case, then the operands have already been folded and the
268 result will not be folded again, so C_MAYBE_CONST_EXPR should not
269 be generated. */
272 /* Whether lexing has been completed, so subsequent preprocessor
273 errors should use the compiler's input_location. */
276 /* Information about how a function name is generated. */
277 struct fname_var_t
278 {
282 };
284 /* The three ways of getting then name of the current function. */
287 {
288 /* C99 compliant __func__, must be first. */
290 /* GCC __FUNCTION__ compliant. */
292 /* GCC __PRETTY_FUNCTION__ compliant. */
295 };
297 /* Global visibility options. */
376 /* Reserved words. The third field is a mask: keywords are disabled
377 if they match the mask.
379 Masks for languages:
380 C --std=c89: D_C99 | D_CXXONLY | D_OBJC | D_CXX_OBJC
381 C --std=c99: D_CXXONLY | D_OBJC
382 ObjC is like C except that D_OBJC and D_CXX_OBJC are not set
383 C++ --std=c98: D_CONLY | D_CXXOX | D_OBJC
384 C++ --std=c0x: D_CONLY | D_OBJC
385 ObjC++ is like C++ except that D_OBJC is not set
387 If -fno-asm is used, D_ASM is added to the mask. If
388 -fno-gnu-keywords is used, D_EXT is added. If -fno-asm and C in
389 C89 mode, D_EXT89 is added for both -fno-asm and -fno-gnu-keywords.
390 In C with -Wc++-compat, we warn if D_CXXWARN is set.
392 Note the complication of the D_CXX_OBJC keywords. These are
393 reserved words such as 'class'. In C++, 'class' is a reserved
394 word. In Objective-C++ it is too. In Objective-C, it is a
395 reserved word too, but only if it follows an '@' sign.
396 */
398 {
553 /* These Objective-C keywords are recognized only immediately after
554 an '@'. */
571 /* These are recognized only in protocol-qualifier context
572 (see above) */
579 /* These are recognized inside a property attribute list */
588 };
593 /* Table of machine-independent attributes common to all C-like languages. */
595 {
596 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
597 affects_type_identity } */
604 /* FIXME: logically, noreturn attributes should be listed as
605 "false, true, true" and apply to function types. But implementing this
606 would require all the places in the compiler that use TREE_THIS_VOLATILE
607 on a decl to identify non-returning functions to be located and fixed
608 to check the function type instead. */
633 /* The same comments as for noreturn attributes apply to const ones. */
657 handle_no_instrument_function_attribute,
675 /* ??? These two attributes didn't make the transition from the
676 Intel language document to the multi-vendor language document. */
681 /* For internal use (marking of builtins) only. The name contains space
682 to prevent its usage in source code. */
704 /* For internal use (marking of builtins) only. The name contains space
705 to prevent its usage in source code. */
716 handle_no_address_safety_analysis_attribute,
726 /* For internal use only. The leading '*' both prevents its usage in
727 source code and signals that it may be overridden by machine tables. */
732 /* For internal use (marking of builtins and runtime functions) only.
733 The name contains space to prevent its usage in source code. */
737 };
739 /* Give the specifications for the format attributes, used by C and all
740 descendants. */
743 {
744 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
745 affects_type_identity } */
751 };
753 /* Return identifier for address space AS. */
757 {
761 }
763 /* Push current bindings for the function name VAR_DECLS. */
765 void
767 {
772 {
776 {
778 saved);
780 }
781 }
783 /* Normally they'll have been NULL, so only push if we've got a
784 stack, or they are non-NULL. */
786 saved_function_name_decls);
787 }
789 /* Finish up the current bindings, adding them into the current function's
790 statement tree. This must be done _before_ finish_stmt_tree is called.
791 If there is no current function, we must be at file scope and no statements
792 are involved. Pop the previous bindings. */
794 void
796 {
805 {
813 }
819 {
820 /* We had saved values, restore them. */
821 tree saved;
824 {
829 }
831 }
833 }
835 /* Return the text name of the current function, suitably prettified
836 by PRETTY_P. Return string must be freed by caller. */
840 {
847 {
850 }
863 {
866 }
869 }
871 /* Return the VAR_DECL for a const char array naming the current
872 function. If the VAR_DECL has not yet been created, create it
873 now. RID indicates how it should be formatted and IDENTIFIER_NODE
874 ID is its name (unfortunately C and C++ hold the RID values of
875 keywords in different places, so we can't derive RID from ID in
876 this language independent code. LOC is the location of the
877 function. */
879 tree
881 {
891 {
892 /* If a tree is built here, it would normally have the lineno of
893 the current statement. Later this tree will be moved to the
894 beginning of the function and this line number will be wrong.
895 To avoid this problem set the lineno to 0 here; that prevents
896 it from appearing in the RTL. */
897 tree stmts;
905 saved_function_name_decls
909 }
914 }
916 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
918 tree
920 {
925 /* Compute the number of elements, for the array type. */
927 {
930 }
932 {
935 }
937 {
940 }
941 else
942 {
945 }
947 /* C89 2.2.4.1, C99 5.2.4.1 (Translation limits). The analogous
948 limit in C++98 Annex B is very large (65536) and is not normative,
949 so we do not diagnose it (warn_overlength_strings is forced off
950 in c_common_post_options). */
952 {
956 /* Translators: The %d after 'ISO C' will be 90 or 99. Do not
957 separate the %d from the 'C'. 'ISO' should not be
958 translated, but it may be moved after 'C%d' in languages
959 where modifiers follow nouns. */
961 "string length %qd is greater than the length %qd "
964 }
966 /* Create the array type for the string constant. The ISO C++
967 standard says that a string literal has type `const char[N]' or
968 `const wchar_t[N]'. We use the same logic when invoked as a C
969 front-end with -Wwrite-strings.
970 ??? We should change the type of an expression depending on the
971 state of a warning flag. We should just be warning -- see how
972 this is handled in the C++ front-end for the deprecated implicit
973 conversion from string literals to `char*' or `wchar_t*'.
975 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
976 array type being the unqualified version of that type.
977 Therefore, if we are constructing an array of const char, we must
978 construct the matching unqualified array type first. The C front
979 end does not require this, but it does no harm, so we do it
980 unconditionally. */
991 }
992 \f
993 /* If DISABLE is true, stop issuing warnings. This is used when
994 parsing code that we know will not be executed. This function may
995 be called multiple times, and works as a stack. */
997 static void
999 {
1001 {
1004 }
1005 }
1007 /* If ENABLE is true, reenable issuing warnings. */
1009 static void
1011 {
1013 {
1016 }
1017 }
1019 /* Fully fold EXPR, an expression that was not folded (beyond integer
1020 constant expressions and null pointer constants) when being built
1021 up. If IN_INIT, this is in a static initializer and certain
1022 changes are made to the folding done. Clear *MAYBE_CONST if
1023 MAYBE_CONST is not NULL and EXPR is definitely not a constant
1024 expression because it contains an evaluated operator (in C99) or an
1025 operator outside of sizeof returning an integer constant (in C90)
1026 not permitted in constant expressions, or because it contains an
1027 evaluated arithmetic overflow. (*MAYBE_CONST should typically be
1028 set to true by callers before calling this function.) Return the
1029 folded expression. Function arguments have already been folded
1030 before calling this function, as have the contents of SAVE_EXPR,
1031 TARGET_EXPR, BIND_EXPR, VA_ARG_EXPR, OBJ_TYPE_REF and
1032 C_MAYBE_CONST_EXPR. */
1034 tree
1036 {
1037 tree ret;
1043 /* This function is not relevant to C++ because C++ folds while
1044 parsing, and may need changes to be correct for C++ when C++
1045 stops folding while parsing. */
1052 {
1055 }
1062 }
1064 /* Internal helper for c_fully_fold. EXPR and IN_INIT are as for
1065 c_fully_fold. *MAYBE_CONST_OPERANDS is cleared because of operands
1066 not permitted, while *MAYBE_CONST_ITSELF is cleared because of
1067 arithmetic overflow (for C90, *MAYBE_CONST_OPERANDS is carried from
1068 both evaluated and unevaluated subexpressions while
1069 *MAYBE_CONST_ITSELF is carried from only evaluated
1070 subexpressions). */
1072 static tree
1075 {
1087 /* This function is not relevant to C++ because C++ folds while
1088 parsing, and may need changes to be correct for C++ when C++
1089 stops folding while parsing. */
1093 /* Constants, declarations, statements, errors, SAVE_EXPRs and
1094 anything else not counted as an expression cannot usefully be
1095 folded further at this point. */
1101 /* Operands of variable-length expressions (function calls) have
1102 already been folded, as have __builtin_* function calls, and such
1103 expressions cannot occur in constant expressions. */
1105 {
1109 }
1112 {
1121 else
1124 }
1126 /* Assignment, increment, decrement, function call and comma
1127 operators, and statement expressions, cannot occur in constant
1128 expressions if evaluated / outside of sizeof. (Function calls
1129 were handled above, though VA_ARG_EXPR is treated like a function
1130 call here, and statement expressions are handled through
1131 C_MAYBE_CONST_EXPR to avoid folding inside them.) */
1133 {
1153 }
1155 /* Fold individual tree codes as appropriate. */
1157 {
1159 /* Any non-constancy will have been marked in a containing
1160 C_MAYBE_CONST_EXPR; there is no more folding to do here. */
1168 maybe_const_itself);
1173 {
1176 }
1185 maybe_const_itself);
1188 maybe_const_itself);
1194 {
1198 }
1240 /* Binary operations evaluating both arguments (increment and
1241 decrement are binary internally in GCC). */
1245 maybe_const_itself);
1253 /* The RHS of a MODIFY_EXPR was fully folded when building that
1254 expression for the sake of conversion warnings. */
1257 maybe_const_itself);
1261 ret = in_init
1264 else
1277 {
1288 }
1294 CASE_CONVERT:
1304 /* Unary operations. */
1307 maybe_const_itself);
1311 /* ??? Cope with user tricks that amount to offsetof. The middle-end is
1312 not prepared to deal with them if they occur in initializers. */
1320 ret = in_init
1323 else
1328 {
1332 }
1334 {
1337 CASE_CONVERT:
1338 /* Don't warn about explicit conversions. We will already
1339 have warned about suspect implicit conversions. */
1346 }
1351 /* Binary operations not necessarily evaluating both
1352 arguments. */
1359 ? truthvalue_false_node
1367 ret = in_init
1370 else
1375 && op0_const
1376 && op0_const_self
1382 && op0_const_self
1408 else
1413 && op0_const
1414 && op0_const_self
1418 && op0_const_self
1422 && op0_const
1423 && op0_const_self
1427 && op0_const_self
1433 /* Each case where an operand with excess precision may be
1434 encountered must remove the EXCESS_PRECISION_EXPR around
1435 inner operands and possibly put one around the whole
1436 expression or possibly convert to the semantic type (which
1437 c_fully_fold does); we cannot tell at this stage which is
1438 appropriate in any particular case. */
1442 /* Various codes may appear through folding built-in functions
1443 and their arguments. */
1445 }
1447 out:
1448 /* Some folding may introduce NON_LVALUE_EXPRs; all lvalue checks
1449 have been done by this point, so remove them again. */
1453 {
1457 }
1461 }
1463 /* If not optimizing, EXP is not a VAR_DECL, or EXP has array type,
1464 return EXP. Otherwise, return either EXP or its known constant
1465 value (if it has one), but return EXP if EXP has mode BLKmode. ???
1466 Is the BLKmode test appropriate? */
1468 tree
1470 {
1471 tree ret;
1473 /* This function is only used by C, for c_fully_fold and other
1474 optimization, and may not be correct for C++. */
1485 /* Avoid unwanted tree sharing between the initializer and current
1486 function's body where the tree can be modified e.g. by the
1487 gimplifier. */
1491 }
1493 /* Print a warning if a constant expression had overflow in folding.
1494 Invoke this function on every expression that the language
1495 requires to be a constant expression.
1496 Note the ANSI C standard says it is erroneous for a
1497 constant expression to overflow. */
1499 void
1501 {
1509 }
1511 /* The same as above but print an unconditional error. */
1512 void
1514 {
1521 }
1523 /* Print a warning if an expression had overflow in folding and its
1524 operands hadn't.
1526 Invoke this function on every expression that
1527 (1) appears in the source code, and
1528 (2) is a constant expression that overflowed, and
1529 (3) is not already checked by convert_and_check;
1530 however, do not invoke this function on operands of explicit casts
1531 or when the expression is the result of an operator and any operand
1532 already overflowed. */
1534 void
1536 {
1541 {
1570 }
1571 }
1573 /* Warn about uses of logical || / && operator in a context where it
1574 is likely that the bitwise equivalent was intended by the
1575 programmer. We have seen an expression in which CODE is a binary
1576 operator used to combine expressions OP_LEFT and OP_RIGHT, which before folding
1577 had CODE_LEFT and CODE_RIGHT, into an expression of type TYPE. */
1578 void
1582 {
1594 /* Warn if &&/|| are being used in a context where it is
1595 likely that the bitwise equivalent was intended by the
1596 programmer. That is, an expression such as op && MASK
1597 where op should not be any boolean expression, nor a
1598 constant, and mask seems to be a non-boolean integer constant. */
1606 {
1610 else
1615 }
1617 /* We do not warn for constants because they are typical of macro
1618 expansions that test for features. */
1622 /* This warning only makes sense with logical operands. */
1630 /* We first test whether either side separately is trivially true
1631 (with OR) or trivially false (with AND). If so, do not warn.
1632 This is a common idiom for testing ranges of data types in
1633 portable code. */
1640 /* If this is an OR operation, invert both sides; now, the result
1641 should be always false to get a warning. */
1655 /* If this is an OR operation, invert both sides; now, the result
1656 should be always false to get a warning. */
1664 /* If both expressions have the same operand, if we can merge the
1665 ranges, and if the range test is always false, then warn. */
1672 {
1675 "logical %<or%> "
1677 else
1679 "logical %<and%> "
1681 }
1682 }
1685 /* Warn if EXP contains any computations whose results are not used.
1686 Return true if a warning is printed; false otherwise. LOCUS is the
1687 (potential) location of the expression. */
1689 bool
1691 {
1692 restart:
1696 /* Don't warn about void constructs. This includes casting to void,
1697 void function calls, and statement expressions with a final cast
1698 to void. */
1706 {
1722 /* For a binding, warn if no side effect within it. */
1734 /* In && or ||, warn if 2nd operand has no side effect. */
1741 /* Let people do `(foo (), 0)' without a warning. */
1748 /* If this is an expression with side effects, don't warn; this
1749 case commonly appears in macro expansions. */
1755 /* Don't warn about automatic dereferencing of references, since
1756 the user cannot control it. */
1758 {
1761 }
1762 /* Fall through. */
1765 /* Referencing a volatile value is a side effect, so don't warn. */
1770 /* If this is an expression which has no operands, there is no value
1771 to be unused. There are no such language-independent codes,
1772 but front ends may define such. */
1776 warn:
1778 }
1779 }
1782 /* Print a warning about casts that might indicate violation
1783 of strict aliasing rules if -Wstrict-aliasing is used and
1784 strict aliasing mode is in effect. OTYPE is the original
1785 TREE_TYPE of EXPR, and TYPE the type we're casting to. */
1787 bool
1789 {
1790 /* Strip pointer conversion chains and get to the correct original type. */
1798 /* If the type we are casting to is a ref-all pointer
1799 dereferencing it is always valid. */
1806 {
1807 /* Casting the address of an object to non void pointer. Warn
1808 if the cast breaks type based aliasing. */
1810 {
1814 }
1815 else
1816 {
1817 /* warn_strict_aliasing >= 3. This includes the default (3).
1818 Only warn if the cast is dereferenced immediately. */
1819 alias_set_type set1 =
1825 {
1829 }
1832 {
1836 }
1837 }
1838 }
1839 else
1841 {
1842 /* At this level, warn for any conversions, even if an address is
1843 not taken in the same statement. This will likely produce many
1844 false positives, but could be useful to pinpoint problems that
1845 are not revealed at higher levels. */
1850 {
1854 }
1855 }
1858 }
1860 /* Warn about memset (&a, 0, sizeof (&a)); and similar mistakes with
1861 sizeof as last operand of certain builtins. */
1863 void
1867 {
1871 location_t loc;
1879 {
1883 /* FALLTHRU */
1891 /* FALLTHRU */
1950 }
1978 {
1982 {
1985 "argument to %<sizeof%> in %qD call is the same "
1986 "expression as the destination; did you mean to "
1992 "argument to %<sizeof%> in %qD call is the same "
1993 "expression as the destination; did you mean to "
1995 else
1997 "argument to %<sizeof%> in %qD call is the same "
1998 "expression as the destination; did you mean to "
2001 }
2004 && !strop
2007 {
2009 "argument to %<sizeof%> in %qD call is the same "
2010 "pointer type %qT as the destination; expected %qT "
2014 }
2015 }
2018 {
2022 {
2025 "argument to %<sizeof%> in %qD call is the same "
2026 "expression as the source; did you mean to "
2032 "argument to %<sizeof%> in %qD call is the same "
2033 "expression as the source; did you mean to "
2035 else
2037 "argument to %<sizeof%> in %qD call is the same "
2038 "expression as the source; did you mean to "
2041 }
2044 && !strop
2047 {
2049 "argument to %<sizeof%> in %qD call is the same "
2050 "pointer type %qT as the source; expected %qT "
2054 }
2055 }
2058 {
2062 {
2065 "argument to %<sizeof%> in %qD call is the same "
2066 "expression as the first source; did you mean to "
2072 "argument to %<sizeof%> in %qD call is the same "
2073 "expression as the first source; did you mean to "
2075 else
2077 "argument to %<sizeof%> in %qD call is the same "
2078 "expression as the first source; did you mean to "
2081 }
2084 && !strop
2087 {
2089 "argument to %<sizeof%> in %qD call is the same "
2090 "pointer type %qT as the first source; expected %qT "
2094 }
2095 }
2098 {
2102 {
2105 "argument to %<sizeof%> in %qD call is the same "
2106 "expression as the second source; did you mean to "
2112 "argument to %<sizeof%> in %qD call is the same "
2113 "expression as the second source; did you mean to "
2115 else
2117 "argument to %<sizeof%> in %qD call is the same "
2118 "expression as the second source; did you mean to "
2121 }
2124 && !strop
2127 {
2129 "argument to %<sizeof%> in %qD call is the same "
2130 "pointer type %qT as the second source; expected %qT "
2134 }
2135 }
2137 }
2139 /* Warn for unlikely, improbable, or stupid DECL declarations
2140 of `main'. */
2142 void
2144 {
2145 function_args_iterator iter;
2146 tree type;
2150 {
2151 /* XXX void_type_node belies the abstraction. */
2157 {
2179 "third argument of %q+D should probably be "
2182 }
2183 }
2185 /* It is intentional that this message does not mention the third
2186 argument because it's only mentioned in an appendix of the
2187 standard. */
2191 }
2193 /* True if pointers to distinct types T1 and T2 can be converted to
2194 each other without an explicit cast. Only returns true for opaque
2195 vector types. */
2196 bool
2198 {
2205 }
2207 /* True if vector types T1 and T2 can be converted to each other
2208 without an explicit cast. If EMIT_LAX_NOTE is true, and T1 and T2
2209 can only be converted with -flax-vector-conversions yet that is not
2210 in effect, emit a note telling the user about that option if such
2211 a note has not previously been emitted. */
2212 bool
2214 {
2222 convertible_lax =
2237 {
2240 "conversions between vectors with differing "
2242 }
2245 }
2247 /* Build a VEC_PERM_EXPR if V0, V1 and MASK are not error_mark_nodes
2248 and have vector types, V0 has the same type as V1, and the number of
2249 elements of V0, V1, MASK is the same.
2251 In case V1 is a NULL_TREE it is assumed that __builtin_shuffle was
2252 called with two arguments. In this case implementation passes the
2253 first argument twice in order to share the same tree code. This fact
2254 could enable the mask-values being twice the vector length. This is
2255 an implementation accident and this semantics is not guaranteed to
2256 the user. */
2257 tree
2259 {
2260 tree ret;
2266 {
2269 }
2277 {
2281 }
2285 {
2288 }
2291 {
2295 }
2301 {
2303 "argument vector(s) and the mask vector should "
2306 }
2310 {
2314 }
2317 {
2318 /* Avoid C_MAYBE_CONST_EXPRs inside VEC_PERM_EXPR. */
2324 else
2325 {
2328 }
2332 }
2340 }
2342 /* Like tree.c:get_narrower, but retain conversion from C++0x scoped enum
2343 to integral type. */
2345 static tree
2347 {
2352 {
2353 /* C++0x scoped enumerations don't implicitly convert to integral
2354 type; if we stripped an explicit conversion to a larger type we
2355 need to replace it so common_type will still work. */
2359 }
2361 }
2363 /* This is a helper function of build_binary_op.
2365 For certain operations if both args were extended from the same
2366 smaller type, do the arithmetic in that type and then extend.
2368 BITWISE indicates a bitwise operation.
2369 For them, this optimization is safe only if
2370 both args are zero-extended or both are sign-extended.
2371 Otherwise, we might change the result.
2372 Eg, (short)-1 | (unsigned short)-1 is (int)-1
2373 but calculated in (unsigned short) it would be (unsigned short)-1.
2374 */
2375 tree
2377 {
2381 tree type;
2383 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
2384 excessive narrowing when we call get_narrower below. For
2385 example, suppose that OP0 is of unsigned int extended
2386 from signed char and that RESULT_TYPE is long long int.
2387 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
2388 like
2390 (long long int) (unsigned int) signed_char
2392 which get_narrower would narrow down to
2394 (unsigned int) signed char
2396 If we do not cast OP0 first, get_narrower would return
2397 signed_char, which is inconsistent with the case of the
2398 explicit cast. */
2405 /* UNS is 1 if the operation to be done is an unsigned one. */
2408 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
2409 but it *requires* conversion to FINAL_TYPE. */
2420 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
2422 /* For bitwise operations, signedness of nominal type
2423 does not matter. Consider only how operands were extended. */
2427 /* Note that in all three cases below we refrain from optimizing
2428 an unsigned operation on sign-extended args.
2429 That would not be valid. */
2431 /* Both args variable: if both extended in same way
2432 from same width, do it in that width.
2433 Do it unsigned if args were zero-extended. */
2440 return c_common_signed_or_unsigned_type
2447 && (type
2458 && (type
2466 }
2468 /* Checks if expression EXPR of real/integer type cannot be converted
2469 to the real/integer type TYPE. Function returns true when:
2470 * EXPR is a constant which cannot be exactly converted to TYPE
2471 * EXPR is not a constant and size of EXPR's type > than size of TYPE,
2472 for EXPR type and TYPE being both integers or both real.
2473 * EXPR is not a constant of real type and TYPE is an integer.
2474 * EXPR is not a constant of integer type which cannot be
2475 exactly converted to real type.
2476 Function allows conversions between types of different signedness and
2477 does not return true in that case. Function can produce signedness
2478 warnings if PRODUCE_WARNS is true. */
2479 bool
2481 {
2487 {
2488 /* Warn for real constant that is not an exact integer converted
2489 to integer type. */
2492 {
2495 }
2496 /* Warn for an integer constant that does not fit into integer type. */
2500 {
2503 {
2507 }
2509 {
2513 }
2514 else
2516 }
2518 {
2519 /* Warn for an integer constant that does not fit into real type. */
2521 {
2525 }
2526 /* Warn for a real constant that does not fit into a smaller
2527 real type. */
2530 {
2534 }
2535 }
2536 }
2537 else
2538 {
2539 /* Warn for real types converted to integer types. */
2546 {
2547 /* Don't warn about unsigned char y = 0xff, x = (int) y; */
2551 /* Don't warn for short y; short x = ((int)y & 0xff); */
2555 {
2556 /* If both args were extended from a shortest type,
2557 use that type if that is safe. */
2564 {
2570 /* If one of the operands is a non-negative constant
2571 that fits in the target type, then the type of the
2572 other operand does not matter. */
2581 /* If constant is unsigned and fits in the target
2582 type, then the result will also fit. */
2584 && unsigned0
2587 && unsigned1
2590 }
2591 }
2592 /* Warn for integer types converted to smaller integer types. */
2596 /* When they are the same width but different signedness,
2597 then the value may change. */
2600 /* Even when converted to a bigger type, if the type is
2601 unsigned but expr is signed, then negative values
2602 will be changed. */
2608 }
2610 /* Warn for integer types converted to real types if and only if
2611 all the range of values of the integer type cannot be
2612 represented by the real type. */
2615 {
2619 /* Don't warn about char y = 0xff; float x = (int) y; */
2631 }
2633 /* Warn for real types converted to smaller real types. */
2638 }
2641 }
2643 /* Warns if the conversion of EXPR to TYPE may alter a value.
2644 This is a helper function for warnings_for_convert_and_check. */
2646 static void
2648 {
2656 {
2669 /* Conversion from boolean to a signed:1 bit-field (which only
2670 can hold the values 0 and -1) doesn't lose information - but
2671 it does change the value. */
2686 {
2687 /* In case of COND_EXPR, we do not care about the type of
2688 COND_EXPR, only about the conversion of each operand. */
2695 }
2702 }
2703 }
2705 /* Produce warnings after a conversion. RESULT is the result of
2706 converting EXPR to TYPE. This is a helper function for
2707 convert_and_check and cp_convert_and_check. */
2709 void
2711 {
2718 {
2719 /* Do not diagnose overflow in a constant expression merely
2720 because a conversion overflowed. */
2725 {
2726 /* This detects cases like converting -129 or 256 to
2727 unsigned char. */
2731 else
2733 }
2737 /* No warning for converting 0x80000000 to int. */
2745 else
2747 }
2752 else
2754 }
2757 /* Convert EXPR to TYPE, warning about conversion problems with constants.
2758 Invoke this function on every expression that is converted implicitly,
2759 i.e. because of language rules and not because of an explicit cast. */
2761 tree
2763 {
2764 tree result;
2765 tree expr_for_warning;
2767 /* Convert from a value with possible excess precision rather than
2768 via the semantic type, but do not warn about values not fitting
2769 exactly in the semantic type. */
2771 {
2777 }
2778 else
2792 }
2793 \f
2794 /* A node in a list that describes references to variables (EXPR), which are
2795 either read accesses if WRITER is zero, or write accesses, in which case
2796 WRITER is the parent of EXPR. */
2797 struct tlist
2798 {
2801 };
2803 /* Used to implement a cache the results of a call to verify_tree. We only
2804 use this for SAVE_EXPRs. */
2805 struct tlist_cache
2806 {
2810 tree expr;
2811 };
2813 /* Obstack to use when allocating tlist structures, and corresponding
2814 firstobj. */
2818 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
2819 warnings. */
2821 /* SAVE_EXPRs need special treatment. We process them only once and then
2822 cache the results. */
2834 /* Create a new struct tlist and fill in its fields. */
2837 {
2844 }
2846 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
2847 is nonnull, we ignore any node we find which has a writer equal to it. */
2849 static void
2851 {
2853 {
2860 }
2861 }
2863 /* Merge the nodes of ADD into TO. This merging process is done so that for
2864 each variable that already exists in TO, no new node is added; however if
2865 there is a write access recorded in ADD, and an occurrence on TO is only
2866 a read access, then the occurrence in TO will be modified to record the
2867 write. */
2869 static void
2871 {
2878 {
2885 {
2889 }
2891 {
2895 }
2897 }
2898 }
2900 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
2901 references in list LIST conflict with it, excluding reads if ONLY writers
2902 is nonzero. */
2904 static void
2907 {
2910 /* Avoid duplicate warnings. */
2916 {
2920 {
2925 }
2927 }
2928 }
2930 /* Given a list LIST of references to variables, find whether any of these
2931 can cause conflicts due to missing sequence points. */
2933 static void
2935 {
2939 {
2942 }
2943 }
2945 /* Return nonzero if X is a tree that can be verified by the sequence point
2946 warnings. */
2947 static int
2949 {
2956 /* VOID_TYPE_P (TREE_TYPE (x)) is workaround for cp/tree.c
2957 (lvalue_p) crash on TRY/CATCH. */
2964 /* No point to track non-const calls, they will never satisfy
2965 operand_equal_p. */
2973 }
2975 /* Return nonzero if X and Y appear to be the same candidate (or NULL) */
2976 static bool
2978 {
2980 }
2982 /* Walk the tree X, and record accesses to variables. If X is written by the
2983 parent tree, WRITER is the parent.
2984 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
2985 expression or its only operand forces a sequence point, then everything up
2986 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
2987 in PNO_SP.
2988 Once we return, we will have emitted warnings if any subexpression before
2989 such a sequence point could be undefined. On a higher level, however, the
2990 sequence point may not be relevant, and we'll merge the two lists.
2992 Example: (b++, a) + b;
2993 The call that processes the COMPOUND_EXPR will store the increment of B
2994 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
2995 processes the PLUS_EXPR will need to merge the two lists so that
2996 eventually, all accesses end up on the same list (and we'll warn about the
2997 unordered subexpressions b++ and b.
2999 A note on merging. If we modify the former example so that our expression
3000 becomes
3001 (b++, b) + a
3002 care must be taken not simply to add all three expressions into the final
3003 PNO_SP list. The function merge_tlist takes care of that by merging the
3004 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
3005 way, so that no more than one access to B is recorded. */
3007 static void
3009 tree writer)
3010 {
3015 /* X may be NULL if it is the operand of an empty statement expression
3016 ({ }). */
3020 restart:
3028 {
3060 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
3061 two first, to avoid warning for (a ? b++ : b++). */
3077 /* Expressions inside the LHS are not ordered wrt. the sequence points
3078 in the RHS. Example:
3079 *a = (a++, 2)
3080 Despite the fact that the modification of "a" is in the before_sp
3081 list (tmp_before), it conflicts with the use of "a" in the LHS.
3082 We can handle this by adding the contents of tmp_list3
3083 to those of tmp_before, and redoing the collision warnings for that
3084 list. */
3087 /* Exclude the LHS itself here; we first have to merge it into the
3088 tmp_nosp list. This is done to avoid warning for "a = a"; if we
3089 didn't exclude the LHS, we'd get it twice, once as a read and once
3090 as a write. */
3101 /* We need to warn about conflicts among arguments and conflicts between
3102 args and the function address. Side effects of the function address,
3103 however, are not ordered by the sequence point of the call. */
3104 {
3105 call_expr_arg_iterator iter;
3106 tree arg;
3110 {
3115 }
3120 }
3123 /* Scan all the list, e.g. indices of multi dimensional array. */
3125 {
3131 }
3135 {
3142 {
3154 {
3158 }
3161 }
3165 }
3175 /* For other expressions, simply recurse on their operands.
3176 Manual tail recursion for unary expressions.
3177 Other non-expressions need not be processed. */
3179 {
3183 }
3185 {
3189 {
3194 }
3195 }
3197 }
3198 }
3200 /* Try to warn for undefined behavior in EXPR due to missing sequence
3201 points. */
3203 DEBUG_FUNCTION void
3205 {
3211 {
3214 }
3219 }
3220 \f
3221 /* Validate the expression after `case' and apply default promotions. */
3223 static tree
3225 {
3230 /* Promote char or short to int. */
3233 {
3236 }
3241 }
3242 \f
3243 /* See if the case values LOW and HIGH are in the range of the original
3244 type (i.e. before the default conversion to int) of the switch testing
3245 expression.
3246 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
3247 the type before promoting it. CASE_LOW_P is a pointer to the lower
3248 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
3249 if the case is not a case range.
3250 The caller has to make sure that we are not called with NULL for
3251 CASE_LOW_P (i.e. the default case).
3252 Returns true if the case label is in range of ORIG_TYPE (saturated or
3253 untouched) or false if the label is out of range. */
3255 static bool
3258 {
3263 /* If there was a problem with the original type, do nothing. */
3270 /* Case label is less than minimum for type. */
3273 {
3276 }
3278 /* Case value is greater than maximum for type. */
3281 {
3284 }
3286 /* Saturate lower case label value to minimum. */
3289 {
3293 }
3295 /* Saturate upper case label value to maximum. */
3298 {
3302 }
3310 }
3311 \f
3312 /* Return an integer type with BITS bits of precision,
3313 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
3315 tree
3317 {
3356 }
3358 /* Return a fixed-point type that has at least IBIT ibits and FBIT fbits
3359 that is unsigned if UNSIGNEDP is nonzero, otherwise signed;
3360 and saturating if SATP is nonzero, otherwise not saturating. */
3362 tree
3365 {
3369 else
3377 {
3379 "fixed-point types that have too many integral and "
3382 }
3385 }
3387 /* Used for communication between c_common_type_for_mode and
3388 c_register_builtin_type. */
3391 /* Return a data type that has machine mode MODE.
3392 If the mode is an integer,
3393 then UNSIGNEDP selects between signed and unsigned types.
3394 If the mode is a fixed-point mode,
3395 then UNSIGNEDP selects between saturating and nonsaturating types. */
3397 tree
3399 {
3400 tree t;
3437 #if HOST_BITS_PER_WIDE_INT >= 64
3440 #endif
3465 {
3467 tree inner_type;
3483 }
3485 {
3490 }
3500 {
3586 }
3594 }
3596 tree
3598 {
3600 }
3602 /* Return a signed type the same as TYPE in other respects. */
3604 tree
3606 {
3608 }
3610 /* Return a type the same as TYPE except unsigned or
3611 signed according to UNSIGNEDP. */
3613 tree
3615 {
3616 tree type1;
3618 /* This block of code emulates the behavior of the old
3619 c_common_unsigned_type. In particular, it returns
3620 long_unsigned_type_node if passed a long, even when a int would
3621 have the same size. This is necessary for warnings to work
3622 correctly in archs where sizeof(int) == sizeof(long) */
3625 if (type1 == signed_char_type_node || type1 == char_type_node || type1 == unsigned_char_type_node)
3641 #if HOST_BITS_PER_WIDE_INT >= 64
3644 #endif
3654 #define C_COMMON_FIXED_TYPES(NAME) \
3655 if (type1 == short_ ## NAME ## _type_node \
3656 || type1 == unsigned_short_ ## NAME ## _type_node) \
3657 return unsignedp ? unsigned_short_ ## NAME ## _type_node \
3658 : short_ ## NAME ## _type_node; \
3659 if (type1 == NAME ## _type_node \
3660 || type1 == unsigned_ ## NAME ## _type_node) \
3661 return unsignedp ? unsigned_ ## NAME ## _type_node \
3662 : NAME ## _type_node; \
3663 if (type1 == long_ ## NAME ## _type_node \
3664 || type1 == unsigned_long_ ## NAME ## _type_node) \
3665 return unsignedp ? unsigned_long_ ## NAME ## _type_node \
3666 : long_ ## NAME ## _type_node; \
3667 if (type1 == long_long_ ## NAME ## _type_node \
3668 || type1 == unsigned_long_long_ ## NAME ## _type_node) \
3669 return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \
3670 : long_long_ ## NAME ## _type_node;
3672 #define C_COMMON_FIXED_MODE_TYPES(NAME) \
3673 if (type1 == NAME ## _type_node \
3674 || type1 == u ## NAME ## _type_node) \
3675 return unsignedp ? u ## NAME ## _type_node \
3676 : NAME ## _type_node;
3678 #define C_COMMON_FIXED_TYPES_SAT(NAME) \
3679 if (type1 == sat_ ## short_ ## NAME ## _type_node \
3680 || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \
3681 return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \
3682 : sat_ ## short_ ## NAME ## _type_node; \
3683 if (type1 == sat_ ## NAME ## _type_node \
3684 || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \
3685 return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \
3686 : sat_ ## NAME ## _type_node; \
3687 if (type1 == sat_ ## long_ ## NAME ## _type_node \
3688 || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \
3689 return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \
3690 : sat_ ## long_ ## NAME ## _type_node; \
3691 if (type1 == sat_ ## long_long_ ## NAME ## _type_node \
3692 || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \
3693 return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \
3694 : sat_ ## long_long_ ## NAME ## _type_node;
3696 #define C_COMMON_FIXED_MODE_TYPES_SAT(NAME) \
3697 if (type1 == sat_ ## NAME ## _type_node \
3698 || type1 == sat_ ## u ## NAME ## _type_node) \
3699 return unsignedp ? sat_ ## u ## NAME ## _type_node \
3700 : sat_ ## NAME ## _type_node;
3726 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
3727 the precision; they have precision set to match their range, but
3728 may use a wider mode to match an ABI. If we change modes, we may
3729 wind up with bad conversions. For INTEGER_TYPEs in C, must check
3730 the precision as well, so as to yield correct results for
3731 bit-field types. C++ does not have these separate bit-field
3732 types, and producing a signed or unsigned variant of an
3733 ENUMERAL_TYPE may cause other problems as well. */
3739 #define TYPE_OK(node) \
3740 (TYPE_MODE (type) == TYPE_MODE (node) \
3741 && TYPE_PRECISION (type) == TYPE_PRECISION (node))
3760 #if HOST_BITS_PER_WIDE_INT >= 64
3763 #endif
3772 #undef TYPE_OK
3775 }
3777 /* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */
3779 tree
3781 {
3782 /* Extended integer types of the same width as a standard type have
3783 lesser rank, so those of the same width as int promote to int or
3784 unsigned int and are valid for printf formats expecting int or
3785 unsigned int. To avoid such special cases, avoid creating
3786 extended integer types for bit-fields if a standard integer type
3787 is available. */
3804 }
3806 /* The C version of the register_builtin_type langhook. */
3808 void
3810 {
3811 tree decl;
3821 }
3822 \f
3823 /* Print an error message for invalid operands to arith operation
3824 CODE with TYPE0 for operand 0, and TYPE1 for operand 1.
3825 LOCATION is the location of the message. */
3827 void
3830 {
3834 {
3879 }
3883 }
3884 \f
3885 /* Given an expression as a tree, return its original type. Do this
3886 by stripping any conversion that preserves the sign and precision. */
3887 static tree
3889 {
3892 }
3894 /* Subroutine of build_binary_op, used for comparison operations.
3895 See if the operands have both been converted from subword integer types
3896 and, if so, perhaps change them both back to their original type.
3897 This function is also responsible for converting the two operands
3898 to the proper common type for comparison.
3900 The arguments of this function are all pointers to local variables
3901 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
3902 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
3904 If this function returns nonzero, it means that the comparison has
3905 a constant value. What this function returns is an expression for
3906 that value. */
3908 tree
3911 {
3912 tree type;
3921 /* Throw away any conversions to wider types
3922 already present in the operands. */
3927 /* If primopN is first sign-extended from primopN's precision to opN's
3928 precision, then zero-extended from opN's precision to
3929 *restype_ptr precision, shortenings might be invalid. */
3932 && !unsignedp0
3937 && !unsignedp1
3941 /* Handle the case that OP0 does not *contain* a conversion
3942 but it *requires* conversion to FINAL_TYPE. */
3949 /* If one of the operands must be floated, we cannot optimize. */
3953 /* If first arg is constant, swap the args (changing operation
3954 so value is preserved), for canonicalization. Don't do this if
3955 the second arg is 0. */
3960 {
3977 {
3992 }
3994 }
3996 /* If comparing an integer against a constant more bits wide,
3997 maybe we can deduce a value of 1 or 0 independent of the data.
3998 Or else truncate the constant now
3999 rather than extend the variable at run time.
4001 This is only interesting if the constant is the wider arg.
4002 Also, it is not safe if the constant is unsigned and the
4003 variable arg is signed, since in this case the variable
4004 would be sign-extended and then regarded as unsigned.
4005 Our technique fails in this case because the lowest/highest
4006 possible unsigned results don't follow naturally from the
4007 lowest/highest possible values of the variable operand.
4008 For just EQ_EXPR and NE_EXPR there is another technique that
4009 could be used: see if the constant can be faithfully represented
4010 in the other operand's type, by truncating it and reextending it
4011 and see if that preserves the constant's value. */
4017 {
4020 /* 1 if comparison is nominally unsigned. */
4022 tree val;
4034 {
4035 /* Convert primop1 to target type, but do not introduce
4036 additional overflow. We know primop1 is an int_cst. */
4040 }
4042 {
4045 }
4048 {
4053 }
4054 else
4055 {
4060 }
4063 /* This used to be a switch, but Genix compiler can't handle that. */
4065 {
4068 }
4070 {
4073 }
4075 {
4080 }
4082 {
4087 }
4089 {
4094 }
4096 {
4101 }
4103 /* If primop0 was sign-extended and unsigned comparison specd,
4104 we did a signed comparison above using the signed type bounds.
4105 But the comparison we output must be unsigned.
4107 Also, for inequalities, VAL is no good; but if the signed
4108 comparison had *any* fixed result, it follows that the
4109 unsigned comparison just tests the sign in reverse
4110 (positive values are LE, negative ones GE).
4111 So we can generate an unsigned comparison
4112 against an extreme value of the signed type. */
4115 {
4118 {
4133 }
4135 }
4139 {
4146 }
4149 {
4150 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4154 }
4156 /* Value is not predetermined, but do the comparison
4157 in the type of the operand that is not constant.
4158 TYPE is already properly set. */
4159 }
4161 /* If either arg is decimal float and the other is float, find the
4162 proper common type to use for comparison. */
4173 /* If args' natural types are both narrower than nominal type
4174 and both extend in the same manner, compare them
4175 in the type of the wider arg.
4176 Otherwise must actually extend both to the nominal
4177 common type lest different ways of extending
4178 alter the result.
4179 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
4184 {
4188 type);
4189 /* Make sure shorter operand is extended the right way
4190 to match the longer operand. */
4191 primop0
4194 primop0);
4195 primop1
4198 primop1);
4199 }
4200 else
4201 {
4202 /* Here we must do the comparison on the nominal type
4203 using the args exactly as we received them. */
4210 {
4212 /* All unsigned values are >= 0, so we warn. However,
4213 if OP0 is a constant that is >= 0, the signedness of
4214 the comparison isn't an issue, so suppress the
4215 warning. */
4217 warn_type_limits && !in_system_header
4221 primop0)))
4222 /* Do not warn for enumeration types. */
4226 {
4243 }
4246 {
4247 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4252 }
4253 }
4254 }
4262 }
4263 \f
4264 /* Return a tree for the sum or difference (RESULTCODE says which)
4265 of pointer PTROP and integer INTOP. */
4267 tree
4270 {
4273 /* The result is a pointer of the same type that is being added. */
4277 {
4281 }
4283 {
4287 }
4289 {
4293 }
4294 else
4297 /* We are manipulating pointer values, so we don't need to warn
4298 about relying on undefined signed overflow. We disable the
4299 warning here because we use integer types so fold won't know that
4300 they are really pointers. */
4303 /* If what we are about to multiply by the size of the elements
4304 contains a constant term, apply distributive law
4305 and multiply that constant term separately.
4306 This helps produce common subexpressions. */
4311 /* If the constant comes from pointer subtraction,
4312 skip this optimization--it would cause an error. */
4314 /* If the constant is unsigned, and smaller than the pointer size,
4315 then we must skip this optimization. This is because it could cause
4316 an overflow error if the constant is negative but INTOP is not. */
4320 {
4325 /* Convert both subexpression types to the type of intop,
4326 because weird cases involving pointer arithmetic
4327 can result in a sum or difference with different type args. */
4332 }
4334 /* Convert the integer argument to a type the same size as sizetype
4335 so the multiply won't overflow spuriously. */
4341 /* Replace the integer argument with a suitable product by the object size.
4342 Do this multiplication as signed, then convert to the appropriate type
4343 for the pointer operation and disregard an overflow that occurred only
4344 because of the sign-extension change in the latter conversion. */
4345 {
4353 }
4355 /* Create the sum or difference. */
4364 }
4365 \f
4366 /* Wrap a C_MAYBE_CONST_EXPR around an expression that is fully folded
4367 and if NON_CONST is known not to be permitted in an evaluated part
4368 of a constant expression. */
4370 tree
4372 {
4376 /* This should never be called for C++. */
4380 /* The result of folding may have a NOP_EXPR to set TREE_NO_WARNING. */
4389 }
4391 /* Wrap a SAVE_EXPR around EXPR, if appropriate. Like save_expr, but
4392 for C folds the inside expression and wraps a C_MAYBE_CONST_EXPR
4393 around the SAVE_EXPR if needed so that c_fully_fold does not need
4394 to look inside SAVE_EXPRs. */
4396 tree
4398 {
4407 }
4409 /* Return whether EXPR is a declaration whose address can never be
4410 NULL. */
4412 bool
4414 {
4419 }
4421 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
4422 or for an `if' or `while' statement or ?..: exp. It should already
4423 have been validated to be of suitable type; otherwise, a bad
4424 diagnostic may result.
4426 The EXPR is located at LOCATION.
4428 This preparation consists of taking the ordinary
4429 representation of an expression expr and producing a valid tree
4430 boolean expression describing whether expr is nonzero. We could
4431 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
4432 but we optimize comparisons, &&, ||, and !.
4434 The resulting type should always be `truthvalue_type_node'. */
4436 tree
4438 {
4440 {
4482 ? truthvalue_true_node
4488 ? truthvalue_true_node
4493 /* Fall through. */
4496 {
4499 {
4500 /* Common Ada/Pascal programmer's mistake. */
4502 OPT_Waddress,
4504 inner);
4506 }
4508 }
4525 /* These don't change whether an object is nonzero or zero. */
4530 /* These don't change whether an object is zero or nonzero, but
4531 we can't ignore them if their second arg has side-effects. */
4533 {
4536 c_common_truthvalue_conversion
4539 }
4540 else
4545 /* Distribute the conversion into the arms of a COND_EXPR. */
4547 {
4550 /* In C++ one of the arms might have void type if it is throw. */
4558 }
4559 else
4560 {
4561 /* Folding will happen later for C. */
4569 }
4571 CASE_CONVERT:
4572 {
4576 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
4577 since that affects how `default_conversion' will behave. */
4581 /* Don't strip a conversion from C++0x scoped enum, since they
4582 don't implicitly convert to other types. */
4586 /* If this isn't narrowing the argument, we can ignore it. */
4590 }
4596 {
4600 }
4605 }
4608 {
4610 expr = (build_binary_op
4614 c_common_truthvalue_conversion
4617 c_common_truthvalue_conversion
4622 }
4625 {
4630 }
4631 else
4634 ret:
4637 }
4638 \f
4647 /* Apply the TYPE_QUALS to the new DECL. */
4649 void
4651 {
4659 /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr
4660 constructor can produce constant init, so rely on cp_finish_decl to
4661 clear TREE_READONLY if the variable has non-constant init. */
4664 {
4667 }
4669 {
4671 /* Allow 'restrict' on arrays of pointers.
4672 FIXME currently we just ignore it. */
4678 }
4679 }
4681 /* Hash function for the problem of multiple type definitions in
4682 different files. This must hash all types that will compare
4683 equal via comptypes to the same value. In practice it hashes
4684 on some of the simple stuff and leaves the details to comptypes. */
4686 static hashval_t
4688 {
4692 tree t2;
4694 {
4695 /* For pointers, hash on pointee type plus some swizzling. */
4698 /* Hash on number of elements and total size. */
4717 }
4718 /* FIXME: We want to use a DECL_CHAIN iteration method here, but
4719 TYPE_VALUES of ENUMERAL_TYPEs is stored as a TREE_LIST. */
4721 /* We might have a VLA here. */
4724 else
4727 }
4731 /* Return the typed-based alias set for T, which may be an expression
4732 or a type. Return -1 if we don't do anything special. */
4734 alias_set_type
4736 {
4737 tree u;
4740 /* For VLAs, use the alias set of the element type rather than the
4741 default of alias set 0 for types compared structurally. */
4743 {
4747 }
4749 /* Permit type-punning when accessing a union, provided the access
4750 is directly through the union. For example, this code does not
4751 permit taking the address of a union member and then storing
4752 through it. Even the type-punning allowed here is a GCC
4753 extension, albeit a common and useful one; the C standard says
4754 that such accesses have implementation-defined behavior. */
4762 /* That's all the expressions we handle specially. */
4766 /* The C standard guarantees that any object may be accessed via an
4767 lvalue that has character type. */
4773 /* The C standard specifically allows aliasing between signed and
4774 unsigned variants of the same type. We treat the signed
4775 variant as canonical. */
4777 {
4780 /* t1 == t can happen for boolean nodes which are always unsigned. */
4783 }
4785 /* Handle the case of multiple type nodes referring to "the same" type,
4786 which occurs with IMA. These share an alias set. FIXME: Currently only
4787 C90 is handled. (In C99 type compatibility is not transitive, which
4788 complicates things mightily. The alias set splay trees can theoretically
4789 represent this, but insertion is tricky when you consider all the
4790 different orders things might arrive in.) */
4795 /* Save time if there's only one input file. */
4799 /* Pointers need special handling if they point to any type that
4800 needs special handling (below). */
4802 {
4803 tree t2;
4804 /* Find bottom type under any nested POINTERs. */
4808 ;
4816 }
4817 /* These are the only cases that need special handling. */
4824 /* Undefined? */
4828 /* Look up t in hash table. Only one of the compatible types within each
4829 alias set is recorded in the table. */
4833 NULL);
4836 {
4839 }
4840 else
4841 /* Our caller will assign and record (in t) a new alias set; all we need
4842 to do is remember t in the hash table. */
4846 }
4847 \f
4848 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where
4849 the second parameter indicates which OPERATOR is being applied.
4850 The COMPLAIN flag controls whether we should diagnose possibly
4851 ill-formed constructs or not. LOC is the location of the SIZEOF or
4852 TYPEOF operator. */
4854 tree
4857 {
4865 {
4867 {
4874 }
4875 else
4876 {
4878 {
4882 else
4885 }
4887 }
4888 }
4890 {
4898 }
4901 {
4906 }
4909 {
4914 }
4915 else
4916 {
4918 /* Convert in case a char is more than one unit. */
4922 else
4924 }
4926 /* VALUE will have the middle-end integer type sizetype.
4927 However, we should really return a value of type `size_t',
4928 which is just a typedef for an ordinary integer type. */
4932 }
4934 /* Implement the __alignof keyword: Return the minimum required
4935 alignment of EXPR, measured in bytes. For VAR_DECLs,
4936 FUNCTION_DECLs and FIELD_DECLs return DECL_ALIGN (which can be set
4937 from an "aligned" __attribute__ specification). LOC is the
4938 location of the ALIGNOF operator. */
4940 tree
4942 {
4943 tree t;
4950 {
4953 }
4959 {
4966 {
4973 }
4975 }
4976 else
4980 }
4981 \f
4982 /* Handle C and C++ default attributes. */
4984 enum built_in_attribute
4985 {
4986 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
4987 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
4988 #define DEF_ATTR_STRING(ENUM, VALUE) ENUM,
4989 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
4990 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
4992 #undef DEF_ATTR_NULL_TREE
4993 #undef DEF_ATTR_INT
4994 #undef DEF_ATTR_STRING
4995 #undef DEF_ATTR_IDENT
4996 #undef DEF_ATTR_TREE_LIST
4997 ATTR_LAST
4998 };
5004 enum c_builtin_type
5005 {
5006 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
5007 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
5008 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
5009 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
5010 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5011 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5012 #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
5013 #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6) NAME,
5014 #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7) NAME,
5015 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
5016 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
5017 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
5018 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5019 #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5020 #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG6) \
5021 NAME,
5022 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
5024 #undef DEF_PRIMITIVE_TYPE
5025 #undef DEF_FUNCTION_TYPE_0
5026 #undef DEF_FUNCTION_TYPE_1
5027 #undef DEF_FUNCTION_TYPE_2
5028 #undef DEF_FUNCTION_TYPE_3
5029 #undef DEF_FUNCTION_TYPE_4
5030 #undef DEF_FUNCTION_TYPE_5
5031 #undef DEF_FUNCTION_TYPE_6
5032 #undef DEF_FUNCTION_TYPE_7
5033 #undef DEF_FUNCTION_TYPE_VAR_0
5034 #undef DEF_FUNCTION_TYPE_VAR_1
5035 #undef DEF_FUNCTION_TYPE_VAR_2
5036 #undef DEF_FUNCTION_TYPE_VAR_3
5037 #undef DEF_FUNCTION_TYPE_VAR_4
5038 #undef DEF_FUNCTION_TYPE_VAR_5
5039 #undef DEF_POINTER_TYPE
5040 BT_LAST
5041 };
5045 /* A temporary array for c_common_nodes_and_builtins. Used in
5046 communication with def_fn_type. */
5049 /* A helper function for c_common_nodes_and_builtins. Build function type
5050 for DEF with return type RET and N arguments. If VAR is true, then the
5051 function should be variadic after those N arguments.
5053 Takes special care not to ICE if any of the types involved are
5054 error_mark_node, which indicates that said type is not in fact available
5055 (see builtin_type_for_size). In which case the function type as a whole
5056 should be error_mark_node. */
5058 static void
5060 {
5061 tree t;
5068 {
5074 }
5081 else
5084 egress:
5087 }
5089 /* Build builtin functions common to both C and C++ language
5090 frontends. */
5092 static void
5094 {
5095 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
5096 builtin_types[ENUM] = VALUE;
5097 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
5098 def_fn_type (ENUM, RETURN, 0, 0);
5099 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
5100 def_fn_type (ENUM, RETURN, 0, 1, ARG1);
5101 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
5102 def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
5103 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5104 def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
5105 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5106 def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
5107 #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5108 def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5109 #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5110 ARG6) \
5111 def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
5112 #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5113 ARG6, ARG7) \
5114 def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
5115 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
5116 def_fn_type (ENUM, RETURN, 1, 0);
5117 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
5118 def_fn_type (ENUM, RETURN, 1, 1, ARG1);
5119 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
5120 def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
5121 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5122 def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
5123 #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5124 def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
5125 #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5126 def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5127 #define DEF_POINTER_TYPE(ENUM, TYPE) \
5128 builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
5132 #undef DEF_PRIMITIVE_TYPE
5133 #undef DEF_FUNCTION_TYPE_1
5134 #undef DEF_FUNCTION_TYPE_2
5135 #undef DEF_FUNCTION_TYPE_3
5136 #undef DEF_FUNCTION_TYPE_4
5137 #undef DEF_FUNCTION_TYPE_5
5138 #undef DEF_FUNCTION_TYPE_6
5139 #undef DEF_FUNCTION_TYPE_VAR_0
5140 #undef DEF_FUNCTION_TYPE_VAR_1
5141 #undef DEF_FUNCTION_TYPE_VAR_2
5142 #undef DEF_FUNCTION_TYPE_VAR_3
5143 #undef DEF_FUNCTION_TYPE_VAR_4
5144 #undef DEF_FUNCTION_TYPE_VAR_5
5145 #undef DEF_POINTER_TYPE
5150 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
5151 NONANSI_P, ATTRS, IMPLICIT, COND) \
5152 if (NAME && COND) \
5153 def_builtin_1 (ENUM, NAME, CLASS, \
5154 builtin_types[(int) TYPE], \
5155 builtin_types[(int) LIBTYPE], \
5156 BOTH_P, FALLBACK_P, NONANSI_P, \
5157 built_in_attributes[(int) ATTRS], IMPLICIT);
5159 #undef DEF_BUILTIN
5167 }
5169 /* Like get_identifier, but avoid warnings about null arguments when
5170 the argument may be NULL for targets where GCC lacks stdint.h type
5171 information. */
5175 {
5177 }
5179 /* Build tree nodes and builtin functions common to both C and C++ language
5180 frontends. */
5182 void
5184 {
5188 tree array_domain_type;
5189 tree va_list_ref_type_node;
5190 tree va_list_arg_type_node;
5194 /* Define `int' and `char' first so that dbx will output them first. */
5198 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
5199 "unsigned long", "long long unsigned" and "unsigned short" were in C++
5200 but not C. Are the conditionals here needed? */
5206 long_unsigned_type_node);
5208 {
5210 int128_integer_type_node);
5212 int128_unsigned_type_node);
5213 }
5217 long_long_integer_type_node);
5219 long_long_unsigned_type_node);
5222 long_long_unsigned_type_node);
5225 short_unsigned_type_node);
5228 short_unsigned_type_node);
5230 /* Define both `signed char' and `unsigned char'. */
5234 /* These are types that c_common_type_for_size and
5235 c_common_type_for_mode use. */
5238 intQI_type_node));
5241 intHI_type_node));
5244 intSI_type_node));
5247 intDI_type_node));
5248 #if HOST_BITS_PER_WIDE_INT >= 64
5251 TYPE_DECL,
5253 intTI_type_node));
5254 #endif
5257 unsigned_intQI_type_node));
5260 unsigned_intHI_type_node));
5263 unsigned_intSI_type_node));
5266 unsigned_intDI_type_node));
5267 #if HOST_BITS_PER_WIDE_INT >= 64
5270 TYPE_DECL,
5272 unsigned_intTI_type_node));
5273 #endif
5275 /* Create the widest literal types. */
5276 widest_integer_literal_type_node
5280 widest_integer_literal_type_node));
5282 widest_unsigned_literal_type_node
5286 widest_unsigned_literal_type_node));
5290 pid_type_node =
5297 /* Only supported decimal floating point extension if the target
5298 actually supports underlying modes. */
5302 {
5306 }
5309 {
5314 long_long_fract_type_node);
5316 unsigned_short_fract_type_node);
5318 unsigned_fract_type_node);
5320 unsigned_long_fract_type_node);
5322 unsigned_long_long_fract_type_node);
5324 sat_short_fract_type_node);
5327 sat_long_fract_type_node);
5329 sat_long_long_fract_type_node);
5331 sat_unsigned_short_fract_type_node);
5333 sat_unsigned_fract_type_node);
5335 sat_unsigned_long_fract_type_node);
5337 sat_unsigned_long_long_fract_type_node);
5342 long_long_accum_type_node);
5344 unsigned_short_accum_type_node);
5346 unsigned_accum_type_node);
5348 unsigned_long_accum_type_node);
5350 unsigned_long_long_accum_type_node);
5352 sat_short_accum_type_node);
5355 sat_long_accum_type_node);
5357 sat_long_long_accum_type_node);
5359 sat_unsigned_short_accum_type_node);
5361 sat_unsigned_accum_type_node);
5363 sat_unsigned_long_accum_type_node);
5365 sat_unsigned_long_long_accum_type_node);
5367 }
5370 TYPE_DECL,
5372 complex_integer_type_node));
5374 TYPE_DECL,
5376 complex_float_type_node));
5378 TYPE_DECL,
5380 complex_double_type_node));
5384 complex_long_double_type_node));
5387 /* For C++, make fileptr_type_node a distinct void * type until
5388 FILE type is defined. */
5393 /* Set the TYPE_NAME for any variants that were built before
5394 record_builtin_type gave names to the built-in types. */
5395 {
5401 }
5403 /* This node must not be shared. */
5409 /* Make a type to be the domain of a few array types
5410 whose domains don't really matter.
5411 200 is small enough that it always fits in size_t
5412 and large enough that it can hold most function names for the
5413 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
5416 /* Make a type for arrays of characters.
5417 With luck nothing will ever really depend on the length of this
5418 array type. */
5419 char_array_type_node
5422 /* Likewise for arrays of ints. */
5423 int_array_type_node
5427 const_string_type_node
5431 /* This is special for C++ so functions can be overloaded. */
5437 {
5440 else
5443 }
5445 /* This is for wide string constants. */
5446 wchar_array_type_node
5449 /* Define 'char16_t'. */
5454 {
5459 }
5461 /* This is for UTF-16 string constants. */
5462 char16_array_type_node
5465 /* Define 'char32_t'. */
5470 {
5475 }
5477 /* This is for UTF-32 string constants. */
5478 char32_array_type_node
5481 wint_type_node =
5484 intmax_type_node =
5486 uintmax_type_node =
5490 sig_atomic_type_node =
5493 int8_type_node =
5496 int16_type_node =
5499 int32_type_node =
5502 int64_type_node =
5505 uint8_type_node =
5508 c_uint16_type_node =
5511 c_uint32_type_node =
5514 c_uint64_type_node =
5517 int_least8_type_node =
5520 int_least16_type_node =
5523 int_least32_type_node =
5526 int_least64_type_node =
5529 uint_least8_type_node =
5532 uint_least16_type_node =
5535 uint_least32_type_node =
5538 uint_least64_type_node =
5541 int_fast8_type_node =
5544 int_fast16_type_node =
5547 int_fast32_type_node =
5550 int_fast64_type_node =
5553 uint_fast8_type_node =
5556 uint_fast16_type_node =
5559 uint_fast32_type_node =
5562 uint_fast64_type_node =
5565 intptr_type_node =
5568 uintptr_type_node =
5571 default_function_type
5573 ptrdiff_type_node
5580 va_list_type_node));
5582 {
5585 tree ptype;
5588 {
5592 ptype));
5594 }
5595 }
5598 {
5601 }
5602 else
5603 {
5606 }
5613 /* Create the built-in __null node. It is important that this is
5614 not shared. */
5618 /* Since builtin_types isn't gc'ed, don't export these nodes. */
5620 }
5622 /* The number of named compound-literals generated thus far. */
5625 /* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */
5627 void
5629 {
5632 compound_literal_number);
5633 compound_literal_number++;
5635 }
5637 tree
5639 {
5643 }
5646 /* Linked list of disabled built-in functions. */
5649 {
5657 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
5658 begins with "__builtin_", give an error. */
5660 void
5662 {
5665 else
5666 {
5671 }
5672 }
5675 /* Return true if the built-in function NAME has been disabled, false
5676 otherwise. */
5678 static bool
5680 {
5683 {
5686 }
5688 }
5691 /* Worker for DEF_BUILTIN.
5692 Possibly define a builtin function with one or two names.
5693 Does not declare a non-__builtin_ function if flag_no_builtin, or if
5694 nonansi_p and flag_no_nonansi_builtin. */
5696 static void
5703 {
5704 tree decl;
5717 fnattrs);
5726 }
5727 \f
5728 /* Nonzero if the type T promotes to int. This is (nearly) the
5729 integral promotions defined in ISO C99 6.3.1.1/2. */
5731 bool
5733 {
5735 {
5745 /* ??? Technically all enumerations not larger than an int
5746 promote to an int. But this is used along code paths
5747 that only want to notice a size change. */
5755 }
5756 }
5758 /* Return 1 if PARMS specifies a fixed number of parameters
5759 and none of their types is affected by default promotions. */
5761 int
5763 {
5764 const_tree t;
5766 {
5783 }
5785 }
5787 /* Recursively remove any '*' or '&' operator from TYPE. */
5788 tree
5790 {
5794 }
5796 /* Recursively remove pointer or array type from TYPE. */
5797 tree
5799 {
5803 }
5805 /* Used to compare case labels. K1 and K2 are actually tree nodes
5806 representing case labels, or NULL_TREE for a `default' label.
5807 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
5808 K2, and 0 if K1 and K2 are equal. */
5810 int
5812 {
5813 /* Consider a NULL key (such as arises with a `default' label) to be
5814 smaller than anything else. */
5821 }
5823 /* Process a case label, located at LOC, for the range LOW_VALUE
5824 ... HIGH_VALUE. If LOW_VALUE and HIGH_VALUE are both NULL_TREE
5825 then this case label is actually a `default' label. If only
5826 HIGH_VALUE is NULL_TREE, then case label was declared using the
5827 usual C/C++ syntax, rather than the GNU case range extension.
5828 CASES is a tree containing all the case ranges processed so far;
5829 COND is the condition for the switch-statement itself. Returns the
5830 CASE_LABEL_EXPR created, or ERROR_MARK_NODE if no CASE_LABEL_EXPR
5831 is created. */
5833 tree
5836 {
5837 tree type;
5838 tree label;
5839 tree case_label;
5840 splay_tree_node node;
5842 /* Create the LABEL_DECL itself. */
5845 /* If there was an error processing the switch condition, bail now
5846 before we get more confused. */
5854 {
5857 }
5859 /* Case ranges are a GNU extension. */
5866 {
5871 }
5873 {
5878 }
5881 {
5882 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
5883 really a case range, even though it was written that way.
5884 Remove the HIGH_VALUE to simplify later processing. */
5889 }
5891 /* See if the case is in range of the type of the original testing
5892 expression. If both low_value and high_value are out of range,
5893 don't insert the case label and return NULL_TREE. */
5899 /* Look up the LOW_VALUE in the table of case labels we already
5900 have. */
5902 /* If there was not an exact match, check for overlapping ranges.
5903 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
5904 that's a `default' label and the only overlap is an exact match. */
5906 {
5907 splay_tree_node low_bound;
5908 splay_tree_node high_bound;
5910 /* Even though there wasn't an exact match, there might be an
5911 overlap between this case range and another case range.
5912 Since we've (inductively) not allowed any overlapping case
5913 ranges, we simply need to find the greatest low case label
5914 that is smaller that LOW_VALUE, and the smallest low case
5915 label that is greater than LOW_VALUE. If there is an overlap
5916 it will occur in one of these two ranges. */
5922 /* Check to see if the LOW_BOUND overlaps. It is smaller than
5923 the LOW_VALUE, so there is no need to check unless the
5924 LOW_BOUND is in fact itself a case range. */
5930 /* Check to see if the HIGH_BOUND overlaps. The low end of that
5931 range is bigger than the low end of the current range, so we
5932 are only interested if the current range is a real range, and
5933 not an ordinary case label. */
5935 && high_value
5937 high_value)
5940 }
5941 /* If there was an overlap, issue an error. */
5943 {
5947 {
5951 }
5953 {
5956 }
5957 else
5958 {
5962 }
5964 }
5966 /* Add a CASE_LABEL to the statement-tree. */
5968 /* Register this case label in the splay tree. */
5975 error_out:
5976 /* Add a label so that the back-end doesn't think that the beginning of
5977 the switch is unreachable. Note that we do not add a case label, as
5978 that just leads to duplicates and thence to failure later on. */
5980 {
5983 }
5985 }
5987 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
5988 Used to verify that case values match up with enumerator values. */
5990 static void
5992 {
5995 /* ??? Not working too hard to print the double-word value.
5996 Should perhaps be done with %lwd in the diagnostic routines? */
6005 else
6014 buf);
6015 else
6020 }
6022 /* Subroutine of c_do_switch_warnings, called via splay_tree_foreach.
6023 Used to verify that case values match up with enumerator values. */
6025 static int
6027 {
6031 /* Skip default case. */
6035 /* If CASE_LOW_SEEN is not set, that means CASE_LOW did not appear
6036 when we did our enum->case scan. Reset our scratch bit after. */
6039 else
6042 /* If CASE_HIGH is non-null, we have a range. If CASE_HIGH_SEEN is
6043 not set, that means that CASE_HIGH did not appear when we did our
6044 enum->case scan. Reset our scratch bit after. */
6046 {
6049 else
6051 }
6054 }
6056 /* Handle -Wswitch*. Called from the front end after parsing the
6057 switch construct. */
6058 /* ??? Should probably be somewhere generic, since other languages
6059 besides C and C++ would want this. At the moment, however, C/C++
6060 are the only tree-ssa languages that support enumerations at all,
6061 so the point is moot. */
6063 void
6066 {
6067 splay_tree_node default_node;
6068 splay_tree_node node;
6069 tree chain;
6079 /* From here on, we only care about about enumerated types. */
6083 /* From here on, we only care about -Wswitch and -Wswitch-enum. */
6087 /* Check the cases. Warn about case values which are not members of
6088 the enumerated type. For -Wswitch-enum, or for -Wswitch when
6089 there is no default case, check that exactly all enumeration
6090 literals are covered by the cases. */
6092 /* Clearing COND if it is not an integer constant simplifies
6093 the tests inside the loop below. */
6097 /* The time complexity here is O(N*lg(N)) worst case, but for the
6098 common case of monotonically increasing enumerators, it is
6099 O(N), since the nature of the splay tree will keep the next
6100 element adjacent to the root at all times. */
6103 {
6109 {
6110 /* Mark the CASE_LOW part of the case entry as seen. */
6114 }
6116 /* Even though there wasn't an exact match, there might be a
6117 case range which includes the enumerator's value. */
6120 {
6124 {
6125 /* If we match the upper bound exactly, mark the CASE_HIGH
6126 part of the case entry as seen. */
6130 }
6131 }
6133 /* We've now determined that this enumerated literal isn't
6134 handled by the case labels of the switch statement. */
6136 /* If the switch expression is a constant, we only really care
6137 about whether that constant is handled by the switch. */
6141 /* If there is a default_node, the only relevant option is
6142 Wswitch-enum. Otherwise, if both are enabled then we prefer
6143 to warn using -Wswitch because -Wswitch is enabled by -Wall
6144 while -Wswitch-enum is explicit. */
6147 ? OPT_Wswitch_enum
6151 }
6153 /* Warn if there are case expressions that don't correspond to
6154 enumerators. This can occur since C and C++ don't enforce
6155 type-checking of assignments to enumeration variables.
6157 The time complexity here is now always O(N) worst case, since
6158 we should have marked both the lower bound and upper bound of
6159 every disjoint case label, with CASE_LOW_SEEN and CASE_HIGH_SEEN
6160 above. This scan also resets those fields. */
6163 }
6165 /* Finish an expression taking the address of LABEL (an
6166 IDENTIFIER_NODE). Returns an expression for the address.
6168 LOC is the location for the expression returned. */
6170 tree
6172 {
6173 tree result;
6183 else
6184 {
6187 /* The current function is not necessarily uninlinable.
6188 Computed gotos are incompatible with inlining, but the value
6189 here could be used only in a diagnostic, for example. */
6191 }
6194 }
6195 \f
6197 /* Given a boolean expression ARG, return a tree representing an increment
6198 or decrement (as indicated by CODE) of ARG. The front end must check for
6199 invalid cases (e.g., decrement in C++). */
6200 tree
6202 {
6203 tree val;
6208 {
6231 }
6234 }
6235 \f
6236 /* Built-in macros for stddef.h and stdint.h, that require macros
6237 defined in this file. */
6238 void
6240 {
6303 }
6305 static void
6307 {
6308 /* Fill in the built_in_attributes array. */
6309 #define DEF_ATTR_NULL_TREE(ENUM) \
6310 built_in_attributes[(int) ENUM] = NULL_TREE;
6311 #define DEF_ATTR_INT(ENUM, VALUE) \
6312 built_in_attributes[(int) ENUM] = build_int_cst (integer_type_node, VALUE);
6313 #define DEF_ATTR_STRING(ENUM, VALUE) \
6314 built_in_attributes[(int) ENUM] = build_string (strlen (VALUE), VALUE);
6315 #define DEF_ATTR_IDENT(ENUM, STRING) \
6316 built_in_attributes[(int) ENUM] = get_identifier (STRING);
6317 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
6318 built_in_attributes[(int) ENUM] \
6319 = tree_cons (built_in_attributes[(int) PURPOSE], \
6320 built_in_attributes[(int) VALUE], \
6321 built_in_attributes[(int) CHAIN]);
6323 #undef DEF_ATTR_NULL_TREE
6324 #undef DEF_ATTR_INT
6325 #undef DEF_ATTR_IDENT
6326 #undef DEF_ATTR_TREE_LIST
6327 }
6329 /* Returns TRUE iff the attribute indicated by ATTR_ID takes a plain
6330 identifier as an argument, so the front end shouldn't look it up. */
6332 bool
6334 {
6337 /* Unknown attribute that we'll end up ignoring, return true so we
6338 don't complain about an identifier argument. */
6344 else
6346 }
6348 /* Attribute handlers common to C front ends. */
6350 /* Handle a "packed" attribute; arguments as in
6351 struct attribute_spec.handler. */
6353 static tree
6356 {
6358 {
6362 }
6364 {
6366 /* Still pack bitfields. */
6371 else
6373 }
6374 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
6375 used for DECL_REGISTER. It wouldn't mean anything anyway.
6376 We can't set DECL_PACKED on the type of a TYPE_DECL, because
6377 that changes what the typedef is typing. */
6378 else
6379 {
6382 }
6385 }
6387 /* Handle a "nocommon" attribute; arguments as in
6388 struct attribute_spec.handler. */
6390 static tree
6394 {
6397 else
6398 {
6401 }
6404 }
6406 /* Handle a "common" attribute; arguments as in
6407 struct attribute_spec.handler. */
6409 static tree
6412 {
6415 else
6416 {
6419 }
6422 }
6424 /* Handle a "noreturn" attribute; arguments as in
6425 struct attribute_spec.handler. */
6427 static tree
6430 {
6433 /* See FIXME comment in c_common_attribute_table. */
6440 = build_pointer_type
6443 else
6444 {
6447 }
6450 }
6452 /* Handle a "hot" and attribute; arguments as in
6453 struct attribute_spec.handler. */
6455 static tree
6458 {
6461 {
6463 {
6467 }
6468 /* Most of the rest of the hot processing is done later with
6469 lookup_attribute. */
6470 }
6471 else
6472 {
6475 }
6478 }
6480 /* Handle a "cold" and attribute; arguments as in
6481 struct attribute_spec.handler. */
6483 static tree
6486 {
6489 {
6491 {
6495 }
6496 /* Most of the rest of the cold processing is done later with
6497 lookup_attribute. */
6498 }
6499 else
6500 {
6503 }
6506 }
6508 /* Handle a "no_address_safety_analysis" attribute; arguments as in
6509 struct attribute_spec.handler. */
6511 static tree
6514 {
6516 {
6519 }
6522 }
6524 /* Handle a "noinline" attribute; arguments as in
6525 struct attribute_spec.handler. */
6527 static tree
6531 {
6534 else
6535 {
6538 }
6541 }
6543 /* Handle a "noclone" attribute; arguments as in
6544 struct attribute_spec.handler. */
6546 static tree
6550 {
6552 {
6555 }
6558 }
6560 /* Handle a "always_inline" attribute; arguments as in
6561 struct attribute_spec.handler. */
6563 static tree
6568 {
6570 {
6571 /* Set the attribute and mark it for disregarding inline
6572 limits. */
6574 }
6575 else
6576 {
6579 }
6582 }
6584 /* Handle a "gnu_inline" attribute; arguments as in
6585 struct attribute_spec.handler. */
6587 static tree
6592 {
6594 {
6595 /* Do nothing else, just set the attribute. We'll get at
6596 it later with lookup_attribute. */
6597 }
6598 else
6599 {
6602 }
6605 }
6607 /* Handle a "leaf" attribute; arguments as in
6608 struct attribute_spec.handler. */
6610 static tree
6614 {
6616 {
6619 }
6621 {
6624 }
6627 }
6629 /* Handle an "artificial" attribute; arguments as in
6630 struct attribute_spec.handler. */
6632 static tree
6637 {
6639 {
6640 /* Do nothing else, just set the attribute. We'll get at
6641 it later with lookup_attribute. */
6642 }
6643 else
6644 {
6647 }
6650 }
6652 /* Handle a "flatten" attribute; arguments as in
6653 struct attribute_spec.handler. */
6655 static tree
6657 tree args ATTRIBUTE_UNUSED,
6659 {
6661 /* Do nothing else, just set the attribute. We'll get at
6662 it later with lookup_attribute. */
6663 ;
6664 else
6665 {
6668 }
6671 }
6673 /* Handle a "warning" or "error" attribute; arguments as in
6674 struct attribute_spec.handler. */
6676 static tree
6679 {
6682 /* Do nothing else, just set the attribute. We'll get at
6683 it later with lookup_attribute. */
6684 ;
6685 else
6686 {
6689 }
6692 }
6694 /* Handle a "used" attribute; arguments as in
6695 struct attribute_spec.handler. */
6697 static tree
6700 {
6706 {
6711 }
6712 else
6713 {
6716 }
6719 }
6721 /* Handle a "unused" attribute; arguments as in
6722 struct attribute_spec.handler. */
6724 static tree
6727 {
6729 {
6737 {
6742 }
6743 else
6744 {
6747 }
6748 }
6749 else
6750 {
6754 }
6757 }
6759 /* Handle a "externally_visible" attribute; arguments as in
6760 struct attribute_spec.handler. */
6762 static tree
6767 {
6771 {
6774 {
6778 }
6779 }
6780 else
6781 {
6784 }
6787 }
6789 /* Handle a "const" attribute; arguments as in
6790 struct attribute_spec.handler. */
6792 static tree
6795 {
6798 /* See FIXME comment on noreturn in c_common_attribute_table. */
6804 = build_pointer_type
6807 else
6808 {
6811 }
6814 }
6816 /* Handle a "transparent_union" attribute; arguments as in
6817 struct attribute_spec.handler. */
6819 static tree
6823 {
6824 tree type;
6835 {
6836 /* Make sure that the first field will work for a transparent union.
6837 If the type isn't complete yet, leave the check to the code in
6838 finish_struct. */
6840 {
6846 }
6849 {
6850 /* If the type isn't complete yet, setting the flag
6851 on a variant wouldn't ever be checked. */
6855 /* build_duplicate_type doesn't work for C++. */
6859 /* A type variant isn't good enough, since we don't a cast
6860 to such a type removed as a no-op. */
6862 }
6866 }
6868 ignored:
6871 }
6873 /* Subroutine of handle_{con,de}structor_attribute. Evaluate ARGS to
6874 get the requested priority for a constructor or destructor,
6875 possibly issuing diagnostics for invalid or reserved
6876 priorities. */
6878 static priority_type
6880 {
6881 HOST_WIDE_INT pri;
6882 tree arg;
6888 {
6891 else
6894 }
6907 {
6910 "destructor priorities from 0 to %d are reserved "
6912 MAX_RESERVED_INIT_PRIORITY);
6913 else
6915 "constructor priorities from 0 to %d are reserved "
6917 MAX_RESERVED_INIT_PRIORITY);
6918 }
6921 invalid:
6924 MAX_INIT_PRIORITY);
6925 else
6927 MAX_INIT_PRIORITY);
6929 }
6931 /* Handle a "constructor" attribute; arguments as in
6932 struct attribute_spec.handler. */
6934 static tree
6938 {
6945 {
6946 priority_type priority;
6951 }
6952 else
6953 {
6956 }
6959 }
6961 /* Handle a "destructor" attribute; arguments as in
6962 struct attribute_spec.handler. */
6964 static tree
6968 {
6975 {
6976 priority_type priority;
6981 }
6982 else
6983 {
6986 }
6989 }
6991 /* Nonzero if the mode is a valid vector mode for this architecture.
6992 This returns nonzero even if there is no hardware support for the
6993 vector mode, but we can emulate with narrower modes. */
6995 static int
6997 {
7001 /* Doh! What's going on? */
7010 /* Hardware support. Woo hoo! */
7016 /* We should probably return 1 if requesting V4DI and we have no DI,
7017 but we have V2DI, but this is probably very unlikely. */
7019 /* If we have support for the inner mode, we can safely emulate it.
7020 We may not have V2DI, but me can emulate with a pair of DIs. */
7022 }
7025 /* Handle a "mode" attribute; arguments as in
7026 struct attribute_spec.handler. */
7028 static tree
7031 {
7039 else
7040 {
7045 tree typefm;
7050 {
7056 }
7058 /* Change this type to have a type with the specified mode.
7059 First check for the special modes. */
7072 else
7075 {
7078 }
7081 {
7084 }
7088 {
7120 }
7122 {
7125 }
7128 {
7133 {
7136 }
7140 else
7143 }
7144 else
7145 {
7146 /* For fixed-point modes, we need to test if the signness of type
7147 and the machine mode are consistent. */
7150 {
7153 }
7154 /* For fixed-point modes, we need to pass saturating info. */
7158 }
7161 {
7164 }
7166 {
7167 /* For enumeral types, copy the precision from the integer
7168 type returned above. If not an INTEGER_TYPE, we can't use
7169 this mode for this type. */
7171 {
7174 }
7177 {
7180 }
7181 else
7182 {
7183 /* We cannot build a type variant, as there's code that assumes
7184 that TYPE_MAIN_VARIANT has the same mode. This includes the
7185 debug generators. Instead, create a subrange type. This
7186 results in all of the enumeral values being emitted only once
7187 in the original, and the subtype gets them by reference. */
7190 else
7193 }
7194 }
7198 {
7201 }
7204 }
7207 }
7209 /* Handle a "section" attribute; arguments as in
7210 struct attribute_spec.handler. */
7212 static tree
7215 {
7219 {
7225 {
7229 {
7231 "section attribute cannot be specified for "
7234 }
7236 /* The decl may have already been given a section attribute
7237 from a previous declaration. Ensure they match. */
7241 {
7245 }
7249 {
7252 }
7253 else
7255 }
7256 else
7257 {
7260 }
7261 }
7262 else
7263 {
7267 }
7270 }
7272 /* Check whether ALIGN is a valid user-specified alignment. If so,
7273 return its base-2 log; if not, output an error and return -1. If
7274 ALLOW_ZERO then 0 is valid and should result in a return of -1 with
7275 no error. */
7276 int
7278 {
7283 {
7286 }
7290 {
7293 }
7295 {
7298 }
7300 }
7302 /*
7303 If in c++-11, check if the c++-11 alignment constraint with respect
7304 to fundamental alignment (in [dcl.align]) are satisfied. If not in
7305 c++-11 mode, does nothing.
7307 [dcl.align]2/ says:
7309 [* if the constant expression evaluates to a fundamental alignment,
7310 the alignment requirement of the declared entity shall be the
7311 specified fundamental alignment.
7313 * if the constant expression evaluates to an extended alignment
7314 and the implementation supports that alignment in the context
7315 of the declaration, the alignment of the declared entity shall
7316 be that alignment
7318 * if the constant expression evaluates to an extended alignment
7319 and the implementation does not support that alignment in the
7320 context of the declaration, the program is ill-formed]. */
7322 static bool
7326 {
7339 {
7341 {
7342 /* For file scope variables and static members, the target
7343 supports alignments that are at most
7344 MAX_OFILE_ALIGNMENT. */
7347 }
7348 else
7349 {
7350 #ifdef BIGGEST_FIELD_ALIGNMENT
7351 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_FIELD_ALIGNMENT
7352 #else
7353 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_ALIGNMENT
7354 #endif
7355 /* For non-static members, the target supports either
7356 alignments that at most either BIGGEST_FIELD_ALIGNMENT
7357 if it is defined or BIGGEST_ALIGNMENT. */
7362 #undef MAX_TARGET_FIELD_ALIGNMENT
7363 /* For stack variables, the target supports at most
7364 MAX_STACK_ALIGNMENT. */
7368 }
7369 }
7371 {
7372 /* Let's be liberal for types. */
7375 }
7383 }
7385 /* Handle a "aligned" attribute; arguments as in
7386 struct attribute_spec.handler. */
7388 static tree
7391 {
7400 {
7404 }
7412 {
7415 /* If we have a TYPE_DECL, then copy the type, so that we
7416 don't accidentally modify a builtin type. See pushdecl. */
7419 {
7426 }
7427 else
7432 }
7435 {
7438 }
7441 /* C++-11 [dcl.align/4]:
7443 When multiple alignment-specifiers are specified for an
7444 entity, the alignment requirement shall be set to the
7445 strictest specified alignment.
7447 This formally comes from the c++11 specification but we are
7448 doing it for the GNU attribute syntax as well. */
7452 {
7457 else
7461 }
7462 else
7463 {
7466 }
7469 }
7471 /* Handle a "weak" attribute; arguments as in
7472 struct attribute_spec.handler. */
7474 static tree
7479 {
7482 {
7485 }
7487 {
7491 }
7495 else
7499 }
7501 /* Handle an "alias" or "ifunc" attribute; arguments as in
7502 struct attribute_spec.handler, except that IS_ALIAS tells us
7503 whether this is an alias as opposed to ifunc attribute. */
7505 static tree
7508 {
7513 {
7516 }
7520 /* A static variable declaration is always a tentative definition,
7521 but the alias is a non-tentative definition which overrides. */
7524 {
7528 }
7532 {
7536 }
7538 /* Note that the very first time we process a nested declaration,
7539 decl_function_context will not be set. Indeed, *would* never
7540 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
7541 we do below. After such frobbery, pushdecl would set the context.
7542 In any case, this is never what we want. */
7544 {
7545 tree id;
7549 {
7553 }
7555 /* This counts as a use of the object pointed to. */
7560 else
7561 {
7564 else
7567 }
7570 /* ifuncs are also aliases, so set that attribute too. */
7573 }
7574 else
7575 {
7578 }
7581 }
7583 /* Handle an "alias" or "ifunc" attribute; arguments as in
7584 struct attribute_spec.handler. */
7586 static tree
7589 {
7591 }
7593 /* Handle an "alias" or "ifunc" attribute; arguments as in
7594 struct attribute_spec.handler. */
7596 static tree
7599 {
7601 }
7603 /* Handle a "weakref" attribute; arguments as in struct
7604 attribute_spec.handler. */
7606 static tree
7609 {
7612 /* We must ignore the attribute when it is associated with
7613 local-scoped decls, since attribute alias is ignored and many
7614 such symbols do not even have a DECL_WEAK field. */
7616 || current_function_decl
7618 {
7622 }
7625 {
7629 }
7631 /* The idea here is that `weakref("name")' mutates into `weakref,
7632 alias("name")', and weakref without arguments, in turn,
7633 implicitly adds weak. */
7636 {
7643 }
7644 else
7645 {
7650 /* Can't call declare_weak because it wants this to be TREE_PUBLIC,
7651 and that isn't supported; and because it wants to add it to
7652 the list of weak decls, which isn't helpful. */
7654 }
7657 }
7659 /* Handle an "visibility" attribute; arguments as in
7660 struct attribute_spec.handler. */
7662 static tree
7666 {
7672 {
7676 {
7678 name);
7680 }
7682 {
7686 }
7687 }
7689 {
7692 }
7695 {
7698 }
7700 /* If this is a type, set the visibility on the type decl. */
7702 {
7707 {
7709 name);
7711 }
7712 }
7722 else
7723 {
7724 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
7726 }
7730 {
7744 }
7749 /* Go ahead and attach the attribute to the node as well. This is needed
7750 so we can determine whether we have VISIBILITY_DEFAULT because the
7751 visibility was not specified, or because it was explicitly overridden
7752 from the containing scope. */
7755 }
7757 /* Determine the ELF symbol visibility for DECL, which is either a
7758 variable or a function. It is an error to use this function if a
7759 definition of DECL is not available in this translation unit.
7760 Returns true if the final visibility has been determined by this
7761 function; false if the caller is free to make additional
7762 modifications. */
7764 bool
7766 {
7770 /* If the user explicitly specified the visibility with an
7771 attribute, honor that. DECL_VISIBILITY will have been set during
7772 the processing of the attribute. We check for an explicit
7773 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
7774 to distinguish the use of an attribute from the use of a "#pragma
7775 GCC visibility push(...)"; in the latter case we still want other
7776 considerations to be able to overrule the #pragma. */
7778 || (TARGET_DLLIMPORT_DECL_ATTRIBUTES
7783 /* Set default visibility to whatever the user supplied with
7784 visibility_specified depending on #pragma GCC visibility. */
7786 {
7789 {
7792 /* If visibility changed and DECL already has DECL_RTL, ensure
7793 symbol flags are updated. */
7798 }
7799 }
7801 }
7803 /* Handle an "tls_model" attribute; arguments as in
7804 struct attribute_spec.handler. */
7806 static tree
7809 {
7810 tree id;
7817 {
7820 }
7825 {
7828 }
7838 else
7839 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
7843 }
7845 /* Handle a "no_instrument_function" attribute; arguments as in
7846 struct attribute_spec.handler. */
7848 static tree
7853 {
7857 {
7861 }
7863 {
7867 }
7868 else
7872 }
7874 /* Handle a "malloc" attribute; arguments as in
7875 struct attribute_spec.handler. */
7877 static tree
7880 {
7884 else
7885 {
7888 }
7891 }
7893 /* Handle a "alloc_size" attribute; arguments as in
7894 struct attribute_spec.handler. */
7896 static tree
7899 {
7902 {
7909 {
7914 }
7915 }
7917 }
7919 /* Handle a "fn spec" attribute; arguments as in
7920 struct attribute_spec.handler. */
7922 static tree
7926 {
7931 }
7933 /* Handle a "returns_twice" attribute; arguments as in
7934 struct attribute_spec.handler. */
7936 static tree
7939 {
7942 else
7943 {
7946 }
7949 }
7951 /* Handle a "no_limit_stack" attribute; arguments as in
7952 struct attribute_spec.handler. */
7954 static tree
7959 {
7963 {
7967 }
7969 {
7973 }
7974 else
7978 }
7980 /* Handle a "pure" attribute; arguments as in
7981 struct attribute_spec.handler. */
7983 static tree
7986 {
7989 /* ??? TODO: Support types. */
7990 else
7991 {
7994 }
7997 }
7999 /* Digest an attribute list destined for a transactional memory statement.
8000 ALLOWED is the set of attributes that are allowed for this statement;
8001 return the attribute we parsed. Multiple attributes are never allowed. */
8003 int
8005 {
8010 {
8018 {
8021 }
8024 {
8027 }
8030 else
8032 }
8035 }
8037 /* Transform a TM attribute name into a maskable integer and back.
8038 Note that NULL (i.e. no attribute) is mapped to UNKNOWN, corresponding
8039 to how the lack of an attribute is treated. */
8041 int
8043 {
8057 }
8059 tree
8061 {
8064 {
8082 }
8084 }
8086 /* Return the first TM attribute seen in LIST. */
8088 tree
8090 {
8092 {
8096 }
8098 }
8100 /* Handle the TM attributes; arguments as in struct attribute_spec.handler.
8101 Here we accept only function types, and verify that none of the other
8102 function TM attributes are also applied. */
8103 /* ??? We need to accept class types for C++, but not C. This greatly
8104 complicates this function, since we can no longer rely on the extra
8105 processing given by function_type_required. */
8107 static tree
8110 {
8111 /* Only one path adds the attribute; others don't. */
8115 {
8118 /* Only tm_callable and tm_safe apply to classes. */
8121 /* FALLTHRU */
8125 {
8128 ;
8131 else
8133 }
8137 {
8140 {
8145 }
8146 }
8147 /* FALLTHRU */
8150 /* If a function is next, pass it on to be tried next. */
8154 ignored:
8157 }
8160 }
8162 /* Handle the TM_WRAP attribute; arguments as in
8163 struct attribute_spec.handler. */
8165 static tree
8168 {
8171 /* We don't need the attribute even on success, since we
8172 record the entry in an external table. */
8177 else
8178 {
8184 else
8185 {
8189 {
8193 else
8195 }
8196 else
8198 }
8199 }
8202 }
8204 /* Ignore the given attribute. Used when this attribute may be usefully
8205 overridden by the target, but is not used generically. */
8207 static tree
8211 {
8214 }
8216 /* Handle a "no vops" attribute; arguments as in
8217 struct attribute_spec.handler. */
8219 static tree
8223 {
8227 }
8229 /* Handle a "deprecated" attribute; arguments as in
8230 struct attribute_spec.handler. */
8232 static tree
8236 {
8244 {
8247 }
8250 {
8261 else
8263 }
8265 {
8270 }
8271 else
8275 {
8278 {
8284 }
8287 else
8289 }
8292 }
8294 /* Handle a "vector_size" attribute; arguments as in
8295 struct attribute_spec.handler. */
8297 static tree
8301 {
8311 {
8314 }
8316 /* Get the vector size (in bytes). */
8319 /* We need to provide for vector pointers, vector arrays, and
8320 functions returning vectors. For example:
8322 __attribute__((vector_size(16))) short *foo;
8324 In this case, the mode is SI, but the type being modified is
8325 HI, so we need to look further. */
8334 /* Get the mode of the type being modified. */
8345 {
8348 }
8351 {
8354 }
8357 {
8360 }
8362 /* Calculate how many units fit in the vector. */
8365 {
8368 }
8372 /* Build back pointers if needed. */
8376 }
8378 /* Handle the "nonnull" attribute. */
8379 static tree
8383 {
8387 /* If no arguments are specified, all pointer arguments should be
8388 non-null. Verify a full prototype is given so that the arguments
8389 will have the correct types when we actually check them later. */
8391 {
8393 {
8396 }
8398 }
8400 /* Argument list specified. Verify that each argument number references
8401 a pointer argument. */
8403 {
8407 {
8412 }
8415 {
8416 function_args_iterator iter;
8417 tree argument;
8421 {
8425 }
8429 {
8434 }
8437 {
8442 }
8443 }
8444 }
8447 }
8449 /* Check the argument list of a function call for null in argument slots
8450 that are marked as requiring a non-null pointer argument. The NARGS
8451 arguments are passed in the array ARGARRAY.
8452 */
8454 static void
8456 {
8457 tree a;
8465 /* See if any of the nonnull attributes has no arguments. If so,
8466 then every pointer argument is checked (in which case the check
8467 for pointer type is done in check_nonnull_arg). */
8469 do
8477 else
8478 {
8479 /* Walk the argument list. If we encounter an argument number we
8480 should check for non-null, do it. */
8482 {
8484 {
8488 }
8493 }
8494 }
8495 }
8497 /* Check that the Nth argument of a function call (counting backwards
8498 from the end) is a (pointer)0. The NARGS arguments are passed in the
8499 array ARGARRAY. */
8501 static void
8503 {
8507 {
8510 tree sentinel;
8511 function_args_iterator iter;
8512 tree t;
8514 /* Skip over the named arguments. */
8516 {
8519 len++;
8520 }
8523 {
8526 }
8528 /* The sentinel must be one of the varargs, i.e.
8529 in position >= the number of fixed arguments. */
8531 {
8535 }
8537 /* Validate the sentinel. */
8541 /* Although __null (in C++) is only an integer we allow it
8542 nevertheless, as we are guaranteed that it's exactly
8543 as wide as a pointer, and we don't want to force
8544 users to cast the NULL they have written there.
8545 We warn with -Wstrict-null-sentinel, though. */
8548 }
8549 }
8551 /* Helper for check_function_nonnull; given a list of operands which
8552 must be non-null in ARGS, determine if operand PARAM_NUM should be
8553 checked. */
8555 static bool
8557 {
8561 {
8568 }
8570 }
8572 /* Check that the function argument PARAM (which is operand number
8573 PARAM_NUM) is non-null. This is called by check_function_nonnull
8574 via check_function_arguments_recurse. */
8576 static void
8579 {
8580 /* Just skip checking the argument if it's not a pointer. This can
8581 happen if the "nonnull" attribute was given without an operand
8582 list (which means to check every pointer argument). */
8590 }
8592 /* Helper for nonnull attribute handling; fetch the operand number
8593 from the attribute argument list. */
8595 static bool
8597 {
8598 /* Verify the arg number is a constant. */
8605 }
8607 /* Handle a "nothrow" attribute; arguments as in
8608 struct attribute_spec.handler. */
8610 static tree
8613 {
8616 /* ??? TODO: Support types. */
8617 else
8618 {
8621 }
8624 }
8626 /* Handle a "cleanup" attribute; arguments as in
8627 struct attribute_spec.handler. */
8629 static tree
8632 {
8636 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
8637 for global destructors in C++. This requires infrastructure that
8638 we don't have generically at the moment. It's also not a feature
8639 we'd be missing too much, since we do have attribute constructor. */
8641 {
8645 }
8647 /* Verify that the argument is a function in scope. */
8648 /* ??? We could support pointers to functions here as well, if
8649 that was considered desirable. */
8652 {
8656 }
8659 {
8663 }
8665 /* That the function has proper type is checked with the
8666 eventual call to build_function_call. */
8669 }
8671 /* Handle a "warn_unused_result" attribute. No special handling. */
8673 static tree
8677 {
8678 /* Ignore the attribute for functions not returning any value. */
8680 {
8683 }
8686 }
8688 /* Handle a "sentinel" attribute. */
8690 static tree
8693 {
8695 {
8699 }
8700 else
8701 {
8703 {
8707 }
8708 }
8711 {
8715 {
8719 }
8720 else
8721 {
8723 {
8727 }
8728 }
8729 }
8732 }
8734 /* Handle a "type_generic" attribute. */
8736 static tree
8740 {
8741 /* Ensure we have a function type. */
8744 /* Ensure we have a variadic function. */
8748 }
8750 /* Handle a "target" attribute. */
8752 static tree
8755 {
8756 /* Ensure we have a function type. */
8758 {
8761 }
8762 /* Do not strip invalid target attributes for targets which support function
8763 multiversioning as the target string is used to determine versioned
8764 functions. */
8766 flags)
8771 }
8773 /* Arguments being collected for optimization. */
8778 /* Inner function to convert a TREE_LIST to argv string to parse the optimize
8779 options in ARGS. ATTR_P is true if this is for attribute(optimize), and
8780 false for #pragma GCC optimize. */
8782 bool
8784 {
8792 tree ap;
8794 /* Build up argv vector. Just in case the string is stored away, use garbage
8795 collected strings. */
8800 {
8804 {
8808 }
8811 {
8812 /* Split string into multiple substrings. */
8820 {
8827 {
8831 }
8832 else
8833 {
8836 }
8840 /* If the user supplied -Oxxx or -fxxx, only allow -Oxxx or -fxxx
8841 options. */
8843 {
8848 else
8852 }
8855 {
8858 /* Assume that Ox is -Ox, a numeric value is -Ox, a s by
8859 itself is -Os, and any other switch begins with a -f. */
8865 }
8870 }
8872 }
8873 }
8883 /* Now parse the options. */
8893 /* Don't allow changing -fstrict-aliasing. */
8898 }
8900 /* For handling "optimize" attribute. arguments as in
8901 struct attribute_spec.handler. */
8903 static tree
8906 {
8907 /* Ensure we have a function type. */
8909 {
8912 }
8913 else
8914 {
8918 /* Save current options. */
8921 /* If we previously had some optimization options, use them as the
8922 default. */
8927 /* Parse options, and update the vector. */
8932 /* Restore current options. */
8934 }
8937 }
8939 /* Handle a "no_split_stack" attribute. */
8941 static tree
8946 {
8950 {
8954 }
8956 {
8960 }
8963 }
8964 \f
8965 /* Check for valid arguments being passed to a function with FNTYPE.
8966 There are NARGS arguments in the array ARGARRAY. */
8967 void
8969 {
8970 /* Check for null being passed in a pointer argument that must be
8971 non-null. We also need to do this if format checking is enabled. */
8976 /* Check for errors in format strings. */
8983 }
8985 /* Generic argument checking recursion routine. PARAM is the argument to
8986 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
8987 once the argument is resolved. CTX is context for the callback. */
8988 void
8993 {
8997 {
8998 /* Strip coercion. */
9002 }
9005 {
9007 tree attrs;
9010 /* See if this is a call to a known internationalization function
9011 that modifies a format arg. Such a function may have multiple
9012 format_arg attributes (for example, ngettext). */
9015 attrs;
9018 {
9019 tree inner_arg;
9020 tree format_num_expr;
9023 call_expr_arg_iterator iter;
9025 /* Extract the argument number, which was previously checked
9026 to be valid. */
9038 {
9043 }
9044 }
9046 /* If we found a format_arg attribute and did a recursive check,
9047 we are done with checking this argument. Otherwise, we continue
9048 and this will be considered a non-literal. */
9051 }
9054 {
9055 /* Check both halves of the conditional expression. */
9061 }
9064 }
9066 /* Checks for a builtin function FNDECL that the number of arguments
9067 NARGS against the required number REQUIRED and issues an error if
9068 there is a mismatch. Returns true if the number of arguments is
9069 correct, otherwise false. */
9071 static bool
9073 {
9075 {
9079 }
9081 {
9085 }
9087 }
9089 /* Verifies the NARGS arguments ARGS to the builtin function FNDECL.
9090 Returns false if there was an error, otherwise true. */
9092 bool
9094 {
9100 {
9110 {
9112 {
9116 }
9118 }
9128 {
9135 {
9139 }
9141 }
9146 {
9151 {
9155 }
9158 {
9160 fndecl);
9162 }
9164 }
9169 {
9171 {
9174 }
9176 }
9181 }
9182 }
9184 /* Function to help qsort sort FIELD_DECLs by name order. */
9186 int
9188 {
9193 /* A nontype is "greater" than a type. */
9202 }
9205 gt_pointer_operator new_value;
9209 /* This routine compares two fields like field_decl_cmp but using the
9210 pointer operator in resort_data. */
9212 static int
9214 {
9219 /* A nontype is "greater" than a type. */
9225 {
9232 }
9234 }
9236 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
9238 void
9241 gt_pointer_operator new_value,
9243 {
9248 resort_field_decl_cmp);
9249 }
9251 /* Subroutine of c_parse_error.
9252 Return the result of concatenating LHS and RHS. RHS is really
9253 a string literal, its first character is indicated by RHS_START and
9254 RHS_SIZE is its length (including the terminating NUL character).
9256 The caller is responsible for deleting the returned pointer. */
9260 {
9266 }
9268 /* Issue the error given by GMSGID, indicating that it occurred before
9269 TOKEN, which had the associated VALUE. */
9271 void
9274 {
9275 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
9285 {
9290 {
9303 }
9307 else
9313 }
9323 {
9328 }
9336 {
9341 }
9342 else
9346 {
9349 }
9350 #undef catenate_messages
9351 }
9353 /* Mapping for cpp message reasons to the options that enable them. */
9355 struct reason_option_codes_t
9356 {
9359 };
9379 };
9381 /* Return the gcc option code associated with the reason for a cpp
9382 message, or 0 if none. */
9384 static int
9386 {
9390 {
9393 }
9395 }
9397 /* Callback from cpp_error for PFILE to print diagnostics from the
9398 preprocessor. The diagnostic is of type LEVEL, with REASON set
9399 to the reason code if LEVEL is represents a warning, at location
9400 LOCATION unless this is after lexing and the compiler's location
9401 should be used instead, with column number possibly overridden by
9402 COLUMN_OVERRIDE if not zero; MSG is the translated message and AP
9403 the arguments. Returns true if a diagnostic was emitted, false
9404 otherwise. */
9406 bool
9410 {
9411 diagnostic_info diagnostic;
9412 diagnostic_t dlevel;
9417 {
9422 /* Fall through. */
9447 }
9460 }
9462 /* Convert a character from the host to the target execution character
9463 set. cpplib handles this, mostly. */
9465 HOST_WIDE_INT
9467 {
9468 /* Character constants in GCC proper are sign-extended under -fsigned-char,
9469 zero-extended under -fno-signed-char. cpplib insists that characters
9470 and character constants are always unsigned. Hence we must convert
9471 back and forth. */
9479 else
9481 }
9483 /* Fold an offsetof-like expression. EXPR is a nested sequence of component
9484 references with an INDIRECT_REF of a constant at the bottom; much like the
9485 traditional rendering of offsetof as a macro. Return the folded result. */
9487 tree
9489 {
9493 {
9509 {
9512 }
9522 {
9526 }
9540 /* Check if the offset goes beyond the upper bound of the array. */
9542 {
9548 {
9552 {
9553 tree v;
9560 {
9568 }
9569 /* Don't warn if the array might be considered a poor
9570 man's flexible array member with a very permissive
9571 definition thereof. */
9575 "index %E denotes an offset "
9578 }
9579 }
9580 }
9587 /* Handle static members of volatile structs. */
9594 }
9597 }
9599 /* Likewise, but convert it to the return type of offsetof. */
9601 tree
9603 {
9605 }
9607 /* Warn for A ?: C expressions (with B omitted) where A is a boolean
9608 expression, because B will always be true. */
9610 void
9612 {
9615 "the omitted middle operand in ?: will always be %<true%>, "
9617 }
9619 /* Give an error for storing into ARG, which is 'const'. USE indicates
9620 how ARG was being used. */
9622 void
9624 {
9627 /* Using this macro rather than (for example) arrays of messages
9628 ensures that all the format strings are checked at compile
9629 time. */
9630 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
9631 : (use == lv_increment ? (I) \
9632 : (use == lv_decrement ? (D) : (AS))))
9634 {
9645 else
9651 }
9657 arg);
9663 arg);
9665 {
9675 arg);
9676 }
9682 arg);
9683 else
9688 arg);
9689 }
9691 /* Print an error message for an invalid lvalue. USE says
9692 how the lvalue is being used and so selects the error message. LOC
9693 is the location for the error. */
9695 void
9697 {
9699 {
9717 }
9718 }
9720 /* Print an error message for an invalid indirection of type TYPE.
9721 ERRSTRING is the name of the operator for the indirection. */
9723 void
9725 {
9727 {
9735 type);
9740 type);
9745 type);
9750 type);
9754 }
9755 }
9756 \f
9757 /* *PTYPE is an incomplete array. Complete it with a domain based on
9758 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
9759 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
9760 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
9762 int
9764 {
9771 {
9773 {
9774 int eltsize
9777 }
9779 {
9783 {
9787 }
9788 else
9789 {
9790 tree curindex;
9801 {
9805 else
9806 {
9810 size_one_node);
9811 }
9814 }
9817 }
9818 }
9819 else
9820 {
9821 /* Make an error message unless that happened already. */
9824 }
9825 }
9826 else
9827 {
9831 }
9838 else
9841 /* Using build_distinct_type_copy and modifying things afterward instead
9842 of using build_array_type to create a new type preserves all of the
9843 TYPE_LANG_FLAG_? bits that the front end may have set. */
9851 /* Make sure we have the canonical MAIN_TYPE. */
9854 hashcode);
9857 /* Fix the canonical type. */
9867 else
9872 else
9878 {
9880 /* If we proceed with the array type as it is, we'll eventually
9881 crash in tree_low_cst(). */
9883 }
9887 }
9889 /* Like c_mark_addressable but don't check register qualifier. */
9890 void
9892 {
9898 }
9901 \f
9902 /* Used to help initialize the builtin-types.def table. When a type of
9903 the correct size doesn't exist, use error_mark_node instead of NULL.
9904 The later results in segfaults even when a decl using the type doesn't
9905 get invoked. */
9907 tree
9909 {
9912 }
9914 /* A helper function for resolve_overloaded_builtin in resolving the
9915 overloaded __sync_ builtins. Returns a positive power of 2 if the
9916 first operand of PARAMS is a pointer to a supported data type.
9917 Returns 0 if an error is encountered. */
9919 static int
9921 {
9922 tree type;
9926 {
9929 }
9943 incompatible:
9946 }
9948 /* A helper function for resolve_overloaded_builtin. Adds casts to
9949 PARAMS to make arguments match up with those of FUNCTION. Drops
9950 the variadic arguments at the end. Returns false if some error
9951 was encountered; true on success. */
9953 static bool
9956 {
9957 function_args_iterator iter;
9958 tree ptype;
9962 /* We've declared the implementation functions to use "volatile void *"
9963 as the pointer parameter, so we shouldn't get any complaints from the
9964 call to check_function_arguments what ever type the user used. */
9968 /* For the rest of the values, we need to cast these to FTYPE, so that we
9969 don't get warnings for passing pointer types, etc. */
9972 {
9976 /* XXX void_type_node belies the abstraction. */
9982 {
9985 }
9987 /* Only convert parameters if arg_type is unsigned integer type with
9988 new format sync routines, i.e. don't attempt to convert pointer
9989 arguments (e.g. EXPECTED argument of __atomic_compare_exchange_n),
9990 bool arguments (e.g. WEAK argument) or signed int arguments (memmodel
9991 kinds). */
9993 {
9994 /* Ideally for the first conversion we'd use convert_for_assignment
9995 so that we get warnings for anything that doesn't match the pointer
9996 type. This isn't portable across the C and C++ front ends atm. */
10001 }
10004 }
10006 /* __atomic routines are not variadic. */
10008 {
10011 }
10013 /* The definition of these primitives is variadic, with the remaining
10014 being "an optional list of variables protected by the memory barrier".
10015 No clue what that's supposed to mean, precisely, but we consider all
10016 call-clobbered variables to be protected so we're safe. */
10020 }
10022 /* A helper function for resolve_overloaded_builtin. Adds a cast to
10023 RESULT to make it match the type of the first pointer argument in
10024 PARAMS. */
10026 static tree
10028 {
10033 /* New format doesn't require casting unless the types are the same size. */
10036 else
10038 }
10040 /* This function verifies the PARAMS to generic atomic FUNCTION.
10041 It returns the size if all the parameters are the same size, otherwise
10042 0 is returned if the parameters are invalid. */
10044 static int
10047 {
10052 tree type_0;
10054 /* Determine the parameter makeup. */
10056 {
10072 }
10075 {
10078 }
10080 /* Get type of first parameter, and determine its size. */
10083 {
10085 function);
10087 }
10089 /* Types must be compile time constant sizes. */
10091 {
10094 function);
10096 }
10100 /* Zero size objects are not allowed. */
10102 {
10105 function);
10107 }
10109 /* Check each other parameter is a pointer and the same size. */
10111 {
10114 /* __atomic_compare_exchange has a bool in the 4th postion, skip it. */
10118 {
10120 function);
10122 }
10125 {
10127 function);
10129 }
10130 }
10132 /* Check memory model parameters for validity. */
10134 {
10137 {
10140 {
10143 function);
10144 }
10145 }
10146 else
10148 {
10150 function);
10152 }
10153 }
10156 }
10159 /* This will take an __atomic_ generic FUNCTION call, and add a size parameter N
10160 at the beginning of the parameter list PARAMS representing the size of the
10161 objects. This is to match the library ABI requirement. LOC is the location
10162 of the function call.
10163 The new function is returned if it needed rebuilding, otherwise NULL_TREE is
10164 returned to allow the external call to be constructed. */
10166 static tree
10169 {
10170 tree size_node;
10172 /* Insert a SIZE_T parameter as the first param. If there isn't
10173 enough space, allocate a new vector and recursively re-build with that. */
10175 {
10178 tree f;
10187 }
10189 /* Add the size parameter and leave as a function call for processing. */
10193 }
10196 /* This will process an __atomic_exchange function call, determine whether it
10197 needs to be mapped to the _N variation, or turned into a library call.
10198 LOC is the location of the builtin call.
10199 FUNCTION is the DECL that has been invoked;
10200 PARAMS is the argument list for the call. The return value is non-null
10201 TRUE is returned if it is translated into the proper format for a call to the
10202 external library, and NEW_RETURN is set the tree for that function.
10203 FALSE is returned if processing for the _N variation is required, and
10204 NEW_RETURN is set to the the return value the result is copied into. */
10205 static bool
10208 {
10213 /* Size of 0 is an error condition. */
10215 {
10218 }
10220 /* If not a lock-free size, change to the library generic format. */
10222 {
10225 }
10227 /* Otherwise there is a lockfree match, transform the call from:
10228 void fn(T* mem, T* desired, T* return, model)
10229 into
10230 *return = (T) (fn (In* mem, (In) *desired, model)) */
10237 /* Create pointer to appropriate size. */
10241 /* Convert object pointer to required type. */
10244 /* Convert new value to required type, and dereference it. */
10249 /* Move memory model to the 3rd position, and end param list. */
10253 /* Convert return pointer and dereference it for later assignment. */
10257 }
10260 /* This will process an __atomic_compare_exchange function call, determine
10261 whether it needs to be mapped to the _N variation, or turned into a lib call.
10262 LOC is the location of the builtin call.
10263 FUNCTION is the DECL that has been invoked;
10264 PARAMS is the argument list for the call. The return value is non-null
10265 TRUE is returned if it is translated into the proper format for a call to the
10266 external library, and NEW_RETURN is set the tree for that function.
10267 FALSE is returned if processing for the _N variation is required. */
10269 static bool
10273 {
10278 /* Size of 0 is an error condition. */
10280 {
10283 }
10285 /* If not a lock-free size, change to the library generic format. */
10287 {
10288 /* The library generic format does not have the weak parameter, so
10289 remove it from the param list. Since a parameter has been removed,
10290 we can be sure that there is room for the SIZE_T parameter, meaning
10291 there will not be a recursive rebuilding of the parameter list, so
10292 there is no danger this will be done twice. */
10294 {
10298 }
10301 }
10303 /* Otherwise, there is a match, so the call needs to be transformed from:
10304 bool fn(T* mem, T* desired, T* return, weak, success, failure)
10305 into
10306 bool fn ((In *)mem, (In *)expected, (In) *desired, weak, succ, fail) */
10312 /* Create pointer to appropriate size. */
10316 /* Convert object pointer to required type. */
10320 /* Convert expected pointer to required type. */
10324 /* Convert desired value to required type, and dereference it. */
10329 /* The rest of the parameters are fine. NULL means no special return value
10330 processing.*/
10333 }
10336 /* This will process an __atomic_load function call, determine whether it
10337 needs to be mapped to the _N variation, or turned into a library call.
10338 LOC is the location of the builtin call.
10339 FUNCTION is the DECL that has been invoked;
10340 PARAMS is the argument list for the call. The return value is non-null
10341 TRUE is returned if it is translated into the proper format for a call to the
10342 external library, and NEW_RETURN is set the tree for that function.
10343 FALSE is returned if processing for the _N variation is required, and
10344 NEW_RETURN is set to the the return value the result is copied into. */
10346 static bool
10349 {
10354 /* Size of 0 is an error condition. */
10356 {
10359 }
10361 /* If not a lock-free size, change to the library generic format. */
10363 {
10366 }
10368 /* Otherwise, there is a match, so the call needs to be transformed from:
10369 void fn(T* mem, T* return, model)
10370 into
10371 *return = (T) (fn ((In *) mem, model)) */
10377 /* Create pointer to appropriate size. */
10381 /* Convert object pointer to required type. */
10385 /* Move memory model to the 2nd position, and end param list. */
10389 /* Convert return pointer and dereference it for later assignment. */
10393 }
10396 /* This will process an __atomic_store function call, determine whether it
10397 needs to be mapped to the _N variation, or turned into a library call.
10398 LOC is the location of the builtin call.
10399 FUNCTION is the DECL that has been invoked;
10400 PARAMS is the argument list for the call. The return value is non-null
10401 TRUE is returned if it is translated into the proper format for a call to the
10402 external library, and NEW_RETURN is set the tree for that function.
10403 FALSE is returned if processing for the _N variation is required, and
10404 NEW_RETURN is set to the the return value the result is copied into. */
10406 static bool
10409 {
10414 /* Size of 0 is an error condition. */
10416 {
10419 }
10421 /* If not a lock-free size, change to the library generic format. */
10423 {
10426 }
10428 /* Otherwise, there is a match, so the call needs to be transformed from:
10429 void fn(T* mem, T* value, model)
10430 into
10431 fn ((In *) mem, (In) *value, model) */
10436 /* Create pointer to appropriate size. */
10440 /* Convert object pointer to required type. */
10444 /* Convert new value to required type, and dereference it. */
10449 /* The memory model is in the right spot already. Return is void. */
10453 }
10456 /* Some builtin functions are placeholders for other expressions. This
10457 function should be called immediately after parsing the call expression
10458 before surrounding code has committed to the type of the expression.
10460 LOC is the location of the builtin call.
10462 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
10463 PARAMS is the argument list for the call. The return value is non-null
10464 when expansion is complete, and null if normal processing should
10465 continue. */
10467 tree
10470 {
10476 {
10482 else
10486 }
10488 /* Handle BUILT_IN_NORMAL here. */
10490 {
10495 {
10496 /* Handle these 4 together so that they can fall through to the next
10497 case if the call is transformed to an _N variant. */
10499 {
10501 {
10505 /* Change to the _N variant. */
10508 }
10511 {
10513 params,
10516 /* Change to the _N variant. */
10519 }
10521 {
10525 /* Change to the _N variant. */
10528 }
10530 {
10534 /* Change to the _N variant. */
10537 }
10540 }
10541 /* Fallthrough to the normal processing. */
10542 }
10559 {
10561 /* Fallthru for parameter processing. */
10562 }
10579 {
10590 orig_format))
10602 /* If new_return is set, assign function to that expr and cast the
10603 result to void since the generic interface returned void. */
10605 {
10606 /* Cast function result from I{1,2,4,8,16} to the required type. */
10609 result);
10613 }
10615 }
10619 }
10620 }
10622 /* Ignoring their sign, return true if two scalar types are the same. */
10623 bool
10625 {
10632 /* Equality works here because c_common_signed_type uses
10633 TYPE_MAIN_VARIANT. */
10636 }
10638 /* Check for missing format attributes on function pointers. LTYPE is
10639 the new type or left-hand side type. RTYPE is the old type or
10640 right-hand side type. Returns TRUE if LTYPE is missing the desired
10641 attribute. */
10643 bool
10645 {
10647 tree ra;
10653 {
10654 tree la;
10659 }
10660 else
10662 }
10664 /* Subscripting with type char is likely to lose on a machine where
10665 chars are signed. So warn on any machine, but optionally. Don't
10666 warn for unsigned char since that type is safe. Don't warn for
10667 signed char because anyone who uses that must have done so
10668 deliberately. Furthermore, we reduce the false positive load by
10669 warning only for non-constant value of type char. */
10671 void
10673 {
10677 }
10679 /* Implement -Wparentheses for the unexpected C precedence rules, to
10680 cover cases like x + y << z which readers are likely to
10681 misinterpret. We have seen an expression in which CODE is a binary
10682 operator used to combine expressions ARG_LEFT and ARG_RIGHT, which
10683 before folding had CODE_LEFT and CODE_RIGHT. CODE_LEFT and
10684 CODE_RIGHT may be ERROR_MARK, which means that that side of the
10685 expression was not formed using a binary or unary operator, or it
10686 was enclosed in parentheses. */
10688 void
10692 {
10696 /* This macro tests that the expression ARG with original tree code
10697 CODE appears to be a boolean expression. or the result of folding a
10698 boolean expression. */
10699 #define APPEARS_TO_BE_BOOLEAN_EXPR_P(CODE, ARG) \
10700 (truth_value_p (TREE_CODE (ARG)) \
10701 || TREE_CODE (TREE_TYPE (ARG)) == BOOLEAN_TYPE \
10703 || ((CODE) != INTEGER_CST \
10704 && (integer_onep (ARG) || integer_zerop (ARG))))
10707 {
10756 /* Check cases like x|y==z */
10763 /* Check cases like !x | y */
10767 "suggest parentheses around operand of "
10780 /* Check cases like x^y==z */
10802 /* Check cases like x&y==z */
10809 /* Check cases like !x & y */
10813 "suggest parentheses around operand of "
10836 {
10841 "comparisons like %<X<=Y<=Z%> do not "
10847 "comparisons like %<X<=Y<=Z%> do not "
10849 }
10851 }
10852 #undef NOT_A_BOOLEAN_EXPR_P
10853 }
10855 /* If LABEL (a LABEL_DECL) has not been used, issue a warning. */
10857 void
10859 {
10861 {
10864 else
10866 }
10867 }
10869 /* Warn for division by zero according to the value of DIVISOR. LOC
10870 is the location of the division operator. */
10872 void
10874 {
10875 /* If DIVISOR is zero, and has integral or fixed-point type, issue a warning
10876 about division by zero. Do not issue a warning if DIVISOR has a
10877 floating-point type, since we consider 0.0/0.0 a valid way of
10878 generating a NaN. */
10882 }
10884 /* Subroutine of build_binary_op. Give warnings for comparisons
10885 between signed and unsigned quantities that may fail. Do the
10886 checking based on the original operand trees ORIG_OP0 and ORIG_OP1,
10887 so that casts will be considered, but default promotions won't
10888 be.
10890 LOCATION is the location of the comparison operator.
10892 The arguments of this function map directly to local variables
10893 of build_binary_op. */
10895 void
10900 {
10905 /* In C++, check for comparison of different enum types. */
10911 {
10915 }
10917 /* Do not warn if the comparison is being done in a signed type,
10918 since the signed type will only be chosen if it can represent
10919 all the values of the unsigned type. */
10922 /* Do not warn if both operands are unsigned. */
10925 else
10926 {
10932 else
10940 /* Do not warn if the signed quantity is an unsuffixed integer
10941 literal (or some static constant expression involving such
10942 literals or a conditional expression involving such literals)
10943 and it is non-negative. */
10946 /* Do not warn if the comparison is an equality operation, the
10947 unsigned quantity is an integral constant, and it would fit
10948 in the result if the result were signed. */
10953 /* In C, do not warn if the unsigned quantity is an enumeration
10954 constant and its maximum value would fit in the result if the
10955 result were signed. */
10961 else
10963 OPT_Wsign_compare,
10965 }
10967 /* Warn if two unsigned values are being compared in a size larger
10968 than their original size, and one (and only one) is the result of
10969 a `~' operator. This comparison will always fail.
10971 Also warn if one operand is a constant, and the constant does not
10972 have all bits set that are set in the ~ operand when it is
10973 extended. */
10980 {
10987 {
10988 tree primop;
10994 {
10998 }
10999 else
11000 {
11004 }
11009 {
11012 {
11016 else
11019 }
11020 }
11021 }
11029 }
11030 }
11032 /* RESULT_TYPE is the result of converting TYPE1 and TYPE2 to a common
11033 type via c_common_type. If -Wdouble-promotion is in use, and the
11034 conditions for warning have been met, issue a warning. GMSGID is
11035 the warning message. It must have two %T specifiers for the type
11036 that was converted (generally "float") and the type to which it was
11037 converted (generally "double), respectively. LOC is the location
11038 to which the awrning should refer. */
11040 void
11043 {
11044 tree source_type;
11048 /* If the conversion will not occur at run-time, there is no need to
11049 warn about it. */
11061 else
11064 }
11066 /* Setup a TYPE_DECL node as a typedef representation.
11068 X is a TYPE_DECL for a typedef statement. Create a brand new
11069 ..._TYPE node (which will be just a variant of the existing
11070 ..._TYPE node with identical properties) and then install X
11071 as the TYPE_NAME of this brand new (duplicate) ..._TYPE node.
11073 The whole point here is to end up with a situation where each
11074 and every ..._TYPE node the compiler creates will be uniquely
11075 associated with AT MOST one node representing a typedef name.
11076 This way, even though the compiler substitutes corresponding
11077 ..._TYPE nodes for TYPE_DECL (i.e. "typedef name") nodes very
11078 early on, later parts of the compiler can always do the reverse
11079 translation and get back the corresponding typedef name. For
11080 example, given:
11082 typedef struct S MY_TYPE;
11083 MY_TYPE object;
11085 Later parts of the compiler might only know that `object' was of
11086 type `struct S' if it were not for code just below. With this
11087 code however, later parts of the compiler see something like:
11089 struct S' == struct S
11090 typedef struct S' MY_TYPE;
11091 struct S' object;
11093 And they can then deduce (from the node for type struct S') that
11094 the original object declaration was:
11096 MY_TYPE object;
11098 Being able to do this is important for proper support of protoize,
11099 and also for generating precise symbolic debugging information
11100 which takes full account of the programmer's (typedef) vocabulary.
11102 Obviously, we don't want to generate a duplicate ..._TYPE node if
11103 the TYPE_DECL node that we are now processing really represents a
11104 standard built-in type. */
11106 void
11108 {
11112 {
11115 }
11118 {
11126 }
11127 }
11129 /* Record the types used by the current global variable declaration
11130 being parsed, so that we can decide later to emit their debug info.
11131 Those types are in types_used_by_cur_var_decl, and we are going to
11132 store them in the types_used_by_vars_hash hash table.
11133 DECL is the declaration of the global variable that has been parsed. */
11135 void
11137 {
11141 {
11144 }
11145 }
11147 /* If DECL is a typedef that is declared in the current function,
11148 record it for the purpose of -Wunused-local-typedefs. */
11150 void
11152 {
11157 /* if this is not a locally defined typedef then we are not
11158 interested. */
11165 }
11167 /* If T is a TYPE_DECL declared locally, mark it as used. */
11169 void
11171 {
11176 }
11178 /* Warn if there are some unused locally defined typedefs in the
11179 current function. */
11181 void
11183 {
11185 tree decl;
11186 /* The number of times we have emitted -Wunused-local-typedefs
11187 warnings. If this is different from errorcount, that means some
11188 unrelated errors have been issued. In which case, we'll avoid
11189 emitting "unused-local-typedefs" warnings. */
11201 {
11205 OPT_Wunused_local_typedefs,
11208 }
11211 }
11213 /* The C and C++ parsers both use vectors to hold function arguments.
11214 For efficiency, we keep a cache of unused vectors. This is the
11215 cache. */
11220 /* Return a new vector from the cache. If the cache is empty,
11221 allocate a new vector. These vectors are GC'ed, so it is OK if the
11222 pointer is not released.. */
11226 {
11229 else
11230 {
11231 /* Passing 0 to vec::alloc returns NULL, and our callers require
11232 that we always return a non-NULL value. The vector code uses
11233 4 when growing a NULL vector, so we do too. */
11237 }
11238 }
11240 /* Release a vector of trees back to the cache. */
11242 void
11244 {
11246 {
11249 }
11250 }
11252 /* Get a new tree vector holding a single tree. */
11256 {
11260 }
11262 /* Get a new tree vector of the TREE_VALUEs of a TREE_LIST chain. */
11266 {
11271 }
11273 /* Get a new tree vector which is a copy of an existing one. */
11277 {
11280 tree t;
11287 }
11289 /* Return true if KEYWORD starts a type specifier. */
11291 bool
11293 {
11295 {
11325 }
11326 }
11328 /* Return true if KEYWORD names a type qualifier. */
11330 bool
11332 {
11334 {
11341 }
11342 }
11344 /* Return true if KEYWORD names a storage class specifier.
11346 RID_TYPEDEF is not included in this list despite `typedef' being
11347 listed in C99 6.7.1.1. 6.7.1.3 indicates that `typedef' is listed as
11348 such for syntactic convenience only. */
11350 bool
11352 {
11354 {
11364 }
11365 }
11367 /* Return true if KEYWORD names a function-specifier [dcl.fct.spec]. */
11369 static bool
11371 {
11373 {
11381 }
11382 }
11384 /* Return true if KEYWORD names a decl-specifier [dcl.spec] or a
11385 declaration-specifier (C99 6.7). */
11387 bool
11389 {
11396 {
11403 }
11404 }
11406 /* Initialize language-specific-bits of tree_contains_struct. */
11408 void
11410 {
11413 }
11415 /* Build a user-defined numeric literal out of an integer constant type VALUE
11416 with identifier SUFFIX. */
11418 tree
11421 {
11428 }
11430 /* For vector[index], convert the vector to a
11431 pointer of the underlying type. */
11432 void
11435 {
11437 {
11439 tree type1;
11453 }
11454 }
11456 /* Determine which of the operands, if any, is a scalar that needs to be
11457 converted to a vector, for the range of operations. */
11458 enum stv_conv
11461 {
11470 {
11471 /* Most GENERIC binary expressions require homogeneous arguments.
11472 LSHIFT_EXPR and RSHIFT_EXPR are exceptions and accept a first
11473 argument that is a vector and a second one that is a scalar, so
11474 we never return stv_secondarg for them. */
11479 {
11481 {
11486 }
11487 else
11489 }
11496 /* ... fall through ... */
11517 /* What about UNLT_EXPR? */
11519 {
11520 tree tmp;
11522 /* Swap TYPE0 with TYPE1 and OP0 with OP1 */
11525 }
11529 {
11531 {
11536 }
11538 }
11540 /* Allow integer --> real conversion if safe. */
11544 {
11546 {
11551 }
11553 }
11556 }
11559 }
11561 /* Return true iff ALIGN is an integral constant that is a fundamental
11562 alignment, as defined by [basic.align] in the c++-11
11563 specifications.
11565 That is:
11567 [A fundamental alignment is represented by an alignment less than or
11568 equal to the greatest alignment supported by the implementation
11569 in all contexts, which is equal to
11570 alignof(max_align_t)]. */
11572 bool
11574 {
11577 }