| blob | 7cf411155c60d45bf7d17238055625bfe8b7a039 |
1 /* Build expressions with type checking for C compiler.
2 Copyright (C) 1987-2023 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 /* The argument of last parsed sizeof expression, only to be tested
80 if expr.original_code == SIZEOF_EXPR. */
81 tree c_last_sizeof_arg;
82 location_t c_last_sizeof_loc;
84 /* Nonzero if we might need to print a "missing braces around
85 initializer" message within this initializer. */
102 tree);
129 \f
130 /* Return true if EXP is a null pointer constant, false otherwise. */
132 bool
134 {
135 /* This should really operate on c_expr structures, but they aren't
136 yet available everywhere required. */
139 /* An integer constant expression with the value 0, such an expression
140 cast to type void*, or the predefined constant nullptr, are a null
141 pointer constant. */
152 }
154 /* EXPR may appear in an unevaluated part of an integer constant
155 expression, but not in an evaluated part. Wrap it in a
156 C_MAYBE_CONST_EXPR, or mark it with TREE_OVERFLOW if it is just an
157 INTEGER_CST and we cannot create a C_MAYBE_CONST_EXPR. */
159 static tree
161 {
162 tree ret;
164 {
167 }
168 else
169 {
172 }
174 }
176 /* Having checked whether EXPR may appear in an unevaluated part of an
177 integer constant expression and found that it may, remove any
178 C_MAYBE_CONST_EXPR noting this fact and return the resulting
179 expression. */
183 {
186 else
188 }
194 const_tree t1;
195 const_tree t2;
196 /* The return value of tagged_types_tu_compatible_p if we had seen
197 these two types already. */
199 };
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. */
387 tree
389 {
392 tree attributes;
394 /* Save time if the two types are the same. */
398 /* If one type is nonsense, use the other. */
407 /* Merge the attributes. */
410 /* If one is an enumerated type and the other is the compatible
411 integer type, the composite type might be either of the two
412 (DR#013 question 3). For consistency, use the enumerated type as
413 the composite type. */
425 {
427 /* For two pointers, do this recursively on the target type. */
428 {
435 }
438 {
441 tree unqual_elt;
448 /* We should not have any type quals on arrays at all. */
458 d1_variable = (!d1_zero
461 d2_variable = (!d2_zero
467 /* Save space: see if the result is identical to one of the args. */
480 /* Merge the element types, and have a size if either arg has
481 one. We may have qualifiers on the element types. To set
482 up TYPE_MAIN_VARIANT correctly, we need to form the
483 composite of the unqualified types and add the qualifiers
484 back at the end. */
489 && (d2_variable
490 || d2_zero
492 ? t1
494 /* Ensure a composite type involving a zero-length array type
495 is a zero-length type not an incomplete type. */
499 {
502 }
505 }
511 {
512 /* Try harder not to create a new aggregate type. */
517 }
521 /* Function types: prefer the one that specified arg types.
522 If both do, merge the arg types. Also merge the return types. */
523 {
531 /* Save space: see if the result is identical to one of the args. */
537 /* Simple way if one arg fails to specify argument types. */
539 {
544 }
546 {
551 }
553 /* If both args specify argument types, we must merge the two
554 lists, argument by argument. */
559 ;
568 {
569 /* A null type means arg type is not specified.
570 Take whatever the other function type has. */
572 {
575 }
577 {
580 }
582 /* Given wait (union {union wait *u; int *i} *)
583 and wait (union wait *),
584 prefer union wait * as type of parm. */
587 {
588 tree memb;
595 {
601 {
607 }
608 }
609 }
612 {
613 tree memb;
620 {
626 {
632 }
633 }
634 }
636 parm_done: ;
637 }
641 }
642 /* FALLTHRU */
646 }
648 }
650 /* Return the type of a conditional expression between pointers to
651 possibly differently qualified versions of compatible types.
653 We assume that comp_target_types has already been done and returned
654 nonzero; if that isn't so, this may crash. */
656 static tree
658 {
659 tree attributes;
662 tree target;
667 /* Save time if the two types are the same. */
671 /* If one type is nonsense, use the other. */
680 /* Merge the attributes. */
683 /* Find the composite type of the target types, and combine the
684 qualifiers of the two types' targets. Do not lose qualifiers on
685 array element types by taking the TYPE_MAIN_VARIANT. */
694 /* Strip array types to get correct qualifier for pointers to arrays */
698 /* For function types do not merge const qualifiers, but drop them
699 if used inconsistently. The middle-end uses these to mark const
700 and noreturn functions. */
703 else
706 /* If the two named address spaces are different, determine the common
707 superset address space. This is guaranteed to exist due to the
708 assumption that comp_target_type returned non-zero. */
718 }
720 /* Return the common type for two arithmetic types under the usual
721 arithmetic conversions. The default conversions have already been
722 applied, and enumerated types converted to their compatible integer
723 types. The resulting type is unqualified and has no attributes.
725 This is the type for the result of most arithmetic operations
726 if the operands have the given two types. */
728 static tree
730 {
734 /* If one type is nonsense, use the other. */
747 {
750 }
753 {
756 }
758 /* Save time if the two types are the same. */
772 /* When one operand is a decimal float type, the other operand cannot be
773 a generic float type or a complex type. We also disallow vector types
774 here. */
777 {
779 {
782 }
784 {
787 }
789 {
793 }
794 }
796 /* If one type is a vector type, return that type. (How the usual
797 arithmetic conversions apply to the vector types extension is not
798 precisely specified.) */
805 /* If one type is complex, form the common type of the non-complex
806 components, then make that complex. Use T1 or T2 if it is the
807 required type. */
809 {
818 else
820 }
822 /* If only one is real, use it as the result. */
830 /* If both are real and either are decimal floating point types, use
831 the decimal floating point type with the greater precision. */
834 {
844 }
846 /* Deal with fixed-point types. */
848 {
856 /* If one input type is saturating, the result type is saturating. */
860 /* If both fixed-point types are unsigned, the result type is unsigned.
861 When mixing fixed-point and integer types, follow the sign of the
862 fixed-point type.
863 Otherwise, the result type is signed. */
872 /* The result type is signed. */
874 {
875 /* If the input type is unsigned, we need to convert to the
876 signed type. */
878 {
884 else
888 }
890 {
896 else
900 }
901 }
904 {
907 }
908 else
909 {
911 /* Signed integers need to subtract one sign bit. */
913 }
916 {
919 }
920 else
921 {
923 /* Signed integers need to subtract one sign bit. */
925 }
930 satp);
931 }
933 /* Both real or both integers; use the one with greater precision. */
940 /* Same precision. Prefer long longs to longs to ints when the
941 same precision, following the C99 rules on integer type rank
942 (which are equivalent to the C90 rules for C90 types). */
950 {
953 else
955 }
963 {
964 /* But preserve unsignedness from the other type,
965 since long cannot hold all the values of an unsigned int. */
968 else
970 }
972 /* For floating types of the same TYPE_PRECISION (which we here
973 assume means either the same set of values, or sets of values
974 neither a subset of the other, with behavior being undefined in
975 the latter case), follow the rules from TS 18661-3: prefer
976 interchange types _FloatN, then standard types long double,
977 double, float, then extended types _FloatNx. For extended types,
978 check them starting with _Float128x as that seems most consistent
979 in spirit with preferring long double to double; for interchange
980 types, also check in that order for consistency although it's not
981 possible for more than one of them to have the same
982 precision. */
990 /* Likewise, prefer long double to double even if same size. */
994 /* Likewise, prefer double to float even if same size.
995 We got a couple of embedded targets with 32 bit doubles, and the
996 pdp11 might have 64 bit floats. */
1007 /* Otherwise prefer the unsigned one. */
1011 else
1013 }
1014 \f
1015 /* Wrapper around c_common_type that is used by c-common.cc and other
1016 front end optimizations that remove promotions. ENUMERAL_TYPEs
1017 are allowed here and are converted to their compatible integer types.
1018 BOOLEAN_TYPEs are allowed here and return either boolean_type_node or
1019 preferably a non-Boolean type as the common type. */
1020 tree
1022 {
1028 /* If both types are BOOLEAN_TYPE, then return boolean_type_node. */
1033 /* If either type is BOOLEAN_TYPE, then return the other. */
1040 }
1042 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
1043 or various other operations. Return 2 if they are compatible
1044 but a warning may be needed if you use them together. */
1046 int
1048 {
1056 }
1058 /* Like comptypes, but if it returns non-zero because enum and int are
1059 compatible, it sets *ENUM_AND_INT_P to true. */
1061 int
1063 {
1071 }
1073 /* Like comptypes, but if it returns nonzero for different types, it
1074 sets *DIFFERENT_TYPES_P to true. */
1076 int
1079 {
1087 }
1088 \f
1089 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
1090 or various other operations. Return 2 if they are compatible
1091 but a warning may be needed if you use them together. If
1092 ENUM_AND_INT_P is not NULL, and one type is an enum and the other a
1093 compatible integer type, then this sets *ENUM_AND_INT_P to true;
1094 *ENUM_AND_INT_P is never set to false. If DIFFERENT_TYPES_P is not
1095 NULL, and the types are compatible but different enough not to be
1096 permitted in C11 typedef redeclarations, then this sets
1097 *DIFFERENT_TYPES_P to true; *DIFFERENT_TYPES_P is never set to
1098 false, but may or may not be set if the types are incompatible.
1099 This differs from comptypes, in that we don't free the seen
1100 types. */
1102 static int
1105 {
1110 /* Suppress errors caused by previously reported errors. */
1116 /* Enumerated types are compatible with integer types, but this is
1117 not transitive: two enumerated types in the same translation unit
1118 are compatible with each other only if they are the same type. */
1123 {
1126 {
1131 }
1132 }
1136 {
1139 {
1144 }
1145 }
1150 /* Different classes of types can't be compatible. */
1155 /* Qualifiers must match. C99 6.7.3p9 */
1160 /* Allow for two different type nodes which have essentially the same
1161 definition. Note that we already checked for equality of the type
1162 qualifiers (just above). */
1168 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1172 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1176 {
1180 /* With these nodes, we can't determine type equivalence by
1181 looking at what is stored in the nodes themselves, because
1182 two nodes might have different TYPE_MAIN_VARIANTs but still
1183 represent the same type. For example, wchar_t and int could
1184 have the same properties (TYPE_PRECISION, TYPE_MIN_VALUE,
1185 TYPE_MAX_VALUE, etc.), but have different TYPE_MAIN_VARIANTs
1186 and are distinct types. On the other hand, int and the
1187 following typedef
1189 typedef int INT __attribute((may_alias));
1191 have identical properties, different TYPE_MAIN_VARIANTs, but
1192 represent the same type. The canonical type system keeps
1193 track of equivalence in this case, so we fall back on it. */
1197 /* Do not remove mode information. */
1207 different_types_p);
1211 {
1218 /* Target types must match incl. qualifiers. */
1221 enum_and_int_p,
1228 /* Sizes must match unless one is missing or variable. */
1235 d1_variable = (!d1_zero
1238 d2_variable = (!d2_zero
1257 }
1263 {
1272 different_types_p);
1276 }
1287 }
1289 }
1291 /* Return 1 if TTL and TTR are pointers to types that are equivalent, ignoring
1292 their qualifiers, except for named address spaces. If the pointers point to
1293 different named addresses, then we must determine if one address space is a
1294 subset of the other. */
1296 static int
1298 {
1305 addr_space_t as_common;
1308 /* Fail if pointers point to incompatible address spaces. */
1312 /* For pedantic record result of comptypes on arrays before losing
1313 qualifiers on the element type below. */
1320 /* Qualifiers on element types of array types that are
1321 pointer targets are lost by taking their TYPE_MAIN_VARIANT. */
1335 pedwarn_c11 (location, OPT_Wpedantic, "invalid use of pointers to arrays with different qualifiers "
1346 }
1347 \f
1348 /* Subroutines of `comptypes'. */
1352 /* Allocate the seen two types, assuming that they are compatible. */
1356 {
1364 /* The C standard says that two structures in different translation
1365 units are compatible with each other only if the types of their
1366 fields are compatible (among other things). We assume that they
1367 are compatible until proven otherwise when building the cache.
1368 An example where this can occur is:
1369 struct a
1370 {
1371 struct a *next;
1372 };
1373 If we are comparing this against a similar struct in another TU,
1374 and did not assume they were compatible, we end up with an infinite
1375 loop. */
1378 }
1380 /* Free the seen types until we get to TU_TIL. */
1382 static void
1384 {
1387 {
1392 }
1394 }
1396 /* Return 1 if two 'struct', 'union', or 'enum' types T1 and T2 are
1397 compatible. If the two types are not the same (which has been
1398 checked earlier), this can only happen when multiple translation
1399 units are being compiled. See C99 6.2.7 paragraph 1 for the exact
1400 rules. ENUM_AND_INT_P and DIFFERENT_TYPES_P are as in
1401 comptypes_internal. */
1403 static int
1406 {
1410 /* We have to verify that the tags of the types are the same. This
1411 is harder than it looks because this may be a typedef, so we have
1412 to go look at the original type. It may even be a typedef of a
1413 typedef...
1414 In the case of compiler-created builtin structs the TYPE_DECL
1415 may be a dummy, with no DECL_ORIGINAL_TYPE. Don't fault. */
1426 /* C90 didn't have the requirement that the two tags be the same. */
1430 /* C90 didn't say what happened if one or both of the types were
1431 incomplete; we choose to follow C99 rules here, which is that they
1432 are compatible. */
1437 {
1442 }
1445 {
1447 {
1449 /* Speed up the case where the type values are in the same order. */
1454 {
1456 }
1459 {
1463 {
1466 }
1467 }
1470 {
1472 }
1474 {
1477 }
1480 {
1483 }
1486 {
1490 {
1493 }
1494 }
1496 }
1499 {
1503 {
1506 }
1508 /* Speed up the common case where the fields are in the same order. */
1511 {
1522 {
1525 }
1532 {
1535 }
1536 }
1538 {
1541 }
1544 {
1549 {
1553 enum_and_int_p,
1554 different_types_p);
1559 {
1562 }
1573 }
1575 {
1578 }
1579 }
1582 }
1585 {
1589 {
1592 }
1597 {
1613 }
1616 else
1619 }
1623 }
1624 }
1626 /* Return 1 if two function types F1 and F2 are compatible.
1627 If either type specifies no argument types,
1628 the other must specify a fixed number of self-promoting arg types.
1629 Otherwise, if one type specifies only the number of arguments,
1630 the other must specify that number of self-promoting arg types.
1631 Otherwise, the argument types must match.
1632 ENUM_AND_INT_P and DIFFERENT_TYPES_P are as in comptypes_internal. */
1634 static int
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. */
1668 /* An unspecified parmlist matches any specified parmlist
1669 whose argument types don't need default promotions. */
1672 {
1677 /* If one of these types comes from a non-prototype fn definition,
1678 compare that with the other type's arglist.
1679 If they don't match, ask for a warning (but no error). */
1685 }
1687 {
1697 }
1699 /* Both types have argument lists: compare them and propagate results. */
1701 different_types_p);
1703 }
1705 /* Check two lists of types for compatibility, returning 0 for
1706 incompatible, 1 for compatible, or 2 for compatible with
1707 warning. ENUM_AND_INT_P and DIFFERENT_TYPES_P are as in
1708 comptypes_internal. */
1710 static int
1713 {
1714 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1719 {
1723 /* If one list is shorter than the other,
1724 they fail to match. */
1732 TYPE_QUAL_ATOMIC)
1737 TYPE_QUAL_ATOMIC)
1739 /* A null pointer instead of a type
1740 means there is supposed to be an argument
1741 but nothing is specified about what type it has.
1742 So match anything that self-promotes. */
1747 {
1750 }
1752 {
1755 }
1756 /* If one of the lists has an error marker, ignore this arg. */
1759 ;
1761 different_types_p)))
1762 {
1765 /* Allow wait (union {union wait *u; int *i} *)
1766 and wait (union wait *) to be compatible. */
1773 {
1774 tree memb;
1777 {
1783 TYPE_QUAL_ATOMIC)
1786 different_types_p))
1788 }
1791 }
1798 {
1799 tree memb;
1802 {
1808 TYPE_QUAL_ATOMIC)
1811 different_types_p))
1813 }
1816 }
1817 else
1819 }
1821 /* comptypes said ok, but record if it said to warn. */
1827 }
1828 }
1829 \f
1830 /* Compute the size to increment a pointer by. When a function type or void
1831 type or incomplete type is passed, size_one_node is returned.
1832 This function does not emit any diagnostics; the caller is responsible
1833 for that. */
1835 static tree
1837 {
1844 /* Convert in case a char is more than one unit. */
1848 }
1849 \f
1850 /* Return either DECL or its known constant value (if it has one). */
1852 tree
1854 {
1861 /* This is invalid if initial value is not constant.
1862 If it has either a function call, a memory reference,
1863 or a variable, then re-evaluating it could give different results. */
1865 /* Check for cases where this is sub-optimal, even though valid. */
1869 }
1871 /* Return either DECL or its known constant value (if it has one).
1872 Like the above, but always return decl outside of functions. */
1874 tree
1876 {
1877 /* Don't change a variable array bound or initial value to a constant
1878 in a place where a variable is invalid. */
1880 }
1882 /* Convert the array expression EXP to a pointer. */
1883 static tree
1885 {
1888 tree adr;
1890 tree ptrtype;
1903 /* In C++ array compound literals are temporary objects unless they are
1904 const or appear in namespace scope, so they are destroyed too soon
1905 to use them for much of anything (c++/53220). */
1907 {
1911 "converting an array compound literal to a pointer "
1913 }
1917 }
1919 /* Convert the function expression EXP to a pointer. */
1920 static tree
1922 {
1932 }
1934 /* Mark EXP as read, not just set, for set but not used -Wunused
1935 warning purposes. */
1937 void
1939 {
1941 {
1951 CASE_CONVERT:
1957 /* Pattern match what build_atomic_assign produces with modifycode
1958 NOP_EXPR. */
1962 {
1968 {
1976 {
1989 }
1991 {
1997 }
1998 }
1999 }
2000 /* FALLTHRU */
2006 }
2007 }
2009 /* Perform the default conversion of arrays and functions to pointers.
2010 Return the result of converting EXP. For any other expression, just
2011 return EXP.
2013 LOC is the location of the expression. */
2015 struct c_expr
2017 {
2023 {
2025 {
2032 {
2036 }
2042 {
2043 /* Before C99, non-lvalue arrays do not decay to pointers.
2044 Normally, using such an array would be invalid; but it can
2045 be used correctly inside sizeof or as a statement expression.
2046 Thus, do not give an error here; an error will result later. */
2048 }
2051 }
2058 }
2061 }
2063 struct c_expr
2065 {
2068 }
2070 /* Return whether EXPR should be treated as an atomic lvalue for the
2071 purposes of load and store handling. */
2073 static bool
2075 {
2083 /* Ignore _Atomic on register variables, since their addresses can't
2084 be taken so (a) atomicity is irrelevant and (b) the normal atomic
2085 sequences wouldn't work. Ignore _Atomic on structures containing
2086 bit-fields, since accessing elements of atomic structures or
2087 unions is undefined behavior (C11 6.5.2.3#5), but it's unclear if
2088 it's undefined at translation time or execution time, and the
2089 normal atomic sequences again wouldn't work. */
2091 {
2096 }
2100 }
2102 /* If EXPR is a named constant (C2x) derived from a constexpr variable
2103 - that is, a reference to such a variable, or a member extracted by
2104 a sequence of structure and union (but not array) member accesses
2105 (where union member accesses must access the same member as
2106 initialized) - then return the corresponding initializer;
2107 otherwise, return NULL_TREE. */
2109 static tree
2111 {
2139 {
2143 }
2147 /* Return a default initializer. */
2151 }
2153 /* Convert expression EXP (location LOC) from lvalue to rvalue,
2154 including converting functions and arrays to pointers if CONVERT_P.
2155 If READ_P, also mark the expression as having been read. If
2156 FOR_INIT, constexpr expressions of structure and union type should
2157 be replaced by the corresponding CONSTRUCTOR; otherwise, only
2158 constexpr scalars (including elements of structures and unions) are
2159 replaced by their initializers. */
2161 struct c_expr
2164 {
2173 {
2176 {
2177 /* A named constant of pointer type or type nullptr_t is not
2178 a null pointer constant even if the initializer is
2179 one. */
2185 }
2186 }
2188 {
2197 /* Expansion of a generic atomic load may require an addition
2198 element, so allocate enough to prevent a resize. */
2201 /* Remove the qualifiers for the rest of the expressions and
2202 create the VAL temp variable to hold the RHS. */
2207 /* Do not disable warnings for TMP even though it's artificial.
2208 -Winvalid-memory-model depends on it. */
2210 /* Issue __atomic_load (&expr, &tmp, SEQ_CST); */
2217 /* EXPR is always read. */
2220 /* Return tmp which contains the value loaded. */
2223 }
2226 exp.value = convert (build_qualified_type (TREE_TYPE (exp.value), TYPE_UNQUALIFIED), exp.value);
2230 }
2232 /* EXP is an expression of integer type. Apply the integer promotions
2233 to it and return the promoted value. */
2235 tree
2237 {
2243 /* Convert enums to the result of applying the integer promotions to
2244 their underlying type. */
2246 {
2249 {
2253 else
2255 }
2258 }
2260 /* ??? This should no longer be needed now bit-fields have their
2261 proper types. */
2264 /* If it's thinner than an int, promote it like a
2265 c_promoting_integer_type_p, otherwise leave it alone. */
2271 {
2272 /* Preserve unsignedness if not really getting any wider. */
2278 }
2281 }
2284 /* Perform default promotions for C data used in expressions.
2285 Enumeral types or short or char are converted to int.
2286 In addition, manifest constants symbols are replaced by their values. */
2288 tree
2290 {
2291 tree orig_exp;
2294 tree promoted_type;
2298 /* Functions and arrays have been converted during parsing. */
2303 /* Constants can be used directly unless they're not loadable. */
2307 /* Strip no-op conversions. */
2314 {
2318 }
2332 }
2333 \f
2334 /* Look up COMPONENT in a structure or union TYPE.
2336 If the component name is not found, returns NULL_TREE. Otherwise,
2337 the return value is a TREE_LIST, with each TREE_VALUE a FIELD_DECL
2338 stepping down the chain to the component, which is in the last
2339 TREE_VALUE of the list. Normally the list is of length one, but if
2340 the component is embedded within (nested) anonymous structures or
2341 unions, the list steps down the chain to the component. */
2343 static tree
2345 {
2346 tree field;
2348 /* If TYPE_LANG_SPECIFIC is set, then it is a sorted array of pointers
2349 to the field elements. Use a binary search on this array to quickly
2350 find the element. Otherwise, do a linear search. TYPE_LANG_SPECIFIC
2351 will always be set for structures which have many elements.
2353 Duplicate field checking replaces duplicates with NULL_TREE so
2354 TYPE_LANG_SPECIFIC arrays are potentially no longer sorted. In that
2355 case just iterate using DECL_CHAIN. */
2359 {
2367 {
2372 {
2373 /* Step through all anon unions in linear fashion. */
2375 {
2378 {
2384 /* The Plan 9 compiler permits referring
2385 directly to an anonymous struct/union field
2386 using a typedef name. */
2394 }
2395 }
2397 /* Entire record is only anon unions. */
2401 /* Restart the binary search, with new lower bound. */
2403 }
2409 else
2411 }
2417 }
2418 else
2419 {
2421 {
2424 {
2430 /* The Plan 9 compiler permits referring directly to an
2431 anonymous struct/union field using a typedef
2432 name. */
2439 }
2443 }
2447 }
2450 }
2452 /* Recursively append candidate IDENTIFIER_NODEs to CANDIDATES. */
2454 static void
2457 {
2458 tree field;
2460 {
2464 candidates);
2468 }
2469 }
2471 /* Like "lookup_field", but find the closest matching IDENTIFIER_NODE,
2472 rather than returning a TREE_LIST for an exact match. */
2474 static tree
2476 {
2479 /* First, gather a list of candidates. */
2486 }
2488 /* Support function for build_component_ref's error-handling.
2490 Given DATUM_TYPE, and "DATUM.COMPONENT", where DATUM is *not* a
2491 struct or union, should we suggest "DATUM->COMPONENT" as a hint? */
2493 static bool
2495 {
2496 /* We don't do it for Objective-C, since Objective-C 2.0 dot-syntax
2497 allows "." for ptrs; we could be handling a failed attempt
2498 to access a property. */
2502 /* Only suggest it for pointers... */
2506 /* ...to structs/unions. */
2511 else
2513 }
2515 /* Make an expression to refer to the COMPONENT field of structure or
2516 union value DATUM. COMPONENT is an IDENTIFIER_NODE. LOC is the
2517 location of the COMPONENT_REF. COMPONENT_LOC is the location
2518 of COMPONENT. ARROW_LOC is the location of the first -> operand if
2519 it is from -> operator. */
2521 tree
2524 {
2528 tree ref;
2534 /* Detect Objective-C property syntax object.property. */
2539 /* See if there is a field or component with name COMPONENT. */
2542 {
2544 {
2547 }
2552 {
2555 {
2556 /* Attempt to provide a fixit replacement hint, if
2557 we have a valid range for the component. */
2558 location_t reported_loc
2566 }
2567 else
2570 }
2572 /* Accessing elements of atomic structures or unions is undefined
2573 behavior (C11 6.5.2.3#5). */
2575 {
2579 else
2582 }
2584 /* Chain the COMPONENT_REFs if necessary down to the FIELD.
2585 This might be better solved in future the way the C++ front
2586 end does it - by giving the anonymous entities each a
2587 separate name and type, and then have build_component_ref
2588 recursively call itself. We can't do that here. */
2589 do
2590 {
2593 tree subtype;
2599 /* If this is an rvalue, it does not have qualifiers in C
2600 standard terms and we must avoid propagating such
2601 qualifiers down to a non-lvalue array that is then
2602 converted to a pointer. */
2603 use_datum_quals = (datum_lvalue
2612 NULL_TREE);
2629 }
2633 }
2635 {
2636 /* Special-case the error message for "ptr.field" for the case
2637 where the user has confused "." vs "->". */
2640 {
2644 "%qE is a pointer to pointer; did you mean to dereference "
2647 }
2648 else
2649 {
2650 /* "loc" should be the "." token. */
2654 datum);
2655 }
2657 }
2661 component);
2664 }
2665 \f
2666 /* Given an expression PTR for a pointer, return an expression
2667 for the value pointed to.
2668 ERRORSTRING is the name of the operator to appear in error messages.
2670 LOC is the location to use for the generated tree. */
2672 tree
2674 {
2677 tree ref;
2680 {
2683 {
2684 /* If a warning is issued, mark it to avoid duplicates from
2685 the backend. This only needs to be done at
2686 warn_strict_aliasing > 2. */
2691 }
2696 {
2700 }
2701 else
2702 {
2710 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
2711 so that we get the proper error message if the result is used
2712 to assign to. Also, &* is supposed to be a no-op.
2713 And ANSI C seems to specify that the type of the result
2714 should be the const type. */
2715 /* A de-reference of a pointer to const is not a const. It is valid
2716 to change it via some other pointer. */
2723 }
2724 }
2729 }
2731 /* This handles expressions of the form "a[i]", which denotes
2732 an array reference.
2734 This is logically equivalent in C to *(a+i), but we may do it differently.
2735 If A is a variable or a member, we generate a primitive ARRAY_REF.
2736 This avoids forcing the array out of registers, and can work on
2737 arrays that are not lvalues (for example, members of structures returned
2738 by functions).
2740 For vector types, allow vector[i] but not i[vector], and create
2741 *(((type*)&vectortype) + i) for the expression.
2743 LOC is the location to use for the returned expression. */
2745 tree
2747 {
2748 tree ret;
2756 /* Allow vector[index] but not index[vector]. */
2758 {
2761 {
2766 }
2769 }
2772 {
2775 }
2778 {
2781 }
2783 /* ??? Existing practice has been to warn only when the char
2784 index is syntactically the index, not for char[array]. */
2788 /* Apply default promotions *after* noticing character types. */
2799 {
2802 /* An array that is indexed by a non-constant
2803 cannot be stored in a register; we must be able to do
2804 address arithmetic on its address.
2805 Likewise an array of elements of variable size. */
2809 {
2812 }
2813 /* An array that is indexed by a constant value which is not within
2814 the array bounds cannot be stored in a register either; because we
2815 would get a crash in store_bit_field/extract_bit_field when trying
2816 to access a non-existent part of the register. */
2820 {
2823 }
2827 {
2836 "ISO C90 forbids subscripting non-lvalue "
2838 }
2842 /* Array ref is const/volatile if the array elements are
2843 or if the array is. */
2852 /* This was added by rms on 16 Nov 91.
2853 It fixes vol struct foo *a; a->elts[1]
2854 in an inline function.
2855 Hope it doesn't break something else. */
2862 }
2863 else
2864 {
2875 RO_ARRAY_INDEXING);
2879 }
2880 }
2881 \f
2882 /* Build an external reference to identifier ID. FUN indicates
2883 whether this will be used for a function call. LOC is the source
2884 location of the identifier. This sets *TYPE to the type of the
2885 identifier, which is not the same as the type of the returned value
2886 for CONST_DECLs defined as enum constants. If the type of the
2887 identifier is not available, *TYPE is set to NULL. */
2888 tree
2890 {
2891 tree ref;
2894 /* In Objective-C, an instance variable (ivar) may be preferred to
2895 whatever lookup_name() found. */
2900 {
2905 decl);
2906 }
2908 /* Implicit function declaration. */
2911 /* Don't complain about something that's already been
2912 complained about. */
2914 else
2915 {
2918 }
2928 /* Recursive call does not count as usage. */
2930 {
2932 }
2935 {
2942 }
2945 {
2951 {
2956 }
2960 }
2965 {
2970 }
2971 /* C99 6.7.4p3: An inline definition of a function with external
2972 linkage ... shall not contain a reference to an identifier with
2973 internal linkage. */
2982 csi_internal);
2985 }
2987 /* Record details of decls possibly used inside sizeof or typeof. */
2988 struct maybe_used_decl
2989 {
2990 /* The decl. */
2991 tree decl;
2992 /* The level seen at (in_sizeof + in_typeof). */
2994 /* The next one at this level or above, or NULL. */
2996 };
3000 /* Record that DECL, an undefined static function reference seen
3001 inside sizeof or typeof, might be used if the operand of sizeof is
3002 a VLA type or the operand of typeof is a variably modified
3003 type. */
3005 static void
3007 {
3013 }
3015 /* Pop the stack of decls possibly used inside sizeof or typeof. If
3016 USED is false, just discard them. If it is true, mark them used
3017 (if no longer inside sizeof or typeof) or move them to the next
3018 level up (if still inside sizeof or typeof). */
3020 void
3022 {
3026 {
3028 {
3031 else
3033 }
3035 }
3038 }
3040 /* Return the result of sizeof applied to EXPR. */
3042 struct c_expr
3044 {
3047 {
3053 }
3054 else
3055 {
3060 {
3061 auto_diagnostic_group d;
3063 "%<sizeof%> on array function parameter %qE will "
3067 }
3077 {
3078 /* sizeof is evaluated when given a vla (C99 6.5.3.4p2). */
3083 }
3085 }
3087 }
3089 /* Return the result of sizeof applied to T, a structure for the type
3090 name passed to sizeof (rather than the type itself). LOC is the
3091 location of the original expression. */
3093 struct c_expr
3095 {
3096 tree type;
3108 {
3111 }
3112 else
3115 {
3116 /* If the type is a [*] array, it is a VLA but is represented as
3117 having a size of zero. In such a case we must ensure that
3118 the result of sizeof does not get folded to a constant by
3119 c_fully_fold, because if the size is evaluated the result is
3120 not constant and so constraints on zero or negative size
3121 arrays must not be applied when this sizeof call is inside
3122 another array declarator. */
3128 }
3132 }
3134 /* Build a function call to function FUNCTION with parameters PARAMS.
3135 The function call is at LOC.
3136 PARAMS is a list--a chain of TREE_LIST nodes--in which the
3137 TREE_VALUE of each node is a parameter-expression.
3138 FUNCTION's data type may be a function type or a pointer-to-function. */
3140 tree
3142 {
3144 tree ret;
3152 }
3154 /* Give a note about the location of the declaration of DECL. */
3156 static void
3158 {
3162 }
3164 /* Build a function call to function FUNCTION with parameters PARAMS.
3165 If FUNCTION is the result of resolving an overloaded target built-in,
3166 ORIG_FUNDECL is the original function decl, otherwise it is null.
3167 ORIGTYPES, if not NULL, is a vector of types; each element is
3168 either NULL or the original type of the corresponding element in
3169 PARAMS. The original type may differ from TREE_TYPE of the
3170 parameter for enums. FUNCTION's data type may be a function type
3171 or pointer-to-function. This function changes the elements of
3172 PARAMS. */
3174 tree
3178 {
3181 tree tem;
3186 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
3189 /* Convert anything with function type to a pointer-to-function. */
3191 {
3199 /* Atomic functions have type checking/casting already done. They are
3200 often rewritten and don't match the original parameter list. */
3203 }
3207 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
3208 expressions, like those used for ObjC messenger dispatches. */
3221 {
3225 function);
3227 {
3230 function);
3232 }
3233 else
3237 }
3242 /* fntype now gets the type of function pointed to. */
3246 /* Convert the parameters to the types declared in the
3247 function prototype, or apply default promotions. */
3254 /* Check that the function is called through a compatible prototype.
3255 If it is not, warn. */
3260 {
3261 /* This situation leads to run-time undefined behavior. We can't,
3262 therefore, simply error unless we can prove that all possible
3263 executions of the program must execute the code. */
3270 }
3274 /* Check that arguments to builtin functions match the expectations. */
3281 /* Check that the arguments to the function are valid. */
3290 {
3292 result
3295 else
3301 }
3302 else
3305 /* If -Wnonnull warning has been diagnosed, avoid diagnosing it again
3306 later. */
3310 /* In this improbable scenario, a nested function returns a VM type.
3311 Create a TARGET_EXPR so that the call always has a LHS, much as
3312 what the C++ FE does for functions returning non-PODs. */
3314 {
3318 }
3321 {
3326 }
3328 }
3330 /* Like build_function_call_vec, but call also resolve_overloaded_builtin. */
3332 tree
3336 {
3337 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
3340 /* Convert anything with function type to a pointer-to-function. */
3342 {
3343 /* Implement type-directed function overloading for builtins.
3344 resolve_overloaded_builtin and targetm.resolve_overloaded_builtin
3345 handle all the type checking. The result is a complete expression
3346 that implements this function call. */
3350 }
3352 }
3353 \f
3354 /* Helper for convert_arguments called to convert the VALue of argument
3355 number ARGNUM from ORIGTYPE to the corresponding parameter number
3356 PARMNUM and TYPE.
3357 PLOC is the location where the conversion is being performed.
3358 FUNCTION and FUNDECL are the same as in convert_arguments.
3359 VALTYPE is the original type of VAL before the conversion and,
3360 for EXCESS_PRECISION_EXPR, the operand of the expression.
3361 NPC is true if VAL represents the null pointer constant (VAL itself
3362 will have been folded to an integer constant).
3363 RNAME is the same as FUNCTION except in Objective C when it's
3364 the function selector.
3365 EXCESS_PRECISION is true when VAL was originally represented
3366 as EXCESS_PRECISION_EXPR.
3367 WARNOPT is the same as in convert_for_assignment. */
3369 static tree
3374 {
3375 /* Formal parm type is specified by a function prototype. */
3378 {
3382 }
3384 /* Optionally warn about conversions that differ from the default
3385 conversions. */
3387 {
3391 "passing argument %d of %qE as integer rather "
3397 "passing argument %d of %qE as integer rather "
3403 "passing argument %d of %qE as complex rather "
3409 "passing argument %d of %qE as floating rather "
3415 "passing argument %d of %qE as complex rather "
3421 "passing argument %d of %qE as floating rather "
3424 /* ??? At some point, messages should be written about
3425 conversions between complex types, but that's too messy
3426 to do now. */
3429 {
3432 /* Warn if any argument is passed as `float',
3433 since without a prototype it would be `double'. */
3437 "passing argument %d of %qE as %<float%> "
3441 /* Warn if mismatch between argument and prototype
3442 for decimal float types. Warn of conversions with
3443 binary float types and of precision narrowing due to
3444 prototype. */
3452 && (formal_prec
3455 && (valtype
3456 != dfloat64_type_node
3457 && (valtype
3460 && (valtype
3463 "passing argument %d of %qE as %qT "
3467 }
3468 /* Detect integer changing in width or signedness.
3469 These warnings are only activated with
3470 -Wtraditional-conversion, not with -Wtraditional. */
3474 {
3484 /* No warning if function asks for enum
3485 and the actual arg is that enum type. */
3486 ;
3489 "passing argument %d of %qE "
3493 ;
3494 /* Don't complain if the formal parameter type
3495 is an enum, because we can't tell now whether
3496 the value was an enum--even the same enum. */
3498 ;
3501 /* Change in signedness doesn't matter
3502 if a constant value is unaffected. */
3503 ;
3504 /* If the value is extended from a narrower
3505 unsigned type, it doesn't matter whether we
3506 pass it as signed or unsigned; the value
3507 certainly is the same either way. */
3510 ;
3513 "passing argument %d of %qE "
3516 else
3518 "passing argument %d of %qE "
3521 }
3522 }
3524 /* Possibly restore an EXCESS_PRECISION_EXPR for the
3525 sake of better warnings from convert_and_check. */
3540 }
3542 /* Convert the argument expressions in the vector VALUES
3543 to the types in the list TYPELIST.
3545 If TYPELIST is exhausted, or when an element has NULL as its type,
3546 perform the default conversions.
3548 ORIGTYPES is the original types of the expressions in VALUES. This
3549 holds the type of enum values which have been converted to integral
3550 types. It may be NULL.
3552 FUNCTION is a tree for the called function. It is used only for
3553 error messages, where it is formatted with %qE.
3555 This is also where warnings about wrong number of args are generated.
3557 ARG_LOC are locations of function arguments (if any).
3559 Returns the actual number of arguments processed (which may be less
3560 than the length of VALUES in some error situations), or -1 on
3561 failure. */
3563 static int
3567 {
3574 tree selector;
3576 /* Change pointer to function to the function itself for
3577 diagnostics. */
3582 /* Handle an ObjC selector specially for diagnostics. */
3585 /* For a call to a built-in function declared without a prototype,
3586 set to the built-in function's argument list. */
3589 /* For type-generic built-in functions, determine whether excess
3590 precision should be removed (classification) or not
3591 (comparison). */
3594 {
3597 {
3598 /* For a call to a built-in function declared without a prototype
3599 use the types of the parameters of the internal built-in to
3600 match those of the arguments to. */
3603 }
3605 /* For type-generic built-in functions, determine whether excess
3606 precision should be removed (classification) or not
3607 (comparison). */
3610 {
3624 /* The last argument of these type-generic builtins
3625 should not be promoted. */
3631 }
3632 }
3634 /* Scan the given expressions (VALUES) and types (TYPELIST), producing
3635 individual converted arguments. */
3643 {
3644 /* The type of the function parameter (if it was declared with one). */
3646 /* The type of the built-in function parameter (if the function
3647 is a built-in). Used to detect type incompatibilities in
3648 calls to built-ins declared without a prototype. */
3649 tree builtin_type = (builtin_typetail
3651 /* The original type of the argument being passed to the function. */
3653 /* The called function (or function selector in Objective C). */
3657 /* Set for EXCESS_PRECISION_EXPR arguments. */
3659 /* The value of the argument after conversion to the type
3660 of the function parameter it is passed to. */
3661 tree parmval;
3662 /* Some __atomic_* builtins have additional hidden argument at
3663 position 0. */
3664 location_t ploc
3670 {
3673 else
3677 }
3680 {
3682 "too many arguments to built-in function %qE "
3686 }
3689 {
3692 }
3694 /* Determine if VAL is a null pointer constant before folding it. */
3697 /* If there is excess precision and a prototype, convert once to
3698 the required type rather than converting via the semantic
3699 type. Likewise without a prototype a float value represented
3700 as long double should be converted once to double. But for
3701 type-generic classification functions excess precision must
3702 be removed here. */
3705 {
3708 }
3714 /* Some floating-point arguments must be promoted to double when
3715 no type is specified by a prototype. This applies to
3716 arguments of type float, and to architecture-specific types
3717 (ARM __fp16), but not to _FloatN or _FloatNx types. */
3726 {
3727 /* Promote this argument, unless it has a _FloatN or
3728 _FloatNx type. */
3732 {
3735 }
3736 /* Don't promote __bf16 either. */
3739 }
3742 {
3747 }
3749 {
3752 else
3753 {
3754 /* Convert `float' to `double'. */
3757 "implicit conversion from %qT to %qT when passing "
3761 }
3762 }
3765 /* A "double" argument with excess precision being passed
3766 without a prototype or in variable arguments.
3767 The last argument of __builtin_*_overflow_p should not be
3768 promoted. */
3772 {
3775 }
3777 {
3779 }
3780 else
3781 /* Convert `short' and `char' to full-size `int'. */
3789 {
3790 /* For a call to a built-in function declared without a prototype,
3791 perform the conversions from the argument to the expected type
3792 but issue warnings rather than errors for any mismatches.
3793 Ignore the converted argument and use the PARMVAL obtained
3794 above by applying default conversions instead. */
3798 excess_precision,
3799 OPT_Wbuiltin_declaration_mismatch);
3800 }
3807 }
3812 {
3816 }
3819 {
3825 "too few arguments to built-in function %qE "
3828 }
3831 }
3832 \f
3833 /* This is the entry point used by the parser to build unary operators
3834 in the input. CODE, a tree_code, specifies the unary operator, and
3835 ARG is the operand. For unary plus, the C parser currently uses
3836 CONVERT_EXPR for code.
3838 LOC is the location to use for the tree generated.
3839 */
3841 struct c_expr
3843 {
3851 {
3853 }
3854 else
3855 {
3860 }
3862 /* We are typically called when parsing a prefix token at LOC acting on
3863 ARG. Reflect this by updating the source range of the result to
3864 start at LOC and end at the end of ARG. */
3869 }
3871 /* Returns true if TYPE is a character type, *not* including wchar_t. */
3873 bool
3875 {
3881 }
3883 /* This is the entry point used by the parser to build binary operators
3884 in the input. CODE, a tree_code, specifies the binary operator, and
3885 ARG1 and ARG2 are the operands. In addition to constructing the
3886 expression, we check for operands that were written with other binary
3887 operators in a way that is likely to confuse the user.
3889 LOCATION is the location of the binary operator. */
3891 struct c_expr
3894 {
3914 {
3919 }
3928 /* Check for cases such as x+y<<z which users are likely
3929 to misinterpret. */
3939 {
3943 {
3947 else
3949 }
3951 {
3955 else
3957 }
3960 }
3966 /* Avoid warning for !!x == y. */
3969 {
3970 /* Avoid warning for !b == y where b has _Bool type. */
3975 {
3977 do
3978 {
3985 else
3987 }
3989 }
3992 }
3994 /* Warn about comparisons against string literals, with the exception
3995 of testing for equality or inequality of a string literal with NULL. */
3997 {
4004 /* Warn for ptr == '\0', it's likely that it should've been ptr[0]. */
4008 {
4009 auto_diagnostic_group d;
4011 "comparison between pointer and zero character "
4015 }
4019 {
4020 auto_diagnostic_group d;
4022 "comparison between pointer and zero character "
4026 }
4027 }
4031 "comparison with string literal results in unspecified "
4045 /* Warn about comparisons of different enum types. */
4060 location,
4064 }
4065 \f
4066 /* Return a tree for the difference of pointers OP0 and OP1.
4067 The resulting tree has type ptrdiff_t. If POINTER_SUBTRACT sanitization is
4068 enabled, assign to INSTRUMENT_EXPR call to libsanitizer. */
4070 static tree
4072 {
4082 /* If the operands point into different address spaces, we need to
4083 explicitly convert them to pointers into the common address space
4084 before we can subtract the numerical address values. */
4086 {
4087 addr_space_t as_common;
4088 tree common_type;
4090 /* Determine the common superset address space. This is guaranteed
4091 to exist because the caller verified that comp_target_types
4092 returned non-zero. */
4099 }
4101 /* Determine integer type result of the subtraction. This will usually
4102 be the same as the result type (ptrdiff_t), but may need to be a wider
4103 type if pointers for the address space are wider than ptrdiff_t. */
4106 else
4118 {
4124 }
4126 /* First do the subtraction, then build the divide operator
4127 and only convert at the very end.
4128 Do not do default conversions in case restype is a short type. */
4130 /* POINTER_DIFF_EXPR requires a signed integer type of the same size as
4131 pointers. If some platform cannot provide that, or has a larger
4132 ptrdiff_type to support differences larger than half the address
4133 space, cast the pointers to some larger integer type and do the
4134 computations in that type. */
4138 else
4139 {
4140 /* Cast away qualifiers. */
4144 }
4146 /* This generates an error if op1 is pointer to incomplete type. */
4159 /* Divide by the size, in easiest possible way. */
4163 /* Convert to final result type if necessary. */
4165 }
4166 \f
4167 /* Expand atomic compound assignments into an appropriate sequence as
4168 specified by the C11 standard section 6.5.16.2.
4170 _Atomic T1 E1
4171 T2 E2
4172 E1 op= E2
4174 This sequence is used for all types for which these operations are
4175 supported.
4177 In addition, built-in versions of the 'fe' prefixed routines may
4178 need to be invoked for floating point (real, complex or vector) when
4179 floating-point exceptions are supported. See 6.5.16.2 footnote 113.
4181 T1 newval;
4182 T1 old;
4183 T1 *addr
4184 T2 val
4185 fenv_t fenv
4187 addr = &E1;
4188 val = (E2);
4189 __atomic_load (addr, &old, SEQ_CST);
4190 feholdexcept (&fenv);
4191 loop:
4192 newval = old op val;
4193 if (__atomic_compare_exchange_strong (addr, &old, &newval, SEQ_CST,
4194 SEQ_CST))
4195 goto done;
4196 feclearexcept (FE_ALL_EXCEPT);
4197 goto loop:
4198 done:
4199 feupdateenv (&fenv);
4201 The compiler will issue the __atomic_fetch_* built-in when possible,
4202 otherwise it will generate the generic form of the atomic operations.
4203 This requires temp(s) and has their address taken. The atomic processing
4204 is smart enough to figure out when the size of an object can utilize
4205 a lock-free version, and convert the built-in call to the appropriate
4206 lock-free routine. The optimizers will then dispose of any temps that
4207 are no longer required, and lock-free implementations are utilized as
4208 long as there is target support for the required size.
4210 If the operator is NOP_EXPR, then this is a simple assignment, and
4211 an __atomic_store is issued to perform the assignment rather than
4212 the above loop. */
4214 /* Build an atomic assignment at LOC, expanding into the proper
4215 sequence to store LHS MODIFYCODE= RHS. Return a value representing
4216 the result of the operation, unless RETURN_OLD_P, in which case
4217 return the old value of LHS (this is only for postincrement and
4218 postdecrement). */
4220 static tree
4223 {
4236 tree nonatomic_rhs_semantic_type;
4237 tree rhs_type;
4244 /* Allocate enough vector items for a compare_exchange. */
4247 /* Create a compound statement to hold the sequence of statements
4248 with a loop. */
4250 {
4253 /* For consistency with build_modify_expr on non-_Atomic,
4254 mark the lhs as read. Also, it would be very hard to match
4255 such expressions in mark_exp_read. */
4257 }
4259 /* Remove any excess precision (which is only present here in the
4260 case of compound assignments). */
4262 {
4265 }
4268 /* Fold the RHS if it hasn't already been folded. */
4272 /* Remove the qualifiers for the rest of the expressions and create
4273 the VAL temp variable to hold the RHS. */
4277 TYPE_UNQUALIFIED);
4282 NULL_TREE);
4288 /* NOP_EXPR indicates it's a straight store of the RHS. Simply issue
4289 an atomic_store. */
4291 {
4293 /* Build __atomic_store (&lhs, &val, SEQ_CST) */
4304 /* VAL is the value which was stored, return a COMPOUND_STMT of
4305 the statement and that value. */
4307 }
4309 /* Attempt to implement the atomic operation as an __atomic_fetch_* or
4310 __atomic_*_fetch built-in rather than a CAS loop. atomic_bool type
4311 isn't applicable for such builtins. ??? Do we want to handle enums? */
4314 {
4315 built_in_function fncode;
4317 {
4320 fncode = (return_old_p
4321 ? BUILT_IN_ATOMIC_FETCH_ADD_N
4325 fncode = (return_old_p
4326 ? BUILT_IN_ATOMIC_FETCH_SUB_N
4330 fncode = (return_old_p
4331 ? BUILT_IN_ATOMIC_FETCH_AND_N
4335 fncode = (return_old_p
4336 ? BUILT_IN_ATOMIC_FETCH_OR_N
4340 fncode = (return_old_p
4341 ? BUILT_IN_ATOMIC_FETCH_XOR_N
4346 }
4348 /* We can only use "_1" through "_16" variants of the atomic fetch
4349 built-ins. */
4354 /* If this is a pointer type, we need to multiply by the size of
4355 the pointer target type. */
4357 {
4359 /* ??? This would introduce -Wdiscarded-qualifiers
4360 warning: __atomic_fetch_* expect volatile void *
4361 type as the first argument. (Assignments between
4362 atomic and non-atomic objects are OK.) */
4369 }
4371 /* Build __atomic_fetch_* (&lhs, &val, SEQ_CST), or
4372 __atomic_*_fetch (&lhs, &val, SEQ_CST). */
4387 /* Finish the compound statement. */
4390 /* NEWVAL is the value which was stored, return a COMPOUND_STMT of
4391 the statement and that value. */
4393 }
4395 cas_loop:
4396 /* Create the variables and labels required for the op= form. */
4413 /* __atomic_load (addr, &old, SEQ_CST). */
4420 NULL_TREE);
4424 /* Create the expressions for floating-point environment
4425 manipulation, if required. */
4435 /* loop: */
4438 /* newval = old + val; */
4443 {
4447 }
4448 else
4454 {
4456 NULL_TREE);
4459 }
4461 /* if (__atomic_compare_exchange (addr, &old, &new, false, SEQ_CST, SEQ_CST))
4462 goto done; */
4482 /* goto loop; */
4487 /* done: */
4493 /* Finish the compound statement. */
4496 /* NEWVAL is the value that was successfully stored, return a
4497 COMPOUND_EXPR of the statement and the appropriate value. */
4500 }
4502 /* Construct and perhaps optimize a tree representation
4503 for a unary operation. CODE, a tree_code, specifies the operation
4504 and XARG is the operand.
4505 For any CODE other than ADDR_EXPR, NOCONVERT suppresses the default
4506 promotions (such as from short to int).
4507 For ADDR_EXPR, the default promotions are not applied; NOCONVERT allows
4508 non-lvalues; this is only used to handle conversion of non-lvalue arrays
4509 to pointers in C99.
4511 LOCATION is the location of the operator. */
4513 tree
4516 {
4517 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
4521 tree val;
4542 {
4545 }
4548 {
4551 }
4554 {
4556 /* This is used for unary plus, because a CONVERT_EXPR
4557 is enough to prevent anybody from looking inside for
4558 associativity, but won't generate any code. */
4562 {
4565 }
4575 {
4578 }
4584 /* ~ works on integer types and non float vectors. */
4588 {
4591 /* Warn if the expression has boolean value. */
4597 {
4598 auto_diagnostic_group d;
4601 {
4605 }
4606 }
4609 }
4611 {
4617 }
4618 else
4619 {
4622 }
4627 {
4630 }
4637 {
4640 }
4646 /* Conjugating a real value is a no-op, but allow it anyway. */
4649 {
4652 }
4661 {
4665 }
4667 {
4670 }
4671 else
4674 /* If the TRUTH_NOT_EXPR has been folded, reset the location. */
4694 {
4697 noconvert);
4705 }
4707 /* Complain about anything that is not a true lvalue. In
4708 Objective-C, skip this check for property_refs. */
4713 ? lv_increment
4718 {
4722 else
4725 }
4728 {
4732 else
4735 }
4737 /* Ensure the argument is fully folded inside any SAVE_EXPR. */
4743 /* Increment or decrement the real part of the value,
4744 and don't change the imaginary part. */
4746 {
4753 {
4765 }
4766 }
4768 /* Report invalid types. */
4774 {
4777 else
4781 }
4783 {
4784 tree inc;
4788 /* Compute the increment. */
4791 {
4792 /* If pointer target is an incomplete type,
4793 we just cannot know how to do the arithmetic. */
4795 {
4800 else
4804 }
4807 {
4811 else
4814 }
4815 else
4821 }
4823 {
4824 /* For signed fract types, we invert ++ to -- or
4825 -- to ++, and change inc from 1 to -1, because
4826 it is not possible to represent 1 in signed fract constants.
4827 For unsigned fract types, the result always overflows and
4828 we get an undefined (original) or the maximum value. */
4840 }
4841 else
4842 {
4847 }
4849 /* If 'arg' is an Objective-C PROPERTY_REF expression, then we
4850 need to ask Objective-C to build the increment or decrement
4851 expression for it. */
4856 /* Report a read-only lvalue. */
4858 {
4864 }
4871 /* If the argument is atomic, use the special code sequences for
4872 atomic compound assignment. */
4874 {
4879 ? PLUS_EXPR
4882 ? inc
4887 }
4891 else
4896 TYPE_UNQUALIFIED);
4899 }
4902 /* Note that this operation never does default_conversion. */
4904 /* The operand of unary '&' must be an lvalue (which excludes
4905 expressions of type void), or, in C99, the result of a [] or
4906 unary '*' operator. */
4912 /* Let &* cancel out to simplify resulting code. */
4914 {
4915 /* Don't let this be an lvalue. */
4920 }
4922 /* Anything not already handled and not a true memory reference
4923 or a non-lvalue array is an error. */
4928 /* Move address operations inside C_MAYBE_CONST_EXPR to simplify
4929 folding later. */
4931 {
4934 noconvert);
4941 }
4943 /* Ordinary case; arg is a COMPONENT_REF or a decl. */
4946 /* If the lvalue is const or volatile, merge that into the type
4947 to which the address will point. This is only needed
4948 for function types. */
4952 {
4962 }
4965 {
4968 {
4972 }
4974 /* fall through */
4978 {
4982 {
4986 }
4991 "address of array with reverse scalar storage "
4993 }
4997 }
5007 /* ??? Cope with user tricks that amount to offsetof. Delete this
5008 when we have proper support for integer constant expressions. */
5012 {
5015 }
5028 }
5033 ret = (require_constant_value
5036 else
5038 return_build_unary_op:
5049 }
5051 /* Return nonzero if REF is an lvalue valid for this language.
5052 Lvalues can be assigned, unless their type has TYPE_READONLY.
5053 Lvalues can have their address taken, unless they have C_DECL_REGISTER. */
5055 bool
5057 {
5061 {
5076 /* MEM_REFs can appear from -fgimple parsing or folding, so allow them
5077 here as well. */
5092 }
5093 }
5094 \f
5095 /* Give a warning for storing in something that is read-only in GCC
5096 terms but not const in ISO C terms. */
5098 static void
5100 {
5102 {
5114 }
5116 }
5119 /* Return nonzero if REF is an lvalue valid for this language;
5120 otherwise, print an error message and return zero. USE says
5121 how the lvalue is being used and so selects the error message.
5122 LOCATION is the location at which any error should be reported. */
5124 static int
5126 {
5133 }
5134 \f
5135 /* Mark EXP saying that we need to be able to take the
5136 address of it; it should not be allocated in a register.
5137 Returns true if successful. ARRAY_REF_P is true if this
5138 is for ARRAY_REF construction - in that case we don't want
5139 to look through VIEW_CONVERT_EXPR from VECTOR_TYPE to ARRAY_TYPE,
5140 it is fine to use ARRAY_REFs for vector subscripts on vector
5141 register variables. */
5143 bool
5145 {
5150 {
5161 {
5165 }
5166 /* FALLTHRU */
5176 {
5179 }
5194 {
5196 {
5197 error
5200 }
5202 }
5204 {
5207 else
5210 }
5212 /* FALLTHRU */
5215 /* FALLTHRU */
5218 }
5219 }
5220 \f
5221 /* Convert EXPR to TYPE, warning about conversion problems with
5222 constants. SEMANTIC_TYPE is the type this conversion would use
5223 without excess precision. If SEMANTIC_TYPE is NULL, this function
5224 is equivalent to convert_and_check. This function is a wrapper that
5225 handles conversions that may be different than
5226 the usual ones because of excess precision. */
5228 static tree
5230 tree semantic_type)
5231 {
5235 /* For C11, integer conversions may have results with excess
5236 precision. */
5242 {
5243 /* For integers, we need to check the real conversion, not
5244 the conversion to the excess precision type. */
5246 }
5247 /* Result type is the excess precision type, which should be
5248 large enough, so do not check. */
5250 }
5252 /* If EXPR refers to a built-in declared without a prototype returns
5253 the actual type of the built-in and, if non-null, set *BLTIN to
5254 a pointer to the built-in. Otherwise return the type of EXPR
5255 and clear *BLTIN if non-null. */
5257 static tree
5259 {
5260 tree dummy;
5284 }
5286 /* Build and return a conditional expression IFEXP ? OP1 : OP2. If
5287 IFEXP_BCP then the condition is a call to __builtin_constant_p, and
5288 if folded to an integer constant then the unselected half may
5289 contain arbitrary operations not normally permitted in constant
5290 expressions. Set the location of the expression to LOC. */
5292 tree
5296 {
5297 tree type1;
5298 tree type2;
5306 tree ret;
5318 /* Promote both alternatives. */
5343 /* C90 does not permit non-lvalue arrays in conditional expressions.
5344 In C99 they will be pointers by now. */
5346 {
5349 }
5357 {
5360 {
5364 }
5366 {
5370 }
5371 }
5374 {
5385 }
5387 /* Quickly detect the usual case where op1 and op2 have the same type
5388 after promotion. */
5390 {
5393 else
5395 }
5400 {
5401 /* In C11, a conditional expression between a floating-point
5402 type and an integer type should convert the integer type to
5403 the evaluation format of the floating-point type, with
5404 possible excess precision. */
5408 {
5409 tree eptype;
5412 {
5416 }
5419 {
5423 }
5424 }
5429 "implicit conversion from %qT to %qT to "
5431 colon_loc);
5433 /* If -Wsign-compare, warn here if type1 and type2 have
5434 different signedness. We'll promote the signed to unsigned
5435 and later code won't know it used to be different.
5436 Do this check on the original types, so that explicit casts
5437 will be considered, but default promotions won't. */
5439 {
5444 {
5447 /* Do not warn if the result type is signed, since the
5448 signed type will only be chosen if it can represent
5449 all the values of the unsigned type. */
5452 else
5453 {
5457 /* Do not warn if the signed quantity is an
5458 unsuffixed integer literal (or some static
5459 constant expression involving such literals) and
5460 it is non-negative. This warning requires the
5461 operands to be folded for best results, so do
5462 that folding in this case even without
5463 warn_sign_compare to avoid warning options
5464 possibly affecting code generation. */
5465 c_inhibit_evaluation_warnings
5469 c_inhibit_evaluation_warnings
5472 c_inhibit_evaluation_warnings
5476 c_inhibit_evaluation_warnings
5480 {
5483 || (unsigned_op1
5488 "operand of %<?:%> changes signedness from "
5489 "%qT to %qT due to unsignedness of other "
5492 else
5494 "operand of %<?:%> changes signedness from "
5495 "%qT to %qT due to unsignedness of other "
5498 }
5503 }
5504 }
5505 }
5506 }
5508 {
5513 }
5515 {
5518 addr_space_t as_common;
5527 {
5531 }
5536 {
5541 {
5542 /* roles are swapped */
5545 }
5549 {
5552 "pointer to array loses qualifier "
5556 "pointer to array loses qualifier "
5558 }
5561 "ISO C forbids conditional expr between "
5563 /* for array, use qualifiers of element type */
5567 }
5568 /* Objective-C pointer comparisons are a bit more lenient. */
5571 else
5572 {
5576 "pointer type mismatch between %qT and %qT "
5579 else
5582 result_type = build_pointer_type
5584 }
5585 }
5587 {
5591 else
5592 {
5594 }
5596 }
5598 {
5602 else
5603 {
5605 }
5607 }
5608 /* 6.5.15: "if one is a null pointer constant (other than a pointer) or has
5609 type nullptr_t and the other is a pointer, the result type is the pointer
5610 type." */
5617 {
5620 else
5621 {
5624 }
5625 }
5627 /* Merge const and volatile flags of the incoming types. */
5628 result_type
5634 semantic_result_type);
5636 semantic_result_type);
5639 {
5642 }
5644 {
5647 }
5649 && op1_int_operands
5652 {
5659 }
5661 /* Need to convert condition operand into a vector mask. */
5663 {
5670 }
5674 else
5675 {
5677 {
5678 /* Use c_fully_fold here, since C_MAYBE_CONST_EXPR might be
5679 nested inside of the expression. */
5682 }
5686 }
5692 /* If the OP1 and OP2 are the same and don't have side-effects,
5693 warn here, because the COND_EXPR will be turned into OP1. */
5701 }
5702 \f
5703 /* EXPR is an expression, location LOC, whose result is discarded.
5704 Warn if it is a call to a nodiscard function (or a COMPOUND_EXPR
5705 whose right-hand operand is such a call, possibly recursively). */
5707 static void
5709 {
5713 {
5717 }
5723 tree attr;
5728 {
5733 auto_diagnostic_group d;
5737 "ignoring return value of %qD, declared with "
5739 else
5741 "ignoring return value of %qD, declared with "
5745 }
5746 else
5747 {
5755 auto_diagnostic_group d;
5759 "ignoring return value of type %qT, declared "
5762 else
5764 "ignoring return value of type %qT, declared "
5767 {
5769 {
5774 }
5775 }
5776 }
5777 }
5779 /* Return a compound expression that performs two expressions and
5780 returns the value of the second of them.
5782 LOC is the location of the COMPOUND_EXPR. */
5784 tree
5786 {
5789 tree ret;
5801 {
5804 }
5807 {
5808 /* The left-hand operand of a comma expression is like an expression
5809 statement: with -Wunused, we should warn if it doesn't have
5810 any side-effects, unless it was explicitly cast to (void). */
5812 {
5820 else
5823 }
5824 }
5827 {
5831 {
5835 }
5841 }
5843 /* With -Wunused, we should also warn if the left-hand operand does have
5844 side-effects, but computes a value which is not used. For example, in
5845 `foo() + bar(), baz()' the result of the `+' operator is not used,
5846 so we should issue a warning. */
5858 && expr1_int_operands
5867 }
5869 /* Issue -Wcast-qual warnings when appropriate. TYPE is the type to
5870 which we are casting. OTYPE is the type of the expression being
5871 cast. Both TYPE and OTYPE are pointer types. LOC is the location
5872 of the cast. -Wcast-qual appeared on the command line. Named
5873 address space qualifiers are not handled here, because they result
5874 in different warnings. */
5876 static void
5878 {
5885 /* Check that the qualifiers on IN_TYPE are a superset of the
5886 qualifiers of IN_OTYPE. The outermost level of POINTER_TYPE
5887 nodes is uninteresting and we stop as soon as we hit a
5888 non-POINTER_TYPE node on either type. */
5889 do
5890 {
5894 /* GNU C allows cv-qualified function types. 'const' means the
5895 function is very pure, 'volatile' means it can't return. We
5896 need to warn when such qualifiers are added, not when they're
5897 taken away. */
5902 else
5905 }
5914 /* There are qualifiers present in IN_OTYPE that are not present
5915 in IN_TYPE. */
5918 discarded);
5923 /* A cast from **T to const **T is unsafe, because it can cause a
5924 const value to be changed with no additional warning. We only
5925 issue this warning if T is the same on both sides, and we only
5926 issue the warning if there are the same number of pointers on
5927 both sides, as otherwise the cast is clearly unsafe anyhow. A
5928 cast is unsafe when a qualifier is added at one level and const
5929 is not present at all outer levels.
5931 To issue this warning, we check at each level whether the cast
5932 adds new qualifiers not already seen. We don't need to special
5933 case function types, as they won't have the same
5934 TYPE_MAIN_VARIANT. */
5944 do
5945 {
5950 {
5952 "to be safe all intermediate pointers in cast from "
5956 }
5959 }
5961 }
5963 /* Heuristic check if two parameter types can be considered ABI-equivalent. */
5965 static bool
5967 {
5975 /* The signedness of the parameter matters only when an integral
5976 type smaller than int is promoted to int, otherwise only the
5977 precision of the parameter matters.
5978 This check should make sure that the callee does not see
5979 undefined values in argument registers. */
5989 }
5991 /* Check if a type cast between two function types can be considered safe. */
5993 static bool
5995 {
6014 }
6016 /* Build an expression representing a cast to type TYPE of expression EXPR.
6017 LOC is the location of the cast-- typically the open paren of the cast. */
6019 tree
6021 {
6022 tree value;
6036 /* The ObjC front-end uses TYPE_MAIN_VARIANT to tie together types differing
6037 only in <protocol> qualifications. But when constructing cast expressions,
6038 the protocols do matter and must be kept around. */
6045 {
6048 }
6051 {
6054 }
6057 {
6061 }
6064 {
6069 /* Convert to remove any qualifiers from VALUE's type. */
6071 }
6073 {
6074 tree field;
6083 {
6084 tree t;
6096 }
6099 }
6100 else
6101 {
6105 {
6109 }
6113 /* Optionally warn about potentially worrisome casts. */
6119 /* Warn about conversions between pointers to disjoint
6120 address spaces. */
6124 {
6127 addr_space_t as_common;
6130 {
6141 else
6146 }
6147 }
6149 /* Warn about possible alignment problems. */
6155 /* Don't warn about opaque types, where the actual alignment
6156 restriction is unknown. */
6167 /* Unlike conversion of integers to pointers, where the
6168 warning is disabled for converting constants because
6169 of cases such as SIG_*, warn about converting constant
6170 pointers to integers. In some cases it may cause unwanted
6171 sign extension, and a warning is appropriate. */
6178 "cast from function call of type %qT "
6184 /* Don't warn about converting any constant. */
6193 /* If pedantic, warn for conversions between function and object
6194 pointer types, except for converting a null pointer constant
6195 to function pointer type. */
6220 "cast between incompatible function types"
6226 /* Ignore any integer overflow caused by the cast. */
6228 {
6230 {
6232 {
6233 /* Avoid clobbering a shared constant. */
6236 }
6237 }
6239 /* Reset VALUE's overflow flags, ensuring constant sharing. */
6241 }
6242 }
6244 /* Don't let a cast be an lvalue. */
6248 /* Don't allow the results of casting to floating-point or complex
6249 types be confused with actual constants, or casts involving
6250 integer and pointer types other than direct integer-to-integer
6251 and integer-to-pointer be confused with integer constant
6252 expressions and null pointer constants. */
6262 /* If the expression has integer operands and so can occur in an
6263 unevaluated part of an integer constant expression, ensure the
6264 return value reflects this. */
6273 }
6275 /* Interpret a cast of expression EXPR to type TYPE. LOC is the
6276 location of the open paren of the cast, or the position of the cast
6277 expr. */
6278 tree
6280 {
6281 tree type;
6284 tree ret;
6287 /* This avoids warnings about unprototyped casts on
6288 integers. E.g. "#define SIG_DFL (void(*)())0". */
6300 {
6307 }
6312 /* C++ does not permits types to be defined in a cast, but it
6313 allows references to incomplete types. */
6319 }
6320 \f
6321 /* Build an assignment expression of lvalue LHS from value RHS.
6322 If LHS_ORIGTYPE is not NULL, it is the original type of LHS, which
6323 may differ from TREE_TYPE (LHS) for an enum bitfield.
6324 MODIFYCODE is the code for a binary operator that we use
6325 to combine the old value of LHS with RHS to get the new value.
6326 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
6327 If RHS_ORIGTYPE is not NULL_TREE, it is the original type of RHS,
6328 which may differ from TREE_TYPE (RHS) for an enum value.
6330 LOCATION is the location of the MODIFYCODE operator.
6331 RHS_LOC is the location of the RHS. */
6333 tree
6337 {
6338 tree result;
6339 tree newrhs;
6346 /* Types that aren't fully specified cannot be used in assignments. */
6349 /* Avoid duplicate error messages from operands that had errors. */
6353 /* Ensure an error for assigning a non-lvalue array to an array in
6354 C90. */
6356 {
6359 }
6361 /* For ObjC properties, defer this check. */
6370 {
6373 rhs_origtype);
6382 }
6384 /* If a binary op has been requested, combine the old LHS value with the RHS
6385 producing the value we should actually store into the LHS. */
6388 {
6392 /* Construct the RHS for any non-atomic compound assignemnt. */
6394 {
6395 /* If in LHS op= RHS the RHS has side-effects, ensure they
6396 are preevaluated before the rest of the assignment expression's
6397 side-effects, because RHS could contain e.g. function calls
6398 that modify LHS. */
6400 {
6403 else
6408 newrhs);
6409 }
6413 /* The original type of the right hand side is no longer
6414 meaningful. */
6416 }
6417 }
6420 {
6421 /* Check if we are modifying an Objective-C property reference;
6422 if so, we need to generate setter calls. */
6425 else
6430 /* Else, do the check that we postponed for Objective-C. */
6433 }
6435 /* Give an error for storing in something that is 'const'. */
6440 {
6443 }
6447 /* If storing into a structure or union member,
6448 it has probably been given type `int'.
6449 Compute the type that would go with
6450 the actual amount of storage the member occupies. */
6459 /* If storing in a field that is in actuality a short or narrower than one,
6460 we must store in the field in its actual type. */
6463 {
6466 }
6468 /* Issue -Wc++-compat warnings about an assignment to an enum type
6469 when LHS does not have its original type. This happens for,
6470 e.g., an enum bitfield in a struct. */
6475 {
6477 ? rhs_origtype
6484 }
6486 /* Remove qualifiers. */
6490 /* Convert new value to destination type. Fold it first, then
6491 restore any excess precision information, for the sake of
6492 conversion warnings. */
6495 {
6498 {
6500 {
6503 }
6508 }
6509 else
6516 }
6518 /* Emit ObjC write barrier, if necessary. */
6520 {
6523 {
6526 }
6527 }
6529 /* Scan operands. */
6533 else
6534 {
6538 }
6540 /* If we got the LHS in a different type for storing in,
6541 convert the result back to the nominal type of LHS
6542 so that the value we return always has the same type
6543 as the LHS argument. */
6553 return_result:
6557 }
6558 \f
6559 /* Return whether STRUCT_TYPE has an anonymous field with type TYPE.
6560 This is used to implement -fplan9-extensions. */
6562 static bool
6564 {
6565 tree field;
6573 {
6576 TYPE_QUAL_ATOMIC)
6580 {
6584 }
6588 {
6592 }
6593 }
6595 }
6597 /* RHS is an expression whose type is pointer to struct. If there is
6598 an anonymous field in RHS with type TYPE, then return a pointer to
6599 that field in RHS. This is used with -fplan9-extensions. This
6600 returns NULL if no conversion could be found. */
6602 static tree
6604 {
6608 tree ret;
6617 TYPE_QUAL_ATOMIC)
6625 {
6631 TYPE_QUAL_ATOMIC)
6634 {
6638 }
6640 lhs_main_type))
6641 {
6646 }
6647 }
6654 NULL_TREE);
6658 {
6661 }
6664 }
6666 /* Issue an error message for a bad initializer component.
6667 GMSGID identifies the message.
6668 The component name is taken from the spelling stack. */
6672 {
6675 auto_diagnostic_group d;
6677 /* The gmsgid may be a format string with %< and %>. */
6686 }
6688 /* Issue a pedantic warning for a bad initializer component. OPT is
6689 the option OPT_* (from options.h) controlling this warning or 0 if
6690 it is unconditionally given. GMSGID identifies the message. The
6691 component name is taken from the spelling stack. */
6695 {
6696 /* Use the location where a macro was expanded rather than where
6697 it was defined to make sure macros defined in system headers
6698 but used incorrectly elsewhere are diagnosed. */
6700 auto_diagnostic_group d;
6708 }
6710 /* Issue a warning for a bad initializer component.
6712 OPT is the OPT_W* value corresponding to the warning option that
6713 controls this warning. GMSGID identifies the message. The
6714 component name is taken from the spelling stack. */
6716 static void
6718 {
6722 auto_diagnostic_group d;
6724 /* Use the location where a macro was expanded rather than where
6725 it was defined to make sure macros defined in system headers
6726 but used incorrectly elsewhere are diagnosed. */
6729 /* The gmsgid may be a format string with %< and %>. */
6734 }
6735 \f
6736 /* If TYPE is an array type and EXPR is a parenthesized string
6737 constant, warn if pedantic that EXPR is being used to initialize an
6738 object of type TYPE. */
6740 void
6742 {
6749 }
6751 /* Attempt to locate the parameter with the given index within FNDECL,
6752 returning DECL_SOURCE_LOCATION (FNDECL) if it can't be found. */
6754 static location_t
6756 {
6758 tree param;
6760 /* Locate param by index within DECL_ARGUMENTS (fndecl). */
6764 ;
6766 /* If something went wrong (e.g. if we have a builtin and thus no arguments),
6767 return DECL_SOURCE_LOCATION (FNDECL). */
6772 }
6774 /* Issue a note about a mismatching argument for parameter PARMNUM
6775 to FUNDECL, for types EXPECTED_TYPE and ACTUAL_TYPE.
6776 Attempt to issue the note at the pertinent parameter of the decl;
6777 failing that issue it at the location of FUNDECL; failing that
6778 issue it at PLOC. */
6780 static void
6783 {
6784 location_t loc;
6787 else
6793 }
6795 /* Issue a warning when an argument of ARGTYPE is passed to a built-in
6796 function FUNDECL declared without prototype to parameter PARMNUM of
6797 PARMTYPE when ARGTYPE does not promote to PARMTYPE. */
6799 static void
6802 {
6807 /* Avoid warning for enum arguments that promote to an integer type
6808 of the same size/mode. */
6820 /* This diagnoses even signed/unsigned mismatches. Those might be
6821 safe in many cases but GCC may emit suboptimal code for them so
6822 warning on those cases drives efficiency improvements. */
6826 "in a call to built-in function declared without "
6829 "in a call to built-in function declared without "
6834 fundecl);
6835 }
6837 /* Convert value RHS to type TYPE as preparation for an assignment to
6838 an lvalue of type TYPE. If ORIGTYPE is not NULL_TREE, it is the
6839 original type of RHS; this differs from TREE_TYPE (RHS) for enum
6840 types. NULL_POINTER_CONSTANT says whether RHS was a null pointer
6841 constant before any folding.
6842 The real work of conversion is done by `convert'.
6843 The purpose of this function is to generate error messages
6844 for assignments that are not allowed in C.
6845 ERRTYPE says whether it is argument passing, assignment,
6846 initialization or return.
6848 In the following example, '~' denotes where EXPR_LOC and '^' where
6849 LOCATION point to:
6851 f (var); [ic_argpass]
6852 ^ ~~~
6853 x = var; [ic_assign]
6854 ^ ~~~;
6855 int x = var; [ic_init]
6856 ^^^
6857 return x; [ic_return]
6858 ^
6860 FUNCTION is a tree for the function being called.
6861 PARMNUM is the number of the argument, for printing in error messages.
6862 WARNOPT may be set to a warning option to issue the corresponding warning
6863 rather than an error for invalid conversions. Used for calls to built-in
6864 functions declared without a prototype. */
6866 static tree
6871 {
6874 tree rhstype;
6879 /* Use the expansion point location to handle cases such as user's
6880 function returning a wrong-type macro defined in a system header. */
6884 {
6885 tree selector;
6886 /* Change pointer to function to the function itself for
6887 diagnostics. */
6892 /* Handle an ObjC selector specially for diagnostics. */
6896 {
6899 }
6900 }
6902 /* This macro is used to emit diagnostics to ensure that all format
6903 strings are complete sentences, visible to gettext and checked at
6904 compile time. */
6905 #define PEDWARN_FOR_ASSIGNMENT(LOCATION, PLOC, OPT, AR, AS, IN, RE) \
6906 do { \
6907 switch (errtype) \
6908 { \
6909 case ic_argpass: \
6910 { \
6911 auto_diagnostic_group d; \
6912 if (pedwarn (PLOC, OPT, AR, parmnum, rname)) \
6913 inform_for_arg (fundecl, (PLOC), parmnum, type, rhstype); \
6914 } \
6915 break; \
6916 case ic_assign: \
6917 pedwarn (LOCATION, OPT, AS); \
6918 break; \
6919 case ic_init: \
6920 case ic_init_const: \
6921 pedwarn_init (LOCATION, OPT, IN); \
6922 break; \
6923 case ic_return: \
6924 pedwarn (LOCATION, OPT, RE); \
6925 break; \
6926 default: \
6927 gcc_unreachable (); \
6928 } \
6929 } while (0)
6931 /* This macro is used to emit diagnostics to ensure that all format
6932 strings are complete sentences, visible to gettext and checked at
6933 compile time. It can be called with 'pedwarn' or 'warning_at'. */
6934 #define WARNING_FOR_QUALIFIERS(PEDWARN, LOCATION, PLOC, OPT, AR, AS, IN, RE, QUALS) \
6935 do { \
6936 switch (errtype) \
6937 { \
6938 case ic_argpass: \
6939 { \
6940 auto_diagnostic_group d; \
6941 if (PEDWARN) { \
6942 if (pedwarn (PLOC, OPT, AR, parmnum, rname, QUALS)) \
6943 inform_for_arg (fundecl, (PLOC), parmnum, type, rhstype); \
6944 } else { \
6945 if (warning_at (PLOC, OPT, AR, parmnum, rname, QUALS)) \
6946 inform_for_arg (fundecl, (PLOC), parmnum, type, rhstype); \
6947 } \
6948 } \
6949 break; \
6950 case ic_assign: \
6951 if (PEDWARN) \
6952 pedwarn (LOCATION, OPT, AS, QUALS); \
6953 else \
6954 warning_at (LOCATION, OPT, AS, QUALS); \
6955 break; \
6956 case ic_init: \
6957 case ic_init_const: \
6958 if (PEDWARN) \
6959 pedwarn (LOCATION, OPT, IN, QUALS); \
6960 else \
6961 warning_at (LOCATION, OPT, IN, QUALS); \
6962 break; \
6963 case ic_return: \
6964 if (PEDWARN) \
6965 pedwarn (LOCATION, OPT, RE, QUALS); \
6966 else \
6967 warning_at (LOCATION, OPT, RE, QUALS); \
6968 break; \
6969 default: \
6970 gcc_unreachable (); \
6971 } \
6972 } while (0)
6974 /* This macro is used to emit diagnostics to ensure that all format
6975 strings are complete sentences, visible to gettext and checked at
6976 compile time. It is the same as PEDWARN_FOR_ASSIGNMENT but with an
6977 extra parameter to enumerate qualifiers. */
6978 #define PEDWARN_FOR_QUALIFIERS(LOCATION, PLOC, OPT, AR, AS, IN, RE, QUALS) \
6979 WARNING_FOR_QUALIFIERS (true, LOCATION, PLOC, OPT, AR, AS, IN, RE, QUALS)
6992 {
6996 {
7013 }
7016 }
7019 {
7025 {
7051 }
7052 }
7055 {
7061 {
7066 }
7067 }
7070 {
7073 }
7076 {
7077 /* Except for passing an argument to an unprototyped function,
7078 this is a constraint violation. When passing an argument to
7079 an unprototyped function, it is compile-time undefined;
7080 making it a constraint in that case was rejected in
7081 DR#252. */
7085 else
7088 }
7096 /* A non-reference type can convert to a reference. This handles
7097 va_start, va_copy and possibly port built-ins. */
7099 {
7101 {
7105 else
7108 }
7125 }
7126 /* Some types can interconvert without explicit casts. */
7130 /* Arithmetic types all interconvert, and enum is treated like int. */
7139 {
7142 rhstype);
7155 }
7157 /* Aggregates in different TUs might need conversion. */
7164 /* Conversion to a transparent union or record from its member types.
7165 This applies only to function arguments. */
7169 {
7173 {
7184 {
7188 /* Any non-function converts to a [const][volatile] void *
7189 and vice versa; otherwise, targets must be the same.
7190 Meanwhile, the lhs target must have all the qualifiers of
7191 the rhs. */
7195 {
7198 /* If this type won't generate any warnings, use it. */
7206 /* Keep looking for a better type, but remember this one. */
7209 }
7210 }
7212 /* Can convert integer zero to any pointer type. */
7214 {
7217 }
7218 }
7221 {
7223 {
7224 /* We have only a marginally acceptable member type;
7225 it needs a warning. */
7229 /* Const and volatile mean something different for function
7230 types, so the usual warnings are not appropriate. */
7233 {
7234 /* Because const and volatile on functions are
7235 restrictions that say the function will not do
7236 certain things, it is okay to use a const or volatile
7237 function where an ordinary one is wanted, but not
7238 vice-versa. */
7242 OPT_Wdiscarded_qualifiers,
7244 "makes %q#v qualified function "
7247 "function pointer from "
7250 "function pointer from "
7255 }
7259 OPT_Wdiscarded_qualifiers,
7271 }
7279 }
7280 }
7282 /* Conversions among pointers */
7285 {
7286 /* If RHS refers to a built-in declared without a prototype
7287 BLTIN is the declaration of the built-in with a prototype
7288 and RHSTYPE is set to the actual type of the built-in. */
7289 tree bltin;
7298 addr_space_t asl;
7299 addr_space_t asr;
7304 TYPE_QUAL_ATOMIC)
7309 TYPE_QUAL_ATOMIC)
7311 /* Opaque pointers are treated like void pointers. */
7314 /* The Plan 9 compiler permits a pointer to a struct to be
7315 automatically converted into a pointer to an anonymous field
7316 within the struct. */
7321 {
7324 {
7330 }
7331 }
7333 /* C++ does not allow the implicit conversion void* -> T*. However,
7334 for the purpose of reducing the number of false positives, we
7335 tolerate the special case of
7337 int *p = NULL;
7339 where NULL is typically defined in C to be '(void *) 0'. */
7342 OPT_Wc___compat,
7343 "request for implicit conversion "
7346 /* See if the pointers point to incompatible address spaces. */
7351 {
7352 auto_diagnostic_group d;
7355 {
7357 {
7361 diagnosed
7363 else
7366 }
7368 {
7373 else
7376 }
7379 {
7384 else
7387 }
7389 {
7394 else
7397 }
7400 }
7402 {
7405 else
7408 }
7410 }
7412 /* Check if the right-hand side has a format attribute but the
7413 left-hand side doesn't. */
7416 {
7418 {
7421 "argument %d of %qE might be "
7427 "assignment left-hand side might be "
7433 "initialization left-hand side might be "
7438 "return type might be "
7443 }
7444 }
7446 /* See if the pointers point to incompatible scalar storage orders. */
7450 {
7451 tree t;
7454 {
7456 /* Do not warn for built-in functions, for example memcpy, since we
7457 control how they behave and they can be useful in this area. */
7461 "passing argument %d of %qE from incompatible "
7465 /* Do not warn if the RHS is a call to a function that returns a
7466 pointer that is not an alias. */
7471 "assignment to %qT from pointer type %qT with "
7476 /* Likewise. */
7481 "initialization of %qT from pointer type %qT with "
7486 "returning %qT from pointer type with incompatible "
7491 }
7492 }
7494 /* Any non-function converts to a [const][volatile] void *
7495 and vice versa; otherwise, targets must be the same.
7496 Meanwhile, the lhs target must have all the qualifiers of the rhs. */
7500 || is_opaque_pointer
7506 {
7507 /* Warn about loss of qualifers from pointers to arrays with
7508 qualifiers on the element type. */
7510 {
7518 OPT_Wdiscarded_array_qualifiers,
7528 }
7531 ||
7533 && !null_pointer_constant
7537 "%qE between function pointer "
7545 /* Const and volatile mean something different for function types,
7546 so the usual warnings are not appropriate. */
7549 {
7550 /* Assignments between atomic and non-atomic objects are OK. */
7556 /* Don't warn about loss of qualifier for conversions from
7557 qualified void* to pointers to arrays with corresponding
7558 qualifier on the element type (except for pedantic before C23). */
7561 OPT_Wdiscarded_qualifiers,
7575 /* If this is not a case of ignoring a mismatch in signedness,
7576 no warning. */
7579 ;
7580 /* If there is a mismatch, do warn. */
7583 {
7585 {
7586 auto_diagnostic_group d;
7590 "pointer targets in passing argument %d of "
7593 rhstype);
7594 }
7598 "pointer targets in assignment from %qT to %qT "
7604 "pointer targets in initialization of %qT "
7606 rhstype);
7610 "returning %qT from a function with return type "
7615 }
7616 }
7619 {
7620 /* Because const and volatile on functions are restrictions
7621 that say the function will not do certain things,
7622 it is okay to use a const or volatile function
7623 where an ordinary one is wanted, but not vice-versa. */
7627 OPT_Wdiscarded_qualifiers,
7629 "%q#v qualified function pointer "
7638 }
7639 }
7640 /* Avoid warning about the volatile ObjC EH puts on decls. */
7642 {
7644 {
7646 {
7647 auto_diagnostic_group d;
7651 "passing argument %d of %qE from incompatible "
7654 }
7659 "assignment to %qT from pointer to "
7662 else
7671 "initialization of %qT from pointer to "
7674 else
7676 "initialization of %qT from incompatible "
7683 "returning pointer to %qD of type %qT from "
7686 else
7688 "returning %qT from a function with incompatible "
7693 }
7694 }
7696 /* If RHS isn't an address, check pointer or array of packed
7697 struct or union. */
7701 }
7703 {
7704 /* ??? This should not be an error when inlining calls to
7705 unprototyped functions. */
7709 else
7712 }
7715 {
7716 /* An explicit constant 0 or type nullptr_t can convert to a pointer,
7717 or one that results from arithmetic, even including a cast to
7718 integer type. */
7721 {
7723 {
7724 auto_diagnostic_group d;
7728 "passing argument %d of %qE makes pointer from "
7731 }
7735 "assignment to %qT from %qT makes pointer from integer "
7741 "initialization of %qT from %qT makes pointer from "
7746 "function with return type %qT makes pointer from "
7751 }
7754 }
7756 {
7758 {
7760 {
7761 auto_diagnostic_group d;
7765 "passing argument %d of %qE makes integer from "
7768 }
7772 "assignment to %qT from %qT makes integer from pointer "
7778 "initialization of %qT from %qT makes integer from "
7783 "function with return type %qT makes integer from "
7788 }
7791 }
7793 /* The type nullptr_t may be converted to bool. The
7794 result is false. */
7796 {
7797 tree ret;
7803 }
7808 {
7810 {
7811 auto_diagnostic_group d;
7817 else
7820 }
7823 {
7828 else
7831 }
7834 {
7839 else
7842 }
7844 {
7849 else
7852 }
7855 }
7858 }
7859 \f
7860 /* If VALUE is a compound expr all of whose expressions are constant, then
7861 return its value. Otherwise, return error_mark_node.
7863 This is for handling COMPOUND_EXPRs as initializer elements
7864 which is allowed with a warning when -pedantic is specified. */
7866 static tree
7868 {
7870 {
7875 endtype);
7876 }
7879 else
7881 }
7882 \f
7883 /* Perform appropriate conversions on the initial value of a variable,
7884 store it in the declaration DECL,
7885 and print any error messages that are appropriate.
7886 If ORIGTYPE is not NULL_TREE, it is the original type of INIT.
7887 If the init is invalid, store an ERROR_MARK.
7889 INIT_LOC is the location of the initial value. */
7891 void
7893 {
7899 /* If variable's type was invalidly declared, just ignore it. */
7905 /* Digest the specified initializer into an expression. */
7908 {
7913 /* Not fully determined before folding. */
7915 }
7922 /* Store the expression if valid; else report error. */
7932 /* ANSI wants warnings about out-of-range constant initializers. */
7937 /* Check if we need to set array size from compound literal size. */
7941 {
7948 {
7952 {
7953 /* For int foo[] = (int [3]){1}; we need to set array size
7954 now since later on array initializer will be just the
7955 brace enclosed list of the compound literal. */
7963 }
7964 }
7965 }
7966 }
7967 \f
7968 /* Methods for storing and printing names for error messages. */
7970 /* Implement a spelling stack that allows components of a name to be pushed
7971 and popped. Each element on the stack is this structure. */
7973 struct spelling
7974 {
7976 union
7977 {
7981 };
7983 #define SPELLING_STRING 1
7984 #define SPELLING_MEMBER 2
7985 #define SPELLING_BOUNDS 3
7991 /* Macros to save and restore the spelling stack around push_... functions.
7992 Alternative to SAVE_SPELLING_STACK. */
7994 #define SPELLING_DEPTH() (spelling - spelling_base)
7995 #define RESTORE_SPELLING_DEPTH(DEPTH) (spelling = spelling_base + (DEPTH))
7997 /* Push an element on the spelling stack with type KIND and assign VALUE
7998 to MEMBER. */
8000 #define PUSH_SPELLING(KIND, VALUE, MEMBER) \
8001 { \
8002 int depth = SPELLING_DEPTH (); \
8003 \
8004 if (depth >= spelling_size) \
8005 { \
8006 spelling_size += 10; \
8007 spelling_base = XRESIZEVEC (struct spelling, spelling_base, \
8008 spelling_size); \
8009 RESTORE_SPELLING_DEPTH (depth); \
8010 } \
8011 \
8012 spelling->kind = (KIND); \
8013 spelling->MEMBER = (VALUE); \
8014 spelling++; \
8015 }
8017 /* Push STRING on the stack. Printed literally. */
8019 static void
8021 {
8023 }
8025 /* Push a member name on the stack. Printed as '.' STRING. */
8027 static void
8029 {
8035 }
8037 /* Push an array bounds on the stack. Printed as [BOUNDS]. */
8039 static void
8041 {
8043 }
8045 /* Compute the maximum size in bytes of the printed spelling. */
8047 static int
8049 {
8054 {
8057 else
8059 }
8062 }
8064 /* Print the spelling to BUFFER and return it. */
8068 {
8074 {
8077 }
8078 else
8079 {
8084 ;
8085 }
8088 }
8090 /* Check whether INIT, a floating or integer constant, is
8091 representable in TYPE, a real floating type with the same radix or
8092 a decimal floating type initialized with a binary floating
8093 constant. Return true if OK, false if not. */
8094 static bool
8096 {
8101 {
8102 /* Same mode, no conversion required except for the case of
8103 signaling NaNs if the types are incompatible (e.g. double and
8104 long double with the same mode). */
8110 }
8112 {
8118 }
8128 {
8129 /* This is valid if the real number represented by the
8130 initializer can be exactly represented in the decimal
8131 type. Compare the values using MPFR. */
8132 REAL_VALUE_TYPE t;
8145 }
8146 /* exact_real_truncate is not quite right here, since it doesn't
8147 allow even an exact conversion to subnormal values. */
8148 REAL_VALUE_TYPE t;
8151 }
8153 /* Check whether INIT (location LOC) is valid as a 'constexpr'
8154 initializer for type TYPE, and give an error if not. INIT has
8155 already been folded and verified to be constant. INT_CONST_EXPR
8156 and ARITH_CONST_EXPR say whether it is an integer constant
8157 expression or arithmetic constant expression, respectively. If
8158 TYPE is not a scalar type, this function does nothing. */
8160 static void
8163 {
8165 {
8166 /* The initializer must be null. */
8170 }
8172 {
8173 /* The initializer must be an integer constant expression,
8174 representable in the target type. */
8182 }
8183 /* We don't apply any extra checks to extension types such as vector
8184 or fixed-point types. */
8188 {
8192 }
8193 /* We don't apply any extra checks to complex integers. */
8197 /* Following N3082, a real type cannot be initialized from a complex
8198 type and a binary type cannot be initialized from a decimal type
8199 (but initializing a decimal type from a binary type is OK).
8200 Signaling NaN initializers are OK only if the types are
8201 compatible (not just the same mode); all quiet NaN and infinity
8202 initializations are considered to preserve the value. */
8205 {
8209 }
8214 {
8218 }
8221 {
8223 {
8236 }
8237 }
8238 else
8243 }
8245 /* Digest the parser output INIT as an initializer for type TYPE.
8246 Return a C expression of type TYPE to represent the initial value.
8248 If ORIGTYPE is not NULL_TREE, it is the original type of INIT.
8250 NULL_POINTER_CONSTANT is true if INIT is a null pointer constant,
8251 INT_CONST_EXPR is true if INIT is an integer constant expression,
8252 and ARITH_CONST_EXPR is true if INIT is, or might be, an arithmetic
8253 constant expression, false if it has already been determined in the
8254 caller that it is not (but folding may have made the value passed here
8255 indistinguishable from an arithmetic constant expression).
8257 If INIT is a string constant, STRICT_STRING is true if it is
8258 unparenthesized or we should not warn here for it being parenthesized.
8259 For other types of INIT, STRICT_STRING is not used.
8261 INIT_LOC is the location of the INIT.
8263 REQUIRE_CONSTANT requests an error if non-constant initializers or
8264 elements are seen. REQUIRE_CONSTEXPR means the stricter requirements
8265 on initializers for 'constexpr' objects apply. */
8267 static tree
8272 {
8279 || !init
8286 {
8288 {
8291 }
8293 }
8294 /* TODO: this may not detect all cases of expressions folding to
8295 constants that are not arithmetic constant expressions. */
8309 /* Initialization of an array of chars from a string constant
8310 optionally enclosed in braces. */
8314 {
8315 tree typ1
8318 TYPE_QUAL_ATOMIC)
8320 /* Note that an array could be both an array of character type
8321 and an array of wchar_t if wchar_t is signed char or unsigned
8322 char. */
8331 {
8350 {
8353 }
8358 {
8363 }
8367 {
8368 /* Check if all characters of the string can be
8369 represented in the type of the constexpr object being
8370 initialized. */
8377 {
8381 }
8382 }
8387 {
8391 /* Subtract the size of a single (possibly wide) character
8392 because it's ok to ignore the terminating null char
8393 that is counted in the length of the constant. */
8404 {
8405 unsigned HOST_WIDE_INT size
8410 }
8411 }
8415 }
8417 {
8421 }
8422 }
8424 /* Build a VECTOR_CST from a *constant* vector constructor. If the
8425 vector constructor is not constant (e.g. {1,2,3,foo()}) then punt
8426 below and handle as a constructor. */
8431 {
8438 {
8440 tree value;
8443 /* Iterate through elements and check if all constructor
8444 elements are *_CSTs. */
8447 {
8450 }
8455 }
8456 }
8461 /* Any type can be initialized
8462 from an expression of the same type, optionally with braces. */
8475 {
8477 {
8479 {
8482 inside_init = array_to_pointer_conversion
8484 else
8485 {
8488 }
8489 }
8490 }
8493 /* Although the types are compatible, we may require a
8494 conversion. */
8499 {
8500 /* As an extension, allow initializing objects with static storage
8501 duration with compound literals (which are then treated just as
8502 the brace enclosed list they contain). Also allow this for
8503 vectors, as we can only assign them with compound literals. */
8509 }
8513 {
8517 }
8519 /* Compound expressions can only occur here if -Wpedantic or
8520 -pedantic-errors is specified. In the later case, we always want
8521 an error. In the former case, we simply want a warning. */
8524 {
8525 inside_init
8530 else
8535 }
8539 {
8542 }
8550 /* Added to enable additional -Wsuggest-attribute=format warnings. */
8554 (require_constant
8555 ? ic_init_const
8559 }
8561 /* Handle scalar types, including conversions. */
8566 {
8574 inside_init);
8575 inside_init
8582 /* Check to see if we have already given an error message. */
8584 ;
8586 {
8589 }
8593 {
8597 }
8606 }
8608 /* Come here only for records and arrays. */
8611 {
8613 "variable-sized object may not be initialized except "
8616 }
8620 }
8621 \f
8622 /* Handle initializers that use braces. */
8624 /* Type of object we are accumulating a constructor for.
8625 This type is always a RECORD_TYPE, UNION_TYPE or ARRAY_TYPE. */
8628 /* For a RECORD_TYPE or UNION_TYPE, this is the chain of fields
8629 left to fill. */
8632 /* For an ARRAY_TYPE, this is the specified index
8633 at which to store the next element we get. */
8636 /* For an ARRAY_TYPE, this is the maximum index. */
8639 /* For a RECORD_TYPE, this is the first field not yet written out. */
8642 /* For an ARRAY_TYPE, this is the index of the first element
8643 not yet written out. */
8646 /* In a RECORD_TYPE, the byte index of the next consecutive field.
8647 This is so we can generate gaps between fields, when appropriate. */
8650 /* If we are saving up the elements rather than allocating them,
8651 this is the list of elements so far (in reverse order,
8652 most recent first). */
8655 /* 1 if constructor should be incrementally stored into a constructor chain,
8656 0 if all the elements should be kept in AVL tree. */
8659 /* 1 if so far this constructor's elements are all compile-time constants. */
8662 /* 1 if so far this constructor's elements are all valid address constants. */
8665 /* 1 if this constructor has an element that cannot be part of a
8666 constant expression. */
8669 /* 1 if this constructor is erroneous so far. */
8672 /* 1 if this constructor is the universal zero initializer { 0 }. */
8675 /* Structure for managing pending initializer elements, organized as an
8676 AVL tree. */
8678 struct init_node
8679 {
8683 tree purpose;
8684 tree value;
8685 tree origtype;
8686 };
8688 /* Tree of pending elements at this constructor level.
8689 These are elements encountered out of order
8690 which belong at places we haven't reached yet in actually
8691 writing the output.
8692 Will never hold tree nodes across GC runs. */
8695 /* The SPELLING_DEPTH of this constructor. */
8698 /* DECL node for which an initializer is being read.
8699 0 means we are reading a constructor expression
8700 such as (struct foo) {...}. */
8703 /* Nonzero if there were any member designators in this initializer. */
8706 /* Nesting depth of designator list. */
8709 /* Nonzero if there were diagnosed errors in this designator list. */
8712 \f
8713 /* This stack has a level for each implicit or explicit level of
8714 structuring in the initializer, including the outermost one. It
8715 saves the values of most of the variables above. */
8719 struct constructor_stack
8720 {
8722 tree type;
8723 tree fields;
8724 tree index;
8725 tree max_index;
8726 tree unfilled_index;
8727 tree unfilled_fields;
8728 tree bit_index;
8733 /* If value nonzero, this value should replace the entire
8734 constructor at this level. */
8746 };
8750 /* This stack represents designators from some range designator up to
8751 the last designator in the list. */
8753 struct constructor_range_stack
8754 {
8757 tree range_start;
8758 tree index;
8759 tree range_end;
8760 tree fields;
8761 };
8765 /* This stack records separate initializers that are nested.
8766 Nested initializers can't happen in ANSI C, but GNU C allows them
8767 in cases like { ... (struct foo) { ... } ... }. */
8769 struct initializer_stack
8770 {
8772 tree decl;
8784 };
8787 \f
8788 /* Prepare to parse and output the initializer for variable DECL. */
8790 void
8794 {
8819 {
8820 require_constant_elements
8822 /* For a scalar, you can always use any value to initialize,
8823 even within braces. */
8826 }
8827 else
8828 {
8831 }
8844 }
8846 void
8848 {
8851 /* Free the whole constructor stack of this initializer. */
8853 {
8857 }
8861 /* Pop back to the data of the outer initializer (if any). */
8877 }
8878 \f
8879 /* Call here when we see the initializer is surrounded by braces.
8880 This is instead of a call to push_init_level;
8881 it is matched by a call to pop_init_level.
8883 TYPE is the type to initialize, for a constructor expression.
8884 For an initializer for a decl, TYPE is zero. */
8886 void
8888 {
8938 {
8940 /* Skip any nameless bit fields at the beginning. */
8947 }
8949 {
8951 {
8952 constructor_max_index
8955 /* Detect non-empty initializations of zero-length arrays. */
8960 /* constructor_max_index needs to be an INTEGER_CST. Attempts
8961 to initialize VLAs with a nonempty initializer will cause a
8962 proper error; avoid tree checking errors as well by setting a
8963 safe value. */
8968 constructor_index
8971 }
8972 else
8973 {
8976 }
8979 }
8981 {
8982 /* Vectors are like simple fixed-size arrays. */
8983 constructor_max_index =
8987 }
8988 else
8989 {
8990 /* Handle the case of int x = {5}; */
8993 }
8994 }
8995 \f
8998 /* Called when we see an open brace for a nested initializer. Finish
8999 off any pending levels with implicit braces. */
9000 void
9002 {
9004 {
9009 last_init_list_comma),
9012 && constructor_max_index
9014 constructor_index))
9017 last_init_list_comma),
9019 else
9021 }
9022 }
9024 /* Push down into a subobject, for initialization.
9025 If this is for an explicit set of braces, IMPLICIT is 0.
9026 If it is because the next element belongs at a lower level,
9027 IMPLICIT is 1 (or 2 if the push is because of designator list). */
9029 void
9032 {
9036 /* Unless this is an explicit brace, we need to preserve previous
9037 content if any. */
9039 {
9044 }
9079 /* If the upper initializer is designated, then mark this as
9080 designated too to prevent bogus warnings. */
9084 {
9089 }
9091 /* Don't die if an entire brace-pair level is superfluous
9092 in the containing level. */
9094 ;
9096 {
9097 /* Don't die if there are extra init elts at the end. */
9100 else
9101 {
9104 constructor_depth++;
9105 }
9106 }
9108 {
9111 constructor_depth++;
9112 }
9115 {
9120 }
9123 {
9132 }
9135 {
9140 }
9143 {
9145 /* Skip any nameless bit fields at the beginning. */
9152 }
9154 {
9155 /* Vectors are like simple fixed-size arrays. */
9156 constructor_max_index =
9160 }
9162 {
9164 {
9165 constructor_max_index
9168 /* Detect non-empty initializations of zero-length arrays. */
9173 /* constructor_max_index needs to be an INTEGER_CST. Attempts
9174 to initialize VLAs will cause a proper error; avoid tree
9175 checking errors as well by setting a safe value. */
9180 constructor_index
9183 }
9184 else
9189 {
9190 /* We need to split the char/wchar array into individual
9191 characters, so that we don't have to special case it
9192 everywhere. */
9194 }
9195 }
9196 else
9197 {
9202 }
9203 }
9205 /* At the end of an implicit or explicit brace level,
9206 finish up that level of constructor. If a single expression
9207 with redundant braces initialized that level, return the
9208 c_expr structure for that expression. Otherwise, the original_code
9209 element is set to ERROR_MARK.
9210 If we were outputting the elements as they are read, return 0 as the value
9211 from inner levels (process_init_element ignores that),
9212 but return error_mark_node as the value from the outermost level
9213 (that's what we want to put in DECL_INITIAL).
9214 Otherwise, return a CONSTRUCTOR expression as the value. */
9216 struct c_expr
9219 location_t insert_before)
9220 {
9229 {
9230 /* When we come to an explicit close brace,
9231 pop any inner levels that didn't have explicit braces. */
9235 insert_before),
9238 }
9239 else
9244 /* Now output all pending elements. */
9250 /* Error for initializing a flexible array member, or a zero-length
9251 array member in an inappropriate context. */
9256 {
9257 /* Silently discard empty initializations. The parser will
9258 already have pedwarned for empty brackets. */
9261 else
9262 {
9267 else
9271 /* We have already issued an error message for the existence
9272 of a flexible array member not at the end of the structure.
9273 Discard the initializer so that we do not die later. */
9276 }
9277 }
9280 {
9282 /* Initialization with { } counts as zeroinit. */
9286 /* This might be zeroinit as well. */
9291 /* If the constructor has more than one element, it can't be { 0 }. */
9294 }
9296 /* Warn when some structs are initialized with direct aggregation. */
9299 {
9302 OPT_Wmissing_braces,
9304 }
9306 /* Warn when some struct elements are implicitly initialized to zero. */
9308 && constructor_type
9311 {
9312 /* Do not warn for flexible array members or zero-length arrays. */
9319 /* Do not warn if this level of the initializer uses member
9320 designators; it is likely to be deliberate. */
9321 && !constructor_designated
9322 /* Do not warn about initializing with { 0 } or with { }. */
9324 {
9327 constructor_unfilled_fields,
9328 constructor_type))
9331 }
9332 }
9334 /* Pad out the end of the structure. */
9336 /* If this closes a superfluous brace pair,
9337 just pass out the element between them. */
9340 ;
9344 {
9345 /* A nonincremental scalar initializer--just return
9346 the element, after verifying there is just one.
9347 Empty scalar initializers are supported in C2X. */
9349 {
9353 {
9356 }
9358 /* Ensure this is a null pointer constant in the case of a
9359 'constexpr' object initialized with {}. */
9361 else
9363 }
9365 {
9368 }
9369 else
9371 }
9372 else
9373 {
9376 else
9377 {
9379 constructor_elements);
9386 }
9387 }
9390 {
9395 }
9424 }
9426 /* Common handling for both array range and field name designators.
9427 ARRAY argument is nonzero for array ranges. Returns false for success. */
9429 static bool
9432 {
9433 tree subtype;
9436 /* Don't die if an entire brace-pair level is superfluous
9437 in the containing level, or for an erroneous type. */
9441 /* If there were errors in this designator list already, bail out
9442 silently. */
9446 /* Likewise for an initializer for a variable-size type. Those are
9447 diagnosed in the parser, except for empty initializer braces. */
9453 {
9456 /* Designator list starts at the level of closest explicit
9457 braces. */
9461 last_init_list_comma),
9465 }
9468 {
9480 }
9484 {
9487 }
9489 {
9492 }
9498 }
9500 /* If there are range designators in designator list, push a new designator
9501 to constructor_range_stack. RANGE_END is end of such stack range or
9502 NULL_TREE if there is no range designator at this level. */
9504 static void
9506 {
9522 }
9524 /* Within an array initializer, specify the next index to be initialized.
9525 FIRST is that index. If LAST is nonzero, then initialize a range
9526 of indices, running from FIRST through LAST. */
9528 void
9531 {
9539 {
9542 }
9545 {
9549 "array index in initializer is not "
9551 }
9554 {
9558 "array index in initializer is not "
9560 }
9573 else
9574 {
9580 {
9583 }
9586 {
9590 {
9593 }
9594 else
9595 {
9599 {
9603 }
9604 }
9605 }
9607 designator_depth++;
9611 }
9612 }
9614 /* Within a struct initializer, specify the next field to be initialized. */
9616 void
9619 {
9620 tree field;
9628 {
9631 }
9636 {
9639 {
9645 }
9646 else
9649 }
9650 else
9651 do
9652 {
9654 designator_depth++;
9660 {
9663 }
9664 }
9666 }
9667 \f
9668 /* Add a new initializer to the tree of pending initializers. PURPOSE
9669 identifies the initializer, either array index or field in a structure.
9670 VALUE is the value of that index or field. If ORIGTYPE is not
9671 NULL_TREE, it is the original type of VALUE.
9673 IMPLICIT is true if value comes from pop_init_level (1),
9674 the new initializer has been merged with the existing one
9675 and thus no warnings should be emitted about overriding an
9676 existing initializer. */
9678 static void
9681 {
9688 {
9690 {
9696 else
9697 {
9699 {
9702 "initialized field with side-effects "
9707 }
9711 }
9712 }
9713 }
9714 else
9715 {
9716 tree bitpos;
9720 {
9726 else
9727 {
9729 {
9732 "initialized field with side-effects "
9737 }
9741 }
9742 }
9743 }
9758 {
9762 {
9766 {
9768 {
9769 /* L rotation. */
9782 {
9785 else
9787 }
9788 else
9790 }
9791 else
9792 {
9793 /* LR rotation. */
9815 {
9818 else
9820 }
9821 else
9823 }
9825 }
9826 else
9827 {
9828 /* p->balance == +1; growth of left side balances the node. */
9831 }
9832 }
9834 {
9836 /* Growth propagation from right side. */
9839 {
9841 {
9842 /* R rotation. */
9855 {
9858 else
9860 }
9861 else
9863 }
9865 {
9866 /* RL rotation */
9888 {
9891 else
9893 }
9894 else
9896 }
9898 }
9899 else
9900 {
9901 /* p->balance == -1; growth of right side balances the node. */
9904 }
9905 }
9909 }
9910 }
9912 /* Build AVL tree from a sorted chain. */
9914 static void
9916 {
9926 braced_init_obstack);
9929 {
9931 /* Skip any nameless bit fields at the beginning. */
9936 }
9938 {
9940 constructor_unfilled_index
9943 else
9945 }
9947 }
9949 /* Build AVL tree from a string constant. */
9951 static void
9954 {
9971 p < end
9972 && !(constructor_max_index
9975 {
9977 {
9980 }
9981 else
9982 {
9986 {
9989 else
9994 }
9995 }
9998 {
10001 {
10003 {
10006 }
10007 }
10009 {
10012 }
10016 }
10022 braced_init_obstack);
10023 }
10026 }
10028 /* Return value of FIELD in pending initializer or NULL_TREE if the field was
10029 not initialized yet. */
10031 static tree
10033 {
10037 {
10044 {
10049 else
10051 }
10052 }
10054 {
10058 && (!constructor_unfilled_fields
10065 {
10070 else
10072 }
10073 }
10075 {
10079 }
10081 }
10083 /* "Output" the next constructor element.
10084 At top level, really output it to assembler code now.
10085 Otherwise, collect it in a list from which we will make a CONSTRUCTOR.
10086 If ORIGTYPE is not NULL_TREE, it is the original type of VALUE.
10087 TYPE is the data type that the containing data type wants here.
10088 FIELD is the field (a FIELD_DECL) or the index that this element fills.
10089 If VALUE is a string constant, STRICT_STRING is true if it is
10090 unparenthesized or we should not warn here for it being parenthesized.
10091 For other types of VALUE, STRICT_STRING is not used.
10093 PENDING if true means output pending elements that belong
10094 right after this element. (PENDING is normally true;
10095 it is false while outputting pending elements, to avoid recursion.)
10097 IMPLICIT is true if value comes from pop_init_level (1),
10098 the new initializer has been merged with the existing one
10099 and thus no warnings should be emitted about overriding an
10100 existing initializer. */
10102 static void
10106 {
10112 {
10115 }
10128 {
10129 /* As an extension, allow initializing objects with static storage
10130 duration with compound literals (which are then treated just as
10131 the brace enclosed list they contain). */
10137 }
10143 /* Not fully determined before folding. */
10146 {
10149 }
10151 /* TODO: this may not detect all cases of expressions folding to
10152 constants that are not arithmetic constant expressions. */
10173 && TYPE_REVERSE_STORAGE_ORDER
10182 /* Digest the initializer and issue any errors about incompatible
10183 types before issuing errors about non-constant initializers. */
10187 /* In the case of braces around a scalar initializer, the result of
10188 this initializer processing goes through digest_init again at the
10189 outer level. In the case of a constexpr initializer for a
10190 pointer, avoid converting a null pointer constant to something
10191 that is not a null pointer constant to avoid a spurious error
10192 from that second processing. */
10194 || !npc
10200 {
10203 }
10207 /* Proceed to check the constness of the original initializer. */
10209 {
10211 {
10214 }
10218 }
10223 /* digest_init has already carried out the additional checks
10224 required for 'constexpr' initializers (using the information
10225 passed to it about whether the original initializer was certain
10226 kinds of constant expression), so that check does not need to be
10227 repeated here. */
10229 /* Issue -Wc++-compat warnings about initializing a bitfield with
10230 enum type. */
10238 {
10245 }
10247 /* If this field is empty and does not have side effects (and is not at
10248 the end of structure), don't do anything other than checking the
10249 initializer. */
10259 /* Finally, set VALUE to the initializer value digested above. */
10262 /* If this element doesn't come next in sequence,
10263 put it on constructor_pending_elts. */
10265 && (!constructor_incremental
10267 {
10273 braced_init_obstack);
10275 }
10277 && (!constructor_incremental
10279 {
10280 /* We do this for records but not for unions. In a union,
10281 no matter which field is specified, it can be initialized
10282 right away since it starts at the beginning of the union. */
10284 {
10287 else
10288 {
10296 }
10297 }
10300 braced_init_obstack);
10302 }
10305 {
10307 {
10314 }
10316 /* We can have just one union field set. */
10318 }
10320 /* Otherwise, output this element either to
10321 constructor_elements or to the assembler file. */
10326 /* Advance the variable that indicates sequential elements output. */
10328 constructor_unfilled_index
10330 bitsize_one_node);
10332 {
10333 constructor_unfilled_fields
10336 /* Skip any nameless bit fields. */
10339 constructor_unfilled_fields =
10341 }
10345 /* Now output any pending elements which have become next. */
10348 }
10350 /* For two FIELD_DECLs in the same chain, return -1 if field1
10351 comes before field2, 1 if field1 comes after field2 and
10352 0 if field1 == field2. */
10354 static int
10356 {
10363 {
10364 /* If one of the fields has non-zero bitsize, then that
10365 field must be the last one in a sequence of zero
10366 sized fields, fields after it will have bigger
10367 bit_position. */
10376 /* Otherwise, fallback to DECL_CHAIN walk to find out
10377 which field comes earlier. Walk chains of both
10378 fields, so that if field1 and field2 are close to each
10379 other in either order, it is found soon even for large
10380 sequences of zero sized fields. */
10383 {
10387 {
10390 }
10401 }
10402 }
10405 else
10407 }
10409 /* Output any pending elements which have become next.
10410 As we output elements, constructor_unfilled_{fields,index}
10411 advances, which may cause other elements to become next;
10412 if so, they too are output.
10414 If ALL is 0, we return when there are
10415 no more pending elements to output now.
10417 If ALL is 1, we output space as necessary so that
10418 we can output all the pending elements. */
10419 static void
10421 {
10423 tree next;
10425 retry:
10427 /* Look through the whole pending tree.
10428 If we find an element that should be output now,
10429 output it. Otherwise, set NEXT to the element
10430 that comes first among those still pending. */
10434 {
10436 {
10438 constructor_unfilled_index))
10442 braced_init_obstack);
10445 {
10446 /* Advance to the next smaller node. */
10449 else
10450 {
10451 /* We have reached the smallest node bigger than the
10452 current unfilled index. Fill the space first. */
10455 }
10456 }
10457 else
10458 {
10459 /* Advance to the next bigger node. */
10462 else
10463 {
10464 /* We have reached the biggest node in a subtree. Find
10465 the parent of it, which is the next bigger node. */
10471 {
10474 }
10475 }
10476 }
10477 }
10479 {
10480 /* If the current record is complete we are done. */
10490 braced_init_obstack);
10492 {
10493 /* Advance to the next smaller node. */
10496 else
10497 {
10498 /* We have reached the smallest node bigger than the
10499 current unfilled field. Fill the space first. */
10502 }
10503 }
10504 else
10505 {
10506 /* Advance to the next bigger node. */
10509 else
10510 {
10511 /* We have reached the biggest node in a subtree. Find
10512 the parent of it, which is the next bigger node. */
10519 {
10522 }
10523 }
10524 }
10525 }
10526 }
10528 /* Ordinarily return, but not if we want to output all
10529 and there are elements left. */
10533 /* If it's not incremental, just skip over the gap, so that after
10534 jumping to retry we will output the next successive element. */
10540 /* ELT now points to the node in the pending tree with the next
10541 initializer to output. */
10543 }
10544 \f
10545 /* Expression VALUE coincides with the start of type TYPE in a braced
10546 initializer. Return true if we should treat VALUE as initializing
10547 the first element of TYPE, false if we should treat it as initializing
10548 TYPE as a whole.
10550 If the initializer is clearly invalid, the question becomes:
10551 which choice gives the best error message? */
10553 static bool
10555 {
10565 /* GNU vectors can be initialized elementwise. However, treat any
10566 kind of vector value as initializing the vector type as a whole,
10567 regardless of whether the value is a GNU vector. Such initializers
10568 are valid if and only if they would have been valid in a non-braced
10569 initializer like:
10571 TYPE foo = VALUE;
10573 so recursing into the vector type would be at best confusing or at
10574 worst wrong. For example, when -flax-vector-conversions is in effect,
10575 it's possible to initialize a V8HI from a V4SI, even though the vectors
10576 have different element types and different numbers of elements. */
10584 }
10586 /* Add one non-braced element to the current constructor level.
10587 This adjusts the current position within the constructor's type.
10588 This may also start or terminate implicit levels
10589 to handle a partly-braced initializer.
10591 Once this has found the correct level for the new element,
10592 it calls output_init_element.
10594 IMPLICIT is true if value comes from pop_init_level (1),
10595 the new initializer has been merged with the existing one
10596 and thus no warnings should be emitted about overriding an
10597 existing initializer. */
10599 void
10602 {
10604 int string_flag
10615 /* Handle superfluous braces around string cst as in
10616 char x[] = {"foo"}; */
10618 && !was_designated
10622 {
10624 {
10627 }
10629 {
10632 }
10633 }
10636 {
10639 }
10641 /* Ignore elements of a brace group if it is entirely superfluous
10642 and has already been diagnosed, or if the type is erroneous. */
10646 /* Ignore elements of an initializer for a variable-size type.
10647 Those are diagnosed in the parser (empty initializer braces are OK). */
10657 OPT_Wdesignated_init,
10658 "positional initialization of field "
10661 /* If we've exhausted any levels that didn't have braces,
10662 pop them now. */
10664 {
10669 last_init_list_comma),
10673 && constructor_max_index
10675 constructor_index))
10678 last_init_list_comma),
10680 else
10682 }
10684 /* In the case of [LO ... HI] = VALUE, only evaluate VALUE once. */
10686 {
10687 /* If value is a compound literal and we'll be just using its
10688 content, don't put it into a SAVE_EXPR. */
10691 {
10694 {
10697 }
10702 }
10703 }
10706 {
10708 {
10709 tree fieldtype;
10713 {
10716 }
10723 /* Error for non-static initialization of a flexible array member. */
10725 && !require_constant_value
10728 {
10732 }
10734 /* Error for initialization of a flexible array member with
10735 a string constant if the structure is in an array. E.g.:
10736 struct S { int x; char y[]; };
10737 struct S s[] = { { 1, "foo" } };
10738 is invalid. */
10744 {
10749 {
10752 }
10754 {
10758 }
10759 }
10761 /* Accept a string constant to initialize a subarray. */
10767 /* Otherwise, if we have come to a subaggregate,
10768 and we don't have an element of its type, push into it. */
10771 {
10774 }
10777 {
10782 braced_init_obstack);
10784 }
10785 else
10786 /* Do the bookkeeping for an element that was
10787 directly output as a constructor. */
10788 {
10789 /* For a record, keep track of end position of last field. */
10791 constructor_bit_index
10796 /* If the current field was the first one not yet written out,
10797 it isn't now, so update. */
10799 {
10801 /* Skip any nameless bit fields. */
10803 && (DECL_UNNAMED_BIT_FIELD
10805 constructor_unfilled_fields =
10807 }
10808 }
10811 /* Skip any nameless bit fields at the beginning. */
10815 }
10817 {
10818 tree fieldtype;
10822 {
10826 }
10833 /* Warn that traditional C rejects initialization of unions.
10834 We skip the warning if the value is zero. This is done
10835 under the assumption that the zero initializer in user
10836 code appears conditioned on e.g. __STDC__ to avoid
10837 "missing initializer" warnings and relies on default
10838 initialization to zero in the traditional C case.
10839 We also skip the warning if the initializer is designated,
10840 again on the assumption that this must be conditional on
10841 __STDC__ anyway (and we've already complained about the
10842 member-designator already). */
10849 /* Accept a string constant to initialize a subarray. */
10855 /* Otherwise, if we have come to a subaggregate,
10856 and we don't have an element of its type, push into it. */
10859 {
10862 }
10865 {
10870 braced_init_obstack);
10872 }
10873 else
10874 /* Do the bookkeeping for an element that was
10875 directly output as a constructor. */
10876 {
10879 }
10882 }
10884 {
10888 /* Accept a string constant to initialize a subarray. */
10894 /* Otherwise, if we have come to a subaggregate,
10895 and we don't have an element of its type, push into it. */
10898 {
10901 }
10906 {
10910 }
10912 /* Now output the actual element. */
10914 {
10919 braced_init_obstack);
10921 }
10923 constructor_index
10928 /* If we are doing the bookkeeping for an element that was
10929 directly output as a constructor, we must update
10930 constructor_unfilled_index. */
10932 }
10934 {
10937 /* Do a basic check of initializer size. Note that vectors
10938 always have a fixed size derived from their type. */
10940 {
10944 }
10946 /* Now output the actual element. */
10948 {
10954 braced_init_obstack);
10955 }
10957 constructor_index
10962 /* If we are doing the bookkeeping for an element that was
10963 directly output as a constructor, we must update
10964 constructor_unfilled_index. */
10966 }
10968 /* Handle the sole element allowed in a braced initializer
10969 for a scalar variable. */
10972 {
10976 }
10977 else
10978 {
10983 braced_init_obstack);
10985 }
10987 /* Handle range initializers either at this level or anywhere higher
10988 in the designator stack. */
10990 {
10997 {
11001 braced_init_obstack,
11002 last_init_list_comma),
11004 }
11008 {
11012 braced_init_obstack,
11013 last_init_list_comma),
11015 }
11023 {
11027 {
11030 }
11039 }
11044 }
11047 }
11050 }
11051 \f
11052 /* Build a complete asm-statement, whose components are a CV_QUALIFIER
11053 (guaranteed to be 'volatile' or null) and ARGS (represented using
11054 an ASM_EXPR node). */
11055 tree
11057 {
11061 }
11063 /* Build an asm-expr, whose components are a STRING, some OUTPUTS,
11064 some INPUTS, and some CLOBBERS. The latter three may be NULL.
11065 SIMPLE indicates whether there was anything at all after the
11066 string in the asm expression -- asm("blah") and asm("blah" : )
11067 are subtly different. We use a ASM_EXPR node to represent this.
11068 LOC is the location of the asm, and IS_INLINE says whether this
11069 is asm inline. */
11070 tree
11073 {
11074 tree tail;
11075 tree args;
11088 /* Remove output conversions that change the type but not the mode. */
11090 {
11095 /* ??? Really, this should not be here. Users should be using a
11096 proper lvalue, dammit. But there's a long history of using casts
11097 in the output operands. In cases like longlong.h, this becomes a
11098 primitive form of typechecking -- if the cast can be removed, then
11099 the output operand had a type of the proper width; otherwise we'll
11100 get an error. Gross, but ... */
11118 {
11119 /* If the operand is going to end up in memory,
11120 mark it addressable. */
11126 {
11129 }
11130 }
11131 else
11135 }
11138 {
11139 tree input;
11146 {
11147 /* If the operand is going to end up in memory,
11148 mark it addressable. */
11150 {
11153 /* Strip the nops as we allow this case. FIXME, this really
11154 should be rejected or made deprecated. */
11158 }
11159 else
11160 {
11168 {
11171 }
11172 }
11173 }
11174 else
11178 }
11182 /* asm statements without outputs, including simple ones, are treated
11183 as volatile. */
11189 }
11190 \f
11191 /* Generate a goto statement to LABEL. LOC is the location of the
11192 GOTO. */
11194 tree
11196 {
11201 {
11206 }
11207 }
11209 /* Generate a computed goto statement to EXPR. LOC is the location of
11210 the GOTO. */
11212 tree
11214 {
11216 tree t;
11221 {
11225 }
11231 }
11233 /* Generate a C `return' statement. RETVAL is the expression for what
11234 to return, or a null pointer for `return;' with no value. LOC is
11235 the location of the return statement, or the location of the expression,
11236 if the statement has any. If ORIGTYPE is not NULL_TREE, it
11237 is the original type of RETVAL. */
11239 tree
11241 {
11246 /* Use the expansion point to handle cases such as returning NULL
11247 in a function returning void. */
11255 {
11259 {
11262 }
11268 }
11271 {
11275 {
11278 warned_here = pedwarn
11281 else
11282 warned_here = warning_at
11289 }
11290 }
11292 {
11296 warned_here = pedwarn
11299 else
11300 warned_here = pedwarn
11306 }
11307 else
11308 {
11313 tree inner;
11331 /* Strip any conversions, additions, and subtractions, and see if
11332 we are returning the address of a local variable. Warn if so. */
11334 {
11336 {
11337 CASE_CONVERT:
11345 /* If the second operand of the MINUS_EXPR has a pointer
11346 type (or is converted from it), this may be valid, so
11347 don't give a warning. */
11348 {
11361 }
11375 {
11379 else
11380 {
11385 }
11386 }
11391 }
11394 }
11401 }
11407 }
11408 \f
11410 /* The SWITCH_STMT being built. */
11411 tree switch_stmt;
11413 /* The original type of the testing expression, i.e. before the
11414 default conversion is applied. */
11415 tree orig_type;
11417 /* A splay-tree mapping the low element of a case range to the high
11418 element, or NULL_TREE if there is no high element. Used to
11419 determine whether or not a new case label duplicates an old case
11420 label. We need a tree, rather than simply a hash table, because
11421 of the GNU case range extension. */
11422 splay_tree cases;
11424 /* The bindings at the point of the switch. This is used for
11425 warnings crossing decls when branching to a case label. */
11428 /* Whether the switch includes any break statements. */
11431 /* The next node on the stack. */
11434 /* Remember whether the controlling expression had boolean type
11435 before integer promotions for the sake of -Wswitch-bool. */
11437 };
11439 /* A stack of the currently active switch statements. The innermost
11440 switch statement is on the top of the stack. There is no need to
11441 mark the stack for garbage collection because it is only active
11442 during the processing of the body of a function, and we never
11443 collect at that point. */
11447 /* Start a C switch statement, testing expression EXP. Return the new
11448 SWITCH_STMT. SWITCH_LOC is the location of the `switch'.
11449 SWITCH_COND_LOC is the location of the switch's condition.
11450 EXPLICIT_CAST_P is true if the expression EXP has an explicit cast. */
11452 tree
11454 location_t switch_cond_loc,
11456 {
11462 {
11466 {
11468 {
11471 }
11473 }
11474 else
11475 {
11479 /* Warn if the condition has boolean value. */
11485 /* Explicit cast to int suppresses this warning. */
11502 }
11503 }
11505 /* Add this new SWITCH_STMT to the stack. */
11518 }
11520 /* Process a case label at location LOC, with attributes ATTRS. */
11522 tree
11524 {
11528 {
11533 }
11536 {
11541 }
11544 {
11547 else
11550 }
11554 loc))
11563 }
11565 /* Finish the switch statement. TYPE is the original type of the
11566 controlling expression of the switch, or NULL_TREE. */
11568 void
11570 {
11572 location_t switch_location;
11576 /* Emit warnings as needed. */
11586 /* Pop the stack. */
11591 }
11592 \f
11593 /* Emit an if statement. IF_LOCUS is the location of the 'if'. COND,
11594 THEN_BLOCK and ELSE_BLOCK are expressions to be used; ELSE_BLOCK
11595 may be null. */
11597 void
11599 tree else_block)
11600 {
11601 tree stmt;
11606 }
11608 tree
11610 {
11611 /* In switch statements break is sometimes stylistically used after
11612 a return statement. This can lead to spurious warnings about
11613 control reaching the end of a non-void function when it is
11614 inlined. Note that we are calling block_may_fallthru with
11615 language specific tree nodes; this works because
11616 block_may_fallthru returns true when given something it does not
11617 understand. */
11622 {
11639 }
11640 else
11642 {
11655 }
11661 {
11662 /* The foreach expander produces low-level code using gotos instead
11663 of a structured loop construct. */
11666 }
11668 }
11670 /* A helper routine for c_process_expr_stmt and c_finish_stmt_expr. */
11672 static void
11674 {
11679 ;
11681 {
11685 }
11687 {
11691 {
11695 }
11703 }
11704 else
11706 }
11708 /* Process an expression as if it were a complete statement. Emit
11709 diagnostics, but do not call ADD_STMT. LOC is the location of the
11710 statement. */
11712 tree
11714 {
11715 tree exprv;
11730 /* If we're not processing a statement expression, warn about unused values.
11731 Warnings for statement expressions will be emitted later, once we figure
11732 out which is the result. */
11747 /* If the expression is not of a type to which we cannot assign a line
11748 number, wrap the thing in a no-op NOP_EXPR. */
11750 {
11753 }
11756 }
11758 /* Emit an expression as a statement. LOC is the location of the
11759 expression. */
11761 tree
11763 {
11766 else
11768 }
11770 /* Do the opposite and emit a statement as an expression. To begin,
11771 create a new binding level and return it. */
11773 tree
11775 {
11776 tree ret;
11778 /* We must force a BLOCK for this level so that, if it is not expanded
11779 later, there is a way to turn off the entire subtree of blocks that
11780 are contained in it. */
11785 ? NULL
11788 /* Mark the current statement list as belonging to a statement list. */
11792 }
11794 /* LOC is the location of the compound statement to which this body
11795 belongs. */
11797 tree
11799 {
11806 ? NULL
11809 /* Locate the last statement in BODY. See c_end_compound_stmt
11810 about always returning a BIND_EXPR. */
11814 continue_searching:
11816 {
11822 /* This can happen with degenerate cases like ({ }). No value. */
11826 /* If we're supposed to generate side effects warnings, process
11827 all of the statements except the last. */
11829 {
11832 {
11833 location_t tloc;
11838 }
11839 }
11842 }
11844 /* If the end of the list is exception related, then the list was split
11845 by a call to push_cleanup. Continue searching. */
11848 {
11852 }
11857 /* In the case that the BIND_EXPR is not necessary, return the
11858 expression out from inside it. */
11860 /* Skip nested debug stmts. */
11863 {
11864 /* Even if this looks constant, do not allow it in a constant
11865 expression. */
11867 /* Do not warn if the return value of a statement expression is
11868 unused. */
11871 }
11873 /* Extract the type of said expression. */
11876 /* If we're not returning a value at all, then the BIND_EXPR that
11877 we already have is a fine expression to return. */
11881 /* Now that we've located the expression containing the value, it seems
11882 silly to make voidify_wrapper_expr repeat the process. Create a
11883 temporary of the appropriate type and stick it in a TARGET_EXPR. */
11886 /* Unwrap a no-op NOP_EXPR as added by c_finish_expr_stmt. This avoids
11887 tree_expr_nonnegative_p giving up immediately. */
11896 {
11900 }
11901 }
11902 \f
11903 /* Begin and end compound statements. This is as simple as pushing
11904 and popping new statement lists from the tree. */
11906 tree
11908 {
11913 }
11915 /* End a compound statement. STMT is the statement. LOC is the
11916 location of the compound statement-- this is usually the location
11917 of the opening brace. */
11919 tree
11921 {
11925 {
11929 }
11934 /* If this compound statement is nested immediately inside a statement
11935 expression, then force a BIND_EXPR to be created. Otherwise we'll
11936 do the wrong thing for ({ { 1; } }) or ({ 1; { } }). In particular,
11937 STATEMENT_LISTs merge, and thus we can lose track of what statement
11938 was really last. */
11942 {
11946 }
11949 }
11951 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
11952 when the current scope is exited. EH_ONLY is true when this is not
11953 meant to apply to normal control flow transfer. */
11955 void
11957 {
11969 }
11970 \f
11971 /* Build a vector comparison of ARG0 and ARG1 using CODE opcode
11972 into a value of TYPE type. Comparison is done via VEC_COND_EXPR. */
11974 static tree
11977 {
11983 }
11985 /* Possibly warn about an address of OP never being NULL in a comparison
11986 operation CODE involving null. */
11988 static void
11990 {
11991 /* Prevent warnings issued for macro expansion. */
11998 {
11999 /* Allow casts to intptr_t to suppress the warning. */
12004 }
12007 {
12008 /* Allow a cast to void* to suppress the warning. */
12013 /* Adding any value to a null pointer, including zero, is undefined
12014 in C. This includes the expression &p[0] where p is the null
12015 pointer, although &p[0] will have been folded to p by this point
12016 and so not diagnosed. */
12019 "the comparison will always evaluate as %<false%> "
12021 op);
12022 else
12024 "the comparison will always evaluate as %<true%> "
12026 op);
12029 }
12038 {
12039 /* The address of either complex part may not be null. */
12042 "the comparison will always evaluate as %<false%> "
12044 op);
12045 else
12047 "the comparison will always evaluate as %<true%> "
12049 op);
12051 }
12053 /* Set to true in the loop below if OP dereferences is operand.
12054 In such a case the ultimate target need not be a decl for
12055 the null [in]equality test to be constant. */
12058 /* Get the outermost array or object, or member. */
12060 {
12062 {
12063 /* Get the member (its address is never null). */
12066 }
12068 /* Get the outer array/object to refer to in the warning. */
12071 }
12080 "the comparison will always evaluate as %<false%> "
12082 op);
12083 else
12085 "the comparison will always evaluate as %<true%> "
12087 op);
12091 }
12093 /* Build a binary-operation expression without default conversions.
12094 CODE is the kind of expression to build.
12095 LOCATION is the operator's location.
12096 This function differs from `build' in several ways:
12097 the data type of the result is computed and recorded in it,
12098 warnings are generated if arg data types are invalid,
12099 special handling for addition and subtraction of pointers is known,
12100 and some optimization is done (operations on narrow ints
12101 are done in the narrower type when that gives the same result).
12102 Constant folding is also done before the result is returned.
12104 Note that the operands will never have enumeral types, or function
12105 or array types, because either they will have the default conversions
12106 performed or they have both just been converted to some other type in which
12107 the arithmetic is to be done. */
12109 tree
12112 {
12114 tree eptype;
12122 /* Expression code to give to the expression when it is built.
12123 Normally this is CODE, which is what the caller asked for,
12124 but in some special cases we change it. */
12127 /* Data type in which the computation is to be performed.
12128 In the simplest cases this is the common type of the arguments. */
12131 /* When the computation is in excess precision, the type of the
12132 final EXCESS_PRECISION_EXPR. */
12135 /* Nonzero means operands have already been type-converted
12136 in whatever way is necessary.
12137 Zero means they need to be converted to RESULT_TYPE. */
12140 /* Nonzero means create the expression with this type, rather than
12141 RESULT_TYPE. */
12144 /* Nonzero means after finally constructing the expression
12145 convert it to this type. */
12148 /* Nonzero if this is an operation like MIN or MAX which can
12149 safely be computed in short if both args are promoted shorts.
12150 Also implies COMMON.
12151 -1 indicates a bitwise operation; this makes a difference
12152 in the exact conditions for when it is safe to do the operation
12153 in a narrower mode. */
12156 /* Nonzero if this is a comparison operation;
12157 if both args are promoted shorts, compare the original shorts.
12158 Also implies COMMON. */
12161 /* Nonzero if this is a right-shift operation, which can be computed on the
12162 original short and then promoted if the operand is a promoted short. */
12165 /* Nonzero means set RESULT_TYPE to the common type of the args. */
12168 /* True means types are compatible as far as ObjC is concerned. */
12171 /* True means this is an arithmetic operation that may need excess
12172 precision. */
12175 /* True means this is a boolean operation that converts both its
12176 operands to truth-values. */
12179 /* Remember whether we're doing / or %. */
12182 /* Remember whether we're doing << or >>. */
12185 /* Tree holding instrumentation expression. */
12202 {
12205 int_const = (int_const_or_overflow
12208 }
12209 else
12212 /* Do not apply default conversion in mixed vector/scalar expression. */
12215 {
12218 }
12224 /* The expression codes of the data types of the arguments tell us
12225 whether the arguments are integers, floating, pointers, etc. */
12229 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
12233 /* If an error was already reported for one of the arguments,
12234 avoid reporting another error. */
12249 {
12252 }
12255 {
12273 /* Excess precision for implicit conversions of integers to
12274 floating point in C11 and later. */
12275 may_need_excess_precision = (flag_isoc11
12283 }
12285 {
12288 }
12291 {
12294 }
12296 {
12299 }
12302 {
12305 }
12309 /* In case when one of the operands of the binary operation is
12310 a vector and another is a scalar -- convert scalar to vector. */
12313 {
12318 {
12322 {
12324 tree sc;
12335 }
12337 {
12339 tree sc;
12350 }
12353 }
12354 }
12357 {
12359 /* Handle the pointer + int case. */
12361 {
12364 }
12366 {
12369 }
12370 else
12375 /* Subtraction of two similar pointers.
12376 We must subtract them as integers, then divide by object size. */
12379 {
12382 }
12383 /* Handle pointer minus int. Just like pointer plus int. */
12385 {
12388 }
12389 else
12413 {
12424 else
12425 /* Although it would be tempting to shorten always here, that
12426 loses on some targets, since the modulo instruction is
12427 undefined if the quotient can't be represented in the
12428 computation mode. We shorten only if unsigned or if
12429 dividing by something we know != -1. */
12432 }
12440 /* Allow vector types which are not floating point types. */
12459 {
12460 /* Although it would be tempting to shorten always here, that loses
12461 on some targets, since the modulo instruction is undefined if the
12462 quotient can't be represented in the computation mode. We shorten
12463 only if unsigned or if dividing by something we know != -1. */
12466 }
12480 {
12481 /* Result of these operations is always an int,
12482 but that does not mean the operands should be
12483 converted to ints! */
12486 {
12489 }
12490 else
12493 {
12496 }
12497 else
12501 }
12503 {
12504 int_const_or_overflow = (int_operands
12508 int_const = (int_const_or_overflow
12512 }
12514 {
12515 int_const_or_overflow = (int_operands
12519 int_const = (int_const_or_overflow
12523 }
12526 /* Shift operations: result has same type as first operand;
12527 always convert second operand to int.
12528 Also set SHORT_SHIFT if shifting rightward. */
12537 {
12540 }
12545 {
12548 {
12550 {
12555 }
12557 {
12561 {
12566 }
12567 }
12568 else
12569 {
12574 {
12579 }
12580 }
12581 }
12583 /* Use the type of the value to be shifted. */
12585 /* Avoid converting op1 to result_type later. */
12587 }
12597 {
12600 }
12605 {
12610 {
12611 /* Don't reject a left shift of a negative value in a context
12612 where a constant expression is needed in C90. */
12618 }
12620 {
12622 {
12627 }
12629 {
12633 {
12638 }
12639 }
12641 {
12646 }
12651 }
12653 /* Use the type of the value to be shifted. */
12655 /* Avoid converting op1 to result_type later. */
12657 }
12663 {
12664 tree intt;
12666 {
12670 }
12674 {
12678 }
12680 /* It's not precisely specified how the usual arithmetic
12681 conversions apply to the vector types. Here, we use
12682 the unsigned type if one of the operands is signed and
12683 the other one is unsigned. */
12685 {
12688 else
12692 }
12694 /* Always construct signed integer vector type. */
12696 (SCALAR_TYPE_MODE
12699 {
12704 }
12710 }
12713 OPT_Wfloat_equal,
12715 /* Result of comparison is always int,
12716 but don't convert the args to int! */
12726 {
12729 }
12733 {
12736 }
12738 {
12745 /* Anything compares with void *. void * compares with anything.
12746 Otherwise, the targets must be compatible
12747 and both must be object or both incomplete. */
12751 {
12755 }
12757 {
12761 }
12763 {
12767 }
12768 else
12769 /* Avoid warning about the volatile ObjC EH puts on decls. */
12775 {
12777 result_type = build_pointer_type
12779 }
12780 }
12782 {
12785 }
12787 {
12790 }
12791 /* 6.5.9: One of the following shall hold:
12792 -- both operands have type nullptr_t; */
12794 {
12796 /* No need to convert the operands to result_type later. */
12798 }
12799 /* -- one operand has type nullptr_t and the other is a null pointer
12800 constant. We will have to convert the former to the type of the
12801 latter, because during gimplification we can't have mismatching
12802 comparison operand type. We convert from nullptr_t to the other
12803 type, since only nullptr_t can be converted to nullptr_t. Also,
12804 even a constant 0 is a null pointer constant, so we may have to
12805 create a pointer type from its type. */
12824 {
12825 tree intt;
12827 {
12831 }
12835 {
12839 }
12841 /* It's not precisely specified how the usual arithmetic
12842 conversions apply to the vector types. Here, we use
12843 the unsigned type if one of the operands is signed and
12844 the other one is unsigned. */
12846 {
12849 else
12853 }
12855 /* Always construct signed integer vector type. */
12857 (SCALAR_TYPE_MODE
12860 {
12865 }
12871 }
12879 {
12882 addr_space_t as_common;
12885 {
12899 }
12901 {
12905 }
12906 else
12907 {
12909 result_type = build_pointer_type
12913 }
12914 }
12916 {
12924 }
12926 {
12934 }
12936 {
12939 }
12941 {
12944 }
12949 {
12955 }
12966 /* Used for OpenMP atomics. */
12973 }
12982 {
12984 maybe_range_label_for_tree_type_mismatch
12991 }
12996 &&
13000 {
13006 {
13009 "implicit conversion from %qT to %qT "
13010 "to match other operand of binary "
13012 location);
13015 }
13024 {
13025 /* An operation on mixed real/complex operands must be
13026 handled specially, but the language-independent code can
13027 more easily optimize the plain complex arithmetic if
13028 -fno-signed-zeros. */
13032 {
13035 }
13037 {
13042 }
13043 else
13044 {
13049 }
13053 {
13060 {
13065 /* Fall through. */
13072 }
13073 }
13074 else
13075 {
13082 {
13086 /* Fall through. */
13096 }
13097 }
13100 }
13102 /* For certain operations (which identify themselves by shorten != 0)
13103 if both args were extended from the same smaller type,
13104 do the arithmetic in that type and then extend.
13106 shorten !=0 and !=1 indicates a bitwise operation.
13107 For them, this optimization is safe only if
13108 both args are zero-extended or both are sign-extended.
13109 Otherwise, we might change the result.
13110 Eg, (short)-1 | (unsigned short)-1 is (int)-1
13111 but calculated in (unsigned short) it would be (unsigned short)-1. */
13114 {
13118 }
13120 /* Shifts can be shortened if shifting right. */
13123 {
13134 /* We can shorten only if the shift count is less than the
13135 number of bits in the smaller type size. */
13137 /* We cannot drop an unsigned shift after sign-extension. */
13139 {
13140 /* Do an unsigned shift if the operand was zero-extended. */
13141 result_type
13144 /* Convert value-to-be-shifted to that type. */
13148 }
13149 }
13151 /* Comparison operations are shortened too but differently.
13152 They identify themselves by setting short_compare = 1. */
13155 {
13156 /* Don't write &op0, etc., because that would prevent op0
13157 from being kept in a register.
13158 Instead, make copies of the our local variables and
13159 pass the copies by reference, then copy them back afterward. */
13162 tree val
13167 {
13170 }
13177 {
13183 {
13186 }
13187 else
13188 {
13189 /* Fold for the sake of possible warnings, as in
13190 build_conditional_expr. This requires the
13191 "original" values to be folded, not just op0 and
13192 op1. */
13193 c_inhibit_evaluation_warnings++;
13198 c_inhibit_evaluation_warnings--;
13200 require_constant_value,
13201 NULL);
13203 require_constant_value,
13204 NULL);
13205 }
13212 {
13217 }
13218 }
13219 }
13220 }
13222 /* At this point, RESULT_TYPE must be nonzero to avoid an error message.
13223 If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
13224 Then the expression will be built.
13225 It will be given type FINAL_TYPE if that is nonzero;
13226 otherwise, it will be given type RESULT_TYPE. */
13229 {
13230 /* Favor showing any expression locations that are available. */
13235 }
13238 {
13242 {
13245 }
13246 }
13249 {
13251 semantic_result_type);
13253 semantic_result_type);
13255 /* This can happen if one operand has a vector type, and the other
13256 has a different type. */
13259 }
13262 | SANITIZE_DIVIDE
13263 | SANITIZE_FLOAT_DIVIDE
13268 {
13269 /* OP0 and/or OP1 might have side-effects. */
13275 | SANITIZE_FLOAT_DIVIDE
13280 }
13282 /* Treat expressions in initializers specially as they can't trap. */
13284 ret = (require_constant_value
13288 else
13293 return_build_binary_op:
13296 ret = (int_operands
13313 }
13316 /* Convert EXPR to be a truth-value, validating its type for this
13317 purpose. LOCATION is the source location for the expression. */
13319 tree
13321 {
13325 {
13327 error_at (location, "used array that cannot be converted to pointer where scalar is required");
13356 }
13361 {
13366 }
13367 else
13368 /* ??? Should we also give an error for vectors rather than leaving
13369 those to give errors later? */
13373 {
13376 else
13378 }
13382 }
13383 \f
13385 /* Convert EXPR to a contained DECL, updating *TC, *TI and *SE as
13386 required. */
13388 tree
13390 {
13392 {
13394 /* Executing a compound literal inside a function reinitializes
13395 it. */
13399 }
13400 else
13402 }
13403 \f
13404 /* Generate OMP construct CODE, with BODY and CLAUSES as its compound
13405 statement. LOC is the location of the construct. */
13407 tree
13409 tree clauses)
13410 {
13420 }
13422 /* Generate OACC_DATA, with CLAUSES and BLOCK as its compound
13423 statement. LOC is the location of the OACC_DATA. */
13425 tree
13427 {
13428 tree stmt;
13439 }
13441 /* Generate OACC_HOST_DATA, with CLAUSES and BLOCK as its compound
13442 statement. LOC is the location of the OACC_HOST_DATA. */
13444 tree
13446 {
13447 tree stmt;
13458 }
13460 /* Like c_begin_compound_stmt, except force the retention of the BLOCK. */
13462 tree
13464 {
13465 tree block;
13471 }
13473 /* Generate OMP_PARALLEL, with CLAUSES and BLOCK as its compound
13474 statement. LOC is the location of the OMP_PARALLEL. */
13476 tree
13478 {
13479 tree stmt;
13490 }
13492 /* Like c_begin_compound_stmt, except force the retention of the BLOCK. */
13494 tree
13496 {
13497 tree block;
13503 }
13505 /* Generate OMP_TASK, with CLAUSES and BLOCK as its compound
13506 statement. LOC is the location of the #pragma. */
13508 tree
13510 {
13511 tree stmt;
13522 }
13524 /* Generate GOMP_cancel call for #pragma omp cancel. */
13526 void
13528 {
13539 else
13540 {
13542 "%<parallel%>, %<for%>, %<sections%> or %<taskgroup%> "
13545 }
13548 {
13553 else
13554 {
13557 {
13563 }
13564 }
13570 }
13571 else
13575 ifc);
13577 }
13579 /* Generate GOMP_cancellation_point call for
13580 #pragma omp cancellation point. */
13582 void
13584 {
13595 else
13596 {
13598 "%<parallel%>, %<for%>, %<sections%> or %<taskgroup%> "
13601 }
13605 }
13607 /* Helper function for handle_omp_array_sections. Called recursively
13608 to handle multiple array-section-subscripts. C is the clause,
13609 T current expression (initially OMP_CLAUSE_DECL), which is either
13610 a TREE_LIST for array-section-subscript (TREE_PURPOSE is low-bound
13611 expression if specified, TREE_VALUE length expression if specified,
13612 TREE_CHAIN is what it has been specified after, or some decl.
13613 TYPES vector is populated with array section types, MAYBE_ZERO_LEN
13614 set to true if any of the array-section-subscript could have length
13615 of zero (explicit or implicit), FIRST_NON_ONE is the index of the
13616 first array-section-subscript which is known not to have length
13617 of one. Given say:
13618 map(a[:b][2:1][:c][:2][:d][e:f][2:5])
13619 FIRST_NON_ONE will be 3, array-section-subscript [:b], [2:1] and [:c]
13620 all are or may have length of 1, array-section-subscript [:2] is the
13621 first one known not to have length 1. For array-section-subscript
13622 <= FIRST_NON_ONE we diagnose non-contiguous arrays if low bound isn't
13623 0 or length isn't the array domain max + 1, for > FIRST_NON_ONE we
13624 can if MAYBE_ZERO_LEN is false. MAYBE_ZERO_LEN will be true in the above
13625 case though, as some lengths could be zero. */
13627 static tree
13631 {
13634 {
13641 {
13645 }
13647 {
13652 }
13654 {
13657 }
13662 {
13664 {
13669 }
13671 {
13673 {
13677 }
13682 {
13687 }
13689 {
13694 else
13696 }
13697 }
13698 }
13700 {
13705 else
13710 }
13714 {
13718 }
13723 {
13728 }
13733 {
13734 /* If the array section is pointer based and the pointer
13735 itself is _Atomic qualified, we need to atomically load
13736 the pointer. */
13737 c_expr expr;
13743 }
13745 }
13760 {
13763 low_bound);
13765 }
13767 {
13770 length);
13772 }
13788 {
13790 {
13795 }
13796 }
13798 {
13800 {
13806 {
13808 {
13813 }
13814 }
13815 else
13817 }
13820 first_non_one++;
13821 }
13823 {
13827 {
13829 "for unknown bound array type length expression must "
13832 }
13835 {
13840 }
13844 {
13849 }
13854 {
13855 tree size
13859 {
13861 {
13863 "low bound %qE above array section size "
13867 }
13869 {
13875 {
13880 }
13882 }
13885 && tree_int_cst_equal
13887 low_bound))
13888 first_non_one++;
13889 }
13891 {
13899 first_non_one++;
13900 }
13902 {
13904 {
13906 "length %qE above array section size "
13910 }
13912 {
13913 tree lbpluslen
13919 {
13921 "high bound %qE above array section size "
13925 }
13926 }
13927 }
13928 }
13930 {
13938 first_non_one++;
13939 }
13941 /* For [lb:] we will need to evaluate lb more than once. */
13943 {
13946 {
13949 }
13950 }
13951 }
13953 {
13955 {
13958 "for array function parameter length expression "
13960 else
13964 }
13968 {
13973 }
13974 /* If there is a pointer type anywhere but in the very first
13975 array-section-subscript, the array section could be non-contiguous. */
13979 {
13980 /* If any prior dimension has a non-one length, then deem this
13981 array section as non-contiguous. */
13984 {
13987 {
13992 }
13993 }
13994 }
13995 }
13996 else
13997 {
14001 }
14004 /* We will need to evaluate lb more than once. */
14007 {
14010 }
14013 }
14015 /* Handle array sections for clause C. */
14017 static bool
14019 {
14032 ort);
14039 {
14042 /* Need to evaluate side effects in the length expressions
14043 if any. */
14045 {
14047 {
14050 else
14053 }
14055 }
14060 }
14061 else
14062 {
14072 {
14076 i--;
14090 {
14099 {
14100 tree size;
14103 size_one_node);
14105 {
14106 do_warn_noncontiguous:
14108 "array section is not contiguous in %qs "
14112 }
14113 }
14116 {
14119 else
14123 }
14124 }
14125 else
14126 {
14127 tree l;
14137 else
14138 {
14141 size_one_node);
14144 }
14146 {
14148 size_zero_node);
14151 else
14154 }
14156 {
14164 {
14167 {
14172 }
14175 }
14180 }
14181 else
14183 }
14184 }
14190 {
14213 else
14214 {
14219 }
14222 }
14236 {
14255 }
14259 else
14279 }
14281 }
14283 /* Helper function of finish_omp_clauses. Clone STMT as if we were making
14284 an inline call. But, remap
14285 the OMP_DECL1 VAR_DECL (omp_out resp. omp_orig) to PLACEHOLDER
14286 and OMP_DECL2 VAR_DECL (omp_in resp. omp_priv) to DECL. */
14288 static tree
14291 {
14292 copy_body_data id;
14310 }
14312 /* Helper function of c_finish_omp_clauses, called via walk_tree.
14313 Find OMP_CLAUSE_PLACEHOLDER (passed in DATA) in *TP. */
14315 static tree
14317 {
14321 }
14323 /* Similarly, but also walk aggregate fields. */
14327 static tree
14329 {
14333 {
14334 tree field;
14340 {
14349 pset);
14355 }
14356 }
14361 }
14363 /* Finish OpenMP iterators ITER. Return true if they are errorneous
14364 and clauses containing them should be removed. */
14366 static bool
14368 {
14371 {
14376 tree orig_step;
14380 {
14383 }
14385 {
14387 var);
14390 }
14392 {
14396 }
14398 {
14402 }
14405 {
14408 }
14410 {
14415 }
14422 {
14429 }
14431 {
14435 }
14441 {
14444 }
14446 tree it2;
14448 {
14457 {
14462 }
14464 {
14468 }
14470 {
14474 }
14476 {
14480 }
14481 }
14483 {
14486 }
14491 }
14493 }
14495 /* Ensure that pointers are used in OpenACC attach and detach clauses.
14496 Return true if an error has been detected. */
14498 static bool
14500 {
14504 /* OpenACC attach / detach clauses must be pointers. */
14507 {
14514 {
14518 }
14519 }
14522 }
14524 /* For all elements of CLAUSES, validate them against their constraints.
14525 Remove any elements from the list that are invalid. */
14527 tree
14529 {
14549 /* 1 if normal/task reduction has been seen, -1 if inscan reduction
14550 has been seen, -2 if mixed inscan/normal reduction diagnosed. */
14561 /* If ort == C_ORT_OMP_DECLARE_SIMD used as uniform_head instead. */
14565 /* If ort == C_ORT_OMP used as nontemporal_head or use_device_xxx_head
14566 instead and for ort == C_ORT_OMP_TARGET used as in_reduction_head. */
14573 {
14576 }
14581 {
14586 /* We've reached the end of a list of expanded nodes. Reset the group
14587 start pointer. */
14592 {
14608 {
14610 "%<inscan%> and non-%<inscan%> %<reduction%> clauses "
14613 }
14614 /* FALLTHRU */
14620 {
14622 {
14625 }
14630 {
14632 "%<inscan%> %<reduction%> clause with array "
14636 }
14637 }
14640 {
14643 }
14650 {
14656 {
14659 t);
14662 }
14666 {
14669 t);
14672 }
14677 index_type);
14684 }
14686 {
14691 }
14694 {
14695 /* Disallow zero sized or potentially zero sized task
14696 reductions. */
14698 {
14704 }
14706 {
14712 }
14713 }
14717 {
14722 {
14748 }
14750 {
14756 }
14757 }
14759 {
14764 }
14766 {
14776 {
14782 }
14792 decl_placeholder ? decl_placeholder
14800 {
14812 decl_placeholder ? decl_placeholder
14815 {
14820 }
14822 c_find_omp_placeholder_r,
14825 }
14826 else
14827 {
14828 tree init;
14832 else
14836 }
14842 }
14844 {
14848 {
14853 }
14859 }
14865 {
14867 "%<nowait%> clause must not be used together "
14871 }
14877 {
14882 }
14892 {
14894 "modifier should not be specified in %<linear%> "
14895 "clause on %<simd%> or %<for%> constructs when not "
14898 }
14901 {
14903 "linear clause applied to non-integral non-pointer "
14907 }
14909 {
14914 }
14916 {
14919 {
14921 /* map_head bitmap is used as uniform_head if
14922 declare_simd. */
14926 }
14928 {
14930 "%<linear%> clause step %qE is neither constant "
14934 }
14935 }
14937 {
14943 fold_convert
14948 }
14949 else
14954 check_dup_generic:
14956 check_dup_generic_t:
14958 {
14963 }
14972 {
14976 {
14978 "%qD appears more than once in data-sharing "
14982 }
14986 {
14988 ort == C_ORT_ACC
14991 t);
14993 }
14994 else
14996 }
15001 {
15005 }
15010 {
15014 else
15018 }
15019 else
15025 {
15026 move_implicit:
15028 /* Move firstprivate and map clauses with
15029 OMP_CLAUSE_{FIRSTPRIVATE,MAP}_IMPLICIT set to the end of
15030 clauses chain. */
15036 {
15040 }
15043 {
15047 }
15048 else
15054 }
15059 {
15063 }
15071 {
15075 }
15077 {
15084 else
15088 }
15089 else
15098 {
15102 }
15105 {
15109 }
15110 else
15117 {
15121 }
15124 {
15126 "%qE in %<aligned%> clause is neither a pointer nor "
15129 }
15131 {
15136 }
15138 {
15141 t);
15143 }
15144 else
15151 {
15155 }
15157 {
15159 "%qE appears more than once in %<nontemporal%> "
15162 }
15163 else
15170 {
15174 }
15176 {
15179 t);
15181 }
15182 else
15183 {
15187 }
15195 {
15198 {
15201 {
15209 sizetype,
15213 {
15216 }
15218 }
15219 }
15221 }
15229 {
15231 last_iterators_remove
15237 }
15238 else
15241 {
15246 {
15248 "%<depend%> clause with %<depobj%> dependence "
15251 }
15253 }
15258 {
15261 {
15263 "%<omp_all_memory%> used with %<depend%> kind "
15266 }
15267 }
15269 {
15271 "%qE is not lvalue expression nor array section in "
15275 }
15278 {
15285 }
15288 {
15290 {
15292 "%qE does not have %<omp_depend_t%> type in "
15293 "%<depend%> clause with %<depobj%> dependence "
15296 }
15297 }
15300 {
15302 "%qE should not have %<omp_depend_t%> type in "
15303 "%<depend%> clause with dependence type other than "
15306 }
15308 {
15311 else
15312 {
15316 {
15319 }
15321 RO_UNARY_STAR);
15323 {
15326 }
15327 }
15333 else
15335 }
15341 /* FALLTHRU */
15347 {
15353 else
15354 {
15357 {
15359 "array section does not have mappable type "
15363 }
15365 {
15370 }
15375 {
15376 do
15377 {
15381 {
15386 }
15387 }
15397 {
15400 }
15404 {
15407 "%qD appears more than once in motion "
15411 "%qD appears more than once in data "
15413 else
15415 "%qD appears more than once in map "
15418 }
15419 else
15420 {
15423 }
15424 }
15425 }
15431 /* In this case, we have a single array element which is a
15432 pointer, and we already set OMP_CLAUSE_SIZE in
15433 handle_omp_array_sections above. For attach/detach clauses,
15434 reset the OMP_CLAUSE_SIZE (representing a bias) to zero
15435 here. */
15438 }
15440 {
15443 }
15444 /* OpenACC attach / detach clauses must be pointers. */
15446 {
15449 }
15453 /* For attach/detach clauses, set OMP_CLAUSE_SIZE (representing a
15454 bias) to zero here, so it is not set erroneously to the pointer
15455 size later on in gimplify.cc. */
15459 {
15464 }
15466 {
15469 }
15475 {
15481 }
15485 {
15487 {
15492 }
15494 {
15499 }
15501 {
15506 }
15508 {
15511 {
15516 }
15519 {
15524 else
15526 }
15530 {
15535 }
15536 }
15540 {
15545 }
15546 }
15548 {
15553 }
15555 {
15560 }
15564 && !indir_component_ref_p
15575 {
15580 }
15584 {
15589 }
15598 {
15602 {
15606 }
15609 {
15613 else
15617 }
15618 else
15620 }
15623 {
15630 else
15634 }
15637 {
15641 }
15644 {
15648 else
15652 }
15653 else
15654 {
15659 }
15672 ;
15674 {
15677 "%qE is neither a variable nor a function name in "
15679 else
15683 }
15685 {
15688 cname);
15690 }
15692 {
15695 cname);
15697 }
15701 {
15703 "%qE appears more than once on the same "
15706 }
15707 else
15714 {
15718 else
15723 }
15724 /* map_head bitmap is used as uniform_head if declare_simd. */
15734 {
15737 {
15742 }
15744 {
15749 }
15750 }
15756 {
15759 else
15760 {
15764 }
15765 }
15779 {
15781 "%<nowait%> clause must not be used together "
15785 }
15792 {
15794 "%<order%> clause must not be used together "
15798 }
15800 {
15801 /* Silently remove duplicates. */
15804 }
15812 {
15818 }
15885 {
15887 "%<order%> clause must not be used together "
15891 }
15907 {
15909 "%<inbranch%> clause is incompatible with "
15913 }
15924 {
15929 }
15934 }
15937 {
15941 {
15945 }
15948 {
15954 {
15961 /* The __func__ variable and similar function-local
15962 predefined variables may be listed in a shared or
15963 firstprivate clause. */
15972 }
15974 {
15980 }
15984 {
15986 "%<const%> qualified %qE may appear only in "
15989 }
15990 }
15991 }
15994 {
15996 {
15997 /* If we found a clause to remove, we want to remove the whole
15998 expanded group, otherwise gimplify
15999 (omp_resolve_clause_dependencies) can get confused. */
16003 }
16004 else
16006 }
16007 else
16009 }
16012 && safelen
16015 {
16017 "%<simdlen%> clause value is bigger than "
16021 }
16024 && schedule_clause
16027 {
16029 "%<nonmonotonic%> schedule modifier specified together "
16035 }
16038 {
16040 "%qs clause specified together with %<inscan%> "
16043 }
16046 {
16048 "%qs clause specified together with %<inscan%> "
16051 }
16055 || allocate_seen
16058 {
16062 {
16067 {
16077 }
16078 /* FALLTHRU */
16089 }
16094 {
16096 "%<linear%> clause step is a parameter %qD not "
16100 }
16106 {
16117 }
16121 else
16123 }
16127 {
16132 {
16134 "%qD specified in %<allocate%> clause but not in "
16137 }
16140 else
16142 }
16145 {
16147 "%<nogroup%> clause must not be used together with "
16150 }
16153 {
16155 {
16157 "%<detach%> clause must not be used together with "
16160 }
16161 else
16162 {
16166 {
16173 {
16175 "the event handle of a %<detach%> clause "
16178 }
16181 else
16183 }
16184 }
16185 }
16189 }
16191 /* Return code to initialize DST with a copy constructor from SRC.
16192 C doesn't have copy constructors nor assignment operators, only for
16193 _Atomic vars we need to perform __atomic_load from src into a temporary
16194 followed by __atomic_store of the temporary to dst. */
16196 tree
16198 {
16213 /* Expansion of a generic atomic load may require an addition
16214 element, so allocate enough to prevent a resize. */
16217 /* Build __atomic_load (&src, &tmp, SEQ_CST); */
16226 /* Build __atomic_store (&dst, &tmp, SEQ_CST); */
16233 }
16235 /* Create a transaction node. */
16237 tree
16239 {
16246 }
16248 /* Make a variant type in the proper way for C/C++, propagating qualifiers
16249 down to the element type of an array. If ORIG_QUAL_TYPE is not
16250 NULL, then it should be used as the qualified type
16251 ORIG_QUAL_INDIRECT levels down in array type derivation (to
16252 preserve information about the typedef name from which an array
16253 type was derived). */
16255 tree
16258 {
16263 {
16264 tree t;
16269 /* See if we already have an identically qualified type. */
16272 else
16274 {
16281 }
16283 {
16294 {
16295 tree unqualified_canon
16300 {
16301 unqualified_canon
16304 }
16307 }
16308 else
16310 }
16312 }
16314 /* A restrict-qualified pointer type must be a pointer to object or
16315 incomplete type. Note that the use of POINTER_TYPE_P also allows
16316 REFERENCE_TYPEs, which is appropriate for C++. */
16320 {
16323 }
16326 ? orig_qual_type
16328 /* A variant type does not inherit the list of incomplete vars from the
16329 type main variant. */
16335 }
16337 /* Build a VA_ARG_EXPR for the C parser. */
16339 tree
16341 {
16344 /* VA_ARG_EXPR cannot be used for a scalar va_list with reverse storage
16345 order because it takes the address of the expression. */
16348 {
16351 }
16353 {
16357 }
16359 {
16361 type);
16363 }
16368 }
16370 /* Return truthvalue of whether T1 is the same tree structure as T2.
16371 Return 1 if they are the same. Return false if they are different. */
16373 bool
16375 {
16390 /* They might have become equal now. */
16401 {
16425 /* We need to do this when determining whether or not two
16426 non-type pointer to member function template arguments
16427 are the same. */
16431 {
16435 {
16440 }
16441 }
16455 {
16470 }
16473 {
16477 /* Special case: if either target is an unallocated VAR_DECL,
16478 it means that it's going to be unified with whatever the
16479 TARGET_EXPR is really supposed to initialize, so treat it
16480 as being equivalent to anything. */
16491 }
16508 {
16517 }
16519 CASE_CONVERT:
16526 }
16529 {
16537 {
16541 {
16553 }
16564 }
16570 }
16571 }
16573 /* Returns true when the function declaration FNDECL is implicit,
16574 introduced as a result of a call to an otherwise undeclared
16575 function, and false otherwise. */
16577 bool
16579 {
16581 }