| blob | d7d5cb20a17788530ab29d2db85febc35493b589 |
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/>. */
50 /* The following symbols are subsumed in the c_global_trees array, and
51 listed here individually for documentation purposes.
53 INTEGER_TYPE and REAL_TYPE nodes for the standard data types.
55 tree short_integer_type_node;
56 tree long_integer_type_node;
57 tree long_long_integer_type_node;
58 tree int128_integer_type_node;
60 tree short_unsigned_type_node;
61 tree long_unsigned_type_node;
62 tree long_long_unsigned_type_node;
63 tree int128_unsigned_type_node;
65 tree truthvalue_type_node;
66 tree truthvalue_false_node;
67 tree truthvalue_true_node;
69 tree ptrdiff_type_node;
71 tree unsigned_char_type_node;
72 tree signed_char_type_node;
73 tree wchar_type_node;
75 tree char16_type_node;
76 tree char32_type_node;
78 tree float_type_node;
79 tree double_type_node;
80 tree long_double_type_node;
82 tree complex_integer_type_node;
83 tree complex_float_type_node;
84 tree complex_double_type_node;
85 tree complex_long_double_type_node;
87 tree dfloat32_type_node;
88 tree dfloat64_type_node;
89 tree_dfloat128_type_node;
91 tree intQI_type_node;
92 tree intHI_type_node;
93 tree intSI_type_node;
94 tree intDI_type_node;
95 tree intTI_type_node;
97 tree unsigned_intQI_type_node;
98 tree unsigned_intHI_type_node;
99 tree unsigned_intSI_type_node;
100 tree unsigned_intDI_type_node;
101 tree unsigned_intTI_type_node;
103 tree widest_integer_literal_type_node;
104 tree widest_unsigned_literal_type_node;
106 Nodes for types `void *' and `const void *'.
108 tree ptr_type_node, const_ptr_type_node;
110 Nodes for types `char *' and `const char *'.
112 tree string_type_node, const_string_type_node;
114 Type `char[SOMENUMBER]'.
115 Used when an array of char is needed and the size is irrelevant.
117 tree char_array_type_node;
119 Type `int[SOMENUMBER]' or something like it.
120 Used when an array of int needed and the size is irrelevant.
122 tree int_array_type_node;
124 Type `wchar_t[SOMENUMBER]' or something like it.
125 Used when a wide string literal is created.
127 tree wchar_array_type_node;
129 Type `char16_t[SOMENUMBER]' or something like it.
130 Used when a UTF-16 string literal is created.
132 tree char16_array_type_node;
134 Type `char32_t[SOMENUMBER]' or something like it.
135 Used when a UTF-32 string literal is created.
137 tree char32_array_type_node;
139 Type `int ()' -- used for implicit declaration of functions.
141 tree default_function_type;
143 A VOID_TYPE node, packaged in a TREE_LIST.
145 tree void_list_node;
147 The lazily created VAR_DECLs for __FUNCTION__, __PRETTY_FUNCTION__,
148 and __func__. (C doesn't generate __FUNCTION__ and__PRETTY_FUNCTION__
149 VAR_DECLS, but C++ does.)
151 tree function_name_decl_node;
152 tree pretty_function_name_decl_node;
153 tree c99_function_name_decl_node;
155 Stack of nested function name VAR_DECLs.
157 tree saved_function_name_decls;
159 */
162 \f
163 /* Switches common to the C front ends. */
165 /* Nonzero means don't output line number information. */
169 /* Nonzero causes -E output not to be done, but directives such as
170 #define that have side effects are still obeyed. */
174 /* Nonzero means dump macros in some fashion. */
178 /* Nonzero means pass #include lines through to the output. */
182 /* Nonzero means process PCH files while preprocessing. */
186 /* The file name to which we should write a precompiled header, or
187 NULL if no header will be written in this compile. */
191 /* Nonzero if an ISO standard was selected. It rejects macros in the
192 user's namespace. */
195 /* C/ObjC language option variables. */
198 /* Nonzero means allow type mismatches in conditional expressions;
199 just make their values `void'. */
203 /* Nonzero means enable C89 Amendment 1 features. */
207 /* Nonzero means use the ISO C99 (or C11) dialect of C. */
211 /* Nonzero means use the ISO C11 dialect of C. */
215 /* Nonzero means that we have builtin functions, and main is an int. */
220 /* ObjC language option variables. */
223 /* Tells the compiler that this is a special run. Do not perform any
224 compiling, instead we are to test some platform dependent features
225 and output a C header file with appropriate definitions. */
229 /* Tells the compiler what is the constant string class for ObjC. */
234 /* C++ language option variables. */
237 /* Nonzero means generate separate instantiation control files and
238 juggle them at link time. */
242 /* The C++ dialect being used. C++98 is the default. */
246 /* Maximum template instantiation depth. This limit exists to limit the
247 time it takes to notice excessively recursive template instantiations.
249 The default is lower than the 1024 recommended by the C++0x standard
250 because G++ runs out of stack before 1024 with highly recursive template
251 argument deduction substitution (g++.dg/cpp0x/enum11.C). */
255 /* The elements of `ridpointers' are identifier nodes for the reserved
256 type names and storage classes. It is indexed by a RID_... value. */
261 /* Nonzero means don't warn about problems that occur when the code is
262 executed. */
265 /* Whether we are building a boolean conversion inside
266 convert_for_assignment, or some other late binary operation. If
267 build_binary_op is called for C (from code shared by C and C++) in
268 this case, then the operands have already been folded and the
269 result will not be folded again, so C_MAYBE_CONST_EXPR should not
270 be generated. */
273 /* Whether lexing has been completed, so subsequent preprocessor
274 errors should use the compiler's input_location. */
277 /* Information about how a function name is generated. */
278 struct fname_var_t
279 {
283 };
285 /* The three ways of getting then name of the current function. */
288 {
289 /* C99 compliant __func__, must be first. */
291 /* GCC __FUNCTION__ compliant. */
293 /* GCC __PRETTY_FUNCTION__ compliant. */
296 };
298 /* Global visibility options. */
389 /* Reserved words. The third field is a mask: keywords are disabled
390 if they match the mask.
392 Masks for languages:
393 C --std=c89: D_C99 | D_CXXONLY | D_OBJC | D_CXX_OBJC
394 C --std=c99: D_CXXONLY | D_OBJC
395 ObjC is like C except that D_OBJC and D_CXX_OBJC are not set
396 C++ --std=c98: D_CONLY | D_CXXOX | D_OBJC
397 C++ --std=c0x: D_CONLY | D_OBJC
398 ObjC++ is like C++ except that D_OBJC is not set
400 If -fno-asm is used, D_ASM is added to the mask. If
401 -fno-gnu-keywords is used, D_EXT is added. If -fno-asm and C in
402 C89 mode, D_EXT89 is added for both -fno-asm and -fno-gnu-keywords.
403 In C with -Wc++-compat, we warn if D_CXXWARN is set.
405 Note the complication of the D_CXX_OBJC keywords. These are
406 reserved words such as 'class'. In C++, 'class' is a reserved
407 word. In Objective-C++ it is too. In Objective-C, it is a
408 reserved word too, but only if it follows an '@' sign.
409 */
411 {
572 /* These Objective-C keywords are recognized only immediately after
573 an '@'. */
590 /* These are recognized only in protocol-qualifier context
591 (see above) */
598 /* These are recognized inside a property attribute list */
607 };
612 /* Table of machine-independent attributes common to all C-like languages. */
614 {
615 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
616 affects_type_identity } */
623 /* FIXME: logically, noreturn attributes should be listed as
624 "false, true, true" and apply to function types. But implementing this
625 would require all the places in the compiler that use TREE_THIS_VOLATILE
626 on a decl to identify non-returning functions to be located and fixed
627 to check the function type instead. */
652 /* The same comments as for noreturn attributes apply to const ones. */
676 handle_no_instrument_function_attribute,
694 /* ??? These two attributes didn't make the transition from the
695 Intel language document to the multi-vendor language document. */
700 /* For internal use (marking of builtins) only. The name contains space
701 to prevent its usage in source code. */
723 /* For internal use (marking of builtins) only. The name contains space
724 to prevent its usage in source code. */
735 handle_no_address_safety_analysis_attribute,
738 handle_no_sanitize_address_attribute,
741 handle_no_sanitize_undefined_attribute,
751 /* For internal use only. The leading '*' both prevents its usage in
752 source code and signals that it may be overridden by machine tables. */
757 /* For internal use (marking of builtins and runtime functions) only.
758 The name contains space to prevent its usage in source code. */
774 };
776 /* Give the specifications for the format attributes, used by C and all
777 descendants. */
780 {
781 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
782 affects_type_identity } */
788 };
790 /* Return identifier for address space AS. */
794 {
798 }
800 /* Push current bindings for the function name VAR_DECLS. */
802 void
804 {
809 {
813 {
815 saved);
817 }
818 }
820 /* Normally they'll have been NULL, so only push if we've got a
821 stack, or they are non-NULL. */
823 saved_function_name_decls);
824 }
826 /* Finish up the current bindings, adding them into the current function's
827 statement tree. This must be done _before_ finish_stmt_tree is called.
828 If there is no current function, we must be at file scope and no statements
829 are involved. Pop the previous bindings. */
831 void
833 {
842 {
850 }
856 {
857 /* We had saved values, restore them. */
858 tree saved;
861 {
866 }
868 }
870 }
872 /* Return the text name of the current function, suitably prettified
873 by PRETTY_P. Return string must be freed by caller. */
877 {
884 {
887 }
900 {
903 }
906 }
908 /* Return the VAR_DECL for a const char array naming the current
909 function. If the VAR_DECL has not yet been created, create it
910 now. RID indicates how it should be formatted and IDENTIFIER_NODE
911 ID is its name (unfortunately C and C++ hold the RID values of
912 keywords in different places, so we can't derive RID from ID in
913 this language independent code. LOC is the location of the
914 function. */
916 tree
918 {
928 {
929 /* If a tree is built here, it would normally have the lineno of
930 the current statement. Later this tree will be moved to the
931 beginning of the function and this line number will be wrong.
932 To avoid this problem set the lineno to 0 here; that prevents
933 it from appearing in the RTL. */
934 tree stmts;
942 saved_function_name_decls
946 }
951 }
953 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
955 tree
957 {
962 /* Compute the number of elements, for the array type. */
964 {
967 }
969 {
972 }
974 {
977 }
978 else
979 {
982 }
984 /* C89 2.2.4.1, C99 5.2.4.1 (Translation limits). The analogous
985 limit in C++98 Annex B is very large (65536) and is not normative,
986 so we do not diagnose it (warn_overlength_strings is forced off
987 in c_common_post_options). */
989 {
993 /* Translators: The %d after 'ISO C' will be 90 or 99. Do not
994 separate the %d from the 'C'. 'ISO' should not be
995 translated, but it may be moved after 'C%d' in languages
996 where modifiers follow nouns. */
998 "string length %qd is greater than the length %qd "
1001 }
1003 /* Create the array type for the string constant. The ISO C++
1004 standard says that a string literal has type `const char[N]' or
1005 `const wchar_t[N]'. We use the same logic when invoked as a C
1006 front-end with -Wwrite-strings.
1007 ??? We should change the type of an expression depending on the
1008 state of a warning flag. We should just be warning -- see how
1009 this is handled in the C++ front-end for the deprecated implicit
1010 conversion from string literals to `char*' or `wchar_t*'.
1012 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
1013 array type being the unqualified version of that type.
1014 Therefore, if we are constructing an array of const char, we must
1015 construct the matching unqualified array type first. The C front
1016 end does not require this, but it does no harm, so we do it
1017 unconditionally. */
1028 }
1029 \f
1030 /* If DISABLE is true, stop issuing warnings. This is used when
1031 parsing code that we know will not be executed. This function may
1032 be called multiple times, and works as a stack. */
1034 static void
1036 {
1038 {
1041 }
1042 }
1044 /* If ENABLE is true, reenable issuing warnings. */
1046 static void
1048 {
1050 {
1053 }
1054 }
1056 /* Fully fold EXPR, an expression that was not folded (beyond integer
1057 constant expressions and null pointer constants) when being built
1058 up. If IN_INIT, this is in a static initializer and certain
1059 changes are made to the folding done. Clear *MAYBE_CONST if
1060 MAYBE_CONST is not NULL and EXPR is definitely not a constant
1061 expression because it contains an evaluated operator (in C99) or an
1062 operator outside of sizeof returning an integer constant (in C90)
1063 not permitted in constant expressions, or because it contains an
1064 evaluated arithmetic overflow. (*MAYBE_CONST should typically be
1065 set to true by callers before calling this function.) Return the
1066 folded expression. Function arguments have already been folded
1067 before calling this function, as have the contents of SAVE_EXPR,
1068 TARGET_EXPR, BIND_EXPR, VA_ARG_EXPR, OBJ_TYPE_REF and
1069 C_MAYBE_CONST_EXPR. */
1071 tree
1073 {
1074 tree ret;
1080 /* This function is not relevant to C++ because C++ folds while
1081 parsing, and may need changes to be correct for C++ when C++
1082 stops folding while parsing. */
1089 {
1092 }
1099 }
1101 /* Internal helper for c_fully_fold. EXPR and IN_INIT are as for
1102 c_fully_fold. *MAYBE_CONST_OPERANDS is cleared because of operands
1103 not permitted, while *MAYBE_CONST_ITSELF is cleared because of
1104 arithmetic overflow (for C90, *MAYBE_CONST_OPERANDS is carried from
1105 both evaluated and unevaluated subexpressions while
1106 *MAYBE_CONST_ITSELF is carried from only evaluated
1107 subexpressions). */
1109 static tree
1112 {
1124 /* This function is not relevant to C++ because C++ folds while
1125 parsing, and may need changes to be correct for C++ when C++
1126 stops folding while parsing. */
1130 /* Constants, declarations, statements, errors, SAVE_EXPRs and
1131 anything else not counted as an expression cannot usefully be
1132 folded further at this point. */
1138 /* Operands of variable-length expressions (function calls) have
1139 already been folded, as have __builtin_* function calls, and such
1140 expressions cannot occur in constant expressions. */
1142 {
1146 }
1149 {
1158 else
1161 }
1163 /* Assignment, increment, decrement, function call and comma
1164 operators, and statement expressions, cannot occur in constant
1165 expressions if evaluated / outside of sizeof. (Function calls
1166 were handled above, though VA_ARG_EXPR is treated like a function
1167 call here, and statement expressions are handled through
1168 C_MAYBE_CONST_EXPR to avoid folding inside them.) */
1170 {
1190 }
1192 /* Fold individual tree codes as appropriate. */
1194 {
1196 /* Any non-constancy will have been marked in a containing
1197 C_MAYBE_CONST_EXPR; there is no more folding to do here. */
1205 maybe_const_itself);
1210 {
1213 }
1222 maybe_const_itself);
1225 maybe_const_itself);
1231 {
1235 }
1277 /* Binary operations evaluating both arguments (increment and
1278 decrement are binary internally in GCC). */
1282 maybe_const_itself);
1290 /* The RHS of a MODIFY_EXPR was fully folded when building that
1291 expression for the sake of conversion warnings. */
1294 maybe_const_itself);
1298 ret = in_init
1301 else
1314 {
1325 }
1331 CASE_CONVERT:
1341 /* Unary operations. */
1344 maybe_const_itself);
1348 /* ??? Cope with user tricks that amount to offsetof. The middle-end is
1349 not prepared to deal with them if they occur in initializers. */
1357 ret = in_init
1360 else
1365 {
1369 }
1371 {
1374 CASE_CONVERT:
1375 /* Don't warn about explicit conversions. We will already
1376 have warned about suspect implicit conversions. */
1383 }
1388 /* Binary operations not necessarily evaluating both
1389 arguments. */
1396 ? truthvalue_false_node
1404 ret = in_init
1407 else
1412 && op0_const
1413 && op0_const_self
1419 && op0_const_self
1445 else
1450 && op0_const
1451 && op0_const_self
1455 && op0_const_self
1459 && op0_const
1460 && op0_const_self
1464 && op0_const_self
1470 /* Each case where an operand with excess precision may be
1471 encountered must remove the EXCESS_PRECISION_EXPR around
1472 inner operands and possibly put one around the whole
1473 expression or possibly convert to the semantic type (which
1474 c_fully_fold does); we cannot tell at this stage which is
1475 appropriate in any particular case. */
1479 /* Various codes may appear through folding built-in functions
1480 and their arguments. */
1482 }
1484 out:
1485 /* Some folding may introduce NON_LVALUE_EXPRs; all lvalue checks
1486 have been done by this point, so remove them again. */
1490 {
1494 }
1498 }
1500 /* If not optimizing, EXP is not a VAR_DECL, or EXP has array type,
1501 return EXP. Otherwise, return either EXP or its known constant
1502 value (if it has one), but return EXP if EXP has mode BLKmode. ???
1503 Is the BLKmode test appropriate? */
1505 tree
1507 {
1508 tree ret;
1510 /* This function is only used by C, for c_fully_fold and other
1511 optimization, and may not be correct for C++. */
1522 /* Avoid unwanted tree sharing between the initializer and current
1523 function's body where the tree can be modified e.g. by the
1524 gimplifier. */
1528 }
1530 /* Print a warning if a constant expression had overflow in folding.
1531 Invoke this function on every expression that the language
1532 requires to be a constant expression.
1533 Note the ANSI C standard says it is erroneous for a
1534 constant expression to overflow. */
1536 void
1538 {
1546 }
1548 /* The same as above but print an unconditional error. */
1549 void
1551 {
1558 }
1560 /* Print a warning if an expression had overflow in folding and its
1561 operands hadn't.
1563 Invoke this function on every expression that
1564 (1) appears in the source code, and
1565 (2) is a constant expression that overflowed, and
1566 (3) is not already checked by convert_and_check;
1567 however, do not invoke this function on operands of explicit casts
1568 or when the expression is the result of an operator and any operand
1569 already overflowed. */
1571 void
1573 {
1578 {
1607 }
1608 }
1610 /* Warn about uses of logical || / && operator in a context where it
1611 is likely that the bitwise equivalent was intended by the
1612 programmer. We have seen an expression in which CODE is a binary
1613 operator used to combine expressions OP_LEFT and OP_RIGHT, which before folding
1614 had CODE_LEFT and CODE_RIGHT, into an expression of type TYPE. */
1615 void
1619 {
1631 /* Warn if &&/|| are being used in a context where it is
1632 likely that the bitwise equivalent was intended by the
1633 programmer. That is, an expression such as op && MASK
1634 where op should not be any boolean expression, nor a
1635 constant, and mask seems to be a non-boolean integer constant. */
1643 {
1647 else
1652 }
1654 /* We do not warn for constants because they are typical of macro
1655 expansions that test for features. */
1659 /* This warning only makes sense with logical operands. */
1667 /* We first test whether either side separately is trivially true
1668 (with OR) or trivially false (with AND). If so, do not warn.
1669 This is a common idiom for testing ranges of data types in
1670 portable code. */
1677 /* If this is an OR operation, invert both sides; now, the result
1678 should be always false to get a warning. */
1692 /* If this is an OR operation, invert both sides; now, the result
1693 should be always false to get a warning. */
1701 /* If both expressions have the same operand, if we can merge the
1702 ranges, and if the range test is always false, then warn. */
1709 {
1712 "logical %<or%> "
1714 else
1716 "logical %<and%> "
1718 }
1719 }
1722 /* Warn if EXP contains any computations whose results are not used.
1723 Return true if a warning is printed; false otherwise. LOCUS is the
1724 (potential) location of the expression. */
1726 bool
1728 {
1729 restart:
1733 /* Don't warn about void constructs. This includes casting to void,
1734 void function calls, and statement expressions with a final cast
1735 to void. */
1743 {
1759 /* For a binding, warn if no side effect within it. */
1771 /* In && or ||, warn if 2nd operand has no side effect. */
1778 /* Let people do `(foo (), 0)' without a warning. */
1785 /* If this is an expression with side effects, don't warn; this
1786 case commonly appears in macro expansions. */
1792 /* Don't warn about automatic dereferencing of references, since
1793 the user cannot control it. */
1795 {
1798 }
1799 /* Fall through. */
1802 /* Referencing a volatile value is a side effect, so don't warn. */
1807 /* If this is an expression which has no operands, there is no value
1808 to be unused. There are no such language-independent codes,
1809 but front ends may define such. */
1813 warn:
1815 }
1816 }
1819 /* Print a warning about casts that might indicate violation
1820 of strict aliasing rules if -Wstrict-aliasing is used and
1821 strict aliasing mode is in effect. OTYPE is the original
1822 TREE_TYPE of EXPR, and TYPE the type we're casting to. */
1824 bool
1826 {
1827 /* Strip pointer conversion chains and get to the correct original type. */
1835 /* If the type we are casting to is a ref-all pointer
1836 dereferencing it is always valid. */
1843 {
1844 /* Casting the address of an object to non void pointer. Warn
1845 if the cast breaks type based aliasing. */
1847 {
1851 }
1852 else
1853 {
1854 /* warn_strict_aliasing >= 3. This includes the default (3).
1855 Only warn if the cast is dereferenced immediately. */
1856 alias_set_type set1 =
1862 {
1866 }
1869 {
1873 }
1874 }
1875 }
1876 else
1878 {
1879 /* At this level, warn for any conversions, even if an address is
1880 not taken in the same statement. This will likely produce many
1881 false positives, but could be useful to pinpoint problems that
1882 are not revealed at higher levels. */
1887 {
1891 }
1892 }
1895 }
1897 /* Warn about memset (&a, 0, sizeof (&a)); and similar mistakes with
1898 sizeof as last operand of certain builtins. */
1900 void
1904 {
1908 location_t loc;
1916 {
1920 /* FALLTHRU */
1928 /* FALLTHRU */
1987 }
2015 {
2019 {
2022 "argument to %<sizeof%> in %qD call is the same "
2023 "expression as the destination; did you mean to "
2029 "argument to %<sizeof%> in %qD call is the same "
2030 "expression as the destination; did you mean to "
2032 else
2034 "argument to %<sizeof%> in %qD call is the same "
2035 "expression as the destination; did you mean to "
2038 }
2041 && !strop
2044 {
2046 "argument to %<sizeof%> in %qD call is the same "
2047 "pointer type %qT as the destination; expected %qT "
2051 }
2052 }
2055 {
2059 {
2062 "argument to %<sizeof%> in %qD call is the same "
2063 "expression as the source; did you mean to "
2069 "argument to %<sizeof%> in %qD call is the same "
2070 "expression as the source; did you mean to "
2072 else
2074 "argument to %<sizeof%> in %qD call is the same "
2075 "expression as the source; did you mean to "
2078 }
2081 && !strop
2084 {
2086 "argument to %<sizeof%> in %qD call is the same "
2087 "pointer type %qT as the source; expected %qT "
2091 }
2092 }
2095 {
2099 {
2102 "argument to %<sizeof%> in %qD call is the same "
2103 "expression as the first source; did you mean to "
2109 "argument to %<sizeof%> in %qD call is the same "
2110 "expression as the first source; did you mean to "
2112 else
2114 "argument to %<sizeof%> in %qD call is the same "
2115 "expression as the first source; did you mean to "
2118 }
2121 && !strop
2124 {
2126 "argument to %<sizeof%> in %qD call is the same "
2127 "pointer type %qT as the first source; expected %qT "
2131 }
2132 }
2135 {
2139 {
2142 "argument to %<sizeof%> in %qD call is the same "
2143 "expression as the second source; did you mean to "
2149 "argument to %<sizeof%> in %qD call is the same "
2150 "expression as the second source; did you mean to "
2152 else
2154 "argument to %<sizeof%> in %qD call is the same "
2155 "expression as the second source; did you mean to "
2158 }
2161 && !strop
2164 {
2166 "argument to %<sizeof%> in %qD call is the same "
2167 "pointer type %qT as the second source; expected %qT "
2171 }
2172 }
2174 }
2176 /* Warn for unlikely, improbable, or stupid DECL declarations
2177 of `main'. */
2179 void
2181 {
2182 function_args_iterator iter;
2183 tree type;
2187 {
2188 /* XXX void_type_node belies the abstraction. */
2194 {
2216 "third argument of %q+D should probably be "
2219 }
2220 }
2222 /* It is intentional that this message does not mention the third
2223 argument because it's only mentioned in an appendix of the
2224 standard. */
2228 }
2230 /* vector_targets_convertible_p is used for vector pointer types. The
2231 callers perform various checks that the qualifiers are satisfactory,
2232 while OTOH vector_targets_convertible_p ignores the number of elements
2233 in the vectors. That's fine with vector pointers as we can consider,
2234 say, a vector of 8 elements as two consecutive vectors of 4 elements,
2235 and that does not require and conversion of the pointer values.
2236 In contrast, vector_types_convertible_p and
2237 vector_types_compatible_elements_p are used for vector value types. */
2238 /* True if pointers to distinct types T1 and T2 can be converted to
2239 each other without an explicit cast. Only returns true for opaque
2240 vector types. */
2241 bool
2243 {
2250 }
2252 /* vector_types_convertible_p is used for vector value types.
2253 It could in principle call vector_targets_convertible_p as a subroutine,
2254 but then the check for vector type would be duplicated with its callers,
2255 and also the purpose of vector_targets_convertible_p would become
2256 muddled.
2257 Where vector_types_convertible_p returns true, a conversion might still be
2258 needed to make the types match.
2259 In contrast, vector_targets_convertible_p is used for vector pointer
2260 values, and vector_types_compatible_elements_p is used specifically
2261 in the context for binary operators, as a check if use is possible without
2262 conversion. */
2263 /* True if vector types T1 and T2 can be converted to each other
2264 without an explicit cast. If EMIT_LAX_NOTE is true, and T1 and T2
2265 can only be converted with -flax-vector-conversions yet that is not
2266 in effect, emit a note telling the user about that option if such
2267 a note has not previously been emitted. */
2268 bool
2270 {
2278 convertible_lax =
2293 {
2296 "conversions between vectors with differing "
2298 }
2301 }
2303 /* Build a VEC_PERM_EXPR if V0, V1 and MASK are not error_mark_nodes
2304 and have vector types, V0 has the same type as V1, and the number of
2305 elements of V0, V1, MASK is the same.
2307 In case V1 is a NULL_TREE it is assumed that __builtin_shuffle was
2308 called with two arguments. In this case implementation passes the
2309 first argument twice in order to share the same tree code. This fact
2310 could enable the mask-values being twice the vector length. This is
2311 an implementation accident and this semantics is not guaranteed to
2312 the user. */
2313 tree
2316 {
2317 tree ret;
2323 {
2326 }
2334 {
2339 }
2343 {
2347 }
2350 {
2355 }
2361 {
2364 "argument vector(s) and the mask vector should "
2367 }
2371 {
2376 }
2379 {
2380 /* Avoid C_MAYBE_CONST_EXPRs inside VEC_PERM_EXPR. */
2386 else
2387 {
2390 }
2394 }
2404 }
2406 /* Like tree.c:get_narrower, but retain conversion from C++0x scoped enum
2407 to integral type. */
2409 static tree
2411 {
2416 {
2417 /* C++0x scoped enumerations don't implicitly convert to integral
2418 type; if we stripped an explicit conversion to a larger type we
2419 need to replace it so common_type will still work. */
2423 }
2425 }
2427 /* This is a helper function of build_binary_op.
2429 For certain operations if both args were extended from the same
2430 smaller type, do the arithmetic in that type and then extend.
2432 BITWISE indicates a bitwise operation.
2433 For them, this optimization is safe only if
2434 both args are zero-extended or both are sign-extended.
2435 Otherwise, we might change the result.
2436 Eg, (short)-1 | (unsigned short)-1 is (int)-1
2437 but calculated in (unsigned short) it would be (unsigned short)-1.
2438 */
2439 tree
2441 {
2445 tree type;
2447 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
2448 excessive narrowing when we call get_narrower below. For
2449 example, suppose that OP0 is of unsigned int extended
2450 from signed char and that RESULT_TYPE is long long int.
2451 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
2452 like
2454 (long long int) (unsigned int) signed_char
2456 which get_narrower would narrow down to
2458 (unsigned int) signed char
2460 If we do not cast OP0 first, get_narrower would return
2461 signed_char, which is inconsistent with the case of the
2462 explicit cast. */
2469 /* UNS is 1 if the operation to be done is an unsigned one. */
2472 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
2473 but it *requires* conversion to FINAL_TYPE. */
2484 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
2486 /* For bitwise operations, signedness of nominal type
2487 does not matter. Consider only how operands were extended. */
2491 /* Note that in all three cases below we refrain from optimizing
2492 an unsigned operation on sign-extended args.
2493 That would not be valid. */
2495 /* Both args variable: if both extended in same way
2496 from same width, do it in that width.
2497 Do it unsigned if args were zero-extended. */
2504 return c_common_signed_or_unsigned_type
2511 && (type
2522 && (type
2530 }
2532 /* Checks if expression EXPR of real/integer type cannot be converted
2533 to the real/integer type TYPE. Function returns true when:
2534 * EXPR is a constant which cannot be exactly converted to TYPE
2535 * EXPR is not a constant and size of EXPR's type > than size of TYPE,
2536 for EXPR type and TYPE being both integers or both real.
2537 * EXPR is not a constant of real type and TYPE is an integer.
2538 * EXPR is not a constant of integer type which cannot be
2539 exactly converted to real type.
2540 Function allows conversions between types of different signedness and
2541 does not return true in that case. Function can produce signedness
2542 warnings if PRODUCE_WARNS is true. */
2543 bool
2545 {
2551 {
2552 /* Warn for real constant that is not an exact integer converted
2553 to integer type. */
2556 {
2559 }
2560 /* Warn for an integer constant that does not fit into integer type. */
2564 {
2567 {
2571 }
2573 {
2577 }
2578 else
2580 }
2582 {
2583 /* Warn for an integer constant that does not fit into real type. */
2585 {
2589 }
2590 /* Warn for a real constant that does not fit into a smaller
2591 real type. */
2594 {
2598 }
2599 }
2600 }
2601 else
2602 {
2603 /* Warn for real types converted to integer types. */
2610 {
2611 /* Don't warn about unsigned char y = 0xff, x = (int) y; */
2615 /* Don't warn for short y; short x = ((int)y & 0xff); */
2619 {
2620 /* If both args were extended from a shortest type,
2621 use that type if that is safe. */
2628 {
2634 /* If one of the operands is a non-negative constant
2635 that fits in the target type, then the type of the
2636 other operand does not matter. */
2645 /* If constant is unsigned and fits in the target
2646 type, then the result will also fit. */
2648 && unsigned0
2651 && unsigned1
2654 }
2655 }
2656 /* Warn for integer types converted to smaller integer types. */
2660 /* When they are the same width but different signedness,
2661 then the value may change. */
2664 /* Even when converted to a bigger type, if the type is
2665 unsigned but expr is signed, then negative values
2666 will be changed. */
2672 }
2674 /* Warn for integer types converted to real types if and only if
2675 all the range of values of the integer type cannot be
2676 represented by the real type. */
2679 {
2683 /* Don't warn about char y = 0xff; float x = (int) y; */
2695 }
2697 /* Warn for real types converted to smaller real types. */
2702 }
2705 }
2707 /* Warns if the conversion of EXPR to TYPE may alter a value.
2708 This is a helper function for warnings_for_convert_and_check. */
2710 static void
2712 {
2720 {
2733 /* Conversion from boolean to a signed:1 bit-field (which only
2734 can hold the values 0 and -1) doesn't lose information - but
2735 it does change the value. */
2750 {
2751 /* In case of COND_EXPR, we do not care about the type of
2752 COND_EXPR, only about the conversion of each operand. */
2759 }
2766 }
2767 }
2769 /* Produce warnings after a conversion. RESULT is the result of
2770 converting EXPR to TYPE. This is a helper function for
2771 convert_and_check and cp_convert_and_check. */
2773 void
2775 {
2782 {
2783 /* Do not diagnose overflow in a constant expression merely
2784 because a conversion overflowed. */
2789 {
2790 /* This detects cases like converting -129 or 256 to
2791 unsigned char. */
2795 else
2797 }
2801 /* No warning for converting 0x80000000 to int. */
2809 else
2811 }
2816 else
2818 }
2821 /* Convert EXPR to TYPE, warning about conversion problems with constants.
2822 Invoke this function on every expression that is converted implicitly,
2823 i.e. because of language rules and not because of an explicit cast. */
2825 tree
2827 {
2828 tree result;
2829 tree expr_for_warning;
2831 /* Convert from a value with possible excess precision rather than
2832 via the semantic type, but do not warn about values not fitting
2833 exactly in the semantic type. */
2835 {
2841 }
2842 else
2856 }
2857 \f
2858 /* A node in a list that describes references to variables (EXPR), which are
2859 either read accesses if WRITER is zero, or write accesses, in which case
2860 WRITER is the parent of EXPR. */
2861 struct tlist
2862 {
2865 };
2867 /* Used to implement a cache the results of a call to verify_tree. We only
2868 use this for SAVE_EXPRs. */
2869 struct tlist_cache
2870 {
2874 tree expr;
2875 };
2877 /* Obstack to use when allocating tlist structures, and corresponding
2878 firstobj. */
2882 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
2883 warnings. */
2885 /* SAVE_EXPRs need special treatment. We process them only once and then
2886 cache the results. */
2898 /* Create a new struct tlist and fill in its fields. */
2901 {
2908 }
2910 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
2911 is nonnull, we ignore any node we find which has a writer equal to it. */
2913 static void
2915 {
2917 {
2924 }
2925 }
2927 /* Merge the nodes of ADD into TO. This merging process is done so that for
2928 each variable that already exists in TO, no new node is added; however if
2929 there is a write access recorded in ADD, and an occurrence on TO is only
2930 a read access, then the occurrence in TO will be modified to record the
2931 write. */
2933 static void
2935 {
2942 {
2949 {
2953 }
2955 {
2959 }
2961 }
2962 }
2964 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
2965 references in list LIST conflict with it, excluding reads if ONLY writers
2966 is nonzero. */
2968 static void
2971 {
2974 /* Avoid duplicate warnings. */
2980 {
2984 {
2989 }
2991 }
2992 }
2994 /* Given a list LIST of references to variables, find whether any of these
2995 can cause conflicts due to missing sequence points. */
2997 static void
2999 {
3003 {
3006 }
3007 }
3009 /* Return nonzero if X is a tree that can be verified by the sequence point
3010 warnings. */
3011 static int
3013 {
3020 /* VOID_TYPE_P (TREE_TYPE (x)) is workaround for cp/tree.c
3021 (lvalue_p) crash on TRY/CATCH. */
3028 /* No point to track non-const calls, they will never satisfy
3029 operand_equal_p. */
3037 }
3039 /* Return nonzero if X and Y appear to be the same candidate (or NULL) */
3040 static bool
3042 {
3044 }
3046 /* Walk the tree X, and record accesses to variables. If X is written by the
3047 parent tree, WRITER is the parent.
3048 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
3049 expression or its only operand forces a sequence point, then everything up
3050 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
3051 in PNO_SP.
3052 Once we return, we will have emitted warnings if any subexpression before
3053 such a sequence point could be undefined. On a higher level, however, the
3054 sequence point may not be relevant, and we'll merge the two lists.
3056 Example: (b++, a) + b;
3057 The call that processes the COMPOUND_EXPR will store the increment of B
3058 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
3059 processes the PLUS_EXPR will need to merge the two lists so that
3060 eventually, all accesses end up on the same list (and we'll warn about the
3061 unordered subexpressions b++ and b.
3063 A note on merging. If we modify the former example so that our expression
3064 becomes
3065 (b++, b) + a
3066 care must be taken not simply to add all three expressions into the final
3067 PNO_SP list. The function merge_tlist takes care of that by merging the
3068 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
3069 way, so that no more than one access to B is recorded. */
3071 static void
3073 tree writer)
3074 {
3079 /* X may be NULL if it is the operand of an empty statement expression
3080 ({ }). */
3084 restart:
3092 {
3125 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
3126 two first, to avoid warning for (a ? b++ : b++). */
3142 /* Expressions inside the LHS are not ordered wrt. the sequence points
3143 in the RHS. Example:
3144 *a = (a++, 2)
3145 Despite the fact that the modification of "a" is in the before_sp
3146 list (tmp_before), it conflicts with the use of "a" in the LHS.
3147 We can handle this by adding the contents of tmp_list3
3148 to those of tmp_before, and redoing the collision warnings for that
3149 list. */
3152 /* Exclude the LHS itself here; we first have to merge it into the
3153 tmp_nosp list. This is done to avoid warning for "a = a"; if we
3154 didn't exclude the LHS, we'd get it twice, once as a read and once
3155 as a write. */
3166 /* We need to warn about conflicts among arguments and conflicts between
3167 args and the function address. Side effects of the function address,
3168 however, are not ordered by the sequence point of the call. */
3169 {
3170 call_expr_arg_iterator iter;
3171 tree arg;
3175 {
3180 }
3185 }
3188 /* Scan all the list, e.g. indices of multi dimensional array. */
3190 {
3196 }
3200 {
3207 {
3219 {
3223 }
3226 }
3230 }
3240 /* For other expressions, simply recurse on their operands.
3241 Manual tail recursion for unary expressions.
3242 Other non-expressions need not be processed. */
3244 {
3248 }
3250 {
3254 {
3259 }
3260 }
3262 }
3263 }
3265 /* Try to warn for undefined behavior in EXPR due to missing sequence
3266 points. */
3268 DEBUG_FUNCTION void
3270 {
3276 {
3279 }
3284 }
3285 \f
3286 /* Validate the expression after `case' and apply default promotions. */
3288 static tree
3290 {
3295 /* Promote char or short to int. */
3298 {
3301 }
3306 }
3307 \f
3308 /* See if the case values LOW and HIGH are in the range of the original
3309 type (i.e. before the default conversion to int) of the switch testing
3310 expression.
3311 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
3312 the type before promoting it. CASE_LOW_P is a pointer to the lower
3313 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
3314 if the case is not a case range.
3315 The caller has to make sure that we are not called with NULL for
3316 CASE_LOW_P (i.e. the default case).
3317 Returns true if the case label is in range of ORIG_TYPE (saturated or
3318 untouched) or false if the label is out of range. */
3320 static bool
3323 {
3328 /* If there was a problem with the original type, do nothing. */
3335 /* Case label is less than minimum for type. */
3338 {
3341 }
3343 /* Case value is greater than maximum for type. */
3346 {
3349 }
3351 /* Saturate lower case label value to minimum. */
3354 {
3358 }
3360 /* Saturate upper case label value to maximum. */
3363 {
3367 }
3375 }
3376 \f
3377 /* Return an integer type with BITS bits of precision,
3378 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
3380 tree
3382 {
3421 }
3423 /* Return a fixed-point type that has at least IBIT ibits and FBIT fbits
3424 that is unsigned if UNSIGNEDP is nonzero, otherwise signed;
3425 and saturating if SATP is nonzero, otherwise not saturating. */
3427 tree
3430 {
3434 else
3442 {
3444 "fixed-point types that have too many integral and "
3447 }
3450 }
3452 /* Used for communication between c_common_type_for_mode and
3453 c_register_builtin_type. */
3456 /* Return a data type that has machine mode MODE.
3457 If the mode is an integer,
3458 then UNSIGNEDP selects between signed and unsigned types.
3459 If the mode is a fixed-point mode,
3460 then UNSIGNEDP selects between saturating and nonsaturating types. */
3462 tree
3464 {
3465 tree t;
3502 #if HOST_BITS_PER_WIDE_INT >= 64
3505 #endif
3530 {
3532 tree inner_type;
3548 }
3550 {
3555 }
3565 {
3651 }
3659 }
3661 tree
3663 {
3665 }
3667 /* Return a signed type the same as TYPE in other respects. */
3669 tree
3671 {
3673 }
3675 /* Return a type the same as TYPE except unsigned or
3676 signed according to UNSIGNEDP. */
3678 tree
3680 {
3681 tree type1;
3683 /* This block of code emulates the behavior of the old
3684 c_common_unsigned_type. In particular, it returns
3685 long_unsigned_type_node if passed a long, even when a int would
3686 have the same size. This is necessary for warnings to work
3687 correctly in archs where sizeof(int) == sizeof(long) */
3690 if (type1 == signed_char_type_node || type1 == char_type_node || type1 == unsigned_char_type_node)
3706 #if HOST_BITS_PER_WIDE_INT >= 64
3709 #endif
3719 #define C_COMMON_FIXED_TYPES(NAME) \
3720 if (type1 == short_ ## NAME ## _type_node \
3721 || type1 == unsigned_short_ ## NAME ## _type_node) \
3722 return unsignedp ? unsigned_short_ ## NAME ## _type_node \
3723 : short_ ## NAME ## _type_node; \
3724 if (type1 == NAME ## _type_node \
3725 || type1 == unsigned_ ## NAME ## _type_node) \
3726 return unsignedp ? unsigned_ ## NAME ## _type_node \
3727 : NAME ## _type_node; \
3728 if (type1 == long_ ## NAME ## _type_node \
3729 || type1 == unsigned_long_ ## NAME ## _type_node) \
3730 return unsignedp ? unsigned_long_ ## NAME ## _type_node \
3731 : long_ ## NAME ## _type_node; \
3732 if (type1 == long_long_ ## NAME ## _type_node \
3733 || type1 == unsigned_long_long_ ## NAME ## _type_node) \
3734 return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \
3735 : long_long_ ## NAME ## _type_node;
3737 #define C_COMMON_FIXED_MODE_TYPES(NAME) \
3738 if (type1 == NAME ## _type_node \
3739 || type1 == u ## NAME ## _type_node) \
3740 return unsignedp ? u ## NAME ## _type_node \
3741 : NAME ## _type_node;
3743 #define C_COMMON_FIXED_TYPES_SAT(NAME) \
3744 if (type1 == sat_ ## short_ ## NAME ## _type_node \
3745 || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \
3746 return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \
3747 : sat_ ## short_ ## NAME ## _type_node; \
3748 if (type1 == sat_ ## NAME ## _type_node \
3749 || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \
3750 return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \
3751 : sat_ ## NAME ## _type_node; \
3752 if (type1 == sat_ ## long_ ## NAME ## _type_node \
3753 || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \
3754 return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \
3755 : sat_ ## long_ ## NAME ## _type_node; \
3756 if (type1 == sat_ ## long_long_ ## NAME ## _type_node \
3757 || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \
3758 return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \
3759 : sat_ ## long_long_ ## NAME ## _type_node;
3761 #define C_COMMON_FIXED_MODE_TYPES_SAT(NAME) \
3762 if (type1 == sat_ ## NAME ## _type_node \
3763 || type1 == sat_ ## u ## NAME ## _type_node) \
3764 return unsignedp ? sat_ ## u ## NAME ## _type_node \
3765 : sat_ ## NAME ## _type_node;
3791 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
3792 the precision; they have precision set to match their range, but
3793 may use a wider mode to match an ABI. If we change modes, we may
3794 wind up with bad conversions. For INTEGER_TYPEs in C, must check
3795 the precision as well, so as to yield correct results for
3796 bit-field types. C++ does not have these separate bit-field
3797 types, and producing a signed or unsigned variant of an
3798 ENUMERAL_TYPE may cause other problems as well. */
3804 #define TYPE_OK(node) \
3805 (TYPE_MODE (type) == TYPE_MODE (node) \
3806 && TYPE_PRECISION (type) == TYPE_PRECISION (node))
3825 #if HOST_BITS_PER_WIDE_INT >= 64
3828 #endif
3837 #undef TYPE_OK
3840 }
3842 /* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */
3844 tree
3846 {
3847 /* Extended integer types of the same width as a standard type have
3848 lesser rank, so those of the same width as int promote to int or
3849 unsigned int and are valid for printf formats expecting int or
3850 unsigned int. To avoid such special cases, avoid creating
3851 extended integer types for bit-fields if a standard integer type
3852 is available. */
3869 }
3871 /* The C version of the register_builtin_type langhook. */
3873 void
3875 {
3876 tree decl;
3886 }
3887 \f
3888 /* Print an error message for invalid operands to arith operation
3889 CODE with TYPE0 for operand 0, and TYPE1 for operand 1.
3890 LOCATION is the location of the message. */
3892 void
3895 {
3899 {
3944 }
3948 }
3949 \f
3950 /* Given an expression as a tree, return its original type. Do this
3951 by stripping any conversion that preserves the sign and precision. */
3952 static tree
3954 {
3957 }
3959 /* Subroutine of build_binary_op, used for comparison operations.
3960 See if the operands have both been converted from subword integer types
3961 and, if so, perhaps change them both back to their original type.
3962 This function is also responsible for converting the two operands
3963 to the proper common type for comparison.
3965 The arguments of this function are all pointers to local variables
3966 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
3967 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
3969 If this function returns nonzero, it means that the comparison has
3970 a constant value. What this function returns is an expression for
3971 that value. */
3973 tree
3976 {
3977 tree type;
3986 /* Throw away any conversions to wider types
3987 already present in the operands. */
3992 /* If primopN is first sign-extended from primopN's precision to opN's
3993 precision, then zero-extended from opN's precision to
3994 *restype_ptr precision, shortenings might be invalid. */
3997 && !unsignedp0
4002 && !unsignedp1
4006 /* Handle the case that OP0 does not *contain* a conversion
4007 but it *requires* conversion to FINAL_TYPE. */
4014 /* If one of the operands must be floated, we cannot optimize. */
4018 /* If first arg is constant, swap the args (changing operation
4019 so value is preserved), for canonicalization. Don't do this if
4020 the second arg is 0. */
4025 {
4042 {
4057 }
4059 }
4061 /* If comparing an integer against a constant more bits wide,
4062 maybe we can deduce a value of 1 or 0 independent of the data.
4063 Or else truncate the constant now
4064 rather than extend the variable at run time.
4066 This is only interesting if the constant is the wider arg.
4067 Also, it is not safe if the constant is unsigned and the
4068 variable arg is signed, since in this case the variable
4069 would be sign-extended and then regarded as unsigned.
4070 Our technique fails in this case because the lowest/highest
4071 possible unsigned results don't follow naturally from the
4072 lowest/highest possible values of the variable operand.
4073 For just EQ_EXPR and NE_EXPR there is another technique that
4074 could be used: see if the constant can be faithfully represented
4075 in the other operand's type, by truncating it and reextending it
4076 and see if that preserves the constant's value. */
4082 {
4085 /* 1 if comparison is nominally unsigned. */
4087 tree val;
4099 {
4100 /* Convert primop1 to target type, but do not introduce
4101 additional overflow. We know primop1 is an int_cst. */
4105 }
4107 {
4110 }
4113 {
4118 }
4119 else
4120 {
4125 }
4128 /* This used to be a switch, but Genix compiler can't handle that. */
4130 {
4133 }
4135 {
4138 }
4140 {
4145 }
4147 {
4152 }
4154 {
4159 }
4161 {
4166 }
4168 /* If primop0 was sign-extended and unsigned comparison specd,
4169 we did a signed comparison above using the signed type bounds.
4170 But the comparison we output must be unsigned.
4172 Also, for inequalities, VAL is no good; but if the signed
4173 comparison had *any* fixed result, it follows that the
4174 unsigned comparison just tests the sign in reverse
4175 (positive values are LE, negative ones GE).
4176 So we can generate an unsigned comparison
4177 against an extreme value of the signed type. */
4180 {
4183 {
4198 }
4200 }
4204 {
4211 }
4214 {
4215 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4219 }
4221 /* Value is not predetermined, but do the comparison
4222 in the type of the operand that is not constant.
4223 TYPE is already properly set. */
4224 }
4226 /* If either arg is decimal float and the other is float, find the
4227 proper common type to use for comparison. */
4238 /* If args' natural types are both narrower than nominal type
4239 and both extend in the same manner, compare them
4240 in the type of the wider arg.
4241 Otherwise must actually extend both to the nominal
4242 common type lest different ways of extending
4243 alter the result.
4244 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
4249 {
4253 type);
4254 /* Make sure shorter operand is extended the right way
4255 to match the longer operand. */
4256 primop0
4259 primop0);
4260 primop1
4263 primop1);
4264 }
4265 else
4266 {
4267 /* Here we must do the comparison on the nominal type
4268 using the args exactly as we received them. */
4275 {
4277 /* All unsigned values are >= 0, so we warn. However,
4278 if OP0 is a constant that is >= 0, the signedness of
4279 the comparison isn't an issue, so suppress the
4280 warning. */
4282 warn_type_limits && !in_system_header
4286 primop0)))
4287 /* Do not warn for enumeration types. */
4291 {
4308 }
4311 {
4312 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4317 }
4318 }
4319 }
4327 }
4328 \f
4329 /* Return a tree for the sum or difference (RESULTCODE says which)
4330 of pointer PTROP and integer INTOP. */
4332 tree
4335 {
4338 /* The result is a pointer of the same type that is being added. */
4342 {
4349 }
4351 {
4358 }
4359 else
4362 /* We are manipulating pointer values, so we don't need to warn
4363 about relying on undefined signed overflow. We disable the
4364 warning here because we use integer types so fold won't know that
4365 they are really pointers. */
4368 /* If what we are about to multiply by the size of the elements
4369 contains a constant term, apply distributive law
4370 and multiply that constant term separately.
4371 This helps produce common subexpressions. */
4376 /* If the constant comes from pointer subtraction,
4377 skip this optimization--it would cause an error. */
4379 /* If the constant is unsigned, and smaller than the pointer size,
4380 then we must skip this optimization. This is because it could cause
4381 an overflow error if the constant is negative but INTOP is not. */
4385 {
4390 /* Convert both subexpression types to the type of intop,
4391 because weird cases involving pointer arithmetic
4392 can result in a sum or difference with different type args. */
4397 }
4399 /* Convert the integer argument to a type the same size as sizetype
4400 so the multiply won't overflow spuriously. */
4406 /* Replace the integer argument with a suitable product by the object size.
4407 Do this multiplication as signed, then convert to the appropriate type
4408 for the pointer operation and disregard an overflow that occurred only
4409 because of the sign-extension change in the latter conversion. */
4410 {
4418 }
4420 /* Create the sum or difference. */
4429 }
4430 \f
4431 /* Wrap a C_MAYBE_CONST_EXPR around an expression that is fully folded
4432 and if NON_CONST is known not to be permitted in an evaluated part
4433 of a constant expression. */
4435 tree
4437 {
4441 /* This should never be called for C++. */
4445 /* The result of folding may have a NOP_EXPR to set TREE_NO_WARNING. */
4454 }
4456 /* Wrap a SAVE_EXPR around EXPR, if appropriate. Like save_expr, but
4457 for C folds the inside expression and wraps a C_MAYBE_CONST_EXPR
4458 around the SAVE_EXPR if needed so that c_fully_fold does not need
4459 to look inside SAVE_EXPRs. */
4461 tree
4463 {
4472 }
4474 /* Return whether EXPR is a declaration whose address can never be
4475 NULL. */
4477 bool
4479 {
4484 }
4486 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
4487 or for an `if' or `while' statement or ?..: exp. It should already
4488 have been validated to be of suitable type; otherwise, a bad
4489 diagnostic may result.
4491 The EXPR is located at LOCATION.
4493 This preparation consists of taking the ordinary
4494 representation of an expression expr and producing a valid tree
4495 boolean expression describing whether expr is nonzero. We could
4496 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
4497 but we optimize comparisons, &&, ||, and !.
4499 The resulting type should always be `truthvalue_type_node'. */
4501 tree
4503 {
4505 {
4547 ? truthvalue_true_node
4553 ? truthvalue_true_node
4558 /* Fall through. */
4561 {
4564 {
4565 /* Common Ada/Pascal programmer's mistake. */
4567 OPT_Waddress,
4569 inner);
4571 }
4573 }
4590 /* These don't change whether an object is nonzero or zero. */
4595 /* These don't change whether an object is zero or nonzero, but
4596 we can't ignore them if their second arg has side-effects. */
4598 {
4601 c_common_truthvalue_conversion
4604 }
4605 else
4610 /* Distribute the conversion into the arms of a COND_EXPR. */
4612 {
4615 /* In C++ one of the arms might have void type if it is throw. */
4623 }
4624 else
4625 {
4626 /* Folding will happen later for C. */
4634 }
4636 CASE_CONVERT:
4637 {
4641 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
4642 since that affects how `default_conversion' will behave. */
4646 /* Don't strip a conversion from C++0x scoped enum, since they
4647 don't implicitly convert to other types. */
4651 /* If this isn't narrowing the argument, we can ignore it. */
4655 }
4661 {
4665 }
4670 }
4673 {
4675 expr = (build_binary_op
4679 c_common_truthvalue_conversion
4682 c_common_truthvalue_conversion
4687 }
4690 {
4695 }
4696 else
4699 ret:
4702 }
4703 \f
4712 /* Apply the TYPE_QUALS to the new DECL. */
4714 void
4716 {
4724 /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr
4725 constructor can produce constant init, so rely on cp_finish_decl to
4726 clear TREE_READONLY if the variable has non-constant init. */
4729 {
4732 }
4734 {
4736 /* Allow 'restrict' on arrays of pointers.
4737 FIXME currently we just ignore it. */
4743 }
4744 }
4746 /* Hash function for the problem of multiple type definitions in
4747 different files. This must hash all types that will compare
4748 equal via comptypes to the same value. In practice it hashes
4749 on some of the simple stuff and leaves the details to comptypes. */
4751 static hashval_t
4753 {
4757 tree t2;
4759 {
4760 /* For pointers, hash on pointee type plus some swizzling. */
4763 /* Hash on number of elements and total size. */
4782 }
4783 /* FIXME: We want to use a DECL_CHAIN iteration method here, but
4784 TYPE_VALUES of ENUMERAL_TYPEs is stored as a TREE_LIST. */
4786 /* We might have a VLA here. */
4789 else
4792 }
4796 /* Return the typed-based alias set for T, which may be an expression
4797 or a type. Return -1 if we don't do anything special. */
4799 alias_set_type
4801 {
4802 tree u;
4805 /* For VLAs, use the alias set of the element type rather than the
4806 default of alias set 0 for types compared structurally. */
4808 {
4812 }
4814 /* Permit type-punning when accessing a union, provided the access
4815 is directly through the union. For example, this code does not
4816 permit taking the address of a union member and then storing
4817 through it. Even the type-punning allowed here is a GCC
4818 extension, albeit a common and useful one; the C standard says
4819 that such accesses have implementation-defined behavior. */
4827 /* That's all the expressions we handle specially. */
4831 /* The C standard guarantees that any object may be accessed via an
4832 lvalue that has character type. */
4838 /* The C standard specifically allows aliasing between signed and
4839 unsigned variants of the same type. We treat the signed
4840 variant as canonical. */
4842 {
4845 /* t1 == t can happen for boolean nodes which are always unsigned. */
4848 }
4850 /* Handle the case of multiple type nodes referring to "the same" type,
4851 which occurs with IMA. These share an alias set. FIXME: Currently only
4852 C90 is handled. (In C99 type compatibility is not transitive, which
4853 complicates things mightily. The alias set splay trees can theoretically
4854 represent this, but insertion is tricky when you consider all the
4855 different orders things might arrive in.) */
4860 /* Save time if there's only one input file. */
4864 /* Pointers need special handling if they point to any type that
4865 needs special handling (below). */
4867 {
4868 tree t2;
4869 /* Find bottom type under any nested POINTERs. */
4873 ;
4881 }
4882 /* These are the only cases that need special handling. */
4889 /* Undefined? */
4893 /* Look up t in hash table. Only one of the compatible types within each
4894 alias set is recorded in the table. */
4898 NULL);
4901 {
4904 }
4905 else
4906 /* Our caller will assign and record (in t) a new alias set; all we need
4907 to do is remember t in the hash table. */
4911 }
4912 \f
4913 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where
4914 the second parameter indicates which OPERATOR is being applied.
4915 The COMPLAIN flag controls whether we should diagnose possibly
4916 ill-formed constructs or not. LOC is the location of the SIZEOF or
4917 TYPEOF operator. */
4919 tree
4922 {
4930 {
4932 {
4939 }
4940 else
4941 {
4943 {
4947 else
4950 }
4952 }
4953 }
4955 {
4963 }
4966 {
4971 }
4974 {
4979 }
4980 else
4981 {
4983 /* Convert in case a char is more than one unit. */
4987 else
4989 }
4991 /* VALUE will have the middle-end integer type sizetype.
4992 However, we should really return a value of type `size_t',
4993 which is just a typedef for an ordinary integer type. */
4997 }
4999 /* Implement the __alignof keyword: Return the minimum required
5000 alignment of EXPR, measured in bytes. For VAR_DECLs,
5001 FUNCTION_DECLs and FIELD_DECLs return DECL_ALIGN (which can be set
5002 from an "aligned" __attribute__ specification). LOC is the
5003 location of the ALIGNOF operator. */
5005 tree
5007 {
5008 tree t;
5015 {
5018 }
5024 {
5031 {
5038 }
5040 }
5041 else
5045 }
5046 \f
5047 /* Handle C and C++ default attributes. */
5049 enum built_in_attribute
5050 {
5051 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
5052 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
5053 #define DEF_ATTR_STRING(ENUM, VALUE) ENUM,
5054 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
5055 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
5057 #undef DEF_ATTR_NULL_TREE
5058 #undef DEF_ATTR_INT
5059 #undef DEF_ATTR_STRING
5060 #undef DEF_ATTR_IDENT
5061 #undef DEF_ATTR_TREE_LIST
5062 ATTR_LAST
5063 };
5069 enum c_builtin_type
5070 {
5071 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
5072 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
5073 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
5074 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
5075 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5076 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5077 #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
5078 #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6) NAME,
5079 #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7) NAME,
5080 #define DEF_FUNCTION_TYPE_8(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7, ARG8) NAME,
5081 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
5082 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
5083 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
5084 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5085 #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5086 #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG6) \
5087 NAME,
5088 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
5090 #undef DEF_PRIMITIVE_TYPE
5091 #undef DEF_FUNCTION_TYPE_0
5092 #undef DEF_FUNCTION_TYPE_1
5093 #undef DEF_FUNCTION_TYPE_2
5094 #undef DEF_FUNCTION_TYPE_3
5095 #undef DEF_FUNCTION_TYPE_4
5096 #undef DEF_FUNCTION_TYPE_5
5097 #undef DEF_FUNCTION_TYPE_6
5098 #undef DEF_FUNCTION_TYPE_7
5099 #undef DEF_FUNCTION_TYPE_8
5100 #undef DEF_FUNCTION_TYPE_VAR_0
5101 #undef DEF_FUNCTION_TYPE_VAR_1
5102 #undef DEF_FUNCTION_TYPE_VAR_2
5103 #undef DEF_FUNCTION_TYPE_VAR_3
5104 #undef DEF_FUNCTION_TYPE_VAR_4
5105 #undef DEF_FUNCTION_TYPE_VAR_5
5106 #undef DEF_POINTER_TYPE
5107 BT_LAST
5108 };
5112 /* A temporary array for c_common_nodes_and_builtins. Used in
5113 communication with def_fn_type. */
5116 /* A helper function for c_common_nodes_and_builtins. Build function type
5117 for DEF with return type RET and N arguments. If VAR is true, then the
5118 function should be variadic after those N arguments.
5120 Takes special care not to ICE if any of the types involved are
5121 error_mark_node, which indicates that said type is not in fact available
5122 (see builtin_type_for_size). In which case the function type as a whole
5123 should be error_mark_node. */
5125 static void
5127 {
5128 tree t;
5135 {
5141 }
5148 else
5151 egress:
5154 }
5156 /* Build builtin functions common to both C and C++ language
5157 frontends. */
5159 static void
5161 {
5162 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
5163 builtin_types[ENUM] = VALUE;
5164 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
5165 def_fn_type (ENUM, RETURN, 0, 0);
5166 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
5167 def_fn_type (ENUM, RETURN, 0, 1, ARG1);
5168 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
5169 def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
5170 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5171 def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
5172 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5173 def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
5174 #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5175 def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5176 #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5177 ARG6) \
5178 def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
5179 #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5180 ARG6, ARG7) \
5181 def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
5182 #define DEF_FUNCTION_TYPE_8(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5183 ARG6, ARG7, ARG8) \
5184 def_fn_type (ENUM, RETURN, 0, 8, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5185 ARG7, ARG8);
5186 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
5187 def_fn_type (ENUM, RETURN, 1, 0);
5188 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
5189 def_fn_type (ENUM, RETURN, 1, 1, ARG1);
5190 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
5191 def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
5192 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5193 def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
5194 #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5195 def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
5196 #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5197 def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5198 #define DEF_POINTER_TYPE(ENUM, TYPE) \
5199 builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
5203 #undef DEF_PRIMITIVE_TYPE
5204 #undef DEF_FUNCTION_TYPE_1
5205 #undef DEF_FUNCTION_TYPE_2
5206 #undef DEF_FUNCTION_TYPE_3
5207 #undef DEF_FUNCTION_TYPE_4
5208 #undef DEF_FUNCTION_TYPE_5
5209 #undef DEF_FUNCTION_TYPE_6
5210 #undef DEF_FUNCTION_TYPE_VAR_0
5211 #undef DEF_FUNCTION_TYPE_VAR_1
5212 #undef DEF_FUNCTION_TYPE_VAR_2
5213 #undef DEF_FUNCTION_TYPE_VAR_3
5214 #undef DEF_FUNCTION_TYPE_VAR_4
5215 #undef DEF_FUNCTION_TYPE_VAR_5
5216 #undef DEF_POINTER_TYPE
5221 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
5222 NONANSI_P, ATTRS, IMPLICIT, COND) \
5223 if (NAME && COND) \
5224 def_builtin_1 (ENUM, NAME, CLASS, \
5225 builtin_types[(int) TYPE], \
5226 builtin_types[(int) LIBTYPE], \
5227 BOTH_P, FALLBACK_P, NONANSI_P, \
5228 built_in_attributes[(int) ATTRS], IMPLICIT);
5230 #undef DEF_BUILTIN
5238 }
5240 /* Like get_identifier, but avoid warnings about null arguments when
5241 the argument may be NULL for targets where GCC lacks stdint.h type
5242 information. */
5246 {
5248 }
5250 /* Build tree nodes and builtin functions common to both C and C++ language
5251 frontends. */
5253 void
5255 {
5259 tree array_domain_type;
5260 tree va_list_ref_type_node;
5261 tree va_list_arg_type_node;
5265 /* Define `int' and `char' first so that dbx will output them first. */
5269 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
5270 "unsigned long", "long long unsigned" and "unsigned short" were in C++
5271 but not C. Are the conditionals here needed? */
5277 long_unsigned_type_node);
5279 {
5281 int128_integer_type_node);
5283 int128_unsigned_type_node);
5284 }
5288 long_long_integer_type_node);
5290 long_long_unsigned_type_node);
5293 long_long_unsigned_type_node);
5296 short_unsigned_type_node);
5299 short_unsigned_type_node);
5301 /* Define both `signed char' and `unsigned char'. */
5305 /* These are types that c_common_type_for_size and
5306 c_common_type_for_mode use. */
5309 intQI_type_node));
5312 intHI_type_node));
5315 intSI_type_node));
5318 intDI_type_node));
5319 #if HOST_BITS_PER_WIDE_INT >= 64
5322 TYPE_DECL,
5324 intTI_type_node));
5325 #endif
5328 unsigned_intQI_type_node));
5331 unsigned_intHI_type_node));
5334 unsigned_intSI_type_node));
5337 unsigned_intDI_type_node));
5338 #if HOST_BITS_PER_WIDE_INT >= 64
5341 TYPE_DECL,
5343 unsigned_intTI_type_node));
5344 #endif
5346 /* Create the widest literal types. */
5347 widest_integer_literal_type_node
5351 widest_integer_literal_type_node));
5353 widest_unsigned_literal_type_node
5357 widest_unsigned_literal_type_node));
5361 pid_type_node =
5368 /* Only supported decimal floating point extension if the target
5369 actually supports underlying modes. */
5373 {
5377 }
5380 {
5385 long_long_fract_type_node);
5387 unsigned_short_fract_type_node);
5389 unsigned_fract_type_node);
5391 unsigned_long_fract_type_node);
5393 unsigned_long_long_fract_type_node);
5395 sat_short_fract_type_node);
5398 sat_long_fract_type_node);
5400 sat_long_long_fract_type_node);
5402 sat_unsigned_short_fract_type_node);
5404 sat_unsigned_fract_type_node);
5406 sat_unsigned_long_fract_type_node);
5408 sat_unsigned_long_long_fract_type_node);
5413 long_long_accum_type_node);
5415 unsigned_short_accum_type_node);
5417 unsigned_accum_type_node);
5419 unsigned_long_accum_type_node);
5421 unsigned_long_long_accum_type_node);
5423 sat_short_accum_type_node);
5426 sat_long_accum_type_node);
5428 sat_long_long_accum_type_node);
5430 sat_unsigned_short_accum_type_node);
5432 sat_unsigned_accum_type_node);
5434 sat_unsigned_long_accum_type_node);
5436 sat_unsigned_long_long_accum_type_node);
5438 }
5441 TYPE_DECL,
5443 complex_integer_type_node));
5445 TYPE_DECL,
5447 complex_float_type_node));
5449 TYPE_DECL,
5451 complex_double_type_node));
5455 complex_long_double_type_node));
5458 /* For C++, make fileptr_type_node a distinct void * type until
5459 FILE type is defined. */
5464 /* Set the TYPE_NAME for any variants that were built before
5465 record_builtin_type gave names to the built-in types. */
5466 {
5472 }
5474 /* This node must not be shared. */
5480 /* Make a type to be the domain of a few array types
5481 whose domains don't really matter.
5482 200 is small enough that it always fits in size_t
5483 and large enough that it can hold most function names for the
5484 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
5487 /* Make a type for arrays of characters.
5488 With luck nothing will ever really depend on the length of this
5489 array type. */
5490 char_array_type_node
5493 /* Likewise for arrays of ints. */
5494 int_array_type_node
5498 const_string_type_node
5502 /* This is special for C++ so functions can be overloaded. */
5508 {
5511 else
5514 }
5516 /* This is for wide string constants. */
5517 wchar_array_type_node
5520 /* Define 'char16_t'. */
5525 {
5530 }
5532 /* This is for UTF-16 string constants. */
5533 char16_array_type_node
5536 /* Define 'char32_t'. */
5541 {
5546 }
5548 /* This is for UTF-32 string constants. */
5549 char32_array_type_node
5552 wint_type_node =
5555 intmax_type_node =
5557 uintmax_type_node =
5561 sig_atomic_type_node =
5564 int8_type_node =
5567 int16_type_node =
5570 int32_type_node =
5573 int64_type_node =
5576 uint8_type_node =
5579 c_uint16_type_node =
5582 c_uint32_type_node =
5585 c_uint64_type_node =
5588 int_least8_type_node =
5591 int_least16_type_node =
5594 int_least32_type_node =
5597 int_least64_type_node =
5600 uint_least8_type_node =
5603 uint_least16_type_node =
5606 uint_least32_type_node =
5609 uint_least64_type_node =
5612 int_fast8_type_node =
5615 int_fast16_type_node =
5618 int_fast32_type_node =
5621 int_fast64_type_node =
5624 uint_fast8_type_node =
5627 uint_fast16_type_node =
5630 uint_fast32_type_node =
5633 uint_fast64_type_node =
5636 intptr_type_node =
5639 uintptr_type_node =
5642 default_function_type
5644 ptrdiff_type_node
5651 va_list_type_node));
5653 {
5656 tree ptype;
5659 {
5663 ptype));
5665 }
5666 }
5669 {
5672 }
5673 else
5674 {
5677 }
5684 /* Create the built-in __null node. It is important that this is
5685 not shared. */
5689 /* Since builtin_types isn't gc'ed, don't export these nodes. */
5691 }
5693 /* The number of named compound-literals generated thus far. */
5696 /* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */
5698 void
5700 {
5703 compound_literal_number);
5704 compound_literal_number++;
5706 }
5708 tree
5710 {
5714 }
5717 /* Linked list of disabled built-in functions. */
5720 {
5728 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
5729 begins with "__builtin_", give an error. */
5731 void
5733 {
5736 else
5737 {
5742 }
5743 }
5746 /* Return true if the built-in function NAME has been disabled, false
5747 otherwise. */
5749 static bool
5751 {
5754 {
5757 }
5759 }
5762 /* Worker for DEF_BUILTIN.
5763 Possibly define a builtin function with one or two names.
5764 Does not declare a non-__builtin_ function if flag_no_builtin, or if
5765 nonansi_p and flag_no_nonansi_builtin. */
5767 static void
5774 {
5775 tree decl;
5788 fnattrs);
5797 }
5798 \f
5799 /* Nonzero if the type T promotes to int. This is (nearly) the
5800 integral promotions defined in ISO C99 6.3.1.1/2. */
5802 bool
5804 {
5806 {
5816 /* ??? Technically all enumerations not larger than an int
5817 promote to an int. But this is used along code paths
5818 that only want to notice a size change. */
5826 }
5827 }
5829 /* Return 1 if PARMS specifies a fixed number of parameters
5830 and none of their types is affected by default promotions. */
5832 int
5834 {
5835 const_tree t;
5837 {
5854 }
5856 }
5858 /* Recursively remove any '*' or '&' operator from TYPE. */
5859 tree
5861 {
5865 }
5867 /* Recursively remove pointer or array type from TYPE. */
5868 tree
5870 {
5874 }
5876 /* Used to compare case labels. K1 and K2 are actually tree nodes
5877 representing case labels, or NULL_TREE for a `default' label.
5878 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
5879 K2, and 0 if K1 and K2 are equal. */
5881 int
5883 {
5884 /* Consider a NULL key (such as arises with a `default' label) to be
5885 smaller than anything else. */
5892 }
5894 /* Process a case label, located at LOC, for the range LOW_VALUE
5895 ... HIGH_VALUE. If LOW_VALUE and HIGH_VALUE are both NULL_TREE
5896 then this case label is actually a `default' label. If only
5897 HIGH_VALUE is NULL_TREE, then case label was declared using the
5898 usual C/C++ syntax, rather than the GNU case range extension.
5899 CASES is a tree containing all the case ranges processed so far;
5900 COND is the condition for the switch-statement itself. Returns the
5901 CASE_LABEL_EXPR created, or ERROR_MARK_NODE if no CASE_LABEL_EXPR
5902 is created. */
5904 tree
5907 {
5908 tree type;
5909 tree label;
5910 tree case_label;
5911 splay_tree_node node;
5913 /* Create the LABEL_DECL itself. */
5916 /* If there was an error processing the switch condition, bail now
5917 before we get more confused. */
5925 {
5928 }
5930 /* Case ranges are a GNU extension. */
5937 {
5942 }
5944 {
5949 }
5952 {
5953 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
5954 really a case range, even though it was written that way.
5955 Remove the HIGH_VALUE to simplify later processing. */
5960 }
5962 /* See if the case is in range of the type of the original testing
5963 expression. If both low_value and high_value are out of range,
5964 don't insert the case label and return NULL_TREE. */
5970 /* Look up the LOW_VALUE in the table of case labels we already
5971 have. */
5973 /* If there was not an exact match, check for overlapping ranges.
5974 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
5975 that's a `default' label and the only overlap is an exact match. */
5977 {
5978 splay_tree_node low_bound;
5979 splay_tree_node high_bound;
5981 /* Even though there wasn't an exact match, there might be an
5982 overlap between this case range and another case range.
5983 Since we've (inductively) not allowed any overlapping case
5984 ranges, we simply need to find the greatest low case label
5985 that is smaller that LOW_VALUE, and the smallest low case
5986 label that is greater than LOW_VALUE. If there is an overlap
5987 it will occur in one of these two ranges. */
5993 /* Check to see if the LOW_BOUND overlaps. It is smaller than
5994 the LOW_VALUE, so there is no need to check unless the
5995 LOW_BOUND is in fact itself a case range. */
6001 /* Check to see if the HIGH_BOUND overlaps. The low end of that
6002 range is bigger than the low end of the current range, so we
6003 are only interested if the current range is a real range, and
6004 not an ordinary case label. */
6006 && high_value
6008 high_value)
6011 }
6012 /* If there was an overlap, issue an error. */
6014 {
6018 {
6022 }
6024 {
6027 }
6028 else
6029 {
6033 }
6035 }
6037 /* Add a CASE_LABEL to the statement-tree. */
6039 /* Register this case label in the splay tree. */
6046 error_out:
6047 /* Add a label so that the back-end doesn't think that the beginning of
6048 the switch is unreachable. Note that we do not add a case label, as
6049 that just leads to duplicates and thence to failure later on. */
6051 {
6054 }
6056 }
6058 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
6059 Used to verify that case values match up with enumerator values. */
6061 static void
6063 {
6066 /* ??? Not working too hard to print the double-word value.
6067 Should perhaps be done with %lwd in the diagnostic routines? */
6076 else
6085 buf);
6086 else
6091 }
6093 /* Subroutine of c_do_switch_warnings, called via splay_tree_foreach.
6094 Used to verify that case values match up with enumerator values. */
6096 static int
6098 {
6102 /* Skip default case. */
6106 /* If CASE_LOW_SEEN is not set, that means CASE_LOW did not appear
6107 when we did our enum->case scan. Reset our scratch bit after. */
6110 else
6113 /* If CASE_HIGH is non-null, we have a range. If CASE_HIGH_SEEN is
6114 not set, that means that CASE_HIGH did not appear when we did our
6115 enum->case scan. Reset our scratch bit after. */
6117 {
6120 else
6122 }
6125 }
6127 /* Handle -Wswitch*. Called from the front end after parsing the
6128 switch construct. */
6129 /* ??? Should probably be somewhere generic, since other languages
6130 besides C and C++ would want this. At the moment, however, C/C++
6131 are the only tree-ssa languages that support enumerations at all,
6132 so the point is moot. */
6134 void
6137 {
6138 splay_tree_node default_node;
6139 splay_tree_node node;
6140 tree chain;
6150 /* From here on, we only care about about enumerated types. */
6154 /* From here on, we only care about -Wswitch and -Wswitch-enum. */
6158 /* Check the cases. Warn about case values which are not members of
6159 the enumerated type. For -Wswitch-enum, or for -Wswitch when
6160 there is no default case, check that exactly all enumeration
6161 literals are covered by the cases. */
6163 /* Clearing COND if it is not an integer constant simplifies
6164 the tests inside the loop below. */
6168 /* The time complexity here is O(N*lg(N)) worst case, but for the
6169 common case of monotonically increasing enumerators, it is
6170 O(N), since the nature of the splay tree will keep the next
6171 element adjacent to the root at all times. */
6174 {
6180 {
6181 /* Mark the CASE_LOW part of the case entry as seen. */
6185 }
6187 /* Even though there wasn't an exact match, there might be a
6188 case range which includes the enumerator's value. */
6191 {
6195 {
6196 /* If we match the upper bound exactly, mark the CASE_HIGH
6197 part of the case entry as seen. */
6201 }
6202 }
6204 /* We've now determined that this enumerated literal isn't
6205 handled by the case labels of the switch statement. */
6207 /* If the switch expression is a constant, we only really care
6208 about whether that constant is handled by the switch. */
6212 /* If there is a default_node, the only relevant option is
6213 Wswitch-enum. Otherwise, if both are enabled then we prefer
6214 to warn using -Wswitch because -Wswitch is enabled by -Wall
6215 while -Wswitch-enum is explicit. */
6218 ? OPT_Wswitch_enum
6222 }
6224 /* Warn if there are case expressions that don't correspond to
6225 enumerators. This can occur since C and C++ don't enforce
6226 type-checking of assignments to enumeration variables.
6228 The time complexity here is now always O(N) worst case, since
6229 we should have marked both the lower bound and upper bound of
6230 every disjoint case label, with CASE_LOW_SEEN and CASE_HIGH_SEEN
6231 above. This scan also resets those fields. */
6234 }
6236 /* Finish an expression taking the address of LABEL (an
6237 IDENTIFIER_NODE). Returns an expression for the address.
6239 LOC is the location for the expression returned. */
6241 tree
6243 {
6244 tree result;
6254 else
6255 {
6258 /* The current function is not necessarily uninlinable.
6259 Computed gotos are incompatible with inlining, but the value
6260 here could be used only in a diagnostic, for example. */
6262 }
6265 }
6266 \f
6268 /* Given a boolean expression ARG, return a tree representing an increment
6269 or decrement (as indicated by CODE) of ARG. The front end must check for
6270 invalid cases (e.g., decrement in C++). */
6271 tree
6273 {
6274 tree val;
6279 {
6302 }
6305 }
6306 \f
6307 /* Built-in macros for stddef.h and stdint.h, that require macros
6308 defined in this file. */
6309 void
6311 {
6374 }
6376 static void
6378 {
6379 /* Fill in the built_in_attributes array. */
6380 #define DEF_ATTR_NULL_TREE(ENUM) \
6381 built_in_attributes[(int) ENUM] = NULL_TREE;
6382 #define DEF_ATTR_INT(ENUM, VALUE) \
6383 built_in_attributes[(int) ENUM] = build_int_cst (integer_type_node, VALUE);
6384 #define DEF_ATTR_STRING(ENUM, VALUE) \
6385 built_in_attributes[(int) ENUM] = build_string (strlen (VALUE), VALUE);
6386 #define DEF_ATTR_IDENT(ENUM, STRING) \
6387 built_in_attributes[(int) ENUM] = get_identifier (STRING);
6388 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
6389 built_in_attributes[(int) ENUM] \
6390 = tree_cons (built_in_attributes[(int) PURPOSE], \
6391 built_in_attributes[(int) VALUE], \
6392 built_in_attributes[(int) CHAIN]);
6394 #undef DEF_ATTR_NULL_TREE
6395 #undef DEF_ATTR_INT
6396 #undef DEF_ATTR_IDENT
6397 #undef DEF_ATTR_TREE_LIST
6398 }
6400 /* Returns TRUE iff the attribute indicated by ATTR_ID takes a plain
6401 identifier as an argument, so the front end shouldn't look it up. */
6403 bool
6405 {
6408 /* Unknown attribute that we'll end up ignoring, return true so we
6409 don't complain about an identifier argument. */
6415 else
6417 }
6419 /* Attribute handlers common to C front ends. */
6421 /* Handle a "packed" attribute; arguments as in
6422 struct attribute_spec.handler. */
6424 static tree
6427 {
6429 {
6433 }
6435 {
6437 /* Still pack bitfields. */
6442 else
6444 }
6445 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
6446 used for DECL_REGISTER. It wouldn't mean anything anyway.
6447 We can't set DECL_PACKED on the type of a TYPE_DECL, because
6448 that changes what the typedef is typing. */
6449 else
6450 {
6453 }
6456 }
6458 /* Handle a "nocommon" attribute; arguments as in
6459 struct attribute_spec.handler. */
6461 static tree
6465 {
6468 else
6469 {
6472 }
6475 }
6477 /* Handle a "common" attribute; arguments as in
6478 struct attribute_spec.handler. */
6480 static tree
6483 {
6486 else
6487 {
6490 }
6493 }
6495 /* Handle a "noreturn" attribute; arguments as in
6496 struct attribute_spec.handler. */
6498 static tree
6501 {
6504 /* See FIXME comment in c_common_attribute_table. */
6511 = build_pointer_type
6514 else
6515 {
6518 }
6521 }
6523 /* Handle a "hot" and attribute; arguments as in
6524 struct attribute_spec.handler. */
6526 static tree
6529 {
6532 {
6534 {
6538 }
6539 /* Most of the rest of the hot processing is done later with
6540 lookup_attribute. */
6541 }
6542 else
6543 {
6546 }
6549 }
6551 /* Handle a "cold" and attribute; arguments as in
6552 struct attribute_spec.handler. */
6554 static tree
6557 {
6560 {
6562 {
6566 }
6567 /* Most of the rest of the cold processing is done later with
6568 lookup_attribute. */
6569 }
6570 else
6571 {
6574 }
6577 }
6579 /* Handle a "no_sanitize_address" attribute; arguments as in
6580 struct attribute_spec.handler. */
6582 static tree
6585 {
6587 {
6590 }
6593 }
6595 /* Handle a "no_address_safety_analysis" attribute; arguments as in
6596 struct attribute_spec.handler. */
6598 static tree
6601 {
6610 }
6612 /* Handle a "no_sanitize_undefined" attribute; arguments as in
6613 struct attribute_spec.handler. */
6615 static tree
6618 {
6620 {
6623 }
6626 }
6628 /* Handle a "noinline" attribute; arguments as in
6629 struct attribute_spec.handler. */
6631 static tree
6635 {
6638 else
6639 {
6642 }
6645 }
6647 /* Handle a "noclone" attribute; arguments as in
6648 struct attribute_spec.handler. */
6650 static tree
6654 {
6656 {
6659 }
6662 }
6664 /* Handle a "always_inline" attribute; arguments as in
6665 struct attribute_spec.handler. */
6667 static tree
6672 {
6674 {
6675 /* Set the attribute and mark it for disregarding inline
6676 limits. */
6678 }
6679 else
6680 {
6683 }
6686 }
6688 /* Handle a "gnu_inline" attribute; arguments as in
6689 struct attribute_spec.handler. */
6691 static tree
6696 {
6698 {
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 "leaf" attribute; arguments as in
6712 struct attribute_spec.handler. */
6714 static tree
6718 {
6720 {
6723 }
6725 {
6728 }
6731 }
6733 /* Handle an "artificial" attribute; arguments as in
6734 struct attribute_spec.handler. */
6736 static tree
6741 {
6743 {
6744 /* Do nothing else, just set the attribute. We'll get at
6745 it later with lookup_attribute. */
6746 }
6747 else
6748 {
6751 }
6754 }
6756 /* Handle a "flatten" attribute; arguments as in
6757 struct attribute_spec.handler. */
6759 static tree
6761 tree args ATTRIBUTE_UNUSED,
6763 {
6765 /* Do nothing else, just set the attribute. We'll get at
6766 it later with lookup_attribute. */
6767 ;
6768 else
6769 {
6772 }
6775 }
6777 /* Handle a "warning" or "error" attribute; arguments as in
6778 struct attribute_spec.handler. */
6780 static tree
6783 {
6786 /* Do nothing else, just set the attribute. We'll get at
6787 it later with lookup_attribute. */
6788 ;
6789 else
6790 {
6793 }
6796 }
6798 /* Handle a "used" attribute; arguments as in
6799 struct attribute_spec.handler. */
6801 static tree
6804 {
6810 {
6815 }
6816 else
6817 {
6820 }
6823 }
6825 /* Handle a "unused" attribute; arguments as in
6826 struct attribute_spec.handler. */
6828 static tree
6831 {
6833 {
6841 {
6846 }
6847 else
6848 {
6851 }
6852 }
6853 else
6854 {
6858 }
6861 }
6863 /* Handle a "externally_visible" attribute; arguments as in
6864 struct attribute_spec.handler. */
6866 static tree
6871 {
6875 {
6878 {
6882 }
6883 }
6884 else
6885 {
6888 }
6891 }
6893 /* Handle a "const" attribute; arguments as in
6894 struct attribute_spec.handler. */
6896 static tree
6899 {
6902 /* See FIXME comment on noreturn in c_common_attribute_table. */
6908 = build_pointer_type
6911 else
6912 {
6915 }
6918 }
6920 /* Handle a "transparent_union" attribute; arguments as in
6921 struct attribute_spec.handler. */
6923 static tree
6927 {
6928 tree type;
6939 {
6940 /* Make sure that the first field will work for a transparent union.
6941 If the type isn't complete yet, leave the check to the code in
6942 finish_struct. */
6944 {
6950 }
6953 {
6954 /* If the type isn't complete yet, setting the flag
6955 on a variant wouldn't ever be checked. */
6959 /* build_duplicate_type doesn't work for C++. */
6963 /* A type variant isn't good enough, since we don't a cast
6964 to such a type removed as a no-op. */
6966 }
6970 }
6972 ignored:
6975 }
6977 /* Subroutine of handle_{con,de}structor_attribute. Evaluate ARGS to
6978 get the requested priority for a constructor or destructor,
6979 possibly issuing diagnostics for invalid or reserved
6980 priorities. */
6982 static priority_type
6984 {
6985 HOST_WIDE_INT pri;
6986 tree arg;
6992 {
6995 else
6998 }
7011 {
7014 "destructor priorities from 0 to %d are reserved "
7016 MAX_RESERVED_INIT_PRIORITY);
7017 else
7019 "constructor priorities from 0 to %d are reserved "
7021 MAX_RESERVED_INIT_PRIORITY);
7022 }
7025 invalid:
7028 MAX_INIT_PRIORITY);
7029 else
7031 MAX_INIT_PRIORITY);
7033 }
7035 /* Handle a "constructor" attribute; arguments as in
7036 struct attribute_spec.handler. */
7038 static tree
7042 {
7049 {
7050 priority_type priority;
7055 }
7056 else
7057 {
7060 }
7063 }
7065 /* Handle a "destructor" attribute; arguments as in
7066 struct attribute_spec.handler. */
7068 static tree
7072 {
7079 {
7080 priority_type priority;
7085 }
7086 else
7087 {
7090 }
7093 }
7095 /* Nonzero if the mode is a valid vector mode for this architecture.
7096 This returns nonzero even if there is no hardware support for the
7097 vector mode, but we can emulate with narrower modes. */
7099 static int
7101 {
7105 /* Doh! What's going on? */
7114 /* Hardware support. Woo hoo! */
7120 /* We should probably return 1 if requesting V4DI and we have no DI,
7121 but we have V2DI, but this is probably very unlikely. */
7123 /* If we have support for the inner mode, we can safely emulate it.
7124 We may not have V2DI, but me can emulate with a pair of DIs. */
7126 }
7129 /* Handle a "mode" attribute; arguments as in
7130 struct attribute_spec.handler. */
7132 static tree
7135 {
7143 else
7144 {
7149 tree typefm;
7154 {
7160 }
7162 /* Change this type to have a type with the specified mode.
7163 First check for the special modes. */
7176 else
7179 {
7182 }
7185 {
7188 }
7192 {
7224 }
7226 {
7229 }
7232 {
7237 {
7240 }
7244 else
7247 }
7248 else
7249 {
7250 /* For fixed-point modes, we need to test if the signness of type
7251 and the machine mode are consistent. */
7254 {
7257 }
7258 /* For fixed-point modes, we need to pass saturating info. */
7262 }
7265 {
7268 }
7270 {
7271 /* For enumeral types, copy the precision from the integer
7272 type returned above. If not an INTEGER_TYPE, we can't use
7273 this mode for this type. */
7275 {
7278 }
7281 {
7284 }
7285 else
7286 {
7287 /* We cannot build a type variant, as there's code that assumes
7288 that TYPE_MAIN_VARIANT has the same mode. This includes the
7289 debug generators. Instead, create a subrange type. This
7290 results in all of the enumeral values being emitted only once
7291 in the original, and the subtype gets them by reference. */
7294 else
7297 }
7298 }
7302 {
7305 }
7308 }
7311 }
7313 /* Handle a "section" attribute; arguments as in
7314 struct attribute_spec.handler. */
7316 static tree
7319 {
7323 {
7329 {
7333 {
7335 "section attribute cannot be specified for "
7338 }
7340 /* The decl may have already been given a section attribute
7341 from a previous declaration. Ensure they match. */
7345 {
7349 }
7353 {
7356 }
7357 else
7359 }
7360 else
7361 {
7364 }
7365 }
7366 else
7367 {
7371 }
7374 }
7376 /* Check whether ALIGN is a valid user-specified alignment. If so,
7377 return its base-2 log; if not, output an error and return -1. If
7378 ALLOW_ZERO then 0 is valid and should result in a return of -1 with
7379 no error. */
7380 int
7382 {
7387 {
7390 }
7395 {
7398 }
7400 {
7403 }
7405 }
7407 /*
7408 If in c++-11, check if the c++-11 alignment constraint with respect
7409 to fundamental alignment (in [dcl.align]) are satisfied. If not in
7410 c++-11 mode, does nothing.
7412 [dcl.align]2/ says:
7414 [* if the constant expression evaluates to a fundamental alignment,
7415 the alignment requirement of the declared entity shall be the
7416 specified fundamental alignment.
7418 * if the constant expression evaluates to an extended alignment
7419 and the implementation supports that alignment in the context
7420 of the declaration, the alignment of the declared entity shall
7421 be that alignment
7423 * if the constant expression evaluates to an extended alignment
7424 and the implementation does not support that alignment in the
7425 context of the declaration, the program is ill-formed]. */
7427 static bool
7431 {
7444 {
7446 {
7447 /* For file scope variables and static members, the target
7448 supports alignments that are at most
7449 MAX_OFILE_ALIGNMENT. */
7452 }
7453 else
7454 {
7455 #ifdef BIGGEST_FIELD_ALIGNMENT
7456 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_FIELD_ALIGNMENT
7457 #else
7458 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_ALIGNMENT
7459 #endif
7460 /* For non-static members, the target supports either
7461 alignments that at most either BIGGEST_FIELD_ALIGNMENT
7462 if it is defined or BIGGEST_ALIGNMENT. */
7467 #undef MAX_TARGET_FIELD_ALIGNMENT
7468 /* For stack variables, the target supports at most
7469 MAX_STACK_ALIGNMENT. */
7473 }
7474 }
7476 {
7477 /* Let's be liberal for types. */
7480 }
7488 }
7490 /* Handle a "aligned" attribute; arguments as in
7491 struct attribute_spec.handler. */
7493 static tree
7496 {
7505 {
7509 }
7517 {
7520 /* If we have a TYPE_DECL, then copy the type, so that we
7521 don't accidentally modify a builtin type. See pushdecl. */
7524 {
7531 }
7532 else
7537 }
7540 {
7543 }
7546 /* C++-11 [dcl.align/4]:
7548 When multiple alignment-specifiers are specified for an
7549 entity, the alignment requirement shall be set to the
7550 strictest specified alignment.
7552 This formally comes from the c++11 specification but we are
7553 doing it for the GNU attribute syntax as well. */
7557 {
7562 else
7566 }
7567 else
7568 {
7571 }
7574 }
7576 /* Handle a "weak" attribute; arguments as in
7577 struct attribute_spec.handler. */
7579 static tree
7584 {
7587 {
7590 }
7592 {
7596 }
7600 else
7604 }
7606 /* Handle an "alias" or "ifunc" attribute; arguments as in
7607 struct attribute_spec.handler, except that IS_ALIAS tells us
7608 whether this is an alias as opposed to ifunc attribute. */
7610 static tree
7613 {
7618 {
7621 }
7625 /* A static variable declaration is always a tentative definition,
7626 but the alias is a non-tentative definition which overrides. */
7629 {
7633 }
7637 {
7641 }
7643 /* Note that the very first time we process a nested declaration,
7644 decl_function_context will not be set. Indeed, *would* never
7645 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
7646 we do below. After such frobbery, pushdecl would set the context.
7647 In any case, this is never what we want. */
7649 {
7650 tree id;
7654 {
7658 }
7660 /* This counts as a use of the object pointed to. */
7665 else
7669 /* ifuncs are also aliases, so set that attribute too. */
7672 }
7673 else
7674 {
7677 }
7680 }
7682 /* Handle an "alias" or "ifunc" attribute; arguments as in
7683 struct attribute_spec.handler. */
7685 static tree
7688 {
7690 }
7692 /* Handle an "alias" or "ifunc" attribute; arguments as in
7693 struct attribute_spec.handler. */
7695 static tree
7698 {
7700 }
7702 /* Handle a "weakref" attribute; arguments as in struct
7703 attribute_spec.handler. */
7705 static tree
7708 {
7711 /* We must ignore the attribute when it is associated with
7712 local-scoped decls, since attribute alias is ignored and many
7713 such symbols do not even have a DECL_WEAK field. */
7715 || current_function_decl
7717 {
7721 }
7724 {
7728 }
7730 /* The idea here is that `weakref("name")' mutates into `weakref,
7731 alias("name")', and weakref without arguments, in turn,
7732 implicitly adds weak. */
7735 {
7742 }
7743 else
7744 {
7749 /* Can't call declare_weak because it wants this to be TREE_PUBLIC,
7750 and that isn't supported; and because it wants to add it to
7751 the list of weak decls, which isn't helpful. */
7753 }
7756 }
7758 /* Handle an "visibility" attribute; arguments as in
7759 struct attribute_spec.handler. */
7761 static tree
7765 {
7771 {
7775 {
7777 name);
7779 }
7781 {
7785 }
7786 }
7788 {
7791 }
7794 {
7797 }
7799 /* If this is a type, set the visibility on the type decl. */
7801 {
7806 {
7808 name);
7810 }
7811 }
7821 else
7822 {
7823 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
7825 }
7829 {
7843 }
7848 /* Go ahead and attach the attribute to the node as well. This is needed
7849 so we can determine whether we have VISIBILITY_DEFAULT because the
7850 visibility was not specified, or because it was explicitly overridden
7851 from the containing scope. */
7854 }
7856 /* Determine the ELF symbol visibility for DECL, which is either a
7857 variable or a function. It is an error to use this function if a
7858 definition of DECL is not available in this translation unit.
7859 Returns true if the final visibility has been determined by this
7860 function; false if the caller is free to make additional
7861 modifications. */
7863 bool
7865 {
7869 /* If the user explicitly specified the visibility with an
7870 attribute, honor that. DECL_VISIBILITY will have been set during
7871 the processing of the attribute. We check for an explicit
7872 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
7873 to distinguish the use of an attribute from the use of a "#pragma
7874 GCC visibility push(...)"; in the latter case we still want other
7875 considerations to be able to overrule the #pragma. */
7877 || (TARGET_DLLIMPORT_DECL_ATTRIBUTES
7882 /* Set default visibility to whatever the user supplied with
7883 visibility_specified depending on #pragma GCC visibility. */
7885 {
7888 {
7891 /* If visibility changed and DECL already has DECL_RTL, ensure
7892 symbol flags are updated. */
7897 }
7898 }
7900 }
7902 /* Handle an "tls_model" attribute; arguments as in
7903 struct attribute_spec.handler. */
7905 static tree
7908 {
7909 tree id;
7916 {
7919 }
7924 {
7927 }
7937 else
7938 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
7942 }
7944 /* Handle a "no_instrument_function" attribute; arguments as in
7945 struct attribute_spec.handler. */
7947 static tree
7952 {
7956 {
7960 }
7962 {
7966 }
7967 else
7971 }
7973 /* Handle a "malloc" attribute; arguments as in
7974 struct attribute_spec.handler. */
7976 static tree
7979 {
7983 else
7984 {
7987 }
7990 }
7992 /* Handle a "alloc_size" attribute; arguments as in
7993 struct attribute_spec.handler. */
7995 static tree
7998 {
8001 {
8008 {
8013 }
8014 }
8016 }
8018 /* Handle a "fn spec" attribute; arguments as in
8019 struct attribute_spec.handler. */
8021 static tree
8025 {
8030 }
8032 /* Handle a "bnd_variable_size" attribute; arguments as in
8033 struct attribute_spec.handler. */
8035 static tree
8038 {
8040 {
8043 }
8046 }
8048 /* Handle a "bnd_legacy" attribute; arguments as in
8049 struct attribute_spec.handler. */
8051 static tree
8054 {
8056 {
8059 }
8062 }
8064 /* Handle a "warn_unused" attribute; arguments as in
8065 struct attribute_spec.handler. */
8067 static tree
8069 tree args ATTRIBUTE_UNUSED,
8071 {
8073 /* Do nothing else, just set the attribute. We'll get at
8074 it later with lookup_attribute. */
8075 ;
8076 else
8077 {
8080 }
8083 }
8085 /* Handle an "omp declare simd" attribute; arguments as in
8086 struct attribute_spec.handler. */
8088 static tree
8090 {
8092 }
8094 /* Handle an "omp declare target" attribute; arguments as in
8095 struct attribute_spec.handler. */
8097 static tree
8099 {
8101 }
8103 /* Handle a "returns_twice" attribute; arguments as in
8104 struct attribute_spec.handler. */
8106 static tree
8109 {
8112 else
8113 {
8116 }
8119 }
8121 /* Handle a "no_limit_stack" attribute; arguments as in
8122 struct attribute_spec.handler. */
8124 static tree
8129 {
8133 {
8137 }
8139 {
8143 }
8144 else
8148 }
8150 /* Handle a "pure" attribute; arguments as in
8151 struct attribute_spec.handler. */
8153 static tree
8156 {
8159 /* ??? TODO: Support types. */
8160 else
8161 {
8164 }
8167 }
8169 /* Digest an attribute list destined for a transactional memory statement.
8170 ALLOWED is the set of attributes that are allowed for this statement;
8171 return the attribute we parsed. Multiple attributes are never allowed. */
8173 int
8175 {
8180 {
8188 {
8191 }
8194 {
8197 }
8200 else
8202 }
8205 }
8207 /* Transform a TM attribute name into a maskable integer and back.
8208 Note that NULL (i.e. no attribute) is mapped to UNKNOWN, corresponding
8209 to how the lack of an attribute is treated. */
8211 int
8213 {
8227 }
8229 tree
8231 {
8234 {
8252 }
8254 }
8256 /* Return the first TM attribute seen in LIST. */
8258 tree
8260 {
8262 {
8266 }
8268 }
8270 /* Handle the TM attributes; arguments as in struct attribute_spec.handler.
8271 Here we accept only function types, and verify that none of the other
8272 function TM attributes are also applied. */
8273 /* ??? We need to accept class types for C++, but not C. This greatly
8274 complicates this function, since we can no longer rely on the extra
8275 processing given by function_type_required. */
8277 static tree
8280 {
8281 /* Only one path adds the attribute; others don't. */
8285 {
8288 /* Only tm_callable and tm_safe apply to classes. */
8291 /* FALLTHRU */
8295 {
8298 ;
8301 else
8303 }
8307 {
8310 {
8315 }
8316 }
8317 /* FALLTHRU */
8320 /* If a function is next, pass it on to be tried next. */
8324 ignored:
8327 }
8330 }
8332 /* Handle the TM_WRAP attribute; arguments as in
8333 struct attribute_spec.handler. */
8335 static tree
8338 {
8341 /* We don't need the attribute even on success, since we
8342 record the entry in an external table. */
8347 else
8348 {
8354 else
8355 {
8359 {
8363 else
8365 }
8366 else
8368 }
8369 }
8372 }
8374 /* Ignore the given attribute. Used when this attribute may be usefully
8375 overridden by the target, but is not used generically. */
8377 static tree
8381 {
8384 }
8386 /* Handle a "no vops" attribute; arguments as in
8387 struct attribute_spec.handler. */
8389 static tree
8393 {
8397 }
8399 /* Handle a "deprecated" attribute; arguments as in
8400 struct attribute_spec.handler. */
8402 static tree
8406 {
8414 {
8417 }
8420 {
8431 else
8433 }
8435 {
8440 }
8441 else
8445 {
8448 {
8454 }
8457 else
8459 }
8462 }
8464 /* Handle a "vector_size" attribute; arguments as in
8465 struct attribute_spec.handler. */
8467 static tree
8471 {
8481 {
8484 }
8486 /* Get the vector size (in bytes). */
8489 /* We need to provide for vector pointers, vector arrays, and
8490 functions returning vectors. For example:
8492 __attribute__((vector_size(16))) short *foo;
8494 In this case, the mode is SI, but the type being modified is
8495 HI, so we need to look further. */
8504 /* Get the mode of the type being modified. */
8515 {
8518 }
8521 {
8524 }
8527 {
8530 }
8532 /* Calculate how many units fit in the vector. */
8535 {
8538 }
8542 /* Build back pointers if needed. */
8546 }
8548 /* Handle the "nonnull" attribute. */
8549 static tree
8553 {
8557 /* If no arguments are specified, all pointer arguments should be
8558 non-null. Verify a full prototype is given so that the arguments
8559 will have the correct types when we actually check them later. */
8561 {
8563 {
8566 }
8568 }
8570 /* Argument list specified. Verify that each argument number references
8571 a pointer argument. */
8573 {
8577 {
8582 }
8585 {
8586 function_args_iterator iter;
8587 tree argument;
8591 {
8595 }
8599 {
8604 }
8607 {
8612 }
8613 }
8614 }
8617 }
8619 /* Check the argument list of a function call for null in argument slots
8620 that are marked as requiring a non-null pointer argument. The NARGS
8621 arguments are passed in the array ARGARRAY.
8622 */
8624 static void
8626 {
8627 tree a;
8635 /* See if any of the nonnull attributes has no arguments. If so,
8636 then every pointer argument is checked (in which case the check
8637 for pointer type is done in check_nonnull_arg). */
8639 do
8647 else
8648 {
8649 /* Walk the argument list. If we encounter an argument number we
8650 should check for non-null, do it. */
8652 {
8654 {
8658 }
8663 }
8664 }
8665 }
8667 /* Check that the Nth argument of a function call (counting backwards
8668 from the end) is a (pointer)0. The NARGS arguments are passed in the
8669 array ARGARRAY. */
8671 static void
8673 {
8677 {
8680 tree sentinel;
8681 function_args_iterator iter;
8682 tree t;
8684 /* Skip over the named arguments. */
8686 {
8689 len++;
8690 }
8693 {
8696 }
8698 /* The sentinel must be one of the varargs, i.e.
8699 in position >= the number of fixed arguments. */
8701 {
8705 }
8707 /* Validate the sentinel. */
8711 /* Although __null (in C++) is only an integer we allow it
8712 nevertheless, as we are guaranteed that it's exactly
8713 as wide as a pointer, and we don't want to force
8714 users to cast the NULL they have written there.
8715 We warn with -Wstrict-null-sentinel, though. */
8718 }
8719 }
8721 /* Helper for check_function_nonnull; given a list of operands which
8722 must be non-null in ARGS, determine if operand PARAM_NUM should be
8723 checked. */
8725 static bool
8727 {
8731 {
8738 }
8740 }
8742 /* Check that the function argument PARAM (which is operand number
8743 PARAM_NUM) is non-null. This is called by check_function_nonnull
8744 via check_function_arguments_recurse. */
8746 static void
8749 {
8750 /* Just skip checking the argument if it's not a pointer. This can
8751 happen if the "nonnull" attribute was given without an operand
8752 list (which means to check every pointer argument). */
8760 }
8762 /* Helper for nonnull attribute handling; fetch the operand number
8763 from the attribute argument list. */
8765 static bool
8767 {
8768 /* Verify the arg number is a constant. */
8775 }
8777 /* Handle a "nothrow" attribute; arguments as in
8778 struct attribute_spec.handler. */
8780 static tree
8783 {
8786 /* ??? TODO: Support types. */
8787 else
8788 {
8791 }
8794 }
8796 /* Handle a "cleanup" attribute; arguments as in
8797 struct attribute_spec.handler. */
8799 static tree
8802 {
8806 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
8807 for global destructors in C++. This requires infrastructure that
8808 we don't have generically at the moment. It's also not a feature
8809 we'd be missing too much, since we do have attribute constructor. */
8811 {
8815 }
8817 /* Verify that the argument is a function in scope. */
8818 /* ??? We could support pointers to functions here as well, if
8819 that was considered desirable. */
8822 {
8826 }
8829 {
8833 }
8835 /* That the function has proper type is checked with the
8836 eventual call to build_function_call. */
8839 }
8841 /* Handle a "warn_unused_result" attribute. No special handling. */
8843 static tree
8847 {
8848 /* Ignore the attribute for functions not returning any value. */
8850 {
8853 }
8856 }
8858 /* Handle a "sentinel" attribute. */
8860 static tree
8863 {
8865 {
8869 }
8870 else
8871 {
8873 {
8877 }
8878 }
8881 {
8885 {
8889 }
8890 else
8891 {
8893 {
8897 }
8898 }
8899 }
8902 }
8904 /* Handle a "type_generic" attribute. */
8906 static tree
8910 {
8911 /* Ensure we have a function type. */
8914 /* Ensure we have a variadic function. */
8918 }
8920 /* Handle a "target" attribute. */
8922 static tree
8925 {
8926 /* Ensure we have a function type. */
8928 {
8931 }
8933 flags))
8937 }
8939 /* Arguments being collected for optimization. */
8944 /* Inner function to convert a TREE_LIST to argv string to parse the optimize
8945 options in ARGS. ATTR_P is true if this is for attribute(optimize), and
8946 false for #pragma GCC optimize. */
8948 bool
8950 {
8958 tree ap;
8960 /* Build up argv vector. Just in case the string is stored away, use garbage
8961 collected strings. */
8966 {
8970 {
8974 }
8977 {
8978 /* Split string into multiple substrings. */
8986 {
8993 {
8997 }
8998 else
8999 {
9002 }
9006 /* If the user supplied -Oxxx or -fxxx, only allow -Oxxx or -fxxx
9007 options. */
9009 {
9014 else
9018 }
9021 {
9024 /* Assume that Ox is -Ox, a numeric value is -Ox, a s by
9025 itself is -Os, and any other switch begins with a -f. */
9031 }
9036 }
9038 }
9039 }
9049 /* Now parse the options. */
9059 /* Don't allow changing -fstrict-aliasing. */
9064 }
9066 /* For handling "optimize" attribute. arguments as in
9067 struct attribute_spec.handler. */
9069 static tree
9072 {
9073 /* Ensure we have a function type. */
9075 {
9078 }
9079 else
9080 {
9084 /* Save current options. */
9087 /* If we previously had some optimization options, use them as the
9088 default. */
9093 /* Parse options, and update the vector. */
9098 /* Restore current options. */
9100 }
9103 }
9105 /* Handle a "no_split_stack" attribute. */
9107 static tree
9112 {
9116 {
9120 }
9122 {
9126 }
9129 }
9131 /* Handle a "returns_nonnull" attribute; arguments as in
9132 struct attribute_spec.handler. */
9134 static tree
9137 {
9138 // Even without a prototype we still have a return type we can check.
9140 {
9143 }
9145 }
9147 \f
9148 /* Check for valid arguments being passed to a function with FNTYPE.
9149 There are NARGS arguments in the array ARGARRAY. */
9150 void
9152 {
9153 /* Check for null being passed in a pointer argument that must be
9154 non-null. We also need to do this if format checking is enabled. */
9159 /* Check for errors in format strings. */
9166 }
9168 /* Generic argument checking recursion routine. PARAM is the argument to
9169 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
9170 once the argument is resolved. CTX is context for the callback. */
9171 void
9176 {
9180 {
9181 /* Strip coercion. */
9185 }
9188 {
9190 tree attrs;
9193 /* See if this is a call to a known internationalization function
9194 that modifies a format arg. Such a function may have multiple
9195 format_arg attributes (for example, ngettext). */
9198 attrs;
9201 {
9202 tree inner_arg;
9203 tree format_num_expr;
9206 call_expr_arg_iterator iter;
9208 /* Extract the argument number, which was previously checked
9209 to be valid. */
9221 {
9226 }
9227 }
9229 /* If we found a format_arg attribute and did a recursive check,
9230 we are done with checking this argument. Otherwise, we continue
9231 and this will be considered a non-literal. */
9234 }
9237 {
9238 /* Check both halves of the conditional expression. */
9244 }
9247 }
9249 /* Checks for a builtin function FNDECL that the number of arguments
9250 NARGS against the required number REQUIRED and issues an error if
9251 there is a mismatch. Returns true if the number of arguments is
9252 correct, otherwise false. */
9254 static bool
9256 {
9258 {
9262 }
9264 {
9268 }
9270 }
9272 /* Verifies the NARGS arguments ARGS to the builtin function FNDECL.
9273 Returns false if there was an error, otherwise true. */
9275 bool
9277 {
9283 {
9293 {
9295 {
9299 }
9301 }
9311 {
9318 {
9322 }
9324 }
9329 {
9334 {
9338 }
9341 {
9343 fndecl);
9345 }
9347 }
9352 {
9354 {
9357 }
9359 }
9364 }
9365 }
9367 /* Function to help qsort sort FIELD_DECLs by name order. */
9369 int
9371 {
9376 /* A nontype is "greater" than a type. */
9385 }
9388 gt_pointer_operator new_value;
9392 /* This routine compares two fields like field_decl_cmp but using the
9393 pointer operator in resort_data. */
9395 static int
9397 {
9402 /* A nontype is "greater" than a type. */
9408 {
9415 }
9417 }
9419 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
9421 void
9424 gt_pointer_operator new_value,
9426 {
9431 resort_field_decl_cmp);
9432 }
9434 /* Subroutine of c_parse_error.
9435 Return the result of concatenating LHS and RHS. RHS is really
9436 a string literal, its first character is indicated by RHS_START and
9437 RHS_SIZE is its length (including the terminating NUL character).
9439 The caller is responsible for deleting the returned pointer. */
9443 {
9449 }
9451 /* Issue the error given by GMSGID, indicating that it occurred before
9452 TOKEN, which had the associated VALUE. */
9454 void
9457 {
9458 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
9468 {
9473 {
9486 }
9490 else
9496 }
9518 {
9523 }
9531 {
9536 }
9537 else
9541 {
9544 }
9545 #undef catenate_messages
9546 }
9548 /* Mapping for cpp message reasons to the options that enable them. */
9550 struct reason_option_codes_t
9551 {
9554 };
9575 };
9577 /* Return the gcc option code associated with the reason for a cpp
9578 message, or 0 if none. */
9580 static int
9582 {
9586 {
9589 }
9591 }
9593 /* Callback from cpp_error for PFILE to print diagnostics from the
9594 preprocessor. The diagnostic is of type LEVEL, with REASON set
9595 to the reason code if LEVEL is represents a warning, at location
9596 LOCATION unless this is after lexing and the compiler's location
9597 should be used instead, with column number possibly overridden by
9598 COLUMN_OVERRIDE if not zero; MSG is the translated message and AP
9599 the arguments. Returns true if a diagnostic was emitted, false
9600 otherwise. */
9602 bool
9606 {
9607 diagnostic_info diagnostic;
9608 diagnostic_t dlevel;
9613 {
9618 /* Fall through. */
9643 }
9656 }
9658 /* Convert a character from the host to the target execution character
9659 set. cpplib handles this, mostly. */
9661 HOST_WIDE_INT
9663 {
9664 /* Character constants in GCC proper are sign-extended under -fsigned-char,
9665 zero-extended under -fno-signed-char. cpplib insists that characters
9666 and character constants are always unsigned. Hence we must convert
9667 back and forth. */
9675 else
9677 }
9679 /* Fold an offsetof-like expression. EXPR is a nested sequence of component
9680 references with an INDIRECT_REF of a constant at the bottom; much like the
9681 traditional rendering of offsetof as a macro. Return the folded result. */
9683 tree
9685 {
9689 {
9705 {
9708 }
9718 {
9722 }
9736 /* Check if the offset goes beyond the upper bound of the array. */
9738 {
9744 {
9748 {
9749 tree v;
9756 {
9764 }
9765 /* Don't warn if the array might be considered a poor
9766 man's flexible array member with a very permissive
9767 definition thereof. */
9771 "index %E denotes an offset "
9774 }
9775 }
9776 }
9783 /* Handle static members of volatile structs. */
9790 }
9793 }
9795 /* Likewise, but convert it to the return type of offsetof. */
9797 tree
9799 {
9801 }
9803 /* Warn for A ?: C expressions (with B omitted) where A is a boolean
9804 expression, because B will always be true. */
9806 void
9808 {
9811 "the omitted middle operand in ?: will always be %<true%>, "
9813 }
9815 /* Give an error for storing into ARG, which is 'const'. USE indicates
9816 how ARG was being used. */
9818 void
9820 {
9823 /* Using this macro rather than (for example) arrays of messages
9824 ensures that all the format strings are checked at compile
9825 time. */
9826 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
9827 : (use == lv_increment ? (I) \
9828 : (use == lv_decrement ? (D) : (AS))))
9830 {
9841 else
9847 }
9853 arg);
9859 arg);
9861 {
9871 arg);
9872 }
9878 arg);
9879 else
9884 arg);
9885 }
9887 /* Print an error message for an invalid lvalue. USE says
9888 how the lvalue is being used and so selects the error message. LOC
9889 is the location for the error. */
9891 void
9893 {
9895 {
9913 }
9914 }
9916 /* Print an error message for an invalid indirection of type TYPE.
9917 ERRSTRING is the name of the operator for the indirection. */
9919 void
9921 {
9923 {
9931 type);
9936 type);
9941 type);
9946 type);
9951 type);
9955 }
9956 }
9957 \f
9958 /* *PTYPE is an incomplete array. Complete it with a domain based on
9959 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
9960 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
9961 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
9963 int
9965 {
9973 {
9975 {
9976 int eltsize
9979 }
9981 {
9985 {
9989 }
9990 else
9991 {
9992 tree curindex;
10003 {
10007 else
10008 {
10010 {
10011 /* Since we treat size types now as ordinary
10012 unsigned types, we need an explicit overflow
10013 check. */
10017 }
10019 size_one_node);
10020 }
10023 }
10025 {
10029 }
10030 }
10031 }
10032 else
10033 {
10034 /* Make an error message unless that happened already. */
10037 }
10038 }
10039 else
10040 {
10044 }
10051 else
10054 /* Using build_distinct_type_copy and modifying things afterward instead
10055 of using build_array_type to create a new type preserves all of the
10056 TYPE_LANG_FLAG_? bits that the front end may have set. */
10064 /* Make sure we have the canonical MAIN_TYPE. */
10067 hashcode);
10070 /* Fix the canonical type. */
10080 else
10085 else
10091 {
10093 /* If we proceed with the array type as it is, we'll eventually
10094 crash in tree_low_cst(). */
10096 }
10100 }
10102 /* Like c_mark_addressable but don't check register qualifier. */
10103 void
10105 {
10111 }
10114 \f
10115 /* Used to help initialize the builtin-types.def table. When a type of
10116 the correct size doesn't exist, use error_mark_node instead of NULL.
10117 The later results in segfaults even when a decl using the type doesn't
10118 get invoked. */
10120 tree
10122 {
10125 }
10127 /* A helper function for resolve_overloaded_builtin in resolving the
10128 overloaded __sync_ builtins. Returns a positive power of 2 if the
10129 first operand of PARAMS is a pointer to a supported data type.
10130 Returns 0 if an error is encountered. */
10132 static int
10134 {
10135 tree type;
10139 {
10142 }
10156 incompatible:
10159 }
10161 /* A helper function for resolve_overloaded_builtin. Adds casts to
10162 PARAMS to make arguments match up with those of FUNCTION. Drops
10163 the variadic arguments at the end. Returns false if some error
10164 was encountered; true on success. */
10166 static bool
10169 {
10170 function_args_iterator iter;
10171 tree ptype;
10175 /* We've declared the implementation functions to use "volatile void *"
10176 as the pointer parameter, so we shouldn't get any complaints from the
10177 call to check_function_arguments what ever type the user used. */
10182 /* For the rest of the values, we need to cast these to FTYPE, so that we
10183 don't get warnings for passing pointer types, etc. */
10186 {
10190 /* XXX void_type_node belies the abstraction. */
10196 {
10199 }
10201 /* Only convert parameters if arg_type is unsigned integer type with
10202 new format sync routines, i.e. don't attempt to convert pointer
10203 arguments (e.g. EXPECTED argument of __atomic_compare_exchange_n),
10204 bool arguments (e.g. WEAK argument) or signed int arguments (memmodel
10205 kinds). */
10207 {
10208 /* Ideally for the first conversion we'd use convert_for_assignment
10209 so that we get warnings for anything that doesn't match the pointer
10210 type. This isn't portable across the C and C++ front ends atm. */
10215 }
10218 }
10220 /* __atomic routines are not variadic. */
10222 {
10225 }
10227 /* The definition of these primitives is variadic, with the remaining
10228 being "an optional list of variables protected by the memory barrier".
10229 No clue what that's supposed to mean, precisely, but we consider all
10230 call-clobbered variables to be protected so we're safe. */
10234 }
10236 /* A helper function for resolve_overloaded_builtin. Adds a cast to
10237 RESULT to make it match the type of the first pointer argument in
10238 PARAMS. */
10240 static tree
10242 {
10247 /* New format doesn't require casting unless the types are the same size. */
10250 else
10252 }
10254 /* This function verifies the PARAMS to generic atomic FUNCTION.
10255 It returns the size if all the parameters are the same size, otherwise
10256 0 is returned if the parameters are invalid. */
10258 static int
10261 {
10266 tree type_0;
10268 /* Determine the parameter makeup. */
10270 {
10286 }
10289 {
10292 }
10294 /* Get type of first parameter, and determine its size. */
10297 {
10299 function);
10301 }
10303 /* Types must be compile time constant sizes. */
10305 {
10308 function);
10310 }
10314 /* Zero size objects are not allowed. */
10316 {
10319 function);
10321 }
10323 /* Check each other parameter is a pointer and the same size. */
10325 {
10328 /* __atomic_compare_exchange has a bool in the 4th position, skip it. */
10332 {
10334 function);
10336 }
10339 {
10341 function);
10343 }
10344 }
10346 /* Check memory model parameters for validity. */
10348 {
10351 {
10354 {
10357 function);
10358 }
10359 }
10360 else
10362 {
10364 function);
10366 }
10367 }
10370 }
10373 /* This will take an __atomic_ generic FUNCTION call, and add a size parameter N
10374 at the beginning of the parameter list PARAMS representing the size of the
10375 objects. This is to match the library ABI requirement. LOC is the location
10376 of the function call.
10377 The new function is returned if it needed rebuilding, otherwise NULL_TREE is
10378 returned to allow the external call to be constructed. */
10380 static tree
10383 {
10384 tree size_node;
10386 /* Insert a SIZE_T parameter as the first param. If there isn't
10387 enough space, allocate a new vector and recursively re-build with that. */
10389 {
10392 tree f;
10401 }
10403 /* Add the size parameter and leave as a function call for processing. */
10407 }
10410 /* Return whether atomic operations for naturally aligned N-byte
10411 arguments are supported, whether inline or through libatomic. */
10412 static bool
10414 {
10416 {
10428 }
10429 }
10431 /* This will process an __atomic_exchange function call, determine whether it
10432 needs to be mapped to the _N variation, or turned into a library call.
10433 LOC is the location of the builtin call.
10434 FUNCTION is the DECL that has been invoked;
10435 PARAMS is the argument list for the call. The return value is non-null
10436 TRUE is returned if it is translated into the proper format for a call to the
10437 external library, and NEW_RETURN is set the tree for that function.
10438 FALSE is returned if processing for the _N variation is required, and
10439 NEW_RETURN is set to the the return value the result is copied into. */
10440 static bool
10443 {
10448 /* Size of 0 is an error condition. */
10450 {
10453 }
10455 /* If not a lock-free size, change to the library generic format. */
10457 {
10460 }
10462 /* Otherwise there is a lockfree match, transform the call from:
10463 void fn(T* mem, T* desired, T* return, model)
10464 into
10465 *return = (T) (fn (In* mem, (In) *desired, model)) */
10472 /* Create pointer to appropriate size. */
10476 /* Convert object pointer to required type. */
10479 /* Convert new value to required type, and dereference it. */
10484 /* Move memory model to the 3rd position, and end param list. */
10488 /* Convert return pointer and dereference it for later assignment. */
10492 }
10495 /* This will process an __atomic_compare_exchange function call, determine
10496 whether it needs to be mapped to the _N variation, or turned into a lib call.
10497 LOC is the location of the builtin call.
10498 FUNCTION is the DECL that has been invoked;
10499 PARAMS is the argument list for the call. The return value is non-null
10500 TRUE is returned if it is translated into the proper format for a call to the
10501 external library, and NEW_RETURN is set the tree for that function.
10502 FALSE is returned if processing for the _N variation is required. */
10504 static bool
10508 {
10513 /* Size of 0 is an error condition. */
10515 {
10518 }
10520 /* If not a lock-free size, change to the library generic format. */
10522 {
10523 /* The library generic format does not have the weak parameter, so
10524 remove it from the param list. Since a parameter has been removed,
10525 we can be sure that there is room for the SIZE_T parameter, meaning
10526 there will not be a recursive rebuilding of the parameter list, so
10527 there is no danger this will be done twice. */
10529 {
10533 }
10536 }
10538 /* Otherwise, there is a match, so the call needs to be transformed from:
10539 bool fn(T* mem, T* desired, T* return, weak, success, failure)
10540 into
10541 bool fn ((In *)mem, (In *)expected, (In) *desired, weak, succ, fail) */
10547 /* Create pointer to appropriate size. */
10551 /* Convert object pointer to required type. */
10555 /* Convert expected pointer to required type. */
10559 /* Convert desired value to required type, and dereference it. */
10564 /* The rest of the parameters are fine. NULL means no special return value
10565 processing.*/
10568 }
10571 /* This will process an __atomic_load function call, determine whether it
10572 needs to be mapped to the _N variation, or turned into a library call.
10573 LOC is the location of the builtin call.
10574 FUNCTION is the DECL that has been invoked;
10575 PARAMS is the argument list for the call. The return value is non-null
10576 TRUE is returned if it is translated into the proper format for a call to the
10577 external library, and NEW_RETURN is set the tree for that function.
10578 FALSE is returned if processing for the _N variation is required, and
10579 NEW_RETURN is set to the the return value the result is copied into. */
10581 static bool
10584 {
10589 /* Size of 0 is an error condition. */
10591 {
10594 }
10596 /* If not a lock-free size, change to the library generic format. */
10598 {
10601 }
10603 /* Otherwise, there is a match, so the call needs to be transformed from:
10604 void fn(T* mem, T* return, model)
10605 into
10606 *return = (T) (fn ((In *) mem, model)) */
10612 /* Create pointer to appropriate size. */
10616 /* Convert object pointer to required type. */
10620 /* Move memory model to the 2nd position, and end param list. */
10624 /* Convert return pointer and dereference it for later assignment. */
10628 }
10631 /* This will process an __atomic_store function call, determine whether it
10632 needs to be mapped to the _N variation, or turned into a library call.
10633 LOC is the location of the builtin call.
10634 FUNCTION is the DECL that has been invoked;
10635 PARAMS is the argument list for the call. The return value is non-null
10636 TRUE is returned if it is translated into the proper format for a call to the
10637 external library, and NEW_RETURN is set the tree for that function.
10638 FALSE is returned if processing for the _N variation is required, and
10639 NEW_RETURN is set to the the return value the result is copied into. */
10641 static bool
10644 {
10649 /* Size of 0 is an error condition. */
10651 {
10654 }
10656 /* If not a lock-free size, change to the library generic format. */
10658 {
10661 }
10663 /* Otherwise, there is a match, so the call needs to be transformed from:
10664 void fn(T* mem, T* value, model)
10665 into
10666 fn ((In *) mem, (In) *value, model) */
10671 /* Create pointer to appropriate size. */
10675 /* Convert object pointer to required type. */
10679 /* Convert new value to required type, and dereference it. */
10684 /* The memory model is in the right spot already. Return is void. */
10688 }
10691 /* Some builtin functions are placeholders for other expressions. This
10692 function should be called immediately after parsing the call expression
10693 before surrounding code has committed to the type of the expression.
10695 LOC is the location of the builtin call.
10697 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
10698 PARAMS is the argument list for the call. The return value is non-null
10699 when expansion is complete, and null if normal processing should
10700 continue. */
10702 tree
10705 {
10711 {
10717 else
10721 }
10723 /* Handle BUILT_IN_NORMAL here. */
10725 {
10730 {
10731 /* Handle these 4 together so that they can fall through to the next
10732 case if the call is transformed to an _N variant. */
10734 {
10736 {
10740 /* Change to the _N variant. */
10743 }
10746 {
10748 params,
10751 /* Change to the _N variant. */
10754 }
10756 {
10760 /* Change to the _N variant. */
10763 }
10765 {
10769 /* Change to the _N variant. */
10772 }
10775 }
10776 /* Fallthrough to the normal processing. */
10777 }
10794 {
10796 /* Fallthru for parameter processing. */
10797 }
10814 {
10825 orig_format))
10837 /* If new_return is set, assign function to that expr and cast the
10838 result to void since the generic interface returned void. */
10840 {
10841 /* Cast function result from I{1,2,4,8,16} to the required type. */
10844 result);
10848 }
10850 }
10854 }
10855 }
10857 /* vector_types_compatible_elements_p is used in type checks of vectors
10858 values used as operands of binary operators. Where it returns true, and
10859 the other checks of the caller succeed (being vector types in he first
10860 place, and matching number of elements), we can just treat the types
10861 as essentially the same.
10862 Contrast with vector_targets_convertible_p, which is used for vector
10863 pointer types, and vector_types_convertible_p, which will allow
10864 language-specific matches under the control of flag_lax_vector_conversions,
10865 and might still require a conversion. */
10866 /* True if vector types T1 and T2 can be inputs to the same binary
10867 operator without conversion.
10868 We don't check the overall vector size here because some of our callers
10869 want to give different error messages when the vectors are compatible
10870 except for the element count. */
10872 bool
10874 {
10887 /* Equality works here because c_common_signed_type uses
10888 TYPE_MAIN_VARIANT. */
10896 }
10898 /* Check for missing format attributes on function pointers. LTYPE is
10899 the new type or left-hand side type. RTYPE is the old type or
10900 right-hand side type. Returns TRUE if LTYPE is missing the desired
10901 attribute. */
10903 bool
10905 {
10907 tree ra;
10913 {
10914 tree la;
10919 }
10920 else
10922 }
10924 /* Subscripting with type char is likely to lose on a machine where
10925 chars are signed. So warn on any machine, but optionally. Don't
10926 warn for unsigned char since that type is safe. Don't warn for
10927 signed char because anyone who uses that must have done so
10928 deliberately. Furthermore, we reduce the false positive load by
10929 warning only for non-constant value of type char. */
10931 void
10933 {
10937 }
10939 /* Implement -Wparentheses for the unexpected C precedence rules, to
10940 cover cases like x + y << z which readers are likely to
10941 misinterpret. We have seen an expression in which CODE is a binary
10942 operator used to combine expressions ARG_LEFT and ARG_RIGHT, which
10943 before folding had CODE_LEFT and CODE_RIGHT. CODE_LEFT and
10944 CODE_RIGHT may be ERROR_MARK, which means that that side of the
10945 expression was not formed using a binary or unary operator, or it
10946 was enclosed in parentheses. */
10948 void
10952 {
10956 /* This macro tests that the expression ARG with original tree code
10957 CODE appears to be a boolean expression. or the result of folding a
10958 boolean expression. */
10959 #define APPEARS_TO_BE_BOOLEAN_EXPR_P(CODE, ARG) \
10960 (truth_value_p (TREE_CODE (ARG)) \
10961 || TREE_CODE (TREE_TYPE (ARG)) == BOOLEAN_TYPE \
10963 || ((CODE) != INTEGER_CST \
10964 && (integer_onep (ARG) || integer_zerop (ARG))))
10967 {
11016 /* Check cases like x|y==z */
11023 /* Check cases like !x | y */
11027 "suggest parentheses around operand of "
11040 /* Check cases like x^y==z */
11062 /* Check cases like x&y==z */
11069 /* Check cases like !x & y */
11073 "suggest parentheses around operand of "
11096 {
11101 "comparisons like %<X<=Y<=Z%> do not "
11107 "comparisons like %<X<=Y<=Z%> do not "
11109 }
11111 }
11112 #undef NOT_A_BOOLEAN_EXPR_P
11113 }
11115 /* If LABEL (a LABEL_DECL) has not been used, issue a warning. */
11117 void
11119 {
11121 {
11124 else
11126 }
11127 }
11129 /* Warn for division by zero according to the value of DIVISOR. LOC
11130 is the location of the division operator. */
11132 void
11134 {
11135 /* If DIVISOR is zero, and has integral or fixed-point type, issue a warning
11136 about division by zero. Do not issue a warning if DIVISOR has a
11137 floating-point type, since we consider 0.0/0.0 a valid way of
11138 generating a NaN. */
11142 }
11144 /* Subroutine of build_binary_op. Give warnings for comparisons
11145 between signed and unsigned quantities that may fail. Do the
11146 checking based on the original operand trees ORIG_OP0 and ORIG_OP1,
11147 so that casts will be considered, but default promotions won't
11148 be.
11150 LOCATION is the location of the comparison operator.
11152 The arguments of this function map directly to local variables
11153 of build_binary_op. */
11155 void
11160 {
11165 /* In C++, check for comparison of different enum types. */
11171 {
11175 }
11177 /* Do not warn if the comparison is being done in a signed type,
11178 since the signed type will only be chosen if it can represent
11179 all the values of the unsigned type. */
11182 /* Do not warn if both operands are unsigned. */
11185 else
11186 {
11192 else
11200 /* Do not warn if the signed quantity is an unsuffixed integer
11201 literal (or some static constant expression involving such
11202 literals or a conditional expression involving such literals)
11203 and it is non-negative. */
11206 /* Do not warn if the comparison is an equality operation, the
11207 unsigned quantity is an integral constant, and it would fit
11208 in the result if the result were signed. */
11213 /* In C, do not warn if the unsigned quantity is an enumeration
11214 constant and its maximum value would fit in the result if the
11215 result were signed. */
11221 else
11223 OPT_Wsign_compare,
11225 }
11227 /* Warn if two unsigned values are being compared in a size larger
11228 than their original size, and one (and only one) is the result of
11229 a `~' operator. This comparison will always fail.
11231 Also warn if one operand is a constant, and the constant does not
11232 have all bits set that are set in the ~ operand when it is
11233 extended. */
11240 {
11247 {
11248 tree primop;
11254 {
11258 }
11259 else
11260 {
11264 }
11269 {
11272 {
11276 else
11279 }
11280 }
11281 }
11289 }
11290 }
11292 /* RESULT_TYPE is the result of converting TYPE1 and TYPE2 to a common
11293 type via c_common_type. If -Wdouble-promotion is in use, and the
11294 conditions for warning have been met, issue a warning. GMSGID is
11295 the warning message. It must have two %T specifiers for the type
11296 that was converted (generally "float") and the type to which it was
11297 converted (generally "double), respectively. LOC is the location
11298 to which the awrning should refer. */
11300 void
11303 {
11304 tree source_type;
11308 /* If the conversion will not occur at run-time, there is no need to
11309 warn about it. */
11321 else
11324 }
11326 /* Setup a TYPE_DECL node as a typedef representation.
11328 X is a TYPE_DECL for a typedef statement. Create a brand new
11329 ..._TYPE node (which will be just a variant of the existing
11330 ..._TYPE node with identical properties) and then install X
11331 as the TYPE_NAME of this brand new (duplicate) ..._TYPE node.
11333 The whole point here is to end up with a situation where each
11334 and every ..._TYPE node the compiler creates will be uniquely
11335 associated with AT MOST one node representing a typedef name.
11336 This way, even though the compiler substitutes corresponding
11337 ..._TYPE nodes for TYPE_DECL (i.e. "typedef name") nodes very
11338 early on, later parts of the compiler can always do the reverse
11339 translation and get back the corresponding typedef name. For
11340 example, given:
11342 typedef struct S MY_TYPE;
11343 MY_TYPE object;
11345 Later parts of the compiler might only know that `object' was of
11346 type `struct S' if it were not for code just below. With this
11347 code however, later parts of the compiler see something like:
11349 struct S' == struct S
11350 typedef struct S' MY_TYPE;
11351 struct S' object;
11353 And they can then deduce (from the node for type struct S') that
11354 the original object declaration was:
11356 MY_TYPE object;
11358 Being able to do this is important for proper support of protoize,
11359 and also for generating precise symbolic debugging information
11360 which takes full account of the programmer's (typedef) vocabulary.
11362 Obviously, we don't want to generate a duplicate ..._TYPE node if
11363 the TYPE_DECL node that we are now processing really represents a
11364 standard built-in type. */
11366 void
11368 {
11372 {
11375 }
11378 {
11386 }
11387 }
11389 /* Record the types used by the current global variable declaration
11390 being parsed, so that we can decide later to emit their debug info.
11391 Those types are in types_used_by_cur_var_decl, and we are going to
11392 store them in the types_used_by_vars_hash hash table.
11393 DECL is the declaration of the global variable that has been parsed. */
11395 void
11397 {
11401 {
11404 }
11405 }
11407 /* If DECL is a typedef that is declared in the current function,
11408 record it for the purpose of -Wunused-local-typedefs. */
11410 void
11412 {
11417 /* if this is not a locally defined typedef then we are not
11418 interested. */
11425 }
11427 /* If T is a TYPE_DECL declared locally, mark it as used. */
11429 void
11431 {
11436 }
11438 /* Warn if there are some unused locally defined typedefs in the
11439 current function. */
11441 void
11443 {
11445 tree decl;
11446 /* The number of times we have emitted -Wunused-local-typedefs
11447 warnings. If this is different from errorcount, that means some
11448 unrelated errors have been issued. In which case, we'll avoid
11449 emitting "unused-local-typedefs" warnings. */
11461 {
11465 OPT_Wunused_local_typedefs,
11468 }
11471 }
11473 /* The C and C++ parsers both use vectors to hold function arguments.
11474 For efficiency, we keep a cache of unused vectors. This is the
11475 cache. */
11480 /* Return a new vector from the cache. If the cache is empty,
11481 allocate a new vector. These vectors are GC'ed, so it is OK if the
11482 pointer is not released.. */
11486 {
11489 else
11490 {
11491 /* Passing 0 to vec::alloc returns NULL, and our callers require
11492 that we always return a non-NULL value. The vector code uses
11493 4 when growing a NULL vector, so we do too. */
11497 }
11498 }
11500 /* Release a vector of trees back to the cache. */
11502 void
11504 {
11506 {
11509 }
11510 }
11512 /* Get a new tree vector holding a single tree. */
11516 {
11520 }
11522 /* Get a new tree vector of the TREE_VALUEs of a TREE_LIST chain. */
11526 {
11531 }
11533 /* Get a new tree vector which is a copy of an existing one. */
11537 {
11540 tree t;
11547 }
11549 /* Return true if KEYWORD starts a type specifier. */
11551 bool
11553 {
11555 {
11586 }
11587 }
11589 /* Return true if KEYWORD names a type qualifier. */
11591 bool
11593 {
11595 {
11603 }
11604 }
11606 /* Return true if KEYWORD names a storage class specifier.
11608 RID_TYPEDEF is not included in this list despite `typedef' being
11609 listed in C99 6.7.1.1. 6.7.1.3 indicates that `typedef' is listed as
11610 such for syntactic convenience only. */
11612 bool
11614 {
11616 {
11626 }
11627 }
11629 /* Return true if KEYWORD names a function-specifier [dcl.fct.spec]. */
11631 static bool
11633 {
11635 {
11643 }
11644 }
11646 /* Return true if KEYWORD names a decl-specifier [dcl.spec] or a
11647 declaration-specifier (C99 6.7). */
11649 bool
11651 {
11658 {
11665 }
11666 }
11668 /* Initialize language-specific-bits of tree_contains_struct. */
11670 void
11672 {
11676 }
11678 /* Build a user-defined numeric literal out of an integer constant type VALUE
11679 with identifier SUFFIX. */
11681 tree
11684 {
11691 }
11693 /* For vector[index], convert the vector to a
11694 pointer of the underlying type. */
11695 void
11698 {
11700 {
11702 tree type1;
11716 }
11717 }
11719 /* Determine which of the operands, if any, is a scalar that needs to be
11720 converted to a vector, for the range of operations. */
11721 enum stv_conv
11724 {
11733 {
11734 /* Most GENERIC binary expressions require homogeneous arguments.
11735 LSHIFT_EXPR and RSHIFT_EXPR are exceptions and accept a first
11736 argument that is a vector and a second one that is a scalar, so
11737 we never return stv_secondarg for them. */
11742 {
11744 {
11749 }
11750 else
11752 }
11759 /* ... fall through ... */
11780 /* What about UNLT_EXPR? */
11782 {
11783 tree tmp;
11785 /* Swap TYPE0 with TYPE1 and OP0 with OP1 */
11788 }
11792 {
11794 {
11799 }
11801 }
11803 /* Allow integer --> real conversion if safe. */
11807 {
11809 {
11814 }
11816 }
11819 }
11822 }
11824 /* Return true iff ALIGN is an integral constant that is a fundamental
11825 alignment, as defined by [basic.align] in the c++-11
11826 specifications.
11828 That is:
11830 [A fundamental alignment is represented by an alignment less than or
11831 equal to the greatest alignment supported by the implementation
11832 in all contexts, which is equal to
11833 alignof(max_align_t)]. */
11835 bool
11837 {
11840 }