| blob | 8b780c20845363253bc10ef8966a56bcb6be58c1 |
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. */
378 /* Reserved words. The third field is a mask: keywords are disabled
379 if they match the mask.
381 Masks for languages:
382 C --std=c89: D_C99 | D_CXXONLY | D_OBJC | D_CXX_OBJC
383 C --std=c99: D_CXXONLY | D_OBJC
384 ObjC is like C except that D_OBJC and D_CXX_OBJC are not set
385 C++ --std=c98: D_CONLY | D_CXXOX | D_OBJC
386 C++ --std=c0x: D_CONLY | D_OBJC
387 ObjC++ is like C++ except that D_OBJC is not set
389 If -fno-asm is used, D_ASM is added to the mask. If
390 -fno-gnu-keywords is used, D_EXT is added. If -fno-asm and C in
391 C89 mode, D_EXT89 is added for both -fno-asm and -fno-gnu-keywords.
392 In C with -Wc++-compat, we warn if D_CXXWARN is set.
394 Note the complication of the D_CXX_OBJC keywords. These are
395 reserved words such as 'class'. In C++, 'class' is a reserved
396 word. In Objective-C++ it is too. In Objective-C, it is a
397 reserved word too, but only if it follows an '@' sign.
398 */
400 {
555 /* These Objective-C keywords are recognized only immediately after
556 an '@'. */
573 /* These are recognized only in protocol-qualifier context
574 (see above) */
581 /* These are recognized inside a property attribute list */
590 };
595 /* Table of machine-independent attributes common to all C-like languages. */
597 {
598 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
599 affects_type_identity } */
606 /* FIXME: logically, noreturn attributes should be listed as
607 "false, true, true" and apply to function types. But implementing this
608 would require all the places in the compiler that use TREE_THIS_VOLATILE
609 on a decl to identify non-returning functions to be located and fixed
610 to check the function type instead. */
635 /* The same comments as for noreturn attributes apply to const ones. */
659 handle_no_instrument_function_attribute,
677 /* ??? These two attributes didn't make the transition from the
678 Intel language document to the multi-vendor language document. */
683 /* For internal use (marking of builtins) only. The name contains space
684 to prevent its usage in source code. */
706 /* For internal use (marking of builtins) only. The name contains space
707 to prevent its usage in source code. */
718 handle_no_address_safety_analysis_attribute,
721 handle_no_sanitize_address_attribute,
731 /* For internal use only. The leading '*' both prevents its usage in
732 source code and signals that it may be overridden by machine tables. */
737 /* For internal use (marking of builtins and runtime functions) only.
738 The name contains space to prevent its usage in source code. */
742 };
744 /* Give the specifications for the format attributes, used by C and all
745 descendants. */
748 {
749 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
750 affects_type_identity } */
756 };
758 /* Return identifier for address space AS. */
762 {
766 }
768 /* Push current bindings for the function name VAR_DECLS. */
770 void
772 {
777 {
781 {
783 saved);
785 }
786 }
788 /* Normally they'll have been NULL, so only push if we've got a
789 stack, or they are non-NULL. */
791 saved_function_name_decls);
792 }
794 /* Finish up the current bindings, adding them into the current function's
795 statement tree. This must be done _before_ finish_stmt_tree is called.
796 If there is no current function, we must be at file scope and no statements
797 are involved. Pop the previous bindings. */
799 void
801 {
810 {
818 }
824 {
825 /* We had saved values, restore them. */
826 tree saved;
829 {
834 }
836 }
838 }
840 /* Return the text name of the current function, suitably prettified
841 by PRETTY_P. Return string must be freed by caller. */
845 {
852 {
855 }
868 {
871 }
874 }
876 /* Return the VAR_DECL for a const char array naming the current
877 function. If the VAR_DECL has not yet been created, create it
878 now. RID indicates how it should be formatted and IDENTIFIER_NODE
879 ID is its name (unfortunately C and C++ hold the RID values of
880 keywords in different places, so we can't derive RID from ID in
881 this language independent code. LOC is the location of the
882 function. */
884 tree
886 {
896 {
897 /* If a tree is built here, it would normally have the lineno of
898 the current statement. Later this tree will be moved to the
899 beginning of the function and this line number will be wrong.
900 To avoid this problem set the lineno to 0 here; that prevents
901 it from appearing in the RTL. */
902 tree stmts;
910 saved_function_name_decls
914 }
919 }
921 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
923 tree
925 {
930 /* Compute the number of elements, for the array type. */
932 {
935 }
937 {
940 }
942 {
945 }
946 else
947 {
950 }
952 /* C89 2.2.4.1, C99 5.2.4.1 (Translation limits). The analogous
953 limit in C++98 Annex B is very large (65536) and is not normative,
954 so we do not diagnose it (warn_overlength_strings is forced off
955 in c_common_post_options). */
957 {
961 /* Translators: The %d after 'ISO C' will be 90 or 99. Do not
962 separate the %d from the 'C'. 'ISO' should not be
963 translated, but it may be moved after 'C%d' in languages
964 where modifiers follow nouns. */
966 "string length %qd is greater than the length %qd "
969 }
971 /* Create the array type for the string constant. The ISO C++
972 standard says that a string literal has type `const char[N]' or
973 `const wchar_t[N]'. We use the same logic when invoked as a C
974 front-end with -Wwrite-strings.
975 ??? We should change the type of an expression depending on the
976 state of a warning flag. We should just be warning -- see how
977 this is handled in the C++ front-end for the deprecated implicit
978 conversion from string literals to `char*' or `wchar_t*'.
980 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
981 array type being the unqualified version of that type.
982 Therefore, if we are constructing an array of const char, we must
983 construct the matching unqualified array type first. The C front
984 end does not require this, but it does no harm, so we do it
985 unconditionally. */
996 }
997 \f
998 /* If DISABLE is true, stop issuing warnings. This is used when
999 parsing code that we know will not be executed. This function may
1000 be called multiple times, and works as a stack. */
1002 static void
1004 {
1006 {
1009 }
1010 }
1012 /* If ENABLE is true, reenable issuing warnings. */
1014 static void
1016 {
1018 {
1021 }
1022 }
1024 /* Fully fold EXPR, an expression that was not folded (beyond integer
1025 constant expressions and null pointer constants) when being built
1026 up. If IN_INIT, this is in a static initializer and certain
1027 changes are made to the folding done. Clear *MAYBE_CONST if
1028 MAYBE_CONST is not NULL and EXPR is definitely not a constant
1029 expression because it contains an evaluated operator (in C99) or an
1030 operator outside of sizeof returning an integer constant (in C90)
1031 not permitted in constant expressions, or because it contains an
1032 evaluated arithmetic overflow. (*MAYBE_CONST should typically be
1033 set to true by callers before calling this function.) Return the
1034 folded expression. Function arguments have already been folded
1035 before calling this function, as have the contents of SAVE_EXPR,
1036 TARGET_EXPR, BIND_EXPR, VA_ARG_EXPR, OBJ_TYPE_REF and
1037 C_MAYBE_CONST_EXPR. */
1039 tree
1041 {
1042 tree ret;
1048 /* This function is not relevant to C++ because C++ folds while
1049 parsing, and may need changes to be correct for C++ when C++
1050 stops folding while parsing. */
1057 {
1060 }
1067 }
1069 /* Internal helper for c_fully_fold. EXPR and IN_INIT are as for
1070 c_fully_fold. *MAYBE_CONST_OPERANDS is cleared because of operands
1071 not permitted, while *MAYBE_CONST_ITSELF is cleared because of
1072 arithmetic overflow (for C90, *MAYBE_CONST_OPERANDS is carried from
1073 both evaluated and unevaluated subexpressions while
1074 *MAYBE_CONST_ITSELF is carried from only evaluated
1075 subexpressions). */
1077 static tree
1080 {
1092 /* This function is not relevant to C++ because C++ folds while
1093 parsing, and may need changes to be correct for C++ when C++
1094 stops folding while parsing. */
1098 /* Constants, declarations, statements, errors, SAVE_EXPRs and
1099 anything else not counted as an expression cannot usefully be
1100 folded further at this point. */
1106 /* Operands of variable-length expressions (function calls) have
1107 already been folded, as have __builtin_* function calls, and such
1108 expressions cannot occur in constant expressions. */
1110 {
1114 }
1117 {
1126 else
1129 }
1131 /* Assignment, increment, decrement, function call and comma
1132 operators, and statement expressions, cannot occur in constant
1133 expressions if evaluated / outside of sizeof. (Function calls
1134 were handled above, though VA_ARG_EXPR is treated like a function
1135 call here, and statement expressions are handled through
1136 C_MAYBE_CONST_EXPR to avoid folding inside them.) */
1138 {
1158 }
1160 /* Fold individual tree codes as appropriate. */
1162 {
1164 /* Any non-constancy will have been marked in a containing
1165 C_MAYBE_CONST_EXPR; there is no more folding to do here. */
1173 maybe_const_itself);
1178 {
1181 }
1190 maybe_const_itself);
1193 maybe_const_itself);
1199 {
1203 }
1245 /* Binary operations evaluating both arguments (increment and
1246 decrement are binary internally in GCC). */
1250 maybe_const_itself);
1258 /* The RHS of a MODIFY_EXPR was fully folded when building that
1259 expression for the sake of conversion warnings. */
1262 maybe_const_itself);
1266 ret = in_init
1269 else
1282 {
1293 }
1299 CASE_CONVERT:
1309 /* Unary operations. */
1312 maybe_const_itself);
1316 /* ??? Cope with user tricks that amount to offsetof. The middle-end is
1317 not prepared to deal with them if they occur in initializers. */
1325 ret = in_init
1328 else
1333 {
1337 }
1339 {
1342 CASE_CONVERT:
1343 /* Don't warn about explicit conversions. We will already
1344 have warned about suspect implicit conversions. */
1351 }
1356 /* Binary operations not necessarily evaluating both
1357 arguments. */
1364 ? truthvalue_false_node
1372 ret = in_init
1375 else
1380 && op0_const
1381 && op0_const_self
1387 && op0_const_self
1413 else
1418 && op0_const
1419 && op0_const_self
1423 && op0_const_self
1427 && op0_const
1428 && op0_const_self
1432 && op0_const_self
1438 /* Each case where an operand with excess precision may be
1439 encountered must remove the EXCESS_PRECISION_EXPR around
1440 inner operands and possibly put one around the whole
1441 expression or possibly convert to the semantic type (which
1442 c_fully_fold does); we cannot tell at this stage which is
1443 appropriate in any particular case. */
1447 /* Various codes may appear through folding built-in functions
1448 and their arguments. */
1450 }
1452 out:
1453 /* Some folding may introduce NON_LVALUE_EXPRs; all lvalue checks
1454 have been done by this point, so remove them again. */
1458 {
1462 }
1466 }
1468 /* If not optimizing, EXP is not a VAR_DECL, or EXP has array type,
1469 return EXP. Otherwise, return either EXP or its known constant
1470 value (if it has one), but return EXP if EXP has mode BLKmode. ???
1471 Is the BLKmode test appropriate? */
1473 tree
1475 {
1476 tree ret;
1478 /* This function is only used by C, for c_fully_fold and other
1479 optimization, and may not be correct for C++. */
1490 /* Avoid unwanted tree sharing between the initializer and current
1491 function's body where the tree can be modified e.g. by the
1492 gimplifier. */
1496 }
1498 /* Print a warning if a constant expression had overflow in folding.
1499 Invoke this function on every expression that the language
1500 requires to be a constant expression.
1501 Note the ANSI C standard says it is erroneous for a
1502 constant expression to overflow. */
1504 void
1506 {
1514 }
1516 /* The same as above but print an unconditional error. */
1517 void
1519 {
1526 }
1528 /* Print a warning if an expression had overflow in folding and its
1529 operands hadn't.
1531 Invoke this function on every expression that
1532 (1) appears in the source code, and
1533 (2) is a constant expression that overflowed, and
1534 (3) is not already checked by convert_and_check;
1535 however, do not invoke this function on operands of explicit casts
1536 or when the expression is the result of an operator and any operand
1537 already overflowed. */
1539 void
1541 {
1546 {
1575 }
1576 }
1578 /* Warn about uses of logical || / && operator in a context where it
1579 is likely that the bitwise equivalent was intended by the
1580 programmer. We have seen an expression in which CODE is a binary
1581 operator used to combine expressions OP_LEFT and OP_RIGHT, which before folding
1582 had CODE_LEFT and CODE_RIGHT, into an expression of type TYPE. */
1583 void
1587 {
1599 /* Warn if &&/|| are being used in a context where it is
1600 likely that the bitwise equivalent was intended by the
1601 programmer. That is, an expression such as op && MASK
1602 where op should not be any boolean expression, nor a
1603 constant, and mask seems to be a non-boolean integer constant. */
1611 {
1615 else
1620 }
1622 /* We do not warn for constants because they are typical of macro
1623 expansions that test for features. */
1627 /* This warning only makes sense with logical operands. */
1635 /* We first test whether either side separately is trivially true
1636 (with OR) or trivially false (with AND). If so, do not warn.
1637 This is a common idiom for testing ranges of data types in
1638 portable code. */
1645 /* If this is an OR operation, invert both sides; now, the result
1646 should be always false to get a warning. */
1660 /* If this is an OR operation, invert both sides; now, the result
1661 should be always false to get a warning. */
1669 /* If both expressions have the same operand, if we can merge the
1670 ranges, and if the range test is always false, then warn. */
1677 {
1680 "logical %<or%> "
1682 else
1684 "logical %<and%> "
1686 }
1687 }
1690 /* Warn if EXP contains any computations whose results are not used.
1691 Return true if a warning is printed; false otherwise. LOCUS is the
1692 (potential) location of the expression. */
1694 bool
1696 {
1697 restart:
1701 /* Don't warn about void constructs. This includes casting to void,
1702 void function calls, and statement expressions with a final cast
1703 to void. */
1711 {
1727 /* For a binding, warn if no side effect within it. */
1739 /* In && or ||, warn if 2nd operand has no side effect. */
1746 /* Let people do `(foo (), 0)' without a warning. */
1753 /* If this is an expression with side effects, don't warn; this
1754 case commonly appears in macro expansions. */
1760 /* Don't warn about automatic dereferencing of references, since
1761 the user cannot control it. */
1763 {
1766 }
1767 /* Fall through. */
1770 /* Referencing a volatile value is a side effect, so don't warn. */
1775 /* If this is an expression which has no operands, there is no value
1776 to be unused. There are no such language-independent codes,
1777 but front ends may define such. */
1781 warn:
1783 }
1784 }
1787 /* Print a warning about casts that might indicate violation
1788 of strict aliasing rules if -Wstrict-aliasing is used and
1789 strict aliasing mode is in effect. OTYPE is the original
1790 TREE_TYPE of EXPR, and TYPE the type we're casting to. */
1792 bool
1794 {
1795 /* Strip pointer conversion chains and get to the correct original type. */
1803 /* If the type we are casting to is a ref-all pointer
1804 dereferencing it is always valid. */
1811 {
1812 /* Casting the address of an object to non void pointer. Warn
1813 if the cast breaks type based aliasing. */
1815 {
1819 }
1820 else
1821 {
1822 /* warn_strict_aliasing >= 3. This includes the default (3).
1823 Only warn if the cast is dereferenced immediately. */
1824 alias_set_type set1 =
1830 {
1834 }
1837 {
1841 }
1842 }
1843 }
1844 else
1846 {
1847 /* At this level, warn for any conversions, even if an address is
1848 not taken in the same statement. This will likely produce many
1849 false positives, but could be useful to pinpoint problems that
1850 are not revealed at higher levels. */
1855 {
1859 }
1860 }
1863 }
1865 /* Warn about memset (&a, 0, sizeof (&a)); and similar mistakes with
1866 sizeof as last operand of certain builtins. */
1868 void
1872 {
1876 location_t loc;
1884 {
1888 /* FALLTHRU */
1896 /* FALLTHRU */
1955 }
1983 {
1987 {
1990 "argument to %<sizeof%> in %qD call is the same "
1991 "expression as the destination; did you mean to "
1997 "argument to %<sizeof%> in %qD call is the same "
1998 "expression as the destination; did you mean to "
2000 else
2002 "argument to %<sizeof%> in %qD call is the same "
2003 "expression as the destination; did you mean to "
2006 }
2009 && !strop
2012 {
2014 "argument to %<sizeof%> in %qD call is the same "
2015 "pointer type %qT as the destination; expected %qT "
2019 }
2020 }
2023 {
2027 {
2030 "argument to %<sizeof%> in %qD call is the same "
2031 "expression as the source; did you mean to "
2037 "argument to %<sizeof%> in %qD call is the same "
2038 "expression as the source; did you mean to "
2040 else
2042 "argument to %<sizeof%> in %qD call is the same "
2043 "expression as the source; did you mean to "
2046 }
2049 && !strop
2052 {
2054 "argument to %<sizeof%> in %qD call is the same "
2055 "pointer type %qT as the source; expected %qT "
2059 }
2060 }
2063 {
2067 {
2070 "argument to %<sizeof%> in %qD call is the same "
2071 "expression as the first source; did you mean to "
2077 "argument to %<sizeof%> in %qD call is the same "
2078 "expression as the first source; did you mean to "
2080 else
2082 "argument to %<sizeof%> in %qD call is the same "
2083 "expression as the first source; did you mean to "
2086 }
2089 && !strop
2092 {
2094 "argument to %<sizeof%> in %qD call is the same "
2095 "pointer type %qT as the first source; expected %qT "
2099 }
2100 }
2103 {
2107 {
2110 "argument to %<sizeof%> in %qD call is the same "
2111 "expression as the second source; did you mean to "
2117 "argument to %<sizeof%> in %qD call is the same "
2118 "expression as the second source; did you mean to "
2120 else
2122 "argument to %<sizeof%> in %qD call is the same "
2123 "expression as the second source; did you mean to "
2126 }
2129 && !strop
2132 {
2134 "argument to %<sizeof%> in %qD call is the same "
2135 "pointer type %qT as the second source; expected %qT "
2139 }
2140 }
2142 }
2144 /* Warn for unlikely, improbable, or stupid DECL declarations
2145 of `main'. */
2147 void
2149 {
2150 function_args_iterator iter;
2151 tree type;
2155 {
2156 /* XXX void_type_node belies the abstraction. */
2162 {
2184 "third argument of %q+D should probably be "
2187 }
2188 }
2190 /* It is intentional that this message does not mention the third
2191 argument because it's only mentioned in an appendix of the
2192 standard. */
2196 }
2198 /* True if pointers to distinct types T1 and T2 can be converted to
2199 each other without an explicit cast. Only returns true for opaque
2200 vector types. */
2201 bool
2203 {
2210 }
2212 /* True if vector types T1 and T2 can be converted to each other
2213 without an explicit cast. If EMIT_LAX_NOTE is true, and T1 and T2
2214 can only be converted with -flax-vector-conversions yet that is not
2215 in effect, emit a note telling the user about that option if such
2216 a note has not previously been emitted. */
2217 bool
2219 {
2227 convertible_lax =
2242 {
2245 "conversions between vectors with differing "
2247 }
2250 }
2252 /* Build a VEC_PERM_EXPR if V0, V1 and MASK are not error_mark_nodes
2253 and have vector types, V0 has the same type as V1, and the number of
2254 elements of V0, V1, MASK is the same.
2256 In case V1 is a NULL_TREE it is assumed that __builtin_shuffle was
2257 called with two arguments. In this case implementation passes the
2258 first argument twice in order to share the same tree code. This fact
2259 could enable the mask-values being twice the vector length. This is
2260 an implementation accident and this semantics is not guaranteed to
2261 the user. */
2262 tree
2264 {
2265 tree ret;
2271 {
2274 }
2282 {
2286 }
2290 {
2293 }
2296 {
2300 }
2306 {
2308 "argument vector(s) and the mask vector should "
2311 }
2315 {
2319 }
2322 {
2323 /* Avoid C_MAYBE_CONST_EXPRs inside VEC_PERM_EXPR. */
2329 else
2330 {
2333 }
2337 }
2345 }
2347 /* Like tree.c:get_narrower, but retain conversion from C++0x scoped enum
2348 to integral type. */
2350 static tree
2352 {
2357 {
2358 /* C++0x scoped enumerations don't implicitly convert to integral
2359 type; if we stripped an explicit conversion to a larger type we
2360 need to replace it so common_type will still work. */
2364 }
2366 }
2368 /* This is a helper function of build_binary_op.
2370 For certain operations if both args were extended from the same
2371 smaller type, do the arithmetic in that type and then extend.
2373 BITWISE indicates a bitwise operation.
2374 For them, this optimization is safe only if
2375 both args are zero-extended or both are sign-extended.
2376 Otherwise, we might change the result.
2377 Eg, (short)-1 | (unsigned short)-1 is (int)-1
2378 but calculated in (unsigned short) it would be (unsigned short)-1.
2379 */
2380 tree
2382 {
2386 tree type;
2388 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
2389 excessive narrowing when we call get_narrower below. For
2390 example, suppose that OP0 is of unsigned int extended
2391 from signed char and that RESULT_TYPE is long long int.
2392 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
2393 like
2395 (long long int) (unsigned int) signed_char
2397 which get_narrower would narrow down to
2399 (unsigned int) signed char
2401 If we do not cast OP0 first, get_narrower would return
2402 signed_char, which is inconsistent with the case of the
2403 explicit cast. */
2410 /* UNS is 1 if the operation to be done is an unsigned one. */
2413 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
2414 but it *requires* conversion to FINAL_TYPE. */
2425 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
2427 /* For bitwise operations, signedness of nominal type
2428 does not matter. Consider only how operands were extended. */
2432 /* Note that in all three cases below we refrain from optimizing
2433 an unsigned operation on sign-extended args.
2434 That would not be valid. */
2436 /* Both args variable: if both extended in same way
2437 from same width, do it in that width.
2438 Do it unsigned if args were zero-extended. */
2445 return c_common_signed_or_unsigned_type
2452 && (type
2463 && (type
2471 }
2473 /* Checks if expression EXPR of real/integer type cannot be converted
2474 to the real/integer type TYPE. Function returns true when:
2475 * EXPR is a constant which cannot be exactly converted to TYPE
2476 * EXPR is not a constant and size of EXPR's type > than size of TYPE,
2477 for EXPR type and TYPE being both integers or both real.
2478 * EXPR is not a constant of real type and TYPE is an integer.
2479 * EXPR is not a constant of integer type which cannot be
2480 exactly converted to real type.
2481 Function allows conversions between types of different signedness and
2482 does not return true in that case. Function can produce signedness
2483 warnings if PRODUCE_WARNS is true. */
2484 bool
2486 {
2492 {
2493 /* Warn for real constant that is not an exact integer converted
2494 to integer type. */
2497 {
2500 }
2501 /* Warn for an integer constant that does not fit into integer type. */
2505 {
2508 {
2512 }
2514 {
2518 }
2519 else
2521 }
2523 {
2524 /* Warn for an integer constant that does not fit into real type. */
2526 {
2530 }
2531 /* Warn for a real constant that does not fit into a smaller
2532 real type. */
2535 {
2539 }
2540 }
2541 }
2542 else
2543 {
2544 /* Warn for real types converted to integer types. */
2551 {
2552 /* Don't warn about unsigned char y = 0xff, x = (int) y; */
2556 /* Don't warn for short y; short x = ((int)y & 0xff); */
2560 {
2561 /* If both args were extended from a shortest type,
2562 use that type if that is safe. */
2569 {
2575 /* If one of the operands is a non-negative constant
2576 that fits in the target type, then the type of the
2577 other operand does not matter. */
2586 /* If constant is unsigned and fits in the target
2587 type, then the result will also fit. */
2589 && unsigned0
2592 && unsigned1
2595 }
2596 }
2597 /* Warn for integer types converted to smaller integer types. */
2601 /* When they are the same width but different signedness,
2602 then the value may change. */
2605 /* Even when converted to a bigger type, if the type is
2606 unsigned but expr is signed, then negative values
2607 will be changed. */
2613 }
2615 /* Warn for integer types converted to real types if and only if
2616 all the range of values of the integer type cannot be
2617 represented by the real type. */
2620 {
2624 /* Don't warn about char y = 0xff; float x = (int) y; */
2636 }
2638 /* Warn for real types converted to smaller real types. */
2643 }
2646 }
2648 /* Warns if the conversion of EXPR to TYPE may alter a value.
2649 This is a helper function for warnings_for_convert_and_check. */
2651 static void
2653 {
2661 {
2674 /* Conversion from boolean to a signed:1 bit-field (which only
2675 can hold the values 0 and -1) doesn't lose information - but
2676 it does change the value. */
2691 {
2692 /* In case of COND_EXPR, we do not care about the type of
2693 COND_EXPR, only about the conversion of each operand. */
2700 }
2707 }
2708 }
2710 /* Produce warnings after a conversion. RESULT is the result of
2711 converting EXPR to TYPE. This is a helper function for
2712 convert_and_check and cp_convert_and_check. */
2714 void
2716 {
2723 {
2724 /* Do not diagnose overflow in a constant expression merely
2725 because a conversion overflowed. */
2730 {
2731 /* This detects cases like converting -129 or 256 to
2732 unsigned char. */
2736 else
2738 }
2742 /* No warning for converting 0x80000000 to int. */
2750 else
2752 }
2757 else
2759 }
2762 /* Convert EXPR to TYPE, warning about conversion problems with constants.
2763 Invoke this function on every expression that is converted implicitly,
2764 i.e. because of language rules and not because of an explicit cast. */
2766 tree
2768 {
2769 tree result;
2770 tree expr_for_warning;
2772 /* Convert from a value with possible excess precision rather than
2773 via the semantic type, but do not warn about values not fitting
2774 exactly in the semantic type. */
2776 {
2782 }
2783 else
2797 }
2798 \f
2799 /* A node in a list that describes references to variables (EXPR), which are
2800 either read accesses if WRITER is zero, or write accesses, in which case
2801 WRITER is the parent of EXPR. */
2802 struct tlist
2803 {
2806 };
2808 /* Used to implement a cache the results of a call to verify_tree. We only
2809 use this for SAVE_EXPRs. */
2810 struct tlist_cache
2811 {
2815 tree expr;
2816 };
2818 /* Obstack to use when allocating tlist structures, and corresponding
2819 firstobj. */
2823 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
2824 warnings. */
2826 /* SAVE_EXPRs need special treatment. We process them only once and then
2827 cache the results. */
2839 /* Create a new struct tlist and fill in its fields. */
2842 {
2849 }
2851 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
2852 is nonnull, we ignore any node we find which has a writer equal to it. */
2854 static void
2856 {
2858 {
2865 }
2866 }
2868 /* Merge the nodes of ADD into TO. This merging process is done so that for
2869 each variable that already exists in TO, no new node is added; however if
2870 there is a write access recorded in ADD, and an occurrence on TO is only
2871 a read access, then the occurrence in TO will be modified to record the
2872 write. */
2874 static void
2876 {
2883 {
2890 {
2894 }
2896 {
2900 }
2902 }
2903 }
2905 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
2906 references in list LIST conflict with it, excluding reads if ONLY writers
2907 is nonzero. */
2909 static void
2912 {
2915 /* Avoid duplicate warnings. */
2921 {
2925 {
2930 }
2932 }
2933 }
2935 /* Given a list LIST of references to variables, find whether any of these
2936 can cause conflicts due to missing sequence points. */
2938 static void
2940 {
2944 {
2947 }
2948 }
2950 /* Return nonzero if X is a tree that can be verified by the sequence point
2951 warnings. */
2952 static int
2954 {
2961 /* VOID_TYPE_P (TREE_TYPE (x)) is workaround for cp/tree.c
2962 (lvalue_p) crash on TRY/CATCH. */
2969 /* No point to track non-const calls, they will never satisfy
2970 operand_equal_p. */
2978 }
2980 /* Return nonzero if X and Y appear to be the same candidate (or NULL) */
2981 static bool
2983 {
2985 }
2987 /* Walk the tree X, and record accesses to variables. If X is written by the
2988 parent tree, WRITER is the parent.
2989 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
2990 expression or its only operand forces a sequence point, then everything up
2991 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
2992 in PNO_SP.
2993 Once we return, we will have emitted warnings if any subexpression before
2994 such a sequence point could be undefined. On a higher level, however, the
2995 sequence point may not be relevant, and we'll merge the two lists.
2997 Example: (b++, a) + b;
2998 The call that processes the COMPOUND_EXPR will store the increment of B
2999 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
3000 processes the PLUS_EXPR will need to merge the two lists so that
3001 eventually, all accesses end up on the same list (and we'll warn about the
3002 unordered subexpressions b++ and b.
3004 A note on merging. If we modify the former example so that our expression
3005 becomes
3006 (b++, b) + a
3007 care must be taken not simply to add all three expressions into the final
3008 PNO_SP list. The function merge_tlist takes care of that by merging the
3009 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
3010 way, so that no more than one access to B is recorded. */
3012 static void
3014 tree writer)
3015 {
3020 /* X may be NULL if it is the operand of an empty statement expression
3021 ({ }). */
3025 restart:
3033 {
3066 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
3067 two first, to avoid warning for (a ? b++ : b++). */
3083 /* Expressions inside the LHS are not ordered wrt. the sequence points
3084 in the RHS. Example:
3085 *a = (a++, 2)
3086 Despite the fact that the modification of "a" is in the before_sp
3087 list (tmp_before), it conflicts with the use of "a" in the LHS.
3088 We can handle this by adding the contents of tmp_list3
3089 to those of tmp_before, and redoing the collision warnings for that
3090 list. */
3093 /* Exclude the LHS itself here; we first have to merge it into the
3094 tmp_nosp list. This is done to avoid warning for "a = a"; if we
3095 didn't exclude the LHS, we'd get it twice, once as a read and once
3096 as a write. */
3107 /* We need to warn about conflicts among arguments and conflicts between
3108 args and the function address. Side effects of the function address,
3109 however, are not ordered by the sequence point of the call. */
3110 {
3111 call_expr_arg_iterator iter;
3112 tree arg;
3116 {
3121 }
3126 }
3129 /* Scan all the list, e.g. indices of multi dimensional array. */
3131 {
3137 }
3141 {
3148 {
3160 {
3164 }
3167 }
3171 }
3181 /* For other expressions, simply recurse on their operands.
3182 Manual tail recursion for unary expressions.
3183 Other non-expressions need not be processed. */
3185 {
3189 }
3191 {
3195 {
3200 }
3201 }
3203 }
3204 }
3206 /* Try to warn for undefined behavior in EXPR due to missing sequence
3207 points. */
3209 DEBUG_FUNCTION void
3211 {
3217 {
3220 }
3225 }
3226 \f
3227 /* Validate the expression after `case' and apply default promotions. */
3229 static tree
3231 {
3236 /* Promote char or short to int. */
3239 {
3242 }
3247 }
3248 \f
3249 /* See if the case values LOW and HIGH are in the range of the original
3250 type (i.e. before the default conversion to int) of the switch testing
3251 expression.
3252 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
3253 the type before promoting it. CASE_LOW_P is a pointer to the lower
3254 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
3255 if the case is not a case range.
3256 The caller has to make sure that we are not called with NULL for
3257 CASE_LOW_P (i.e. the default case).
3258 Returns true if the case label is in range of ORIG_TYPE (saturated or
3259 untouched) or false if the label is out of range. */
3261 static bool
3264 {
3269 /* If there was a problem with the original type, do nothing. */
3276 /* Case label is less than minimum for type. */
3279 {
3282 }
3284 /* Case value is greater than maximum for type. */
3287 {
3290 }
3292 /* Saturate lower case label value to minimum. */
3295 {
3299 }
3301 /* Saturate upper case label value to maximum. */
3304 {
3308 }
3316 }
3317 \f
3318 /* Return an integer type with BITS bits of precision,
3319 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
3321 tree
3323 {
3362 }
3364 /* Return a fixed-point type that has at least IBIT ibits and FBIT fbits
3365 that is unsigned if UNSIGNEDP is nonzero, otherwise signed;
3366 and saturating if SATP is nonzero, otherwise not saturating. */
3368 tree
3371 {
3375 else
3383 {
3385 "fixed-point types that have too many integral and "
3388 }
3391 }
3393 /* Used for communication between c_common_type_for_mode and
3394 c_register_builtin_type. */
3397 /* Return a data type that has machine mode MODE.
3398 If the mode is an integer,
3399 then UNSIGNEDP selects between signed and unsigned types.
3400 If the mode is a fixed-point mode,
3401 then UNSIGNEDP selects between saturating and nonsaturating types. */
3403 tree
3405 {
3406 tree t;
3443 #if HOST_BITS_PER_WIDE_INT >= 64
3446 #endif
3471 {
3473 tree inner_type;
3489 }
3491 {
3496 }
3506 {
3592 }
3600 }
3602 tree
3604 {
3606 }
3608 /* Return a signed type the same as TYPE in other respects. */
3610 tree
3612 {
3614 }
3616 /* Return a type the same as TYPE except unsigned or
3617 signed according to UNSIGNEDP. */
3619 tree
3621 {
3622 tree type1;
3624 /* This block of code emulates the behavior of the old
3625 c_common_unsigned_type. In particular, it returns
3626 long_unsigned_type_node if passed a long, even when a int would
3627 have the same size. This is necessary for warnings to work
3628 correctly in archs where sizeof(int) == sizeof(long) */
3631 if (type1 == signed_char_type_node || type1 == char_type_node || type1 == unsigned_char_type_node)
3647 #if HOST_BITS_PER_WIDE_INT >= 64
3650 #endif
3660 #define C_COMMON_FIXED_TYPES(NAME) \
3661 if (type1 == short_ ## NAME ## _type_node \
3662 || type1 == unsigned_short_ ## NAME ## _type_node) \
3663 return unsignedp ? unsigned_short_ ## NAME ## _type_node \
3664 : short_ ## NAME ## _type_node; \
3665 if (type1 == NAME ## _type_node \
3666 || type1 == unsigned_ ## NAME ## _type_node) \
3667 return unsignedp ? unsigned_ ## NAME ## _type_node \
3668 : NAME ## _type_node; \
3669 if (type1 == long_ ## NAME ## _type_node \
3670 || type1 == unsigned_long_ ## NAME ## _type_node) \
3671 return unsignedp ? unsigned_long_ ## NAME ## _type_node \
3672 : long_ ## NAME ## _type_node; \
3673 if (type1 == long_long_ ## NAME ## _type_node \
3674 || type1 == unsigned_long_long_ ## NAME ## _type_node) \
3675 return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \
3676 : long_long_ ## NAME ## _type_node;
3678 #define C_COMMON_FIXED_MODE_TYPES(NAME) \
3679 if (type1 == NAME ## _type_node \
3680 || type1 == u ## NAME ## _type_node) \
3681 return unsignedp ? u ## NAME ## _type_node \
3682 : NAME ## _type_node;
3684 #define C_COMMON_FIXED_TYPES_SAT(NAME) \
3685 if (type1 == sat_ ## short_ ## NAME ## _type_node \
3686 || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \
3687 return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \
3688 : sat_ ## short_ ## NAME ## _type_node; \
3689 if (type1 == sat_ ## NAME ## _type_node \
3690 || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \
3691 return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \
3692 : sat_ ## NAME ## _type_node; \
3693 if (type1 == sat_ ## long_ ## NAME ## _type_node \
3694 || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \
3695 return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \
3696 : sat_ ## long_ ## NAME ## _type_node; \
3697 if (type1 == sat_ ## long_long_ ## NAME ## _type_node \
3698 || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \
3699 return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \
3700 : sat_ ## long_long_ ## NAME ## _type_node;
3702 #define C_COMMON_FIXED_MODE_TYPES_SAT(NAME) \
3703 if (type1 == sat_ ## NAME ## _type_node \
3704 || type1 == sat_ ## u ## NAME ## _type_node) \
3705 return unsignedp ? sat_ ## u ## NAME ## _type_node \
3706 : sat_ ## NAME ## _type_node;
3732 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
3733 the precision; they have precision set to match their range, but
3734 may use a wider mode to match an ABI. If we change modes, we may
3735 wind up with bad conversions. For INTEGER_TYPEs in C, must check
3736 the precision as well, so as to yield correct results for
3737 bit-field types. C++ does not have these separate bit-field
3738 types, and producing a signed or unsigned variant of an
3739 ENUMERAL_TYPE may cause other problems as well. */
3745 #define TYPE_OK(node) \
3746 (TYPE_MODE (type) == TYPE_MODE (node) \
3747 && TYPE_PRECISION (type) == TYPE_PRECISION (node))
3766 #if HOST_BITS_PER_WIDE_INT >= 64
3769 #endif
3778 #undef TYPE_OK
3781 }
3783 /* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */
3785 tree
3787 {
3788 /* Extended integer types of the same width as a standard type have
3789 lesser rank, so those of the same width as int promote to int or
3790 unsigned int and are valid for printf formats expecting int or
3791 unsigned int. To avoid such special cases, avoid creating
3792 extended integer types for bit-fields if a standard integer type
3793 is available. */
3810 }
3812 /* The C version of the register_builtin_type langhook. */
3814 void
3816 {
3817 tree decl;
3827 }
3828 \f
3829 /* Print an error message for invalid operands to arith operation
3830 CODE with TYPE0 for operand 0, and TYPE1 for operand 1.
3831 LOCATION is the location of the message. */
3833 void
3836 {
3840 {
3885 }
3889 }
3890 \f
3891 /* Given an expression as a tree, return its original type. Do this
3892 by stripping any conversion that preserves the sign and precision. */
3893 static tree
3895 {
3898 }
3900 /* Subroutine of build_binary_op, used for comparison operations.
3901 See if the operands have both been converted from subword integer types
3902 and, if so, perhaps change them both back to their original type.
3903 This function is also responsible for converting the two operands
3904 to the proper common type for comparison.
3906 The arguments of this function are all pointers to local variables
3907 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
3908 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
3910 If this function returns nonzero, it means that the comparison has
3911 a constant value. What this function returns is an expression for
3912 that value. */
3914 tree
3917 {
3918 tree type;
3927 /* Throw away any conversions to wider types
3928 already present in the operands. */
3933 /* If primopN is first sign-extended from primopN's precision to opN's
3934 precision, then zero-extended from opN's precision to
3935 *restype_ptr precision, shortenings might be invalid. */
3938 && !unsignedp0
3943 && !unsignedp1
3947 /* Handle the case that OP0 does not *contain* a conversion
3948 but it *requires* conversion to FINAL_TYPE. */
3955 /* If one of the operands must be floated, we cannot optimize. */
3959 /* If first arg is constant, swap the args (changing operation
3960 so value is preserved), for canonicalization. Don't do this if
3961 the second arg is 0. */
3966 {
3983 {
3998 }
4000 }
4002 /* If comparing an integer against a constant more bits wide,
4003 maybe we can deduce a value of 1 or 0 independent of the data.
4004 Or else truncate the constant now
4005 rather than extend the variable at run time.
4007 This is only interesting if the constant is the wider arg.
4008 Also, it is not safe if the constant is unsigned and the
4009 variable arg is signed, since in this case the variable
4010 would be sign-extended and then regarded as unsigned.
4011 Our technique fails in this case because the lowest/highest
4012 possible unsigned results don't follow naturally from the
4013 lowest/highest possible values of the variable operand.
4014 For just EQ_EXPR and NE_EXPR there is another technique that
4015 could be used: see if the constant can be faithfully represented
4016 in the other operand's type, by truncating it and reextending it
4017 and see if that preserves the constant's value. */
4023 {
4026 /* 1 if comparison is nominally unsigned. */
4028 tree val;
4040 {
4041 /* Convert primop1 to target type, but do not introduce
4042 additional overflow. We know primop1 is an int_cst. */
4046 }
4048 {
4051 }
4054 {
4059 }
4060 else
4061 {
4066 }
4069 /* This used to be a switch, but Genix compiler can't handle that. */
4071 {
4074 }
4076 {
4079 }
4081 {
4086 }
4088 {
4093 }
4095 {
4100 }
4102 {
4107 }
4109 /* If primop0 was sign-extended and unsigned comparison specd,
4110 we did a signed comparison above using the signed type bounds.
4111 But the comparison we output must be unsigned.
4113 Also, for inequalities, VAL is no good; but if the signed
4114 comparison had *any* fixed result, it follows that the
4115 unsigned comparison just tests the sign in reverse
4116 (positive values are LE, negative ones GE).
4117 So we can generate an unsigned comparison
4118 against an extreme value of the signed type. */
4121 {
4124 {
4139 }
4141 }
4145 {
4152 }
4155 {
4156 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4160 }
4162 /* Value is not predetermined, but do the comparison
4163 in the type of the operand that is not constant.
4164 TYPE is already properly set. */
4165 }
4167 /* If either arg is decimal float and the other is float, find the
4168 proper common type to use for comparison. */
4179 /* If args' natural types are both narrower than nominal type
4180 and both extend in the same manner, compare them
4181 in the type of the wider arg.
4182 Otherwise must actually extend both to the nominal
4183 common type lest different ways of extending
4184 alter the result.
4185 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
4190 {
4194 type);
4195 /* Make sure shorter operand is extended the right way
4196 to match the longer operand. */
4197 primop0
4200 primop0);
4201 primop1
4204 primop1);
4205 }
4206 else
4207 {
4208 /* Here we must do the comparison on the nominal type
4209 using the args exactly as we received them. */
4216 {
4218 /* All unsigned values are >= 0, so we warn. However,
4219 if OP0 is a constant that is >= 0, the signedness of
4220 the comparison isn't an issue, so suppress the
4221 warning. */
4223 warn_type_limits && !in_system_header
4227 primop0)))
4228 /* Do not warn for enumeration types. */
4232 {
4249 }
4252 {
4253 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4258 }
4259 }
4260 }
4268 }
4269 \f
4270 /* Return a tree for the sum or difference (RESULTCODE says which)
4271 of pointer PTROP and integer INTOP. */
4273 tree
4276 {
4279 /* The result is a pointer of the same type that is being added. */
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_sanitize_address" attribute; arguments as in
6509 struct attribute_spec.handler. */
6511 static tree
6514 {
6516 {
6519 }
6522 }
6524 /* Handle a "no_address_safety_analysis" attribute; arguments as in
6525 struct attribute_spec.handler. */
6527 static tree
6530 {
6539 }
6541 /* Handle a "noinline" attribute; arguments as in
6542 struct attribute_spec.handler. */
6544 static tree
6548 {
6551 else
6552 {
6555 }
6558 }
6560 /* Handle a "noclone" attribute; arguments as in
6561 struct attribute_spec.handler. */
6563 static tree
6567 {
6569 {
6572 }
6575 }
6577 /* Handle a "always_inline" attribute; arguments as in
6578 struct attribute_spec.handler. */
6580 static tree
6585 {
6587 {
6588 /* Set the attribute and mark it for disregarding inline
6589 limits. */
6591 }
6592 else
6593 {
6596 }
6599 }
6601 /* Handle a "gnu_inline" attribute; arguments as in
6602 struct attribute_spec.handler. */
6604 static tree
6609 {
6611 {
6612 /* Do nothing else, just set the attribute. We'll get at
6613 it later with lookup_attribute. */
6614 }
6615 else
6616 {
6619 }
6622 }
6624 /* Handle a "leaf" attribute; arguments as in
6625 struct attribute_spec.handler. */
6627 static tree
6631 {
6633 {
6636 }
6638 {
6641 }
6644 }
6646 /* Handle an "artificial" attribute; arguments as in
6647 struct attribute_spec.handler. */
6649 static tree
6654 {
6656 {
6657 /* Do nothing else, just set the attribute. We'll get at
6658 it later with lookup_attribute. */
6659 }
6660 else
6661 {
6664 }
6667 }
6669 /* Handle a "flatten" attribute; arguments as in
6670 struct attribute_spec.handler. */
6672 static tree
6674 tree args ATTRIBUTE_UNUSED,
6676 {
6678 /* Do nothing else, just set the attribute. We'll get at
6679 it later with lookup_attribute. */
6680 ;
6681 else
6682 {
6685 }
6688 }
6690 /* Handle a "warning" or "error" attribute; arguments as in
6691 struct attribute_spec.handler. */
6693 static tree
6696 {
6699 /* Do nothing else, just set the attribute. We'll get at
6700 it later with lookup_attribute. */
6701 ;
6702 else
6703 {
6706 }
6709 }
6711 /* Handle a "used" attribute; arguments as in
6712 struct attribute_spec.handler. */
6714 static tree
6717 {
6723 {
6728 }
6729 else
6730 {
6733 }
6736 }
6738 /* Handle a "unused" attribute; arguments as in
6739 struct attribute_spec.handler. */
6741 static tree
6744 {
6746 {
6754 {
6759 }
6760 else
6761 {
6764 }
6765 }
6766 else
6767 {
6771 }
6774 }
6776 /* Handle a "externally_visible" attribute; arguments as in
6777 struct attribute_spec.handler. */
6779 static tree
6784 {
6788 {
6791 {
6795 }
6796 }
6797 else
6798 {
6801 }
6804 }
6806 /* Handle a "const" attribute; arguments as in
6807 struct attribute_spec.handler. */
6809 static tree
6812 {
6815 /* See FIXME comment on noreturn in c_common_attribute_table. */
6821 = build_pointer_type
6824 else
6825 {
6828 }
6831 }
6833 /* Handle a "transparent_union" attribute; arguments as in
6834 struct attribute_spec.handler. */
6836 static tree
6840 {
6841 tree type;
6852 {
6853 /* Make sure that the first field will work for a transparent union.
6854 If the type isn't complete yet, leave the check to the code in
6855 finish_struct. */
6857 {
6863 }
6866 {
6867 /* If the type isn't complete yet, setting the flag
6868 on a variant wouldn't ever be checked. */
6872 /* build_duplicate_type doesn't work for C++. */
6876 /* A type variant isn't good enough, since we don't a cast
6877 to such a type removed as a no-op. */
6879 }
6883 }
6885 ignored:
6888 }
6890 /* Subroutine of handle_{con,de}structor_attribute. Evaluate ARGS to
6891 get the requested priority for a constructor or destructor,
6892 possibly issuing diagnostics for invalid or reserved
6893 priorities. */
6895 static priority_type
6897 {
6898 HOST_WIDE_INT pri;
6899 tree arg;
6905 {
6908 else
6911 }
6924 {
6927 "destructor priorities from 0 to %d are reserved "
6929 MAX_RESERVED_INIT_PRIORITY);
6930 else
6932 "constructor priorities from 0 to %d are reserved "
6934 MAX_RESERVED_INIT_PRIORITY);
6935 }
6938 invalid:
6941 MAX_INIT_PRIORITY);
6942 else
6944 MAX_INIT_PRIORITY);
6946 }
6948 /* Handle a "constructor" attribute; arguments as in
6949 struct attribute_spec.handler. */
6951 static tree
6955 {
6962 {
6963 priority_type priority;
6968 }
6969 else
6970 {
6973 }
6976 }
6978 /* Handle a "destructor" attribute; arguments as in
6979 struct attribute_spec.handler. */
6981 static tree
6985 {
6992 {
6993 priority_type priority;
6998 }
6999 else
7000 {
7003 }
7006 }
7008 /* Nonzero if the mode is a valid vector mode for this architecture.
7009 This returns nonzero even if there is no hardware support for the
7010 vector mode, but we can emulate with narrower modes. */
7012 static int
7014 {
7018 /* Doh! What's going on? */
7027 /* Hardware support. Woo hoo! */
7033 /* We should probably return 1 if requesting V4DI and we have no DI,
7034 but we have V2DI, but this is probably very unlikely. */
7036 /* If we have support for the inner mode, we can safely emulate it.
7037 We may not have V2DI, but me can emulate with a pair of DIs. */
7039 }
7042 /* Handle a "mode" attribute; arguments as in
7043 struct attribute_spec.handler. */
7045 static tree
7048 {
7056 else
7057 {
7062 tree typefm;
7067 {
7073 }
7075 /* Change this type to have a type with the specified mode.
7076 First check for the special modes. */
7089 else
7092 {
7095 }
7098 {
7101 }
7105 {
7137 }
7139 {
7142 }
7145 {
7150 {
7153 }
7157 else
7160 }
7161 else
7162 {
7163 /* For fixed-point modes, we need to test if the signness of type
7164 and the machine mode are consistent. */
7167 {
7170 }
7171 /* For fixed-point modes, we need to pass saturating info. */
7175 }
7178 {
7181 }
7183 {
7184 /* For enumeral types, copy the precision from the integer
7185 type returned above. If not an INTEGER_TYPE, we can't use
7186 this mode for this type. */
7188 {
7191 }
7194 {
7197 }
7198 else
7199 {
7200 /* We cannot build a type variant, as there's code that assumes
7201 that TYPE_MAIN_VARIANT has the same mode. This includes the
7202 debug generators. Instead, create a subrange type. This
7203 results in all of the enumeral values being emitted only once
7204 in the original, and the subtype gets them by reference. */
7207 else
7210 }
7211 }
7215 {
7218 }
7221 }
7224 }
7226 /* Handle a "section" attribute; arguments as in
7227 struct attribute_spec.handler. */
7229 static tree
7232 {
7236 {
7242 {
7246 {
7248 "section attribute cannot be specified for "
7251 }
7253 /* The decl may have already been given a section attribute
7254 from a previous declaration. Ensure they match. */
7258 {
7262 }
7266 {
7269 }
7270 else
7272 }
7273 else
7274 {
7277 }
7278 }
7279 else
7280 {
7284 }
7287 }
7289 /* Check whether ALIGN is a valid user-specified alignment. If so,
7290 return its base-2 log; if not, output an error and return -1. If
7291 ALLOW_ZERO then 0 is valid and should result in a return of -1 with
7292 no error. */
7293 int
7295 {
7300 {
7303 }
7308 {
7311 }
7313 {
7316 }
7318 }
7320 /*
7321 If in c++-11, check if the c++-11 alignment constraint with respect
7322 to fundamental alignment (in [dcl.align]) are satisfied. If not in
7323 c++-11 mode, does nothing.
7325 [dcl.align]2/ says:
7327 [* if the constant expression evaluates to a fundamental alignment,
7328 the alignment requirement of the declared entity shall be the
7329 specified fundamental alignment.
7331 * if the constant expression evaluates to an extended alignment
7332 and the implementation supports that alignment in the context
7333 of the declaration, the alignment of the declared entity shall
7334 be that alignment
7336 * if the constant expression evaluates to an extended alignment
7337 and the implementation does not support that alignment in the
7338 context of the declaration, the program is ill-formed]. */
7340 static bool
7344 {
7357 {
7359 {
7360 /* For file scope variables and static members, the target
7361 supports alignments that are at most
7362 MAX_OFILE_ALIGNMENT. */
7365 }
7366 else
7367 {
7368 #ifdef BIGGEST_FIELD_ALIGNMENT
7369 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_FIELD_ALIGNMENT
7370 #else
7371 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_ALIGNMENT
7372 #endif
7373 /* For non-static members, the target supports either
7374 alignments that at most either BIGGEST_FIELD_ALIGNMENT
7375 if it is defined or BIGGEST_ALIGNMENT. */
7380 #undef MAX_TARGET_FIELD_ALIGNMENT
7381 /* For stack variables, the target supports at most
7382 MAX_STACK_ALIGNMENT. */
7386 }
7387 }
7389 {
7390 /* Let's be liberal for types. */
7393 }
7401 }
7403 /* Handle a "aligned" attribute; arguments as in
7404 struct attribute_spec.handler. */
7406 static tree
7409 {
7418 {
7422 }
7430 {
7433 /* If we have a TYPE_DECL, then copy the type, so that we
7434 don't accidentally modify a builtin type. See pushdecl. */
7437 {
7444 }
7445 else
7450 }
7453 {
7456 }
7459 /* C++-11 [dcl.align/4]:
7461 When multiple alignment-specifiers are specified for an
7462 entity, the alignment requirement shall be set to the
7463 strictest specified alignment.
7465 This formally comes from the c++11 specification but we are
7466 doing it for the GNU attribute syntax as well. */
7470 {
7475 else
7479 }
7480 else
7481 {
7484 }
7487 }
7489 /* Handle a "weak" attribute; arguments as in
7490 struct attribute_spec.handler. */
7492 static tree
7497 {
7500 {
7503 }
7505 {
7509 }
7513 else
7517 }
7519 /* Handle an "alias" or "ifunc" attribute; arguments as in
7520 struct attribute_spec.handler, except that IS_ALIAS tells us
7521 whether this is an alias as opposed to ifunc attribute. */
7523 static tree
7526 {
7531 {
7534 }
7538 /* A static variable declaration is always a tentative definition,
7539 but the alias is a non-tentative definition which overrides. */
7542 {
7546 }
7550 {
7554 }
7556 /* Note that the very first time we process a nested declaration,
7557 decl_function_context will not be set. Indeed, *would* never
7558 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
7559 we do below. After such frobbery, pushdecl would set the context.
7560 In any case, this is never what we want. */
7562 {
7563 tree id;
7567 {
7571 }
7573 /* This counts as a use of the object pointed to. */
7578 else
7582 /* ifuncs are also aliases, so set that attribute too. */
7585 }
7586 else
7587 {
7590 }
7593 }
7595 /* Handle an "alias" or "ifunc" attribute; arguments as in
7596 struct attribute_spec.handler. */
7598 static tree
7601 {
7603 }
7605 /* Handle an "alias" or "ifunc" attribute; arguments as in
7606 struct attribute_spec.handler. */
7608 static tree
7611 {
7613 }
7615 /* Handle a "weakref" attribute; arguments as in struct
7616 attribute_spec.handler. */
7618 static tree
7621 {
7624 /* We must ignore the attribute when it is associated with
7625 local-scoped decls, since attribute alias is ignored and many
7626 such symbols do not even have a DECL_WEAK field. */
7628 || current_function_decl
7630 {
7634 }
7637 {
7641 }
7643 /* The idea here is that `weakref("name")' mutates into `weakref,
7644 alias("name")', and weakref without arguments, in turn,
7645 implicitly adds weak. */
7648 {
7655 }
7656 else
7657 {
7662 /* Can't call declare_weak because it wants this to be TREE_PUBLIC,
7663 and that isn't supported; and because it wants to add it to
7664 the list of weak decls, which isn't helpful. */
7666 }
7669 }
7671 /* Handle an "visibility" attribute; arguments as in
7672 struct attribute_spec.handler. */
7674 static tree
7678 {
7684 {
7688 {
7690 name);
7692 }
7694 {
7698 }
7699 }
7701 {
7704 }
7707 {
7710 }
7712 /* If this is a type, set the visibility on the type decl. */
7714 {
7719 {
7721 name);
7723 }
7724 }
7734 else
7735 {
7736 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
7738 }
7742 {
7756 }
7761 /* Go ahead and attach the attribute to the node as well. This is needed
7762 so we can determine whether we have VISIBILITY_DEFAULT because the
7763 visibility was not specified, or because it was explicitly overridden
7764 from the containing scope. */
7767 }
7769 /* Determine the ELF symbol visibility for DECL, which is either a
7770 variable or a function. It is an error to use this function if a
7771 definition of DECL is not available in this translation unit.
7772 Returns true if the final visibility has been determined by this
7773 function; false if the caller is free to make additional
7774 modifications. */
7776 bool
7778 {
7782 /* If the user explicitly specified the visibility with an
7783 attribute, honor that. DECL_VISIBILITY will have been set during
7784 the processing of the attribute. We check for an explicit
7785 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
7786 to distinguish the use of an attribute from the use of a "#pragma
7787 GCC visibility push(...)"; in the latter case we still want other
7788 considerations to be able to overrule the #pragma. */
7790 || (TARGET_DLLIMPORT_DECL_ATTRIBUTES
7795 /* Set default visibility to whatever the user supplied with
7796 visibility_specified depending on #pragma GCC visibility. */
7798 {
7801 {
7804 /* If visibility changed and DECL already has DECL_RTL, ensure
7805 symbol flags are updated. */
7810 }
7811 }
7813 }
7815 /* Handle an "tls_model" attribute; arguments as in
7816 struct attribute_spec.handler. */
7818 static tree
7821 {
7822 tree id;
7829 {
7832 }
7837 {
7840 }
7850 else
7851 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
7855 }
7857 /* Handle a "no_instrument_function" attribute; arguments as in
7858 struct attribute_spec.handler. */
7860 static tree
7865 {
7869 {
7873 }
7875 {
7879 }
7880 else
7884 }
7886 /* Handle a "malloc" attribute; arguments as in
7887 struct attribute_spec.handler. */
7889 static tree
7892 {
7896 else
7897 {
7900 }
7903 }
7905 /* Handle a "alloc_size" attribute; arguments as in
7906 struct attribute_spec.handler. */
7908 static tree
7911 {
7914 {
7921 {
7926 }
7927 }
7929 }
7931 /* Handle a "fn spec" attribute; arguments as in
7932 struct attribute_spec.handler. */
7934 static tree
7938 {
7943 }
7945 /* Handle a "returns_twice" attribute; arguments as in
7946 struct attribute_spec.handler. */
7948 static tree
7951 {
7954 else
7955 {
7958 }
7961 }
7963 /* Handle a "no_limit_stack" attribute; arguments as in
7964 struct attribute_spec.handler. */
7966 static tree
7971 {
7975 {
7979 }
7981 {
7985 }
7986 else
7990 }
7992 /* Handle a "pure" attribute; arguments as in
7993 struct attribute_spec.handler. */
7995 static tree
7998 {
8001 /* ??? TODO: Support types. */
8002 else
8003 {
8006 }
8009 }
8011 /* Digest an attribute list destined for a transactional memory statement.
8012 ALLOWED is the set of attributes that are allowed for this statement;
8013 return the attribute we parsed. Multiple attributes are never allowed. */
8015 int
8017 {
8022 {
8030 {
8033 }
8036 {
8039 }
8042 else
8044 }
8047 }
8049 /* Transform a TM attribute name into a maskable integer and back.
8050 Note that NULL (i.e. no attribute) is mapped to UNKNOWN, corresponding
8051 to how the lack of an attribute is treated. */
8053 int
8055 {
8069 }
8071 tree
8073 {
8076 {
8094 }
8096 }
8098 /* Return the first TM attribute seen in LIST. */
8100 tree
8102 {
8104 {
8108 }
8110 }
8112 /* Handle the TM attributes; arguments as in struct attribute_spec.handler.
8113 Here we accept only function types, and verify that none of the other
8114 function TM attributes are also applied. */
8115 /* ??? We need to accept class types for C++, but not C. This greatly
8116 complicates this function, since we can no longer rely on the extra
8117 processing given by function_type_required. */
8119 static tree
8122 {
8123 /* Only one path adds the attribute; others don't. */
8127 {
8130 /* Only tm_callable and tm_safe apply to classes. */
8133 /* FALLTHRU */
8137 {
8140 ;
8143 else
8145 }
8149 {
8152 {
8157 }
8158 }
8159 /* FALLTHRU */
8162 /* If a function is next, pass it on to be tried next. */
8166 ignored:
8169 }
8172 }
8174 /* Handle the TM_WRAP attribute; arguments as in
8175 struct attribute_spec.handler. */
8177 static tree
8180 {
8183 /* We don't need the attribute even on success, since we
8184 record the entry in an external table. */
8189 else
8190 {
8196 else
8197 {
8201 {
8205 else
8207 }
8208 else
8210 }
8211 }
8214 }
8216 /* Ignore the given attribute. Used when this attribute may be usefully
8217 overridden by the target, but is not used generically. */
8219 static tree
8223 {
8226 }
8228 /* Handle a "no vops" attribute; arguments as in
8229 struct attribute_spec.handler. */
8231 static tree
8235 {
8239 }
8241 /* Handle a "deprecated" attribute; arguments as in
8242 struct attribute_spec.handler. */
8244 static tree
8248 {
8256 {
8259 }
8262 {
8273 else
8275 }
8277 {
8282 }
8283 else
8287 {
8290 {
8296 }
8299 else
8301 }
8304 }
8306 /* Handle a "vector_size" attribute; arguments as in
8307 struct attribute_spec.handler. */
8309 static tree
8313 {
8323 {
8326 }
8328 /* Get the vector size (in bytes). */
8331 /* We need to provide for vector pointers, vector arrays, and
8332 functions returning vectors. For example:
8334 __attribute__((vector_size(16))) short *foo;
8336 In this case, the mode is SI, but the type being modified is
8337 HI, so we need to look further. */
8346 /* Get the mode of the type being modified. */
8357 {
8360 }
8363 {
8366 }
8369 {
8372 }
8374 /* Calculate how many units fit in the vector. */
8377 {
8380 }
8384 /* Build back pointers if needed. */
8388 }
8390 /* Handle the "nonnull" attribute. */
8391 static tree
8395 {
8399 /* If no arguments are specified, all pointer arguments should be
8400 non-null. Verify a full prototype is given so that the arguments
8401 will have the correct types when we actually check them later. */
8403 {
8405 {
8408 }
8410 }
8412 /* Argument list specified. Verify that each argument number references
8413 a pointer argument. */
8415 {
8419 {
8424 }
8427 {
8428 function_args_iterator iter;
8429 tree argument;
8433 {
8437 }
8441 {
8446 }
8449 {
8454 }
8455 }
8456 }
8459 }
8461 /* Check the argument list of a function call for null in argument slots
8462 that are marked as requiring a non-null pointer argument. The NARGS
8463 arguments are passed in the array ARGARRAY.
8464 */
8466 static void
8468 {
8469 tree a;
8477 /* See if any of the nonnull attributes has no arguments. If so,
8478 then every pointer argument is checked (in which case the check
8479 for pointer type is done in check_nonnull_arg). */
8481 do
8489 else
8490 {
8491 /* Walk the argument list. If we encounter an argument number we
8492 should check for non-null, do it. */
8494 {
8496 {
8500 }
8505 }
8506 }
8507 }
8509 /* Check that the Nth argument of a function call (counting backwards
8510 from the end) is a (pointer)0. The NARGS arguments are passed in the
8511 array ARGARRAY. */
8513 static void
8515 {
8519 {
8522 tree sentinel;
8523 function_args_iterator iter;
8524 tree t;
8526 /* Skip over the named arguments. */
8528 {
8531 len++;
8532 }
8535 {
8538 }
8540 /* The sentinel must be one of the varargs, i.e.
8541 in position >= the number of fixed arguments. */
8543 {
8547 }
8549 /* Validate the sentinel. */
8553 /* Although __null (in C++) is only an integer we allow it
8554 nevertheless, as we are guaranteed that it's exactly
8555 as wide as a pointer, and we don't want to force
8556 users to cast the NULL they have written there.
8557 We warn with -Wstrict-null-sentinel, though. */
8560 }
8561 }
8563 /* Helper for check_function_nonnull; given a list of operands which
8564 must be non-null in ARGS, determine if operand PARAM_NUM should be
8565 checked. */
8567 static bool
8569 {
8573 {
8580 }
8582 }
8584 /* Check that the function argument PARAM (which is operand number
8585 PARAM_NUM) is non-null. This is called by check_function_nonnull
8586 via check_function_arguments_recurse. */
8588 static void
8591 {
8592 /* Just skip checking the argument if it's not a pointer. This can
8593 happen if the "nonnull" attribute was given without an operand
8594 list (which means to check every pointer argument). */
8602 }
8604 /* Helper for nonnull attribute handling; fetch the operand number
8605 from the attribute argument list. */
8607 static bool
8609 {
8610 /* Verify the arg number is a constant. */
8617 }
8619 /* Handle a "nothrow" attribute; arguments as in
8620 struct attribute_spec.handler. */
8622 static tree
8625 {
8628 /* ??? TODO: Support types. */
8629 else
8630 {
8633 }
8636 }
8638 /* Handle a "cleanup" attribute; arguments as in
8639 struct attribute_spec.handler. */
8641 static tree
8644 {
8648 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
8649 for global destructors in C++. This requires infrastructure that
8650 we don't have generically at the moment. It's also not a feature
8651 we'd be missing too much, since we do have attribute constructor. */
8653 {
8657 }
8659 /* Verify that the argument is a function in scope. */
8660 /* ??? We could support pointers to functions here as well, if
8661 that was considered desirable. */
8664 {
8668 }
8671 {
8675 }
8677 /* That the function has proper type is checked with the
8678 eventual call to build_function_call. */
8681 }
8683 /* Handle a "warn_unused_result" attribute. No special handling. */
8685 static tree
8689 {
8690 /* Ignore the attribute for functions not returning any value. */
8692 {
8695 }
8698 }
8700 /* Handle a "sentinel" attribute. */
8702 static tree
8705 {
8707 {
8711 }
8712 else
8713 {
8715 {
8719 }
8720 }
8723 {
8727 {
8731 }
8732 else
8733 {
8735 {
8739 }
8740 }
8741 }
8744 }
8746 /* Handle a "type_generic" attribute. */
8748 static tree
8752 {
8753 /* Ensure we have a function type. */
8756 /* Ensure we have a variadic function. */
8760 }
8762 /* Handle a "target" attribute. */
8764 static tree
8767 {
8768 /* Ensure we have a function type. */
8770 {
8773 }
8775 flags))
8779 }
8781 /* Arguments being collected for optimization. */
8786 /* Inner function to convert a TREE_LIST to argv string to parse the optimize
8787 options in ARGS. ATTR_P is true if this is for attribute(optimize), and
8788 false for #pragma GCC optimize. */
8790 bool
8792 {
8800 tree ap;
8802 /* Build up argv vector. Just in case the string is stored away, use garbage
8803 collected strings. */
8808 {
8812 {
8816 }
8819 {
8820 /* Split string into multiple substrings. */
8828 {
8835 {
8839 }
8840 else
8841 {
8844 }
8848 /* If the user supplied -Oxxx or -fxxx, only allow -Oxxx or -fxxx
8849 options. */
8851 {
8856 else
8860 }
8863 {
8866 /* Assume that Ox is -Ox, a numeric value is -Ox, a s by
8867 itself is -Os, and any other switch begins with a -f. */
8873 }
8878 }
8880 }
8881 }
8891 /* Now parse the options. */
8901 /* Don't allow changing -fstrict-aliasing. */
8906 }
8908 /* For handling "optimize" attribute. arguments as in
8909 struct attribute_spec.handler. */
8911 static tree
8914 {
8915 /* Ensure we have a function type. */
8917 {
8920 }
8921 else
8922 {
8926 /* Save current options. */
8929 /* If we previously had some optimization options, use them as the
8930 default. */
8935 /* Parse options, and update the vector. */
8940 /* Restore current options. */
8942 }
8945 }
8947 /* Handle a "no_split_stack" attribute. */
8949 static tree
8954 {
8958 {
8962 }
8964 {
8968 }
8971 }
8972 \f
8973 /* Check for valid arguments being passed to a function with FNTYPE.
8974 There are NARGS arguments in the array ARGARRAY. */
8975 void
8977 {
8978 /* Check for null being passed in a pointer argument that must be
8979 non-null. We also need to do this if format checking is enabled. */
8984 /* Check for errors in format strings. */
8991 }
8993 /* Generic argument checking recursion routine. PARAM is the argument to
8994 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
8995 once the argument is resolved. CTX is context for the callback. */
8996 void
9001 {
9005 {
9006 /* Strip coercion. */
9010 }
9013 {
9015 tree attrs;
9018 /* See if this is a call to a known internationalization function
9019 that modifies a format arg. Such a function may have multiple
9020 format_arg attributes (for example, ngettext). */
9023 attrs;
9026 {
9027 tree inner_arg;
9028 tree format_num_expr;
9031 call_expr_arg_iterator iter;
9033 /* Extract the argument number, which was previously checked
9034 to be valid. */
9046 {
9051 }
9052 }
9054 /* If we found a format_arg attribute and did a recursive check,
9055 we are done with checking this argument. Otherwise, we continue
9056 and this will be considered a non-literal. */
9059 }
9062 {
9063 /* Check both halves of the conditional expression. */
9069 }
9072 }
9074 /* Checks for a builtin function FNDECL that the number of arguments
9075 NARGS against the required number REQUIRED and issues an error if
9076 there is a mismatch. Returns true if the number of arguments is
9077 correct, otherwise false. */
9079 static bool
9081 {
9083 {
9087 }
9089 {
9093 }
9095 }
9097 /* Verifies the NARGS arguments ARGS to the builtin function FNDECL.
9098 Returns false if there was an error, otherwise true. */
9100 bool
9102 {
9108 {
9118 {
9120 {
9124 }
9126 }
9136 {
9143 {
9147 }
9149 }
9154 {
9159 {
9163 }
9166 {
9168 fndecl);
9170 }
9172 }
9177 {
9179 {
9182 }
9184 }
9189 }
9190 }
9192 /* Function to help qsort sort FIELD_DECLs by name order. */
9194 int
9196 {
9201 /* A nontype is "greater" than a type. */
9210 }
9213 gt_pointer_operator new_value;
9217 /* This routine compares two fields like field_decl_cmp but using the
9218 pointer operator in resort_data. */
9220 static int
9222 {
9227 /* A nontype is "greater" than a type. */
9233 {
9240 }
9242 }
9244 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
9246 void
9249 gt_pointer_operator new_value,
9251 {
9256 resort_field_decl_cmp);
9257 }
9259 /* Subroutine of c_parse_error.
9260 Return the result of concatenating LHS and RHS. RHS is really
9261 a string literal, its first character is indicated by RHS_START and
9262 RHS_SIZE is its length (including the terminating NUL character).
9264 The caller is responsible for deleting the returned pointer. */
9268 {
9274 }
9276 /* Issue the error given by GMSGID, indicating that it occurred before
9277 TOKEN, which had the associated VALUE. */
9279 void
9282 {
9283 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
9293 {
9298 {
9311 }
9315 else
9321 }
9331 {
9336 }
9344 {
9349 }
9350 else
9354 {
9357 }
9358 #undef catenate_messages
9359 }
9361 /* Mapping for cpp message reasons to the options that enable them. */
9363 struct reason_option_codes_t
9364 {
9367 };
9387 };
9389 /* Return the gcc option code associated with the reason for a cpp
9390 message, or 0 if none. */
9392 static int
9394 {
9398 {
9401 }
9403 }
9405 /* Callback from cpp_error for PFILE to print diagnostics from the
9406 preprocessor. The diagnostic is of type LEVEL, with REASON set
9407 to the reason code if LEVEL is represents a warning, at location
9408 LOCATION unless this is after lexing and the compiler's location
9409 should be used instead, with column number possibly overridden by
9410 COLUMN_OVERRIDE if not zero; MSG is the translated message and AP
9411 the arguments. Returns true if a diagnostic was emitted, false
9412 otherwise. */
9414 bool
9418 {
9419 diagnostic_info diagnostic;
9420 diagnostic_t dlevel;
9425 {
9430 /* Fall through. */
9455 }
9468 }
9470 /* Convert a character from the host to the target execution character
9471 set. cpplib handles this, mostly. */
9473 HOST_WIDE_INT
9475 {
9476 /* Character constants in GCC proper are sign-extended under -fsigned-char,
9477 zero-extended under -fno-signed-char. cpplib insists that characters
9478 and character constants are always unsigned. Hence we must convert
9479 back and forth. */
9487 else
9489 }
9491 /* Fold an offsetof-like expression. EXPR is a nested sequence of component
9492 references with an INDIRECT_REF of a constant at the bottom; much like the
9493 traditional rendering of offsetof as a macro. Return the folded result. */
9495 tree
9497 {
9501 {
9517 {
9520 }
9530 {
9534 }
9548 /* Check if the offset goes beyond the upper bound of the array. */
9550 {
9556 {
9560 {
9561 tree v;
9568 {
9576 }
9577 /* Don't warn if the array might be considered a poor
9578 man's flexible array member with a very permissive
9579 definition thereof. */
9583 "index %E denotes an offset "
9586 }
9587 }
9588 }
9595 /* Handle static members of volatile structs. */
9602 }
9605 }
9607 /* Likewise, but convert it to the return type of offsetof. */
9609 tree
9611 {
9613 }
9615 /* Warn for A ?: C expressions (with B omitted) where A is a boolean
9616 expression, because B will always be true. */
9618 void
9620 {
9623 "the omitted middle operand in ?: will always be %<true%>, "
9625 }
9627 /* Give an error for storing into ARG, which is 'const'. USE indicates
9628 how ARG was being used. */
9630 void
9632 {
9635 /* Using this macro rather than (for example) arrays of messages
9636 ensures that all the format strings are checked at compile
9637 time. */
9638 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
9639 : (use == lv_increment ? (I) \
9640 : (use == lv_decrement ? (D) : (AS))))
9642 {
9653 else
9659 }
9665 arg);
9671 arg);
9673 {
9683 arg);
9684 }
9690 arg);
9691 else
9696 arg);
9697 }
9699 /* Print an error message for an invalid lvalue. USE says
9700 how the lvalue is being used and so selects the error message. LOC
9701 is the location for the error. */
9703 void
9705 {
9707 {
9725 }
9726 }
9728 /* Print an error message for an invalid indirection of type TYPE.
9729 ERRSTRING is the name of the operator for the indirection. */
9731 void
9733 {
9735 {
9743 type);
9748 type);
9753 type);
9758 type);
9762 }
9763 }
9764 \f
9765 /* *PTYPE is an incomplete array. Complete it with a domain based on
9766 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
9767 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
9768 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
9770 int
9772 {
9779 {
9781 {
9782 int eltsize
9785 }
9787 {
9791 {
9795 }
9796 else
9797 {
9798 tree curindex;
9809 {
9813 else
9814 {
9818 size_one_node);
9819 }
9822 }
9825 }
9826 }
9827 else
9828 {
9829 /* Make an error message unless that happened already. */
9832 }
9833 }
9834 else
9835 {
9839 }
9846 else
9849 /* Using build_distinct_type_copy and modifying things afterward instead
9850 of using build_array_type to create a new type preserves all of the
9851 TYPE_LANG_FLAG_? bits that the front end may have set. */
9859 /* Make sure we have the canonical MAIN_TYPE. */
9862 hashcode);
9865 /* Fix the canonical type. */
9875 else
9880 else
9886 {
9888 /* If we proceed with the array type as it is, we'll eventually
9889 crash in tree_low_cst(). */
9891 }
9895 }
9897 /* Like c_mark_addressable but don't check register qualifier. */
9898 void
9900 {
9906 }
9909 \f
9910 /* Used to help initialize the builtin-types.def table. When a type of
9911 the correct size doesn't exist, use error_mark_node instead of NULL.
9912 The later results in segfaults even when a decl using the type doesn't
9913 get invoked. */
9915 tree
9917 {
9920 }
9922 /* A helper function for resolve_overloaded_builtin in resolving the
9923 overloaded __sync_ builtins. Returns a positive power of 2 if the
9924 first operand of PARAMS is a pointer to a supported data type.
9925 Returns 0 if an error is encountered. */
9927 static int
9929 {
9930 tree type;
9934 {
9937 }
9951 incompatible:
9954 }
9956 /* A helper function for resolve_overloaded_builtin. Adds casts to
9957 PARAMS to make arguments match up with those of FUNCTION. Drops
9958 the variadic arguments at the end. Returns false if some error
9959 was encountered; true on success. */
9961 static bool
9964 {
9965 function_args_iterator iter;
9966 tree ptype;
9970 /* We've declared the implementation functions to use "volatile void *"
9971 as the pointer parameter, so we shouldn't get any complaints from the
9972 call to check_function_arguments what ever type the user used. */
9976 /* For the rest of the values, we need to cast these to FTYPE, so that we
9977 don't get warnings for passing pointer types, etc. */
9980 {
9984 /* XXX void_type_node belies the abstraction. */
9990 {
9993 }
9995 /* Only convert parameters if arg_type is unsigned integer type with
9996 new format sync routines, i.e. don't attempt to convert pointer
9997 arguments (e.g. EXPECTED argument of __atomic_compare_exchange_n),
9998 bool arguments (e.g. WEAK argument) or signed int arguments (memmodel
9999 kinds). */
10001 {
10002 /* Ideally for the first conversion we'd use convert_for_assignment
10003 so that we get warnings for anything that doesn't match the pointer
10004 type. This isn't portable across the C and C++ front ends atm. */
10009 }
10012 }
10014 /* __atomic routines are not variadic. */
10016 {
10019 }
10021 /* The definition of these primitives is variadic, with the remaining
10022 being "an optional list of variables protected by the memory barrier".
10023 No clue what that's supposed to mean, precisely, but we consider all
10024 call-clobbered variables to be protected so we're safe. */
10028 }
10030 /* A helper function for resolve_overloaded_builtin. Adds a cast to
10031 RESULT to make it match the type of the first pointer argument in
10032 PARAMS. */
10034 static tree
10036 {
10041 /* New format doesn't require casting unless the types are the same size. */
10044 else
10046 }
10048 /* This function verifies the PARAMS to generic atomic FUNCTION.
10049 It returns the size if all the parameters are the same size, otherwise
10050 0 is returned if the parameters are invalid. */
10052 static int
10055 {
10060 tree type_0;
10062 /* Determine the parameter makeup. */
10064 {
10080 }
10083 {
10086 }
10088 /* Get type of first parameter, and determine its size. */
10091 {
10093 function);
10095 }
10097 /* Types must be compile time constant sizes. */
10099 {
10102 function);
10104 }
10108 /* Zero size objects are not allowed. */
10110 {
10113 function);
10115 }
10117 /* Check each other parameter is a pointer and the same size. */
10119 {
10122 /* __atomic_compare_exchange has a bool in the 4th postion, skip it. */
10126 {
10128 function);
10130 }
10133 {
10135 function);
10137 }
10138 }
10140 /* Check memory model parameters for validity. */
10142 {
10145 {
10148 {
10151 function);
10152 }
10153 }
10154 else
10156 {
10158 function);
10160 }
10161 }
10164 }
10167 /* This will take an __atomic_ generic FUNCTION call, and add a size parameter N
10168 at the beginning of the parameter list PARAMS representing the size of the
10169 objects. This is to match the library ABI requirement. LOC is the location
10170 of the function call.
10171 The new function is returned if it needed rebuilding, otherwise NULL_TREE is
10172 returned to allow the external call to be constructed. */
10174 static tree
10177 {
10178 tree size_node;
10180 /* Insert a SIZE_T parameter as the first param. If there isn't
10181 enough space, allocate a new vector and recursively re-build with that. */
10183 {
10186 tree f;
10195 }
10197 /* Add the size parameter and leave as a function call for processing. */
10201 }
10204 /* This will process an __atomic_exchange function call, determine whether it
10205 needs to be mapped to the _N variation, or turned into a library call.
10206 LOC is the location of the builtin call.
10207 FUNCTION is the DECL that has been invoked;
10208 PARAMS is the argument list for the call. The return value is non-null
10209 TRUE is returned if it is translated into the proper format for a call to the
10210 external library, and NEW_RETURN is set the tree for that function.
10211 FALSE is returned if processing for the _N variation is required, and
10212 NEW_RETURN is set to the the return value the result is copied into. */
10213 static bool
10216 {
10221 /* Size of 0 is an error condition. */
10223 {
10226 }
10228 /* If not a lock-free size, change to the library generic format. */
10230 {
10233 }
10235 /* Otherwise there is a lockfree match, transform the call from:
10236 void fn(T* mem, T* desired, T* return, model)
10237 into
10238 *return = (T) (fn (In* mem, (In) *desired, model)) */
10245 /* Create pointer to appropriate size. */
10249 /* Convert object pointer to required type. */
10252 /* Convert new value to required type, and dereference it. */
10257 /* Move memory model to the 3rd position, and end param list. */
10261 /* Convert return pointer and dereference it for later assignment. */
10265 }
10268 /* This will process an __atomic_compare_exchange function call, determine
10269 whether it needs to be mapped to the _N variation, or turned into a lib call.
10270 LOC is the location of the builtin call.
10271 FUNCTION is the DECL that has been invoked;
10272 PARAMS is the argument list for the call. The return value is non-null
10273 TRUE is returned if it is translated into the proper format for a call to the
10274 external library, and NEW_RETURN is set the tree for that function.
10275 FALSE is returned if processing for the _N variation is required. */
10277 static bool
10281 {
10286 /* Size of 0 is an error condition. */
10288 {
10291 }
10293 /* If not a lock-free size, change to the library generic format. */
10295 {
10296 /* The library generic format does not have the weak parameter, so
10297 remove it from the param list. Since a parameter has been removed,
10298 we can be sure that there is room for the SIZE_T parameter, meaning
10299 there will not be a recursive rebuilding of the parameter list, so
10300 there is no danger this will be done twice. */
10302 {
10306 }
10309 }
10311 /* Otherwise, there is a match, so the call needs to be transformed from:
10312 bool fn(T* mem, T* desired, T* return, weak, success, failure)
10313 into
10314 bool fn ((In *)mem, (In *)expected, (In) *desired, weak, succ, fail) */
10320 /* Create pointer to appropriate size. */
10324 /* Convert object pointer to required type. */
10328 /* Convert expected pointer to required type. */
10332 /* Convert desired value to required type, and dereference it. */
10337 /* The rest of the parameters are fine. NULL means no special return value
10338 processing.*/
10341 }
10344 /* This will process an __atomic_load function call, determine whether it
10345 needs to be mapped to the _N variation, or turned into a library call.
10346 LOC is the location of the builtin call.
10347 FUNCTION is the DECL that has been invoked;
10348 PARAMS is the argument list for the call. The return value is non-null
10349 TRUE is returned if it is translated into the proper format for a call to the
10350 external library, and NEW_RETURN is set the tree for that function.
10351 FALSE is returned if processing for the _N variation is required, and
10352 NEW_RETURN is set to the the return value the result is copied into. */
10354 static bool
10357 {
10362 /* Size of 0 is an error condition. */
10364 {
10367 }
10369 /* If not a lock-free size, change to the library generic format. */
10371 {
10374 }
10376 /* Otherwise, there is a match, so the call needs to be transformed from:
10377 void fn(T* mem, T* return, model)
10378 into
10379 *return = (T) (fn ((In *) mem, model)) */
10385 /* Create pointer to appropriate size. */
10389 /* Convert object pointer to required type. */
10393 /* Move memory model to the 2nd position, and end param list. */
10397 /* Convert return pointer and dereference it for later assignment. */
10401 }
10404 /* This will process an __atomic_store function call, determine whether it
10405 needs to be mapped to the _N variation, or turned into a library call.
10406 LOC is the location of the builtin call.
10407 FUNCTION is the DECL that has been invoked;
10408 PARAMS is the argument list for the call. The return value is non-null
10409 TRUE is returned if it is translated into the proper format for a call to the
10410 external library, and NEW_RETURN is set the tree for that function.
10411 FALSE is returned if processing for the _N variation is required, and
10412 NEW_RETURN is set to the the return value the result is copied into. */
10414 static bool
10417 {
10422 /* Size of 0 is an error condition. */
10424 {
10427 }
10429 /* If not a lock-free size, change to the library generic format. */
10431 {
10434 }
10436 /* Otherwise, there is a match, so the call needs to be transformed from:
10437 void fn(T* mem, T* value, model)
10438 into
10439 fn ((In *) mem, (In) *value, model) */
10444 /* Create pointer to appropriate size. */
10448 /* Convert object pointer to required type. */
10452 /* Convert new value to required type, and dereference it. */
10457 /* The memory model is in the right spot already. Return is void. */
10461 }
10464 /* Some builtin functions are placeholders for other expressions. This
10465 function should be called immediately after parsing the call expression
10466 before surrounding code has committed to the type of the expression.
10468 LOC is the location of the builtin call.
10470 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
10471 PARAMS is the argument list for the call. The return value is non-null
10472 when expansion is complete, and null if normal processing should
10473 continue. */
10475 tree
10478 {
10484 {
10490 else
10494 }
10496 /* Handle BUILT_IN_NORMAL here. */
10498 {
10503 {
10504 /* Handle these 4 together so that they can fall through to the next
10505 case if the call is transformed to an _N variant. */
10507 {
10509 {
10513 /* Change to the _N variant. */
10516 }
10519 {
10521 params,
10524 /* Change to the _N variant. */
10527 }
10529 {
10533 /* Change to the _N variant. */
10536 }
10538 {
10542 /* Change to the _N variant. */
10545 }
10548 }
10549 /* Fallthrough to the normal processing. */
10550 }
10567 {
10569 /* Fallthru for parameter processing. */
10570 }
10587 {
10598 orig_format))
10610 /* If new_return is set, assign function to that expr and cast the
10611 result to void since the generic interface returned void. */
10613 {
10614 /* Cast function result from I{1,2,4,8,16} to the required type. */
10617 result);
10621 }
10623 }
10627 }
10628 }
10630 /* Ignoring their sign, return true if two scalar types are the same. */
10631 bool
10633 {
10640 /* Equality works here because c_common_signed_type uses
10641 TYPE_MAIN_VARIANT. */
10644 }
10646 /* Check for missing format attributes on function pointers. LTYPE is
10647 the new type or left-hand side type. RTYPE is the old type or
10648 right-hand side type. Returns TRUE if LTYPE is missing the desired
10649 attribute. */
10651 bool
10653 {
10655 tree ra;
10661 {
10662 tree la;
10667 }
10668 else
10670 }
10672 /* Subscripting with type char is likely to lose on a machine where
10673 chars are signed. So warn on any machine, but optionally. Don't
10674 warn for unsigned char since that type is safe. Don't warn for
10675 signed char because anyone who uses that must have done so
10676 deliberately. Furthermore, we reduce the false positive load by
10677 warning only for non-constant value of type char. */
10679 void
10681 {
10685 }
10687 /* Implement -Wparentheses for the unexpected C precedence rules, to
10688 cover cases like x + y << z which readers are likely to
10689 misinterpret. We have seen an expression in which CODE is a binary
10690 operator used to combine expressions ARG_LEFT and ARG_RIGHT, which
10691 before folding had CODE_LEFT and CODE_RIGHT. CODE_LEFT and
10692 CODE_RIGHT may be ERROR_MARK, which means that that side of the
10693 expression was not formed using a binary or unary operator, or it
10694 was enclosed in parentheses. */
10696 void
10700 {
10704 /* This macro tests that the expression ARG with original tree code
10705 CODE appears to be a boolean expression. or the result of folding a
10706 boolean expression. */
10707 #define APPEARS_TO_BE_BOOLEAN_EXPR_P(CODE, ARG) \
10708 (truth_value_p (TREE_CODE (ARG)) \
10709 || TREE_CODE (TREE_TYPE (ARG)) == BOOLEAN_TYPE \
10711 || ((CODE) != INTEGER_CST \
10712 && (integer_onep (ARG) || integer_zerop (ARG))))
10715 {
10764 /* Check cases like x|y==z */
10771 /* Check cases like !x | y */
10775 "suggest parentheses around operand of "
10788 /* Check cases like x^y==z */
10810 /* Check cases like x&y==z */
10817 /* Check cases like !x & y */
10821 "suggest parentheses around operand of "
10844 {
10849 "comparisons like %<X<=Y<=Z%> do not "
10855 "comparisons like %<X<=Y<=Z%> do not "
10857 }
10859 }
10860 #undef NOT_A_BOOLEAN_EXPR_P
10861 }
10863 /* If LABEL (a LABEL_DECL) has not been used, issue a warning. */
10865 void
10867 {
10869 {
10872 else
10874 }
10875 }
10877 /* Warn for division by zero according to the value of DIVISOR. LOC
10878 is the location of the division operator. */
10880 void
10882 {
10883 /* If DIVISOR is zero, and has integral or fixed-point type, issue a warning
10884 about division by zero. Do not issue a warning if DIVISOR has a
10885 floating-point type, since we consider 0.0/0.0 a valid way of
10886 generating a NaN. */
10890 }
10892 /* Subroutine of build_binary_op. Give warnings for comparisons
10893 between signed and unsigned quantities that may fail. Do the
10894 checking based on the original operand trees ORIG_OP0 and ORIG_OP1,
10895 so that casts will be considered, but default promotions won't
10896 be.
10898 LOCATION is the location of the comparison operator.
10900 The arguments of this function map directly to local variables
10901 of build_binary_op. */
10903 void
10908 {
10913 /* In C++, check for comparison of different enum types. */
10919 {
10923 }
10925 /* Do not warn if the comparison is being done in a signed type,
10926 since the signed type will only be chosen if it can represent
10927 all the values of the unsigned type. */
10930 /* Do not warn if both operands are unsigned. */
10933 else
10934 {
10940 else
10948 /* Do not warn if the signed quantity is an unsuffixed integer
10949 literal (or some static constant expression involving such
10950 literals or a conditional expression involving such literals)
10951 and it is non-negative. */
10954 /* Do not warn if the comparison is an equality operation, the
10955 unsigned quantity is an integral constant, and it would fit
10956 in the result if the result were signed. */
10961 /* In C, do not warn if the unsigned quantity is an enumeration
10962 constant and its maximum value would fit in the result if the
10963 result were signed. */
10969 else
10971 OPT_Wsign_compare,
10973 }
10975 /* Warn if two unsigned values are being compared in a size larger
10976 than their original size, and one (and only one) is the result of
10977 a `~' operator. This comparison will always fail.
10979 Also warn if one operand is a constant, and the constant does not
10980 have all bits set that are set in the ~ operand when it is
10981 extended. */
10988 {
10995 {
10996 tree primop;
11002 {
11006 }
11007 else
11008 {
11012 }
11017 {
11020 {
11024 else
11027 }
11028 }
11029 }
11037 }
11038 }
11040 /* RESULT_TYPE is the result of converting TYPE1 and TYPE2 to a common
11041 type via c_common_type. If -Wdouble-promotion is in use, and the
11042 conditions for warning have been met, issue a warning. GMSGID is
11043 the warning message. It must have two %T specifiers for the type
11044 that was converted (generally "float") and the type to which it was
11045 converted (generally "double), respectively. LOC is the location
11046 to which the awrning should refer. */
11048 void
11051 {
11052 tree source_type;
11056 /* If the conversion will not occur at run-time, there is no need to
11057 warn about it. */
11069 else
11072 }
11074 /* Setup a TYPE_DECL node as a typedef representation.
11076 X is a TYPE_DECL for a typedef statement. Create a brand new
11077 ..._TYPE node (which will be just a variant of the existing
11078 ..._TYPE node with identical properties) and then install X
11079 as the TYPE_NAME of this brand new (duplicate) ..._TYPE node.
11081 The whole point here is to end up with a situation where each
11082 and every ..._TYPE node the compiler creates will be uniquely
11083 associated with AT MOST one node representing a typedef name.
11084 This way, even though the compiler substitutes corresponding
11085 ..._TYPE nodes for TYPE_DECL (i.e. "typedef name") nodes very
11086 early on, later parts of the compiler can always do the reverse
11087 translation and get back the corresponding typedef name. For
11088 example, given:
11090 typedef struct S MY_TYPE;
11091 MY_TYPE object;
11093 Later parts of the compiler might only know that `object' was of
11094 type `struct S' if it were not for code just below. With this
11095 code however, later parts of the compiler see something like:
11097 struct S' == struct S
11098 typedef struct S' MY_TYPE;
11099 struct S' object;
11101 And they can then deduce (from the node for type struct S') that
11102 the original object declaration was:
11104 MY_TYPE object;
11106 Being able to do this is important for proper support of protoize,
11107 and also for generating precise symbolic debugging information
11108 which takes full account of the programmer's (typedef) vocabulary.
11110 Obviously, we don't want to generate a duplicate ..._TYPE node if
11111 the TYPE_DECL node that we are now processing really represents a
11112 standard built-in type. */
11114 void
11116 {
11120 {
11123 }
11126 {
11134 }
11135 }
11137 /* Record the types used by the current global variable declaration
11138 being parsed, so that we can decide later to emit their debug info.
11139 Those types are in types_used_by_cur_var_decl, and we are going to
11140 store them in the types_used_by_vars_hash hash table.
11141 DECL is the declaration of the global variable that has been parsed. */
11143 void
11145 {
11149 {
11152 }
11153 }
11155 /* If DECL is a typedef that is declared in the current function,
11156 record it for the purpose of -Wunused-local-typedefs. */
11158 void
11160 {
11165 /* if this is not a locally defined typedef then we are not
11166 interested. */
11173 }
11175 /* If T is a TYPE_DECL declared locally, mark it as used. */
11177 void
11179 {
11184 }
11186 /* Warn if there are some unused locally defined typedefs in the
11187 current function. */
11189 void
11191 {
11193 tree decl;
11194 /* The number of times we have emitted -Wunused-local-typedefs
11195 warnings. If this is different from errorcount, that means some
11196 unrelated errors have been issued. In which case, we'll avoid
11197 emitting "unused-local-typedefs" warnings. */
11209 {
11213 OPT_Wunused_local_typedefs,
11216 }
11219 }
11221 /* The C and C++ parsers both use vectors to hold function arguments.
11222 For efficiency, we keep a cache of unused vectors. This is the
11223 cache. */
11228 /* Return a new vector from the cache. If the cache is empty,
11229 allocate a new vector. These vectors are GC'ed, so it is OK if the
11230 pointer is not released.. */
11234 {
11237 else
11238 {
11239 /* Passing 0 to vec::alloc returns NULL, and our callers require
11240 that we always return a non-NULL value. The vector code uses
11241 4 when growing a NULL vector, so we do too. */
11245 }
11246 }
11248 /* Release a vector of trees back to the cache. */
11250 void
11252 {
11254 {
11257 }
11258 }
11260 /* Get a new tree vector holding a single tree. */
11264 {
11268 }
11270 /* Get a new tree vector of the TREE_VALUEs of a TREE_LIST chain. */
11274 {
11279 }
11281 /* Get a new tree vector which is a copy of an existing one. */
11285 {
11288 tree t;
11295 }
11297 /* Return true if KEYWORD starts a type specifier. */
11299 bool
11301 {
11303 {
11333 }
11334 }
11336 /* Return true if KEYWORD names a type qualifier. */
11338 bool
11340 {
11342 {
11349 }
11350 }
11352 /* Return true if KEYWORD names a storage class specifier.
11354 RID_TYPEDEF is not included in this list despite `typedef' being
11355 listed in C99 6.7.1.1. 6.7.1.3 indicates that `typedef' is listed as
11356 such for syntactic convenience only. */
11358 bool
11360 {
11362 {
11372 }
11373 }
11375 /* Return true if KEYWORD names a function-specifier [dcl.fct.spec]. */
11377 static bool
11379 {
11381 {
11389 }
11390 }
11392 /* Return true if KEYWORD names a decl-specifier [dcl.spec] or a
11393 declaration-specifier (C99 6.7). */
11395 bool
11397 {
11404 {
11411 }
11412 }
11414 /* Initialize language-specific-bits of tree_contains_struct. */
11416 void
11418 {
11422 }
11424 /* Build a user-defined numeric literal out of an integer constant type VALUE
11425 with identifier SUFFIX. */
11427 tree
11430 {
11437 }
11439 /* For vector[index], convert the vector to a
11440 pointer of the underlying type. */
11441 void
11444 {
11446 {
11448 tree type1;
11462 }
11463 }
11465 /* Determine which of the operands, if any, is a scalar that needs to be
11466 converted to a vector, for the range of operations. */
11467 enum stv_conv
11470 {
11479 {
11480 /* Most GENERIC binary expressions require homogeneous arguments.
11481 LSHIFT_EXPR and RSHIFT_EXPR are exceptions and accept a first
11482 argument that is a vector and a second one that is a scalar, so
11483 we never return stv_secondarg for them. */
11488 {
11490 {
11495 }
11496 else
11498 }
11505 /* ... fall through ... */
11526 /* What about UNLT_EXPR? */
11528 {
11529 tree tmp;
11531 /* Swap TYPE0 with TYPE1 and OP0 with OP1 */
11534 }
11538 {
11540 {
11545 }
11547 }
11549 /* Allow integer --> real conversion if safe. */
11553 {
11555 {
11560 }
11562 }
11565 }
11568 }
11570 /* Return true iff ALIGN is an integral constant that is a fundamental
11571 alignment, as defined by [basic.align] in the c++-11
11572 specifications.
11574 That is:
11576 [A fundamental alignment is represented by an alignment less than or
11577 equal to the greatest alignment supported by the implementation
11578 in all contexts, which is equal to
11579 alignof(max_align_t)]. */
11581 bool
11583 {
11586 }