| blob | 66c6abc9f076a77a8bd4f4f1e9c6d6546492d5ca |
1 /* Build expressions with type checking for C compiler.
2 Copyright (C) 1987-2024 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
9 version.
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14 for more details.
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
21 /* This file is part of the C front end.
22 It contains routines to build C expressions given their operands,
23 including computing the types of the result, C-specific error checks,
24 and some optimization. */
57 /* Possible cases of implicit conversions. Used to select diagnostic messages
58 and control folding initializers in convert_for_assignment. */
60 ic_argpass,
61 ic_assign,
62 ic_init,
63 ic_init_const,
64 ic_return
65 };
67 /* The level of nesting inside "__alignof__". */
70 /* The level of nesting inside "sizeof". */
73 /* The level of nesting inside "typeof". */
76 /* True when parsing OpenMP loop expressions. */
79 /* True when parsing OpenMP map clause. */
82 /* The argument of last parsed sizeof expression, only to be tested
83 if expr.original_code == SIZEOF_EXPR. */
84 tree c_last_sizeof_arg;
85 location_t c_last_sizeof_loc;
87 /* Nonzero if we might need to print a "missing braces around
88 initializer" message within this initializer. */
107 tree);
135 \f
136 /* Return true if EXP is a null pointer constant, false otherwise. */
138 bool
140 {
141 /* This should really operate on c_expr structures, but they aren't
142 yet available everywhere required. */
145 /* An integer constant expression with the value 0, such an expression
146 cast to type void*, or the predefined constant nullptr, are a null
147 pointer constant. */
158 }
160 /* EXPR may appear in an unevaluated part of an integer constant
161 expression, but not in an evaluated part. Wrap it in a
162 C_MAYBE_CONST_EXPR, or mark it with TREE_OVERFLOW if it is just an
163 INTEGER_CST and we cannot create a C_MAYBE_CONST_EXPR. */
165 static tree
167 {
168 tree ret;
170 {
173 }
174 else
175 {
178 }
180 }
182 /* Having checked whether EXPR may appear in an unevaluated part of an
183 integer constant expression and found that it may, remove any
184 C_MAYBE_CONST_EXPR noting this fact and return the resulting
185 expression. */
189 {
192 else
194 }
200 const_tree t1;
201 const_tree t2;
202 };
204 /* Do `exp = require_complete_type (loc, exp);' to make sure exp
205 does not have an incomplete type. (That includes void types.)
206 LOC is the location of the use. */
208 tree
210 {
216 /* First, detect a valid value with a complete type. */
222 }
224 /* Print an error message for invalid use of an incomplete type.
225 VALUE is the expression that was used (or 0 if that isn't known)
226 and TYPE is the type that was invalid. LOC is the location for
227 the error. */
229 void
231 {
232 /* Avoid duplicate error message. */
238 else
239 {
240 retry:
241 /* We must print an error message. Be clever about what it says. */
244 {
256 {
258 {
261 }
264 }
270 }
274 else
275 /* If this type has a typedef-name, the TYPE_NAME is a TYPE_DECL. */
277 }
278 }
280 /* Given a type, apply default promotions wrt unnamed function
281 arguments and return the new type. */
283 tree
285 {
291 {
292 /* Preserve unsignedness if not really getting any wider. */
296 else
298 }
306 }
308 /* Return true if between two named address spaces, whether there is a superset
309 named address space that encompasses both address spaces. If there is a
310 superset, return which address space is the superset. */
312 static bool
314 {
316 {
319 }
321 {
324 }
326 {
329 }
330 else
332 }
334 /* Return a variant of TYPE which has all the type qualifiers of LIKE
335 as well as those of TYPE. */
337 static tree
339 {
342 addr_space_t as_common;
344 /* If the two named address spaces are different, determine the common
345 superset address space. If there isn't one, raise an error. */
347 {
351 }
357 }
360 /* If NTYPE is a type of a non-variadic function with a prototype
361 and OTYPE is a type of a function without a prototype and ATTRS
362 contains attribute format, diagnosess and removes it from ATTRS.
363 Returns the result of build_type_attribute_variant of NTYPE and
364 the (possibly) modified ATTRS. */
366 static tree
368 {
372 {
374 "%qs attribute cannot be applied to a function that "
377 }
380 }
381 /* Return the composite type of two compatible types.
383 We assume that comptypes has already been done and returned
384 nonzero; if that isn't so, this may crash. In particular, we
385 assume that qualifiers match. */
388 tree t1;
389 tree t2;
390 tree composite;
392 };
394 tree
396 {
399 tree attributes;
401 /* Save time if the two types are the same. */
405 /* If one type is nonsense, use the other. */
414 /* Merge the attributes. */
417 /* If one is an enumerated type and the other is the compatible
418 integer type, the composite type might be either of the two
419 (DR#013 question 3). For consistency, use the enumerated type as
420 the composite type. */
434 {
436 /* For two pointers, do this recursively on the target type. */
437 {
445 }
448 {
450 cache);
452 tree unqual_elt;
459 /* We should not have any type quals on arrays at all. */
469 d1_variable = (!d1_zero
472 d2_variable = (!d2_zero
478 /* Save space: see if the result is identical to one of the args. */
491 /* Merge the element types, and have a size if either arg has
492 one. We may have qualifiers on the element types. To set
493 up TYPE_MAIN_VARIANT correctly, we need to form the
494 composite of the unqualified types and add the qualifiers
495 back at the end. */
500 && (d2_variable
501 || d2_zero
503 ? t1
505 /* Ensure a composite type involving a zero-length array type
506 is a zero-length type not an incomplete type. */
510 {
513 }
516 }
521 {
525 /* If a composite type for these two types is already under
526 construction, return it. */
532 /* Otherwise, create a new type node and link it into the cache. */
546 {
551 {
554 }
570 {
571 /* This will be processed by finish_struct. */
577 }
581 }
585 /* Setup the struct/union type. Because we inherit all variably
586 modified components, we can ignore the size expression. */
596 }
597 /* FALLTHRU */
600 {
601 /* Try harder not to create a new aggregate type. */
606 }
610 /* Function types: prefer the one that specified arg types.
611 If both do, merge the arg types. Also merge the return types. */
612 {
621 /* Save space: see if the result is identical to one of the args. */
627 /* Simple way if one arg fails to specify argument types. */
629 {
634 }
636 {
641 }
643 /* If both args specify argument types, we must merge the two
644 lists, argument by argument. */
649 ;
658 {
669 /* A null type means arg type is not specified.
670 Take whatever the other function type has. */
672 {
675 }
677 {
680 }
682 /* Given wait (union {union wait *u; int *i} *)
683 and wait (union wait *),
684 prefer union wait * as type of parm. */
687 {
688 tree memb;
691 {
697 {
700 cache);
704 }
705 }
706 }
709 {
710 tree memb;
713 {
719 {
723 cache);
727 }
728 }
729 }
731 parm_done: ;
732 }
736 }
737 /* FALLTHRU */
741 }
742 }
744 tree
746 {
749 }
751 /* Return the type of a conditional expression between pointers to
752 possibly differently qualified versions of compatible types.
754 We assume that comp_target_types has already been done and returned
755 true; if that isn't so, this may crash. */
757 static tree
759 {
760 tree attributes;
763 tree target;
768 /* Save time if the two types are the same. */
772 /* If one type is nonsense, use the other. */
781 /* Merge the attributes. */
784 /* Find the composite type of the target types, and combine the
785 qualifiers of the two types' targets. Do not lose qualifiers on
786 array element types by taking the TYPE_MAIN_VARIANT. */
795 /* Strip array types to get correct qualifier for pointers to arrays */
799 /* For function types do not merge const qualifiers, but drop them
800 if used inconsistently. The middle-end uses these to mark const
801 and noreturn functions. */
804 else
807 /* If the two named address spaces are different, determine the common
808 superset address space. This is guaranteed to exist due to the
809 assumption that comp_target_type returned true. */
819 }
821 /* Return the common type for two arithmetic types under the usual
822 arithmetic conversions. The default conversions have already been
823 applied, and enumerated types converted to their compatible integer
824 types. The resulting type is unqualified and has no attributes.
826 This is the type for the result of most arithmetic operations
827 if the operands have the given two types. */
829 static tree
831 {
835 /* If one type is nonsense, use the other. */
848 {
851 }
854 {
857 }
859 /* Save time if the two types are the same. */
873 /* When one operand is a decimal float type, the other operand cannot be
874 a generic float type or a complex type. We also disallow vector types
875 here. */
878 {
880 {
883 }
885 {
888 }
890 {
894 }
895 }
897 /* If one type is a vector type, return that type. (How the usual
898 arithmetic conversions apply to the vector types extension is not
899 precisely specified.) */
906 /* If one type is complex, form the common type of the non-complex
907 components, then make that complex. Use T1 or T2 if it is the
908 required type. */
910 {
920 {
924 }
925 else
927 }
929 /* If only one is real, use it as the result. */
937 /* If both are real and either are decimal floating point types, use
938 the decimal floating point type with the greater precision. */
941 {
951 }
953 /* Deal with fixed-point types. */
955 {
963 /* If one input type is saturating, the result type is saturating. */
967 /* If both fixed-point types are unsigned, the result type is unsigned.
968 When mixing fixed-point and integer types, follow the sign of the
969 fixed-point type.
970 Otherwise, the result type is signed. */
979 /* The result type is signed. */
981 {
982 /* If the input type is unsigned, we need to convert to the
983 signed type. */
985 {
991 else
995 }
997 {
1003 else
1007 }
1008 }
1011 {
1014 }
1015 else
1016 {
1018 /* Signed integers need to subtract one sign bit. */
1020 }
1023 {
1026 }
1027 else
1028 {
1030 /* Signed integers need to subtract one sign bit. */
1032 }
1037 satp);
1038 }
1040 /* Both real or both integers; use the one with greater precision. */
1047 /* Same precision. Prefer long longs to longs to ints when the
1048 same precision, following the C99 rules on integer type rank
1049 (which are equivalent to the C90 rules for C90 types). */
1057 {
1060 else
1062 }
1070 {
1071 /* But preserve unsignedness from the other type,
1072 since long cannot hold all the values of an unsigned int. */
1075 else
1077 }
1079 /* For floating types of the same TYPE_PRECISION (which we here
1080 assume means either the same set of values, or sets of values
1081 neither a subset of the other, with behavior being undefined in
1082 the latter case), follow the rules from TS 18661-3: prefer
1083 interchange types _FloatN, then standard types long double,
1084 double, float, then extended types _FloatNx. For extended types,
1085 check them starting with _Float128x as that seems most consistent
1086 in spirit with preferring long double to double; for interchange
1087 types, also check in that order for consistency although it's not
1088 possible for more than one of them to have the same
1089 precision. */
1097 /* Likewise, prefer long double to double even if same size. */
1101 /* Likewise, prefer double to float even if same size.
1102 We got a couple of embedded targets with 32 bit doubles, and the
1103 pdp11 might have 64 bit floats. */
1115 {
1116 /* Prefer any other integral types over bit-precise integer types. */
1119 /* If BITINT_TYPE is unsigned and the other type is signed
1120 non-BITINT_TYPE with the same precision, the latter has higher rank.
1121 In that case:
1122 Otherwise, both operands are converted to the unsigned integer type
1123 corresponding to the type of the operand with signed integer type. */
1126 }
1128 /* Otherwise prefer the unsigned one. */
1132 else
1134 }
1135 \f
1136 /* Wrapper around c_common_type that is used by c-common.cc and other
1137 front end optimizations that remove promotions. ENUMERAL_TYPEs
1138 are allowed here and are converted to their compatible integer types.
1139 BOOLEAN_TYPEs are allowed here and return either boolean_type_node or
1140 preferably a non-Boolean type as the common type. */
1141 tree
1143 {
1149 /* If both types are BOOLEAN_TYPE, then return boolean_type_node. */
1154 /* If either type is BOOLEAN_TYPE, then return the other. */
1161 }
1171 };
1173 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
1174 or various other operations. Return 2 if they are compatible
1175 but a warning may be needed if you use them together. */
1177 int
1179 {
1184 }
1187 /* Like comptypes, but it returns non-zero only for identical
1188 types. */
1190 bool
1192 {
1200 }
1203 /* Like comptypes, but if it returns non-zero because enum and int are
1204 compatible, it sets *ENUM_AND_INT_P to true. */
1206 int
1208 {
1214 }
1216 /* Like comptypes, but if it returns nonzero for different types, it
1217 sets *DIFFERENT_TYPES_P to true. */
1219 int
1222 {
1228 }
1231 /* Like comptypes, but if it returns nonzero for struct and union
1232 types considered equivalent for aliasing purposes. */
1234 bool
1236 {
1242 }
1244 \f
1245 /* Return true if TYPE1 and TYPE2 are compatible types for assignment
1246 or various other operations. If they are compatible but a warning may
1247 be needed if you use them together, 'warning_needed' in DATA is set.
1248 If one type is an enum and the other a compatible integer type, then
1249 this sets 'enum_and_int_p' in DATA to true (it is never set to
1250 false). If the types are compatible but different enough not to be
1251 permitted in C11 typedef redeclarations, then this sets
1252 'different_types_p' in DATA to true; it is never set to
1253 false, but may or may not be set if the types are incompatible.
1254 This differs from comptypes, in that we don't free the seen
1255 types. */
1257 static bool
1260 {
1264 /* Suppress errors caused by previously reported errors. */
1270 /* Enumerated types are compatible with integer types, but this is
1271 not transitive: two enumerated types in the same translation unit
1272 are compatible with each other only if they are the same type. */
1277 {
1280 {
1283 }
1284 }
1288 {
1291 {
1294 }
1295 }
1300 /* Different classes of types can't be compatible. */
1305 /* Qualifiers must match. C99 6.7.3p9 */
1310 /* Allow for two different type nodes which have essentially the same
1311 definition. Note that we already checked for equality of the type
1312 qualifiers (just above). */
1320 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1328 {
1333 /* With these nodes, we can't determine type equivalence by
1334 looking at what is stored in the nodes themselves, because
1335 two nodes might have different TYPE_MAIN_VARIANTs but still
1336 represent the same type. For example, wchar_t and int could
1337 have the same properties (TYPE_PRECISION, TYPE_MIN_VALUE,
1338 TYPE_MAX_VALUE, etc.), but have different TYPE_MAIN_VARIANTs
1339 and are distinct types. On the other hand, int and the
1340 following typedef
1342 typedef int INT __attribute((may_alias));
1344 have identical properties, different TYPE_MAIN_VARIANTs, but
1345 represent the same type. The canonical type system keeps
1346 track of equivalence in this case, so we fall back on it. */
1350 /* Do not remove mode information. */
1359 {
1365 /* Target types must match incl. qualifiers. */
1371 /* Ignore size mismatches. */
1374 /* Sizes must match unless one is missing or variable. */
1381 d1_variable = (!d1_zero
1384 d2_variable = (!d2_zero
1402 }
1419 }
1421 }
1423 /* Return true if TTL and TTR are pointers to types that are equivalent, ignoring
1424 their qualifiers, except for named address spaces. If the pointers point to
1425 different named addresses, then we must determine if one address space is a
1426 subset of the other. */
1428 static bool
1430 {
1437 addr_space_t as_common;
1440 /* Fail if pointers point to incompatible address spaces. */
1444 /* For pedantic record result of comptypes on arrays before losing
1445 qualifiers on the element type below. */
1452 /* Qualifiers on element types of array types that are
1453 pointer targets are lost by taking their TYPE_MAIN_VARIANT. */
1467 pedwarn_c11 (location, OPT_Wpedantic, "invalid use of pointers to arrays with different qualifiers "
1478 }
1479 \f
1480 /* Subroutines of `comptypes'. */
1482 /* Return true if two 'struct', 'union', or 'enum' types T1 and T2 are
1483 compatible. The two types are not the same (which has been
1484 checked earlier in comptypes_internal). */
1486 static bool
1489 {
1492 /* We have to verify that the tags of the types are the same. This
1493 is harder than it looks because this may be a typedef, so we have
1494 to go look at the original type. It may even be a typedef of a
1495 typedef...
1496 In the case of compiler-created builtin structs the TYPE_DECL
1497 may be a dummy, with no DECL_ORIGINAL_TYPE. Don't fault. */
1517 /* Incomplete types are incompatible inside a TU. */
1526 /* For types already being looked at in some active
1527 invocation of this function, assume compatibility.
1528 The cache is built as a linked list on the stack
1529 with the head of the list passed downwards. */
1538 {
1540 {
1544 /* Speed up the case where the type values are in the same order. */
1552 {
1559 }
1571 {
1578 }
1581 }
1595 {
1619 }
1624 }
1625 }
1627 /* Return true if two function types F1 and F2 are compatible.
1628 If either type specifies no argument types,
1629 the other must specify a fixed number of self-promoting arg types.
1630 Otherwise, if one type specifies only the number of arguments,
1631 the other must specify that number of self-promoting arg types.
1632 Otherwise, the argument types must match. */
1634 static bool
1637 {
1639 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1647 /* 'volatile' qualifiers on a function's return type used to mean
1648 the function is noreturn. */
1667 /* An unspecified parmlist matches any specified parmlist
1668 whose argument types don't need default promotions. */
1671 {
1676 /* If one of these types comes from a non-prototype fn definition,
1677 compare that with the other type's arglist.
1678 If they don't match, ask for a warning (but no error). */
1682 {
1685 }
1687 }
1689 {
1697 {
1700 }
1702 }
1704 /* Both types have argument lists: compare them and propagate results. */
1707 }
1709 /* Check two lists of types for compatibility, returning false for
1710 incompatible, true for compatible. */
1712 static bool
1715 {
1717 {
1721 /* If one list is shorter than the other,
1722 they fail to match. */
1730 TYPE_QUAL_ATOMIC)
1735 TYPE_QUAL_ATOMIC)
1737 /* A null pointer instead of a type
1738 means there is supposed to be an argument
1739 but nothing is specified about what type it has.
1740 So match anything that self-promotes. */
1744 {
1747 }
1749 {
1752 }
1753 /* If one of the lists has an error marker, ignore this arg. */
1756 ;
1758 {
1760 /* Allow wait (union {union wait *u; int *i} *)
1761 and wait (union wait *) to be compatible. */
1768 {
1769 tree memb;
1772 {
1778 TYPE_QUAL_ATOMIC)
1782 }
1785 }
1792 {
1793 tree memb;
1796 {
1802 TYPE_QUAL_ATOMIC)
1806 }
1809 }
1810 else
1812 }
1816 }
1817 }
1818 \f
1819 /* Compute the size to increment a pointer by. When a function type or void
1820 type or incomplete type is passed, size_one_node is returned.
1821 This function does not emit any diagnostics; the caller is responsible
1822 for that. */
1824 static tree
1826 {
1833 /* Convert in case a char is more than one unit. */
1837 }
1838 \f
1839 /* Return either DECL or its known constant value (if it has one). */
1841 tree
1843 {
1850 /* This is invalid if initial value is not constant.
1851 If it has either a function call, a memory reference,
1852 or a variable, then re-evaluating it could give different results. */
1854 /* Check for cases where this is sub-optimal, even though valid. */
1858 }
1860 /* Return either DECL or its known constant value (if it has one).
1861 Like the above, but always return decl outside of functions. */
1863 tree
1865 {
1866 /* Don't change a variable array bound or initial value to a constant
1867 in a place where a variable is invalid. */
1869 }
1871 /* Convert the array expression EXP to a pointer. */
1872 static tree
1874 {
1877 tree adr;
1879 tree ptrtype;
1892 /* In C++ array compound literals are temporary objects unless they are
1893 const or appear in namespace scope, so they are destroyed too soon
1894 to use them for much of anything (c++/53220). */
1896 {
1900 "converting an array compound literal to a pointer "
1902 }
1906 }
1908 /* Convert the function expression EXP to a pointer. */
1909 static tree
1911 {
1921 }
1923 /* Mark EXP as read, not just set, for set but not used -Wunused
1924 warning purposes. */
1926 void
1928 {
1930 {
1940 CASE_CONVERT:
1946 /* Pattern match what build_atomic_assign produces with modifycode
1947 NOP_EXPR. */
1951 {
1957 {
1965 {
1978 }
1980 {
1986 }
1987 }
1988 }
1989 /* FALLTHRU */
2002 }
2003 }
2005 /* Perform the default conversion of arrays and functions to pointers.
2006 Return the result of converting EXP. For any other expression, just
2007 return EXP.
2009 LOC is the location of the expression. */
2011 struct c_expr
2013 {
2019 {
2021 {
2028 {
2032 }
2038 {
2039 /* Before C99, non-lvalue arrays do not decay to pointers.
2040 Normally, using such an array would be invalid; but it can
2041 be used correctly inside sizeof or as a statement expression.
2042 Thus, do not give an error here; an error will result later. */
2044 }
2047 }
2054 }
2057 }
2059 struct c_expr
2061 {
2064 }
2066 /* Return whether EXPR should be treated as an atomic lvalue for the
2067 purposes of load and store handling. */
2069 static bool
2071 {
2079 /* Ignore _Atomic on register variables, since their addresses can't
2080 be taken so (a) atomicity is irrelevant and (b) the normal atomic
2081 sequences wouldn't work. Ignore _Atomic on structures containing
2082 bit-fields, since accessing elements of atomic structures or
2083 unions is undefined behavior (C11 6.5.2.3#5), but it's unclear if
2084 it's undefined at translation time or execution time, and the
2085 normal atomic sequences again wouldn't work. */
2087 {
2092 }
2096 }
2098 /* If EXPR is a named constant (C23) derived from a constexpr variable
2099 - that is, a reference to such a variable, or a member extracted by
2100 a sequence of structure and union (but not array) member accesses
2101 (where union member accesses must access the same member as
2102 initialized) - then return the corresponding initializer;
2103 otherwise, return NULL_TREE. */
2105 static tree
2107 {
2135 {
2139 }
2143 /* Return a default initializer. */
2147 }
2149 /* Convert expression EXP (location LOC) from lvalue to rvalue,
2150 including converting functions and arrays to pointers if CONVERT_P.
2151 If READ_P, also mark the expression as having been read. If
2152 FOR_INIT, constexpr expressions of structure and union type should
2153 be replaced by the corresponding CONSTRUCTOR; otherwise, only
2154 constexpr scalars (including elements of structures and unions) are
2155 replaced by their initializers. */
2157 struct c_expr
2160 {
2169 {
2172 {
2173 /* A named constant of pointer type or type nullptr_t is not
2174 a null pointer constant even if the initializer is
2175 one. */
2181 }
2182 }
2184 {
2193 /* Expansion of a generic atomic load may require an addition
2194 element, so allocate enough to prevent a resize. */
2197 /* Remove the qualifiers for the rest of the expressions and
2198 create the VAL temp variable to hold the RHS. */
2203 /* Do not disable warnings for TMP even though it's artificial.
2204 -Winvalid-memory-model depends on it. */
2206 /* Issue __atomic_load (&expr, &tmp, SEQ_CST); */
2213 /* EXPR is always read. */
2216 /* Return tmp which contains the value loaded. */
2219 }
2222 exp.value = convert (build_qualified_type (TREE_TYPE (exp.value), TYPE_UNQUALIFIED), exp.value);
2226 {
2231 {
2241 boolean_type_node,
2246 boolean_type_node,
2251 }
2252 }
2255 }
2257 /* EXP is an expression of integer type. Apply the integer promotions
2258 to it and return the promoted value. */
2260 tree
2262 {
2268 /* Convert enums to the result of applying the integer promotions to
2269 their underlying type. */
2271 {
2274 {
2278 else
2280 }
2283 }
2285 /* ??? This should no longer be needed now bit-fields have their
2286 proper types. */
2289 {
2293 /* If it's thinner than an int, promote it like a
2294 c_promoting_integer_type_p, otherwise leave it alone. */
2298 }
2301 {
2302 /* Preserve unsignedness if not really getting any wider. */
2308 }
2311 }
2314 /* Perform default promotions for C data used in expressions.
2315 Enumeral types or short or char are converted to int.
2316 In addition, manifest constants symbols are replaced by their values. */
2318 tree
2320 {
2321 tree orig_exp;
2324 tree promoted_type;
2328 /* Functions and arrays have been converted during parsing. */
2333 /* Constants can be used directly unless they're not loadable. */
2337 /* Strip no-op conversions. */
2344 {
2348 }
2362 }
2363 \f
2364 /* Look up COMPONENT in a structure or union TYPE.
2366 If the component name is not found, returns NULL_TREE. Otherwise,
2367 the return value is a TREE_LIST, with each TREE_VALUE a FIELD_DECL
2368 stepping down the chain to the component, which is in the last
2369 TREE_VALUE of the list. Normally the list is of length one, but if
2370 the component is embedded within (nested) anonymous structures or
2371 unions, the list steps down the chain to the component. */
2373 static tree
2375 {
2376 tree field;
2378 /* If TYPE_LANG_SPECIFIC is set, then it is a sorted array of pointers
2379 to the field elements. Use a binary search on this array to quickly
2380 find the element. Otherwise, do a linear search. TYPE_LANG_SPECIFIC
2381 will always be set for structures which have many elements.
2383 Duplicate field checking replaces duplicates with NULL_TREE so
2384 TYPE_LANG_SPECIFIC arrays are potentially no longer sorted. In that
2385 case just iterate using DECL_CHAIN. */
2389 {
2397 {
2402 {
2403 /* Step through all anon unions in linear fashion. */
2405 {
2408 {
2414 /* The Plan 9 compiler permits referring
2415 directly to an anonymous struct/union field
2416 using a typedef name. */
2424 }
2425 }
2427 /* Entire record is only anon unions. */
2431 /* Restart the binary search, with new lower bound. */
2433 }
2439 else
2441 }
2447 }
2448 else
2449 {
2451 {
2454 {
2460 /* The Plan 9 compiler permits referring directly to an
2461 anonymous struct/union field using a typedef
2462 name. */
2469 }
2473 }
2477 }
2480 }
2482 /* Recursively append candidate IDENTIFIER_NODEs to CANDIDATES. */
2484 static void
2487 {
2488 tree field;
2490 {
2494 candidates);
2498 }
2499 }
2501 /* Like "lookup_field", but find the closest matching IDENTIFIER_NODE,
2502 rather than returning a TREE_LIST for an exact match. */
2504 static tree
2506 {
2509 /* First, gather a list of candidates. */
2516 }
2518 /* Support function for build_component_ref's error-handling.
2520 Given DATUM_TYPE, and "DATUM.COMPONENT", where DATUM is *not* a
2521 struct or union, should we suggest "DATUM->COMPONENT" as a hint? */
2523 static bool
2525 {
2526 /* We don't do it for Objective-C, since Objective-C 2.0 dot-syntax
2527 allows "." for ptrs; we could be handling a failed attempt
2528 to access a property. */
2532 /* Only suggest it for pointers... */
2536 /* ...to structs/unions. */
2541 else
2543 }
2545 /* Make an expression to refer to the COMPONENT field of structure or
2546 union value DATUM. COMPONENT is an IDENTIFIER_NODE. LOC is the
2547 location of the COMPONENT_REF. COMPONENT_LOC is the location
2548 of COMPONENT. ARROW_LOC is the location of the first -> operand if
2549 it is from -> operator. */
2551 tree
2554 {
2558 tree ref;
2564 /* Detect Objective-C property syntax object.property. */
2569 /* See if there is a field or component with name COMPONENT. */
2572 {
2574 {
2577 }
2582 {
2585 {
2586 /* Attempt to provide a fixit replacement hint, if
2587 we have a valid range for the component. */
2588 location_t reported_loc
2596 }
2597 else
2600 }
2602 /* Accessing elements of atomic structures or unions is undefined
2603 behavior (C11 6.5.2.3#5). */
2605 {
2609 else
2612 }
2614 /* Chain the COMPONENT_REFs if necessary down to the FIELD.
2615 This might be better solved in future the way the C++ front
2616 end does it - by giving the anonymous entities each a
2617 separate name and type, and then have build_component_ref
2618 recursively call itself. We can't do that here. */
2619 do
2620 {
2623 tree subtype;
2629 /* If this is an rvalue, it does not have qualifiers in C
2630 standard terms and we must avoid propagating such
2631 qualifiers down to a non-lvalue array that is then
2632 converted to a pointer. */
2633 use_datum_quals = (datum_lvalue
2642 NULL_TREE);
2659 }
2663 }
2665 {
2666 /* Special-case the error message for "ptr.field" for the case
2667 where the user has confused "." vs "->". */
2670 {
2674 "%qE is a pointer to pointer; did you mean to dereference "
2677 }
2678 else
2679 {
2680 /* "loc" should be the "." token. */
2684 datum);
2685 }
2687 }
2691 component);
2694 }
2695 \f
2696 /* Given an expression PTR for a pointer, return an expression
2697 for the value pointed to.
2698 ERRORSTRING is the name of the operator to appear in error messages.
2700 LOC is the location to use for the generated tree. */
2702 tree
2704 {
2707 tree ref;
2710 {
2713 {
2714 /* If a warning is issued, mark it to avoid duplicates from
2715 the backend. This only needs to be done at
2716 warn_strict_aliasing > 2. */
2721 }
2726 {
2730 }
2731 else
2732 {
2740 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
2741 so that we get the proper error message if the result is used
2742 to assign to. Also, &* is supposed to be a no-op.
2743 And ANSI C seems to specify that the type of the result
2744 should be the const type. */
2745 /* A de-reference of a pointer to const is not a const. It is valid
2746 to change it via some other pointer. */
2753 }
2754 }
2759 }
2761 /* This handles expressions of the form "a[i]", which denotes
2762 an array reference.
2764 This is logically equivalent in C to *(a+i), but we may do it differently.
2765 If A is a variable or a member, we generate a primitive ARRAY_REF.
2766 This avoids forcing the array out of registers, and can work on
2767 arrays that are not lvalues (for example, members of structures returned
2768 by functions).
2770 For vector types, allow vector[i] but not i[vector], and create
2771 *(((type*)&vectortype) + i) for the expression.
2773 LOC is the location to use for the returned expression. */
2775 tree
2777 {
2778 tree ret;
2786 /* Allow vector[index] but not index[vector]. */
2788 {
2791 {
2796 }
2799 }
2802 {
2805 }
2808 {
2811 }
2813 /* ??? Existing practice has been to warn only when the char
2814 index is syntactically the index, not for char[array]. */
2818 /* Apply default promotions *after* noticing character types. */
2830 {
2833 /* An array that is indexed by a non-constant
2834 cannot be stored in a register; we must be able to do
2835 address arithmetic on its address.
2836 Likewise an array of elements of variable size. */
2840 {
2843 }
2844 /* An array that is indexed by a constant value which is not within
2845 the array bounds cannot be stored in a register either; because we
2846 would get a crash in store_bit_field/extract_bit_field when trying
2847 to access a non-existent part of the register. */
2851 {
2854 }
2858 {
2867 "ISO C90 forbids subscripting non-lvalue "
2869 }
2877 /* Array ref is const/volatile if the array elements are
2878 or if the array is. */
2887 /* This was added by rms on 16 Nov 91.
2888 It fixes vol struct foo *a; a->elts[1]
2889 in an inline function.
2890 Hope it doesn't break something else. */
2897 }
2898 else
2899 {
2910 RO_ARRAY_INDEXING);
2914 }
2915 }
2917 /* Build an OpenMP array section reference, creating an exact type for the
2918 resulting expression based on the element type and bounds if possible. If
2919 we have variable bounds, create an incomplete array type for the result
2920 instead. */
2922 tree
2924 {
2930 /* It's not an array or pointer type. Just reuse the type of the original
2931 expression as the type of the array section (an error will be raised
2932 anyway, later). */
2935 else
2936 {
2943 {
2949 }
2958 }
2961 }
2963 \f
2964 /* Build an external reference to identifier ID. FUN indicates
2965 whether this will be used for a function call. LOC is the source
2966 location of the identifier. This sets *TYPE to the type of the
2967 identifier, which is not the same as the type of the returned value
2968 for CONST_DECLs defined as enum constants. If the type of the
2969 identifier is not available, *TYPE is set to NULL. */
2970 tree
2972 {
2973 tree ref;
2976 /* In Objective-C, an instance variable (ivar) may be preferred to
2977 whatever lookup_name() found. */
2982 {
2987 decl);
2988 }
2990 /* Implicit function declaration. */
2993 /* Don't complain about something that's already been
2994 complained about. */
2996 else
2997 {
3000 }
3002 /* For an OpenMP map clause, we can get better diagnostics for decls with
3003 unmappable types if we return the decl with an error_mark_node type,
3004 rather than returning error_mark_node for the decl itself. */
3014 /* Recursive call does not count as usage. */
3016 {
3018 }
3021 {
3028 }
3031 {
3037 {
3042 }
3046 }
3051 {
3056 }
3057 /* C99 6.7.4p3: An inline definition of a function with external
3058 linkage ... shall not contain a reference to an identifier with
3059 internal linkage. */
3068 csi_internal);
3071 }
3073 /* Record details of decls possibly used inside sizeof or typeof. */
3074 struct maybe_used_decl
3075 {
3076 /* The decl. */
3077 tree decl;
3078 /* The level seen at (in_sizeof + in_typeof). */
3080 /* The next one at this level or above, or NULL. */
3082 };
3086 /* Record that DECL, an undefined static function reference seen
3087 inside sizeof or typeof, might be used if the operand of sizeof is
3088 a VLA type or the operand of typeof is a variably modified
3089 type. */
3091 static void
3093 {
3099 }
3101 /* Pop the stack of decls possibly used inside sizeof or typeof. If
3102 USED is false, just discard them. If it is true, mark them used
3103 (if no longer inside sizeof or typeof) or move them to the next
3104 level up (if still inside sizeof or typeof). */
3106 void
3108 {
3112 {
3114 {
3117 else
3119 }
3121 }
3124 }
3126 /* Return the result of sizeof applied to EXPR. */
3128 struct c_expr
3130 {
3133 {
3139 }
3140 else
3141 {
3146 {
3147 auto_diagnostic_group d;
3149 "%<sizeof%> on array function parameter %qE will "
3153 }
3163 {
3164 /* sizeof is evaluated when given a vla (C99 6.5.3.4p2). */
3169 }
3171 }
3173 }
3175 /* Return the result of sizeof applied to T, a structure for the type
3176 name passed to sizeof (rather than the type itself). LOC is the
3177 location of the original expression. */
3179 struct c_expr
3181 {
3182 tree type;
3194 {
3197 }
3198 else
3201 {
3202 /* If the type is a [*] array, it is a VLA but is represented as
3203 having a size of zero. In such a case we must ensure that
3204 the result of sizeof does not get folded to a constant by
3205 c_fully_fold, because if the size is evaluated the result is
3206 not constant and so constraints on zero or negative size
3207 arrays must not be applied when this sizeof call is inside
3208 another array declarator. */
3214 }
3218 }
3220 /* Build a function call to function FUNCTION with parameters PARAMS.
3221 The function call is at LOC.
3222 PARAMS is a list--a chain of TREE_LIST nodes--in which the
3223 TREE_VALUE of each node is a parameter-expression.
3224 FUNCTION's data type may be a function type or a pointer-to-function. */
3226 tree
3228 {
3230 tree ret;
3238 }
3240 /* Give a note about the location of the declaration of DECL. */
3242 static void
3244 {
3248 }
3250 /* Build a function call to function FUNCTION with parameters PARAMS.
3251 If FUNCTION is the result of resolving an overloaded target built-in,
3252 ORIG_FUNDECL is the original function decl, otherwise it is null.
3253 ORIGTYPES, if not NULL, is a vector of types; each element is
3254 either NULL or the original type of the corresponding element in
3255 PARAMS. The original type may differ from TREE_TYPE of the
3256 parameter for enums. FUNCTION's data type may be a function type
3257 or pointer-to-function. This function changes the elements of
3258 PARAMS. */
3260 tree
3264 {
3267 tree tem;
3272 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
3275 /* Convert anything with function type to a pointer-to-function. */
3277 {
3285 /* Atomic functions have type checking/casting already done. They are
3286 often rewritten and don't match the original parameter list. */
3289 }
3293 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
3294 expressions, like those used for ObjC messenger dispatches. */
3307 {
3311 function);
3313 {
3316 function);
3318 }
3319 else
3323 }
3328 /* fntype now gets the type of function pointed to. */
3332 /* Convert the parameters to the types declared in the
3333 function prototype, or apply default promotions. */
3340 /* Check that the function is called through a compatible prototype.
3341 If it is not, warn. */
3346 {
3347 /* This situation leads to run-time undefined behavior. We can't,
3348 therefore, simply error unless we can prove that all possible
3349 executions of the program must execute the code. */
3356 }
3360 /* Check that arguments to builtin functions match the expectations. */
3367 /* Check that the arguments to the function are valid. */
3376 {
3378 result
3381 else
3387 }
3388 else
3391 /* If -Wnonnull warning has been diagnosed, avoid diagnosing it again
3392 later. */
3396 /* In this improbable scenario, a nested function returns a VM type.
3397 Create a TARGET_EXPR so that the call always has a LHS, much as
3398 what the C++ FE does for functions returning non-PODs. */
3400 {
3404 }
3407 {
3412 }
3414 }
3416 /* Like build_function_call_vec, but call also resolve_overloaded_builtin. */
3418 tree
3422 {
3423 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
3426 /* Convert anything with function type to a pointer-to-function. */
3428 {
3429 /* Implement type-directed function overloading for builtins.
3430 resolve_overloaded_builtin and targetm.resolve_overloaded_builtin
3431 handle all the type checking. The result is a complete expression
3432 that implements this function call. */
3436 }
3438 }
3439 \f
3440 /* Helper for convert_arguments called to convert the VALue of argument
3441 number ARGNUM from ORIGTYPE to the corresponding parameter number
3442 PARMNUM and TYPE.
3443 PLOC is the location where the conversion is being performed.
3444 FUNCTION and FUNDECL are the same as in convert_arguments.
3445 VALTYPE is the original type of VAL before the conversion and,
3446 for EXCESS_PRECISION_EXPR, the operand of the expression.
3447 NPC is true if VAL represents the null pointer constant (VAL itself
3448 will have been folded to an integer constant).
3449 RNAME is the same as FUNCTION except in Objective C when it's
3450 the function selector.
3451 EXCESS_PRECISION is true when VAL was originally represented
3452 as EXCESS_PRECISION_EXPR.
3453 WARNOPT is the same as in convert_for_assignment. */
3455 static tree
3460 {
3461 /* Formal parm type is specified by a function prototype. */
3464 {
3468 }
3470 /* Optionally warn about conversions that differ from the default
3471 conversions. */
3473 {
3477 "passing argument %d of %qE as integer rather "
3483 "passing argument %d of %qE as integer rather "
3489 "passing argument %d of %qE as complex rather "
3495 "passing argument %d of %qE as floating rather "
3501 "passing argument %d of %qE as complex rather "
3507 "passing argument %d of %qE as floating rather "
3510 /* ??? At some point, messages should be written about
3511 conversions between complex types, but that's too messy
3512 to do now. */
3515 {
3518 /* Warn if any argument is passed as `float',
3519 since without a prototype it would be `double'. */
3523 "passing argument %d of %qE as %<float%> "
3527 /* Warn if mismatch between argument and prototype
3528 for decimal float types. Warn of conversions with
3529 binary float types and of precision narrowing due to
3530 prototype. */
3538 && (formal_prec
3541 && (valtype
3542 != dfloat64_type_node
3543 && (valtype
3546 && (valtype
3549 "passing argument %d of %qE as %qT "
3553 }
3554 /* Detect integer changing in width or signedness.
3555 These warnings are only activated with
3556 -Wtraditional-conversion, not with -Wtraditional. */
3560 {
3570 /* No warning if function asks for enum
3571 and the actual arg is that enum type. */
3572 ;
3575 "passing argument %d of %qE "
3579 ;
3580 /* Don't complain if the formal parameter type
3581 is an enum, because we can't tell now whether
3582 the value was an enum--even the same enum. */
3584 ;
3587 /* Change in signedness doesn't matter
3588 if a constant value is unaffected. */
3589 ;
3590 /* If the value is extended from a narrower
3591 unsigned type, it doesn't matter whether we
3592 pass it as signed or unsigned; the value
3593 certainly is the same either way. */
3596 ;
3599 "passing argument %d of %qE "
3602 else
3604 "passing argument %d of %qE "
3607 }
3608 }
3610 /* Possibly restore an EXCESS_PRECISION_EXPR for the
3611 sake of better warnings from convert_and_check. */
3626 }
3628 /* Convert the argument expressions in the vector VALUES
3629 to the types in the list TYPELIST.
3631 If TYPELIST is exhausted, or when an element has NULL as its type,
3632 perform the default conversions.
3634 ORIGTYPES is the original types of the expressions in VALUES. This
3635 holds the type of enum values which have been converted to integral
3636 types. It may be NULL.
3638 FUNCTION is a tree for the called function. It is used only for
3639 error messages, where it is formatted with %qE.
3641 This is also where warnings about wrong number of args are generated.
3643 ARG_LOC are locations of function arguments (if any).
3645 Returns the actual number of arguments processed (which may be less
3646 than the length of VALUES in some error situations), or -1 on
3647 failure. */
3649 static int
3653 {
3661 tree selector;
3663 /* Change pointer to function to the function itself for
3664 diagnostics. */
3669 /* Handle an ObjC selector specially for diagnostics. */
3672 /* For a call to a built-in function declared without a prototype,
3673 set to the built-in function's argument list. */
3676 /* For type-generic built-in functions, determine whether excess
3677 precision should be removed (classification) or not
3678 (comparison). */
3681 {
3684 {
3685 /* For a call to a built-in function declared without a prototype
3686 use the types of the parameters of the internal built-in to
3687 match those of the arguments to. */
3690 }
3692 /* For type-generic built-in functions, determine whether excess
3693 precision should be removed (classification) or not
3694 (comparison). */
3697 {
3711 /* The last argument of these type-generic builtins
3712 should not be promoted. */
3722 /* The first argument of these type-generic builtins
3723 should not be promoted. */
3729 }
3730 }
3732 /* Scan the given expressions (VALUES) and types (TYPELIST), producing
3733 individual converted arguments. */
3741 {
3742 /* The type of the function parameter (if it was declared with one). */
3744 /* The type of the built-in function parameter (if the function
3745 is a built-in). Used to detect type incompatibilities in
3746 calls to built-ins declared without a prototype. */
3747 tree builtin_type = (builtin_typetail
3749 /* The original type of the argument being passed to the function. */
3751 /* The called function (or function selector in Objective C). */
3755 /* Set for EXCESS_PRECISION_EXPR arguments. */
3757 /* The value of the argument after conversion to the type
3758 of the function parameter it is passed to. */
3759 tree parmval;
3760 /* Some __atomic_* builtins have additional hidden argument at
3761 position 0. */
3762 location_t ploc
3768 {
3771 else
3775 }
3778 {
3780 "too many arguments to built-in function %qE "
3784 }
3787 {
3790 }
3792 /* Determine if VAL is a null pointer constant before folding it. */
3795 /* If there is excess precision and a prototype, convert once to
3796 the required type rather than converting via the semantic
3797 type. Likewise without a prototype a float value represented
3798 as long double should be converted once to double. But for
3799 type-generic classification functions excess precision must
3800 be removed here. */
3803 {
3806 }
3812 /* Some floating-point arguments must be promoted to double when
3813 no type is specified by a prototype. This applies to
3814 arguments of type float, and to architecture-specific types
3815 (ARM __fp16), but not to _FloatN or _FloatNx types. */
3824 {
3825 /* Promote this argument, unless it has a _FloatN or
3826 _FloatNx type. */
3830 {
3833 }
3834 /* Don't promote __bf16 either. */
3837 }
3840 {
3845 }
3847 {
3850 else
3851 {
3852 /* Convert `float' to `double'. */
3855 "implicit conversion from %qT to %qT when passing "
3859 }
3860 }
3864 /* A "double" argument with excess precision being passed
3865 without a prototype or in variable arguments.
3866 The last argument of __builtin_*_overflow_p should not be
3867 promoted, similarly the first argument of
3868 __builtin_{clz,ctz,clrsb,ffs,parity,popcount}g. */
3872 {
3875 }
3877 {
3879 }
3880 else
3881 /* Convert `short' and `char' to full-size `int'. */
3889 {
3890 /* For a call to a built-in function declared without a prototype,
3891 perform the conversions from the argument to the expected type
3892 but issue warnings rather than errors for any mismatches.
3893 Ignore the converted argument and use the PARMVAL obtained
3894 above by applying default conversions instead. */
3898 excess_precision,
3899 OPT_Wbuiltin_declaration_mismatch);
3900 }
3907 }
3912 {
3916 }
3919 {
3925 "too few arguments to built-in function %qE "
3928 }
3931 }
3932 \f
3933 /* This is the entry point used by the parser to build unary operators
3934 in the input. CODE, a tree_code, specifies the unary operator, and
3935 ARG is the operand. For unary plus, the C parser currently uses
3936 CONVERT_EXPR for code.
3938 LOC is the location to use for the tree generated.
3939 */
3941 struct c_expr
3943 {
3951 {
3953 }
3954 else
3955 {
3960 }
3962 /* We are typically called when parsing a prefix token at LOC acting on
3963 ARG. Reflect this by updating the source range of the result to
3964 start at LOC and end at the end of ARG. */
3969 }
3971 /* Returns true if TYPE is a character type, *not* including wchar_t. */
3973 bool
3975 {
3981 }
3983 /* This is the entry point used by the parser to build binary operators
3984 in the input. CODE, a tree_code, specifies the binary operator, and
3985 ARG1 and ARG2 are the operands. In addition to constructing the
3986 expression, we check for operands that were written with other binary
3987 operators in a way that is likely to confuse the user.
3989 LOCATION is the location of the binary operator. */
3991 struct c_expr
3994 {
4014 {
4019 }
4028 /* Check for cases such as x+y<<z which users are likely
4029 to misinterpret. */
4039 {
4043 {
4047 else
4049 }
4051 {
4055 else
4057 }
4060 }
4066 /* Avoid warning for !!x == y. */
4069 {
4070 /* Avoid warning for !b == y where b has _Bool type. */
4075 {
4077 do
4078 {
4085 else
4087 }
4089 }
4092 }
4094 /* Warn about comparisons against string literals, with the exception
4095 of testing for equality or inequality of a string literal with NULL. */
4097 {
4104 /* Warn for ptr == '\0', it's likely that it should've been ptr[0]. */
4108 {
4109 auto_diagnostic_group d;
4111 "comparison between pointer and zero character "
4115 }
4119 {
4120 auto_diagnostic_group d;
4122 "comparison between pointer and zero character "
4126 }
4127 }
4131 "comparison with string literal results in unspecified "
4145 /* Warn about comparisons of different enum types. */
4160 location,
4164 }
4165 \f
4166 /* Return a tree for the difference of pointers OP0 and OP1.
4167 The resulting tree has type ptrdiff_t. If POINTER_SUBTRACT sanitization is
4168 enabled, assign to INSTRUMENT_EXPR call to libsanitizer. */
4170 static tree
4172 {
4182 /* If the operands point into different address spaces, we need to
4183 explicitly convert them to pointers into the common address space
4184 before we can subtract the numerical address values. */
4186 {
4187 addr_space_t as_common;
4188 tree common_type;
4190 /* Determine the common superset address space. This is guaranteed
4191 to exist because the caller verified that comp_target_types
4192 returned non-zero. */
4199 }
4201 /* Determine integer type result of the subtraction. This will usually
4202 be the same as the result type (ptrdiff_t), but may need to be a wider
4203 type if pointers for the address space are wider than ptrdiff_t. */
4206 else
4218 {
4224 }
4226 /* First do the subtraction, then build the divide operator
4227 and only convert at the very end.
4228 Do not do default conversions in case restype is a short type. */
4230 /* POINTER_DIFF_EXPR requires a signed integer type of the same size as
4231 pointers. If some platform cannot provide that, or has a larger
4232 ptrdiff_type to support differences larger than half the address
4233 space, cast the pointers to some larger integer type and do the
4234 computations in that type. */
4238 else
4239 {
4240 /* Cast away qualifiers. */
4244 }
4246 /* This generates an error if op1 is pointer to incomplete type. */
4259 /* Divide by the size, in easiest possible way. */
4263 /* Convert to final result type if necessary. */
4265 }
4266 \f
4267 /* Expand atomic compound assignments into an appropriate sequence as
4268 specified by the C11 standard section 6.5.16.2.
4270 _Atomic T1 E1
4271 T2 E2
4272 E1 op= E2
4274 This sequence is used for all types for which these operations are
4275 supported.
4277 In addition, built-in versions of the 'fe' prefixed routines may
4278 need to be invoked for floating point (real, complex or vector) when
4279 floating-point exceptions are supported. See 6.5.16.2 footnote 113.
4281 T1 newval;
4282 T1 old;
4283 T1 *addr
4284 T2 val
4285 fenv_t fenv
4287 addr = &E1;
4288 val = (E2);
4289 __atomic_load (addr, &old, SEQ_CST);
4290 feholdexcept (&fenv);
4291 loop:
4292 newval = old op val;
4293 if (__atomic_compare_exchange_strong (addr, &old, &newval, SEQ_CST,
4294 SEQ_CST))
4295 goto done;
4296 feclearexcept (FE_ALL_EXCEPT);
4297 goto loop:
4298 done:
4299 feupdateenv (&fenv);
4301 The compiler will issue the __atomic_fetch_* built-in when possible,
4302 otherwise it will generate the generic form of the atomic operations.
4303 This requires temp(s) and has their address taken. The atomic processing
4304 is smart enough to figure out when the size of an object can utilize
4305 a lock-free version, and convert the built-in call to the appropriate
4306 lock-free routine. The optimizers will then dispose of any temps that
4307 are no longer required, and lock-free implementations are utilized as
4308 long as there is target support for the required size.
4310 If the operator is NOP_EXPR, then this is a simple assignment, and
4311 an __atomic_store is issued to perform the assignment rather than
4312 the above loop. */
4314 /* Build an atomic assignment at LOC, expanding into the proper
4315 sequence to store LHS MODIFYCODE= RHS. Return a value representing
4316 the result of the operation, unless RETURN_OLD_P, in which case
4317 return the old value of LHS (this is only for postincrement and
4318 postdecrement). */
4320 static tree
4323 {
4336 tree nonatomic_rhs_semantic_type;
4337 tree rhs_type;
4344 /* Allocate enough vector items for a compare_exchange. */
4347 /* Create a compound statement to hold the sequence of statements
4348 with a loop. */
4350 {
4353 /* For consistency with build_modify_expr on non-_Atomic,
4354 mark the lhs as read. Also, it would be very hard to match
4355 such expressions in mark_exp_read. */
4357 }
4359 /* Remove any excess precision (which is only present here in the
4360 case of compound assignments). */
4362 {
4365 }
4368 /* Fold the RHS if it hasn't already been folded. */
4372 /* Remove the qualifiers for the rest of the expressions and create
4373 the VAL temp variable to hold the RHS. */
4377 TYPE_UNQUALIFIED);
4382 NULL_TREE);
4388 /* NOP_EXPR indicates it's a straight store of the RHS. Simply issue
4389 an atomic_store. */
4391 {
4393 /* Build __atomic_store (&lhs, &val, SEQ_CST) */
4404 /* VAL is the value which was stored, return a COMPOUND_STMT of
4405 the statement and that value. */
4407 }
4409 /* Attempt to implement the atomic operation as an __atomic_fetch_* or
4410 __atomic_*_fetch built-in rather than a CAS loop. atomic_bool type
4411 isn't applicable for such builtins. ??? Do we want to handle enums? */
4414 {
4415 built_in_function fncode;
4417 {
4420 fncode = (return_old_p
4421 ? BUILT_IN_ATOMIC_FETCH_ADD_N
4425 fncode = (return_old_p
4426 ? BUILT_IN_ATOMIC_FETCH_SUB_N
4430 fncode = (return_old_p
4431 ? BUILT_IN_ATOMIC_FETCH_AND_N
4435 fncode = (return_old_p
4436 ? BUILT_IN_ATOMIC_FETCH_OR_N
4440 fncode = (return_old_p
4441 ? BUILT_IN_ATOMIC_FETCH_XOR_N
4446 }
4448 /* We can only use "_1" through "_16" variants of the atomic fetch
4449 built-ins. */
4454 /* If this is a pointer type, we need to multiply by the size of
4455 the pointer target type. */
4457 {
4459 /* ??? This would introduce -Wdiscarded-qualifiers
4460 warning: __atomic_fetch_* expect volatile void *
4461 type as the first argument. (Assignments between
4462 atomic and non-atomic objects are OK.) */
4469 }
4471 /* Build __atomic_fetch_* (&lhs, &val, SEQ_CST), or
4472 __atomic_*_fetch (&lhs, &val, SEQ_CST). */
4487 /* Finish the compound statement. */
4490 /* NEWVAL is the value which was stored, return a COMPOUND_STMT of
4491 the statement and that value. */
4493 }
4495 cas_loop:
4496 /* Create the variables and labels required for the op= form. */
4513 /* __atomic_load (addr, &old, SEQ_CST). */
4520 NULL_TREE);
4524 /* Create the expressions for floating-point environment
4525 manipulation, if required. */
4535 /* loop: */
4538 /* newval = old + val; */
4543 {
4547 }
4548 else
4554 {
4556 NULL_TREE);
4559 }
4561 /* if (__atomic_compare_exchange (addr, &old, &new, false, SEQ_CST, SEQ_CST))
4562 goto done; */
4582 /* goto loop; */
4587 /* done: */
4593 /* Finish the compound statement. */
4596 /* NEWVAL is the value that was successfully stored, return a
4597 COMPOUND_EXPR of the statement and the appropriate value. */
4600 }
4602 /* Construct and perhaps optimize a tree representation
4603 for a unary operation. CODE, a tree_code, specifies the operation
4604 and XARG is the operand.
4605 For any CODE other than ADDR_EXPR, NOCONVERT suppresses the default
4606 promotions (such as from short to int).
4607 For ADDR_EXPR, the default promotions are not applied; NOCONVERT allows
4608 non-lvalues; this is only used to handle conversion of non-lvalue arrays
4609 to pointers in C99.
4611 LOCATION is the location of the operator. */
4613 tree
4616 {
4617 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
4621 tree val;
4642 {
4645 }
4648 {
4651 }
4654 {
4656 /* This is used for unary plus, because a CONVERT_EXPR
4657 is enough to prevent anybody from looking inside for
4658 associativity, but won't generate any code. */
4663 {
4666 }
4677 {
4680 }
4686 /* ~ works on integer types and non float vectors. */
4691 {
4694 /* Warn if the expression has boolean value. */
4700 {
4701 auto_diagnostic_group d;
4704 {
4708 }
4709 }
4712 }
4714 {
4720 }
4721 else
4722 {
4725 }
4730 {
4733 }
4740 {
4743 }
4749 /* Conjugating a real value is a no-op, but allow it anyway. */
4752 {
4755 }
4765 {
4769 }
4771 {
4774 }
4775 else
4778 /* If the TRUTH_NOT_EXPR has been folded, reset the location. */
4798 {
4801 noconvert);
4809 }
4811 /* Complain about anything that is not a true lvalue. In
4812 Objective-C, skip this check for property_refs. */
4817 ? lv_increment
4822 {
4826 else
4829 }
4832 {
4836 else
4839 }
4841 /* Ensure the argument is fully folded inside any SAVE_EXPR. */
4847 /* Increment or decrement the real part of the value,
4848 and don't change the imaginary part. */
4850 {
4857 {
4869 }
4870 }
4872 /* Report invalid types. */
4878 {
4881 else
4885 }
4887 {
4888 tree inc;
4892 /* Compute the increment. */
4895 {
4896 /* If pointer target is an incomplete type,
4897 we just cannot know how to do the arithmetic. */
4899 {
4904 else
4908 }
4911 {
4915 else
4918 }
4919 else
4925 }
4927 {
4928 /* For signed fract types, we invert ++ to -- or
4929 -- to ++, and change inc from 1 to -1, because
4930 it is not possible to represent 1 in signed fract constants.
4931 For unsigned fract types, the result always overflows and
4932 we get an undefined (original) or the maximum value. */
4944 }
4945 else
4946 {
4951 }
4953 /* If 'arg' is an Objective-C PROPERTY_REF expression, then we
4954 need to ask Objective-C to build the increment or decrement
4955 expression for it. */
4960 /* Report a read-only lvalue. */
4962 {
4968 }
4975 /* If the argument is atomic, use the special code sequences for
4976 atomic compound assignment. */
4978 {
4983 ? PLUS_EXPR
4986 ? inc
4991 }
4995 else
5000 TYPE_UNQUALIFIED);
5003 }
5006 /* Note that this operation never does default_conversion. */
5008 /* The operand of unary '&' must be an lvalue (which excludes
5009 expressions of type void), or, in C99, the result of a [] or
5010 unary '*' operator. */
5016 /* Let &* cancel out to simplify resulting code. */
5018 {
5019 /* Don't let this be an lvalue. */
5024 }
5026 /* Anything not already handled and not a true memory reference
5027 or a non-lvalue array is an error. */
5032 /* Move address operations inside C_MAYBE_CONST_EXPR to simplify
5033 folding later. */
5035 {
5038 noconvert);
5045 }
5047 /* Ordinary case; arg is a COMPONENT_REF or a decl. */
5050 /* If the lvalue is const or volatile, merge that into the type
5051 to which the address will point. This is only needed
5052 for function types. */
5056 {
5066 }
5069 {
5072 {
5076 }
5078 /* fall through */
5082 {
5086 {
5090 }
5095 "address of array with reverse scalar storage "
5097 }
5101 }
5111 /* ??? Cope with user tricks that amount to offsetof. Delete this
5112 when we have proper support for integer constant expressions. */
5116 {
5119 }
5132 }
5137 ret = (require_constant_value
5140 else
5142 return_build_unary_op:
5153 }
5155 /* Return nonzero if REF is an lvalue valid for this language.
5156 Lvalues can be assigned, unless their type has TYPE_READONLY.
5157 Lvalues can have their address taken, unless they have C_DECL_REGISTER. */
5159 bool
5161 {
5165 {
5180 /* MEM_REFs can appear from -fgimple parsing or folding, so allow them
5181 here as well. */
5196 }
5197 }
5198 \f
5199 /* Give a warning for storing in something that is read-only in GCC
5200 terms but not const in ISO C terms. */
5202 static void
5204 {
5206 {
5218 }
5220 }
5223 /* Return nonzero if REF is an lvalue valid for this language;
5224 otherwise, print an error message and return zero. USE says
5225 how the lvalue is being used and so selects the error message.
5226 LOCATION is the location at which any error should be reported. */
5228 static int
5230 {
5237 }
5238 \f
5239 /* Mark EXP saying that we need to be able to take the
5240 address of it; it should not be allocated in a register.
5241 Returns true if successful. ARRAY_REF_P is true if this
5242 is for ARRAY_REF construction - in that case we don't want
5243 to look through VIEW_CONVERT_EXPR from VECTOR_TYPE to ARRAY_TYPE,
5244 it is fine to use ARRAY_REFs for vector subscripts on vector
5245 register variables. */
5247 bool
5249 {
5254 {
5265 {
5269 }
5270 /* FALLTHRU */
5280 {
5283 }
5298 {
5300 {
5301 error
5304 }
5306 }
5308 {
5311 else
5314 }
5316 /* FALLTHRU */
5319 /* FALLTHRU */
5322 }
5323 }
5324 \f
5325 /* Convert EXPR to TYPE, warning about conversion problems with
5326 constants. SEMANTIC_TYPE is the type this conversion would use
5327 without excess precision. If SEMANTIC_TYPE is NULL, this function
5328 is equivalent to convert_and_check. This function is a wrapper that
5329 handles conversions that may be different than
5330 the usual ones because of excess precision. */
5332 static tree
5334 tree semantic_type)
5335 {
5339 /* For C11, integer conversions may have results with excess
5340 precision. */
5346 {
5347 /* For integers, we need to check the real conversion, not
5348 the conversion to the excess precision type. */
5350 }
5351 /* Result type is the excess precision type, which should be
5352 large enough, so do not check. */
5354 }
5356 /* If EXPR refers to a built-in declared without a prototype returns
5357 the actual type of the built-in and, if non-null, set *BLTIN to
5358 a pointer to the built-in. Otherwise return the type of EXPR
5359 and clear *BLTIN if non-null. */
5361 static tree
5363 {
5364 tree dummy;
5388 }
5390 /* Build and return a conditional expression IFEXP ? OP1 : OP2. If
5391 IFEXP_BCP then the condition is a call to __builtin_constant_p, and
5392 if folded to an integer constant then the unselected half may
5393 contain arbitrary operations not normally permitted in constant
5394 expressions. Set the location of the expression to LOC. */
5396 tree
5400 {
5401 tree type1;
5402 tree type2;
5410 tree ret;
5422 /* Promote both alternatives. */
5447 /* C90 does not permit non-lvalue arrays in conditional expressions.
5448 In C99 they will be pointers by now. */
5450 {
5453 }
5461 {
5464 {
5468 }
5470 {
5474 }
5475 }
5478 {
5489 }
5491 /* Quickly detect the usual case where op1 and op2 have the same type
5492 after promotion. */
5494 {
5497 else
5499 }
5504 {
5505 /* In C11, a conditional expression between a floating-point
5506 type and an integer type should convert the integer type to
5507 the evaluation format of the floating-point type, with
5508 possible excess precision. */
5512 {
5513 tree eptype;
5516 {
5520 }
5523 {
5527 }
5528 }
5533 "implicit conversion from %qT to %qT to "
5535 colon_loc);
5537 /* If -Wsign-compare, warn here if type1 and type2 have
5538 different signedness. We'll promote the signed to unsigned
5539 and later code won't know it used to be different.
5540 Do this check on the original types, so that explicit casts
5541 will be considered, but default promotions won't. */
5543 {
5548 {
5551 /* Do not warn if the result type is signed, since the
5552 signed type will only be chosen if it can represent
5553 all the values of the unsigned type. */
5556 else
5557 {
5561 /* Do not warn if the signed quantity is an
5562 unsuffixed integer literal (or some static
5563 constant expression involving such literals) and
5564 it is non-negative. This warning requires the
5565 operands to be folded for best results, so do
5566 that folding in this case even without
5567 warn_sign_compare to avoid warning options
5568 possibly affecting code generation. */
5569 c_inhibit_evaluation_warnings
5573 c_inhibit_evaluation_warnings
5576 c_inhibit_evaluation_warnings
5580 c_inhibit_evaluation_warnings
5584 {
5587 || (unsigned_op1
5592 "operand of %<?:%> changes signedness from "
5593 "%qT to %qT due to unsignedness of other "
5596 else
5598 "operand of %<?:%> changes signedness from "
5599 "%qT to %qT due to unsignedness of other "
5602 }
5607 }
5608 }
5609 }
5610 }
5612 {
5617 }
5619 {
5622 addr_space_t as_common;
5631 {
5635 }
5640 {
5645 {
5646 /* roles are swapped */
5649 }
5653 {
5656 "pointer to array loses qualifier "
5660 "pointer to array loses qualifier "
5662 }
5665 "ISO C forbids conditional expr between "
5667 /* for array, use qualifiers of element type */
5671 }
5672 /* Objective-C pointer comparisons are a bit more lenient. */
5675 else
5676 {
5680 /* This downgrade to a warning ensures that -std=gnu89
5681 -pedantic-errors does not flag these mismatches between
5682 builtins as errors (as DK_PERMERROR would). ISO C99
5683 and later do not have implicit function declarations,
5684 so the mismatch cannot occur naturally there. */
5687 "pointer type mismatch "
5689 {
5692 }
5693 result_type = build_pointer_type
5695 }
5696 }
5699 {
5702 "pointer/integer type mismatch "
5704 else
5705 {
5707 }
5709 }
5712 {
5715 "pointer/integer type mismatch "
5717 else
5718 {
5720 }
5722 }
5723 /* 6.5.15: "if one is a null pointer constant (other than a pointer) or has
5724 type nullptr_t and the other is a pointer, the result type is the pointer
5725 type." */
5737 {
5740 else
5741 {
5744 }
5745 }
5747 /* Merge const and volatile flags of the incoming types. */
5748 result_type
5754 semantic_result_type);
5756 semantic_result_type);
5759 {
5762 }
5764 {
5767 }
5769 && op1_int_operands
5772 {
5779 }
5781 /* Need to convert condition operand into a vector mask. */
5783 {
5790 }
5794 else
5795 {
5797 {
5798 /* Use c_fully_fold here, since C_MAYBE_CONST_EXPR might be
5799 nested inside of the expression. */
5802 }
5806 }
5812 /* If the OP1 and OP2 are the same and don't have side-effects,
5813 warn here, because the COND_EXPR will be turned into OP1. */
5821 }
5822 \f
5823 /* EXPR is an expression, location LOC, whose result is discarded.
5824 Warn if it is a call to a nodiscard function (or a COMPOUND_EXPR
5825 whose right-hand operand is such a call, possibly recursively). */
5827 static void
5829 {
5833 {
5837 }
5843 tree attr;
5848 {
5853 auto_diagnostic_group d;
5857 "ignoring return value of %qD, declared with "
5859 else
5861 "ignoring return value of %qD, declared with "
5865 }
5866 else
5867 {
5875 auto_diagnostic_group d;
5879 "ignoring return value of type %qT, declared "
5882 else
5884 "ignoring return value of type %qT, declared "
5887 {
5889 {
5894 }
5895 }
5896 }
5897 }
5899 /* Return a compound expression that performs two expressions and
5900 returns the value of the second of them.
5902 LOC is the location of the COMPOUND_EXPR. */
5904 tree
5906 {
5909 tree ret;
5921 {
5924 }
5927 {
5928 /* The left-hand operand of a comma expression is like an expression
5929 statement: with -Wunused, we should warn if it doesn't have
5930 any side-effects, unless it was explicitly cast to (void). */
5932 {
5940 else
5943 }
5944 }
5947 {
5951 {
5955 }
5961 }
5963 /* With -Wunused, we should also warn if the left-hand operand does have
5964 side-effects, but computes a value which is not used. For example, in
5965 `foo() + bar(), baz()' the result of the `+' operator is not used,
5966 so we should issue a warning. */
5978 && expr1_int_operands
5987 }
5989 /* Issue -Wcast-qual warnings when appropriate. TYPE is the type to
5990 which we are casting. OTYPE is the type of the expression being
5991 cast. Both TYPE and OTYPE are pointer types. LOC is the location
5992 of the cast. -Wcast-qual appeared on the command line. Named
5993 address space qualifiers are not handled here, because they result
5994 in different warnings. */
5996 static void
5998 {
6005 /* Check that the qualifiers on IN_TYPE are a superset of the
6006 qualifiers of IN_OTYPE. The outermost level of POINTER_TYPE
6007 nodes is uninteresting and we stop as soon as we hit a
6008 non-POINTER_TYPE node on either type. */
6009 do
6010 {
6014 /* GNU C allows cv-qualified function types. 'const' means the
6015 function is very pure, 'volatile' means it can't return. We
6016 need to warn when such qualifiers are added, not when they're
6017 taken away. */
6022 else
6025 }
6034 /* There are qualifiers present in IN_OTYPE that are not present
6035 in IN_TYPE. */
6038 discarded);
6043 /* A cast from **T to const **T is unsafe, because it can cause a
6044 const value to be changed with no additional warning. We only
6045 issue this warning if T is the same on both sides, and we only
6046 issue the warning if there are the same number of pointers on
6047 both sides, as otherwise the cast is clearly unsafe anyhow. A
6048 cast is unsafe when a qualifier is added at one level and const
6049 is not present at all outer levels.
6051 To issue this warning, we check at each level whether the cast
6052 adds new qualifiers not already seen. We don't need to special
6053 case function types, as they won't have the same
6054 TYPE_MAIN_VARIANT. */
6064 do
6065 {
6070 {
6072 "to be safe all intermediate pointers in cast from "
6076 }
6079 }
6081 }
6083 /* Heuristic check if two parameter types can be considered ABI-equivalent. */
6085 static bool
6087 {
6098 /* The signedness of the parameter matters only when an integral
6099 type smaller than int is promoted to int, otherwise only the
6100 precision of the parameter matters.
6101 This check should make sure that the callee does not see
6102 undefined values in argument registers. */
6112 }
6114 /* Check if a type cast between two function types can be considered safe. */
6116 static bool
6118 {
6137 }
6139 /* Build an expression representing a cast to type TYPE of expression EXPR.
6140 LOC is the location of the cast-- typically the open paren of the cast. */
6142 tree
6144 {
6145 tree value;
6159 /* The ObjC front-end uses TYPE_MAIN_VARIANT to tie together types differing
6160 only in <protocol> qualifications. But when constructing cast expressions,
6161 the protocols do matter and must be kept around. */
6168 {
6171 }
6174 {
6177 }
6180 {
6184 }
6187 {
6191 ;
6196 /* Convert to remove any qualifiers from VALUE's type. */
6198 }
6200 {
6201 tree field;
6210 {
6211 tree t;
6223 }
6226 }
6227 else
6228 {
6232 {
6236 }
6240 /* Optionally warn about potentially worrisome casts. */
6246 /* Warn about conversions between pointers to disjoint
6247 address spaces. */
6251 {
6254 addr_space_t as_common;
6257 {
6268 else
6273 }
6275 /* Warn of new allocations that are not big enough for the target
6276 type. */
6280 {
6285 alloc_size);
6286 }
6287 }
6289 /* Warn about possible alignment problems. */
6295 /* Don't warn about opaque types, where the actual alignment
6296 restriction is unknown. */
6308 /* Unlike conversion of integers to pointers, where the
6309 warning is disabled for converting constants because
6310 of cases such as SIG_*, warn about converting constant
6311 pointers to integers. In some cases it may cause unwanted
6312 sign extension, and a warning is appropriate. */
6319 "cast from function call of type %qT "
6326 /* Don't warn about converting any constant. */
6335 /* If pedantic, warn for conversions between function and object
6336 pointer types, except for converting a null pointer constant
6337 to function pointer type. */
6362 "cast between incompatible function types"
6368 /* Ignore any integer overflow caused by the cast. */
6370 {
6372 {
6374 {
6375 /* Avoid clobbering a shared constant. */
6378 }
6379 }
6381 /* Reset VALUE's overflow flags, ensuring constant sharing. */
6383 }
6384 }
6386 /* Don't let a cast be an lvalue. */
6390 /* Don't allow the results of casting to floating-point or complex
6391 types be confused with actual constants, or casts involving
6392 integer and pointer types other than direct integer-to-integer
6393 and integer-to-pointer be confused with integer constant
6394 expressions and null pointer constants. */
6404 /* If the expression has integer operands and so can occur in an
6405 unevaluated part of an integer constant expression, ensure the
6406 return value reflects this. */
6415 }
6417 /* Interpret a cast of expression EXPR to type TYPE. LOC is the
6418 location of the open paren of the cast, or the position of the cast
6419 expr. */
6420 tree
6422 {
6423 tree type;
6426 tree ret;
6429 /* This avoids warnings about unprototyped casts on
6430 integers. E.g. "#define SIG_DFL (void(*)())0". */
6442 {
6449 }
6454 /* C++ does not permits types to be defined in a cast, but it
6455 allows references to incomplete types. */
6461 }
6462 \f
6463 /* Build an assignment expression of lvalue LHS from value RHS.
6464 If LHS_ORIGTYPE is not NULL, it is the original type of LHS, which
6465 may differ from TREE_TYPE (LHS) for an enum bitfield.
6466 MODIFYCODE is the code for a binary operator that we use
6467 to combine the old value of LHS with RHS to get the new value.
6468 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
6469 If RHS_ORIGTYPE is not NULL_TREE, it is the original type of RHS,
6470 which may differ from TREE_TYPE (RHS) for an enum value.
6472 LOCATION is the location of the MODIFYCODE operator.
6473 RHS_LOC is the location of the RHS. */
6475 tree
6479 {
6480 tree result;
6481 tree newrhs;
6488 /* Types that aren't fully specified cannot be used in assignments. */
6491 /* Avoid duplicate error messages from operands that had errors. */
6495 /* Ensure an error for assigning a non-lvalue array to an array in
6496 C90. */
6498 {
6501 }
6503 /* For ObjC properties, defer this check. */
6512 {
6515 rhs_origtype);
6524 }
6526 /* If a binary op has been requested, combine the old LHS value with the RHS
6527 producing the value we should actually store into the LHS. */
6530 {
6534 /* Construct the RHS for any non-atomic compound assignemnt. */
6536 {
6537 /* If in LHS op= RHS the RHS has side-effects, ensure they
6538 are preevaluated before the rest of the assignment expression's
6539 side-effects, because RHS could contain e.g. function calls
6540 that modify LHS. */
6542 {
6545 else
6550 newrhs);
6551 }
6555 /* The original type of the right hand side is no longer
6556 meaningful. */
6558 }
6559 }
6562 {
6563 /* Check if we are modifying an Objective-C property reference;
6564 if so, we need to generate setter calls. */
6567 else
6572 /* Else, do the check that we postponed for Objective-C. */
6575 }
6577 /* Give an error for storing in something that is 'const'. */
6582 {
6585 }
6589 /* If storing into a structure or union member,
6590 it has probably been given type `int'.
6591 Compute the type that would go with
6592 the actual amount of storage the member occupies. */
6601 /* If storing in a field that is in actuality a short or narrower than one,
6602 we must store in the field in its actual type. */
6605 {
6608 }
6610 /* Issue -Wc++-compat warnings about an assignment to an enum type
6611 when LHS does not have its original type. This happens for,
6612 e.g., an enum bitfield in a struct. */
6617 {
6619 ? rhs_origtype
6626 }
6628 /* Remove qualifiers. */
6632 /* Convert new value to destination type. Fold it first, then
6633 restore any excess precision information, for the sake of
6634 conversion warnings. */
6637 {
6640 {
6642 {
6645 }
6650 }
6651 else
6658 }
6660 /* Emit ObjC write barrier, if necessary. */
6662 {
6665 {
6668 }
6669 }
6671 /* Scan operands. */
6675 else
6676 {
6680 }
6682 /* If we got the LHS in a different type for storing in,
6683 convert the result back to the nominal type of LHS
6684 so that the value we return always has the same type
6685 as the LHS argument. */
6695 return_result:
6699 }
6700 \f
6701 /* Return whether STRUCT_TYPE has an anonymous field with type TYPE.
6702 This is used to implement -fplan9-extensions. */
6704 static bool
6706 {
6707 tree field;
6715 {
6718 TYPE_QUAL_ATOMIC)
6722 {
6726 }
6730 {
6734 }
6735 }
6737 }
6739 /* RHS is an expression whose type is pointer to struct. If there is
6740 an anonymous field in RHS with type TYPE, then return a pointer to
6741 that field in RHS. This is used with -fplan9-extensions. This
6742 returns NULL if no conversion could be found. */
6744 static tree
6746 {
6750 tree ret;
6759 TYPE_QUAL_ATOMIC)
6767 {
6773 TYPE_QUAL_ATOMIC)
6776 {
6780 }
6782 lhs_main_type))
6783 {
6788 }
6789 }
6796 NULL_TREE);
6800 {
6803 }
6806 }
6808 /* Issue an error message for a bad initializer component.
6809 GMSGID identifies the message.
6810 The component name is taken from the spelling stack. */
6814 {
6817 auto_diagnostic_group d;
6819 /* The gmsgid may be a format string with %< and %>. */
6828 }
6830 /* Used to implement pedwarn_init and permerror_init. */
6835 {
6836 /* Use the location where a macro was expanded rather than where
6837 it was defined to make sure macros defined in system headers
6838 but used incorrectly elsewhere are diagnosed. */
6840 auto_diagnostic_group d;
6845 }
6847 /* Issue a pedantic warning for a bad initializer component. OPT is
6848 the option OPT_* (from options.h) controlling this warning or 0 if
6849 it is unconditionally given. GMSGID identifies the message. The
6850 component name is taken from the spelling stack. */
6854 {
6859 }
6861 /* Like pedwarn_init, but issue a permerror. */
6865 {
6870 }
6872 /* Issue a warning for a bad initializer component.
6874 OPT is the OPT_W* value corresponding to the warning option that
6875 controls this warning. GMSGID identifies the message. The
6876 component name is taken from the spelling stack. */
6878 static void
6880 {
6884 auto_diagnostic_group d;
6886 /* Use the location where a macro was expanded rather than where
6887 it was defined to make sure macros defined in system headers
6888 but used incorrectly elsewhere are diagnosed. */
6891 /* The gmsgid may be a format string with %< and %>. */
6896 }
6897 \f
6898 /* If TYPE is an array type and EXPR is a parenthesized string
6899 constant, warn if pedantic that EXPR is being used to initialize an
6900 object of type TYPE. */
6902 void
6904 {
6911 }
6913 /* Attempt to locate the parameter with the given index within FNDECL,
6914 returning DECL_SOURCE_LOCATION (FNDECL) if it can't be found. */
6916 static location_t
6918 {
6920 tree param;
6922 /* Locate param by index within DECL_ARGUMENTS (fndecl). */
6926 ;
6928 /* If something went wrong (e.g. if we have a builtin and thus no arguments),
6929 return DECL_SOURCE_LOCATION (FNDECL). */
6934 }
6936 /* Issue a note about a mismatching argument for parameter PARMNUM
6937 to FUNDECL, for types EXPECTED_TYPE and ACTUAL_TYPE.
6938 Attempt to issue the note at the pertinent parameter of the decl;
6939 failing that issue it at the location of FUNDECL; failing that
6940 issue it at PLOC. */
6942 static void
6945 {
6946 location_t loc;
6949 else
6955 }
6957 /* Issue a warning when an argument of ARGTYPE is passed to a built-in
6958 function FUNDECL declared without prototype to parameter PARMNUM of
6959 PARMTYPE when ARGTYPE does not promote to PARMTYPE. */
6961 static void
6964 {
6969 /* Avoid warning for enum arguments that promote to an integer type
6970 of the same size/mode. */
6982 /* This diagnoses even signed/unsigned mismatches. Those might be
6983 safe in many cases but GCC may emit suboptimal code for them so
6984 warning on those cases drives efficiency improvements. */
6988 "in a call to built-in function declared without "
6991 "in a call to built-in function declared without "
6996 fundecl);
6997 }
6999 /* Convert value RHS to type TYPE as preparation for an assignment to
7000 an lvalue of type TYPE. If ORIGTYPE is not NULL_TREE, it is the
7001 original type of RHS; this differs from TREE_TYPE (RHS) for enum
7002 types. NULL_POINTER_CONSTANT says whether RHS was a null pointer
7003 constant before any folding.
7004 The real work of conversion is done by `convert'.
7005 The purpose of this function is to generate error messages
7006 for assignments that are not allowed in C.
7007 ERRTYPE says whether it is argument passing, assignment,
7008 initialization or return.
7010 In the following example, '~' denotes where EXPR_LOC and '^' where
7011 LOCATION point to:
7013 f (var); [ic_argpass]
7014 ^ ~~~
7015 x = var; [ic_assign]
7016 ^ ~~~;
7017 int x = var; [ic_init]
7018 ^^^
7019 return x; [ic_return]
7020 ^
7022 FUNCTION is a tree for the function being called.
7023 PARMNUM is the number of the argument, for printing in error messages.
7024 WARNOPT may be set to a warning option to issue the corresponding warning
7025 rather than an error for invalid conversions. Used for calls to built-in
7026 functions declared without a prototype. */
7028 static tree
7033 {
7036 tree rhstype;
7041 /* Use the expansion point location to handle cases such as user's
7042 function returning a wrong-type macro defined in a system header. */
7046 {
7047 tree selector;
7048 /* Change pointer to function to the function itself for
7049 diagnostics. */
7054 /* Handle an ObjC selector specially for diagnostics. */
7058 {
7061 }
7062 }
7064 /* This macro is used to emit diagnostics to ensure that all format
7065 strings are complete sentences, visible to gettext and checked at
7066 compile time. */
7067 #define PEDWARN_FOR_ASSIGNMENT(LOCATION, PLOC, OPT, AR, AS, IN, RE) \
7068 do { \
7069 switch (errtype) \
7070 { \
7071 case ic_argpass: \
7072 { \
7073 auto_diagnostic_group d; \
7074 if (pedwarn (PLOC, OPT, AR, parmnum, rname)) \
7075 inform_for_arg (fundecl, (PLOC), parmnum, type, rhstype); \
7076 } \
7077 break; \
7078 case ic_assign: \
7079 pedwarn (LOCATION, OPT, AS); \
7080 break; \
7081 case ic_init: \
7082 case ic_init_const: \
7083 pedwarn_init (LOCATION, OPT, IN); \
7084 break; \
7085 case ic_return: \
7086 pedwarn (LOCATION, OPT, RE); \
7087 break; \
7088 default: \
7089 gcc_unreachable (); \
7090 } \
7091 } while (0)
7093 /* This macro is used to emit diagnostics to ensure that all format
7094 strings are complete sentences, visible to gettext and checked at
7095 compile time. It can be called with 'pedwarn' or 'warning_at'. */
7096 #define WARNING_FOR_QUALIFIERS(PEDWARN, LOCATION, PLOC, OPT, AR, AS, IN, RE, QUALS) \
7097 do { \
7098 switch (errtype) \
7099 { \
7100 case ic_argpass: \
7101 { \
7102 auto_diagnostic_group d; \
7103 if (PEDWARN) { \
7104 if (pedwarn (PLOC, OPT, AR, parmnum, rname, QUALS)) \
7105 inform_for_arg (fundecl, (PLOC), parmnum, type, rhstype); \
7106 } else { \
7107 if (warning_at (PLOC, OPT, AR, parmnum, rname, QUALS)) \
7108 inform_for_arg (fundecl, (PLOC), parmnum, type, rhstype); \
7109 } \
7110 } \
7111 break; \
7112 case ic_assign: \
7113 if (PEDWARN) \
7114 pedwarn (LOCATION, OPT, AS, QUALS); \
7115 else \
7116 warning_at (LOCATION, OPT, AS, QUALS); \
7117 break; \
7118 case ic_init: \
7119 case ic_init_const: \
7120 if (PEDWARN) \
7121 pedwarn (LOCATION, OPT, IN, QUALS); \
7122 else \
7123 warning_at (LOCATION, OPT, IN, QUALS); \
7124 break; \
7125 case ic_return: \
7126 if (PEDWARN) \
7127 pedwarn (LOCATION, OPT, RE, QUALS); \
7128 else \
7129 warning_at (LOCATION, OPT, RE, QUALS); \
7130 break; \
7131 default: \
7132 gcc_unreachable (); \
7133 } \
7134 } while (0)
7136 /* This macro is used to emit diagnostics to ensure that all format
7137 strings are complete sentences, visible to gettext and checked at
7138 compile time. It is the same as PEDWARN_FOR_ASSIGNMENT but with an
7139 extra parameter to enumerate qualifiers. */
7140 #define PEDWARN_FOR_QUALIFIERS(LOCATION, PLOC, OPT, AR, AS, IN, RE, QUALS) \
7141 WARNING_FOR_QUALIFIERS (true, LOCATION, PLOC, OPT, AR, AS, IN, RE, QUALS)
7154 {
7158 {
7175 }
7178 }
7181 {
7187 {
7213 }
7214 }
7217 {
7223 {
7228 }
7229 }
7232 {
7235 }
7238 {
7239 /* Except for passing an argument to an unprototyped function,
7240 this is a constraint violation. When passing an argument to
7241 an unprototyped function, it is compile-time undefined;
7242 making it a constraint in that case was rejected in
7243 DR#252. */
7247 else
7250 }
7258 /* A non-reference type can convert to a reference. This handles
7259 va_start, va_copy and possibly port built-ins. */
7261 {
7263 {
7267 else
7270 }
7287 }
7288 /* Some types can interconvert without explicit casts. */
7292 /* Arithmetic types all interconvert, and enum is treated like int. */
7301 {
7304 rhstype);
7317 }
7319 /* Aggregates in different TUs might need conversion. */
7326 /* Conversion to a transparent union or record from its member types.
7327 This applies only to function arguments. */
7331 {
7335 {
7346 {
7350 /* Any non-function converts to a [const][volatile] void *
7351 and vice versa; otherwise, targets must be the same.
7352 Meanwhile, the lhs target must have all the qualifiers of
7353 the rhs. */
7357 {
7360 /* If this type won't generate any warnings, use it. */
7368 /* Keep looking for a better type, but remember this one. */
7371 }
7372 }
7374 /* Can convert integer zero to any pointer type. */
7376 {
7379 }
7380 }
7383 {
7385 {
7386 /* We have only a marginally acceptable member type;
7387 it needs a warning. */
7391 /* Const and volatile mean something different for function
7392 types, so the usual warnings are not appropriate. */
7395 {
7396 /* Because const and volatile on functions are
7397 restrictions that say the function will not do
7398 certain things, it is okay to use a const or volatile
7399 function where an ordinary one is wanted, but not
7400 vice-versa. */
7404 OPT_Wdiscarded_qualifiers,
7406 "makes %q#v qualified function "
7409 "function pointer from "
7412 "function pointer from "
7417 }
7421 OPT_Wdiscarded_qualifiers,
7433 }
7441 }
7442 }
7444 /* Conversions among pointers */
7447 {
7448 /* If RHS refers to a built-in declared without a prototype
7449 BLTIN is the declaration of the built-in with a prototype
7450 and RHSTYPE is set to the actual type of the built-in. */
7451 tree bltin;
7460 addr_space_t asl;
7461 addr_space_t asr;
7466 TYPE_QUAL_ATOMIC)
7471 TYPE_QUAL_ATOMIC)
7473 /* Opaque pointers are treated like void pointers. */
7476 /* The Plan 9 compiler permits a pointer to a struct to be
7477 automatically converted into a pointer to an anonymous field
7478 within the struct. */
7483 {
7486 {
7492 }
7493 }
7495 /* C++ does not allow the implicit conversion void* -> T*. However,
7496 for the purpose of reducing the number of false positives, we
7497 tolerate the special case of
7499 int *p = NULL;
7501 where NULL is typically defined in C to be '(void *) 0'. */
7504 OPT_Wc___compat,
7505 "request for implicit conversion "
7508 /* Warn of new allocations that are not big enough for the target
7509 type. */
7513 {
7518 }
7520 /* See if the pointers point to incompatible address spaces. */
7525 {
7526 auto_diagnostic_group d;
7529 {
7531 {
7535 diagnosed
7537 else
7540 }
7542 {
7547 else
7550 }
7553 {
7558 else
7561 }
7563 {
7568 else
7571 }
7574 }
7576 {
7579 else
7582 }
7584 }
7586 /* Check if the right-hand side has a format attribute but the
7587 left-hand side doesn't. */
7590 {
7592 {
7595 "argument %d of %qE might be "
7601 "assignment left-hand side might be "
7607 "initialization left-hand side might be "
7612 "return type might be "
7617 }
7618 }
7620 /* See if the pointers point to incompatible scalar storage orders. */
7625 {
7626 tree t;
7629 {
7631 /* Do not warn for built-in functions, for example memcpy, since we
7632 control how they behave and they can be useful in this area. */
7636 "passing argument %d of %qE from incompatible "
7640 /* Do not warn if the RHS is a call to a function that returns a
7641 pointer that is not an alias. */
7646 "assignment to %qT from pointer type %qT with "
7651 /* Likewise. */
7656 "initialization of %qT from pointer type %qT with "
7661 "returning %qT from pointer type with incompatible "
7666 }
7667 }
7669 /* Any non-function converts to a [const][volatile] void *
7670 and vice versa; otherwise, targets must be the same.
7671 Meanwhile, the lhs target must have all the qualifiers of the rhs. */
7675 || is_opaque_pointer
7681 {
7682 /* Warn about loss of qualifers from pointers to arrays with
7683 qualifiers on the element type. */
7685 {
7693 OPT_Wdiscarded_array_qualifiers,
7703 }
7706 ||
7708 && !null_pointer_constant
7712 "%qE between function pointer "
7720 /* Const and volatile mean something different for function types,
7721 so the usual warnings are not appropriate. */
7724 {
7725 /* Assignments between atomic and non-atomic objects are OK. */
7731 /* Don't warn about loss of qualifier for conversions from
7732 qualified void* to pointers to arrays with corresponding
7733 qualifier on the element type (except for pedantic before C23). */
7736 OPT_Wdiscarded_qualifiers,
7750 /* If this is not a case of ignoring a mismatch in signedness,
7751 no warning. */
7754 ;
7755 /* If there is a mismatch, do warn. */
7758 {
7760 {
7761 auto_diagnostic_group d;
7765 "pointer targets in passing argument %d of "
7768 rhstype);
7769 }
7773 "pointer targets in assignment from %qT to %qT "
7779 "pointer targets in initialization of %qT "
7781 rhstype);
7785 "returning %qT from a function with return type "
7790 }
7791 }
7794 {
7795 /* Because const and volatile on functions are restrictions
7796 that say the function will not do certain things,
7797 it is okay to use a const or volatile function
7798 where an ordinary one is wanted, but not vice-versa. */
7802 OPT_Wdiscarded_qualifiers,
7804 "%q#v qualified function pointer "
7813 }
7814 }
7815 /* Avoid warning about the volatile ObjC EH puts on decls. */
7817 {
7819 {
7821 {
7822 auto_diagnostic_group d;
7826 "passing argument %d of %qE from "
7830 }
7835 "assignment to %qT from pointer to "
7838 else
7840 "assignment to %qT from incompatible pointer "
7847 "initialization of %qT from pointer to "
7850 else
7852 "initialization of %qT from incompatible "
7859 "returning pointer to %qD of type %qT from "
7862 else
7864 "returning %qT from a function with "
7869 }
7870 }
7872 /* If RHS isn't an address, check pointer or array of packed
7873 struct or union. */
7877 }
7879 {
7880 /* ??? This should not be an error when inlining calls to
7881 unprototyped functions. */
7885 else
7888 }
7893 {
7894 /* An explicit constant 0 or type nullptr_t can convert to a pointer,
7895 or one that results from arithmetic, even including a cast to
7896 integer type. */
7899 {
7901 {
7902 auto_diagnostic_group d;
7906 "passing argument %d of %qE makes pointer "
7909 }
7913 "assignment to %qT from %qT makes pointer from "
7919 "initialization of %qT from %qT makes pointer "
7924 "returning %qT from a function with return type "
7930 }
7933 }
7936 {
7938 {
7940 {
7941 auto_diagnostic_group d;
7945 "passing argument %d of %qE makes integer from "
7948 }
7952 "assignment to %qT from %qT makes integer from "
7958 "initialization of %qT from %qT makes integer "
7963 "function with return type %qT makes integer from "
7968 }
7971 }
7973 /* The type nullptr_t may be converted to bool. The
7974 result is false. */
7976 {
7977 tree ret;
7983 }
7988 {
7990 {
7991 auto_diagnostic_group d;
7997 else
8000 }
8003 {
8008 else
8011 }
8014 {
8019 else
8022 }
8024 {
8029 else
8032 }
8035 }
8038 }
8039 \f
8040 /* If VALUE is a compound expr all of whose expressions are constant, then
8041 return its value. Otherwise, return error_mark_node.
8043 This is for handling COMPOUND_EXPRs as initializer elements
8044 which is allowed with a warning when -pedantic is specified. */
8046 static tree
8048 {
8050 {
8055 endtype);
8056 }
8059 else
8061 }
8062 \f
8063 /* Perform appropriate conversions on the initial value of a variable,
8064 store it in the declaration DECL,
8065 and print any error messages that are appropriate.
8066 If ORIGTYPE is not NULL_TREE, it is the original type of INIT.
8067 If the init is invalid, store an ERROR_MARK.
8069 INIT_LOC is the location of the initial value. */
8071 void
8073 {
8079 /* If variable's type was invalidly declared, just ignore it. */
8085 /* Digest the specified initializer into an expression. */
8088 {
8093 /* Not fully determined before folding. */
8095 }
8102 /* Store the expression if valid; else report error. */
8112 /* ANSI wants warnings about out-of-range constant initializers. */
8117 /* Check if we need to set array size from compound literal size. */
8121 {
8128 {
8132 {
8133 /* For int foo[] = (int [3]){1}; we need to set array size
8134 now since later on array initializer will be just the
8135 brace enclosed list of the compound literal. */
8143 }
8144 }
8145 }
8146 }
8147 \f
8148 /* Methods for storing and printing names for error messages. */
8150 /* Implement a spelling stack that allows components of a name to be pushed
8151 and popped. Each element on the stack is this structure. */
8153 struct spelling
8154 {
8156 union
8157 {
8161 };
8163 #define SPELLING_STRING 1
8164 #define SPELLING_MEMBER 2
8165 #define SPELLING_BOUNDS 3
8171 /* Macros to save and restore the spelling stack around push_... functions.
8172 Alternative to SAVE_SPELLING_STACK. */
8174 #define SPELLING_DEPTH() (spelling - spelling_base)
8175 #define RESTORE_SPELLING_DEPTH(DEPTH) (spelling = spelling_base + (DEPTH))
8177 /* Push an element on the spelling stack with type KIND and assign VALUE
8178 to MEMBER. */
8180 #define PUSH_SPELLING(KIND, VALUE, MEMBER) \
8181 { \
8182 int depth = SPELLING_DEPTH (); \
8183 \
8184 if (depth >= spelling_size) \
8185 { \
8186 spelling_size += 10; \
8187 spelling_base = XRESIZEVEC (struct spelling, spelling_base, \
8188 spelling_size); \
8189 RESTORE_SPELLING_DEPTH (depth); \
8190 } \
8191 \
8192 spelling->kind = (KIND); \
8193 spelling->MEMBER = (VALUE); \
8194 spelling++; \
8195 }
8197 /* Push STRING on the stack. Printed literally. */
8199 static void
8201 {
8203 }
8205 /* Push a member name on the stack. Printed as '.' STRING. */
8207 static void
8209 {
8215 }
8217 /* Push an array bounds on the stack. Printed as [BOUNDS]. */
8219 static void
8221 {
8223 }
8225 /* Compute the maximum size in bytes of the printed spelling. */
8227 static int
8229 {
8234 {
8237 else
8239 }
8242 }
8244 /* Print the spelling to BUFFER and return it. */
8248 {
8254 {
8257 }
8258 else
8259 {
8264 ;
8265 }
8268 }
8270 /* Check whether INIT, a floating or integer constant, is
8271 representable in TYPE, a real floating type with the same radix or
8272 a decimal floating type initialized with a binary floating
8273 constant. Return true if OK, false if not. */
8274 static bool
8276 {
8281 {
8282 /* Same mode, no conversion required except for the case of
8283 signaling NaNs if the types are incompatible (e.g. double and
8284 long double with the same mode). */
8290 }
8292 {
8298 }
8308 {
8309 /* This is valid if the real number represented by the
8310 initializer can be exactly represented in the decimal
8311 type. Compare the values using MPFR. */
8312 REAL_VALUE_TYPE t;
8325 }
8326 /* exact_real_truncate is not quite right here, since it doesn't
8327 allow even an exact conversion to subnormal values. */
8328 REAL_VALUE_TYPE t;
8331 }
8333 /* Check whether INIT (location LOC) is valid as a 'constexpr'
8334 initializer for type TYPE, and give an error if not. INIT has
8335 already been folded and verified to be constant. INT_CONST_EXPR
8336 and ARITH_CONST_EXPR say whether it is an integer constant
8337 expression or arithmetic constant expression, respectively. If
8338 TYPE is not a scalar type, this function does nothing. */
8340 static void
8343 {
8345 {
8346 /* The initializer must be null. */
8350 }
8352 {
8353 /* The initializer must be an integer constant expression,
8354 representable in the target type. */
8362 }
8363 /* We don't apply any extra checks to extension types such as vector
8364 or fixed-point types. */
8368 {
8372 }
8373 /* We don't apply any extra checks to complex integers. */
8377 /* Following N3082, a real type cannot be initialized from a complex
8378 type and a binary type cannot be initialized from a decimal type
8379 (but initializing a decimal type from a binary type is OK).
8380 Signaling NaN initializers are OK only if the types are
8381 compatible (not just the same mode); all quiet NaN and infinity
8382 initializations are considered to preserve the value. */
8385 {
8389 }
8394 {
8398 }
8401 {
8403 {
8416 }
8417 }
8418 else
8423 }
8425 /* Digest the parser output INIT as an initializer for type TYPE.
8426 Return a C expression of type TYPE to represent the initial value.
8428 If ORIGTYPE is not NULL_TREE, it is the original type of INIT.
8430 NULL_POINTER_CONSTANT is true if INIT is a null pointer constant,
8431 INT_CONST_EXPR is true if INIT is an integer constant expression,
8432 and ARITH_CONST_EXPR is true if INIT is, or might be, an arithmetic
8433 constant expression, false if it has already been determined in the
8434 caller that it is not (but folding may have made the value passed here
8435 indistinguishable from an arithmetic constant expression).
8437 If INIT is a string constant, STRICT_STRING is true if it is
8438 unparenthesized or we should not warn here for it being parenthesized.
8439 For other types of INIT, STRICT_STRING is not used.
8441 INIT_LOC is the location of the INIT.
8443 REQUIRE_CONSTANT requests an error if non-constant initializers or
8444 elements are seen. REQUIRE_CONSTEXPR means the stricter requirements
8445 on initializers for 'constexpr' objects apply. */
8447 static tree
8452 {
8459 || !init
8466 {
8468 {
8471 }
8473 }
8474 /* TODO: this may not detect all cases of expressions folding to
8475 constants that are not arithmetic constant expressions. */
8489 /* Initialization of an array of chars from a string constant
8490 optionally enclosed in braces. */
8494 {
8495 tree typ1
8498 TYPE_QUAL_ATOMIC)
8500 /* Note that an array could be both an array of character type
8501 and an array of wchar_t if wchar_t is signed char or unsigned
8502 char. */
8511 {
8530 {
8533 }
8538 {
8543 }
8547 {
8548 /* Check if all characters of the string can be
8549 represented in the type of the constexpr object being
8550 initialized. */
8557 {
8561 }
8562 }
8567 {
8571 /* Subtract the size of a single (possibly wide) character
8572 because it's ok to ignore the terminating null char
8573 that is counted in the length of the constant. */
8584 {
8585 unsigned HOST_WIDE_INT size
8590 }
8591 }
8595 }
8597 {
8601 }
8602 }
8604 /* Build a VECTOR_CST from a *constant* vector constructor. If the
8605 vector constructor is not constant (e.g. {1,2,3,foo()}) then punt
8606 below and handle as a constructor. */
8611 {
8618 {
8620 tree value;
8623 /* Iterate through elements and check if all constructor
8624 elements are *_CSTs. */
8627 {
8630 }
8635 }
8636 }
8641 /* Any type can be initialized
8642 from an expression of the same type, optionally with braces. */
8655 {
8657 {
8659 {
8662 inside_init = array_to_pointer_conversion
8664 else
8665 {
8668 }
8669 }
8670 }
8673 /* Although the types are compatible, we may require a
8674 conversion. */
8679 {
8682 }
8686 {
8687 /* As an extension, allow initializing objects with static storage
8688 duration with compound literals (which are then treated just as
8689 the brace enclosed list they contain). Also allow this for
8690 vectors, as we can only assign them with compound literals. */
8696 }
8700 {
8704 }
8706 /* Compound expressions can only occur here if -Wpedantic or
8707 -pedantic-errors is specified. In the later case, we always want
8708 an error. In the former case, we simply want a warning. */
8711 {
8712 inside_init
8717 else
8722 }
8726 {
8729 }
8737 /* Added to enable additional -Wsuggest-attribute=format warnings. */
8741 (require_constant
8742 ? ic_init_const
8746 }
8748 /* Handle scalar types, including conversions. */
8754 {
8762 inside_init);
8763 inside_init
8770 /* Check to see if we have already given an error message. */
8772 ;
8774 {
8777 }
8781 {
8785 }
8794 }
8796 /* Come here only for records and arrays. */
8799 {
8801 "variable-sized object may not be initialized except "
8804 }
8808 }
8809 \f
8810 /* Handle initializers that use braces. */
8812 /* Type of object we are accumulating a constructor for.
8813 This type is always a RECORD_TYPE, UNION_TYPE or ARRAY_TYPE. */
8816 /* For a RECORD_TYPE or UNION_TYPE, this is the chain of fields
8817 left to fill. */
8820 /* For an ARRAY_TYPE, this is the specified index
8821 at which to store the next element we get. */
8824 /* For an ARRAY_TYPE, this is the maximum index. */
8827 /* For a RECORD_TYPE, this is the first field not yet written out. */
8830 /* For an ARRAY_TYPE, this is the index of the first element
8831 not yet written out. */
8834 /* In a RECORD_TYPE, the byte index of the next consecutive field.
8835 This is so we can generate gaps between fields, when appropriate. */
8838 /* If we are saving up the elements rather than allocating them,
8839 this is the list of elements so far (in reverse order,
8840 most recent first). */
8843 /* 1 if constructor should be incrementally stored into a constructor chain,
8844 0 if all the elements should be kept in AVL tree. */
8847 /* 1 if so far this constructor's elements are all compile-time constants. */
8850 /* 1 if so far this constructor's elements are all valid address constants. */
8853 /* 1 if this constructor has an element that cannot be part of a
8854 constant expression. */
8857 /* 1 if this constructor is erroneous so far. */
8860 /* 1 if this constructor is the universal zero initializer { 0 }. */
8863 /* Structure for managing pending initializer elements, organized as an
8864 AVL tree. */
8866 struct init_node
8867 {
8871 tree purpose;
8872 tree value;
8873 tree origtype;
8874 };
8876 /* Tree of pending elements at this constructor level.
8877 These are elements encountered out of order
8878 which belong at places we haven't reached yet in actually
8879 writing the output.
8880 Will never hold tree nodes across GC runs. */
8883 /* The SPELLING_DEPTH of this constructor. */
8886 /* DECL node for which an initializer is being read.
8887 0 means we are reading a constructor expression
8888 such as (struct foo) {...}. */
8891 /* Nonzero if there were any member designators in this initializer. */
8894 /* Nesting depth of designator list. */
8897 /* Nonzero if there were diagnosed errors in this designator list. */
8900 \f
8901 /* This stack has a level for each implicit or explicit level of
8902 structuring in the initializer, including the outermost one. It
8903 saves the values of most of the variables above. */
8907 struct constructor_stack
8908 {
8910 tree type;
8911 tree fields;
8912 tree index;
8913 tree max_index;
8914 tree unfilled_index;
8915 tree unfilled_fields;
8916 tree bit_index;
8921 /* If value nonzero, this value should replace the entire
8922 constructor at this level. */
8934 };
8938 /* This stack represents designators from some range designator up to
8939 the last designator in the list. */
8941 struct constructor_range_stack
8942 {
8945 tree range_start;
8946 tree index;
8947 tree range_end;
8948 tree fields;
8949 };
8953 /* This stack records separate initializers that are nested.
8954 Nested initializers can't happen in ANSI C, but GNU C allows them
8955 in cases like { ... (struct foo) { ... } ... }. */
8957 struct initializer_stack
8958 {
8960 tree decl;
8972 };
8975 \f
8976 /* Prepare to parse and output the initializer for variable DECL. */
8978 void
8982 {
9007 {
9008 require_constant_elements
9010 /* For a scalar, you can always use any value to initialize,
9011 even within braces. */
9014 }
9015 else
9016 {
9019 }
9032 }
9034 void
9036 {
9039 /* Free the whole constructor stack of this initializer. */
9041 {
9045 }
9049 /* Pop back to the data of the outer initializer (if any). */
9065 }
9066 \f
9067 /* Call here when we see the initializer is surrounded by braces.
9068 This is instead of a call to push_init_level;
9069 it is matched by a call to pop_init_level.
9071 TYPE is the type to initialize, for a constructor expression.
9072 For an initializer for a decl, TYPE is zero. */
9074 void
9076 {
9126 {
9128 /* Skip any nameless bit fields at the beginning. */
9135 }
9137 {
9139 {
9140 constructor_max_index
9143 /* Detect non-empty initializations of zero-length arrays. */
9148 /* constructor_max_index needs to be an INTEGER_CST. Attempts
9149 to initialize VLAs with a nonempty initializer will cause a
9150 proper error; avoid tree checking errors as well by setting a
9151 safe value. */
9156 constructor_index
9159 }
9160 else
9161 {
9164 }
9167 }
9169 {
9170 /* Vectors are like simple fixed-size arrays. */
9171 constructor_max_index =
9175 }
9176 else
9177 {
9178 /* Handle the case of int x = {5}; */
9181 }
9182 }
9183 \f
9186 /* Called when we see an open brace for a nested initializer. Finish
9187 off any pending levels with implicit braces. */
9188 void
9190 {
9192 {
9197 last_init_list_comma),
9200 && constructor_max_index
9202 constructor_index))
9205 last_init_list_comma),
9207 else
9209 }
9210 }
9212 /* Push down into a subobject, for initialization.
9213 If this is for an explicit set of braces, IMPLICIT is 0.
9214 If it is because the next element belongs at a lower level,
9215 IMPLICIT is 1 (or 2 if the push is because of designator list). */
9217 void
9220 {
9224 /* Unless this is an explicit brace, we need to preserve previous
9225 content if any. */
9227 {
9232 }
9267 /* If the upper initializer is designated, then mark this as
9268 designated too to prevent bogus warnings. */
9272 {
9277 }
9279 /* Don't die if an entire brace-pair level is superfluous
9280 in the containing level. */
9282 ;
9284 {
9285 /* Don't die if there are extra init elts at the end. */
9288 else
9289 {
9292 constructor_depth++;
9293 }
9294 }
9296 {
9299 constructor_depth++;
9300 }
9303 {
9308 }
9311 {
9320 }
9323 {
9328 }
9331 {
9333 /* Skip any nameless bit fields at the beginning. */
9340 }
9342 {
9343 /* Vectors are like simple fixed-size arrays. */
9344 constructor_max_index =
9348 }
9350 {
9352 {
9353 constructor_max_index
9356 /* Detect non-empty initializations of zero-length arrays. */
9361 /* constructor_max_index needs to be an INTEGER_CST. Attempts
9362 to initialize VLAs will cause a proper error; avoid tree
9363 checking errors as well by setting a safe value. */
9368 constructor_index
9371 }
9372 else
9377 {
9378 /* We need to split the char/wchar array into individual
9379 characters, so that we don't have to special case it
9380 everywhere. */
9382 }
9383 }
9384 else
9385 {
9390 }
9391 }
9393 /* At the end of an implicit or explicit brace level,
9394 finish up that level of constructor. If a single expression
9395 with redundant braces initialized that level, return the
9396 c_expr structure for that expression. Otherwise, the original_code
9397 element is set to ERROR_MARK.
9398 If we were outputting the elements as they are read, return 0 as the value
9399 from inner levels (process_init_element ignores that),
9400 but return error_mark_node as the value from the outermost level
9401 (that's what we want to put in DECL_INITIAL).
9402 Otherwise, return a CONSTRUCTOR expression as the value. */
9404 struct c_expr
9407 location_t insert_before)
9408 {
9417 {
9418 /* When we come to an explicit close brace,
9419 pop any inner levels that didn't have explicit braces. */
9423 insert_before),
9426 }
9427 else
9432 /* Now output all pending elements. */
9438 /* Error for initializing a flexible array member, or a zero-length
9439 array member in an inappropriate context. */
9444 {
9445 /* Silently discard empty initializations. The parser will
9446 already have pedwarned for empty brackets. */
9449 else
9450 {
9455 else
9459 /* We have already issued an error message for the existence
9460 of a flexible array member not at the end of the structure.
9461 Discard the initializer so that we do not die later. */
9464 }
9465 }
9468 {
9470 /* Initialization with { } counts as zeroinit. */
9474 /* This might be zeroinit as well. */
9479 /* If the constructor has more than one element, it can't be { 0 }. */
9482 }
9484 /* Warn when some structs are initialized with direct aggregation. */
9487 {
9490 OPT_Wmissing_braces,
9492 }
9494 /* Warn when some struct elements are implicitly initialized to zero. */
9496 && constructor_type
9499 {
9500 /* Do not warn for flexible array members or zero-length arrays. */
9507 /* Do not warn if this level of the initializer uses member
9508 designators; it is likely to be deliberate. */
9509 && !constructor_designated
9510 /* Do not warn about initializing with { 0 } or with { }. */
9512 {
9515 constructor_unfilled_fields,
9516 constructor_type))
9519 }
9520 }
9522 /* Pad out the end of the structure. */
9524 /* If this closes a superfluous brace pair,
9525 just pass out the element between them. */
9528 ;
9532 {
9533 /* A nonincremental scalar initializer--just return
9534 the element, after verifying there is just one.
9535 Empty scalar initializers are supported in C23. */
9537 {
9541 {
9544 }
9546 /* Ensure this is a null pointer constant in the case of a
9547 'constexpr' object initialized with {}. */
9549 else
9551 }
9553 {
9556 }
9557 else
9559 }
9560 else
9561 {
9564 else
9565 {
9567 constructor_elements);
9574 }
9575 }
9578 {
9583 }
9612 }
9614 /* Common handling for both array range and field name designators.
9615 ARRAY argument is nonzero for array ranges. Returns false for success. */
9617 static bool
9620 {
9621 tree subtype;
9624 /* Don't die if an entire brace-pair level is superfluous
9625 in the containing level, or for an erroneous type. */
9629 /* If there were errors in this designator list already, bail out
9630 silently. */
9634 /* Likewise for an initializer for a variable-size type. Those are
9635 diagnosed in the parser, except for empty initializer braces. */
9641 {
9644 /* Designator list starts at the level of closest explicit
9645 braces. */
9649 last_init_list_comma),
9653 }
9656 {
9668 }
9672 {
9675 }
9677 {
9680 }
9686 }
9688 /* If there are range designators in designator list, push a new designator
9689 to constructor_range_stack. RANGE_END is end of such stack range or
9690 NULL_TREE if there is no range designator at this level. */
9692 static void
9694 {
9710 }
9712 /* Within an array initializer, specify the next index to be initialized.
9713 FIRST is that index. If LAST is nonzero, then initialize a range
9714 of indices, running from FIRST through LAST. */
9716 void
9719 {
9727 {
9730 }
9733 {
9737 "array index in initializer is not "
9739 }
9742 {
9746 "array index in initializer is not "
9748 }
9761 else
9762 {
9768 {
9771 }
9774 {
9778 {
9781 }
9782 else
9783 {
9787 {
9791 }
9792 }
9793 }
9795 designator_depth++;
9799 }
9800 }
9802 /* Within a struct initializer, specify the next field to be initialized. */
9804 void
9807 {
9808 tree field;
9816 {
9819 }
9824 {
9827 {
9833 }
9834 else
9837 }
9838 else
9839 do
9840 {
9842 designator_depth++;
9848 {
9851 }
9852 }
9854 }
9855 \f
9856 /* Add a new initializer to the tree of pending initializers. PURPOSE
9857 identifies the initializer, either array index or field in a structure.
9858 VALUE is the value of that index or field. If ORIGTYPE is not
9859 NULL_TREE, it is the original type of VALUE.
9861 IMPLICIT is true if value comes from pop_init_level (1),
9862 the new initializer has been merged with the existing one
9863 and thus no warnings should be emitted about overriding an
9864 existing initializer. */
9866 static void
9869 {
9876 {
9878 {
9884 else
9885 {
9887 {
9890 "initialized field with side-effects "
9895 }
9899 }
9900 }
9901 }
9902 else
9903 {
9904 tree bitpos;
9908 {
9914 else
9915 {
9917 {
9920 "initialized field with side-effects "
9925 }
9929 }
9930 }
9931 }
9946 {
9950 {
9954 {
9956 {
9957 /* L rotation. */
9970 {
9973 else
9975 }
9976 else
9978 }
9979 else
9980 {
9981 /* LR rotation. */
10003 {
10006 else
10008 }
10009 else
10011 }
10013 }
10014 else
10015 {
10016 /* p->balance == +1; growth of left side balances the node. */
10019 }
10020 }
10022 {
10024 /* Growth propagation from right side. */
10027 {
10029 {
10030 /* R rotation. */
10043 {
10046 else
10048 }
10049 else
10051 }
10053 {
10054 /* RL rotation */
10076 {
10079 else
10081 }
10082 else
10084 }
10086 }
10087 else
10088 {
10089 /* p->balance == -1; growth of right side balances the node. */
10092 }
10093 }
10097 }
10098 }
10100 /* Build AVL tree from a sorted chain. */
10102 static void
10104 {
10114 braced_init_obstack);
10117 {
10119 /* Skip any nameless bit fields at the beginning. */
10124 }
10126 {
10128 constructor_unfilled_index
10131 else
10133 }
10135 }
10137 /* Build AVL tree from a string constant. */
10139 static void
10142 {
10159 p < end
10160 && !(constructor_max_index
10163 {
10165 {
10168 }
10169 else
10170 {
10174 {
10177 else
10182 }
10183 }
10186 {
10189 {
10191 {
10194 }
10195 }
10197 {
10200 }
10204 }
10210 braced_init_obstack);
10211 }
10214 }
10216 /* Return value of FIELD in pending initializer or NULL_TREE if the field was
10217 not initialized yet. */
10219 static tree
10221 {
10225 {
10232 {
10237 else
10239 }
10240 }
10242 {
10246 && (!constructor_unfilled_fields
10253 {
10258 else
10260 }
10261 }
10263 {
10267 }
10269 }
10271 /* "Output" the next constructor element.
10272 At top level, really output it to assembler code now.
10273 Otherwise, collect it in a list from which we will make a CONSTRUCTOR.
10274 If ORIGTYPE is not NULL_TREE, it is the original type of VALUE.
10275 TYPE is the data type that the containing data type wants here.
10276 FIELD is the field (a FIELD_DECL) or the index that this element fills.
10277 If VALUE is a string constant, STRICT_STRING is true if it is
10278 unparenthesized or we should not warn here for it being parenthesized.
10279 For other types of VALUE, STRICT_STRING is not used.
10281 PENDING if true means output pending elements that belong
10282 right after this element. (PENDING is normally true;
10283 it is false while outputting pending elements, to avoid recursion.)
10285 IMPLICIT is true if value comes from pop_init_level (1),
10286 the new initializer has been merged with the existing one
10287 and thus no warnings should be emitted about overriding an
10288 existing initializer. */
10290 static void
10294 {
10300 {
10303 }
10316 {
10317 /* As an extension, allow initializing objects with static storage
10318 duration with compound literals (which are then treated just as
10319 the brace enclosed list they contain). */
10325 }
10331 /* Not fully determined before folding. */
10334 {
10337 }
10339 /* TODO: this may not detect all cases of expressions folding to
10340 constants that are not arithmetic constant expressions. */
10361 && TYPE_REVERSE_STORAGE_ORDER
10370 /* Digest the initializer and issue any errors about incompatible
10371 types before issuing errors about non-constant initializers. */
10375 /* In the case of braces around a scalar initializer, the result of
10376 this initializer processing goes through digest_init again at the
10377 outer level. In the case of a constexpr initializer for a
10378 pointer, avoid converting a null pointer constant to something
10379 that is not a null pointer constant to avoid a spurious error
10380 from that second processing. */
10382 || !npc
10388 {
10391 }
10395 /* Proceed to check the constness of the original initializer. */
10397 {
10399 {
10402 }
10406 }
10411 /* digest_init has already carried out the additional checks
10412 required for 'constexpr' initializers (using the information
10413 passed to it about whether the original initializer was certain
10414 kinds of constant expression), so that check does not need to be
10415 repeated here. */
10417 /* Issue -Wc++-compat warnings about initializing a bitfield with
10418 enum type. */
10426 {
10433 }
10435 /* If this field is empty and does not have side effects (and is not at
10436 the end of structure), don't do anything other than checking the
10437 initializer. */
10447 /* Finally, set VALUE to the initializer value digested above. */
10450 /* If this element doesn't come next in sequence,
10451 put it on constructor_pending_elts. */
10453 && (!constructor_incremental
10455 {
10461 braced_init_obstack);
10463 }
10465 && (!constructor_incremental
10467 {
10468 /* We do this for records but not for unions. In a union,
10469 no matter which field is specified, it can be initialized
10470 right away since it starts at the beginning of the union. */
10472 {
10475 else
10476 {
10484 }
10485 }
10488 braced_init_obstack);
10490 }
10493 {
10495 {
10502 }
10504 /* We can have just one union field set. */
10506 }
10508 /* Otherwise, output this element either to
10509 constructor_elements or to the assembler file. */
10514 /* Advance the variable that indicates sequential elements output. */
10516 constructor_unfilled_index
10518 bitsize_one_node);
10520 {
10521 constructor_unfilled_fields
10524 /* Skip any nameless bit fields. */
10527 constructor_unfilled_fields =
10529 }
10533 /* Now output any pending elements which have become next. */
10536 }
10538 /* For two FIELD_DECLs in the same chain, return -1 if field1
10539 comes before field2, 1 if field1 comes after field2 and
10540 0 if field1 == field2. */
10542 static int
10544 {
10551 {
10552 /* If one of the fields has non-zero bitsize, then that
10553 field must be the last one in a sequence of zero
10554 sized fields, fields after it will have bigger
10555 bit_position. */
10564 /* Otherwise, fallback to DECL_CHAIN walk to find out
10565 which field comes earlier. Walk chains of both
10566 fields, so that if field1 and field2 are close to each
10567 other in either order, it is found soon even for large
10568 sequences of zero sized fields. */
10571 {
10575 {
10578 }
10589 }
10590 }
10593 else
10595 }
10597 /* Output any pending elements which have become next.
10598 As we output elements, constructor_unfilled_{fields,index}
10599 advances, which may cause other elements to become next;
10600 if so, they too are output.
10602 If ALL is 0, we return when there are
10603 no more pending elements to output now.
10605 If ALL is 1, we output space as necessary so that
10606 we can output all the pending elements. */
10607 static void
10609 {
10611 tree next;
10613 retry:
10615 /* Look through the whole pending tree.
10616 If we find an element that should be output now,
10617 output it. Otherwise, set NEXT to the element
10618 that comes first among those still pending. */
10622 {
10624 {
10626 constructor_unfilled_index))
10630 braced_init_obstack);
10633 {
10634 /* Advance to the next smaller node. */
10637 else
10638 {
10639 /* We have reached the smallest node bigger than the
10640 current unfilled index. Fill the space first. */
10643 }
10644 }
10645 else
10646 {
10647 /* Advance to the next bigger node. */
10650 else
10651 {
10652 /* We have reached the biggest node in a subtree. Find
10653 the parent of it, which is the next bigger node. */
10659 {
10662 }
10663 }
10664 }
10665 }
10667 {
10668 /* If the current record is complete we are done. */
10678 braced_init_obstack);
10680 {
10681 /* Advance to the next smaller node. */
10684 else
10685 {
10686 /* We have reached the smallest node bigger than the
10687 current unfilled field. Fill the space first. */
10690 }
10691 }
10692 else
10693 {
10694 /* Advance to the next bigger node. */
10697 else
10698 {
10699 /* We have reached the biggest node in a subtree. Find
10700 the parent of it, which is the next bigger node. */
10707 {
10710 }
10711 }
10712 }
10713 }
10714 }
10716 /* Ordinarily return, but not if we want to output all
10717 and there are elements left. */
10721 /* If it's not incremental, just skip over the gap, so that after
10722 jumping to retry we will output the next successive element. */
10728 /* ELT now points to the node in the pending tree with the next
10729 initializer to output. */
10731 }
10732 \f
10733 /* Expression VALUE coincides with the start of type TYPE in a braced
10734 initializer. Return true if we should treat VALUE as initializing
10735 the first element of TYPE, false if we should treat it as initializing
10736 TYPE as a whole.
10738 If the initializer is clearly invalid, the question becomes:
10739 which choice gives the best error message? */
10741 static bool
10743 {
10753 /* GNU vectors can be initialized elementwise. However, treat any
10754 kind of vector value as initializing the vector type as a whole,
10755 regardless of whether the value is a GNU vector. Such initializers
10756 are valid if and only if they would have been valid in a non-braced
10757 initializer like:
10759 TYPE foo = VALUE;
10761 so recursing into the vector type would be at best confusing or at
10762 worst wrong. For example, when -flax-vector-conversions is in effect,
10763 it's possible to initialize a V8HI from a V4SI, even though the vectors
10764 have different element types and different numbers of elements. */
10772 }
10774 /* Add one non-braced element to the current constructor level.
10775 This adjusts the current position within the constructor's type.
10776 This may also start or terminate implicit levels
10777 to handle a partly-braced initializer.
10779 Once this has found the correct level for the new element,
10780 it calls output_init_element.
10782 IMPLICIT is true if value comes from pop_init_level (1),
10783 the new initializer has been merged with the existing one
10784 and thus no warnings should be emitted about overriding an
10785 existing initializer. */
10787 void
10790 {
10792 int string_flag
10803 /* Handle superfluous braces around string cst as in
10804 char x[] = {"foo"}; */
10806 && !was_designated
10810 {
10812 {
10815 }
10817 {
10820 }
10821 }
10824 {
10827 }
10829 /* Ignore elements of a brace group if it is entirely superfluous
10830 and has already been diagnosed, or if the type is erroneous. */
10834 /* Ignore elements of an initializer for a variable-size type.
10835 Those are diagnosed in the parser (empty initializer braces are OK). */
10845 OPT_Wdesignated_init,
10846 "positional initialization of field "
10849 /* If we've exhausted any levels that didn't have braces,
10850 pop them now. */
10852 {
10857 last_init_list_comma),
10861 && constructor_max_index
10863 constructor_index))
10866 last_init_list_comma),
10868 else
10870 }
10872 /* In the case of [LO ... HI] = VALUE, only evaluate VALUE once. */
10874 {
10875 /* If value is a compound literal and we'll be just using its
10876 content, don't put it into a SAVE_EXPR. */
10879 {
10882 {
10885 }
10890 }
10891 }
10894 {
10896 {
10897 tree fieldtype;
10901 {
10904 }
10911 /* Error for non-static initialization of a flexible array member. */
10913 && !require_constant_value
10916 {
10920 }
10922 /* Error for initialization of a flexible array member with
10923 a string constant if the structure is in an array. E.g.:
10924 struct S { int x; char y[]; };
10925 struct S s[] = { { 1, "foo" } };
10926 is invalid. */
10932 {
10937 {
10940 }
10942 {
10946 }
10947 }
10949 /* Accept a string constant to initialize a subarray. */
10955 /* Otherwise, if we have come to a subaggregate,
10956 and we don't have an element of its type, push into it. */
10959 {
10962 }
10965 {
10970 braced_init_obstack);
10972 }
10973 else
10974 /* Do the bookkeeping for an element that was
10975 directly output as a constructor. */
10976 {
10977 /* For a record, keep track of end position of last field. */
10979 constructor_bit_index
10984 /* If the current field was the first one not yet written out,
10985 it isn't now, so update. */
10987 {
10989 /* Skip any nameless bit fields. */
10991 && (DECL_UNNAMED_BIT_FIELD
10993 constructor_unfilled_fields =
10995 }
10996 }
10999 /* Skip any nameless bit fields at the beginning. */
11003 }
11005 {
11006 tree fieldtype;
11010 {
11014 }
11021 /* Warn that traditional C rejects initialization of unions.
11022 We skip the warning if the value is zero. This is done
11023 under the assumption that the zero initializer in user
11024 code appears conditioned on e.g. __STDC__ to avoid
11025 "missing initializer" warnings and relies on default
11026 initialization to zero in the traditional C case.
11027 We also skip the warning if the initializer is designated,
11028 again on the assumption that this must be conditional on
11029 __STDC__ anyway (and we've already complained about the
11030 member-designator already). */
11037 /* Accept a string constant to initialize a subarray. */
11043 /* Otherwise, if we have come to a subaggregate,
11044 and we don't have an element of its type, push into it. */
11047 {
11050 }
11053 {
11058 braced_init_obstack);
11060 }
11061 else
11062 /* Do the bookkeeping for an element that was
11063 directly output as a constructor. */
11064 {
11067 }
11070 }
11072 {
11076 /* Accept a string constant to initialize a subarray. */
11082 /* Otherwise, if we have come to a subaggregate,
11083 and we don't have an element of its type, push into it. */
11086 {
11089 }
11094 {
11098 }
11100 /* Now output the actual element. */
11102 {
11107 braced_init_obstack);
11109 }
11111 constructor_index
11116 /* If we are doing the bookkeeping for an element that was
11117 directly output as a constructor, we must update
11118 constructor_unfilled_index. */
11120 }
11122 {
11125 /* Do a basic check of initializer size. Note that vectors
11126 always have a fixed size derived from their type. */
11128 {
11132 }
11134 /* Now output the actual element. */
11136 {
11142 braced_init_obstack);
11143 }
11145 constructor_index
11150 /* If we are doing the bookkeeping for an element that was
11151 directly output as a constructor, we must update
11152 constructor_unfilled_index. */
11154 }
11156 /* Handle the sole element allowed in a braced initializer
11157 for a scalar variable. */
11160 {
11164 }
11165 else
11166 {
11171 braced_init_obstack);
11173 }
11175 /* Handle range initializers either at this level or anywhere higher
11176 in the designator stack. */
11178 {
11185 {
11189 braced_init_obstack,
11190 last_init_list_comma),
11192 }
11196 {
11200 braced_init_obstack,
11201 last_init_list_comma),
11203 }
11211 {
11215 {
11218 }
11227 }
11232 }
11235 }
11238 }
11239 \f
11240 /* Build a complete asm-statement, whose components are a CV_QUALIFIER
11241 (guaranteed to be 'volatile' or null) and ARGS (represented using
11242 an ASM_EXPR node). */
11243 tree
11245 {
11249 }
11251 /* Build an asm-expr, whose components are a STRING, some OUTPUTS,
11252 some INPUTS, and some CLOBBERS. The latter three may be NULL.
11253 SIMPLE indicates whether there was anything at all after the
11254 string in the asm expression -- asm("blah") and asm("blah" : )
11255 are subtly different. We use a ASM_EXPR node to represent this.
11256 LOC is the location of the asm, and IS_INLINE says whether this
11257 is asm inline. */
11258 tree
11261 {
11262 tree tail;
11263 tree args;
11276 /* Remove output conversions that change the type but not the mode. */
11278 {
11283 /* ??? Really, this should not be here. Users should be using a
11284 proper lvalue, dammit. But there's a long history of using casts
11285 in the output operands. In cases like longlong.h, this becomes a
11286 primitive form of typechecking -- if the cast can be removed, then
11287 the output operand had a type of the proper width; otherwise we'll
11288 get an error. Gross, but ... */
11306 {
11307 /* If the operand is going to end up in memory,
11308 mark it addressable. */
11314 {
11317 }
11318 }
11319 else
11323 }
11326 {
11327 tree input;
11334 {
11335 /* If the operand is going to end up in memory,
11336 mark it addressable. */
11338 {
11341 /* Strip the nops as we allow this case. FIXME, this really
11342 should be rejected or made deprecated. */
11346 }
11347 else
11348 {
11356 {
11359 }
11360 }
11361 }
11362 else
11366 }
11370 /* asm statements without outputs, including simple ones, are treated
11371 as volatile. */
11377 }
11378 \f
11379 /* Generate a goto statement to LABEL. LOC is the location of the
11380 GOTO. */
11382 tree
11384 {
11389 {
11394 }
11395 }
11397 /* Generate a computed goto statement to EXPR. LOC is the location of
11398 the GOTO. */
11400 tree
11402 {
11404 tree t;
11409 {
11413 }
11419 }
11421 /* Generate a C `return' statement. RETVAL is the expression for what
11422 to return, or a null pointer for `return;' with no value. LOC is
11423 the location of the return statement, or the location of the expression,
11424 if the statement has any. If ORIGTYPE is not NULL_TREE, it
11425 is the original type of RETVAL. */
11427 tree
11429 {
11434 /* Use the expansion point to handle cases such as returning NULL
11435 in a function returning void. */
11443 {
11447 {
11450 }
11456 }
11459 {
11463 {
11467 "%<return%> with no value,"
11471 }
11472 }
11474 {
11478 warned_here = permerror_opt
11481 else
11482 warned_here = pedwarn
11488 }
11489 else
11490 {
11495 tree inner;
11513 /* Strip any conversions, additions, and subtractions, and see if
11514 we are returning the address of a local variable. Warn if so. */
11516 {
11518 {
11519 CASE_CONVERT:
11527 /* If the second operand of the MINUS_EXPR has a pointer
11528 type (or is converted from it), this may be valid, so
11529 don't give a warning. */
11530 {
11543 }
11557 {
11561 else
11562 {
11567 }
11568 }
11573 }
11576 }
11583 }
11589 }
11590 \f
11592 /* The SWITCH_STMT being built. */
11593 tree switch_stmt;
11595 /* The original type of the testing expression, i.e. before the
11596 default conversion is applied. */
11597 tree orig_type;
11599 /* A splay-tree mapping the low element of a case range to the high
11600 element, or NULL_TREE if there is no high element. Used to
11601 determine whether or not a new case label duplicates an old case
11602 label. We need a tree, rather than simply a hash table, because
11603 of the GNU case range extension. */
11604 splay_tree cases;
11606 /* The bindings at the point of the switch. This is used for
11607 warnings crossing decls when branching to a case label. */
11610 /* Whether the switch includes any break statements. */
11613 /* The next node on the stack. */
11616 /* Remember whether the controlling expression had boolean type
11617 before integer promotions for the sake of -Wswitch-bool. */
11619 };
11621 /* A stack of the currently active switch statements. The innermost
11622 switch statement is on the top of the stack. There is no need to
11623 mark the stack for garbage collection because it is only active
11624 during the processing of the body of a function, and we never
11625 collect at that point. */
11629 /* Start a C switch statement, testing expression EXP. Return the new
11630 SWITCH_STMT. SWITCH_LOC is the location of the `switch'.
11631 SWITCH_COND_LOC is the location of the switch's condition.
11632 EXPLICIT_CAST_P is true if the expression EXP has an explicit cast. */
11634 tree
11636 location_t switch_cond_loc,
11638 {
11644 {
11648 {
11650 {
11653 }
11655 }
11656 else
11657 {
11661 /* Warn if the condition has boolean value. */
11667 /* Explicit cast to int suppresses this warning. */
11684 }
11685 }
11687 /* Add this new SWITCH_STMT to the stack. */
11700 }
11702 /* Process a case label at location LOC, with attributes ATTRS. */
11704 tree
11706 {
11710 {
11715 }
11718 {
11723 }
11726 {
11729 else
11732 }
11736 loc))
11745 }
11747 /* Finish the switch statement. TYPE is the original type of the
11748 controlling expression of the switch, or NULL_TREE. */
11750 void
11752 {
11754 location_t switch_location;
11758 /* Emit warnings as needed. */
11768 /* Pop the stack. */
11773 }
11774 \f
11775 /* Emit an if statement. IF_LOCUS is the location of the 'if'. COND,
11776 THEN_BLOCK and ELSE_BLOCK are expressions to be used; ELSE_BLOCK
11777 may be null. */
11779 void
11781 tree else_block)
11782 {
11783 tree stmt;
11788 }
11790 tree
11792 {
11793 /* In switch statements break is sometimes stylistically used after
11794 a return statement. This can lead to spurious warnings about
11795 control reaching the end of a non-void function when it is
11796 inlined. Note that we are calling block_may_fallthru with
11797 language specific tree nodes; this works because
11798 block_may_fallthru returns true when given something it does not
11799 understand. */
11804 {
11821 }
11822 else
11824 {
11837 }
11843 {
11844 /* The foreach expander produces low-level code using gotos instead
11845 of a structured loop construct. */
11848 }
11850 }
11852 /* A helper routine for c_process_expr_stmt and c_finish_stmt_expr. */
11854 static void
11856 {
11861 ;
11863 {
11867 }
11869 {
11873 {
11877 }
11885 }
11886 else
11888 }
11890 /* Process an expression as if it were a complete statement. Emit
11891 diagnostics, but do not call ADD_STMT. LOC is the location of the
11892 statement. */
11894 tree
11896 {
11897 tree exprv;
11912 /* If we're not processing a statement expression, warn about unused values.
11913 Warnings for statement expressions will be emitted later, once we figure
11914 out which is the result. */
11929 /* If the expression is not of a type to which we cannot assign a line
11930 number, wrap the thing in a no-op NOP_EXPR. */
11932 {
11935 }
11938 }
11940 /* Emit an expression as a statement. LOC is the location of the
11941 expression. */
11943 tree
11945 {
11948 else
11950 }
11952 /* Do the opposite and emit a statement as an expression. To begin,
11953 create a new binding level and return it. */
11955 tree
11957 {
11958 tree ret;
11960 /* We must force a BLOCK for this level so that, if it is not expanded
11961 later, there is a way to turn off the entire subtree of blocks that
11962 are contained in it. */
11967 ? NULL
11970 /* Mark the current statement list as belonging to a statement list. */
11974 }
11976 /* LOC is the location of the compound statement to which this body
11977 belongs. */
11979 tree
11981 {
11988 ? NULL
11991 /* Locate the last statement in BODY. See c_end_compound_stmt
11992 about always returning a BIND_EXPR. */
11996 continue_searching:
11998 {
12004 /* This can happen with degenerate cases like ({ }). No value. */
12008 /* If we're supposed to generate side effects warnings, process
12009 all of the statements except the last. */
12011 {
12014 {
12015 location_t tloc;
12020 }
12021 }
12024 }
12026 /* If the end of the list is exception related, then the list was split
12027 by a call to push_cleanup. Continue searching. */
12030 {
12034 }
12039 /* In the case that the BIND_EXPR is not necessary, return the
12040 expression out from inside it. */
12042 /* Skip nested debug stmts. */
12045 {
12046 /* Even if this looks constant, do not allow it in a constant
12047 expression. */
12049 /* Do not warn if the return value of a statement expression is
12050 unused. */
12053 }
12055 /* Extract the type of said expression. */
12058 /* If we're not returning a value at all, then the BIND_EXPR that
12059 we already have is a fine expression to return. */
12063 /* Now that we've located the expression containing the value, it seems
12064 silly to make voidify_wrapper_expr repeat the process. Create a
12065 temporary of the appropriate type and stick it in a TARGET_EXPR. */
12068 /* Unwrap a no-op NOP_EXPR as added by c_finish_expr_stmt. This avoids
12069 tree_expr_nonnegative_p giving up immediately. */
12078 {
12082 }
12083 }
12084 \f
12085 /* Begin and end compound statements. This is as simple as pushing
12086 and popping new statement lists from the tree. */
12088 tree
12090 {
12095 }
12097 /* End a compound statement. STMT is the statement. LOC is the
12098 location of the compound statement-- this is usually the location
12099 of the opening brace. */
12101 tree
12103 {
12107 {
12111 }
12116 /* If this compound statement is nested immediately inside a statement
12117 expression, then force a BIND_EXPR to be created. Otherwise we'll
12118 do the wrong thing for ({ { 1; } }) or ({ 1; { } }). In particular,
12119 STATEMENT_LISTs merge, and thus we can lose track of what statement
12120 was really last. */
12124 {
12128 }
12131 }
12133 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
12134 when the current scope is exited. EH_ONLY is true when this is not
12135 meant to apply to normal control flow transfer. */
12137 void
12139 {
12151 }
12152 \f
12153 /* Build a vector comparison of ARG0 and ARG1 using CODE opcode
12154 into a value of TYPE type. Comparison is done via VEC_COND_EXPR. */
12156 static tree
12159 {
12165 }
12167 /* Possibly warn about an address of OP never being NULL in a comparison
12168 operation CODE involving null. */
12170 static void
12172 {
12173 /* Prevent warnings issued for macro expansion. */
12180 {
12181 /* Allow casts to intptr_t to suppress the warning. */
12186 }
12189 {
12190 /* Allow a cast to void* to suppress the warning. */
12195 /* Adding any value to a null pointer, including zero, is undefined
12196 in C. This includes the expression &p[0] where p is the null
12197 pointer, although &p[0] will have been folded to p by this point
12198 and so not diagnosed. */
12201 "the comparison will always evaluate as %<false%> "
12203 op);
12204 else
12206 "the comparison will always evaluate as %<true%> "
12208 op);
12211 }
12220 {
12221 /* The address of either complex part may not be null. */
12224 "the comparison will always evaluate as %<false%> "
12226 op);
12227 else
12229 "the comparison will always evaluate as %<true%> "
12231 op);
12233 }
12235 /* Set to true in the loop below if OP dereferences is operand.
12236 In such a case the ultimate target need not be a decl for
12237 the null [in]equality test to be constant. */
12240 /* Get the outermost array or object, or member. */
12242 {
12244 {
12245 /* Get the member (its address is never null). */
12248 }
12250 /* Get the outer array/object to refer to in the warning. */
12253 }
12262 "the comparison will always evaluate as %<false%> "
12264 op);
12265 else
12267 "the comparison will always evaluate as %<true%> "
12269 op);
12273 }
12275 /* Build a binary-operation expression without default conversions.
12276 CODE is the kind of expression to build.
12277 LOCATION is the operator's location.
12278 This function differs from `build' in several ways:
12279 the data type of the result is computed and recorded in it,
12280 warnings are generated if arg data types are invalid,
12281 special handling for addition and subtraction of pointers is known,
12282 and some optimization is done (operations on narrow ints
12283 are done in the narrower type when that gives the same result).
12284 Constant folding is also done before the result is returned.
12286 Note that the operands will never have enumeral types, or function
12287 or array types, because either they will have the default conversions
12288 performed or they have both just been converted to some other type in which
12289 the arithmetic is to be done. */
12291 tree
12294 {
12296 tree eptype;
12304 /* Expression code to give to the expression when it is built.
12305 Normally this is CODE, which is what the caller asked for,
12306 but in some special cases we change it. */
12309 /* Data type in which the computation is to be performed.
12310 In the simplest cases this is the common type of the arguments. */
12313 /* When the computation is in excess precision, the type of the
12314 final EXCESS_PRECISION_EXPR. */
12317 /* Nonzero means operands have already been type-converted
12318 in whatever way is necessary.
12319 Zero means they need to be converted to RESULT_TYPE. */
12322 /* Nonzero means create the expression with this type, rather than
12323 RESULT_TYPE. */
12326 /* Nonzero means after finally constructing the expression
12327 convert it to this type. */
12330 /* Nonzero if this is an operation like MIN or MAX which can
12331 safely be computed in short if both args are promoted shorts.
12332 Also implies COMMON.
12333 -1 indicates a bitwise operation; this makes a difference
12334 in the exact conditions for when it is safe to do the operation
12335 in a narrower mode. */
12338 /* Nonzero if this is a comparison operation;
12339 if both args are promoted shorts, compare the original shorts.
12340 Also implies COMMON. */
12343 /* Nonzero if this is a right-shift operation, which can be computed on the
12344 original short and then promoted if the operand is a promoted short. */
12347 /* Nonzero means set RESULT_TYPE to the common type of the args. */
12350 /* True means types are compatible as far as ObjC is concerned. */
12353 /* True means this is an arithmetic operation that may need excess
12354 precision. */
12357 /* True means this is a boolean operation that converts both its
12358 operands to truth-values. */
12361 /* Remember whether we're doing / or %. */
12364 /* Remember whether we're doing << or >>. */
12367 /* Tree holding instrumentation expression. */
12384 {
12387 int_const = (int_const_or_overflow
12390 }
12391 else
12394 /* Do not apply default conversion in mixed vector/scalar expression. */
12397 {
12400 }
12406 /* The expression codes of the data types of the arguments tell us
12407 whether the arguments are integers, floating, pointers, etc. */
12411 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
12415 /* If an error was already reported for one of the arguments,
12416 avoid reporting another error. */
12431 {
12434 }
12437 {
12455 /* Excess precision for implicit conversions of integers to
12456 floating point in C11 and later. */
12457 may_need_excess_precision = (flag_isoc11
12465 }
12467 {
12470 }
12473 {
12476 }
12478 {
12481 }
12484 {
12487 }
12491 /* In case when one of the operands of the binary operation is
12492 a vector and another is a scalar -- convert scalar to vector. */
12495 {
12500 {
12504 {
12506 tree sc;
12517 }
12519 {
12521 tree sc;
12532 }
12535 }
12536 }
12539 {
12541 /* Handle the pointer + int case. */
12544 {
12547 }
12550 {
12553 }
12554 else
12559 /* Subtraction of two similar pointers.
12560 We must subtract them as integers, then divide by object size. */
12563 {
12566 }
12567 /* Handle pointer minus int. Just like pointer plus int. */
12570 {
12573 }
12574 else
12598 {
12610 else
12611 /* Although it would be tempting to shorten always here, that
12612 loses on some targets, since the modulo instruction is
12613 undefined if the quotient can't be represented in the
12614 computation mode. We shorten only if unsigned or if
12615 dividing by something we know != -1. */
12618 }
12627 /* Allow vector types which are not floating point types. */
12647 {
12648 /* Although it would be tempting to shorten always here, that loses
12649 on some targets, since the modulo instruction is undefined if the
12650 quotient can't be represented in the computation mode. We shorten
12651 only if unsigned or if dividing by something we know != -1. */
12654 }
12670 {
12671 /* Result of these operations is always an int,
12672 but that does not mean the operands should be
12673 converted to ints! */
12676 {
12679 }
12680 else
12683 {
12686 }
12687 else
12691 }
12693 {
12694 int_const_or_overflow = (int_operands
12698 int_const = (int_const_or_overflow
12702 }
12704 {
12705 int_const_or_overflow = (int_operands
12709 int_const = (int_const_or_overflow
12713 }
12716 /* Shift operations: result has same type as first operand;
12717 always convert second operand to int.
12718 Also set SHORT_SHIFT if shifting rightward. */
12727 {
12730 }
12736 {
12739 {
12741 {
12746 }
12748 {
12752 {
12757 }
12758 }
12759 else
12760 {
12765 {
12770 }
12771 }
12772 }
12774 /* Use the type of the value to be shifted. */
12776 /* Avoid converting op1 to result_type later. */
12778 }
12788 {
12791 }
12797 {
12802 {
12803 /* Don't reject a left shift of a negative value in a context
12804 where a constant expression is needed in C90. */
12810 }
12812 {
12814 {
12819 }
12821 {
12825 {
12830 }
12831 }
12833 {
12838 }
12843 }
12845 /* Use the type of the value to be shifted. */
12847 /* Avoid converting op1 to result_type later. */
12849 }
12855 {
12856 tree intt;
12858 {
12862 }
12866 {
12870 }
12872 /* It's not precisely specified how the usual arithmetic
12873 conversions apply to the vector types. Here, we use
12874 the unsigned type if one of the operands is signed and
12875 the other one is unsigned. */
12877 {
12880 else
12884 }
12886 /* Always construct signed integer vector type. */
12888 (SCALAR_TYPE_MODE
12891 {
12896 }
12902 }
12905 OPT_Wfloat_equal,
12907 /* Result of comparison is always int,
12908 but don't convert the args to int! */
12919 {
12922 }
12926 {
12929 }
12931 {
12938 /* Anything compares with void *. void * compares with anything.
12939 Otherwise, the targets must be compatible
12940 and both must be object or both incomplete. */
12944 {
12948 }
12950 {
12954 }
12956 {
12960 }
12961 else
12962 /* Avoid warning about the volatile ObjC EH puts on decls. */
12968 {
12970 result_type = build_pointer_type
12972 }
12973 }
12976 {
12979 }
12982 {
12985 }
12986 /* 6.5.9: One of the following shall hold:
12987 -- both operands have type nullptr_t; */
12989 {
12991 /* No need to convert the operands to result_type later. */
12993 }
12994 /* -- one operand has type nullptr_t and the other is a null pointer
12995 constant. We will have to convert the former to the type of the
12996 latter, because during gimplification we can't have mismatching
12997 comparison operand type. We convert from nullptr_t to the other
12998 type, since only nullptr_t can be converted to nullptr_t. Also,
12999 even a constant 0 is a null pointer constant, so we may have to
13000 create a pointer type from its type. */
13019 {
13020 tree intt;
13022 {
13026 }
13030 {
13034 }
13036 /* It's not precisely specified how the usual arithmetic
13037 conversions apply to the vector types. Here, we use
13038 the unsigned type if one of the operands is signed and
13039 the other one is unsigned. */
13041 {
13044 else
13048 }
13050 /* Always construct signed integer vector type. */
13052 (SCALAR_TYPE_MODE
13055 {
13060 }
13066 }
13074 {
13077 addr_space_t as_common;
13080 {
13094 }
13096 {
13100 }
13101 else
13102 {
13104 result_type = build_pointer_type
13108 }
13109 }
13111 {
13119 }
13121 {
13129 }
13132 {
13135 }
13138 {
13141 }
13146 {
13152 }
13163 /* Used for OpenMP atomics. */
13170 }
13179 {
13181 maybe_range_label_for_tree_type_mismatch
13188 }
13196 {
13202 {
13205 "implicit conversion from %qT to %qT "
13206 "to match other operand of binary "
13208 location);
13211 }
13220 {
13221 /* An operation on mixed real/complex operands must be
13222 handled specially, but the language-independent code can
13223 more easily optimize the plain complex arithmetic if
13224 -fno-signed-zeros. */
13228 {
13231 }
13233 {
13238 }
13239 else
13240 {
13245 }
13249 {
13256 {
13261 /* Fall through. */
13268 }
13269 }
13270 else
13271 {
13278 {
13282 /* Fall through. */
13292 }
13293 }
13296 }
13298 /* For certain operations (which identify themselves by shorten != 0)
13299 if both args were extended from the same smaller type,
13300 do the arithmetic in that type and then extend.
13302 shorten !=0 and !=1 indicates a bitwise operation.
13303 For them, this optimization is safe only if
13304 both args are zero-extended or both are sign-extended.
13305 Otherwise, we might change the result.
13306 Eg, (short)-1 | (unsigned short)-1 is (int)-1
13307 but calculated in (unsigned short) it would be (unsigned short)-1. */
13310 {
13314 }
13316 /* Shifts can be shortened if shifting right. */
13319 {
13330 /* We can shorten only if the shift count is less than the
13331 number of bits in the smaller type size. */
13333 /* We cannot drop an unsigned shift after sign-extension. */
13335 {
13336 /* Do an unsigned shift if the operand was zero-extended. */
13337 result_type
13340 /* Convert value-to-be-shifted to that type. */
13344 }
13345 }
13347 /* Comparison operations are shortened too but differently.
13348 They identify themselves by setting short_compare = 1. */
13351 {
13352 /* Don't write &op0, etc., because that would prevent op0
13353 from being kept in a register.
13354 Instead, make copies of the our local variables and
13355 pass the copies by reference, then copy them back afterward. */
13358 tree val
13363 {
13366 }
13373 {
13379 {
13382 }
13383 else
13384 {
13385 /* Fold for the sake of possible warnings, as in
13386 build_conditional_expr. This requires the
13387 "original" values to be folded, not just op0 and
13388 op1. */
13389 c_inhibit_evaluation_warnings++;
13394 c_inhibit_evaluation_warnings--;
13396 require_constant_value,
13397 NULL);
13399 require_constant_value,
13400 NULL);
13401 }
13408 {
13413 }
13414 }
13415 }
13416 }
13418 /* At this point, RESULT_TYPE must be nonzero to avoid an error message.
13419 If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
13420 Then the expression will be built.
13421 It will be given type FINAL_TYPE if that is nonzero;
13422 otherwise, it will be given type RESULT_TYPE. */
13425 {
13426 /* Favor showing any expression locations that are available. */
13431 }
13434 {
13438 {
13441 }
13442 }
13445 {
13447 semantic_result_type);
13449 semantic_result_type);
13451 /* This can happen if one operand has a vector type, and the other
13452 has a different type. */
13455 }
13458 | SANITIZE_DIVIDE
13459 | SANITIZE_FLOAT_DIVIDE
13464 {
13465 /* OP0 and/or OP1 might have side-effects. */
13471 | SANITIZE_FLOAT_DIVIDE
13476 }
13478 /* Treat expressions in initializers specially as they can't trap. */
13480 ret = (require_constant_value
13484 else
13489 return_build_binary_op:
13492 ret = (int_operands
13509 }
13512 /* Convert EXPR to be a truth-value, validating its type for this
13513 purpose. LOCATION is the source location for the expression. */
13515 tree
13517 {
13521 {
13523 error_at (location, "used array that cannot be converted to pointer where scalar is required");
13552 }
13557 {
13562 }
13563 else
13564 /* ??? Should we also give an error for vectors rather than leaving
13565 those to give errors later? */
13569 {
13572 else
13574 }
13578 }
13579 \f
13581 /* Convert EXPR to a contained DECL, updating *TC, *TI and *SE as
13582 required. */
13584 tree
13586 {
13588 {
13590 /* Executing a compound literal inside a function reinitializes
13591 it. */
13595 }
13596 else
13598 }
13599 \f
13600 /* Generate OMP construct CODE, with BODY and CLAUSES as its compound
13601 statement. LOC is the location of the construct. */
13603 tree
13605 tree clauses)
13606 {
13616 }
13618 /* Generate OACC_DATA, with CLAUSES and BLOCK as its compound
13619 statement. LOC is the location of the OACC_DATA. */
13621 tree
13623 {
13624 tree stmt;
13635 }
13637 /* Generate OACC_HOST_DATA, with CLAUSES and BLOCK as its compound
13638 statement. LOC is the location of the OACC_HOST_DATA. */
13640 tree
13642 {
13643 tree stmt;
13654 }
13656 /* Like c_begin_compound_stmt, except force the retention of the BLOCK. */
13658 tree
13660 {
13661 tree block;
13667 }
13669 /* Generate OMP_PARALLEL, with CLAUSES and BLOCK as its compound
13670 statement. LOC is the location of the OMP_PARALLEL. */
13672 tree
13674 {
13675 tree stmt;
13686 }
13688 /* Like c_begin_compound_stmt, except force the retention of the BLOCK. */
13690 tree
13692 {
13693 tree block;
13699 }
13701 /* Generate OMP_TASK, with CLAUSES and BLOCK as its compound
13702 statement. LOC is the location of the #pragma. */
13704 tree
13706 {
13707 tree stmt;
13718 }
13720 /* Generate GOMP_cancel call for #pragma omp cancel. */
13722 void
13724 {
13735 else
13736 {
13738 "%<parallel%>, %<for%>, %<sections%> or %<taskgroup%> "
13741 }
13744 {
13749 else
13750 {
13753 {
13759 }
13760 }
13766 }
13767 else
13771 ifc);
13773 }
13775 /* Generate GOMP_cancellation_point call for
13776 #pragma omp cancellation point. */
13778 void
13780 {
13791 else
13792 {
13794 "%<parallel%>, %<for%>, %<sections%> or %<taskgroup%> "
13797 }
13801 }
13803 /* Helper function for handle_omp_array_sections. Called recursively
13804 to handle multiple array-section-subscripts. C is the clause,
13805 T current expression (initially OMP_CLAUSE_DECL), which is either
13806 a TREE_LIST for array-section-subscript (TREE_PURPOSE is low-bound
13807 expression if specified, TREE_VALUE length expression if specified,
13808 TREE_CHAIN is what it has been specified after, or some decl.
13809 TYPES vector is populated with array section types, MAYBE_ZERO_LEN
13810 set to true if any of the array-section-subscript could have length
13811 of zero (explicit or implicit), FIRST_NON_ONE is the index of the
13812 first array-section-subscript which is known not to have length
13813 of one. Given say:
13814 map(a[:b][2:1][:c][:2][:d][e:f][2:5])
13815 FIRST_NON_ONE will be 3, array-section-subscript [:b], [2:1] and [:c]
13816 all are or may have length of 1, array-section-subscript [:2] is the
13817 first one known not to have length 1. For array-section-subscript
13818 <= FIRST_NON_ONE we diagnose non-contiguous arrays if low bound isn't
13819 0 or length isn't the array domain max + 1, for > FIRST_NON_ONE we
13820 can if MAYBE_ZERO_LEN is false. MAYBE_ZERO_LEN will be true in the above
13821 case though, as some lengths could be zero. */
13823 static tree
13827 {
13831 {
13839 {
13843 }
13851 else
13858 {
13863 else
13868 }
13872 {
13876 }
13881 {
13886 }
13891 {
13892 /* If the array section is pointer based and the pointer
13893 itself is _Atomic qualified, we need to atomically load
13894 the pointer. */
13895 c_expr expr;
13901 }
13903 }
13918 {
13921 low_bound);
13923 }
13925 {
13928 length);
13930 }
13946 {
13948 {
13953 }
13954 }
13956 {
13958 {
13964 {
13966 {
13971 }
13972 }
13973 else
13975 }
13978 first_non_one++;
13979 }
13981 {
13985 {
13987 "for unknown bound array type length expression must "
13990 }
13993 {
13998 }
14002 {
14007 }
14012 {
14013 tree size
14017 {
14019 {
14021 "low bound %qE above array section size "
14025 }
14027 {
14033 {
14038 }
14040 }
14043 && tree_int_cst_equal
14045 low_bound))
14046 first_non_one++;
14047 }
14049 {
14057 first_non_one++;
14058 }
14060 {
14062 {
14064 "length %qE above array section size "
14068 }
14070 {
14071 tree lbpluslen
14077 {
14079 "high bound %qE above array section size "
14083 }
14084 }
14085 }
14086 }
14088 {
14096 first_non_one++;
14097 }
14099 /* For [lb:] we will need to evaluate lb more than once. */
14101 {
14104 {
14107 }
14108 }
14109 }
14111 {
14113 {
14116 "for array function parameter length expression "
14118 else
14122 }
14126 {
14131 }
14132 /* If there is a pointer type anywhere but in the very first
14133 array-section-subscript, the array section could be non-contiguous. */
14137 {
14138 /* If any prior dimension has a non-one length, then deem this
14139 array section as non-contiguous. */
14143 {
14146 {
14151 }
14152 }
14153 }
14154 }
14155 else
14156 {
14160 }
14163 /* We will need to evaluate lb more than once. */
14166 {
14169 }
14172 }
14174 /* Handle array sections for clause C. */
14176 static bool
14178 {
14191 ort);
14198 {
14201 /* Need to evaluate side effects in the length expressions
14202 if any. */
14204 {
14206 {
14209 else
14212 }
14214 }
14219 }
14220 else
14221 {
14231 {
14235 i--;
14249 {
14258 {
14259 tree size;
14262 size_one_node);
14264 {
14265 do_warn_noncontiguous:
14267 "array section is not contiguous in %qs "
14271 }
14272 }
14275 {
14278 else
14282 }
14283 }
14284 else
14285 {
14286 tree l;
14296 else
14297 {
14300 size_one_node);
14303 }
14305 {
14307 size_zero_node);
14310 else
14313 }
14315 {
14323 {
14326 {
14331 }
14334 }
14339 }
14340 else
14342 }
14343 }
14349 {
14372 else
14373 {
14378 }
14381 }
14386 /* Don't set OMP_CLAUSE_SIZE for bare attach/detach clauses. */
14391 {
14395 }
14409 {
14415 /* !!! If we're accessing a base decl via chained access
14416 methods (e.g. multiple indirections), duplicate clause
14417 detection won't work properly. Skip it in that case. */
14426 }
14427 }
14429 }
14431 /* Helper function of finish_omp_clauses. Clone STMT as if we were making
14432 an inline call. But, remap
14433 the OMP_DECL1 VAR_DECL (omp_out resp. omp_orig) to PLACEHOLDER
14434 and OMP_DECL2 VAR_DECL (omp_in resp. omp_priv) to DECL. */
14436 static tree
14439 {
14440 copy_body_data id;
14458 }
14460 /* Helper function of c_finish_omp_clauses, called via walk_tree.
14461 Find OMP_CLAUSE_PLACEHOLDER (passed in DATA) in *TP. */
14463 static tree
14465 {
14469 }
14471 /* Similarly, but also walk aggregate fields. */
14475 static tree
14477 {
14481 {
14482 tree field;
14488 {
14497 pset);
14503 }
14504 }
14509 }
14511 /* Finish OpenMP iterators ITER. Return true if they are errorneous
14512 and clauses containing them should be removed. */
14514 static bool
14516 {
14519 {
14524 tree orig_step;
14528 {
14531 }
14533 {
14535 var);
14538 }
14540 {
14544 }
14546 {
14550 }
14553 {
14556 }
14558 {
14563 }
14570 {
14577 }
14579 {
14583 }
14589 {
14592 }
14594 tree it2;
14596 {
14605 {
14610 }
14612 {
14616 }
14618 {
14622 }
14624 {
14628 }
14629 }
14631 {
14634 }
14639 }
14641 }
14643 /* Ensure that pointers are used in OpenACC attach and detach clauses.
14644 Return true if an error has been detected. */
14646 static bool
14648 {
14652 /* OpenACC attach / detach clauses must be pointers. */
14655 {
14662 {
14666 }
14667 }
14670 }
14672 /* For all elements of CLAUSES, validate them against their constraints.
14673 Remove any elements from the list that are invalid. */
14675 tree
14677 {
14696 /* 1 if normal/task reduction has been seen, -1 if inscan reduction
14697 has been seen, -2 if mixed inscan/normal reduction diagnosed. */
14709 /* If ort == C_ORT_OMP_DECLARE_SIMD used as uniform_head instead. */
14713 /* If ort == C_ORT_OMP used as nontemporal_head or use_device_xxx_head
14714 instead and for ort == C_ORT_OMP_TARGET used as in_reduction_head. */
14721 {
14724 }
14729 {
14734 /* We've reached the end of a list of expanded nodes. Reset the group
14735 start pointer. */
14740 {
14756 {
14758 "%<inscan%> and non-%<inscan%> %<reduction%> clauses "
14761 }
14762 /* FALLTHRU */
14768 {
14770 {
14773 }
14778 {
14780 "%<inscan%> %<reduction%> clause with array "
14784 }
14785 }
14788 {
14791 }
14798 {
14804 {
14807 t);
14810 }
14814 {
14817 t);
14820 }
14825 index_type);
14832 }
14834 {
14839 }
14842 {
14843 /* Disallow zero sized or potentially zero sized task
14844 reductions. */
14846 {
14852 }
14854 {
14860 }
14861 }
14865 {
14870 {
14896 }
14898 {
14904 }
14905 }
14907 {
14912 }
14914 {
14924 {
14930 }
14940 decl_placeholder ? decl_placeholder
14948 {
14960 decl_placeholder ? decl_placeholder
14963 {
14968 }
14970 c_find_omp_placeholder_r,
14973 }
14974 else
14975 {
14976 tree init;
14980 else
14984 }
14990 }
14992 {
14996 {
15001 }
15007 }
15013 {
15015 "%<nowait%> clause must not be used together "
15019 }
15025 {
15030 }
15040 {
15042 "modifier should not be specified in %<linear%> "
15043 "clause on %<simd%> or %<for%> constructs when not "
15046 }
15049 {
15051 "linear clause applied to non-integral non-pointer "
15055 }
15057 {
15062 }
15064 {
15067 {
15069 /* map_head bitmap is used as uniform_head if
15070 declare_simd. */
15074 }
15076 {
15078 "%<linear%> clause step %qE is neither constant "
15082 }
15083 }
15085 {
15091 fold_convert
15096 }
15097 else
15102 check_dup_generic:
15104 check_dup_generic_t:
15106 {
15111 }
15119 {
15123 {
15125 "%qD appears more than once in data-sharing "
15129 }
15133 {
15135 openacc
15138 t);
15140 }
15141 else
15143 }
15148 {
15152 }
15157 {
15161 else
15165 }
15166 else
15172 {
15173 move_implicit:
15175 /* Move firstprivate and map clauses with
15176 OMP_CLAUSE_{FIRSTPRIVATE,MAP}_IMPLICIT set to the end of
15177 clauses chain. */
15183 {
15187 }
15190 {
15194 }
15195 else
15201 }
15206 {
15210 }
15218 {
15222 }
15225 {
15232 else
15236 }
15237 else
15246 {
15250 }
15253 {
15257 }
15258 else
15265 {
15269 }
15272 {
15274 "%qE in %<aligned%> clause is neither a pointer nor "
15277 }
15279 {
15284 }
15286 {
15289 t);
15291 }
15292 else
15299 {
15303 }
15305 {
15307 "%qE appears more than once in %<nontemporal%> "
15310 }
15311 else
15318 {
15322 }
15324 {
15327 t);
15329 }
15330 else
15331 {
15335 }
15343 {
15346 {
15349 {
15357 sizetype,
15361 {
15364 }
15366 }
15367 }
15369 }
15377 {
15379 last_iterators_remove
15385 }
15386 else
15389 {
15394 {
15396 "%<depend%> clause with %<depobj%> dependence "
15399 }
15401 }
15406 {
15409 {
15411 "%<omp_all_memory%> used with %<depend%> kind "
15414 }
15415 }
15417 {
15419 "%qE is not lvalue expression nor array section in "
15423 }
15426 {
15433 }
15436 {
15438 {
15440 "%qE does not have %<omp_depend_t%> type in "
15441 "%<depend%> clause with %<depobj%> dependence "
15444 }
15445 }
15448 {
15450 "%qE should not have %<omp_depend_t%> type in "
15451 "%<depend%> clause with dependence type other than "
15454 }
15456 {
15459 else
15460 {
15464 {
15467 }
15469 RO_UNARY_STAR);
15471 {
15474 }
15475 }
15481 else
15483 }
15489 /* FALLTHRU */
15493 {
15499 {
15505 else
15506 {
15509 {
15511 "array section does not have mappable type "
15515 }
15517 {
15522 }
15529 {
15535 }
15537 /* This check is to determine if this will be the only map
15538 node created for this clause. Otherwise, we'll check
15539 the following FIRSTPRIVATE_POINTER or ATTACH_DETACH
15540 node on the next iteration(s) of the loop. */
15550 {
15561 {
15564 }
15568 {
15571 "%qD appears more than once in motion "
15575 "%qD appears more than once in data "
15577 else
15579 "%qD appears more than once in map "
15582 }
15583 else
15584 {
15587 }
15588 }
15589 }
15596 /* In this case, we have a single array element which is a
15597 pointer, and we already set OMP_CLAUSE_SIZE in
15598 handle_omp_array_sections above. For attach/detach
15599 clauses, reset the OMP_CLAUSE_SIZE (representing a bias)
15600 to zero here. */
15603 }
15605 {
15611 }
15613 {
15616 }
15617 /* OpenACC attach / detach clauses must be pointers. */
15619 {
15622 }
15627 /* For attach/detach clauses, set OMP_CLAUSE_SIZE (representing a
15628 bias) to zero here, so it is not set erroneously to the pointer
15629 size later on in gimplify.cc. */
15635 {
15638 }
15641 {
15647 }
15658 /* For OpenMP, we can access a struct "t" and "t.d" on the same
15659 mapping. OpenACC allows multiple fields of the same structure
15660 to be written. */
15667 {
15675 }
15677 {
15682 }
15696 {
15701 }
15705 {
15710 }
15721 {
15725 {
15729 }
15733 {
15737 }
15738 else
15740 }
15745 {
15752 else
15756 }
15758 {
15762 }
15765 {
15769 else
15773 }
15775 {
15780 }
15782 skip_decl_checks:
15783 /* If we call omp_expand_map_clause in handle_omp_array_sections,
15784 the containing loop (here) iterates through the new nodes
15785 created by that expansion. Avoid expanding those again (just
15786 by checking the node type). */
15797 {
15804 }
15805 }
15818 ;
15820 {
15823 "%qE is neither a variable nor a function name in "
15825 else
15829 }
15831 {
15834 cname);
15836 }
15838 {
15841 cname);
15843 }
15847 {
15849 "%qE appears more than once on the same "
15852 }
15853 else
15860 {
15864 else
15869 }
15870 /* map_head bitmap is used as uniform_head if declare_simd. */
15880 {
15883 {
15888 }
15890 {
15895 }
15896 }
15902 {
15905 else
15906 {
15910 }
15911 }
15925 {
15927 "%<nowait%> clause must not be used together "
15931 }
15938 {
15940 "%<order%> clause must not be used together "
15944 }
15946 {
15947 /* Silently remove duplicates. */
15950 }
15958 {
15964 }
16033 {
16035 "%<order%> clause must not be used together "
16039 }
16055 {
16057 "%<inbranch%> clause is incompatible with "
16061 }
16072 {
16077 }
16082 }
16085 {
16089 {
16093 }
16096 {
16102 {
16109 /* The __func__ variable and similar function-local
16110 predefined variables may be listed in a shared or
16111 firstprivate clause. */
16120 }
16122 {
16128 }
16132 {
16134 "%<const%> qualified %qE may appear only in "
16137 }
16138 }
16139 }
16142 {
16144 {
16145 /* If we found a clause to remove, we want to remove the whole
16146 expanded group, otherwise gimplify
16147 (omp_resolve_clause_dependencies) can get confused. */
16151 }
16152 else
16154 }
16155 else
16157 }
16160 && safelen
16163 {
16165 "%<simdlen%> clause value is bigger than "
16169 }
16172 && schedule_clause
16175 {
16177 "%<nonmonotonic%> schedule modifier specified together "
16183 }
16186 {
16188 "%qs clause specified together with %<inscan%> "
16191 }
16194 {
16196 "%qs clause specified together with %<inscan%> "
16199 }
16203 || allocate_seen
16206 {
16210 {
16215 {
16225 }
16226 /* FALLTHRU */
16237 }
16242 {
16244 "%<linear%> clause step is a parameter %qD not "
16248 }
16254 {
16265 }
16269 else
16271 }
16275 {
16280 {
16282 "%qD specified in %<allocate%> clause but not in "
16285 }
16288 else
16290 }
16293 {
16295 "%<nogroup%> clause must not be used together with "
16298 }
16301 {
16303 {
16305 "%<detach%> clause must not be used together with "
16308 }
16309 else
16310 {
16314 {
16321 {
16323 "the event handle of a %<detach%> clause "
16326 }
16329 else
16331 }
16332 }
16333 }
16337 }
16339 /* Return code to initialize DST with a copy constructor from SRC.
16340 C doesn't have copy constructors nor assignment operators, only for
16341 _Atomic vars we need to perform __atomic_load from src into a temporary
16342 followed by __atomic_store of the temporary to dst. */
16344 tree
16346 {
16361 /* Expansion of a generic atomic load may require an addition
16362 element, so allocate enough to prevent a resize. */
16365 /* Build __atomic_load (&src, &tmp, SEQ_CST); */
16374 /* Build __atomic_store (&dst, &tmp, SEQ_CST); */
16381 }
16383 /* Create a transaction node. */
16385 tree
16387 {
16394 }
16396 /* Make a variant type in the proper way for C/C++, propagating qualifiers
16397 down to the element type of an array. If ORIG_QUAL_TYPE is not
16398 NULL, then it should be used as the qualified type
16399 ORIG_QUAL_INDIRECT levels down in array type derivation (to
16400 preserve information about the typedef name from which an array
16401 type was derived). */
16403 tree
16406 {
16411 {
16412 tree t;
16417 /* See if we already have an identically qualified type. */
16420 else
16422 {
16429 }
16431 {
16443 {
16444 tree unqualified_canon
16449 {
16450 unqualified_canon
16453 }
16456 }
16457 else
16459 }
16461 }
16463 /* A restrict-qualified pointer type must be a pointer to object or
16464 incomplete type. Note that the use of POINTER_TYPE_P also allows
16465 REFERENCE_TYPEs, which is appropriate for C++. */
16469 {
16472 }
16475 ? orig_qual_type
16477 /* A variant type does not inherit the list of incomplete vars from the
16478 type main variant. */
16484 }
16486 /* Build a VA_ARG_EXPR for the C parser. */
16488 tree
16490 {
16493 /* VA_ARG_EXPR cannot be used for a scalar va_list with reverse storage
16494 order because it takes the address of the expression. */
16497 {
16500 }
16502 {
16506 }
16508 {
16510 type);
16512 }
16517 }
16519 /* Return truthvalue of whether T1 is the same tree structure as T2.
16520 Return 1 if they are the same. Return false if they are different. */
16522 bool
16524 {
16539 /* They might have become equal now. */
16550 {
16574 /* We need to do this when determining whether or not two
16575 non-type pointer to member function template arguments
16576 are the same. */
16580 {
16584 {
16589 }
16590 }
16604 {
16619 }
16622 {
16626 /* Special case: if either target is an unallocated VAR_DECL,
16627 it means that it's going to be unified with whatever the
16628 TARGET_EXPR is really supposed to initialize, so treat it
16629 as being equivalent to anything. */
16640 }
16657 {
16666 }
16668 CASE_CONVERT:
16675 }
16678 {
16686 {
16690 {
16702 }
16713 }
16719 }
16720 }
16722 /* Returns true when the function declaration FNDECL is implicit,
16723 introduced as a result of a call to an otherwise undeclared
16724 function, and false otherwise. */
16726 bool
16728 {
16730 }