| blob | fd521e6552bb929a049194c5b7a99187f326a7f0 |
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 -fupc-pthreads-per-process-N switch tells the UPC compiler
206 and runtime to map N UPC threads per process onto
207 N POSIX threads running inside the process. */
210 /* The implementation model for UPC threads that
211 are mapped to POSIX threads, specified at compilation
212 time by the -fupc-pthreads-model-* switch. */
213 upc_pthreads_model_kind upc_pthreads_model;
215 /* Warn about #pragma directives that are not recognized. */
219 /* Warn about format/argument anomalies in calls to formatted I/O functions
220 (*printf, *scanf, strftime, strfmon, etc.). */
224 /* C/ObjC language option variables. */
227 /* Nonzero means allow type mismatches in conditional expressions;
228 just make their values `void'. */
232 /* Nonzero means enable C89 Amendment 1 features. */
236 /* Nonzero means use the ISO C99 (or C11) dialect of C. */
240 /* Nonzero means use the ISO C11 dialect of C. */
244 /* Nonzero means that we have builtin functions, and main is an int. */
249 /* ObjC language option variables. */
252 /* Tells the compiler that this is a special run. Do not perform any
253 compiling, instead we are to test some platform dependent features
254 and output a C header file with appropriate definitions. */
258 /* Tells the compiler what is the constant string class for ObjC. */
263 /* C++ language option variables. */
266 /* Nonzero means generate separate instantiation control files and
267 juggle them at link time. */
271 /* The C++ dialect being used. C++98 is the default. */
275 /* Maximum template instantiation depth. This limit exists to limit the
276 time it takes to notice excessively recursive template instantiations.
278 The default is lower than the 1024 recommended by the C++0x standard
279 because G++ runs out of stack before 1024 with highly recursive template
280 argument deduction substitution (g++.dg/cpp0x/enum11.C). */
284 /* The elements of `ridpointers' are identifier nodes for the reserved
285 type names and storage classes. It is indexed by a RID_... value. */
290 /* Nonzero means don't warn about problems that occur when the code is
291 executed. */
294 /* Whether we are building a boolean conversion inside
295 convert_for_assignment, or some other late binary operation. If
296 build_binary_op is called for C (from code shared by C and C++) in
297 this case, then the operands have already been folded and the
298 result will not be folded again, so C_MAYBE_CONST_EXPR should not
299 be generated. */
302 /* Whether lexing has been completed, so subsequent preprocessor
303 errors should use the compiler's input_location. */
306 /* Information about how a function name is generated. */
307 struct fname_var_t
308 {
312 };
314 /* The three ways of getting then name of the current function. */
317 {
318 /* C99 compliant __func__, must be first. */
320 /* GCC __FUNCTION__ compliant. */
322 /* GCC __PRETTY_FUNCTION__ compliant. */
325 };
327 /* Global visibility options. */
404 /* Reserved words. The third field is a mask: keywords are disabled
405 if they match the mask.
407 Masks for languages:
408 C --std=c89: D_C99 | D_CXXONLY | D_OBJC | D_CXX_OBJC
409 C --std=c99: D_CXXONLY | D_OBJC
410 ObjC is like C except that D_OBJC and D_CXX_OBJC are not set
411 UPC is like C except that D_UPC is not set
412 C++ --std=c98: D_CONLY | D_CXXOX | D_OBJC | D_UPC
413 C++ --std=c0x: D_CONLY | D_OBJC | D_UPC
414 ObjC++ is like C++ except that D_OBJC is not set
416 If -fno-asm is used, D_ASM is added to the mask. If
417 -fno-gnu-keywords is used, D_EXT is added. If -fno-asm and C in
418 C89 mode, D_EXT89 is added for both -fno-asm and -fno-gnu-keywords.
419 In C with -Wc++-compat, we warn if D_CXXWARN is set.
421 Note the complication of the D_CXX_OBJC keywords. These are
422 reserved words such as 'class'. In C++, 'class' is a reserved
423 word. In Objective-C++ it is too. In Objective-C, it is a
424 reserved word too, but only if it follows an '@' sign.
425 */
427 {
580 /* These Objective-C keywords are recognized only immediately after
581 an '@'. */
598 /* These are recognized only in protocol-qualifier context
599 (see above) */
607 /* UPC keywords */
619 /* These are recognized inside a property attribute list */
628 };
633 /* Table of machine-independent attributes common to all C-like languages. */
635 {
636 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
637 affects_type_identity } */
644 /* FIXME: logically, noreturn attributes should be listed as
645 "false, true, true" and apply to function types. But implementing this
646 would require all the places in the compiler that use TREE_THIS_VOLATILE
647 on a decl to identify non-returning functions to be located and fixed
648 to check the function type instead. */
673 /* The same comments as for noreturn attributes apply to const ones. */
697 handle_no_instrument_function_attribute,
715 /* ??? These two attributes didn't make the transition from the
716 Intel language document to the multi-vendor language document. */
721 /* For internal use (marking of builtins) only. The name contains space
722 to prevent its usage in source code. */
744 /* For internal use (marking of builtins) only. The name contains space
745 to prevent its usage in source code. */
762 /* For internal use only. The leading '*' both prevents its usage in
763 source code and signals that it may be overridden by machine tables. */
768 /* For internal use (marking of builtins and runtime functions) only.
769 The name contains space to prevent its usage in source code. */
773 };
775 /* Give the specifications for the format attributes, used by C and all
776 descendants. */
779 {
780 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
781 affects_type_identity } */
787 };
789 /* Return identifier for address space AS. */
793 {
797 }
799 /* Push current bindings for the function name VAR_DECLS. */
801 void
803 {
808 {
812 {
814 saved);
816 }
817 }
819 /* Normally they'll have been NULL, so only push if we've got a
820 stack, or they are non-NULL. */
822 saved_function_name_decls);
823 }
825 /* Finish up the current bindings, adding them into the current function's
826 statement tree. This must be done _before_ finish_stmt_tree is called.
827 If there is no current function, we must be at file scope and no statements
828 are involved. Pop the previous bindings. */
830 void
832 {
841 {
849 }
855 {
856 /* We had saved values, restore them. */
857 tree saved;
860 {
865 }
867 }
869 }
871 /* Return the text name of the current function, suitably prettified
872 by PRETTY_P. Return string must be freed by caller. */
876 {
883 {
886 }
899 {
902 }
905 }
907 /* Return the VAR_DECL for a const char array naming the current
908 function. If the VAR_DECL has not yet been created, create it
909 now. RID indicates how it should be formatted and IDENTIFIER_NODE
910 ID is its name (unfortunately C and C++ hold the RID values of
911 keywords in different places, so we can't derive RID from ID in
912 this language independent code. LOC is the location of the
913 function. */
915 tree
917 {
927 {
928 /* If a tree is built here, it would normally have the lineno of
929 the current statement. Later this tree will be moved to the
930 beginning of the function and this line number will be wrong.
931 To avoid this problem set the lineno to 0 here; that prevents
932 it from appearing in the RTL. */
933 tree stmts;
941 saved_function_name_decls
945 }
950 }
952 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
954 tree
956 {
961 /* Compute the number of elements, for the array type. */
963 {
966 }
968 {
971 }
973 {
976 }
977 else
978 {
981 }
983 /* C89 2.2.4.1, C99 5.2.4.1 (Translation limits). The analogous
984 limit in C++98 Annex B is very large (65536) and is not normative,
985 so we do not diagnose it (warn_overlength_strings is forced off
986 in c_common_post_options). */
988 {
992 /* Translators: The %d after 'ISO C' will be 90 or 99. Do not
993 separate the %d from the 'C'. 'ISO' should not be
994 translated, but it may be moved after 'C%d' in languages
995 where modifiers follow nouns. */
997 "string length %qd is greater than the length %qd "
1000 }
1002 /* Create the array type for the string constant. The ISO C++
1003 standard says that a string literal has type `const char[N]' or
1004 `const wchar_t[N]'. We use the same logic when invoked as a C
1005 front-end with -Wwrite-strings.
1006 ??? We should change the type of an expression depending on the
1007 state of a warning flag. We should just be warning -- see how
1008 this is handled in the C++ front-end for the deprecated implicit
1009 conversion from string literals to `char*' or `wchar_t*'.
1011 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
1012 array type being the unqualified version of that type.
1013 Therefore, if we are constructing an array of const char, we must
1014 construct the matching unqualified array type first. The C front
1015 end does not require this, but it does no harm, so we do it
1016 unconditionally. */
1027 }
1028 \f
1029 /* If DISABLE is true, stop issuing warnings. This is used when
1030 parsing code that we know will not be executed. This function may
1031 be called multiple times, and works as a stack. */
1033 static void
1035 {
1037 {
1040 }
1041 }
1043 /* If ENABLE is true, reenable issuing warnings. */
1045 static void
1047 {
1049 {
1052 }
1053 }
1055 /* Fully fold EXPR, an expression that was not folded (beyond integer
1056 constant expressions and null pointer constants) when being built
1057 up. If IN_INIT, this is in a static initializer and certain
1058 changes are made to the folding done. Clear *MAYBE_CONST if
1059 MAYBE_CONST is not NULL and EXPR is definitely not a constant
1060 expression because it contains an evaluated operator (in C99) or an
1061 operator outside of sizeof returning an integer constant (in C90)
1062 not permitted in constant expressions, or because it contains an
1063 evaluated arithmetic overflow. (*MAYBE_CONST should typically be
1064 set to true by callers before calling this function.) Return the
1065 folded expression. Function arguments have already been folded
1066 before calling this function, as have the contents of SAVE_EXPR,
1067 TARGET_EXPR, BIND_EXPR, VA_ARG_EXPR, OBJ_TYPE_REF and
1068 C_MAYBE_CONST_EXPR. */
1070 tree
1072 {
1073 tree ret;
1079 /* This function is not relevant to C++ because C++ folds while
1080 parsing, and may need changes to be correct for C++ when C++
1081 stops folding while parsing. */
1088 {
1091 }
1098 }
1100 /* Internal helper for c_fully_fold. EXPR and IN_INIT are as for
1101 c_fully_fold. *MAYBE_CONST_OPERANDS is cleared because of operands
1102 not permitted, while *MAYBE_CONST_ITSELF is cleared because of
1103 arithmetic overflow (for C90, *MAYBE_CONST_OPERANDS is carried from
1104 both evaluated and unevaluated subexpressions while
1105 *MAYBE_CONST_ITSELF is carried from only evaluated
1106 subexpressions). */
1108 static tree
1111 {
1123 /* This function is not relevant to C++ because C++ folds while
1124 parsing, and may need changes to be correct for C++ when C++
1125 stops folding while parsing. */
1129 /* Constants, declarations, statements, errors, SAVE_EXPRs and
1130 anything else not counted as an expression cannot usefully be
1131 folded further at this point. */
1137 /* Operands of variable-length expressions (function calls) have
1138 already been folded, as have __builtin_* function calls, and such
1139 expressions cannot occur in constant expressions. */
1141 {
1145 }
1148 {
1157 else
1160 }
1162 /* Assignment, increment, decrement, function call and comma
1163 operators, and statement expressions, cannot occur in constant
1164 expressions if evaluated / outside of sizeof. (Function calls
1165 were handled above, though VA_ARG_EXPR is treated like a function
1166 call here, and statement expressions are handled through
1167 C_MAYBE_CONST_EXPR to avoid folding inside them.) */
1169 {
1189 }
1191 /* Fold individual tree codes as appropriate. */
1193 {
1195 /* Any non-constancy will have been marked in a containing
1196 C_MAYBE_CONST_EXPR; there is no more folding to do here. */
1204 maybe_const_itself);
1209 {
1212 }
1221 maybe_const_itself);
1224 maybe_const_itself);
1230 {
1234 }
1276 /* Binary operations evaluating both arguments (increment and
1277 decrement are binary internally in GCC). */
1281 maybe_const_itself);
1289 /* The RHS of a MODIFY_EXPR was fully folded when building that
1290 expression for the sake of conversion warnings. */
1293 maybe_const_itself);
1297 ret = in_init
1300 else
1311 CASE_CONVERT:
1321 /* Unary operations. */
1324 maybe_const_itself);
1328 /* ??? Cope with user tricks that amount to offsetof. The middle-end is
1329 not prepared to deal with them if they occur in initializers.
1330 Avoid attempts to fold references to UPC shared components
1331 due to the complexities of UPC pointer-to-shared arithmetic. */
1340 ret = in_init
1343 else
1348 {
1352 }
1354 {
1357 CASE_CONVERT:
1358 /* Don't warn about explicit conversions. We will already
1359 have warned about suspect implicit conversions. */
1366 }
1371 /* Binary operations not necessarily evaluating both
1372 arguments. */
1379 ? truthvalue_false_node
1387 ret = in_init
1390 else
1395 && op0_const
1396 && op0_const_self
1402 && op0_const_self
1428 else
1433 && op0_const
1434 && op0_const_self
1438 && op0_const_self
1442 && op0_const
1443 && op0_const_self
1447 && op0_const_self
1453 /* Each case where an operand with excess precision may be
1454 encountered must remove the EXCESS_PRECISION_EXPR around
1455 inner operands and possibly put one around the whole
1456 expression or possibly convert to the semantic type (which
1457 c_fully_fold does); we cannot tell at this stage which is
1458 appropriate in any particular case. */
1462 /* Various codes may appear through folding built-in functions
1463 and their arguments. */
1465 }
1467 out:
1468 /* Some folding may introduce NON_LVALUE_EXPRs; all lvalue checks
1469 have been done by this point, so remove them again. */
1473 {
1477 }
1481 }
1483 /* If not optimizing, EXP is not a VAR_DECL, or EXP has array type,
1484 return EXP. Otherwise, return either EXP or its known constant
1485 value (if it has one), but return EXP if EXP has mode BLKmode. ???
1486 Is the BLKmode test appropriate? */
1488 tree
1490 {
1491 tree ret;
1493 /* This function is only used by C, for c_fully_fold and other
1494 optimization, and may not be correct for C++. */
1505 /* Avoid unwanted tree sharing between the initializer and current
1506 function's body where the tree can be modified e.g. by the
1507 gimplifier. */
1511 }
1513 /* Print a warning if a constant expression had overflow in folding.
1514 Invoke this function on every expression that the language
1515 requires to be a constant expression.
1516 Note the ANSI C standard says it is erroneous for a
1517 constant expression to overflow. */
1519 void
1521 {
1529 }
1531 /* The same as above but print an unconditional error. */
1532 void
1534 {
1541 }
1543 /* Print a warning if an expression had overflow in folding and its
1544 operands hadn't.
1546 Invoke this function on every expression that
1547 (1) appears in the source code, and
1548 (2) is a constant expression that overflowed, and
1549 (3) is not already checked by convert_and_check;
1550 however, do not invoke this function on operands of explicit casts
1551 or when the expression is the result of an operator and any operand
1552 already overflowed. */
1554 void
1556 {
1561 {
1590 }
1591 }
1593 /* Warn about uses of logical || / && operator in a context where it
1594 is likely that the bitwise equivalent was intended by the
1595 programmer. We have seen an expression in which CODE is a binary
1596 operator used to combine expressions OP_LEFT and OP_RIGHT, which before folding
1597 had CODE_LEFT and CODE_RIGHT, into an expression of type TYPE. */
1598 void
1602 {
1614 /* Warn if &&/|| are being used in a context where it is
1615 likely that the bitwise equivalent was intended by the
1616 programmer. That is, an expression such as op && MASK
1617 where op should not be any boolean expression, nor a
1618 constant, and mask seems to be a non-boolean integer constant. */
1626 {
1630 else
1635 }
1637 /* We do not warn for constants because they are typical of macro
1638 expansions that test for features. */
1642 /* This warning only makes sense with logical operands. */
1650 /* We first test whether either side separately is trivially true
1651 (with OR) or trivially false (with AND). If so, do not warn.
1652 This is a common idiom for testing ranges of data types in
1653 portable code. */
1660 /* If this is an OR operation, invert both sides; now, the result
1661 should be always false to get a warning. */
1675 /* If this is an OR operation, invert both sides; now, the result
1676 should be always false to get a warning. */
1684 /* If both expressions have the same operand, if we can merge the
1685 ranges, and if the range test is always false, then warn. */
1692 {
1695 "logical %<or%> "
1697 else
1699 "logical %<and%> "
1701 }
1702 }
1705 /* Warn if EXP contains any computations whose results are not used.
1706 Return true if a warning is printed; false otherwise. LOCUS is the
1707 (potential) location of the expression. */
1709 bool
1711 {
1712 restart:
1716 /* Don't warn about void constructs. This includes casting to void,
1717 void function calls, and statement expressions with a final cast
1718 to void. */
1726 {
1742 /* For a binding, warn if no side effect within it. */
1754 /* In && or ||, warn if 2nd operand has no side effect. */
1761 /* Let people do `(foo (), 0)' without a warning. */
1768 /* If this is an expression with side effects, don't warn; this
1769 case commonly appears in macro expansions. */
1775 /* Don't warn about automatic dereferencing of references, since
1776 the user cannot control it. */
1778 {
1781 }
1782 /* Fall through. */
1785 /* Referencing a volatile value is a side effect, so don't warn. */
1790 /* If this is an expression which has no operands, there is no value
1791 to be unused. There are no such language-independent codes,
1792 but front ends may define such. */
1796 warn:
1798 }
1799 }
1802 /* Print a warning about casts that might indicate violation
1803 of strict aliasing rules if -Wstrict-aliasing is used and
1804 strict aliasing mode is in effect. OTYPE is the original
1805 TREE_TYPE of EXPR, and TYPE the type we're casting to. */
1807 bool
1809 {
1810 /* Strip pointer conversion chains and get to the correct original type. */
1818 /* If the type we are casting to is a ref-all pointer
1819 dereferencing it is always valid. */
1826 {
1827 /* Casting the address of an object to non void pointer. Warn
1828 if the cast breaks type based aliasing. */
1830 {
1834 }
1835 else
1836 {
1837 /* warn_strict_aliasing >= 3. This includes the default (3).
1838 Only warn if the cast is dereferenced immediately. */
1839 alias_set_type set1 =
1845 {
1849 }
1852 {
1856 }
1857 }
1858 }
1859 else
1861 {
1862 /* At this level, warn for any conversions, even if an address is
1863 not taken in the same statement. This will likely produce many
1864 false positives, but could be useful to pinpoint problems that
1865 are not revealed at higher levels. */
1870 {
1874 }
1875 }
1878 }
1880 /* Warn about memset (&a, 0, sizeof (&a)); and similar mistakes with
1881 sizeof as last operand of certain builtins. */
1883 void
1887 {
1902 {
1908 /* FALLTHRU */
1928 }
1943 {
1947 {
1950 "argument to %<sizeof%> in %qD call is the same "
1951 "expression as the destination; did you mean to "
1957 "argument to %<sizeof%> in %qD call is the same "
1958 "expression as the destination; did you mean to "
1960 else
1962 "argument to %<sizeof%> in %qD call is the same "
1963 "expression as the destination; did you mean to "
1966 }
1969 && !strop
1972 {
1974 "argument to %<sizeof%> in %qD call is the same "
1975 "pointer type %qT as the destination; expected %qT "
1979 }
1980 }
1983 {
1987 {
1990 "argument to %<sizeof%> in %qD call is the same "
1991 "expression as the source; did you mean to "
1997 "argument to %<sizeof%> in %qD call is the same "
1998 "expression as the source; did you mean to "
2000 else
2002 "argument to %<sizeof%> in %qD call is the same "
2003 "expression as the source; did you mean to "
2006 }
2009 && !strop
2012 {
2014 "argument to %<sizeof%> in %qD call is the same "
2015 "pointer type %qT as the source; expected %qT "
2019 }
2020 }
2021 }
2023 /* Warn for unlikely, improbable, or stupid DECL declarations
2024 of `main'. */
2026 void
2028 {
2029 function_args_iterator iter;
2030 tree type;
2034 {
2035 /* XXX void_type_node belies the abstraction. */
2041 {
2063 "third argument of %q+D should probably be "
2066 }
2067 }
2069 /* It is intentional that this message does not mention the third
2070 argument because it's only mentioned in an appendix of the
2071 standard. */
2075 }
2077 /* True if pointers to distinct types T1 and T2 can be converted to
2078 each other without an explicit cast. Only returns true for opaque
2079 vector types. */
2080 bool
2082 {
2089 }
2091 /* True if vector types T1 and T2 can be converted to each other
2092 without an explicit cast. If EMIT_LAX_NOTE is true, and T1 and T2
2093 can only be converted with -flax-vector-conversions yet that is not
2094 in effect, emit a note telling the user about that option if such
2095 a note has not previously been emitted. */
2096 bool
2098 {
2106 convertible_lax =
2121 {
2124 "conversions between vectors with differing "
2126 }
2129 }
2131 /* Build a VEC_PERM_EXPR if V0, V1 and MASK are not error_mark_nodes
2132 and have vector types, V0 has the same type as V1, and the number of
2133 elements of V0, V1, MASK is the same.
2135 In case V1 is a NULL_TREE it is assumed that __builtin_shuffle was
2136 called with two arguments. In this case implementation passes the
2137 first argument twice in order to share the same tree code. This fact
2138 could enable the mask-values being twice the vector length. This is
2139 an implementation accident and this semantics is not guaranteed to
2140 the user. */
2141 tree
2143 {
2144 tree ret;
2150 {
2153 }
2161 {
2165 }
2169 {
2172 }
2175 {
2179 }
2185 {
2187 "argument vector(s) and the mask vector should "
2190 }
2194 {
2198 }
2201 {
2202 /* Avoid C_MAYBE_CONST_EXPRs inside VEC_PERM_EXPR. */
2208 else
2209 {
2212 }
2216 }
2224 }
2226 /* Like tree.c:get_narrower, but retain conversion from C++0x scoped enum
2227 to integral type. */
2229 static tree
2231 {
2236 {
2237 /* C++0x scoped enumerations don't implicitly convert to integral
2238 type; if we stripped an explicit conversion to a larger type we
2239 need to replace it so common_type will still work. */
2243 }
2245 }
2247 /* This is a helper function of build_binary_op.
2249 For certain operations if both args were extended from the same
2250 smaller type, do the arithmetic in that type and then extend.
2252 BITWISE indicates a bitwise operation.
2253 For them, this optimization is safe only if
2254 both args are zero-extended or both are sign-extended.
2255 Otherwise, we might change the result.
2256 Eg, (short)-1 | (unsigned short)-1 is (int)-1
2257 but calculated in (unsigned short) it would be (unsigned short)-1.
2258 */
2259 tree
2261 {
2265 tree type;
2267 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
2268 excessive narrowing when we call get_narrower below. For
2269 example, suppose that OP0 is of unsigned int extended
2270 from signed char and that RESULT_TYPE is long long int.
2271 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
2272 like
2274 (long long int) (unsigned int) signed_char
2276 which get_narrower would narrow down to
2278 (unsigned int) signed char
2280 If we do not cast OP0 first, get_narrower would return
2281 signed_char, which is inconsistent with the case of the
2282 explicit cast. */
2289 /* UNS is 1 if the operation to be done is an unsigned one. */
2292 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
2293 but it *requires* conversion to FINAL_TYPE. */
2304 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
2306 /* For bitwise operations, signedness of nominal type
2307 does not matter. Consider only how operands were extended. */
2311 /* Note that in all three cases below we refrain from optimizing
2312 an unsigned operation on sign-extended args.
2313 That would not be valid. */
2315 /* Both args variable: if both extended in same way
2316 from same width, do it in that width.
2317 Do it unsigned if args were zero-extended. */
2324 return c_common_signed_or_unsigned_type
2331 && (type
2342 && (type
2350 }
2352 /* Checks if expression EXPR of real/integer type cannot be converted
2353 to the real/integer type TYPE. Function returns true when:
2354 * EXPR is a constant which cannot be exactly converted to TYPE
2355 * EXPR is not a constant and size of EXPR's type > than size of TYPE,
2356 for EXPR type and TYPE being both integers or both real.
2357 * EXPR is not a constant of real type and TYPE is an integer.
2358 * EXPR is not a constant of integer type which cannot be
2359 exactly converted to real type.
2360 Function allows conversions between types of different signedness and
2361 does not return true in that case. Function can produce signedness
2362 warnings if PRODUCE_WARNS is true. */
2363 bool
2365 {
2371 {
2372 /* Warn for real constant that is not an exact integer converted
2373 to integer type. */
2376 {
2379 }
2380 /* Warn for an integer constant that does not fit into integer type. */
2384 {
2387 {
2391 }
2393 {
2397 }
2398 else
2400 }
2402 {
2403 /* Warn for an integer constant that does not fit into real type. */
2405 {
2409 }
2410 /* Warn for a real constant that does not fit into a smaller
2411 real type. */
2414 {
2418 }
2419 }
2420 }
2421 else
2422 {
2423 /* Warn for real types converted to integer types. */
2430 {
2431 /* Don't warn about unsigned char y = 0xff, x = (int) y; */
2435 /* Don't warn for short y; short x = ((int)y & 0xff); */
2439 {
2440 /* If both args were extended from a shortest type,
2441 use that type if that is safe. */
2448 {
2454 /* If one of the operands is a non-negative constant
2455 that fits in the target type, then the type of the
2456 other operand does not matter. */
2465 /* If constant is unsigned and fits in the target
2466 type, then the result will also fit. */
2468 && unsigned0
2471 && unsigned1
2474 }
2475 }
2476 /* Warn for integer types converted to smaller integer types. */
2480 /* When they are the same width but different signedness,
2481 then the value may change. */
2484 /* Even when converted to a bigger type, if the type is
2485 unsigned but expr is signed, then negative values
2486 will be changed. */
2492 }
2494 /* Warn for integer types converted to real types if and only if
2495 all the range of values of the integer type cannot be
2496 represented by the real type. */
2499 {
2503 /* Don't warn about char y = 0xff; float x = (int) y; */
2515 }
2517 /* Warn for real types converted to smaller real types. */
2522 }
2525 }
2527 /* Warns if the conversion of EXPR to TYPE may alter a value.
2528 This is a helper function for warnings_for_convert_and_check. */
2530 static void
2532 {
2540 {
2553 /* Conversion from boolean to a signed:1 bit-field (which only
2554 can hold the values 0 and -1) doesn't lose information - but
2555 it does change the value. */
2570 {
2571 /* In case of COND_EXPR, if both operands are constants or
2572 COND_EXPR, then we do not care about the type of COND_EXPR,
2573 only about the conversion of each operand. */
2581 {
2585 }
2586 /* Fall through. */
2587 }
2594 }
2595 }
2597 /* Produce warnings after a conversion. RESULT is the result of
2598 converting EXPR to TYPE. This is a helper function for
2599 convert_and_check and cp_convert_and_check. */
2601 void
2603 {
2610 {
2611 /* Do not diagnose overflow in a constant expression merely
2612 because a conversion overflowed. */
2617 {
2618 /* This detects cases like converting -129 or 256 to
2619 unsigned char. */
2623 else
2625 }
2629 /* No warning for converting 0x80000000 to int. */
2637 else
2639 }
2644 else
2646 }
2649 /* Convert EXPR to TYPE, warning about conversion problems with constants.
2650 Invoke this function on every expression that is converted implicitly,
2651 i.e. because of language rules and not because of an explicit cast. */
2653 tree
2655 {
2656 tree result;
2657 tree expr_for_warning;
2659 /* Convert from a value with possible excess precision rather than
2660 via the semantic type, but do not warn about values not fitting
2661 exactly in the semantic type. */
2663 {
2669 }
2670 else
2684 }
2685 \f
2686 /* A node in a list that describes references to variables (EXPR), which are
2687 either read accesses if WRITER is zero, or write accesses, in which case
2688 WRITER is the parent of EXPR. */
2689 struct tlist
2690 {
2693 };
2695 /* Used to implement a cache the results of a call to verify_tree. We only
2696 use this for SAVE_EXPRs. */
2697 struct tlist_cache
2698 {
2702 tree expr;
2703 };
2705 /* Obstack to use when allocating tlist structures, and corresponding
2706 firstobj. */
2710 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
2711 warnings. */
2713 /* SAVE_EXPRs need special treatment. We process them only once and then
2714 cache the results. */
2726 /* Create a new struct tlist and fill in its fields. */
2729 {
2736 }
2738 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
2739 is nonnull, we ignore any node we find which has a writer equal to it. */
2741 static void
2743 {
2745 {
2752 }
2753 }
2755 /* Merge the nodes of ADD into TO. This merging process is done so that for
2756 each variable that already exists in TO, no new node is added; however if
2757 there is a write access recorded in ADD, and an occurrence on TO is only
2758 a read access, then the occurrence in TO will be modified to record the
2759 write. */
2761 static void
2763 {
2770 {
2777 {
2781 }
2783 {
2787 }
2789 }
2790 }
2792 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
2793 references in list LIST conflict with it, excluding reads if ONLY writers
2794 is nonzero. */
2796 static void
2799 {
2802 /* Avoid duplicate warnings. */
2808 {
2812 {
2817 }
2819 }
2820 }
2822 /* Given a list LIST of references to variables, find whether any of these
2823 can cause conflicts due to missing sequence points. */
2825 static void
2827 {
2831 {
2834 }
2835 }
2837 /* Return nonzero if X is a tree that can be verified by the sequence point
2838 warnings. */
2839 static int
2841 {
2848 /* VOID_TYPE_P (TREE_TYPE (x)) is workaround for cp/tree.c
2849 (lvalue_p) crash on TRY/CATCH. */
2856 /* No point to track non-const calls, they will never satisfy
2857 operand_equal_p. */
2865 }
2867 /* Return nonzero if X and Y appear to be the same candidate (or NULL) */
2868 static bool
2870 {
2872 }
2874 /* Walk the tree X, and record accesses to variables. If X is written by the
2875 parent tree, WRITER is the parent.
2876 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
2877 expression or its only operand forces a sequence point, then everything up
2878 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
2879 in PNO_SP.
2880 Once we return, we will have emitted warnings if any subexpression before
2881 such a sequence point could be undefined. On a higher level, however, the
2882 sequence point may not be relevant, and we'll merge the two lists.
2884 Example: (b++, a) + b;
2885 The call that processes the COMPOUND_EXPR will store the increment of B
2886 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
2887 processes the PLUS_EXPR will need to merge the two lists so that
2888 eventually, all accesses end up on the same list (and we'll warn about the
2889 unordered subexpressions b++ and b.
2891 A note on merging. If we modify the former example so that our expression
2892 becomes
2893 (b++, b) + a
2894 care must be taken not simply to add all three expressions into the final
2895 PNO_SP list. The function merge_tlist takes care of that by merging the
2896 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
2897 way, so that no more than one access to B is recorded. */
2899 static void
2901 tree writer)
2902 {
2907 /* X may be NULL if it is the operand of an empty statement expression
2908 ({ }). */
2912 restart:
2920 {
2952 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
2953 two first, to avoid warning for (a ? b++ : b++). */
2969 /* Expressions inside the LHS are not ordered wrt. the sequence points
2970 in the RHS. Example:
2971 *a = (a++, 2)
2972 Despite the fact that the modification of "a" is in the before_sp
2973 list (tmp_before), it conflicts with the use of "a" in the LHS.
2974 We can handle this by adding the contents of tmp_list3
2975 to those of tmp_before, and redoing the collision warnings for that
2976 list. */
2979 /* Exclude the LHS itself here; we first have to merge it into the
2980 tmp_nosp list. This is done to avoid warning for "a = a"; if we
2981 didn't exclude the LHS, we'd get it twice, once as a read and once
2982 as a write. */
2993 /* We need to warn about conflicts among arguments and conflicts between
2994 args and the function address. Side effects of the function address,
2995 however, are not ordered by the sequence point of the call. */
2996 {
2997 call_expr_arg_iterator iter;
2998 tree arg;
3002 {
3007 }
3012 }
3015 /* Scan all the list, e.g. indices of multi dimensional array. */
3017 {
3023 }
3027 {
3034 {
3046 {
3050 }
3053 }
3057 }
3067 /* For other expressions, simply recurse on their operands.
3068 Manual tail recursion for unary expressions.
3069 Other non-expressions need not be processed. */
3071 {
3075 }
3077 {
3081 {
3086 }
3087 }
3089 }
3090 }
3092 /* Try to warn for undefined behavior in EXPR due to missing sequence
3093 points. */
3095 DEBUG_FUNCTION void
3097 {
3103 {
3106 }
3111 }
3112 \f
3113 /* Validate the expression after `case' and apply default promotions. */
3115 static tree
3117 {
3122 /* Promote char or short to int. */
3125 {
3128 }
3133 }
3134 \f
3135 /* See if the case values LOW and HIGH are in the range of the original
3136 type (i.e. before the default conversion to int) of the switch testing
3137 expression.
3138 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
3139 the type before promoting it. CASE_LOW_P is a pointer to the lower
3140 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
3141 if the case is not a case range.
3142 The caller has to make sure that we are not called with NULL for
3143 CASE_LOW_P (i.e. the default case).
3144 Returns true if the case label is in range of ORIG_TYPE (saturated or
3145 untouched) or false if the label is out of range. */
3147 static bool
3150 {
3155 /* If there was a problem with the original type, do nothing. */
3162 /* Case label is less than minimum for type. */
3165 {
3168 }
3170 /* Case value is greater than maximum for type. */
3173 {
3176 }
3178 /* Saturate lower case label value to minimum. */
3181 {
3185 }
3187 /* Saturate upper case label value to maximum. */
3190 {
3194 }
3202 }
3203 \f
3204 /* Return an integer type with BITS bits of precision,
3205 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
3207 tree
3209 {
3248 }
3250 /* Return a fixed-point type that has at least IBIT ibits and FBIT fbits
3251 that is unsigned if UNSIGNEDP is nonzero, otherwise signed;
3252 and saturating if SATP is nonzero, otherwise not saturating. */
3254 tree
3257 {
3261 else
3269 {
3271 "fixed-point types that have too many integral and "
3274 }
3277 }
3279 /* Used for communication between c_common_type_for_mode and
3280 c_register_builtin_type. */
3283 /* Return a data type that has machine mode MODE.
3284 If the mode is an integer,
3285 then UNSIGNEDP selects between signed and unsigned types.
3286 If the mode is a fixed-point mode,
3287 then UNSIGNEDP selects between saturating and nonsaturating types. */
3289 tree
3291 {
3292 tree t;
3329 #if HOST_BITS_PER_WIDE_INT >= 64
3332 #endif
3357 {
3359 tree inner_type;
3375 }
3377 {
3382 }
3392 {
3478 }
3486 }
3488 tree
3490 {
3492 }
3494 /* Return a signed type the same as TYPE in other respects. */
3496 tree
3498 {
3500 }
3502 /* Return a type the same as TYPE except unsigned or
3503 signed according to UNSIGNEDP. */
3505 tree
3507 {
3508 tree type1;
3510 /* This block of code emulates the behavior of the old
3511 c_common_unsigned_type. In particular, it returns
3512 long_unsigned_type_node if passed a long, even when a int would
3513 have the same size. This is necessary for warnings to work
3514 correctly in archs where sizeof(int) == sizeof(long) */
3517 if (type1 == signed_char_type_node || type1 == char_type_node || type1 == unsigned_char_type_node)
3533 #if HOST_BITS_PER_WIDE_INT >= 64
3536 #endif
3546 #define C_COMMON_FIXED_TYPES(NAME) \
3547 if (type1 == short_ ## NAME ## _type_node \
3548 || type1 == unsigned_short_ ## NAME ## _type_node) \
3549 return unsignedp ? unsigned_short_ ## NAME ## _type_node \
3550 : short_ ## NAME ## _type_node; \
3551 if (type1 == NAME ## _type_node \
3552 || type1 == unsigned_ ## NAME ## _type_node) \
3553 return unsignedp ? unsigned_ ## NAME ## _type_node \
3554 : NAME ## _type_node; \
3555 if (type1 == long_ ## NAME ## _type_node \
3556 || type1 == unsigned_long_ ## NAME ## _type_node) \
3557 return unsignedp ? unsigned_long_ ## NAME ## _type_node \
3558 : long_ ## NAME ## _type_node; \
3559 if (type1 == long_long_ ## NAME ## _type_node \
3560 || type1 == unsigned_long_long_ ## NAME ## _type_node) \
3561 return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \
3562 : long_long_ ## NAME ## _type_node;
3564 #define C_COMMON_FIXED_MODE_TYPES(NAME) \
3565 if (type1 == NAME ## _type_node \
3566 || type1 == u ## NAME ## _type_node) \
3567 return unsignedp ? u ## NAME ## _type_node \
3568 : NAME ## _type_node;
3570 #define C_COMMON_FIXED_TYPES_SAT(NAME) \
3571 if (type1 == sat_ ## short_ ## NAME ## _type_node \
3572 || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \
3573 return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \
3574 : sat_ ## short_ ## NAME ## _type_node; \
3575 if (type1 == sat_ ## NAME ## _type_node \
3576 || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \
3577 return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \
3578 : sat_ ## NAME ## _type_node; \
3579 if (type1 == sat_ ## long_ ## NAME ## _type_node \
3580 || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \
3581 return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \
3582 : sat_ ## long_ ## NAME ## _type_node; \
3583 if (type1 == sat_ ## long_long_ ## NAME ## _type_node \
3584 || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \
3585 return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \
3586 : sat_ ## long_long_ ## NAME ## _type_node;
3588 #define C_COMMON_FIXED_MODE_TYPES_SAT(NAME) \
3589 if (type1 == sat_ ## NAME ## _type_node \
3590 || type1 == sat_ ## u ## NAME ## _type_node) \
3591 return unsignedp ? sat_ ## u ## NAME ## _type_node \
3592 : sat_ ## NAME ## _type_node;
3618 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
3619 the precision; they have precision set to match their range, but
3620 may use a wider mode to match an ABI. If we change modes, we may
3621 wind up with bad conversions. For INTEGER_TYPEs in C, must check
3622 the precision as well, so as to yield correct results for
3623 bit-field types. C++ does not have these separate bit-field
3624 types, and producing a signed or unsigned variant of an
3625 ENUMERAL_TYPE may cause other problems as well. */
3631 #define TYPE_OK(node) \
3632 (TYPE_MODE (type) == TYPE_MODE (node) \
3633 && TYPE_PRECISION (type) == TYPE_PRECISION (node))
3652 #if HOST_BITS_PER_WIDE_INT >= 64
3655 #endif
3664 #undef TYPE_OK
3667 }
3669 /* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */
3671 tree
3673 {
3674 /* Extended integer types of the same width as a standard type have
3675 lesser rank, so those of the same width as int promote to int or
3676 unsigned int and are valid for printf formats expecting int or
3677 unsigned int. To avoid such special cases, avoid creating
3678 extended integer types for bit-fields if a standard integer type
3679 is available. */
3696 }
3698 /* The C version of the register_builtin_type langhook. */
3700 void
3702 {
3703 tree decl;
3713 }
3714 \f
3715 /* Print an error message for invalid operands to arith operation
3716 CODE with TYPE0 for operand 0, and TYPE1 for operand 1.
3717 LOCATION is the location of the message. */
3719 void
3722 {
3726 {
3771 }
3775 }
3776 \f
3777 /* Given an expression as a tree, return its original type. Do this
3778 by stripping any conversion that preserves the sign and precision. */
3779 static tree
3781 {
3784 }
3786 /* Subroutine of build_binary_op, used for comparison operations.
3787 See if the operands have both been converted from subword integer types
3788 and, if so, perhaps change them both back to their original type.
3789 This function is also responsible for converting the two operands
3790 to the proper common type for comparison.
3792 The arguments of this function are all pointers to local variables
3793 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
3794 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
3796 If this function returns nonzero, it means that the comparison has
3797 a constant value. What this function returns is an expression for
3798 that value. */
3800 tree
3803 {
3804 tree type;
3813 /* Throw away any conversions to wider types
3814 already present in the operands. */
3819 /* If primopN is first sign-extended from primopN's precision to opN's
3820 precision, then zero-extended from opN's precision to
3821 *restype_ptr precision, shortenings might be invalid. */
3824 && !unsignedp0
3829 && !unsignedp1
3833 /* Handle the case that OP0 does not *contain* a conversion
3834 but it *requires* conversion to FINAL_TYPE. */
3841 /* If one of the operands must be floated, we cannot optimize. */
3845 /* If first arg is constant, swap the args (changing operation
3846 so value is preserved), for canonicalization. Don't do this if
3847 the second arg is 0. */
3852 {
3869 {
3884 }
3886 }
3888 /* If comparing an integer against a constant more bits wide,
3889 maybe we can deduce a value of 1 or 0 independent of the data.
3890 Or else truncate the constant now
3891 rather than extend the variable at run time.
3893 This is only interesting if the constant is the wider arg.
3894 Also, it is not safe if the constant is unsigned and the
3895 variable arg is signed, since in this case the variable
3896 would be sign-extended and then regarded as unsigned.
3897 Our technique fails in this case because the lowest/highest
3898 possible unsigned results don't follow naturally from the
3899 lowest/highest possible values of the variable operand.
3900 For just EQ_EXPR and NE_EXPR there is another technique that
3901 could be used: see if the constant can be faithfully represented
3902 in the other operand's type, by truncating it and reextending it
3903 and see if that preserves the constant's value. */
3909 {
3912 /* 1 if comparison is nominally unsigned. */
3914 tree val;
3926 {
3927 /* Convert primop1 to target type, but do not introduce
3928 additional overflow. We know primop1 is an int_cst. */
3932 }
3934 {
3937 }
3940 {
3945 }
3946 else
3947 {
3952 }
3955 /* This used to be a switch, but Genix compiler can't handle that. */
3957 {
3960 }
3962 {
3965 }
3967 {
3972 }
3974 {
3979 }
3981 {
3986 }
3988 {
3993 }
3995 /* If primop0 was sign-extended and unsigned comparison specd,
3996 we did a signed comparison above using the signed type bounds.
3997 But the comparison we output must be unsigned.
3999 Also, for inequalities, VAL is no good; but if the signed
4000 comparison had *any* fixed result, it follows that the
4001 unsigned comparison just tests the sign in reverse
4002 (positive values are LE, negative ones GE).
4003 So we can generate an unsigned comparison
4004 against an extreme value of the signed type. */
4007 {
4010 {
4025 }
4027 }
4031 {
4038 }
4041 {
4042 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4046 }
4048 /* Value is not predetermined, but do the comparison
4049 in the type of the operand that is not constant.
4050 TYPE is already properly set. */
4051 }
4053 /* If either arg is decimal float and the other is float, find the
4054 proper common type to use for comparison. */
4065 /* If args' natural types are both narrower than nominal type
4066 and both extend in the same manner, compare them
4067 in the type of the wider arg.
4068 Otherwise must actually extend both to the nominal
4069 common type lest different ways of extending
4070 alter the result.
4071 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
4076 {
4080 type);
4081 /* Make sure shorter operand is extended the right way
4082 to match the longer operand. */
4083 primop0
4086 primop0);
4087 primop1
4090 primop1);
4091 }
4092 else
4093 {
4094 /* Here we must do the comparison on the nominal type
4095 using the args exactly as we received them. */
4102 {
4104 /* All unsigned values are >= 0, so we warn. However,
4105 if OP0 is a constant that is >= 0, the signedness of
4106 the comparison isn't an issue, so suppress the
4107 warning. */
4109 warn_type_limits && !in_system_header
4113 primop0)))
4114 /* Do not warn for enumeration types. */
4118 {
4135 }
4138 {
4139 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4144 }
4145 }
4146 }
4154 }
4155 \f
4156 /* Return a tree for the sum or difference (RESULTCODE says which)
4157 of pointer PTROP and integer INTOP. */
4159 tree
4162 {
4165 /* The result is a pointer of the same type that is being added. */
4168 /* If the pointer lives in UPC shared memory, then
4169 drop the 'shared' qualifier. */
4174 {
4178 }
4180 {
4184 }
4186 {
4190 }
4191 else
4194 /* We are manipulating pointer values, so we don't need to warn
4195 about relying on undefined signed overflow. We disable the
4196 warning here because we use integer types so fold won't know that
4197 they are really pointers. */
4200 /* If what we are about to multiply by the size of the elements
4201 contains a constant term, apply distributive law
4202 and multiply that constant term separately.
4203 This helps produce common subexpressions. */
4208 /* If the constant comes from pointer subtraction,
4209 skip this optimization--it would cause an error. */
4211 /* If the constant is unsigned, and smaller than the pointer size,
4212 then we must skip this optimization. This is because it could cause
4213 an overflow error if the constant is negative but INTOP is not. */
4217 {
4222 /* Convert both subexpression types to the type of intop,
4223 because weird cases involving pointer arithmetic
4224 can result in a sum or difference with different type args. */
4229 }
4231 /* Convert the integer argument to a type the same size as sizetype
4232 so the multiply won't overflow spuriously. */
4238 /* Replace the integer argument with a suitable product by the object size.
4239 Do this multiplication as signed, then convert to the appropriate type
4240 for the pointer operation and disregard an overflow that occurred only
4241 because of the sign-extension change in the latter conversion. */
4242 {
4250 }
4252 /* Create the sum or difference. */
4261 }
4262 \f
4263 /* Wrap a C_MAYBE_CONST_EXPR around an expression that is fully folded
4264 and if NON_CONST is known not to be permitted in an evaluated part
4265 of a constant expression. */
4267 tree
4269 {
4273 /* This should never be called for C++. */
4277 /* The result of folding may have a NOP_EXPR to set TREE_NO_WARNING. */
4286 }
4288 /* Wrap a SAVE_EXPR around EXPR, if appropriate. Like save_expr, but
4289 for C folds the inside expression and wraps a C_MAYBE_CONST_EXPR
4290 around the SAVE_EXPR if needed so that c_fully_fold does not need
4291 to look inside SAVE_EXPRs. */
4293 tree
4295 {
4304 }
4306 /* Return whether EXPR is a declaration whose address can never be
4307 NULL. */
4309 bool
4311 {
4316 }
4318 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
4319 or for an `if' or `while' statement or ?..: exp. It should already
4320 have been validated to be of suitable type; otherwise, a bad
4321 diagnostic may result.
4323 The EXPR is located at LOCATION.
4325 This preparation consists of taking the ordinary
4326 representation of an expression expr and producing a valid tree
4327 boolean expression describing whether expr is nonzero. We could
4328 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
4329 but we optimize comparisons, &&, ||, and !.
4331 The resulting type should always be `truthvalue_type_node'. */
4333 tree
4335 {
4337 {
4379 ? truthvalue_true_node
4385 ? truthvalue_true_node
4390 /* Fall through. */
4393 {
4396 {
4397 /* Common Ada/Pascal programmer's mistake. */
4399 OPT_Waddress,
4401 inner);
4403 }
4405 }
4422 /* These don't change whether an object is nonzero or zero. */
4427 /* These don't change whether an object is zero or nonzero, but
4428 we can't ignore them if their second arg has side-effects. */
4430 {
4433 c_common_truthvalue_conversion
4436 }
4437 else
4442 /* Distribute the conversion into the arms of a COND_EXPR. */
4444 {
4447 /* In C++ one of the arms might have void type if it is throw. */
4455 }
4456 else
4457 {
4458 /* Folding will happen later for C. */
4466 }
4468 CASE_CONVERT:
4469 {
4473 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
4474 since that affects how `default_conversion' will behave. */
4478 /* Don't strip a conversion from C++0x scoped enum, since they
4479 don't implicitly convert to other types. */
4483 /* If this isn't narrowing the argument, we can ignore it. */
4487 }
4493 {
4497 }
4502 }
4505 {
4507 expr = (build_binary_op
4511 c_common_truthvalue_conversion
4514 c_common_truthvalue_conversion
4519 }
4522 {
4527 }
4528 else
4531 ret:
4534 }
4535 \f
4544 /* Apply the TYPE_QUALS to the new DECL. */
4546 void
4548 {
4556 /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr
4557 constructor can produce constant init, so rely on cp_finish_decl to
4558 clear TREE_READONLY if the variable has non-constant init. */
4561 {
4564 }
4566 {
4568 /* Allow 'restrict' on arrays of pointers.
4569 FIXME currently we just ignore it. */
4575 }
4577 {
4583 /* The declaration's type should have been previously defined
4584 as a UPC shared type. */
4586 }
4587 }
4589 /* Hash function for the problem of multiple type definitions in
4590 different files. This must hash all types that will compare
4591 equal via comptypes to the same value. In practice it hashes
4592 on some of the simple stuff and leaves the details to comptypes. */
4594 static hashval_t
4596 {
4600 tree t2;
4602 {
4603 /* For pointers, hash on pointee type plus some swizzling. */
4606 /* Hash on number of elements and total size. */
4625 }
4626 /* FIXME: We want to use a DECL_CHAIN iteration method here, but
4627 TYPE_VALUES of ENUMERAL_TYPEs is stored as a TREE_LIST. */
4629 /* We might have a VLA here. */
4632 else
4635 }
4639 /* Return the typed-based alias set for T, which may be an expression
4640 or a type. Return -1 if we don't do anything special. */
4642 alias_set_type
4644 {
4645 tree u;
4648 /* For VLAs, use the alias set of the element type rather than the
4649 default of alias set 0 for types compared structurally. */
4651 {
4655 }
4657 /* Permit type-punning when accessing a union, provided the access
4658 is directly through the union. For example, this code does not
4659 permit taking the address of a union member and then storing
4660 through it. Even the type-punning allowed here is a GCC
4661 extension, albeit a common and useful one; the C standard says
4662 that such accesses have implementation-defined behavior. */
4670 /* That's all the expressions we handle specially. */
4674 /* The C standard guarantees that any object may be accessed via an
4675 lvalue that has character type. */
4681 /* The C standard specifically allows aliasing between signed and
4682 unsigned variants of the same type. We treat the signed
4683 variant as canonical. */
4685 {
4688 /* t1 == t can happen for boolean nodes which are always unsigned. */
4691 }
4693 /* Handle the case of multiple type nodes referring to "the same" type,
4694 which occurs with IMA. These share an alias set. FIXME: Currently only
4695 C90 is handled. (In C99 type compatibility is not transitive, which
4696 complicates things mightily. The alias set splay trees can theoretically
4697 represent this, but insertion is tricky when you consider all the
4698 different orders things might arrive in.) */
4703 /* Save time if there's only one input file. */
4707 /* Pointers need special handling if they point to any type that
4708 needs special handling (below). */
4710 {
4711 tree t2;
4712 /* Find bottom type under any nested POINTERs. */
4716 ;
4724 }
4725 /* These are the only cases that need special handling. */
4732 /* Undefined? */
4736 /* Look up t in hash table. Only one of the compatible types within each
4737 alias set is recorded in the table. */
4741 NULL);
4744 {
4747 }
4748 else
4749 /* Our caller will assign and record (in t) a new alias set; all we need
4750 to do is remember t in the hash table. */
4754 }
4755 \f
4756 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where
4757 the second parameter indicates which OPERATOR is being applied.
4758 The COMPLAIN flag controls whether we should diagnose possibly
4759 ill-formed constructs or not. LOC is the location of the SIZEOF or
4760 TYPEOF operator. */
4762 tree
4765 {
4773 {
4775 {
4782 }
4783 else
4784 {
4786 {
4790 else
4793 }
4795 }
4796 }
4798 {
4800 {
4808 }
4809 else
4812 }
4815 {
4820 }
4823 {
4828 }
4829 else
4830 {
4832 /* Convert in case a char is more than one unit. */
4836 else
4838 }
4843 {
4846 }
4848 /* VALUE will have the middle-end integer type sizetype.
4849 However, we should really return a value of type `size_t',
4850 which is just a typedef for an ordinary integer type. */
4854 }
4856 /* Implement the __alignof keyword: Return the minimum required
4857 alignment of EXPR, measured in bytes. For VAR_DECLs,
4858 FUNCTION_DECLs and FIELD_DECLs return DECL_ALIGN (which can be set
4859 from an "aligned" __attribute__ specification). LOC is the
4860 location of the ALIGNOF operator. */
4862 tree
4864 {
4865 tree t;
4872 {
4875 }
4881 {
4888 {
4895 }
4897 }
4898 else
4902 }
4903 \f
4904 /* Handle C and C++ default attributes. */
4906 enum built_in_attribute
4907 {
4908 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
4909 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
4910 #define DEF_ATTR_STRING(ENUM, VALUE) ENUM,
4911 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
4912 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
4914 #undef DEF_ATTR_NULL_TREE
4915 #undef DEF_ATTR_INT
4916 #undef DEF_ATTR_STRING
4917 #undef DEF_ATTR_IDENT
4918 #undef DEF_ATTR_TREE_LIST
4919 ATTR_LAST
4920 };
4926 enum c_builtin_type
4927 {
4928 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
4929 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
4930 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
4931 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
4932 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
4933 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
4934 #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
4935 #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6) NAME,
4936 #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7) NAME,
4937 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
4938 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
4939 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
4940 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
4941 #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
4942 #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG6) \
4943 NAME,
4944 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
4946 #undef DEF_PRIMITIVE_TYPE
4947 #undef DEF_FUNCTION_TYPE_0
4948 #undef DEF_FUNCTION_TYPE_1
4949 #undef DEF_FUNCTION_TYPE_2
4950 #undef DEF_FUNCTION_TYPE_3
4951 #undef DEF_FUNCTION_TYPE_4
4952 #undef DEF_FUNCTION_TYPE_5
4953 #undef DEF_FUNCTION_TYPE_6
4954 #undef DEF_FUNCTION_TYPE_7
4955 #undef DEF_FUNCTION_TYPE_VAR_0
4956 #undef DEF_FUNCTION_TYPE_VAR_1
4957 #undef DEF_FUNCTION_TYPE_VAR_2
4958 #undef DEF_FUNCTION_TYPE_VAR_3
4959 #undef DEF_FUNCTION_TYPE_VAR_4
4960 #undef DEF_FUNCTION_TYPE_VAR_5
4961 #undef DEF_POINTER_TYPE
4962 BT_LAST
4963 };
4967 /* A temporary array for c_common_nodes_and_builtins. Used in
4968 communication with def_fn_type. */
4971 /* A helper function for c_common_nodes_and_builtins. Build function type
4972 for DEF with return type RET and N arguments. If VAR is true, then the
4973 function should be variadic after those N arguments.
4975 Takes special care not to ICE if any of the types involved are
4976 error_mark_node, which indicates that said type is not in fact available
4977 (see builtin_type_for_size). In which case the function type as a whole
4978 should be error_mark_node. */
4980 static void
4982 {
4983 tree t;
4990 {
4996 }
5003 else
5006 egress:
5009 }
5011 /* Build builtin functions common to both C and C++ language
5012 frontends. */
5014 static void
5016 {
5017 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
5018 builtin_types[ENUM] = VALUE;
5019 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
5020 def_fn_type (ENUM, RETURN, 0, 0);
5021 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
5022 def_fn_type (ENUM, RETURN, 0, 1, ARG1);
5023 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
5024 def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
5025 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5026 def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
5027 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5028 def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
5029 #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5030 def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5031 #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5032 ARG6) \
5033 def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
5034 #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5035 ARG6, ARG7) \
5036 def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
5037 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
5038 def_fn_type (ENUM, RETURN, 1, 0);
5039 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
5040 def_fn_type (ENUM, RETURN, 1, 1, ARG1);
5041 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
5042 def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
5043 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5044 def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
5045 #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5046 def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
5047 #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5048 def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5049 #define DEF_POINTER_TYPE(ENUM, TYPE) \
5050 builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
5054 #undef DEF_PRIMITIVE_TYPE
5055 #undef DEF_FUNCTION_TYPE_1
5056 #undef DEF_FUNCTION_TYPE_2
5057 #undef DEF_FUNCTION_TYPE_3
5058 #undef DEF_FUNCTION_TYPE_4
5059 #undef DEF_FUNCTION_TYPE_5
5060 #undef DEF_FUNCTION_TYPE_6
5061 #undef DEF_FUNCTION_TYPE_VAR_0
5062 #undef DEF_FUNCTION_TYPE_VAR_1
5063 #undef DEF_FUNCTION_TYPE_VAR_2
5064 #undef DEF_FUNCTION_TYPE_VAR_3
5065 #undef DEF_FUNCTION_TYPE_VAR_4
5066 #undef DEF_FUNCTION_TYPE_VAR_5
5067 #undef DEF_POINTER_TYPE
5072 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
5073 NONANSI_P, ATTRS, IMPLICIT, COND) \
5074 if (NAME && COND) \
5075 def_builtin_1 (ENUM, NAME, CLASS, \
5076 builtin_types[(int) TYPE], \
5077 builtin_types[(int) LIBTYPE], \
5078 BOTH_P, FALLBACK_P, NONANSI_P, \
5079 built_in_attributes[(int) ATTRS], IMPLICIT);
5081 #undef DEF_BUILTIN
5089 }
5091 /* Like get_identifier, but avoid warnings about null arguments when
5092 the argument may be NULL for targets where GCC lacks stdint.h type
5093 information. */
5097 {
5099 }
5101 /* Build tree nodes and builtin functions common to both C and C++ language
5102 frontends. */
5104 void
5106 {
5110 tree array_domain_type;
5111 tree va_list_ref_type_node;
5112 tree va_list_arg_type_node;
5116 /* Define `int' and `char' first so that dbx will output them first. */
5120 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
5121 "unsigned long", "long long unsigned" and "unsigned short" were in C++
5122 but not C. Are the conditionals here needed? */
5128 long_unsigned_type_node);
5130 {
5132 int128_integer_type_node);
5134 int128_unsigned_type_node);
5135 }
5139 long_long_integer_type_node);
5141 long_long_unsigned_type_node);
5144 long_long_unsigned_type_node);
5147 short_unsigned_type_node);
5150 short_unsigned_type_node);
5152 /* Define both `signed char' and `unsigned char'. */
5156 /* These are types that c_common_type_for_size and
5157 c_common_type_for_mode use. */
5160 intQI_type_node));
5163 intHI_type_node));
5166 intSI_type_node));
5169 intDI_type_node));
5170 #if HOST_BITS_PER_WIDE_INT >= 64
5173 TYPE_DECL,
5175 intTI_type_node));
5176 #endif
5179 unsigned_intQI_type_node));
5182 unsigned_intHI_type_node));
5185 unsigned_intSI_type_node));
5188 unsigned_intDI_type_node));
5189 #if HOST_BITS_PER_WIDE_INT >= 64
5192 TYPE_DECL,
5194 unsigned_intTI_type_node));
5195 #endif
5197 /* Create the widest literal types. */
5198 widest_integer_literal_type_node
5202 widest_integer_literal_type_node));
5204 widest_unsigned_literal_type_node
5208 widest_unsigned_literal_type_node));
5212 pid_type_node =
5219 /* Only supported decimal floating point extension if the target
5220 actually supports underlying modes. */
5224 {
5228 }
5231 {
5236 long_long_fract_type_node);
5238 unsigned_short_fract_type_node);
5240 unsigned_fract_type_node);
5242 unsigned_long_fract_type_node);
5244 unsigned_long_long_fract_type_node);
5246 sat_short_fract_type_node);
5249 sat_long_fract_type_node);
5251 sat_long_long_fract_type_node);
5253 sat_unsigned_short_fract_type_node);
5255 sat_unsigned_fract_type_node);
5257 sat_unsigned_long_fract_type_node);
5259 sat_unsigned_long_long_fract_type_node);
5264 long_long_accum_type_node);
5266 unsigned_short_accum_type_node);
5268 unsigned_accum_type_node);
5270 unsigned_long_accum_type_node);
5272 unsigned_long_long_accum_type_node);
5274 sat_short_accum_type_node);
5277 sat_long_accum_type_node);
5279 sat_long_long_accum_type_node);
5281 sat_unsigned_short_accum_type_node);
5283 sat_unsigned_accum_type_node);
5285 sat_unsigned_long_accum_type_node);
5287 sat_unsigned_long_long_accum_type_node);
5289 }
5292 TYPE_DECL,
5294 complex_integer_type_node));
5296 TYPE_DECL,
5298 complex_float_type_node));
5300 TYPE_DECL,
5302 complex_double_type_node));
5306 complex_long_double_type_node));
5309 /* For C++, make fileptr_type_node a distinct void * type until
5310 FILE type is defined. */
5315 /* Set the TYPE_NAME for any variants that were built before
5316 record_builtin_type gave names to the built-in types. */
5317 {
5323 }
5325 /* This node must not be shared. */
5331 /* Make a type to be the domain of a few array types
5332 whose domains don't really matter.
5333 200 is small enough that it always fits in size_t
5334 and large enough that it can hold most function names for the
5335 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
5338 /* Make a type for arrays of characters.
5339 With luck nothing will ever really depend on the length of this
5340 array type. */
5341 char_array_type_node
5344 /* Likewise for arrays of ints. */
5345 int_array_type_node
5349 const_string_type_node
5353 /* This is special for C++ so functions can be overloaded. */
5359 {
5362 else
5365 }
5367 /* This is for wide string constants. */
5368 wchar_array_type_node
5371 /* Define 'char16_t'. */
5376 {
5381 }
5383 /* This is for UTF-16 string constants. */
5384 char16_array_type_node
5387 /* Define 'char32_t'. */
5392 {
5397 }
5399 /* This is for UTF-32 string constants. */
5400 char32_array_type_node
5403 wint_type_node =
5406 intmax_type_node =
5408 uintmax_type_node =
5412 sig_atomic_type_node =
5415 int8_type_node =
5418 int16_type_node =
5421 int32_type_node =
5424 int64_type_node =
5427 uint8_type_node =
5430 c_uint16_type_node =
5433 c_uint32_type_node =
5436 c_uint64_type_node =
5439 int_least8_type_node =
5442 int_least16_type_node =
5445 int_least32_type_node =
5448 int_least64_type_node =
5451 uint_least8_type_node =
5454 uint_least16_type_node =
5457 uint_least32_type_node =
5460 uint_least64_type_node =
5463 int_fast8_type_node =
5466 int_fast16_type_node =
5469 int_fast32_type_node =
5472 int_fast64_type_node =
5475 uint_fast8_type_node =
5478 uint_fast16_type_node =
5481 uint_fast32_type_node =
5484 uint_fast64_type_node =
5487 intptr_type_node =
5490 uintptr_type_node =
5493 default_function_type
5495 ptrdiff_type_node
5502 va_list_type_node));
5504 {
5507 tree ptype;
5510 {
5514 ptype));
5516 }
5517 }
5520 {
5523 }
5524 else
5525 {
5528 }
5535 /* Create the built-in __null node. It is important that this is
5536 not shared. */
5540 /* Since builtin_types isn't gc'ed, don't export these nodes. */
5542 }
5544 /* The number of named compound-literals generated thus far. */
5547 /* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */
5549 void
5551 {
5554 compound_literal_number);
5555 compound_literal_number++;
5557 }
5559 tree
5561 {
5565 }
5568 /* Linked list of disabled built-in functions. */
5571 {
5579 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
5580 begins with "__builtin_", give an error. */
5582 void
5584 {
5587 else
5588 {
5593 }
5594 }
5597 /* Return true if the built-in function NAME has been disabled, false
5598 otherwise. */
5600 static bool
5602 {
5605 {
5608 }
5610 }
5613 /* Worker for DEF_BUILTIN.
5614 Possibly define a builtin function with one or two names.
5615 Does not declare a non-__builtin_ function if flag_no_builtin, or if
5616 nonansi_p and flag_no_nonansi_builtin. */
5618 static void
5625 {
5626 tree decl;
5639 fnattrs);
5648 }
5649 \f
5650 /* Nonzero if the type T promotes to int. This is (nearly) the
5651 integral promotions defined in ISO C99 6.3.1.1/2. */
5653 bool
5655 {
5657 {
5667 /* ??? Technically all enumerations not larger than an int
5668 promote to an int. But this is used along code paths
5669 that only want to notice a size change. */
5677 }
5678 }
5680 /* Return 1 if PARMS specifies a fixed number of parameters
5681 and none of their types is affected by default promotions. */
5683 int
5685 {
5686 const_tree t;
5688 {
5705 }
5707 }
5709 /* Recursively remove any '*' or '&' operator from TYPE. */
5710 tree
5712 {
5716 }
5718 /* Recursively remove pointer or array type from TYPE. */
5719 tree
5721 {
5725 }
5727 /* Used to compare case labels. K1 and K2 are actually tree nodes
5728 representing case labels, or NULL_TREE for a `default' label.
5729 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
5730 K2, and 0 if K1 and K2 are equal. */
5732 int
5734 {
5735 /* Consider a NULL key (such as arises with a `default' label) to be
5736 smaller than anything else. */
5743 }
5745 /* Process a case label, located at LOC, for the range LOW_VALUE
5746 ... HIGH_VALUE. If LOW_VALUE and HIGH_VALUE are both NULL_TREE
5747 then this case label is actually a `default' label. If only
5748 HIGH_VALUE is NULL_TREE, then case label was declared using the
5749 usual C/C++ syntax, rather than the GNU case range extension.
5750 CASES is a tree containing all the case ranges processed so far;
5751 COND is the condition for the switch-statement itself. Returns the
5752 CASE_LABEL_EXPR created, or ERROR_MARK_NODE if no CASE_LABEL_EXPR
5753 is created. */
5755 tree
5758 {
5759 tree type;
5760 tree label;
5761 tree case_label;
5762 splay_tree_node node;
5764 /* Create the LABEL_DECL itself. */
5767 /* If there was an error processing the switch condition, bail now
5768 before we get more confused. */
5776 {
5779 }
5781 /* Case ranges are a GNU extension. */
5788 {
5793 }
5795 {
5800 }
5803 {
5804 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
5805 really a case range, even though it was written that way.
5806 Remove the HIGH_VALUE to simplify later processing. */
5811 }
5813 /* See if the case is in range of the type of the original testing
5814 expression. If both low_value and high_value are out of range,
5815 don't insert the case label and return NULL_TREE. */
5821 /* Look up the LOW_VALUE in the table of case labels we already
5822 have. */
5824 /* If there was not an exact match, check for overlapping ranges.
5825 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
5826 that's a `default' label and the only overlap is an exact match. */
5828 {
5829 splay_tree_node low_bound;
5830 splay_tree_node high_bound;
5832 /* Even though there wasn't an exact match, there might be an
5833 overlap between this case range and another case range.
5834 Since we've (inductively) not allowed any overlapping case
5835 ranges, we simply need to find the greatest low case label
5836 that is smaller that LOW_VALUE, and the smallest low case
5837 label that is greater than LOW_VALUE. If there is an overlap
5838 it will occur in one of these two ranges. */
5844 /* Check to see if the LOW_BOUND overlaps. It is smaller than
5845 the LOW_VALUE, so there is no need to check unless the
5846 LOW_BOUND is in fact itself a case range. */
5852 /* Check to see if the HIGH_BOUND overlaps. The low end of that
5853 range is bigger than the low end of the current range, so we
5854 are only interested if the current range is a real range, and
5855 not an ordinary case label. */
5857 && high_value
5859 high_value)
5862 }
5863 /* If there was an overlap, issue an error. */
5865 {
5869 {
5873 }
5875 {
5878 }
5879 else
5880 {
5884 }
5886 }
5888 /* Add a CASE_LABEL to the statement-tree. */
5890 /* Register this case label in the splay tree. */
5897 error_out:
5898 /* Add a label so that the back-end doesn't think that the beginning of
5899 the switch is unreachable. Note that we do not add a case label, as
5900 that just leads to duplicates and thence to failure later on. */
5902 {
5905 }
5907 }
5909 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
5910 Used to verify that case values match up with enumerator values. */
5912 static void
5914 {
5917 /* ??? Not working too hard to print the double-word value.
5918 Should perhaps be done with %lwd in the diagnostic routines? */
5927 else
5936 buf);
5937 else
5942 }
5944 /* Subroutine of c_do_switch_warnings, called via splay_tree_foreach.
5945 Used to verify that case values match up with enumerator values. */
5947 static int
5949 {
5953 /* Skip default case. */
5957 /* If CASE_LOW_SEEN is not set, that means CASE_LOW did not appear
5958 when we did our enum->case scan. Reset our scratch bit after. */
5961 else
5964 /* If CASE_HIGH is non-null, we have a range. If CASE_HIGH_SEEN is
5965 not set, that means that CASE_HIGH did not appear when we did our
5966 enum->case scan. Reset our scratch bit after. */
5968 {
5971 else
5973 }
5976 }
5978 /* Handle -Wswitch*. Called from the front end after parsing the
5979 switch construct. */
5980 /* ??? Should probably be somewhere generic, since other languages
5981 besides C and C++ would want this. At the moment, however, C/C++
5982 are the only tree-ssa languages that support enumerations at all,
5983 so the point is moot. */
5985 void
5988 {
5989 splay_tree_node default_node;
5990 splay_tree_node node;
5991 tree chain;
6001 /* From here on, we only care about about enumerated types. */
6005 /* From here on, we only care about -Wswitch and -Wswitch-enum. */
6009 /* Check the cases. Warn about case values which are not members of
6010 the enumerated type. For -Wswitch-enum, or for -Wswitch when
6011 there is no default case, check that exactly all enumeration
6012 literals are covered by the cases. */
6014 /* Clearing COND if it is not an integer constant simplifies
6015 the tests inside the loop below. */
6019 /* The time complexity here is O(N*lg(N)) worst case, but for the
6020 common case of monotonically increasing enumerators, it is
6021 O(N), since the nature of the splay tree will keep the next
6022 element adjacent to the root at all times. */
6025 {
6031 {
6032 /* Mark the CASE_LOW part of the case entry as seen. */
6036 }
6038 /* Even though there wasn't an exact match, there might be a
6039 case range which includes the enumerator's value. */
6042 {
6046 {
6047 /* If we match the upper bound exactly, mark the CASE_HIGH
6048 part of the case entry as seen. */
6052 }
6053 }
6055 /* We've now determined that this enumerated literal isn't
6056 handled by the case labels of the switch statement. */
6058 /* If the switch expression is a constant, we only really care
6059 about whether that constant is handled by the switch. */
6063 /* If there is a default_node, the only relevant option is
6064 Wswitch-enum. Otherwise, if both are enabled then we prefer
6065 to warn using -Wswitch because -Wswitch is enabled by -Wall
6066 while -Wswitch-enum is explicit. */
6069 ? OPT_Wswitch_enum
6073 }
6075 /* Warn if there are case expressions that don't correspond to
6076 enumerators. This can occur since C and C++ don't enforce
6077 type-checking of assignments to enumeration variables.
6079 The time complexity here is now always O(N) worst case, since
6080 we should have marked both the lower bound and upper bound of
6081 every disjoint case label, with CASE_LOW_SEEN and CASE_HIGH_SEEN
6082 above. This scan also resets those fields. */
6085 }
6087 /* Finish an expression taking the address of LABEL (an
6088 IDENTIFIER_NODE). Returns an expression for the address.
6090 LOC is the location for the expression returned. */
6092 tree
6094 {
6095 tree result;
6105 else
6106 {
6109 /* The current function is not necessarily uninlinable.
6110 Computed gotos are incompatible with inlining, but the value
6111 here could be used only in a diagnostic, for example. */
6113 }
6116 }
6117 \f
6119 /* Given a boolean expression ARG, return a tree representing an increment
6120 or decrement (as indicated by CODE) of ARG. The front end must check for
6121 invalid cases (e.g., decrement in C++). */
6122 tree
6124 {
6125 tree val;
6130 {
6153 }
6156 }
6157 \f
6158 /* Built-in macros for stddef.h and stdint.h, that require macros
6159 defined in this file. */
6160 void
6162 {
6225 }
6227 static void
6229 {
6230 /* Fill in the built_in_attributes array. */
6231 #define DEF_ATTR_NULL_TREE(ENUM) \
6232 built_in_attributes[(int) ENUM] = NULL_TREE;
6233 #define DEF_ATTR_INT(ENUM, VALUE) \
6234 built_in_attributes[(int) ENUM] = build_int_cst (integer_type_node, VALUE);
6235 #define DEF_ATTR_STRING(ENUM, VALUE) \
6236 built_in_attributes[(int) ENUM] = build_string (strlen (VALUE), VALUE);
6237 #define DEF_ATTR_IDENT(ENUM, STRING) \
6238 built_in_attributes[(int) ENUM] = get_identifier (STRING);
6239 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
6240 built_in_attributes[(int) ENUM] \
6241 = tree_cons (built_in_attributes[(int) PURPOSE], \
6242 built_in_attributes[(int) VALUE], \
6243 built_in_attributes[(int) CHAIN]);
6245 #undef DEF_ATTR_NULL_TREE
6246 #undef DEF_ATTR_INT
6247 #undef DEF_ATTR_IDENT
6248 #undef DEF_ATTR_TREE_LIST
6249 }
6251 /* Returns TRUE iff the attribute indicated by ATTR_ID takes a plain
6252 identifier as an argument, so the front end shouldn't look it up. */
6254 bool
6256 {
6259 /* Unknown attribute that we'll end up ignoring, return true so we
6260 don't complain about an identifier argument. */
6266 else
6268 }
6270 /* Attribute handlers common to C front ends. */
6272 /* Handle a "packed" attribute; arguments as in
6273 struct attribute_spec.handler. */
6275 static tree
6278 {
6280 {
6284 }
6286 {
6288 /* Still pack bitfields. */
6293 else
6295 }
6296 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
6297 used for DECL_REGISTER. It wouldn't mean anything anyway.
6298 We can't set DECL_PACKED on the type of a TYPE_DECL, because
6299 that changes what the typedef is typing. */
6300 else
6301 {
6304 }
6307 }
6309 /* Handle a "nocommon" attribute; arguments as in
6310 struct attribute_spec.handler. */
6312 static tree
6316 {
6319 else
6320 {
6323 }
6326 }
6328 /* Handle a "common" attribute; arguments as in
6329 struct attribute_spec.handler. */
6331 static tree
6334 {
6337 else
6338 {
6341 }
6344 }
6346 /* Handle a "noreturn" attribute; arguments as in
6347 struct attribute_spec.handler. */
6349 static tree
6352 {
6355 /* See FIXME comment in c_common_attribute_table. */
6362 = build_pointer_type
6365 else
6366 {
6369 }
6372 }
6374 /* Handle a "hot" and attribute; arguments as in
6375 struct attribute_spec.handler. */
6377 static tree
6380 {
6383 {
6385 {
6389 }
6390 /* Most of the rest of the hot processing is done later with
6391 lookup_attribute. */
6392 }
6393 else
6394 {
6397 }
6400 }
6402 /* Handle a "cold" and attribute; arguments as in
6403 struct attribute_spec.handler. */
6405 static tree
6408 {
6411 {
6413 {
6417 }
6418 /* Most of the rest of the cold processing is done later with
6419 lookup_attribute. */
6420 }
6421 else
6422 {
6425 }
6428 }
6430 /* Handle a "noinline" attribute; arguments as in
6431 struct attribute_spec.handler. */
6433 static tree
6437 {
6440 else
6441 {
6444 }
6447 }
6449 /* Handle a "noclone" attribute; arguments as in
6450 struct attribute_spec.handler. */
6452 static tree
6456 {
6458 {
6461 }
6464 }
6466 /* Handle a "always_inline" attribute; arguments as in
6467 struct attribute_spec.handler. */
6469 static tree
6474 {
6476 {
6477 /* Set the attribute and mark it for disregarding inline
6478 limits. */
6480 }
6481 else
6482 {
6485 }
6488 }
6490 /* Handle a "gnu_inline" attribute; arguments as in
6491 struct attribute_spec.handler. */
6493 static tree
6498 {
6500 {
6501 /* Do nothing else, just set the attribute. We'll get at
6502 it later with lookup_attribute. */
6503 }
6504 else
6505 {
6508 }
6511 }
6513 /* Handle a "leaf" attribute; arguments as in
6514 struct attribute_spec.handler. */
6516 static tree
6520 {
6522 {
6525 }
6527 {
6530 }
6533 }
6535 /* Handle an "artificial" attribute; arguments as in
6536 struct attribute_spec.handler. */
6538 static tree
6543 {
6545 {
6546 /* Do nothing else, just set the attribute. We'll get at
6547 it later with lookup_attribute. */
6548 }
6549 else
6550 {
6553 }
6556 }
6558 /* Handle a "flatten" attribute; arguments as in
6559 struct attribute_spec.handler. */
6561 static tree
6563 tree args ATTRIBUTE_UNUSED,
6565 {
6567 /* Do nothing else, just set the attribute. We'll get at
6568 it later with lookup_attribute. */
6569 ;
6570 else
6571 {
6574 }
6577 }
6579 /* Handle a "warning" or "error" attribute; arguments as in
6580 struct attribute_spec.handler. */
6582 static tree
6585 {
6588 /* Do nothing else, just set the attribute. We'll get at
6589 it later with lookup_attribute. */
6590 ;
6591 else
6592 {
6595 }
6598 }
6600 /* Handle a "used" attribute; arguments as in
6601 struct attribute_spec.handler. */
6603 static tree
6606 {
6612 {
6617 }
6618 else
6619 {
6622 }
6625 }
6627 /* Handle a "unused" attribute; arguments as in
6628 struct attribute_spec.handler. */
6630 static tree
6633 {
6635 {
6643 {
6648 }
6649 else
6650 {
6653 }
6654 }
6655 else
6656 {
6660 }
6663 }
6665 /* Handle a "externally_visible" attribute; arguments as in
6666 struct attribute_spec.handler. */
6668 static tree
6673 {
6677 {
6680 {
6684 }
6685 }
6686 else
6687 {
6690 }
6693 }
6695 /* Handle a "const" attribute; arguments as in
6696 struct attribute_spec.handler. */
6698 static tree
6701 {
6704 /* See FIXME comment on noreturn in c_common_attribute_table. */
6710 = build_pointer_type
6713 else
6714 {
6717 }
6720 }
6722 /* Handle a "transparent_union" attribute; arguments as in
6723 struct attribute_spec.handler. */
6725 static tree
6729 {
6730 tree type;
6739 {
6740 /* Make sure that the first field will work for a transparent union.
6741 If the type isn't complete yet, leave the check to the code in
6742 finish_struct. */
6744 {
6750 }
6753 {
6754 /* If the type isn't complete yet, setting the flag
6755 on a variant wouldn't ever be checked. */
6759 /* build_duplicate_type doesn't work for C++. */
6763 /* A type variant isn't good enough, since we don't a cast
6764 to such a type removed as a no-op. */
6766 }
6770 }
6772 ignored:
6775 }
6777 /* Subroutine of handle_{con,de}structor_attribute. Evaluate ARGS to
6778 get the requested priority for a constructor or destructor,
6779 possibly issuing diagnostics for invalid or reserved
6780 priorities. */
6782 static priority_type
6784 {
6785 HOST_WIDE_INT pri;
6786 tree arg;
6792 {
6795 else
6798 }
6811 {
6814 "destructor priorities from 0 to %d are reserved "
6816 MAX_RESERVED_INIT_PRIORITY);
6817 else
6819 "constructor priorities from 0 to %d are reserved "
6821 MAX_RESERVED_INIT_PRIORITY);
6822 }
6825 invalid:
6828 MAX_INIT_PRIORITY);
6829 else
6831 MAX_INIT_PRIORITY);
6833 }
6835 /* Handle a "constructor" attribute; arguments as in
6836 struct attribute_spec.handler. */
6838 static tree
6842 {
6849 {
6850 priority_type priority;
6855 }
6856 else
6857 {
6860 }
6863 }
6865 /* Handle a "destructor" attribute; arguments as in
6866 struct attribute_spec.handler. */
6868 static tree
6872 {
6879 {
6880 priority_type priority;
6885 }
6886 else
6887 {
6890 }
6893 }
6895 /* Nonzero if the mode is a valid vector mode for this architecture.
6896 This returns nonzero even if there is no hardware support for the
6897 vector mode, but we can emulate with narrower modes. */
6899 static int
6901 {
6905 /* Doh! What's going on? */
6914 /* Hardware support. Woo hoo! */
6920 /* We should probably return 1 if requesting V4DI and we have no DI,
6921 but we have V2DI, but this is probably very unlikely. */
6923 /* If we have support for the inner mode, we can safely emulate it.
6924 We may not have V2DI, but me can emulate with a pair of DIs. */
6926 }
6929 /* Handle a "mode" attribute; arguments as in
6930 struct attribute_spec.handler. */
6932 static tree
6935 {
6943 else
6944 {
6949 tree typefm;
6954 {
6960 }
6962 /* Change this type to have a type with the specified mode.
6963 First check for the special modes. */
6976 else
6979 {
6982 }
6985 {
6988 }
6992 {
7024 }
7026 {
7029 }
7032 {
7037 {
7040 }
7044 else
7047 }
7048 else
7049 {
7050 /* For fixed-point modes, we need to test if the signness of type
7051 and the machine mode are consistent. */
7054 {
7057 }
7058 /* For fixed-point modes, we need to pass saturating info. */
7062 }
7065 {
7068 }
7070 {
7071 /* For enumeral types, copy the precision from the integer
7072 type returned above. If not an INTEGER_TYPE, we can't use
7073 this mode for this type. */
7075 {
7078 }
7081 {
7084 }
7085 else
7086 {
7087 /* We cannot build a type variant, as there's code that assumes
7088 that TYPE_MAIN_VARIANT has the same mode. This includes the
7089 debug generators. Instead, create a subrange type. This
7090 results in all of the enumeral values being emitted only once
7091 in the original, and the subtype gets them by reference. */
7094 else
7097 }
7098 }
7102 {
7105 }
7108 }
7111 }
7113 /* Handle a "section" attribute; arguments as in
7114 struct attribute_spec.handler. */
7116 static tree
7119 {
7123 {
7129 {
7133 {
7135 "section attribute cannot be specified for "
7138 }
7140 /* The decl may have already been given a section attribute
7141 from a previous declaration. Ensure they match. */
7145 {
7149 }
7153 {
7156 }
7157 else
7159 }
7160 else
7161 {
7164 }
7165 }
7166 else
7167 {
7171 }
7174 }
7176 /* Check whether ALIGN is a valid user-specified alignment. If so,
7177 return its base-2 log; if not, output an error and return -1. If
7178 ALLOW_ZERO then 0 is valid and should result in a return of -1 with
7179 no error. */
7180 int
7182 {
7187 {
7190 }
7194 {
7197 }
7199 {
7202 }
7204 }
7206 /* Handle a "aligned" attribute; arguments as in
7207 struct attribute_spec.handler. */
7209 static tree
7212 {
7221 {
7225 }
7232 {
7235 /* If we have a TYPE_DECL, then copy the type, so that we
7236 don't accidentally modify a builtin type. See pushdecl. */
7239 {
7246 }
7247 else
7252 }
7255 {
7258 }
7261 {
7266 else
7270 }
7271 else
7272 {
7275 }
7278 }
7280 /* Handle a "weak" attribute; arguments as in
7281 struct attribute_spec.handler. */
7283 static tree
7288 {
7291 {
7294 }
7296 {
7300 }
7304 else
7308 }
7310 /* Handle an "alias" or "ifunc" attribute; arguments as in
7311 struct attribute_spec.handler, except that IS_ALIAS tells us
7312 whether this is an alias as opposed to ifunc attribute. */
7314 static tree
7317 {
7322 {
7325 }
7329 /* A static variable declaration is always a tentative definition,
7330 but the alias is a non-tentative definition which overrides. */
7333 {
7337 }
7341 {
7345 }
7347 /* Note that the very first time we process a nested declaration,
7348 decl_function_context will not be set. Indeed, *would* never
7349 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
7350 we do below. After such frobbery, pushdecl would set the context.
7351 In any case, this is never what we want. */
7353 {
7354 tree id;
7358 {
7362 }
7364 /* This counts as a use of the object pointed to. */
7369 else
7370 {
7373 else
7376 }
7379 /* ifuncs are also aliases, so set that attribute too. */
7382 }
7383 else
7384 {
7387 }
7390 }
7392 /* Handle an "alias" or "ifunc" attribute; arguments as in
7393 struct attribute_spec.handler. */
7395 static tree
7398 {
7400 }
7402 /* Handle an "alias" or "ifunc" attribute; arguments as in
7403 struct attribute_spec.handler. */
7405 static tree
7408 {
7410 }
7412 /* Handle a "weakref" attribute; arguments as in struct
7413 attribute_spec.handler. */
7415 static tree
7418 {
7421 /* We must ignore the attribute when it is associated with
7422 local-scoped decls, since attribute alias is ignored and many
7423 such symbols do not even have a DECL_WEAK field. */
7425 || current_function_decl
7427 {
7431 }
7434 {
7438 }
7440 /* The idea here is that `weakref("name")' mutates into `weakref,
7441 alias("name")', and weakref without arguments, in turn,
7442 implicitly adds weak. */
7445 {
7452 }
7453 else
7454 {
7459 /* Can't call declare_weak because it wants this to be TREE_PUBLIC,
7460 and that isn't supported; and because it wants to add it to
7461 the list of weak decls, which isn't helpful. */
7463 }
7466 }
7468 /* Handle an "visibility" attribute; arguments as in
7469 struct attribute_spec.handler. */
7471 static tree
7475 {
7481 {
7485 {
7487 name);
7489 }
7491 {
7495 }
7496 }
7498 {
7501 }
7504 {
7507 }
7509 /* If this is a type, set the visibility on the type decl. */
7511 {
7516 {
7518 name);
7520 }
7521 }
7531 else
7532 {
7533 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
7535 }
7539 {
7553 }
7558 /* Go ahead and attach the attribute to the node as well. This is needed
7559 so we can determine whether we have VISIBILITY_DEFAULT because the
7560 visibility was not specified, or because it was explicitly overridden
7561 from the containing scope. */
7564 }
7566 /* Determine the ELF symbol visibility for DECL, which is either a
7567 variable or a function. It is an error to use this function if a
7568 definition of DECL is not available in this translation unit.
7569 Returns true if the final visibility has been determined by this
7570 function; false if the caller is free to make additional
7571 modifications. */
7573 bool
7575 {
7579 /* If the user explicitly specified the visibility with an
7580 attribute, honor that. DECL_VISIBILITY will have been set during
7581 the processing of the attribute. We check for an explicit
7582 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
7583 to distinguish the use of an attribute from the use of a "#pragma
7584 GCC visibility push(...)"; in the latter case we still want other
7585 considerations to be able to overrule the #pragma. */
7587 || (TARGET_DLLIMPORT_DECL_ATTRIBUTES
7592 /* Set default visibility to whatever the user supplied with
7593 visibility_specified depending on #pragma GCC visibility. */
7595 {
7598 {
7601 /* If visibility changed and DECL already has DECL_RTL, ensure
7602 symbol flags are updated. */
7607 }
7608 }
7610 }
7612 /* Handle an "tls_model" attribute; arguments as in
7613 struct attribute_spec.handler. */
7615 static tree
7618 {
7619 tree id;
7626 {
7629 }
7634 {
7637 }
7647 else
7648 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
7652 }
7654 /* Handle a "no_instrument_function" attribute; arguments as in
7655 struct attribute_spec.handler. */
7657 static tree
7662 {
7666 {
7670 }
7672 {
7676 }
7677 else
7681 }
7683 /* Handle a "malloc" attribute; arguments as in
7684 struct attribute_spec.handler. */
7686 static tree
7689 {
7693 else
7694 {
7697 }
7700 }
7702 /* Handle a "alloc_size" attribute; arguments as in
7703 struct attribute_spec.handler. */
7705 static tree
7708 {
7711 {
7718 {
7723 }
7724 }
7726 }
7728 /* Handle a "fn spec" attribute; arguments as in
7729 struct attribute_spec.handler. */
7731 static tree
7735 {
7740 }
7742 /* Handle a "returns_twice" attribute; arguments as in
7743 struct attribute_spec.handler. */
7745 static tree
7748 {
7751 else
7752 {
7755 }
7758 }
7760 /* Handle a "no_limit_stack" attribute; arguments as in
7761 struct attribute_spec.handler. */
7763 static tree
7768 {
7772 {
7776 }
7778 {
7782 }
7783 else
7787 }
7789 /* Handle a "pure" attribute; arguments as in
7790 struct attribute_spec.handler. */
7792 static tree
7795 {
7798 /* ??? TODO: Support types. */
7799 else
7800 {
7803 }
7806 }
7808 /* Digest an attribute list destined for a transactional memory statement.
7809 ALLOWED is the set of attributes that are allowed for this statement;
7810 return the attribute we parsed. Multiple attributes are never allowed. */
7812 int
7814 {
7819 {
7827 {
7830 }
7833 {
7836 }
7839 else
7841 }
7844 }
7846 /* Transform a TM attribute name into a maskable integer and back.
7847 Note that NULL (i.e. no attribute) is mapped to UNKNOWN, corresponding
7848 to how the lack of an attribute is treated. */
7850 int
7852 {
7866 }
7868 tree
7870 {
7873 {
7891 }
7893 }
7895 /* Return the first TM attribute seen in LIST. */
7897 tree
7899 {
7901 {
7905 }
7907 }
7909 /* Handle the TM attributes; arguments as in struct attribute_spec.handler.
7910 Here we accept only function types, and verify that none of the other
7911 function TM attributes are also applied. */
7912 /* ??? We need to accept class types for C++, but not C. This greatly
7913 complicates this function, since we can no longer rely on the extra
7914 processing given by function_type_required. */
7916 static tree
7919 {
7920 /* Only one path adds the attribute; others don't. */
7924 {
7927 /* Only tm_callable and tm_safe apply to classes. */
7930 /* FALLTHRU */
7934 {
7937 ;
7940 else
7942 }
7946 {
7949 {
7954 }
7955 }
7956 /* FALLTHRU */
7959 /* If a function is next, pass it on to be tried next. */
7963 ignored:
7966 }
7969 }
7971 /* Handle the TM_WRAP attribute; arguments as in
7972 struct attribute_spec.handler. */
7974 static tree
7977 {
7980 /* We don't need the attribute even on success, since we
7981 record the entry in an external table. */
7986 else
7987 {
7993 else
7994 {
7998 {
8002 else
8004 }
8005 else
8007 }
8008 }
8011 }
8013 /* Ignore the given attribute. Used when this attribute may be usefully
8014 overridden by the target, but is not used generically. */
8016 static tree
8020 {
8023 }
8025 /* Handle a "no vops" attribute; arguments as in
8026 struct attribute_spec.handler. */
8028 static tree
8032 {
8036 }
8038 /* Handle a "deprecated" attribute; arguments as in
8039 struct attribute_spec.handler. */
8041 static tree
8045 {
8053 {
8056 }
8059 {
8070 else
8072 }
8074 {
8079 }
8080 else
8084 {
8087 {
8093 }
8096 else
8098 }
8101 }
8103 /* Handle a "vector_size" attribute; arguments as in
8104 struct attribute_spec.handler. */
8106 static tree
8110 {
8120 {
8123 }
8125 /* Get the vector size (in bytes). */
8128 /* We need to provide for vector pointers, vector arrays, and
8129 functions returning vectors. For example:
8131 __attribute__((vector_size(16))) short *foo;
8133 In this case, the mode is SI, but the type being modified is
8134 HI, so we need to look further. */
8143 /* Get the mode of the type being modified. */
8154 {
8157 }
8160 {
8163 }
8166 {
8169 }
8171 /* Calculate how many units fit in the vector. */
8174 {
8177 }
8181 /* Build back pointers if needed. */
8185 }
8187 /* Handle the "nonnull" attribute. */
8188 static tree
8192 {
8196 /* If no arguments are specified, all pointer arguments should be
8197 non-null. Verify a full prototype is given so that the arguments
8198 will have the correct types when we actually check them later. */
8200 {
8202 {
8205 }
8207 }
8209 /* Argument list specified. Verify that each argument number references
8210 a pointer argument. */
8212 {
8216 {
8221 }
8224 {
8225 function_args_iterator iter;
8226 tree argument;
8230 {
8234 }
8238 {
8243 }
8246 {
8251 }
8252 }
8253 }
8256 }
8258 /* Check the argument list of a function call for null in argument slots
8259 that are marked as requiring a non-null pointer argument. The NARGS
8260 arguments are passed in the array ARGARRAY.
8261 */
8263 static void
8265 {
8266 tree a;
8274 /* See if any of the nonnull attributes has no arguments. If so,
8275 then every pointer argument is checked (in which case the check
8276 for pointer type is done in check_nonnull_arg). */
8278 do
8286 else
8287 {
8288 /* Walk the argument list. If we encounter an argument number we
8289 should check for non-null, do it. */
8291 {
8293 {
8297 }
8302 }
8303 }
8304 }
8306 /* Check that the Nth argument of a function call (counting backwards
8307 from the end) is a (pointer)0. The NARGS arguments are passed in the
8308 array ARGARRAY. */
8310 static void
8312 {
8316 {
8319 tree sentinel;
8320 function_args_iterator iter;
8321 tree t;
8323 /* Skip over the named arguments. */
8325 {
8328 len++;
8329 }
8332 {
8335 }
8337 /* The sentinel must be one of the varargs, i.e.
8338 in position >= the number of fixed arguments. */
8340 {
8344 }
8346 /* Validate the sentinel. */
8350 /* Although __null (in C++) is only an integer we allow it
8351 nevertheless, as we are guaranteed that it's exactly
8352 as wide as a pointer, and we don't want to force
8353 users to cast the NULL they have written there.
8354 We warn with -Wstrict-null-sentinel, though. */
8357 }
8358 }
8360 /* Helper for check_function_nonnull; given a list of operands which
8361 must be non-null in ARGS, determine if operand PARAM_NUM should be
8362 checked. */
8364 static bool
8366 {
8370 {
8377 }
8379 }
8381 /* Check that the function argument PARAM (which is operand number
8382 PARAM_NUM) is non-null. This is called by check_function_nonnull
8383 via check_function_arguments_recurse. */
8385 static void
8388 {
8389 /* Just skip checking the argument if it's not a pointer. This can
8390 happen if the "nonnull" attribute was given without an operand
8391 list (which means to check every pointer argument). */
8399 }
8401 /* Helper for nonnull attribute handling; fetch the operand number
8402 from the attribute argument list. */
8404 static bool
8406 {
8407 /* Verify the arg number is a constant. */
8414 }
8416 /* Handle a "nothrow" attribute; arguments as in
8417 struct attribute_spec.handler. */
8419 static tree
8422 {
8425 /* ??? TODO: Support types. */
8426 else
8427 {
8430 }
8433 }
8435 /* Handle a "cleanup" attribute; arguments as in
8436 struct attribute_spec.handler. */
8438 static tree
8441 {
8445 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
8446 for global destructors in C++. This requires infrastructure that
8447 we don't have generically at the moment. It's also not a feature
8448 we'd be missing too much, since we do have attribute constructor. */
8450 {
8454 }
8456 /* Verify that the argument is a function in scope. */
8457 /* ??? We could support pointers to functions here as well, if
8458 that was considered desirable. */
8461 {
8465 }
8468 {
8472 }
8474 /* That the function has proper type is checked with the
8475 eventual call to build_function_call. */
8478 }
8480 /* Handle a "warn_unused_result" attribute. No special handling. */
8482 static tree
8486 {
8487 /* Ignore the attribute for functions not returning any value. */
8489 {
8492 }
8495 }
8497 /* Handle a "sentinel" attribute. */
8499 static tree
8502 {
8504 {
8508 }
8509 else
8510 {
8512 {
8516 }
8517 }
8520 {
8524 {
8528 }
8529 else
8530 {
8532 {
8536 }
8537 }
8538 }
8541 }
8543 /* Handle a "type_generic" attribute. */
8545 static tree
8549 {
8550 /* Ensure we have a function type. */
8553 /* Ensure we have a variadic function. */
8557 }
8559 /* Handle a "target" attribute. */
8561 static tree
8564 {
8565 /* Ensure we have a function type. */
8567 {
8570 }
8572 flags))
8576 }
8578 /* Arguments being collected for optimization. */
8585 /* Inner function to convert a TREE_LIST to argv string to parse the optimize
8586 options in ARGS. ATTR_P is true if this is for attribute(optimize), and
8587 false for #pragma GCC optimize. */
8589 bool
8591 {
8599 tree ap;
8601 /* Build up argv vector. Just in case the string is stored away, use garbage
8602 collected strings. */
8607 {
8611 {
8615 }
8618 {
8619 /* Split string into multiple substrings. */
8627 {
8634 {
8638 }
8639 else
8640 {
8643 }
8647 /* If the user supplied -Oxxx or -fxxx, only allow -Oxxx or -fxxx
8648 options. */
8650 {
8655 else
8659 }
8662 {
8665 /* Assume that Ox is -Ox, a numeric value is -Ox, a s by
8666 itself is -Os, and any other switch begins with a -f. */
8672 }
8677 }
8679 }
8680 }
8690 /* Now parse the options. */
8700 /* Don't allow changing -fstrict-aliasing. */
8705 }
8707 /* For handling "optimize" attribute. arguments as in
8708 struct attribute_spec.handler. */
8710 static tree
8713 {
8714 /* Ensure we have a function type. */
8716 {
8719 }
8720 else
8721 {
8725 /* Save current options. */
8728 /* If we previously had some optimization options, use them as the
8729 default. */
8734 /* Parse options, and update the vector. */
8739 /* Restore current options. */
8741 }
8744 }
8746 /* Handle a "no_split_stack" attribute. */
8748 static tree
8753 {
8757 {
8761 }
8763 {
8767 }
8770 }
8771 \f
8772 /* Check for valid arguments being passed to a function with FNTYPE.
8773 There are NARGS arguments in the array ARGARRAY. */
8774 void
8776 {
8777 /* Check for null being passed in a pointer argument that must be
8778 non-null. We also need to do this if format checking is enabled. */
8783 /* Check for errors in format strings. */
8790 }
8792 /* Generic argument checking recursion routine. PARAM is the argument to
8793 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
8794 once the argument is resolved. CTX is context for the callback. */
8795 void
8800 {
8804 {
8805 /* Strip coercion. */
8809 }
8812 {
8814 tree attrs;
8817 /* See if this is a call to a known internationalization function
8818 that modifies a format arg. Such a function may have multiple
8819 format_arg attributes (for example, ngettext). */
8822 attrs;
8825 {
8826 tree inner_arg;
8827 tree format_num_expr;
8830 call_expr_arg_iterator iter;
8832 /* Extract the argument number, which was previously checked
8833 to be valid. */
8845 {
8850 }
8851 }
8853 /* If we found a format_arg attribute and did a recursive check,
8854 we are done with checking this argument. Otherwise, we continue
8855 and this will be considered a non-literal. */
8858 }
8861 {
8862 /* Check both halves of the conditional expression. */
8868 }
8871 }
8873 /* Checks for a builtin function FNDECL that the number of arguments
8874 NARGS against the required number REQUIRED and issues an error if
8875 there is a mismatch. Returns true if the number of arguments is
8876 correct, otherwise false. */
8878 static bool
8880 {
8882 {
8886 }
8888 {
8892 }
8894 }
8896 /* Verifies the NARGS arguments ARGS to the builtin function FNDECL.
8897 Returns false if there was an error, otherwise true. */
8899 bool
8901 {
8907 {
8917 {
8919 {
8923 }
8925 }
8935 {
8942 {
8946 }
8948 }
8953 {
8958 {
8962 }
8965 {
8967 fndecl);
8969 }
8971 }
8976 {
8978 {
8981 }
8983 }
8988 }
8989 }
8991 /* Function to help qsort sort FIELD_DECLs by name order. */
8993 int
8995 {
9000 /* A nontype is "greater" than a type. */
9009 }
9012 gt_pointer_operator new_value;
9016 /* This routine compares two fields like field_decl_cmp but using the
9017 pointer operator in resort_data. */
9019 static int
9021 {
9026 /* A nontype is "greater" than a type. */
9032 {
9039 }
9041 }
9043 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
9045 void
9048 gt_pointer_operator new_value,
9050 {
9055 resort_field_decl_cmp);
9056 }
9058 /* Subroutine of c_parse_error.
9059 Return the result of concatenating LHS and RHS. RHS is really
9060 a string literal, its first character is indicated by RHS_START and
9061 RHS_SIZE is its length (including the terminating NUL character).
9063 The caller is responsible for deleting the returned pointer. */
9067 {
9073 }
9075 /* Issue the error given by GMSGID, indicating that it occurred before
9076 TOKEN, which had the associated VALUE. */
9078 void
9081 {
9082 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
9092 {
9097 {
9110 }
9114 else
9120 }
9130 {
9135 }
9143 {
9148 }
9149 else
9153 {
9156 }
9157 #undef catenate_messages
9158 }
9160 /* Mapping for cpp message reasons to the options that enable them. */
9162 struct reason_option_codes_t
9163 {
9166 };
9186 };
9188 /* Return the gcc option code associated with the reason for a cpp
9189 message, or 0 if none. */
9191 static int
9193 {
9197 {
9200 }
9202 }
9204 /* Callback from cpp_error for PFILE to print diagnostics from the
9205 preprocessor. The diagnostic is of type LEVEL, with REASON set
9206 to the reason code if LEVEL is represents a warning, at location
9207 LOCATION unless this is after lexing and the compiler's location
9208 should be used instead, with column number possibly overridden by
9209 COLUMN_OVERRIDE if not zero; MSG is the translated message and AP
9210 the arguments. Returns true if a diagnostic was emitted, false
9211 otherwise. */
9213 bool
9217 {
9218 diagnostic_info diagnostic;
9219 diagnostic_t dlevel;
9224 {
9229 /* Fall through. */
9254 }
9267 }
9269 /* Convert a character from the host to the target execution character
9270 set. cpplib handles this, mostly. */
9272 HOST_WIDE_INT
9274 {
9275 /* Character constants in GCC proper are sign-extended under -fsigned-char,
9276 zero-extended under -fno-signed-char. cpplib insists that characters
9277 and character constants are always unsigned. Hence we must convert
9278 back and forth. */
9286 else
9288 }
9290 /* Fold an offsetof-like expression. EXPR is a nested sequence of component
9291 references with an INDIRECT_REF of a constant at the bottom; much like the
9292 traditional rendering of offsetof as a macro. Return the folded result. */
9294 tree
9296 {
9300 {
9316 {
9319 }
9329 {
9333 }
9347 /* Check if the offset goes beyond the upper bound of the array. */
9349 {
9355 {
9359 {
9360 tree v;
9367 {
9375 }
9376 /* Don't warn if the array might be considered a poor
9377 man's flexible array member with a very permissive
9378 definition thereof. */
9382 "index %E denotes an offset "
9385 }
9386 }
9387 }
9394 /* Handle static members of volatile structs. */
9401 }
9404 }
9406 /* Likewise, but convert it to the return type of offsetof. */
9408 tree
9410 {
9412 }
9414 /* Warn for A ?: C expressions (with B omitted) where A is a boolean
9415 expression, because B will always be true. */
9417 void
9419 {
9422 "the omitted middle operand in ?: will always be %<true%>, "
9424 }
9426 /* Give an error for storing into ARG, which is 'const'. USE indicates
9427 how ARG was being used. */
9429 void
9431 {
9434 /* Using this macro rather than (for example) arrays of messages
9435 ensures that all the format strings are checked at compile
9436 time. */
9437 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
9438 : (use == lv_increment ? (I) \
9439 : (use == lv_decrement ? (D) : (AS))))
9441 {
9452 else
9458 }
9464 arg);
9470 arg);
9472 {
9482 arg);
9483 }
9489 arg);
9490 else
9495 arg);
9496 }
9498 /* Print an error message for an invalid lvalue. USE says
9499 how the lvalue is being used and so selects the error message. LOC
9500 is the location for the error. */
9502 void
9504 {
9506 {
9524 }
9525 }
9527 /* Print an error message for an invalid indirection of type TYPE.
9528 ERRSTRING is the name of the operator for the indirection. */
9530 void
9532 {
9534 {
9542 type);
9547 type);
9552 type);
9557 type);
9561 }
9562 }
9563 \f
9564 /* *PTYPE is an incomplete array. Complete it with a domain based on
9565 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
9566 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
9567 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
9569 int
9571 {
9578 {
9580 {
9581 int eltsize
9584 }
9586 {
9590 {
9594 }
9595 else
9596 {
9597 tree curindex;
9610 cnt++)
9611 {
9615 else
9616 {
9620 size_one_node);
9621 }
9624 }
9627 }
9628 }
9629 else
9630 {
9631 /* Make an error message unless that happened already. */
9634 }
9635 }
9636 else
9637 {
9641 }
9644 /* Force an indefinite layout factor. */
9651 else
9654 /* Using build_distinct_type_copy and modifying things afterward instead
9655 of using build_array_type to create a new type preserves all of the
9656 TYPE_LANG_FLAG_? bits that the front end may have set. */
9664 /* Make sure we have the canonical MAIN_TYPE. */
9667 hashcode);
9670 /* Fix the canonical type. */
9680 else
9685 else
9691 {
9693 /* If we proceed with the array type as it is, we'll eventually
9694 crash in tree_low_cst(). */
9696 }
9700 }
9702 /* Like c_mark_addressable but don't check register qualifier. */
9703 void
9705 {
9711 }
9714 \f
9715 /* Used to help initialize the builtin-types.def table. When a type of
9716 the correct size doesn't exist, use error_mark_node instead of NULL.
9717 The later results in segfaults even when a decl using the type doesn't
9718 get invoked. */
9720 tree
9722 {
9725 }
9727 /* A helper function for resolve_overloaded_builtin in resolving the
9728 overloaded __sync_ builtins. Returns a positive power of 2 if the
9729 first operand of PARAMS is a pointer to a supported data type.
9730 Returns 0 if an error is encountered. */
9732 static int
9734 {
9735 tree type;
9739 {
9742 }
9756 incompatible:
9759 }
9761 /* A helper function for resolve_overloaded_builtin. Adds casts to
9762 PARAMS to make arguments match up with those of FUNCTION. Drops
9763 the variadic arguments at the end. Returns false if some error
9764 was encountered; true on success. */
9766 static bool
9769 {
9770 function_args_iterator iter;
9771 tree ptype;
9775 /* We've declared the implementation functions to use "volatile void *"
9776 as the pointer parameter, so we shouldn't get any complaints from the
9777 call to check_function_arguments what ever type the user used. */
9781 /* For the rest of the values, we need to cast these to FTYPE, so that we
9782 don't get warnings for passing pointer types, etc. */
9785 {
9789 /* XXX void_type_node belies the abstraction. */
9795 {
9798 }
9800 /* Only convert parameters if arg_type is unsigned integer type with
9801 new format sync routines, i.e. don't attempt to convert pointer
9802 arguments (e.g. EXPECTED argument of __atomic_compare_exchange_n),
9803 bool arguments (e.g. WEAK argument) or signed int arguments (memmodel
9804 kinds). */
9806 {
9807 /* Ideally for the first conversion we'd use convert_for_assignment
9808 so that we get warnings for anything that doesn't match the pointer
9809 type. This isn't portable across the C and C++ front ends atm. */
9814 }
9817 }
9819 /* __atomic routines are not variadic. */
9821 {
9824 }
9826 /* The definition of these primitives is variadic, with the remaining
9827 being "an optional list of variables protected by the memory barrier".
9828 No clue what that's supposed to mean, precisely, but we consider all
9829 call-clobbered variables to be protected so we're safe. */
9833 }
9835 /* A helper function for resolve_overloaded_builtin. Adds a cast to
9836 RESULT to make it match the type of the first pointer argument in
9837 PARAMS. */
9839 static tree
9841 {
9846 /* New format doesn't require casting unless the types are the same size. */
9849 else
9851 }
9853 /* This function verifies the PARAMS to generic atomic FUNCTION.
9854 It returns the size if all the parameters are the same size, otherwise
9855 0 is returned if the parameters are invalid. */
9857 static int
9859 {
9864 tree type_0;
9866 /* Determine the parameter makeup. */
9868 {
9884 }
9887 {
9890 }
9892 /* Get type of first parameter, and determine its size. */
9895 {
9897 function);
9899 }
9901 /* Types must be compile time constant sizes. */
9903 {
9906 function);
9908 }
9912 /* Zero size objects are not allowed. */
9914 {
9917 function);
9919 }
9921 /* Check each other parameter is a pointer and the same size. */
9923 {
9926 /* __atomic_compare_exchange has a bool in the 4th postion, skip it. */
9930 {
9932 function);
9934 }
9937 {
9939 function);
9941 }
9942 }
9944 /* Check memory model parameters for validity. */
9946 {
9949 {
9952 {
9955 function);
9956 }
9957 }
9958 else
9960 {
9962 function);
9964 }
9965 }
9968 }
9971 /* This will take an __atomic_ generic FUNCTION call, and add a size parameter N
9972 at the beginning of the parameter list PARAMS representing the size of the
9973 objects. This is to match the library ABI requirement. LOC is the location
9974 of the function call.
9975 The new function is returned if it needed rebuilding, otherwise NULL_TREE is
9976 returned to allow the external call to be constructed. */
9978 static tree
9981 {
9982 tree size_node;
9984 /* Insert a SIZE_T parameter as the first param. If there isn't
9985 enough space, allocate a new vector and recursively re-build with that. */
9987 {
9990 tree f;
9999 }
10001 /* Add the size parameter and leave as a function call for processing. */
10005 }
10008 /* This will process an __atomic_exchange function call, determine whether it
10009 needs to be mapped to the _N variation, or turned into a library call.
10010 LOC is the location of the builtin call.
10011 FUNCTION is the DECL that has been invoked;
10012 PARAMS is the argument list for the call. The return value is non-null
10013 TRUE is returned if it is translated into the proper format for a call to the
10014 external library, and NEW_RETURN is set the tree for that function.
10015 FALSE is returned if processing for the _N variation is required, and
10016 NEW_RETURN is set to the the return value the result is copied into. */
10017 static bool
10020 {
10025 /* Size of 0 is an error condition. */
10027 {
10030 }
10032 /* If not a lock-free size, change to the library generic format. */
10034 {
10037 }
10039 /* Otherwise there is a lockfree match, transform the call from:
10040 void fn(T* mem, T* desired, T* return, model)
10041 into
10042 *return = (T) (fn (In* mem, (In) *desired, model)) */
10049 /* Create pointer to appropriate size. */
10053 /* Convert object pointer to required type. */
10056 /* Convert new value to required type, and dereference it. */
10061 /* Move memory model to the 3rd position, and end param list. */
10065 /* Convert return pointer and dereference it for later assignment. */
10069 }
10072 /* This will process an __atomic_compare_exchange function call, determine
10073 whether it needs to be mapped to the _N variation, or turned into a lib call.
10074 LOC is the location of the builtin call.
10075 FUNCTION is the DECL that has been invoked;
10076 PARAMS is the argument list for the call. The return value is non-null
10077 TRUE is returned if it is translated into the proper format for a call to the
10078 external library, and NEW_RETURN is set the tree for that function.
10079 FALSE is returned if processing for the _N variation is required. */
10081 static bool
10085 {
10090 /* Size of 0 is an error condition. */
10092 {
10095 }
10097 /* If not a lock-free size, change to the library generic format. */
10099 {
10100 /* The library generic format does not have the weak parameter, so
10101 remove it from the param list. Since a parameter has been removed,
10102 we can be sure that there is room for the SIZE_T parameter, meaning
10103 there will not be a recursive rebuilding of the parameter list, so
10104 there is no danger this will be done twice. */
10106 {
10110 }
10113 }
10115 /* Otherwise, there is a match, so the call needs to be transformed from:
10116 bool fn(T* mem, T* desired, T* return, weak, success, failure)
10117 into
10118 bool fn ((In *)mem, (In *)expected, (In) *desired, weak, succ, fail) */
10124 /* Create pointer to appropriate size. */
10128 /* Convert object pointer to required type. */
10132 /* Convert expected pointer to required type. */
10136 /* Convert desired value to required type, and dereference it. */
10141 /* The rest of the parameters are fine. NULL means no special return value
10142 processing.*/
10145 }
10148 /* This will process an __atomic_load function call, determine whether it
10149 needs to be mapped to the _N variation, or turned into a library call.
10150 LOC is the location of the builtin call.
10151 FUNCTION is the DECL that has been invoked;
10152 PARAMS is the argument list for the call. The return value is non-null
10153 TRUE is returned if it is translated into the proper format for a call to the
10154 external library, and NEW_RETURN is set the tree for that function.
10155 FALSE is returned if processing for the _N variation is required, and
10156 NEW_RETURN is set to the the return value the result is copied into. */
10158 static bool
10161 {
10166 /* Size of 0 is an error condition. */
10168 {
10171 }
10173 /* If not a lock-free size, change to the library generic format. */
10175 {
10178 }
10180 /* Otherwise, there is a match, so the call needs to be transformed from:
10181 void fn(T* mem, T* return, model)
10182 into
10183 *return = (T) (fn ((In *) mem, model)) */
10189 /* Create pointer to appropriate size. */
10193 /* Convert object pointer to required type. */
10197 /* Move memory model to the 2nd position, and end param list. */
10201 /* Convert return pointer and dereference it for later assignment. */
10205 }
10208 /* This will process an __atomic_store function call, determine whether it
10209 needs to be mapped to the _N variation, or turned into a library call.
10210 LOC is the location of the builtin call.
10211 FUNCTION is the DECL that has been invoked;
10212 PARAMS is the argument list for the call. The return value is non-null
10213 TRUE is returned if it is translated into the proper format for a call to the
10214 external library, and NEW_RETURN is set the tree for that function.
10215 FALSE is returned if processing for the _N variation is required, and
10216 NEW_RETURN is set to the the return value the result is copied into. */
10218 static bool
10221 {
10226 /* Size of 0 is an error condition. */
10228 {
10231 }
10233 /* If not a lock-free size, change to the library generic format. */
10235 {
10238 }
10240 /* Otherwise, there is a match, so the call needs to be transformed from:
10241 void fn(T* mem, T* value, model)
10242 into
10243 fn ((In *) mem, (In) *value, model) */
10248 /* Create pointer to appropriate size. */
10252 /* Convert object pointer to required type. */
10256 /* Convert new value to required type, and dereference it. */
10261 /* The memory model is in the right spot already. Return is void. */
10265 }
10268 /* Some builtin functions are placeholders for other expressions. This
10269 function should be called immediately after parsing the call expression
10270 before surrounding code has committed to the type of the expression.
10272 LOC is the location of the builtin call.
10274 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
10275 PARAMS is the argument list for the call. The return value is non-null
10276 when expansion is complete, and null if normal processing should
10277 continue. */
10279 tree
10281 {
10287 {
10293 else
10297 }
10299 /* Handle BUILT_IN_NORMAL here. */
10301 {
10306 {
10307 /* Handle these 4 together so that they can fall through to the next
10308 case if the call is transformed to an _N variant. */
10310 {
10312 {
10316 /* Change to the _N variant. */
10319 }
10322 {
10324 params,
10327 /* Change to the _N variant. */
10330 }
10332 {
10336 /* Change to the _N variant. */
10339 }
10341 {
10345 /* Change to the _N variant. */
10348 }
10351 }
10352 /* Fallthrough to the normal processing. */
10353 }
10370 {
10372 /* Fallthru for parameter processing. */
10373 }
10390 {
10401 orig_format))
10413 /* If new_return is set, assign function to that expr and cast the
10414 result to void since the generic interface returned void. */
10416 {
10417 /* Cast function result from I{1,2,4,8,16} to the required type. */
10420 result);
10424 }
10426 }
10430 }
10431 }
10433 /* Ignoring their sign, return true if two scalar types are the same. */
10434 bool
10436 {
10443 /* Equality works here because c_common_signed_type uses
10444 TYPE_MAIN_VARIANT. */
10447 }
10449 /* Check for missing format attributes on function pointers. LTYPE is
10450 the new type or left-hand side type. RTYPE is the old type or
10451 right-hand side type. Returns TRUE if LTYPE is missing the desired
10452 attribute. */
10454 bool
10456 {
10458 tree ra;
10464 {
10465 tree la;
10470 }
10471 else
10473 }
10475 /* Subscripting with type char is likely to lose on a machine where
10476 chars are signed. So warn on any machine, but optionally. Don't
10477 warn for unsigned char since that type is safe. Don't warn for
10478 signed char because anyone who uses that must have done so
10479 deliberately. Furthermore, we reduce the false positive load by
10480 warning only for non-constant value of type char. */
10482 void
10484 {
10488 }
10490 /* Implement -Wparentheses for the unexpected C precedence rules, to
10491 cover cases like x + y << z which readers are likely to
10492 misinterpret. We have seen an expression in which CODE is a binary
10493 operator used to combine expressions ARG_LEFT and ARG_RIGHT, which
10494 before folding had CODE_LEFT and CODE_RIGHT. CODE_LEFT and
10495 CODE_RIGHT may be ERROR_MARK, which means that that side of the
10496 expression was not formed using a binary or unary operator, or it
10497 was enclosed in parentheses. */
10499 void
10503 {
10507 /* This macro tests that the expression ARG with original tree code
10508 CODE appears to be a boolean expression. or the result of folding a
10509 boolean expression. */
10510 #define APPEARS_TO_BE_BOOLEAN_EXPR_P(CODE, ARG) \
10511 (truth_value_p (TREE_CODE (ARG)) \
10512 || TREE_CODE (TREE_TYPE (ARG)) == BOOLEAN_TYPE \
10514 || ((CODE) != INTEGER_CST \
10515 && (integer_onep (ARG) || integer_zerop (ARG))))
10518 {
10550 /* Check cases like x|y==z */
10555 /* Check cases like !x | y */
10569 /* Check cases like x^y==z */
10583 /* Check cases like x&y==z */
10588 /* Check cases like !x & y */
10619 }
10620 #undef NOT_A_BOOLEAN_EXPR_P
10621 }
10623 /* If LABEL (a LABEL_DECL) has not been used, issue a warning. */
10625 void
10627 {
10629 {
10632 else
10634 }
10635 }
10637 /* Warn for division by zero according to the value of DIVISOR. LOC
10638 is the location of the division operator. */
10640 void
10642 {
10643 /* If DIVISOR is zero, and has integral or fixed-point type, issue a warning
10644 about division by zero. Do not issue a warning if DIVISOR has a
10645 floating-point type, since we consider 0.0/0.0 a valid way of
10646 generating a NaN. */
10650 }
10652 /* Subroutine of build_binary_op. Give warnings for comparisons
10653 between signed and unsigned quantities that may fail. Do the
10654 checking based on the original operand trees ORIG_OP0 and ORIG_OP1,
10655 so that casts will be considered, but default promotions won't
10656 be.
10658 LOCATION is the location of the comparison operator.
10660 The arguments of this function map directly to local variables
10661 of build_binary_op. */
10663 void
10668 {
10673 /* In C++, check for comparison of different enum types. */
10679 {
10683 }
10685 /* Do not warn if the comparison is being done in a signed type,
10686 since the signed type will only be chosen if it can represent
10687 all the values of the unsigned type. */
10690 /* Do not warn if both operands are unsigned. */
10693 else
10694 {
10700 else
10708 /* Do not warn if the signed quantity is an unsuffixed integer
10709 literal (or some static constant expression involving such
10710 literals or a conditional expression involving such literals)
10711 and it is non-negative. */
10714 /* Do not warn if the comparison is an equality operation, the
10715 unsigned quantity is an integral constant, and it would fit
10716 in the result if the result were signed. */
10721 /* In C, do not warn if the unsigned quantity is an enumeration
10722 constant and its maximum value would fit in the result if the
10723 result were signed. */
10729 else
10731 OPT_Wsign_compare,
10733 }
10735 /* Warn if two unsigned values are being compared in a size larger
10736 than their original size, and one (and only one) is the result of
10737 a `~' operator. This comparison will always fail.
10739 Also warn if one operand is a constant, and the constant does not
10740 have all bits set that are set in the ~ operand when it is
10741 extended. */
10748 {
10755 {
10756 tree primop;
10762 {
10766 }
10767 else
10768 {
10772 }
10777 {
10780 {
10784 else
10787 }
10788 }
10789 }
10797 }
10798 }
10800 /* RESULT_TYPE is the result of converting TYPE1 and TYPE2 to a common
10801 type via c_common_type. If -Wdouble-promotion is in use, and the
10802 conditions for warning have been met, issue a warning. GMSGID is
10803 the warning message. It must have two %T specifiers for the type
10804 that was converted (generally "float") and the type to which it was
10805 converted (generally "double), respectively. LOC is the location
10806 to which the awrning should refer. */
10808 void
10811 {
10812 tree source_type;
10816 /* If the conversion will not occur at run-time, there is no need to
10817 warn about it. */
10829 else
10832 }
10834 /* Setup a TYPE_DECL node as a typedef representation.
10836 X is a TYPE_DECL for a typedef statement. Create a brand new
10837 ..._TYPE node (which will be just a variant of the existing
10838 ..._TYPE node with identical properties) and then install X
10839 as the TYPE_NAME of this brand new (duplicate) ..._TYPE node.
10841 The whole point here is to end up with a situation where each
10842 and every ..._TYPE node the compiler creates will be uniquely
10843 associated with AT MOST one node representing a typedef name.
10844 This way, even though the compiler substitutes corresponding
10845 ..._TYPE nodes for TYPE_DECL (i.e. "typedef name") nodes very
10846 early on, later parts of the compiler can always do the reverse
10847 translation and get back the corresponding typedef name. For
10848 example, given:
10850 typedef struct S MY_TYPE;
10851 MY_TYPE object;
10853 Later parts of the compiler might only know that `object' was of
10854 type `struct S' if it were not for code just below. With this
10855 code however, later parts of the compiler see something like:
10857 struct S' == struct S
10858 typedef struct S' MY_TYPE;
10859 struct S' object;
10861 And they can then deduce (from the node for type struct S') that
10862 the original object declaration was:
10864 MY_TYPE object;
10866 Being able to do this is important for proper support of protoize,
10867 and also for generating precise symbolic debugging information
10868 which takes full account of the programmer's (typedef) vocabulary.
10870 Obviously, we don't want to generate a duplicate ..._TYPE node if
10871 the TYPE_DECL node that we are now processing really represents a
10872 standard built-in type. */
10874 void
10876 {
10880 {
10883 }
10886 {
10894 }
10895 }
10897 /* Record the types used by the current global variable declaration
10898 being parsed, so that we can decide later to emit their debug info.
10899 Those types are in types_used_by_cur_var_decl, and we are going to
10900 store them in the types_used_by_vars_hash hash table.
10901 DECL is the declaration of the global variable that has been parsed. */
10903 void
10905 {
10909 {
10912 }
10913 }
10915 /* If DECL is a typedef that is declared in the current function,
10916 record it for the purpose of -Wunused-local-typedefs. */
10918 void
10920 {
10925 /* if this is not a locally defined typedef then we are not
10926 interested. */
10933 }
10935 /* If T is a TYPE_DECL declared locally, mark it as used. */
10937 void
10939 {
10944 }
10946 /* Warn if there are some unused locally defined typedefs in the
10947 current function. */
10949 void
10951 {
10953 tree decl;
10954 /* The number of times we have emitted -Wunused-local-typedefs
10955 warnings. If this is different from errorcount, that means some
10956 unrelated errors have been issued. In which case, we'll avoid
10957 emitting "unused-local-typedefs" warnings. */
10969 {
10973 OPT_Wunused_local_typedefs,
10976 }
10979 {
10982 }
10983 }
10985 /* The C and C++ parsers both use vectors to hold function arguments.
10986 For efficiency, we keep a cache of unused vectors. This is the
10987 cache. */
10994 /* Return a new vector from the cache. If the cache is empty,
10995 allocate a new vector. These vectors are GC'ed, so it is OK if the
10996 pointer is not released.. */
11000 {
11003 else
11004 {
11005 /* Passing 0 to VEC_alloc returns NULL, and our callers require
11006 that we always return a non-NULL value. The vector code uses
11007 4 when growing a NULL vector, so we do too. */
11009 }
11010 }
11012 /* Release a vector of trees back to the cache. */
11014 void
11016 {
11018 {
11021 }
11022 }
11024 /* Get a new tree vector holding a single tree. */
11028 {
11032 }
11034 /* Get a new tree vector of the TREE_VALUEs of a TREE_LIST chain. */
11038 {
11043 }
11045 /* Get a new tree vector which is a copy of an existing one. */
11049 {
11052 tree t;
11059 }
11061 /* Return true if KEYWORD starts a type specifier. */
11063 bool
11065 {
11067 {
11097 }
11098 }
11100 /* Return true if KEYWORD names a type qualifier. */
11102 bool
11104 {
11106 {
11113 }
11114 }
11116 /* Return true if KEYWORD names a storage class specifier.
11118 RID_TYPEDEF is not included in this list despite `typedef' being
11119 listed in C99 6.7.1.1. 6.7.1.3 indicates that `typedef' is listed as
11120 such for syntactic convenience only. */
11122 bool
11124 {
11126 {
11136 }
11137 }
11139 /* Return true if KEYWORD names a function-specifier [dcl.fct.spec]. */
11141 static bool
11143 {
11145 {
11153 }
11154 }
11156 /* Return true if KEYWORD names a decl-specifier [dcl.spec] or a
11157 declaration-specifier (C99 6.7). */
11159 bool
11161 {
11168 {
11175 }
11176 }
11178 /* Initialize language-specific-bits of tree_contains_struct. */
11180 void
11182 {
11185 }
11187 /* Build a user-defined numeric literal out of an integer constant type VALUE
11188 with identifier SUFFIX. */
11190 tree
11192 {
11198 }
11200 /* For vector[index], convert the vector to a
11201 pointer of the underlying type. */
11202 void
11205 {
11207 {
11209 tree type1;
11223 }
11224 }