| blob | 33d1e8439db0d0937d394df2c2ad0a61e3f5e04b |
1 /* Build expressions with type checking for C compiler.
2 Copyright (C) 1987-2022 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. */
56 /* Possible cases of implicit conversions. Used to select diagnostic messages
57 and control folding initializers in convert_for_assignment. */
59 ic_argpass,
60 ic_assign,
61 ic_init,
62 ic_init_const,
63 ic_return
64 };
66 /* The level of nesting inside "__alignof__". */
69 /* The level of nesting inside "sizeof". */
72 /* The level of nesting inside "typeof". */
75 /* True when parsing OpenMP loop expressions. */
78 /* The argument of last parsed sizeof expression, only to be tested
79 if expr.original_code == SIZEOF_EXPR. */
80 tree c_last_sizeof_arg;
81 location_t c_last_sizeof_loc;
83 /* Nonzero if we might need to print a "missing braces around
84 initializer" message within this initializer. */
101 tree);
127 \f
128 /* Return true if EXP is a null pointer constant, false otherwise. */
130 static bool
132 {
133 /* This should really operate on c_expr structures, but they aren't
134 yet available everywhere required. */
137 /* An integer constant expression with the value 0, such an expression
138 cast to type void*, or the predefined constant nullptr, are a null
139 pointer constant. */
150 }
152 /* EXPR may appear in an unevaluated part of an integer constant
153 expression, but not in an evaluated part. Wrap it in a
154 C_MAYBE_CONST_EXPR, or mark it with TREE_OVERFLOW if it is just an
155 INTEGER_CST and we cannot create a C_MAYBE_CONST_EXPR. */
157 static tree
159 {
160 tree ret;
162 {
165 }
166 else
167 {
170 }
172 }
174 /* Having checked whether EXPR may appear in an unevaluated part of an
175 integer constant expression and found that it may, remove any
176 C_MAYBE_CONST_EXPR noting this fact and return the resulting
177 expression. */
181 {
184 else
186 }
192 const_tree t1;
193 const_tree t2;
194 /* The return value of tagged_types_tu_compatible_p if we had seen
195 these two types already. */
197 };
202 /* Do `exp = require_complete_type (loc, exp);' to make sure exp
203 does not have an incomplete type. (That includes void types.)
204 LOC is the location of the use. */
206 tree
208 {
214 /* First, detect a valid value with a complete type. */
220 }
222 /* Print an error message for invalid use of an incomplete type.
223 VALUE is the expression that was used (or 0 if that isn't known)
224 and TYPE is the type that was invalid. LOC is the location for
225 the error. */
227 void
229 {
230 /* Avoid duplicate error message. */
236 else
237 {
238 retry:
239 /* We must print an error message. Be clever about what it says. */
242 {
254 {
256 {
259 }
262 }
268 }
272 else
273 /* If this type has a typedef-name, the TYPE_NAME is a TYPE_DECL. */
275 }
276 }
278 /* Given a type, apply default promotions wrt unnamed function
279 arguments and return the new type. */
281 tree
283 {
289 {
290 /* Preserve unsignedness if not really getting any wider. */
294 else
296 }
304 }
306 /* Return true if between two named address spaces, whether there is a superset
307 named address space that encompasses both address spaces. If there is a
308 superset, return which address space is the superset. */
310 static bool
312 {
314 {
317 }
319 {
322 }
324 {
327 }
328 else
330 }
332 /* Return a variant of TYPE which has all the type qualifiers of LIKE
333 as well as those of TYPE. */
335 static tree
337 {
340 addr_space_t as_common;
342 /* If the two named address spaces are different, determine the common
343 superset address space. If there isn't one, raise an error. */
345 {
349 }
355 }
357 /* Return true iff the given tree T is a variable length array. */
359 bool
361 {
366 }
368 /* If NTYPE is a type of a non-variadic function with a prototype
369 and OTYPE is a type of a function without a prototype and ATTRS
370 contains attribute format, diagnosess and removes it from ATTRS.
371 Returns the result of build_type_attribute_variant of NTYPE and
372 the (possibly) modified ATTRS. */
374 static tree
376 {
380 {
382 "%qs attribute cannot be applied to a function that "
385 }
388 }
389 /* Return the composite type of two compatible types.
391 We assume that comptypes has already been done and returned
392 nonzero; if that isn't so, this may crash. In particular, we
393 assume that qualifiers match. */
395 tree
397 {
400 tree attributes;
402 /* Save time if the two types are the same. */
406 /* If one type is nonsense, use the other. */
415 /* Merge the attributes. */
418 /* If one is an enumerated type and the other is the compatible
419 integer type, the composite type might be either of the two
420 (DR#013 question 3). For consistency, use the enumerated type as
421 the composite type. */
431 {
433 /* For two pointers, do this recursively on the target type. */
434 {
441 }
444 {
447 tree unqual_elt;
454 /* We should not have any type quals on arrays at all. */
464 d1_variable = (!d1_zero
467 d2_variable = (!d2_zero
473 /* Save space: see if the result is identical to one of the args. */
486 /* Merge the element types, and have a size if either arg has
487 one. We may have qualifiers on the element types. To set
488 up TYPE_MAIN_VARIANT correctly, we need to form the
489 composite of the unqualified types and add the qualifiers
490 back at the end. */
495 && (d2_variable
496 || d2_zero
498 ? t1
500 /* Ensure a composite type involving a zero-length array type
501 is a zero-length type not an incomplete type. */
505 {
508 }
511 }
517 {
518 /* Try harder not to create a new aggregate type. */
523 }
527 /* Function types: prefer the one that specified arg types.
528 If both do, merge the arg types. Also merge the return types. */
529 {
537 /* Save space: see if the result is identical to one of the args. */
543 /* Simple way if one arg fails to specify argument types. */
545 {
549 }
551 {
555 }
557 /* If both args specify argument types, we must merge the two
558 lists, argument by argument. */
563 ;
572 {
573 /* A null type means arg type is not specified.
574 Take whatever the other function type has. */
576 {
579 }
581 {
584 }
586 /* Given wait (union {union wait *u; int *i} *)
587 and wait (union wait *),
588 prefer union wait * as type of parm. */
591 {
592 tree memb;
599 {
605 {
611 }
612 }
613 }
616 {
617 tree memb;
624 {
630 {
636 }
637 }
638 }
640 parm_done: ;
641 }
645 }
646 /* FALLTHRU */
650 }
652 }
654 /* Return the type of a conditional expression between pointers to
655 possibly differently qualified versions of compatible types.
657 We assume that comp_target_types has already been done and returned
658 nonzero; if that isn't so, this may crash. */
660 static tree
662 {
663 tree attributes;
666 tree target;
671 /* Save time if the two types are the same. */
675 /* If one type is nonsense, use the other. */
684 /* Merge the attributes. */
687 /* Find the composite type of the target types, and combine the
688 qualifiers of the two types' targets. Do not lose qualifiers on
689 array element types by taking the TYPE_MAIN_VARIANT. */
698 /* Strip array types to get correct qualifier for pointers to arrays */
702 /* For function types do not merge const qualifiers, but drop them
703 if used inconsistently. The middle-end uses these to mark const
704 and noreturn functions. */
707 else
710 /* If the two named address spaces are different, determine the common
711 superset address space. This is guaranteed to exist due to the
712 assumption that comp_target_type returned non-zero. */
722 }
724 /* Return the common type for two arithmetic types under the usual
725 arithmetic conversions. The default conversions have already been
726 applied, and enumerated types converted to their compatible integer
727 types. The resulting type is unqualified and has no attributes.
729 This is the type for the result of most arithmetic operations
730 if the operands have the given two types. */
732 static tree
734 {
738 /* If one type is nonsense, use the other. */
751 {
754 }
757 {
760 }
762 /* Save time if the two types are the same. */
776 /* When one operand is a decimal float type, the other operand cannot be
777 a generic float type or a complex type. We also disallow vector types
778 here. */
781 {
783 {
786 }
788 {
791 }
793 {
797 }
798 }
800 /* If one type is a vector type, return that type. (How the usual
801 arithmetic conversions apply to the vector types extension is not
802 precisely specified.) */
809 /* If one type is complex, form the common type of the non-complex
810 components, then make that complex. Use T1 or T2 if it is the
811 required type. */
813 {
822 else
824 }
826 /* If only one is real, use it as the result. */
834 /* If both are real and either are decimal floating point types, use
835 the decimal floating point type with the greater precision. */
838 {
848 }
850 /* Deal with fixed-point types. */
852 {
860 /* If one input type is saturating, the result type is saturating. */
864 /* If both fixed-point types are unsigned, the result type is unsigned.
865 When mixing fixed-point and integer types, follow the sign of the
866 fixed-point type.
867 Otherwise, the result type is signed. */
876 /* The result type is signed. */
878 {
879 /* If the input type is unsigned, we need to convert to the
880 signed type. */
882 {
888 else
892 }
894 {
900 else
904 }
905 }
908 {
911 }
912 else
913 {
915 /* Signed integers need to subtract one sign bit. */
917 }
920 {
923 }
924 else
925 {
927 /* Signed integers need to subtract one sign bit. */
929 }
934 satp);
935 }
937 /* Both real or both integers; use the one with greater precision. */
944 /* Same precision. Prefer long longs to longs to ints when the
945 same precision, following the C99 rules on integer type rank
946 (which are equivalent to the C90 rules for C90 types). */
954 {
957 else
959 }
967 {
968 /* But preserve unsignedness from the other type,
969 since long cannot hold all the values of an unsigned int. */
972 else
974 }
976 /* For floating types of the same TYPE_PRECISION (which we here
977 assume means either the same set of values, or sets of values
978 neither a subset of the other, with behavior being undefined in
979 the latter case), follow the rules from TS 18661-3: prefer
980 interchange types _FloatN, then standard types long double,
981 double, float, then extended types _FloatNx. For extended types,
982 check them starting with _Float128x as that seems most consistent
983 in spirit with preferring long double to double; for interchange
984 types, also check in that order for consistency although it's not
985 possible for more than one of them to have the same
986 precision. */
994 /* Likewise, prefer long double to double even if same size. */
998 /* Likewise, prefer double to float even if same size.
999 We got a couple of embedded targets with 32 bit doubles, and the
1000 pdp11 might have 64 bit floats. */
1011 /* Otherwise prefer the unsigned one. */
1015 else
1017 }
1018 \f
1019 /* Wrapper around c_common_type that is used by c-common.cc and other
1020 front end optimizations that remove promotions. ENUMERAL_TYPEs
1021 are allowed here and are converted to their compatible integer types.
1022 BOOLEAN_TYPEs are allowed here and return either boolean_type_node or
1023 preferably a non-Boolean type as the common type. */
1024 tree
1026 {
1032 /* If both types are BOOLEAN_TYPE, then return boolean_type_node. */
1037 /* If either type is BOOLEAN_TYPE, then return the other. */
1044 }
1046 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
1047 or various other operations. Return 2 if they are compatible
1048 but a warning may be needed if you use them together. */
1050 int
1052 {
1060 }
1062 /* Like comptypes, but if it returns non-zero because enum and int are
1063 compatible, it sets *ENUM_AND_INT_P to true. */
1065 int
1067 {
1075 }
1077 /* Like comptypes, but if it returns nonzero for different types, it
1078 sets *DIFFERENT_TYPES_P to true. */
1080 int
1083 {
1091 }
1092 \f
1093 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
1094 or various other operations. Return 2 if they are compatible
1095 but a warning may be needed if you use them together. If
1096 ENUM_AND_INT_P is not NULL, and one type is an enum and the other a
1097 compatible integer type, then this sets *ENUM_AND_INT_P to true;
1098 *ENUM_AND_INT_P is never set to false. If DIFFERENT_TYPES_P is not
1099 NULL, and the types are compatible but different enough not to be
1100 permitted in C11 typedef redeclarations, then this sets
1101 *DIFFERENT_TYPES_P to true; *DIFFERENT_TYPES_P is never set to
1102 false, but may or may not be set if the types are incompatible.
1103 This differs from comptypes, in that we don't free the seen
1104 types. */
1106 static int
1109 {
1114 /* Suppress errors caused by previously reported errors. */
1120 /* Enumerated types are compatible with integer types, but this is
1121 not transitive: two enumerated types in the same translation unit
1122 are compatible with each other only if they are the same type. */
1127 {
1130 {
1135 }
1136 }
1140 {
1143 {
1148 }
1149 }
1154 /* Different classes of types can't be compatible. */
1159 /* Qualifiers must match. C99 6.7.3p9 */
1164 /* Allow for two different type nodes which have essentially the same
1165 definition. Note that we already checked for equality of the type
1166 qualifiers (just above). */
1172 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1176 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1180 {
1184 /* With these nodes, we can't determine type equivalence by
1185 looking at what is stored in the nodes themselves, because
1186 two nodes might have different TYPE_MAIN_VARIANTs but still
1187 represent the same type. For example, wchar_t and int could
1188 have the same properties (TYPE_PRECISION, TYPE_MIN_VALUE,
1189 TYPE_MAX_VALUE, etc.), but have different TYPE_MAIN_VARIANTs
1190 and are distinct types. On the other hand, int and the
1191 following typedef
1193 typedef int INT __attribute((may_alias));
1195 have identical properties, different TYPE_MAIN_VARIANTs, but
1196 represent the same type. The canonical type system keeps
1197 track of equivalence in this case, so we fall back on it. */
1201 /* Do not remove mode information. */
1211 different_types_p);
1215 {
1222 /* Target types must match incl. qualifiers. */
1225 enum_and_int_p,
1232 /* Sizes must match unless one is missing or variable. */
1239 d1_variable = (!d1_zero
1242 d2_variable = (!d2_zero
1261 }
1267 {
1277 different_types_p);
1279 different_types_p);
1280 }
1291 }
1293 }
1295 /* Return 1 if TTL and TTR are pointers to types that are equivalent, ignoring
1296 their qualifiers, except for named address spaces. If the pointers point to
1297 different named addresses, then we must determine if one address space is a
1298 subset of the other. */
1300 static int
1302 {
1309 addr_space_t as_common;
1312 /* Fail if pointers point to incompatible address spaces. */
1316 /* For pedantic record result of comptypes on arrays before losing
1317 qualifiers on the element type below. */
1324 /* Qualifiers on element types of array types that are
1325 pointer targets are lost by taking their TYPE_MAIN_VARIANT. */
1339 pedwarn_c11 (location, OPT_Wpedantic, "invalid use of pointers to arrays with different qualifiers "
1350 }
1351 \f
1352 /* Subroutines of `comptypes'. */
1354 /* Determine whether two trees derive from the same translation unit.
1355 If the CONTEXT chain ends in a null, that tree's context is still
1356 being parsed, so if two trees have context chains ending in null,
1357 they're in the same translation unit. */
1359 bool
1361 {
1364 {
1372 }
1376 {
1384 }
1387 }
1389 /* Allocate the seen two types, assuming that they are compatible. */
1393 {
1401 /* The C standard says that two structures in different translation
1402 units are compatible with each other only if the types of their
1403 fields are compatible (among other things). We assume that they
1404 are compatible until proven otherwise when building the cache.
1405 An example where this can occur is:
1406 struct a
1407 {
1408 struct a *next;
1409 };
1410 If we are comparing this against a similar struct in another TU,
1411 and did not assume they were compatible, we end up with an infinite
1412 loop. */
1415 }
1417 /* Free the seen types until we get to TU_TIL. */
1419 static void
1421 {
1424 {
1429 }
1431 }
1433 /* Return 1 if two 'struct', 'union', or 'enum' types T1 and T2 are
1434 compatible. If the two types are not the same (which has been
1435 checked earlier), this can only happen when multiple translation
1436 units are being compiled. See C99 6.2.7 paragraph 1 for the exact
1437 rules. ENUM_AND_INT_P and DIFFERENT_TYPES_P are as in
1438 comptypes_internal. */
1440 static int
1443 {
1447 /* We have to verify that the tags of the types are the same. This
1448 is harder than it looks because this may be a typedef, so we have
1449 to go look at the original type. It may even be a typedef of a
1450 typedef...
1451 In the case of compiler-created builtin structs the TYPE_DECL
1452 may be a dummy, with no DECL_ORIGINAL_TYPE. Don't fault. */
1463 /* C90 didn't have the requirement that the two tags be the same. */
1467 /* C90 didn't say what happened if one or both of the types were
1468 incomplete; we choose to follow C99 rules here, which is that they
1469 are compatible. */
1474 {
1479 }
1482 {
1484 {
1486 /* Speed up the case where the type values are in the same order. */
1491 {
1493 }
1496 {
1500 {
1503 }
1504 }
1507 {
1509 }
1511 {
1514 }
1517 {
1520 }
1523 {
1527 {
1530 }
1531 }
1533 }
1536 {
1539 {
1542 }
1544 /* Speed up the common case where the fields are in the same order. */
1547 {
1558 {
1561 }
1568 {
1571 }
1572 }
1574 {
1577 }
1580 {
1585 {
1589 enum_and_int_p,
1590 different_types_p);
1595 {
1598 }
1609 }
1611 {
1614 }
1615 }
1618 }
1621 {
1627 {
1643 }
1646 else
1649 }
1653 }
1654 }
1656 /* Return 1 if two function types F1 and F2 are compatible.
1657 If either type specifies no argument types,
1658 the other must specify a fixed number of self-promoting arg types.
1659 Otherwise, if one type specifies only the number of arguments,
1660 the other must specify that number of self-promoting arg types.
1661 Otherwise, the argument types must match.
1662 ENUM_AND_INT_P and DIFFERENT_TYPES_P are as in comptypes_internal. */
1664 static int
1667 {
1669 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1677 /* 'volatile' qualifiers on a function's return type used to mean
1678 the function is noreturn. */
1698 /* An unspecified parmlist matches any specified parmlist
1699 whose argument types don't need default promotions. */
1702 {
1705 /* If one of these types comes from a non-prototype fn definition,
1706 compare that with the other type's arglist.
1707 If they don't match, ask for a warning (but no error). */
1713 }
1715 {
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 /* Convert expression EXP (location LOC) from lvalue to rvalue,
2129 including converting functions and arrays to pointers if CONVERT_P.
2130 If READ_P, also mark the expression as having been read. */
2132 struct c_expr
2135 {
2143 {
2152 /* Expansion of a generic atomic load may require an addition
2153 element, so allocate enough to prevent a resize. */
2156 /* Remove the qualifiers for the rest of the expressions and
2157 create the VAL temp variable to hold the RHS. */
2162 /* Do not disable warnings for TMP even though it's artificial.
2163 -Winvalid-memory-model depends on it. */
2165 /* Issue __atomic_load (&expr, &tmp, SEQ_CST); */
2172 /* EXPR is always read. */
2175 /* Return tmp which contains the value loaded. */
2178 }
2181 exp.value = convert (build_qualified_type (TREE_TYPE (exp.value), TYPE_UNQUALIFIED), exp.value);
2183 }
2185 /* EXP is an expression of integer type. Apply the integer promotions
2186 to it and return the promoted value. */
2188 tree
2190 {
2196 /* Normally convert enums to int,
2197 but convert wide enums to something wider. */
2199 {
2207 }
2209 /* ??? This should no longer be needed now bit-fields have their
2210 proper types. */
2213 /* If it's thinner than an int, promote it like a
2214 c_promoting_integer_type_p, otherwise leave it alone. */
2220 {
2221 /* Preserve unsignedness if not really getting any wider. */
2227 }
2230 }
2233 /* Perform default promotions for C data used in expressions.
2234 Enumeral types or short or char are converted to int.
2235 In addition, manifest constants symbols are replaced by their values. */
2237 tree
2239 {
2240 tree orig_exp;
2243 tree promoted_type;
2247 /* Functions and arrays have been converted during parsing. */
2252 /* Constants can be used directly unless they're not loadable. */
2256 /* Strip no-op conversions. */
2263 {
2267 }
2281 }
2282 \f
2283 /* Look up COMPONENT in a structure or union TYPE.
2285 If the component name is not found, returns NULL_TREE. Otherwise,
2286 the return value is a TREE_LIST, with each TREE_VALUE a FIELD_DECL
2287 stepping down the chain to the component, which is in the last
2288 TREE_VALUE of the list. Normally the list is of length one, but if
2289 the component is embedded within (nested) anonymous structures or
2290 unions, the list steps down the chain to the component. */
2292 static tree
2294 {
2295 tree field;
2297 /* If TYPE_LANG_SPECIFIC is set, then it is a sorted array of pointers
2298 to the field elements. Use a binary search on this array to quickly
2299 find the element. Otherwise, do a linear search. TYPE_LANG_SPECIFIC
2300 will always be set for structures which have many elements.
2302 Duplicate field checking replaces duplicates with NULL_TREE so
2303 TYPE_LANG_SPECIFIC arrays are potentially no longer sorted. In that
2304 case just iterate using DECL_CHAIN. */
2308 {
2316 {
2321 {
2322 /* Step through all anon unions in linear fashion. */
2324 {
2327 {
2333 /* The Plan 9 compiler permits referring
2334 directly to an anonymous struct/union field
2335 using a typedef name. */
2343 }
2344 }
2346 /* Entire record is only anon unions. */
2350 /* Restart the binary search, with new lower bound. */
2352 }
2358 else
2360 }
2366 }
2367 else
2368 {
2370 {
2373 {
2379 /* The Plan 9 compiler permits referring directly to an
2380 anonymous struct/union field using a typedef
2381 name. */
2388 }
2392 }
2396 }
2399 }
2401 /* Recursively append candidate IDENTIFIER_NODEs to CANDIDATES. */
2403 static void
2406 {
2407 tree field;
2409 {
2413 candidates);
2417 }
2418 }
2420 /* Like "lookup_field", but find the closest matching IDENTIFIER_NODE,
2421 rather than returning a TREE_LIST for an exact match. */
2423 static tree
2425 {
2428 /* First, gather a list of candidates. */
2435 }
2437 /* Support function for build_component_ref's error-handling.
2439 Given DATUM_TYPE, and "DATUM.COMPONENT", where DATUM is *not* a
2440 struct or union, should we suggest "DATUM->COMPONENT" as a hint? */
2442 static bool
2444 {
2445 /* We don't do it for Objective-C, since Objective-C 2.0 dot-syntax
2446 allows "." for ptrs; we could be handling a failed attempt
2447 to access a property. */
2451 /* Only suggest it for pointers... */
2455 /* ...to structs/unions. */
2460 else
2462 }
2464 /* Make an expression to refer to the COMPONENT field of structure or
2465 union value DATUM. COMPONENT is an IDENTIFIER_NODE. LOC is the
2466 location of the COMPONENT_REF. COMPONENT_LOC is the location
2467 of COMPONENT. ARROW_LOC is the location of the first -> operand if
2468 it is from -> operator. */
2470 tree
2473 {
2477 tree ref;
2483 /* Detect Objective-C property syntax object.property. */
2488 /* See if there is a field or component with name COMPONENT. */
2491 {
2493 {
2496 }
2501 {
2504 {
2505 /* Attempt to provide a fixit replacement hint, if
2506 we have a valid range for the component. */
2507 location_t reported_loc
2515 }
2516 else
2519 }
2521 /* Accessing elements of atomic structures or unions is undefined
2522 behavior (C11 6.5.2.3#5). */
2524 {
2528 else
2531 }
2533 /* Chain the COMPONENT_REFs if necessary down to the FIELD.
2534 This might be better solved in future the way the C++ front
2535 end does it - by giving the anonymous entities each a
2536 separate name and type, and then have build_component_ref
2537 recursively call itself. We can't do that here. */
2538 do
2539 {
2542 tree subtype;
2548 /* If this is an rvalue, it does not have qualifiers in C
2549 standard terms and we must avoid propagating such
2550 qualifiers down to a non-lvalue array that is then
2551 converted to a pointer. */
2552 use_datum_quals = (datum_lvalue
2561 NULL_TREE);
2578 }
2582 }
2584 {
2585 /* Special-case the error message for "ptr.field" for the case
2586 where the user has confused "." vs "->". */
2589 {
2593 "%qE is a pointer to pointer; did you mean to dereference "
2596 }
2597 else
2598 {
2599 /* "loc" should be the "." token. */
2603 datum);
2604 }
2606 }
2610 component);
2613 }
2614 \f
2615 /* Given an expression PTR for a pointer, return an expression
2616 for the value pointed to.
2617 ERRORSTRING is the name of the operator to appear in error messages.
2619 LOC is the location to use for the generated tree. */
2621 tree
2623 {
2626 tree ref;
2629 {
2632 {
2633 /* If a warning is issued, mark it to avoid duplicates from
2634 the backend. This only needs to be done at
2635 warn_strict_aliasing > 2. */
2640 }
2645 {
2649 }
2650 else
2651 {
2659 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
2660 so that we get the proper error message if the result is used
2661 to assign to. Also, &* is supposed to be a no-op.
2662 And ANSI C seems to specify that the type of the result
2663 should be the const type. */
2664 /* A de-reference of a pointer to const is not a const. It is valid
2665 to change it via some other pointer. */
2672 }
2673 }
2678 }
2680 /* This handles expressions of the form "a[i]", which denotes
2681 an array reference.
2683 This is logically equivalent in C to *(a+i), but we may do it differently.
2684 If A is a variable or a member, we generate a primitive ARRAY_REF.
2685 This avoids forcing the array out of registers, and can work on
2686 arrays that are not lvalues (for example, members of structures returned
2687 by functions).
2689 For vector types, allow vector[i] but not i[vector], and create
2690 *(((type*)&vectortype) + i) for the expression.
2692 LOC is the location to use for the returned expression. */
2694 tree
2696 {
2697 tree ret;
2705 /* Allow vector[index] but not index[vector]. */
2707 {
2710 {
2715 }
2718 }
2721 {
2724 }
2727 {
2730 }
2732 /* ??? Existing practice has been to warn only when the char
2733 index is syntactically the index, not for char[array]. */
2737 /* Apply default promotions *after* noticing character types. */
2748 {
2751 /* An array that is indexed by a non-constant
2752 cannot be stored in a register; we must be able to do
2753 address arithmetic on its address.
2754 Likewise an array of elements of variable size. */
2758 {
2761 }
2762 /* An array that is indexed by a constant value which is not within
2763 the array bounds cannot be stored in a register either; because we
2764 would get a crash in store_bit_field/extract_bit_field when trying
2765 to access a non-existent part of the register. */
2769 {
2772 }
2776 {
2785 "ISO C90 forbids subscripting non-lvalue "
2787 }
2791 /* Array ref is const/volatile if the array elements are
2792 or if the array is. */
2801 /* This was added by rms on 16 Nov 91.
2802 It fixes vol struct foo *a; a->elts[1]
2803 in an inline function.
2804 Hope it doesn't break something else. */
2811 }
2812 else
2813 {
2824 RO_ARRAY_INDEXING);
2828 }
2829 }
2830 \f
2831 /* Build an external reference to identifier ID. FUN indicates
2832 whether this will be used for a function call. LOC is the source
2833 location of the identifier. This sets *TYPE to the type of the
2834 identifier, which is not the same as the type of the returned value
2835 for CONST_DECLs defined as enum constants. If the type of the
2836 identifier is not available, *TYPE is set to NULL. */
2837 tree
2839 {
2840 tree ref;
2843 /* In Objective-C, an instance variable (ivar) may be preferred to
2844 whatever lookup_name() found. */
2849 {
2852 }
2854 /* Implicit function declaration. */
2857 /* Don't complain about something that's already been
2858 complained about. */
2860 else
2861 {
2864 }
2874 /* Recursive call does not count as usage. */
2876 {
2878 }
2881 {
2888 }
2891 {
2897 {
2902 }
2906 }
2911 {
2916 }
2917 /* C99 6.7.4p3: An inline definition of a function with external
2918 linkage ... shall not contain a reference to an identifier with
2919 internal linkage. */
2928 csi_internal);
2931 }
2933 /* Record details of decls possibly used inside sizeof or typeof. */
2934 struct maybe_used_decl
2935 {
2936 /* The decl. */
2937 tree decl;
2938 /* The level seen at (in_sizeof + in_typeof). */
2940 /* The next one at this level or above, or NULL. */
2942 };
2946 /* Record that DECL, an undefined static function reference seen
2947 inside sizeof or typeof, might be used if the operand of sizeof is
2948 a VLA type or the operand of typeof is a variably modified
2949 type. */
2951 static void
2953 {
2959 }
2961 /* Pop the stack of decls possibly used inside sizeof or typeof. If
2962 USED is false, just discard them. If it is true, mark them used
2963 (if no longer inside sizeof or typeof) or move them to the next
2964 level up (if still inside sizeof or typeof). */
2966 void
2968 {
2972 {
2974 {
2977 else
2979 }
2981 }
2984 }
2986 /* Return the result of sizeof applied to EXPR. */
2988 struct c_expr
2990 {
2993 {
2998 }
2999 else
3000 {
3005 {
3006 auto_diagnostic_group d;
3008 "%<sizeof%> on array function parameter %qE will "
3012 }
3021 {
3022 /* sizeof is evaluated when given a vla (C99 6.5.3.4p2). */
3027 }
3029 }
3031 }
3033 /* Return the result of sizeof applied to T, a structure for the type
3034 name passed to sizeof (rather than the type itself). LOC is the
3035 location of the original expression. */
3037 struct c_expr
3039 {
3040 tree type;
3051 {
3054 }
3055 else
3058 {
3059 /* If the type is a [*] array, it is a VLA but is represented as
3060 having a size of zero. In such a case we must ensure that
3061 the result of sizeof does not get folded to a constant by
3062 c_fully_fold, because if the size is evaluated the result is
3063 not constant and so constraints on zero or negative size
3064 arrays must not be applied when this sizeof call is inside
3065 another array declarator. */
3071 }
3075 }
3077 /* Build a function call to function FUNCTION with parameters PARAMS.
3078 The function call is at LOC.
3079 PARAMS is a list--a chain of TREE_LIST nodes--in which the
3080 TREE_VALUE of each node is a parameter-expression.
3081 FUNCTION's data type may be a function type or a pointer-to-function. */
3083 tree
3085 {
3087 tree ret;
3095 }
3097 /* Give a note about the location of the declaration of DECL. */
3099 static void
3101 {
3105 }
3107 /* Build a function call to function FUNCTION with parameters PARAMS.
3108 If FUNCTION is the result of resolving an overloaded target built-in,
3109 ORIG_FUNDECL is the original function decl, otherwise it is null.
3110 ORIGTYPES, if not NULL, is a vector of types; each element is
3111 either NULL or the original type of the corresponding element in
3112 PARAMS. The original type may differ from TREE_TYPE of the
3113 parameter for enums. FUNCTION's data type may be a function type
3114 or pointer-to-function. This function changes the elements of
3115 PARAMS. */
3117 tree
3121 {
3124 tree tem;
3129 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
3132 /* Convert anything with function type to a pointer-to-function. */
3134 {
3142 /* Atomic functions have type checking/casting already done. They are
3143 often rewritten and don't match the original parameter list. */
3146 }
3150 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
3151 expressions, like those used for ObjC messenger dispatches. */
3164 {
3168 function);
3170 {
3173 function);
3175 }
3176 else
3180 }
3185 /* fntype now gets the type of function pointed to. */
3188 /* Convert the parameters to the types declared in the
3189 function prototype, or apply default promotions. */
3196 /* Check that the function is called through a compatible prototype.
3197 If it is not, warn. */
3202 {
3205 /* This situation leads to run-time undefined behavior. We can't,
3206 therefore, simply error unless we can prove that all possible
3207 executions of the program must execute the code. */
3214 }
3218 /* Check that arguments to builtin functions match the expectations. */
3225 /* Check that the arguments to the function are valid. */
3231 {
3233 result
3236 else
3242 }
3243 else
3246 /* If -Wnonnull warning has been diagnosed, avoid diagnosing it again
3247 later. */
3251 /* In this improbable scenario, a nested function returns a VM type.
3252 Create a TARGET_EXPR so that the call always has a LHS, much as
3253 what the C++ FE does for functions returning non-PODs. */
3255 {
3259 }
3262 {
3267 }
3269 }
3271 /* Like build_function_call_vec, but call also resolve_overloaded_builtin. */
3273 tree
3277 {
3278 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
3281 /* Convert anything with function type to a pointer-to-function. */
3283 {
3284 /* Implement type-directed function overloading for builtins.
3285 resolve_overloaded_builtin and targetm.resolve_overloaded_builtin
3286 handle all the type checking. The result is a complete expression
3287 that implements this function call. */
3291 }
3293 }
3294 \f
3295 /* Helper for convert_arguments called to convert the VALue of argument
3296 number ARGNUM from ORIGTYPE to the corresponding parameter number
3297 PARMNUM and TYPE.
3298 PLOC is the location where the conversion is being performed.
3299 FUNCTION and FUNDECL are the same as in convert_arguments.
3300 VALTYPE is the original type of VAL before the conversion and,
3301 for EXCESS_PRECISION_EXPR, the operand of the expression.
3302 NPC is true if VAL represents the null pointer constant (VAL itself
3303 will have been folded to an integer constant).
3304 RNAME is the same as FUNCTION except in Objective C when it's
3305 the function selector.
3306 EXCESS_PRECISION is true when VAL was originally represented
3307 as EXCESS_PRECISION_EXPR.
3308 WARNOPT is the same as in convert_for_assignment. */
3310 static tree
3315 {
3316 /* Formal parm type is specified by a function prototype. */
3319 {
3323 }
3325 /* Optionally warn about conversions that differ from the default
3326 conversions. */
3328 {
3334 "passing argument %d of %qE as integer rather "
3340 "passing argument %d of %qE as integer rather "
3346 "passing argument %d of %qE as complex rather "
3352 "passing argument %d of %qE as floating rather "
3358 "passing argument %d of %qE as complex rather "
3364 "passing argument %d of %qE as floating rather "
3367 /* ??? At some point, messages should be written about
3368 conversions between complex types, but that's too messy
3369 to do now. */
3372 {
3373 /* Warn if any argument is passed as `float',
3374 since without a prototype it would be `double'. */
3378 "passing argument %d of %qE as %<float%> "
3382 /* Warn if mismatch between argument and prototype
3383 for decimal float types. Warn of conversions with
3384 binary float types and of precision narrowing due to
3385 prototype. */
3393 && (formal_prec
3396 && (valtype
3397 != dfloat64_type_node
3398 && (valtype
3401 && (valtype
3404 "passing argument %d of %qE as %qT "
3408 }
3409 /* Detect integer changing in width or signedness.
3410 These warnings are only activated with
3411 -Wtraditional-conversion, not with -Wtraditional. */
3415 {
3424 /* No warning if function asks for enum
3425 and the actual arg is that enum type. */
3426 ;
3429 "passing argument %d of %qE "
3433 ;
3434 /* Don't complain if the formal parameter type
3435 is an enum, because we can't tell now whether
3436 the value was an enum--even the same enum. */
3438 ;
3441 /* Change in signedness doesn't matter
3442 if a constant value is unaffected. */
3443 ;
3444 /* If the value is extended from a narrower
3445 unsigned type, it doesn't matter whether we
3446 pass it as signed or unsigned; the value
3447 certainly is the same either way. */
3450 ;
3453 "passing argument %d of %qE "
3456 else
3458 "passing argument %d of %qE "
3461 }
3462 }
3464 /* Possibly restore an EXCESS_PRECISION_EXPR for the
3465 sake of better warnings from convert_and_check. */
3480 }
3482 /* Convert the argument expressions in the vector VALUES
3483 to the types in the list TYPELIST.
3485 If TYPELIST is exhausted, or when an element has NULL as its type,
3486 perform the default conversions.
3488 ORIGTYPES is the original types of the expressions in VALUES. This
3489 holds the type of enum values which have been converted to integral
3490 types. It may be NULL.
3492 FUNCTION is a tree for the called function. It is used only for
3493 error messages, where it is formatted with %qE.
3495 This is also where warnings about wrong number of args are generated.
3497 ARG_LOC are locations of function arguments (if any).
3499 Returns the actual number of arguments processed (which may be less
3500 than the length of VALUES in some error situations), or -1 on
3501 failure. */
3503 static int
3507 {
3514 tree selector;
3516 /* Change pointer to function to the function itself for
3517 diagnostics. */
3522 /* Handle an ObjC selector specially for diagnostics. */
3525 /* For a call to a built-in function declared without a prototype,
3526 set to the built-in function's argument list. */
3529 /* For type-generic built-in functions, determine whether excess
3530 precision should be removed (classification) or not
3531 (comparison). */
3534 {
3537 {
3538 /* For a call to a built-in function declared without a prototype
3539 use the types of the parameters of the internal built-in to
3540 match those of the arguments to. */
3543 }
3545 /* For type-generic built-in functions, determine whether excess
3546 precision should be removed (classification) or not
3547 (comparison). */
3550 {
3564 /* The last argument of these type-generic builtins
3565 should not be promoted. */
3571 }
3572 }
3574 /* Scan the given expressions (VALUES) and types (TYPELIST), producing
3575 individual converted arguments. */
3583 {
3584 /* The type of the function parameter (if it was declared with one). */
3586 /* The type of the built-in function parameter (if the function
3587 is a built-in). Used to detect type incompatibilities in
3588 calls to built-ins declared without a prototype. */
3589 tree builtin_type = (builtin_typetail
3591 /* The original type of the argument being passed to the function. */
3593 /* The called function (or function selector in Objective C). */
3597 /* Set for EXCESS_PRECISION_EXPR arguments. */
3599 /* The value of the argument after conversion to the type
3600 of the function parameter it is passed to. */
3601 tree parmval;
3602 /* Some __atomic_* builtins have additional hidden argument at
3603 position 0. */
3604 location_t ploc
3610 {
3613 else
3617 }
3620 {
3622 "too many arguments to built-in function %qE "
3626 }
3629 {
3632 }
3634 /* Determine if VAL is a null pointer constant before folding it. */
3637 /* If there is excess precision and a prototype, convert once to
3638 the required type rather than converting via the semantic
3639 type. Likewise without a prototype a float value represented
3640 as long double should be converted once to double. But for
3641 type-generic classification functions excess precision must
3642 be removed here. */
3645 {
3648 }
3654 /* Some floating-point arguments must be promoted to double when
3655 no type is specified by a prototype. This applies to
3656 arguments of type float, and to architecture-specific types
3657 (ARM __fp16), but not to _FloatN or _FloatNx types. */
3666 {
3667 /* Promote this argument, unless it has a _FloatN or
3668 _FloatNx type. */
3672 {
3675 }
3676 }
3679 {
3684 }
3686 {
3689 else
3690 {
3691 /* Convert `float' to `double'. */
3694 "implicit conversion from %qT to %qT when passing "
3698 }
3699 }
3702 /* A "double" argument with excess precision being passed
3703 without a prototype or in variable arguments.
3704 The last argument of __builtin_*_overflow_p should not be
3705 promoted. */
3709 {
3712 }
3714 {
3716 }
3717 else
3718 /* Convert `short' and `char' to full-size `int'. */
3726 {
3727 /* For a call to a built-in function declared without a prototype,
3728 perform the conversions from the argument to the expected type
3729 but issue warnings rather than errors for any mismatches.
3730 Ignore the converted argument and use the PARMVAL obtained
3731 above by applying default conversions instead. */
3735 excess_precision,
3736 OPT_Wbuiltin_declaration_mismatch);
3737 }
3744 }
3749 {
3753 }
3756 {
3762 "too few arguments to built-in function %qE "
3765 }
3768 }
3769 \f
3770 /* This is the entry point used by the parser to build unary operators
3771 in the input. CODE, a tree_code, specifies the unary operator, and
3772 ARG is the operand. For unary plus, the C parser currently uses
3773 CONVERT_EXPR for code.
3775 LOC is the location to use for the tree generated.
3776 */
3778 struct c_expr
3780 {
3787 {
3789 }
3790 else
3791 {
3796 }
3798 /* We are typically called when parsing a prefix token at LOC acting on
3799 ARG. Reflect this by updating the source range of the result to
3800 start at LOC and end at the end of ARG. */
3805 }
3807 /* Returns true if TYPE is a character type, *not* including wchar_t. */
3809 bool
3811 {
3817 }
3819 /* This is the entry point used by the parser to build binary operators
3820 in the input. CODE, a tree_code, specifies the binary operator, and
3821 ARG1 and ARG2 are the operands. In addition to constructing the
3822 expression, we check for operands that were written with other binary
3823 operators in a way that is likely to confuse the user.
3825 LOCATION is the location of the binary operator. */
3827 struct c_expr
3830 {
3849 {
3854 }
3863 /* Check for cases such as x+y<<z which users are likely
3864 to misinterpret. */
3874 {
3878 {
3882 else
3884 }
3886 {
3890 else
3892 }
3895 }
3901 /* Avoid warning for !!x == y. */
3904 {
3905 /* Avoid warning for !b == y where b has _Bool type. */
3910 {
3912 do
3913 {
3920 else
3922 }
3924 }
3927 }
3929 /* Warn about comparisons against string literals, with the exception
3930 of testing for equality or inequality of a string literal with NULL. */
3932 {
3939 /* Warn for ptr == '\0', it's likely that it should've been ptr[0]. */
3943 {
3944 auto_diagnostic_group d;
3946 "comparison between pointer and zero character "
3950 }
3954 {
3955 auto_diagnostic_group d;
3957 "comparison between pointer and zero character "
3961 }
3962 }
3966 "comparison with string literal results in unspecified "
3980 /* Warn about comparisons of different enum types. */
3995 location,
3999 }
4000 \f
4001 /* Return a tree for the difference of pointers OP0 and OP1.
4002 The resulting tree has type ptrdiff_t. If POINTER_SUBTRACT sanitization is
4003 enabled, assign to INSTRUMENT_EXPR call to libsanitizer. */
4005 static tree
4007 {
4017 /* If the operands point into different address spaces, we need to
4018 explicitly convert them to pointers into the common address space
4019 before we can subtract the numerical address values. */
4021 {
4022 addr_space_t as_common;
4023 tree common_type;
4025 /* Determine the common superset address space. This is guaranteed
4026 to exist because the caller verified that comp_target_types
4027 returned non-zero. */
4034 }
4036 /* Determine integer type result of the subtraction. This will usually
4037 be the same as the result type (ptrdiff_t), but may need to be a wider
4038 type if pointers for the address space are wider than ptrdiff_t. */
4041 else
4053 {
4059 }
4061 /* First do the subtraction, then build the divide operator
4062 and only convert at the very end.
4063 Do not do default conversions in case restype is a short type. */
4065 /* POINTER_DIFF_EXPR requires a signed integer type of the same size as
4066 pointers. If some platform cannot provide that, or has a larger
4067 ptrdiff_type to support differences larger than half the address
4068 space, cast the pointers to some larger integer type and do the
4069 computations in that type. */
4073 else
4074 {
4075 /* Cast away qualifiers. */
4079 }
4081 /* This generates an error if op1 is pointer to incomplete type. */
4094 /* Divide by the size, in easiest possible way. */
4098 /* Convert to final result type if necessary. */
4100 }
4101 \f
4102 /* Expand atomic compound assignments into an appropriate sequence as
4103 specified by the C11 standard section 6.5.16.2.
4105 _Atomic T1 E1
4106 T2 E2
4107 E1 op= E2
4109 This sequence is used for all types for which these operations are
4110 supported.
4112 In addition, built-in versions of the 'fe' prefixed routines may
4113 need to be invoked for floating point (real, complex or vector) when
4114 floating-point exceptions are supported. See 6.5.16.2 footnote 113.
4116 T1 newval;
4117 T1 old;
4118 T1 *addr
4119 T2 val
4120 fenv_t fenv
4122 addr = &E1;
4123 val = (E2);
4124 __atomic_load (addr, &old, SEQ_CST);
4125 feholdexcept (&fenv);
4126 loop:
4127 newval = old op val;
4128 if (__atomic_compare_exchange_strong (addr, &old, &newval, SEQ_CST,
4129 SEQ_CST))
4130 goto done;
4131 feclearexcept (FE_ALL_EXCEPT);
4132 goto loop:
4133 done:
4134 feupdateenv (&fenv);
4136 The compiler will issue the __atomic_fetch_* built-in when possible,
4137 otherwise it will generate the generic form of the atomic operations.
4138 This requires temp(s) and has their address taken. The atomic processing
4139 is smart enough to figure out when the size of an object can utilize
4140 a lock-free version, and convert the built-in call to the appropriate
4141 lock-free routine. The optimizers will then dispose of any temps that
4142 are no longer required, and lock-free implementations are utilized as
4143 long as there is target support for the required size.
4145 If the operator is NOP_EXPR, then this is a simple assignment, and
4146 an __atomic_store is issued to perform the assignment rather than
4147 the above loop. */
4149 /* Build an atomic assignment at LOC, expanding into the proper
4150 sequence to store LHS MODIFYCODE= RHS. Return a value representing
4151 the result of the operation, unless RETURN_OLD_P, in which case
4152 return the old value of LHS (this is only for postincrement and
4153 postdecrement). */
4155 static tree
4158 {
4171 tree nonatomic_rhs_semantic_type;
4172 tree rhs_type;
4179 /* Allocate enough vector items for a compare_exchange. */
4182 /* Create a compound statement to hold the sequence of statements
4183 with a loop. */
4185 {
4188 /* For consistency with build_modify_expr on non-_Atomic,
4189 mark the lhs as read. Also, it would be very hard to match
4190 such expressions in mark_exp_read. */
4192 }
4194 /* Remove any excess precision (which is only present here in the
4195 case of compound assignments). */
4197 {
4200 }
4203 /* Fold the RHS if it hasn't already been folded. */
4207 /* Remove the qualifiers for the rest of the expressions and create
4208 the VAL temp variable to hold the RHS. */
4212 TYPE_UNQUALIFIED);
4217 NULL_TREE);
4223 /* NOP_EXPR indicates it's a straight store of the RHS. Simply issue
4224 an atomic_store. */
4226 {
4228 /* Build __atomic_store (&lhs, &val, SEQ_CST) */
4239 /* VAL is the value which was stored, return a COMPOUND_STMT of
4240 the statement and that value. */
4242 }
4244 /* Attempt to implement the atomic operation as an __atomic_fetch_* or
4245 __atomic_*_fetch built-in rather than a CAS loop. atomic_bool type
4246 isn't applicable for such builtins. ??? Do we want to handle enums? */
4249 {
4250 built_in_function fncode;
4252 {
4255 fncode = (return_old_p
4256 ? BUILT_IN_ATOMIC_FETCH_ADD_N
4260 fncode = (return_old_p
4261 ? BUILT_IN_ATOMIC_FETCH_SUB_N
4265 fncode = (return_old_p
4266 ? BUILT_IN_ATOMIC_FETCH_AND_N
4270 fncode = (return_old_p
4271 ? BUILT_IN_ATOMIC_FETCH_OR_N
4275 fncode = (return_old_p
4276 ? BUILT_IN_ATOMIC_FETCH_XOR_N
4281 }
4283 /* We can only use "_1" through "_16" variants of the atomic fetch
4284 built-ins. */
4289 /* If this is a pointer type, we need to multiply by the size of
4290 the pointer target type. */
4292 {
4294 /* ??? This would introduce -Wdiscarded-qualifiers
4295 warning: __atomic_fetch_* expect volatile void *
4296 type as the first argument. (Assignments between
4297 atomic and non-atomic objects are OK.) */
4304 }
4306 /* Build __atomic_fetch_* (&lhs, &val, SEQ_CST), or
4307 __atomic_*_fetch (&lhs, &val, SEQ_CST). */
4322 /* Finish the compound statement. */
4325 /* NEWVAL is the value which was stored, return a COMPOUND_STMT of
4326 the statement and that value. */
4328 }
4330 cas_loop:
4331 /* Create the variables and labels required for the op= form. */
4348 /* __atomic_load (addr, &old, SEQ_CST). */
4355 NULL_TREE);
4359 /* Create the expressions for floating-point environment
4360 manipulation, if required. */
4370 /* loop: */
4373 /* newval = old + val; */
4378 {
4382 }
4383 else
4389 {
4391 NULL_TREE);
4394 }
4396 /* if (__atomic_compare_exchange (addr, &old, &new, false, SEQ_CST, SEQ_CST))
4397 goto done; */
4417 /* goto loop; */
4422 /* done: */
4428 /* Finish the compound statement. */
4431 /* NEWVAL is the value that was successfully stored, return a
4432 COMPOUND_EXPR of the statement and the appropriate value. */
4435 }
4437 /* Construct and perhaps optimize a tree representation
4438 for a unary operation. CODE, a tree_code, specifies the operation
4439 and XARG is the operand.
4440 For any CODE other than ADDR_EXPR, NOCONVERT suppresses the default
4441 promotions (such as from short to int).
4442 For ADDR_EXPR, the default promotions are not applied; NOCONVERT allows
4443 non-lvalues; this is only used to handle conversion of non-lvalue arrays
4444 to pointers in C99.
4446 LOCATION is the location of the operator. */
4448 tree
4451 {
4452 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
4456 tree val;
4477 {
4480 }
4483 {
4486 }
4489 {
4491 /* This is used for unary plus, because a CONVERT_EXPR
4492 is enough to prevent anybody from looking inside for
4493 associativity, but won't generate any code. */
4497 {
4500 }
4510 {
4513 }
4519 /* ~ works on integer types and non float vectors. */
4523 {
4526 /* Warn if the expression has boolean value. */
4532 {
4533 auto_diagnostic_group d;
4536 {
4540 }
4541 }
4544 }
4546 {
4552 }
4553 else
4554 {
4557 }
4562 {
4565 }
4572 {
4575 }
4581 /* Conjugating a real value is a no-op, but allow it anyway. */
4584 {
4587 }
4596 {
4600 }
4602 {
4605 }
4606 else
4609 /* If the TRUTH_NOT_EXPR has been folded, reset the location. */
4629 {
4632 noconvert);
4640 }
4642 /* Complain about anything that is not a true lvalue. In
4643 Objective-C, skip this check for property_refs. */
4648 ? lv_increment
4653 {
4657 else
4660 }
4663 {
4667 else
4670 }
4672 /* Ensure the argument is fully folded inside any SAVE_EXPR. */
4678 /* Increment or decrement the real part of the value,
4679 and don't change the imaginary part. */
4681 {
4688 {
4700 }
4701 }
4703 /* Report invalid types. */
4709 {
4712 else
4716 }
4718 {
4719 tree inc;
4723 /* Compute the increment. */
4726 {
4727 /* If pointer target is an incomplete type,
4728 we just cannot know how to do the arithmetic. */
4730 {
4735 else
4739 }
4742 {
4746 else
4749 }
4750 else
4756 }
4758 {
4759 /* For signed fract types, we invert ++ to -- or
4760 -- to ++, and change inc from 1 to -1, because
4761 it is not possible to represent 1 in signed fract constants.
4762 For unsigned fract types, the result always overflows and
4763 we get an undefined (original) or the maximum value. */
4775 }
4776 else
4777 {
4782 }
4784 /* If 'arg' is an Objective-C PROPERTY_REF expression, then we
4785 need to ask Objective-C to build the increment or decrement
4786 expression for it. */
4791 /* Report a read-only lvalue. */
4793 {
4799 }
4806 /* If the argument is atomic, use the special code sequences for
4807 atomic compound assignment. */
4809 {
4814 ? PLUS_EXPR
4817 ? inc
4822 }
4826 else
4831 }
4834 /* Note that this operation never does default_conversion. */
4836 /* The operand of unary '&' must be an lvalue (which excludes
4837 expressions of type void), or, in C99, the result of a [] or
4838 unary '*' operator. */
4844 /* Let &* cancel out to simplify resulting code. */
4846 {
4847 /* Don't let this be an lvalue. */
4852 }
4854 /* Anything not already handled and not a true memory reference
4855 or a non-lvalue array is an error. */
4860 /* Move address operations inside C_MAYBE_CONST_EXPR to simplify
4861 folding later. */
4863 {
4866 noconvert);
4873 }
4875 /* Ordinary case; arg is a COMPONENT_REF or a decl. */
4878 /* If the lvalue is const or volatile, merge that into the type
4879 to which the address will point. This is only needed
4880 for function types. */
4884 {
4894 }
4897 {
4900 {
4904 }
4906 /* fall through */
4910 {
4914 {
4918 }
4923 "address of array with reverse scalar storage "
4925 }
4929 }
4939 /* ??? Cope with user tricks that amount to offsetof. Delete this
4940 when we have proper support for integer constant expressions. */
4944 {
4947 }
4960 }
4965 ret = (require_constant_value
4968 else
4970 return_build_unary_op:
4981 }
4983 /* Return nonzero if REF is an lvalue valid for this language.
4984 Lvalues can be assigned, unless their type has TYPE_READONLY.
4985 Lvalues can have their address taken, unless they have C_DECL_REGISTER. */
4987 bool
4989 {
4993 {
5008 /* MEM_REFs can appear from -fgimple parsing or folding, so allow them
5009 here as well. */
5024 }
5025 }
5026 \f
5027 /* Give a warning for storing in something that is read-only in GCC
5028 terms but not const in ISO C terms. */
5030 static void
5032 {
5034 {
5046 }
5048 }
5051 /* Return nonzero if REF is an lvalue valid for this language;
5052 otherwise, print an error message and return zero. USE says
5053 how the lvalue is being used and so selects the error message.
5054 LOCATION is the location at which any error should be reported. */
5056 static int
5058 {
5065 }
5066 \f
5067 /* Mark EXP saying that we need to be able to take the
5068 address of it; it should not be allocated in a register.
5069 Returns true if successful. ARRAY_REF_P is true if this
5070 is for ARRAY_REF construction - in that case we don't want
5071 to look through VIEW_CONVERT_EXPR from VECTOR_TYPE to ARRAY_TYPE,
5072 it is fine to use ARRAY_REFs for vector subscripts on vector
5073 register variables. */
5075 bool
5077 {
5082 {
5093 {
5097 }
5098 /* FALLTHRU */
5121 {
5123 {
5124 error
5127 }
5129 }
5131 {
5134 else
5137 }
5139 /* FALLTHRU */
5142 /* FALLTHRU */
5145 }
5146 }
5147 \f
5148 /* Convert EXPR to TYPE, warning about conversion problems with
5149 constants. SEMANTIC_TYPE is the type this conversion would use
5150 without excess precision. If SEMANTIC_TYPE is NULL, this function
5151 is equivalent to convert_and_check. This function is a wrapper that
5152 handles conversions that may be different than
5153 the usual ones because of excess precision. */
5155 static tree
5157 tree semantic_type)
5158 {
5162 /* For C11, integer conversions may have results with excess
5163 precision. */
5169 {
5170 /* For integers, we need to check the real conversion, not
5171 the conversion to the excess precision type. */
5173 }
5174 /* Result type is the excess precision type, which should be
5175 large enough, so do not check. */
5177 }
5179 /* If EXPR refers to a built-in declared without a prototype returns
5180 the actual type of the built-in and, if non-null, set *BLTIN to
5181 a pointer to the built-in. Otherwise return the type of EXPR
5182 and clear *BLTIN if non-null. */
5184 static tree
5186 {
5187 tree dummy;
5211 }
5213 /* Build and return a conditional expression IFEXP ? OP1 : OP2. If
5214 IFEXP_BCP then the condition is a call to __builtin_constant_p, and
5215 if folded to an integer constant then the unselected half may
5216 contain arbitrary operations not normally permitted in constant
5217 expressions. Set the location of the expression to LOC. */
5219 tree
5223 {
5224 tree type1;
5225 tree type2;
5233 tree ret;
5245 /* Promote both alternatives. */
5270 /* C90 does not permit non-lvalue arrays in conditional expressions.
5271 In C99 they will be pointers by now. */
5273 {
5276 }
5284 {
5287 {
5291 }
5293 {
5297 }
5298 }
5301 {
5312 }
5314 /* Quickly detect the usual case where op1 and op2 have the same type
5315 after promotion. */
5317 {
5320 else
5322 }
5327 {
5328 /* In C11, a conditional expression between a floating-point
5329 type and an integer type should convert the integer type to
5330 the evaluation format of the floating-point type, with
5331 possible excess precision. */
5335 {
5336 tree eptype;
5339 {
5343 }
5346 {
5350 }
5351 }
5356 "implicit conversion from %qT to %qT to "
5358 colon_loc);
5360 /* If -Wsign-compare, warn here if type1 and type2 have
5361 different signedness. We'll promote the signed to unsigned
5362 and later code won't know it used to be different.
5363 Do this check on the original types, so that explicit casts
5364 will be considered, but default promotions won't. */
5366 {
5371 {
5374 /* Do not warn if the result type is signed, since the
5375 signed type will only be chosen if it can represent
5376 all the values of the unsigned type. */
5379 else
5380 {
5384 /* Do not warn if the signed quantity is an
5385 unsuffixed integer literal (or some static
5386 constant expression involving such literals) and
5387 it is non-negative. This warning requires the
5388 operands to be folded for best results, so do
5389 that folding in this case even without
5390 warn_sign_compare to avoid warning options
5391 possibly affecting code generation. */
5392 c_inhibit_evaluation_warnings
5396 c_inhibit_evaluation_warnings
5399 c_inhibit_evaluation_warnings
5403 c_inhibit_evaluation_warnings
5407 {
5410 || (unsigned_op1
5415 "operand of %<?:%> changes signedness from "
5416 "%qT to %qT due to unsignedness of other "
5419 else
5421 "operand of %<?:%> changes signedness from "
5422 "%qT to %qT due to unsignedness of other "
5425 }
5430 }
5431 }
5432 }
5433 }
5435 {
5440 }
5442 {
5445 addr_space_t as_common;
5454 {
5458 }
5463 {
5468 {
5469 /* roles are swapped */
5472 }
5476 {
5479 "pointer to array loses qualifier "
5483 "pointer to array loses qualifier "
5485 }
5488 "ISO C forbids conditional expr between "
5490 /* for array, use qualifiers of element type */
5494 }
5495 /* Objective-C pointer comparisons are a bit more lenient. */
5498 else
5499 {
5503 "pointer type mismatch between %qT and %qT "
5506 else
5509 result_type = build_pointer_type
5511 }
5512 }
5514 {
5518 else
5519 {
5521 }
5523 }
5525 {
5529 else
5530 {
5532 }
5534 }
5535 /* 6.5.15: "if one is a null pointer constant (other than a pointer) or has
5536 type nullptr_t and the other is a pointer, the result type is the pointer
5537 type." */
5544 {
5547 else
5548 {
5551 }
5552 }
5554 /* Merge const and volatile flags of the incoming types. */
5555 result_type
5561 semantic_result_type);
5563 semantic_result_type);
5566 {
5569 }
5571 {
5574 }
5576 && op1_int_operands
5579 {
5586 }
5588 /* Need to convert condition operand into a vector mask. */
5590 {
5597 }
5601 else
5602 {
5604 {
5605 /* Use c_fully_fold here, since C_MAYBE_CONST_EXPR might be
5606 nested inside of the expression. */
5609 }
5613 }
5619 /* If the OP1 and OP2 are the same and don't have side-effects,
5620 warn here, because the COND_EXPR will be turned into OP1. */
5628 }
5629 \f
5630 /* EXPR is an expression, location LOC, whose result is discarded.
5631 Warn if it is a call to a nodiscard function (or a COMPOUND_EXPR
5632 whose right-hand operand is such a call, possibly recursively). */
5634 static void
5636 {
5640 {
5644 }
5650 tree attr;
5655 {
5660 auto_diagnostic_group d;
5664 "ignoring return value of %qD, declared with "
5666 else
5668 "ignoring return value of %qD, declared with "
5672 }
5673 else
5674 {
5682 auto_diagnostic_group d;
5686 "ignoring return value of type %qT, declared "
5689 else
5691 "ignoring return value of type %qT, declared "
5694 {
5696 {
5701 }
5702 }
5703 }
5704 }
5706 /* Return a compound expression that performs two expressions and
5707 returns the value of the second of them.
5709 LOC is the location of the COMPOUND_EXPR. */
5711 tree
5713 {
5716 tree ret;
5728 {
5731 }
5734 {
5735 /* The left-hand operand of a comma expression is like an expression
5736 statement: with -Wunused, we should warn if it doesn't have
5737 any side-effects, unless it was explicitly cast to (void). */
5739 {
5747 else
5750 }
5751 }
5754 {
5758 {
5762 }
5768 }
5770 /* With -Wunused, we should also warn if the left-hand operand does have
5771 side-effects, but computes a value which is not used. For example, in
5772 `foo() + bar(), baz()' the result of the `+' operator is not used,
5773 so we should issue a warning. */
5785 && expr1_int_operands
5794 }
5796 /* Issue -Wcast-qual warnings when appropriate. TYPE is the type to
5797 which we are casting. OTYPE is the type of the expression being
5798 cast. Both TYPE and OTYPE are pointer types. LOC is the location
5799 of the cast. -Wcast-qual appeared on the command line. Named
5800 address space qualifiers are not handled here, because they result
5801 in different warnings. */
5803 static void
5805 {
5812 /* Check that the qualifiers on IN_TYPE are a superset of the
5813 qualifiers of IN_OTYPE. The outermost level of POINTER_TYPE
5814 nodes is uninteresting and we stop as soon as we hit a
5815 non-POINTER_TYPE node on either type. */
5816 do
5817 {
5821 /* GNU C allows cv-qualified function types. 'const' means the
5822 function is very pure, 'volatile' means it can't return. We
5823 need to warn when such qualifiers are added, not when they're
5824 taken away. */
5829 else
5832 }
5841 /* There are qualifiers present in IN_OTYPE that are not present
5842 in IN_TYPE. */
5845 discarded);
5850 /* A cast from **T to const **T is unsafe, because it can cause a
5851 const value to be changed with no additional warning. We only
5852 issue this warning if T is the same on both sides, and we only
5853 issue the warning if there are the same number of pointers on
5854 both sides, as otherwise the cast is clearly unsafe anyhow. A
5855 cast is unsafe when a qualifier is added at one level and const
5856 is not present at all outer levels.
5858 To issue this warning, we check at each level whether the cast
5859 adds new qualifiers not already seen. We don't need to special
5860 case function types, as they won't have the same
5861 TYPE_MAIN_VARIANT. */
5871 do
5872 {
5877 {
5879 "to be safe all intermediate pointers in cast from "
5883 }
5886 }
5888 }
5890 /* Heuristic check if two parameter types can be considered ABI-equivalent. */
5892 static bool
5894 {
5902 /* The signedness of the parameter matters only when an integral
5903 type smaller than int is promoted to int, otherwise only the
5904 precision of the parameter matters.
5905 This check should make sure that the callee does not see
5906 undefined values in argument registers. */
5916 }
5918 /* Check if a type cast between two function types can be considered safe. */
5920 static bool
5922 {
5941 }
5943 /* Build an expression representing a cast to type TYPE of expression EXPR.
5944 LOC is the location of the cast-- typically the open paren of the cast. */
5946 tree
5948 {
5949 tree value;
5963 /* The ObjC front-end uses TYPE_MAIN_VARIANT to tie together types differing
5964 only in <protocol> qualifications. But when constructing cast expressions,
5965 the protocols do matter and must be kept around. */
5972 {
5975 }
5978 {
5981 }
5984 {
5988 }
5991 {
5996 /* Convert to remove any qualifiers from VALUE's type. */
5998 }
6000 {
6001 tree field;
6010 {
6011 tree t;
6023 }
6026 }
6027 else
6028 {
6032 {
6036 }
6040 /* Optionally warn about potentially worrisome casts. */
6046 /* Warn about conversions between pointers to disjoint
6047 address spaces. */
6051 {
6054 addr_space_t as_common;
6057 {
6068 else
6073 }
6074 }
6076 /* Warn about possible alignment problems. */
6082 /* Don't warn about opaque types, where the actual alignment
6083 restriction is unknown. */
6094 /* Unlike conversion of integers to pointers, where the
6095 warning is disabled for converting constants because
6096 of cases such as SIG_*, warn about converting constant
6097 pointers to integers. In some cases it may cause unwanted
6098 sign extension, and a warning is appropriate. */
6105 "cast from function call of type %qT "
6111 /* Don't warn about converting any constant. */
6120 /* If pedantic, warn for conversions between function and object
6121 pointer types, except for converting a null pointer constant
6122 to function pointer type. */
6147 "cast between incompatible function types"
6153 /* Ignore any integer overflow caused by the cast. */
6155 {
6157 {
6159 {
6160 /* Avoid clobbering a shared constant. */
6163 }
6164 }
6166 /* Reset VALUE's overflow flags, ensuring constant sharing. */
6168 }
6169 }
6171 /* Don't let a cast be an lvalue. */
6175 /* Don't allow the results of casting to floating-point or complex
6176 types be confused with actual constants, or casts involving
6177 integer and pointer types other than direct integer-to-integer
6178 and integer-to-pointer be confused with integer constant
6179 expressions and null pointer constants. */
6189 /* If the expression has integer operands and so can occur in an
6190 unevaluated part of an integer constant expression, ensure the
6191 return value reflects this. */
6200 }
6202 /* Interpret a cast of expression EXPR to type TYPE. LOC is the
6203 location of the open paren of the cast, or the position of the cast
6204 expr. */
6205 tree
6207 {
6208 tree type;
6211 tree ret;
6214 /* This avoids warnings about unprototyped casts on
6215 integers. E.g. "#define SIG_DFL (void(*)())0". */
6227 {
6234 }
6239 /* C++ does not permits types to be defined in a cast, but it
6240 allows references to incomplete types. */
6246 }
6247 \f
6248 /* Build an assignment expression of lvalue LHS from value RHS.
6249 If LHS_ORIGTYPE is not NULL, it is the original type of LHS, which
6250 may differ from TREE_TYPE (LHS) for an enum bitfield.
6251 MODIFYCODE is the code for a binary operator that we use
6252 to combine the old value of LHS with RHS to get the new value.
6253 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
6254 If RHS_ORIGTYPE is not NULL_TREE, it is the original type of RHS,
6255 which may differ from TREE_TYPE (RHS) for an enum value.
6257 LOCATION is the location of the MODIFYCODE operator.
6258 RHS_LOC is the location of the RHS. */
6260 tree
6264 {
6265 tree result;
6266 tree newrhs;
6273 /* Types that aren't fully specified cannot be used in assignments. */
6276 /* Avoid duplicate error messages from operands that had errors. */
6280 /* Ensure an error for assigning a non-lvalue array to an array in
6281 C90. */
6283 {
6286 }
6288 /* For ObjC properties, defer this check. */
6297 {
6300 rhs_origtype);
6309 }
6311 /* If a binary op has been requested, combine the old LHS value with the RHS
6312 producing the value we should actually store into the LHS. */
6315 {
6319 /* Construct the RHS for any non-atomic compound assignemnt. */
6321 {
6322 /* If in LHS op= RHS the RHS has side-effects, ensure they
6323 are preevaluated before the rest of the assignment expression's
6324 side-effects, because RHS could contain e.g. function calls
6325 that modify LHS. */
6327 {
6330 else
6335 newrhs);
6336 }
6340 /* The original type of the right hand side is no longer
6341 meaningful. */
6343 }
6344 }
6347 {
6348 /* Check if we are modifying an Objective-C property reference;
6349 if so, we need to generate setter calls. */
6352 else
6357 /* Else, do the check that we postponed for Objective-C. */
6360 }
6362 /* Give an error for storing in something that is 'const'. */
6367 {
6370 }
6374 /* If storing into a structure or union member,
6375 it has probably been given type `int'.
6376 Compute the type that would go with
6377 the actual amount of storage the member occupies. */
6386 /* If storing in a field that is in actuality a short or narrower than one,
6387 we must store in the field in its actual type. */
6390 {
6393 }
6395 /* Issue -Wc++-compat warnings about an assignment to an enum type
6396 when LHS does not have its original type. This happens for,
6397 e.g., an enum bitfield in a struct. */
6402 {
6404 ? rhs_origtype
6411 }
6413 /* Remove qualifiers. */
6417 /* Convert new value to destination type. Fold it first, then
6418 restore any excess precision information, for the sake of
6419 conversion warnings. */
6422 {
6425 {
6427 {
6430 }
6435 }
6436 else
6443 }
6445 /* Emit ObjC write barrier, if necessary. */
6447 {
6450 {
6453 }
6454 }
6456 /* Scan operands. */
6460 else
6461 {
6465 }
6467 /* If we got the LHS in a different type for storing in,
6468 convert the result back to the nominal type of LHS
6469 so that the value we return always has the same type
6470 as the LHS argument. */
6480 return_result:
6484 }
6485 \f
6486 /* Return whether STRUCT_TYPE has an anonymous field with type TYPE.
6487 This is used to implement -fplan9-extensions. */
6489 static bool
6491 {
6492 tree field;
6500 {
6503 TYPE_QUAL_ATOMIC)
6507 {
6511 }
6515 {
6519 }
6520 }
6522 }
6524 /* RHS is an expression whose type is pointer to struct. If there is
6525 an anonymous field in RHS with type TYPE, then return a pointer to
6526 that field in RHS. This is used with -fplan9-extensions. This
6527 returns NULL if no conversion could be found. */
6529 static tree
6531 {
6535 tree ret;
6544 TYPE_QUAL_ATOMIC)
6552 {
6558 TYPE_QUAL_ATOMIC)
6561 {
6565 }
6567 lhs_main_type))
6568 {
6573 }
6574 }
6581 NULL_TREE);
6585 {
6588 }
6591 }
6593 /* Issue an error message for a bad initializer component.
6594 GMSGID identifies the message.
6595 The component name is taken from the spelling stack. */
6599 {
6602 auto_diagnostic_group d;
6604 /* The gmsgid may be a format string with %< and %>. */
6613 }
6615 /* Issue a pedantic warning for a bad initializer component. OPT is
6616 the option OPT_* (from options.h) controlling this warning or 0 if
6617 it is unconditionally given. GMSGID identifies the message. The
6618 component name is taken from the spelling stack. */
6622 {
6623 /* Use the location where a macro was expanded rather than where
6624 it was defined to make sure macros defined in system headers
6625 but used incorrectly elsewhere are diagnosed. */
6627 auto_diagnostic_group d;
6635 }
6637 /* Issue a warning for a bad initializer component.
6639 OPT is the OPT_W* value corresponding to the warning option that
6640 controls this warning. GMSGID identifies the message. The
6641 component name is taken from the spelling stack. */
6643 static void
6645 {
6649 auto_diagnostic_group d;
6651 /* Use the location where a macro was expanded rather than where
6652 it was defined to make sure macros defined in system headers
6653 but used incorrectly elsewhere are diagnosed. */
6656 /* The gmsgid may be a format string with %< and %>. */
6661 }
6662 \f
6663 /* If TYPE is an array type and EXPR is a parenthesized string
6664 constant, warn if pedantic that EXPR is being used to initialize an
6665 object of type TYPE. */
6667 void
6669 {
6676 }
6678 /* Attempt to locate the parameter with the given index within FNDECL,
6679 returning DECL_SOURCE_LOCATION (FNDECL) if it can't be found. */
6681 static location_t
6683 {
6685 tree param;
6687 /* Locate param by index within DECL_ARGUMENTS (fndecl). */
6691 ;
6693 /* If something went wrong (e.g. if we have a builtin and thus no arguments),
6694 return DECL_SOURCE_LOCATION (FNDECL). */
6699 }
6701 /* Issue a note about a mismatching argument for parameter PARMNUM
6702 to FUNDECL, for types EXPECTED_TYPE and ACTUAL_TYPE.
6703 Attempt to issue the note at the pertinent parameter of the decl;
6704 failing that issue it at the location of FUNDECL; failing that
6705 issue it at PLOC. */
6707 static void
6710 {
6711 location_t loc;
6714 else
6720 }
6722 /* Issue a warning when an argument of ARGTYPE is passed to a built-in
6723 function FUNDECL declared without prototype to parameter PARMNUM of
6724 PARMTYPE when ARGTYPE does not promote to PARMTYPE. */
6726 static void
6729 {
6734 /* Avoid warning for enum arguments that promote to an integer type
6735 of the same size/mode. */
6747 /* This diagnoses even signed/unsigned mismatches. Those might be
6748 safe in many cases but GCC may emit suboptimal code for them so
6749 warning on those cases drives efficiency improvements. */
6753 "in a call to built-in function declared without "
6756 "in a call to built-in function declared without "
6761 fundecl);
6762 }
6764 /* Convert value RHS to type TYPE as preparation for an assignment to
6765 an lvalue of type TYPE. If ORIGTYPE is not NULL_TREE, it is the
6766 original type of RHS; this differs from TREE_TYPE (RHS) for enum
6767 types. NULL_POINTER_CONSTANT says whether RHS was a null pointer
6768 constant before any folding.
6769 The real work of conversion is done by `convert'.
6770 The purpose of this function is to generate error messages
6771 for assignments that are not allowed in C.
6772 ERRTYPE says whether it is argument passing, assignment,
6773 initialization or return.
6775 In the following example, '~' denotes where EXPR_LOC and '^' where
6776 LOCATION point to:
6778 f (var); [ic_argpass]
6779 ^ ~~~
6780 x = var; [ic_assign]
6781 ^ ~~~;
6782 int x = var; [ic_init]
6783 ^^^
6784 return x; [ic_return]
6785 ^
6787 FUNCTION is a tree for the function being called.
6788 PARMNUM is the number of the argument, for printing in error messages.
6789 WARNOPT may be set to a warning option to issue the corresponding warning
6790 rather than an error for invalid conversions. Used for calls to built-in
6791 functions declared without a prototype. */
6793 static tree
6798 {
6801 tree rhstype;
6806 /* Use the expansion point location to handle cases such as user's
6807 function returning a wrong-type macro defined in a system header. */
6811 {
6812 tree selector;
6813 /* Change pointer to function to the function itself for
6814 diagnostics. */
6819 /* Handle an ObjC selector specially for diagnostics. */
6823 {
6826 }
6827 }
6829 /* This macro is used to emit diagnostics to ensure that all format
6830 strings are complete sentences, visible to gettext and checked at
6831 compile time. */
6832 #define PEDWARN_FOR_ASSIGNMENT(LOCATION, PLOC, OPT, AR, AS, IN, RE) \
6833 do { \
6834 switch (errtype) \
6835 { \
6836 case ic_argpass: \
6837 { \
6838 auto_diagnostic_group d; \
6839 if (pedwarn (PLOC, OPT, AR, parmnum, rname)) \
6840 inform_for_arg (fundecl, (PLOC), parmnum, type, rhstype); \
6841 } \
6842 break; \
6843 case ic_assign: \
6844 pedwarn (LOCATION, OPT, AS); \
6845 break; \
6846 case ic_init: \
6847 case ic_init_const: \
6848 pedwarn_init (LOCATION, OPT, IN); \
6849 break; \
6850 case ic_return: \
6851 pedwarn (LOCATION, OPT, RE); \
6852 break; \
6853 default: \
6854 gcc_unreachable (); \
6855 } \
6856 } while (0)
6858 /* This macro is used to emit diagnostics to ensure that all format
6859 strings are complete sentences, visible to gettext and checked at
6860 compile time. It can be called with 'pedwarn' or 'warning_at'. */
6861 #define WARNING_FOR_QUALIFIERS(PEDWARN, LOCATION, PLOC, OPT, AR, AS, IN, RE, QUALS) \
6862 do { \
6863 switch (errtype) \
6864 { \
6865 case ic_argpass: \
6866 { \
6867 auto_diagnostic_group d; \
6868 if (PEDWARN) { \
6869 if (pedwarn (PLOC, OPT, AR, parmnum, rname, QUALS)) \
6870 inform_for_arg (fundecl, (PLOC), parmnum, type, rhstype); \
6871 } else { \
6872 if (warning_at (PLOC, OPT, AR, parmnum, rname, QUALS)) \
6873 inform_for_arg (fundecl, (PLOC), parmnum, type, rhstype); \
6874 } \
6875 } \
6876 break; \
6877 case ic_assign: \
6878 if (PEDWARN) \
6879 pedwarn (LOCATION, OPT, AS, QUALS); \
6880 else \
6881 warning_at (LOCATION, OPT, AS, QUALS); \
6882 break; \
6883 case ic_init: \
6884 case ic_init_const: \
6885 if (PEDWARN) \
6886 pedwarn (LOCATION, OPT, IN, QUALS); \
6887 else \
6888 warning_at (LOCATION, OPT, IN, QUALS); \
6889 break; \
6890 case ic_return: \
6891 if (PEDWARN) \
6892 pedwarn (LOCATION, OPT, RE, QUALS); \
6893 else \
6894 warning_at (LOCATION, OPT, RE, QUALS); \
6895 break; \
6896 default: \
6897 gcc_unreachable (); \
6898 } \
6899 } while (0)
6901 /* This macro is used to emit diagnostics to ensure that all format
6902 strings are complete sentences, visible to gettext and checked at
6903 compile time. It is the same as PEDWARN_FOR_ASSIGNMENT but with an
6904 extra parameter to enumerate qualifiers. */
6905 #define PEDWARN_FOR_QUALIFIERS(LOCATION, PLOC, OPT, AR, AS, IN, RE, QUALS) \
6906 WARNING_FOR_QUALIFIERS (true, LOCATION, PLOC, OPT, AR, AS, IN, RE, QUALS)
6919 {
6923 {
6940 }
6943 }
6946 {
6952 {
6978 }
6979 }
6982 {
6988 {
6993 }
6994 }
6997 {
7000 }
7003 {
7004 /* Except for passing an argument to an unprototyped function,
7005 this is a constraint violation. When passing an argument to
7006 an unprototyped function, it is compile-time undefined;
7007 making it a constraint in that case was rejected in
7008 DR#252. */
7012 else
7015 }
7023 /* A non-reference type can convert to a reference. This handles
7024 va_start, va_copy and possibly port built-ins. */
7026 {
7028 {
7032 else
7035 }
7052 }
7053 /* Some types can interconvert without explicit casts. */
7057 /* Arithmetic types all interconvert, and enum is treated like int. */
7066 {
7069 rhstype);
7082 }
7084 /* Aggregates in different TUs might need conversion. */
7091 /* Conversion to a transparent union or record from its member types.
7092 This applies only to function arguments. */
7096 {
7100 {
7111 {
7115 /* Any non-function converts to a [const][volatile] void *
7116 and vice versa; otherwise, targets must be the same.
7117 Meanwhile, the lhs target must have all the qualifiers of
7118 the rhs. */
7122 {
7125 /* If this type won't generate any warnings, use it. */
7133 /* Keep looking for a better type, but remember this one. */
7136 }
7137 }
7139 /* Can convert integer zero to any pointer type. */
7141 {
7144 }
7145 }
7148 {
7150 {
7151 /* We have only a marginally acceptable member type;
7152 it needs a warning. */
7156 /* Const and volatile mean something different for function
7157 types, so the usual warnings are not appropriate. */
7160 {
7161 /* Because const and volatile on functions are
7162 restrictions that say the function will not do
7163 certain things, it is okay to use a const or volatile
7164 function where an ordinary one is wanted, but not
7165 vice-versa. */
7169 OPT_Wdiscarded_qualifiers,
7171 "makes %q#v qualified function "
7174 "function pointer from "
7177 "function pointer from "
7182 }
7186 OPT_Wdiscarded_qualifiers,
7198 }
7206 }
7207 }
7209 /* Conversions among pointers */
7212 {
7213 /* If RHS refers to a built-in declared without a prototype
7214 BLTIN is the declaration of the built-in with a prototype
7215 and RHSTYPE is set to the actual type of the built-in. */
7216 tree bltin;
7225 addr_space_t asl;
7226 addr_space_t asr;
7231 TYPE_QUAL_ATOMIC)
7236 TYPE_QUAL_ATOMIC)
7238 /* Opaque pointers are treated like void pointers. */
7241 /* The Plan 9 compiler permits a pointer to a struct to be
7242 automatically converted into a pointer to an anonymous field
7243 within the struct. */
7248 {
7251 {
7257 }
7258 }
7260 /* C++ does not allow the implicit conversion void* -> T*. However,
7261 for the purpose of reducing the number of false positives, we
7262 tolerate the special case of
7264 int *p = NULL;
7266 where NULL is typically defined in C to be '(void *) 0'. */
7269 OPT_Wc___compat,
7270 "request for implicit conversion "
7273 /* See if the pointers point to incompatible address spaces. */
7278 {
7279 auto_diagnostic_group d;
7282 {
7284 {
7288 diagnosed
7290 else
7293 }
7295 {
7300 else
7303 }
7306 {
7311 else
7314 }
7316 {
7321 else
7324 }
7327 }
7329 {
7332 else
7335 }
7337 }
7339 /* Check if the right-hand side has a format attribute but the
7340 left-hand side doesn't. */
7343 {
7345 {
7348 "argument %d of %qE might be "
7354 "assignment left-hand side might be "
7360 "initialization left-hand side might be "
7365 "return type might be "
7370 }
7371 }
7373 /* See if the pointers point to incompatible scalar storage orders. */
7377 {
7378 tree t;
7381 {
7383 /* Do not warn for built-in functions, for example memcpy, since we
7384 control how they behave and they can be useful in this area. */
7388 "passing argument %d of %qE from incompatible "
7392 /* Do not warn if the RHS is a call to a function that returns a
7393 pointer that is not an alias. */
7398 "assignment to %qT from pointer type %qT with "
7403 /* Likewise. */
7408 "initialization of %qT from pointer type %qT with "
7413 "returning %qT from pointer type with incompatible "
7418 }
7419 }
7421 /* Any non-function converts to a [const][volatile] void *
7422 and vice versa; otherwise, targets must be the same.
7423 Meanwhile, the lhs target must have all the qualifiers of the rhs. */
7427 || is_opaque_pointer
7433 {
7434 /* Warn about loss of qualifers from pointers to arrays with
7435 qualifiers on the element type. */
7437 {
7445 OPT_Wdiscarded_array_qualifiers,
7455 }
7458 ||
7460 && !null_pointer_constant
7464 "%qE between function pointer "
7472 /* Const and volatile mean something different for function types,
7473 so the usual warnings are not appropriate. */
7476 {
7477 /* Assignments between atomic and non-atomic objects are OK. */
7483 /* Don't warn about loss of qualifier for conversions from
7484 qualified void* to pointers to arrays with corresponding
7485 qualifier on the element type (except for pedantic before C23). */
7488 OPT_Wdiscarded_qualifiers,
7502 /* If this is not a case of ignoring a mismatch in signedness,
7503 no warning. */
7506 ;
7507 /* If there is a mismatch, do warn. */
7510 {
7512 {
7513 auto_diagnostic_group d;
7517 "pointer targets in passing argument %d of "
7520 rhstype);
7521 }
7525 "pointer targets in assignment from %qT to %qT "
7531 "pointer targets in initialization of %qT "
7533 rhstype);
7537 "returning %qT from a function with return type "
7542 }
7543 }
7546 {
7547 /* Because const and volatile on functions are restrictions
7548 that say the function will not do certain things,
7549 it is okay to use a const or volatile function
7550 where an ordinary one is wanted, but not vice-versa. */
7554 OPT_Wdiscarded_qualifiers,
7556 "%q#v qualified function pointer "
7565 }
7566 }
7567 /* Avoid warning about the volatile ObjC EH puts on decls. */
7569 {
7571 {
7573 {
7574 auto_diagnostic_group d;
7578 "passing argument %d of %qE from incompatible "
7581 }
7586 "assignment to %qT from pointer to "
7589 else
7598 "initialization of %qT from pointer to "
7601 else
7603 "initialization of %qT from incompatible "
7610 "returning pointer to %qD of type %qT from "
7613 else
7615 "returning %qT from a function with incompatible "
7620 }
7621 }
7623 /* If RHS isn't an address, check pointer or array of packed
7624 struct or union. */
7628 }
7630 {
7631 /* ??? This should not be an error when inlining calls to
7632 unprototyped functions. */
7636 else
7639 }
7642 {
7643 /* An explicit constant 0 or type nullptr_t can convert to a pointer,
7644 or one that results from arithmetic, even including a cast to
7645 integer type. */
7648 {
7650 {
7651 auto_diagnostic_group d;
7655 "passing argument %d of %qE makes pointer from "
7658 }
7662 "assignment to %qT from %qT makes pointer from integer "
7668 "initialization of %qT from %qT makes pointer from "
7673 "function with return type %qT makes pointer from "
7678 }
7681 }
7683 {
7685 {
7687 {
7688 auto_diagnostic_group d;
7692 "passing argument %d of %qE makes integer from "
7695 }
7699 "assignment to %qT from %qT makes integer from pointer "
7705 "initialization of %qT from %qT makes integer from "
7710 "function with return type %qT makes integer from "
7715 }
7718 }
7720 /* The type nullptr_t may be converted to bool. The
7721 result is false. */
7723 {
7724 tree ret;
7730 }
7733 {
7735 {
7736 auto_diagnostic_group d;
7742 else
7745 }
7748 {
7753 else
7756 }
7759 {
7764 else
7767 }
7769 {
7774 else
7777 }
7780 }
7783 }
7784 \f
7785 /* If VALUE is a compound expr all of whose expressions are constant, then
7786 return its value. Otherwise, return error_mark_node.
7788 This is for handling COMPOUND_EXPRs as initializer elements
7789 which is allowed with a warning when -pedantic is specified. */
7791 static tree
7793 {
7795 {
7800 endtype);
7801 }
7804 else
7806 }
7807 \f
7808 /* Perform appropriate conversions on the initial value of a variable,
7809 store it in the declaration DECL,
7810 and print any error messages that are appropriate.
7811 If ORIGTYPE is not NULL_TREE, it is the original type of INIT.
7812 If the init is invalid, store an ERROR_MARK.
7814 INIT_LOC is the location of the initial value. */
7816 void
7818 {
7822 /* If variable's type was invalidly declared, just ignore it. */
7828 /* Digest the specified initializer into an expression. */
7835 /* Store the expression if valid; else report error. */
7845 /* ANSI wants warnings about out-of-range constant initializers. */
7850 /* Check if we need to set array size from compound literal size. */
7854 {
7861 {
7865 {
7866 /* For int foo[] = (int [3]){1}; we need to set array size
7867 now since later on array initializer will be just the
7868 brace enclosed list of the compound literal. */
7876 }
7877 }
7878 }
7879 }
7880 \f
7881 /* Methods for storing and printing names for error messages. */
7883 /* Implement a spelling stack that allows components of a name to be pushed
7884 and popped. Each element on the stack is this structure. */
7886 struct spelling
7887 {
7889 union
7890 {
7894 };
7896 #define SPELLING_STRING 1
7897 #define SPELLING_MEMBER 2
7898 #define SPELLING_BOUNDS 3
7904 /* Macros to save and restore the spelling stack around push_... functions.
7905 Alternative to SAVE_SPELLING_STACK. */
7907 #define SPELLING_DEPTH() (spelling - spelling_base)
7908 #define RESTORE_SPELLING_DEPTH(DEPTH) (spelling = spelling_base + (DEPTH))
7910 /* Push an element on the spelling stack with type KIND and assign VALUE
7911 to MEMBER. */
7913 #define PUSH_SPELLING(KIND, VALUE, MEMBER) \
7914 { \
7915 int depth = SPELLING_DEPTH (); \
7916 \
7917 if (depth >= spelling_size) \
7918 { \
7919 spelling_size += 10; \
7920 spelling_base = XRESIZEVEC (struct spelling, spelling_base, \
7921 spelling_size); \
7922 RESTORE_SPELLING_DEPTH (depth); \
7923 } \
7924 \
7925 spelling->kind = (KIND); \
7926 spelling->MEMBER = (VALUE); \
7927 spelling++; \
7928 }
7930 /* Push STRING on the stack. Printed literally. */
7932 static void
7934 {
7936 }
7938 /* Push a member name on the stack. Printed as '.' STRING. */
7940 static void
7942 {
7948 }
7950 /* Push an array bounds on the stack. Printed as [BOUNDS]. */
7952 static void
7954 {
7956 }
7958 /* Compute the maximum size in bytes of the printed spelling. */
7960 static int
7962 {
7967 {
7970 else
7972 }
7975 }
7977 /* Print the spelling to BUFFER and return it. */
7981 {
7987 {
7990 }
7991 else
7992 {
7997 ;
7998 }
8001 }
8003 /* Digest the parser output INIT as an initializer for type TYPE.
8004 Return a C expression of type TYPE to represent the initial value.
8006 If ORIGTYPE is not NULL_TREE, it is the original type of INIT.
8008 NULL_POINTER_CONSTANT is true if INIT is a null pointer constant.
8010 If INIT is a string constant, STRICT_STRING is true if it is
8011 unparenthesized or we should not warn here for it being parenthesized.
8012 For other types of INIT, STRICT_STRING is not used.
8014 INIT_LOC is the location of the INIT.
8016 REQUIRE_CONSTANT requests an error if non-constant initializers or
8017 elements are seen. */
8019 static tree
8023 {
8030 || !init
8037 {
8039 {
8042 }
8044 }
8046 /* Initialization of an array of chars from a string constant
8047 optionally enclosed in braces. */
8051 {
8052 tree typ1
8055 TYPE_QUAL_ATOMIC)
8057 /* Note that an array could be both an array of character type
8058 and an array of wchar_t if wchar_t is signed char or unsigned
8059 char. */
8068 {
8086 {
8089 }
8094 {
8099 }
8104 {
8108 /* Subtract the size of a single (possibly wide) character
8109 because it's ok to ignore the terminating null char
8110 that is counted in the length of the constant. */
8121 {
8122 unsigned HOST_WIDE_INT size
8127 }
8128 }
8132 }
8134 {
8138 }
8139 }
8141 /* Build a VECTOR_CST from a *constant* vector constructor. If the
8142 vector constructor is not constant (e.g. {1,2,3,foo()}) then punt
8143 below and handle as a constructor. */
8148 {
8155 {
8157 tree value;
8160 /* Iterate through elements and check if all constructor
8161 elements are *_CSTs. */
8164 {
8167 }
8172 }
8173 }
8178 /* Any type can be initialized
8179 from an expression of the same type, optionally with braces. */
8192 {
8194 {
8196 {
8199 inside_init = array_to_pointer_conversion
8201 else
8202 {
8205 }
8206 }
8207 }
8210 /* Although the types are compatible, we may require a
8211 conversion. */
8216 {
8217 /* As an extension, allow initializing objects with static storage
8218 duration with compound literals (which are then treated just as
8219 the brace enclosed list they contain). Also allow this for
8220 vectors, as we can only assign them with compound literals. */
8226 }
8230 {
8234 }
8236 /* Compound expressions can only occur here if -Wpedantic or
8237 -pedantic-errors is specified. In the later case, we always want
8238 an error. In the former case, we simply want a warning. */
8241 {
8242 inside_init
8247 else
8252 }
8256 {
8259 }
8264 /* Added to enable additional -Wsuggest-attribute=format warnings. */
8268 (require_constant
8269 ? ic_init_const
8273 }
8275 /* Handle scalar types, including conversions. */
8280 {
8287 inside_init);
8288 inside_init
8295 /* Check to see if we have already given an error message. */
8297 ;
8299 {
8302 }
8306 {
8310 }
8316 }
8318 /* Come here only for records and arrays. */
8321 {
8323 "variable-sized object may not be initialized except "
8326 }
8330 }
8331 \f
8332 /* Handle initializers that use braces. */
8334 /* Type of object we are accumulating a constructor for.
8335 This type is always a RECORD_TYPE, UNION_TYPE or ARRAY_TYPE. */
8338 /* For a RECORD_TYPE or UNION_TYPE, this is the chain of fields
8339 left to fill. */
8342 /* For an ARRAY_TYPE, this is the specified index
8343 at which to store the next element we get. */
8346 /* For an ARRAY_TYPE, this is the maximum index. */
8349 /* For a RECORD_TYPE, this is the first field not yet written out. */
8352 /* For an ARRAY_TYPE, this is the index of the first element
8353 not yet written out. */
8356 /* In a RECORD_TYPE, the byte index of the next consecutive field.
8357 This is so we can generate gaps between fields, when appropriate. */
8360 /* If we are saving up the elements rather than allocating them,
8361 this is the list of elements so far (in reverse order,
8362 most recent first). */
8365 /* 1 if constructor should be incrementally stored into a constructor chain,
8366 0 if all the elements should be kept in AVL tree. */
8369 /* 1 if so far this constructor's elements are all compile-time constants. */
8372 /* 1 if so far this constructor's elements are all valid address constants. */
8375 /* 1 if this constructor has an element that cannot be part of a
8376 constant expression. */
8379 /* 1 if this constructor is erroneous so far. */
8382 /* 1 if this constructor is the universal zero initializer { 0 }. */
8385 /* Structure for managing pending initializer elements, organized as an
8386 AVL tree. */
8388 struct init_node
8389 {
8393 tree purpose;
8394 tree value;
8395 tree origtype;
8396 };
8398 /* Tree of pending elements at this constructor level.
8399 These are elements encountered out of order
8400 which belong at places we haven't reached yet in actually
8401 writing the output.
8402 Will never hold tree nodes across GC runs. */
8405 /* The SPELLING_DEPTH of this constructor. */
8408 /* DECL node for which an initializer is being read.
8409 0 means we are reading a constructor expression
8410 such as (struct foo) {...}. */
8413 /* Nonzero if this is an initializer for a top-level decl. */
8416 /* Nonzero if there were any member designators in this initializer. */
8419 /* Nesting depth of designator list. */
8422 /* Nonzero if there were diagnosed errors in this designator list. */
8425 \f
8426 /* This stack has a level for each implicit or explicit level of
8427 structuring in the initializer, including the outermost one. It
8428 saves the values of most of the variables above. */
8432 struct constructor_stack
8433 {
8435 tree type;
8436 tree fields;
8437 tree index;
8438 tree max_index;
8439 tree unfilled_index;
8440 tree unfilled_fields;
8441 tree bit_index;
8446 /* If value nonzero, this value should replace the entire
8447 constructor at this level. */
8459 };
8463 /* This stack represents designators from some range designator up to
8464 the last designator in the list. */
8466 struct constructor_range_stack
8467 {
8470 tree range_start;
8471 tree index;
8472 tree range_end;
8473 tree fields;
8474 };
8478 /* This stack records separate initializers that are nested.
8479 Nested initializers can't happen in ANSI C, but GNU C allows them
8480 in cases like { ... (struct foo) { ... } ... }. */
8482 struct initializer_stack
8483 {
8485 tree decl;
8497 };
8500 \f
8501 /* Prepare to parse and output the initializer for variable DECL. */
8503 void
8506 {
8530 {
8532 require_constant_elements
8534 /* For a scalar, you can always use any value to initialize,
8535 even within braces. */
8538 }
8539 else
8540 {
8544 }
8557 }
8559 void
8561 {
8564 /* Free the whole constructor stack of this initializer. */
8566 {
8570 }
8574 /* Pop back to the data of the outer initializer (if any). */
8590 }
8591 \f
8592 /* Call here when we see the initializer is surrounded by braces.
8593 This is instead of a call to push_init_level;
8594 it is matched by a call to pop_init_level.
8596 TYPE is the type to initialize, for a constructor expression.
8597 For an initializer for a decl, TYPE is zero. */
8599 void
8601 {
8651 {
8653 /* Skip any nameless bit fields at the beginning. */
8660 }
8662 {
8664 {
8665 constructor_max_index
8668 /* Detect non-empty initializations of zero-length arrays. */
8673 /* constructor_max_index needs to be an INTEGER_CST. Attempts
8674 to initialize VLAs with a nonempty initializer will cause a
8675 proper error; avoid tree checking errors as well by setting a
8676 safe value. */
8681 constructor_index
8684 }
8685 else
8686 {
8689 }
8692 }
8694 {
8695 /* Vectors are like simple fixed-size arrays. */
8696 constructor_max_index =
8700 }
8701 else
8702 {
8703 /* Handle the case of int x = {5}; */
8706 }
8707 }
8708 \f
8711 /* Called when we see an open brace for a nested initializer. Finish
8712 off any pending levels with implicit braces. */
8713 void
8715 {
8717 {
8722 last_init_list_comma),
8725 && constructor_max_index
8727 constructor_index))
8730 last_init_list_comma),
8732 else
8734 }
8735 }
8737 /* Push down into a subobject, for initialization.
8738 If this is for an explicit set of braces, IMPLICIT is 0.
8739 If it is because the next element belongs at a lower level,
8740 IMPLICIT is 1 (or 2 if the push is because of designator list). */
8742 void
8745 {
8749 /* Unless this is an explicit brace, we need to preserve previous
8750 content if any. */
8752 {
8757 }
8792 /* If the upper initializer is designated, then mark this as
8793 designated too to prevent bogus warnings. */
8797 {
8802 }
8804 /* Don't die if an entire brace-pair level is superfluous
8805 in the containing level. */
8807 ;
8809 {
8810 /* Don't die if there are extra init elts at the end. */
8813 else
8814 {
8817 constructor_depth++;
8818 }
8819 }
8821 {
8824 constructor_depth++;
8825 }
8828 {
8833 }
8836 {
8845 }
8848 {
8853 }
8856 {
8858 /* Skip any nameless bit fields at the beginning. */
8865 }
8867 {
8868 /* Vectors are like simple fixed-size arrays. */
8869 constructor_max_index =
8873 }
8875 {
8877 {
8878 constructor_max_index
8881 /* Detect non-empty initializations of zero-length arrays. */
8886 /* constructor_max_index needs to be an INTEGER_CST. Attempts
8887 to initialize VLAs will cause a proper error; avoid tree
8888 checking errors as well by setting a safe value. */
8893 constructor_index
8896 }
8897 else
8902 {
8903 /* We need to split the char/wchar array into individual
8904 characters, so that we don't have to special case it
8905 everywhere. */
8907 }
8908 }
8909 else
8910 {
8915 }
8916 }
8918 /* At the end of an implicit or explicit brace level,
8919 finish up that level of constructor. If a single expression
8920 with redundant braces initialized that level, return the
8921 c_expr structure for that expression. Otherwise, the original_code
8922 element is set to ERROR_MARK.
8923 If we were outputting the elements as they are read, return 0 as the value
8924 from inner levels (process_init_element ignores that),
8925 but return error_mark_node as the value from the outermost level
8926 (that's what we want to put in DECL_INITIAL).
8927 Otherwise, return a CONSTRUCTOR expression as the value. */
8929 struct c_expr
8932 location_t insert_before)
8933 {
8941 {
8942 /* When we come to an explicit close brace,
8943 pop any inner levels that didn't have explicit braces. */
8947 insert_before),
8950 }
8951 else
8956 /* Now output all pending elements. */
8962 /* Error for initializing a flexible array member, or a zero-length
8963 array member in an inappropriate context. */
8968 {
8969 /* Silently discard empty initializations. The parser will
8970 already have pedwarned for empty brackets. */
8973 else
8974 {
8979 else
8983 /* We have already issued an error message for the existence
8984 of a flexible array member not at the end of the structure.
8985 Discard the initializer so that we do not die later. */
8988 }
8989 }
8992 {
8994 /* Initialization with { } counts as zeroinit. */
8998 /* This might be zeroinit as well. */
9003 /* If the constructor has more than one element, it can't be { 0 }. */
9006 }
9008 /* Warn when some structs are initialized with direct aggregation. */
9011 {
9014 OPT_Wmissing_braces,
9016 }
9018 /* Warn when some struct elements are implicitly initialized to zero. */
9020 && constructor_type
9023 {
9024 /* Do not warn for flexible array members or zero-length arrays. */
9031 /* Do not warn if this level of the initializer uses member
9032 designators; it is likely to be deliberate. */
9033 && !constructor_designated
9034 /* Do not warn about initializing with { 0 } or with { }. */
9036 {
9039 constructor_unfilled_fields,
9040 constructor_type))
9043 }
9044 }
9046 /* Pad out the end of the structure. */
9048 /* If this closes a superfluous brace pair,
9049 just pass out the element between them. */
9052 ;
9056 {
9057 /* A nonincremental scalar initializer--just return
9058 the element, after verifying there is just one.
9059 Empty scalar initializers are supported in C2X. */
9061 {
9064 else
9066 }
9068 {
9071 }
9072 else
9074 }
9075 else
9076 {
9079 else
9080 {
9082 constructor_elements);
9089 }
9090 }
9093 {
9098 }
9127 }
9129 /* Common handling for both array range and field name designators.
9130 ARRAY argument is nonzero for array ranges. Returns false for success. */
9132 static bool
9135 {
9136 tree subtype;
9139 /* Don't die if an entire brace-pair level is superfluous
9140 in the containing level, or for an erroneous type. */
9144 /* If there were errors in this designator list already, bail out
9145 silently. */
9149 /* Likewise for an initializer for a variable-size type. Those are
9150 diagnosed in the parser, except for empty initializer braces. */
9156 {
9159 /* Designator list starts at the level of closest explicit
9160 braces. */
9164 last_init_list_comma),
9168 }
9171 {
9183 }
9187 {
9190 }
9192 {
9195 }
9201 }
9203 /* If there are range designators in designator list, push a new designator
9204 to constructor_range_stack. RANGE_END is end of such stack range or
9205 NULL_TREE if there is no range designator at this level. */
9207 static void
9209 {
9225 }
9227 /* Within an array initializer, specify the next index to be initialized.
9228 FIRST is that index. If LAST is nonzero, then initialize a range
9229 of indices, running from FIRST through LAST. */
9231 void
9234 {
9242 {
9245 }
9248 {
9252 "array index in initializer is not "
9254 }
9257 {
9261 "array index in initializer is not "
9263 }
9276 else
9277 {
9283 {
9286 }
9289 {
9293 {
9296 }
9297 else
9298 {
9302 {
9306 }
9307 }
9308 }
9310 designator_depth++;
9314 }
9315 }
9317 /* Within a struct initializer, specify the next field to be initialized. */
9319 void
9322 {
9323 tree field;
9331 {
9334 }
9339 {
9342 {
9348 }
9349 else
9352 }
9353 else
9354 do
9355 {
9357 designator_depth++;
9363 {
9366 }
9367 }
9369 }
9370 \f
9371 /* Add a new initializer to the tree of pending initializers. PURPOSE
9372 identifies the initializer, either array index or field in a structure.
9373 VALUE is the value of that index or field. If ORIGTYPE is not
9374 NULL_TREE, it is the original type of VALUE.
9376 IMPLICIT is true if value comes from pop_init_level (1),
9377 the new initializer has been merged with the existing one
9378 and thus no warnings should be emitted about overriding an
9379 existing initializer. */
9381 static void
9384 {
9391 {
9393 {
9399 else
9400 {
9402 {
9405 "initialized field with side-effects "
9410 }
9414 }
9415 }
9416 }
9417 else
9418 {
9419 tree bitpos;
9423 {
9429 else
9430 {
9432 {
9435 "initialized field with side-effects "
9440 }
9444 }
9445 }
9446 }
9461 {
9465 {
9469 {
9471 {
9472 /* L rotation. */
9485 {
9488 else
9490 }
9491 else
9493 }
9494 else
9495 {
9496 /* LR rotation. */
9518 {
9521 else
9523 }
9524 else
9526 }
9528 }
9529 else
9530 {
9531 /* p->balance == +1; growth of left side balances the node. */
9534 }
9535 }
9537 {
9539 /* Growth propagation from right side. */
9542 {
9544 {
9545 /* R rotation. */
9558 {
9561 else
9563 }
9564 else
9566 }
9568 {
9569 /* RL rotation */
9591 {
9594 else
9596 }
9597 else
9599 }
9601 }
9602 else
9603 {
9604 /* p->balance == -1; growth of right side balances the node. */
9607 }
9608 }
9612 }
9613 }
9615 /* Build AVL tree from a sorted chain. */
9617 static void
9619 {
9629 braced_init_obstack);
9632 {
9634 /* Skip any nameless bit fields at the beginning. */
9639 }
9641 {
9643 constructor_unfilled_index
9646 else
9648 }
9650 }
9652 /* Build AVL tree from a string constant. */
9654 static void
9657 {
9674 p < end
9675 && !(constructor_max_index
9678 {
9680 {
9683 }
9684 else
9685 {
9689 {
9692 else
9697 }
9698 }
9701 {
9704 {
9706 {
9709 }
9710 }
9712 {
9715 }
9719 }
9725 braced_init_obstack);
9726 }
9729 }
9731 /* Return value of FIELD in pending initializer or NULL_TREE if the field was
9732 not initialized yet. */
9734 static tree
9736 {
9740 {
9747 {
9752 else
9754 }
9755 }
9757 {
9761 && (!constructor_unfilled_fields
9768 {
9773 else
9775 }
9776 }
9778 {
9782 }
9784 }
9786 /* "Output" the next constructor element.
9787 At top level, really output it to assembler code now.
9788 Otherwise, collect it in a list from which we will make a CONSTRUCTOR.
9789 If ORIGTYPE is not NULL_TREE, it is the original type of VALUE.
9790 TYPE is the data type that the containing data type wants here.
9791 FIELD is the field (a FIELD_DECL) or the index that this element fills.
9792 If VALUE is a string constant, STRICT_STRING is true if it is
9793 unparenthesized or we should not warn here for it being parenthesized.
9794 For other types of VALUE, STRICT_STRING is not used.
9796 PENDING if true means output pending elements that belong
9797 right after this element. (PENDING is normally true;
9798 it is false while outputting pending elements, to avoid recursion.)
9800 IMPLICIT is true if value comes from pop_init_level (1),
9801 the new initializer has been merged with the existing one
9802 and thus no warnings should be emitted about overriding an
9803 existing initializer. */
9805 static void
9809 {
9815 {
9818 }
9831 {
9832 /* As an extension, allow initializing objects with static storage
9833 duration with compound literals (which are then treated just as
9834 the brace enclosed list they contain). */
9840 }
9844 {
9847 }
9857 && TYPE_REVERSE_STORAGE_ORDER
9866 /* Digest the initializer and issue any errors about incompatible
9867 types before issuing errors about non-constant initializers. */
9872 require_constant_value);
9874 {
9877 }
9881 /* Proceed to check the constness of the original initializer. */
9883 {
9885 {
9888 }
9892 }
9898 /* Issue -Wc++-compat warnings about initializing a bitfield with
9899 enum type. */
9907 {
9914 }
9916 /* If this field is empty and does not have side effects (and is not at
9917 the end of structure), don't do anything other than checking the
9918 initializer. */
9928 /* Finally, set VALUE to the initializer value digested above. */
9931 /* If this element doesn't come next in sequence,
9932 put it on constructor_pending_elts. */
9934 && (!constructor_incremental
9936 {
9942 braced_init_obstack);
9944 }
9946 && (!constructor_incremental
9948 {
9949 /* We do this for records but not for unions. In a union,
9950 no matter which field is specified, it can be initialized
9951 right away since it starts at the beginning of the union. */
9953 {
9956 else
9957 {
9965 }
9966 }
9969 braced_init_obstack);
9971 }
9974 {
9976 {
9983 }
9985 /* We can have just one union field set. */
9987 }
9989 /* Otherwise, output this element either to
9990 constructor_elements or to the assembler file. */
9995 /* Advance the variable that indicates sequential elements output. */
9997 constructor_unfilled_index
9999 bitsize_one_node);
10001 {
10002 constructor_unfilled_fields
10005 /* Skip any nameless bit fields. */
10008 constructor_unfilled_fields =
10010 }
10014 /* Now output any pending elements which have become next. */
10017 }
10019 /* For two FIELD_DECLs in the same chain, return -1 if field1
10020 comes before field2, 1 if field1 comes after field2 and
10021 0 if field1 == field2. */
10023 static int
10025 {
10032 {
10033 /* If one of the fields has non-zero bitsize, then that
10034 field must be the last one in a sequence of zero
10035 sized fields, fields after it will have bigger
10036 bit_position. */
10045 /* Otherwise, fallback to DECL_CHAIN walk to find out
10046 which field comes earlier. Walk chains of both
10047 fields, so that if field1 and field2 are close to each
10048 other in either order, it is found soon even for large
10049 sequences of zero sized fields. */
10052 {
10056 {
10059 }
10070 }
10071 }
10074 else
10076 }
10078 /* Output any pending elements which have become next.
10079 As we output elements, constructor_unfilled_{fields,index}
10080 advances, which may cause other elements to become next;
10081 if so, they too are output.
10083 If ALL is 0, we return when there are
10084 no more pending elements to output now.
10086 If ALL is 1, we output space as necessary so that
10087 we can output all the pending elements. */
10088 static void
10090 {
10092 tree next;
10094 retry:
10096 /* Look through the whole pending tree.
10097 If we find an element that should be output now,
10098 output it. Otherwise, set NEXT to the element
10099 that comes first among those still pending. */
10103 {
10105 {
10107 constructor_unfilled_index))
10111 braced_init_obstack);
10114 {
10115 /* Advance to the next smaller node. */
10118 else
10119 {
10120 /* We have reached the smallest node bigger than the
10121 current unfilled index. Fill the space first. */
10124 }
10125 }
10126 else
10127 {
10128 /* Advance to the next bigger node. */
10131 else
10132 {
10133 /* We have reached the biggest node in a subtree. Find
10134 the parent of it, which is the next bigger node. */
10140 {
10143 }
10144 }
10145 }
10146 }
10148 {
10149 /* If the current record is complete we are done. */
10159 braced_init_obstack);
10161 {
10162 /* Advance to the next smaller node. */
10165 else
10166 {
10167 /* We have reached the smallest node bigger than the
10168 current unfilled field. Fill the space first. */
10171 }
10172 }
10173 else
10174 {
10175 /* Advance to the next bigger node. */
10178 else
10179 {
10180 /* We have reached the biggest node in a subtree. Find
10181 the parent of it, which is the next bigger node. */
10188 {
10191 }
10192 }
10193 }
10194 }
10195 }
10197 /* Ordinarily return, but not if we want to output all
10198 and there are elements left. */
10202 /* If it's not incremental, just skip over the gap, so that after
10203 jumping to retry we will output the next successive element. */
10209 /* ELT now points to the node in the pending tree with the next
10210 initializer to output. */
10212 }
10213 \f
10214 /* Expression VALUE coincides with the start of type TYPE in a braced
10215 initializer. Return true if we should treat VALUE as initializing
10216 the first element of TYPE, false if we should treat it as initializing
10217 TYPE as a whole.
10219 If the initializer is clearly invalid, the question becomes:
10220 which choice gives the best error message? */
10222 static bool
10224 {
10234 /* GNU vectors can be initialized elementwise. However, treat any
10235 kind of vector value as initializing the vector type as a whole,
10236 regardless of whether the value is a GNU vector. Such initializers
10237 are valid if and only if they would have been valid in a non-braced
10238 initializer like:
10240 TYPE foo = VALUE;
10242 so recursing into the vector type would be at best confusing or at
10243 worst wrong. For example, when -flax-vector-conversions is in effect,
10244 it's possible to initialize a V8HI from a V4SI, even though the vectors
10245 have different element types and different numbers of elements. */
10253 }
10255 /* Add one non-braced element to the current constructor level.
10256 This adjusts the current position within the constructor's type.
10257 This may also start or terminate implicit levels
10258 to handle a partly-braced initializer.
10260 Once this has found the correct level for the new element,
10261 it calls output_init_element.
10263 IMPLICIT is true if value comes from pop_init_level (1),
10264 the new initializer has been merged with the existing one
10265 and thus no warnings should be emitted about overriding an
10266 existing initializer. */
10268 void
10271 {
10273 int string_flag
10284 /* Handle superfluous braces around string cst as in
10285 char x[] = {"foo"}; */
10287 && constructor_type
10288 && !was_designated
10292 {
10297 }
10300 {
10303 }
10305 /* Ignore elements of a brace group if it is entirely superfluous
10306 and has already been diagnosed, or if the type is erroneous. */
10310 /* Ignore elements of an initializer for a variable-size type.
10311 Those are diagnosed in the parser (empty initializer braces are OK). */
10321 OPT_Wdesignated_init,
10322 "positional initialization of field "
10325 /* If we've exhausted any levels that didn't have braces,
10326 pop them now. */
10328 {
10333 last_init_list_comma),
10337 && constructor_max_index
10339 constructor_index))
10342 last_init_list_comma),
10344 else
10346 }
10348 /* In the case of [LO ... HI] = VALUE, only evaluate VALUE once. */
10350 {
10351 /* If value is a compound literal and we'll be just using its
10352 content, don't put it into a SAVE_EXPR. */
10355 {
10358 {
10361 }
10366 }
10367 }
10370 {
10372 {
10373 tree fieldtype;
10377 {
10380 }
10387 /* Error for non-static initialization of a flexible array member. */
10389 && !require_constant_value
10392 {
10396 }
10398 /* Error for initialization of a flexible array member with
10399 a string constant if the structure is in an array. E.g.:
10400 struct S { int x; char y[]; };
10401 struct S s[] = { { 1, "foo" } };
10402 is invalid. */
10408 {
10413 {
10416 }
10418 {
10422 }
10423 }
10425 /* Accept a string constant to initialize a subarray. */
10431 /* Otherwise, if we have come to a subaggregate,
10432 and we don't have an element of its type, push into it. */
10435 {
10438 }
10441 {
10446 braced_init_obstack);
10448 }
10449 else
10450 /* Do the bookkeeping for an element that was
10451 directly output as a constructor. */
10452 {
10453 /* For a record, keep track of end position of last field. */
10455 constructor_bit_index
10460 /* If the current field was the first one not yet written out,
10461 it isn't now, so update. */
10463 {
10465 /* Skip any nameless bit fields. */
10467 && (DECL_UNNAMED_BIT_FIELD
10469 constructor_unfilled_fields =
10471 }
10472 }
10475 /* Skip any nameless bit fields at the beginning. */
10479 }
10481 {
10482 tree fieldtype;
10486 {
10490 }
10497 /* Warn that traditional C rejects initialization of unions.
10498 We skip the warning if the value is zero. This is done
10499 under the assumption that the zero initializer in user
10500 code appears conditioned on e.g. __STDC__ to avoid
10501 "missing initializer" warnings and relies on default
10502 initialization to zero in the traditional C case.
10503 We also skip the warning if the initializer is designated,
10504 again on the assumption that this must be conditional on
10505 __STDC__ anyway (and we've already complained about the
10506 member-designator already). */
10513 /* Accept a string constant to initialize a subarray. */
10519 /* Otherwise, if we have come to a subaggregate,
10520 and we don't have an element of its type, push into it. */
10523 {
10526 }
10529 {
10534 braced_init_obstack);
10536 }
10537 else
10538 /* Do the bookkeeping for an element that was
10539 directly output as a constructor. */
10540 {
10543 }
10546 }
10548 {
10552 /* Accept a string constant to initialize a subarray. */
10558 /* Otherwise, if we have come to a subaggregate,
10559 and we don't have an element of its type, push into it. */
10562 {
10565 }
10570 {
10574 }
10576 /* Now output the actual element. */
10578 {
10583 braced_init_obstack);
10585 }
10587 constructor_index
10592 /* If we are doing the bookkeeping for an element that was
10593 directly output as a constructor, we must update
10594 constructor_unfilled_index. */
10596 }
10598 {
10601 /* Do a basic check of initializer size. Note that vectors
10602 always have a fixed size derived from their type. */
10604 {
10608 }
10610 /* Now output the actual element. */
10612 {
10618 braced_init_obstack);
10619 }
10621 constructor_index
10626 /* If we are doing the bookkeeping for an element that was
10627 directly output as a constructor, we must update
10628 constructor_unfilled_index. */
10630 }
10632 /* Handle the sole element allowed in a braced initializer
10633 for a scalar variable. */
10636 {
10640 }
10641 else
10642 {
10647 braced_init_obstack);
10649 }
10651 /* Handle range initializers either at this level or anywhere higher
10652 in the designator stack. */
10654 {
10661 {
10665 braced_init_obstack,
10666 last_init_list_comma),
10668 }
10672 {
10676 braced_init_obstack,
10677 last_init_list_comma),
10679 }
10687 {
10691 {
10694 }
10703 }
10708 }
10711 }
10714 }
10715 \f
10716 /* Build a complete asm-statement, whose components are a CV_QUALIFIER
10717 (guaranteed to be 'volatile' or null) and ARGS (represented using
10718 an ASM_EXPR node). */
10719 tree
10721 {
10725 }
10727 /* Build an asm-expr, whose components are a STRING, some OUTPUTS,
10728 some INPUTS, and some CLOBBERS. The latter three may be NULL.
10729 SIMPLE indicates whether there was anything at all after the
10730 string in the asm expression -- asm("blah") and asm("blah" : )
10731 are subtly different. We use a ASM_EXPR node to represent this.
10732 LOC is the location of the asm, and IS_INLINE says whether this
10733 is asm inline. */
10734 tree
10737 {
10738 tree tail;
10739 tree args;
10752 /* Remove output conversions that change the type but not the mode. */
10754 {
10759 /* ??? Really, this should not be here. Users should be using a
10760 proper lvalue, dammit. But there's a long history of using casts
10761 in the output operands. In cases like longlong.h, this becomes a
10762 primitive form of typechecking -- if the cast can be removed, then
10763 the output operand had a type of the proper width; otherwise we'll
10764 get an error. Gross, but ... */
10782 {
10783 /* If the operand is going to end up in memory,
10784 mark it addressable. */
10790 {
10793 }
10794 }
10795 else
10799 }
10802 {
10803 tree input;
10810 {
10811 /* If the operand is going to end up in memory,
10812 mark it addressable. */
10814 {
10817 /* Strip the nops as we allow this case. FIXME, this really
10818 should be rejected or made deprecated. */
10822 }
10823 else
10824 {
10832 {
10835 }
10836 }
10837 }
10838 else
10842 }
10846 /* asm statements without outputs, including simple ones, are treated
10847 as volatile. */
10853 }
10854 \f
10855 /* Generate a goto statement to LABEL. LOC is the location of the
10856 GOTO. */
10858 tree
10860 {
10865 {
10870 }
10871 }
10873 /* Generate a computed goto statement to EXPR. LOC is the location of
10874 the GOTO. */
10876 tree
10878 {
10880 tree t;
10885 {
10889 }
10895 }
10897 /* Generate a C `return' statement. RETVAL is the expression for what
10898 to return, or a null pointer for `return;' with no value. LOC is
10899 the location of the return statement, or the location of the expression,
10900 if the statement has any. If ORIGTYPE is not NULL_TREE, it
10901 is the original type of RETVAL. */
10903 tree
10905 {
10910 /* Use the expansion point to handle cases such as returning NULL
10911 in a function returning void. */
10919 {
10923 {
10926 }
10932 }
10935 {
10939 {
10942 warned_here = pedwarn
10945 else
10946 warned_here = warning_at
10953 }
10954 }
10956 {
10960 warned_here = pedwarn
10963 else
10964 warned_here = pedwarn
10970 }
10971 else
10972 {
10977 tree inner;
10995 /* Strip any conversions, additions, and subtractions, and see if
10996 we are returning the address of a local variable. Warn if so. */
10998 {
11000 {
11001 CASE_CONVERT:
11009 /* If the second operand of the MINUS_EXPR has a pointer
11010 type (or is converted from it), this may be valid, so
11011 don't give a warning. */
11012 {
11025 }
11039 {
11043 else
11044 {
11049 }
11050 }
11055 }
11058 }
11065 }
11071 }
11072 \f
11074 /* The SWITCH_STMT being built. */
11075 tree switch_stmt;
11077 /* The original type of the testing expression, i.e. before the
11078 default conversion is applied. */
11079 tree orig_type;
11081 /* A splay-tree mapping the low element of a case range to the high
11082 element, or NULL_TREE if there is no high element. Used to
11083 determine whether or not a new case label duplicates an old case
11084 label. We need a tree, rather than simply a hash table, because
11085 of the GNU case range extension. */
11086 splay_tree cases;
11088 /* The bindings at the point of the switch. This is used for
11089 warnings crossing decls when branching to a case label. */
11092 /* Whether the switch includes any break statements. */
11095 /* The next node on the stack. */
11098 /* Remember whether the controlling expression had boolean type
11099 before integer promotions for the sake of -Wswitch-bool. */
11101 };
11103 /* A stack of the currently active switch statements. The innermost
11104 switch statement is on the top of the stack. There is no need to
11105 mark the stack for garbage collection because it is only active
11106 during the processing of the body of a function, and we never
11107 collect at that point. */
11111 /* Start a C switch statement, testing expression EXP. Return the new
11112 SWITCH_STMT. SWITCH_LOC is the location of the `switch'.
11113 SWITCH_COND_LOC is the location of the switch's condition.
11114 EXPLICIT_CAST_P is true if the expression EXP has an explicit cast. */
11116 tree
11118 location_t switch_cond_loc,
11120 {
11126 {
11130 {
11132 {
11135 }
11137 }
11138 else
11139 {
11143 /* Warn if the condition has boolean value. */
11149 /* Explicit cast to int suppresses this warning. */
11166 }
11167 }
11169 /* Add this new SWITCH_STMT to the stack. */
11182 }
11184 /* Process a case label at location LOC, with attributes ATTRS. */
11186 tree
11188 {
11192 {
11197 }
11200 {
11205 }
11208 {
11211 else
11214 }
11218 loc))
11227 }
11229 /* Finish the switch statement. TYPE is the original type of the
11230 controlling expression of the switch, or NULL_TREE. */
11232 void
11234 {
11236 location_t switch_location;
11240 /* Emit warnings as needed. */
11250 /* Pop the stack. */
11255 }
11256 \f
11257 /* Emit an if statement. IF_LOCUS is the location of the 'if'. COND,
11258 THEN_BLOCK and ELSE_BLOCK are expressions to be used; ELSE_BLOCK
11259 may be null. */
11261 void
11263 tree else_block)
11264 {
11265 tree stmt;
11270 }
11272 tree
11274 {
11275 /* In switch statements break is sometimes stylistically used after
11276 a return statement. This can lead to spurious warnings about
11277 control reaching the end of a non-void function when it is
11278 inlined. Note that we are calling block_may_fallthru with
11279 language specific tree nodes; this works because
11280 block_may_fallthru returns true when given something it does not
11281 understand. */
11286 {
11303 }
11304 else
11306 {
11319 }
11325 {
11326 /* The foreach expander produces low-level code using gotos instead
11327 of a structured loop construct. */
11330 }
11332 }
11334 /* A helper routine for c_process_expr_stmt and c_finish_stmt_expr. */
11336 static void
11338 {
11343 ;
11345 {
11349 }
11351 {
11355 {
11359 }
11367 }
11368 else
11370 }
11372 /* Process an expression as if it were a complete statement. Emit
11373 diagnostics, but do not call ADD_STMT. LOC is the location of the
11374 statement. */
11376 tree
11378 {
11379 tree exprv;
11394 /* If we're not processing a statement expression, warn about unused values.
11395 Warnings for statement expressions will be emitted later, once we figure
11396 out which is the result. */
11411 /* If the expression is not of a type to which we cannot assign a line
11412 number, wrap the thing in a no-op NOP_EXPR. */
11414 {
11417 }
11420 }
11422 /* Emit an expression as a statement. LOC is the location of the
11423 expression. */
11425 tree
11427 {
11430 else
11432 }
11434 /* Do the opposite and emit a statement as an expression. To begin,
11435 create a new binding level and return it. */
11437 tree
11439 {
11440 tree ret;
11442 /* We must force a BLOCK for this level so that, if it is not expanded
11443 later, there is a way to turn off the entire subtree of blocks that
11444 are contained in it. */
11449 ? NULL
11452 /* Mark the current statement list as belonging to a statement list. */
11456 }
11458 /* LOC is the location of the compound statement to which this body
11459 belongs. */
11461 tree
11463 {
11470 ? NULL
11473 /* Locate the last statement in BODY. See c_end_compound_stmt
11474 about always returning a BIND_EXPR. */
11478 continue_searching:
11480 {
11486 /* This can happen with degenerate cases like ({ }). No value. */
11490 /* If we're supposed to generate side effects warnings, process
11491 all of the statements except the last. */
11493 {
11496 {
11497 location_t tloc;
11502 }
11503 }
11506 }
11508 /* If the end of the list is exception related, then the list was split
11509 by a call to push_cleanup. Continue searching. */
11512 {
11516 }
11521 /* In the case that the BIND_EXPR is not necessary, return the
11522 expression out from inside it. */
11524 /* Skip nested debug stmts. */
11527 {
11528 /* Even if this looks constant, do not allow it in a constant
11529 expression. */
11531 /* Do not warn if the return value of a statement expression is
11532 unused. */
11535 }
11537 /* Extract the type of said expression. */
11540 /* If we're not returning a value at all, then the BIND_EXPR that
11541 we already have is a fine expression to return. */
11545 /* Now that we've located the expression containing the value, it seems
11546 silly to make voidify_wrapper_expr repeat the process. Create a
11547 temporary of the appropriate type and stick it in a TARGET_EXPR. */
11550 /* Unwrap a no-op NOP_EXPR as added by c_finish_expr_stmt. This avoids
11551 tree_expr_nonnegative_p giving up immediately. */
11560 {
11564 }
11565 }
11566 \f
11567 /* Begin and end compound statements. This is as simple as pushing
11568 and popping new statement lists from the tree. */
11570 tree
11572 {
11577 }
11579 /* End a compound statement. STMT is the statement. LOC is the
11580 location of the compound statement-- this is usually the location
11581 of the opening brace. */
11583 tree
11585 {
11589 {
11593 }
11598 /* If this compound statement is nested immediately inside a statement
11599 expression, then force a BIND_EXPR to be created. Otherwise we'll
11600 do the wrong thing for ({ { 1; } }) or ({ 1; { } }). In particular,
11601 STATEMENT_LISTs merge, and thus we can lose track of what statement
11602 was really last. */
11606 {
11610 }
11613 }
11615 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
11616 when the current scope is exited. EH_ONLY is true when this is not
11617 meant to apply to normal control flow transfer. */
11619 void
11621 {
11633 }
11634 \f
11635 /* Build a vector comparison of ARG0 and ARG1 using CODE opcode
11636 into a value of TYPE type. Comparison is done via VEC_COND_EXPR. */
11638 static tree
11641 {
11647 }
11649 /* Possibly warn about an address of OP never being NULL in a comparison
11650 operation CODE involving null. */
11652 static void
11654 {
11655 /* Prevent warnings issued for macro expansion. */
11662 {
11663 /* Allow casts to intptr_t to suppress the warning. */
11668 }
11671 {
11672 /* Allow a cast to void* to suppress the warning. */
11677 /* Adding any value to a null pointer, including zero, is undefined
11678 in C. This includes the expression &p[0] where p is the null
11679 pointer, although &p[0] will have been folded to p by this point
11680 and so not diagnosed. */
11683 "the comparison will always evaluate as %<false%> "
11685 op);
11686 else
11688 "the comparison will always evaluate as %<true%> "
11690 op);
11693 }
11702 {
11703 /* The address of either complex part may not be null. */
11706 "the comparison will always evaluate as %<false%> "
11708 op);
11709 else
11711 "the comparison will always evaluate as %<true%> "
11713 op);
11715 }
11717 /* Set to true in the loop below if OP dereferences is operand.
11718 In such a case the ultimate target need not be a decl for
11719 the null [in]equality test to be constant. */
11722 /* Get the outermost array or object, or member. */
11724 {
11726 {
11727 /* Get the member (its address is never null). */
11730 }
11732 /* Get the outer array/object to refer to in the warning. */
11735 }
11744 "the comparison will always evaluate as %<false%> "
11746 op);
11747 else
11749 "the comparison will always evaluate as %<true%> "
11751 op);
11755 }
11757 /* Build a binary-operation expression without default conversions.
11758 CODE is the kind of expression to build.
11759 LOCATION is the operator's location.
11760 This function differs from `build' in several ways:
11761 the data type of the result is computed and recorded in it,
11762 warnings are generated if arg data types are invalid,
11763 special handling for addition and subtraction of pointers is known,
11764 and some optimization is done (operations on narrow ints
11765 are done in the narrower type when that gives the same result).
11766 Constant folding is also done before the result is returned.
11768 Note that the operands will never have enumeral types, or function
11769 or array types, because either they will have the default conversions
11770 performed or they have both just been converted to some other type in which
11771 the arithmetic is to be done. */
11773 tree
11776 {
11778 tree eptype;
11786 /* Expression code to give to the expression when it is built.
11787 Normally this is CODE, which is what the caller asked for,
11788 but in some special cases we change it. */
11791 /* Data type in which the computation is to be performed.
11792 In the simplest cases this is the common type of the arguments. */
11795 /* When the computation is in excess precision, the type of the
11796 final EXCESS_PRECISION_EXPR. */
11799 /* Nonzero means operands have already been type-converted
11800 in whatever way is necessary.
11801 Zero means they need to be converted to RESULT_TYPE. */
11804 /* Nonzero means create the expression with this type, rather than
11805 RESULT_TYPE. */
11808 /* Nonzero means after finally constructing the expression
11809 convert it to this type. */
11812 /* Nonzero if this is an operation like MIN or MAX which can
11813 safely be computed in short if both args are promoted shorts.
11814 Also implies COMMON.
11815 -1 indicates a bitwise operation; this makes a difference
11816 in the exact conditions for when it is safe to do the operation
11817 in a narrower mode. */
11820 /* Nonzero if this is a comparison operation;
11821 if both args are promoted shorts, compare the original shorts.
11822 Also implies COMMON. */
11825 /* Nonzero if this is a right-shift operation, which can be computed on the
11826 original short and then promoted if the operand is a promoted short. */
11829 /* Nonzero means set RESULT_TYPE to the common type of the args. */
11832 /* True means types are compatible as far as ObjC is concerned. */
11835 /* True means this is an arithmetic operation that may need excess
11836 precision. */
11839 /* True means this is a boolean operation that converts both its
11840 operands to truth-values. */
11843 /* Remember whether we're doing / or %. */
11846 /* Remember whether we're doing << or >>. */
11849 /* Tree holding instrumentation expression. */
11866 {
11869 int_const = (int_const_or_overflow
11872 }
11873 else
11876 /* Do not apply default conversion in mixed vector/scalar expression. */
11879 {
11882 }
11888 /* The expression codes of the data types of the arguments tell us
11889 whether the arguments are integers, floating, pointers, etc. */
11893 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
11897 /* If an error was already reported for one of the arguments,
11898 avoid reporting another error. */
11913 {
11916 }
11919 {
11937 /* Excess precision for implicit conversions of integers to
11938 floating point in C11 and later. */
11939 may_need_excess_precision = (flag_isoc11
11947 }
11949 {
11952 }
11955 {
11958 }
11960 {
11963 }
11966 {
11969 }
11973 /* In case when one of the operands of the binary operation is
11974 a vector and another is a scalar -- convert scalar to vector. */
11977 {
11982 {
11986 {
11988 tree sc;
11999 }
12001 {
12003 tree sc;
12014 }
12017 }
12018 }
12021 {
12023 /* Handle the pointer + int case. */
12025 {
12028 }
12030 {
12033 }
12034 else
12039 /* Subtraction of two similar pointers.
12040 We must subtract them as integers, then divide by object size. */
12043 {
12046 }
12047 /* Handle pointer minus int. Just like pointer plus int. */
12049 {
12052 }
12053 else
12077 {
12088 else
12089 /* Although it would be tempting to shorten always here, that
12090 loses on some targets, since the modulo instruction is
12091 undefined if the quotient can't be represented in the
12092 computation mode. We shorten only if unsigned or if
12093 dividing by something we know != -1. */
12098 }
12106 /* Allow vector types which are not floating point types. */
12125 {
12126 /* Although it would be tempting to shorten always here, that loses
12127 on some targets, since the modulo instruction is undefined if the
12128 quotient can't be represented in the computation mode. We shorten
12129 only if unsigned or if dividing by something we know != -1. */
12134 }
12148 {
12149 /* Result of these operations is always an int,
12150 but that does not mean the operands should be
12151 converted to ints! */
12154 {
12157 }
12158 else
12161 {
12164 }
12165 else
12169 }
12171 {
12172 int_const_or_overflow = (int_operands
12176 int_const = (int_const_or_overflow
12180 }
12182 {
12183 int_const_or_overflow = (int_operands
12187 int_const = (int_const_or_overflow
12191 }
12194 /* Shift operations: result has same type as first operand;
12195 always convert second operand to int.
12196 Also set SHORT_SHIFT if shifting rightward. */
12205 {
12208 }
12213 {
12216 {
12218 {
12223 }
12225 {
12229 {
12234 }
12235 }
12236 else
12237 {
12242 {
12247 }
12248 }
12249 }
12251 /* Use the type of the value to be shifted. */
12253 /* Avoid converting op1 to result_type later. */
12255 }
12265 {
12268 }
12273 {
12278 {
12279 /* Don't reject a left shift of a negative value in a context
12280 where a constant expression is needed in C90. */
12286 }
12288 {
12290 {
12295 }
12297 {
12301 {
12306 }
12307 }
12309 {
12314 }
12319 }
12321 /* Use the type of the value to be shifted. */
12323 /* Avoid converting op1 to result_type later. */
12325 }
12331 {
12332 tree intt;
12334 {
12338 }
12342 {
12346 }
12348 /* It's not precisely specified how the usual arithmetic
12349 conversions apply to the vector types. Here, we use
12350 the unsigned type if one of the operands is signed and
12351 the other one is unsigned. */
12353 {
12356 else
12360 }
12362 /* Always construct signed integer vector type. */
12364 (SCALAR_TYPE_MODE
12367 {
12372 }
12378 }
12381 OPT_Wfloat_equal,
12383 /* Result of comparison is always int,
12384 but don't convert the args to int! */
12392 {
12395 }
12397 {
12400 }
12402 {
12409 /* Anything compares with void *. void * compares with anything.
12410 Otherwise, the targets must be compatible
12411 and both must be object or both incomplete. */
12415 {
12419 }
12421 {
12425 }
12427 {
12431 }
12432 else
12433 /* Avoid warning about the volatile ObjC EH puts on decls. */
12439 {
12441 result_type = build_pointer_type
12443 }
12444 }
12446 {
12449 }
12451 {
12454 }
12455 /* 6.5.9: One of the following shall hold:
12456 -- both operands have type nullptr_t; */
12458 {
12460 /* No need to convert the operands to result_type later. */
12462 }
12463 /* -- one operand has type nullptr_t and the other is a null pointer
12464 constant. We will have to convert the former to the type of the
12465 latter, because during gimplification we can't have mismatching
12466 comparison operand type. We convert from nullptr_t to the other
12467 type, since only nullptr_t can be converted to nullptr_t. Also,
12468 even a constant 0 is a null pointer constant, so we may have to
12469 create a pointer type from its type. */
12488 {
12489 tree intt;
12491 {
12495 }
12499 {
12503 }
12505 /* It's not precisely specified how the usual arithmetic
12506 conversions apply to the vector types. Here, we use
12507 the unsigned type if one of the operands is signed and
12508 the other one is unsigned. */
12510 {
12513 else
12517 }
12519 /* Always construct signed integer vector type. */
12521 (SCALAR_TYPE_MODE
12524 {
12529 }
12535 }
12543 {
12546 addr_space_t as_common;
12549 {
12563 }
12565 {
12569 }
12570 else
12571 {
12573 result_type = build_pointer_type
12577 }
12578 }
12580 {
12588 }
12590 {
12598 }
12600 {
12603 }
12605 {
12608 }
12613 {
12619 }
12630 /* Used for OpenMP atomics. */
12637 }
12646 {
12648 maybe_range_label_for_tree_type_mismatch
12655 }
12660 &&
12664 {
12670 {
12673 "implicit conversion from %qT to %qT "
12674 "to match other operand of binary "
12676 location);
12679 }
12688 {
12689 /* An operation on mixed real/complex operands must be
12690 handled specially, but the language-independent code can
12691 more easily optimize the plain complex arithmetic if
12692 -fno-signed-zeros. */
12696 {
12699 }
12701 {
12706 }
12707 else
12708 {
12713 }
12717 {
12724 {
12729 /* Fall through. */
12736 }
12737 }
12738 else
12739 {
12746 {
12750 /* Fall through. */
12760 }
12761 }
12764 }
12766 /* For certain operations (which identify themselves by shorten != 0)
12767 if both args were extended from the same smaller type,
12768 do the arithmetic in that type and then extend.
12770 shorten !=0 and !=1 indicates a bitwise operation.
12771 For them, this optimization is safe only if
12772 both args are zero-extended or both are sign-extended.
12773 Otherwise, we might change the result.
12774 Eg, (short)-1 | (unsigned short)-1 is (int)-1
12775 but calculated in (unsigned short) it would be (unsigned short)-1. */
12778 {
12782 }
12784 /* Shifts can be shortened if shifting right. */
12787 {
12798 /* We can shorten only if the shift count is less than the
12799 number of bits in the smaller type size. */
12801 /* We cannot drop an unsigned shift after sign-extension. */
12803 {
12804 /* Do an unsigned shift if the operand was zero-extended. */
12805 result_type
12808 /* Convert value-to-be-shifted to that type. */
12812 }
12813 }
12815 /* Comparison operations are shortened too but differently.
12816 They identify themselves by setting short_compare = 1. */
12819 {
12820 /* Don't write &op0, etc., because that would prevent op0
12821 from being kept in a register.
12822 Instead, make copies of the our local variables and
12823 pass the copies by reference, then copy them back afterward. */
12826 tree val
12831 {
12834 }
12841 {
12847 {
12850 }
12851 else
12852 {
12853 /* Fold for the sake of possible warnings, as in
12854 build_conditional_expr. This requires the
12855 "original" values to be folded, not just op0 and
12856 op1. */
12857 c_inhibit_evaluation_warnings++;
12862 c_inhibit_evaluation_warnings--;
12864 require_constant_value,
12865 NULL);
12867 require_constant_value,
12868 NULL);
12869 }
12876 {
12881 }
12882 }
12883 }
12884 }
12886 /* At this point, RESULT_TYPE must be nonzero to avoid an error message.
12887 If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
12888 Then the expression will be built.
12889 It will be given type FINAL_TYPE if that is nonzero;
12890 otherwise, it will be given type RESULT_TYPE. */
12893 {
12894 /* Favor showing any expression locations that are available. */
12899 }
12902 {
12906 {
12909 }
12910 }
12913 {
12915 semantic_result_type);
12917 semantic_result_type);
12919 /* This can happen if one operand has a vector type, and the other
12920 has a different type. */
12923 }
12926 | SANITIZE_DIVIDE
12927 | SANITIZE_FLOAT_DIVIDE
12932 {
12933 /* OP0 and/or OP1 might have side-effects. */
12939 | SANITIZE_FLOAT_DIVIDE
12944 }
12946 /* Treat expressions in initializers specially as they can't trap. */
12948 ret = (require_constant_value
12952 else
12957 return_build_binary_op:
12960 ret = (int_operands
12977 }
12980 /* Convert EXPR to be a truth-value, validating its type for this
12981 purpose. LOCATION is the source location for the expression. */
12983 tree
12985 {
12989 {
12991 error_at (location, "used array that cannot be converted to pointer where scalar is required");
13020 }
13025 {
13030 }
13031 else
13032 /* ??? Should we also give an error for vectors rather than leaving
13033 those to give errors later? */
13037 {
13040 else
13042 }
13046 }
13047 \f
13049 /* Convert EXPR to a contained DECL, updating *TC, *TI and *SE as
13050 required. */
13052 tree
13054 {
13056 {
13058 /* Executing a compound literal inside a function reinitializes
13059 it. */
13063 }
13064 else
13066 }
13067 \f
13068 /* Generate OMP construct CODE, with BODY and CLAUSES as its compound
13069 statement. LOC is the location of the construct. */
13071 tree
13073 tree clauses)
13074 {
13084 }
13086 /* Generate OACC_DATA, with CLAUSES and BLOCK as its compound
13087 statement. LOC is the location of the OACC_DATA. */
13089 tree
13091 {
13092 tree stmt;
13103 }
13105 /* Generate OACC_HOST_DATA, with CLAUSES and BLOCK as its compound
13106 statement. LOC is the location of the OACC_HOST_DATA. */
13108 tree
13110 {
13111 tree stmt;
13122 }
13124 /* Like c_begin_compound_stmt, except force the retention of the BLOCK. */
13126 tree
13128 {
13129 tree block;
13135 }
13137 /* Generate OMP_PARALLEL, with CLAUSES and BLOCK as its compound
13138 statement. LOC is the location of the OMP_PARALLEL. */
13140 tree
13142 {
13143 tree stmt;
13154 }
13156 /* Like c_begin_compound_stmt, except force the retention of the BLOCK. */
13158 tree
13160 {
13161 tree block;
13167 }
13169 /* Generate OMP_TASK, with CLAUSES and BLOCK as its compound
13170 statement. LOC is the location of the #pragma. */
13172 tree
13174 {
13175 tree stmt;
13186 }
13188 /* Generate GOMP_cancel call for #pragma omp cancel. */
13190 void
13192 {
13203 else
13204 {
13206 "%<parallel%>, %<for%>, %<sections%> or %<taskgroup%> "
13209 }
13212 {
13217 else
13218 {
13221 {
13227 }
13228 }
13234 }
13235 else
13239 ifc);
13241 }
13243 /* Generate GOMP_cancellation_point call for
13244 #pragma omp cancellation point. */
13246 void
13248 {
13259 else
13260 {
13262 "%<parallel%>, %<for%>, %<sections%> or %<taskgroup%> "
13265 }
13269 }
13271 /* Helper function for handle_omp_array_sections. Called recursively
13272 to handle multiple array-section-subscripts. C is the clause,
13273 T current expression (initially OMP_CLAUSE_DECL), which is either
13274 a TREE_LIST for array-section-subscript (TREE_PURPOSE is low-bound
13275 expression if specified, TREE_VALUE length expression if specified,
13276 TREE_CHAIN is what it has been specified after, or some decl.
13277 TYPES vector is populated with array section types, MAYBE_ZERO_LEN
13278 set to true if any of the array-section-subscript could have length
13279 of zero (explicit or implicit), FIRST_NON_ONE is the index of the
13280 first array-section-subscript which is known not to have length
13281 of one. Given say:
13282 map(a[:b][2:1][:c][:2][:d][e:f][2:5])
13283 FIRST_NON_ONE will be 3, array-section-subscript [:b], [2:1] and [:c]
13284 all are or may have length of 1, array-section-subscript [:2] is the
13285 first one known not to have length 1. For array-section-subscript
13286 <= FIRST_NON_ONE we diagnose non-contiguous arrays if low bound isn't
13287 0 or length isn't the array domain max + 1, for > FIRST_NON_ONE we
13288 can if MAYBE_ZERO_LEN is false. MAYBE_ZERO_LEN will be true in the above
13289 case though, as some lengths could be zero. */
13291 static tree
13295 {
13298 {
13305 {
13309 }
13311 {
13316 }
13318 {
13321 }
13326 {
13328 {
13333 }
13335 {
13337 {
13341 }
13346 {
13351 }
13353 {
13358 else
13360 }
13361 }
13362 }
13364 {
13369 else
13374 }
13378 {
13382 }
13387 {
13392 }
13397 {
13398 /* If the array section is pointer based and the pointer
13399 itself is _Atomic qualified, we need to atomically load
13400 the pointer. */
13401 c_expr expr;
13407 }
13409 }
13424 {
13427 low_bound);
13429 }
13431 {
13434 length);
13436 }
13452 {
13454 {
13459 }
13460 }
13462 {
13464 {
13470 {
13472 {
13477 }
13478 }
13479 else
13481 }
13484 first_non_one++;
13485 }
13487 {
13491 {
13493 "for unknown bound array type length expression must "
13496 }
13499 {
13504 }
13508 {
13513 }
13518 {
13519 tree size
13523 {
13525 {
13527 "low bound %qE above array section size "
13531 }
13533 {
13539 {
13544 }
13546 }
13549 && tree_int_cst_equal
13551 low_bound))
13552 first_non_one++;
13553 }
13555 {
13563 first_non_one++;
13564 }
13566 {
13568 {
13570 "length %qE above array section size "
13574 }
13576 {
13577 tree lbpluslen
13583 {
13585 "high bound %qE above array section size "
13589 }
13590 }
13591 }
13592 }
13594 {
13602 first_non_one++;
13603 }
13605 /* For [lb:] we will need to evaluate lb more than once. */
13607 {
13610 {
13613 }
13614 }
13615 }
13617 {
13619 {
13622 "for array function parameter length expression "
13624 else
13628 }
13632 {
13637 }
13638 /* If there is a pointer type anywhere but in the very first
13639 array-section-subscript, the array section could be non-contiguous. */
13643 {
13644 /* If any prior dimension has a non-one length, then deem this
13645 array section as non-contiguous. */
13648 {
13651 {
13656 }
13657 }
13658 }
13659 }
13660 else
13661 {
13665 }
13668 /* We will need to evaluate lb more than once. */
13671 {
13674 }
13677 }
13679 /* Handle array sections for clause C. */
13681 static bool
13683 {
13696 ort);
13703 {
13706 /* Need to evaluate side effects in the length expressions
13707 if any. */
13709 {
13711 {
13714 else
13717 }
13719 }
13724 }
13725 else
13726 {
13736 {
13740 i--;
13754 {
13763 {
13764 tree size;
13767 size_one_node);
13769 {
13770 do_warn_noncontiguous:
13772 "array section is not contiguous in %qs "
13776 }
13777 }
13780 {
13783 else
13787 }
13788 }
13789 else
13790 {
13791 tree l;
13801 else
13802 {
13805 size_one_node);
13808 }
13810 {
13812 size_zero_node);
13815 else
13818 }
13820 {
13828 {
13831 {
13836 }
13839 }
13844 }
13845 else
13847 }
13848 }
13854 {
13877 else
13878 {
13883 }
13886 }
13900 {
13919 }
13923 else
13943 }
13945 }
13947 /* Helper function of finish_omp_clauses. Clone STMT as if we were making
13948 an inline call. But, remap
13949 the OMP_DECL1 VAR_DECL (omp_out resp. omp_orig) to PLACEHOLDER
13950 and OMP_DECL2 VAR_DECL (omp_in resp. omp_priv) to DECL. */
13952 static tree
13955 {
13956 copy_body_data id;
13974 }
13976 /* Helper function of c_finish_omp_clauses, called via walk_tree.
13977 Find OMP_CLAUSE_PLACEHOLDER (passed in DATA) in *TP. */
13979 static tree
13981 {
13985 }
13987 /* Similarly, but also walk aggregate fields. */
13991 static tree
13993 {
13997 {
13998 tree field;
14004 {
14013 pset);
14019 }
14020 }
14025 }
14027 /* Finish OpenMP iterators ITER. Return true if they are errorneous
14028 and clauses containing them should be removed. */
14030 static bool
14032 {
14035 {
14040 tree orig_step;
14044 {
14047 }
14049 {
14051 var);
14054 }
14056 {
14060 }
14062 {
14066 }
14069 {
14072 }
14074 {
14079 }
14086 {
14093 }
14095 {
14099 }
14105 {
14108 }
14110 tree it2;
14112 {
14121 {
14126 }
14128 {
14132 }
14134 {
14138 }
14140 {
14144 }
14145 }
14147 {
14150 }
14155 }
14157 }
14159 /* Ensure that pointers are used in OpenACC attach and detach clauses.
14160 Return true if an error has been detected. */
14162 static bool
14164 {
14168 /* OpenACC attach / detach clauses must be pointers. */
14171 {
14178 {
14182 }
14183 }
14186 }
14188 /* For all elements of CLAUSES, validate them against their constraints.
14189 Remove any elements from the list that are invalid. */
14191 tree
14193 {
14213 /* 1 if normal/task reduction has been seen, -1 if inscan reduction
14214 has been seen, -2 if mixed inscan/normal reduction diagnosed. */
14225 /* If ort == C_ORT_OMP_DECLARE_SIMD used as uniform_head instead. */
14229 /* If ort == C_ORT_OMP used as nontemporal_head or use_device_xxx_head
14230 instead and for ort == C_ORT_OMP_TARGET used as in_reduction_head. */
14237 {
14240 }
14245 {
14250 /* We've reached the end of a list of expanded nodes. Reset the group
14251 start pointer. */
14256 {
14272 {
14274 "%<inscan%> and non-%<inscan%> %<reduction%> clauses "
14277 }
14278 /* FALLTHRU */
14284 {
14286 {
14289 }
14294 {
14296 "%<inscan%> %<reduction%> clause with array "
14300 }
14301 }
14304 {
14307 }
14314 {
14320 {
14323 t);
14326 }
14330 {
14333 t);
14336 }
14341 index_type);
14348 }
14350 {
14355 }
14358 {
14359 /* Disallow zero sized or potentially zero sized task
14360 reductions. */
14362 {
14368 }
14370 {
14376 }
14377 }
14381 {
14386 {
14412 }
14414 {
14420 }
14421 }
14423 {
14428 }
14430 {
14440 {
14446 }
14456 decl_placeholder ? decl_placeholder
14464 {
14476 decl_placeholder ? decl_placeholder
14479 {
14484 }
14486 c_find_omp_placeholder_r,
14489 }
14490 else
14491 {
14492 tree init;
14496 else
14500 }
14506 }
14508 {
14512 {
14517 }
14523 }
14529 {
14531 "%<nowait%> clause must not be used together "
14535 }
14541 {
14546 }
14556 {
14558 "modifier should not be specified in %<linear%> "
14559 "clause on %<simd%> or %<for%> constructs when not "
14562 }
14565 {
14567 "linear clause applied to non-integral non-pointer "
14571 }
14573 {
14578 }
14580 {
14583 {
14585 /* map_head bitmap is used as uniform_head if
14586 declare_simd. */
14590 }
14592 {
14594 "%<linear%> clause step %qE is neither constant "
14598 }
14599 }
14601 {
14607 fold_convert
14612 }
14613 else
14618 check_dup_generic:
14620 check_dup_generic_t:
14622 {
14627 }
14636 {
14640 {
14642 "%qD appears more than once in data-sharing "
14646 }
14650 {
14652 ort == C_ORT_ACC
14655 t);
14657 }
14658 else
14660 }
14665 {
14669 }
14674 {
14678 else
14682 }
14683 else
14689 {
14690 move_implicit:
14692 /* Move firstprivate and map clauses with
14693 OMP_CLAUSE_{FIRSTPRIVATE,MAP}_IMPLICIT set to the end of
14694 clauses chain. */
14700 {
14704 }
14707 {
14711 }
14712 else
14718 }
14723 {
14727 }
14735 {
14739 }
14741 {
14748 else
14752 }
14753 else
14762 {
14766 }
14769 {
14773 }
14774 else
14781 {
14785 }
14788 {
14790 "%qE in %<aligned%> clause is neither a pointer nor "
14793 }
14795 {
14800 }
14802 {
14805 t);
14807 }
14808 else
14815 {
14819 }
14821 {
14823 "%qE appears more than once in %<nontemporal%> "
14826 }
14827 else
14834 {
14838 }
14840 {
14843 t);
14845 }
14846 else
14847 {
14851 }
14859 {
14862 {
14865 {
14873 sizetype,
14877 {
14880 }
14882 }
14883 }
14885 }
14893 {
14895 last_iterators_remove
14901 }
14902 else
14905 {
14910 {
14912 "%<depend%> clause with %<depobj%> dependence "
14915 }
14917 }
14922 {
14925 {
14927 "%<omp_all_memory%> used with %<depend%> kind "
14930 }
14931 }
14933 {
14935 "%qE is not lvalue expression nor array section in "
14939 }
14942 {
14949 }
14952 {
14954 {
14956 "%qE does not have %<omp_depend_t%> type in "
14957 "%<depend%> clause with %<depobj%> dependence "
14960 }
14961 }
14964 {
14966 "%qE should not have %<omp_depend_t%> type in "
14967 "%<depend%> clause with dependence type other than "
14970 }
14972 {
14975 else
14976 {
14980 {
14983 }
14985 RO_UNARY_STAR);
14987 {
14990 }
14991 }
14997 else
14999 }
15005 /* FALLTHRU */
15011 {
15017 else
15018 {
15021 {
15023 "array section does not have mappable type "
15027 }
15029 {
15034 }
15039 {
15040 do
15041 {
15045 {
15050 }
15051 }
15061 {
15064 }
15068 {
15071 "%qD appears more than once in motion "
15075 "%qD appears more than once in data "
15077 else
15079 "%qD appears more than once in map "
15082 }
15083 else
15084 {
15087 }
15088 }
15089 }
15095 /* In this case, we have a single array element which is a
15096 pointer, and we already set OMP_CLAUSE_SIZE in
15097 handle_omp_array_sections above. For attach/detach clauses,
15098 reset the OMP_CLAUSE_SIZE (representing a bias) to zero
15099 here. */
15102 }
15104 {
15107 }
15108 /* OpenACC attach / detach clauses must be pointers. */
15110 {
15113 }
15117 /* For attach/detach clauses, set OMP_CLAUSE_SIZE (representing a
15118 bias) to zero here, so it is not set erroneously to the pointer
15119 size later on in gimplify.cc. */
15123 {
15128 }
15130 {
15133 }
15139 {
15145 }
15149 {
15151 {
15156 }
15158 {
15163 }
15165 {
15170 }
15172 {
15175 {
15180 }
15183 {
15188 else
15190 }
15194 {
15199 }
15200 }
15204 {
15209 }
15210 }
15212 {
15217 }
15219 {
15224 }
15228 && !indir_component_ref_p
15239 {
15244 }
15248 {
15253 }
15262 {
15266 {
15270 }
15273 {
15277 else
15281 }
15282 else
15284 }
15287 {
15294 else
15298 }
15301 {
15305 }
15308 {
15312 else
15316 }
15317 else
15318 {
15323 }
15336 ;
15338 {
15341 "%qE is neither a variable nor a function name in "
15343 else
15347 }
15349 {
15352 cname);
15354 }
15356 {
15359 cname);
15361 }
15365 {
15367 "%qE appears more than once on the same "
15370 }
15371 else
15378 {
15382 else
15387 }
15388 /* map_head bitmap is used as uniform_head if declare_simd. */
15398 {
15401 {
15406 }
15408 {
15413 }
15414 }
15420 {
15423 else
15424 {
15428 }
15429 }
15443 {
15445 "%<nowait%> clause must not be used together "
15449 }
15456 {
15458 "%<order%> clause must not be used together "
15462 }
15464 {
15465 /* Silently remove duplicates. */
15468 }
15476 {
15482 }
15549 {
15551 "%<order%> clause must not be used together "
15555 }
15571 {
15573 "%<inbranch%> clause is incompatible with "
15577 }
15588 {
15593 }
15598 }
15601 {
15605 {
15609 }
15612 {
15618 {
15625 /* The __func__ variable and similar function-local
15626 predefined variables may be listed in a shared or
15627 firstprivate clause. */
15636 }
15638 {
15644 }
15648 {
15650 "%<const%> qualified %qE may appear only in "
15653 }
15654 }
15655 }
15658 {
15660 {
15661 /* If we found a clause to remove, we want to remove the whole
15662 expanded group, otherwise gimplify
15663 (omp_resolve_clause_dependencies) can get confused. */
15667 }
15668 else
15670 }
15671 else
15673 }
15676 && safelen
15679 {
15681 "%<simdlen%> clause value is bigger than "
15685 }
15688 && schedule_clause
15691 {
15693 "%<nonmonotonic%> schedule modifier specified together "
15699 }
15702 {
15704 "%qs clause specified together with %<inscan%> "
15707 }
15710 {
15712 "%qs clause specified together with %<inscan%> "
15715 }
15719 || allocate_seen
15722 {
15726 {
15731 {
15741 }
15742 /* FALLTHRU */
15753 }
15758 {
15760 "%<linear%> clause step is a parameter %qD not "
15764 }
15770 {
15781 }
15785 else
15787 }
15791 {
15796 {
15798 "%qD specified in %<allocate%> clause but not in "
15801 }
15804 else
15806 }
15809 {
15811 "%<nogroup%> clause must not be used together with "
15814 }
15817 {
15819 {
15821 "%<detach%> clause must not be used together with "
15824 }
15825 else
15826 {
15830 {
15837 {
15839 "the event handle of a %<detach%> clause "
15842 }
15845 else
15847 }
15848 }
15849 }
15853 }
15855 /* Return code to initialize DST with a copy constructor from SRC.
15856 C doesn't have copy constructors nor assignment operators, only for
15857 _Atomic vars we need to perform __atomic_load from src into a temporary
15858 followed by __atomic_store of the temporary to dst. */
15860 tree
15862 {
15877 /* Expansion of a generic atomic load may require an addition
15878 element, so allocate enough to prevent a resize. */
15881 /* Build __atomic_load (&src, &tmp, SEQ_CST); */
15890 /* Build __atomic_store (&dst, &tmp, SEQ_CST); */
15897 }
15899 /* Create a transaction node. */
15901 tree
15903 {
15910 }
15912 /* Make a variant type in the proper way for C/C++, propagating qualifiers
15913 down to the element type of an array. If ORIG_QUAL_TYPE is not
15914 NULL, then it should be used as the qualified type
15915 ORIG_QUAL_INDIRECT levels down in array type derivation (to
15916 preserve information about the typedef name from which an array
15917 type was derived). */
15919 tree
15922 {
15927 {
15928 tree t;
15933 /* See if we already have an identically qualified type. */
15936 else
15938 {
15945 }
15947 {
15958 {
15959 tree unqualified_canon
15964 {
15965 unqualified_canon
15968 }
15971 }
15972 else
15974 }
15976 }
15978 /* A restrict-qualified pointer type must be a pointer to object or
15979 incomplete type. Note that the use of POINTER_TYPE_P also allows
15980 REFERENCE_TYPEs, which is appropriate for C++. */
15984 {
15987 }
15990 ? orig_qual_type
15992 /* A variant type does not inherit the list of incomplete vars from the
15993 type main variant. */
15999 }
16001 /* Build a VA_ARG_EXPR for the C parser. */
16003 tree
16005 {
16008 /* VA_ARG_EXPR cannot be used for a scalar va_list with reverse storage
16009 order because it takes the address of the expression. */
16012 {
16015 }
16017 {
16021 }
16023 {
16025 type);
16027 }
16032 }
16034 /* Return truthvalue of whether T1 is the same tree structure as T2.
16035 Return 1 if they are the same. Return false if they are different. */
16037 bool
16039 {
16058 /* They might have become equal now. */
16066 {
16090 /* We need to do this when determining whether or not two
16091 non-type pointer to member function template arguments
16092 are the same. */
16096 {
16100 {
16105 }
16106 }
16120 {
16135 }
16138 {
16142 /* Special case: if either target is an unallocated VAR_DECL,
16143 it means that it's going to be unified with whatever the
16144 TARGET_EXPR is really supposed to initialize, so treat it
16145 as being equivalent to anything. */
16156 }
16173 {
16182 }
16186 }
16189 {
16197 {
16201 {
16213 }
16224 }
16230 }
16231 }
16233 /* Returns true when the function declaration FNDECL is implicit,
16234 introduced as a result of a call to an otherwise undeclared
16235 function, and false otherwise. */
16237 bool
16239 {
16241 }