| blob | daa2e12a25ff5ebb2375ae471c662d0468f13a98 |
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;
1922 /* In C++ array compound literals are temporary objects unless they are
1923 const or appear in namespace scope, so they are destroyed too soon
1924 to use them for much of anything (c++/53220). */
1926 {
1930 "converting an array compound literal to a pointer "
1932 }
1936 }
1938 /* Convert the function expression EXP to a pointer. */
1939 static tree
1941 {
1952 }
1954 /* Mark EXP as read, not just set, for set but not used -Wunused
1955 warning purposes. */
1957 void
1959 {
1961 {
1971 CASE_CONVERT:
1977 /* Pattern match what build_atomic_assign produces with modifycode
1978 NOP_EXPR. */
1982 {
1988 {
1996 {
2009 }
2011 {
2017 }
2018 }
2019 }
2020 /* FALLTHRU */
2026 }
2027 }
2029 /* Perform the default conversion of arrays and functions to pointers.
2030 Return the result of converting EXP. For any other expression, just
2031 return EXP.
2033 LOC is the location of the expression. */
2035 struct c_expr
2037 {
2043 {
2045 {
2052 {
2056 }
2063 {
2064 /* Before C99, non-lvalue arrays do not decay to pointers.
2065 Normally, using such an array would be invalid; but it can
2066 be used correctly inside sizeof or as a statement expression.
2067 Thus, do not give an error here; an error will result later. */
2069 }
2072 }
2079 }
2082 }
2084 struct c_expr
2086 {
2089 }
2091 /* Return whether EXPR should be treated as an atomic lvalue for the
2092 purposes of load and store handling. */
2094 static bool
2096 {
2104 /* Ignore _Atomic on register variables, since their addresses can't
2105 be taken so (a) atomicity is irrelevant and (b) the normal atomic
2106 sequences wouldn't work. Ignore _Atomic on structures containing
2107 bit-fields, since accessing elements of atomic structures or
2108 unions is undefined behavior (C11 6.5.2.3#5), but it's unclear if
2109 it's undefined at translation time or execution time, and the
2110 normal atomic sequences again wouldn't work. */
2112 {
2117 }
2121 }
2123 /* Convert expression EXP (location LOC) from lvalue to rvalue,
2124 including converting functions and arrays to pointers if CONVERT_P.
2125 If READ_P, also mark the expression as having been read. */
2127 struct c_expr
2130 {
2138 {
2147 /* Expansion of a generic atomic load may require an addition
2148 element, so allocate enough to prevent a resize. */
2151 /* Remove the qualifiers for the rest of the expressions and
2152 create the VAL temp variable to hold the RHS. */
2159 /* Issue __atomic_load (&expr, &tmp, SEQ_CST); */
2166 /* EXPR is always read. */
2169 /* Return tmp which contains the value loaded. */
2172 }
2175 exp.value = convert (build_qualified_type (TREE_TYPE (exp.value), TYPE_UNQUALIFIED), exp.value);
2177 }
2179 /* EXP is an expression of integer type. Apply the integer promotions
2180 to it and return the promoted value. */
2182 tree
2184 {
2190 /* Normally convert enums to int,
2191 but convert wide enums to something wider. */
2193 {
2201 }
2203 /* ??? This should no longer be needed now bit-fields have their
2204 proper types. */
2207 /* If it's thinner than an int, promote it like a
2208 c_promoting_integer_type_p, otherwise leave it alone. */
2214 {
2215 /* Preserve unsignedness if not really getting any wider. */
2221 }
2224 }
2227 /* Perform default promotions for C data used in expressions.
2228 Enumeral types or short or char are converted to int.
2229 In addition, manifest constants symbols are replaced by their values. */
2231 tree
2233 {
2234 tree orig_exp;
2237 tree promoted_type;
2241 /* Functions and arrays have been converted during parsing. */
2246 /* Constants can be used directly unless they're not loadable. */
2250 /* Strip no-op conversions. */
2258 {
2262 }
2276 }
2277 \f
2278 /* Look up COMPONENT in a structure or union TYPE.
2280 If the component name is not found, returns NULL_TREE. Otherwise,
2281 the return value is a TREE_LIST, with each TREE_VALUE a FIELD_DECL
2282 stepping down the chain to the component, which is in the last
2283 TREE_VALUE of the list. Normally the list is of length one, but if
2284 the component is embedded within (nested) anonymous structures or
2285 unions, the list steps down the chain to the component. */
2287 static tree
2289 {
2290 tree field;
2292 /* If TYPE_LANG_SPECIFIC is set, then it is a sorted array of pointers
2293 to the field elements. Use a binary search on this array to quickly
2294 find the element. Otherwise, do a linear search. TYPE_LANG_SPECIFIC
2295 will always be set for structures which have many elements.
2297 Duplicate field checking replaces duplicates with NULL_TREE so
2298 TYPE_LANG_SPECIFIC arrays are potentially no longer sorted. In that
2299 case just iterate using DECL_CHAIN. */
2303 {
2311 {
2316 {
2317 /* Step through all anon unions in linear fashion. */
2319 {
2322 {
2328 /* The Plan 9 compiler permits referring
2329 directly to an anonymous struct/union field
2330 using a typedef name. */
2338 }
2339 }
2341 /* Entire record is only anon unions. */
2345 /* Restart the binary search, with new lower bound. */
2347 }
2353 else
2355 }
2361 }
2362 else
2363 {
2365 {
2368 {
2374 /* The Plan 9 compiler permits referring directly to an
2375 anonymous struct/union field using a typedef
2376 name. */
2383 }
2387 }
2391 }
2394 }
2396 /* Recursively append candidate IDENTIFIER_NODEs to CANDIDATES. */
2398 static void
2401 {
2402 tree field;
2404 {
2408 candidates);
2412 }
2413 }
2415 /* Like "lookup_field", but find the closest matching IDENTIFIER_NODE,
2416 rather than returning a TREE_LIST for an exact match. */
2418 static tree
2420 {
2423 /* First, gather a list of candidates. */
2430 }
2432 /* Support function for build_component_ref's error-handling.
2434 Given DATUM_TYPE, and "DATUM.COMPONENT", where DATUM is *not* a
2435 struct or union, should we suggest "DATUM->COMPONENT" as a hint? */
2437 static bool
2439 {
2440 /* We don't do it for Objective-C, since Objective-C 2.0 dot-syntax
2441 allows "." for ptrs; we could be handling a failed attempt
2442 to access a property. */
2446 /* Only suggest it for pointers... */
2450 /* ...to structs/unions. */
2455 else
2457 }
2459 /* Make an expression to refer to the COMPONENT field of structure or
2460 union value DATUM. COMPONENT is an IDENTIFIER_NODE. LOC is the
2461 location of the COMPONENT_REF. COMPONENT_LOC is the location
2462 of COMPONENT. */
2464 tree
2466 location_t component_loc)
2467 {
2471 tree ref;
2477 /* Detect Objective-C property syntax object.property. */
2482 /* See if there is a field or component with name COMPONENT. */
2485 {
2487 {
2490 }
2495 {
2498 {
2499 /* Attempt to provide a fixit replacement hint, if
2500 we have a valid range for the component. */
2501 location_t reported_loc
2509 }
2510 else
2513 }
2515 /* Accessing elements of atomic structures or unions is undefined
2516 behavior (C11 6.5.2.3#5). */
2518 {
2522 else
2525 }
2527 /* Chain the COMPONENT_REFs if necessary down to the FIELD.
2528 This might be better solved in future the way the C++ front
2529 end does it - by giving the anonymous entities each a
2530 separate name and type, and then have build_component_ref
2531 recursively call itself. We can't do that here. */
2532 do
2533 {
2536 tree subtype;
2542 /* If this is an rvalue, it does not have qualifiers in C
2543 standard terms and we must avoid propagating such
2544 qualifiers down to a non-lvalue array that is then
2545 converted to a pointer. */
2546 use_datum_quals = (datum_lvalue
2555 NULL_TREE);
2570 }
2574 }
2576 {
2577 /* Special-case the error message for "ptr.field" for the case
2578 where the user has confused "." vs "->". */
2580 /* "loc" should be the "." token. */
2584 datum);
2586 }
2590 component);
2593 }
2594 \f
2595 /* Given an expression PTR for a pointer, return an expression
2596 for the value pointed to.
2597 ERRORSTRING is the name of the operator to appear in error messages.
2599 LOC is the location to use for the generated tree. */
2601 tree
2603 {
2606 tree ref;
2609 {
2612 {
2613 /* If a warning is issued, mark it to avoid duplicates from
2614 the backend. This only needs to be done at
2615 warn_strict_aliasing > 2. */
2620 }
2625 {
2629 }
2630 else
2631 {
2639 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
2640 so that we get the proper error message if the result is used
2641 to assign to. Also, &* is supposed to be a no-op.
2642 And ANSI C seems to specify that the type of the result
2643 should be the const type. */
2644 /* A de-reference of a pointer to const is not a const. It is valid
2645 to change it via some other pointer. */
2652 }
2653 }
2658 }
2660 /* This handles expressions of the form "a[i]", which denotes
2661 an array reference.
2663 This is logically equivalent in C to *(a+i), but we may do it differently.
2664 If A is a variable or a member, we generate a primitive ARRAY_REF.
2665 This avoids forcing the array out of registers, and can work on
2666 arrays that are not lvalues (for example, members of structures returned
2667 by functions).
2669 For vector types, allow vector[i] but not i[vector], and create
2670 *(((type*)&vectortype) + i) for the expression.
2672 LOC is the location to use for the returned expression. */
2674 tree
2676 {
2677 tree ret;
2685 /* Allow vector[index] but not index[vector]. */
2687 {
2690 {
2695 }
2698 }
2701 {
2704 }
2707 {
2710 }
2712 /* ??? Existing practice has been to warn only when the char
2713 index is syntactically the index, not for char[array]. */
2717 /* Apply default promotions *after* noticing character types. */
2728 {
2731 /* An array that is indexed by a non-constant
2732 cannot be stored in a register; we must be able to do
2733 address arithmetic on its address.
2734 Likewise an array of elements of variable size. */
2738 {
2741 }
2742 /* An array that is indexed by a constant value which is not within
2743 the array bounds cannot be stored in a register either; because we
2744 would get a crash in store_bit_field/extract_bit_field when trying
2745 to access a non-existent part of the register. */
2749 {
2752 }
2756 {
2765 "ISO C90 forbids subscripting non-lvalue "
2767 }
2771 /* Array ref is const/volatile if the array elements are
2772 or if the array is. */
2781 /* This was added by rms on 16 Nov 91.
2782 It fixes vol struct foo *a; a->elts[1]
2783 in an inline function.
2784 Hope it doesn't break something else. */
2791 }
2792 else
2793 {
2804 RO_ARRAY_INDEXING);
2808 }
2809 }
2810 \f
2811 /* Build an external reference to identifier ID. FUN indicates
2812 whether this will be used for a function call. LOC is the source
2813 location of the identifier. This sets *TYPE to the type of the
2814 identifier, which is not the same as the type of the returned value
2815 for CONST_DECLs defined as enum constants. If the type of the
2816 identifier is not available, *TYPE is set to NULL. */
2817 tree
2819 {
2820 tree ref;
2823 /* In Objective-C, an instance variable (ivar) may be preferred to
2824 whatever lookup_name() found. */
2829 {
2832 }
2834 /* Implicit function declaration. */
2837 /* Don't complain about something that's already been
2838 complained about. */
2840 else
2841 {
2844 }
2852 /* Recursive call does not count as usage. */
2854 {
2856 }
2859 {
2866 }
2869 {
2875 {
2880 }
2884 }
2889 {
2894 }
2895 /* C99 6.7.4p3: An inline definition of a function with external
2896 linkage ... shall not contain a reference to an identifier with
2897 internal linkage. */
2906 csi_internal);
2909 }
2911 /* Record details of decls possibly used inside sizeof or typeof. */
2912 struct maybe_used_decl
2913 {
2914 /* The decl. */
2915 tree decl;
2916 /* The level seen at (in_sizeof + in_typeof). */
2918 /* The next one at this level or above, or NULL. */
2920 };
2924 /* Record that DECL, an undefined static function reference seen
2925 inside sizeof or typeof, might be used if the operand of sizeof is
2926 a VLA type or the operand of typeof is a variably modified
2927 type. */
2929 static void
2931 {
2937 }
2939 /* Pop the stack of decls possibly used inside sizeof or typeof. If
2940 USED is false, just discard them. If it is true, mark them used
2941 (if no longer inside sizeof or typeof) or move them to the next
2942 level up (if still inside sizeof or typeof). */
2944 void
2946 {
2950 {
2952 {
2955 else
2957 }
2959 }
2962 }
2964 /* Return the result of sizeof applied to EXPR. */
2966 struct c_expr
2968 {
2971 {
2976 }
2977 else
2978 {
2983 {
2984 auto_diagnostic_group d;
2986 "%<sizeof%> on array function parameter %qE will "
2990 }
2999 {
3000 /* sizeof is evaluated when given a vla (C99 6.5.3.4p2). */
3005 }
3007 }
3009 }
3011 /* Return the result of sizeof applied to T, a structure for the type
3012 name passed to sizeof (rather than the type itself). LOC is the
3013 location of the original expression. */
3015 struct c_expr
3017 {
3018 tree type;
3030 {
3031 /* If the type is a [*] array, it is a VLA but is represented as
3032 having a size of zero. In such a case we must ensure that
3033 the result of sizeof does not get folded to a constant by
3034 c_fully_fold, because if the size is evaluated the result is
3035 not constant and so constraints on zero or negative size
3036 arrays must not be applied when this sizeof call is inside
3037 another array declarator. */
3043 }
3047 }
3049 /* Build a function call to function FUNCTION with parameters PARAMS.
3050 The function call is at LOC.
3051 PARAMS is a list--a chain of TREE_LIST nodes--in which the
3052 TREE_VALUE of each node is a parameter-expression.
3053 FUNCTION's data type may be a function type or a pointer-to-function. */
3055 tree
3057 {
3059 tree ret;
3067 }
3069 /* Give a note about the location of the declaration of DECL. */
3071 static void
3073 {
3077 }
3079 /* Build a function call to function FUNCTION with parameters PARAMS.
3080 If FUNCTION is the result of resolving an overloaded target built-in,
3081 ORIG_FUNDECL is the original function decl, otherwise it is null.
3082 ORIGTYPES, if not NULL, is a vector of types; each element is
3083 either NULL or the original type of the corresponding element in
3084 PARAMS. The original type may differ from TREE_TYPE of the
3085 parameter for enums. FUNCTION's data type may be a function type
3086 or pointer-to-function. This function changes the elements of
3087 PARAMS. */
3089 tree
3093 {
3096 tree tem;
3101 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
3104 /* Convert anything with function type to a pointer-to-function. */
3106 {
3114 /* Atomic functions have type checking/casting already done. They are
3115 often rewritten and don't match the original parameter list. */
3118 }
3122 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
3123 expressions, like those used for ObjC messenger dispatches. */
3136 {
3140 function);
3142 {
3145 function);
3147 }
3148 else
3152 }
3157 /* fntype now gets the type of function pointed to. */
3160 /* Convert the parameters to the types declared in the
3161 function prototype, or apply default promotions. */
3168 /* Check that the function is called through a compatible prototype.
3169 If it is not, warn. */
3174 {
3177 /* This situation leads to run-time undefined behavior. We can't,
3178 therefore, simply error unless we can prove that all possible
3179 executions of the program must execute the code. */
3186 }
3190 /* Check that arguments to builtin functions match the expectations. */
3197 /* Check that the arguments to the function are valid. */
3203 {
3205 result
3208 else
3214 }
3215 else
3218 /* If -Wnonnull warning has been diagnosed, avoid diagnosing it again
3219 later. */
3223 /* In this improbable scenario, a nested function returns a VM type.
3224 Create a TARGET_EXPR so that the call always has a LHS, much as
3225 what the C++ FE does for functions returning non-PODs. */
3227 {
3231 }
3234 {
3239 }
3241 }
3243 /* Like build_function_call_vec, but call also resolve_overloaded_builtin. */
3245 tree
3249 {
3250 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
3253 /* Convert anything with function type to a pointer-to-function. */
3255 {
3256 /* Implement type-directed function overloading for builtins.
3257 resolve_overloaded_builtin and targetm.resolve_overloaded_builtin
3258 handle all the type checking. The result is a complete expression
3259 that implements this function call. */
3263 }
3265 }
3266 \f
3267 /* Helper for convert_arguments called to convert the VALue of argument
3268 number ARGNUM from ORIGTYPE to the corresponding parameter number
3269 PARMNUM and TYPE.
3270 PLOC is the location where the conversion is being performed.
3271 FUNCTION and FUNDECL are the same as in convert_arguments.
3272 VALTYPE is the original type of VAL before the conversion and,
3273 for EXCESS_PRECISION_EXPR, the operand of the expression.
3274 NPC is true if VAL represents the null pointer constant (VAL itself
3275 will have been folded to an integer constant).
3276 RNAME is the same as FUNCTION except in Objective C when it's
3277 the function selector.
3278 EXCESS_PRECISION is true when VAL was originally represented
3279 as EXCESS_PRECISION_EXPR.
3280 WARNOPT is the same as in convert_for_assignment. */
3282 static tree
3287 {
3288 /* Formal parm type is specified by a function prototype. */
3291 {
3295 }
3297 /* Optionally warn about conversions that differ from the default
3298 conversions. */
3300 {
3306 "passing argument %d of %qE as integer rather "
3312 "passing argument %d of %qE as integer rather "
3318 "passing argument %d of %qE as complex rather "
3324 "passing argument %d of %qE as floating rather "
3330 "passing argument %d of %qE as complex rather "
3336 "passing argument %d of %qE as floating rather "
3339 /* ??? At some point, messages should be written about
3340 conversions between complex types, but that's too messy
3341 to do now. */
3344 {
3345 /* Warn if any argument is passed as `float',
3346 since without a prototype it would be `double'. */
3350 "passing argument %d of %qE as %<float%> "
3354 /* Warn if mismatch between argument and prototype
3355 for decimal float types. Warn of conversions with
3356 binary float types and of precision narrowing due to
3357 prototype. */
3365 && (formal_prec
3368 && (valtype
3369 != dfloat64_type_node
3370 && (valtype
3373 && (valtype
3376 "passing argument %d of %qE as %qT "
3380 }
3381 /* Detect integer changing in width or signedness.
3382 These warnings are only activated with
3383 -Wtraditional-conversion, not with -Wtraditional. */
3387 {
3396 /* No warning if function asks for enum
3397 and the actual arg is that enum type. */
3398 ;
3401 "passing argument %d of %qE "
3405 ;
3406 /* Don't complain if the formal parameter type
3407 is an enum, because we can't tell now whether
3408 the value was an enum--even the same enum. */
3410 ;
3413 /* Change in signedness doesn't matter
3414 if a constant value is unaffected. */
3415 ;
3416 /* If the value is extended from a narrower
3417 unsigned type, it doesn't matter whether we
3418 pass it as signed or unsigned; the value
3419 certainly is the same either way. */
3422 ;
3425 "passing argument %d of %qE "
3428 else
3430 "passing argument %d of %qE "
3433 }
3434 }
3436 /* Possibly restore an EXCESS_PRECISION_EXPR for the
3437 sake of better warnings from convert_and_check. */
3452 }
3454 /* Convert the argument expressions in the vector VALUES
3455 to the types in the list TYPELIST.
3457 If TYPELIST is exhausted, or when an element has NULL as its type,
3458 perform the default conversions.
3460 ORIGTYPES is the original types of the expressions in VALUES. This
3461 holds the type of enum values which have been converted to integral
3462 types. It may be NULL.
3464 FUNCTION is a tree for the called function. It is used only for
3465 error messages, where it is formatted with %qE.
3467 This is also where warnings about wrong number of args are generated.
3469 ARG_LOC are locations of function arguments (if any).
3471 Returns the actual number of arguments processed (which may be less
3472 than the length of VALUES in some error situations), or -1 on
3473 failure. */
3475 static int
3479 {
3486 tree selector;
3488 /* Change pointer to function to the function itself for
3489 diagnostics. */
3494 /* Handle an ObjC selector specially for diagnostics. */
3497 /* For a call to a built-in function declared without a prototype,
3498 set to the built-in function's argument list. */
3501 /* For type-generic built-in functions, determine whether excess
3502 precision should be removed (classification) or not
3503 (comparison). */
3506 {
3509 {
3510 /* For a call to a built-in function declared without a prototype
3511 use the types of the parameters of the internal built-in to
3512 match those of the arguments to. */
3515 }
3517 /* For type-generic built-in functions, determine whether excess
3518 precision should be removed (classification) or not
3519 (comparison). */
3522 {
3535 /* The last argument of these type-generic builtins
3536 should not be promoted. */
3542 }
3543 }
3545 /* Scan the given expressions (VALUES) and types (TYPELIST), producing
3546 individual converted arguments. */
3554 {
3555 /* The type of the function parameter (if it was declared with one). */
3557 /* The type of the built-in function parameter (if the function
3558 is a built-in). Used to detect type incompatibilities in
3559 calls to built-ins declared without a prototype. */
3560 tree builtin_type = (builtin_typetail
3562 /* The original type of the argument being passed to the function. */
3564 /* The called function (or function selector in Objective C). */
3568 /* Set for EXCESS_PRECISION_EXPR arguments. */
3570 /* The value of the argument after conversion to the type
3571 of the function parameter it is passed to. */
3572 tree parmval;
3573 /* Some __atomic_* builtins have additional hidden argument at
3574 position 0. */
3575 location_t ploc
3581 {
3584 else
3588 }
3591 {
3593 "too many arguments to built-in function %qE "
3597 }
3600 {
3603 }
3605 /* Determine if VAL is a null pointer constant before folding it. */
3608 /* If there is excess precision and a prototype, convert once to
3609 the required type rather than converting via the semantic
3610 type. Likewise without a prototype a float value represented
3611 as long double should be converted once to double. But for
3612 type-generic classification functions excess precision must
3613 be removed here. */
3616 {
3619 }
3625 /* Some floating-point arguments must be promoted to double when
3626 no type is specified by a prototype. This applies to
3627 arguments of type float, and to architecture-specific types
3628 (ARM __fp16), but not to _FloatN or _FloatNx types. */
3637 {
3638 /* Promote this argument, unless it has a _FloatN or
3639 _FloatNx type. */
3643 {
3646 }
3647 }
3650 {
3655 }
3657 {
3660 else
3661 {
3662 /* Convert `float' to `double'. */
3665 "implicit conversion from %qT to %qT when passing "
3669 }
3670 }
3673 /* A "double" argument with excess precision being passed
3674 without a prototype or in variable arguments.
3675 The last argument of __builtin_*_overflow_p should not be
3676 promoted. */
3680 {
3683 }
3685 {
3687 }
3688 else
3689 /* Convert `short' and `char' to full-size `int'. */
3697 {
3698 /* For a call to a built-in function declared without a prototype,
3699 perform the conversions from the argument to the expected type
3700 but issue warnings rather than errors for any mismatches.
3701 Ignore the converted argument and use the PARMVAL obtained
3702 above by applying default conversions instead. */
3706 excess_precision,
3707 OPT_Wbuiltin_declaration_mismatch);
3708 }
3715 }
3720 {
3724 }
3727 {
3733 "too few arguments to built-in function %qE "
3736 }
3739 }
3740 \f
3741 /* This is the entry point used by the parser to build unary operators
3742 in the input. CODE, a tree_code, specifies the unary operator, and
3743 ARG is the operand. For unary plus, the C parser currently uses
3744 CONVERT_EXPR for code.
3746 LOC is the location to use for the tree generated.
3747 */
3749 struct c_expr
3751 {
3758 {
3760 }
3761 else
3762 {
3767 }
3769 /* We are typically called when parsing a prefix token at LOC acting on
3770 ARG. Reflect this by updating the source range of the result to
3771 start at LOC and end at the end of ARG. */
3776 }
3778 /* Returns true if TYPE is a character type, *not* including wchar_t. */
3780 bool
3782 {
3788 }
3790 /* This is the entry point used by the parser to build binary operators
3791 in the input. CODE, a tree_code, specifies the binary operator, and
3792 ARG1 and ARG2 are the operands. In addition to constructing the
3793 expression, we check for operands that were written with other binary
3794 operators in a way that is likely to confuse the user.
3796 LOCATION is the location of the binary operator. */
3798 struct c_expr
3801 {
3819 {
3824 }
3833 /* Check for cases such as x+y<<z which users are likely
3834 to misinterpret. */
3844 {
3848 {
3852 else
3854 }
3856 {
3860 else
3862 }
3865 }
3871 /* Avoid warning for !!x == y. */
3874 {
3875 /* Avoid warning for !b == y where b has _Bool type. */
3880 {
3882 do
3883 {
3890 else
3892 }
3894 }
3897 }
3899 /* Warn about comparisons against string literals, with the exception
3900 of testing for equality or inequality of a string literal with NULL. */
3902 {
3909 /* Warn for ptr == '\0', it's likely that it should've been ptr[0]. */
3913 {
3914 auto_diagnostic_group d;
3916 "comparison between pointer and zero character "
3920 }
3924 {
3925 auto_diagnostic_group d;
3927 "comparison between pointer and zero character "
3931 }
3932 }
3943 /* Warn about comparisons of different enum types. */
3954 }
3955 \f
3956 /* Return a tree for the difference of pointers OP0 and OP1.
3957 The resulting tree has type ptrdiff_t. If POINTER_SUBTRACT sanitization is
3958 enabled, assign to INSTRUMENT_EXPR call to libsanitizer. */
3960 static tree
3962 {
3972 /* If the operands point into different address spaces, we need to
3973 explicitly convert them to pointers into the common address space
3974 before we can subtract the numerical address values. */
3976 {
3977 addr_space_t as_common;
3978 tree common_type;
3980 /* Determine the common superset address space. This is guaranteed
3981 to exist because the caller verified that comp_target_types
3982 returned non-zero. */
3989 }
3991 /* Determine integer type result of the subtraction. This will usually
3992 be the same as the result type (ptrdiff_t), but may need to be a wider
3993 type if pointers for the address space are wider than ptrdiff_t. */
3996 else
4008 {
4014 }
4016 /* First do the subtraction, then build the divide operator
4017 and only convert at the very end.
4018 Do not do default conversions in case restype is a short type. */
4020 /* POINTER_DIFF_EXPR requires a signed integer type of the same size as
4021 pointers. If some platform cannot provide that, or has a larger
4022 ptrdiff_type to support differences larger than half the address
4023 space, cast the pointers to some larger integer type and do the
4024 computations in that type. */
4028 else
4029 {
4030 /* Cast away qualifiers. */
4034 }
4036 /* This generates an error if op1 is pointer to incomplete type. */
4049 /* Divide by the size, in easiest possible way. */
4053 /* Convert to final result type if necessary. */
4055 }
4056 \f
4057 /* Expand atomic compound assignments into an appropriate sequence as
4058 specified by the C11 standard section 6.5.16.2.
4060 _Atomic T1 E1
4061 T2 E2
4062 E1 op= E2
4064 This sequence is used for all types for which these operations are
4065 supported.
4067 In addition, built-in versions of the 'fe' prefixed routines may
4068 need to be invoked for floating point (real, complex or vector) when
4069 floating-point exceptions are supported. See 6.5.16.2 footnote 113.
4071 T1 newval;
4072 T1 old;
4073 T1 *addr
4074 T2 val
4075 fenv_t fenv
4077 addr = &E1;
4078 val = (E2);
4079 __atomic_load (addr, &old, SEQ_CST);
4080 feholdexcept (&fenv);
4081 loop:
4082 newval = old op val;
4083 if (__atomic_compare_exchange_strong (addr, &old, &newval, SEQ_CST,
4084 SEQ_CST))
4085 goto done;
4086 feclearexcept (FE_ALL_EXCEPT);
4087 goto loop:
4088 done:
4089 feupdateenv (&fenv);
4091 The compiler will issue the __atomic_fetch_* built-in when possible,
4092 otherwise it will generate the generic form of the atomic operations.
4093 This requires temp(s) and has their address taken. The atomic processing
4094 is smart enough to figure out when the size of an object can utilize
4095 a lock-free version, and convert the built-in call to the appropriate
4096 lock-free routine. The optimizers will then dispose of any temps that
4097 are no longer required, and lock-free implementations are utilized as
4098 long as there is target support for the required size.
4100 If the operator is NOP_EXPR, then this is a simple assignment, and
4101 an __atomic_store is issued to perform the assignment rather than
4102 the above loop. */
4104 /* Build an atomic assignment at LOC, expanding into the proper
4105 sequence to store LHS MODIFYCODE= RHS. Return a value representing
4106 the result of the operation, unless RETURN_OLD_P, in which case
4107 return the old value of LHS (this is only for postincrement and
4108 postdecrement). */
4110 static tree
4113 {
4126 tree nonatomic_rhs_semantic_type;
4127 tree rhs_type;
4134 /* Allocate enough vector items for a compare_exchange. */
4137 /* Create a compound statement to hold the sequence of statements
4138 with a loop. */
4140 {
4143 /* For consistency with build_modify_expr on non-_Atomic,
4144 mark the lhs as read. Also, it would be very hard to match
4145 such expressions in mark_exp_read. */
4147 }
4149 /* Remove any excess precision (which is only present here in the
4150 case of compound assignments). */
4152 {
4155 }
4158 /* Fold the RHS if it hasn't already been folded. */
4162 /* Remove the qualifiers for the rest of the expressions and create
4163 the VAL temp variable to hold the RHS. */
4167 TYPE_UNQUALIFIED);
4172 NULL_TREE);
4178 /* NOP_EXPR indicates it's a straight store of the RHS. Simply issue
4179 an atomic_store. */
4181 {
4183 /* Build __atomic_store (&lhs, &val, SEQ_CST) */
4194 /* VAL is the value which was stored, return a COMPOUND_STMT of
4195 the statement and that value. */
4197 }
4199 /* Attempt to implement the atomic operation as an __atomic_fetch_* or
4200 __atomic_*_fetch built-in rather than a CAS loop. atomic_bool type
4201 isn't applicable for such builtins. ??? Do we want to handle enums? */
4204 {
4205 built_in_function fncode;
4207 {
4210 fncode = (return_old_p
4211 ? BUILT_IN_ATOMIC_FETCH_ADD_N
4215 fncode = (return_old_p
4216 ? BUILT_IN_ATOMIC_FETCH_SUB_N
4220 fncode = (return_old_p
4221 ? BUILT_IN_ATOMIC_FETCH_AND_N
4225 fncode = (return_old_p
4226 ? BUILT_IN_ATOMIC_FETCH_OR_N
4230 fncode = (return_old_p
4231 ? BUILT_IN_ATOMIC_FETCH_XOR_N
4236 }
4238 /* We can only use "_1" through "_16" variants of the atomic fetch
4239 built-ins. */
4244 /* If this is a pointer type, we need to multiply by the size of
4245 the pointer target type. */
4247 {
4249 /* ??? This would introduce -Wdiscarded-qualifiers
4250 warning: __atomic_fetch_* expect volatile void *
4251 type as the first argument. (Assignments between
4252 atomic and non-atomic objects are OK.) */
4259 }
4261 /* Build __atomic_fetch_* (&lhs, &val, SEQ_CST), or
4262 __atomic_*_fetch (&lhs, &val, SEQ_CST). */
4277 /* Finish the compound statement. */
4280 /* NEWVAL is the value which was stored, return a COMPOUND_STMT of
4281 the statement and that value. */
4283 }
4285 cas_loop:
4286 /* Create the variables and labels required for the op= form. */
4303 /* __atomic_load (addr, &old, SEQ_CST). */
4310 NULL_TREE);
4314 /* Create the expressions for floating-point environment
4315 manipulation, if required. */
4325 /* loop: */
4328 /* newval = old + val; */
4333 {
4337 }
4338 else
4344 {
4346 NULL_TREE);
4349 }
4351 /* if (__atomic_compare_exchange (addr, &old, &new, false, SEQ_CST, SEQ_CST))
4352 goto done; */
4372 /* goto loop; */
4377 /* done: */
4383 /* Finish the compound statement. */
4386 /* NEWVAL is the value that was successfully stored, return a
4387 COMPOUND_EXPR of the statement and the appropriate value. */
4390 }
4392 /* Construct and perhaps optimize a tree representation
4393 for a unary operation. CODE, a tree_code, specifies the operation
4394 and XARG is the operand.
4395 For any CODE other than ADDR_EXPR, NOCONVERT suppresses the default
4396 promotions (such as from short to int).
4397 For ADDR_EXPR, the default promotions are not applied; NOCONVERT allows
4398 non-lvalues; this is only used to handle conversion of non-lvalue arrays
4399 to pointers in C99.
4401 LOCATION is the location of the operator. */
4403 tree
4406 {
4407 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
4411 tree val;
4432 {
4435 }
4438 {
4441 }
4444 {
4446 /* This is used for unary plus, because a CONVERT_EXPR
4447 is enough to prevent anybody from looking inside for
4448 associativity, but won't generate any code. */
4452 {
4455 }
4465 {
4468 }
4474 /* ~ works on integer types and non float vectors. */
4478 {
4481 /* Warn if the expression has boolean value. */
4487 {
4488 auto_diagnostic_group d;
4491 {
4495 }
4496 }
4499 }
4501 {
4507 }
4508 else
4509 {
4512 }
4517 {
4520 }
4527 {
4530 }
4536 /* Conjugating a real value is a no-op, but allow it anyway. */
4539 {
4542 }
4551 {
4555 }
4557 {
4560 }
4561 else
4564 /* If the TRUTH_NOT_EXPR has been folded, reset the location. */
4584 {
4587 noconvert);
4595 }
4597 /* Complain about anything that is not a true lvalue. In
4598 Objective-C, skip this check for property_refs. */
4603 ? lv_increment
4608 {
4612 else
4615 }
4618 {
4622 else
4625 }
4627 /* Ensure the argument is fully folded inside any SAVE_EXPR. */
4633 /* Increment or decrement the real part of the value,
4634 and don't change the imaginary part. */
4636 {
4643 {
4655 }
4656 }
4658 /* Report invalid types. */
4664 {
4667 else
4671 }
4673 {
4674 tree inc;
4678 /* Compute the increment. */
4681 {
4682 /* If pointer target is an incomplete type,
4683 we just cannot know how to do the arithmetic. */
4685 {
4690 else
4694 }
4697 {
4701 else
4704 }
4705 else
4711 }
4713 {
4714 /* For signed fract types, we invert ++ to -- or
4715 -- to ++, and change inc from 1 to -1, because
4716 it is not possible to represent 1 in signed fract constants.
4717 For unsigned fract types, the result always overflows and
4718 we get an undefined (original) or the maximum value. */
4730 }
4731 else
4732 {
4737 }
4739 /* If 'arg' is an Objective-C PROPERTY_REF expression, then we
4740 need to ask Objective-C to build the increment or decrement
4741 expression for it. */
4746 /* Report a read-only lvalue. */
4748 {
4754 }
4761 /* If the argument is atomic, use the special code sequences for
4762 atomic compound assignment. */
4764 {
4769 ? PLUS_EXPR
4772 ? inc
4777 }
4781 else
4788 }
4791 /* Note that this operation never does default_conversion. */
4793 /* The operand of unary '&' must be an lvalue (which excludes
4794 expressions of type void), or, in C99, the result of a [] or
4795 unary '*' operator. */
4801 /* Let &* cancel out to simplify resulting code. */
4803 {
4804 /* Don't let this be an lvalue. */
4809 }
4811 /* Anything not already handled and not a true memory reference
4812 or a non-lvalue array is an error. */
4817 /* Move address operations inside C_MAYBE_CONST_EXPR to simplify
4818 folding later. */
4820 {
4823 noconvert);
4830 }
4832 /* Ordinary case; arg is a COMPONENT_REF or a decl. */
4835 /* If the lvalue is const or volatile, merge that into the type
4836 to which the address will point. This is only needed
4837 for function types. */
4841 {
4851 }
4854 {
4857 {
4861 }
4863 /* fall through */
4867 {
4871 {
4875 }
4880 "address of array with reverse scalar storage "
4882 }
4886 }
4896 /* ??? Cope with user tricks that amount to offsetof. Delete this
4897 when we have proper support for integer constant expressions. */
4901 {
4904 }
4913 }
4918 ret = (require_constant_value
4921 else
4923 return_build_unary_op:
4934 }
4936 /* Return nonzero if REF is an lvalue valid for this language.
4937 Lvalues can be assigned, unless their type has TYPE_READONLY.
4938 Lvalues can have their address taken, unless they have C_DECL_REGISTER. */
4940 bool
4942 {
4946 {
4973 }
4974 }
4975 \f
4976 /* Give a warning for storing in something that is read-only in GCC
4977 terms but not const in ISO C terms. */
4979 static void
4981 {
4983 {
4995 }
4997 }
5000 /* Return nonzero if REF is an lvalue valid for this language;
5001 otherwise, print an error message and return zero. USE says
5002 how the lvalue is being used and so selects the error message.
5003 LOCATION is the location at which any error should be reported. */
5005 static int
5007 {
5014 }
5015 \f
5016 /* Mark EXP saying that we need to be able to take the
5017 address of it; it should not be allocated in a register.
5018 Returns true if successful. ARRAY_REF_P is true if this
5019 is for ARRAY_REF construction - in that case we don't want
5020 to look through VIEW_CONVERT_EXPR from VECTOR_TYPE to ARRAY_TYPE,
5021 it is fine to use ARRAY_REFs for vector subscripts on vector
5022 register variables. */
5024 bool
5026 {
5031 {
5037 /* FALLTHRU */
5061 {
5063 {
5064 error
5067 }
5069 }
5071 {
5074 else
5077 }
5079 /* FALLTHRU */
5082 /* FALLTHRU */
5085 }
5086 }
5087 \f
5088 /* Convert EXPR to TYPE, warning about conversion problems with
5089 constants. SEMANTIC_TYPE is the type this conversion would use
5090 without excess precision. If SEMANTIC_TYPE is NULL, this function
5091 is equivalent to convert_and_check. This function is a wrapper that
5092 handles conversions that may be different than
5093 the usual ones because of excess precision. */
5095 static tree
5097 tree semantic_type)
5098 {
5102 /* For C11, integer conversions may have results with excess
5103 precision. */
5109 {
5110 /* For integers, we need to check the real conversion, not
5111 the conversion to the excess precision type. */
5113 }
5114 /* Result type is the excess precision type, which should be
5115 large enough, so do not check. */
5117 }
5119 /* If EXPR refers to a built-in declared without a prototype returns
5120 the actual type of the built-in and, if non-null, set *BLTIN to
5121 a pointer to the built-in. Otherwise return the type of EXPR
5122 and clear *BLTIN if non-null. */
5124 static tree
5126 {
5127 tree dummy;
5151 }
5153 /* Build and return a conditional expression IFEXP ? OP1 : OP2. If
5154 IFEXP_BCP then the condition is a call to __builtin_constant_p, and
5155 if folded to an integer constant then the unselected half may
5156 contain arbitrary operations not normally permitted in constant
5157 expressions. Set the location of the expression to LOC. */
5159 tree
5163 {
5164 tree type1;
5165 tree type2;
5173 tree ret;
5185 /* Promote both alternatives. */
5210 /* C90 does not permit non-lvalue arrays in conditional expressions.
5211 In C99 they will be pointers by now. */
5213 {
5216 }
5224 {
5227 {
5231 }
5233 {
5237 }
5238 }
5241 {
5252 }
5254 /* Quickly detect the usual case where op1 and op2 have the same type
5255 after promotion. */
5257 {
5260 else
5262 }
5267 {
5268 /* In C11, a conditional expression between a floating-point
5269 type and an integer type should convert the integer type to
5270 the evaluation format of the floating-point type, with
5271 possible excess precision. */
5275 {
5276 tree eptype;
5279 {
5283 }
5286 {
5290 }
5291 }
5296 "implicit conversion from %qT to %qT to "
5298 colon_loc);
5300 /* If -Wsign-compare, warn here if type1 and type2 have
5301 different signedness. We'll promote the signed to unsigned
5302 and later code won't know it used to be different.
5303 Do this check on the original types, so that explicit casts
5304 will be considered, but default promotions won't. */
5306 {
5311 {
5314 /* Do not warn if the result type is signed, since the
5315 signed type will only be chosen if it can represent
5316 all the values of the unsigned type. */
5319 else
5320 {
5324 /* Do not warn if the signed quantity is an
5325 unsuffixed integer literal (or some static
5326 constant expression involving such literals) and
5327 it is non-negative. This warning requires the
5328 operands to be folded for best results, so do
5329 that folding in this case even without
5330 warn_sign_compare to avoid warning options
5331 possibly affecting code generation. */
5332 c_inhibit_evaluation_warnings
5336 c_inhibit_evaluation_warnings
5339 c_inhibit_evaluation_warnings
5343 c_inhibit_evaluation_warnings
5347 {
5350 || (unsigned_op1
5355 "operand of %<?:%> changes signedness from "
5356 "%qT to %qT due to unsignedness of other "
5359 else
5361 "operand of %<?:%> changes signedness from "
5362 "%qT to %qT due to unsignedness of other "
5365 }
5370 }
5371 }
5372 }
5373 }
5375 {
5380 }
5382 {
5385 addr_space_t as_common;
5394 {
5398 }
5401 {
5406 "pointer to array loses qualifier "
5411 "ISO C forbids conditional expr between "
5415 }
5418 {
5423 "pointer to array loses qualifier "
5428 "ISO C forbids conditional expr between "
5432 }
5433 /* Objective-C pointer comparisons are a bit more lenient. */
5436 else
5437 {
5441 "pointer type mismatch between %qT and %qT "
5444 else
5447 result_type = build_pointer_type
5449 }
5450 }
5452 {
5456 else
5457 {
5459 }
5461 }
5463 {
5467 else
5468 {
5470 }
5472 }
5475 {
5478 else
5479 {
5482 }
5483 }
5485 /* Merge const and volatile flags of the incoming types. */
5486 result_type
5492 semantic_result_type);
5494 semantic_result_type);
5497 {
5500 }
5502 {
5505 }
5507 && op1_int_operands
5510 {
5517 }
5519 /* Need to convert condition operand into a vector mask. */
5521 {
5528 }
5532 else
5533 {
5535 {
5536 /* Use c_fully_fold here, since C_MAYBE_CONST_EXPR might be
5537 nested inside of the expression. */
5540 }
5544 }
5550 /* If the OP1 and OP2 are the same and don't have side-effects,
5551 warn here, because the COND_EXPR will be turned into OP1. */
5559 }
5560 \f
5561 /* EXPR is an expression, location LOC, whose result is discarded.
5562 Warn if it is a call to a nodiscard function (or a COMPOUND_EXPR
5563 whose right-hand operand is such a call, possibly recursively). */
5565 static void
5567 {
5571 {
5575 }
5581 tree attr;
5586 {
5591 auto_diagnostic_group d;
5595 "ignoring return value of %qD, declared with "
5597 else
5599 "ignoring return value of %qD, declared with "
5603 }
5604 else
5605 {
5613 auto_diagnostic_group d;
5617 "ignoring return value of type %qT, declared "
5620 else
5622 "ignoring return value of type %qT, declared "
5625 {
5627 {
5632 }
5633 }
5634 }
5635 }
5637 /* Return a compound expression that performs two expressions and
5638 returns the value of the second of them.
5640 LOC is the location of the COMPOUND_EXPR. */
5642 tree
5644 {
5647 tree ret;
5659 {
5662 }
5665 {
5666 /* The left-hand operand of a comma expression is like an expression
5667 statement: with -Wunused, we should warn if it doesn't have
5668 any side-effects, unless it was explicitly cast to (void). */
5670 {
5678 else
5681 }
5682 }
5685 {
5689 {
5693 }
5699 }
5701 /* With -Wunused, we should also warn if the left-hand operand does have
5702 side-effects, but computes a value which is not used. For example, in
5703 `foo() + bar(), baz()' the result of the `+' operator is not used,
5704 so we should issue a warning. */
5716 && expr1_int_operands
5725 }
5727 /* Issue -Wcast-qual warnings when appropriate. TYPE is the type to
5728 which we are casting. OTYPE is the type of the expression being
5729 cast. Both TYPE and OTYPE are pointer types. LOC is the location
5730 of the cast. -Wcast-qual appeared on the command line. Named
5731 address space qualifiers are not handled here, because they result
5732 in different warnings. */
5734 static void
5736 {
5743 /* Check that the qualifiers on IN_TYPE are a superset of the
5744 qualifiers of IN_OTYPE. The outermost level of POINTER_TYPE
5745 nodes is uninteresting and we stop as soon as we hit a
5746 non-POINTER_TYPE node on either type. */
5747 do
5748 {
5752 /* GNU C allows cv-qualified function types. 'const' means the
5753 function is very pure, 'volatile' means it can't return. We
5754 need to warn when such qualifiers are added, not when they're
5755 taken away. */
5760 else
5763 }
5772 /* There are qualifiers present in IN_OTYPE that are not present
5773 in IN_TYPE. */
5776 discarded);
5781 /* A cast from **T to const **T is unsafe, because it can cause a
5782 const value to be changed with no additional warning. We only
5783 issue this warning if T is the same on both sides, and we only
5784 issue the warning if there are the same number of pointers on
5785 both sides, as otherwise the cast is clearly unsafe anyhow. A
5786 cast is unsafe when a qualifier is added at one level and const
5787 is not present at all outer levels.
5789 To issue this warning, we check at each level whether the cast
5790 adds new qualifiers not already seen. We don't need to special
5791 case function types, as they won't have the same
5792 TYPE_MAIN_VARIANT. */
5802 do
5803 {
5808 {
5810 "to be safe all intermediate pointers in cast from "
5814 }
5817 }
5819 }
5821 /* Heuristic check if two parameter types can be considered ABI-equivalent. */
5823 static bool
5825 {
5833 /* The signedness of the parameter matters only when an integral
5834 type smaller than int is promoted to int, otherwise only the
5835 precision of the parameter matters.
5836 This check should make sure that the callee does not see
5837 undefined values in argument registers. */
5847 }
5849 /* Check if a type cast between two function types can be considered safe. */
5851 static bool
5853 {
5872 }
5874 /* Build an expression representing a cast to type TYPE of expression EXPR.
5875 LOC is the location of the cast-- typically the open paren of the cast. */
5877 tree
5879 {
5880 tree value;
5894 /* The ObjC front-end uses TYPE_MAIN_VARIANT to tie together types differing
5895 only in <protocol> qualifications. But when constructing cast expressions,
5896 the protocols do matter and must be kept around. */
5903 {
5906 }
5909 {
5912 }
5915 {
5919 }
5922 {
5927 /* Convert to remove any qualifiers from VALUE's type. */
5929 }
5931 {
5932 tree field;
5941 {
5942 tree t;
5954 }
5957 }
5958 else
5959 {
5963 {
5967 }
5971 /* Optionally warn about potentially worrisome casts. */
5977 /* Warn about conversions between pointers to disjoint
5978 address spaces. */
5982 {
5985 addr_space_t as_common;
5988 {
5999 else
6004 }
6005 }
6007 /* Warn about possible alignment problems. */
6013 /* Don't warn about opaque types, where the actual alignment
6014 restriction is unknown. */
6025 /* Unlike conversion of integers to pointers, where the
6026 warning is disabled for converting constants because
6027 of cases such as SIG_*, warn about converting constant
6028 pointers to integers. In some cases it may cause unwanted
6029 sign extension, and a warning is appropriate. */
6036 "cast from function call of type %qT "
6042 /* Don't warn about converting any constant. */
6051 /* If pedantic, warn for conversions between function and object
6052 pointer types, except for converting a null pointer constant
6053 to function pointer type. */
6078 "cast between incompatible function types"
6084 /* Ignore any integer overflow caused by the cast. */
6086 {
6088 {
6090 {
6091 /* Avoid clobbering a shared constant. */
6094 }
6095 }
6097 /* Reset VALUE's overflow flags, ensuring constant sharing. */
6099 }
6100 }
6102 /* Don't let a cast be an lvalue. */
6106 /* Don't allow the results of casting to floating-point or complex
6107 types be confused with actual constants, or casts involving
6108 integer and pointer types other than direct integer-to-integer
6109 and integer-to-pointer be confused with integer constant
6110 expressions and null pointer constants. */
6120 /* If the expression has integer operands and so can occur in an
6121 unevaluated part of an integer constant expression, ensure the
6122 return value reflects this. */
6130 }
6132 /* Interpret a cast of expression EXPR to type TYPE. LOC is the
6133 location of the open paren of the cast, or the position of the cast
6134 expr. */
6135 tree
6137 {
6138 tree type;
6141 tree ret;
6144 /* This avoids warnings about unprototyped casts on
6145 integers. E.g. "#define SIG_DFL (void(*)())0". */
6157 {
6164 }
6169 /* C++ does not permits types to be defined in a cast, but it
6170 allows references to incomplete types. */
6176 }
6177 \f
6178 /* Build an assignment expression of lvalue LHS from value RHS.
6179 If LHS_ORIGTYPE is not NULL, it is the original type of LHS, which
6180 may differ from TREE_TYPE (LHS) for an enum bitfield.
6181 MODIFYCODE is the code for a binary operator that we use
6182 to combine the old value of LHS with RHS to get the new value.
6183 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
6184 If RHS_ORIGTYPE is not NULL_TREE, it is the original type of RHS,
6185 which may differ from TREE_TYPE (RHS) for an enum value.
6187 LOCATION is the location of the MODIFYCODE operator.
6188 RHS_LOC is the location of the RHS. */
6190 tree
6194 {
6195 tree result;
6196 tree newrhs;
6203 /* Types that aren't fully specified cannot be used in assignments. */
6206 /* Avoid duplicate error messages from operands that had errors. */
6210 /* Ensure an error for assigning a non-lvalue array to an array in
6211 C90. */
6213 {
6216 }
6218 /* For ObjC properties, defer this check. */
6227 {
6230 rhs_origtype);
6239 }
6241 /* If a binary op has been requested, combine the old LHS value with the RHS
6242 producing the value we should actually store into the LHS. */
6245 {
6249 /* Construct the RHS for any non-atomic compound assignemnt. */
6251 {
6252 /* If in LHS op= RHS the RHS has side-effects, ensure they
6253 are preevaluated before the rest of the assignment expression's
6254 side-effects, because RHS could contain e.g. function calls
6255 that modify LHS. */
6257 {
6260 else
6265 newrhs);
6266 }
6270 /* The original type of the right hand side is no longer
6271 meaningful. */
6273 }
6274 }
6277 {
6278 /* Check if we are modifying an Objective-C property reference;
6279 if so, we need to generate setter calls. */
6282 else
6287 /* Else, do the check that we postponed for Objective-C. */
6290 }
6292 /* Give an error for storing in something that is 'const'. */
6297 {
6300 }
6304 /* If storing into a structure or union member,
6305 it has probably been given type `int'.
6306 Compute the type that would go with
6307 the actual amount of storage the member occupies. */
6316 /* If storing in a field that is in actuality a short or narrower than one,
6317 we must store in the field in its actual type. */
6320 {
6323 }
6325 /* Issue -Wc++-compat warnings about an assignment to an enum type
6326 when LHS does not have its original type. This happens for,
6327 e.g., an enum bitfield in a struct. */
6332 {
6334 ? rhs_origtype
6341 }
6343 /* Remove qualifiers. */
6347 /* Convert new value to destination type. Fold it first, then
6348 restore any excess precision information, for the sake of
6349 conversion warnings. */
6352 {
6355 {
6357 {
6360 }
6365 }
6366 else
6373 }
6375 /* Emit ObjC write barrier, if necessary. */
6377 {
6380 {
6383 }
6384 }
6386 /* Scan operands. */
6390 else
6391 {
6395 }
6397 /* If we got the LHS in a different type for storing in,
6398 convert the result back to the nominal type of LHS
6399 so that the value we return always has the same type
6400 as the LHS argument. */
6410 return_result:
6414 }
6415 \f
6416 /* Return whether STRUCT_TYPE has an anonymous field with type TYPE.
6417 This is used to implement -fplan9-extensions. */
6419 static bool
6421 {
6422 tree field;
6430 {
6433 TYPE_QUAL_ATOMIC)
6437 {
6441 }
6445 {
6449 }
6450 }
6452 }
6454 /* RHS is an expression whose type is pointer to struct. If there is
6455 an anonymous field in RHS with type TYPE, then return a pointer to
6456 that field in RHS. This is used with -fplan9-extensions. This
6457 returns NULL if no conversion could be found. */
6459 static tree
6461 {
6465 tree ret;
6474 TYPE_QUAL_ATOMIC)
6482 {
6488 TYPE_QUAL_ATOMIC)
6491 {
6495 }
6497 lhs_main_type))
6498 {
6503 }
6504 }
6511 NULL_TREE);
6515 {
6518 }
6521 }
6523 /* Issue an error message for a bad initializer component.
6524 GMSGID identifies the message.
6525 The component name is taken from the spelling stack. */
6529 {
6532 auto_diagnostic_group d;
6534 /* The gmsgid may be a format string with %< and %>. */
6543 }
6545 /* Issue a pedantic warning for a bad initializer component. OPT is
6546 the option OPT_* (from options.h) controlling this warning or 0 if
6547 it is unconditionally given. GMSGID identifies the message. The
6548 component name is taken from the spelling stack. */
6552 {
6553 /* Use the location where a macro was expanded rather than where
6554 it was defined to make sure macros defined in system headers
6555 but used incorrectly elsewhere are diagnosed. */
6557 auto_diagnostic_group d;
6565 }
6567 /* Issue a warning for a bad initializer component.
6569 OPT is the OPT_W* value corresponding to the warning option that
6570 controls this warning. GMSGID identifies the message. The
6571 component name is taken from the spelling stack. */
6573 static void
6575 {
6579 auto_diagnostic_group d;
6581 /* Use the location where a macro was expanded rather than where
6582 it was defined to make sure macros defined in system headers
6583 but used incorrectly elsewhere are diagnosed. */
6586 /* The gmsgid may be a format string with %< and %>. */
6591 }
6592 \f
6593 /* If TYPE is an array type and EXPR is a parenthesized string
6594 constant, warn if pedantic that EXPR is being used to initialize an
6595 object of type TYPE. */
6597 void
6599 {
6606 }
6608 /* Attempt to locate the parameter with the given index within FNDECL,
6609 returning DECL_SOURCE_LOCATION (FNDECL) if it can't be found. */
6611 static location_t
6613 {
6615 tree param;
6617 /* Locate param by index within DECL_ARGUMENTS (fndecl). */
6621 ;
6623 /* If something went wrong (e.g. if we have a builtin and thus no arguments),
6624 return DECL_SOURCE_LOCATION (FNDECL). */
6629 }
6631 /* Issue a note about a mismatching argument for parameter PARMNUM
6632 to FUNDECL, for types EXPECTED_TYPE and ACTUAL_TYPE.
6633 Attempt to issue the note at the pertinent parameter of the decl;
6634 failing that issue it at the location of FUNDECL; failing that
6635 issue it at PLOC. */
6637 static void
6640 {
6641 location_t loc;
6644 else
6650 }
6652 /* Issue a warning when an argument of ARGTYPE is passed to a built-in
6653 function FUNDECL declared without prototype to parameter PARMNUM of
6654 PARMTYPE when ARGTYPE does not promote to PARMTYPE. */
6656 static void
6659 {
6664 /* Avoid warning for enum arguments that promote to an integer type
6665 of the same size/mode. */
6677 /* This diagnoses even signed/unsigned mismatches. Those might be
6678 safe in many cases but GCC may emit suboptimal code for them so
6679 warning on those cases drives efficiency improvements. */
6683 "in a call to built-in function declared without "
6686 "in a call to built-in function declared without "
6691 fundecl);
6692 }
6694 /* Convert value RHS to type TYPE as preparation for an assignment to
6695 an lvalue of type TYPE. If ORIGTYPE is not NULL_TREE, it is the
6696 original type of RHS; this differs from TREE_TYPE (RHS) for enum
6697 types. NULL_POINTER_CONSTANT says whether RHS was a null pointer
6698 constant before any folding.
6699 The real work of conversion is done by `convert'.
6700 The purpose of this function is to generate error messages
6701 for assignments that are not allowed in C.
6702 ERRTYPE says whether it is argument passing, assignment,
6703 initialization or return.
6705 In the following example, '~' denotes where EXPR_LOC and '^' where
6706 LOCATION point to:
6708 f (var); [ic_argpass]
6709 ^ ~~~
6710 x = var; [ic_assign]
6711 ^ ~~~;
6712 int x = var; [ic_init]
6713 ^^^
6714 return x; [ic_return]
6715 ^
6717 FUNCTION is a tree for the function being called.
6718 PARMNUM is the number of the argument, for printing in error messages.
6719 WARNOPT may be set to a warning option to issue the corresponding warning
6720 rather than an error for invalid conversions. Used for calls to built-in
6721 functions declared without a prototype. */
6723 static tree
6728 {
6731 tree rhstype;
6736 /* Use the expansion point location to handle cases such as user's
6737 function returning a wrong-type macro defined in a system header. */
6741 {
6742 tree selector;
6743 /* Change pointer to function to the function itself for
6744 diagnostics. */
6749 /* Handle an ObjC selector specially for diagnostics. */
6753 {
6756 }
6757 }
6759 /* This macro is used to emit diagnostics to ensure that all format
6760 strings are complete sentences, visible to gettext and checked at
6761 compile time. */
6762 #define PEDWARN_FOR_ASSIGNMENT(LOCATION, PLOC, OPT, AR, AS, IN, RE) \
6763 do { \
6764 switch (errtype) \
6765 { \
6766 case ic_argpass: \
6767 { \
6768 auto_diagnostic_group d; \
6769 if (pedwarn (PLOC, OPT, AR, parmnum, rname)) \
6770 inform_for_arg (fundecl, (PLOC), parmnum, type, rhstype); \
6771 } \
6772 break; \
6773 case ic_assign: \
6774 pedwarn (LOCATION, OPT, AS); \
6775 break; \
6776 case ic_init: \
6777 pedwarn_init (LOCATION, OPT, IN); \
6778 break; \
6779 case ic_return: \
6780 pedwarn (LOCATION, OPT, RE); \
6781 break; \
6782 default: \
6783 gcc_unreachable (); \
6784 } \
6785 } while (0)
6787 /* This macro is used to emit diagnostics to ensure that all format
6788 strings are complete sentences, visible to gettext and checked at
6789 compile time. It is the same as PEDWARN_FOR_ASSIGNMENT but with an
6790 extra parameter to enumerate qualifiers. */
6791 #define PEDWARN_FOR_QUALIFIERS(LOCATION, PLOC, OPT, AR, AS, IN, RE, QUALS) \
6792 do { \
6793 switch (errtype) \
6794 { \
6795 case ic_argpass: \
6796 { \
6797 auto_diagnostic_group d; \
6798 if (pedwarn (PLOC, OPT, AR, parmnum, rname, QUALS)) \
6799 inform_for_arg (fundecl, (PLOC), parmnum, type, rhstype); \
6800 } \
6801 break; \
6802 case ic_assign: \
6803 pedwarn (LOCATION, OPT, AS, QUALS); \
6804 break; \
6805 case ic_init: \
6806 pedwarn (LOCATION, OPT, IN, QUALS); \
6807 break; \
6808 case ic_return: \
6809 pedwarn (LOCATION, OPT, RE, QUALS); \
6810 break; \
6811 default: \
6812 gcc_unreachable (); \
6813 } \
6814 } while (0)
6816 /* This macro is used to emit diagnostics to ensure that all format
6817 strings are complete sentences, visible to gettext and checked at
6818 compile time. It is the same as PEDWARN_FOR_QUALIFIERS but uses
6819 warning_at instead of pedwarn. */
6820 #define WARNING_FOR_QUALIFIERS(LOCATION, PLOC, OPT, AR, AS, IN, RE, QUALS) \
6821 do { \
6822 switch (errtype) \
6823 { \
6824 case ic_argpass: \
6825 { \
6826 auto_diagnostic_group d; \
6827 if (warning_at (PLOC, OPT, AR, parmnum, rname, QUALS)) \
6828 inform_for_arg (fundecl, (PLOC), parmnum, type, rhstype); \
6829 } \
6830 break; \
6831 case ic_assign: \
6832 warning_at (LOCATION, OPT, AS, QUALS); \
6833 break; \
6834 case ic_init: \
6835 warning_at (LOCATION, OPT, IN, QUALS); \
6836 break; \
6837 case ic_return: \
6838 warning_at (LOCATION, OPT, RE, QUALS); \
6839 break; \
6840 default: \
6841 gcc_unreachable (); \
6842 } \
6843 } while (0)
6855 {
6859 {
6875 }
6878 }
6881 {
6887 {
6912 }
6913 }
6916 {
6922 {
6927 }
6928 }
6931 {
6934 }
6937 {
6938 /* Except for passing an argument to an unprototyped function,
6939 this is a constraint violation. When passing an argument to
6940 an unprototyped function, it is compile-time undefined;
6941 making it a constraint in that case was rejected in
6942 DR#252. */
6946 else
6949 }
6957 /* A non-reference type can convert to a reference. This handles
6958 va_start, va_copy and possibly port built-ins. */
6960 {
6962 {
6966 else
6969 }
6986 }
6987 /* Some types can interconvert without explicit casts. */
6991 /* Arithmetic types all interconvert, and enum is treated like int. */
7000 {
7003 rhstype);
7015 }
7017 /* Aggregates in different TUs might need conversion. */
7024 /* Conversion to a transparent union or record from its member types.
7025 This applies only to function arguments. */
7029 {
7033 {
7044 {
7048 /* Any non-function converts to a [const][volatile] void *
7049 and vice versa; otherwise, targets must be the same.
7050 Meanwhile, the lhs target must have all the qualifiers of
7051 the rhs. */
7055 {
7058 /* If this type won't generate any warnings, use it. */
7066 /* Keep looking for a better type, but remember this one. */
7069 }
7070 }
7072 /* Can convert integer zero to any pointer type. */
7074 {
7077 }
7078 }
7081 {
7083 {
7084 /* We have only a marginally acceptable member type;
7085 it needs a warning. */
7089 /* Const and volatile mean something different for function
7090 types, so the usual warnings are not appropriate. */
7093 {
7094 /* Because const and volatile on functions are
7095 restrictions that say the function will not do
7096 certain things, it is okay to use a const or volatile
7097 function where an ordinary one is wanted, but not
7098 vice-versa. */
7102 OPT_Wdiscarded_qualifiers,
7104 "makes %q#v qualified function "
7107 "function pointer from "
7110 "function pointer from "
7115 }
7119 OPT_Wdiscarded_qualifiers,
7131 }
7139 }
7140 }
7142 /* Conversions among pointers */
7145 {
7146 /* If RHS refers to a built-in declared without a prototype
7147 BLTIN is the declaration of the built-in with a prototype
7148 and RHSTYPE is set to the actual type of the built-in. */
7149 tree bltin;
7158 addr_space_t asl;
7159 addr_space_t asr;
7164 TYPE_QUAL_ATOMIC)
7169 TYPE_QUAL_ATOMIC)
7171 /* Opaque pointers are treated like void pointers. */
7174 /* The Plan 9 compiler permits a pointer to a struct to be
7175 automatically converted into a pointer to an anonymous field
7176 within the struct. */
7181 {
7184 {
7190 }
7191 }
7193 /* C++ does not allow the implicit conversion void* -> T*. However,
7194 for the purpose of reducing the number of false positives, we
7195 tolerate the special case of
7197 int *p = NULL;
7199 where NULL is typically defined in C to be '(void *) 0'. */
7202 OPT_Wc___compat,
7203 "request for implicit conversion "
7206 /* See if the pointers point to incompatible address spaces. */
7211 {
7213 {
7215 {
7220 else
7223 }
7225 {
7230 else
7233 }
7235 {
7240 else
7243 }
7245 {
7250 else
7253 }
7256 }
7258 }
7260 /* Check if the right-hand side has a format attribute but the
7261 left-hand side doesn't. */
7264 {
7266 {
7269 "argument %d of %qE might be "
7275 "assignment left-hand side might be "
7280 "initialization left-hand side might be "
7285 "return type might be "
7290 }
7291 }
7293 /* See if the pointers point to incompatible scalar storage orders. */
7297 {
7298 tree t;
7301 {
7303 /* Do not warn for built-in functions, for example memcpy, since we
7304 control how they behave and they can be useful in this area. */
7308 "passing argument %d of %qE from incompatible "
7312 /* Do not warn if the RHS is a call to a function that returns a
7313 pointer that is not an alias. */
7318 "assignment to %qT from pointer type %qT with "
7322 /* Likewise. */
7327 "initialization of %qT from pointer type %qT with "
7332 "returning %qT from pointer type with incompatible "
7337 }
7338 }
7340 /* Any non-function converts to a [const][volatile] void *
7341 and vice versa; otherwise, targets must be the same.
7342 Meanwhile, the lhs target must have all the qualifiers of the rhs. */
7346 || is_opaque_pointer
7352 {
7353 /* Warn about loss of qualifers from pointers to arrays with
7354 qualifiers on the element type. */
7356 {
7363 OPT_Wdiscarded_array_qualifiers,
7373 }
7376 ||
7378 && !null_pointer_constant
7382 "%qE between function pointer "
7390 /* Const and volatile mean something different for function types,
7391 so the usual warnings are not appropriate. */
7394 {
7395 /* Don't warn about loss of qualifier for conversions from
7396 qualified void* to pointers to arrays with corresponding
7397 qualifier on the element type. */
7401 /* Assignments between atomic and non-atomic objects are OK. */
7404 {
7406 OPT_Wdiscarded_qualifiers,
7416 }
7417 /* If this is not a case of ignoring a mismatch in signedness,
7418 no warning. */
7421 ;
7422 /* If there is a mismatch, do warn. */
7425 {
7427 {
7428 auto_diagnostic_group d;
7432 "pointer targets in passing argument %d of "
7435 rhstype);
7436 }
7440 "pointer targets in assignment from %qT to %qT "
7445 "pointer targets in initialization of %qT "
7447 rhstype);
7451 "returning %qT from a function with return type "
7456 }
7457 }
7460 {
7461 /* Because const and volatile on functions are restrictions
7462 that say the function will not do certain things,
7463 it is okay to use a const or volatile function
7464 where an ordinary one is wanted, but not vice-versa. */
7468 OPT_Wdiscarded_qualifiers,
7470 "%q#v qualified function pointer "
7479 }
7480 }
7481 /* Avoid warning about the volatile ObjC EH puts on decls. */
7483 {
7485 {
7487 {
7488 auto_diagnostic_group d;
7492 "passing argument %d of %qE from incompatible "
7495 }
7500 "assignment to %qT from pointer to "
7503 else
7511 "initialization of %qT from pointer to "
7514 else
7516 "initialization of %qT from incompatible "
7523 "returning pointer to %qD of type %qT from "
7526 else
7528 "returning %qT from a function with incompatible "
7533 }
7534 }
7536 /* If RHS isn't an address, check pointer or array of packed
7537 struct or union. */
7541 }
7543 {
7544 /* ??? This should not be an error when inlining calls to
7545 unprototyped functions. */
7549 else
7552 }
7554 {
7555 /* An explicit constant 0 can convert to a pointer,
7556 or one that results from arithmetic, even including
7557 a cast to integer type. */
7560 {
7562 {
7563 auto_diagnostic_group d;
7567 "passing argument %d of %qE makes pointer from "
7570 }
7574 "assignment to %qT from %qT makes pointer from integer "
7579 "initialization of %qT from %qT makes pointer from "
7584 "function with return type %qT makes pointer from "
7589 }
7592 }
7594 {
7596 {
7598 {
7599 auto_diagnostic_group d;
7603 "passing argument %d of %qE makes integer from "
7606 }
7610 "assignment to %qT from %qT makes integer from pointer "
7615 "initialization of %qT from %qT makes integer from "
7620 "function with return type %qT makes integer from "
7625 }
7628 }
7630 {
7631 tree ret;
7637 }
7640 {
7642 {
7643 auto_diagnostic_group d;
7649 else
7652 }
7655 {
7660 else
7663 }
7665 {
7670 else
7673 }
7675 {
7680 else
7683 }
7686 }
7689 }
7690 \f
7691 /* If VALUE is a compound expr all of whose expressions are constant, then
7692 return its value. Otherwise, return error_mark_node.
7694 This is for handling COMPOUND_EXPRs as initializer elements
7695 which is allowed with a warning when -pedantic is specified. */
7697 static tree
7699 {
7701 {
7706 endtype);
7707 }
7710 else
7712 }
7713 \f
7714 /* Perform appropriate conversions on the initial value of a variable,
7715 store it in the declaration DECL,
7716 and print any error messages that are appropriate.
7717 If ORIGTYPE is not NULL_TREE, it is the original type of INIT.
7718 If the init is invalid, store an ERROR_MARK.
7720 INIT_LOC is the location of the initial value. */
7722 void
7724 {
7728 /* If variable's type was invalidly declared, just ignore it. */
7734 /* Digest the specified initializer into an expression. */
7741 /* Store the expression if valid; else report error. */
7751 /* ANSI wants warnings about out-of-range constant initializers. */
7756 /* Check if we need to set array size from compound literal size. */
7760 {
7767 {
7771 {
7772 /* For int foo[] = (int [3]){1}; we need to set array size
7773 now since later on array initializer will be just the
7774 brace enclosed list of the compound literal. */
7782 }
7783 }
7784 }
7785 }
7786 \f
7787 /* Methods for storing and printing names for error messages. */
7789 /* Implement a spelling stack that allows components of a name to be pushed
7790 and popped. Each element on the stack is this structure. */
7792 struct spelling
7793 {
7795 union
7796 {
7800 };
7802 #define SPELLING_STRING 1
7803 #define SPELLING_MEMBER 2
7804 #define SPELLING_BOUNDS 3
7810 /* Macros to save and restore the spelling stack around push_... functions.
7811 Alternative to SAVE_SPELLING_STACK. */
7813 #define SPELLING_DEPTH() (spelling - spelling_base)
7814 #define RESTORE_SPELLING_DEPTH(DEPTH) (spelling = spelling_base + (DEPTH))
7816 /* Push an element on the spelling stack with type KIND and assign VALUE
7817 to MEMBER. */
7819 #define PUSH_SPELLING(KIND, VALUE, MEMBER) \
7820 { \
7821 int depth = SPELLING_DEPTH (); \
7822 \
7823 if (depth >= spelling_size) \
7824 { \
7825 spelling_size += 10; \
7826 spelling_base = XRESIZEVEC (struct spelling, spelling_base, \
7827 spelling_size); \
7828 RESTORE_SPELLING_DEPTH (depth); \
7829 } \
7830 \
7831 spelling->kind = (KIND); \
7832 spelling->MEMBER = (VALUE); \
7833 spelling++; \
7834 }
7836 /* Push STRING on the stack. Printed literally. */
7838 static void
7840 {
7842 }
7844 /* Push a member name on the stack. Printed as '.' STRING. */
7846 static void
7848 {
7854 }
7856 /* Push an array bounds on the stack. Printed as [BOUNDS]. */
7858 static void
7860 {
7862 }
7864 /* Compute the maximum size in bytes of the printed spelling. */
7866 static int
7868 {
7873 {
7876 else
7878 }
7881 }
7883 /* Print the spelling to BUFFER and return it. */
7887 {
7893 {
7896 }
7897 else
7898 {
7903 ;
7904 }
7907 }
7909 /* Digest the parser output INIT as an initializer for type TYPE.
7910 Return a C expression of type TYPE to represent the initial value.
7912 If ORIGTYPE is not NULL_TREE, it is the original type of INIT.
7914 NULL_POINTER_CONSTANT is true if INIT is a null pointer constant.
7916 If INIT is a string constant, STRICT_STRING is true if it is
7917 unparenthesized or we should not warn here for it being parenthesized.
7918 For other types of INIT, STRICT_STRING is not used.
7920 INIT_LOC is the location of the INIT.
7922 REQUIRE_CONSTANT requests an error if non-constant initializers or
7923 elements are seen. */
7925 static tree
7929 {
7936 || !init
7943 {
7945 {
7948 }
7950 }
7952 /* Initialization of an array of chars from a string constant
7953 optionally enclosed in braces. */
7957 {
7958 tree typ1
7961 TYPE_QUAL_ATOMIC)
7963 /* Note that an array could be both an array of character type
7964 and an array of wchar_t if wchar_t is signed char or unsigned
7965 char. */
7974 {
7992 {
7995 }
8000 {
8005 }
8010 {
8014 /* Subtract the size of a single (possibly wide) character
8015 because it's ok to ignore the terminating null char
8016 that is counted in the length of the constant. */
8027 {
8028 unsigned HOST_WIDE_INT size
8033 }
8034 }
8038 }
8040 {
8044 }
8045 }
8047 /* Build a VECTOR_CST from a *constant* vector constructor. If the
8048 vector constructor is not constant (e.g. {1,2,3,foo()}) then punt
8049 below and handle as a constructor. */
8054 {
8061 {
8063 tree value;
8066 /* Iterate through elements and check if all constructor
8067 elements are *_CSTs. */
8070 {
8073 }
8078 }
8079 }
8084 /* Any type can be initialized
8085 from an expression of the same type, optionally with braces. */
8098 {
8100 {
8102 {
8105 inside_init = array_to_pointer_conversion
8107 else
8108 {
8111 }
8112 }
8113 }
8116 /* Although the types are compatible, we may require a
8117 conversion. */
8122 {
8123 /* As an extension, allow initializing objects with static storage
8124 duration with compound literals (which are then treated just as
8125 the brace enclosed list they contain). Also allow this for
8126 vectors, as we can only assign them with compound literals. */
8132 }
8136 {
8140 }
8142 /* Compound expressions can only occur here if -Wpedantic or
8143 -pedantic-errors is specified. In the later case, we always want
8144 an error. In the former case, we simply want a warning. */
8147 {
8148 inside_init
8153 else
8158 }
8162 {
8165 }
8170 /* Added to enable additional -Wsuggest-attribute=format warnings. */
8177 }
8179 /* Handle scalar types, including conversions. */
8184 {
8191 inside_init);
8192 inside_init
8198 /* Check to see if we have already given an error message. */
8200 ;
8202 {
8205 }
8209 {
8213 }
8219 }
8221 /* Come here only for records and arrays. */
8224 {
8227 }
8231 }
8232 \f
8233 /* Handle initializers that use braces. */
8235 /* Type of object we are accumulating a constructor for.
8236 This type is always a RECORD_TYPE, UNION_TYPE or ARRAY_TYPE. */
8239 /* For a RECORD_TYPE or UNION_TYPE, this is the chain of fields
8240 left to fill. */
8243 /* For an ARRAY_TYPE, this is the specified index
8244 at which to store the next element we get. */
8247 /* For an ARRAY_TYPE, this is the maximum index. */
8250 /* For a RECORD_TYPE, this is the first field not yet written out. */
8253 /* For an ARRAY_TYPE, this is the index of the first element
8254 not yet written out. */
8257 /* In a RECORD_TYPE, the byte index of the next consecutive field.
8258 This is so we can generate gaps between fields, when appropriate. */
8261 /* If we are saving up the elements rather than allocating them,
8262 this is the list of elements so far (in reverse order,
8263 most recent first). */
8266 /* 1 if constructor should be incrementally stored into a constructor chain,
8267 0 if all the elements should be kept in AVL tree. */
8270 /* 1 if so far this constructor's elements are all compile-time constants. */
8273 /* 1 if so far this constructor's elements are all valid address constants. */
8276 /* 1 if this constructor has an element that cannot be part of a
8277 constant expression. */
8280 /* 1 if this constructor is erroneous so far. */
8283 /* 1 if this constructor is the universal zero initializer { 0 }. */
8286 /* Structure for managing pending initializer elements, organized as an
8287 AVL tree. */
8289 struct init_node
8290 {
8294 tree purpose;
8295 tree value;
8296 tree origtype;
8297 };
8299 /* Tree of pending elements at this constructor level.
8300 These are elements encountered out of order
8301 which belong at places we haven't reached yet in actually
8302 writing the output.
8303 Will never hold tree nodes across GC runs. */
8306 /* The SPELLING_DEPTH of this constructor. */
8309 /* DECL node for which an initializer is being read.
8310 0 means we are reading a constructor expression
8311 such as (struct foo) {...}. */
8314 /* Nonzero if this is an initializer for a top-level decl. */
8317 /* Nonzero if there were any member designators in this initializer. */
8320 /* Nesting depth of designator list. */
8323 /* Nonzero if there were diagnosed errors in this designator list. */
8326 \f
8327 /* This stack has a level for each implicit or explicit level of
8328 structuring in the initializer, including the outermost one. It
8329 saves the values of most of the variables above. */
8333 struct constructor_stack
8334 {
8336 tree type;
8337 tree fields;
8338 tree index;
8339 tree max_index;
8340 tree unfilled_index;
8341 tree unfilled_fields;
8342 tree bit_index;
8347 /* If value nonzero, this value should replace the entire
8348 constructor at this level. */
8360 };
8364 /* This stack represents designators from some range designator up to
8365 the last designator in the list. */
8367 struct constructor_range_stack
8368 {
8371 tree range_start;
8372 tree index;
8373 tree range_end;
8374 tree fields;
8375 };
8379 /* This stack records separate initializers that are nested.
8380 Nested initializers can't happen in ANSI C, but GNU C allows them
8381 in cases like { ... (struct foo) { ... } ... }. */
8383 struct initializer_stack
8384 {
8386 tree decl;
8397 };
8400 \f
8401 /* Prepare to parse and output the initializer for variable DECL. */
8403 void
8406 {
8429 {
8431 require_constant_elements
8433 /* For a scalar, you can always use any value to initialize,
8434 even within braces. */
8437 }
8438 else
8439 {
8443 }
8456 }
8458 void
8460 {
8463 /* Free the whole constructor stack of this initializer. */
8465 {
8469 }
8473 /* Pop back to the data of the outer initializer (if any). */
8488 }
8489 \f
8490 /* Call here when we see the initializer is surrounded by braces.
8491 This is instead of a call to push_init_level;
8492 it is matched by a call to pop_init_level.
8494 TYPE is the type to initialize, for a constructor expression.
8495 For an initializer for a decl, TYPE is zero. */
8497 void
8499 {
8549 {
8551 /* Skip any nameless bit fields at the beginning. */
8558 }
8560 {
8562 {
8563 constructor_max_index
8566 /* Detect non-empty initializations of zero-length arrays. */
8571 /* constructor_max_index needs to be an INTEGER_CST. Attempts
8572 to initialize VLAs will cause a proper error; avoid tree
8573 checking errors as well by setting a safe value. */
8578 constructor_index
8581 }
8582 else
8583 {
8586 }
8589 }
8591 {
8592 /* Vectors are like simple fixed-size arrays. */
8593 constructor_max_index =
8597 }
8598 else
8599 {
8600 /* Handle the case of int x = {5}; */
8603 }
8604 }
8605 \f
8608 /* Called when we see an open brace for a nested initializer. Finish
8609 off any pending levels with implicit braces. */
8610 void
8612 {
8614 {
8619 last_init_list_comma),
8622 && constructor_max_index
8624 constructor_index))
8627 last_init_list_comma),
8629 else
8631 }
8632 }
8634 /* Push down into a subobject, for initialization.
8635 If this is for an explicit set of braces, IMPLICIT is 0.
8636 If it is because the next element belongs at a lower level,
8637 IMPLICIT is 1 (or 2 if the push is because of designator list). */
8639 void
8642 {
8646 /* Unless this is an explicit brace, we need to preserve previous
8647 content if any. */
8649 {
8654 }
8692 {
8697 }
8699 /* Don't die if an entire brace-pair level is superfluous
8700 in the containing level. */
8702 ;
8704 {
8705 /* Don't die if there are extra init elts at the end. */
8708 else
8709 {
8712 constructor_depth++;
8713 }
8714 /* If upper initializer is designated, then mark this as
8715 designated too to prevent bogus warnings. */
8717 }
8719 {
8722 constructor_depth++;
8723 }
8726 {
8731 }
8734 {
8743 }
8746 {
8751 }
8754 {
8756 /* Skip any nameless bit fields at the beginning. */
8763 }
8765 {
8766 /* Vectors are like simple fixed-size arrays. */
8767 constructor_max_index =
8771 }
8773 {
8775 {
8776 constructor_max_index
8779 /* Detect non-empty initializations of zero-length arrays. */
8784 /* constructor_max_index needs to be an INTEGER_CST. Attempts
8785 to initialize VLAs will cause a proper error; avoid tree
8786 checking errors as well by setting a safe value. */
8791 constructor_index
8794 }
8795 else
8800 {
8801 /* We need to split the char/wchar array into individual
8802 characters, so that we don't have to special case it
8803 everywhere. */
8805 }
8806 }
8807 else
8808 {
8813 }
8814 }
8816 /* At the end of an implicit or explicit brace level,
8817 finish up that level of constructor. If a single expression
8818 with redundant braces initialized that level, return the
8819 c_expr structure for that expression. Otherwise, the original_code
8820 element is set to ERROR_MARK.
8821 If we were outputting the elements as they are read, return 0 as the value
8822 from inner levels (process_init_element ignores that),
8823 but return error_mark_node as the value from the outermost level
8824 (that's what we want to put in DECL_INITIAL).
8825 Otherwise, return a CONSTRUCTOR expression as the value. */
8827 struct c_expr
8830 location_t insert_before)
8831 {
8839 {
8840 /* When we come to an explicit close brace,
8841 pop any inner levels that didn't have explicit braces. */
8845 insert_before),
8848 }
8849 else
8854 /* Now output all pending elements. */
8860 /* Error for initializing a flexible array member, or a zero-length
8861 array member in an inappropriate context. */
8866 {
8867 /* Silently discard empty initializations. The parser will
8868 already have pedwarned for empty brackets. */
8871 else
8872 {
8877 else
8881 /* We have already issued an error message for the existence
8882 of a flexible array member not at the end of the structure.
8883 Discard the initializer so that we do not die later. */
8886 }
8887 }
8890 {
8892 /* Initialization with { } counts as zeroinit. */
8896 /* This might be zeroinit as well. */
8901 /* If the constructor has more than one element, it can't be { 0 }. */
8904 }
8906 /* Warn when some structs are initialized with direct aggregation. */
8909 {
8912 OPT_Wmissing_braces,
8914 }
8916 /* Warn when some struct elements are implicitly initialized to zero. */
8918 && constructor_type
8921 {
8922 /* Do not warn for flexible array members or zero-length arrays. */
8929 /* Do not warn if this level of the initializer uses member
8930 designators; it is likely to be deliberate. */
8931 && !constructor_designated
8932 /* Do not warn about initializing with { 0 } or with { }. */
8934 {
8937 constructor_unfilled_fields,
8938 constructor_type))
8941 }
8942 }
8944 /* Pad out the end of the structure. */
8946 /* If this closes a superfluous brace pair,
8947 just pass out the element between them. */
8950 ;
8954 {
8955 /* A nonincremental scalar initializer--just return
8956 the element, after verifying there is just one. */
8958 {
8962 }
8964 {
8967 }
8968 else
8970 }
8971 else
8972 {
8975 else
8976 {
8978 constructor_elements);
8985 }
8986 }
8989 {
8994 }
9023 }
9025 /* Common handling for both array range and field name designators.
9026 ARRAY argument is nonzero for array ranges. Returns false for success. */
9028 static bool
9031 {
9032 tree subtype;
9035 /* Don't die if an entire brace-pair level is superfluous
9036 in the containing level, or for an erroneous type. */
9040 /* If there were errors in this designator list already, bail out
9041 silently. */
9045 /* Likewise for an initializer for a variable-size type. Those are
9046 diagnosed in digest_init. */
9052 {
9055 /* Designator list starts at the level of closest explicit
9056 braces. */
9060 last_init_list_comma),
9064 }
9067 {
9079 }
9083 {
9086 }
9088 {
9091 }
9097 }
9099 /* If there are range designators in designator list, push a new designator
9100 to constructor_range_stack. RANGE_END is end of such stack range or
9101 NULL_TREE if there is no range designator at this level. */
9103 static void
9105 {
9121 }
9123 /* Within an array initializer, specify the next index to be initialized.
9124 FIRST is that index. If LAST is nonzero, then initialize a range
9125 of indices, running from FIRST through LAST. */
9127 void
9130 {
9138 {
9141 }
9144 {
9148 "array index in initializer is not "
9150 }
9153 {
9157 "array index in initializer is not "
9159 }
9172 else
9173 {
9179 {
9182 }
9185 {
9189 {
9192 }
9193 else
9194 {
9198 {
9202 }
9203 }
9204 }
9206 designator_depth++;
9210 }
9211 }
9213 /* Within a struct initializer, specify the next field to be initialized. */
9215 void
9218 {
9219 tree field;
9227 {
9230 }
9235 {
9238 {
9244 }
9245 else
9248 }
9249 else
9250 do
9251 {
9253 designator_depth++;
9259 {
9262 }
9263 }
9265 }
9266 \f
9267 /* Add a new initializer to the tree of pending initializers. PURPOSE
9268 identifies the initializer, either array index or field in a structure.
9269 VALUE is the value of that index or field. If ORIGTYPE is not
9270 NULL_TREE, it is the original type of VALUE.
9272 IMPLICIT is true if value comes from pop_init_level (1),
9273 the new initializer has been merged with the existing one
9274 and thus no warnings should be emitted about overriding an
9275 existing initializer. */
9277 static void
9280 {
9287 {
9289 {
9295 else
9296 {
9298 {
9301 "initialized field with side-effects "
9306 }
9310 }
9311 }
9312 }
9313 else
9314 {
9315 tree bitpos;
9319 {
9325 else
9326 {
9328 {
9331 "initialized field with side-effects "
9336 }
9340 }
9341 }
9342 }
9357 {
9361 {
9365 {
9367 {
9368 /* L rotation. */
9381 {
9384 else
9386 }
9387 else
9389 }
9390 else
9391 {
9392 /* LR rotation. */
9414 {
9417 else
9419 }
9420 else
9422 }
9424 }
9425 else
9426 {
9427 /* p->balance == +1; growth of left side balances the node. */
9430 }
9431 }
9433 {
9435 /* Growth propagation from right side. */
9438 {
9440 {
9441 /* R rotation. */
9454 {
9457 else
9459 }
9460 else
9462 }
9464 {
9465 /* RL rotation */
9487 {
9490 else
9492 }
9493 else
9495 }
9497 }
9498 else
9499 {
9500 /* p->balance == -1; growth of right side balances the node. */
9503 }
9504 }
9508 }
9509 }
9511 /* Build AVL tree from a sorted chain. */
9513 static void
9515 {
9525 braced_init_obstack);
9528 {
9530 /* Skip any nameless bit fields at the beginning. */
9535 }
9537 {
9539 constructor_unfilled_index
9542 else
9544 }
9546 }
9548 /* Build AVL tree from a string constant. */
9550 static void
9553 {
9570 p < end
9571 && !(constructor_max_index
9574 {
9576 {
9579 }
9580 else
9581 {
9585 {
9588 else
9593 }
9594 }
9597 {
9600 {
9602 {
9605 }
9606 }
9608 {
9611 }
9615 }
9621 braced_init_obstack);
9622 }
9625 }
9627 /* Return value of FIELD in pending initializer or NULL_TREE if the field was
9628 not initialized yet. */
9630 static tree
9632 {
9636 {
9643 {
9648 else
9650 }
9651 }
9653 {
9657 && (!constructor_unfilled_fields
9664 {
9669 else
9671 }
9672 }
9674 {
9678 }
9680 }
9682 /* "Output" the next constructor element.
9683 At top level, really output it to assembler code now.
9684 Otherwise, collect it in a list from which we will make a CONSTRUCTOR.
9685 If ORIGTYPE is not NULL_TREE, it is the original type of VALUE.
9686 TYPE is the data type that the containing data type wants here.
9687 FIELD is the field (a FIELD_DECL) or the index that this element fills.
9688 If VALUE is a string constant, STRICT_STRING is true if it is
9689 unparenthesized or we should not warn here for it being parenthesized.
9690 For other types of VALUE, STRICT_STRING is not used.
9692 PENDING if true means output pending elements that belong
9693 right after this element. (PENDING is normally true;
9694 it is false while outputting pending elements, to avoid recursion.)
9696 IMPLICIT is true if value comes from pop_init_level (1),
9697 the new initializer has been merged with the existing one
9698 and thus no warnings should be emitted about overriding an
9699 existing initializer. */
9701 static void
9705 {
9711 {
9714 }
9727 {
9728 /* As an extension, allow initializing objects with static storage
9729 duration with compound literals (which are then treated just as
9730 the brace enclosed list they contain). */
9736 }
9740 {
9743 }
9753 && TYPE_REVERSE_STORAGE_ORDER
9762 /* Digest the initializer and issue any errors about incompatible
9763 types before issuing errors about non-constant initializers. */
9768 require_constant_value);
9770 {
9773 }
9777 /* Proceed to check the constness of the original initializer. */
9779 {
9781 {
9784 }
9788 }
9794 /* Issue -Wc++-compat warnings about initializing a bitfield with
9795 enum type. */
9803 {
9810 }
9812 /* If this field is empty and does not have side effects (and is not at
9813 the end of structure), don't do anything other than checking the
9814 initializer. */
9824 /* Finally, set VALUE to the initializer value digested above. */
9827 /* If this element doesn't come next in sequence,
9828 put it on constructor_pending_elts. */
9830 && (!constructor_incremental
9832 {
9838 braced_init_obstack);
9840 }
9842 && (!constructor_incremental
9844 {
9845 /* We do this for records but not for unions. In a union,
9846 no matter which field is specified, it can be initialized
9847 right away since it starts at the beginning of the union. */
9849 {
9852 else
9853 {
9861 }
9862 }
9865 braced_init_obstack);
9867 }
9870 {
9872 {
9879 }
9881 /* We can have just one union field set. */
9883 }
9885 /* Otherwise, output this element either to
9886 constructor_elements or to the assembler file. */
9891 /* Advance the variable that indicates sequential elements output. */
9893 constructor_unfilled_index
9895 bitsize_one_node);
9897 {
9898 constructor_unfilled_fields
9901 /* Skip any nameless bit fields. */
9904 constructor_unfilled_fields =
9906 }
9910 /* Now output any pending elements which have become next. */
9913 }
9915 /* For two FIELD_DECLs in the same chain, return -1 if field1
9916 comes before field2, 1 if field1 comes after field2 and
9917 0 if field1 == field2. */
9919 static int
9921 {
9928 {
9929 /* If one of the fields has non-zero bitsize, then that
9930 field must be the last one in a sequence of zero
9931 sized fields, fields after it will have bigger
9932 bit_position. */
9941 /* Otherwise, fallback to DECL_CHAIN walk to find out
9942 which field comes earlier. Walk chains of both
9943 fields, so that if field1 and field2 are close to each
9944 other in either order, it is found soon even for large
9945 sequences of zero sized fields. */
9948 {
9952 {
9955 }
9966 }
9967 }
9970 else
9972 }
9974 /* Output any pending elements which have become next.
9975 As we output elements, constructor_unfilled_{fields,index}
9976 advances, which may cause other elements to become next;
9977 if so, they too are output.
9979 If ALL is 0, we return when there are
9980 no more pending elements to output now.
9982 If ALL is 1, we output space as necessary so that
9983 we can output all the pending elements. */
9984 static void
9986 {
9988 tree next;
9990 retry:
9992 /* Look through the whole pending tree.
9993 If we find an element that should be output now,
9994 output it. Otherwise, set NEXT to the element
9995 that comes first among those still pending. */
9999 {
10001 {
10003 constructor_unfilled_index))
10007 braced_init_obstack);
10010 {
10011 /* Advance to the next smaller node. */
10014 else
10015 {
10016 /* We have reached the smallest node bigger than the
10017 current unfilled index. Fill the space first. */
10020 }
10021 }
10022 else
10023 {
10024 /* Advance to the next bigger node. */
10027 else
10028 {
10029 /* We have reached the biggest node in a subtree. Find
10030 the parent of it, which is the next bigger node. */
10036 {
10039 }
10040 }
10041 }
10042 }
10044 {
10045 /* If the current record is complete we are done. */
10055 braced_init_obstack);
10057 {
10058 /* Advance to the next smaller node. */
10061 else
10062 {
10063 /* We have reached the smallest node bigger than the
10064 current unfilled field. Fill the space first. */
10067 }
10068 }
10069 else
10070 {
10071 /* Advance to the next bigger node. */
10074 else
10075 {
10076 /* We have reached the biggest node in a subtree. Find
10077 the parent of it, which is the next bigger node. */
10084 {
10087 }
10088 }
10089 }
10090 }
10091 }
10093 /* Ordinarily return, but not if we want to output all
10094 and there are elements left. */
10098 /* If it's not incremental, just skip over the gap, so that after
10099 jumping to retry we will output the next successive element. */
10105 /* ELT now points to the node in the pending tree with the next
10106 initializer to output. */
10108 }
10109 \f
10110 /* Expression VALUE coincides with the start of type TYPE in a braced
10111 initializer. Return true if we should treat VALUE as initializing
10112 the first element of TYPE, false if we should treat it as initializing
10113 TYPE as a whole.
10115 If the initializer is clearly invalid, the question becomes:
10116 which choice gives the best error message? */
10118 static bool
10120 {
10130 /* GNU vectors can be initialized elementwise. However, treat any
10131 kind of vector value as initializing the vector type as a whole,
10132 regardless of whether the value is a GNU vector. Such initializers
10133 are valid if and only if they would have been valid in a non-braced
10134 initializer like:
10136 TYPE foo = VALUE;
10138 so recursing into the vector type would be at best confusing or at
10139 worst wrong. For example, when -flax-vector-conversions is in effect,
10140 it's possible to initialize a V8HI from a V4SI, even though the vectors
10141 have different element types and different numbers of elements. */
10149 }
10151 /* Add one non-braced element to the current constructor level.
10152 This adjusts the current position within the constructor's type.
10153 This may also start or terminate implicit levels
10154 to handle a partly-braced initializer.
10156 Once this has found the correct level for the new element,
10157 it calls output_init_element.
10159 IMPLICIT is true if value comes from pop_init_level (1),
10160 the new initializer has been merged with the existing one
10161 and thus no warnings should be emitted about overriding an
10162 existing initializer. */
10164 void
10167 {
10169 int string_flag
10180 /* Handle superfluous braces around string cst as in
10181 char x[] = {"foo"}; */
10183 && constructor_type
10184 && !was_designated
10188 {
10193 }
10196 {
10199 }
10201 /* Ignore elements of a brace group if it is entirely superfluous
10202 and has already been diagnosed, or if the type is erroneous. */
10206 /* Ignore elements of an initializer for a variable-size type.
10207 Those are diagnosed in digest_init. */
10217 OPT_Wdesignated_init,
10218 "positional initialization of field "
10221 /* If we've exhausted any levels that didn't have braces,
10222 pop them now. */
10224 {
10229 last_init_list_comma),
10233 && constructor_max_index
10235 constructor_index))
10238 last_init_list_comma),
10240 else
10242 }
10244 /* In the case of [LO ... HI] = VALUE, only evaluate VALUE once. */
10246 {
10247 /* If value is a compound literal and we'll be just using its
10248 content, don't put it into a SAVE_EXPR. */
10251 {
10254 {
10257 }
10262 }
10263 }
10266 {
10268 {
10269 tree fieldtype;
10273 {
10276 }
10283 /* Error for non-static initialization of a flexible array member. */
10285 && !require_constant_value
10288 {
10292 }
10294 /* Error for initialization of a flexible array member with
10295 a string constant if the structure is in an array. E.g.:
10296 struct S { int x; char y[]; };
10297 struct S s[] = { { 1, "foo" } };
10298 is invalid. */
10304 {
10309 {
10312 }
10314 {
10318 }
10319 }
10321 /* Accept a string constant to initialize a subarray. */
10327 /* Otherwise, if we have come to a subaggregate,
10328 and we don't have an element of its type, push into it. */
10331 {
10334 }
10337 {
10342 braced_init_obstack);
10344 }
10345 else
10346 /* Do the bookkeeping for an element that was
10347 directly output as a constructor. */
10348 {
10349 /* For a record, keep track of end position of last field. */
10351 constructor_bit_index
10356 /* If the current field was the first one not yet written out,
10357 it isn't now, so update. */
10359 {
10361 /* Skip any nameless bit fields. */
10363 && (DECL_UNNAMED_BIT_FIELD
10365 constructor_unfilled_fields =
10367 }
10368 }
10371 /* Skip any nameless bit fields at the beginning. */
10375 }
10377 {
10378 tree fieldtype;
10382 {
10386 }
10393 /* Warn that traditional C rejects initialization of unions.
10394 We skip the warning if the value is zero. This is done
10395 under the assumption that the zero initializer in user
10396 code appears conditioned on e.g. __STDC__ to avoid
10397 "missing initializer" warnings and relies on default
10398 initialization to zero in the traditional C case.
10399 We also skip the warning if the initializer is designated,
10400 again on the assumption that this must be conditional on
10401 __STDC__ anyway (and we've already complained about the
10402 member-designator already). */
10409 /* Accept a string constant to initialize a subarray. */
10415 /* Otherwise, if we have come to a subaggregate,
10416 and we don't have an element of its type, push into it. */
10419 {
10422 }
10425 {
10430 braced_init_obstack);
10432 }
10433 else
10434 /* Do the bookkeeping for an element that was
10435 directly output as a constructor. */
10436 {
10439 }
10442 }
10444 {
10448 /* Accept a string constant to initialize a subarray. */
10454 /* Otherwise, if we have come to a subaggregate,
10455 and we don't have an element of its type, push into it. */
10458 {
10461 }
10466 {
10470 }
10472 /* Now output the actual element. */
10474 {
10479 braced_init_obstack);
10481 }
10483 constructor_index
10488 /* If we are doing the bookkeeping for an element that was
10489 directly output as a constructor, we must update
10490 constructor_unfilled_index. */
10492 }
10494 {
10497 /* Do a basic check of initializer size. Note that vectors
10498 always have a fixed size derived from their type. */
10500 {
10504 }
10506 /* Now output the actual element. */
10508 {
10514 braced_init_obstack);
10515 }
10517 constructor_index
10522 /* If we are doing the bookkeeping for an element that was
10523 directly output as a constructor, we must update
10524 constructor_unfilled_index. */
10526 }
10528 /* Handle the sole element allowed in a braced initializer
10529 for a scalar variable. */
10532 {
10536 }
10537 else
10538 {
10543 braced_init_obstack);
10545 }
10547 /* Handle range initializers either at this level or anywhere higher
10548 in the designator stack. */
10550 {
10557 {
10561 braced_init_obstack,
10562 last_init_list_comma),
10564 }
10568 {
10572 braced_init_obstack,
10573 last_init_list_comma),
10575 }
10583 {
10587 {
10590 }
10599 }
10604 }
10607 }
10610 }
10611 \f
10612 /* Build a complete asm-statement, whose components are a CV_QUALIFIER
10613 (guaranteed to be 'volatile' or null) and ARGS (represented using
10614 an ASM_EXPR node). */
10615 tree
10617 {
10621 }
10623 /* Build an asm-expr, whose components are a STRING, some OUTPUTS,
10624 some INPUTS, and some CLOBBERS. The latter three may be NULL.
10625 SIMPLE indicates whether there was anything at all after the
10626 string in the asm expression -- asm("blah") and asm("blah" : )
10627 are subtly different. We use a ASM_EXPR node to represent this.
10628 LOC is the location of the asm, and IS_INLINE says whether this
10629 is asm inline. */
10630 tree
10633 {
10634 tree tail;
10635 tree args;
10648 /* Remove output conversions that change the type but not the mode. */
10650 {
10655 /* ??? Really, this should not be here. Users should be using a
10656 proper lvalue, dammit. But there's a long history of using casts
10657 in the output operands. In cases like longlong.h, this becomes a
10658 primitive form of typechecking -- if the cast can be removed, then
10659 the output operand had a type of the proper width; otherwise we'll
10660 get an error. Gross, but ... */
10678 {
10679 /* If the operand is going to end up in memory,
10680 mark it addressable. */
10686 {
10689 }
10690 }
10691 else
10695 }
10698 {
10699 tree input;
10706 {
10707 /* If the operand is going to end up in memory,
10708 mark it addressable. */
10710 {
10713 /* Strip the nops as we allow this case. FIXME, this really
10714 should be rejected or made deprecated. */
10718 }
10719 else
10720 {
10728 {
10731 }
10732 }
10733 }
10734 else
10738 }
10742 /* asm statements without outputs, including simple ones, are treated
10743 as volatile. */
10749 }
10750 \f
10751 /* Generate a goto statement to LABEL. LOC is the location of the
10752 GOTO. */
10754 tree
10756 {
10761 {
10766 }
10767 }
10769 /* Generate a computed goto statement to EXPR. LOC is the location of
10770 the GOTO. */
10772 tree
10774 {
10775 tree t;
10782 }
10784 /* Generate a C `return' statement. RETVAL is the expression for what
10785 to return, or a null pointer for `return;' with no value. LOC is
10786 the location of the return statement, or the location of the expression,
10787 if the statement has any. If ORIGTYPE is not NULL_TREE, it
10788 is the original type of RETVAL. */
10790 tree
10792 {
10797 /* Use the expansion point to handle cases such as returning NULL
10798 in a function returning void. */
10806 {
10810 {
10813 }
10819 }
10822 {
10826 {
10829 warned_here = pedwarn
10832 else
10833 warned_here = warning_at
10840 }
10841 }
10843 {
10847 warned_here = pedwarn
10850 else
10851 warned_here = pedwarn
10857 }
10858 else
10859 {
10864 tree inner;
10882 /* Strip any conversions, additions, and subtractions, and see if
10883 we are returning the address of a local variable. Warn if so. */
10885 {
10887 {
10888 CASE_CONVERT:
10896 /* If the second operand of the MINUS_EXPR has a pointer
10897 type (or is converted from it), this may be valid, so
10898 don't give a warning. */
10899 {
10912 }
10926 {
10930 else
10931 {
10936 }
10937 }
10942 }
10945 }
10952 }
10957 }
10958 \f
10960 /* The SWITCH_STMT being built. */
10961 tree switch_stmt;
10963 /* The original type of the testing expression, i.e. before the
10964 default conversion is applied. */
10965 tree orig_type;
10967 /* A splay-tree mapping the low element of a case range to the high
10968 element, or NULL_TREE if there is no high element. Used to
10969 determine whether or not a new case label duplicates an old case
10970 label. We need a tree, rather than simply a hash table, because
10971 of the GNU case range extension. */
10972 splay_tree cases;
10974 /* The bindings at the point of the switch. This is used for
10975 warnings crossing decls when branching to a case label. */
10978 /* Whether the switch includes any break statements. */
10981 /* The next node on the stack. */
10984 /* Remember whether the controlling expression had boolean type
10985 before integer promotions for the sake of -Wswitch-bool. */
10987 };
10989 /* A stack of the currently active switch statements. The innermost
10990 switch statement is on the top of the stack. There is no need to
10991 mark the stack for garbage collection because it is only active
10992 during the processing of the body of a function, and we never
10993 collect at that point. */
10997 /* Start a C switch statement, testing expression EXP. Return the new
10998 SWITCH_STMT. SWITCH_LOC is the location of the `switch'.
10999 SWITCH_COND_LOC is the location of the switch's condition.
11000 EXPLICIT_CAST_P is true if the expression EXP has an explicit cast. */
11002 tree
11004 location_t switch_cond_loc,
11006 {
11012 {
11016 {
11018 {
11021 }
11023 }
11024 else
11025 {
11029 /* Warn if the condition has boolean value. */
11035 /* Explicit cast to int suppresses this warning. */
11052 }
11053 }
11055 /* Add this new SWITCH_STMT to the stack. */
11068 }
11070 /* Process a case label at location LOC. */
11072 tree
11074 {
11078 {
11083 }
11086 {
11091 }
11094 {
11097 else
11100 }
11104 loc))
11113 }
11115 /* Finish the switch statement. TYPE is the original type of the
11116 controlling expression of the switch, or NULL_TREE. */
11118 void
11120 {
11122 location_t switch_location;
11126 /* Emit warnings as needed. */
11136 /* Pop the stack. */
11141 }
11142 \f
11143 /* Emit an if statement. IF_LOCUS is the location of the 'if'. COND,
11144 THEN_BLOCK and ELSE_BLOCK are expressions to be used; ELSE_BLOCK
11145 may be null. */
11147 void
11149 tree else_block)
11150 {
11151 tree stmt;
11156 }
11158 tree
11160 {
11161 /* In switch statements break is sometimes stylistically used after
11162 a return statement. This can lead to spurious warnings about
11163 control reaching the end of a non-void function when it is
11164 inlined. Note that we are calling block_may_fallthru with
11165 language specific tree nodes; this works because
11166 block_may_fallthru returns true when given something it does not
11167 understand. */
11172 {
11189 }
11190 else
11192 {
11205 }
11210 {
11211 /* The foreach expander produces low-level code using gotos instead
11212 of a structured loop construct. */
11215 }
11217 }
11219 /* A helper routine for c_process_expr_stmt and c_finish_stmt_expr. */
11221 static void
11223 {
11228 ;
11230 {
11233 }
11235 {
11239 {
11243 }
11251 }
11252 else
11254 }
11256 /* Process an expression as if it were a complete statement. Emit
11257 diagnostics, but do not call ADD_STMT. LOC is the location of the
11258 statement. */
11260 tree
11262 {
11263 tree exprv;
11278 /* If we're not processing a statement expression, warn about unused values.
11279 Warnings for statement expressions will be emitted later, once we figure
11280 out which is the result. */
11295 /* If the expression is not of a type to which we cannot assign a line
11296 number, wrap the thing in a no-op NOP_EXPR. */
11298 {
11301 }
11304 }
11306 /* Emit an expression as a statement. LOC is the location of the
11307 expression. */
11309 tree
11311 {
11314 else
11316 }
11318 /* Do the opposite and emit a statement as an expression. To begin,
11319 create a new binding level and return it. */
11321 tree
11323 {
11324 tree ret;
11326 /* We must force a BLOCK for this level so that, if it is not expanded
11327 later, there is a way to turn off the entire subtree of blocks that
11328 are contained in it. */
11333 ? NULL
11336 /* Mark the current statement list as belonging to a statement list. */
11340 }
11342 /* LOC is the location of the compound statement to which this body
11343 belongs. */
11345 tree
11347 {
11354 ? NULL
11357 /* Locate the last statement in BODY. See c_end_compound_stmt
11358 about always returning a BIND_EXPR. */
11362 continue_searching:
11364 {
11370 /* This can happen with degenerate cases like ({ }). No value. */
11374 /* If we're supposed to generate side effects warnings, process
11375 all of the statements except the last. */
11377 {
11380 {
11381 location_t tloc;
11386 }
11387 }
11390 }
11392 /* If the end of the list is exception related, then the list was split
11393 by a call to push_cleanup. Continue searching. */
11396 {
11400 }
11405 /* In the case that the BIND_EXPR is not necessary, return the
11406 expression out from inside it. */
11408 /* Skip nested debug stmts. */
11411 {
11412 /* Even if this looks constant, do not allow it in a constant
11413 expression. */
11415 /* Do not warn if the return value of a statement expression is
11416 unused. */
11419 }
11421 /* Extract the type of said expression. */
11424 /* If we're not returning a value at all, then the BIND_EXPR that
11425 we already have is a fine expression to return. */
11429 /* Now that we've located the expression containing the value, it seems
11430 silly to make voidify_wrapper_expr repeat the process. Create a
11431 temporary of the appropriate type and stick it in a TARGET_EXPR. */
11434 /* Unwrap a no-op NOP_EXPR as added by c_finish_expr_stmt. This avoids
11435 tree_expr_nonnegative_p giving up immediately. */
11444 {
11448 }
11449 }
11450 \f
11451 /* Begin and end compound statements. This is as simple as pushing
11452 and popping new statement lists from the tree. */
11454 tree
11456 {
11461 }
11463 /* End a compound statement. STMT is the statement. LOC is the
11464 location of the compound statement-- this is usually the location
11465 of the opening brace. */
11467 tree
11469 {
11473 {
11477 }
11482 /* If this compound statement is nested immediately inside a statement
11483 expression, then force a BIND_EXPR to be created. Otherwise we'll
11484 do the wrong thing for ({ { 1; } }) or ({ 1; { } }). In particular,
11485 STATEMENT_LISTs merge, and thus we can lose track of what statement
11486 was really last. */
11490 {
11494 }
11497 }
11499 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
11500 when the current scope is exited. EH_ONLY is true when this is not
11501 meant to apply to normal control flow transfer. */
11503 void
11505 {
11517 }
11518 \f
11519 /* Build a vector comparison of ARG0 and ARG1 using CODE opcode
11520 into a value of TYPE type. Comparison is done via VEC_COND_EXPR. */
11522 static tree
11525 {
11531 }
11533 /* Build a binary-operation expression without default conversions.
11534 CODE is the kind of expression to build.
11535 LOCATION is the operator's location.
11536 This function differs from `build' in several ways:
11537 the data type of the result is computed and recorded in it,
11538 warnings are generated if arg data types are invalid,
11539 special handling for addition and subtraction of pointers is known,
11540 and some optimization is done (operations on narrow ints
11541 are done in the narrower type when that gives the same result).
11542 Constant folding is also done before the result is returned.
11544 Note that the operands will never have enumeral types, or function
11545 or array types, because either they will have the default conversions
11546 performed or they have both just been converted to some other type in which
11547 the arithmetic is to be done. */
11549 tree
11552 {
11554 tree eptype;
11562 /* Expression code to give to the expression when it is built.
11563 Normally this is CODE, which is what the caller asked for,
11564 but in some special cases we change it. */
11567 /* Data type in which the computation is to be performed.
11568 In the simplest cases this is the common type of the arguments. */
11571 /* When the computation is in excess precision, the type of the
11572 final EXCESS_PRECISION_EXPR. */
11575 /* Nonzero means operands have already been type-converted
11576 in whatever way is necessary.
11577 Zero means they need to be converted to RESULT_TYPE. */
11580 /* Nonzero means create the expression with this type, rather than
11581 RESULT_TYPE. */
11584 /* Nonzero means after finally constructing the expression
11585 convert it to this type. */
11588 /* Nonzero if this is an operation like MIN or MAX which can
11589 safely be computed in short if both args are promoted shorts.
11590 Also implies COMMON.
11591 -1 indicates a bitwise operation; this makes a difference
11592 in the exact conditions for when it is safe to do the operation
11593 in a narrower mode. */
11596 /* Nonzero if this is a comparison operation;
11597 if both args are promoted shorts, compare the original shorts.
11598 Also implies COMMON. */
11601 /* Nonzero if this is a right-shift operation, which can be computed on the
11602 original short and then promoted if the operand is a promoted short. */
11605 /* Nonzero means set RESULT_TYPE to the common type of the args. */
11608 /* True means types are compatible as far as ObjC is concerned. */
11611 /* True means this is an arithmetic operation that may need excess
11612 precision. */
11615 /* True means this is a boolean operation that converts both its
11616 operands to truth-values. */
11619 /* Remember whether we're doing / or %. */
11622 /* Remember whether we're doing << or >>. */
11625 /* Tree holding instrumentation expression. */
11642 {
11645 int_const = (int_const_or_overflow
11648 }
11649 else
11652 /* Do not apply default conversion in mixed vector/scalar expression. */
11655 {
11658 }
11664 /* The expression codes of the data types of the arguments tell us
11665 whether the arguments are integers, floating, pointers, etc. */
11669 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
11673 /* If an error was already reported for one of the arguments,
11674 avoid reporting another error. */
11689 {
11692 }
11695 {
11713 /* Excess precision for implicit conversions of integers to
11714 floating point in C11 and later. */
11715 may_need_excess_precision = (flag_isoc11
11723 }
11725 {
11728 }
11731 {
11734 }
11736 {
11739 }
11742 {
11745 }
11749 /* In case when one of the operands of the binary operation is
11750 a vector and another is a scalar -- convert scalar to vector. */
11753 {
11758 {
11762 {
11764 tree sc;
11775 }
11777 {
11779 tree sc;
11790 }
11793 }
11794 }
11797 {
11799 /* Handle the pointer + int case. */
11801 {
11804 }
11806 {
11809 }
11810 else
11815 /* Subtraction of two similar pointers.
11816 We must subtract them as integers, then divide by object size. */
11819 {
11822 }
11823 /* Handle pointer minus int. Just like pointer plus int. */
11825 {
11828 }
11829 else
11853 {
11864 else
11865 /* Although it would be tempting to shorten always here, that
11866 loses on some targets, since the modulo instruction is
11867 undefined if the quotient can't be represented in the
11868 computation mode. We shorten only if unsigned or if
11869 dividing by something we know != -1. */
11874 }
11882 /* Allow vector types which are not floating point types. */
11901 {
11902 /* Although it would be tempting to shorten always here, that loses
11903 on some targets, since the modulo instruction is undefined if the
11904 quotient can't be represented in the computation mode. We shorten
11905 only if unsigned or if dividing by something we know != -1. */
11910 }
11924 {
11925 /* Result of these operations is always an int,
11926 but that does not mean the operands should be
11927 converted to ints! */
11930 {
11933 }
11934 else
11937 {
11940 }
11941 else
11945 }
11947 {
11948 int_const_or_overflow = (int_operands
11952 int_const = (int_const_or_overflow
11956 }
11958 {
11959 int_const_or_overflow = (int_operands
11963 int_const = (int_const_or_overflow
11967 }
11970 /* Shift operations: result has same type as first operand;
11971 always convert second operand to int.
11972 Also set SHORT_SHIFT if shifting rightward. */
11981 {
11984 }
11989 {
11992 {
11994 {
11999 }
12001 {
12005 {
12010 }
12011 }
12012 else
12013 {
12018 {
12023 }
12024 }
12025 }
12027 /* Use the type of the value to be shifted. */
12029 /* Avoid converting op1 to result_type later. */
12031 }
12041 {
12044 }
12049 {
12053 {
12054 /* Don't reject a left shift of a negative value in a context
12055 where a constant expression is needed in C90. */
12061 }
12063 {
12065 {
12070 }
12072 {
12076 {
12081 }
12082 }
12084 {
12089 }
12094 }
12096 /* Use the type of the value to be shifted. */
12098 /* Avoid converting op1 to result_type later. */
12100 }
12106 {
12107 tree intt;
12109 {
12113 }
12117 {
12121 }
12123 /* It's not precisely specified how the usual arithmetic
12124 conversions apply to the vector types. Here, we use
12125 the unsigned type if one of the operands is signed and
12126 the other one is unsigned. */
12128 {
12131 else
12135 }
12137 /* Always construct signed integer vector type. */
12139 (SCALAR_TYPE_MODE
12142 {
12147 }
12153 }
12156 OPT_Wfloat_equal,
12158 /* Result of comparison is always int,
12159 but don't convert the args to int! */
12167 {
12171 {
12174 OPT_Waddress,
12175 "the comparison will always evaluate as %<false%> "
12178 else
12180 OPT_Waddress,
12181 "the comparison will always evaluate as %<true%> "
12184 }
12186 }
12188 {
12192 {
12195 OPT_Waddress,
12196 "the comparison will always evaluate as %<false%> "
12199 else
12201 OPT_Waddress,
12202 "the comparison will always evaluate as %<true%> "
12205 }
12207 }
12209 {
12216 /* Anything compares with void *. void * compares with anything.
12217 Otherwise, the targets must be compatible
12218 and both must be object or both incomplete. */
12222 {
12226 }
12228 {
12232 }
12234 {
12238 }
12239 else
12240 /* Avoid warning about the volatile ObjC EH puts on decls. */
12246 {
12248 result_type = build_pointer_type
12250 }
12251 }
12253 {
12256 }
12258 {
12261 }
12274 {
12275 tree intt;
12277 {
12281 }
12285 {
12289 }
12291 /* It's not precisely specified how the usual arithmetic
12292 conversions apply to the vector types. Here, we use
12293 the unsigned type if one of the operands is signed and
12294 the other one is unsigned. */
12296 {
12299 else
12303 }
12305 /* Always construct signed integer vector type. */
12307 (SCALAR_TYPE_MODE
12310 {
12315 }
12321 }
12329 {
12332 addr_space_t as_common;
12335 {
12349 }
12351 {
12355 }
12356 else
12357 {
12359 result_type = build_pointer_type
12363 }
12364 }
12366 {
12374 }
12376 {
12384 }
12386 {
12389 }
12391 {
12394 }
12399 {
12405 }
12416 }
12425 {
12427 maybe_range_label_for_tree_type_mismatch
12434 }
12439 &&
12443 {
12449 {
12452 "implicit conversion from %qT to %qT "
12453 "to match other operand of binary "
12455 location);
12458 }
12467 {
12468 /* An operation on mixed real/complex operands must be
12469 handled specially, but the language-independent code can
12470 more easily optimize the plain complex arithmetic if
12471 -fno-signed-zeros. */
12475 {
12478 }
12480 {
12485 }
12486 else
12487 {
12492 }
12496 {
12503 {
12508 /* Fall through. */
12515 }
12516 }
12517 else
12518 {
12525 {
12529 /* Fall through. */
12539 }
12540 }
12543 }
12545 /* For certain operations (which identify themselves by shorten != 0)
12546 if both args were extended from the same smaller type,
12547 do the arithmetic in that type and then extend.
12549 shorten !=0 and !=1 indicates a bitwise operation.
12550 For them, this optimization is safe only if
12551 both args are zero-extended or both are sign-extended.
12552 Otherwise, we might change the result.
12553 Eg, (short)-1 | (unsigned short)-1 is (int)-1
12554 but calculated in (unsigned short) it would be (unsigned short)-1. */
12557 {
12561 }
12563 /* Shifts can be shortened if shifting right. */
12566 {
12577 /* We can shorten only if the shift count is less than the
12578 number of bits in the smaller type size. */
12580 /* We cannot drop an unsigned shift after sign-extension. */
12582 {
12583 /* Do an unsigned shift if the operand was zero-extended. */
12584 result_type
12587 /* Convert value-to-be-shifted to that type. */
12591 }
12592 }
12594 /* Comparison operations are shortened too but differently.
12595 They identify themselves by setting short_compare = 1. */
12598 {
12599 /* Don't write &op0, etc., because that would prevent op0
12600 from being kept in a register.
12601 Instead, make copies of the our local variables and
12602 pass the copies by reference, then copy them back afterward. */
12605 tree val
12610 {
12613 }
12620 {
12626 {
12629 }
12630 else
12631 {
12632 /* Fold for the sake of possible warnings, as in
12633 build_conditional_expr. This requires the
12634 "original" values to be folded, not just op0 and
12635 op1. */
12636 c_inhibit_evaluation_warnings++;
12641 c_inhibit_evaluation_warnings--;
12643 require_constant_value,
12644 NULL);
12646 require_constant_value,
12647 NULL);
12648 }
12655 {
12660 }
12661 }
12662 }
12663 }
12665 /* At this point, RESULT_TYPE must be nonzero to avoid an error message.
12666 If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
12667 Then the expression will be built.
12668 It will be given type FINAL_TYPE if that is nonzero;
12669 otherwise, it will be given type RESULT_TYPE. */
12672 {
12673 /* Favor showing any expression locations that are available. */
12678 }
12681 {
12685 {
12688 }
12689 }
12692 {
12694 semantic_result_type);
12696 semantic_result_type);
12698 /* This can happen if one operand has a vector type, and the other
12699 has a different type. */
12702 }
12709 {
12710 /* OP0 and/or OP1 might have side-effects. */
12720 }
12722 /* Treat expressions in initializers specially as they can't trap. */
12724 ret = (require_constant_value
12728 else
12733 return_build_binary_op:
12736 ret = (int_operands
12753 }
12756 /* Convert EXPR to be a truth-value, validating its type for this
12757 purpose. LOCATION is the source location for the expression. */
12759 tree
12761 {
12765 {
12767 error_at (location, "used array that cannot be converted to pointer where scalar is required");
12796 }
12801 {
12806 }
12807 else
12808 /* ??? Should we also give an error for vectors rather than leaving
12809 those to give errors later? */
12813 {
12816 else
12818 }
12822 }
12823 \f
12825 /* Convert EXPR to a contained DECL, updating *TC, *TI and *SE as
12826 required. */
12828 tree
12830 {
12832 {
12834 /* Executing a compound literal inside a function reinitializes
12835 it. */
12839 }
12840 else
12842 }
12843 \f
12844 /* Generate OMP construct CODE, with BODY and CLAUSES as its compound
12845 statement. LOC is the location of the construct. */
12847 tree
12849 tree clauses)
12850 {
12860 }
12862 /* Generate OACC_DATA, with CLAUSES and BLOCK as its compound
12863 statement. LOC is the location of the OACC_DATA. */
12865 tree
12867 {
12868 tree stmt;
12879 }
12881 /* Generate OACC_HOST_DATA, with CLAUSES and BLOCK as its compound
12882 statement. LOC is the location of the OACC_HOST_DATA. */
12884 tree
12886 {
12887 tree stmt;
12898 }
12900 /* Like c_begin_compound_stmt, except force the retention of the BLOCK. */
12902 tree
12904 {
12905 tree block;
12911 }
12913 /* Generate OMP_PARALLEL, with CLAUSES and BLOCK as its compound
12914 statement. LOC is the location of the OMP_PARALLEL. */
12916 tree
12918 {
12919 tree stmt;
12930 }
12932 /* Like c_begin_compound_stmt, except force the retention of the BLOCK. */
12934 tree
12936 {
12937 tree block;
12943 }
12945 /* Generate OMP_TASK, with CLAUSES and BLOCK as its compound
12946 statement. LOC is the location of the #pragma. */
12948 tree
12950 {
12951 tree stmt;
12962 }
12964 /* Generate GOMP_cancel call for #pragma omp cancel. */
12966 void
12968 {
12979 else
12980 {
12982 "%<parallel%>, %<for%>, %<sections%> or %<taskgroup%> "
12985 }
12988 {
12993 else
12994 {
12997 {
13003 }
13004 }
13010 }
13011 else
13015 ifc);
13017 }
13019 /* Generate GOMP_cancellation_point call for
13020 #pragma omp cancellation point. */
13022 void
13024 {
13035 else
13036 {
13038 "%<parallel%>, %<for%>, %<sections%> or %<taskgroup%> "
13041 }
13045 }
13047 /* Helper function for handle_omp_array_sections. Called recursively
13048 to handle multiple array-section-subscripts. C is the clause,
13049 T current expression (initially OMP_CLAUSE_DECL), which is either
13050 a TREE_LIST for array-section-subscript (TREE_PURPOSE is low-bound
13051 expression if specified, TREE_VALUE length expression if specified,
13052 TREE_CHAIN is what it has been specified after, or some decl.
13053 TYPES vector is populated with array section types, MAYBE_ZERO_LEN
13054 set to true if any of the array-section-subscript could have length
13055 of zero (explicit or implicit), FIRST_NON_ONE is the index of the
13056 first array-section-subscript which is known not to have length
13057 of one. Given say:
13058 map(a[:b][2:1][:c][:2][:d][e:f][2:5])
13059 FIRST_NON_ONE will be 3, array-section-subscript [:b], [2:1] and [:c]
13060 all are or may have length of 1, array-section-subscript [:2] is the
13061 first one known not to have length 1. For array-section-subscript
13062 <= FIRST_NON_ONE we diagnose non-contiguous arrays if low bound isn't
13063 0 or length isn't the array domain max + 1, for > FIRST_NON_ONE we
13064 can if MAYBE_ZERO_LEN is false. MAYBE_ZERO_LEN will be true in the above
13065 case though, as some lengths could be zero. */
13067 static tree
13071 {
13074 {
13081 {
13085 }
13090 {
13092 {
13097 }
13099 {
13101 {
13105 }
13108 {
13113 else
13115 }
13116 }
13117 }
13119 {
13124 else
13129 }
13133 {
13137 }
13142 {
13147 }
13152 {
13153 /* If the array section is pointer based and the pointer
13154 itself is _Atomic qualified, we need to atomically load
13155 the pointer. */
13156 c_expr expr;
13162 }
13164 }
13179 {
13182 low_bound);
13184 }
13186 {
13189 length);
13191 }
13207 {
13209 {
13214 }
13215 }
13217 {
13219 {
13225 {
13227 {
13232 }
13233 }
13234 else
13236 }
13239 first_non_one++;
13240 }
13242 {
13246 {
13248 "for unknown bound array type length expression must "
13251 }
13254 {
13259 }
13263 {
13268 }
13273 {
13274 tree size
13278 {
13280 {
13282 "low bound %qE above array section size "
13286 }
13288 {
13294 {
13299 }
13301 }
13304 && tree_int_cst_equal
13306 low_bound))
13307 first_non_one++;
13308 }
13310 {
13318 first_non_one++;
13319 }
13321 {
13323 {
13325 "length %qE above array section size "
13329 }
13331 {
13332 tree lbpluslen
13338 {
13340 "high bound %qE above array section size "
13344 }
13345 }
13346 }
13347 }
13349 {
13357 first_non_one++;
13358 }
13360 /* For [lb:] we will need to evaluate lb more than once. */
13362 {
13365 {
13368 }
13369 }
13370 }
13372 {
13374 {
13377 "for array function parameter length expression "
13379 else
13383 }
13387 {
13392 }
13393 /* If there is a pointer type anywhere but in the very first
13394 array-section-subscript, the array section can't be contiguous. */
13398 {
13403 }
13404 }
13405 else
13406 {
13410 }
13413 /* We will need to evaluate lb more than once. */
13416 {
13419 }
13422 }
13424 /* Handle array sections for clause C. */
13426 static bool
13428 {
13441 ort);
13448 {
13451 /* Need to evaluate side effects in the length expressions
13452 if any. */
13454 {
13456 {
13459 else
13462 }
13464 }
13469 }
13470 else
13471 {
13481 {
13485 i--;
13499 {
13508 {
13509 tree size;
13512 size_one_node);
13514 {
13515 do_warn_noncontiguous:
13517 "array section is not contiguous in %qs "
13521 }
13522 }
13525 {
13528 else
13532 }
13533 }
13534 else
13535 {
13536 tree l;
13546 else
13547 {
13550 size_one_node);
13553 }
13555 {
13557 size_zero_node);
13560 else
13563 }
13565 {
13573 {
13576 {
13581 }
13584 }
13589 }
13590 else
13592 }
13593 }
13599 {
13622 else
13623 {
13628 }
13631 }
13644 {
13663 }
13669 else
13689 }
13691 }
13693 /* Helper function of finish_omp_clauses. Clone STMT as if we were making
13694 an inline call. But, remap
13695 the OMP_DECL1 VAR_DECL (omp_out resp. omp_orig) to PLACEHOLDER
13696 and OMP_DECL2 VAR_DECL (omp_in resp. omp_priv) to DECL. */
13698 static tree
13701 {
13702 copy_body_data id;
13721 }
13723 /* Helper function of c_finish_omp_clauses, called via walk_tree.
13724 Find OMP_CLAUSE_PLACEHOLDER (passed in DATA) in *TP. */
13726 static tree
13728 {
13732 }
13734 /* Similarly, but also walk aggregate fields. */
13738 static tree
13740 {
13744 {
13745 tree field;
13751 {
13760 pset);
13766 }
13767 }
13772 }
13774 /* Finish OpenMP iterators ITER. Return true if they are errorneous
13775 and clauses containing them should be removed. */
13777 static bool
13779 {
13782 {
13787 tree orig_step;
13791 {
13794 }
13796 {
13798 var);
13801 }
13803 {
13807 }
13809 {
13813 }
13816 {
13819 }
13821 {
13826 }
13833 {
13840 }
13842 {
13846 }
13852 {
13855 }
13857 tree it2;
13859 {
13868 {
13873 }
13875 {
13879 }
13881 {
13885 }
13887 {
13891 }
13892 }
13894 {
13897 }
13902 }
13904 }
13906 /* Ensure that pointers are used in OpenACC attach and detach clauses.
13907 Return true if an error has been detected. */
13909 static bool
13911 {
13915 /* OpenACC attach / detach clauses must be pointers. */
13918 {
13925 {
13929 }
13930 }
13933 }
13935 /* For all elements of CLAUSES, validate them against their constraints.
13936 Remove any elements from the list that are invalid. */
13938 tree
13940 {
13943 bitmap_head oacc_reduction_head;
13959 /* 1 if normal/task reduction has been seen, -1 if inscan reduction
13960 has been seen, -2 if mixed inscan/normal reduction diagnosed. */
13970 /* If ort == C_ORT_OMP_DECLARE_SIMD used as uniform_head instead. */
13974 /* If ort == C_ORT_OMP used as nontemporal_head or use_device_xxx_head
13975 instead. */
13981 {
13984 }
13987 {
13993 {
14009 {
14011 "%<inscan%> and non-%<inscan%> %<reduction%> clauses "
14014 }
14015 /* FALLTHRU */
14021 {
14023 {
14026 }
14031 {
14033 "%<inscan%> %<reduction%> clause with array "
14037 }
14038 }
14041 {
14044 }
14051 {
14057 {
14060 t);
14063 }
14067 {
14070 t);
14073 }
14078 index_type);
14085 }
14087 {
14092 }
14095 {
14096 /* Disallow zero sized or potentially zero sized task
14097 reductions. */
14099 {
14105 }
14107 {
14113 }
14114 }
14118 {
14123 {
14149 }
14151 {
14157 }
14158 }
14160 {
14165 }
14167 {
14177 {
14183 }
14193 decl_placeholder ? decl_placeholder
14201 {
14213 decl_placeholder ? decl_placeholder
14216 {
14221 }
14223 c_find_omp_placeholder_r,
14226 }
14227 else
14228 {
14229 tree init;
14233 else
14237 }
14243 }
14245 {
14249 {
14254 }
14260 }
14266 {
14268 "%<nowait%> clause must not be used together "
14272 }
14278 {
14283 }
14292 {
14294 "modifier should not be specified in %<linear%> "
14297 }
14300 {
14302 "linear clause applied to non-integral non-pointer "
14306 }
14308 {
14313 }
14315 {
14318 {
14320 /* map_head bitmap is used as uniform_head if
14321 declare_simd. */
14325 }
14327 {
14329 "%<linear%> clause step %qE is neither constant "
14333 }
14334 }
14336 {
14342 fold_convert
14347 }
14348 else
14353 check_dup_generic:
14355 check_dup_generic_t:
14357 {
14362 }
14369 {
14371 {
14373 ort == C_ORT_ACC
14376 t);
14378 }
14379 else
14381 }
14385 {
14389 }
14392 {
14396 else
14400 }
14401 else
14407 {
14408 move_implicit:
14410 /* Move firstprivate and map clauses with
14411 OMP_CLAUSE_{FIRSTPRIVATE,MAP}_IMPLICIT set to the end of
14412 clauses chain. */
14418 {
14422 }
14425 {
14429 }
14430 else
14436 }
14441 {
14445 }
14452 {
14456 }
14458 {
14465 else
14469 }
14470 else
14479 {
14483 }
14486 {
14490 }
14491 else
14498 {
14502 }
14505 {
14507 "%qE in %<aligned%> clause is neither a pointer nor "
14510 }
14512 {
14517 }
14519 {
14522 t);
14524 }
14525 else
14532 {
14536 }
14538 {
14540 "%qE appears more than once in %<nontemporal%> "
14543 }
14544 else
14551 {
14555 }
14557 {
14560 t);
14562 }
14563 else
14564 {
14568 }
14574 {
14578 }
14580 {
14583 {
14586 {
14594 sizetype,
14598 {
14601 }
14603 }
14604 }
14606 }
14607 /* FALLTHRU */
14613 {
14615 last_iterators_remove
14621 }
14622 else
14625 {
14630 {
14632 "%<depend%> clause with %<depobj%> dependence "
14635 }
14637 }
14641 {
14643 "%qE is not lvalue expression nor array section in "
14647 }
14650 {
14657 }
14660 {
14662 {
14664 "%qE does not have %<omp_depend_t%> type in "
14665 "%<depend%> clause with %<depobj%> dependence "
14668 }
14669 }
14672 {
14674 "%qE should not have %<omp_depend_t%> type in "
14675 "%<depend%> clause with dependence type other than "
14678 }
14680 {
14685 else
14686 {
14688 RO_UNARY_STAR);
14696 else
14698 }
14699 }
14705 /* FALLTHRU */
14711 {
14714 else
14715 {
14718 {
14720 "array section does not have mappable type "
14724 }
14726 {
14731 }
14736 {
14745 {
14748 }
14752 {
14755 "%qD appears more than once in motion "
14759 "%qD appears more than once in data "
14761 else
14763 "%qD appears more than once in map "
14766 }
14767 else
14768 {
14771 }
14772 }
14773 }
14779 /* In this case, we have a single array element which is a
14780 pointer, and we already set OMP_CLAUSE_SIZE in
14781 handle_omp_array_sections above. For attach/detach clauses,
14782 reset the OMP_CLAUSE_SIZE (representing a bias) to zero
14783 here. */
14786 }
14788 {
14791 }
14792 /* OpenACC attach / detach clauses must be pointers. */
14794 {
14797 }
14801 /* For attach/detach clauses, set OMP_CLAUSE_SIZE (representing a
14802 bias) to zero here, so it is not set erroneously to the pointer
14803 size later on in gimplify.c. */
14807 {
14809 {
14814 }
14816 {
14821 }
14823 {
14828 }
14830 {
14833 {
14838 }
14841 {
14846 else
14848 }
14849 }
14853 {
14858 }
14859 }
14861 {
14866 }
14868 {
14873 }
14887 {
14892 }
14896 {
14901 }
14910 {
14913 {
14917 }
14919 {
14923 else
14927 }
14928 else
14929 {
14932 }
14933 }
14937 {
14944 else
14948 }
14951 {
14955 }
14957 {
14961 else
14965 }
14966 else
14967 {
14972 }
14980 ;
14982 {
14985 "%qE is neither a variable nor a function name in "
14988 else
14993 }
14995 {
15000 }
15002 {
15007 }
15011 {
15013 "%qE appears more than once on the same "
15016 }
15017 else
15024 {
15028 else
15033 }
15034 /* map_head bitmap is used as uniform_head if declare_simd. */
15042 {
15045 {
15050 }
15052 {
15057 }
15058 }
15069 {
15071 "%<nowait%> clause must not be used together "
15075 }
15082 {
15084 "%<order%> clause must not be used together "
15088 }
15090 {
15091 /* Silently remove duplicates. */
15094 }
15102 {
15108 }
15173 {
15175 "%<order%> clause must not be used together "
15179 }
15195 {
15197 "%<inbranch%> clause is incompatible with "
15201 }
15212 {
15217 }
15222 }
15225 {
15229 {
15233 }
15236 {
15242 {
15249 /* The __func__ variable and similar function-local
15250 predefined variables may be listed in a shared or
15251 firstprivate clause. */
15260 }
15262 {
15268 }
15272 {
15274 "%<const%> qualified %qE may appear only in "
15277 }
15278 }
15279 }
15283 else
15285 }
15288 && safelen
15291 {
15293 "%<simdlen%> clause value is bigger than "
15297 }
15300 && schedule_clause
15303 {
15305 "%<nonmonotonic%> schedule modifier specified together "
15311 }
15314 {
15316 "%qs clause specified together with %<inscan%> "
15319 }
15322 {
15324 "%qs clause specified together with %<inscan%> "
15327 }
15331 {
15335 {
15340 {
15350 }
15351 /* FALLTHRU */
15362 }
15367 {
15369 "%<linear%> clause step is a parameter %qD not "
15373 }
15380 else
15382 }
15386 {
15391 {
15393 "%qD specified in %<allocate%> clause but not in "
15396 }
15399 else
15401 }
15404 {
15406 "%<nogroup%> clause must not be used together with "
15409 }
15412 {
15414 {
15416 "%<detach%> clause must not be used together with "
15419 }
15420 else
15421 {
15425 {
15432 {
15434 "the event handle of a %<detach%> clause "
15437 }
15440 else
15442 }
15443 }
15444 }
15448 }
15450 /* Return code to initialize DST with a copy constructor from SRC.
15451 C doesn't have copy constructors nor assignment operators, only for
15452 _Atomic vars we need to perform __atomic_load from src into a temporary
15453 followed by __atomic_store of the temporary to dst. */
15455 tree
15457 {
15472 /* Expansion of a generic atomic load may require an addition
15473 element, so allocate enough to prevent a resize. */
15476 /* Build __atomic_load (&src, &tmp, SEQ_CST); */
15485 /* Build __atomic_store (&dst, &tmp, SEQ_CST); */
15492 }
15494 /* Create a transaction node. */
15496 tree
15498 {
15505 }
15507 /* Make a variant type in the proper way for C/C++, propagating qualifiers
15508 down to the element type of an array. If ORIG_QUAL_TYPE is not
15509 NULL, then it should be used as the qualified type
15510 ORIG_QUAL_INDIRECT levels down in array type derivation (to
15511 preserve information about the typedef name from which an array
15512 type was derived). */
15514 tree
15517 {
15522 {
15523 tree t;
15528 /* See if we already have an identically qualified type. */
15531 else
15533 {
15540 }
15542 {
15553 {
15554 tree unqualified_canon
15559 {
15560 unqualified_canon
15563 }
15566 }
15567 else
15569 }
15571 }
15573 /* A restrict-qualified pointer type must be a pointer to object or
15574 incomplete type. Note that the use of POINTER_TYPE_P also allows
15575 REFERENCE_TYPEs, which is appropriate for C++. */
15579 {
15582 }
15585 ? orig_qual_type
15587 /* A variant type does not inherit the list of incomplete vars from the
15588 type main variant. */
15594 }
15596 /* Build a VA_ARG_EXPR for the C parser. */
15598 tree
15600 {
15603 /* VA_ARG_EXPR cannot be used for a scalar va_list with reverse storage
15604 order because it takes the address of the expression. */
15607 {
15610 }
15612 {
15616 }
15621 }
15623 /* Return truthvalue of whether T1 is the same tree structure as T2.
15624 Return 1 if they are the same. Return false if they are different. */
15626 bool
15628 {
15647 /* They might have become equal now. */
15655 {
15679 /* We need to do this when determining whether or not two
15680 non-type pointer to member function template arguments
15681 are the same. */
15685 {
15689 {
15694 }
15695 }
15709 {
15724 }
15727 {
15731 /* Special case: if either target is an unallocated VAR_DECL,
15732 it means that it's going to be unified with whatever the
15733 TARGET_EXPR is really supposed to initialize, so treat it
15734 as being equivalent to anything. */
15745 }
15762 {
15771 }
15775 }
15778 {
15786 {
15790 {
15802 }
15813 }
15819 }
15820 /* We can get here with --disable-checking. */
15822 }
15824 /* Returns true when the function declaration FNDECL is implicit,
15825 introduced as a result of a call to an otherwise undeclared
15826 function, and false otherwise. */
15828 bool
15830 {
15832 }