| blob | 45bacc06c474f75144386c387cbd59d70fbaf37d |
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 {
1273 different_types_p);
1275 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'. */
1350 /* Determine whether two trees derive from the same translation unit.
1351 If the CONTEXT chain ends in a null, that tree's context is still
1352 being parsed, so if two trees have context chains ending in null,
1353 they're in the same translation unit. */
1355 bool
1357 {
1360 {
1368 }
1372 {
1380 }
1383 }
1385 /* Allocate the seen two types, assuming that they are compatible. */
1389 {
1397 /* The C standard says that two structures in different translation
1398 units are compatible with each other only if the types of their
1399 fields are compatible (among other things). We assume that they
1400 are compatible until proven otherwise when building the cache.
1401 An example where this can occur is:
1402 struct a
1403 {
1404 struct a *next;
1405 };
1406 If we are comparing this against a similar struct in another TU,
1407 and did not assume they were compatible, we end up with an infinite
1408 loop. */
1411 }
1413 /* Free the seen types until we get to TU_TIL. */
1415 static void
1417 {
1420 {
1425 }
1427 }
1429 /* Return 1 if two 'struct', 'union', or 'enum' types T1 and T2 are
1430 compatible. If the two types are not the same (which has been
1431 checked earlier), this can only happen when multiple translation
1432 units are being compiled. See C99 6.2.7 paragraph 1 for the exact
1433 rules. ENUM_AND_INT_P and DIFFERENT_TYPES_P are as in
1434 comptypes_internal. */
1436 static int
1439 {
1443 /* We have to verify that the tags of the types are the same. This
1444 is harder than it looks because this may be a typedef, so we have
1445 to go look at the original type. It may even be a typedef of a
1446 typedef...
1447 In the case of compiler-created builtin structs the TYPE_DECL
1448 may be a dummy, with no DECL_ORIGINAL_TYPE. Don't fault. */
1459 /* C90 didn't have the requirement that the two tags be the same. */
1463 /* C90 didn't say what happened if one or both of the types were
1464 incomplete; we choose to follow C99 rules here, which is that they
1465 are compatible. */
1470 {
1475 }
1478 {
1480 {
1482 /* Speed up the case where the type values are in the same order. */
1487 {
1489 }
1492 {
1496 {
1499 }
1500 }
1503 {
1505 }
1507 {
1510 }
1513 {
1516 }
1519 {
1523 {
1526 }
1527 }
1529 }
1532 {
1535 {
1538 }
1540 /* Speed up the common case where the fields are in the same order. */
1543 {
1554 {
1557 }
1564 {
1567 }
1568 }
1570 {
1573 }
1576 {
1581 {
1585 enum_and_int_p,
1586 different_types_p);
1591 {
1594 }
1605 }
1607 {
1610 }
1611 }
1614 }
1617 {
1623 {
1639 }
1642 else
1645 }
1649 }
1650 }
1652 /* Return 1 if two function types F1 and F2 are compatible.
1653 If either type specifies no argument types,
1654 the other must specify a fixed number of self-promoting arg types.
1655 Otherwise, if one type specifies only the number of arguments,
1656 the other must specify that number of self-promoting arg types.
1657 Otherwise, the argument types must match.
1658 ENUM_AND_INT_P and DIFFERENT_TYPES_P are as in comptypes_internal. */
1660 static int
1663 {
1665 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1673 /* 'volatile' qualifiers on a function's return type used to mean
1674 the function is noreturn. */
1694 /* An unspecified parmlist matches any specified parmlist
1695 whose argument types don't need default promotions. */
1698 {
1703 /* If one of these types comes from a non-prototype fn definition,
1704 compare that with the other type's arglist.
1705 If they don't match, ask for a warning (but no error). */
1711 }
1713 {
1723 }
1725 /* Both types have argument lists: compare them and propagate results. */
1727 different_types_p);
1729 }
1731 /* Check two lists of types for compatibility, returning 0 for
1732 incompatible, 1 for compatible, or 2 for compatible with
1733 warning. ENUM_AND_INT_P and DIFFERENT_TYPES_P are as in
1734 comptypes_internal. */
1736 static int
1739 {
1740 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1745 {
1749 /* If one list is shorter than the other,
1750 they fail to match. */
1758 TYPE_QUAL_ATOMIC)
1763 TYPE_QUAL_ATOMIC)
1765 /* A null pointer instead of a type
1766 means there is supposed to be an argument
1767 but nothing is specified about what type it has.
1768 So match anything that self-promotes. */
1773 {
1776 }
1778 {
1781 }
1782 /* If one of the lists has an error marker, ignore this arg. */
1785 ;
1787 different_types_p)))
1788 {
1791 /* Allow wait (union {union wait *u; int *i} *)
1792 and wait (union wait *) to be compatible. */
1799 {
1800 tree memb;
1803 {
1809 TYPE_QUAL_ATOMIC)
1812 different_types_p))
1814 }
1817 }
1824 {
1825 tree memb;
1828 {
1834 TYPE_QUAL_ATOMIC)
1837 different_types_p))
1839 }
1842 }
1843 else
1845 }
1847 /* comptypes said ok, but record if it said to warn. */
1853 }
1854 }
1855 \f
1856 /* Compute the size to increment a pointer by. When a function type or void
1857 type or incomplete type is passed, size_one_node is returned.
1858 This function does not emit any diagnostics; the caller is responsible
1859 for that. */
1861 static tree
1863 {
1870 /* Convert in case a char is more than one unit. */
1874 }
1875 \f
1876 /* Return either DECL or its known constant value (if it has one). */
1878 tree
1880 {
1887 /* This is invalid if initial value is not constant.
1888 If it has either a function call, a memory reference,
1889 or a variable, then re-evaluating it could give different results. */
1891 /* Check for cases where this is sub-optimal, even though valid. */
1895 }
1897 /* Return either DECL or its known constant value (if it has one).
1898 Like the above, but always return decl outside of functions. */
1900 tree
1902 {
1903 /* Don't change a variable array bound or initial value to a constant
1904 in a place where a variable is invalid. */
1906 }
1908 /* Convert the array expression EXP to a pointer. */
1909 static tree
1911 {
1914 tree adr;
1916 tree ptrtype;
1929 /* In C++ array compound literals are temporary objects unless they are
1930 const or appear in namespace scope, so they are destroyed too soon
1931 to use them for much of anything (c++/53220). */
1933 {
1937 "converting an array compound literal to a pointer "
1939 }
1943 }
1945 /* Convert the function expression EXP to a pointer. */
1946 static tree
1948 {
1958 }
1960 /* Mark EXP as read, not just set, for set but not used -Wunused
1961 warning purposes. */
1963 void
1965 {
1967 {
1977 CASE_CONVERT:
1983 /* Pattern match what build_atomic_assign produces with modifycode
1984 NOP_EXPR. */
1988 {
1994 {
2002 {
2015 }
2017 {
2023 }
2024 }
2025 }
2026 /* FALLTHRU */
2032 }
2033 }
2035 /* Perform the default conversion of arrays and functions to pointers.
2036 Return the result of converting EXP. For any other expression, just
2037 return EXP.
2039 LOC is the location of the expression. */
2041 struct c_expr
2043 {
2049 {
2051 {
2058 {
2062 }
2068 {
2069 /* Before C99, non-lvalue arrays do not decay to pointers.
2070 Normally, using such an array would be invalid; but it can
2071 be used correctly inside sizeof or as a statement expression.
2072 Thus, do not give an error here; an error will result later. */
2074 }
2077 }
2084 }
2087 }
2089 struct c_expr
2091 {
2094 }
2096 /* Return whether EXPR should be treated as an atomic lvalue for the
2097 purposes of load and store handling. */
2099 static bool
2101 {
2109 /* Ignore _Atomic on register variables, since their addresses can't
2110 be taken so (a) atomicity is irrelevant and (b) the normal atomic
2111 sequences wouldn't work. Ignore _Atomic on structures containing
2112 bit-fields, since accessing elements of atomic structures or
2113 unions is undefined behavior (C11 6.5.2.3#5), but it's unclear if
2114 it's undefined at translation time or execution time, and the
2115 normal atomic sequences again wouldn't work. */
2117 {
2122 }
2126 }
2128 /* If EXPR is a named constant (C2x) derived from a constexpr variable
2129 - that is, a reference to such a variable, or a member extracted by
2130 a sequence of structure and union (but not array) member accesses
2131 (where union member accesses must access the same member as
2132 initialized) - then return the corresponding initializer;
2133 otherwise, return NULL_TREE. */
2135 static tree
2137 {
2165 {
2169 }
2173 /* Return a default initializer. */
2177 }
2179 /* Convert expression EXP (location LOC) from lvalue to rvalue,
2180 including converting functions and arrays to pointers if CONVERT_P.
2181 If READ_P, also mark the expression as having been read. If
2182 FOR_INIT, constexpr expressions of structure and union type should
2183 be replaced by the corresponding CONSTRUCTOR; otherwise, only
2184 constexpr scalars (including elements of structures and unions) are
2185 replaced by their initializers. */
2187 struct c_expr
2190 {
2199 {
2202 {
2203 /* A named constant of pointer type or type nullptr_t is not
2204 a null pointer constant even if the initializer is
2205 one. */
2211 }
2212 }
2214 {
2223 /* Expansion of a generic atomic load may require an addition
2224 element, so allocate enough to prevent a resize. */
2227 /* Remove the qualifiers for the rest of the expressions and
2228 create the VAL temp variable to hold the RHS. */
2233 /* Do not disable warnings for TMP even though it's artificial.
2234 -Winvalid-memory-model depends on it. */
2236 /* Issue __atomic_load (&expr, &tmp, SEQ_CST); */
2243 /* EXPR is always read. */
2246 /* Return tmp which contains the value loaded. */
2249 }
2252 exp.value = convert (build_qualified_type (TREE_TYPE (exp.value), TYPE_UNQUALIFIED), exp.value);
2256 }
2258 /* EXP is an expression of integer type. Apply the integer promotions
2259 to it and return the promoted value. */
2261 tree
2263 {
2269 /* Convert enums to the result of applying the integer promotions to
2270 their underlying type. */
2272 {
2275 {
2279 else
2281 }
2284 }
2286 /* ??? This should no longer be needed now bit-fields have their
2287 proper types. */
2290 /* If it's thinner than an int, promote it like a
2291 c_promoting_integer_type_p, otherwise leave it alone. */
2297 {
2298 /* Preserve unsignedness if not really getting any wider. */
2304 }
2307 }
2310 /* Perform default promotions for C data used in expressions.
2311 Enumeral types or short or char are converted to int.
2312 In addition, manifest constants symbols are replaced by their values. */
2314 tree
2316 {
2317 tree orig_exp;
2320 tree promoted_type;
2324 /* Functions and arrays have been converted during parsing. */
2329 /* Constants can be used directly unless they're not loadable. */
2333 /* Strip no-op conversions. */
2340 {
2344 }
2358 }
2359 \f
2360 /* Look up COMPONENT in a structure or union TYPE.
2362 If the component name is not found, returns NULL_TREE. Otherwise,
2363 the return value is a TREE_LIST, with each TREE_VALUE a FIELD_DECL
2364 stepping down the chain to the component, which is in the last
2365 TREE_VALUE of the list. Normally the list is of length one, but if
2366 the component is embedded within (nested) anonymous structures or
2367 unions, the list steps down the chain to the component. */
2369 static tree
2371 {
2372 tree field;
2374 /* If TYPE_LANG_SPECIFIC is set, then it is a sorted array of pointers
2375 to the field elements. Use a binary search on this array to quickly
2376 find the element. Otherwise, do a linear search. TYPE_LANG_SPECIFIC
2377 will always be set for structures which have many elements.
2379 Duplicate field checking replaces duplicates with NULL_TREE so
2380 TYPE_LANG_SPECIFIC arrays are potentially no longer sorted. In that
2381 case just iterate using DECL_CHAIN. */
2385 {
2393 {
2398 {
2399 /* Step through all anon unions in linear fashion. */
2401 {
2404 {
2410 /* The Plan 9 compiler permits referring
2411 directly to an anonymous struct/union field
2412 using a typedef name. */
2420 }
2421 }
2423 /* Entire record is only anon unions. */
2427 /* Restart the binary search, with new lower bound. */
2429 }
2435 else
2437 }
2443 }
2444 else
2445 {
2447 {
2450 {
2456 /* The Plan 9 compiler permits referring directly to an
2457 anonymous struct/union field using a typedef
2458 name. */
2465 }
2469 }
2473 }
2476 }
2478 /* Recursively append candidate IDENTIFIER_NODEs to CANDIDATES. */
2480 static void
2483 {
2484 tree field;
2486 {
2490 candidates);
2494 }
2495 }
2497 /* Like "lookup_field", but find the closest matching IDENTIFIER_NODE,
2498 rather than returning a TREE_LIST for an exact match. */
2500 static tree
2502 {
2505 /* First, gather a list of candidates. */
2512 }
2514 /* Support function for build_component_ref's error-handling.
2516 Given DATUM_TYPE, and "DATUM.COMPONENT", where DATUM is *not* a
2517 struct or union, should we suggest "DATUM->COMPONENT" as a hint? */
2519 static bool
2521 {
2522 /* We don't do it for Objective-C, since Objective-C 2.0 dot-syntax
2523 allows "." for ptrs; we could be handling a failed attempt
2524 to access a property. */
2528 /* Only suggest it for pointers... */
2532 /* ...to structs/unions. */
2537 else
2539 }
2541 /* Make an expression to refer to the COMPONENT field of structure or
2542 union value DATUM. COMPONENT is an IDENTIFIER_NODE. LOC is the
2543 location of the COMPONENT_REF. COMPONENT_LOC is the location
2544 of COMPONENT. ARROW_LOC is the location of the first -> operand if
2545 it is from -> operator. */
2547 tree
2550 {
2554 tree ref;
2560 /* Detect Objective-C property syntax object.property. */
2565 /* See if there is a field or component with name COMPONENT. */
2568 {
2570 {
2573 }
2578 {
2581 {
2582 /* Attempt to provide a fixit replacement hint, if
2583 we have a valid range for the component. */
2584 location_t reported_loc
2592 }
2593 else
2596 }
2598 /* Accessing elements of atomic structures or unions is undefined
2599 behavior (C11 6.5.2.3#5). */
2601 {
2605 else
2608 }
2610 /* Chain the COMPONENT_REFs if necessary down to the FIELD.
2611 This might be better solved in future the way the C++ front
2612 end does it - by giving the anonymous entities each a
2613 separate name and type, and then have build_component_ref
2614 recursively call itself. We can't do that here. */
2615 do
2616 {
2619 tree subtype;
2625 /* If this is an rvalue, it does not have qualifiers in C
2626 standard terms and we must avoid propagating such
2627 qualifiers down to a non-lvalue array that is then
2628 converted to a pointer. */
2629 use_datum_quals = (datum_lvalue
2638 NULL_TREE);
2655 }
2659 }
2661 {
2662 /* Special-case the error message for "ptr.field" for the case
2663 where the user has confused "." vs "->". */
2666 {
2670 "%qE is a pointer to pointer; did you mean to dereference "
2673 }
2674 else
2675 {
2676 /* "loc" should be the "." token. */
2680 datum);
2681 }
2683 }
2687 component);
2690 }
2691 \f
2692 /* Given an expression PTR for a pointer, return an expression
2693 for the value pointed to.
2694 ERRORSTRING is the name of the operator to appear in error messages.
2696 LOC is the location to use for the generated tree. */
2698 tree
2700 {
2703 tree ref;
2706 {
2709 {
2710 /* If a warning is issued, mark it to avoid duplicates from
2711 the backend. This only needs to be done at
2712 warn_strict_aliasing > 2. */
2717 }
2722 {
2726 }
2727 else
2728 {
2736 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
2737 so that we get the proper error message if the result is used
2738 to assign to. Also, &* is supposed to be a no-op.
2739 And ANSI C seems to specify that the type of the result
2740 should be the const type. */
2741 /* A de-reference of a pointer to const is not a const. It is valid
2742 to change it via some other pointer. */
2749 }
2750 }
2755 }
2757 /* This handles expressions of the form "a[i]", which denotes
2758 an array reference.
2760 This is logically equivalent in C to *(a+i), but we may do it differently.
2761 If A is a variable or a member, we generate a primitive ARRAY_REF.
2762 This avoids forcing the array out of registers, and can work on
2763 arrays that are not lvalues (for example, members of structures returned
2764 by functions).
2766 For vector types, allow vector[i] but not i[vector], and create
2767 *(((type*)&vectortype) + i) for the expression.
2769 LOC is the location to use for the returned expression. */
2771 tree
2773 {
2774 tree ret;
2782 /* Allow vector[index] but not index[vector]. */
2784 {
2787 {
2792 }
2795 }
2798 {
2801 }
2804 {
2807 }
2809 /* ??? Existing practice has been to warn only when the char
2810 index is syntactically the index, not for char[array]. */
2814 /* Apply default promotions *after* noticing character types. */
2825 {
2828 /* An array that is indexed by a non-constant
2829 cannot be stored in a register; we must be able to do
2830 address arithmetic on its address.
2831 Likewise an array of elements of variable size. */
2835 {
2838 }
2839 /* An array that is indexed by a constant value which is not within
2840 the array bounds cannot be stored in a register either; because we
2841 would get a crash in store_bit_field/extract_bit_field when trying
2842 to access a non-existent part of the register. */
2846 {
2849 }
2853 {
2862 "ISO C90 forbids subscripting non-lvalue "
2864 }
2868 /* Array ref is const/volatile if the array elements are
2869 or if the array is. */
2878 /* This was added by rms on 16 Nov 91.
2879 It fixes vol struct foo *a; a->elts[1]
2880 in an inline function.
2881 Hope it doesn't break something else. */
2888 }
2889 else
2890 {
2901 RO_ARRAY_INDEXING);
2905 }
2906 }
2907 \f
2908 /* Build an external reference to identifier ID. FUN indicates
2909 whether this will be used for a function call. LOC is the source
2910 location of the identifier. This sets *TYPE to the type of the
2911 identifier, which is not the same as the type of the returned value
2912 for CONST_DECLs defined as enum constants. If the type of the
2913 identifier is not available, *TYPE is set to NULL. */
2914 tree
2916 {
2917 tree ref;
2920 /* In Objective-C, an instance variable (ivar) may be preferred to
2921 whatever lookup_name() found. */
2926 {
2931 decl);
2932 }
2934 /* Implicit function declaration. */
2937 /* Don't complain about something that's already been
2938 complained about. */
2940 else
2941 {
2944 }
2954 /* Recursive call does not count as usage. */
2956 {
2958 }
2961 {
2968 }
2971 {
2977 {
2982 }
2986 }
2991 {
2996 }
2997 /* C99 6.7.4p3: An inline definition of a function with external
2998 linkage ... shall not contain a reference to an identifier with
2999 internal linkage. */
3008 csi_internal);
3011 }
3013 /* Record details of decls possibly used inside sizeof or typeof. */
3014 struct maybe_used_decl
3015 {
3016 /* The decl. */
3017 tree decl;
3018 /* The level seen at (in_sizeof + in_typeof). */
3020 /* The next one at this level or above, or NULL. */
3022 };
3026 /* Record that DECL, an undefined static function reference seen
3027 inside sizeof or typeof, might be used if the operand of sizeof is
3028 a VLA type or the operand of typeof is a variably modified
3029 type. */
3031 static void
3033 {
3039 }
3041 /* Pop the stack of decls possibly used inside sizeof or typeof. If
3042 USED is false, just discard them. If it is true, mark them used
3043 (if no longer inside sizeof or typeof) or move them to the next
3044 level up (if still inside sizeof or typeof). */
3046 void
3048 {
3052 {
3054 {
3057 else
3059 }
3061 }
3064 }
3066 /* Return the result of sizeof applied to EXPR. */
3068 struct c_expr
3070 {
3073 {
3079 }
3080 else
3081 {
3086 {
3087 auto_diagnostic_group d;
3089 "%<sizeof%> on array function parameter %qE will "
3093 }
3103 {
3104 /* sizeof is evaluated when given a vla (C99 6.5.3.4p2). */
3109 }
3111 }
3113 }
3115 /* Return the result of sizeof applied to T, a structure for the type
3116 name passed to sizeof (rather than the type itself). LOC is the
3117 location of the original expression. */
3119 struct c_expr
3121 {
3122 tree type;
3134 {
3137 }
3138 else
3141 {
3142 /* If the type is a [*] array, it is a VLA but is represented as
3143 having a size of zero. In such a case we must ensure that
3144 the result of sizeof does not get folded to a constant by
3145 c_fully_fold, because if the size is evaluated the result is
3146 not constant and so constraints on zero or negative size
3147 arrays must not be applied when this sizeof call is inside
3148 another array declarator. */
3154 }
3158 }
3160 /* Build a function call to function FUNCTION with parameters PARAMS.
3161 The function call is at LOC.
3162 PARAMS is a list--a chain of TREE_LIST nodes--in which the
3163 TREE_VALUE of each node is a parameter-expression.
3164 FUNCTION's data type may be a function type or a pointer-to-function. */
3166 tree
3168 {
3170 tree ret;
3178 }
3180 /* Give a note about the location of the declaration of DECL. */
3182 static void
3184 {
3188 }
3190 /* Build a function call to function FUNCTION with parameters PARAMS.
3191 If FUNCTION is the result of resolving an overloaded target built-in,
3192 ORIG_FUNDECL is the original function decl, otherwise it is null.
3193 ORIGTYPES, if not NULL, is a vector of types; each element is
3194 either NULL or the original type of the corresponding element in
3195 PARAMS. The original type may differ from TREE_TYPE of the
3196 parameter for enums. FUNCTION's data type may be a function type
3197 or pointer-to-function. This function changes the elements of
3198 PARAMS. */
3200 tree
3204 {
3207 tree tem;
3212 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
3215 /* Convert anything with function type to a pointer-to-function. */
3217 {
3225 /* Atomic functions have type checking/casting already done. They are
3226 often rewritten and don't match the original parameter list. */
3229 }
3233 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
3234 expressions, like those used for ObjC messenger dispatches. */
3247 {
3251 function);
3253 {
3256 function);
3258 }
3259 else
3263 }
3268 /* fntype now gets the type of function pointed to. */
3272 /* Convert the parameters to the types declared in the
3273 function prototype, or apply default promotions. */
3280 /* Check that the function is called through a compatible prototype.
3281 If it is not, warn. */
3286 {
3287 /* This situation leads to run-time undefined behavior. We can't,
3288 therefore, simply error unless we can prove that all possible
3289 executions of the program must execute the code. */
3296 }
3300 /* Check that arguments to builtin functions match the expectations. */
3307 /* Check that the arguments to the function are valid. */
3316 {
3318 result
3321 else
3327 }
3328 else
3331 /* If -Wnonnull warning has been diagnosed, avoid diagnosing it again
3332 later. */
3336 /* In this improbable scenario, a nested function returns a VM type.
3337 Create a TARGET_EXPR so that the call always has a LHS, much as
3338 what the C++ FE does for functions returning non-PODs. */
3340 {
3344 }
3347 {
3352 }
3354 }
3356 /* Like build_function_call_vec, but call also resolve_overloaded_builtin. */
3358 tree
3362 {
3363 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
3366 /* Convert anything with function type to a pointer-to-function. */
3368 {
3369 /* Implement type-directed function overloading for builtins.
3370 resolve_overloaded_builtin and targetm.resolve_overloaded_builtin
3371 handle all the type checking. The result is a complete expression
3372 that implements this function call. */
3376 }
3378 }
3379 \f
3380 /* Helper for convert_arguments called to convert the VALue of argument
3381 number ARGNUM from ORIGTYPE to the corresponding parameter number
3382 PARMNUM and TYPE.
3383 PLOC is the location where the conversion is being performed.
3384 FUNCTION and FUNDECL are the same as in convert_arguments.
3385 VALTYPE is the original type of VAL before the conversion and,
3386 for EXCESS_PRECISION_EXPR, the operand of the expression.
3387 NPC is true if VAL represents the null pointer constant (VAL itself
3388 will have been folded to an integer constant).
3389 RNAME is the same as FUNCTION except in Objective C when it's
3390 the function selector.
3391 EXCESS_PRECISION is true when VAL was originally represented
3392 as EXCESS_PRECISION_EXPR.
3393 WARNOPT is the same as in convert_for_assignment. */
3395 static tree
3400 {
3401 /* Formal parm type is specified by a function prototype. */
3404 {
3408 }
3410 /* Optionally warn about conversions that differ from the default
3411 conversions. */
3413 {
3419 "passing argument %d of %qE as integer rather "
3425 "passing argument %d of %qE as integer rather "
3431 "passing argument %d of %qE as complex rather "
3437 "passing argument %d of %qE as floating rather "
3443 "passing argument %d of %qE as complex rather "
3449 "passing argument %d of %qE as floating rather "
3452 /* ??? At some point, messages should be written about
3453 conversions between complex types, but that's too messy
3454 to do now. */
3457 {
3458 /* Warn if any argument is passed as `float',
3459 since without a prototype it would be `double'. */
3463 "passing argument %d of %qE as %<float%> "
3467 /* Warn if mismatch between argument and prototype
3468 for decimal float types. Warn of conversions with
3469 binary float types and of precision narrowing due to
3470 prototype. */
3478 && (formal_prec
3481 && (valtype
3482 != dfloat64_type_node
3483 && (valtype
3486 && (valtype
3489 "passing argument %d of %qE as %qT "
3493 }
3494 /* Detect integer changing in width or signedness.
3495 These warnings are only activated with
3496 -Wtraditional-conversion, not with -Wtraditional. */
3500 {
3509 /* No warning if function asks for enum
3510 and the actual arg is that enum type. */
3511 ;
3514 "passing argument %d of %qE "
3518 ;
3519 /* Don't complain if the formal parameter type
3520 is an enum, because we can't tell now whether
3521 the value was an enum--even the same enum. */
3523 ;
3526 /* Change in signedness doesn't matter
3527 if a constant value is unaffected. */
3528 ;
3529 /* If the value is extended from a narrower
3530 unsigned type, it doesn't matter whether we
3531 pass it as signed or unsigned; the value
3532 certainly is the same either way. */
3535 ;
3538 "passing argument %d of %qE "
3541 else
3543 "passing argument %d of %qE "
3546 }
3547 }
3549 /* Possibly restore an EXCESS_PRECISION_EXPR for the
3550 sake of better warnings from convert_and_check. */
3565 }
3567 /* Convert the argument expressions in the vector VALUES
3568 to the types in the list TYPELIST.
3570 If TYPELIST is exhausted, or when an element has NULL as its type,
3571 perform the default conversions.
3573 ORIGTYPES is the original types of the expressions in VALUES. This
3574 holds the type of enum values which have been converted to integral
3575 types. It may be NULL.
3577 FUNCTION is a tree for the called function. It is used only for
3578 error messages, where it is formatted with %qE.
3580 This is also where warnings about wrong number of args are generated.
3582 ARG_LOC are locations of function arguments (if any).
3584 Returns the actual number of arguments processed (which may be less
3585 than the length of VALUES in some error situations), or -1 on
3586 failure. */
3588 static int
3592 {
3599 tree selector;
3601 /* Change pointer to function to the function itself for
3602 diagnostics. */
3607 /* Handle an ObjC selector specially for diagnostics. */
3610 /* For a call to a built-in function declared without a prototype,
3611 set to the built-in function's argument list. */
3614 /* For type-generic built-in functions, determine whether excess
3615 precision should be removed (classification) or not
3616 (comparison). */
3619 {
3622 {
3623 /* For a call to a built-in function declared without a prototype
3624 use the types of the parameters of the internal built-in to
3625 match those of the arguments to. */
3628 }
3630 /* For type-generic built-in functions, determine whether excess
3631 precision should be removed (classification) or not
3632 (comparison). */
3635 {
3649 /* The last argument of these type-generic builtins
3650 should not be promoted. */
3656 }
3657 }
3659 /* Scan the given expressions (VALUES) and types (TYPELIST), producing
3660 individual converted arguments. */
3668 {
3669 /* The type of the function parameter (if it was declared with one). */
3671 /* The type of the built-in function parameter (if the function
3672 is a built-in). Used to detect type incompatibilities in
3673 calls to built-ins declared without a prototype. */
3674 tree builtin_type = (builtin_typetail
3676 /* The original type of the argument being passed to the function. */
3678 /* The called function (or function selector in Objective C). */
3682 /* Set for EXCESS_PRECISION_EXPR arguments. */
3684 /* The value of the argument after conversion to the type
3685 of the function parameter it is passed to. */
3686 tree parmval;
3687 /* Some __atomic_* builtins have additional hidden argument at
3688 position 0. */
3689 location_t ploc
3695 {
3698 else
3702 }
3705 {
3707 "too many arguments to built-in function %qE "
3711 }
3714 {
3717 }
3719 /* Determine if VAL is a null pointer constant before folding it. */
3722 /* If there is excess precision and a prototype, convert once to
3723 the required type rather than converting via the semantic
3724 type. Likewise without a prototype a float value represented
3725 as long double should be converted once to double. But for
3726 type-generic classification functions excess precision must
3727 be removed here. */
3730 {
3733 }
3739 /* Some floating-point arguments must be promoted to double when
3740 no type is specified by a prototype. This applies to
3741 arguments of type float, and to architecture-specific types
3742 (ARM __fp16), but not to _FloatN or _FloatNx types. */
3751 {
3752 /* Promote this argument, unless it has a _FloatN or
3753 _FloatNx type. */
3757 {
3760 }
3761 /* Don't promote __bf16 either. */
3764 }
3767 {
3772 }
3774 {
3777 else
3778 {
3779 /* Convert `float' to `double'. */
3782 "implicit conversion from %qT to %qT when passing "
3786 }
3787 }
3790 /* A "double" argument with excess precision being passed
3791 without a prototype or in variable arguments.
3792 The last argument of __builtin_*_overflow_p should not be
3793 promoted. */
3797 {
3800 }
3802 {
3804 }
3805 else
3806 /* Convert `short' and `char' to full-size `int'. */
3814 {
3815 /* For a call to a built-in function declared without a prototype,
3816 perform the conversions from the argument to the expected type
3817 but issue warnings rather than errors for any mismatches.
3818 Ignore the converted argument and use the PARMVAL obtained
3819 above by applying default conversions instead. */
3823 excess_precision,
3824 OPT_Wbuiltin_declaration_mismatch);
3825 }
3832 }
3837 {
3841 }
3844 {
3850 "too few arguments to built-in function %qE "
3853 }
3856 }
3857 \f
3858 /* This is the entry point used by the parser to build unary operators
3859 in the input. CODE, a tree_code, specifies the unary operator, and
3860 ARG is the operand. For unary plus, the C parser currently uses
3861 CONVERT_EXPR for code.
3863 LOC is the location to use for the tree generated.
3864 */
3866 struct c_expr
3868 {
3876 {
3878 }
3879 else
3880 {
3885 }
3887 /* We are typically called when parsing a prefix token at LOC acting on
3888 ARG. Reflect this by updating the source range of the result to
3889 start at LOC and end at the end of ARG. */
3894 }
3896 /* Returns true if TYPE is a character type, *not* including wchar_t. */
3898 bool
3900 {
3906 }
3908 /* This is the entry point used by the parser to build binary operators
3909 in the input. CODE, a tree_code, specifies the binary operator, and
3910 ARG1 and ARG2 are the operands. In addition to constructing the
3911 expression, we check for operands that were written with other binary
3912 operators in a way that is likely to confuse the user.
3914 LOCATION is the location of the binary operator. */
3916 struct c_expr
3919 {
3939 {
3944 }
3953 /* Check for cases such as x+y<<z which users are likely
3954 to misinterpret. */
3964 {
3968 {
3972 else
3974 }
3976 {
3980 else
3982 }
3985 }
3991 /* Avoid warning for !!x == y. */
3994 {
3995 /* Avoid warning for !b == y where b has _Bool type. */
4000 {
4002 do
4003 {
4010 else
4012 }
4014 }
4017 }
4019 /* Warn about comparisons against string literals, with the exception
4020 of testing for equality or inequality of a string literal with NULL. */
4022 {
4029 /* Warn for ptr == '\0', it's likely that it should've been ptr[0]. */
4033 {
4034 auto_diagnostic_group d;
4036 "comparison between pointer and zero character "
4040 }
4044 {
4045 auto_diagnostic_group d;
4047 "comparison between pointer and zero character "
4051 }
4052 }
4056 "comparison with string literal results in unspecified "
4070 /* Warn about comparisons of different enum types. */
4085 location,
4089 }
4090 \f
4091 /* Return a tree for the difference of pointers OP0 and OP1.
4092 The resulting tree has type ptrdiff_t. If POINTER_SUBTRACT sanitization is
4093 enabled, assign to INSTRUMENT_EXPR call to libsanitizer. */
4095 static tree
4097 {
4107 /* If the operands point into different address spaces, we need to
4108 explicitly convert them to pointers into the common address space
4109 before we can subtract the numerical address values. */
4111 {
4112 addr_space_t as_common;
4113 tree common_type;
4115 /* Determine the common superset address space. This is guaranteed
4116 to exist because the caller verified that comp_target_types
4117 returned non-zero. */
4124 }
4126 /* Determine integer type result of the subtraction. This will usually
4127 be the same as the result type (ptrdiff_t), but may need to be a wider
4128 type if pointers for the address space are wider than ptrdiff_t. */
4131 else
4143 {
4149 }
4151 /* First do the subtraction, then build the divide operator
4152 and only convert at the very end.
4153 Do not do default conversions in case restype is a short type. */
4155 /* POINTER_DIFF_EXPR requires a signed integer type of the same size as
4156 pointers. If some platform cannot provide that, or has a larger
4157 ptrdiff_type to support differences larger than half the address
4158 space, cast the pointers to some larger integer type and do the
4159 computations in that type. */
4163 else
4164 {
4165 /* Cast away qualifiers. */
4169 }
4171 /* This generates an error if op1 is pointer to incomplete type. */
4184 /* Divide by the size, in easiest possible way. */
4188 /* Convert to final result type if necessary. */
4190 }
4191 \f
4192 /* Expand atomic compound assignments into an appropriate sequence as
4193 specified by the C11 standard section 6.5.16.2.
4195 _Atomic T1 E1
4196 T2 E2
4197 E1 op= E2
4199 This sequence is used for all types for which these operations are
4200 supported.
4202 In addition, built-in versions of the 'fe' prefixed routines may
4203 need to be invoked for floating point (real, complex or vector) when
4204 floating-point exceptions are supported. See 6.5.16.2 footnote 113.
4206 T1 newval;
4207 T1 old;
4208 T1 *addr
4209 T2 val
4210 fenv_t fenv
4212 addr = &E1;
4213 val = (E2);
4214 __atomic_load (addr, &old, SEQ_CST);
4215 feholdexcept (&fenv);
4216 loop:
4217 newval = old op val;
4218 if (__atomic_compare_exchange_strong (addr, &old, &newval, SEQ_CST,
4219 SEQ_CST))
4220 goto done;
4221 feclearexcept (FE_ALL_EXCEPT);
4222 goto loop:
4223 done:
4224 feupdateenv (&fenv);
4226 The compiler will issue the __atomic_fetch_* built-in when possible,
4227 otherwise it will generate the generic form of the atomic operations.
4228 This requires temp(s) and has their address taken. The atomic processing
4229 is smart enough to figure out when the size of an object can utilize
4230 a lock-free version, and convert the built-in call to the appropriate
4231 lock-free routine. The optimizers will then dispose of any temps that
4232 are no longer required, and lock-free implementations are utilized as
4233 long as there is target support for the required size.
4235 If the operator is NOP_EXPR, then this is a simple assignment, and
4236 an __atomic_store is issued to perform the assignment rather than
4237 the above loop. */
4239 /* Build an atomic assignment at LOC, expanding into the proper
4240 sequence to store LHS MODIFYCODE= RHS. Return a value representing
4241 the result of the operation, unless RETURN_OLD_P, in which case
4242 return the old value of LHS (this is only for postincrement and
4243 postdecrement). */
4245 static tree
4248 {
4261 tree nonatomic_rhs_semantic_type;
4262 tree rhs_type;
4269 /* Allocate enough vector items for a compare_exchange. */
4272 /* Create a compound statement to hold the sequence of statements
4273 with a loop. */
4275 {
4278 /* For consistency with build_modify_expr on non-_Atomic,
4279 mark the lhs as read. Also, it would be very hard to match
4280 such expressions in mark_exp_read. */
4282 }
4284 /* Remove any excess precision (which is only present here in the
4285 case of compound assignments). */
4287 {
4290 }
4293 /* Fold the RHS if it hasn't already been folded. */
4297 /* Remove the qualifiers for the rest of the expressions and create
4298 the VAL temp variable to hold the RHS. */
4302 TYPE_UNQUALIFIED);
4307 NULL_TREE);
4313 /* NOP_EXPR indicates it's a straight store of the RHS. Simply issue
4314 an atomic_store. */
4316 {
4318 /* Build __atomic_store (&lhs, &val, SEQ_CST) */
4329 /* VAL is the value which was stored, return a COMPOUND_STMT of
4330 the statement and that value. */
4332 }
4334 /* Attempt to implement the atomic operation as an __atomic_fetch_* or
4335 __atomic_*_fetch built-in rather than a CAS loop. atomic_bool type
4336 isn't applicable for such builtins. ??? Do we want to handle enums? */
4339 {
4340 built_in_function fncode;
4342 {
4345 fncode = (return_old_p
4346 ? BUILT_IN_ATOMIC_FETCH_ADD_N
4350 fncode = (return_old_p
4351 ? BUILT_IN_ATOMIC_FETCH_SUB_N
4355 fncode = (return_old_p
4356 ? BUILT_IN_ATOMIC_FETCH_AND_N
4360 fncode = (return_old_p
4361 ? BUILT_IN_ATOMIC_FETCH_OR_N
4365 fncode = (return_old_p
4366 ? BUILT_IN_ATOMIC_FETCH_XOR_N
4371 }
4373 /* We can only use "_1" through "_16" variants of the atomic fetch
4374 built-ins. */
4379 /* If this is a pointer type, we need to multiply by the size of
4380 the pointer target type. */
4382 {
4384 /* ??? This would introduce -Wdiscarded-qualifiers
4385 warning: __atomic_fetch_* expect volatile void *
4386 type as the first argument. (Assignments between
4387 atomic and non-atomic objects are OK.) */
4394 }
4396 /* Build __atomic_fetch_* (&lhs, &val, SEQ_CST), or
4397 __atomic_*_fetch (&lhs, &val, SEQ_CST). */
4412 /* Finish the compound statement. */
4415 /* NEWVAL is the value which was stored, return a COMPOUND_STMT of
4416 the statement and that value. */
4418 }
4420 cas_loop:
4421 /* Create the variables and labels required for the op= form. */
4438 /* __atomic_load (addr, &old, SEQ_CST). */
4445 NULL_TREE);
4449 /* Create the expressions for floating-point environment
4450 manipulation, if required. */
4460 /* loop: */
4463 /* newval = old + val; */
4468 {
4472 }
4473 else
4479 {
4481 NULL_TREE);
4484 }
4486 /* if (__atomic_compare_exchange (addr, &old, &new, false, SEQ_CST, SEQ_CST))
4487 goto done; */
4507 /* goto loop; */
4512 /* done: */
4518 /* Finish the compound statement. */
4521 /* NEWVAL is the value that was successfully stored, return a
4522 COMPOUND_EXPR of the statement and the appropriate value. */
4525 }
4527 /* Construct and perhaps optimize a tree representation
4528 for a unary operation. CODE, a tree_code, specifies the operation
4529 and XARG is the operand.
4530 For any CODE other than ADDR_EXPR, NOCONVERT suppresses the default
4531 promotions (such as from short to int).
4532 For ADDR_EXPR, the default promotions are not applied; NOCONVERT allows
4533 non-lvalues; this is only used to handle conversion of non-lvalue arrays
4534 to pointers in C99.
4536 LOCATION is the location of the operator. */
4538 tree
4541 {
4542 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
4546 tree val;
4567 {
4570 }
4573 {
4576 }
4579 {
4581 /* This is used for unary plus, because a CONVERT_EXPR
4582 is enough to prevent anybody from looking inside for
4583 associativity, but won't generate any code. */
4587 {
4590 }
4600 {
4603 }
4609 /* ~ works on integer types and non float vectors. */
4613 {
4616 /* Warn if the expression has boolean value. */
4622 {
4623 auto_diagnostic_group d;
4626 {
4630 }
4631 }
4634 }
4636 {
4642 }
4643 else
4644 {
4647 }
4652 {
4655 }
4662 {
4665 }
4671 /* Conjugating a real value is a no-op, but allow it anyway. */
4674 {
4677 }
4686 {
4690 }
4692 {
4695 }
4696 else
4699 /* If the TRUTH_NOT_EXPR has been folded, reset the location. */
4719 {
4722 noconvert);
4730 }
4732 /* Complain about anything that is not a true lvalue. In
4733 Objective-C, skip this check for property_refs. */
4738 ? lv_increment
4743 {
4747 else
4750 }
4753 {
4757 else
4760 }
4762 /* Ensure the argument is fully folded inside any SAVE_EXPR. */
4768 /* Increment or decrement the real part of the value,
4769 and don't change the imaginary part. */
4771 {
4778 {
4790 }
4791 }
4793 /* Report invalid types. */
4799 {
4802 else
4806 }
4808 {
4809 tree inc;
4813 /* Compute the increment. */
4816 {
4817 /* If pointer target is an incomplete type,
4818 we just cannot know how to do the arithmetic. */
4820 {
4825 else
4829 }
4832 {
4836 else
4839 }
4840 else
4846 }
4848 {
4849 /* For signed fract types, we invert ++ to -- or
4850 -- to ++, and change inc from 1 to -1, because
4851 it is not possible to represent 1 in signed fract constants.
4852 For unsigned fract types, the result always overflows and
4853 we get an undefined (original) or the maximum value. */
4865 }
4866 else
4867 {
4872 }
4874 /* If 'arg' is an Objective-C PROPERTY_REF expression, then we
4875 need to ask Objective-C to build the increment or decrement
4876 expression for it. */
4881 /* Report a read-only lvalue. */
4883 {
4889 }
4896 /* If the argument is atomic, use the special code sequences for
4897 atomic compound assignment. */
4899 {
4904 ? PLUS_EXPR
4907 ? inc
4912 }
4916 else
4921 TYPE_UNQUALIFIED);
4924 }
4927 /* Note that this operation never does default_conversion. */
4929 /* The operand of unary '&' must be an lvalue (which excludes
4930 expressions of type void), or, in C99, the result of a [] or
4931 unary '*' operator. */
4937 /* Let &* cancel out to simplify resulting code. */
4939 {
4940 /* Don't let this be an lvalue. */
4945 }
4947 /* Anything not already handled and not a true memory reference
4948 or a non-lvalue array is an error. */
4953 /* Move address operations inside C_MAYBE_CONST_EXPR to simplify
4954 folding later. */
4956 {
4959 noconvert);
4966 }
4968 /* Ordinary case; arg is a COMPONENT_REF or a decl. */
4971 /* If the lvalue is const or volatile, merge that into the type
4972 to which the address will point. This is only needed
4973 for function types. */
4977 {
4987 }
4990 {
4993 {
4997 }
4999 /* fall through */
5003 {
5007 {
5011 }
5016 "address of array with reverse scalar storage "
5018 }
5022 }
5032 /* ??? Cope with user tricks that amount to offsetof. Delete this
5033 when we have proper support for integer constant expressions. */
5037 {
5040 }
5053 }
5058 ret = (require_constant_value
5061 else
5063 return_build_unary_op:
5074 }
5076 /* Return nonzero if REF is an lvalue valid for this language.
5077 Lvalues can be assigned, unless their type has TYPE_READONLY.
5078 Lvalues can have their address taken, unless they have C_DECL_REGISTER. */
5080 bool
5082 {
5086 {
5101 /* MEM_REFs can appear from -fgimple parsing or folding, so allow them
5102 here as well. */
5117 }
5118 }
5119 \f
5120 /* Give a warning for storing in something that is read-only in GCC
5121 terms but not const in ISO C terms. */
5123 static void
5125 {
5127 {
5139 }
5141 }
5144 /* Return nonzero if REF is an lvalue valid for this language;
5145 otherwise, print an error message and return zero. USE says
5146 how the lvalue is being used and so selects the error message.
5147 LOCATION is the location at which any error should be reported. */
5149 static int
5151 {
5158 }
5159 \f
5160 /* Mark EXP saying that we need to be able to take the
5161 address of it; it should not be allocated in a register.
5162 Returns true if successful. ARRAY_REF_P is true if this
5163 is for ARRAY_REF construction - in that case we don't want
5164 to look through VIEW_CONVERT_EXPR from VECTOR_TYPE to ARRAY_TYPE,
5165 it is fine to use ARRAY_REFs for vector subscripts on vector
5166 register variables. */
5168 bool
5170 {
5175 {
5186 {
5190 }
5191 /* FALLTHRU */
5201 {
5204 }
5219 {
5221 {
5222 error
5225 }
5227 }
5229 {
5232 else
5235 }
5237 /* FALLTHRU */
5240 /* FALLTHRU */
5243 }
5244 }
5245 \f
5246 /* Convert EXPR to TYPE, warning about conversion problems with
5247 constants. SEMANTIC_TYPE is the type this conversion would use
5248 without excess precision. If SEMANTIC_TYPE is NULL, this function
5249 is equivalent to convert_and_check. This function is a wrapper that
5250 handles conversions that may be different than
5251 the usual ones because of excess precision. */
5253 static tree
5255 tree semantic_type)
5256 {
5260 /* For C11, integer conversions may have results with excess
5261 precision. */
5267 {
5268 /* For integers, we need to check the real conversion, not
5269 the conversion to the excess precision type. */
5271 }
5272 /* Result type is the excess precision type, which should be
5273 large enough, so do not check. */
5275 }
5277 /* If EXPR refers to a built-in declared without a prototype returns
5278 the actual type of the built-in and, if non-null, set *BLTIN to
5279 a pointer to the built-in. Otherwise return the type of EXPR
5280 and clear *BLTIN if non-null. */
5282 static tree
5284 {
5285 tree dummy;
5309 }
5311 /* Build and return a conditional expression IFEXP ? OP1 : OP2. If
5312 IFEXP_BCP then the condition is a call to __builtin_constant_p, and
5313 if folded to an integer constant then the unselected half may
5314 contain arbitrary operations not normally permitted in constant
5315 expressions. Set the location of the expression to LOC. */
5317 tree
5321 {
5322 tree type1;
5323 tree type2;
5331 tree ret;
5343 /* Promote both alternatives. */
5368 /* C90 does not permit non-lvalue arrays in conditional expressions.
5369 In C99 they will be pointers by now. */
5371 {
5374 }
5382 {
5385 {
5389 }
5391 {
5395 }
5396 }
5399 {
5410 }
5412 /* Quickly detect the usual case where op1 and op2 have the same type
5413 after promotion. */
5415 {
5418 else
5420 }
5425 {
5426 /* In C11, a conditional expression between a floating-point
5427 type and an integer type should convert the integer type to
5428 the evaluation format of the floating-point type, with
5429 possible excess precision. */
5433 {
5434 tree eptype;
5437 {
5441 }
5444 {
5448 }
5449 }
5454 "implicit conversion from %qT to %qT to "
5456 colon_loc);
5458 /* If -Wsign-compare, warn here if type1 and type2 have
5459 different signedness. We'll promote the signed to unsigned
5460 and later code won't know it used to be different.
5461 Do this check on the original types, so that explicit casts
5462 will be considered, but default promotions won't. */
5464 {
5469 {
5472 /* Do not warn if the result type is signed, since the
5473 signed type will only be chosen if it can represent
5474 all the values of the unsigned type. */
5477 else
5478 {
5482 /* Do not warn if the signed quantity is an
5483 unsuffixed integer literal (or some static
5484 constant expression involving such literals) and
5485 it is non-negative. This warning requires the
5486 operands to be folded for best results, so do
5487 that folding in this case even without
5488 warn_sign_compare to avoid warning options
5489 possibly affecting code generation. */
5490 c_inhibit_evaluation_warnings
5494 c_inhibit_evaluation_warnings
5497 c_inhibit_evaluation_warnings
5501 c_inhibit_evaluation_warnings
5505 {
5508 || (unsigned_op1
5513 "operand of %<?:%> changes signedness from "
5514 "%qT to %qT due to unsignedness of other "
5517 else
5519 "operand of %<?:%> changes signedness from "
5520 "%qT to %qT due to unsignedness of other "
5523 }
5528 }
5529 }
5530 }
5531 }
5533 {
5538 }
5540 {
5543 addr_space_t as_common;
5552 {
5556 }
5561 {
5566 {
5567 /* roles are swapped */
5570 }
5574 {
5577 "pointer to array loses qualifier "
5581 "pointer to array loses qualifier "
5583 }
5586 "ISO C forbids conditional expr between "
5588 /* for array, use qualifiers of element type */
5592 }
5593 /* Objective-C pointer comparisons are a bit more lenient. */
5596 else
5597 {
5601 "pointer type mismatch between %qT and %qT "
5604 else
5607 result_type = build_pointer_type
5609 }
5610 }
5612 {
5616 else
5617 {
5619 }
5621 }
5623 {
5627 else
5628 {
5630 }
5632 }
5633 /* 6.5.15: "if one is a null pointer constant (other than a pointer) or has
5634 type nullptr_t and the other is a pointer, the result type is the pointer
5635 type." */
5642 {
5645 else
5646 {
5649 }
5650 }
5652 /* Merge const and volatile flags of the incoming types. */
5653 result_type
5659 semantic_result_type);
5661 semantic_result_type);
5664 {
5667 }
5669 {
5672 }
5674 && op1_int_operands
5677 {
5684 }
5686 /* Need to convert condition operand into a vector mask. */
5688 {
5695 }
5699 else
5700 {
5702 {
5703 /* Use c_fully_fold here, since C_MAYBE_CONST_EXPR might be
5704 nested inside of the expression. */
5707 }
5711 }
5717 /* If the OP1 and OP2 are the same and don't have side-effects,
5718 warn here, because the COND_EXPR will be turned into OP1. */
5726 }
5727 \f
5728 /* EXPR is an expression, location LOC, whose result is discarded.
5729 Warn if it is a call to a nodiscard function (or a COMPOUND_EXPR
5730 whose right-hand operand is such a call, possibly recursively). */
5732 static void
5734 {
5738 {
5742 }
5748 tree attr;
5753 {
5758 auto_diagnostic_group d;
5762 "ignoring return value of %qD, declared with "
5764 else
5766 "ignoring return value of %qD, declared with "
5770 }
5771 else
5772 {
5780 auto_diagnostic_group d;
5784 "ignoring return value of type %qT, declared "
5787 else
5789 "ignoring return value of type %qT, declared "
5792 {
5794 {
5799 }
5800 }
5801 }
5802 }
5804 /* Return a compound expression that performs two expressions and
5805 returns the value of the second of them.
5807 LOC is the location of the COMPOUND_EXPR. */
5809 tree
5811 {
5814 tree ret;
5826 {
5829 }
5832 {
5833 /* The left-hand operand of a comma expression is like an expression
5834 statement: with -Wunused, we should warn if it doesn't have
5835 any side-effects, unless it was explicitly cast to (void). */
5837 {
5845 else
5848 }
5849 }
5852 {
5856 {
5860 }
5866 }
5868 /* With -Wunused, we should also warn if the left-hand operand does have
5869 side-effects, but computes a value which is not used. For example, in
5870 `foo() + bar(), baz()' the result of the `+' operator is not used,
5871 so we should issue a warning. */
5883 && expr1_int_operands
5892 }
5894 /* Issue -Wcast-qual warnings when appropriate. TYPE is the type to
5895 which we are casting. OTYPE is the type of the expression being
5896 cast. Both TYPE and OTYPE are pointer types. LOC is the location
5897 of the cast. -Wcast-qual appeared on the command line. Named
5898 address space qualifiers are not handled here, because they result
5899 in different warnings. */
5901 static void
5903 {
5910 /* Check that the qualifiers on IN_TYPE are a superset of the
5911 qualifiers of IN_OTYPE. The outermost level of POINTER_TYPE
5912 nodes is uninteresting and we stop as soon as we hit a
5913 non-POINTER_TYPE node on either type. */
5914 do
5915 {
5919 /* GNU C allows cv-qualified function types. 'const' means the
5920 function is very pure, 'volatile' means it can't return. We
5921 need to warn when such qualifiers are added, not when they're
5922 taken away. */
5927 else
5930 }
5939 /* There are qualifiers present in IN_OTYPE that are not present
5940 in IN_TYPE. */
5943 discarded);
5948 /* A cast from **T to const **T is unsafe, because it can cause a
5949 const value to be changed with no additional warning. We only
5950 issue this warning if T is the same on both sides, and we only
5951 issue the warning if there are the same number of pointers on
5952 both sides, as otherwise the cast is clearly unsafe anyhow. A
5953 cast is unsafe when a qualifier is added at one level and const
5954 is not present at all outer levels.
5956 To issue this warning, we check at each level whether the cast
5957 adds new qualifiers not already seen. We don't need to special
5958 case function types, as they won't have the same
5959 TYPE_MAIN_VARIANT. */
5969 do
5970 {
5975 {
5977 "to be safe all intermediate pointers in cast from "
5981 }
5984 }
5986 }
5988 /* Heuristic check if two parameter types can be considered ABI-equivalent. */
5990 static bool
5992 {
6000 /* The signedness of the parameter matters only when an integral
6001 type smaller than int is promoted to int, otherwise only the
6002 precision of the parameter matters.
6003 This check should make sure that the callee does not see
6004 undefined values in argument registers. */
6014 }
6016 /* Check if a type cast between two function types can be considered safe. */
6018 static bool
6020 {
6039 }
6041 /* Build an expression representing a cast to type TYPE of expression EXPR.
6042 LOC is the location of the cast-- typically the open paren of the cast. */
6044 tree
6046 {
6047 tree value;
6061 /* The ObjC front-end uses TYPE_MAIN_VARIANT to tie together types differing
6062 only in <protocol> qualifications. But when constructing cast expressions,
6063 the protocols do matter and must be kept around. */
6070 {
6073 }
6076 {
6079 }
6082 {
6086 }
6089 {
6094 /* Convert to remove any qualifiers from VALUE's type. */
6096 }
6098 {
6099 tree field;
6108 {
6109 tree t;
6121 }
6124 }
6125 else
6126 {
6130 {
6134 }
6138 /* Optionally warn about potentially worrisome casts. */
6144 /* Warn about conversions between pointers to disjoint
6145 address spaces. */
6149 {
6152 addr_space_t as_common;
6155 {
6166 else
6171 }
6172 }
6174 /* Warn about possible alignment problems. */
6180 /* Don't warn about opaque types, where the actual alignment
6181 restriction is unknown. */
6192 /* Unlike conversion of integers to pointers, where the
6193 warning is disabled for converting constants because
6194 of cases such as SIG_*, warn about converting constant
6195 pointers to integers. In some cases it may cause unwanted
6196 sign extension, and a warning is appropriate. */
6203 "cast from function call of type %qT "
6209 /* Don't warn about converting any constant. */
6218 /* If pedantic, warn for conversions between function and object
6219 pointer types, except for converting a null pointer constant
6220 to function pointer type. */
6245 "cast between incompatible function types"
6251 /* Ignore any integer overflow caused by the cast. */
6253 {
6255 {
6257 {
6258 /* Avoid clobbering a shared constant. */
6261 }
6262 }
6264 /* Reset VALUE's overflow flags, ensuring constant sharing. */
6266 }
6267 }
6269 /* Don't let a cast be an lvalue. */
6273 /* Don't allow the results of casting to floating-point or complex
6274 types be confused with actual constants, or casts involving
6275 integer and pointer types other than direct integer-to-integer
6276 and integer-to-pointer be confused with integer constant
6277 expressions and null pointer constants. */
6287 /* If the expression has integer operands and so can occur in an
6288 unevaluated part of an integer constant expression, ensure the
6289 return value reflects this. */
6298 }
6300 /* Interpret a cast of expression EXPR to type TYPE. LOC is the
6301 location of the open paren of the cast, or the position of the cast
6302 expr. */
6303 tree
6305 {
6306 tree type;
6309 tree ret;
6312 /* This avoids warnings about unprototyped casts on
6313 integers. E.g. "#define SIG_DFL (void(*)())0". */
6325 {
6332 }
6337 /* C++ does not permits types to be defined in a cast, but it
6338 allows references to incomplete types. */
6344 }
6345 \f
6346 /* Build an assignment expression of lvalue LHS from value RHS.
6347 If LHS_ORIGTYPE is not NULL, it is the original type of LHS, which
6348 may differ from TREE_TYPE (LHS) for an enum bitfield.
6349 MODIFYCODE is the code for a binary operator that we use
6350 to combine the old value of LHS with RHS to get the new value.
6351 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
6352 If RHS_ORIGTYPE is not NULL_TREE, it is the original type of RHS,
6353 which may differ from TREE_TYPE (RHS) for an enum value.
6355 LOCATION is the location of the MODIFYCODE operator.
6356 RHS_LOC is the location of the RHS. */
6358 tree
6362 {
6363 tree result;
6364 tree newrhs;
6371 /* Types that aren't fully specified cannot be used in assignments. */
6374 /* Avoid duplicate error messages from operands that had errors. */
6378 /* Ensure an error for assigning a non-lvalue array to an array in
6379 C90. */
6381 {
6384 }
6386 /* For ObjC properties, defer this check. */
6395 {
6398 rhs_origtype);
6407 }
6409 /* If a binary op has been requested, combine the old LHS value with the RHS
6410 producing the value we should actually store into the LHS. */
6413 {
6417 /* Construct the RHS for any non-atomic compound assignemnt. */
6419 {
6420 /* If in LHS op= RHS the RHS has side-effects, ensure they
6421 are preevaluated before the rest of the assignment expression's
6422 side-effects, because RHS could contain e.g. function calls
6423 that modify LHS. */
6425 {
6428 else
6433 newrhs);
6434 }
6438 /* The original type of the right hand side is no longer
6439 meaningful. */
6441 }
6442 }
6445 {
6446 /* Check if we are modifying an Objective-C property reference;
6447 if so, we need to generate setter calls. */
6450 else
6455 /* Else, do the check that we postponed for Objective-C. */
6458 }
6460 /* Give an error for storing in something that is 'const'. */
6465 {
6468 }
6472 /* If storing into a structure or union member,
6473 it has probably been given type `int'.
6474 Compute the type that would go with
6475 the actual amount of storage the member occupies. */
6484 /* If storing in a field that is in actuality a short or narrower than one,
6485 we must store in the field in its actual type. */
6488 {
6491 }
6493 /* Issue -Wc++-compat warnings about an assignment to an enum type
6494 when LHS does not have its original type. This happens for,
6495 e.g., an enum bitfield in a struct. */
6500 {
6502 ? rhs_origtype
6509 }
6511 /* Remove qualifiers. */
6515 /* Convert new value to destination type. Fold it first, then
6516 restore any excess precision information, for the sake of
6517 conversion warnings. */
6520 {
6523 {
6525 {
6528 }
6533 }
6534 else
6541 }
6543 /* Emit ObjC write barrier, if necessary. */
6545 {
6548 {
6551 }
6552 }
6554 /* Scan operands. */
6558 else
6559 {
6563 }
6565 /* If we got the LHS in a different type for storing in,
6566 convert the result back to the nominal type of LHS
6567 so that the value we return always has the same type
6568 as the LHS argument. */
6578 return_result:
6582 }
6583 \f
6584 /* Return whether STRUCT_TYPE has an anonymous field with type TYPE.
6585 This is used to implement -fplan9-extensions. */
6587 static bool
6589 {
6590 tree field;
6598 {
6601 TYPE_QUAL_ATOMIC)
6605 {
6609 }
6613 {
6617 }
6618 }
6620 }
6622 /* RHS is an expression whose type is pointer to struct. If there is
6623 an anonymous field in RHS with type TYPE, then return a pointer to
6624 that field in RHS. This is used with -fplan9-extensions. This
6625 returns NULL if no conversion could be found. */
6627 static tree
6629 {
6633 tree ret;
6642 TYPE_QUAL_ATOMIC)
6650 {
6656 TYPE_QUAL_ATOMIC)
6659 {
6663 }
6665 lhs_main_type))
6666 {
6671 }
6672 }
6679 NULL_TREE);
6683 {
6686 }
6689 }
6691 /* Issue an error message for a bad initializer component.
6692 GMSGID identifies the message.
6693 The component name is taken from the spelling stack. */
6697 {
6700 auto_diagnostic_group d;
6702 /* The gmsgid may be a format string with %< and %>. */
6711 }
6713 /* Issue a pedantic warning for a bad initializer component. OPT is
6714 the option OPT_* (from options.h) controlling this warning or 0 if
6715 it is unconditionally given. GMSGID identifies the message. The
6716 component name is taken from the spelling stack. */
6720 {
6721 /* Use the location where a macro was expanded rather than where
6722 it was defined to make sure macros defined in system headers
6723 but used incorrectly elsewhere are diagnosed. */
6725 auto_diagnostic_group d;
6733 }
6735 /* Issue a warning for a bad initializer component.
6737 OPT is the OPT_W* value corresponding to the warning option that
6738 controls this warning. GMSGID identifies the message. The
6739 component name is taken from the spelling stack. */
6741 static void
6743 {
6747 auto_diagnostic_group d;
6749 /* Use the location where a macro was expanded rather than where
6750 it was defined to make sure macros defined in system headers
6751 but used incorrectly elsewhere are diagnosed. */
6754 /* The gmsgid may be a format string with %< and %>. */
6759 }
6760 \f
6761 /* If TYPE is an array type and EXPR is a parenthesized string
6762 constant, warn if pedantic that EXPR is being used to initialize an
6763 object of type TYPE. */
6765 void
6767 {
6774 }
6776 /* Attempt to locate the parameter with the given index within FNDECL,
6777 returning DECL_SOURCE_LOCATION (FNDECL) if it can't be found. */
6779 static location_t
6781 {
6783 tree param;
6785 /* Locate param by index within DECL_ARGUMENTS (fndecl). */
6789 ;
6791 /* If something went wrong (e.g. if we have a builtin and thus no arguments),
6792 return DECL_SOURCE_LOCATION (FNDECL). */
6797 }
6799 /* Issue a note about a mismatching argument for parameter PARMNUM
6800 to FUNDECL, for types EXPECTED_TYPE and ACTUAL_TYPE.
6801 Attempt to issue the note at the pertinent parameter of the decl;
6802 failing that issue it at the location of FUNDECL; failing that
6803 issue it at PLOC. */
6805 static void
6808 {
6809 location_t loc;
6812 else
6818 }
6820 /* Issue a warning when an argument of ARGTYPE is passed to a built-in
6821 function FUNDECL declared without prototype to parameter PARMNUM of
6822 PARMTYPE when ARGTYPE does not promote to PARMTYPE. */
6824 static void
6827 {
6832 /* Avoid warning for enum arguments that promote to an integer type
6833 of the same size/mode. */
6845 /* This diagnoses even signed/unsigned mismatches. Those might be
6846 safe in many cases but GCC may emit suboptimal code for them so
6847 warning on those cases drives efficiency improvements. */
6851 "in a call to built-in function declared without "
6854 "in a call to built-in function declared without "
6859 fundecl);
6860 }
6862 /* Convert value RHS to type TYPE as preparation for an assignment to
6863 an lvalue of type TYPE. If ORIGTYPE is not NULL_TREE, it is the
6864 original type of RHS; this differs from TREE_TYPE (RHS) for enum
6865 types. NULL_POINTER_CONSTANT says whether RHS was a null pointer
6866 constant before any folding.
6867 The real work of conversion is done by `convert'.
6868 The purpose of this function is to generate error messages
6869 for assignments that are not allowed in C.
6870 ERRTYPE says whether it is argument passing, assignment,
6871 initialization or return.
6873 In the following example, '~' denotes where EXPR_LOC and '^' where
6874 LOCATION point to:
6876 f (var); [ic_argpass]
6877 ^ ~~~
6878 x = var; [ic_assign]
6879 ^ ~~~;
6880 int x = var; [ic_init]
6881 ^^^
6882 return x; [ic_return]
6883 ^
6885 FUNCTION is a tree for the function being called.
6886 PARMNUM is the number of the argument, for printing in error messages.
6887 WARNOPT may be set to a warning option to issue the corresponding warning
6888 rather than an error for invalid conversions. Used for calls to built-in
6889 functions declared without a prototype. */
6891 static tree
6896 {
6899 tree rhstype;
6904 /* Use the expansion point location to handle cases such as user's
6905 function returning a wrong-type macro defined in a system header. */
6909 {
6910 tree selector;
6911 /* Change pointer to function to the function itself for
6912 diagnostics. */
6917 /* Handle an ObjC selector specially for diagnostics. */
6921 {
6924 }
6925 }
6927 /* This macro is used to emit diagnostics to ensure that all format
6928 strings are complete sentences, visible to gettext and checked at
6929 compile time. */
6930 #define PEDWARN_FOR_ASSIGNMENT(LOCATION, PLOC, OPT, AR, AS, IN, RE) \
6931 do { \
6932 switch (errtype) \
6933 { \
6934 case ic_argpass: \
6935 { \
6936 auto_diagnostic_group d; \
6937 if (pedwarn (PLOC, OPT, AR, parmnum, rname)) \
6938 inform_for_arg (fundecl, (PLOC), parmnum, type, rhstype); \
6939 } \
6940 break; \
6941 case ic_assign: \
6942 pedwarn (LOCATION, OPT, AS); \
6943 break; \
6944 case ic_init: \
6945 case ic_init_const: \
6946 pedwarn_init (LOCATION, OPT, IN); \
6947 break; \
6948 case ic_return: \
6949 pedwarn (LOCATION, OPT, RE); \
6950 break; \
6951 default: \
6952 gcc_unreachable (); \
6953 } \
6954 } while (0)
6956 /* This macro is used to emit diagnostics to ensure that all format
6957 strings are complete sentences, visible to gettext and checked at
6958 compile time. It can be called with 'pedwarn' or 'warning_at'. */
6959 #define WARNING_FOR_QUALIFIERS(PEDWARN, LOCATION, PLOC, OPT, AR, AS, IN, RE, QUALS) \
6960 do { \
6961 switch (errtype) \
6962 { \
6963 case ic_argpass: \
6964 { \
6965 auto_diagnostic_group d; \
6966 if (PEDWARN) { \
6967 if (pedwarn (PLOC, OPT, AR, parmnum, rname, QUALS)) \
6968 inform_for_arg (fundecl, (PLOC), parmnum, type, rhstype); \
6969 } else { \
6970 if (warning_at (PLOC, OPT, AR, parmnum, rname, QUALS)) \
6971 inform_for_arg (fundecl, (PLOC), parmnum, type, rhstype); \
6972 } \
6973 } \
6974 break; \
6975 case ic_assign: \
6976 if (PEDWARN) \
6977 pedwarn (LOCATION, OPT, AS, QUALS); \
6978 else \
6979 warning_at (LOCATION, OPT, AS, QUALS); \
6980 break; \
6981 case ic_init: \
6982 case ic_init_const: \
6983 if (PEDWARN) \
6984 pedwarn (LOCATION, OPT, IN, QUALS); \
6985 else \
6986 warning_at (LOCATION, OPT, IN, QUALS); \
6987 break; \
6988 case ic_return: \
6989 if (PEDWARN) \
6990 pedwarn (LOCATION, OPT, RE, QUALS); \
6991 else \
6992 warning_at (LOCATION, OPT, RE, QUALS); \
6993 break; \
6994 default: \
6995 gcc_unreachable (); \
6996 } \
6997 } while (0)
6999 /* This macro is used to emit diagnostics to ensure that all format
7000 strings are complete sentences, visible to gettext and checked at
7001 compile time. It is the same as PEDWARN_FOR_ASSIGNMENT but with an
7002 extra parameter to enumerate qualifiers. */
7003 #define PEDWARN_FOR_QUALIFIERS(LOCATION, PLOC, OPT, AR, AS, IN, RE, QUALS) \
7004 WARNING_FOR_QUALIFIERS (true, LOCATION, PLOC, OPT, AR, AS, IN, RE, QUALS)
7017 {
7021 {
7038 }
7041 }
7044 {
7050 {
7076 }
7077 }
7080 {
7086 {
7091 }
7092 }
7095 {
7098 }
7101 {
7102 /* Except for passing an argument to an unprototyped function,
7103 this is a constraint violation. When passing an argument to
7104 an unprototyped function, it is compile-time undefined;
7105 making it a constraint in that case was rejected in
7106 DR#252. */
7110 else
7113 }
7121 /* A non-reference type can convert to a reference. This handles
7122 va_start, va_copy and possibly port built-ins. */
7124 {
7126 {
7130 else
7133 }
7150 }
7151 /* Some types can interconvert without explicit casts. */
7155 /* Arithmetic types all interconvert, and enum is treated like int. */
7164 {
7167 rhstype);
7180 }
7182 /* Aggregates in different TUs might need conversion. */
7189 /* Conversion to a transparent union or record from its member types.
7190 This applies only to function arguments. */
7194 {
7198 {
7209 {
7213 /* Any non-function converts to a [const][volatile] void *
7214 and vice versa; otherwise, targets must be the same.
7215 Meanwhile, the lhs target must have all the qualifiers of
7216 the rhs. */
7220 {
7223 /* If this type won't generate any warnings, use it. */
7231 /* Keep looking for a better type, but remember this one. */
7234 }
7235 }
7237 /* Can convert integer zero to any pointer type. */
7239 {
7242 }
7243 }
7246 {
7248 {
7249 /* We have only a marginally acceptable member type;
7250 it needs a warning. */
7254 /* Const and volatile mean something different for function
7255 types, so the usual warnings are not appropriate. */
7258 {
7259 /* Because const and volatile on functions are
7260 restrictions that say the function will not do
7261 certain things, it is okay to use a const or volatile
7262 function where an ordinary one is wanted, but not
7263 vice-versa. */
7267 OPT_Wdiscarded_qualifiers,
7269 "makes %q#v qualified function "
7272 "function pointer from "
7275 "function pointer from "
7280 }
7284 OPT_Wdiscarded_qualifiers,
7296 }
7304 }
7305 }
7307 /* Conversions among pointers */
7310 {
7311 /* If RHS refers to a built-in declared without a prototype
7312 BLTIN is the declaration of the built-in with a prototype
7313 and RHSTYPE is set to the actual type of the built-in. */
7314 tree bltin;
7323 addr_space_t asl;
7324 addr_space_t asr;
7329 TYPE_QUAL_ATOMIC)
7334 TYPE_QUAL_ATOMIC)
7336 /* Opaque pointers are treated like void pointers. */
7339 /* The Plan 9 compiler permits a pointer to a struct to be
7340 automatically converted into a pointer to an anonymous field
7341 within the struct. */
7346 {
7349 {
7355 }
7356 }
7358 /* C++ does not allow the implicit conversion void* -> T*. However,
7359 for the purpose of reducing the number of false positives, we
7360 tolerate the special case of
7362 int *p = NULL;
7364 where NULL is typically defined in C to be '(void *) 0'. */
7367 OPT_Wc___compat,
7368 "request for implicit conversion "
7371 /* See if the pointers point to incompatible address spaces. */
7376 {
7377 auto_diagnostic_group d;
7380 {
7382 {
7386 diagnosed
7388 else
7391 }
7393 {
7398 else
7401 }
7404 {
7409 else
7412 }
7414 {
7419 else
7422 }
7425 }
7427 {
7430 else
7433 }
7435 }
7437 /* Check if the right-hand side has a format attribute but the
7438 left-hand side doesn't. */
7441 {
7443 {
7446 "argument %d of %qE might be "
7452 "assignment left-hand side might be "
7458 "initialization left-hand side might be "
7463 "return type might be "
7468 }
7469 }
7471 /* See if the pointers point to incompatible scalar storage orders. */
7475 {
7476 tree t;
7479 {
7481 /* Do not warn for built-in functions, for example memcpy, since we
7482 control how they behave and they can be useful in this area. */
7486 "passing argument %d of %qE from incompatible "
7490 /* Do not warn if the RHS is a call to a function that returns a
7491 pointer that is not an alias. */
7496 "assignment to %qT from pointer type %qT with "
7501 /* Likewise. */
7506 "initialization of %qT from pointer type %qT with "
7511 "returning %qT from pointer type with incompatible "
7516 }
7517 }
7519 /* Any non-function converts to a [const][volatile] void *
7520 and vice versa; otherwise, targets must be the same.
7521 Meanwhile, the lhs target must have all the qualifiers of the rhs. */
7525 || is_opaque_pointer
7531 {
7532 /* Warn about loss of qualifers from pointers to arrays with
7533 qualifiers on the element type. */
7535 {
7543 OPT_Wdiscarded_array_qualifiers,
7553 }
7556 ||
7558 && !null_pointer_constant
7562 "%qE between function pointer "
7570 /* Const and volatile mean something different for function types,
7571 so the usual warnings are not appropriate. */
7574 {
7575 /* Assignments between atomic and non-atomic objects are OK. */
7581 /* Don't warn about loss of qualifier for conversions from
7582 qualified void* to pointers to arrays with corresponding
7583 qualifier on the element type (except for pedantic before C23). */
7586 OPT_Wdiscarded_qualifiers,
7600 /* If this is not a case of ignoring a mismatch in signedness,
7601 no warning. */
7604 ;
7605 /* If there is a mismatch, do warn. */
7608 {
7610 {
7611 auto_diagnostic_group d;
7615 "pointer targets in passing argument %d of "
7618 rhstype);
7619 }
7623 "pointer targets in assignment from %qT to %qT "
7629 "pointer targets in initialization of %qT "
7631 rhstype);
7635 "returning %qT from a function with return type "
7640 }
7641 }
7644 {
7645 /* Because const and volatile on functions are restrictions
7646 that say the function will not do certain things,
7647 it is okay to use a const or volatile function
7648 where an ordinary one is wanted, but not vice-versa. */
7652 OPT_Wdiscarded_qualifiers,
7654 "%q#v qualified function pointer "
7663 }
7664 }
7665 /* Avoid warning about the volatile ObjC EH puts on decls. */
7667 {
7669 {
7671 {
7672 auto_diagnostic_group d;
7676 "passing argument %d of %qE from incompatible "
7679 }
7684 "assignment to %qT from pointer to "
7687 else
7696 "initialization of %qT from pointer to "
7699 else
7701 "initialization of %qT from incompatible "
7708 "returning pointer to %qD of type %qT from "
7711 else
7713 "returning %qT from a function with incompatible "
7718 }
7719 }
7721 /* If RHS isn't an address, check pointer or array of packed
7722 struct or union. */
7726 }
7728 {
7729 /* ??? This should not be an error when inlining calls to
7730 unprototyped functions. */
7734 else
7737 }
7740 {
7741 /* An explicit constant 0 or type nullptr_t can convert to a pointer,
7742 or one that results from arithmetic, even including a cast to
7743 integer type. */
7746 {
7748 {
7749 auto_diagnostic_group d;
7753 "passing argument %d of %qE makes pointer from "
7756 }
7760 "assignment to %qT from %qT makes pointer from integer "
7766 "initialization of %qT from %qT makes pointer from "
7771 "function with return type %qT makes pointer from "
7776 }
7779 }
7781 {
7783 {
7785 {
7786 auto_diagnostic_group d;
7790 "passing argument %d of %qE makes integer from "
7793 }
7797 "assignment to %qT from %qT makes integer from pointer "
7803 "initialization of %qT from %qT makes integer from "
7808 "function with return type %qT makes integer from "
7813 }
7816 }
7818 /* The type nullptr_t may be converted to bool. The
7819 result is false. */
7821 {
7822 tree ret;
7828 }
7833 {
7835 {
7836 auto_diagnostic_group d;
7842 else
7845 }
7848 {
7853 else
7856 }
7859 {
7864 else
7867 }
7869 {
7874 else
7877 }
7880 }
7883 }
7884 \f
7885 /* If VALUE is a compound expr all of whose expressions are constant, then
7886 return its value. Otherwise, return error_mark_node.
7888 This is for handling COMPOUND_EXPRs as initializer elements
7889 which is allowed with a warning when -pedantic is specified. */
7891 static tree
7893 {
7895 {
7900 endtype);
7901 }
7904 else
7906 }
7907 \f
7908 /* Perform appropriate conversions on the initial value of a variable,
7909 store it in the declaration DECL,
7910 and print any error messages that are appropriate.
7911 If ORIGTYPE is not NULL_TREE, it is the original type of INIT.
7912 If the init is invalid, store an ERROR_MARK.
7914 INIT_LOC is the location of the initial value. */
7916 void
7918 {
7924 /* If variable's type was invalidly declared, just ignore it. */
7930 /* Digest the specified initializer into an expression. */
7933 {
7938 /* Not fully determined before folding. */
7940 }
7947 /* Store the expression if valid; else report error. */
7957 /* ANSI wants warnings about out-of-range constant initializers. */
7962 /* Check if we need to set array size from compound literal size. */
7966 {
7973 {
7977 {
7978 /* For int foo[] = (int [3]){1}; we need to set array size
7979 now since later on array initializer will be just the
7980 brace enclosed list of the compound literal. */
7988 }
7989 }
7990 }
7991 }
7992 \f
7993 /* Methods for storing and printing names for error messages. */
7995 /* Implement a spelling stack that allows components of a name to be pushed
7996 and popped. Each element on the stack is this structure. */
7998 struct spelling
7999 {
8001 union
8002 {
8006 };
8008 #define SPELLING_STRING 1
8009 #define SPELLING_MEMBER 2
8010 #define SPELLING_BOUNDS 3
8016 /* Macros to save and restore the spelling stack around push_... functions.
8017 Alternative to SAVE_SPELLING_STACK. */
8019 #define SPELLING_DEPTH() (spelling - spelling_base)
8020 #define RESTORE_SPELLING_DEPTH(DEPTH) (spelling = spelling_base + (DEPTH))
8022 /* Push an element on the spelling stack with type KIND and assign VALUE
8023 to MEMBER. */
8025 #define PUSH_SPELLING(KIND, VALUE, MEMBER) \
8026 { \
8027 int depth = SPELLING_DEPTH (); \
8028 \
8029 if (depth >= spelling_size) \
8030 { \
8031 spelling_size += 10; \
8032 spelling_base = XRESIZEVEC (struct spelling, spelling_base, \
8033 spelling_size); \
8034 RESTORE_SPELLING_DEPTH (depth); \
8035 } \
8036 \
8037 spelling->kind = (KIND); \
8038 spelling->MEMBER = (VALUE); \
8039 spelling++; \
8040 }
8042 /* Push STRING on the stack. Printed literally. */
8044 static void
8046 {
8048 }
8050 /* Push a member name on the stack. Printed as '.' STRING. */
8052 static void
8054 {
8060 }
8062 /* Push an array bounds on the stack. Printed as [BOUNDS]. */
8064 static void
8066 {
8068 }
8070 /* Compute the maximum size in bytes of the printed spelling. */
8072 static int
8074 {
8079 {
8082 else
8084 }
8087 }
8089 /* Print the spelling to BUFFER and return it. */
8093 {
8099 {
8102 }
8103 else
8104 {
8109 ;
8110 }
8113 }
8115 /* Check whether INIT, a floating or integer constant, is
8116 representable in TYPE, a real floating type with the same radix or
8117 a decimal floating type initialized with a binary floating
8118 constant. Return true if OK, false if not. */
8119 static bool
8121 {
8126 {
8127 /* Same mode, no conversion required except for the case of
8128 signaling NaNs if the types are incompatible (e.g. double and
8129 long double with the same mode). */
8135 }
8137 {
8143 }
8153 {
8154 /* This is valid if the real number represented by the
8155 initializer can be exactly represented in the decimal
8156 type. Compare the values using MPFR. */
8157 REAL_VALUE_TYPE t;
8170 }
8171 /* exact_real_truncate is not quite right here, since it doesn't
8172 allow even an exact conversion to subnormal values. */
8173 REAL_VALUE_TYPE t;
8176 }
8178 /* Check whether INIT (location LOC) is valid as a 'constexpr'
8179 initializer for type TYPE, and give an error if not. INIT has
8180 already been folded and verified to be constant. INT_CONST_EXPR
8181 and ARITH_CONST_EXPR say whether it is an integer constant
8182 expression or arithmetic constant expression, respectively. If
8183 TYPE is not a scalar type, this function does nothing. */
8185 static void
8188 {
8190 {
8191 /* The initializer must be null. */
8195 }
8197 {
8198 /* The initializer must be an integer constant expression,
8199 representable in the target type. */
8207 }
8208 /* We don't apply any extra checks to extension types such as vector
8209 or fixed-point types. */
8213 {
8217 }
8218 /* We don't apply any extra checks to complex integers. */
8222 /* Following N3082, a real type cannot be initialized from a complex
8223 type and a binary type cannot be initialized from a decimal type
8224 (but initializing a decimal type from a binary type is OK).
8225 Signaling NaN initializers are OK only if the types are
8226 compatible (not just the same mode); all quiet NaN and infinity
8227 initializations are considered to preserve the value. */
8230 {
8234 }
8239 {
8243 }
8246 {
8248 {
8261 }
8262 }
8263 else
8268 }
8270 /* Digest the parser output INIT as an initializer for type TYPE.
8271 Return a C expression of type TYPE to represent the initial value.
8273 If ORIGTYPE is not NULL_TREE, it is the original type of INIT.
8275 NULL_POINTER_CONSTANT is true if INIT is a null pointer constant,
8276 INT_CONST_EXPR is true if INIT is an integer constant expression,
8277 and ARITH_CONST_EXPR is true if INIT is, or might be, an arithmetic
8278 constant expression, false if it has already been determined in the
8279 caller that it is not (but folding may have made the value passed here
8280 indistinguishable from an arithmetic constant expression).
8282 If INIT is a string constant, STRICT_STRING is true if it is
8283 unparenthesized or we should not warn here for it being parenthesized.
8284 For other types of INIT, STRICT_STRING is not used.
8286 INIT_LOC is the location of the INIT.
8288 REQUIRE_CONSTANT requests an error if non-constant initializers or
8289 elements are seen. REQUIRE_CONSTEXPR means the stricter requirements
8290 on initializers for 'constexpr' objects apply. */
8292 static tree
8297 {
8304 || !init
8311 {
8313 {
8316 }
8318 }
8319 /* TODO: this may not detect all cases of expressions folding to
8320 constants that are not arithmetic constant expressions. */
8334 /* Initialization of an array of chars from a string constant
8335 optionally enclosed in braces. */
8339 {
8340 tree typ1
8343 TYPE_QUAL_ATOMIC)
8345 /* Note that an array could be both an array of character type
8346 and an array of wchar_t if wchar_t is signed char or unsigned
8347 char. */
8356 {
8375 {
8378 }
8383 {
8388 }
8392 {
8393 /* Check if all characters of the string can be
8394 represented in the type of the constexpr object being
8395 initialized. */
8402 {
8406 }
8407 }
8412 {
8416 /* Subtract the size of a single (possibly wide) character
8417 because it's ok to ignore the terminating null char
8418 that is counted in the length of the constant. */
8429 {
8430 unsigned HOST_WIDE_INT size
8435 }
8436 }
8440 }
8442 {
8446 }
8447 }
8449 /* Build a VECTOR_CST from a *constant* vector constructor. If the
8450 vector constructor is not constant (e.g. {1,2,3,foo()}) then punt
8451 below and handle as a constructor. */
8456 {
8463 {
8465 tree value;
8468 /* Iterate through elements and check if all constructor
8469 elements are *_CSTs. */
8472 {
8475 }
8480 }
8481 }
8486 /* Any type can be initialized
8487 from an expression of the same type, optionally with braces. */
8500 {
8502 {
8504 {
8507 inside_init = array_to_pointer_conversion
8509 else
8510 {
8513 }
8514 }
8515 }
8518 /* Although the types are compatible, we may require a
8519 conversion. */
8524 {
8525 /* As an extension, allow initializing objects with static storage
8526 duration with compound literals (which are then treated just as
8527 the brace enclosed list they contain). Also allow this for
8528 vectors, as we can only assign them with compound literals. */
8534 }
8538 {
8542 }
8544 /* Compound expressions can only occur here if -Wpedantic or
8545 -pedantic-errors is specified. In the later case, we always want
8546 an error. In the former case, we simply want a warning. */
8549 {
8550 inside_init
8555 else
8560 }
8564 {
8567 }
8575 /* Added to enable additional -Wsuggest-attribute=format warnings. */
8579 (require_constant
8580 ? ic_init_const
8584 }
8586 /* Handle scalar types, including conversions. */
8591 {
8599 inside_init);
8600 inside_init
8607 /* Check to see if we have already given an error message. */
8609 ;
8611 {
8614 }
8618 {
8622 }
8631 }
8633 /* Come here only for records and arrays. */
8636 {
8638 "variable-sized object may not be initialized except "
8641 }
8645 }
8646 \f
8647 /* Handle initializers that use braces. */
8649 /* Type of object we are accumulating a constructor for.
8650 This type is always a RECORD_TYPE, UNION_TYPE or ARRAY_TYPE. */
8653 /* For a RECORD_TYPE or UNION_TYPE, this is the chain of fields
8654 left to fill. */
8657 /* For an ARRAY_TYPE, this is the specified index
8658 at which to store the next element we get. */
8661 /* For an ARRAY_TYPE, this is the maximum index. */
8664 /* For a RECORD_TYPE, this is the first field not yet written out. */
8667 /* For an ARRAY_TYPE, this is the index of the first element
8668 not yet written out. */
8671 /* In a RECORD_TYPE, the byte index of the next consecutive field.
8672 This is so we can generate gaps between fields, when appropriate. */
8675 /* If we are saving up the elements rather than allocating them,
8676 this is the list of elements so far (in reverse order,
8677 most recent first). */
8680 /* 1 if constructor should be incrementally stored into a constructor chain,
8681 0 if all the elements should be kept in AVL tree. */
8684 /* 1 if so far this constructor's elements are all compile-time constants. */
8687 /* 1 if so far this constructor's elements are all valid address constants. */
8690 /* 1 if this constructor has an element that cannot be part of a
8691 constant expression. */
8694 /* 1 if this constructor is erroneous so far. */
8697 /* 1 if this constructor is the universal zero initializer { 0 }. */
8700 /* Structure for managing pending initializer elements, organized as an
8701 AVL tree. */
8703 struct init_node
8704 {
8708 tree purpose;
8709 tree value;
8710 tree origtype;
8711 };
8713 /* Tree of pending elements at this constructor level.
8714 These are elements encountered out of order
8715 which belong at places we haven't reached yet in actually
8716 writing the output.
8717 Will never hold tree nodes across GC runs. */
8720 /* The SPELLING_DEPTH of this constructor. */
8723 /* DECL node for which an initializer is being read.
8724 0 means we are reading a constructor expression
8725 such as (struct foo) {...}. */
8728 /* Nonzero if there were any member designators in this initializer. */
8731 /* Nesting depth of designator list. */
8734 /* Nonzero if there were diagnosed errors in this designator list. */
8737 \f
8738 /* This stack has a level for each implicit or explicit level of
8739 structuring in the initializer, including the outermost one. It
8740 saves the values of most of the variables above. */
8744 struct constructor_stack
8745 {
8747 tree type;
8748 tree fields;
8749 tree index;
8750 tree max_index;
8751 tree unfilled_index;
8752 tree unfilled_fields;
8753 tree bit_index;
8758 /* If value nonzero, this value should replace the entire
8759 constructor at this level. */
8771 };
8775 /* This stack represents designators from some range designator up to
8776 the last designator in the list. */
8778 struct constructor_range_stack
8779 {
8782 tree range_start;
8783 tree index;
8784 tree range_end;
8785 tree fields;
8786 };
8790 /* This stack records separate initializers that are nested.
8791 Nested initializers can't happen in ANSI C, but GNU C allows them
8792 in cases like { ... (struct foo) { ... } ... }. */
8794 struct initializer_stack
8795 {
8797 tree decl;
8809 };
8812 \f
8813 /* Prepare to parse and output the initializer for variable DECL. */
8815 void
8819 {
8844 {
8845 require_constant_elements
8847 /* For a scalar, you can always use any value to initialize,
8848 even within braces. */
8851 }
8852 else
8853 {
8856 }
8869 }
8871 void
8873 {
8876 /* Free the whole constructor stack of this initializer. */
8878 {
8882 }
8886 /* Pop back to the data of the outer initializer (if any). */
8902 }
8903 \f
8904 /* Call here when we see the initializer is surrounded by braces.
8905 This is instead of a call to push_init_level;
8906 it is matched by a call to pop_init_level.
8908 TYPE is the type to initialize, for a constructor expression.
8909 For an initializer for a decl, TYPE is zero. */
8911 void
8913 {
8963 {
8965 /* Skip any nameless bit fields at the beginning. */
8972 }
8974 {
8976 {
8977 constructor_max_index
8980 /* Detect non-empty initializations of zero-length arrays. */
8985 /* constructor_max_index needs to be an INTEGER_CST. Attempts
8986 to initialize VLAs with a nonempty initializer will cause a
8987 proper error; avoid tree checking errors as well by setting a
8988 safe value. */
8993 constructor_index
8996 }
8997 else
8998 {
9001 }
9004 }
9006 {
9007 /* Vectors are like simple fixed-size arrays. */
9008 constructor_max_index =
9012 }
9013 else
9014 {
9015 /* Handle the case of int x = {5}; */
9018 }
9019 }
9020 \f
9023 /* Called when we see an open brace for a nested initializer. Finish
9024 off any pending levels with implicit braces. */
9025 void
9027 {
9029 {
9034 last_init_list_comma),
9037 && constructor_max_index
9039 constructor_index))
9042 last_init_list_comma),
9044 else
9046 }
9047 }
9049 /* Push down into a subobject, for initialization.
9050 If this is for an explicit set of braces, IMPLICIT is 0.
9051 If it is because the next element belongs at a lower level,
9052 IMPLICIT is 1 (or 2 if the push is because of designator list). */
9054 void
9057 {
9061 /* Unless this is an explicit brace, we need to preserve previous
9062 content if any. */
9064 {
9069 }
9104 /* If the upper initializer is designated, then mark this as
9105 designated too to prevent bogus warnings. */
9109 {
9114 }
9116 /* Don't die if an entire brace-pair level is superfluous
9117 in the containing level. */
9119 ;
9121 {
9122 /* Don't die if there are extra init elts at the end. */
9125 else
9126 {
9129 constructor_depth++;
9130 }
9131 }
9133 {
9136 constructor_depth++;
9137 }
9140 {
9145 }
9148 {
9157 }
9160 {
9165 }
9168 {
9170 /* Skip any nameless bit fields at the beginning. */
9177 }
9179 {
9180 /* Vectors are like simple fixed-size arrays. */
9181 constructor_max_index =
9185 }
9187 {
9189 {
9190 constructor_max_index
9193 /* Detect non-empty initializations of zero-length arrays. */
9198 /* constructor_max_index needs to be an INTEGER_CST. Attempts
9199 to initialize VLAs will cause a proper error; avoid tree
9200 checking errors as well by setting a safe value. */
9205 constructor_index
9208 }
9209 else
9214 {
9215 /* We need to split the char/wchar array into individual
9216 characters, so that we don't have to special case it
9217 everywhere. */
9219 }
9220 }
9221 else
9222 {
9227 }
9228 }
9230 /* At the end of an implicit or explicit brace level,
9231 finish up that level of constructor. If a single expression
9232 with redundant braces initialized that level, return the
9233 c_expr structure for that expression. Otherwise, the original_code
9234 element is set to ERROR_MARK.
9235 If we were outputting the elements as they are read, return 0 as the value
9236 from inner levels (process_init_element ignores that),
9237 but return error_mark_node as the value from the outermost level
9238 (that's what we want to put in DECL_INITIAL).
9239 Otherwise, return a CONSTRUCTOR expression as the value. */
9241 struct c_expr
9244 location_t insert_before)
9245 {
9254 {
9255 /* When we come to an explicit close brace,
9256 pop any inner levels that didn't have explicit braces. */
9260 insert_before),
9263 }
9264 else
9269 /* Now output all pending elements. */
9275 /* Error for initializing a flexible array member, or a zero-length
9276 array member in an inappropriate context. */
9281 {
9282 /* Silently discard empty initializations. The parser will
9283 already have pedwarned for empty brackets. */
9286 else
9287 {
9292 else
9296 /* We have already issued an error message for the existence
9297 of a flexible array member not at the end of the structure.
9298 Discard the initializer so that we do not die later. */
9301 }
9302 }
9305 {
9307 /* Initialization with { } counts as zeroinit. */
9311 /* This might be zeroinit as well. */
9316 /* If the constructor has more than one element, it can't be { 0 }. */
9319 }
9321 /* Warn when some structs are initialized with direct aggregation. */
9324 {
9327 OPT_Wmissing_braces,
9329 }
9331 /* Warn when some struct elements are implicitly initialized to zero. */
9333 && constructor_type
9336 {
9337 /* Do not warn for flexible array members or zero-length arrays. */
9344 /* Do not warn if this level of the initializer uses member
9345 designators; it is likely to be deliberate. */
9346 && !constructor_designated
9347 /* Do not warn about initializing with { 0 } or with { }. */
9349 {
9352 constructor_unfilled_fields,
9353 constructor_type))
9356 }
9357 }
9359 /* Pad out the end of the structure. */
9361 /* If this closes a superfluous brace pair,
9362 just pass out the element between them. */
9365 ;
9369 {
9370 /* A nonincremental scalar initializer--just return
9371 the element, after verifying there is just one.
9372 Empty scalar initializers are supported in C2X. */
9374 {
9378 /* Ensure this is a null pointer constant in the case of a
9379 'constexpr' object initialized with {}. */
9381 else
9383 }
9385 {
9388 }
9389 else
9391 }
9392 else
9393 {
9396 else
9397 {
9399 constructor_elements);
9406 }
9407 }
9410 {
9415 }
9444 }
9446 /* Common handling for both array range and field name designators.
9447 ARRAY argument is nonzero for array ranges. Returns false for success. */
9449 static bool
9452 {
9453 tree subtype;
9456 /* Don't die if an entire brace-pair level is superfluous
9457 in the containing level, or for an erroneous type. */
9461 /* If there were errors in this designator list already, bail out
9462 silently. */
9466 /* Likewise for an initializer for a variable-size type. Those are
9467 diagnosed in the parser, except for empty initializer braces. */
9473 {
9476 /* Designator list starts at the level of closest explicit
9477 braces. */
9481 last_init_list_comma),
9485 }
9488 {
9500 }
9504 {
9507 }
9509 {
9512 }
9518 }
9520 /* If there are range designators in designator list, push a new designator
9521 to constructor_range_stack. RANGE_END is end of such stack range or
9522 NULL_TREE if there is no range designator at this level. */
9524 static void
9526 {
9542 }
9544 /* Within an array initializer, specify the next index to be initialized.
9545 FIRST is that index. If LAST is nonzero, then initialize a range
9546 of indices, running from FIRST through LAST. */
9548 void
9551 {
9559 {
9562 }
9565 {
9569 "array index in initializer is not "
9571 }
9574 {
9578 "array index in initializer is not "
9580 }
9593 else
9594 {
9600 {
9603 }
9606 {
9610 {
9613 }
9614 else
9615 {
9619 {
9623 }
9624 }
9625 }
9627 designator_depth++;
9631 }
9632 }
9634 /* Within a struct initializer, specify the next field to be initialized. */
9636 void
9639 {
9640 tree field;
9648 {
9651 }
9656 {
9659 {
9665 }
9666 else
9669 }
9670 else
9671 do
9672 {
9674 designator_depth++;
9680 {
9683 }
9684 }
9686 }
9687 \f
9688 /* Add a new initializer to the tree of pending initializers. PURPOSE
9689 identifies the initializer, either array index or field in a structure.
9690 VALUE is the value of that index or field. If ORIGTYPE is not
9691 NULL_TREE, it is the original type of VALUE.
9693 IMPLICIT is true if value comes from pop_init_level (1),
9694 the new initializer has been merged with the existing one
9695 and thus no warnings should be emitted about overriding an
9696 existing initializer. */
9698 static void
9701 {
9708 {
9710 {
9716 else
9717 {
9719 {
9722 "initialized field with side-effects "
9727 }
9731 }
9732 }
9733 }
9734 else
9735 {
9736 tree bitpos;
9740 {
9746 else
9747 {
9749 {
9752 "initialized field with side-effects "
9757 }
9761 }
9762 }
9763 }
9778 {
9782 {
9786 {
9788 {
9789 /* L rotation. */
9802 {
9805 else
9807 }
9808 else
9810 }
9811 else
9812 {
9813 /* LR rotation. */
9835 {
9838 else
9840 }
9841 else
9843 }
9845 }
9846 else
9847 {
9848 /* p->balance == +1; growth of left side balances the node. */
9851 }
9852 }
9854 {
9856 /* Growth propagation from right side. */
9859 {
9861 {
9862 /* R rotation. */
9875 {
9878 else
9880 }
9881 else
9883 }
9885 {
9886 /* RL rotation */
9908 {
9911 else
9913 }
9914 else
9916 }
9918 }
9919 else
9920 {
9921 /* p->balance == -1; growth of right side balances the node. */
9924 }
9925 }
9929 }
9930 }
9932 /* Build AVL tree from a sorted chain. */
9934 static void
9936 {
9946 braced_init_obstack);
9949 {
9951 /* Skip any nameless bit fields at the beginning. */
9956 }
9958 {
9960 constructor_unfilled_index
9963 else
9965 }
9967 }
9969 /* Build AVL tree from a string constant. */
9971 static void
9974 {
9991 p < end
9992 && !(constructor_max_index
9995 {
9997 {
10000 }
10001 else
10002 {
10006 {
10009 else
10014 }
10015 }
10018 {
10021 {
10023 {
10026 }
10027 }
10029 {
10032 }
10036 }
10042 braced_init_obstack);
10043 }
10046 }
10048 /* Return value of FIELD in pending initializer or NULL_TREE if the field was
10049 not initialized yet. */
10051 static tree
10053 {
10057 {
10064 {
10069 else
10071 }
10072 }
10074 {
10078 && (!constructor_unfilled_fields
10085 {
10090 else
10092 }
10093 }
10095 {
10099 }
10101 }
10103 /* "Output" the next constructor element.
10104 At top level, really output it to assembler code now.
10105 Otherwise, collect it in a list from which we will make a CONSTRUCTOR.
10106 If ORIGTYPE is not NULL_TREE, it is the original type of VALUE.
10107 TYPE is the data type that the containing data type wants here.
10108 FIELD is the field (a FIELD_DECL) or the index that this element fills.
10109 If VALUE is a string constant, STRICT_STRING is true if it is
10110 unparenthesized or we should not warn here for it being parenthesized.
10111 For other types of VALUE, STRICT_STRING is not used.
10113 PENDING if true means output pending elements that belong
10114 right after this element. (PENDING is normally true;
10115 it is false while outputting pending elements, to avoid recursion.)
10117 IMPLICIT is true if value comes from pop_init_level (1),
10118 the new initializer has been merged with the existing one
10119 and thus no warnings should be emitted about overriding an
10120 existing initializer. */
10122 static void
10126 {
10132 {
10135 }
10148 {
10149 /* As an extension, allow initializing objects with static storage
10150 duration with compound literals (which are then treated just as
10151 the brace enclosed list they contain). */
10157 }
10163 /* Not fully determined before folding. */
10166 {
10169 }
10171 /* TODO: this may not detect all cases of expressions folding to
10172 constants that are not arithmetic constant expressions. */
10193 && TYPE_REVERSE_STORAGE_ORDER
10202 /* Digest the initializer and issue any errors about incompatible
10203 types before issuing errors about non-constant initializers. */
10207 /* In the case of braces around a scalar initializer, the result of
10208 this initializer processing goes through digest_init again at the
10209 outer level. In the case of a constexpr initializer for a
10210 pointer, avoid converting a null pointer constant to something
10211 that is not a null pointer constant to avoid a spurious error
10212 from that second processing. */
10214 || !npc
10220 {
10223 }
10227 /* Proceed to check the constness of the original initializer. */
10229 {
10231 {
10234 }
10238 }
10243 /* digest_init has already carried out the additional checks
10244 required for 'constexpr' initializers (using the information
10245 passed to it about whether the original initializer was certain
10246 kinds of constant expression), so that check does not need to be
10247 repeated here. */
10249 /* Issue -Wc++-compat warnings about initializing a bitfield with
10250 enum type. */
10258 {
10265 }
10267 /* If this field is empty and does not have side effects (and is not at
10268 the end of structure), don't do anything other than checking the
10269 initializer. */
10279 /* Finally, set VALUE to the initializer value digested above. */
10282 /* If this element doesn't come next in sequence,
10283 put it on constructor_pending_elts. */
10285 && (!constructor_incremental
10287 {
10293 braced_init_obstack);
10295 }
10297 && (!constructor_incremental
10299 {
10300 /* We do this for records but not for unions. In a union,
10301 no matter which field is specified, it can be initialized
10302 right away since it starts at the beginning of the union. */
10304 {
10307 else
10308 {
10316 }
10317 }
10320 braced_init_obstack);
10322 }
10325 {
10327 {
10334 }
10336 /* We can have just one union field set. */
10338 }
10340 /* Otherwise, output this element either to
10341 constructor_elements or to the assembler file. */
10346 /* Advance the variable that indicates sequential elements output. */
10348 constructor_unfilled_index
10350 bitsize_one_node);
10352 {
10353 constructor_unfilled_fields
10356 /* Skip any nameless bit fields. */
10359 constructor_unfilled_fields =
10361 }
10365 /* Now output any pending elements which have become next. */
10368 }
10370 /* For two FIELD_DECLs in the same chain, return -1 if field1
10371 comes before field2, 1 if field1 comes after field2 and
10372 0 if field1 == field2. */
10374 static int
10376 {
10383 {
10384 /* If one of the fields has non-zero bitsize, then that
10385 field must be the last one in a sequence of zero
10386 sized fields, fields after it will have bigger
10387 bit_position. */
10396 /* Otherwise, fallback to DECL_CHAIN walk to find out
10397 which field comes earlier. Walk chains of both
10398 fields, so that if field1 and field2 are close to each
10399 other in either order, it is found soon even for large
10400 sequences of zero sized fields. */
10403 {
10407 {
10410 }
10421 }
10422 }
10425 else
10427 }
10429 /* Output any pending elements which have become next.
10430 As we output elements, constructor_unfilled_{fields,index}
10431 advances, which may cause other elements to become next;
10432 if so, they too are output.
10434 If ALL is 0, we return when there are
10435 no more pending elements to output now.
10437 If ALL is 1, we output space as necessary so that
10438 we can output all the pending elements. */
10439 static void
10441 {
10443 tree next;
10445 retry:
10447 /* Look through the whole pending tree.
10448 If we find an element that should be output now,
10449 output it. Otherwise, set NEXT to the element
10450 that comes first among those still pending. */
10454 {
10456 {
10458 constructor_unfilled_index))
10462 braced_init_obstack);
10465 {
10466 /* Advance to the next smaller node. */
10469 else
10470 {
10471 /* We have reached the smallest node bigger than the
10472 current unfilled index. Fill the space first. */
10475 }
10476 }
10477 else
10478 {
10479 /* Advance to the next bigger node. */
10482 else
10483 {
10484 /* We have reached the biggest node in a subtree. Find
10485 the parent of it, which is the next bigger node. */
10491 {
10494 }
10495 }
10496 }
10497 }
10499 {
10500 /* If the current record is complete we are done. */
10510 braced_init_obstack);
10512 {
10513 /* Advance to the next smaller node. */
10516 else
10517 {
10518 /* We have reached the smallest node bigger than the
10519 current unfilled field. Fill the space first. */
10522 }
10523 }
10524 else
10525 {
10526 /* Advance to the next bigger node. */
10529 else
10530 {
10531 /* We have reached the biggest node in a subtree. Find
10532 the parent of it, which is the next bigger node. */
10539 {
10542 }
10543 }
10544 }
10545 }
10546 }
10548 /* Ordinarily return, but not if we want to output all
10549 and there are elements left. */
10553 /* If it's not incremental, just skip over the gap, so that after
10554 jumping to retry we will output the next successive element. */
10560 /* ELT now points to the node in the pending tree with the next
10561 initializer to output. */
10563 }
10564 \f
10565 /* Expression VALUE coincides with the start of type TYPE in a braced
10566 initializer. Return true if we should treat VALUE as initializing
10567 the first element of TYPE, false if we should treat it as initializing
10568 TYPE as a whole.
10570 If the initializer is clearly invalid, the question becomes:
10571 which choice gives the best error message? */
10573 static bool
10575 {
10585 /* GNU vectors can be initialized elementwise. However, treat any
10586 kind of vector value as initializing the vector type as a whole,
10587 regardless of whether the value is a GNU vector. Such initializers
10588 are valid if and only if they would have been valid in a non-braced
10589 initializer like:
10591 TYPE foo = VALUE;
10593 so recursing into the vector type would be at best confusing or at
10594 worst wrong. For example, when -flax-vector-conversions is in effect,
10595 it's possible to initialize a V8HI from a V4SI, even though the vectors
10596 have different element types and different numbers of elements. */
10604 }
10606 /* Add one non-braced element to the current constructor level.
10607 This adjusts the current position within the constructor's type.
10608 This may also start or terminate implicit levels
10609 to handle a partly-braced initializer.
10611 Once this has found the correct level for the new element,
10612 it calls output_init_element.
10614 IMPLICIT is true if value comes from pop_init_level (1),
10615 the new initializer has been merged with the existing one
10616 and thus no warnings should be emitted about overriding an
10617 existing initializer. */
10619 void
10622 {
10624 int string_flag
10635 /* Handle superfluous braces around string cst as in
10636 char x[] = {"foo"}; */
10638 && constructor_type
10639 && !was_designated
10643 {
10648 }
10651 {
10654 }
10656 /* Ignore elements of a brace group if it is entirely superfluous
10657 and has already been diagnosed, or if the type is erroneous. */
10661 /* Ignore elements of an initializer for a variable-size type.
10662 Those are diagnosed in the parser (empty initializer braces are OK). */
10672 OPT_Wdesignated_init,
10673 "positional initialization of field "
10676 /* If we've exhausted any levels that didn't have braces,
10677 pop them now. */
10679 {
10684 last_init_list_comma),
10688 && constructor_max_index
10690 constructor_index))
10693 last_init_list_comma),
10695 else
10697 }
10699 /* In the case of [LO ... HI] = VALUE, only evaluate VALUE once. */
10701 {
10702 /* If value is a compound literal and we'll be just using its
10703 content, don't put it into a SAVE_EXPR. */
10706 {
10709 {
10712 }
10717 }
10718 }
10721 {
10723 {
10724 tree fieldtype;
10728 {
10731 }
10738 /* Error for non-static initialization of a flexible array member. */
10740 && !require_constant_value
10743 {
10747 }
10749 /* Error for initialization of a flexible array member with
10750 a string constant if the structure is in an array. E.g.:
10751 struct S { int x; char y[]; };
10752 struct S s[] = { { 1, "foo" } };
10753 is invalid. */
10759 {
10764 {
10767 }
10769 {
10773 }
10774 }
10776 /* Accept a string constant to initialize a subarray. */
10782 /* Otherwise, if we have come to a subaggregate,
10783 and we don't have an element of its type, push into it. */
10786 {
10789 }
10792 {
10797 braced_init_obstack);
10799 }
10800 else
10801 /* Do the bookkeeping for an element that was
10802 directly output as a constructor. */
10803 {
10804 /* For a record, keep track of end position of last field. */
10806 constructor_bit_index
10811 /* If the current field was the first one not yet written out,
10812 it isn't now, so update. */
10814 {
10816 /* Skip any nameless bit fields. */
10818 && (DECL_UNNAMED_BIT_FIELD
10820 constructor_unfilled_fields =
10822 }
10823 }
10826 /* Skip any nameless bit fields at the beginning. */
10830 }
10832 {
10833 tree fieldtype;
10837 {
10841 }
10848 /* Warn that traditional C rejects initialization of unions.
10849 We skip the warning if the value is zero. This is done
10850 under the assumption that the zero initializer in user
10851 code appears conditioned on e.g. __STDC__ to avoid
10852 "missing initializer" warnings and relies on default
10853 initialization to zero in the traditional C case.
10854 We also skip the warning if the initializer is designated,
10855 again on the assumption that this must be conditional on
10856 __STDC__ anyway (and we've already complained about the
10857 member-designator already). */
10864 /* Accept a string constant to initialize a subarray. */
10870 /* Otherwise, if we have come to a subaggregate,
10871 and we don't have an element of its type, push into it. */
10874 {
10877 }
10880 {
10885 braced_init_obstack);
10887 }
10888 else
10889 /* Do the bookkeeping for an element that was
10890 directly output as a constructor. */
10891 {
10894 }
10897 }
10899 {
10903 /* Accept a string constant to initialize a subarray. */
10909 /* Otherwise, if we have come to a subaggregate,
10910 and we don't have an element of its type, push into it. */
10913 {
10916 }
10921 {
10925 }
10927 /* Now output the actual element. */
10929 {
10934 braced_init_obstack);
10936 }
10938 constructor_index
10943 /* If we are doing the bookkeeping for an element that was
10944 directly output as a constructor, we must update
10945 constructor_unfilled_index. */
10947 }
10949 {
10952 /* Do a basic check of initializer size. Note that vectors
10953 always have a fixed size derived from their type. */
10955 {
10959 }
10961 /* Now output the actual element. */
10963 {
10969 braced_init_obstack);
10970 }
10972 constructor_index
10977 /* If we are doing the bookkeeping for an element that was
10978 directly output as a constructor, we must update
10979 constructor_unfilled_index. */
10981 }
10983 /* Handle the sole element allowed in a braced initializer
10984 for a scalar variable. */
10987 {
10991 }
10992 else
10993 {
10998 braced_init_obstack);
11000 }
11002 /* Handle range initializers either at this level or anywhere higher
11003 in the designator stack. */
11005 {
11012 {
11016 braced_init_obstack,
11017 last_init_list_comma),
11019 }
11023 {
11027 braced_init_obstack,
11028 last_init_list_comma),
11030 }
11038 {
11042 {
11045 }
11054 }
11059 }
11062 }
11065 }
11066 \f
11067 /* Build a complete asm-statement, whose components are a CV_QUALIFIER
11068 (guaranteed to be 'volatile' or null) and ARGS (represented using
11069 an ASM_EXPR node). */
11070 tree
11072 {
11076 }
11078 /* Build an asm-expr, whose components are a STRING, some OUTPUTS,
11079 some INPUTS, and some CLOBBERS. The latter three may be NULL.
11080 SIMPLE indicates whether there was anything at all after the
11081 string in the asm expression -- asm("blah") and asm("blah" : )
11082 are subtly different. We use a ASM_EXPR node to represent this.
11083 LOC is the location of the asm, and IS_INLINE says whether this
11084 is asm inline. */
11085 tree
11088 {
11089 tree tail;
11090 tree args;
11103 /* Remove output conversions that change the type but not the mode. */
11105 {
11110 /* ??? Really, this should not be here. Users should be using a
11111 proper lvalue, dammit. But there's a long history of using casts
11112 in the output operands. In cases like longlong.h, this becomes a
11113 primitive form of typechecking -- if the cast can be removed, then
11114 the output operand had a type of the proper width; otherwise we'll
11115 get an error. Gross, but ... */
11133 {
11134 /* If the operand is going to end up in memory,
11135 mark it addressable. */
11141 {
11144 }
11145 }
11146 else
11150 }
11153 {
11154 tree input;
11161 {
11162 /* If the operand is going to end up in memory,
11163 mark it addressable. */
11165 {
11168 /* Strip the nops as we allow this case. FIXME, this really
11169 should be rejected or made deprecated. */
11173 }
11174 else
11175 {
11183 {
11186 }
11187 }
11188 }
11189 else
11193 }
11197 /* asm statements without outputs, including simple ones, are treated
11198 as volatile. */
11204 }
11205 \f
11206 /* Generate a goto statement to LABEL. LOC is the location of the
11207 GOTO. */
11209 tree
11211 {
11216 {
11221 }
11222 }
11224 /* Generate a computed goto statement to EXPR. LOC is the location of
11225 the GOTO. */
11227 tree
11229 {
11231 tree t;
11236 {
11240 }
11246 }
11248 /* Generate a C `return' statement. RETVAL is the expression for what
11249 to return, or a null pointer for `return;' with no value. LOC is
11250 the location of the return statement, or the location of the expression,
11251 if the statement has any. If ORIGTYPE is not NULL_TREE, it
11252 is the original type of RETVAL. */
11254 tree
11256 {
11261 /* Use the expansion point to handle cases such as returning NULL
11262 in a function returning void. */
11270 {
11274 {
11277 }
11283 }
11286 {
11290 {
11293 warned_here = pedwarn
11296 else
11297 warned_here = warning_at
11304 }
11305 }
11307 {
11311 warned_here = pedwarn
11314 else
11315 warned_here = pedwarn
11321 }
11322 else
11323 {
11328 tree inner;
11346 /* Strip any conversions, additions, and subtractions, and see if
11347 we are returning the address of a local variable. Warn if so. */
11349 {
11351 {
11352 CASE_CONVERT:
11360 /* If the second operand of the MINUS_EXPR has a pointer
11361 type (or is converted from it), this may be valid, so
11362 don't give a warning. */
11363 {
11376 }
11390 {
11394 else
11395 {
11400 }
11401 }
11406 }
11409 }
11416 }
11422 }
11423 \f
11425 /* The SWITCH_STMT being built. */
11426 tree switch_stmt;
11428 /* The original type of the testing expression, i.e. before the
11429 default conversion is applied. */
11430 tree orig_type;
11432 /* A splay-tree mapping the low element of a case range to the high
11433 element, or NULL_TREE if there is no high element. Used to
11434 determine whether or not a new case label duplicates an old case
11435 label. We need a tree, rather than simply a hash table, because
11436 of the GNU case range extension. */
11437 splay_tree cases;
11439 /* The bindings at the point of the switch. This is used for
11440 warnings crossing decls when branching to a case label. */
11443 /* Whether the switch includes any break statements. */
11446 /* The next node on the stack. */
11449 /* Remember whether the controlling expression had boolean type
11450 before integer promotions for the sake of -Wswitch-bool. */
11452 };
11454 /* A stack of the currently active switch statements. The innermost
11455 switch statement is on the top of the stack. There is no need to
11456 mark the stack for garbage collection because it is only active
11457 during the processing of the body of a function, and we never
11458 collect at that point. */
11462 /* Start a C switch statement, testing expression EXP. Return the new
11463 SWITCH_STMT. SWITCH_LOC is the location of the `switch'.
11464 SWITCH_COND_LOC is the location of the switch's condition.
11465 EXPLICIT_CAST_P is true if the expression EXP has an explicit cast. */
11467 tree
11469 location_t switch_cond_loc,
11471 {
11477 {
11481 {
11483 {
11486 }
11488 }
11489 else
11490 {
11494 /* Warn if the condition has boolean value. */
11500 /* Explicit cast to int suppresses this warning. */
11517 }
11518 }
11520 /* Add this new SWITCH_STMT to the stack. */
11533 }
11535 /* Process a case label at location LOC, with attributes ATTRS. */
11537 tree
11539 {
11543 {
11548 }
11551 {
11556 }
11559 {
11562 else
11565 }
11569 loc))
11578 }
11580 /* Finish the switch statement. TYPE is the original type of the
11581 controlling expression of the switch, or NULL_TREE. */
11583 void
11585 {
11587 location_t switch_location;
11591 /* Emit warnings as needed. */
11601 /* Pop the stack. */
11606 }
11607 \f
11608 /* Emit an if statement. IF_LOCUS is the location of the 'if'. COND,
11609 THEN_BLOCK and ELSE_BLOCK are expressions to be used; ELSE_BLOCK
11610 may be null. */
11612 void
11614 tree else_block)
11615 {
11616 tree stmt;
11621 }
11623 tree
11625 {
11626 /* In switch statements break is sometimes stylistically used after
11627 a return statement. This can lead to spurious warnings about
11628 control reaching the end of a non-void function when it is
11629 inlined. Note that we are calling block_may_fallthru with
11630 language specific tree nodes; this works because
11631 block_may_fallthru returns true when given something it does not
11632 understand. */
11637 {
11654 }
11655 else
11657 {
11670 }
11676 {
11677 /* The foreach expander produces low-level code using gotos instead
11678 of a structured loop construct. */
11681 }
11683 }
11685 /* A helper routine for c_process_expr_stmt and c_finish_stmt_expr. */
11687 static void
11689 {
11694 ;
11696 {
11700 }
11702 {
11706 {
11710 }
11718 }
11719 else
11721 }
11723 /* Process an expression as if it were a complete statement. Emit
11724 diagnostics, but do not call ADD_STMT. LOC is the location of the
11725 statement. */
11727 tree
11729 {
11730 tree exprv;
11745 /* If we're not processing a statement expression, warn about unused values.
11746 Warnings for statement expressions will be emitted later, once we figure
11747 out which is the result. */
11762 /* If the expression is not of a type to which we cannot assign a line
11763 number, wrap the thing in a no-op NOP_EXPR. */
11765 {
11768 }
11771 }
11773 /* Emit an expression as a statement. LOC is the location of the
11774 expression. */
11776 tree
11778 {
11781 else
11783 }
11785 /* Do the opposite and emit a statement as an expression. To begin,
11786 create a new binding level and return it. */
11788 tree
11790 {
11791 tree ret;
11793 /* We must force a BLOCK for this level so that, if it is not expanded
11794 later, there is a way to turn off the entire subtree of blocks that
11795 are contained in it. */
11800 ? NULL
11803 /* Mark the current statement list as belonging to a statement list. */
11807 }
11809 /* LOC is the location of the compound statement to which this body
11810 belongs. */
11812 tree
11814 {
11821 ? NULL
11824 /* Locate the last statement in BODY. See c_end_compound_stmt
11825 about always returning a BIND_EXPR. */
11829 continue_searching:
11831 {
11837 /* This can happen with degenerate cases like ({ }). No value. */
11841 /* If we're supposed to generate side effects warnings, process
11842 all of the statements except the last. */
11844 {
11847 {
11848 location_t tloc;
11853 }
11854 }
11857 }
11859 /* If the end of the list is exception related, then the list was split
11860 by a call to push_cleanup. Continue searching. */
11863 {
11867 }
11872 /* In the case that the BIND_EXPR is not necessary, return the
11873 expression out from inside it. */
11875 /* Skip nested debug stmts. */
11878 {
11879 /* Even if this looks constant, do not allow it in a constant
11880 expression. */
11882 /* Do not warn if the return value of a statement expression is
11883 unused. */
11886 }
11888 /* Extract the type of said expression. */
11891 /* If we're not returning a value at all, then the BIND_EXPR that
11892 we already have is a fine expression to return. */
11896 /* Now that we've located the expression containing the value, it seems
11897 silly to make voidify_wrapper_expr repeat the process. Create a
11898 temporary of the appropriate type and stick it in a TARGET_EXPR. */
11901 /* Unwrap a no-op NOP_EXPR as added by c_finish_expr_stmt. This avoids
11902 tree_expr_nonnegative_p giving up immediately. */
11911 {
11915 }
11916 }
11917 \f
11918 /* Begin and end compound statements. This is as simple as pushing
11919 and popping new statement lists from the tree. */
11921 tree
11923 {
11928 }
11930 /* End a compound statement. STMT is the statement. LOC is the
11931 location of the compound statement-- this is usually the location
11932 of the opening brace. */
11934 tree
11936 {
11940 {
11944 }
11949 /* If this compound statement is nested immediately inside a statement
11950 expression, then force a BIND_EXPR to be created. Otherwise we'll
11951 do the wrong thing for ({ { 1; } }) or ({ 1; { } }). In particular,
11952 STATEMENT_LISTs merge, and thus we can lose track of what statement
11953 was really last. */
11957 {
11961 }
11964 }
11966 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
11967 when the current scope is exited. EH_ONLY is true when this is not
11968 meant to apply to normal control flow transfer. */
11970 void
11972 {
11984 }
11985 \f
11986 /* Build a vector comparison of ARG0 and ARG1 using CODE opcode
11987 into a value of TYPE type. Comparison is done via VEC_COND_EXPR. */
11989 static tree
11992 {
11998 }
12000 /* Possibly warn about an address of OP never being NULL in a comparison
12001 operation CODE involving null. */
12003 static void
12005 {
12006 /* Prevent warnings issued for macro expansion. */
12013 {
12014 /* Allow casts to intptr_t to suppress the warning. */
12019 }
12022 {
12023 /* Allow a cast to void* to suppress the warning. */
12028 /* Adding any value to a null pointer, including zero, is undefined
12029 in C. This includes the expression &p[0] where p is the null
12030 pointer, although &p[0] will have been folded to p by this point
12031 and so not diagnosed. */
12034 "the comparison will always evaluate as %<false%> "
12036 op);
12037 else
12039 "the comparison will always evaluate as %<true%> "
12041 op);
12044 }
12053 {
12054 /* The address of either complex part may not be null. */
12057 "the comparison will always evaluate as %<false%> "
12059 op);
12060 else
12062 "the comparison will always evaluate as %<true%> "
12064 op);
12066 }
12068 /* Set to true in the loop below if OP dereferences is operand.
12069 In such a case the ultimate target need not be a decl for
12070 the null [in]equality test to be constant. */
12073 /* Get the outermost array or object, or member. */
12075 {
12077 {
12078 /* Get the member (its address is never null). */
12081 }
12083 /* Get the outer array/object to refer to in the warning. */
12086 }
12095 "the comparison will always evaluate as %<false%> "
12097 op);
12098 else
12100 "the comparison will always evaluate as %<true%> "
12102 op);
12106 }
12108 /* Build a binary-operation expression without default conversions.
12109 CODE is the kind of expression to build.
12110 LOCATION is the operator's location.
12111 This function differs from `build' in several ways:
12112 the data type of the result is computed and recorded in it,
12113 warnings are generated if arg data types are invalid,
12114 special handling for addition and subtraction of pointers is known,
12115 and some optimization is done (operations on narrow ints
12116 are done in the narrower type when that gives the same result).
12117 Constant folding is also done before the result is returned.
12119 Note that the operands will never have enumeral types, or function
12120 or array types, because either they will have the default conversions
12121 performed or they have both just been converted to some other type in which
12122 the arithmetic is to be done. */
12124 tree
12127 {
12129 tree eptype;
12137 /* Expression code to give to the expression when it is built.
12138 Normally this is CODE, which is what the caller asked for,
12139 but in some special cases we change it. */
12142 /* Data type in which the computation is to be performed.
12143 In the simplest cases this is the common type of the arguments. */
12146 /* When the computation is in excess precision, the type of the
12147 final EXCESS_PRECISION_EXPR. */
12150 /* Nonzero means operands have already been type-converted
12151 in whatever way is necessary.
12152 Zero means they need to be converted to RESULT_TYPE. */
12155 /* Nonzero means create the expression with this type, rather than
12156 RESULT_TYPE. */
12159 /* Nonzero means after finally constructing the expression
12160 convert it to this type. */
12163 /* Nonzero if this is an operation like MIN or MAX which can
12164 safely be computed in short if both args are promoted shorts.
12165 Also implies COMMON.
12166 -1 indicates a bitwise operation; this makes a difference
12167 in the exact conditions for when it is safe to do the operation
12168 in a narrower mode. */
12171 /* Nonzero if this is a comparison operation;
12172 if both args are promoted shorts, compare the original shorts.
12173 Also implies COMMON. */
12176 /* Nonzero if this is a right-shift operation, which can be computed on the
12177 original short and then promoted if the operand is a promoted short. */
12180 /* Nonzero means set RESULT_TYPE to the common type of the args. */
12183 /* True means types are compatible as far as ObjC is concerned. */
12186 /* True means this is an arithmetic operation that may need excess
12187 precision. */
12190 /* True means this is a boolean operation that converts both its
12191 operands to truth-values. */
12194 /* Remember whether we're doing / or %. */
12197 /* Remember whether we're doing << or >>. */
12200 /* Tree holding instrumentation expression. */
12217 {
12220 int_const = (int_const_or_overflow
12223 }
12224 else
12227 /* Do not apply default conversion in mixed vector/scalar expression. */
12230 {
12233 }
12239 /* The expression codes of the data types of the arguments tell us
12240 whether the arguments are integers, floating, pointers, etc. */
12244 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
12248 /* If an error was already reported for one of the arguments,
12249 avoid reporting another error. */
12264 {
12267 }
12270 {
12288 /* Excess precision for implicit conversions of integers to
12289 floating point in C11 and later. */
12290 may_need_excess_precision = (flag_isoc11
12298 }
12300 {
12303 }
12306 {
12309 }
12311 {
12314 }
12317 {
12320 }
12324 /* In case when one of the operands of the binary operation is
12325 a vector and another is a scalar -- convert scalar to vector. */
12328 {
12333 {
12337 {
12339 tree sc;
12350 }
12352 {
12354 tree sc;
12365 }
12368 }
12369 }
12372 {
12374 /* Handle the pointer + int case. */
12376 {
12379 }
12381 {
12384 }
12385 else
12390 /* Subtraction of two similar pointers.
12391 We must subtract them as integers, then divide by object size. */
12394 {
12397 }
12398 /* Handle pointer minus int. Just like pointer plus int. */
12400 {
12403 }
12404 else
12428 {
12439 else
12440 /* Although it would be tempting to shorten always here, that
12441 loses on some targets, since the modulo instruction is
12442 undefined if the quotient can't be represented in the
12443 computation mode. We shorten only if unsigned or if
12444 dividing by something we know != -1. */
12447 }
12455 /* Allow vector types which are not floating point types. */
12474 {
12475 /* Although it would be tempting to shorten always here, that loses
12476 on some targets, since the modulo instruction is undefined if the
12477 quotient can't be represented in the computation mode. We shorten
12478 only if unsigned or if dividing by something we know != -1. */
12481 }
12495 {
12496 /* Result of these operations is always an int,
12497 but that does not mean the operands should be
12498 converted to ints! */
12501 {
12504 }
12505 else
12508 {
12511 }
12512 else
12516 }
12518 {
12519 int_const_or_overflow = (int_operands
12523 int_const = (int_const_or_overflow
12527 }
12529 {
12530 int_const_or_overflow = (int_operands
12534 int_const = (int_const_or_overflow
12538 }
12541 /* Shift operations: result has same type as first operand;
12542 always convert second operand to int.
12543 Also set SHORT_SHIFT if shifting rightward. */
12552 {
12555 }
12560 {
12563 {
12565 {
12570 }
12572 {
12576 {
12581 }
12582 }
12583 else
12584 {
12589 {
12594 }
12595 }
12596 }
12598 /* Use the type of the value to be shifted. */
12600 /* Avoid converting op1 to result_type later. */
12602 }
12612 {
12615 }
12620 {
12625 {
12626 /* Don't reject a left shift of a negative value in a context
12627 where a constant expression is needed in C90. */
12633 }
12635 {
12637 {
12642 }
12644 {
12648 {
12653 }
12654 }
12656 {
12661 }
12666 }
12668 /* Use the type of the value to be shifted. */
12670 /* Avoid converting op1 to result_type later. */
12672 }
12678 {
12679 tree intt;
12681 {
12685 }
12689 {
12693 }
12695 /* It's not precisely specified how the usual arithmetic
12696 conversions apply to the vector types. Here, we use
12697 the unsigned type if one of the operands is signed and
12698 the other one is unsigned. */
12700 {
12703 else
12707 }
12709 /* Always construct signed integer vector type. */
12711 (SCALAR_TYPE_MODE
12714 {
12719 }
12725 }
12728 OPT_Wfloat_equal,
12730 /* Result of comparison is always int,
12731 but don't convert the args to int! */
12741 {
12744 }
12748 {
12751 }
12753 {
12760 /* Anything compares with void *. void * compares with anything.
12761 Otherwise, the targets must be compatible
12762 and both must be object or both incomplete. */
12766 {
12770 }
12772 {
12776 }
12778 {
12782 }
12783 else
12784 /* Avoid warning about the volatile ObjC EH puts on decls. */
12790 {
12792 result_type = build_pointer_type
12794 }
12795 }
12797 {
12800 }
12802 {
12805 }
12806 /* 6.5.9: One of the following shall hold:
12807 -- both operands have type nullptr_t; */
12809 {
12811 /* No need to convert the operands to result_type later. */
12813 }
12814 /* -- one operand has type nullptr_t and the other is a null pointer
12815 constant. We will have to convert the former to the type of the
12816 latter, because during gimplification we can't have mismatching
12817 comparison operand type. We convert from nullptr_t to the other
12818 type, since only nullptr_t can be converted to nullptr_t. Also,
12819 even a constant 0 is a null pointer constant, so we may have to
12820 create a pointer type from its type. */
12839 {
12840 tree intt;
12842 {
12846 }
12850 {
12854 }
12856 /* It's not precisely specified how the usual arithmetic
12857 conversions apply to the vector types. Here, we use
12858 the unsigned type if one of the operands is signed and
12859 the other one is unsigned. */
12861 {
12864 else
12868 }
12870 /* Always construct signed integer vector type. */
12872 (SCALAR_TYPE_MODE
12875 {
12880 }
12886 }
12894 {
12897 addr_space_t as_common;
12900 {
12914 }
12916 {
12920 }
12921 else
12922 {
12924 result_type = build_pointer_type
12928 }
12929 }
12931 {
12939 }
12941 {
12949 }
12951 {
12954 }
12956 {
12959 }
12964 {
12970 }
12981 /* Used for OpenMP atomics. */
12988 }
12997 {
12999 maybe_range_label_for_tree_type_mismatch
13006 }
13011 &&
13015 {
13021 {
13024 "implicit conversion from %qT to %qT "
13025 "to match other operand of binary "
13027 location);
13030 }
13039 {
13040 /* An operation on mixed real/complex operands must be
13041 handled specially, but the language-independent code can
13042 more easily optimize the plain complex arithmetic if
13043 -fno-signed-zeros. */
13047 {
13050 }
13052 {
13057 }
13058 else
13059 {
13064 }
13068 {
13075 {
13080 /* Fall through. */
13087 }
13088 }
13089 else
13090 {
13097 {
13101 /* Fall through. */
13111 }
13112 }
13115 }
13117 /* For certain operations (which identify themselves by shorten != 0)
13118 if both args were extended from the same smaller type,
13119 do the arithmetic in that type and then extend.
13121 shorten !=0 and !=1 indicates a bitwise operation.
13122 For them, this optimization is safe only if
13123 both args are zero-extended or both are sign-extended.
13124 Otherwise, we might change the result.
13125 Eg, (short)-1 | (unsigned short)-1 is (int)-1
13126 but calculated in (unsigned short) it would be (unsigned short)-1. */
13129 {
13133 }
13135 /* Shifts can be shortened if shifting right. */
13138 {
13149 /* We can shorten only if the shift count is less than the
13150 number of bits in the smaller type size. */
13152 /* We cannot drop an unsigned shift after sign-extension. */
13154 {
13155 /* Do an unsigned shift if the operand was zero-extended. */
13156 result_type
13159 /* Convert value-to-be-shifted to that type. */
13163 }
13164 }
13166 /* Comparison operations are shortened too but differently.
13167 They identify themselves by setting short_compare = 1. */
13170 {
13171 /* Don't write &op0, etc., because that would prevent op0
13172 from being kept in a register.
13173 Instead, make copies of the our local variables and
13174 pass the copies by reference, then copy them back afterward. */
13177 tree val
13182 {
13185 }
13192 {
13198 {
13201 }
13202 else
13203 {
13204 /* Fold for the sake of possible warnings, as in
13205 build_conditional_expr. This requires the
13206 "original" values to be folded, not just op0 and
13207 op1. */
13208 c_inhibit_evaluation_warnings++;
13213 c_inhibit_evaluation_warnings--;
13215 require_constant_value,
13216 NULL);
13218 require_constant_value,
13219 NULL);
13220 }
13227 {
13232 }
13233 }
13234 }
13235 }
13237 /* At this point, RESULT_TYPE must be nonzero to avoid an error message.
13238 If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
13239 Then the expression will be built.
13240 It will be given type FINAL_TYPE if that is nonzero;
13241 otherwise, it will be given type RESULT_TYPE. */
13244 {
13245 /* Favor showing any expression locations that are available. */
13250 }
13253 {
13257 {
13260 }
13261 }
13264 {
13266 semantic_result_type);
13268 semantic_result_type);
13270 /* This can happen if one operand has a vector type, and the other
13271 has a different type. */
13274 }
13277 | SANITIZE_DIVIDE
13278 | SANITIZE_FLOAT_DIVIDE
13283 {
13284 /* OP0 and/or OP1 might have side-effects. */
13290 | SANITIZE_FLOAT_DIVIDE
13295 }
13297 /* Treat expressions in initializers specially as they can't trap. */
13299 ret = (require_constant_value
13303 else
13308 return_build_binary_op:
13311 ret = (int_operands
13328 }
13331 /* Convert EXPR to be a truth-value, validating its type for this
13332 purpose. LOCATION is the source location for the expression. */
13334 tree
13336 {
13340 {
13342 error_at (location, "used array that cannot be converted to pointer where scalar is required");
13371 }
13376 {
13381 }
13382 else
13383 /* ??? Should we also give an error for vectors rather than leaving
13384 those to give errors later? */
13388 {
13391 else
13393 }
13397 }
13398 \f
13400 /* Convert EXPR to a contained DECL, updating *TC, *TI and *SE as
13401 required. */
13403 tree
13405 {
13407 {
13409 /* Executing a compound literal inside a function reinitializes
13410 it. */
13414 }
13415 else
13417 }
13418 \f
13419 /* Generate OMP construct CODE, with BODY and CLAUSES as its compound
13420 statement. LOC is the location of the construct. */
13422 tree
13424 tree clauses)
13425 {
13435 }
13437 /* Generate OACC_DATA, with CLAUSES and BLOCK as its compound
13438 statement. LOC is the location of the OACC_DATA. */
13440 tree
13442 {
13443 tree stmt;
13454 }
13456 /* Generate OACC_HOST_DATA, with CLAUSES and BLOCK as its compound
13457 statement. LOC is the location of the OACC_HOST_DATA. */
13459 tree
13461 {
13462 tree stmt;
13473 }
13475 /* Like c_begin_compound_stmt, except force the retention of the BLOCK. */
13477 tree
13479 {
13480 tree block;
13486 }
13488 /* Generate OMP_PARALLEL, with CLAUSES and BLOCK as its compound
13489 statement. LOC is the location of the OMP_PARALLEL. */
13491 tree
13493 {
13494 tree stmt;
13505 }
13507 /* Like c_begin_compound_stmt, except force the retention of the BLOCK. */
13509 tree
13511 {
13512 tree block;
13518 }
13520 /* Generate OMP_TASK, with CLAUSES and BLOCK as its compound
13521 statement. LOC is the location of the #pragma. */
13523 tree
13525 {
13526 tree stmt;
13537 }
13539 /* Generate GOMP_cancel call for #pragma omp cancel. */
13541 void
13543 {
13554 else
13555 {
13557 "%<parallel%>, %<for%>, %<sections%> or %<taskgroup%> "
13560 }
13563 {
13568 else
13569 {
13572 {
13578 }
13579 }
13585 }
13586 else
13590 ifc);
13592 }
13594 /* Generate GOMP_cancellation_point call for
13595 #pragma omp cancellation point. */
13597 void
13599 {
13610 else
13611 {
13613 "%<parallel%>, %<for%>, %<sections%> or %<taskgroup%> "
13616 }
13620 }
13622 /* Helper function for handle_omp_array_sections. Called recursively
13623 to handle multiple array-section-subscripts. C is the clause,
13624 T current expression (initially OMP_CLAUSE_DECL), which is either
13625 a TREE_LIST for array-section-subscript (TREE_PURPOSE is low-bound
13626 expression if specified, TREE_VALUE length expression if specified,
13627 TREE_CHAIN is what it has been specified after, or some decl.
13628 TYPES vector is populated with array section types, MAYBE_ZERO_LEN
13629 set to true if any of the array-section-subscript could have length
13630 of zero (explicit or implicit), FIRST_NON_ONE is the index of the
13631 first array-section-subscript which is known not to have length
13632 of one. Given say:
13633 map(a[:b][2:1][:c][:2][:d][e:f][2:5])
13634 FIRST_NON_ONE will be 3, array-section-subscript [:b], [2:1] and [:c]
13635 all are or may have length of 1, array-section-subscript [:2] is the
13636 first one known not to have length 1. For array-section-subscript
13637 <= FIRST_NON_ONE we diagnose non-contiguous arrays if low bound isn't
13638 0 or length isn't the array domain max + 1, for > FIRST_NON_ONE we
13639 can if MAYBE_ZERO_LEN is false. MAYBE_ZERO_LEN will be true in the above
13640 case though, as some lengths could be zero. */
13642 static tree
13646 {
13649 {
13656 {
13660 }
13662 {
13667 }
13669 {
13672 }
13677 {
13679 {
13684 }
13686 {
13688 {
13692 }
13697 {
13702 }
13704 {
13709 else
13711 }
13712 }
13713 }
13715 {
13720 else
13725 }
13729 {
13733 }
13738 {
13743 }
13748 {
13749 /* If the array section is pointer based and the pointer
13750 itself is _Atomic qualified, we need to atomically load
13751 the pointer. */
13752 c_expr expr;
13758 }
13760 }
13775 {
13778 low_bound);
13780 }
13782 {
13785 length);
13787 }
13803 {
13805 {
13810 }
13811 }
13813 {
13815 {
13821 {
13823 {
13828 }
13829 }
13830 else
13832 }
13835 first_non_one++;
13836 }
13838 {
13842 {
13844 "for unknown bound array type length expression must "
13847 }
13850 {
13855 }
13859 {
13864 }
13869 {
13870 tree size
13874 {
13876 {
13878 "low bound %qE above array section size "
13882 }
13884 {
13890 {
13895 }
13897 }
13900 && tree_int_cst_equal
13902 low_bound))
13903 first_non_one++;
13904 }
13906 {
13914 first_non_one++;
13915 }
13917 {
13919 {
13921 "length %qE above array section size "
13925 }
13927 {
13928 tree lbpluslen
13934 {
13936 "high bound %qE above array section size "
13940 }
13941 }
13942 }
13943 }
13945 {
13953 first_non_one++;
13954 }
13956 /* For [lb:] we will need to evaluate lb more than once. */
13958 {
13961 {
13964 }
13965 }
13966 }
13968 {
13970 {
13973 "for array function parameter length expression "
13975 else
13979 }
13983 {
13988 }
13989 /* If there is a pointer type anywhere but in the very first
13990 array-section-subscript, the array section could be non-contiguous. */
13994 {
13995 /* If any prior dimension has a non-one length, then deem this
13996 array section as non-contiguous. */
13999 {
14002 {
14007 }
14008 }
14009 }
14010 }
14011 else
14012 {
14016 }
14019 /* We will need to evaluate lb more than once. */
14022 {
14025 }
14028 }
14030 /* Handle array sections for clause C. */
14032 static bool
14034 {
14047 ort);
14054 {
14057 /* Need to evaluate side effects in the length expressions
14058 if any. */
14060 {
14062 {
14065 else
14068 }
14070 }
14075 }
14076 else
14077 {
14087 {
14091 i--;
14105 {
14114 {
14115 tree size;
14118 size_one_node);
14120 {
14121 do_warn_noncontiguous:
14123 "array section is not contiguous in %qs "
14127 }
14128 }
14131 {
14134 else
14138 }
14139 }
14140 else
14141 {
14142 tree l;
14152 else
14153 {
14156 size_one_node);
14159 }
14161 {
14163 size_zero_node);
14166 else
14169 }
14171 {
14179 {
14182 {
14187 }
14190 }
14195 }
14196 else
14198 }
14199 }
14205 {
14228 else
14229 {
14234 }
14237 }
14251 {
14270 }
14274 else
14294 }
14296 }
14298 /* Helper function of finish_omp_clauses. Clone STMT as if we were making
14299 an inline call. But, remap
14300 the OMP_DECL1 VAR_DECL (omp_out resp. omp_orig) to PLACEHOLDER
14301 and OMP_DECL2 VAR_DECL (omp_in resp. omp_priv) to DECL. */
14303 static tree
14306 {
14307 copy_body_data id;
14325 }
14327 /* Helper function of c_finish_omp_clauses, called via walk_tree.
14328 Find OMP_CLAUSE_PLACEHOLDER (passed in DATA) in *TP. */
14330 static tree
14332 {
14336 }
14338 /* Similarly, but also walk aggregate fields. */
14342 static tree
14344 {
14348 {
14349 tree field;
14355 {
14364 pset);
14370 }
14371 }
14376 }
14378 /* Finish OpenMP iterators ITER. Return true if they are errorneous
14379 and clauses containing them should be removed. */
14381 static bool
14383 {
14386 {
14391 tree orig_step;
14395 {
14398 }
14400 {
14402 var);
14405 }
14407 {
14411 }
14413 {
14417 }
14420 {
14423 }
14425 {
14430 }
14437 {
14444 }
14446 {
14450 }
14456 {
14459 }
14461 tree it2;
14463 {
14472 {
14477 }
14479 {
14483 }
14485 {
14489 }
14491 {
14495 }
14496 }
14498 {
14501 }
14506 }
14508 }
14510 /* Ensure that pointers are used in OpenACC attach and detach clauses.
14511 Return true if an error has been detected. */
14513 static bool
14515 {
14519 /* OpenACC attach / detach clauses must be pointers. */
14522 {
14529 {
14533 }
14534 }
14537 }
14539 /* For all elements of CLAUSES, validate them against their constraints.
14540 Remove any elements from the list that are invalid. */
14542 tree
14544 {
14564 /* 1 if normal/task reduction has been seen, -1 if inscan reduction
14565 has been seen, -2 if mixed inscan/normal reduction diagnosed. */
14576 /* If ort == C_ORT_OMP_DECLARE_SIMD used as uniform_head instead. */
14580 /* If ort == C_ORT_OMP used as nontemporal_head or use_device_xxx_head
14581 instead and for ort == C_ORT_OMP_TARGET used as in_reduction_head. */
14588 {
14591 }
14596 {
14601 /* We've reached the end of a list of expanded nodes. Reset the group
14602 start pointer. */
14607 {
14623 {
14625 "%<inscan%> and non-%<inscan%> %<reduction%> clauses "
14628 }
14629 /* FALLTHRU */
14635 {
14637 {
14640 }
14645 {
14647 "%<inscan%> %<reduction%> clause with array "
14651 }
14652 }
14655 {
14658 }
14665 {
14671 {
14674 t);
14677 }
14681 {
14684 t);
14687 }
14692 index_type);
14699 }
14701 {
14706 }
14709 {
14710 /* Disallow zero sized or potentially zero sized task
14711 reductions. */
14713 {
14719 }
14721 {
14727 }
14728 }
14732 {
14737 {
14763 }
14765 {
14771 }
14772 }
14774 {
14779 }
14781 {
14791 {
14797 }
14807 decl_placeholder ? decl_placeholder
14815 {
14827 decl_placeholder ? decl_placeholder
14830 {
14835 }
14837 c_find_omp_placeholder_r,
14840 }
14841 else
14842 {
14843 tree init;
14847 else
14851 }
14857 }
14859 {
14863 {
14868 }
14874 }
14880 {
14882 "%<nowait%> clause must not be used together "
14886 }
14892 {
14897 }
14907 {
14909 "modifier should not be specified in %<linear%> "
14910 "clause on %<simd%> or %<for%> constructs when not "
14913 }
14916 {
14918 "linear clause applied to non-integral non-pointer "
14922 }
14924 {
14929 }
14931 {
14934 {
14936 /* map_head bitmap is used as uniform_head if
14937 declare_simd. */
14941 }
14943 {
14945 "%<linear%> clause step %qE is neither constant "
14949 }
14950 }
14952 {
14958 fold_convert
14963 }
14964 else
14969 check_dup_generic:
14971 check_dup_generic_t:
14973 {
14978 }
14987 {
14991 {
14993 "%qD appears more than once in data-sharing "
14997 }
15001 {
15003 ort == C_ORT_ACC
15006 t);
15008 }
15009 else
15011 }
15016 {
15020 }
15025 {
15029 else
15033 }
15034 else
15040 {
15041 move_implicit:
15043 /* Move firstprivate and map clauses with
15044 OMP_CLAUSE_{FIRSTPRIVATE,MAP}_IMPLICIT set to the end of
15045 clauses chain. */
15051 {
15055 }
15058 {
15062 }
15063 else
15069 }
15074 {
15078 }
15086 {
15090 }
15092 {
15099 else
15103 }
15104 else
15113 {
15117 }
15120 {
15124 }
15125 else
15132 {
15136 }
15139 {
15141 "%qE in %<aligned%> clause is neither a pointer nor "
15144 }
15146 {
15151 }
15153 {
15156 t);
15158 }
15159 else
15166 {
15170 }
15172 {
15174 "%qE appears more than once in %<nontemporal%> "
15177 }
15178 else
15185 {
15189 }
15191 {
15194 t);
15196 }
15197 else
15198 {
15202 }
15210 {
15213 {
15216 {
15224 sizetype,
15228 {
15231 }
15233 }
15234 }
15236 }
15244 {
15246 last_iterators_remove
15252 }
15253 else
15256 {
15261 {
15263 "%<depend%> clause with %<depobj%> dependence "
15266 }
15268 }
15273 {
15276 {
15278 "%<omp_all_memory%> used with %<depend%> kind "
15281 }
15282 }
15284 {
15286 "%qE is not lvalue expression nor array section in "
15290 }
15293 {
15300 }
15303 {
15305 {
15307 "%qE does not have %<omp_depend_t%> type in "
15308 "%<depend%> clause with %<depobj%> dependence "
15311 }
15312 }
15315 {
15317 "%qE should not have %<omp_depend_t%> type in "
15318 "%<depend%> clause with dependence type other than "
15321 }
15323 {
15326 else
15327 {
15331 {
15334 }
15336 RO_UNARY_STAR);
15338 {
15341 }
15342 }
15348 else
15350 }
15356 /* FALLTHRU */
15362 {
15368 else
15369 {
15372 {
15374 "array section does not have mappable type "
15378 }
15380 {
15385 }
15390 {
15391 do
15392 {
15396 {
15401 }
15402 }
15412 {
15415 }
15419 {
15422 "%qD appears more than once in motion "
15426 "%qD appears more than once in data "
15428 else
15430 "%qD appears more than once in map "
15433 }
15434 else
15435 {
15438 }
15439 }
15440 }
15446 /* In this case, we have a single array element which is a
15447 pointer, and we already set OMP_CLAUSE_SIZE in
15448 handle_omp_array_sections above. For attach/detach clauses,
15449 reset the OMP_CLAUSE_SIZE (representing a bias) to zero
15450 here. */
15453 }
15455 {
15458 }
15459 /* OpenACC attach / detach clauses must be pointers. */
15461 {
15464 }
15468 /* For attach/detach clauses, set OMP_CLAUSE_SIZE (representing a
15469 bias) to zero here, so it is not set erroneously to the pointer
15470 size later on in gimplify.cc. */
15474 {
15479 }
15481 {
15484 }
15490 {
15496 }
15500 {
15502 {
15507 }
15509 {
15514 }
15516 {
15521 }
15523 {
15526 {
15531 }
15534 {
15539 else
15541 }
15545 {
15550 }
15551 }
15555 {
15560 }
15561 }
15563 {
15568 }
15570 {
15575 }
15579 && !indir_component_ref_p
15590 {
15595 }
15599 {
15604 }
15613 {
15617 {
15621 }
15624 {
15628 else
15632 }
15633 else
15635 }
15638 {
15645 else
15649 }
15652 {
15656 }
15659 {
15663 else
15667 }
15668 else
15669 {
15674 }
15687 ;
15689 {
15692 "%qE is neither a variable nor a function name in "
15694 else
15698 }
15700 {
15703 cname);
15705 }
15707 {
15710 cname);
15712 }
15716 {
15718 "%qE appears more than once on the same "
15721 }
15722 else
15729 {
15733 else
15738 }
15739 /* map_head bitmap is used as uniform_head if declare_simd. */
15749 {
15752 {
15757 }
15759 {
15764 }
15765 }
15771 {
15774 else
15775 {
15779 }
15780 }
15794 {
15796 "%<nowait%> clause must not be used together "
15800 }
15807 {
15809 "%<order%> clause must not be used together "
15813 }
15815 {
15816 /* Silently remove duplicates. */
15819 }
15827 {
15833 }
15900 {
15902 "%<order%> clause must not be used together "
15906 }
15922 {
15924 "%<inbranch%> clause is incompatible with "
15928 }
15939 {
15944 }
15949 }
15952 {
15956 {
15960 }
15963 {
15969 {
15976 /* The __func__ variable and similar function-local
15977 predefined variables may be listed in a shared or
15978 firstprivate clause. */
15987 }
15989 {
15995 }
15999 {
16001 "%<const%> qualified %qE may appear only in "
16004 }
16005 }
16006 }
16009 {
16011 {
16012 /* If we found a clause to remove, we want to remove the whole
16013 expanded group, otherwise gimplify
16014 (omp_resolve_clause_dependencies) can get confused. */
16018 }
16019 else
16021 }
16022 else
16024 }
16027 && safelen
16030 {
16032 "%<simdlen%> clause value is bigger than "
16036 }
16039 && schedule_clause
16042 {
16044 "%<nonmonotonic%> schedule modifier specified together "
16050 }
16053 {
16055 "%qs clause specified together with %<inscan%> "
16058 }
16061 {
16063 "%qs clause specified together with %<inscan%> "
16066 }
16070 || allocate_seen
16073 {
16077 {
16082 {
16092 }
16093 /* FALLTHRU */
16104 }
16109 {
16111 "%<linear%> clause step is a parameter %qD not "
16115 }
16121 {
16132 }
16136 else
16138 }
16142 {
16147 {
16149 "%qD specified in %<allocate%> clause but not in "
16152 }
16155 else
16157 }
16160 {
16162 "%<nogroup%> clause must not be used together with "
16165 }
16168 {
16170 {
16172 "%<detach%> clause must not be used together with "
16175 }
16176 else
16177 {
16181 {
16188 {
16190 "the event handle of a %<detach%> clause "
16193 }
16196 else
16198 }
16199 }
16200 }
16204 }
16206 /* Return code to initialize DST with a copy constructor from SRC.
16207 C doesn't have copy constructors nor assignment operators, only for
16208 _Atomic vars we need to perform __atomic_load from src into a temporary
16209 followed by __atomic_store of the temporary to dst. */
16211 tree
16213 {
16228 /* Expansion of a generic atomic load may require an addition
16229 element, so allocate enough to prevent a resize. */
16232 /* Build __atomic_load (&src, &tmp, SEQ_CST); */
16241 /* Build __atomic_store (&dst, &tmp, SEQ_CST); */
16248 }
16250 /* Create a transaction node. */
16252 tree
16254 {
16261 }
16263 /* Make a variant type in the proper way for C/C++, propagating qualifiers
16264 down to the element type of an array. If ORIG_QUAL_TYPE is not
16265 NULL, then it should be used as the qualified type
16266 ORIG_QUAL_INDIRECT levels down in array type derivation (to
16267 preserve information about the typedef name from which an array
16268 type was derived). */
16270 tree
16273 {
16278 {
16279 tree t;
16284 /* See if we already have an identically qualified type. */
16287 else
16289 {
16296 }
16298 {
16309 {
16310 tree unqualified_canon
16315 {
16316 unqualified_canon
16319 }
16322 }
16323 else
16325 }
16327 }
16329 /* A restrict-qualified pointer type must be a pointer to object or
16330 incomplete type. Note that the use of POINTER_TYPE_P also allows
16331 REFERENCE_TYPEs, which is appropriate for C++. */
16335 {
16338 }
16341 ? orig_qual_type
16343 /* A variant type does not inherit the list of incomplete vars from the
16344 type main variant. */
16350 }
16352 /* Build a VA_ARG_EXPR for the C parser. */
16354 tree
16356 {
16359 /* VA_ARG_EXPR cannot be used for a scalar va_list with reverse storage
16360 order because it takes the address of the expression. */
16363 {
16366 }
16368 {
16372 }
16374 {
16376 type);
16378 }
16383 }
16385 /* Return truthvalue of whether T1 is the same tree structure as T2.
16386 Return 1 if they are the same. Return false if they are different. */
16388 bool
16390 {
16405 /* They might have become equal now. */
16416 {
16440 /* We need to do this when determining whether or not two
16441 non-type pointer to member function template arguments
16442 are the same. */
16446 {
16450 {
16455 }
16456 }
16470 {
16485 }
16488 {
16492 /* Special case: if either target is an unallocated VAR_DECL,
16493 it means that it's going to be unified with whatever the
16494 TARGET_EXPR is really supposed to initialize, so treat it
16495 as being equivalent to anything. */
16506 }
16523 {
16532 }
16534 CASE_CONVERT:
16541 }
16544 {
16552 {
16556 {
16568 }
16579 }
16585 }
16586 }
16588 /* Returns true when the function declaration FNDECL is implicit,
16589 introduced as a result of a call to an otherwise undeclared
16590 function, and false otherwise. */
16592 bool
16594 {
16596 }