| blob | 0c07af61f24f015f17d055ef398445333c9d8f85 |
1 /* Build expressions with type checking for C compiler.
2 Copyright (C) 1987-2021 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 bad conversions. Used to select
57 diagnostic messages in convert_for_assignment. */
59 ic_argpass,
60 ic_assign,
61 ic_init,
62 ic_return
63 };
65 /* The level of nesting inside "__alignof__". */
68 /* The level of nesting inside "sizeof". */
71 /* The level of nesting inside "typeof". */
74 /* True when parsing OpenMP loop expressions. */
77 /* The argument of last parsed sizeof expression, only to be tested
78 if expr.original_code == SIZEOF_EXPR. */
79 tree c_last_sizeof_arg;
80 location_t c_last_sizeof_loc;
82 /* Nonzero if we might need to print a "missing braces around
83 initializer" message within this initializer. */
100 tree);
126 \f
127 /* Return true if EXP is a null pointer constant, false otherwise. */
129 static bool
131 {
132 /* This should really operate on c_expr structures, but they aren't
133 yet available everywhere required. */
142 }
144 /* EXPR may appear in an unevaluated part of an integer constant
145 expression, but not in an evaluated part. Wrap it in a
146 C_MAYBE_CONST_EXPR, or mark it with TREE_OVERFLOW if it is just an
147 INTEGER_CST and we cannot create a C_MAYBE_CONST_EXPR. */
149 static tree
151 {
152 tree ret;
154 {
157 }
158 else
159 {
162 }
164 }
166 /* Having checked whether EXPR may appear in an unevaluated part of an
167 integer constant expression and found that it may, remove any
168 C_MAYBE_CONST_EXPR noting this fact and return the resulting
169 expression. */
173 {
176 else
178 }
184 const_tree t1;
185 const_tree t2;
186 /* The return value of tagged_types_tu_compatible_p if we had seen
187 these two types already. */
189 };
194 /* Do `exp = require_complete_type (loc, exp);' to make sure exp
195 does not have an incomplete type. (That includes void types.)
196 LOC is the location of the use. */
198 tree
200 {
206 /* First, detect a valid value with a complete type. */
212 }
214 /* Print an error message for invalid use of an incomplete type.
215 VALUE is the expression that was used (or 0 if that isn't known)
216 and TYPE is the type that was invalid. LOC is the location for
217 the error. */
219 void
221 {
222 /* Avoid duplicate error message. */
228 else
229 {
230 retry:
231 /* We must print an error message. Be clever about what it says. */
234 {
246 {
248 {
251 }
254 }
260 }
264 else
265 /* If this type has a typedef-name, the TYPE_NAME is a TYPE_DECL. */
267 }
268 }
270 /* Given a type, apply default promotions wrt unnamed function
271 arguments and return the new type. */
273 tree
275 {
281 {
282 /* Preserve unsignedness if not really getting any wider. */
286 else
288 }
296 }
298 /* Return true if between two named address spaces, whether there is a superset
299 named address space that encompasses both address spaces. If there is a
300 superset, return which address space is the superset. */
302 static bool
304 {
306 {
309 }
311 {
314 }
316 {
319 }
320 else
322 }
324 /* Return a variant of TYPE which has all the type qualifiers of LIKE
325 as well as those of TYPE. */
327 static tree
329 {
332 addr_space_t as_common;
334 /* If the two named address spaces are different, determine the common
335 superset address space. If there isn't one, raise an error. */
337 {
341 }
347 }
349 /* Return true iff the given tree T is a variable length array. */
351 bool
353 {
358 }
360 /* If NTYPE is a type of a non-variadic function with a prototype
361 and OTYPE is a type of a function without a prototype and ATTRS
362 contains attribute format, diagnosess and removes it from ATTRS.
363 Returns the result of build_type_attribute_variant of NTYPE and
364 the (possibly) modified ATTRS. */
366 static tree
368 {
372 {
374 "%qs attribute cannot be applied to a function that "
377 }
380 }
381 /* Return the composite type of two compatible types.
383 We assume that comptypes has already been done and returned
384 nonzero; if that isn't so, this may crash. In particular, we
385 assume that qualifiers match. */
387 tree
389 {
392 tree attributes;
394 /* Save time if the two types are the same. */
398 /* If one type is nonsense, use the other. */
407 /* Merge the attributes. */
410 /* If one is an enumerated type and the other is the compatible
411 integer type, the composite type might be either of the two
412 (DR#013 question 3). For consistency, use the enumerated type as
413 the composite type. */
423 {
425 /* For two pointers, do this recursively on the target type. */
426 {
433 }
436 {
439 tree unqual_elt;
446 /* We should not have any type quals on arrays at all. */
456 d1_variable = (!d1_zero
459 d2_variable = (!d2_zero
465 /* Save space: see if the result is identical to one of the args. */
478 /* Merge the element types, and have a size if either arg has
479 one. We may have qualifiers on the element types. To set
480 up TYPE_MAIN_VARIANT correctly, we need to form the
481 composite of the unqualified types and add the qualifiers
482 back at the end. */
487 && (d2_variable
488 || d2_zero
490 ? t1
492 /* Ensure a composite type involving a zero-length array type
493 is a zero-length type not an incomplete type. */
497 {
500 }
503 }
509 {
510 /* Try harder not to create a new aggregate type. */
515 }
519 /* Function types: prefer the one that specified arg types.
520 If both do, merge the arg types. Also merge the return types. */
521 {
529 /* Save space: see if the result is identical to one of the args. */
535 /* Simple way if one arg fails to specify argument types. */
537 {
541 }
543 {
547 }
549 /* If both args specify argument types, we must merge the two
550 lists, argument by argument. */
555 ;
564 {
565 /* A null type means arg type is not specified.
566 Take whatever the other function type has. */
568 {
571 }
573 {
576 }
578 /* Given wait (union {union wait *u; int *i} *)
579 and wait (union wait *),
580 prefer union wait * as type of parm. */
583 {
584 tree memb;
591 {
597 {
603 }
604 }
605 }
608 {
609 tree memb;
616 {
622 {
628 }
629 }
630 }
632 parm_done: ;
633 }
637 }
638 /* FALLTHRU */
642 }
644 }
646 /* Return the type of a conditional expression between pointers to
647 possibly differently qualified versions of compatible types.
649 We assume that comp_target_types has already been done and returned
650 nonzero; if that isn't so, this may crash. */
652 static tree
654 {
655 tree attributes;
658 tree target;
663 /* Save time if the two types are the same. */
667 /* If one type is nonsense, use the other. */
676 /* Merge the attributes. */
679 /* Find the composite type of the target types, and combine the
680 qualifiers of the two types' targets. Do not lose qualifiers on
681 array element types by taking the TYPE_MAIN_VARIANT. */
690 /* Strip array types to get correct qualifier for pointers to arrays */
694 /* For function types do not merge const qualifiers, but drop them
695 if used inconsistently. The middle-end uses these to mark const
696 and noreturn functions. */
699 else
702 /* If the two named address spaces are different, determine the common
703 superset address space. This is guaranteed to exist due to the
704 assumption that comp_target_type returned non-zero. */
714 }
716 /* Return the common type for two arithmetic types under the usual
717 arithmetic conversions. The default conversions have already been
718 applied, and enumerated types converted to their compatible integer
719 types. The resulting type is unqualified and has no attributes.
721 This is the type for the result of most arithmetic operations
722 if the operands have the given two types. */
724 static tree
726 {
730 /* If one type is nonsense, use the other. */
743 {
746 }
749 {
752 }
754 /* Save time if the two types are the same. */
768 /* When one operand is a decimal float type, the other operand cannot be
769 a generic float type or a complex type. We also disallow vector types
770 here. */
773 {
775 {
778 }
780 {
783 }
785 {
789 }
790 }
792 /* If one type is a vector type, return that type. (How the usual
793 arithmetic conversions apply to the vector types extension is not
794 precisely specified.) */
801 /* If one type is complex, form the common type of the non-complex
802 components, then make that complex. Use T1 or T2 if it is the
803 required type. */
805 {
814 else
816 }
818 /* If only one is real, use it as the result. */
826 /* If both are real and either are decimal floating point types, use
827 the decimal floating point type with the greater precision. */
830 {
840 }
842 /* Deal with fixed-point types. */
844 {
852 /* If one input type is saturating, the result type is saturating. */
856 /* If both fixed-point types are unsigned, the result type is unsigned.
857 When mixing fixed-point and integer types, follow the sign of the
858 fixed-point type.
859 Otherwise, the result type is signed. */
868 /* The result type is signed. */
870 {
871 /* If the input type is unsigned, we need to convert to the
872 signed type. */
874 {
880 else
884 }
886 {
892 else
896 }
897 }
900 {
903 }
904 else
905 {
907 /* Signed integers need to subtract one sign bit. */
909 }
912 {
915 }
916 else
917 {
919 /* Signed integers need to subtract one sign bit. */
921 }
926 satp);
927 }
929 /* Both real or both integers; use the one with greater precision. */
936 /* Same precision. Prefer long longs to longs to ints when the
937 same precision, following the C99 rules on integer type rank
938 (which are equivalent to the C90 rules for C90 types). */
946 {
949 else
951 }
959 {
960 /* But preserve unsignedness from the other type,
961 since long cannot hold all the values of an unsigned int. */
964 else
966 }
968 /* For floating types of the same TYPE_PRECISION (which we here
969 assume means either the same set of values, or sets of values
970 neither a subset of the other, with behavior being undefined in
971 the latter case), follow the rules from TS 18661-3: prefer
972 interchange types _FloatN, then standard types long double,
973 double, float, then extended types _FloatNx. For extended types,
974 check them starting with _Float128x as that seems most consistent
975 in spirit with preferring long double to double; for interchange
976 types, also check in that order for consistency although it's not
977 possible for more than one of them to have the same
978 precision. */
986 /* Likewise, prefer long double to double even if same size. */
990 /* Likewise, prefer double to float even if same size.
991 We got a couple of embedded targets with 32 bit doubles, and the
992 pdp11 might have 64 bit floats. */
1003 /* Otherwise prefer the unsigned one. */
1007 else
1009 }
1010 \f
1011 /* Wrapper around c_common_type that is used by c-common.c and other
1012 front end optimizations that remove promotions. ENUMERAL_TYPEs
1013 are allowed here and are converted to their compatible integer types.
1014 BOOLEAN_TYPEs are allowed here and return either boolean_type_node or
1015 preferably a non-Boolean type as the common type. */
1016 tree
1018 {
1024 /* If both types are BOOLEAN_TYPE, then return boolean_type_node. */
1029 /* If either type is BOOLEAN_TYPE, then return the other. */
1036 }
1038 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
1039 or various other operations. Return 2 if they are compatible
1040 but a warning may be needed if you use them together. */
1042 int
1044 {
1052 }
1054 /* Like comptypes, but if it returns non-zero because enum and int are
1055 compatible, it sets *ENUM_AND_INT_P to true. */
1057 static int
1059 {
1067 }
1069 /* Like comptypes, but if it returns nonzero for different types, it
1070 sets *DIFFERENT_TYPES_P to true. */
1072 int
1075 {
1083 }
1084 \f
1085 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
1086 or various other operations. Return 2 if they are compatible
1087 but a warning may be needed if you use them together. If
1088 ENUM_AND_INT_P is not NULL, and one type is an enum and the other a
1089 compatible integer type, then this sets *ENUM_AND_INT_P to true;
1090 *ENUM_AND_INT_P is never set to false. If DIFFERENT_TYPES_P is not
1091 NULL, and the types are compatible but different enough not to be
1092 permitted in C11 typedef redeclarations, then this sets
1093 *DIFFERENT_TYPES_P to true; *DIFFERENT_TYPES_P is never set to
1094 false, but may or may not be set if the types are incompatible.
1095 This differs from comptypes, in that we don't free the seen
1096 types. */
1098 static int
1101 {
1106 /* Suppress errors caused by previously reported errors. */
1112 /* Enumerated types are compatible with integer types, but this is
1113 not transitive: two enumerated types in the same translation unit
1114 are compatible with each other only if they are the same type. */
1119 {
1122 {
1127 }
1128 }
1132 {
1135 {
1140 }
1141 }
1146 /* Different classes of types can't be compatible. */
1151 /* Qualifiers must match. C99 6.7.3p9 */
1156 /* Allow for two different type nodes which have essentially the same
1157 definition. Note that we already checked for equality of the type
1158 qualifiers (just above). */
1164 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1168 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1172 {
1176 /* With these nodes, we can't determine type equivalence by
1177 looking at what is stored in the nodes themselves, because
1178 two nodes might have different TYPE_MAIN_VARIANTs but still
1179 represent the same type. For example, wchar_t and int could
1180 have the same properties (TYPE_PRECISION, TYPE_MIN_VALUE,
1181 TYPE_MAX_VALUE, etc.), but have different TYPE_MAIN_VARIANTs
1182 and are distinct types. On the other hand, int and the
1183 following typedef
1185 typedef int INT __attribute((may_alias));
1187 have identical properties, different TYPE_MAIN_VARIANTs, but
1188 represent the same type. The canonical type system keeps
1189 track of equivalence in this case, so we fall back on it. */
1193 /* Do not remove mode information. */
1203 different_types_p);
1207 {
1214 /* Target types must match incl. qualifiers. */
1217 enum_and_int_p,
1224 /* Sizes must match unless one is missing or variable. */
1231 d1_variable = (!d1_zero
1234 d2_variable = (!d2_zero
1253 }
1259 {
1269 different_types_p);
1271 different_types_p);
1272 }
1283 }
1285 }
1287 /* Return 1 if TTL and TTR are pointers to types that are equivalent, ignoring
1288 their qualifiers, except for named address spaces. If the pointers point to
1289 different named addresses, then we must determine if one address space is a
1290 subset of the other. */
1292 static int
1294 {
1301 addr_space_t as_common;
1304 /* Fail if pointers point to incompatible address spaces. */
1308 /* For pedantic record result of comptypes on arrays before losing
1309 qualifiers on the element type below. */
1316 /* Qualifiers on element types of array types that are
1317 pointer targets are lost by taking their TYPE_MAIN_VARIANT. */
1342 }
1343 \f
1344 /* Subroutines of `comptypes'. */
1346 /* Determine whether two trees derive from the same translation unit.
1347 If the CONTEXT chain ends in a null, that tree's context is still
1348 being parsed, so if two trees have context chains ending in null,
1349 they're in the same translation unit. */
1351 bool
1353 {
1356 {
1364 }
1368 {
1376 }
1379 }
1381 /* Allocate the seen two types, assuming that they are compatible. */
1385 {
1393 /* The C standard says that two structures in different translation
1394 units are compatible with each other only if the types of their
1395 fields are compatible (among other things). We assume that they
1396 are compatible until proven otherwise when building the cache.
1397 An example where this can occur is:
1398 struct a
1399 {
1400 struct a *next;
1401 };
1402 If we are comparing this against a similar struct in another TU,
1403 and did not assume they were compatible, we end up with an infinite
1404 loop. */
1407 }
1409 /* Free the seen types until we get to TU_TIL. */
1411 static void
1413 {
1416 {
1421 }
1423 }
1425 /* Return 1 if two 'struct', 'union', or 'enum' types T1 and T2 are
1426 compatible. If the two types are not the same (which has been
1427 checked earlier), this can only happen when multiple translation
1428 units are being compiled. See C99 6.2.7 paragraph 1 for the exact
1429 rules. ENUM_AND_INT_P and DIFFERENT_TYPES_P are as in
1430 comptypes_internal. */
1432 static int
1435 {
1439 /* We have to verify that the tags of the types are the same. This
1440 is harder than it looks because this may be a typedef, so we have
1441 to go look at the original type. It may even be a typedef of a
1442 typedef...
1443 In the case of compiler-created builtin structs the TYPE_DECL
1444 may be a dummy, with no DECL_ORIGINAL_TYPE. Don't fault. */
1455 /* C90 didn't have the requirement that the two tags be the same. */
1459 /* C90 didn't say what happened if one or both of the types were
1460 incomplete; we choose to follow C99 rules here, which is that they
1461 are compatible. */
1466 {
1471 }
1474 {
1476 {
1478 /* Speed up the case where the type values are in the same order. */
1483 {
1485 }
1488 {
1492 {
1495 }
1496 }
1499 {
1501 }
1503 {
1506 }
1509 {
1512 }
1515 {
1519 {
1522 }
1523 }
1525 }
1528 {
1531 {
1534 }
1536 /* Speed up the common case where the fields are in the same order. */
1539 {
1550 {
1553 }
1560 {
1563 }
1564 }
1566 {
1569 }
1572 {
1577 {
1581 enum_and_int_p,
1582 different_types_p);
1587 {
1590 }
1601 }
1603 {
1606 }
1607 }
1610 }
1613 {
1619 {
1635 }
1638 else
1641 }
1645 }
1646 }
1648 /* Return 1 if two function types F1 and F2 are compatible.
1649 If either type specifies no argument types,
1650 the other must specify a fixed number of self-promoting arg types.
1651 Otherwise, if one type specifies only the number of arguments,
1652 the other must specify that number of self-promoting arg types.
1653 Otherwise, the argument types must match.
1654 ENUM_AND_INT_P and DIFFERENT_TYPES_P are as in comptypes_internal. */
1656 static int
1659 {
1661 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1669 /* 'volatile' qualifiers on a function's return type used to mean
1670 the function is noreturn. */
1690 /* An unspecified parmlist matches any specified parmlist
1691 whose argument types don't need default promotions. */
1694 {
1697 /* If one of these types comes from a non-prototype fn definition,
1698 compare that with the other type's arglist.
1699 If they don't match, ask for a warning (but no error). */
1705 }
1707 {
1715 }
1717 /* Both types have argument lists: compare them and propagate results. */
1719 different_types_p);
1721 }
1723 /* Check two lists of types for compatibility, returning 0 for
1724 incompatible, 1 for compatible, or 2 for compatible with
1725 warning. ENUM_AND_INT_P and DIFFERENT_TYPES_P are as in
1726 comptypes_internal. */
1728 static int
1731 {
1732 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1737 {
1741 /* If one list is shorter than the other,
1742 they fail to match. */
1750 TYPE_QUAL_ATOMIC)
1755 TYPE_QUAL_ATOMIC)
1757 /* A null pointer instead of a type
1758 means there is supposed to be an argument
1759 but nothing is specified about what type it has.
1760 So match anything that self-promotes. */
1765 {
1768 }
1770 {
1773 }
1774 /* If one of the lists has an error marker, ignore this arg. */
1777 ;
1779 different_types_p)))
1780 {
1783 /* Allow wait (union {union wait *u; int *i} *)
1784 and wait (union wait *) to be compatible. */
1791 {
1792 tree memb;
1795 {
1801 TYPE_QUAL_ATOMIC)
1804 different_types_p))
1806 }
1809 }
1816 {
1817 tree memb;
1820 {
1826 TYPE_QUAL_ATOMIC)
1829 different_types_p))
1831 }
1834 }
1835 else
1837 }
1839 /* comptypes said ok, but record if it said to warn. */
1845 }
1846 }
1847 \f
1848 /* Compute the size to increment a pointer by. When a function type or void
1849 type or incomplete type is passed, size_one_node is returned.
1850 This function does not emit any diagnostics; the caller is responsible
1851 for that. */
1853 static tree
1855 {
1862 /* Convert in case a char is more than one unit. */
1866 }
1867 \f
1868 /* Return either DECL or its known constant value (if it has one). */
1870 tree
1872 {
1879 /* This is invalid if initial value is not constant.
1880 If it has either a function call, a memory reference,
1881 or a variable, then re-evaluating it could give different results. */
1883 /* Check for cases where this is sub-optimal, even though valid. */
1887 }
1889 /* Return either DECL or its known constant value (if it has one).
1890 Like the above, but always return decl outside of functions. */
1892 tree
1894 {
1895 /* Don't change a variable array bound or initial value to a constant
1896 in a place where a variable is invalid. */
1898 }
1900 /* Convert the array expression EXP to a pointer. */
1901 static tree
1903 {
1906 tree adr;
1908 tree ptrtype;
1921 /* In C++ array compound literals are temporary objects unless they are
1922 const or appear in namespace scope, so they are destroyed too soon
1923 to use them for much of anything (c++/53220). */
1925 {
1929 "converting an array compound literal to a pointer "
1931 }
1935 }
1937 /* Convert the function expression EXP to a pointer. */
1938 static tree
1940 {
1950 }
1952 /* Mark EXP as read, not just set, for set but not used -Wunused
1953 warning purposes. */
1955 void
1957 {
1959 {
1969 CASE_CONVERT:
1975 /* Pattern match what build_atomic_assign produces with modifycode
1976 NOP_EXPR. */
1980 {
1986 {
1994 {
2007 }
2009 {
2015 }
2016 }
2017 }
2018 /* FALLTHRU */
2024 }
2025 }
2027 /* Perform the default conversion of arrays and functions to pointers.
2028 Return the result of converting EXP. For any other expression, just
2029 return EXP.
2031 LOC is the location of the expression. */
2033 struct c_expr
2035 {
2041 {
2043 {
2050 {
2054 }
2060 {
2061 /* Before C99, non-lvalue arrays do not decay to pointers.
2062 Normally, using such an array would be invalid; but it can
2063 be used correctly inside sizeof or as a statement expression.
2064 Thus, do not give an error here; an error will result later. */
2066 }
2069 }
2076 }
2079 }
2081 struct c_expr
2083 {
2086 }
2088 /* Return whether EXPR should be treated as an atomic lvalue for the
2089 purposes of load and store handling. */
2091 static bool
2093 {
2101 /* Ignore _Atomic on register variables, since their addresses can't
2102 be taken so (a) atomicity is irrelevant and (b) the normal atomic
2103 sequences wouldn't work. Ignore _Atomic on structures containing
2104 bit-fields, since accessing elements of atomic structures or
2105 unions is undefined behavior (C11 6.5.2.3#5), but it's unclear if
2106 it's undefined at translation time or execution time, and the
2107 normal atomic sequences again wouldn't work. */
2109 {
2114 }
2118 }
2120 /* Convert expression EXP (location LOC) from lvalue to rvalue,
2121 including converting functions and arrays to pointers if CONVERT_P.
2122 If READ_P, also mark the expression as having been read. */
2124 struct c_expr
2127 {
2135 {
2144 /* Expansion of a generic atomic load may require an addition
2145 element, so allocate enough to prevent a resize. */
2148 /* Remove the qualifiers for the rest of the expressions and
2149 create the VAL temp variable to hold the RHS. */
2154 /* Do not disable warnings for TMP even though it's artificial.
2155 -Winvalid-memory-model depends on it. */
2157 /* Issue __atomic_load (&expr, &tmp, SEQ_CST); */
2164 /* EXPR is always read. */
2167 /* Return tmp which contains the value loaded. */
2170 }
2173 exp.value = convert (build_qualified_type (TREE_TYPE (exp.value), TYPE_UNQUALIFIED), exp.value);
2175 }
2177 /* EXP is an expression of integer type. Apply the integer promotions
2178 to it and return the promoted value. */
2180 tree
2182 {
2188 /* Normally convert enums to int,
2189 but convert wide enums to something wider. */
2191 {
2199 }
2201 /* ??? This should no longer be needed now bit-fields have their
2202 proper types. */
2205 /* If it's thinner than an int, promote it like a
2206 c_promoting_integer_type_p, otherwise leave it alone. */
2212 {
2213 /* Preserve unsignedness if not really getting any wider. */
2219 }
2222 }
2225 /* Perform default promotions for C data used in expressions.
2226 Enumeral types or short or char are converted to int.
2227 In addition, manifest constants symbols are replaced by their values. */
2229 tree
2231 {
2232 tree orig_exp;
2235 tree promoted_type;
2239 /* Functions and arrays have been converted during parsing. */
2244 /* Constants can be used directly unless they're not loadable. */
2248 /* Strip no-op conversions. */
2255 {
2259 }
2273 }
2274 \f
2275 /* Look up COMPONENT in a structure or union TYPE.
2277 If the component name is not found, returns NULL_TREE. Otherwise,
2278 the return value is a TREE_LIST, with each TREE_VALUE a FIELD_DECL
2279 stepping down the chain to the component, which is in the last
2280 TREE_VALUE of the list. Normally the list is of length one, but if
2281 the component is embedded within (nested) anonymous structures or
2282 unions, the list steps down the chain to the component. */
2284 static tree
2286 {
2287 tree field;
2289 /* If TYPE_LANG_SPECIFIC is set, then it is a sorted array of pointers
2290 to the field elements. Use a binary search on this array to quickly
2291 find the element. Otherwise, do a linear search. TYPE_LANG_SPECIFIC
2292 will always be set for structures which have many elements.
2294 Duplicate field checking replaces duplicates with NULL_TREE so
2295 TYPE_LANG_SPECIFIC arrays are potentially no longer sorted. In that
2296 case just iterate using DECL_CHAIN. */
2300 {
2308 {
2313 {
2314 /* Step through all anon unions in linear fashion. */
2316 {
2319 {
2325 /* The Plan 9 compiler permits referring
2326 directly to an anonymous struct/union field
2327 using a typedef name. */
2335 }
2336 }
2338 /* Entire record is only anon unions. */
2342 /* Restart the binary search, with new lower bound. */
2344 }
2350 else
2352 }
2358 }
2359 else
2360 {
2362 {
2365 {
2371 /* The Plan 9 compiler permits referring directly to an
2372 anonymous struct/union field using a typedef
2373 name. */
2380 }
2384 }
2388 }
2391 }
2393 /* Recursively append candidate IDENTIFIER_NODEs to CANDIDATES. */
2395 static void
2398 {
2399 tree field;
2401 {
2405 candidates);
2409 }
2410 }
2412 /* Like "lookup_field", but find the closest matching IDENTIFIER_NODE,
2413 rather than returning a TREE_LIST for an exact match. */
2415 static tree
2417 {
2420 /* First, gather a list of candidates. */
2427 }
2429 /* Support function for build_component_ref's error-handling.
2431 Given DATUM_TYPE, and "DATUM.COMPONENT", where DATUM is *not* a
2432 struct or union, should we suggest "DATUM->COMPONENT" as a hint? */
2434 static bool
2436 {
2437 /* We don't do it for Objective-C, since Objective-C 2.0 dot-syntax
2438 allows "." for ptrs; we could be handling a failed attempt
2439 to access a property. */
2443 /* Only suggest it for pointers... */
2447 /* ...to structs/unions. */
2452 else
2454 }
2456 /* Make an expression to refer to the COMPONENT field of structure or
2457 union value DATUM. COMPONENT is an IDENTIFIER_NODE. LOC is the
2458 location of the COMPONENT_REF. COMPONENT_LOC is the location
2459 of COMPONENT. */
2461 tree
2463 location_t component_loc)
2464 {
2468 tree ref;
2474 /* Detect Objective-C property syntax object.property. */
2479 /* See if there is a field or component with name COMPONENT. */
2482 {
2484 {
2487 }
2492 {
2495 {
2496 /* Attempt to provide a fixit replacement hint, if
2497 we have a valid range for the component. */
2498 location_t reported_loc
2506 }
2507 else
2510 }
2512 /* Accessing elements of atomic structures or unions is undefined
2513 behavior (C11 6.5.2.3#5). */
2515 {
2519 else
2522 }
2524 /* Chain the COMPONENT_REFs if necessary down to the FIELD.
2525 This might be better solved in future the way the C++ front
2526 end does it - by giving the anonymous entities each a
2527 separate name and type, and then have build_component_ref
2528 recursively call itself. We can't do that here. */
2529 do
2530 {
2533 tree subtype;
2539 /* If this is an rvalue, it does not have qualifiers in C
2540 standard terms and we must avoid propagating such
2541 qualifiers down to a non-lvalue array that is then
2542 converted to a pointer. */
2543 use_datum_quals = (datum_lvalue
2552 NULL_TREE);
2567 }
2571 }
2573 {
2574 /* Special-case the error message for "ptr.field" for the case
2575 where the user has confused "." vs "->". */
2577 /* "loc" should be the "." token. */
2581 datum);
2583 }
2587 component);
2590 }
2591 \f
2592 /* Given an expression PTR for a pointer, return an expression
2593 for the value pointed to.
2594 ERRORSTRING is the name of the operator to appear in error messages.
2596 LOC is the location to use for the generated tree. */
2598 tree
2600 {
2603 tree ref;
2606 {
2609 {
2610 /* If a warning is issued, mark it to avoid duplicates from
2611 the backend. This only needs to be done at
2612 warn_strict_aliasing > 2. */
2617 }
2622 {
2626 }
2627 else
2628 {
2636 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
2637 so that we get the proper error message if the result is used
2638 to assign to. Also, &* is supposed to be a no-op.
2639 And ANSI C seems to specify that the type of the result
2640 should be the const type. */
2641 /* A de-reference of a pointer to const is not a const. It is valid
2642 to change it via some other pointer. */
2649 }
2650 }
2655 }
2657 /* This handles expressions of the form "a[i]", which denotes
2658 an array reference.
2660 This is logically equivalent in C to *(a+i), but we may do it differently.
2661 If A is a variable or a member, we generate a primitive ARRAY_REF.
2662 This avoids forcing the array out of registers, and can work on
2663 arrays that are not lvalues (for example, members of structures returned
2664 by functions).
2666 For vector types, allow vector[i] but not i[vector], and create
2667 *(((type*)&vectortype) + i) for the expression.
2669 LOC is the location to use for the returned expression. */
2671 tree
2673 {
2674 tree ret;
2682 /* Allow vector[index] but not index[vector]. */
2684 {
2687 {
2692 }
2695 }
2698 {
2701 }
2704 {
2707 }
2709 /* ??? Existing practice has been to warn only when the char
2710 index is syntactically the index, not for char[array]. */
2714 /* Apply default promotions *after* noticing character types. */
2725 {
2728 /* An array that is indexed by a non-constant
2729 cannot be stored in a register; we must be able to do
2730 address arithmetic on its address.
2731 Likewise an array of elements of variable size. */
2735 {
2738 }
2739 /* An array that is indexed by a constant value which is not within
2740 the array bounds cannot be stored in a register either; because we
2741 would get a crash in store_bit_field/extract_bit_field when trying
2742 to access a non-existent part of the register. */
2746 {
2749 }
2753 {
2762 "ISO C90 forbids subscripting non-lvalue "
2764 }
2768 /* Array ref is const/volatile if the array elements are
2769 or if the array is. */
2778 /* This was added by rms on 16 Nov 91.
2779 It fixes vol struct foo *a; a->elts[1]
2780 in an inline function.
2781 Hope it doesn't break something else. */
2788 }
2789 else
2790 {
2801 RO_ARRAY_INDEXING);
2805 }
2806 }
2807 \f
2808 /* Build an external reference to identifier ID. FUN indicates
2809 whether this will be used for a function call. LOC is the source
2810 location of the identifier. This sets *TYPE to the type of the
2811 identifier, which is not the same as the type of the returned value
2812 for CONST_DECLs defined as enum constants. If the type of the
2813 identifier is not available, *TYPE is set to NULL. */
2814 tree
2816 {
2817 tree ref;
2820 /* In Objective-C, an instance variable (ivar) may be preferred to
2821 whatever lookup_name() found. */
2826 {
2829 }
2831 /* Implicit function declaration. */
2834 /* Don't complain about something that's already been
2835 complained about. */
2837 else
2838 {
2841 }
2849 /* Recursive call does not count as usage. */
2851 {
2853 }
2856 {
2863 }
2866 {
2872 {
2877 }
2881 }
2886 {
2891 }
2892 /* C99 6.7.4p3: An inline definition of a function with external
2893 linkage ... shall not contain a reference to an identifier with
2894 internal linkage. */
2903 csi_internal);
2906 }
2908 /* Record details of decls possibly used inside sizeof or typeof. */
2909 struct maybe_used_decl
2910 {
2911 /* The decl. */
2912 tree decl;
2913 /* The level seen at (in_sizeof + in_typeof). */
2915 /* The next one at this level or above, or NULL. */
2917 };
2921 /* Record that DECL, an undefined static function reference seen
2922 inside sizeof or typeof, might be used if the operand of sizeof is
2923 a VLA type or the operand of typeof is a variably modified
2924 type. */
2926 static void
2928 {
2934 }
2936 /* Pop the stack of decls possibly used inside sizeof or typeof. If
2937 USED is false, just discard them. If it is true, mark them used
2938 (if no longer inside sizeof or typeof) or move them to the next
2939 level up (if still inside sizeof or typeof). */
2941 void
2943 {
2947 {
2949 {
2952 else
2954 }
2956 }
2959 }
2961 /* Return the result of sizeof applied to EXPR. */
2963 struct c_expr
2965 {
2968 {
2973 }
2974 else
2975 {
2980 {
2981 auto_diagnostic_group d;
2983 "%<sizeof%> on array function parameter %qE will "
2987 }
2996 {
2997 /* sizeof is evaluated when given a vla (C99 6.5.3.4p2). */
3002 }
3004 }
3006 }
3008 /* Return the result of sizeof applied to T, a structure for the type
3009 name passed to sizeof (rather than the type itself). LOC is the
3010 location of the original expression. */
3012 struct c_expr
3014 {
3015 tree type;
3026 {
3029 }
3030 else
3033 {
3034 /* If the type is a [*] array, it is a VLA but is represented as
3035 having a size of zero. In such a case we must ensure that
3036 the result of sizeof does not get folded to a constant by
3037 c_fully_fold, because if the size is evaluated the result is
3038 not constant and so constraints on zero or negative size
3039 arrays must not be applied when this sizeof call is inside
3040 another array declarator. */
3046 }
3050 }
3052 /* Build a function call to function FUNCTION with parameters PARAMS.
3053 The function call is at LOC.
3054 PARAMS is a list--a chain of TREE_LIST nodes--in which the
3055 TREE_VALUE of each node is a parameter-expression.
3056 FUNCTION's data type may be a function type or a pointer-to-function. */
3058 tree
3060 {
3062 tree ret;
3070 }
3072 /* Give a note about the location of the declaration of DECL. */
3074 static void
3076 {
3080 }
3082 /* Build a function call to function FUNCTION with parameters PARAMS.
3083 If FUNCTION is the result of resolving an overloaded target built-in,
3084 ORIG_FUNDECL is the original function decl, otherwise it is null.
3085 ORIGTYPES, if not NULL, is a vector of types; each element is
3086 either NULL or the original type of the corresponding element in
3087 PARAMS. The original type may differ from TREE_TYPE of the
3088 parameter for enums. FUNCTION's data type may be a function type
3089 or pointer-to-function. This function changes the elements of
3090 PARAMS. */
3092 tree
3096 {
3099 tree tem;
3104 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
3107 /* Convert anything with function type to a pointer-to-function. */
3109 {
3117 /* Atomic functions have type checking/casting already done. They are
3118 often rewritten and don't match the original parameter list. */
3121 }
3125 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
3126 expressions, like those used for ObjC messenger dispatches. */
3139 {
3143 function);
3145 {
3148 function);
3150 }
3151 else
3155 }
3160 /* fntype now gets the type of function pointed to. */
3163 /* Convert the parameters to the types declared in the
3164 function prototype, or apply default promotions. */
3171 /* Check that the function is called through a compatible prototype.
3172 If it is not, warn. */
3177 {
3180 /* This situation leads to run-time undefined behavior. We can't,
3181 therefore, simply error unless we can prove that all possible
3182 executions of the program must execute the code. */
3189 }
3193 /* Check that arguments to builtin functions match the expectations. */
3200 /* Check that the arguments to the function are valid. */
3206 {
3208 result
3211 else
3217 }
3218 else
3221 /* If -Wnonnull warning has been diagnosed, avoid diagnosing it again
3222 later. */
3226 /* In this improbable scenario, a nested function returns a VM type.
3227 Create a TARGET_EXPR so that the call always has a LHS, much as
3228 what the C++ FE does for functions returning non-PODs. */
3230 {
3234 }
3237 {
3242 }
3244 }
3246 /* Like build_function_call_vec, but call also resolve_overloaded_builtin. */
3248 tree
3252 {
3253 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
3256 /* Convert anything with function type to a pointer-to-function. */
3258 {
3259 /* Implement type-directed function overloading for builtins.
3260 resolve_overloaded_builtin and targetm.resolve_overloaded_builtin
3261 handle all the type checking. The result is a complete expression
3262 that implements this function call. */
3266 }
3268 }
3269 \f
3270 /* Helper for convert_arguments called to convert the VALue of argument
3271 number ARGNUM from ORIGTYPE to the corresponding parameter number
3272 PARMNUM and TYPE.
3273 PLOC is the location where the conversion is being performed.
3274 FUNCTION and FUNDECL are the same as in convert_arguments.
3275 VALTYPE is the original type of VAL before the conversion and,
3276 for EXCESS_PRECISION_EXPR, the operand of the expression.
3277 NPC is true if VAL represents the null pointer constant (VAL itself
3278 will have been folded to an integer constant).
3279 RNAME is the same as FUNCTION except in Objective C when it's
3280 the function selector.
3281 EXCESS_PRECISION is true when VAL was originally represented
3282 as EXCESS_PRECISION_EXPR.
3283 WARNOPT is the same as in convert_for_assignment. */
3285 static tree
3290 {
3291 /* Formal parm type is specified by a function prototype. */
3294 {
3298 }
3300 /* Optionally warn about conversions that differ from the default
3301 conversions. */
3303 {
3309 "passing argument %d of %qE as integer rather "
3315 "passing argument %d of %qE as integer rather "
3321 "passing argument %d of %qE as complex rather "
3327 "passing argument %d of %qE as floating rather "
3333 "passing argument %d of %qE as complex rather "
3339 "passing argument %d of %qE as floating rather "
3342 /* ??? At some point, messages should be written about
3343 conversions between complex types, but that's too messy
3344 to do now. */
3347 {
3348 /* Warn if any argument is passed as `float',
3349 since without a prototype it would be `double'. */
3353 "passing argument %d of %qE as %<float%> "
3357 /* Warn if mismatch between argument and prototype
3358 for decimal float types. Warn of conversions with
3359 binary float types and of precision narrowing due to
3360 prototype. */
3368 && (formal_prec
3371 && (valtype
3372 != dfloat64_type_node
3373 && (valtype
3376 && (valtype
3379 "passing argument %d of %qE as %qT "
3383 }
3384 /* Detect integer changing in width or signedness.
3385 These warnings are only activated with
3386 -Wtraditional-conversion, not with -Wtraditional. */
3390 {
3399 /* No warning if function asks for enum
3400 and the actual arg is that enum type. */
3401 ;
3404 "passing argument %d of %qE "
3408 ;
3409 /* Don't complain if the formal parameter type
3410 is an enum, because we can't tell now whether
3411 the value was an enum--even the same enum. */
3413 ;
3416 /* Change in signedness doesn't matter
3417 if a constant value is unaffected. */
3418 ;
3419 /* If the value is extended from a narrower
3420 unsigned type, it doesn't matter whether we
3421 pass it as signed or unsigned; the value
3422 certainly is the same either way. */
3425 ;
3428 "passing argument %d of %qE "
3431 else
3433 "passing argument %d of %qE "
3436 }
3437 }
3439 /* Possibly restore an EXCESS_PRECISION_EXPR for the
3440 sake of better warnings from convert_and_check. */
3455 }
3457 /* Convert the argument expressions in the vector VALUES
3458 to the types in the list TYPELIST.
3460 If TYPELIST is exhausted, or when an element has NULL as its type,
3461 perform the default conversions.
3463 ORIGTYPES is the original types of the expressions in VALUES. This
3464 holds the type of enum values which have been converted to integral
3465 types. It may be NULL.
3467 FUNCTION is a tree for the called function. It is used only for
3468 error messages, where it is formatted with %qE.
3470 This is also where warnings about wrong number of args are generated.
3472 ARG_LOC are locations of function arguments (if any).
3474 Returns the actual number of arguments processed (which may be less
3475 than the length of VALUES in some error situations), or -1 on
3476 failure. */
3478 static int
3482 {
3489 tree selector;
3491 /* Change pointer to function to the function itself for
3492 diagnostics. */
3497 /* Handle an ObjC selector specially for diagnostics. */
3500 /* For a call to a built-in function declared without a prototype,
3501 set to the built-in function's argument list. */
3504 /* For type-generic built-in functions, determine whether excess
3505 precision should be removed (classification) or not
3506 (comparison). */
3509 {
3512 {
3513 /* For a call to a built-in function declared without a prototype
3514 use the types of the parameters of the internal built-in to
3515 match those of the arguments to. */
3518 }
3520 /* For type-generic built-in functions, determine whether excess
3521 precision should be removed (classification) or not
3522 (comparison). */
3525 {
3538 /* The last argument of these type-generic builtins
3539 should not be promoted. */
3545 }
3546 }
3548 /* Scan the given expressions (VALUES) and types (TYPELIST), producing
3549 individual converted arguments. */
3557 {
3558 /* The type of the function parameter (if it was declared with one). */
3560 /* The type of the built-in function parameter (if the function
3561 is a built-in). Used to detect type incompatibilities in
3562 calls to built-ins declared without a prototype. */
3563 tree builtin_type = (builtin_typetail
3565 /* The original type of the argument being passed to the function. */
3567 /* The called function (or function selector in Objective C). */
3571 /* Set for EXCESS_PRECISION_EXPR arguments. */
3573 /* The value of the argument after conversion to the type
3574 of the function parameter it is passed to. */
3575 tree parmval;
3576 /* Some __atomic_* builtins have additional hidden argument at
3577 position 0. */
3578 location_t ploc
3584 {
3587 else
3591 }
3594 {
3596 "too many arguments to built-in function %qE "
3600 }
3603 {
3606 }
3608 /* Determine if VAL is a null pointer constant before folding it. */
3611 /* If there is excess precision and a prototype, convert once to
3612 the required type rather than converting via the semantic
3613 type. Likewise without a prototype a float value represented
3614 as long double should be converted once to double. But for
3615 type-generic classification functions excess precision must
3616 be removed here. */
3619 {
3622 }
3628 /* Some floating-point arguments must be promoted to double when
3629 no type is specified by a prototype. This applies to
3630 arguments of type float, and to architecture-specific types
3631 (ARM __fp16), but not to _FloatN or _FloatNx types. */
3640 {
3641 /* Promote this argument, unless it has a _FloatN or
3642 _FloatNx type. */
3646 {
3649 }
3650 }
3653 {
3658 }
3660 {
3663 else
3664 {
3665 /* Convert `float' to `double'. */
3668 "implicit conversion from %qT to %qT when passing "
3672 }
3673 }
3676 /* A "double" argument with excess precision being passed
3677 without a prototype or in variable arguments.
3678 The last argument of __builtin_*_overflow_p should not be
3679 promoted. */
3683 {
3686 }
3688 {
3690 }
3691 else
3692 /* Convert `short' and `char' to full-size `int'. */
3700 {
3701 /* For a call to a built-in function declared without a prototype,
3702 perform the conversions from the argument to the expected type
3703 but issue warnings rather than errors for any mismatches.
3704 Ignore the converted argument and use the PARMVAL obtained
3705 above by applying default conversions instead. */
3709 excess_precision,
3710 OPT_Wbuiltin_declaration_mismatch);
3711 }
3718 }
3723 {
3727 }
3730 {
3736 "too few arguments to built-in function %qE "
3739 }
3742 }
3743 \f
3744 /* This is the entry point used by the parser to build unary operators
3745 in the input. CODE, a tree_code, specifies the unary operator, and
3746 ARG is the operand. For unary plus, the C parser currently uses
3747 CONVERT_EXPR for code.
3749 LOC is the location to use for the tree generated.
3750 */
3752 struct c_expr
3754 {
3761 {
3763 }
3764 else
3765 {
3770 }
3772 /* We are typically called when parsing a prefix token at LOC acting on
3773 ARG. Reflect this by updating the source range of the result to
3774 start at LOC and end at the end of ARG. */
3779 }
3781 /* Returns true if TYPE is a character type, *not* including wchar_t. */
3783 bool
3785 {
3791 }
3793 /* This is the entry point used by the parser to build binary operators
3794 in the input. CODE, a tree_code, specifies the binary operator, and
3795 ARG1 and ARG2 are the operands. In addition to constructing the
3796 expression, we check for operands that were written with other binary
3797 operators in a way that is likely to confuse the user.
3799 LOCATION is the location of the binary operator. */
3801 struct c_expr
3804 {
3822 {
3827 }
3836 /* Check for cases such as x+y<<z which users are likely
3837 to misinterpret. */
3847 {
3851 {
3855 else
3857 }
3859 {
3863 else
3865 }
3868 }
3874 /* Avoid warning for !!x == y. */
3877 {
3878 /* Avoid warning for !b == y where b has _Bool type. */
3883 {
3885 do
3886 {
3893 else
3895 }
3897 }
3900 }
3902 /* Warn about comparisons against string literals, with the exception
3903 of testing for equality or inequality of a string literal with NULL. */
3905 {
3912 /* Warn for ptr == '\0', it's likely that it should've been ptr[0]. */
3916 {
3917 auto_diagnostic_group d;
3919 "comparison between pointer and zero character "
3923 }
3927 {
3928 auto_diagnostic_group d;
3930 "comparison between pointer and zero character "
3934 }
3935 }
3946 /* Warn about comparisons of different enum types. */
3957 }
3958 \f
3959 /* Return a tree for the difference of pointers OP0 and OP1.
3960 The resulting tree has type ptrdiff_t. If POINTER_SUBTRACT sanitization is
3961 enabled, assign to INSTRUMENT_EXPR call to libsanitizer. */
3963 static tree
3965 {
3975 /* If the operands point into different address spaces, we need to
3976 explicitly convert them to pointers into the common address space
3977 before we can subtract the numerical address values. */
3979 {
3980 addr_space_t as_common;
3981 tree common_type;
3983 /* Determine the common superset address space. This is guaranteed
3984 to exist because the caller verified that comp_target_types
3985 returned non-zero. */
3992 }
3994 /* Determine integer type result of the subtraction. This will usually
3995 be the same as the result type (ptrdiff_t), but may need to be a wider
3996 type if pointers for the address space are wider than ptrdiff_t. */
3999 else
4011 {
4017 }
4019 /* First do the subtraction, then build the divide operator
4020 and only convert at the very end.
4021 Do not do default conversions in case restype is a short type. */
4023 /* POINTER_DIFF_EXPR requires a signed integer type of the same size as
4024 pointers. If some platform cannot provide that, or has a larger
4025 ptrdiff_type to support differences larger than half the address
4026 space, cast the pointers to some larger integer type and do the
4027 computations in that type. */
4031 else
4032 {
4033 /* Cast away qualifiers. */
4037 }
4039 /* This generates an error if op1 is pointer to incomplete type. */
4052 /* Divide by the size, in easiest possible way. */
4056 /* Convert to final result type if necessary. */
4058 }
4059 \f
4060 /* Expand atomic compound assignments into an appropriate sequence as
4061 specified by the C11 standard section 6.5.16.2.
4063 _Atomic T1 E1
4064 T2 E2
4065 E1 op= E2
4067 This sequence is used for all types for which these operations are
4068 supported.
4070 In addition, built-in versions of the 'fe' prefixed routines may
4071 need to be invoked for floating point (real, complex or vector) when
4072 floating-point exceptions are supported. See 6.5.16.2 footnote 113.
4074 T1 newval;
4075 T1 old;
4076 T1 *addr
4077 T2 val
4078 fenv_t fenv
4080 addr = &E1;
4081 val = (E2);
4082 __atomic_load (addr, &old, SEQ_CST);
4083 feholdexcept (&fenv);
4084 loop:
4085 newval = old op val;
4086 if (__atomic_compare_exchange_strong (addr, &old, &newval, SEQ_CST,
4087 SEQ_CST))
4088 goto done;
4089 feclearexcept (FE_ALL_EXCEPT);
4090 goto loop:
4091 done:
4092 feupdateenv (&fenv);
4094 The compiler will issue the __atomic_fetch_* built-in when possible,
4095 otherwise it will generate the generic form of the atomic operations.
4096 This requires temp(s) and has their address taken. The atomic processing
4097 is smart enough to figure out when the size of an object can utilize
4098 a lock-free version, and convert the built-in call to the appropriate
4099 lock-free routine. The optimizers will then dispose of any temps that
4100 are no longer required, and lock-free implementations are utilized as
4101 long as there is target support for the required size.
4103 If the operator is NOP_EXPR, then this is a simple assignment, and
4104 an __atomic_store is issued to perform the assignment rather than
4105 the above loop. */
4107 /* Build an atomic assignment at LOC, expanding into the proper
4108 sequence to store LHS MODIFYCODE= RHS. Return a value representing
4109 the result of the operation, unless RETURN_OLD_P, in which case
4110 return the old value of LHS (this is only for postincrement and
4111 postdecrement). */
4113 static tree
4116 {
4129 tree nonatomic_rhs_semantic_type;
4130 tree rhs_type;
4137 /* Allocate enough vector items for a compare_exchange. */
4140 /* Create a compound statement to hold the sequence of statements
4141 with a loop. */
4143 {
4146 /* For consistency with build_modify_expr on non-_Atomic,
4147 mark the lhs as read. Also, it would be very hard to match
4148 such expressions in mark_exp_read. */
4150 }
4152 /* Remove any excess precision (which is only present here in the
4153 case of compound assignments). */
4155 {
4158 }
4161 /* Fold the RHS if it hasn't already been folded. */
4165 /* Remove the qualifiers for the rest of the expressions and create
4166 the VAL temp variable to hold the RHS. */
4170 TYPE_UNQUALIFIED);
4175 NULL_TREE);
4181 /* NOP_EXPR indicates it's a straight store of the RHS. Simply issue
4182 an atomic_store. */
4184 {
4186 /* Build __atomic_store (&lhs, &val, SEQ_CST) */
4197 /* VAL is the value which was stored, return a COMPOUND_STMT of
4198 the statement and that value. */
4200 }
4202 /* Attempt to implement the atomic operation as an __atomic_fetch_* or
4203 __atomic_*_fetch built-in rather than a CAS loop. atomic_bool type
4204 isn't applicable for such builtins. ??? Do we want to handle enums? */
4207 {
4208 built_in_function fncode;
4210 {
4213 fncode = (return_old_p
4214 ? BUILT_IN_ATOMIC_FETCH_ADD_N
4218 fncode = (return_old_p
4219 ? BUILT_IN_ATOMIC_FETCH_SUB_N
4223 fncode = (return_old_p
4224 ? BUILT_IN_ATOMIC_FETCH_AND_N
4228 fncode = (return_old_p
4229 ? BUILT_IN_ATOMIC_FETCH_OR_N
4233 fncode = (return_old_p
4234 ? BUILT_IN_ATOMIC_FETCH_XOR_N
4239 }
4241 /* We can only use "_1" through "_16" variants of the atomic fetch
4242 built-ins. */
4247 /* If this is a pointer type, we need to multiply by the size of
4248 the pointer target type. */
4250 {
4252 /* ??? This would introduce -Wdiscarded-qualifiers
4253 warning: __atomic_fetch_* expect volatile void *
4254 type as the first argument. (Assignments between
4255 atomic and non-atomic objects are OK.) */
4262 }
4264 /* Build __atomic_fetch_* (&lhs, &val, SEQ_CST), or
4265 __atomic_*_fetch (&lhs, &val, SEQ_CST). */
4280 /* Finish the compound statement. */
4283 /* NEWVAL is the value which was stored, return a COMPOUND_STMT of
4284 the statement and that value. */
4286 }
4288 cas_loop:
4289 /* Create the variables and labels required for the op= form. */
4306 /* __atomic_load (addr, &old, SEQ_CST). */
4313 NULL_TREE);
4317 /* Create the expressions for floating-point environment
4318 manipulation, if required. */
4328 /* loop: */
4331 /* newval = old + val; */
4336 {
4340 }
4341 else
4347 {
4349 NULL_TREE);
4352 }
4354 /* if (__atomic_compare_exchange (addr, &old, &new, false, SEQ_CST, SEQ_CST))
4355 goto done; */
4375 /* goto loop; */
4380 /* done: */
4386 /* Finish the compound statement. */
4389 /* NEWVAL is the value that was successfully stored, return a
4390 COMPOUND_EXPR of the statement and the appropriate value. */
4393 }
4395 /* Construct and perhaps optimize a tree representation
4396 for a unary operation. CODE, a tree_code, specifies the operation
4397 and XARG is the operand.
4398 For any CODE other than ADDR_EXPR, NOCONVERT suppresses the default
4399 promotions (such as from short to int).
4400 For ADDR_EXPR, the default promotions are not applied; NOCONVERT allows
4401 non-lvalues; this is only used to handle conversion of non-lvalue arrays
4402 to pointers in C99.
4404 LOCATION is the location of the operator. */
4406 tree
4409 {
4410 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
4414 tree val;
4435 {
4438 }
4441 {
4444 }
4447 {
4449 /* This is used for unary plus, because a CONVERT_EXPR
4450 is enough to prevent anybody from looking inside for
4451 associativity, but won't generate any code. */
4455 {
4458 }
4468 {
4471 }
4477 /* ~ works on integer types and non float vectors. */
4481 {
4484 /* Warn if the expression has boolean value. */
4490 {
4491 auto_diagnostic_group d;
4494 {
4498 }
4499 }
4502 }
4504 {
4510 }
4511 else
4512 {
4515 }
4520 {
4523 }
4530 {
4533 }
4539 /* Conjugating a real value is a no-op, but allow it anyway. */
4542 {
4545 }
4554 {
4558 }
4560 {
4563 }
4564 else
4567 /* If the TRUTH_NOT_EXPR has been folded, reset the location. */
4587 {
4590 noconvert);
4598 }
4600 /* Complain about anything that is not a true lvalue. In
4601 Objective-C, skip this check for property_refs. */
4606 ? lv_increment
4611 {
4615 else
4618 }
4621 {
4625 else
4628 }
4630 /* Ensure the argument is fully folded inside any SAVE_EXPR. */
4636 /* Increment or decrement the real part of the value,
4637 and don't change the imaginary part. */
4639 {
4646 {
4658 }
4659 }
4661 /* Report invalid types. */
4667 {
4670 else
4674 }
4676 {
4677 tree inc;
4681 /* Compute the increment. */
4684 {
4685 /* If pointer target is an incomplete type,
4686 we just cannot know how to do the arithmetic. */
4688 {
4693 else
4697 }
4700 {
4704 else
4707 }
4708 else
4714 }
4716 {
4717 /* For signed fract types, we invert ++ to -- or
4718 -- to ++, and change inc from 1 to -1, because
4719 it is not possible to represent 1 in signed fract constants.
4720 For unsigned fract types, the result always overflows and
4721 we get an undefined (original) or the maximum value. */
4733 }
4734 else
4735 {
4740 }
4742 /* If 'arg' is an Objective-C PROPERTY_REF expression, then we
4743 need to ask Objective-C to build the increment or decrement
4744 expression for it. */
4749 /* Report a read-only lvalue. */
4751 {
4757 }
4764 /* If the argument is atomic, use the special code sequences for
4765 atomic compound assignment. */
4767 {
4772 ? PLUS_EXPR
4775 ? inc
4780 }
4784 else
4789 }
4792 /* Note that this operation never does default_conversion. */
4794 /* The operand of unary '&' must be an lvalue (which excludes
4795 expressions of type void), or, in C99, the result of a [] or
4796 unary '*' operator. */
4802 /* Let &* cancel out to simplify resulting code. */
4804 {
4805 /* Don't let this be an lvalue. */
4810 }
4812 /* Anything not already handled and not a true memory reference
4813 or a non-lvalue array is an error. */
4818 /* Move address operations inside C_MAYBE_CONST_EXPR to simplify
4819 folding later. */
4821 {
4824 noconvert);
4831 }
4833 /* Ordinary case; arg is a COMPONENT_REF or a decl. */
4836 /* If the lvalue is const or volatile, merge that into the type
4837 to which the address will point. This is only needed
4838 for function types. */
4842 {
4852 }
4855 {
4858 {
4862 }
4864 /* fall through */
4868 {
4872 {
4876 }
4881 "address of array with reverse scalar storage "
4883 }
4887 }
4897 /* ??? Cope with user tricks that amount to offsetof. Delete this
4898 when we have proper support for integer constant expressions. */
4902 {
4905 }
4914 }
4919 ret = (require_constant_value
4922 else
4924 return_build_unary_op:
4935 }
4937 /* Return nonzero if REF is an lvalue valid for this language.
4938 Lvalues can be assigned, unless their type has TYPE_READONLY.
4939 Lvalues can have their address taken, unless they have C_DECL_REGISTER. */
4941 bool
4943 {
4947 {
4974 }
4975 }
4976 \f
4977 /* Give a warning for storing in something that is read-only in GCC
4978 terms but not const in ISO C terms. */
4980 static void
4982 {
4984 {
4996 }
4998 }
5001 /* Return nonzero if REF is an lvalue valid for this language;
5002 otherwise, print an error message and return zero. USE says
5003 how the lvalue is being used and so selects the error message.
5004 LOCATION is the location at which any error should be reported. */
5006 static int
5008 {
5015 }
5016 \f
5017 /* Mark EXP saying that we need to be able to take the
5018 address of it; it should not be allocated in a register.
5019 Returns true if successful. ARRAY_REF_P is true if this
5020 is for ARRAY_REF construction - in that case we don't want
5021 to look through VIEW_CONVERT_EXPR from VECTOR_TYPE to ARRAY_TYPE,
5022 it is fine to use ARRAY_REFs for vector subscripts on vector
5023 register variables. */
5025 bool
5027 {
5032 {
5043 {
5047 }
5048 /* FALLTHRU */
5071 {
5073 {
5074 error
5077 }
5079 }
5081 {
5084 else
5087 }
5089 /* FALLTHRU */
5092 /* FALLTHRU */
5095 }
5096 }
5097 \f
5098 /* Convert EXPR to TYPE, warning about conversion problems with
5099 constants. SEMANTIC_TYPE is the type this conversion would use
5100 without excess precision. If SEMANTIC_TYPE is NULL, this function
5101 is equivalent to convert_and_check. This function is a wrapper that
5102 handles conversions that may be different than
5103 the usual ones because of excess precision. */
5105 static tree
5107 tree semantic_type)
5108 {
5112 /* For C11, integer conversions may have results with excess
5113 precision. */
5119 {
5120 /* For integers, we need to check the real conversion, not
5121 the conversion to the excess precision type. */
5123 }
5124 /* Result type is the excess precision type, which should be
5125 large enough, so do not check. */
5127 }
5129 /* If EXPR refers to a built-in declared without a prototype returns
5130 the actual type of the built-in and, if non-null, set *BLTIN to
5131 a pointer to the built-in. Otherwise return the type of EXPR
5132 and clear *BLTIN if non-null. */
5134 static tree
5136 {
5137 tree dummy;
5161 }
5163 /* Build and return a conditional expression IFEXP ? OP1 : OP2. If
5164 IFEXP_BCP then the condition is a call to __builtin_constant_p, and
5165 if folded to an integer constant then the unselected half may
5166 contain arbitrary operations not normally permitted in constant
5167 expressions. Set the location of the expression to LOC. */
5169 tree
5173 {
5174 tree type1;
5175 tree type2;
5183 tree ret;
5195 /* Promote both alternatives. */
5220 /* C90 does not permit non-lvalue arrays in conditional expressions.
5221 In C99 they will be pointers by now. */
5223 {
5226 }
5234 {
5237 {
5241 }
5243 {
5247 }
5248 }
5251 {
5262 }
5264 /* Quickly detect the usual case where op1 and op2 have the same type
5265 after promotion. */
5267 {
5270 else
5272 }
5277 {
5278 /* In C11, a conditional expression between a floating-point
5279 type and an integer type should convert the integer type to
5280 the evaluation format of the floating-point type, with
5281 possible excess precision. */
5285 {
5286 tree eptype;
5289 {
5293 }
5296 {
5300 }
5301 }
5306 "implicit conversion from %qT to %qT to "
5308 colon_loc);
5310 /* If -Wsign-compare, warn here if type1 and type2 have
5311 different signedness. We'll promote the signed to unsigned
5312 and later code won't know it used to be different.
5313 Do this check on the original types, so that explicit casts
5314 will be considered, but default promotions won't. */
5316 {
5321 {
5324 /* Do not warn if the result type is signed, since the
5325 signed type will only be chosen if it can represent
5326 all the values of the unsigned type. */
5329 else
5330 {
5334 /* Do not warn if the signed quantity is an
5335 unsuffixed integer literal (or some static
5336 constant expression involving such literals) and
5337 it is non-negative. This warning requires the
5338 operands to be folded for best results, so do
5339 that folding in this case even without
5340 warn_sign_compare to avoid warning options
5341 possibly affecting code generation. */
5342 c_inhibit_evaluation_warnings
5346 c_inhibit_evaluation_warnings
5349 c_inhibit_evaluation_warnings
5353 c_inhibit_evaluation_warnings
5357 {
5360 || (unsigned_op1
5365 "operand of %<?:%> changes signedness from "
5366 "%qT to %qT due to unsignedness of other "
5369 else
5371 "operand of %<?:%> changes signedness from "
5372 "%qT to %qT due to unsignedness of other "
5375 }
5380 }
5381 }
5382 }
5383 }
5385 {
5390 }
5392 {
5395 addr_space_t as_common;
5404 {
5408 }
5411 {
5416 "pointer to array loses qualifier "
5421 "ISO C forbids conditional expr between "
5425 }
5428 {
5433 "pointer to array loses qualifier "
5438 "ISO C forbids conditional expr between "
5442 }
5443 /* Objective-C pointer comparisons are a bit more lenient. */
5446 else
5447 {
5451 "pointer type mismatch between %qT and %qT "
5454 else
5457 result_type = build_pointer_type
5459 }
5460 }
5462 {
5466 else
5467 {
5469 }
5471 }
5473 {
5477 else
5478 {
5480 }
5482 }
5485 {
5488 else
5489 {
5492 }
5493 }
5495 /* Merge const and volatile flags of the incoming types. */
5496 result_type
5502 semantic_result_type);
5504 semantic_result_type);
5507 {
5510 }
5512 {
5515 }
5517 && op1_int_operands
5520 {
5527 }
5529 /* Need to convert condition operand into a vector mask. */
5531 {
5538 }
5542 else
5543 {
5545 {
5546 /* Use c_fully_fold here, since C_MAYBE_CONST_EXPR might be
5547 nested inside of the expression. */
5550 }
5554 }
5560 /* If the OP1 and OP2 are the same and don't have side-effects,
5561 warn here, because the COND_EXPR will be turned into OP1. */
5569 }
5570 \f
5571 /* EXPR is an expression, location LOC, whose result is discarded.
5572 Warn if it is a call to a nodiscard function (or a COMPOUND_EXPR
5573 whose right-hand operand is such a call, possibly recursively). */
5575 static void
5577 {
5581 {
5585 }
5591 tree attr;
5596 {
5601 auto_diagnostic_group d;
5605 "ignoring return value of %qD, declared with "
5607 else
5609 "ignoring return value of %qD, declared with "
5613 }
5614 else
5615 {
5623 auto_diagnostic_group d;
5627 "ignoring return value of type %qT, declared "
5630 else
5632 "ignoring return value of type %qT, declared "
5635 {
5637 {
5642 }
5643 }
5644 }
5645 }
5647 /* Return a compound expression that performs two expressions and
5648 returns the value of the second of them.
5650 LOC is the location of the COMPOUND_EXPR. */
5652 tree
5654 {
5657 tree ret;
5669 {
5672 }
5675 {
5676 /* The left-hand operand of a comma expression is like an expression
5677 statement: with -Wunused, we should warn if it doesn't have
5678 any side-effects, unless it was explicitly cast to (void). */
5680 {
5688 else
5691 }
5692 }
5695 {
5699 {
5703 }
5709 }
5711 /* With -Wunused, we should also warn if the left-hand operand does have
5712 side-effects, but computes a value which is not used. For example, in
5713 `foo() + bar(), baz()' the result of the `+' operator is not used,
5714 so we should issue a warning. */
5726 && expr1_int_operands
5735 }
5737 /* Issue -Wcast-qual warnings when appropriate. TYPE is the type to
5738 which we are casting. OTYPE is the type of the expression being
5739 cast. Both TYPE and OTYPE are pointer types. LOC is the location
5740 of the cast. -Wcast-qual appeared on the command line. Named
5741 address space qualifiers are not handled here, because they result
5742 in different warnings. */
5744 static void
5746 {
5753 /* Check that the qualifiers on IN_TYPE are a superset of the
5754 qualifiers of IN_OTYPE. The outermost level of POINTER_TYPE
5755 nodes is uninteresting and we stop as soon as we hit a
5756 non-POINTER_TYPE node on either type. */
5757 do
5758 {
5762 /* GNU C allows cv-qualified function types. 'const' means the
5763 function is very pure, 'volatile' means it can't return. We
5764 need to warn when such qualifiers are added, not when they're
5765 taken away. */
5770 else
5773 }
5782 /* There are qualifiers present in IN_OTYPE that are not present
5783 in IN_TYPE. */
5786 discarded);
5791 /* A cast from **T to const **T is unsafe, because it can cause a
5792 const value to be changed with no additional warning. We only
5793 issue this warning if T is the same on both sides, and we only
5794 issue the warning if there are the same number of pointers on
5795 both sides, as otherwise the cast is clearly unsafe anyhow. A
5796 cast is unsafe when a qualifier is added at one level and const
5797 is not present at all outer levels.
5799 To issue this warning, we check at each level whether the cast
5800 adds new qualifiers not already seen. We don't need to special
5801 case function types, as they won't have the same
5802 TYPE_MAIN_VARIANT. */
5812 do
5813 {
5818 {
5820 "to be safe all intermediate pointers in cast from "
5824 }
5827 }
5829 }
5831 /* Heuristic check if two parameter types can be considered ABI-equivalent. */
5833 static bool
5835 {
5843 /* The signedness of the parameter matters only when an integral
5844 type smaller than int is promoted to int, otherwise only the
5845 precision of the parameter matters.
5846 This check should make sure that the callee does not see
5847 undefined values in argument registers. */
5857 }
5859 /* Check if a type cast between two function types can be considered safe. */
5861 static bool
5863 {
5882 }
5884 /* Build an expression representing a cast to type TYPE of expression EXPR.
5885 LOC is the location of the cast-- typically the open paren of the cast. */
5887 tree
5889 {
5890 tree value;
5904 /* The ObjC front-end uses TYPE_MAIN_VARIANT to tie together types differing
5905 only in <protocol> qualifications. But when constructing cast expressions,
5906 the protocols do matter and must be kept around. */
5913 {
5916 }
5919 {
5922 }
5925 {
5929 }
5932 {
5937 /* Convert to remove any qualifiers from VALUE's type. */
5939 }
5941 {
5942 tree field;
5951 {
5952 tree t;
5964 }
5967 }
5968 else
5969 {
5973 {
5977 }
5981 /* Optionally warn about potentially worrisome casts. */
5987 /* Warn about conversions between pointers to disjoint
5988 address spaces. */
5992 {
5995 addr_space_t as_common;
5998 {
6009 else
6014 }
6015 }
6017 /* Warn about possible alignment problems. */
6023 /* Don't warn about opaque types, where the actual alignment
6024 restriction is unknown. */
6035 /* Unlike conversion of integers to pointers, where the
6036 warning is disabled for converting constants because
6037 of cases such as SIG_*, warn about converting constant
6038 pointers to integers. In some cases it may cause unwanted
6039 sign extension, and a warning is appropriate. */
6046 "cast from function call of type %qT "
6052 /* Don't warn about converting any constant. */
6061 /* If pedantic, warn for conversions between function and object
6062 pointer types, except for converting a null pointer constant
6063 to function pointer type. */
6088 "cast between incompatible function types"
6094 /* Ignore any integer overflow caused by the cast. */
6096 {
6098 {
6100 {
6101 /* Avoid clobbering a shared constant. */
6104 }
6105 }
6107 /* Reset VALUE's overflow flags, ensuring constant sharing. */
6109 }
6110 }
6112 /* Don't let a cast be an lvalue. */
6116 /* Don't allow the results of casting to floating-point or complex
6117 types be confused with actual constants, or casts involving
6118 integer and pointer types other than direct integer-to-integer
6119 and integer-to-pointer be confused with integer constant
6120 expressions and null pointer constants. */
6130 /* If the expression has integer operands and so can occur in an
6131 unevaluated part of an integer constant expression, ensure the
6132 return value reflects this. */
6141 }
6143 /* Interpret a cast of expression EXPR to type TYPE. LOC is the
6144 location of the open paren of the cast, or the position of the cast
6145 expr. */
6146 tree
6148 {
6149 tree type;
6152 tree ret;
6155 /* This avoids warnings about unprototyped casts on
6156 integers. E.g. "#define SIG_DFL (void(*)())0". */
6168 {
6175 }
6180 /* C++ does not permits types to be defined in a cast, but it
6181 allows references to incomplete types. */
6187 }
6188 \f
6189 /* Build an assignment expression of lvalue LHS from value RHS.
6190 If LHS_ORIGTYPE is not NULL, it is the original type of LHS, which
6191 may differ from TREE_TYPE (LHS) for an enum bitfield.
6192 MODIFYCODE is the code for a binary operator that we use
6193 to combine the old value of LHS with RHS to get the new value.
6194 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
6195 If RHS_ORIGTYPE is not NULL_TREE, it is the original type of RHS,
6196 which may differ from TREE_TYPE (RHS) for an enum value.
6198 LOCATION is the location of the MODIFYCODE operator.
6199 RHS_LOC is the location of the RHS. */
6201 tree
6205 {
6206 tree result;
6207 tree newrhs;
6214 /* Types that aren't fully specified cannot be used in assignments. */
6217 /* Avoid duplicate error messages from operands that had errors. */
6221 /* Ensure an error for assigning a non-lvalue array to an array in
6222 C90. */
6224 {
6227 }
6229 /* For ObjC properties, defer this check. */
6238 {
6241 rhs_origtype);
6250 }
6252 /* If a binary op has been requested, combine the old LHS value with the RHS
6253 producing the value we should actually store into the LHS. */
6256 {
6260 /* Construct the RHS for any non-atomic compound assignemnt. */
6262 {
6263 /* If in LHS op= RHS the RHS has side-effects, ensure they
6264 are preevaluated before the rest of the assignment expression's
6265 side-effects, because RHS could contain e.g. function calls
6266 that modify LHS. */
6268 {
6271 else
6276 newrhs);
6277 }
6281 /* The original type of the right hand side is no longer
6282 meaningful. */
6284 }
6285 }
6288 {
6289 /* Check if we are modifying an Objective-C property reference;
6290 if so, we need to generate setter calls. */
6293 else
6298 /* Else, do the check that we postponed for Objective-C. */
6301 }
6303 /* Give an error for storing in something that is 'const'. */
6308 {
6311 }
6315 /* If storing into a structure or union member,
6316 it has probably been given type `int'.
6317 Compute the type that would go with
6318 the actual amount of storage the member occupies. */
6327 /* If storing in a field that is in actuality a short or narrower than one,
6328 we must store in the field in its actual type. */
6331 {
6334 }
6336 /* Issue -Wc++-compat warnings about an assignment to an enum type
6337 when LHS does not have its original type. This happens for,
6338 e.g., an enum bitfield in a struct. */
6343 {
6345 ? rhs_origtype
6352 }
6354 /* Remove qualifiers. */
6358 /* Convert new value to destination type. Fold it first, then
6359 restore any excess precision information, for the sake of
6360 conversion warnings. */
6363 {
6366 {
6368 {
6371 }
6376 }
6377 else
6384 }
6386 /* Emit ObjC write barrier, if necessary. */
6388 {
6391 {
6394 }
6395 }
6397 /* Scan operands. */
6401 else
6402 {
6406 }
6408 /* If we got the LHS in a different type for storing in,
6409 convert the result back to the nominal type of LHS
6410 so that the value we return always has the same type
6411 as the LHS argument. */
6421 return_result:
6425 }
6426 \f
6427 /* Return whether STRUCT_TYPE has an anonymous field with type TYPE.
6428 This is used to implement -fplan9-extensions. */
6430 static bool
6432 {
6433 tree field;
6441 {
6444 TYPE_QUAL_ATOMIC)
6448 {
6452 }
6456 {
6460 }
6461 }
6463 }
6465 /* RHS is an expression whose type is pointer to struct. If there is
6466 an anonymous field in RHS with type TYPE, then return a pointer to
6467 that field in RHS. This is used with -fplan9-extensions. This
6468 returns NULL if no conversion could be found. */
6470 static tree
6472 {
6476 tree ret;
6485 TYPE_QUAL_ATOMIC)
6493 {
6499 TYPE_QUAL_ATOMIC)
6502 {
6506 }
6508 lhs_main_type))
6509 {
6514 }
6515 }
6522 NULL_TREE);
6526 {
6529 }
6532 }
6534 /* Issue an error message for a bad initializer component.
6535 GMSGID identifies the message.
6536 The component name is taken from the spelling stack. */
6540 {
6543 auto_diagnostic_group d;
6545 /* The gmsgid may be a format string with %< and %>. */
6554 }
6556 /* Issue a pedantic warning for a bad initializer component. OPT is
6557 the option OPT_* (from options.h) controlling this warning or 0 if
6558 it is unconditionally given. GMSGID identifies the message. The
6559 component name is taken from the spelling stack. */
6563 {
6564 /* Use the location where a macro was expanded rather than where
6565 it was defined to make sure macros defined in system headers
6566 but used incorrectly elsewhere are diagnosed. */
6568 auto_diagnostic_group d;
6576 }
6578 /* Issue a warning for a bad initializer component.
6580 OPT is the OPT_W* value corresponding to the warning option that
6581 controls this warning. GMSGID identifies the message. The
6582 component name is taken from the spelling stack. */
6584 static void
6586 {
6590 auto_diagnostic_group d;
6592 /* Use the location where a macro was expanded rather than where
6593 it was defined to make sure macros defined in system headers
6594 but used incorrectly elsewhere are diagnosed. */
6597 /* The gmsgid may be a format string with %< and %>. */
6602 }
6603 \f
6604 /* If TYPE is an array type and EXPR is a parenthesized string
6605 constant, warn if pedantic that EXPR is being used to initialize an
6606 object of type TYPE. */
6608 void
6610 {
6617 }
6619 /* Attempt to locate the parameter with the given index within FNDECL,
6620 returning DECL_SOURCE_LOCATION (FNDECL) if it can't be found. */
6622 static location_t
6624 {
6626 tree param;
6628 /* Locate param by index within DECL_ARGUMENTS (fndecl). */
6632 ;
6634 /* If something went wrong (e.g. if we have a builtin and thus no arguments),
6635 return DECL_SOURCE_LOCATION (FNDECL). */
6640 }
6642 /* Issue a note about a mismatching argument for parameter PARMNUM
6643 to FUNDECL, for types EXPECTED_TYPE and ACTUAL_TYPE.
6644 Attempt to issue the note at the pertinent parameter of the decl;
6645 failing that issue it at the location of FUNDECL; failing that
6646 issue it at PLOC. */
6648 static void
6651 {
6652 location_t loc;
6655 else
6661 }
6663 /* Issue a warning when an argument of ARGTYPE is passed to a built-in
6664 function FUNDECL declared without prototype to parameter PARMNUM of
6665 PARMTYPE when ARGTYPE does not promote to PARMTYPE. */
6667 static void
6670 {
6675 /* Avoid warning for enum arguments that promote to an integer type
6676 of the same size/mode. */
6688 /* This diagnoses even signed/unsigned mismatches. Those might be
6689 safe in many cases but GCC may emit suboptimal code for them so
6690 warning on those cases drives efficiency improvements. */
6694 "in a call to built-in function declared without "
6697 "in a call to built-in function declared without "
6702 fundecl);
6703 }
6705 /* Convert value RHS to type TYPE as preparation for an assignment to
6706 an lvalue of type TYPE. If ORIGTYPE is not NULL_TREE, it is the
6707 original type of RHS; this differs from TREE_TYPE (RHS) for enum
6708 types. NULL_POINTER_CONSTANT says whether RHS was a null pointer
6709 constant before any folding.
6710 The real work of conversion is done by `convert'.
6711 The purpose of this function is to generate error messages
6712 for assignments that are not allowed in C.
6713 ERRTYPE says whether it is argument passing, assignment,
6714 initialization or return.
6716 In the following example, '~' denotes where EXPR_LOC and '^' where
6717 LOCATION point to:
6719 f (var); [ic_argpass]
6720 ^ ~~~
6721 x = var; [ic_assign]
6722 ^ ~~~;
6723 int x = var; [ic_init]
6724 ^^^
6725 return x; [ic_return]
6726 ^
6728 FUNCTION is a tree for the function being called.
6729 PARMNUM is the number of the argument, for printing in error messages.
6730 WARNOPT may be set to a warning option to issue the corresponding warning
6731 rather than an error for invalid conversions. Used for calls to built-in
6732 functions declared without a prototype. */
6734 static tree
6739 {
6742 tree rhstype;
6747 /* Use the expansion point location to handle cases such as user's
6748 function returning a wrong-type macro defined in a system header. */
6752 {
6753 tree selector;
6754 /* Change pointer to function to the function itself for
6755 diagnostics. */
6760 /* Handle an ObjC selector specially for diagnostics. */
6764 {
6767 }
6768 }
6770 /* This macro is used to emit diagnostics to ensure that all format
6771 strings are complete sentences, visible to gettext and checked at
6772 compile time. */
6773 #define PEDWARN_FOR_ASSIGNMENT(LOCATION, PLOC, OPT, AR, AS, IN, RE) \
6774 do { \
6775 switch (errtype) \
6776 { \
6777 case ic_argpass: \
6778 { \
6779 auto_diagnostic_group d; \
6780 if (pedwarn (PLOC, OPT, AR, parmnum, rname)) \
6781 inform_for_arg (fundecl, (PLOC), parmnum, type, rhstype); \
6782 } \
6783 break; \
6784 case ic_assign: \
6785 pedwarn (LOCATION, OPT, AS); \
6786 break; \
6787 case ic_init: \
6788 pedwarn_init (LOCATION, OPT, IN); \
6789 break; \
6790 case ic_return: \
6791 pedwarn (LOCATION, OPT, RE); \
6792 break; \
6793 default: \
6794 gcc_unreachable (); \
6795 } \
6796 } while (0)
6798 /* This macro is used to emit diagnostics to ensure that all format
6799 strings are complete sentences, visible to gettext and checked at
6800 compile time. It is the same as PEDWARN_FOR_ASSIGNMENT but with an
6801 extra parameter to enumerate qualifiers. */
6802 #define PEDWARN_FOR_QUALIFIERS(LOCATION, PLOC, OPT, AR, AS, IN, RE, QUALS) \
6803 do { \
6804 switch (errtype) \
6805 { \
6806 case ic_argpass: \
6807 { \
6808 auto_diagnostic_group d; \
6809 if (pedwarn (PLOC, OPT, AR, parmnum, rname, QUALS)) \
6810 inform_for_arg (fundecl, (PLOC), parmnum, type, rhstype); \
6811 } \
6812 break; \
6813 case ic_assign: \
6814 pedwarn (LOCATION, OPT, AS, QUALS); \
6815 break; \
6816 case ic_init: \
6817 pedwarn (LOCATION, OPT, IN, QUALS); \
6818 break; \
6819 case ic_return: \
6820 pedwarn (LOCATION, OPT, RE, QUALS); \
6821 break; \
6822 default: \
6823 gcc_unreachable (); \
6824 } \
6825 } while (0)
6827 /* This macro is used to emit diagnostics to ensure that all format
6828 strings are complete sentences, visible to gettext and checked at
6829 compile time. It is the same as PEDWARN_FOR_QUALIFIERS but uses
6830 warning_at instead of pedwarn. */
6831 #define WARNING_FOR_QUALIFIERS(LOCATION, PLOC, OPT, AR, AS, IN, RE, QUALS) \
6832 do { \
6833 switch (errtype) \
6834 { \
6835 case ic_argpass: \
6836 { \
6837 auto_diagnostic_group d; \
6838 if (warning_at (PLOC, OPT, AR, parmnum, rname, QUALS)) \
6839 inform_for_arg (fundecl, (PLOC), parmnum, type, rhstype); \
6840 } \
6841 break; \
6842 case ic_assign: \
6843 warning_at (LOCATION, OPT, AS, QUALS); \
6844 break; \
6845 case ic_init: \
6846 warning_at (LOCATION, OPT, IN, QUALS); \
6847 break; \
6848 case ic_return: \
6849 warning_at (LOCATION, OPT, RE, QUALS); \
6850 break; \
6851 default: \
6852 gcc_unreachable (); \
6853 } \
6854 } while (0)
6866 {
6870 {
6886 }
6889 }
6892 {
6898 {
6923 }
6924 }
6927 {
6933 {
6938 }
6939 }
6942 {
6945 }
6948 {
6949 /* Except for passing an argument to an unprototyped function,
6950 this is a constraint violation. When passing an argument to
6951 an unprototyped function, it is compile-time undefined;
6952 making it a constraint in that case was rejected in
6953 DR#252. */
6957 else
6960 }
6968 /* A non-reference type can convert to a reference. This handles
6969 va_start, va_copy and possibly port built-ins. */
6971 {
6973 {
6977 else
6980 }
6997 }
6998 /* Some types can interconvert without explicit casts. */
7002 /* Arithmetic types all interconvert, and enum is treated like int. */
7011 {
7014 rhstype);
7026 }
7028 /* Aggregates in different TUs might need conversion. */
7035 /* Conversion to a transparent union or record from its member types.
7036 This applies only to function arguments. */
7040 {
7044 {
7055 {
7059 /* Any non-function converts to a [const][volatile] void *
7060 and vice versa; otherwise, targets must be the same.
7061 Meanwhile, the lhs target must have all the qualifiers of
7062 the rhs. */
7066 {
7069 /* If this type won't generate any warnings, use it. */
7077 /* Keep looking for a better type, but remember this one. */
7080 }
7081 }
7083 /* Can convert integer zero to any pointer type. */
7085 {
7088 }
7089 }
7092 {
7094 {
7095 /* We have only a marginally acceptable member type;
7096 it needs a warning. */
7100 /* Const and volatile mean something different for function
7101 types, so the usual warnings are not appropriate. */
7104 {
7105 /* Because const and volatile on functions are
7106 restrictions that say the function will not do
7107 certain things, it is okay to use a const or volatile
7108 function where an ordinary one is wanted, but not
7109 vice-versa. */
7113 OPT_Wdiscarded_qualifiers,
7115 "makes %q#v qualified function "
7118 "function pointer from "
7121 "function pointer from "
7126 }
7130 OPT_Wdiscarded_qualifiers,
7142 }
7150 }
7151 }
7153 /* Conversions among pointers */
7156 {
7157 /* If RHS refers to a built-in declared without a prototype
7158 BLTIN is the declaration of the built-in with a prototype
7159 and RHSTYPE is set to the actual type of the built-in. */
7160 tree bltin;
7169 addr_space_t asl;
7170 addr_space_t asr;
7175 TYPE_QUAL_ATOMIC)
7180 TYPE_QUAL_ATOMIC)
7182 /* Opaque pointers are treated like void pointers. */
7185 /* The Plan 9 compiler permits a pointer to a struct to be
7186 automatically converted into a pointer to an anonymous field
7187 within the struct. */
7192 {
7195 {
7201 }
7202 }
7204 /* C++ does not allow the implicit conversion void* -> T*. However,
7205 for the purpose of reducing the number of false positives, we
7206 tolerate the special case of
7208 int *p = NULL;
7210 where NULL is typically defined in C to be '(void *) 0'. */
7213 OPT_Wc___compat,
7214 "request for implicit conversion "
7217 /* See if the pointers point to incompatible address spaces. */
7222 {
7224 {
7226 {
7231 else
7234 }
7236 {
7241 else
7244 }
7246 {
7251 else
7254 }
7256 {
7261 else
7264 }
7267 }
7269 }
7271 /* Check if the right-hand side has a format attribute but the
7272 left-hand side doesn't. */
7275 {
7277 {
7280 "argument %d of %qE might be "
7286 "assignment left-hand side might be "
7291 "initialization left-hand side might be "
7296 "return type might be "
7301 }
7302 }
7304 /* See if the pointers point to incompatible scalar storage orders. */
7308 {
7309 tree t;
7312 {
7314 /* Do not warn for built-in functions, for example memcpy, since we
7315 control how they behave and they can be useful in this area. */
7319 "passing argument %d of %qE from incompatible "
7323 /* Do not warn if the RHS is a call to a function that returns a
7324 pointer that is not an alias. */
7329 "assignment to %qT from pointer type %qT with "
7333 /* Likewise. */
7338 "initialization of %qT from pointer type %qT with "
7343 "returning %qT from pointer type with incompatible "
7348 }
7349 }
7351 /* Any non-function converts to a [const][volatile] void *
7352 and vice versa; otherwise, targets must be the same.
7353 Meanwhile, the lhs target must have all the qualifiers of the rhs. */
7357 || is_opaque_pointer
7363 {
7364 /* Warn about loss of qualifers from pointers to arrays with
7365 qualifiers on the element type. */
7367 {
7374 OPT_Wdiscarded_array_qualifiers,
7384 }
7387 ||
7389 && !null_pointer_constant
7393 "%qE between function pointer "
7401 /* Const and volatile mean something different for function types,
7402 so the usual warnings are not appropriate. */
7405 {
7406 /* Don't warn about loss of qualifier for conversions from
7407 qualified void* to pointers to arrays with corresponding
7408 qualifier on the element type. */
7412 /* Assignments between atomic and non-atomic objects are OK. */
7415 {
7417 OPT_Wdiscarded_qualifiers,
7427 }
7428 /* If this is not a case of ignoring a mismatch in signedness,
7429 no warning. */
7432 ;
7433 /* If there is a mismatch, do warn. */
7436 {
7438 {
7439 auto_diagnostic_group d;
7443 "pointer targets in passing argument %d of "
7446 rhstype);
7447 }
7451 "pointer targets in assignment from %qT to %qT "
7456 "pointer targets in initialization of %qT "
7458 rhstype);
7462 "returning %qT from a function with return type "
7467 }
7468 }
7471 {
7472 /* Because const and volatile on functions are restrictions
7473 that say the function will not do certain things,
7474 it is okay to use a const or volatile function
7475 where an ordinary one is wanted, but not vice-versa. */
7479 OPT_Wdiscarded_qualifiers,
7481 "%q#v qualified function pointer "
7490 }
7491 }
7492 /* Avoid warning about the volatile ObjC EH puts on decls. */
7494 {
7496 {
7498 {
7499 auto_diagnostic_group d;
7503 "passing argument %d of %qE from incompatible "
7506 }
7511 "assignment to %qT from pointer to "
7514 else
7522 "initialization of %qT from pointer to "
7525 else
7527 "initialization of %qT from incompatible "
7534 "returning pointer to %qD of type %qT from "
7537 else
7539 "returning %qT from a function with incompatible "
7544 }
7545 }
7547 /* If RHS isn't an address, check pointer or array of packed
7548 struct or union. */
7552 }
7554 {
7555 /* ??? This should not be an error when inlining calls to
7556 unprototyped functions. */
7560 else
7563 }
7565 {
7566 /* An explicit constant 0 can convert to a pointer,
7567 or one that results from arithmetic, even including
7568 a cast to integer type. */
7571 {
7573 {
7574 auto_diagnostic_group d;
7578 "passing argument %d of %qE makes pointer from "
7581 }
7585 "assignment to %qT from %qT makes pointer from integer "
7590 "initialization of %qT from %qT makes pointer from "
7595 "function with return type %qT makes pointer from "
7600 }
7603 }
7605 {
7607 {
7609 {
7610 auto_diagnostic_group d;
7614 "passing argument %d of %qE makes integer from "
7617 }
7621 "assignment to %qT from %qT makes integer from pointer "
7626 "initialization of %qT from %qT makes integer from "
7631 "function with return type %qT makes integer from "
7636 }
7639 }
7641 {
7642 tree ret;
7648 }
7651 {
7653 {
7654 auto_diagnostic_group d;
7660 else
7663 }
7666 {
7671 else
7674 }
7676 {
7681 else
7684 }
7686 {
7691 else
7694 }
7697 }
7700 }
7701 \f
7702 /* If VALUE is a compound expr all of whose expressions are constant, then
7703 return its value. Otherwise, return error_mark_node.
7705 This is for handling COMPOUND_EXPRs as initializer elements
7706 which is allowed with a warning when -pedantic is specified. */
7708 static tree
7710 {
7712 {
7717 endtype);
7718 }
7721 else
7723 }
7724 \f
7725 /* Perform appropriate conversions on the initial value of a variable,
7726 store it in the declaration DECL,
7727 and print any error messages that are appropriate.
7728 If ORIGTYPE is not NULL_TREE, it is the original type of INIT.
7729 If the init is invalid, store an ERROR_MARK.
7731 INIT_LOC is the location of the initial value. */
7733 void
7735 {
7739 /* If variable's type was invalidly declared, just ignore it. */
7745 /* Digest the specified initializer into an expression. */
7752 /* Store the expression if valid; else report error. */
7762 /* ANSI wants warnings about out-of-range constant initializers. */
7767 /* Check if we need to set array size from compound literal size. */
7771 {
7778 {
7782 {
7783 /* For int foo[] = (int [3]){1}; we need to set array size
7784 now since later on array initializer will be just the
7785 brace enclosed list of the compound literal. */
7793 }
7794 }
7795 }
7796 }
7797 \f
7798 /* Methods for storing and printing names for error messages. */
7800 /* Implement a spelling stack that allows components of a name to be pushed
7801 and popped. Each element on the stack is this structure. */
7803 struct spelling
7804 {
7806 union
7807 {
7811 };
7813 #define SPELLING_STRING 1
7814 #define SPELLING_MEMBER 2
7815 #define SPELLING_BOUNDS 3
7821 /* Macros to save and restore the spelling stack around push_... functions.
7822 Alternative to SAVE_SPELLING_STACK. */
7824 #define SPELLING_DEPTH() (spelling - spelling_base)
7825 #define RESTORE_SPELLING_DEPTH(DEPTH) (spelling = spelling_base + (DEPTH))
7827 /* Push an element on the spelling stack with type KIND and assign VALUE
7828 to MEMBER. */
7830 #define PUSH_SPELLING(KIND, VALUE, MEMBER) \
7831 { \
7832 int depth = SPELLING_DEPTH (); \
7833 \
7834 if (depth >= spelling_size) \
7835 { \
7836 spelling_size += 10; \
7837 spelling_base = XRESIZEVEC (struct spelling, spelling_base, \
7838 spelling_size); \
7839 RESTORE_SPELLING_DEPTH (depth); \
7840 } \
7841 \
7842 spelling->kind = (KIND); \
7843 spelling->MEMBER = (VALUE); \
7844 spelling++; \
7845 }
7847 /* Push STRING on the stack. Printed literally. */
7849 static void
7851 {
7853 }
7855 /* Push a member name on the stack. Printed as '.' STRING. */
7857 static void
7859 {
7865 }
7867 /* Push an array bounds on the stack. Printed as [BOUNDS]. */
7869 static void
7871 {
7873 }
7875 /* Compute the maximum size in bytes of the printed spelling. */
7877 static int
7879 {
7884 {
7887 else
7889 }
7892 }
7894 /* Print the spelling to BUFFER and return it. */
7898 {
7904 {
7907 }
7908 else
7909 {
7914 ;
7915 }
7918 }
7920 /* Digest the parser output INIT as an initializer for type TYPE.
7921 Return a C expression of type TYPE to represent the initial value.
7923 If ORIGTYPE is not NULL_TREE, it is the original type of INIT.
7925 NULL_POINTER_CONSTANT is true if INIT is a null pointer constant.
7927 If INIT is a string constant, STRICT_STRING is true if it is
7928 unparenthesized or we should not warn here for it being parenthesized.
7929 For other types of INIT, STRICT_STRING is not used.
7931 INIT_LOC is the location of the INIT.
7933 REQUIRE_CONSTANT requests an error if non-constant initializers or
7934 elements are seen. */
7936 static tree
7940 {
7947 || !init
7954 {
7956 {
7959 }
7961 }
7963 /* Initialization of an array of chars from a string constant
7964 optionally enclosed in braces. */
7968 {
7969 tree typ1
7972 TYPE_QUAL_ATOMIC)
7974 /* Note that an array could be both an array of character type
7975 and an array of wchar_t if wchar_t is signed char or unsigned
7976 char. */
7985 {
8003 {
8006 }
8011 {
8016 }
8021 {
8025 /* Subtract the size of a single (possibly wide) character
8026 because it's ok to ignore the terminating null char
8027 that is counted in the length of the constant. */
8038 {
8039 unsigned HOST_WIDE_INT size
8044 }
8045 }
8049 }
8051 {
8055 }
8056 }
8058 /* Build a VECTOR_CST from a *constant* vector constructor. If the
8059 vector constructor is not constant (e.g. {1,2,3,foo()}) then punt
8060 below and handle as a constructor. */
8065 {
8072 {
8074 tree value;
8077 /* Iterate through elements and check if all constructor
8078 elements are *_CSTs. */
8081 {
8084 }
8089 }
8090 }
8095 /* Any type can be initialized
8096 from an expression of the same type, optionally with braces. */
8109 {
8111 {
8113 {
8116 inside_init = array_to_pointer_conversion
8118 else
8119 {
8122 }
8123 }
8124 }
8127 /* Although the types are compatible, we may require a
8128 conversion. */
8133 {
8134 /* As an extension, allow initializing objects with static storage
8135 duration with compound literals (which are then treated just as
8136 the brace enclosed list they contain). Also allow this for
8137 vectors, as we can only assign them with compound literals. */
8143 }
8147 {
8151 }
8153 /* Compound expressions can only occur here if -Wpedantic or
8154 -pedantic-errors is specified. In the later case, we always want
8155 an error. In the former case, we simply want a warning. */
8158 {
8159 inside_init
8164 else
8169 }
8173 {
8176 }
8181 /* Added to enable additional -Wsuggest-attribute=format warnings. */
8188 }
8190 /* Handle scalar types, including conversions. */
8195 {
8202 inside_init);
8203 inside_init
8209 /* Check to see if we have already given an error message. */
8211 ;
8213 {
8216 }
8220 {
8224 }
8230 }
8232 /* Come here only for records and arrays. */
8235 {
8238 }
8242 }
8243 \f
8244 /* Handle initializers that use braces. */
8246 /* Type of object we are accumulating a constructor for.
8247 This type is always a RECORD_TYPE, UNION_TYPE or ARRAY_TYPE. */
8250 /* For a RECORD_TYPE or UNION_TYPE, this is the chain of fields
8251 left to fill. */
8254 /* For an ARRAY_TYPE, this is the specified index
8255 at which to store the next element we get. */
8258 /* For an ARRAY_TYPE, this is the maximum index. */
8261 /* For a RECORD_TYPE, this is the first field not yet written out. */
8264 /* For an ARRAY_TYPE, this is the index of the first element
8265 not yet written out. */
8268 /* In a RECORD_TYPE, the byte index of the next consecutive field.
8269 This is so we can generate gaps between fields, when appropriate. */
8272 /* If we are saving up the elements rather than allocating them,
8273 this is the list of elements so far (in reverse order,
8274 most recent first). */
8277 /* 1 if constructor should be incrementally stored into a constructor chain,
8278 0 if all the elements should be kept in AVL tree. */
8281 /* 1 if so far this constructor's elements are all compile-time constants. */
8284 /* 1 if so far this constructor's elements are all valid address constants. */
8287 /* 1 if this constructor has an element that cannot be part of a
8288 constant expression. */
8291 /* 1 if this constructor is erroneous so far. */
8294 /* 1 if this constructor is the universal zero initializer { 0 }. */
8297 /* Structure for managing pending initializer elements, organized as an
8298 AVL tree. */
8300 struct init_node
8301 {
8305 tree purpose;
8306 tree value;
8307 tree origtype;
8308 };
8310 /* Tree of pending elements at this constructor level.
8311 These are elements encountered out of order
8312 which belong at places we haven't reached yet in actually
8313 writing the output.
8314 Will never hold tree nodes across GC runs. */
8317 /* The SPELLING_DEPTH of this constructor. */
8320 /* DECL node for which an initializer is being read.
8321 0 means we are reading a constructor expression
8322 such as (struct foo) {...}. */
8325 /* Nonzero if this is an initializer for a top-level decl. */
8328 /* Nonzero if there were any member designators in this initializer. */
8331 /* Nesting depth of designator list. */
8334 /* Nonzero if there were diagnosed errors in this designator list. */
8337 \f
8338 /* This stack has a level for each implicit or explicit level of
8339 structuring in the initializer, including the outermost one. It
8340 saves the values of most of the variables above. */
8344 struct constructor_stack
8345 {
8347 tree type;
8348 tree fields;
8349 tree index;
8350 tree max_index;
8351 tree unfilled_index;
8352 tree unfilled_fields;
8353 tree bit_index;
8358 /* If value nonzero, this value should replace the entire
8359 constructor at this level. */
8371 };
8375 /* This stack represents designators from some range designator up to
8376 the last designator in the list. */
8378 struct constructor_range_stack
8379 {
8382 tree range_start;
8383 tree index;
8384 tree range_end;
8385 tree fields;
8386 };
8390 /* This stack records separate initializers that are nested.
8391 Nested initializers can't happen in ANSI C, but GNU C allows them
8392 in cases like { ... (struct foo) { ... } ... }. */
8394 struct initializer_stack
8395 {
8397 tree decl;
8408 };
8411 \f
8412 /* Prepare to parse and output the initializer for variable DECL. */
8414 void
8417 {
8440 {
8442 require_constant_elements
8444 /* For a scalar, you can always use any value to initialize,
8445 even within braces. */
8448 }
8449 else
8450 {
8454 }
8467 }
8469 void
8471 {
8474 /* Free the whole constructor stack of this initializer. */
8476 {
8480 }
8484 /* Pop back to the data of the outer initializer (if any). */
8499 }
8500 \f
8501 /* Call here when we see the initializer is surrounded by braces.
8502 This is instead of a call to push_init_level;
8503 it is matched by a call to pop_init_level.
8505 TYPE is the type to initialize, for a constructor expression.
8506 For an initializer for a decl, TYPE is zero. */
8508 void
8510 {
8560 {
8562 /* Skip any nameless bit fields at the beginning. */
8569 }
8571 {
8573 {
8574 constructor_max_index
8577 /* Detect non-empty initializations of zero-length arrays. */
8582 /* constructor_max_index needs to be an INTEGER_CST. Attempts
8583 to initialize VLAs will cause a proper error; avoid tree
8584 checking errors as well by setting a safe value. */
8589 constructor_index
8592 }
8593 else
8594 {
8597 }
8600 }
8602 {
8603 /* Vectors are like simple fixed-size arrays. */
8604 constructor_max_index =
8608 }
8609 else
8610 {
8611 /* Handle the case of int x = {5}; */
8614 }
8615 }
8616 \f
8619 /* Called when we see an open brace for a nested initializer. Finish
8620 off any pending levels with implicit braces. */
8621 void
8623 {
8625 {
8630 last_init_list_comma),
8633 && constructor_max_index
8635 constructor_index))
8638 last_init_list_comma),
8640 else
8642 }
8643 }
8645 /* Push down into a subobject, for initialization.
8646 If this is for an explicit set of braces, IMPLICIT is 0.
8647 If it is because the next element belongs at a lower level,
8648 IMPLICIT is 1 (or 2 if the push is because of designator list). */
8650 void
8653 {
8657 /* Unless this is an explicit brace, we need to preserve previous
8658 content if any. */
8660 {
8665 }
8703 {
8708 }
8710 /* Don't die if an entire brace-pair level is superfluous
8711 in the containing level. */
8713 ;
8715 {
8716 /* Don't die if there are extra init elts at the end. */
8719 else
8720 {
8723 constructor_depth++;
8724 }
8725 /* If upper initializer is designated, then mark this as
8726 designated too to prevent bogus warnings. */
8728 }
8730 {
8733 constructor_depth++;
8734 }
8737 {
8742 }
8745 {
8754 }
8757 {
8762 }
8765 {
8767 /* Skip any nameless bit fields at the beginning. */
8774 }
8776 {
8777 /* Vectors are like simple fixed-size arrays. */
8778 constructor_max_index =
8782 }
8784 {
8786 {
8787 constructor_max_index
8790 /* Detect non-empty initializations of zero-length arrays. */
8795 /* constructor_max_index needs to be an INTEGER_CST. Attempts
8796 to initialize VLAs will cause a proper error; avoid tree
8797 checking errors as well by setting a safe value. */
8802 constructor_index
8805 }
8806 else
8811 {
8812 /* We need to split the char/wchar array into individual
8813 characters, so that we don't have to special case it
8814 everywhere. */
8816 }
8817 }
8818 else
8819 {
8824 }
8825 }
8827 /* At the end of an implicit or explicit brace level,
8828 finish up that level of constructor. If a single expression
8829 with redundant braces initialized that level, return the
8830 c_expr structure for that expression. Otherwise, the original_code
8831 element is set to ERROR_MARK.
8832 If we were outputting the elements as they are read, return 0 as the value
8833 from inner levels (process_init_element ignores that),
8834 but return error_mark_node as the value from the outermost level
8835 (that's what we want to put in DECL_INITIAL).
8836 Otherwise, return a CONSTRUCTOR expression as the value. */
8838 struct c_expr
8841 location_t insert_before)
8842 {
8850 {
8851 /* When we come to an explicit close brace,
8852 pop any inner levels that didn't have explicit braces. */
8856 insert_before),
8859 }
8860 else
8865 /* Now output all pending elements. */
8871 /* Error for initializing a flexible array member, or a zero-length
8872 array member in an inappropriate context. */
8877 {
8878 /* Silently discard empty initializations. The parser will
8879 already have pedwarned for empty brackets. */
8882 else
8883 {
8888 else
8892 /* We have already issued an error message for the existence
8893 of a flexible array member not at the end of the structure.
8894 Discard the initializer so that we do not die later. */
8897 }
8898 }
8901 {
8903 /* Initialization with { } counts as zeroinit. */
8907 /* This might be zeroinit as well. */
8912 /* If the constructor has more than one element, it can't be { 0 }. */
8915 }
8917 /* Warn when some structs are initialized with direct aggregation. */
8920 {
8923 OPT_Wmissing_braces,
8925 }
8927 /* Warn when some struct elements are implicitly initialized to zero. */
8929 && constructor_type
8932 {
8933 /* Do not warn for flexible array members or zero-length arrays. */
8940 /* Do not warn if this level of the initializer uses member
8941 designators; it is likely to be deliberate. */
8942 && !constructor_designated
8943 /* Do not warn about initializing with { 0 } or with { }. */
8945 {
8948 constructor_unfilled_fields,
8949 constructor_type))
8952 }
8953 }
8955 /* Pad out the end of the structure. */
8957 /* If this closes a superfluous brace pair,
8958 just pass out the element between them. */
8961 ;
8965 {
8966 /* A nonincremental scalar initializer--just return
8967 the element, after verifying there is just one. */
8969 {
8973 }
8975 {
8978 }
8979 else
8981 }
8982 else
8983 {
8986 else
8987 {
8989 constructor_elements);
8996 }
8997 }
9000 {
9005 }
9034 }
9036 /* Common handling for both array range and field name designators.
9037 ARRAY argument is nonzero for array ranges. Returns false for success. */
9039 static bool
9042 {
9043 tree subtype;
9046 /* Don't die if an entire brace-pair level is superfluous
9047 in the containing level, or for an erroneous type. */
9051 /* If there were errors in this designator list already, bail out
9052 silently. */
9056 /* Likewise for an initializer for a variable-size type. Those are
9057 diagnosed in digest_init. */
9063 {
9066 /* Designator list starts at the level of closest explicit
9067 braces. */
9071 last_init_list_comma),
9075 }
9078 {
9090 }
9094 {
9097 }
9099 {
9102 }
9108 }
9110 /* If there are range designators in designator list, push a new designator
9111 to constructor_range_stack. RANGE_END is end of such stack range or
9112 NULL_TREE if there is no range designator at this level. */
9114 static void
9116 {
9132 }
9134 /* Within an array initializer, specify the next index to be initialized.
9135 FIRST is that index. If LAST is nonzero, then initialize a range
9136 of indices, running from FIRST through LAST. */
9138 void
9141 {
9149 {
9152 }
9155 {
9159 "array index in initializer is not "
9161 }
9164 {
9168 "array index in initializer is not "
9170 }
9183 else
9184 {
9190 {
9193 }
9196 {
9200 {
9203 }
9204 else
9205 {
9209 {
9213 }
9214 }
9215 }
9217 designator_depth++;
9221 }
9222 }
9224 /* Within a struct initializer, specify the next field to be initialized. */
9226 void
9229 {
9230 tree field;
9238 {
9241 }
9246 {
9249 {
9255 }
9256 else
9259 }
9260 else
9261 do
9262 {
9264 designator_depth++;
9270 {
9273 }
9274 }
9276 }
9277 \f
9278 /* Add a new initializer to the tree of pending initializers. PURPOSE
9279 identifies the initializer, either array index or field in a structure.
9280 VALUE is the value of that index or field. If ORIGTYPE is not
9281 NULL_TREE, it is the original type of VALUE.
9283 IMPLICIT is true if value comes from pop_init_level (1),
9284 the new initializer has been merged with the existing one
9285 and thus no warnings should be emitted about overriding an
9286 existing initializer. */
9288 static void
9291 {
9298 {
9300 {
9306 else
9307 {
9309 {
9312 "initialized field with side-effects "
9317 }
9321 }
9322 }
9323 }
9324 else
9325 {
9326 tree bitpos;
9330 {
9336 else
9337 {
9339 {
9342 "initialized field with side-effects "
9347 }
9351 }
9352 }
9353 }
9368 {
9372 {
9376 {
9378 {
9379 /* L rotation. */
9392 {
9395 else
9397 }
9398 else
9400 }
9401 else
9402 {
9403 /* LR rotation. */
9425 {
9428 else
9430 }
9431 else
9433 }
9435 }
9436 else
9437 {
9438 /* p->balance == +1; growth of left side balances the node. */
9441 }
9442 }
9444 {
9446 /* Growth propagation from right side. */
9449 {
9451 {
9452 /* R rotation. */
9465 {
9468 else
9470 }
9471 else
9473 }
9475 {
9476 /* RL rotation */
9498 {
9501 else
9503 }
9504 else
9506 }
9508 }
9509 else
9510 {
9511 /* p->balance == -1; growth of right side balances the node. */
9514 }
9515 }
9519 }
9520 }
9522 /* Build AVL tree from a sorted chain. */
9524 static void
9526 {
9536 braced_init_obstack);
9539 {
9541 /* Skip any nameless bit fields at the beginning. */
9546 }
9548 {
9550 constructor_unfilled_index
9553 else
9555 }
9557 }
9559 /* Build AVL tree from a string constant. */
9561 static void
9564 {
9581 p < end
9582 && !(constructor_max_index
9585 {
9587 {
9590 }
9591 else
9592 {
9596 {
9599 else
9604 }
9605 }
9608 {
9611 {
9613 {
9616 }
9617 }
9619 {
9622 }
9626 }
9632 braced_init_obstack);
9633 }
9636 }
9638 /* Return value of FIELD in pending initializer or NULL_TREE if the field was
9639 not initialized yet. */
9641 static tree
9643 {
9647 {
9654 {
9659 else
9661 }
9662 }
9664 {
9668 && (!constructor_unfilled_fields
9675 {
9680 else
9682 }
9683 }
9685 {
9689 }
9691 }
9693 /* "Output" the next constructor element.
9694 At top level, really output it to assembler code now.
9695 Otherwise, collect it in a list from which we will make a CONSTRUCTOR.
9696 If ORIGTYPE is not NULL_TREE, it is the original type of VALUE.
9697 TYPE is the data type that the containing data type wants here.
9698 FIELD is the field (a FIELD_DECL) or the index that this element fills.
9699 If VALUE is a string constant, STRICT_STRING is true if it is
9700 unparenthesized or we should not warn here for it being parenthesized.
9701 For other types of VALUE, STRICT_STRING is not used.
9703 PENDING if true means output pending elements that belong
9704 right after this element. (PENDING is normally true;
9705 it is false while outputting pending elements, to avoid recursion.)
9707 IMPLICIT is true if value comes from pop_init_level (1),
9708 the new initializer has been merged with the existing one
9709 and thus no warnings should be emitted about overriding an
9710 existing initializer. */
9712 static void
9716 {
9722 {
9725 }
9738 {
9739 /* As an extension, allow initializing objects with static storage
9740 duration with compound literals (which are then treated just as
9741 the brace enclosed list they contain). */
9747 }
9751 {
9754 }
9764 && TYPE_REVERSE_STORAGE_ORDER
9773 /* Digest the initializer and issue any errors about incompatible
9774 types before issuing errors about non-constant initializers. */
9779 require_constant_value);
9781 {
9784 }
9788 /* Proceed to check the constness of the original initializer. */
9790 {
9792 {
9795 }
9799 }
9805 /* Issue -Wc++-compat warnings about initializing a bitfield with
9806 enum type. */
9814 {
9821 }
9823 /* If this field is empty and does not have side effects (and is not at
9824 the end of structure), don't do anything other than checking the
9825 initializer. */
9835 /* Finally, set VALUE to the initializer value digested above. */
9838 /* If this element doesn't come next in sequence,
9839 put it on constructor_pending_elts. */
9841 && (!constructor_incremental
9843 {
9849 braced_init_obstack);
9851 }
9853 && (!constructor_incremental
9855 {
9856 /* We do this for records but not for unions. In a union,
9857 no matter which field is specified, it can be initialized
9858 right away since it starts at the beginning of the union. */
9860 {
9863 else
9864 {
9872 }
9873 }
9876 braced_init_obstack);
9878 }
9881 {
9883 {
9890 }
9892 /* We can have just one union field set. */
9894 }
9896 /* Otherwise, output this element either to
9897 constructor_elements or to the assembler file. */
9902 /* Advance the variable that indicates sequential elements output. */
9904 constructor_unfilled_index
9906 bitsize_one_node);
9908 {
9909 constructor_unfilled_fields
9912 /* Skip any nameless bit fields. */
9915 constructor_unfilled_fields =
9917 }
9921 /* Now output any pending elements which have become next. */
9924 }
9926 /* For two FIELD_DECLs in the same chain, return -1 if field1
9927 comes before field2, 1 if field1 comes after field2 and
9928 0 if field1 == field2. */
9930 static int
9932 {
9939 {
9940 /* If one of the fields has non-zero bitsize, then that
9941 field must be the last one in a sequence of zero
9942 sized fields, fields after it will have bigger
9943 bit_position. */
9952 /* Otherwise, fallback to DECL_CHAIN walk to find out
9953 which field comes earlier. Walk chains of both
9954 fields, so that if field1 and field2 are close to each
9955 other in either order, it is found soon even for large
9956 sequences of zero sized fields. */
9959 {
9963 {
9966 }
9977 }
9978 }
9981 else
9983 }
9985 /* Output any pending elements which have become next.
9986 As we output elements, constructor_unfilled_{fields,index}
9987 advances, which may cause other elements to become next;
9988 if so, they too are output.
9990 If ALL is 0, we return when there are
9991 no more pending elements to output now.
9993 If ALL is 1, we output space as necessary so that
9994 we can output all the pending elements. */
9995 static void
9997 {
9999 tree next;
10001 retry:
10003 /* Look through the whole pending tree.
10004 If we find an element that should be output now,
10005 output it. Otherwise, set NEXT to the element
10006 that comes first among those still pending. */
10010 {
10012 {
10014 constructor_unfilled_index))
10018 braced_init_obstack);
10021 {
10022 /* Advance to the next smaller node. */
10025 else
10026 {
10027 /* We have reached the smallest node bigger than the
10028 current unfilled index. Fill the space first. */
10031 }
10032 }
10033 else
10034 {
10035 /* Advance to the next bigger node. */
10038 else
10039 {
10040 /* We have reached the biggest node in a subtree. Find
10041 the parent of it, which is the next bigger node. */
10047 {
10050 }
10051 }
10052 }
10053 }
10055 {
10056 /* If the current record is complete we are done. */
10066 braced_init_obstack);
10068 {
10069 /* Advance to the next smaller node. */
10072 else
10073 {
10074 /* We have reached the smallest node bigger than the
10075 current unfilled field. Fill the space first. */
10078 }
10079 }
10080 else
10081 {
10082 /* Advance to the next bigger node. */
10085 else
10086 {
10087 /* We have reached the biggest node in a subtree. Find
10088 the parent of it, which is the next bigger node. */
10095 {
10098 }
10099 }
10100 }
10101 }
10102 }
10104 /* Ordinarily return, but not if we want to output all
10105 and there are elements left. */
10109 /* If it's not incremental, just skip over the gap, so that after
10110 jumping to retry we will output the next successive element. */
10116 /* ELT now points to the node in the pending tree with the next
10117 initializer to output. */
10119 }
10120 \f
10121 /* Expression VALUE coincides with the start of type TYPE in a braced
10122 initializer. Return true if we should treat VALUE as initializing
10123 the first element of TYPE, false if we should treat it as initializing
10124 TYPE as a whole.
10126 If the initializer is clearly invalid, the question becomes:
10127 which choice gives the best error message? */
10129 static bool
10131 {
10141 /* GNU vectors can be initialized elementwise. However, treat any
10142 kind of vector value as initializing the vector type as a whole,
10143 regardless of whether the value is a GNU vector. Such initializers
10144 are valid if and only if they would have been valid in a non-braced
10145 initializer like:
10147 TYPE foo = VALUE;
10149 so recursing into the vector type would be at best confusing or at
10150 worst wrong. For example, when -flax-vector-conversions is in effect,
10151 it's possible to initialize a V8HI from a V4SI, even though the vectors
10152 have different element types and different numbers of elements. */
10160 }
10162 /* Add one non-braced element to the current constructor level.
10163 This adjusts the current position within the constructor's type.
10164 This may also start or terminate implicit levels
10165 to handle a partly-braced initializer.
10167 Once this has found the correct level for the new element,
10168 it calls output_init_element.
10170 IMPLICIT is true if value comes from pop_init_level (1),
10171 the new initializer has been merged with the existing one
10172 and thus no warnings should be emitted about overriding an
10173 existing initializer. */
10175 void
10178 {
10180 int string_flag
10191 /* Handle superfluous braces around string cst as in
10192 char x[] = {"foo"}; */
10194 && constructor_type
10195 && !was_designated
10199 {
10204 }
10207 {
10210 }
10212 /* Ignore elements of a brace group if it is entirely superfluous
10213 and has already been diagnosed, or if the type is erroneous. */
10217 /* Ignore elements of an initializer for a variable-size type.
10218 Those are diagnosed in digest_init. */
10228 OPT_Wdesignated_init,
10229 "positional initialization of field "
10232 /* If we've exhausted any levels that didn't have braces,
10233 pop them now. */
10235 {
10240 last_init_list_comma),
10244 && constructor_max_index
10246 constructor_index))
10249 last_init_list_comma),
10251 else
10253 }
10255 /* In the case of [LO ... HI] = VALUE, only evaluate VALUE once. */
10257 {
10258 /* If value is a compound literal and we'll be just using its
10259 content, don't put it into a SAVE_EXPR. */
10262 {
10265 {
10268 }
10273 }
10274 }
10277 {
10279 {
10280 tree fieldtype;
10284 {
10287 }
10294 /* Error for non-static initialization of a flexible array member. */
10296 && !require_constant_value
10299 {
10303 }
10305 /* Error for initialization of a flexible array member with
10306 a string constant if the structure is in an array. E.g.:
10307 struct S { int x; char y[]; };
10308 struct S s[] = { { 1, "foo" } };
10309 is invalid. */
10315 {
10320 {
10323 }
10325 {
10329 }
10330 }
10332 /* Accept a string constant to initialize a subarray. */
10338 /* Otherwise, if we have come to a subaggregate,
10339 and we don't have an element of its type, push into it. */
10342 {
10345 }
10348 {
10353 braced_init_obstack);
10355 }
10356 else
10357 /* Do the bookkeeping for an element that was
10358 directly output as a constructor. */
10359 {
10360 /* For a record, keep track of end position of last field. */
10362 constructor_bit_index
10367 /* If the current field was the first one not yet written out,
10368 it isn't now, so update. */
10370 {
10372 /* Skip any nameless bit fields. */
10374 && (DECL_UNNAMED_BIT_FIELD
10376 constructor_unfilled_fields =
10378 }
10379 }
10382 /* Skip any nameless bit fields at the beginning. */
10386 }
10388 {
10389 tree fieldtype;
10393 {
10397 }
10404 /* Warn that traditional C rejects initialization of unions.
10405 We skip the warning if the value is zero. This is done
10406 under the assumption that the zero initializer in user
10407 code appears conditioned on e.g. __STDC__ to avoid
10408 "missing initializer" warnings and relies on default
10409 initialization to zero in the traditional C case.
10410 We also skip the warning if the initializer is designated,
10411 again on the assumption that this must be conditional on
10412 __STDC__ anyway (and we've already complained about the
10413 member-designator already). */
10420 /* Accept a string constant to initialize a subarray. */
10426 /* Otherwise, if we have come to a subaggregate,
10427 and we don't have an element of its type, push into it. */
10430 {
10433 }
10436 {
10441 braced_init_obstack);
10443 }
10444 else
10445 /* Do the bookkeeping for an element that was
10446 directly output as a constructor. */
10447 {
10450 }
10453 }
10455 {
10459 /* Accept a string constant to initialize a subarray. */
10465 /* Otherwise, if we have come to a subaggregate,
10466 and we don't have an element of its type, push into it. */
10469 {
10472 }
10477 {
10481 }
10483 /* Now output the actual element. */
10485 {
10490 braced_init_obstack);
10492 }
10494 constructor_index
10499 /* If we are doing the bookkeeping for an element that was
10500 directly output as a constructor, we must update
10501 constructor_unfilled_index. */
10503 }
10505 {
10508 /* Do a basic check of initializer size. Note that vectors
10509 always have a fixed size derived from their type. */
10511 {
10515 }
10517 /* Now output the actual element. */
10519 {
10525 braced_init_obstack);
10526 }
10528 constructor_index
10533 /* If we are doing the bookkeeping for an element that was
10534 directly output as a constructor, we must update
10535 constructor_unfilled_index. */
10537 }
10539 /* Handle the sole element allowed in a braced initializer
10540 for a scalar variable. */
10543 {
10547 }
10548 else
10549 {
10554 braced_init_obstack);
10556 }
10558 /* Handle range initializers either at this level or anywhere higher
10559 in the designator stack. */
10561 {
10568 {
10572 braced_init_obstack,
10573 last_init_list_comma),
10575 }
10579 {
10583 braced_init_obstack,
10584 last_init_list_comma),
10586 }
10594 {
10598 {
10601 }
10610 }
10615 }
10618 }
10621 }
10622 \f
10623 /* Build a complete asm-statement, whose components are a CV_QUALIFIER
10624 (guaranteed to be 'volatile' or null) and ARGS (represented using
10625 an ASM_EXPR node). */
10626 tree
10628 {
10632 }
10634 /* Build an asm-expr, whose components are a STRING, some OUTPUTS,
10635 some INPUTS, and some CLOBBERS. The latter three may be NULL.
10636 SIMPLE indicates whether there was anything at all after the
10637 string in the asm expression -- asm("blah") and asm("blah" : )
10638 are subtly different. We use a ASM_EXPR node to represent this.
10639 LOC is the location of the asm, and IS_INLINE says whether this
10640 is asm inline. */
10641 tree
10644 {
10645 tree tail;
10646 tree args;
10659 /* Remove output conversions that change the type but not the mode. */
10661 {
10666 /* ??? Really, this should not be here. Users should be using a
10667 proper lvalue, dammit. But there's a long history of using casts
10668 in the output operands. In cases like longlong.h, this becomes a
10669 primitive form of typechecking -- if the cast can be removed, then
10670 the output operand had a type of the proper width; otherwise we'll
10671 get an error. Gross, but ... */
10689 {
10690 /* If the operand is going to end up in memory,
10691 mark it addressable. */
10697 {
10700 }
10701 }
10702 else
10706 }
10709 {
10710 tree input;
10717 {
10718 /* If the operand is going to end up in memory,
10719 mark it addressable. */
10721 {
10724 /* Strip the nops as we allow this case. FIXME, this really
10725 should be rejected or made deprecated. */
10729 }
10730 else
10731 {
10739 {
10742 }
10743 }
10744 }
10745 else
10749 }
10753 /* asm statements without outputs, including simple ones, are treated
10754 as volatile. */
10760 }
10761 \f
10762 /* Generate a goto statement to LABEL. LOC is the location of the
10763 GOTO. */
10765 tree
10767 {
10772 {
10777 }
10778 }
10780 /* Generate a computed goto statement to EXPR. LOC is the location of
10781 the GOTO. */
10783 tree
10785 {
10786 tree t;
10793 }
10795 /* Generate a C `return' statement. RETVAL is the expression for what
10796 to return, or a null pointer for `return;' with no value. LOC is
10797 the location of the return statement, or the location of the expression,
10798 if the statement has any. If ORIGTYPE is not NULL_TREE, it
10799 is the original type of RETVAL. */
10801 tree
10803 {
10808 /* Use the expansion point to handle cases such as returning NULL
10809 in a function returning void. */
10817 {
10821 {
10824 }
10830 }
10833 {
10837 {
10840 warned_here = pedwarn
10843 else
10844 warned_here = warning_at
10851 }
10852 }
10854 {
10858 warned_here = pedwarn
10861 else
10862 warned_here = pedwarn
10868 }
10869 else
10870 {
10875 tree inner;
10893 /* Strip any conversions, additions, and subtractions, and see if
10894 we are returning the address of a local variable. Warn if so. */
10896 {
10898 {
10899 CASE_CONVERT:
10907 /* If the second operand of the MINUS_EXPR has a pointer
10908 type (or is converted from it), this may be valid, so
10909 don't give a warning. */
10910 {
10923 }
10937 {
10941 else
10942 {
10947 }
10948 }
10953 }
10956 }
10963 }
10969 }
10970 \f
10972 /* The SWITCH_STMT being built. */
10973 tree switch_stmt;
10975 /* The original type of the testing expression, i.e. before the
10976 default conversion is applied. */
10977 tree orig_type;
10979 /* A splay-tree mapping the low element of a case range to the high
10980 element, or NULL_TREE if there is no high element. Used to
10981 determine whether or not a new case label duplicates an old case
10982 label. We need a tree, rather than simply a hash table, because
10983 of the GNU case range extension. */
10984 splay_tree cases;
10986 /* The bindings at the point of the switch. This is used for
10987 warnings crossing decls when branching to a case label. */
10990 /* Whether the switch includes any break statements. */
10993 /* The next node on the stack. */
10996 /* Remember whether the controlling expression had boolean type
10997 before integer promotions for the sake of -Wswitch-bool. */
10999 };
11001 /* A stack of the currently active switch statements. The innermost
11002 switch statement is on the top of the stack. There is no need to
11003 mark the stack for garbage collection because it is only active
11004 during the processing of the body of a function, and we never
11005 collect at that point. */
11009 /* Start a C switch statement, testing expression EXP. Return the new
11010 SWITCH_STMT. SWITCH_LOC is the location of the `switch'.
11011 SWITCH_COND_LOC is the location of the switch's condition.
11012 EXPLICIT_CAST_P is true if the expression EXP has an explicit cast. */
11014 tree
11016 location_t switch_cond_loc,
11018 {
11024 {
11028 {
11030 {
11033 }
11035 }
11036 else
11037 {
11041 /* Warn if the condition has boolean value. */
11047 /* Explicit cast to int suppresses this warning. */
11064 }
11065 }
11067 /* Add this new SWITCH_STMT to the stack. */
11080 }
11082 /* Process a case label at location LOC. */
11084 tree
11086 {
11090 {
11095 }
11098 {
11103 }
11106 {
11109 else
11112 }
11116 loc))
11125 }
11127 /* Finish the switch statement. TYPE is the original type of the
11128 controlling expression of the switch, or NULL_TREE. */
11130 void
11132 {
11134 location_t switch_location;
11138 /* Emit warnings as needed. */
11148 /* Pop the stack. */
11153 }
11154 \f
11155 /* Emit an if statement. IF_LOCUS is the location of the 'if'. COND,
11156 THEN_BLOCK and ELSE_BLOCK are expressions to be used; ELSE_BLOCK
11157 may be null. */
11159 void
11161 tree else_block)
11162 {
11163 tree stmt;
11168 }
11170 tree
11172 {
11173 /* In switch statements break is sometimes stylistically used after
11174 a return statement. This can lead to spurious warnings about
11175 control reaching the end of a non-void function when it is
11176 inlined. Note that we are calling block_may_fallthru with
11177 language specific tree nodes; this works because
11178 block_may_fallthru returns true when given something it does not
11179 understand. */
11184 {
11201 }
11202 else
11204 {
11217 }
11222 {
11223 /* The foreach expander produces low-level code using gotos instead
11224 of a structured loop construct. */
11227 }
11229 }
11231 /* A helper routine for c_process_expr_stmt and c_finish_stmt_expr. */
11233 static void
11235 {
11240 ;
11242 {
11246 }
11248 {
11252 {
11256 }
11264 }
11265 else
11267 }
11269 /* Process an expression as if it were a complete statement. Emit
11270 diagnostics, but do not call ADD_STMT. LOC is the location of the
11271 statement. */
11273 tree
11275 {
11276 tree exprv;
11291 /* If we're not processing a statement expression, warn about unused values.
11292 Warnings for statement expressions will be emitted later, once we figure
11293 out which is the result. */
11308 /* If the expression is not of a type to which we cannot assign a line
11309 number, wrap the thing in a no-op NOP_EXPR. */
11311 {
11314 }
11317 }
11319 /* Emit an expression as a statement. LOC is the location of the
11320 expression. */
11322 tree
11324 {
11327 else
11329 }
11331 /* Do the opposite and emit a statement as an expression. To begin,
11332 create a new binding level and return it. */
11334 tree
11336 {
11337 tree ret;
11339 /* We must force a BLOCK for this level so that, if it is not expanded
11340 later, there is a way to turn off the entire subtree of blocks that
11341 are contained in it. */
11346 ? NULL
11349 /* Mark the current statement list as belonging to a statement list. */
11353 }
11355 /* LOC is the location of the compound statement to which this body
11356 belongs. */
11358 tree
11360 {
11367 ? NULL
11370 /* Locate the last statement in BODY. See c_end_compound_stmt
11371 about always returning a BIND_EXPR. */
11375 continue_searching:
11377 {
11383 /* This can happen with degenerate cases like ({ }). No value. */
11387 /* If we're supposed to generate side effects warnings, process
11388 all of the statements except the last. */
11390 {
11393 {
11394 location_t tloc;
11399 }
11400 }
11403 }
11405 /* If the end of the list is exception related, then the list was split
11406 by a call to push_cleanup. Continue searching. */
11409 {
11413 }
11418 /* In the case that the BIND_EXPR is not necessary, return the
11419 expression out from inside it. */
11421 /* Skip nested debug stmts. */
11424 {
11425 /* Even if this looks constant, do not allow it in a constant
11426 expression. */
11428 /* Do not warn if the return value of a statement expression is
11429 unused. */
11432 }
11434 /* Extract the type of said expression. */
11437 /* If we're not returning a value at all, then the BIND_EXPR that
11438 we already have is a fine expression to return. */
11442 /* Now that we've located the expression containing the value, it seems
11443 silly to make voidify_wrapper_expr repeat the process. Create a
11444 temporary of the appropriate type and stick it in a TARGET_EXPR. */
11447 /* Unwrap a no-op NOP_EXPR as added by c_finish_expr_stmt. This avoids
11448 tree_expr_nonnegative_p giving up immediately. */
11457 {
11461 }
11462 }
11463 \f
11464 /* Begin and end compound statements. This is as simple as pushing
11465 and popping new statement lists from the tree. */
11467 tree
11469 {
11474 }
11476 /* End a compound statement. STMT is the statement. LOC is the
11477 location of the compound statement-- this is usually the location
11478 of the opening brace. */
11480 tree
11482 {
11486 {
11490 }
11495 /* If this compound statement is nested immediately inside a statement
11496 expression, then force a BIND_EXPR to be created. Otherwise we'll
11497 do the wrong thing for ({ { 1; } }) or ({ 1; { } }). In particular,
11498 STATEMENT_LISTs merge, and thus we can lose track of what statement
11499 was really last. */
11503 {
11507 }
11510 }
11512 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
11513 when the current scope is exited. EH_ONLY is true when this is not
11514 meant to apply to normal control flow transfer. */
11516 void
11518 {
11530 }
11531 \f
11532 /* Build a vector comparison of ARG0 and ARG1 using CODE opcode
11533 into a value of TYPE type. Comparison is done via VEC_COND_EXPR. */
11535 static tree
11538 {
11544 }
11546 /* Build a binary-operation expression without default conversions.
11547 CODE is the kind of expression to build.
11548 LOCATION is the operator's location.
11549 This function differs from `build' in several ways:
11550 the data type of the result is computed and recorded in it,
11551 warnings are generated if arg data types are invalid,
11552 special handling for addition and subtraction of pointers is known,
11553 and some optimization is done (operations on narrow ints
11554 are done in the narrower type when that gives the same result).
11555 Constant folding is also done before the result is returned.
11557 Note that the operands will never have enumeral types, or function
11558 or array types, because either they will have the default conversions
11559 performed or they have both just been converted to some other type in which
11560 the arithmetic is to be done. */
11562 tree
11565 {
11567 tree eptype;
11575 /* Expression code to give to the expression when it is built.
11576 Normally this is CODE, which is what the caller asked for,
11577 but in some special cases we change it. */
11580 /* Data type in which the computation is to be performed.
11581 In the simplest cases this is the common type of the arguments. */
11584 /* When the computation is in excess precision, the type of the
11585 final EXCESS_PRECISION_EXPR. */
11588 /* Nonzero means operands have already been type-converted
11589 in whatever way is necessary.
11590 Zero means they need to be converted to RESULT_TYPE. */
11593 /* Nonzero means create the expression with this type, rather than
11594 RESULT_TYPE. */
11597 /* Nonzero means after finally constructing the expression
11598 convert it to this type. */
11601 /* Nonzero if this is an operation like MIN or MAX which can
11602 safely be computed in short if both args are promoted shorts.
11603 Also implies COMMON.
11604 -1 indicates a bitwise operation; this makes a difference
11605 in the exact conditions for when it is safe to do the operation
11606 in a narrower mode. */
11609 /* Nonzero if this is a comparison operation;
11610 if both args are promoted shorts, compare the original shorts.
11611 Also implies COMMON. */
11614 /* Nonzero if this is a right-shift operation, which can be computed on the
11615 original short and then promoted if the operand is a promoted short. */
11618 /* Nonzero means set RESULT_TYPE to the common type of the args. */
11621 /* True means types are compatible as far as ObjC is concerned. */
11624 /* True means this is an arithmetic operation that may need excess
11625 precision. */
11628 /* True means this is a boolean operation that converts both its
11629 operands to truth-values. */
11632 /* Remember whether we're doing / or %. */
11635 /* Remember whether we're doing << or >>. */
11638 /* Tree holding instrumentation expression. */
11655 {
11658 int_const = (int_const_or_overflow
11661 }
11662 else
11665 /* Do not apply default conversion in mixed vector/scalar expression. */
11668 {
11671 }
11677 /* The expression codes of the data types of the arguments tell us
11678 whether the arguments are integers, floating, pointers, etc. */
11682 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
11686 /* If an error was already reported for one of the arguments,
11687 avoid reporting another error. */
11702 {
11705 }
11708 {
11726 /* Excess precision for implicit conversions of integers to
11727 floating point in C11 and later. */
11728 may_need_excess_precision = (flag_isoc11
11736 }
11738 {
11741 }
11744 {
11747 }
11749 {
11752 }
11755 {
11758 }
11762 /* In case when one of the operands of the binary operation is
11763 a vector and another is a scalar -- convert scalar to vector. */
11766 {
11771 {
11775 {
11777 tree sc;
11788 }
11790 {
11792 tree sc;
11803 }
11806 }
11807 }
11810 {
11812 /* Handle the pointer + int case. */
11814 {
11817 }
11819 {
11822 }
11823 else
11828 /* Subtraction of two similar pointers.
11829 We must subtract them as integers, then divide by object size. */
11832 {
11835 }
11836 /* Handle pointer minus int. Just like pointer plus int. */
11838 {
11841 }
11842 else
11866 {
11877 else
11878 /* Although it would be tempting to shorten always here, that
11879 loses on some targets, since the modulo instruction is
11880 undefined if the quotient can't be represented in the
11881 computation mode. We shorten only if unsigned or if
11882 dividing by something we know != -1. */
11887 }
11895 /* Allow vector types which are not floating point types. */
11914 {
11915 /* Although it would be tempting to shorten always here, that loses
11916 on some targets, since the modulo instruction is undefined if the
11917 quotient can't be represented in the computation mode. We shorten
11918 only if unsigned or if dividing by something we know != -1. */
11923 }
11937 {
11938 /* Result of these operations is always an int,
11939 but that does not mean the operands should be
11940 converted to ints! */
11943 {
11946 }
11947 else
11950 {
11953 }
11954 else
11958 }
11960 {
11961 int_const_or_overflow = (int_operands
11965 int_const = (int_const_or_overflow
11969 }
11971 {
11972 int_const_or_overflow = (int_operands
11976 int_const = (int_const_or_overflow
11980 }
11983 /* Shift operations: result has same type as first operand;
11984 always convert second operand to int.
11985 Also set SHORT_SHIFT if shifting rightward. */
11994 {
11997 }
12002 {
12005 {
12007 {
12012 }
12014 {
12018 {
12023 }
12024 }
12025 else
12026 {
12031 {
12036 }
12037 }
12038 }
12040 /* Use the type of the value to be shifted. */
12042 /* Avoid converting op1 to result_type later. */
12044 }
12054 {
12057 }
12062 {
12066 {
12067 /* Don't reject a left shift of a negative value in a context
12068 where a constant expression is needed in C90. */
12074 }
12076 {
12078 {
12083 }
12085 {
12089 {
12094 }
12095 }
12097 {
12102 }
12107 }
12109 /* Use the type of the value to be shifted. */
12111 /* Avoid converting op1 to result_type later. */
12113 }
12119 {
12120 tree intt;
12122 {
12126 }
12130 {
12134 }
12136 /* It's not precisely specified how the usual arithmetic
12137 conversions apply to the vector types. Here, we use
12138 the unsigned type if one of the operands is signed and
12139 the other one is unsigned. */
12141 {
12144 else
12148 }
12150 /* Always construct signed integer vector type. */
12152 (SCALAR_TYPE_MODE
12155 {
12160 }
12166 }
12169 OPT_Wfloat_equal,
12171 /* Result of comparison is always int,
12172 but don't convert the args to int! */
12180 {
12184 {
12187 OPT_Waddress,
12188 "the comparison will always evaluate as %<false%> "
12191 else
12193 OPT_Waddress,
12194 "the comparison will always evaluate as %<true%> "
12197 }
12199 }
12201 {
12205 {
12208 OPT_Waddress,
12209 "the comparison will always evaluate as %<false%> "
12212 else
12214 OPT_Waddress,
12215 "the comparison will always evaluate as %<true%> "
12218 }
12220 }
12222 {
12229 /* Anything compares with void *. void * compares with anything.
12230 Otherwise, the targets must be compatible
12231 and both must be object or both incomplete. */
12235 {
12239 }
12241 {
12245 }
12247 {
12251 }
12252 else
12253 /* Avoid warning about the volatile ObjC EH puts on decls. */
12259 {
12261 result_type = build_pointer_type
12263 }
12264 }
12266 {
12269 }
12271 {
12274 }
12287 {
12288 tree intt;
12290 {
12294 }
12298 {
12302 }
12304 /* It's not precisely specified how the usual arithmetic
12305 conversions apply to the vector types. Here, we use
12306 the unsigned type if one of the operands is signed and
12307 the other one is unsigned. */
12309 {
12312 else
12316 }
12318 /* Always construct signed integer vector type. */
12320 (SCALAR_TYPE_MODE
12323 {
12328 }
12334 }
12342 {
12345 addr_space_t as_common;
12348 {
12362 }
12364 {
12368 }
12369 else
12370 {
12372 result_type = build_pointer_type
12376 }
12377 }
12379 {
12387 }
12389 {
12397 }
12399 {
12402 }
12404 {
12407 }
12412 {
12418 }
12429 }
12438 {
12440 maybe_range_label_for_tree_type_mismatch
12447 }
12452 &&
12456 {
12462 {
12465 "implicit conversion from %qT to %qT "
12466 "to match other operand of binary "
12468 location);
12471 }
12480 {
12481 /* An operation on mixed real/complex operands must be
12482 handled specially, but the language-independent code can
12483 more easily optimize the plain complex arithmetic if
12484 -fno-signed-zeros. */
12488 {
12491 }
12493 {
12498 }
12499 else
12500 {
12505 }
12509 {
12516 {
12521 /* Fall through. */
12528 }
12529 }
12530 else
12531 {
12538 {
12542 /* Fall through. */
12552 }
12553 }
12556 }
12558 /* For certain operations (which identify themselves by shorten != 0)
12559 if both args were extended from the same smaller type,
12560 do the arithmetic in that type and then extend.
12562 shorten !=0 and !=1 indicates a bitwise operation.
12563 For them, this optimization is safe only if
12564 both args are zero-extended or both are sign-extended.
12565 Otherwise, we might change the result.
12566 Eg, (short)-1 | (unsigned short)-1 is (int)-1
12567 but calculated in (unsigned short) it would be (unsigned short)-1. */
12570 {
12574 }
12576 /* Shifts can be shortened if shifting right. */
12579 {
12590 /* We can shorten only if the shift count is less than the
12591 number of bits in the smaller type size. */
12593 /* We cannot drop an unsigned shift after sign-extension. */
12595 {
12596 /* Do an unsigned shift if the operand was zero-extended. */
12597 result_type
12600 /* Convert value-to-be-shifted to that type. */
12604 }
12605 }
12607 /* Comparison operations are shortened too but differently.
12608 They identify themselves by setting short_compare = 1. */
12611 {
12612 /* Don't write &op0, etc., because that would prevent op0
12613 from being kept in a register.
12614 Instead, make copies of the our local variables and
12615 pass the copies by reference, then copy them back afterward. */
12618 tree val
12623 {
12626 }
12633 {
12639 {
12642 }
12643 else
12644 {
12645 /* Fold for the sake of possible warnings, as in
12646 build_conditional_expr. This requires the
12647 "original" values to be folded, not just op0 and
12648 op1. */
12649 c_inhibit_evaluation_warnings++;
12654 c_inhibit_evaluation_warnings--;
12656 require_constant_value,
12657 NULL);
12659 require_constant_value,
12660 NULL);
12661 }
12668 {
12673 }
12674 }
12675 }
12676 }
12678 /* At this point, RESULT_TYPE must be nonzero to avoid an error message.
12679 If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
12680 Then the expression will be built.
12681 It will be given type FINAL_TYPE if that is nonzero;
12682 otherwise, it will be given type RESULT_TYPE. */
12685 {
12686 /* Favor showing any expression locations that are available. */
12691 }
12694 {
12698 {
12701 }
12702 }
12705 {
12707 semantic_result_type);
12709 semantic_result_type);
12711 /* This can happen if one operand has a vector type, and the other
12712 has a different type. */
12715 }
12722 {
12723 /* OP0 and/or OP1 might have side-effects. */
12733 }
12735 /* Treat expressions in initializers specially as they can't trap. */
12737 ret = (require_constant_value
12741 else
12746 return_build_binary_op:
12749 ret = (int_operands
12766 }
12769 /* Convert EXPR to be a truth-value, validating its type for this
12770 purpose. LOCATION is the source location for the expression. */
12772 tree
12774 {
12778 {
12780 error_at (location, "used array that cannot be converted to pointer where scalar is required");
12809 }
12814 {
12819 }
12820 else
12821 /* ??? Should we also give an error for vectors rather than leaving
12822 those to give errors later? */
12826 {
12829 else
12831 }
12835 }
12836 \f
12838 /* Convert EXPR to a contained DECL, updating *TC, *TI and *SE as
12839 required. */
12841 tree
12843 {
12845 {
12847 /* Executing a compound literal inside a function reinitializes
12848 it. */
12852 }
12853 else
12855 }
12856 \f
12857 /* Generate OMP construct CODE, with BODY and CLAUSES as its compound
12858 statement. LOC is the location of the construct. */
12860 tree
12862 tree clauses)
12863 {
12873 }
12875 /* Generate OACC_DATA, with CLAUSES and BLOCK as its compound
12876 statement. LOC is the location of the OACC_DATA. */
12878 tree
12880 {
12881 tree stmt;
12892 }
12894 /* Generate OACC_HOST_DATA, with CLAUSES and BLOCK as its compound
12895 statement. LOC is the location of the OACC_HOST_DATA. */
12897 tree
12899 {
12900 tree stmt;
12911 }
12913 /* Like c_begin_compound_stmt, except force the retention of the BLOCK. */
12915 tree
12917 {
12918 tree block;
12924 }
12926 /* Generate OMP_PARALLEL, with CLAUSES and BLOCK as its compound
12927 statement. LOC is the location of the OMP_PARALLEL. */
12929 tree
12931 {
12932 tree stmt;
12943 }
12945 /* Like c_begin_compound_stmt, except force the retention of the BLOCK. */
12947 tree
12949 {
12950 tree block;
12956 }
12958 /* Generate OMP_TASK, with CLAUSES and BLOCK as its compound
12959 statement. LOC is the location of the #pragma. */
12961 tree
12963 {
12964 tree stmt;
12975 }
12977 /* Generate GOMP_cancel call for #pragma omp cancel. */
12979 void
12981 {
12992 else
12993 {
12995 "%<parallel%>, %<for%>, %<sections%> or %<taskgroup%> "
12998 }
13001 {
13006 else
13007 {
13010 {
13016 }
13017 }
13023 }
13024 else
13028 ifc);
13030 }
13032 /* Generate GOMP_cancellation_point call for
13033 #pragma omp cancellation point. */
13035 void
13037 {
13048 else
13049 {
13051 "%<parallel%>, %<for%>, %<sections%> or %<taskgroup%> "
13054 }
13058 }
13060 /* Helper function for handle_omp_array_sections. Called recursively
13061 to handle multiple array-section-subscripts. C is the clause,
13062 T current expression (initially OMP_CLAUSE_DECL), which is either
13063 a TREE_LIST for array-section-subscript (TREE_PURPOSE is low-bound
13064 expression if specified, TREE_VALUE length expression if specified,
13065 TREE_CHAIN is what it has been specified after, or some decl.
13066 TYPES vector is populated with array section types, MAYBE_ZERO_LEN
13067 set to true if any of the array-section-subscript could have length
13068 of zero (explicit or implicit), FIRST_NON_ONE is the index of the
13069 first array-section-subscript which is known not to have length
13070 of one. Given say:
13071 map(a[:b][2:1][:c][:2][:d][e:f][2:5])
13072 FIRST_NON_ONE will be 3, array-section-subscript [:b], [2:1] and [:c]
13073 all are or may have length of 1, array-section-subscript [:2] is the
13074 first one known not to have length 1. For array-section-subscript
13075 <= FIRST_NON_ONE we diagnose non-contiguous arrays if low bound isn't
13076 0 or length isn't the array domain max + 1, for > FIRST_NON_ONE we
13077 can if MAYBE_ZERO_LEN is false. MAYBE_ZERO_LEN will be true in the above
13078 case though, as some lengths could be zero. */
13080 static tree
13084 {
13087 {
13094 {
13098 }
13103 {
13105 {
13110 }
13112 {
13114 {
13118 }
13121 {
13126 else
13128 }
13129 }
13130 }
13132 {
13137 else
13142 }
13146 {
13150 }
13155 {
13160 }
13165 {
13166 /* If the array section is pointer based and the pointer
13167 itself is _Atomic qualified, we need to atomically load
13168 the pointer. */
13169 c_expr expr;
13175 }
13177 }
13192 {
13195 low_bound);
13197 }
13199 {
13202 length);
13204 }
13220 {
13222 {
13227 }
13228 }
13230 {
13232 {
13238 {
13240 {
13245 }
13246 }
13247 else
13249 }
13252 first_non_one++;
13253 }
13255 {
13259 {
13261 "for unknown bound array type length expression must "
13264 }
13267 {
13272 }
13276 {
13281 }
13286 {
13287 tree size
13291 {
13293 {
13295 "low bound %qE above array section size "
13299 }
13301 {
13307 {
13312 }
13314 }
13317 && tree_int_cst_equal
13319 low_bound))
13320 first_non_one++;
13321 }
13323 {
13331 first_non_one++;
13332 }
13334 {
13336 {
13338 "length %qE above array section size "
13342 }
13344 {
13345 tree lbpluslen
13351 {
13353 "high bound %qE above array section size "
13357 }
13358 }
13359 }
13360 }
13362 {
13370 first_non_one++;
13371 }
13373 /* For [lb:] we will need to evaluate lb more than once. */
13375 {
13378 {
13381 }
13382 }
13383 }
13385 {
13387 {
13390 "for array function parameter length expression "
13392 else
13396 }
13400 {
13405 }
13406 /* If there is a pointer type anywhere but in the very first
13407 array-section-subscript, the array section can't be contiguous. */
13411 {
13416 }
13417 }
13418 else
13419 {
13423 }
13426 /* We will need to evaluate lb more than once. */
13429 {
13432 }
13435 }
13437 /* Handle array sections for clause C. */
13439 static bool
13441 {
13454 ort);
13461 {
13464 /* Need to evaluate side effects in the length expressions
13465 if any. */
13467 {
13469 {
13472 else
13475 }
13477 }
13482 }
13483 else
13484 {
13494 {
13498 i--;
13512 {
13521 {
13522 tree size;
13525 size_one_node);
13527 {
13528 do_warn_noncontiguous:
13530 "array section is not contiguous in %qs "
13534 }
13535 }
13538 {
13541 else
13545 }
13546 }
13547 else
13548 {
13549 tree l;
13559 else
13560 {
13563 size_one_node);
13566 }
13568 {
13570 size_zero_node);
13573 else
13576 }
13578 {
13586 {
13589 {
13594 }
13597 }
13602 }
13603 else
13605 }
13606 }
13612 {
13635 else
13636 {
13641 }
13644 }
13656 {
13675 }
13679 else
13699 }
13701 }
13703 /* Helper function of finish_omp_clauses. Clone STMT as if we were making
13704 an inline call. But, remap
13705 the OMP_DECL1 VAR_DECL (omp_out resp. omp_orig) to PLACEHOLDER
13706 and OMP_DECL2 VAR_DECL (omp_in resp. omp_priv) to DECL. */
13708 static tree
13711 {
13712 copy_body_data id;
13731 }
13733 /* Helper function of c_finish_omp_clauses, called via walk_tree.
13734 Find OMP_CLAUSE_PLACEHOLDER (passed in DATA) in *TP. */
13736 static tree
13738 {
13742 }
13744 /* Similarly, but also walk aggregate fields. */
13748 static tree
13750 {
13754 {
13755 tree field;
13761 {
13770 pset);
13776 }
13777 }
13782 }
13784 /* Finish OpenMP iterators ITER. Return true if they are errorneous
13785 and clauses containing them should be removed. */
13787 static bool
13789 {
13792 {
13797 tree orig_step;
13801 {
13804 }
13806 {
13808 var);
13811 }
13813 {
13817 }
13819 {
13823 }
13826 {
13829 }
13831 {
13836 }
13843 {
13850 }
13852 {
13856 }
13862 {
13865 }
13867 tree it2;
13869 {
13878 {
13883 }
13885 {
13889 }
13891 {
13895 }
13897 {
13901 }
13902 }
13904 {
13907 }
13912 }
13914 }
13916 /* Ensure that pointers are used in OpenACC attach and detach clauses.
13917 Return true if an error has been detected. */
13919 static bool
13921 {
13925 /* OpenACC attach / detach clauses must be pointers. */
13928 {
13935 {
13939 }
13940 }
13943 }
13945 /* For all elements of CLAUSES, validate them against their constraints.
13946 Remove any elements from the list that are invalid. */
13948 tree
13950 {
13953 bitmap_head oacc_reduction_head;
13969 /* 1 if normal/task reduction has been seen, -1 if inscan reduction
13970 has been seen, -2 if mixed inscan/normal reduction diagnosed. */
13981 /* If ort == C_ORT_OMP_DECLARE_SIMD used as uniform_head instead. */
13985 /* If ort == C_ORT_OMP used as nontemporal_head or use_device_xxx_head
13986 instead and for ort == C_ORT_OMP_TARGET used as in_reduction_head. */
13992 {
13995 }
13998 {
14004 {
14020 {
14022 "%<inscan%> and non-%<inscan%> %<reduction%> clauses "
14025 }
14026 /* FALLTHRU */
14032 {
14034 {
14037 }
14042 {
14044 "%<inscan%> %<reduction%> clause with array "
14048 }
14049 }
14052 {
14055 }
14062 {
14068 {
14071 t);
14074 }
14078 {
14081 t);
14084 }
14089 index_type);
14096 }
14098 {
14103 }
14106 {
14107 /* Disallow zero sized or potentially zero sized task
14108 reductions. */
14110 {
14116 }
14118 {
14124 }
14125 }
14129 {
14134 {
14160 }
14162 {
14168 }
14169 }
14171 {
14176 }
14178 {
14188 {
14194 }
14204 decl_placeholder ? decl_placeholder
14212 {
14224 decl_placeholder ? decl_placeholder
14227 {
14232 }
14234 c_find_omp_placeholder_r,
14237 }
14238 else
14239 {
14240 tree init;
14244 else
14248 }
14254 }
14256 {
14260 {
14265 }
14271 }
14277 {
14279 "%<nowait%> clause must not be used together "
14283 }
14289 {
14294 }
14303 {
14305 "modifier should not be specified in %<linear%> "
14308 }
14311 {
14313 "linear clause applied to non-integral non-pointer "
14317 }
14319 {
14324 }
14326 {
14329 {
14331 /* map_head bitmap is used as uniform_head if
14332 declare_simd. */
14336 }
14338 {
14340 "%<linear%> clause step %qE is neither constant "
14344 }
14345 }
14347 {
14353 fold_convert
14358 }
14359 else
14364 check_dup_generic:
14366 check_dup_generic_t:
14368 {
14373 }
14382 {
14386 {
14388 "%qD appears more than once in data-sharing "
14392 }
14396 {
14398 ort == C_ORT_ACC
14401 t);
14403 }
14404 else
14406 }
14411 {
14415 }
14418 {
14422 else
14426 }
14427 else
14433 {
14434 move_implicit:
14436 /* Move firstprivate and map clauses with
14437 OMP_CLAUSE_{FIRSTPRIVATE,MAP}_IMPLICIT set to the end of
14438 clauses chain. */
14444 {
14448 }
14451 {
14455 }
14456 else
14462 }
14467 {
14471 }
14479 {
14483 }
14485 {
14492 else
14496 }
14497 else
14506 {
14510 }
14513 {
14517 }
14518 else
14525 {
14529 }
14532 {
14534 "%qE in %<aligned%> clause is neither a pointer nor "
14537 }
14539 {
14544 }
14546 {
14549 t);
14551 }
14552 else
14559 {
14563 }
14565 {
14567 "%qE appears more than once in %<nontemporal%> "
14570 }
14571 else
14578 {
14582 }
14584 {
14587 t);
14589 }
14590 else
14591 {
14595 }
14601 {
14605 }
14607 {
14610 {
14613 {
14621 sizetype,
14625 {
14628 }
14630 }
14631 }
14633 }
14634 /* FALLTHRU */
14640 {
14642 last_iterators_remove
14648 }
14649 else
14652 {
14657 {
14659 "%<depend%> clause with %<depobj%> dependence "
14662 }
14664 }
14668 {
14670 "%qE is not lvalue expression nor array section in "
14674 }
14677 {
14684 }
14687 {
14689 {
14691 "%qE does not have %<omp_depend_t%> type in "
14692 "%<depend%> clause with %<depobj%> dependence "
14695 }
14696 }
14699 {
14701 "%qE should not have %<omp_depend_t%> type in "
14702 "%<depend%> clause with dependence type other than "
14705 }
14707 {
14712 else
14713 {
14715 RO_UNARY_STAR);
14723 else
14725 }
14726 }
14732 /* FALLTHRU */
14738 {
14741 else
14742 {
14745 {
14747 "array section does not have mappable type "
14751 }
14753 {
14758 }
14763 {
14772 {
14775 }
14779 {
14782 "%qD appears more than once in motion "
14786 "%qD appears more than once in data "
14788 else
14790 "%qD appears more than once in map "
14793 }
14794 else
14795 {
14798 }
14799 }
14800 }
14806 /* In this case, we have a single array element which is a
14807 pointer, and we already set OMP_CLAUSE_SIZE in
14808 handle_omp_array_sections above. For attach/detach clauses,
14809 reset the OMP_CLAUSE_SIZE (representing a bias) to zero
14810 here. */
14813 }
14815 {
14818 }
14819 /* OpenACC attach / detach clauses must be pointers. */
14821 {
14824 }
14828 /* For attach/detach clauses, set OMP_CLAUSE_SIZE (representing a
14829 bias) to zero here, so it is not set erroneously to the pointer
14830 size later on in gimplify.c. */
14834 {
14836 {
14841 }
14843 {
14848 }
14850 {
14855 }
14857 {
14860 {
14865 }
14868 {
14873 else
14875 }
14876 }
14880 {
14885 }
14886 }
14888 {
14893 }
14895 {
14900 }
14914 {
14919 }
14923 {
14928 }
14937 {
14941 {
14945 }
14947 {
14951 else
14955 }
14956 else
14958 }
14962 {
14969 else
14973 }
14976 {
14980 }
14982 {
14986 else
14990 }
14991 else
14992 {
14997 }
15005 ;
15007 {
15010 "%qE is neither a variable nor a function name in "
15013 else
15018 }
15020 {
15025 }
15027 {
15032 }
15036 {
15038 "%qE appears more than once on the same "
15041 }
15042 else
15049 {
15053 else
15058 }
15059 /* map_head bitmap is used as uniform_head if declare_simd. */
15067 {
15070 {
15075 }
15077 {
15082 }
15083 }
15094 {
15096 "%<nowait%> clause must not be used together "
15100 }
15107 {
15109 "%<order%> clause must not be used together "
15113 }
15115 {
15116 /* Silently remove duplicates. */
15119 }
15127 {
15133 }
15200 {
15202 "%<order%> clause must not be used together "
15206 }
15222 {
15224 "%<inbranch%> clause is incompatible with "
15228 }
15239 {
15244 }
15249 }
15252 {
15256 {
15260 }
15263 {
15269 {
15276 /* The __func__ variable and similar function-local
15277 predefined variables may be listed in a shared or
15278 firstprivate clause. */
15287 }
15289 {
15295 }
15299 {
15301 "%<const%> qualified %qE may appear only in "
15304 }
15305 }
15306 }
15310 else
15312 }
15315 && safelen
15318 {
15320 "%<simdlen%> clause value is bigger than "
15324 }
15327 && schedule_clause
15330 {
15332 "%<nonmonotonic%> schedule modifier specified together "
15338 }
15341 {
15343 "%qs clause specified together with %<inscan%> "
15346 }
15349 {
15351 "%qs clause specified together with %<inscan%> "
15354 }
15358 || allocate_seen
15361 {
15365 {
15370 {
15380 }
15381 /* FALLTHRU */
15392 }
15397 {
15399 "%<linear%> clause step is a parameter %qD not "
15403 }
15409 {
15420 }
15424 else
15426 }
15430 {
15435 {
15437 "%qD specified in %<allocate%> clause but not in "
15440 }
15443 else
15445 }
15448 {
15450 "%<nogroup%> clause must not be used together with "
15453 }
15456 {
15458 {
15460 "%<detach%> clause must not be used together with "
15463 }
15464 else
15465 {
15469 {
15476 {
15478 "the event handle of a %<detach%> clause "
15481 }
15484 else
15486 }
15487 }
15488 }
15492 }
15494 /* Return code to initialize DST with a copy constructor from SRC.
15495 C doesn't have copy constructors nor assignment operators, only for
15496 _Atomic vars we need to perform __atomic_load from src into a temporary
15497 followed by __atomic_store of the temporary to dst. */
15499 tree
15501 {
15516 /* Expansion of a generic atomic load may require an addition
15517 element, so allocate enough to prevent a resize. */
15520 /* Build __atomic_load (&src, &tmp, SEQ_CST); */
15529 /* Build __atomic_store (&dst, &tmp, SEQ_CST); */
15536 }
15538 /* Create a transaction node. */
15540 tree
15542 {
15549 }
15551 /* Make a variant type in the proper way for C/C++, propagating qualifiers
15552 down to the element type of an array. If ORIG_QUAL_TYPE is not
15553 NULL, then it should be used as the qualified type
15554 ORIG_QUAL_INDIRECT levels down in array type derivation (to
15555 preserve information about the typedef name from which an array
15556 type was derived). */
15558 tree
15561 {
15566 {
15567 tree t;
15572 /* See if we already have an identically qualified type. */
15575 else
15577 {
15584 }
15586 {
15597 {
15598 tree unqualified_canon
15603 {
15604 unqualified_canon
15607 }
15610 }
15611 else
15613 }
15615 }
15617 /* A restrict-qualified pointer type must be a pointer to object or
15618 incomplete type. Note that the use of POINTER_TYPE_P also allows
15619 REFERENCE_TYPEs, which is appropriate for C++. */
15623 {
15626 }
15629 ? orig_qual_type
15631 /* A variant type does not inherit the list of incomplete vars from the
15632 type main variant. */
15638 }
15640 /* Build a VA_ARG_EXPR for the C parser. */
15642 tree
15644 {
15647 /* VA_ARG_EXPR cannot be used for a scalar va_list with reverse storage
15648 order because it takes the address of the expression. */
15651 {
15654 }
15656 {
15660 }
15665 }
15667 /* Return truthvalue of whether T1 is the same tree structure as T2.
15668 Return 1 if they are the same. Return false if they are different. */
15670 bool
15672 {
15691 /* They might have become equal now. */
15699 {
15723 /* We need to do this when determining whether or not two
15724 non-type pointer to member function template arguments
15725 are the same. */
15729 {
15733 {
15738 }
15739 }
15753 {
15768 }
15771 {
15775 /* Special case: if either target is an unallocated VAR_DECL,
15776 it means that it's going to be unified with whatever the
15777 TARGET_EXPR is really supposed to initialize, so treat it
15778 as being equivalent to anything. */
15789 }
15806 {
15815 }
15819 }
15822 {
15830 {
15834 {
15846 }
15857 }
15863 }
15864 /* We can get here with --disable-checking. */
15866 }
15868 /* Returns true when the function declaration FNDECL is implicit,
15869 introduced as a result of a call to an otherwise undeclared
15870 function, and false otherwise. */
15872 bool
15874 {
15876 }