| blob | dfd18cd60b31cf742b4808c480ec55602a198eb3 |
1 /* Subroutines shared by all languages that are variants of C.
2 Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012
4 Free Software Foundation, Inc.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 3, or (at your option) any later
11 version.
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16 for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
52 /* The following symbols are subsumed in the c_global_trees array, and
53 listed here individually for documentation purposes.
55 INTEGER_TYPE and REAL_TYPE nodes for the standard data types.
57 tree short_integer_type_node;
58 tree long_integer_type_node;
59 tree long_long_integer_type_node;
60 tree int128_integer_type_node;
62 tree short_unsigned_type_node;
63 tree long_unsigned_type_node;
64 tree long_long_unsigned_type_node;
65 tree int128_unsigned_type_node;
67 tree truthvalue_type_node;
68 tree truthvalue_false_node;
69 tree truthvalue_true_node;
71 tree ptrdiff_type_node;
73 tree unsigned_char_type_node;
74 tree signed_char_type_node;
75 tree wchar_type_node;
77 tree char16_type_node;
78 tree char32_type_node;
80 tree float_type_node;
81 tree double_type_node;
82 tree long_double_type_node;
84 tree complex_integer_type_node;
85 tree complex_float_type_node;
86 tree complex_double_type_node;
87 tree complex_long_double_type_node;
89 tree dfloat32_type_node;
90 tree dfloat64_type_node;
91 tree_dfloat128_type_node;
93 tree intQI_type_node;
94 tree intHI_type_node;
95 tree intSI_type_node;
96 tree intDI_type_node;
97 tree intTI_type_node;
99 tree unsigned_intQI_type_node;
100 tree unsigned_intHI_type_node;
101 tree unsigned_intSI_type_node;
102 tree unsigned_intDI_type_node;
103 tree unsigned_intTI_type_node;
105 tree widest_integer_literal_type_node;
106 tree widest_unsigned_literal_type_node;
108 Nodes for types `void *' and `const void *'.
110 tree ptr_type_node, const_ptr_type_node;
112 Nodes for types `char *' and `const char *'.
114 tree string_type_node, const_string_type_node;
116 Type `char[SOMENUMBER]'.
117 Used when an array of char is needed and the size is irrelevant.
119 tree char_array_type_node;
121 Type `int[SOMENUMBER]' or something like it.
122 Used when an array of int needed and the size is irrelevant.
124 tree int_array_type_node;
126 Type `wchar_t[SOMENUMBER]' or something like it.
127 Used when a wide string literal is created.
129 tree wchar_array_type_node;
131 Type `char16_t[SOMENUMBER]' or something like it.
132 Used when a UTF-16 string literal is created.
134 tree char16_array_type_node;
136 Type `char32_t[SOMENUMBER]' or something like it.
137 Used when a UTF-32 string literal is created.
139 tree char32_array_type_node;
141 Type `int ()' -- used for implicit declaration of functions.
143 tree default_function_type;
145 A VOID_TYPE node, packaged in a TREE_LIST.
147 tree void_list_node;
149 The lazily created VAR_DECLs for __FUNCTION__, __PRETTY_FUNCTION__,
150 and __func__. (C doesn't generate __FUNCTION__ and__PRETTY_FUNCTION__
151 VAR_DECLS, but C++ does.)
153 tree function_name_decl_node;
154 tree pretty_function_name_decl_node;
155 tree c99_function_name_decl_node;
157 Stack of nested function name VAR_DECLs.
159 tree saved_function_name_decls;
161 */
164 \f
165 /* Switches common to the C front ends. */
167 /* Nonzero means don't output line number information. */
171 /* Nonzero causes -E output not to be done, but directives such as
172 #define that have side effects are still obeyed. */
176 /* Nonzero means dump macros in some fashion. */
180 /* Nonzero means pass #include lines through to the output. */
184 /* Nonzero means process PCH files while preprocessing. */
188 /* The file name to which we should write a precompiled header, or
189 NULL if no header will be written in this compile. */
193 /* Nonzero if an ISO standard was selected. It rejects macros in the
194 user's namespace. */
197 /* Nonzero whenever UPC -fupc-threads-N is asserted.
198 The value N gives the number of UPC threads to be
199 defined at compile-time. */
202 /* Nonzero whenever UPC -fupc-pthreads-model-* is asserted. */
205 /* The implementation model for UPC threads that
206 are mapped to POSIX threads, specified at compilation
207 time by the -fupc-pthreads-model-* switch. */
208 upc_pthreads_model_kind upc_pthreads_model;
210 /* C/ObjC language option variables. */
213 /* Nonzero means allow type mismatches in conditional expressions;
214 just make their values `void'. */
218 /* Nonzero means enable C89 Amendment 1 features. */
222 /* Nonzero means use the ISO C99 (or C11) dialect of C. */
226 /* Nonzero means use the ISO C11 dialect of C. */
230 /* Nonzero means that we have builtin functions, and main is an int. */
235 /* ObjC language option variables. */
238 /* Tells the compiler that this is a special run. Do not perform any
239 compiling, instead we are to test some platform dependent features
240 and output a C header file with appropriate definitions. */
244 /* Tells the compiler what is the constant string class for ObjC. */
249 /* C++ language option variables. */
252 /* Nonzero means generate separate instantiation control files and
253 juggle them at link time. */
257 /* The C++ dialect being used. C++98 is the default. */
261 /* Maximum template instantiation depth. This limit exists to limit the
262 time it takes to notice excessively recursive template instantiations.
264 The default is lower than the 1024 recommended by the C++0x standard
265 because G++ runs out of stack before 1024 with highly recursive template
266 argument deduction substitution (g++.dg/cpp0x/enum11.C). */
270 /* The elements of `ridpointers' are identifier nodes for the reserved
271 type names and storage classes. It is indexed by a RID_... value. */
276 /* Nonzero means don't warn about problems that occur when the code is
277 executed. */
280 /* Whether we are building a boolean conversion inside
281 convert_for_assignment, or some other late binary operation. If
282 build_binary_op is called for C (from code shared by C and C++) in
283 this case, then the operands have already been folded and the
284 result will not be folded again, so C_MAYBE_CONST_EXPR should not
285 be generated. */
288 /* Whether lexing has been completed, so subsequent preprocessor
289 errors should use the compiler's input_location. */
292 /* Information about how a function name is generated. */
293 struct fname_var_t
294 {
298 };
300 /* The three ways of getting then name of the current function. */
303 {
304 /* C99 compliant __func__, must be first. */
306 /* GCC __FUNCTION__ compliant. */
308 /* GCC __PRETTY_FUNCTION__ compliant. */
311 };
313 /* Global visibility options. */
392 /* Reserved words. The third field is a mask: keywords are disabled
393 if they match the mask.
395 Masks for languages:
396 C --std=c89: D_C99 | D_CXXONLY | D_OBJC | D_CXX_OBJC
397 C --std=c99: D_CXXONLY | D_OBJC
398 ObjC is like C except that D_OBJC and D_CXX_OBJC are not set
399 UPC is like C except that D_UPC is not set
400 C++ --std=c98: D_CONLY | D_CXXOX | D_OBJC | D_UPC
401 C++ --std=c0x: D_CONLY | D_OBJC | D_UPC
402 ObjC++ is like C++ except that D_OBJC is not set
404 If -fno-asm is used, D_ASM is added to the mask. If
405 -fno-gnu-keywords is used, D_EXT is added. If -fno-asm and C in
406 C89 mode, D_EXT89 is added for both -fno-asm and -fno-gnu-keywords.
407 In C with -Wc++-compat, we warn if D_CXXWARN is set.
409 Note the complication of the D_CXX_OBJC keywords. These are
410 reserved words such as 'class'. In C++, 'class' is a reserved
411 word. In Objective-C++ it is too. In Objective-C, it is a
412 reserved word too, but only if it follows an '@' sign.
413 */
415 {
570 /* These Objective-C keywords are recognized only immediately after
571 an '@'. */
588 /* These are recognized only in protocol-qualifier context
589 (see above) */
597 /* UPC keywords */
609 /* These are recognized inside a property attribute list */
618 };
623 /* Table of machine-independent attributes common to all C-like languages. */
625 {
626 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
627 affects_type_identity } */
634 /* FIXME: logically, noreturn attributes should be listed as
635 "false, true, true" and apply to function types. But implementing this
636 would require all the places in the compiler that use TREE_THIS_VOLATILE
637 on a decl to identify non-returning functions to be located and fixed
638 to check the function type instead. */
663 /* The same comments as for noreturn attributes apply to const ones. */
687 handle_no_instrument_function_attribute,
705 /* ??? These two attributes didn't make the transition from the
706 Intel language document to the multi-vendor language document. */
711 /* For internal use (marking of builtins) only. The name contains space
712 to prevent its usage in source code. */
734 /* For internal use (marking of builtins) only. The name contains space
735 to prevent its usage in source code. */
746 handle_no_address_safety_analysis_attribute,
756 /* For internal use only. The leading '*' both prevents its usage in
757 source code and signals that it may be overridden by machine tables. */
762 /* For internal use (marking of builtins and runtime functions) only.
763 The name contains space to prevent its usage in source code. */
767 };
769 /* Give the specifications for the format attributes, used by C and all
770 descendants. */
773 {
774 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
775 affects_type_identity } */
781 };
783 /* Return identifier for address space AS. */
787 {
791 }
793 /* Push current bindings for the function name VAR_DECLS. */
795 void
797 {
802 {
806 {
808 saved);
810 }
811 }
813 /* Normally they'll have been NULL, so only push if we've got a
814 stack, or they are non-NULL. */
816 saved_function_name_decls);
817 }
819 /* Finish up the current bindings, adding them into the current function's
820 statement tree. This must be done _before_ finish_stmt_tree is called.
821 If there is no current function, we must be at file scope and no statements
822 are involved. Pop the previous bindings. */
824 void
826 {
835 {
843 }
849 {
850 /* We had saved values, restore them. */
851 tree saved;
854 {
859 }
861 }
863 }
865 /* Return the text name of the current function, suitably prettified
866 by PRETTY_P. Return string must be freed by caller. */
870 {
877 {
880 }
893 {
896 }
899 }
901 /* Return the VAR_DECL for a const char array naming the current
902 function. If the VAR_DECL has not yet been created, create it
903 now. RID indicates how it should be formatted and IDENTIFIER_NODE
904 ID is its name (unfortunately C and C++ hold the RID values of
905 keywords in different places, so we can't derive RID from ID in
906 this language independent code. LOC is the location of the
907 function. */
909 tree
911 {
921 {
922 /* If a tree is built here, it would normally have the lineno of
923 the current statement. Later this tree will be moved to the
924 beginning of the function and this line number will be wrong.
925 To avoid this problem set the lineno to 0 here; that prevents
926 it from appearing in the RTL. */
927 tree stmts;
935 saved_function_name_decls
939 }
944 }
946 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
948 tree
950 {
955 /* Compute the number of elements, for the array type. */
957 {
960 }
962 {
965 }
967 {
970 }
971 else
972 {
975 }
977 /* C89 2.2.4.1, C99 5.2.4.1 (Translation limits). The analogous
978 limit in C++98 Annex B is very large (65536) and is not normative,
979 so we do not diagnose it (warn_overlength_strings is forced off
980 in c_common_post_options). */
982 {
986 /* Translators: The %d after 'ISO C' will be 90 or 99. Do not
987 separate the %d from the 'C'. 'ISO' should not be
988 translated, but it may be moved after 'C%d' in languages
989 where modifiers follow nouns. */
991 "string length %qd is greater than the length %qd "
994 }
996 /* Create the array type for the string constant. The ISO C++
997 standard says that a string literal has type `const char[N]' or
998 `const wchar_t[N]'. We use the same logic when invoked as a C
999 front-end with -Wwrite-strings.
1000 ??? We should change the type of an expression depending on the
1001 state of a warning flag. We should just be warning -- see how
1002 this is handled in the C++ front-end for the deprecated implicit
1003 conversion from string literals to `char*' or `wchar_t*'.
1005 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
1006 array type being the unqualified version of that type.
1007 Therefore, if we are constructing an array of const char, we must
1008 construct the matching unqualified array type first. The C front
1009 end does not require this, but it does no harm, so we do it
1010 unconditionally. */
1021 }
1022 \f
1023 /* If DISABLE is true, stop issuing warnings. This is used when
1024 parsing code that we know will not be executed. This function may
1025 be called multiple times, and works as a stack. */
1027 static void
1029 {
1031 {
1034 }
1035 }
1037 /* If ENABLE is true, reenable issuing warnings. */
1039 static void
1041 {
1043 {
1046 }
1047 }
1049 /* Fully fold EXPR, an expression that was not folded (beyond integer
1050 constant expressions and null pointer constants) when being built
1051 up. If IN_INIT, this is in a static initializer and certain
1052 changes are made to the folding done. Clear *MAYBE_CONST if
1053 MAYBE_CONST is not NULL and EXPR is definitely not a constant
1054 expression because it contains an evaluated operator (in C99) or an
1055 operator outside of sizeof returning an integer constant (in C90)
1056 not permitted in constant expressions, or because it contains an
1057 evaluated arithmetic overflow. (*MAYBE_CONST should typically be
1058 set to true by callers before calling this function.) Return the
1059 folded expression. Function arguments have already been folded
1060 before calling this function, as have the contents of SAVE_EXPR,
1061 TARGET_EXPR, BIND_EXPR, VA_ARG_EXPR, OBJ_TYPE_REF and
1062 C_MAYBE_CONST_EXPR. */
1064 tree
1066 {
1067 tree ret;
1073 /* This function is not relevant to C++ because C++ folds while
1074 parsing, and may need changes to be correct for C++ when C++
1075 stops folding while parsing. */
1082 {
1085 }
1092 }
1094 /* Internal helper for c_fully_fold. EXPR and IN_INIT are as for
1095 c_fully_fold. *MAYBE_CONST_OPERANDS is cleared because of operands
1096 not permitted, while *MAYBE_CONST_ITSELF is cleared because of
1097 arithmetic overflow (for C90, *MAYBE_CONST_OPERANDS is carried from
1098 both evaluated and unevaluated subexpressions while
1099 *MAYBE_CONST_ITSELF is carried from only evaluated
1100 subexpressions). */
1102 static tree
1105 {
1117 /* This function is not relevant to C++ because C++ folds while
1118 parsing, and may need changes to be correct for C++ when C++
1119 stops folding while parsing. */
1123 /* Constants, declarations, statements, errors, SAVE_EXPRs and
1124 anything else not counted as an expression cannot usefully be
1125 folded further at this point. */
1131 /* Operands of variable-length expressions (function calls) have
1132 already been folded, as have __builtin_* function calls, and such
1133 expressions cannot occur in constant expressions. */
1135 {
1139 }
1142 {
1151 else
1154 }
1156 /* Assignment, increment, decrement, function call and comma
1157 operators, and statement expressions, cannot occur in constant
1158 expressions if evaluated / outside of sizeof. (Function calls
1159 were handled above, though VA_ARG_EXPR is treated like a function
1160 call here, and statement expressions are handled through
1161 C_MAYBE_CONST_EXPR to avoid folding inside them.) */
1163 {
1183 }
1185 /* Fold individual tree codes as appropriate. */
1187 {
1189 /* Any non-constancy will have been marked in a containing
1190 C_MAYBE_CONST_EXPR; there is no more folding to do here. */
1198 maybe_const_itself);
1203 {
1206 }
1215 maybe_const_itself);
1218 maybe_const_itself);
1224 {
1228 }
1270 /* Binary operations evaluating both arguments (increment and
1271 decrement are binary internally in GCC). */
1275 maybe_const_itself);
1283 /* The RHS of a MODIFY_EXPR was fully folded when building that
1284 expression for the sake of conversion warnings. */
1287 maybe_const_itself);
1291 ret = in_init
1294 else
1305 CASE_CONVERT:
1315 /* Unary operations. */
1318 maybe_const_itself);
1322 /* ??? Cope with user tricks that amount to offsetof. The middle-end is
1323 not prepared to deal with them if they occur in initializers.
1324 Avoid attempts to fold references to UPC shared components
1325 due to the complexities of UPC pointer-to-shared arithmetic. */
1334 ret = in_init
1337 else
1342 {
1346 }
1348 {
1351 CASE_CONVERT:
1352 /* Don't warn about explicit conversions. We will already
1353 have warned about suspect implicit conversions. */
1360 }
1365 /* Binary operations not necessarily evaluating both
1366 arguments. */
1373 ? truthvalue_false_node
1381 ret = in_init
1384 else
1389 && op0_const
1390 && op0_const_self
1396 && op0_const_self
1422 else
1427 && op0_const
1428 && op0_const_self
1432 && op0_const_self
1436 && op0_const
1437 && op0_const_self
1441 && op0_const_self
1447 /* Each case where an operand with excess precision may be
1448 encountered must remove the EXCESS_PRECISION_EXPR around
1449 inner operands and possibly put one around the whole
1450 expression or possibly convert to the semantic type (which
1451 c_fully_fold does); we cannot tell at this stage which is
1452 appropriate in any particular case. */
1456 /* Various codes may appear through folding built-in functions
1457 and their arguments. */
1459 }
1461 out:
1462 /* Some folding may introduce NON_LVALUE_EXPRs; all lvalue checks
1463 have been done by this point, so remove them again. */
1467 {
1471 }
1475 }
1477 /* If not optimizing, EXP is not a VAR_DECL, or EXP has array type,
1478 return EXP. Otherwise, return either EXP or its known constant
1479 value (if it has one), but return EXP if EXP has mode BLKmode. ???
1480 Is the BLKmode test appropriate? */
1482 tree
1484 {
1485 tree ret;
1487 /* This function is only used by C, for c_fully_fold and other
1488 optimization, and may not be correct for C++. */
1499 /* Avoid unwanted tree sharing between the initializer and current
1500 function's body where the tree can be modified e.g. by the
1501 gimplifier. */
1505 }
1507 /* Print a warning if a constant expression had overflow in folding.
1508 Invoke this function on every expression that the language
1509 requires to be a constant expression.
1510 Note the ANSI C standard says it is erroneous for a
1511 constant expression to overflow. */
1513 void
1515 {
1523 }
1525 /* The same as above but print an unconditional error. */
1526 void
1528 {
1535 }
1537 /* Print a warning if an expression had overflow in folding and its
1538 operands hadn't.
1540 Invoke this function on every expression that
1541 (1) appears in the source code, and
1542 (2) is a constant expression that overflowed, and
1543 (3) is not already checked by convert_and_check;
1544 however, do not invoke this function on operands of explicit casts
1545 or when the expression is the result of an operator and any operand
1546 already overflowed. */
1548 void
1550 {
1555 {
1584 }
1585 }
1587 /* Warn about uses of logical || / && operator in a context where it
1588 is likely that the bitwise equivalent was intended by the
1589 programmer. We have seen an expression in which CODE is a binary
1590 operator used to combine expressions OP_LEFT and OP_RIGHT, which before folding
1591 had CODE_LEFT and CODE_RIGHT, into an expression of type TYPE. */
1592 void
1596 {
1608 /* Warn if &&/|| are being used in a context where it is
1609 likely that the bitwise equivalent was intended by the
1610 programmer. That is, an expression such as op && MASK
1611 where op should not be any boolean expression, nor a
1612 constant, and mask seems to be a non-boolean integer constant. */
1620 {
1624 else
1629 }
1631 /* We do not warn for constants because they are typical of macro
1632 expansions that test for features. */
1636 /* This warning only makes sense with logical operands. */
1644 /* We first test whether either side separately is trivially true
1645 (with OR) or trivially false (with AND). If so, do not warn.
1646 This is a common idiom for testing ranges of data types in
1647 portable code. */
1654 /* If this is an OR operation, invert both sides; now, the result
1655 should be always false to get a warning. */
1669 /* If this is an OR operation, invert both sides; now, the result
1670 should be always false to get a warning. */
1678 /* If both expressions have the same operand, if we can merge the
1679 ranges, and if the range test is always false, then warn. */
1686 {
1689 "logical %<or%> "
1691 else
1693 "logical %<and%> "
1695 }
1696 }
1699 /* Warn if EXP contains any computations whose results are not used.
1700 Return true if a warning is printed; false otherwise. LOCUS is the
1701 (potential) location of the expression. */
1703 bool
1705 {
1706 restart:
1710 /* Don't warn about void constructs. This includes casting to void,
1711 void function calls, and statement expressions with a final cast
1712 to void. */
1720 {
1736 /* For a binding, warn if no side effect within it. */
1748 /* In && or ||, warn if 2nd operand has no side effect. */
1755 /* Let people do `(foo (), 0)' without a warning. */
1762 /* If this is an expression with side effects, don't warn; this
1763 case commonly appears in macro expansions. */
1769 /* Don't warn about automatic dereferencing of references, since
1770 the user cannot control it. */
1772 {
1775 }
1776 /* Fall through. */
1779 /* Referencing a volatile value is a side effect, so don't warn. */
1784 /* If this is an expression which has no operands, there is no value
1785 to be unused. There are no such language-independent codes,
1786 but front ends may define such. */
1790 warn:
1792 }
1793 }
1796 /* Print a warning about casts that might indicate violation
1797 of strict aliasing rules if -Wstrict-aliasing is used and
1798 strict aliasing mode is in effect. OTYPE is the original
1799 TREE_TYPE of EXPR, and TYPE the type we're casting to. */
1801 bool
1803 {
1804 /* Strip pointer conversion chains and get to the correct original type. */
1812 /* If the type we are casting to is a ref-all pointer
1813 dereferencing it is always valid. */
1820 {
1821 /* Casting the address of an object to non void pointer. Warn
1822 if the cast breaks type based aliasing. */
1824 {
1828 }
1829 else
1830 {
1831 /* warn_strict_aliasing >= 3. This includes the default (3).
1832 Only warn if the cast is dereferenced immediately. */
1833 alias_set_type set1 =
1839 {
1843 }
1846 {
1850 }
1851 }
1852 }
1853 else
1855 {
1856 /* At this level, warn for any conversions, even if an address is
1857 not taken in the same statement. This will likely produce many
1858 false positives, but could be useful to pinpoint problems that
1859 are not revealed at higher levels. */
1864 {
1868 }
1869 }
1872 }
1874 /* Warn about memset (&a, 0, sizeof (&a)); and similar mistakes with
1875 sizeof as last operand of certain builtins. */
1877 void
1881 {
1885 location_t loc;
1893 {
1897 /* FALLTHRU */
1905 /* FALLTHRU */
1964 }
1992 {
1996 {
1999 "argument to %<sizeof%> in %qD call is the same "
2000 "expression as the destination; did you mean to "
2006 "argument to %<sizeof%> in %qD call is the same "
2007 "expression as the destination; did you mean to "
2009 else
2011 "argument to %<sizeof%> in %qD call is the same "
2012 "expression as the destination; did you mean to "
2015 }
2018 && !strop
2021 {
2023 "argument to %<sizeof%> in %qD call is the same "
2024 "pointer type %qT as the destination; expected %qT "
2028 }
2029 }
2032 {
2036 {
2039 "argument to %<sizeof%> in %qD call is the same "
2040 "expression as the source; did you mean to "
2046 "argument to %<sizeof%> in %qD call is the same "
2047 "expression as the source; did you mean to "
2049 else
2051 "argument to %<sizeof%> in %qD call is the same "
2052 "expression as the source; did you mean to "
2055 }
2058 && !strop
2061 {
2063 "argument to %<sizeof%> in %qD call is the same "
2064 "pointer type %qT as the source; expected %qT "
2068 }
2069 }
2072 {
2076 {
2079 "argument to %<sizeof%> in %qD call is the same "
2080 "expression as the first source; did you mean to "
2086 "argument to %<sizeof%> in %qD call is the same "
2087 "expression as the first source; did you mean to "
2089 else
2091 "argument to %<sizeof%> in %qD call is the same "
2092 "expression as the first source; did you mean to "
2095 }
2098 && !strop
2101 {
2103 "argument to %<sizeof%> in %qD call is the same "
2104 "pointer type %qT as the first source; expected %qT "
2108 }
2109 }
2112 {
2116 {
2119 "argument to %<sizeof%> in %qD call is the same "
2120 "expression as the second source; did you mean to "
2126 "argument to %<sizeof%> in %qD call is the same "
2127 "expression as the second source; did you mean to "
2129 else
2131 "argument to %<sizeof%> in %qD call is the same "
2132 "expression as the second source; did you mean to "
2135 }
2138 && !strop
2141 {
2143 "argument to %<sizeof%> in %qD call is the same "
2144 "pointer type %qT as the second source; expected %qT "
2148 }
2149 }
2151 }
2153 /* Warn for unlikely, improbable, or stupid DECL declarations
2154 of `main'. */
2156 void
2158 {
2159 function_args_iterator iter;
2160 tree type;
2164 {
2165 /* XXX void_type_node belies the abstraction. */
2171 {
2193 "third argument of %q+D should probably be "
2196 }
2197 }
2199 /* It is intentional that this message does not mention the third
2200 argument because it's only mentioned in an appendix of the
2201 standard. */
2205 }
2207 /* True if pointers to distinct types T1 and T2 can be converted to
2208 each other without an explicit cast. Only returns true for opaque
2209 vector types. */
2210 bool
2212 {
2219 }
2221 /* True if vector types T1 and T2 can be converted to each other
2222 without an explicit cast. If EMIT_LAX_NOTE is true, and T1 and T2
2223 can only be converted with -flax-vector-conversions yet that is not
2224 in effect, emit a note telling the user about that option if such
2225 a note has not previously been emitted. */
2226 bool
2228 {
2236 convertible_lax =
2251 {
2254 "conversions between vectors with differing "
2256 }
2259 }
2261 /* Build a VEC_PERM_EXPR if V0, V1 and MASK are not error_mark_nodes
2262 and have vector types, V0 has the same type as V1, and the number of
2263 elements of V0, V1, MASK is the same.
2265 In case V1 is a NULL_TREE it is assumed that __builtin_shuffle was
2266 called with two arguments. In this case implementation passes the
2267 first argument twice in order to share the same tree code. This fact
2268 could enable the mask-values being twice the vector length. This is
2269 an implementation accident and this semantics is not guaranteed to
2270 the user. */
2271 tree
2273 {
2274 tree ret;
2280 {
2283 }
2291 {
2295 }
2299 {
2302 }
2305 {
2309 }
2315 {
2317 "argument vector(s) and the mask vector should "
2320 }
2324 {
2328 }
2331 {
2332 /* Avoid C_MAYBE_CONST_EXPRs inside VEC_PERM_EXPR. */
2338 else
2339 {
2342 }
2346 }
2354 }
2356 /* Like tree.c:get_narrower, but retain conversion from C++0x scoped enum
2357 to integral type. */
2359 static tree
2361 {
2366 {
2367 /* C++0x scoped enumerations don't implicitly convert to integral
2368 type; if we stripped an explicit conversion to a larger type we
2369 need to replace it so common_type will still work. */
2373 }
2375 }
2377 /* This is a helper function of build_binary_op.
2379 For certain operations if both args were extended from the same
2380 smaller type, do the arithmetic in that type and then extend.
2382 BITWISE indicates a bitwise operation.
2383 For them, this optimization is safe only if
2384 both args are zero-extended or both are sign-extended.
2385 Otherwise, we might change the result.
2386 Eg, (short)-1 | (unsigned short)-1 is (int)-1
2387 but calculated in (unsigned short) it would be (unsigned short)-1.
2388 */
2389 tree
2391 {
2395 tree type;
2397 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
2398 excessive narrowing when we call get_narrower below. For
2399 example, suppose that OP0 is of unsigned int extended
2400 from signed char and that RESULT_TYPE is long long int.
2401 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
2402 like
2404 (long long int) (unsigned int) signed_char
2406 which get_narrower would narrow down to
2408 (unsigned int) signed char
2410 If we do not cast OP0 first, get_narrower would return
2411 signed_char, which is inconsistent with the case of the
2412 explicit cast. */
2419 /* UNS is 1 if the operation to be done is an unsigned one. */
2422 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
2423 but it *requires* conversion to FINAL_TYPE. */
2434 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
2436 /* For bitwise operations, signedness of nominal type
2437 does not matter. Consider only how operands were extended. */
2441 /* Note that in all three cases below we refrain from optimizing
2442 an unsigned operation on sign-extended args.
2443 That would not be valid. */
2445 /* Both args variable: if both extended in same way
2446 from same width, do it in that width.
2447 Do it unsigned if args were zero-extended. */
2454 return c_common_signed_or_unsigned_type
2461 && (type
2472 && (type
2480 }
2482 /* Checks if expression EXPR of real/integer type cannot be converted
2483 to the real/integer type TYPE. Function returns true when:
2484 * EXPR is a constant which cannot be exactly converted to TYPE
2485 * EXPR is not a constant and size of EXPR's type > than size of TYPE,
2486 for EXPR type and TYPE being both integers or both real.
2487 * EXPR is not a constant of real type and TYPE is an integer.
2488 * EXPR is not a constant of integer type which cannot be
2489 exactly converted to real type.
2490 Function allows conversions between types of different signedness and
2491 does not return true in that case. Function can produce signedness
2492 warnings if PRODUCE_WARNS is true. */
2493 bool
2495 {
2501 {
2502 /* Warn for real constant that is not an exact integer converted
2503 to integer type. */
2506 {
2509 }
2510 /* Warn for an integer constant that does not fit into integer type. */
2514 {
2517 {
2521 }
2523 {
2527 }
2528 else
2530 }
2532 {
2533 /* Warn for an integer constant that does not fit into real type. */
2535 {
2539 }
2540 /* Warn for a real constant that does not fit into a smaller
2541 real type. */
2544 {
2548 }
2549 }
2550 }
2551 else
2552 {
2553 /* Warn for real types converted to integer types. */
2560 {
2561 /* Don't warn about unsigned char y = 0xff, x = (int) y; */
2565 /* Don't warn for short y; short x = ((int)y & 0xff); */
2569 {
2570 /* If both args were extended from a shortest type,
2571 use that type if that is safe. */
2578 {
2584 /* If one of the operands is a non-negative constant
2585 that fits in the target type, then the type of the
2586 other operand does not matter. */
2595 /* If constant is unsigned and fits in the target
2596 type, then the result will also fit. */
2598 && unsigned0
2601 && unsigned1
2604 }
2605 }
2606 /* Warn for integer types converted to smaller integer types. */
2610 /* When they are the same width but different signedness,
2611 then the value may change. */
2614 /* Even when converted to a bigger type, if the type is
2615 unsigned but expr is signed, then negative values
2616 will be changed. */
2622 }
2624 /* Warn for integer types converted to real types if and only if
2625 all the range of values of the integer type cannot be
2626 represented by the real type. */
2629 {
2633 /* Don't warn about char y = 0xff; float x = (int) y; */
2645 }
2647 /* Warn for real types converted to smaller real types. */
2652 }
2655 }
2657 /* Warns if the conversion of EXPR to TYPE may alter a value.
2658 This is a helper function for warnings_for_convert_and_check. */
2660 static void
2662 {
2670 {
2683 /* Conversion from boolean to a signed:1 bit-field (which only
2684 can hold the values 0 and -1) doesn't lose information - but
2685 it does change the value. */
2700 {
2701 /* In case of COND_EXPR, we do not care about the type of
2702 COND_EXPR, only about the conversion of each operand. */
2709 }
2716 }
2717 }
2719 /* Produce warnings after a conversion. RESULT is the result of
2720 converting EXPR to TYPE. This is a helper function for
2721 convert_and_check and cp_convert_and_check. */
2723 void
2725 {
2732 {
2733 /* Do not diagnose overflow in a constant expression merely
2734 because a conversion overflowed. */
2739 {
2740 /* This detects cases like converting -129 or 256 to
2741 unsigned char. */
2745 else
2747 }
2751 /* No warning for converting 0x80000000 to int. */
2759 else
2761 }
2766 else
2768 }
2771 /* Convert EXPR to TYPE, warning about conversion problems with constants.
2772 Invoke this function on every expression that is converted implicitly,
2773 i.e. because of language rules and not because of an explicit cast. */
2775 tree
2777 {
2778 tree result;
2779 tree expr_for_warning;
2781 /* Convert from a value with possible excess precision rather than
2782 via the semantic type, but do not warn about values not fitting
2783 exactly in the semantic type. */
2785 {
2791 }
2792 else
2806 }
2807 \f
2808 /* A node in a list that describes references to variables (EXPR), which are
2809 either read accesses if WRITER is zero, or write accesses, in which case
2810 WRITER is the parent of EXPR. */
2811 struct tlist
2812 {
2815 };
2817 /* Used to implement a cache the results of a call to verify_tree. We only
2818 use this for SAVE_EXPRs. */
2819 struct tlist_cache
2820 {
2824 tree expr;
2825 };
2827 /* Obstack to use when allocating tlist structures, and corresponding
2828 firstobj. */
2832 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
2833 warnings. */
2835 /* SAVE_EXPRs need special treatment. We process them only once and then
2836 cache the results. */
2848 /* Create a new struct tlist and fill in its fields. */
2851 {
2858 }
2860 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
2861 is nonnull, we ignore any node we find which has a writer equal to it. */
2863 static void
2865 {
2867 {
2874 }
2875 }
2877 /* Merge the nodes of ADD into TO. This merging process is done so that for
2878 each variable that already exists in TO, no new node is added; however if
2879 there is a write access recorded in ADD, and an occurrence on TO is only
2880 a read access, then the occurrence in TO will be modified to record the
2881 write. */
2883 static void
2885 {
2892 {
2899 {
2903 }
2905 {
2909 }
2911 }
2912 }
2914 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
2915 references in list LIST conflict with it, excluding reads if ONLY writers
2916 is nonzero. */
2918 static void
2921 {
2924 /* Avoid duplicate warnings. */
2930 {
2934 {
2939 }
2941 }
2942 }
2944 /* Given a list LIST of references to variables, find whether any of these
2945 can cause conflicts due to missing sequence points. */
2947 static void
2949 {
2953 {
2956 }
2957 }
2959 /* Return nonzero if X is a tree that can be verified by the sequence point
2960 warnings. */
2961 static int
2963 {
2970 /* VOID_TYPE_P (TREE_TYPE (x)) is workaround for cp/tree.c
2971 (lvalue_p) crash on TRY/CATCH. */
2978 /* No point to track non-const calls, they will never satisfy
2979 operand_equal_p. */
2987 }
2989 /* Return nonzero if X and Y appear to be the same candidate (or NULL) */
2990 static bool
2992 {
2994 }
2996 /* Walk the tree X, and record accesses to variables. If X is written by the
2997 parent tree, WRITER is the parent.
2998 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
2999 expression or its only operand forces a sequence point, then everything up
3000 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
3001 in PNO_SP.
3002 Once we return, we will have emitted warnings if any subexpression before
3003 such a sequence point could be undefined. On a higher level, however, the
3004 sequence point may not be relevant, and we'll merge the two lists.
3006 Example: (b++, a) + b;
3007 The call that processes the COMPOUND_EXPR will store the increment of B
3008 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
3009 processes the PLUS_EXPR will need to merge the two lists so that
3010 eventually, all accesses end up on the same list (and we'll warn about the
3011 unordered subexpressions b++ and b.
3013 A note on merging. If we modify the former example so that our expression
3014 becomes
3015 (b++, b) + a
3016 care must be taken not simply to add all three expressions into the final
3017 PNO_SP list. The function merge_tlist takes care of that by merging the
3018 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
3019 way, so that no more than one access to B is recorded. */
3021 static void
3023 tree writer)
3024 {
3029 /* X may be NULL if it is the operand of an empty statement expression
3030 ({ }). */
3034 restart:
3042 {
3074 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
3075 two first, to avoid warning for (a ? b++ : b++). */
3091 /* Expressions inside the LHS are not ordered wrt. the sequence points
3092 in the RHS. Example:
3093 *a = (a++, 2)
3094 Despite the fact that the modification of "a" is in the before_sp
3095 list (tmp_before), it conflicts with the use of "a" in the LHS.
3096 We can handle this by adding the contents of tmp_list3
3097 to those of tmp_before, and redoing the collision warnings for that
3098 list. */
3101 /* Exclude the LHS itself here; we first have to merge it into the
3102 tmp_nosp list. This is done to avoid warning for "a = a"; if we
3103 didn't exclude the LHS, we'd get it twice, once as a read and once
3104 as a write. */
3115 /* We need to warn about conflicts among arguments and conflicts between
3116 args and the function address. Side effects of the function address,
3117 however, are not ordered by the sequence point of the call. */
3118 {
3119 call_expr_arg_iterator iter;
3120 tree arg;
3124 {
3129 }
3134 }
3137 /* Scan all the list, e.g. indices of multi dimensional array. */
3139 {
3145 }
3149 {
3156 {
3168 {
3172 }
3175 }
3179 }
3189 /* For other expressions, simply recurse on their operands.
3190 Manual tail recursion for unary expressions.
3191 Other non-expressions need not be processed. */
3193 {
3197 }
3199 {
3203 {
3208 }
3209 }
3211 }
3212 }
3214 /* Try to warn for undefined behavior in EXPR due to missing sequence
3215 points. */
3217 DEBUG_FUNCTION void
3219 {
3225 {
3228 }
3233 }
3234 \f
3235 /* Validate the expression after `case' and apply default promotions. */
3237 static tree
3239 {
3244 /* Promote char or short to int. */
3247 {
3250 }
3255 }
3256 \f
3257 /* See if the case values LOW and HIGH are in the range of the original
3258 type (i.e. before the default conversion to int) of the switch testing
3259 expression.
3260 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
3261 the type before promoting it. CASE_LOW_P is a pointer to the lower
3262 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
3263 if the case is not a case range.
3264 The caller has to make sure that we are not called with NULL for
3265 CASE_LOW_P (i.e. the default case).
3266 Returns true if the case label is in range of ORIG_TYPE (saturated or
3267 untouched) or false if the label is out of range. */
3269 static bool
3272 {
3277 /* If there was a problem with the original type, do nothing. */
3284 /* Case label is less than minimum for type. */
3287 {
3290 }
3292 /* Case value is greater than maximum for type. */
3295 {
3298 }
3300 /* Saturate lower case label value to minimum. */
3303 {
3307 }
3309 /* Saturate upper case label value to maximum. */
3312 {
3316 }
3324 }
3325 \f
3326 /* Return an integer type with BITS bits of precision,
3327 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
3329 tree
3331 {
3370 }
3372 /* Return a fixed-point type that has at least IBIT ibits and FBIT fbits
3373 that is unsigned if UNSIGNEDP is nonzero, otherwise signed;
3374 and saturating if SATP is nonzero, otherwise not saturating. */
3376 tree
3379 {
3383 else
3391 {
3393 "fixed-point types that have too many integral and "
3396 }
3399 }
3401 /* Used for communication between c_common_type_for_mode and
3402 c_register_builtin_type. */
3405 /* Return a data type that has machine mode MODE.
3406 If the mode is an integer,
3407 then UNSIGNEDP selects between signed and unsigned types.
3408 If the mode is a fixed-point mode,
3409 then UNSIGNEDP selects between saturating and nonsaturating types. */
3411 tree
3413 {
3414 tree t;
3451 #if HOST_BITS_PER_WIDE_INT >= 64
3454 #endif
3479 {
3481 tree inner_type;
3497 }
3499 {
3504 }
3514 {
3600 }
3608 }
3610 tree
3612 {
3614 }
3616 /* Return a signed type the same as TYPE in other respects. */
3618 tree
3620 {
3622 }
3624 /* Return a type the same as TYPE except unsigned or
3625 signed according to UNSIGNEDP. */
3627 tree
3629 {
3630 tree type1;
3632 /* This block of code emulates the behavior of the old
3633 c_common_unsigned_type. In particular, it returns
3634 long_unsigned_type_node if passed a long, even when a int would
3635 have the same size. This is necessary for warnings to work
3636 correctly in archs where sizeof(int) == sizeof(long) */
3639 if (type1 == signed_char_type_node || type1 == char_type_node || type1 == unsigned_char_type_node)
3655 #if HOST_BITS_PER_WIDE_INT >= 64
3658 #endif
3668 #define C_COMMON_FIXED_TYPES(NAME) \
3669 if (type1 == short_ ## NAME ## _type_node \
3670 || type1 == unsigned_short_ ## NAME ## _type_node) \
3671 return unsignedp ? unsigned_short_ ## NAME ## _type_node \
3672 : short_ ## NAME ## _type_node; \
3673 if (type1 == NAME ## _type_node \
3674 || type1 == unsigned_ ## NAME ## _type_node) \
3675 return unsignedp ? unsigned_ ## NAME ## _type_node \
3676 : NAME ## _type_node; \
3677 if (type1 == long_ ## NAME ## _type_node \
3678 || type1 == unsigned_long_ ## NAME ## _type_node) \
3679 return unsignedp ? unsigned_long_ ## NAME ## _type_node \
3680 : long_ ## NAME ## _type_node; \
3681 if (type1 == long_long_ ## NAME ## _type_node \
3682 || type1 == unsigned_long_long_ ## NAME ## _type_node) \
3683 return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \
3684 : long_long_ ## NAME ## _type_node;
3686 #define C_COMMON_FIXED_MODE_TYPES(NAME) \
3687 if (type1 == NAME ## _type_node \
3688 || type1 == u ## NAME ## _type_node) \
3689 return unsignedp ? u ## NAME ## _type_node \
3690 : NAME ## _type_node;
3692 #define C_COMMON_FIXED_TYPES_SAT(NAME) \
3693 if (type1 == sat_ ## short_ ## NAME ## _type_node \
3694 || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \
3695 return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \
3696 : sat_ ## short_ ## NAME ## _type_node; \
3697 if (type1 == sat_ ## NAME ## _type_node \
3698 || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \
3699 return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \
3700 : sat_ ## NAME ## _type_node; \
3701 if (type1 == sat_ ## long_ ## NAME ## _type_node \
3702 || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \
3703 return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \
3704 : sat_ ## long_ ## NAME ## _type_node; \
3705 if (type1 == sat_ ## long_long_ ## NAME ## _type_node \
3706 || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \
3707 return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \
3708 : sat_ ## long_long_ ## NAME ## _type_node;
3710 #define C_COMMON_FIXED_MODE_TYPES_SAT(NAME) \
3711 if (type1 == sat_ ## NAME ## _type_node \
3712 || type1 == sat_ ## u ## NAME ## _type_node) \
3713 return unsignedp ? sat_ ## u ## NAME ## _type_node \
3714 : sat_ ## NAME ## _type_node;
3740 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
3741 the precision; they have precision set to match their range, but
3742 may use a wider mode to match an ABI. If we change modes, we may
3743 wind up with bad conversions. For INTEGER_TYPEs in C, must check
3744 the precision as well, so as to yield correct results for
3745 bit-field types. C++ does not have these separate bit-field
3746 types, and producing a signed or unsigned variant of an
3747 ENUMERAL_TYPE may cause other problems as well. */
3753 #define TYPE_OK(node) \
3754 (TYPE_MODE (type) == TYPE_MODE (node) \
3755 && TYPE_PRECISION (type) == TYPE_PRECISION (node))
3774 #if HOST_BITS_PER_WIDE_INT >= 64
3777 #endif
3786 #undef TYPE_OK
3789 }
3791 /* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */
3793 tree
3795 {
3796 /* Extended integer types of the same width as a standard type have
3797 lesser rank, so those of the same width as int promote to int or
3798 unsigned int and are valid for printf formats expecting int or
3799 unsigned int. To avoid such special cases, avoid creating
3800 extended integer types for bit-fields if a standard integer type
3801 is available. */
3818 }
3820 /* The C version of the register_builtin_type langhook. */
3822 void
3824 {
3825 tree decl;
3835 }
3836 \f
3837 /* Print an error message for invalid operands to arith operation
3838 CODE with TYPE0 for operand 0, and TYPE1 for operand 1.
3839 LOCATION is the location of the message. */
3841 void
3844 {
3848 {
3893 }
3897 }
3898 \f
3899 /* Given an expression as a tree, return its original type. Do this
3900 by stripping any conversion that preserves the sign and precision. */
3901 static tree
3903 {
3906 }
3908 /* Subroutine of build_binary_op, used for comparison operations.
3909 See if the operands have both been converted from subword integer types
3910 and, if so, perhaps change them both back to their original type.
3911 This function is also responsible for converting the two operands
3912 to the proper common type for comparison.
3914 The arguments of this function are all pointers to local variables
3915 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
3916 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
3918 If this function returns nonzero, it means that the comparison has
3919 a constant value. What this function returns is an expression for
3920 that value. */
3922 tree
3925 {
3926 tree type;
3935 /* Throw away any conversions to wider types
3936 already present in the operands. */
3941 /* If primopN is first sign-extended from primopN's precision to opN's
3942 precision, then zero-extended from opN's precision to
3943 *restype_ptr precision, shortenings might be invalid. */
3946 && !unsignedp0
3951 && !unsignedp1
3955 /* Handle the case that OP0 does not *contain* a conversion
3956 but it *requires* conversion to FINAL_TYPE. */
3963 /* If one of the operands must be floated, we cannot optimize. */
3967 /* If first arg is constant, swap the args (changing operation
3968 so value is preserved), for canonicalization. Don't do this if
3969 the second arg is 0. */
3974 {
3991 {
4006 }
4008 }
4010 /* If comparing an integer against a constant more bits wide,
4011 maybe we can deduce a value of 1 or 0 independent of the data.
4012 Or else truncate the constant now
4013 rather than extend the variable at run time.
4015 This is only interesting if the constant is the wider arg.
4016 Also, it is not safe if the constant is unsigned and the
4017 variable arg is signed, since in this case the variable
4018 would be sign-extended and then regarded as unsigned.
4019 Our technique fails in this case because the lowest/highest
4020 possible unsigned results don't follow naturally from the
4021 lowest/highest possible values of the variable operand.
4022 For just EQ_EXPR and NE_EXPR there is another technique that
4023 could be used: see if the constant can be faithfully represented
4024 in the other operand's type, by truncating it and reextending it
4025 and see if that preserves the constant's value. */
4031 {
4034 /* 1 if comparison is nominally unsigned. */
4036 tree val;
4048 {
4049 /* Convert primop1 to target type, but do not introduce
4050 additional overflow. We know primop1 is an int_cst. */
4054 }
4056 {
4059 }
4062 {
4067 }
4068 else
4069 {
4074 }
4077 /* This used to be a switch, but Genix compiler can't handle that. */
4079 {
4082 }
4084 {
4087 }
4089 {
4094 }
4096 {
4101 }
4103 {
4108 }
4110 {
4115 }
4117 /* If primop0 was sign-extended and unsigned comparison specd,
4118 we did a signed comparison above using the signed type bounds.
4119 But the comparison we output must be unsigned.
4121 Also, for inequalities, VAL is no good; but if the signed
4122 comparison had *any* fixed result, it follows that the
4123 unsigned comparison just tests the sign in reverse
4124 (positive values are LE, negative ones GE).
4125 So we can generate an unsigned comparison
4126 against an extreme value of the signed type. */
4129 {
4132 {
4147 }
4149 }
4153 {
4160 }
4163 {
4164 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4168 }
4170 /* Value is not predetermined, but do the comparison
4171 in the type of the operand that is not constant.
4172 TYPE is already properly set. */
4173 }
4175 /* If either arg is decimal float and the other is float, find the
4176 proper common type to use for comparison. */
4187 /* If args' natural types are both narrower than nominal type
4188 and both extend in the same manner, compare them
4189 in the type of the wider arg.
4190 Otherwise must actually extend both to the nominal
4191 common type lest different ways of extending
4192 alter the result.
4193 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
4198 {
4202 type);
4203 /* Make sure shorter operand is extended the right way
4204 to match the longer operand. */
4205 primop0
4208 primop0);
4209 primop1
4212 primop1);
4213 }
4214 else
4215 {
4216 /* Here we must do the comparison on the nominal type
4217 using the args exactly as we received them. */
4224 {
4226 /* All unsigned values are >= 0, so we warn. However,
4227 if OP0 is a constant that is >= 0, the signedness of
4228 the comparison isn't an issue, so suppress the
4229 warning. */
4231 warn_type_limits && !in_system_header
4235 primop0)))
4236 /* Do not warn for enumeration types. */
4240 {
4257 }
4260 {
4261 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4266 }
4267 }
4268 }
4276 }
4277 \f
4278 /* Return a tree for the sum or difference (RESULTCODE says which)
4279 of pointer PTROP and integer INTOP. */
4281 tree
4284 {
4287 /* The result is a pointer of the same type that is being added. */
4290 /* If the pointer lives in UPC shared memory, then
4291 drop the 'shared' qualifier. */
4296 {
4300 }
4302 {
4306 }
4308 {
4312 }
4313 else
4316 /* We are manipulating pointer values, so we don't need to warn
4317 about relying on undefined signed overflow. We disable the
4318 warning here because we use integer types so fold won't know that
4319 they are really pointers. */
4322 /* If what we are about to multiply by the size of the elements
4323 contains a constant term, apply distributive law
4324 and multiply that constant term separately.
4325 This helps produce common subexpressions. */
4330 /* If the constant comes from pointer subtraction,
4331 skip this optimization--it would cause an error. */
4333 /* If the constant is unsigned, and smaller than the pointer size,
4334 then we must skip this optimization. This is because it could cause
4335 an overflow error if the constant is negative but INTOP is not. */
4339 {
4344 /* Convert both subexpression types to the type of intop,
4345 because weird cases involving pointer arithmetic
4346 can result in a sum or difference with different type args. */
4351 }
4353 /* Convert the integer argument to a type the same size as sizetype
4354 so the multiply won't overflow spuriously. */
4360 /* Replace the integer argument with a suitable product by the object size.
4361 Do this multiplication as signed, then convert to the appropriate type
4362 for the pointer operation and disregard an overflow that occurred only
4363 because of the sign-extension change in the latter conversion. */
4364 {
4372 }
4374 /* Create the sum or difference. */
4383 }
4384 \f
4385 /* Wrap a C_MAYBE_CONST_EXPR around an expression that is fully folded
4386 and if NON_CONST is known not to be permitted in an evaluated part
4387 of a constant expression. */
4389 tree
4391 {
4395 /* This should never be called for C++. */
4399 /* The result of folding may have a NOP_EXPR to set TREE_NO_WARNING. */
4408 }
4410 /* Wrap a SAVE_EXPR around EXPR, if appropriate. Like save_expr, but
4411 for C folds the inside expression and wraps a C_MAYBE_CONST_EXPR
4412 around the SAVE_EXPR if needed so that c_fully_fold does not need
4413 to look inside SAVE_EXPRs. */
4415 tree
4417 {
4426 }
4428 /* Return whether EXPR is a declaration whose address can never be
4429 NULL. */
4431 bool
4433 {
4438 }
4440 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
4441 or for an `if' or `while' statement or ?..: exp. It should already
4442 have been validated to be of suitable type; otherwise, a bad
4443 diagnostic may result.
4445 The EXPR is located at LOCATION.
4447 This preparation consists of taking the ordinary
4448 representation of an expression expr and producing a valid tree
4449 boolean expression describing whether expr is nonzero. We could
4450 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
4451 but we optimize comparisons, &&, ||, and !.
4453 The resulting type should always be `truthvalue_type_node'. */
4455 tree
4457 {
4459 {
4501 ? truthvalue_true_node
4507 ? truthvalue_true_node
4512 /* Fall through. */
4515 {
4518 {
4519 /* Common Ada/Pascal programmer's mistake. */
4521 OPT_Waddress,
4523 inner);
4525 }
4527 }
4544 /* These don't change whether an object is nonzero or zero. */
4549 /* These don't change whether an object is zero or nonzero, but
4550 we can't ignore them if their second arg has side-effects. */
4552 {
4555 c_common_truthvalue_conversion
4558 }
4559 else
4564 /* Distribute the conversion into the arms of a COND_EXPR. */
4566 {
4569 /* In C++ one of the arms might have void type if it is throw. */
4577 }
4578 else
4579 {
4580 /* Folding will happen later for C. */
4588 }
4590 CASE_CONVERT:
4591 {
4595 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
4596 since that affects how `default_conversion' will behave. */
4600 /* Don't strip a conversion from C++0x scoped enum, since they
4601 don't implicitly convert to other types. */
4605 /* If this isn't narrowing the argument, we can ignore it. */
4609 }
4615 {
4619 }
4624 }
4627 {
4629 expr = (build_binary_op
4633 c_common_truthvalue_conversion
4636 c_common_truthvalue_conversion
4641 }
4644 {
4649 }
4650 else
4653 ret:
4656 }
4657 \f
4666 /* Apply the TYPE_QUALS to the new DECL. */
4668 void
4670 {
4678 /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr
4679 constructor can produce constant init, so rely on cp_finish_decl to
4680 clear TREE_READONLY if the variable has non-constant init. */
4683 {
4686 }
4688 {
4690 /* Allow 'restrict' on arrays of pointers.
4691 FIXME currently we just ignore it. */
4697 }
4699 {
4705 /* The declaration's type should have been previously defined
4706 as a UPC shared type. */
4708 }
4709 }
4711 /* Hash function for the problem of multiple type definitions in
4712 different files. This must hash all types that will compare
4713 equal via comptypes to the same value. In practice it hashes
4714 on some of the simple stuff and leaves the details to comptypes. */
4716 static hashval_t
4718 {
4722 tree t2;
4724 {
4725 /* For pointers, hash on pointee type plus some swizzling. */
4728 /* Hash on number of elements and total size. */
4747 }
4748 /* FIXME: We want to use a DECL_CHAIN iteration method here, but
4749 TYPE_VALUES of ENUMERAL_TYPEs is stored as a TREE_LIST. */
4751 /* We might have a VLA here. */
4754 else
4757 }
4761 /* Return the typed-based alias set for T, which may be an expression
4762 or a type. Return -1 if we don't do anything special. */
4764 alias_set_type
4766 {
4767 tree u;
4770 /* For VLAs, use the alias set of the element type rather than the
4771 default of alias set 0 for types compared structurally. */
4773 {
4777 }
4779 /* Permit type-punning when accessing a union, provided the access
4780 is directly through the union. For example, this code does not
4781 permit taking the address of a union member and then storing
4782 through it. Even the type-punning allowed here is a GCC
4783 extension, albeit a common and useful one; the C standard says
4784 that such accesses have implementation-defined behavior. */
4792 /* That's all the expressions we handle specially. */
4796 /* The C standard guarantees that any object may be accessed via an
4797 lvalue that has character type. */
4803 /* The C standard specifically allows aliasing between signed and
4804 unsigned variants of the same type. We treat the signed
4805 variant as canonical. */
4807 {
4810 /* t1 == t can happen for boolean nodes which are always unsigned. */
4813 }
4815 /* Handle the case of multiple type nodes referring to "the same" type,
4816 which occurs with IMA. These share an alias set. FIXME: Currently only
4817 C90 is handled. (In C99 type compatibility is not transitive, which
4818 complicates things mightily. The alias set splay trees can theoretically
4819 represent this, but insertion is tricky when you consider all the
4820 different orders things might arrive in.) */
4825 /* Save time if there's only one input file. */
4829 /* Pointers need special handling if they point to any type that
4830 needs special handling (below). */
4832 {
4833 tree t2;
4834 /* Find bottom type under any nested POINTERs. */
4838 ;
4846 }
4847 /* These are the only cases that need special handling. */
4854 /* Undefined? */
4858 /* Look up t in hash table. Only one of the compatible types within each
4859 alias set is recorded in the table. */
4863 NULL);
4866 {
4869 }
4870 else
4871 /* Our caller will assign and record (in t) a new alias set; all we need
4872 to do is remember t in the hash table. */
4876 }
4877 \f
4878 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where
4879 the second parameter indicates which OPERATOR is being applied.
4880 The COMPLAIN flag controls whether we should diagnose possibly
4881 ill-formed constructs or not. LOC is the location of the SIZEOF or
4882 TYPEOF operator. */
4884 tree
4887 {
4895 {
4897 {
4904 }
4905 else
4906 {
4908 {
4912 else
4915 }
4917 }
4918 }
4920 {
4922 {
4930 }
4931 else
4934 }
4937 {
4942 }
4945 {
4950 }
4951 else
4952 {
4954 /* Convert in case a char is more than one unit. */
4958 else
4960 }
4965 {
4968 }
4970 /* VALUE will have the middle-end integer type sizetype.
4971 However, we should really return a value of type `size_t',
4972 which is just a typedef for an ordinary integer type. */
4976 }
4978 /* Implement the __alignof keyword: Return the minimum required
4979 alignment of EXPR, measured in bytes. For VAR_DECLs,
4980 FUNCTION_DECLs and FIELD_DECLs return DECL_ALIGN (which can be set
4981 from an "aligned" __attribute__ specification). LOC is the
4982 location of the ALIGNOF operator. */
4984 tree
4986 {
4987 tree t;
4994 {
4997 }
5003 {
5010 {
5017 }
5019 }
5020 else
5024 }
5025 \f
5026 /* Handle C and C++ default attributes. */
5028 enum built_in_attribute
5029 {
5030 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
5031 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
5032 #define DEF_ATTR_STRING(ENUM, VALUE) ENUM,
5033 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
5034 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
5036 #undef DEF_ATTR_NULL_TREE
5037 #undef DEF_ATTR_INT
5038 #undef DEF_ATTR_STRING
5039 #undef DEF_ATTR_IDENT
5040 #undef DEF_ATTR_TREE_LIST
5041 ATTR_LAST
5042 };
5048 enum c_builtin_type
5049 {
5050 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
5051 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
5052 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
5053 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
5054 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5055 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5056 #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
5057 #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6) NAME,
5058 #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7) NAME,
5059 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
5060 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
5061 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
5062 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5063 #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5064 #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG6) \
5065 NAME,
5066 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
5068 #undef DEF_PRIMITIVE_TYPE
5069 #undef DEF_FUNCTION_TYPE_0
5070 #undef DEF_FUNCTION_TYPE_1
5071 #undef DEF_FUNCTION_TYPE_2
5072 #undef DEF_FUNCTION_TYPE_3
5073 #undef DEF_FUNCTION_TYPE_4
5074 #undef DEF_FUNCTION_TYPE_5
5075 #undef DEF_FUNCTION_TYPE_6
5076 #undef DEF_FUNCTION_TYPE_7
5077 #undef DEF_FUNCTION_TYPE_VAR_0
5078 #undef DEF_FUNCTION_TYPE_VAR_1
5079 #undef DEF_FUNCTION_TYPE_VAR_2
5080 #undef DEF_FUNCTION_TYPE_VAR_3
5081 #undef DEF_FUNCTION_TYPE_VAR_4
5082 #undef DEF_FUNCTION_TYPE_VAR_5
5083 #undef DEF_POINTER_TYPE
5084 BT_LAST
5085 };
5089 /* A temporary array for c_common_nodes_and_builtins. Used in
5090 communication with def_fn_type. */
5093 /* A helper function for c_common_nodes_and_builtins. Build function type
5094 for DEF with return type RET and N arguments. If VAR is true, then the
5095 function should be variadic after those N arguments.
5097 Takes special care not to ICE if any of the types involved are
5098 error_mark_node, which indicates that said type is not in fact available
5099 (see builtin_type_for_size). In which case the function type as a whole
5100 should be error_mark_node. */
5102 static void
5104 {
5105 tree t;
5112 {
5118 }
5125 else
5128 egress:
5131 }
5133 /* Build builtin functions common to both C and C++ language
5134 frontends. */
5136 static void
5138 {
5139 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
5140 builtin_types[ENUM] = VALUE;
5141 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
5142 def_fn_type (ENUM, RETURN, 0, 0);
5143 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
5144 def_fn_type (ENUM, RETURN, 0, 1, ARG1);
5145 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
5146 def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
5147 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5148 def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
5149 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5150 def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
5151 #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5152 def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5153 #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5154 ARG6) \
5155 def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
5156 #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5157 ARG6, ARG7) \
5158 def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
5159 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
5160 def_fn_type (ENUM, RETURN, 1, 0);
5161 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
5162 def_fn_type (ENUM, RETURN, 1, 1, ARG1);
5163 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
5164 def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
5165 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5166 def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
5167 #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5168 def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
5169 #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5170 def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5171 #define DEF_POINTER_TYPE(ENUM, TYPE) \
5172 builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
5176 #undef DEF_PRIMITIVE_TYPE
5177 #undef DEF_FUNCTION_TYPE_1
5178 #undef DEF_FUNCTION_TYPE_2
5179 #undef DEF_FUNCTION_TYPE_3
5180 #undef DEF_FUNCTION_TYPE_4
5181 #undef DEF_FUNCTION_TYPE_5
5182 #undef DEF_FUNCTION_TYPE_6
5183 #undef DEF_FUNCTION_TYPE_VAR_0
5184 #undef DEF_FUNCTION_TYPE_VAR_1
5185 #undef DEF_FUNCTION_TYPE_VAR_2
5186 #undef DEF_FUNCTION_TYPE_VAR_3
5187 #undef DEF_FUNCTION_TYPE_VAR_4
5188 #undef DEF_FUNCTION_TYPE_VAR_5
5189 #undef DEF_POINTER_TYPE
5194 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
5195 NONANSI_P, ATTRS, IMPLICIT, COND) \
5196 if (NAME && COND) \
5197 def_builtin_1 (ENUM, NAME, CLASS, \
5198 builtin_types[(int) TYPE], \
5199 builtin_types[(int) LIBTYPE], \
5200 BOTH_P, FALLBACK_P, NONANSI_P, \
5201 built_in_attributes[(int) ATTRS], IMPLICIT);
5203 #undef DEF_BUILTIN
5211 }
5213 /* Like get_identifier, but avoid warnings about null arguments when
5214 the argument may be NULL for targets where GCC lacks stdint.h type
5215 information. */
5219 {
5221 }
5223 /* Build tree nodes and builtin functions common to both C and C++ language
5224 frontends. */
5226 void
5228 {
5232 tree array_domain_type;
5233 tree va_list_ref_type_node;
5234 tree va_list_arg_type_node;
5238 /* Define `int' and `char' first so that dbx will output them first. */
5242 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
5243 "unsigned long", "long long unsigned" and "unsigned short" were in C++
5244 but not C. Are the conditionals here needed? */
5250 long_unsigned_type_node);
5252 {
5254 int128_integer_type_node);
5256 int128_unsigned_type_node);
5257 }
5261 long_long_integer_type_node);
5263 long_long_unsigned_type_node);
5266 long_long_unsigned_type_node);
5269 short_unsigned_type_node);
5272 short_unsigned_type_node);
5274 /* Define both `signed char' and `unsigned char'. */
5278 /* These are types that c_common_type_for_size and
5279 c_common_type_for_mode use. */
5282 intQI_type_node));
5285 intHI_type_node));
5288 intSI_type_node));
5291 intDI_type_node));
5292 #if HOST_BITS_PER_WIDE_INT >= 64
5295 TYPE_DECL,
5297 intTI_type_node));
5298 #endif
5301 unsigned_intQI_type_node));
5304 unsigned_intHI_type_node));
5307 unsigned_intSI_type_node));
5310 unsigned_intDI_type_node));
5311 #if HOST_BITS_PER_WIDE_INT >= 64
5314 TYPE_DECL,
5316 unsigned_intTI_type_node));
5317 #endif
5319 /* Create the widest literal types. */
5320 widest_integer_literal_type_node
5324 widest_integer_literal_type_node));
5326 widest_unsigned_literal_type_node
5330 widest_unsigned_literal_type_node));
5334 pid_type_node =
5341 /* Only supported decimal floating point extension if the target
5342 actually supports underlying modes. */
5346 {
5350 }
5353 {
5358 long_long_fract_type_node);
5360 unsigned_short_fract_type_node);
5362 unsigned_fract_type_node);
5364 unsigned_long_fract_type_node);
5366 unsigned_long_long_fract_type_node);
5368 sat_short_fract_type_node);
5371 sat_long_fract_type_node);
5373 sat_long_long_fract_type_node);
5375 sat_unsigned_short_fract_type_node);
5377 sat_unsigned_fract_type_node);
5379 sat_unsigned_long_fract_type_node);
5381 sat_unsigned_long_long_fract_type_node);
5386 long_long_accum_type_node);
5388 unsigned_short_accum_type_node);
5390 unsigned_accum_type_node);
5392 unsigned_long_accum_type_node);
5394 unsigned_long_long_accum_type_node);
5396 sat_short_accum_type_node);
5399 sat_long_accum_type_node);
5401 sat_long_long_accum_type_node);
5403 sat_unsigned_short_accum_type_node);
5405 sat_unsigned_accum_type_node);
5407 sat_unsigned_long_accum_type_node);
5409 sat_unsigned_long_long_accum_type_node);
5411 }
5414 TYPE_DECL,
5416 complex_integer_type_node));
5418 TYPE_DECL,
5420 complex_float_type_node));
5422 TYPE_DECL,
5424 complex_double_type_node));
5428 complex_long_double_type_node));
5431 /* For C++, make fileptr_type_node a distinct void * type until
5432 FILE type is defined. */
5437 /* Set the TYPE_NAME for any variants that were built before
5438 record_builtin_type gave names to the built-in types. */
5439 {
5445 }
5447 /* This node must not be shared. */
5453 /* Make a type to be the domain of a few array types
5454 whose domains don't really matter.
5455 200 is small enough that it always fits in size_t
5456 and large enough that it can hold most function names for the
5457 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
5460 /* Make a type for arrays of characters.
5461 With luck nothing will ever really depend on the length of this
5462 array type. */
5463 char_array_type_node
5466 /* Likewise for arrays of ints. */
5467 int_array_type_node
5471 const_string_type_node
5475 /* This is special for C++ so functions can be overloaded. */
5481 {
5484 else
5487 }
5489 /* This is for wide string constants. */
5490 wchar_array_type_node
5493 /* Define 'char16_t'. */
5498 {
5503 }
5505 /* This is for UTF-16 string constants. */
5506 char16_array_type_node
5509 /* Define 'char32_t'. */
5514 {
5519 }
5521 /* This is for UTF-32 string constants. */
5522 char32_array_type_node
5525 wint_type_node =
5528 intmax_type_node =
5530 uintmax_type_node =
5534 sig_atomic_type_node =
5537 int8_type_node =
5540 int16_type_node =
5543 int32_type_node =
5546 int64_type_node =
5549 uint8_type_node =
5552 c_uint16_type_node =
5555 c_uint32_type_node =
5558 c_uint64_type_node =
5561 int_least8_type_node =
5564 int_least16_type_node =
5567 int_least32_type_node =
5570 int_least64_type_node =
5573 uint_least8_type_node =
5576 uint_least16_type_node =
5579 uint_least32_type_node =
5582 uint_least64_type_node =
5585 int_fast8_type_node =
5588 int_fast16_type_node =
5591 int_fast32_type_node =
5594 int_fast64_type_node =
5597 uint_fast8_type_node =
5600 uint_fast16_type_node =
5603 uint_fast32_type_node =
5606 uint_fast64_type_node =
5609 intptr_type_node =
5612 uintptr_type_node =
5615 default_function_type
5617 ptrdiff_type_node
5624 va_list_type_node));
5626 {
5629 tree ptype;
5632 {
5636 ptype));
5638 }
5639 }
5642 {
5645 }
5646 else
5647 {
5650 }
5657 /* Create the built-in __null node. It is important that this is
5658 not shared. */
5662 /* Since builtin_types isn't gc'ed, don't export these nodes. */
5664 }
5666 /* The number of named compound-literals generated thus far. */
5669 /* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */
5671 void
5673 {
5676 compound_literal_number);
5677 compound_literal_number++;
5679 }
5681 tree
5683 {
5687 }
5690 /* Linked list of disabled built-in functions. */
5693 {
5701 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
5702 begins with "__builtin_", give an error. */
5704 void
5706 {
5709 else
5710 {
5715 }
5716 }
5719 /* Return true if the built-in function NAME has been disabled, false
5720 otherwise. */
5722 static bool
5724 {
5727 {
5730 }
5732 }
5735 /* Worker for DEF_BUILTIN.
5736 Possibly define a builtin function with one or two names.
5737 Does not declare a non-__builtin_ function if flag_no_builtin, or if
5738 nonansi_p and flag_no_nonansi_builtin. */
5740 static void
5747 {
5748 tree decl;
5761 fnattrs);
5770 }
5771 \f
5772 /* Nonzero if the type T promotes to int. This is (nearly) the
5773 integral promotions defined in ISO C99 6.3.1.1/2. */
5775 bool
5777 {
5779 {
5789 /* ??? Technically all enumerations not larger than an int
5790 promote to an int. But this is used along code paths
5791 that only want to notice a size change. */
5799 }
5800 }
5802 /* Return 1 if PARMS specifies a fixed number of parameters
5803 and none of their types is affected by default promotions. */
5805 int
5807 {
5808 const_tree t;
5810 {
5827 }
5829 }
5831 /* Recursively remove any '*' or '&' operator from TYPE. */
5832 tree
5834 {
5838 }
5840 /* Recursively remove pointer or array type from TYPE. */
5841 tree
5843 {
5847 }
5849 /* Used to compare case labels. K1 and K2 are actually tree nodes
5850 representing case labels, or NULL_TREE for a `default' label.
5851 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
5852 K2, and 0 if K1 and K2 are equal. */
5854 int
5856 {
5857 /* Consider a NULL key (such as arises with a `default' label) to be
5858 smaller than anything else. */
5865 }
5867 /* Process a case label, located at LOC, for the range LOW_VALUE
5868 ... HIGH_VALUE. If LOW_VALUE and HIGH_VALUE are both NULL_TREE
5869 then this case label is actually a `default' label. If only
5870 HIGH_VALUE is NULL_TREE, then case label was declared using the
5871 usual C/C++ syntax, rather than the GNU case range extension.
5872 CASES is a tree containing all the case ranges processed so far;
5873 COND is the condition for the switch-statement itself. Returns the
5874 CASE_LABEL_EXPR created, or ERROR_MARK_NODE if no CASE_LABEL_EXPR
5875 is created. */
5877 tree
5880 {
5881 tree type;
5882 tree label;
5883 tree case_label;
5884 splay_tree_node node;
5886 /* Create the LABEL_DECL itself. */
5889 /* If there was an error processing the switch condition, bail now
5890 before we get more confused. */
5898 {
5901 }
5903 /* Case ranges are a GNU extension. */
5910 {
5915 }
5917 {
5922 }
5925 {
5926 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
5927 really a case range, even though it was written that way.
5928 Remove the HIGH_VALUE to simplify later processing. */
5933 }
5935 /* See if the case is in range of the type of the original testing
5936 expression. If both low_value and high_value are out of range,
5937 don't insert the case label and return NULL_TREE. */
5943 /* Look up the LOW_VALUE in the table of case labels we already
5944 have. */
5946 /* If there was not an exact match, check for overlapping ranges.
5947 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
5948 that's a `default' label and the only overlap is an exact match. */
5950 {
5951 splay_tree_node low_bound;
5952 splay_tree_node high_bound;
5954 /* Even though there wasn't an exact match, there might be an
5955 overlap between this case range and another case range.
5956 Since we've (inductively) not allowed any overlapping case
5957 ranges, we simply need to find the greatest low case label
5958 that is smaller that LOW_VALUE, and the smallest low case
5959 label that is greater than LOW_VALUE. If there is an overlap
5960 it will occur in one of these two ranges. */
5966 /* Check to see if the LOW_BOUND overlaps. It is smaller than
5967 the LOW_VALUE, so there is no need to check unless the
5968 LOW_BOUND is in fact itself a case range. */
5974 /* Check to see if the HIGH_BOUND overlaps. The low end of that
5975 range is bigger than the low end of the current range, so we
5976 are only interested if the current range is a real range, and
5977 not an ordinary case label. */
5979 && high_value
5981 high_value)
5984 }
5985 /* If there was an overlap, issue an error. */
5987 {
5991 {
5995 }
5997 {
6000 }
6001 else
6002 {
6006 }
6008 }
6010 /* Add a CASE_LABEL to the statement-tree. */
6012 /* Register this case label in the splay tree. */
6019 error_out:
6020 /* Add a label so that the back-end doesn't think that the beginning of
6021 the switch is unreachable. Note that we do not add a case label, as
6022 that just leads to duplicates and thence to failure later on. */
6024 {
6027 }
6029 }
6031 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
6032 Used to verify that case values match up with enumerator values. */
6034 static void
6036 {
6039 /* ??? Not working too hard to print the double-word value.
6040 Should perhaps be done with %lwd in the diagnostic routines? */
6049 else
6058 buf);
6059 else
6064 }
6066 /* Subroutine of c_do_switch_warnings, called via splay_tree_foreach.
6067 Used to verify that case values match up with enumerator values. */
6069 static int
6071 {
6075 /* Skip default case. */
6079 /* If CASE_LOW_SEEN is not set, that means CASE_LOW did not appear
6080 when we did our enum->case scan. Reset our scratch bit after. */
6083 else
6086 /* If CASE_HIGH is non-null, we have a range. If CASE_HIGH_SEEN is
6087 not set, that means that CASE_HIGH did not appear when we did our
6088 enum->case scan. Reset our scratch bit after. */
6090 {
6093 else
6095 }
6098 }
6100 /* Handle -Wswitch*. Called from the front end after parsing the
6101 switch construct. */
6102 /* ??? Should probably be somewhere generic, since other languages
6103 besides C and C++ would want this. At the moment, however, C/C++
6104 are the only tree-ssa languages that support enumerations at all,
6105 so the point is moot. */
6107 void
6110 {
6111 splay_tree_node default_node;
6112 splay_tree_node node;
6113 tree chain;
6123 /* From here on, we only care about about enumerated types. */
6127 /* From here on, we only care about -Wswitch and -Wswitch-enum. */
6131 /* Check the cases. Warn about case values which are not members of
6132 the enumerated type. For -Wswitch-enum, or for -Wswitch when
6133 there is no default case, check that exactly all enumeration
6134 literals are covered by the cases. */
6136 /* Clearing COND if it is not an integer constant simplifies
6137 the tests inside the loop below. */
6141 /* The time complexity here is O(N*lg(N)) worst case, but for the
6142 common case of monotonically increasing enumerators, it is
6143 O(N), since the nature of the splay tree will keep the next
6144 element adjacent to the root at all times. */
6147 {
6153 {
6154 /* Mark the CASE_LOW part of the case entry as seen. */
6158 }
6160 /* Even though there wasn't an exact match, there might be a
6161 case range which includes the enumerator's value. */
6164 {
6168 {
6169 /* If we match the upper bound exactly, mark the CASE_HIGH
6170 part of the case entry as seen. */
6174 }
6175 }
6177 /* We've now determined that this enumerated literal isn't
6178 handled by the case labels of the switch statement. */
6180 /* If the switch expression is a constant, we only really care
6181 about whether that constant is handled by the switch. */
6185 /* If there is a default_node, the only relevant option is
6186 Wswitch-enum. Otherwise, if both are enabled then we prefer
6187 to warn using -Wswitch because -Wswitch is enabled by -Wall
6188 while -Wswitch-enum is explicit. */
6191 ? OPT_Wswitch_enum
6195 }
6197 /* Warn if there are case expressions that don't correspond to
6198 enumerators. This can occur since C and C++ don't enforce
6199 type-checking of assignments to enumeration variables.
6201 The time complexity here is now always O(N) worst case, since
6202 we should have marked both the lower bound and upper bound of
6203 every disjoint case label, with CASE_LOW_SEEN and CASE_HIGH_SEEN
6204 above. This scan also resets those fields. */
6207 }
6209 /* Finish an expression taking the address of LABEL (an
6210 IDENTIFIER_NODE). Returns an expression for the address.
6212 LOC is the location for the expression returned. */
6214 tree
6216 {
6217 tree result;
6227 else
6228 {
6231 /* The current function is not necessarily uninlinable.
6232 Computed gotos are incompatible with inlining, but the value
6233 here could be used only in a diagnostic, for example. */
6235 }
6238 }
6239 \f
6241 /* Given a boolean expression ARG, return a tree representing an increment
6242 or decrement (as indicated by CODE) of ARG. The front end must check for
6243 invalid cases (e.g., decrement in C++). */
6244 tree
6246 {
6247 tree val;
6252 {
6275 }
6278 }
6279 \f
6280 /* Built-in macros for stddef.h and stdint.h, that require macros
6281 defined in this file. */
6282 void
6284 {
6347 }
6349 static void
6351 {
6352 /* Fill in the built_in_attributes array. */
6353 #define DEF_ATTR_NULL_TREE(ENUM) \
6354 built_in_attributes[(int) ENUM] = NULL_TREE;
6355 #define DEF_ATTR_INT(ENUM, VALUE) \
6356 built_in_attributes[(int) ENUM] = build_int_cst (integer_type_node, VALUE);
6357 #define DEF_ATTR_STRING(ENUM, VALUE) \
6358 built_in_attributes[(int) ENUM] = build_string (strlen (VALUE), VALUE);
6359 #define DEF_ATTR_IDENT(ENUM, STRING) \
6360 built_in_attributes[(int) ENUM] = get_identifier (STRING);
6361 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
6362 built_in_attributes[(int) ENUM] \
6363 = tree_cons (built_in_attributes[(int) PURPOSE], \
6364 built_in_attributes[(int) VALUE], \
6365 built_in_attributes[(int) CHAIN]);
6367 #undef DEF_ATTR_NULL_TREE
6368 #undef DEF_ATTR_INT
6369 #undef DEF_ATTR_IDENT
6370 #undef DEF_ATTR_TREE_LIST
6371 }
6373 /* Returns TRUE iff the attribute indicated by ATTR_ID takes a plain
6374 identifier as an argument, so the front end shouldn't look it up. */
6376 bool
6378 {
6381 /* Unknown attribute that we'll end up ignoring, return true so we
6382 don't complain about an identifier argument. */
6388 else
6390 }
6392 /* Attribute handlers common to C front ends. */
6394 /* Handle a "packed" attribute; arguments as in
6395 struct attribute_spec.handler. */
6397 static tree
6400 {
6402 {
6406 }
6408 {
6410 /* Still pack bitfields. */
6415 else
6417 }
6418 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
6419 used for DECL_REGISTER. It wouldn't mean anything anyway.
6420 We can't set DECL_PACKED on the type of a TYPE_DECL, because
6421 that changes what the typedef is typing. */
6422 else
6423 {
6426 }
6429 }
6431 /* Handle a "nocommon" attribute; arguments as in
6432 struct attribute_spec.handler. */
6434 static tree
6438 {
6441 else
6442 {
6445 }
6448 }
6450 /* Handle a "common" attribute; arguments as in
6451 struct attribute_spec.handler. */
6453 static tree
6456 {
6459 else
6460 {
6463 }
6466 }
6468 /* Handle a "noreturn" attribute; arguments as in
6469 struct attribute_spec.handler. */
6471 static tree
6474 {
6477 /* See FIXME comment in c_common_attribute_table. */
6484 = build_pointer_type
6487 else
6488 {
6491 }
6494 }
6496 /* Handle a "hot" and attribute; arguments as in
6497 struct attribute_spec.handler. */
6499 static tree
6502 {
6505 {
6507 {
6511 }
6512 /* Most of the rest of the hot processing is done later with
6513 lookup_attribute. */
6514 }
6515 else
6516 {
6519 }
6522 }
6524 /* Handle a "cold" and attribute; arguments as in
6525 struct attribute_spec.handler. */
6527 static tree
6530 {
6533 {
6535 {
6539 }
6540 /* Most of the rest of the cold processing is done later with
6541 lookup_attribute. */
6542 }
6543 else
6544 {
6547 }
6550 }
6552 /* Handle a "no_address_safety_analysis" attribute; arguments as in
6553 struct attribute_spec.handler. */
6555 static tree
6558 {
6560 {
6563 }
6566 }
6568 /* Handle a "noinline" attribute; arguments as in
6569 struct attribute_spec.handler. */
6571 static tree
6575 {
6578 else
6579 {
6582 }
6585 }
6587 /* Handle a "noclone" attribute; arguments as in
6588 struct attribute_spec.handler. */
6590 static tree
6594 {
6596 {
6599 }
6602 }
6604 /* Handle a "always_inline" attribute; arguments as in
6605 struct attribute_spec.handler. */
6607 static tree
6612 {
6614 {
6615 /* Set the attribute and mark it for disregarding inline
6616 limits. */
6618 }
6619 else
6620 {
6623 }
6626 }
6628 /* Handle a "gnu_inline" attribute; arguments as in
6629 struct attribute_spec.handler. */
6631 static tree
6636 {
6638 {
6639 /* Do nothing else, just set the attribute. We'll get at
6640 it later with lookup_attribute. */
6641 }
6642 else
6643 {
6646 }
6649 }
6651 /* Handle a "leaf" attribute; arguments as in
6652 struct attribute_spec.handler. */
6654 static tree
6658 {
6660 {
6663 }
6665 {
6668 }
6671 }
6673 /* Handle an "artificial" attribute; arguments as in
6674 struct attribute_spec.handler. */
6676 static tree
6681 {
6683 {
6684 /* Do nothing else, just set the attribute. We'll get at
6685 it later with lookup_attribute. */
6686 }
6687 else
6688 {
6691 }
6694 }
6696 /* Handle a "flatten" attribute; arguments as in
6697 struct attribute_spec.handler. */
6699 static tree
6701 tree args ATTRIBUTE_UNUSED,
6703 {
6705 /* Do nothing else, just set the attribute. We'll get at
6706 it later with lookup_attribute. */
6707 ;
6708 else
6709 {
6712 }
6715 }
6717 /* Handle a "warning" or "error" attribute; arguments as in
6718 struct attribute_spec.handler. */
6720 static tree
6723 {
6726 /* Do nothing else, just set the attribute. We'll get at
6727 it later with lookup_attribute. */
6728 ;
6729 else
6730 {
6733 }
6736 }
6738 /* Handle a "used" attribute; arguments as in
6739 struct attribute_spec.handler. */
6741 static tree
6744 {
6750 {
6755 }
6756 else
6757 {
6760 }
6763 }
6765 /* Handle a "unused" attribute; arguments as in
6766 struct attribute_spec.handler. */
6768 static tree
6771 {
6773 {
6781 {
6786 }
6787 else
6788 {
6791 }
6792 }
6793 else
6794 {
6798 }
6801 }
6803 /* Handle a "externally_visible" attribute; arguments as in
6804 struct attribute_spec.handler. */
6806 static tree
6811 {
6815 {
6818 {
6822 }
6823 }
6824 else
6825 {
6828 }
6831 }
6833 /* Handle a "const" attribute; arguments as in
6834 struct attribute_spec.handler. */
6836 static tree
6839 {
6842 /* See FIXME comment on noreturn in c_common_attribute_table. */
6848 = build_pointer_type
6851 else
6852 {
6855 }
6858 }
6860 /* Handle a "transparent_union" attribute; arguments as in
6861 struct attribute_spec.handler. */
6863 static tree
6867 {
6868 tree type;
6879 {
6880 /* Make sure that the first field will work for a transparent union.
6881 If the type isn't complete yet, leave the check to the code in
6882 finish_struct. */
6884 {
6890 }
6893 {
6894 /* If the type isn't complete yet, setting the flag
6895 on a variant wouldn't ever be checked. */
6899 /* build_duplicate_type doesn't work for C++. */
6903 /* A type variant isn't good enough, since we don't a cast
6904 to such a type removed as a no-op. */
6906 }
6910 }
6912 ignored:
6915 }
6917 /* Subroutine of handle_{con,de}structor_attribute. Evaluate ARGS to
6918 get the requested priority for a constructor or destructor,
6919 possibly issuing diagnostics for invalid or reserved
6920 priorities. */
6922 static priority_type
6924 {
6925 HOST_WIDE_INT pri;
6926 tree arg;
6932 {
6935 else
6938 }
6951 {
6954 "destructor priorities from 0 to %d are reserved "
6956 MAX_RESERVED_INIT_PRIORITY);
6957 else
6959 "constructor priorities from 0 to %d are reserved "
6961 MAX_RESERVED_INIT_PRIORITY);
6962 }
6965 invalid:
6968 MAX_INIT_PRIORITY);
6969 else
6971 MAX_INIT_PRIORITY);
6973 }
6975 /* Handle a "constructor" attribute; arguments as in
6976 struct attribute_spec.handler. */
6978 static tree
6982 {
6989 {
6990 priority_type priority;
6995 }
6996 else
6997 {
7000 }
7003 }
7005 /* Handle a "destructor" attribute; arguments as in
7006 struct attribute_spec.handler. */
7008 static tree
7012 {
7019 {
7020 priority_type priority;
7025 }
7026 else
7027 {
7030 }
7033 }
7035 /* Nonzero if the mode is a valid vector mode for this architecture.
7036 This returns nonzero even if there is no hardware support for the
7037 vector mode, but we can emulate with narrower modes. */
7039 static int
7041 {
7045 /* Doh! What's going on? */
7054 /* Hardware support. Woo hoo! */
7060 /* We should probably return 1 if requesting V4DI and we have no DI,
7061 but we have V2DI, but this is probably very unlikely. */
7063 /* If we have support for the inner mode, we can safely emulate it.
7064 We may not have V2DI, but me can emulate with a pair of DIs. */
7066 }
7069 /* Handle a "mode" attribute; arguments as in
7070 struct attribute_spec.handler. */
7072 static tree
7075 {
7083 else
7084 {
7089 tree typefm;
7094 {
7100 }
7102 /* Change this type to have a type with the specified mode.
7103 First check for the special modes. */
7116 else
7119 {
7122 }
7125 {
7128 }
7132 {
7164 }
7166 {
7169 }
7172 {
7177 {
7180 }
7184 else
7187 }
7188 else
7189 {
7190 /* For fixed-point modes, we need to test if the signness of type
7191 and the machine mode are consistent. */
7194 {
7197 }
7198 /* For fixed-point modes, we need to pass saturating info. */
7202 }
7205 {
7208 }
7210 {
7211 /* For enumeral types, copy the precision from the integer
7212 type returned above. If not an INTEGER_TYPE, we can't use
7213 this mode for this type. */
7215 {
7218 }
7221 {
7224 }
7225 else
7226 {
7227 /* We cannot build a type variant, as there's code that assumes
7228 that TYPE_MAIN_VARIANT has the same mode. This includes the
7229 debug generators. Instead, create a subrange type. This
7230 results in all of the enumeral values being emitted only once
7231 in the original, and the subtype gets them by reference. */
7234 else
7237 }
7238 }
7242 {
7245 }
7248 }
7251 }
7253 /* Handle a "section" attribute; arguments as in
7254 struct attribute_spec.handler. */
7256 static tree
7259 {
7263 {
7269 {
7273 {
7275 "section attribute cannot be specified for "
7278 }
7280 /* The decl may have already been given a section attribute
7281 from a previous declaration. Ensure they match. */
7285 {
7289 }
7293 {
7296 }
7297 else
7299 }
7300 else
7301 {
7304 }
7305 }
7306 else
7307 {
7311 }
7314 }
7316 /* Check whether ALIGN is a valid user-specified alignment. If so,
7317 return its base-2 log; if not, output an error and return -1. If
7318 ALLOW_ZERO then 0 is valid and should result in a return of -1 with
7319 no error. */
7320 int
7322 {
7327 {
7330 }
7334 {
7337 }
7339 {
7342 }
7344 }
7346 /*
7347 If in c++-11, check if the c++-11 alignment constraint with respect
7348 to fundamental alignment (in [dcl.align]) are satisfied. If not in
7349 c++-11 mode, does nothing.
7351 [dcl.align]2/ says:
7353 [* if the constant expression evaluates to a fundamental alignment,
7354 the alignment requirement of the declared entity shall be the
7355 specified fundamental alignment.
7357 * if the constant expression evaluates to an extended alignment
7358 and the implementation supports that alignment in the context
7359 of the declaration, the alignment of the declared entity shall
7360 be that alignment
7362 * if the constant expression evaluates to an extended alignment
7363 and the implementation does not support that alignment in the
7364 context of the declaration, the program is ill-formed]. */
7366 static bool
7370 {
7383 {
7385 {
7386 /* For file scope variables and static members, the target
7387 supports alignments that are at most
7388 MAX_OFILE_ALIGNMENT. */
7391 }
7392 else
7393 {
7394 #ifdef BIGGEST_FIELD_ALIGNMENT
7395 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_FIELD_ALIGNMENT
7396 #else
7397 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_ALIGNMENT
7398 #endif
7399 /* For non-static members, the target supports either
7400 alignments that at most either BIGGEST_FIELD_ALIGNMENT
7401 if it is defined or BIGGEST_ALIGNMENT. */
7406 #undef MAX_TARGET_FIELD_ALIGNMENT
7407 /* For stack variables, the target supports at most
7408 MAX_STACK_ALIGNMENT. */
7412 }
7413 }
7415 {
7416 /* Let's be liberal for types. */
7419 }
7427 }
7429 /* Handle a "aligned" attribute; arguments as in
7430 struct attribute_spec.handler. */
7432 static tree
7435 {
7444 {
7448 }
7456 {
7459 /* If we have a TYPE_DECL, then copy the type, so that we
7460 don't accidentally modify a builtin type. See pushdecl. */
7463 {
7470 }
7471 else
7476 }
7479 {
7482 }
7485 /* C++-11 [dcl.align/4]:
7487 When multiple alignment-specifiers are specified for an
7488 entity, the alignment requirement shall be set to the
7489 strictest specified alignment.
7491 This formally comes from the c++11 specification but we are
7492 doing it for the GNU attribute syntax as well. */
7496 {
7501 else
7505 }
7506 else
7507 {
7510 }
7513 }
7515 /* Handle a "weak" attribute; arguments as in
7516 struct attribute_spec.handler. */
7518 static tree
7523 {
7526 {
7529 }
7531 {
7535 }
7539 else
7543 }
7545 /* Handle an "alias" or "ifunc" attribute; arguments as in
7546 struct attribute_spec.handler, except that IS_ALIAS tells us
7547 whether this is an alias as opposed to ifunc attribute. */
7549 static tree
7552 {
7557 {
7560 }
7564 /* A static variable declaration is always a tentative definition,
7565 but the alias is a non-tentative definition which overrides. */
7568 {
7572 }
7576 {
7580 }
7582 /* Note that the very first time we process a nested declaration,
7583 decl_function_context will not be set. Indeed, *would* never
7584 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
7585 we do below. After such frobbery, pushdecl would set the context.
7586 In any case, this is never what we want. */
7588 {
7589 tree id;
7593 {
7597 }
7599 /* This counts as a use of the object pointed to. */
7604 else
7605 {
7608 else
7611 }
7614 /* ifuncs are also aliases, so set that attribute too. */
7617 }
7618 else
7619 {
7622 }
7625 }
7627 /* Handle an "alias" or "ifunc" attribute; arguments as in
7628 struct attribute_spec.handler. */
7630 static tree
7633 {
7635 }
7637 /* Handle an "alias" or "ifunc" attribute; arguments as in
7638 struct attribute_spec.handler. */
7640 static tree
7643 {
7645 }
7647 /* Handle a "weakref" attribute; arguments as in struct
7648 attribute_spec.handler. */
7650 static tree
7653 {
7656 /* We must ignore the attribute when it is associated with
7657 local-scoped decls, since attribute alias is ignored and many
7658 such symbols do not even have a DECL_WEAK field. */
7660 || current_function_decl
7662 {
7666 }
7669 {
7673 }
7675 /* The idea here is that `weakref("name")' mutates into `weakref,
7676 alias("name")', and weakref without arguments, in turn,
7677 implicitly adds weak. */
7680 {
7687 }
7688 else
7689 {
7694 /* Can't call declare_weak because it wants this to be TREE_PUBLIC,
7695 and that isn't supported; and because it wants to add it to
7696 the list of weak decls, which isn't helpful. */
7698 }
7701 }
7703 /* Handle an "visibility" attribute; arguments as in
7704 struct attribute_spec.handler. */
7706 static tree
7710 {
7716 {
7720 {
7722 name);
7724 }
7726 {
7730 }
7731 }
7733 {
7736 }
7739 {
7742 }
7744 /* If this is a type, set the visibility on the type decl. */
7746 {
7751 {
7753 name);
7755 }
7756 }
7766 else
7767 {
7768 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
7770 }
7774 {
7788 }
7793 /* Go ahead and attach the attribute to the node as well. This is needed
7794 so we can determine whether we have VISIBILITY_DEFAULT because the
7795 visibility was not specified, or because it was explicitly overridden
7796 from the containing scope. */
7799 }
7801 /* Determine the ELF symbol visibility for DECL, which is either a
7802 variable or a function. It is an error to use this function if a
7803 definition of DECL is not available in this translation unit.
7804 Returns true if the final visibility has been determined by this
7805 function; false if the caller is free to make additional
7806 modifications. */
7808 bool
7810 {
7814 /* If the user explicitly specified the visibility with an
7815 attribute, honor that. DECL_VISIBILITY will have been set during
7816 the processing of the attribute. We check for an explicit
7817 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
7818 to distinguish the use of an attribute from the use of a "#pragma
7819 GCC visibility push(...)"; in the latter case we still want other
7820 considerations to be able to overrule the #pragma. */
7822 || (TARGET_DLLIMPORT_DECL_ATTRIBUTES
7827 /* Set default visibility to whatever the user supplied with
7828 visibility_specified depending on #pragma GCC visibility. */
7830 {
7833 {
7836 /* If visibility changed and DECL already has DECL_RTL, ensure
7837 symbol flags are updated. */
7842 }
7843 }
7845 }
7847 /* Handle an "tls_model" attribute; arguments as in
7848 struct attribute_spec.handler. */
7850 static tree
7853 {
7854 tree id;
7861 {
7864 }
7869 {
7872 }
7882 else
7883 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
7887 }
7889 /* Handle a "no_instrument_function" attribute; arguments as in
7890 struct attribute_spec.handler. */
7892 static tree
7897 {
7901 {
7905 }
7907 {
7911 }
7912 else
7916 }
7918 /* Handle a "malloc" attribute; arguments as in
7919 struct attribute_spec.handler. */
7921 static tree
7924 {
7928 else
7929 {
7932 }
7935 }
7937 /* Handle a "alloc_size" attribute; arguments as in
7938 struct attribute_spec.handler. */
7940 static tree
7943 {
7946 {
7953 {
7958 }
7959 }
7961 }
7963 /* Handle a "fn spec" attribute; arguments as in
7964 struct attribute_spec.handler. */
7966 static tree
7970 {
7975 }
7977 /* Handle a "returns_twice" attribute; arguments as in
7978 struct attribute_spec.handler. */
7980 static tree
7983 {
7986 else
7987 {
7990 }
7993 }
7995 /* Handle a "no_limit_stack" attribute; arguments as in
7996 struct attribute_spec.handler. */
7998 static tree
8003 {
8007 {
8011 }
8013 {
8017 }
8018 else
8022 }
8024 /* Handle a "pure" attribute; arguments as in
8025 struct attribute_spec.handler. */
8027 static tree
8030 {
8033 /* ??? TODO: Support types. */
8034 else
8035 {
8038 }
8041 }
8043 /* Digest an attribute list destined for a transactional memory statement.
8044 ALLOWED is the set of attributes that are allowed for this statement;
8045 return the attribute we parsed. Multiple attributes are never allowed. */
8047 int
8049 {
8054 {
8062 {
8065 }
8068 {
8071 }
8074 else
8076 }
8079 }
8081 /* Transform a TM attribute name into a maskable integer and back.
8082 Note that NULL (i.e. no attribute) is mapped to UNKNOWN, corresponding
8083 to how the lack of an attribute is treated. */
8085 int
8087 {
8101 }
8103 tree
8105 {
8108 {
8126 }
8128 }
8130 /* Return the first TM attribute seen in LIST. */
8132 tree
8134 {
8136 {
8140 }
8142 }
8144 /* Handle the TM attributes; arguments as in struct attribute_spec.handler.
8145 Here we accept only function types, and verify that none of the other
8146 function TM attributes are also applied. */
8147 /* ??? We need to accept class types for C++, but not C. This greatly
8148 complicates this function, since we can no longer rely on the extra
8149 processing given by function_type_required. */
8151 static tree
8154 {
8155 /* Only one path adds the attribute; others don't. */
8159 {
8162 /* Only tm_callable and tm_safe apply to classes. */
8165 /* FALLTHRU */
8169 {
8172 ;
8175 else
8177 }
8181 {
8184 {
8189 }
8190 }
8191 /* FALLTHRU */
8194 /* If a function is next, pass it on to be tried next. */
8198 ignored:
8201 }
8204 }
8206 /* Handle the TM_WRAP attribute; arguments as in
8207 struct attribute_spec.handler. */
8209 static tree
8212 {
8215 /* We don't need the attribute even on success, since we
8216 record the entry in an external table. */
8221 else
8222 {
8228 else
8229 {
8233 {
8237 else
8239 }
8240 else
8242 }
8243 }
8246 }
8248 /* Ignore the given attribute. Used when this attribute may be usefully
8249 overridden by the target, but is not used generically. */
8251 static tree
8255 {
8258 }
8260 /* Handle a "no vops" attribute; arguments as in
8261 struct attribute_spec.handler. */
8263 static tree
8267 {
8271 }
8273 /* Handle a "deprecated" attribute; arguments as in
8274 struct attribute_spec.handler. */
8276 static tree
8280 {
8288 {
8291 }
8294 {
8305 else
8307 }
8309 {
8314 }
8315 else
8319 {
8322 {
8328 }
8331 else
8333 }
8336 }
8338 /* Handle a "vector_size" attribute; arguments as in
8339 struct attribute_spec.handler. */
8341 static tree
8345 {
8355 {
8358 }
8360 /* Get the vector size (in bytes). */
8363 /* We need to provide for vector pointers, vector arrays, and
8364 functions returning vectors. For example:
8366 __attribute__((vector_size(16))) short *foo;
8368 In this case, the mode is SI, but the type being modified is
8369 HI, so we need to look further. */
8378 /* Get the mode of the type being modified. */
8389 {
8392 }
8395 {
8398 }
8401 {
8404 }
8406 /* Calculate how many units fit in the vector. */
8409 {
8412 }
8416 /* Build back pointers if needed. */
8420 }
8422 /* Handle the "nonnull" attribute. */
8423 static tree
8427 {
8431 /* If no arguments are specified, all pointer arguments should be
8432 non-null. Verify a full prototype is given so that the arguments
8433 will have the correct types when we actually check them later. */
8435 {
8437 {
8440 }
8442 }
8444 /* Argument list specified. Verify that each argument number references
8445 a pointer argument. */
8447 {
8451 {
8456 }
8459 {
8460 function_args_iterator iter;
8461 tree argument;
8465 {
8469 }
8473 {
8478 }
8481 {
8486 }
8487 }
8488 }
8491 }
8493 /* Check the argument list of a function call for null in argument slots
8494 that are marked as requiring a non-null pointer argument. The NARGS
8495 arguments are passed in the array ARGARRAY.
8496 */
8498 static void
8500 {
8501 tree a;
8509 /* See if any of the nonnull attributes has no arguments. If so,
8510 then every pointer argument is checked (in which case the check
8511 for pointer type is done in check_nonnull_arg). */
8513 do
8521 else
8522 {
8523 /* Walk the argument list. If we encounter an argument number we
8524 should check for non-null, do it. */
8526 {
8528 {
8532 }
8537 }
8538 }
8539 }
8541 /* Check that the Nth argument of a function call (counting backwards
8542 from the end) is a (pointer)0. The NARGS arguments are passed in the
8543 array ARGARRAY. */
8545 static void
8547 {
8551 {
8554 tree sentinel;
8555 function_args_iterator iter;
8556 tree t;
8558 /* Skip over the named arguments. */
8560 {
8563 len++;
8564 }
8567 {
8570 }
8572 /* The sentinel must be one of the varargs, i.e.
8573 in position >= the number of fixed arguments. */
8575 {
8579 }
8581 /* Validate the sentinel. */
8585 /* Although __null (in C++) is only an integer we allow it
8586 nevertheless, as we are guaranteed that it's exactly
8587 as wide as a pointer, and we don't want to force
8588 users to cast the NULL they have written there.
8589 We warn with -Wstrict-null-sentinel, though. */
8592 }
8593 }
8595 /* Helper for check_function_nonnull; given a list of operands which
8596 must be non-null in ARGS, determine if operand PARAM_NUM should be
8597 checked. */
8599 static bool
8601 {
8605 {
8612 }
8614 }
8616 /* Check that the function argument PARAM (which is operand number
8617 PARAM_NUM) is non-null. This is called by check_function_nonnull
8618 via check_function_arguments_recurse. */
8620 static void
8623 {
8624 /* Just skip checking the argument if it's not a pointer. This can
8625 happen if the "nonnull" attribute was given without an operand
8626 list (which means to check every pointer argument). */
8634 }
8636 /* Helper for nonnull attribute handling; fetch the operand number
8637 from the attribute argument list. */
8639 static bool
8641 {
8642 /* Verify the arg number is a constant. */
8649 }
8651 /* Handle a "nothrow" attribute; arguments as in
8652 struct attribute_spec.handler. */
8654 static tree
8657 {
8660 /* ??? TODO: Support types. */
8661 else
8662 {
8665 }
8668 }
8670 /* Handle a "cleanup" attribute; arguments as in
8671 struct attribute_spec.handler. */
8673 static tree
8676 {
8680 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
8681 for global destructors in C++. This requires infrastructure that
8682 we don't have generically at the moment. It's also not a feature
8683 we'd be missing too much, since we do have attribute constructor. */
8685 {
8689 }
8691 /* Verify that the argument is a function in scope. */
8692 /* ??? We could support pointers to functions here as well, if
8693 that was considered desirable. */
8696 {
8700 }
8703 {
8707 }
8709 /* That the function has proper type is checked with the
8710 eventual call to build_function_call. */
8713 }
8715 /* Handle a "warn_unused_result" attribute. No special handling. */
8717 static tree
8721 {
8722 /* Ignore the attribute for functions not returning any value. */
8724 {
8727 }
8730 }
8732 /* Handle a "sentinel" attribute. */
8734 static tree
8737 {
8739 {
8743 }
8744 else
8745 {
8747 {
8751 }
8752 }
8755 {
8759 {
8763 }
8764 else
8765 {
8767 {
8771 }
8772 }
8773 }
8776 }
8778 /* Handle a "type_generic" attribute. */
8780 static tree
8784 {
8785 /* Ensure we have a function type. */
8788 /* Ensure we have a variadic function. */
8792 }
8794 /* Handle a "target" attribute. */
8796 static tree
8799 {
8800 /* Ensure we have a function type. */
8802 {
8805 }
8806 /* Do not strip invalid target attributes for targets which support function
8807 multiversioning as the target string is used to determine versioned
8808 functions. */
8810 flags)
8815 }
8817 /* Arguments being collected for optimization. */
8822 /* Inner function to convert a TREE_LIST to argv string to parse the optimize
8823 options in ARGS. ATTR_P is true if this is for attribute(optimize), and
8824 false for #pragma GCC optimize. */
8826 bool
8828 {
8836 tree ap;
8838 /* Build up argv vector. Just in case the string is stored away, use garbage
8839 collected strings. */
8844 {
8848 {
8852 }
8855 {
8856 /* Split string into multiple substrings. */
8864 {
8871 {
8875 }
8876 else
8877 {
8880 }
8884 /* If the user supplied -Oxxx or -fxxx, only allow -Oxxx or -fxxx
8885 options. */
8887 {
8892 else
8896 }
8899 {
8902 /* Assume that Ox is -Ox, a numeric value is -Ox, a s by
8903 itself is -Os, and any other switch begins with a -f. */
8909 }
8914 }
8916 }
8917 }
8927 /* Now parse the options. */
8937 /* Don't allow changing -fstrict-aliasing. */
8942 }
8944 /* For handling "optimize" attribute. arguments as in
8945 struct attribute_spec.handler. */
8947 static tree
8950 {
8951 /* Ensure we have a function type. */
8953 {
8956 }
8957 else
8958 {
8962 /* Save current options. */
8965 /* If we previously had some optimization options, use them as the
8966 default. */
8971 /* Parse options, and update the vector. */
8976 /* Restore current options. */
8978 }
8981 }
8983 /* Handle a "no_split_stack" attribute. */
8985 static tree
8990 {
8994 {
8998 }
9000 {
9004 }
9007 }
9008 \f
9009 /* Check for valid arguments being passed to a function with FNTYPE.
9010 There are NARGS arguments in the array ARGARRAY. */
9011 void
9013 {
9014 /* Check for null being passed in a pointer argument that must be
9015 non-null. We also need to do this if format checking is enabled. */
9020 /* Check for errors in format strings. */
9027 }
9029 /* Generic argument checking recursion routine. PARAM is the argument to
9030 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
9031 once the argument is resolved. CTX is context for the callback. */
9032 void
9037 {
9041 {
9042 /* Strip coercion. */
9046 }
9049 {
9051 tree attrs;
9054 /* See if this is a call to a known internationalization function
9055 that modifies a format arg. Such a function may have multiple
9056 format_arg attributes (for example, ngettext). */
9059 attrs;
9062 {
9063 tree inner_arg;
9064 tree format_num_expr;
9067 call_expr_arg_iterator iter;
9069 /* Extract the argument number, which was previously checked
9070 to be valid. */
9082 {
9087 }
9088 }
9090 /* If we found a format_arg attribute and did a recursive check,
9091 we are done with checking this argument. Otherwise, we continue
9092 and this will be considered a non-literal. */
9095 }
9098 {
9099 /* Check both halves of the conditional expression. */
9105 }
9108 }
9110 /* Checks for a builtin function FNDECL that the number of arguments
9111 NARGS against the required number REQUIRED and issues an error if
9112 there is a mismatch. Returns true if the number of arguments is
9113 correct, otherwise false. */
9115 static bool
9117 {
9119 {
9123 }
9125 {
9129 }
9131 }
9133 /* Verifies the NARGS arguments ARGS to the builtin function FNDECL.
9134 Returns false if there was an error, otherwise true. */
9136 bool
9138 {
9144 {
9154 {
9156 {
9160 }
9162 }
9172 {
9179 {
9183 }
9185 }
9190 {
9195 {
9199 }
9202 {
9204 fndecl);
9206 }
9208 }
9213 {
9215 {
9218 }
9220 }
9225 }
9226 }
9228 /* Function to help qsort sort FIELD_DECLs by name order. */
9230 int
9232 {
9237 /* A nontype is "greater" than a type. */
9246 }
9249 gt_pointer_operator new_value;
9253 /* This routine compares two fields like field_decl_cmp but using the
9254 pointer operator in resort_data. */
9256 static int
9258 {
9263 /* A nontype is "greater" than a type. */
9269 {
9276 }
9278 }
9280 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
9282 void
9285 gt_pointer_operator new_value,
9287 {
9292 resort_field_decl_cmp);
9293 }
9295 /* Subroutine of c_parse_error.
9296 Return the result of concatenating LHS and RHS. RHS is really
9297 a string literal, its first character is indicated by RHS_START and
9298 RHS_SIZE is its length (including the terminating NUL character).
9300 The caller is responsible for deleting the returned pointer. */
9304 {
9310 }
9312 /* Issue the error given by GMSGID, indicating that it occurred before
9313 TOKEN, which had the associated VALUE. */
9315 void
9318 {
9319 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
9329 {
9334 {
9347 }
9351 else
9357 }
9367 {
9372 }
9380 {
9385 }
9386 else
9390 {
9393 }
9394 #undef catenate_messages
9395 }
9397 /* Mapping for cpp message reasons to the options that enable them. */
9399 struct reason_option_codes_t
9400 {
9403 };
9423 };
9425 /* Return the gcc option code associated with the reason for a cpp
9426 message, or 0 if none. */
9428 static int
9430 {
9434 {
9437 }
9439 }
9441 /* Callback from cpp_error for PFILE to print diagnostics from the
9442 preprocessor. The diagnostic is of type LEVEL, with REASON set
9443 to the reason code if LEVEL is represents a warning, at location
9444 LOCATION unless this is after lexing and the compiler's location
9445 should be used instead, with column number possibly overridden by
9446 COLUMN_OVERRIDE if not zero; MSG is the translated message and AP
9447 the arguments. Returns true if a diagnostic was emitted, false
9448 otherwise. */
9450 bool
9454 {
9455 diagnostic_info diagnostic;
9456 diagnostic_t dlevel;
9461 {
9466 /* Fall through. */
9491 }
9504 }
9506 /* Convert a character from the host to the target execution character
9507 set. cpplib handles this, mostly. */
9509 HOST_WIDE_INT
9511 {
9512 /* Character constants in GCC proper are sign-extended under -fsigned-char,
9513 zero-extended under -fno-signed-char. cpplib insists that characters
9514 and character constants are always unsigned. Hence we must convert
9515 back and forth. */
9523 else
9525 }
9527 /* Fold an offsetof-like expression. EXPR is a nested sequence of component
9528 references with an INDIRECT_REF of a constant at the bottom; much like the
9529 traditional rendering of offsetof as a macro. Return the folded result. */
9531 tree
9533 {
9537 {
9553 {
9556 }
9566 {
9570 }
9584 /* Check if the offset goes beyond the upper bound of the array. */
9586 {
9592 {
9596 {
9597 tree v;
9604 {
9612 }
9613 /* Don't warn if the array might be considered a poor
9614 man's flexible array member with a very permissive
9615 definition thereof. */
9619 "index %E denotes an offset "
9622 }
9623 }
9624 }
9631 /* Handle static members of volatile structs. */
9638 }
9641 }
9643 /* Likewise, but convert it to the return type of offsetof. */
9645 tree
9647 {
9649 }
9651 /* Warn for A ?: C expressions (with B omitted) where A is a boolean
9652 expression, because B will always be true. */
9654 void
9656 {
9659 "the omitted middle operand in ?: will always be %<true%>, "
9661 }
9663 /* Give an error for storing into ARG, which is 'const'. USE indicates
9664 how ARG was being used. */
9666 void
9668 {
9671 /* Using this macro rather than (for example) arrays of messages
9672 ensures that all the format strings are checked at compile
9673 time. */
9674 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
9675 : (use == lv_increment ? (I) \
9676 : (use == lv_decrement ? (D) : (AS))))
9678 {
9689 else
9695 }
9701 arg);
9707 arg);
9709 {
9719 arg);
9720 }
9726 arg);
9727 else
9732 arg);
9733 }
9735 /* Print an error message for an invalid lvalue. USE says
9736 how the lvalue is being used and so selects the error message. LOC
9737 is the location for the error. */
9739 void
9741 {
9743 {
9761 }
9762 }
9764 /* Print an error message for an invalid indirection of type TYPE.
9765 ERRSTRING is the name of the operator for the indirection. */
9767 void
9769 {
9771 {
9779 type);
9784 type);
9789 type);
9794 type);
9798 }
9799 }
9800 \f
9801 /* *PTYPE is an incomplete array. Complete it with a domain based on
9802 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
9803 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
9804 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
9806 int
9808 {
9815 {
9817 {
9818 int eltsize
9821 }
9823 {
9827 {
9831 }
9832 else
9833 {
9834 tree curindex;
9845 {
9849 else
9850 {
9854 size_one_node);
9855 }
9858 }
9861 }
9862 }
9863 else
9864 {
9865 /* Make an error message unless that happened already. */
9868 }
9869 }
9870 else
9871 {
9875 }
9878 /* Force an indefinite layout factor. */
9885 else
9888 /* Using build_distinct_type_copy and modifying things afterward instead
9889 of using build_array_type to create a new type preserves all of the
9890 TYPE_LANG_FLAG_? bits that the front end may have set. */
9898 /* Make sure we have the canonical MAIN_TYPE. */
9901 hashcode);
9904 /* Fix the canonical type. */
9914 else
9919 else
9925 {
9927 /* If we proceed with the array type as it is, we'll eventually
9928 crash in tree_low_cst(). */
9930 }
9934 }
9936 /* Like c_mark_addressable but don't check register qualifier. */
9937 void
9939 {
9945 }
9948 \f
9949 /* Used to help initialize the builtin-types.def table. When a type of
9950 the correct size doesn't exist, use error_mark_node instead of NULL.
9951 The later results in segfaults even when a decl using the type doesn't
9952 get invoked. */
9954 tree
9956 {
9959 }
9961 /* A helper function for resolve_overloaded_builtin in resolving the
9962 overloaded __sync_ builtins. Returns a positive power of 2 if the
9963 first operand of PARAMS is a pointer to a supported data type.
9964 Returns 0 if an error is encountered. */
9966 static int
9968 {
9969 tree type;
9973 {
9976 }
9990 incompatible:
9993 }
9995 /* A helper function for resolve_overloaded_builtin. Adds casts to
9996 PARAMS to make arguments match up with those of FUNCTION. Drops
9997 the variadic arguments at the end. Returns false if some error
9998 was encountered; true on success. */
10000 static bool
10003 {
10004 function_args_iterator iter;
10005 tree ptype;
10009 /* We've declared the implementation functions to use "volatile void *"
10010 as the pointer parameter, so we shouldn't get any complaints from the
10011 call to check_function_arguments what ever type the user used. */
10015 /* For the rest of the values, we need to cast these to FTYPE, so that we
10016 don't get warnings for passing pointer types, etc. */
10019 {
10023 /* XXX void_type_node belies the abstraction. */
10029 {
10032 }
10034 /* Only convert parameters if arg_type is unsigned integer type with
10035 new format sync routines, i.e. don't attempt to convert pointer
10036 arguments (e.g. EXPECTED argument of __atomic_compare_exchange_n),
10037 bool arguments (e.g. WEAK argument) or signed int arguments (memmodel
10038 kinds). */
10040 {
10041 /* Ideally for the first conversion we'd use convert_for_assignment
10042 so that we get warnings for anything that doesn't match the pointer
10043 type. This isn't portable across the C and C++ front ends atm. */
10048 }
10051 }
10053 /* __atomic routines are not variadic. */
10055 {
10058 }
10060 /* The definition of these primitives is variadic, with the remaining
10061 being "an optional list of variables protected by the memory barrier".
10062 No clue what that's supposed to mean, precisely, but we consider all
10063 call-clobbered variables to be protected so we're safe. */
10067 }
10069 /* A helper function for resolve_overloaded_builtin. Adds a cast to
10070 RESULT to make it match the type of the first pointer argument in
10071 PARAMS. */
10073 static tree
10075 {
10080 /* New format doesn't require casting unless the types are the same size. */
10083 else
10085 }
10087 /* This function verifies the PARAMS to generic atomic FUNCTION.
10088 It returns the size if all the parameters are the same size, otherwise
10089 0 is returned if the parameters are invalid. */
10091 static int
10094 {
10099 tree type_0;
10101 /* Determine the parameter makeup. */
10103 {
10119 }
10122 {
10125 }
10127 /* Get type of first parameter, and determine its size. */
10130 {
10132 function);
10134 }
10136 /* Types must be compile time constant sizes. */
10138 {
10141 function);
10143 }
10147 /* Zero size objects are not allowed. */
10149 {
10152 function);
10154 }
10156 /* Check each other parameter is a pointer and the same size. */
10158 {
10161 /* __atomic_compare_exchange has a bool in the 4th postion, skip it. */
10165 {
10167 function);
10169 }
10172 {
10174 function);
10176 }
10177 }
10179 /* Check memory model parameters for validity. */
10181 {
10184 {
10187 {
10190 function);
10191 }
10192 }
10193 else
10195 {
10197 function);
10199 }
10200 }
10203 }
10206 /* This will take an __atomic_ generic FUNCTION call, and add a size parameter N
10207 at the beginning of the parameter list PARAMS representing the size of the
10208 objects. This is to match the library ABI requirement. LOC is the location
10209 of the function call.
10210 The new function is returned if it needed rebuilding, otherwise NULL_TREE is
10211 returned to allow the external call to be constructed. */
10213 static tree
10216 {
10217 tree size_node;
10219 /* Insert a SIZE_T parameter as the first param. If there isn't
10220 enough space, allocate a new vector and recursively re-build with that. */
10222 {
10225 tree f;
10234 }
10236 /* Add the size parameter and leave as a function call for processing. */
10240 }
10243 /* This will process an __atomic_exchange function call, determine whether it
10244 needs to be mapped to the _N variation, or turned into a library call.
10245 LOC is the location of the builtin call.
10246 FUNCTION is the DECL that has been invoked;
10247 PARAMS is the argument list for the call. The return value is non-null
10248 TRUE is returned if it is translated into the proper format for a call to the
10249 external library, and NEW_RETURN is set the tree for that function.
10250 FALSE is returned if processing for the _N variation is required, and
10251 NEW_RETURN is set to the the return value the result is copied into. */
10252 static bool
10255 {
10260 /* Size of 0 is an error condition. */
10262 {
10265 }
10267 /* If not a lock-free size, change to the library generic format. */
10269 {
10272 }
10274 /* Otherwise there is a lockfree match, transform the call from:
10275 void fn(T* mem, T* desired, T* return, model)
10276 into
10277 *return = (T) (fn (In* mem, (In) *desired, model)) */
10284 /* Create pointer to appropriate size. */
10288 /* Convert object pointer to required type. */
10291 /* Convert new value to required type, and dereference it. */
10296 /* Move memory model to the 3rd position, and end param list. */
10300 /* Convert return pointer and dereference it for later assignment. */
10304 }
10307 /* This will process an __atomic_compare_exchange function call, determine
10308 whether it needs to be mapped to the _N variation, or turned into a lib call.
10309 LOC is the location of the builtin call.
10310 FUNCTION is the DECL that has been invoked;
10311 PARAMS is the argument list for the call. The return value is non-null
10312 TRUE is returned if it is translated into the proper format for a call to the
10313 external library, and NEW_RETURN is set the tree for that function.
10314 FALSE is returned if processing for the _N variation is required. */
10316 static bool
10320 {
10325 /* Size of 0 is an error condition. */
10327 {
10330 }
10332 /* If not a lock-free size, change to the library generic format. */
10334 {
10335 /* The library generic format does not have the weak parameter, so
10336 remove it from the param list. Since a parameter has been removed,
10337 we can be sure that there is room for the SIZE_T parameter, meaning
10338 there will not be a recursive rebuilding of the parameter list, so
10339 there is no danger this will be done twice. */
10341 {
10345 }
10348 }
10350 /* Otherwise, there is a match, so the call needs to be transformed from:
10351 bool fn(T* mem, T* desired, T* return, weak, success, failure)
10352 into
10353 bool fn ((In *)mem, (In *)expected, (In) *desired, weak, succ, fail) */
10359 /* Create pointer to appropriate size. */
10363 /* Convert object pointer to required type. */
10367 /* Convert expected pointer to required type. */
10371 /* Convert desired value to required type, and dereference it. */
10376 /* The rest of the parameters are fine. NULL means no special return value
10377 processing.*/
10380 }
10383 /* This will process an __atomic_load function call, determine whether it
10384 needs to be mapped to the _N variation, or turned into a library call.
10385 LOC is the location of the builtin call.
10386 FUNCTION is the DECL that has been invoked;
10387 PARAMS is the argument list for the call. The return value is non-null
10388 TRUE is returned if it is translated into the proper format for a call to the
10389 external library, and NEW_RETURN is set the tree for that function.
10390 FALSE is returned if processing for the _N variation is required, and
10391 NEW_RETURN is set to the the return value the result is copied into. */
10393 static bool
10396 {
10401 /* Size of 0 is an error condition. */
10403 {
10406 }
10408 /* If not a lock-free size, change to the library generic format. */
10410 {
10413 }
10415 /* Otherwise, there is a match, so the call needs to be transformed from:
10416 void fn(T* mem, T* return, model)
10417 into
10418 *return = (T) (fn ((In *) mem, model)) */
10424 /* Create pointer to appropriate size. */
10428 /* Convert object pointer to required type. */
10432 /* Move memory model to the 2nd position, and end param list. */
10436 /* Convert return pointer and dereference it for later assignment. */
10440 }
10443 /* This will process an __atomic_store function call, determine whether it
10444 needs to be mapped to the _N variation, or turned into a library call.
10445 LOC is the location of the builtin call.
10446 FUNCTION is the DECL that has been invoked;
10447 PARAMS is the argument list for the call. The return value is non-null
10448 TRUE is returned if it is translated into the proper format for a call to the
10449 external library, and NEW_RETURN is set the tree for that function.
10450 FALSE is returned if processing for the _N variation is required, and
10451 NEW_RETURN is set to the the return value the result is copied into. */
10453 static bool
10456 {
10461 /* Size of 0 is an error condition. */
10463 {
10466 }
10468 /* If not a lock-free size, change to the library generic format. */
10470 {
10473 }
10475 /* Otherwise, there is a match, so the call needs to be transformed from:
10476 void fn(T* mem, T* value, model)
10477 into
10478 fn ((In *) mem, (In) *value, model) */
10483 /* Create pointer to appropriate size. */
10487 /* Convert object pointer to required type. */
10491 /* Convert new value to required type, and dereference it. */
10496 /* The memory model is in the right spot already. Return is void. */
10500 }
10503 /* Some builtin functions are placeholders for other expressions. This
10504 function should be called immediately after parsing the call expression
10505 before surrounding code has committed to the type of the expression.
10507 LOC is the location of the builtin call.
10509 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
10510 PARAMS is the argument list for the call. The return value is non-null
10511 when expansion is complete, and null if normal processing should
10512 continue. */
10514 tree
10517 {
10523 {
10529 else
10533 }
10535 /* Handle BUILT_IN_NORMAL here. */
10537 {
10542 {
10543 /* Handle these 4 together so that they can fall through to the next
10544 case if the call is transformed to an _N variant. */
10546 {
10548 {
10552 /* Change to the _N variant. */
10555 }
10558 {
10560 params,
10563 /* Change to the _N variant. */
10566 }
10568 {
10572 /* Change to the _N variant. */
10575 }
10577 {
10581 /* Change to the _N variant. */
10584 }
10587 }
10588 /* Fallthrough to the normal processing. */
10589 }
10606 {
10608 /* Fallthru for parameter processing. */
10609 }
10626 {
10637 orig_format))
10649 /* If new_return is set, assign function to that expr and cast the
10650 result to void since the generic interface returned void. */
10652 {
10653 /* Cast function result from I{1,2,4,8,16} to the required type. */
10656 result);
10660 }
10662 }
10666 }
10667 }
10669 /* Ignoring their sign, return true if two scalar types are the same. */
10670 bool
10672 {
10679 /* Equality works here because c_common_signed_type uses
10680 TYPE_MAIN_VARIANT. */
10683 }
10685 /* Check for missing format attributes on function pointers. LTYPE is
10686 the new type or left-hand side type. RTYPE is the old type or
10687 right-hand side type. Returns TRUE if LTYPE is missing the desired
10688 attribute. */
10690 bool
10692 {
10694 tree ra;
10700 {
10701 tree la;
10706 }
10707 else
10709 }
10711 /* Subscripting with type char is likely to lose on a machine where
10712 chars are signed. So warn on any machine, but optionally. Don't
10713 warn for unsigned char since that type is safe. Don't warn for
10714 signed char because anyone who uses that must have done so
10715 deliberately. Furthermore, we reduce the false positive load by
10716 warning only for non-constant value of type char. */
10718 void
10720 {
10724 }
10726 /* Implement -Wparentheses for the unexpected C precedence rules, to
10727 cover cases like x + y << z which readers are likely to
10728 misinterpret. We have seen an expression in which CODE is a binary
10729 operator used to combine expressions ARG_LEFT and ARG_RIGHT, which
10730 before folding had CODE_LEFT and CODE_RIGHT. CODE_LEFT and
10731 CODE_RIGHT may be ERROR_MARK, which means that that side of the
10732 expression was not formed using a binary or unary operator, or it
10733 was enclosed in parentheses. */
10735 void
10739 {
10743 /* This macro tests that the expression ARG with original tree code
10744 CODE appears to be a boolean expression. or the result of folding a
10745 boolean expression. */
10746 #define APPEARS_TO_BE_BOOLEAN_EXPR_P(CODE, ARG) \
10747 (truth_value_p (TREE_CODE (ARG)) \
10748 || TREE_CODE (TREE_TYPE (ARG)) == BOOLEAN_TYPE \
10750 || ((CODE) != INTEGER_CST \
10751 && (integer_onep (ARG) || integer_zerop (ARG))))
10754 {
10803 /* Check cases like x|y==z */
10810 /* Check cases like !x | y */
10814 "suggest parentheses around operand of "
10827 /* Check cases like x^y==z */
10849 /* Check cases like x&y==z */
10856 /* Check cases like !x & y */
10860 "suggest parentheses around operand of "
10883 {
10888 "comparisons like %<X<=Y<=Z%> do not "
10894 "comparisons like %<X<=Y<=Z%> do not "
10896 }
10898 }
10899 #undef NOT_A_BOOLEAN_EXPR_P
10900 }
10902 /* If LABEL (a LABEL_DECL) has not been used, issue a warning. */
10904 void
10906 {
10908 {
10911 else
10913 }
10914 }
10916 /* Warn for division by zero according to the value of DIVISOR. LOC
10917 is the location of the division operator. */
10919 void
10921 {
10922 /* If DIVISOR is zero, and has integral or fixed-point type, issue a warning
10923 about division by zero. Do not issue a warning if DIVISOR has a
10924 floating-point type, since we consider 0.0/0.0 a valid way of
10925 generating a NaN. */
10929 }
10931 /* Subroutine of build_binary_op. Give warnings for comparisons
10932 between signed and unsigned quantities that may fail. Do the
10933 checking based on the original operand trees ORIG_OP0 and ORIG_OP1,
10934 so that casts will be considered, but default promotions won't
10935 be.
10937 LOCATION is the location of the comparison operator.
10939 The arguments of this function map directly to local variables
10940 of build_binary_op. */
10942 void
10947 {
10952 /* In C++, check for comparison of different enum types. */
10958 {
10962 }
10964 /* Do not warn if the comparison is being done in a signed type,
10965 since the signed type will only be chosen if it can represent
10966 all the values of the unsigned type. */
10969 /* Do not warn if both operands are unsigned. */
10972 else
10973 {
10979 else
10987 /* Do not warn if the signed quantity is an unsuffixed integer
10988 literal (or some static constant expression involving such
10989 literals or a conditional expression involving such literals)
10990 and it is non-negative. */
10993 /* Do not warn if the comparison is an equality operation, the
10994 unsigned quantity is an integral constant, and it would fit
10995 in the result if the result were signed. */
11000 /* In C, do not warn if the unsigned quantity is an enumeration
11001 constant and its maximum value would fit in the result if the
11002 result were signed. */
11008 else
11010 OPT_Wsign_compare,
11012 }
11014 /* Warn if two unsigned values are being compared in a size larger
11015 than their original size, and one (and only one) is the result of
11016 a `~' operator. This comparison will always fail.
11018 Also warn if one operand is a constant, and the constant does not
11019 have all bits set that are set in the ~ operand when it is
11020 extended. */
11027 {
11034 {
11035 tree primop;
11041 {
11045 }
11046 else
11047 {
11051 }
11056 {
11059 {
11063 else
11066 }
11067 }
11068 }
11076 }
11077 }
11079 /* RESULT_TYPE is the result of converting TYPE1 and TYPE2 to a common
11080 type via c_common_type. If -Wdouble-promotion is in use, and the
11081 conditions for warning have been met, issue a warning. GMSGID is
11082 the warning message. It must have two %T specifiers for the type
11083 that was converted (generally "float") and the type to which it was
11084 converted (generally "double), respectively. LOC is the location
11085 to which the awrning should refer. */
11087 void
11090 {
11091 tree source_type;
11095 /* If the conversion will not occur at run-time, there is no need to
11096 warn about it. */
11108 else
11111 }
11113 /* Setup a TYPE_DECL node as a typedef representation.
11115 X is a TYPE_DECL for a typedef statement. Create a brand new
11116 ..._TYPE node (which will be just a variant of the existing
11117 ..._TYPE node with identical properties) and then install X
11118 as the TYPE_NAME of this brand new (duplicate) ..._TYPE node.
11120 The whole point here is to end up with a situation where each
11121 and every ..._TYPE node the compiler creates will be uniquely
11122 associated with AT MOST one node representing a typedef name.
11123 This way, even though the compiler substitutes corresponding
11124 ..._TYPE nodes for TYPE_DECL (i.e. "typedef name") nodes very
11125 early on, later parts of the compiler can always do the reverse
11126 translation and get back the corresponding typedef name. For
11127 example, given:
11129 typedef struct S MY_TYPE;
11130 MY_TYPE object;
11132 Later parts of the compiler might only know that `object' was of
11133 type `struct S' if it were not for code just below. With this
11134 code however, later parts of the compiler see something like:
11136 struct S' == struct S
11137 typedef struct S' MY_TYPE;
11138 struct S' object;
11140 And they can then deduce (from the node for type struct S') that
11141 the original object declaration was:
11143 MY_TYPE object;
11145 Being able to do this is important for proper support of protoize,
11146 and also for generating precise symbolic debugging information
11147 which takes full account of the programmer's (typedef) vocabulary.
11149 Obviously, we don't want to generate a duplicate ..._TYPE node if
11150 the TYPE_DECL node that we are now processing really represents a
11151 standard built-in type. */
11153 void
11155 {
11159 {
11162 }
11165 {
11173 }
11174 }
11176 /* Record the types used by the current global variable declaration
11177 being parsed, so that we can decide later to emit their debug info.
11178 Those types are in types_used_by_cur_var_decl, and we are going to
11179 store them in the types_used_by_vars_hash hash table.
11180 DECL is the declaration of the global variable that has been parsed. */
11182 void
11184 {
11188 {
11191 }
11192 }
11194 /* If DECL is a typedef that is declared in the current function,
11195 record it for the purpose of -Wunused-local-typedefs. */
11197 void
11199 {
11204 /* if this is not a locally defined typedef then we are not
11205 interested. */
11212 }
11214 /* If T is a TYPE_DECL declared locally, mark it as used. */
11216 void
11218 {
11223 }
11225 /* Warn if there are some unused locally defined typedefs in the
11226 current function. */
11228 void
11230 {
11232 tree decl;
11233 /* The number of times we have emitted -Wunused-local-typedefs
11234 warnings. If this is different from errorcount, that means some
11235 unrelated errors have been issued. In which case, we'll avoid
11236 emitting "unused-local-typedefs" warnings. */
11248 {
11252 OPT_Wunused_local_typedefs,
11255 }
11258 }
11260 /* The C and C++ parsers both use vectors to hold function arguments.
11261 For efficiency, we keep a cache of unused vectors. This is the
11262 cache. */
11267 /* Return a new vector from the cache. If the cache is empty,
11268 allocate a new vector. These vectors are GC'ed, so it is OK if the
11269 pointer is not released.. */
11273 {
11276 else
11277 {
11278 /* Passing 0 to vec::alloc returns NULL, and our callers require
11279 that we always return a non-NULL value. The vector code uses
11280 4 when growing a NULL vector, so we do too. */
11284 }
11285 }
11287 /* Release a vector of trees back to the cache. */
11289 void
11291 {
11293 {
11296 }
11297 }
11299 /* Get a new tree vector holding a single tree. */
11303 {
11307 }
11309 /* Get a new tree vector of the TREE_VALUEs of a TREE_LIST chain. */
11313 {
11318 }
11320 /* Get a new tree vector which is a copy of an existing one. */
11324 {
11327 tree t;
11334 }
11336 /* Return true if KEYWORD starts a type specifier. */
11338 bool
11340 {
11342 {
11372 }
11373 }
11375 /* Return true if KEYWORD names a type qualifier. */
11377 bool
11379 {
11381 {
11388 }
11389 }
11391 /* Return true if KEYWORD names a storage class specifier.
11393 RID_TYPEDEF is not included in this list despite `typedef' being
11394 listed in C99 6.7.1.1. 6.7.1.3 indicates that `typedef' is listed as
11395 such for syntactic convenience only. */
11397 bool
11399 {
11401 {
11411 }
11412 }
11414 /* Return true if KEYWORD names a function-specifier [dcl.fct.spec]. */
11416 static bool
11418 {
11420 {
11428 }
11429 }
11431 /* Return true if KEYWORD names a decl-specifier [dcl.spec] or a
11432 declaration-specifier (C99 6.7). */
11434 bool
11436 {
11443 {
11450 }
11451 }
11453 /* Initialize language-specific-bits of tree_contains_struct. */
11455 void
11457 {
11460 }
11462 /* Build a user-defined numeric literal out of an integer constant type VALUE
11463 with identifier SUFFIX. */
11465 tree
11468 {
11475 }
11477 /* For vector[index], convert the vector to a
11478 pointer of the underlying type. */
11479 void
11482 {
11484 {
11486 tree type1;
11500 }
11501 }
11503 /* Determine which of the operands, if any, is a scalar that needs to be
11504 converted to a vector, for the range of operations. */
11505 enum stv_conv
11508 {
11517 {
11518 /* Most GENERIC binary expressions require homogeneous arguments.
11519 LSHIFT_EXPR and RSHIFT_EXPR are exceptions and accept a first
11520 argument that is a vector and a second one that is a scalar, so
11521 we never return stv_secondarg for them. */
11526 {
11528 {
11533 }
11534 else
11536 }
11543 /* ... fall through ... */
11564 /* What about UNLT_EXPR? */
11566 {
11567 tree tmp;
11569 /* Swap TYPE0 with TYPE1 and OP0 with OP1 */
11572 }
11576 {
11578 {
11583 }
11585 }
11587 /* Allow integer --> real conversion if safe. */
11591 {
11593 {
11598 }
11600 }
11603 }
11606 }
11608 /* Return true iff ALIGN is an integral constant that is a fundamental
11609 alignment, as defined by [basic.align] in the c++-11
11610 specifications.
11612 That is:
11614 [A fundamental alignment is represented by an alignment less than or
11615 equal to the greatest alignment supported by the implementation
11616 in all contexts, which is equal to
11617 alignof(max_align_t)]. */
11619 bool
11621 {
11624 }