| blob | 0aac978c02e0609d7d2f40072750c88775ec8fc1 |
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. */
1331 pedwarn_c11 (location, OPT_Wpedantic, "invalid use of pointers to arrays with different qualifiers "
1342 }
1343 \f
1344 /* Subroutines of `comptypes'. */
1346 /* Determine whether two trees derive from the same translation unit.
1347 If the CONTEXT chain ends in a null, that tree's context is still
1348 being parsed, so if two trees have context chains ending in null,
1349 they're in the same translation unit. */
1351 bool
1353 {
1356 {
1364 }
1368 {
1376 }
1379 }
1381 /* Allocate the seen two types, assuming that they are compatible. */
1385 {
1393 /* The C standard says that two structures in different translation
1394 units are compatible with each other only if the types of their
1395 fields are compatible (among other things). We assume that they
1396 are compatible until proven otherwise when building the cache.
1397 An example where this can occur is:
1398 struct a
1399 {
1400 struct a *next;
1401 };
1402 If we are comparing this against a similar struct in another TU,
1403 and did not assume they were compatible, we end up with an infinite
1404 loop. */
1407 }
1409 /* Free the seen types until we get to TU_TIL. */
1411 static void
1413 {
1416 {
1421 }
1423 }
1425 /* Return 1 if two 'struct', 'union', or 'enum' types T1 and T2 are
1426 compatible. If the two types are not the same (which has been
1427 checked earlier), this can only happen when multiple translation
1428 units are being compiled. See C99 6.2.7 paragraph 1 for the exact
1429 rules. ENUM_AND_INT_P and DIFFERENT_TYPES_P are as in
1430 comptypes_internal. */
1432 static int
1435 {
1439 /* We have to verify that the tags of the types are the same. This
1440 is harder than it looks because this may be a typedef, so we have
1441 to go look at the original type. It may even be a typedef of a
1442 typedef...
1443 In the case of compiler-created builtin structs the TYPE_DECL
1444 may be a dummy, with no DECL_ORIGINAL_TYPE. Don't fault. */
1455 /* C90 didn't have the requirement that the two tags be the same. */
1459 /* C90 didn't say what happened if one or both of the types were
1460 incomplete; we choose to follow C99 rules here, which is that they
1461 are compatible. */
1466 {
1471 }
1474 {
1476 {
1478 /* Speed up the case where the type values are in the same order. */
1483 {
1485 }
1488 {
1492 {
1495 }
1496 }
1499 {
1501 }
1503 {
1506 }
1509 {
1512 }
1515 {
1519 {
1522 }
1523 }
1525 }
1528 {
1531 {
1534 }
1536 /* Speed up the common case where the fields are in the same order. */
1539 {
1550 {
1553 }
1560 {
1563 }
1564 }
1566 {
1569 }
1572 {
1577 {
1581 enum_and_int_p,
1582 different_types_p);
1587 {
1590 }
1601 }
1603 {
1606 }
1607 }
1610 }
1613 {
1619 {
1635 }
1638 else
1641 }
1645 }
1646 }
1648 /* Return 1 if two function types F1 and F2 are compatible.
1649 If either type specifies no argument types,
1650 the other must specify a fixed number of self-promoting arg types.
1651 Otherwise, if one type specifies only the number of arguments,
1652 the other must specify that number of self-promoting arg types.
1653 Otherwise, the argument types must match.
1654 ENUM_AND_INT_P and DIFFERENT_TYPES_P are as in comptypes_internal. */
1656 static int
1659 {
1661 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1669 /* 'volatile' qualifiers on a function's return type used to mean
1670 the function is noreturn. */
1690 /* An unspecified parmlist matches any specified parmlist
1691 whose argument types don't need default promotions. */
1694 {
1697 /* If one of these types comes from a non-prototype fn definition,
1698 compare that with the other type's arglist.
1699 If they don't match, ask for a warning (but no error). */
1705 }
1707 {
1715 }
1717 /* Both types have argument lists: compare them and propagate results. */
1719 different_types_p);
1721 }
1723 /* Check two lists of types for compatibility, returning 0 for
1724 incompatible, 1 for compatible, or 2 for compatible with
1725 warning. ENUM_AND_INT_P and DIFFERENT_TYPES_P are as in
1726 comptypes_internal. */
1728 static int
1731 {
1732 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1737 {
1741 /* If one list is shorter than the other,
1742 they fail to match. */
1750 TYPE_QUAL_ATOMIC)
1755 TYPE_QUAL_ATOMIC)
1757 /* A null pointer instead of a type
1758 means there is supposed to be an argument
1759 but nothing is specified about what type it has.
1760 So match anything that self-promotes. */
1765 {
1768 }
1770 {
1773 }
1774 /* If one of the lists has an error marker, ignore this arg. */
1777 ;
1779 different_types_p)))
1780 {
1783 /* Allow wait (union {union wait *u; int *i} *)
1784 and wait (union wait *) to be compatible. */
1791 {
1792 tree memb;
1795 {
1801 TYPE_QUAL_ATOMIC)
1804 different_types_p))
1806 }
1809 }
1816 {
1817 tree memb;
1820 {
1826 TYPE_QUAL_ATOMIC)
1829 different_types_p))
1831 }
1834 }
1835 else
1837 }
1839 /* comptypes said ok, but record if it said to warn. */
1845 }
1846 }
1847 \f
1848 /* Compute the size to increment a pointer by. When a function type or void
1849 type or incomplete type is passed, size_one_node is returned.
1850 This function does not emit any diagnostics; the caller is responsible
1851 for that. */
1853 static tree
1855 {
1862 /* Convert in case a char is more than one unit. */
1866 }
1867 \f
1868 /* Return either DECL or its known constant value (if it has one). */
1870 tree
1872 {
1879 /* This is invalid if initial value is not constant.
1880 If it has either a function call, a memory reference,
1881 or a variable, then re-evaluating it could give different results. */
1883 /* Check for cases where this is sub-optimal, even though valid. */
1887 }
1889 /* Return either DECL or its known constant value (if it has one).
1890 Like the above, but always return decl outside of functions. */
1892 tree
1894 {
1895 /* Don't change a variable array bound or initial value to a constant
1896 in a place where a variable is invalid. */
1898 }
1900 /* Convert the array expression EXP to a pointer. */
1901 static tree
1903 {
1906 tree adr;
1908 tree ptrtype;
1921 /* In C++ array compound literals are temporary objects unless they are
1922 const or appear in namespace scope, so they are destroyed too soon
1923 to use them for much of anything (c++/53220). */
1925 {
1929 "converting an array compound literal to a pointer "
1931 }
1935 }
1937 /* Convert the function expression EXP to a pointer. */
1938 static tree
1940 {
1950 }
1952 /* Mark EXP as read, not just set, for set but not used -Wunused
1953 warning purposes. */
1955 void
1957 {
1959 {
1969 CASE_CONVERT:
1975 /* Pattern match what build_atomic_assign produces with modifycode
1976 NOP_EXPR. */
1980 {
1986 {
1994 {
2007 }
2009 {
2015 }
2016 }
2017 }
2018 /* FALLTHRU */
2024 }
2025 }
2027 /* Perform the default conversion of arrays and functions to pointers.
2028 Return the result of converting EXP. For any other expression, just
2029 return EXP.
2031 LOC is the location of the expression. */
2033 struct c_expr
2035 {
2041 {
2043 {
2050 {
2054 }
2060 {
2061 /* Before C99, non-lvalue arrays do not decay to pointers.
2062 Normally, using such an array would be invalid; but it can
2063 be used correctly inside sizeof or as a statement expression.
2064 Thus, do not give an error here; an error will result later. */
2066 }
2069 }
2076 }
2079 }
2081 struct c_expr
2083 {
2086 }
2088 /* Return whether EXPR should be treated as an atomic lvalue for the
2089 purposes of load and store handling. */
2091 static bool
2093 {
2101 /* Ignore _Atomic on register variables, since their addresses can't
2102 be taken so (a) atomicity is irrelevant and (b) the normal atomic
2103 sequences wouldn't work. Ignore _Atomic on structures containing
2104 bit-fields, since accessing elements of atomic structures or
2105 unions is undefined behavior (C11 6.5.2.3#5), but it's unclear if
2106 it's undefined at translation time or execution time, and the
2107 normal atomic sequences again wouldn't work. */
2109 {
2114 }
2118 }
2120 /* Convert expression EXP (location LOC) from lvalue to rvalue,
2121 including converting functions and arrays to pointers if CONVERT_P.
2122 If READ_P, also mark the expression as having been read. */
2124 struct c_expr
2127 {
2135 {
2144 /* Expansion of a generic atomic load may require an addition
2145 element, so allocate enough to prevent a resize. */
2148 /* Remove the qualifiers for the rest of the expressions and
2149 create the VAL temp variable to hold the RHS. */
2154 /* Do not disable warnings for TMP even though it's artificial.
2155 -Winvalid-memory-model depends on it. */
2157 /* Issue __atomic_load (&expr, &tmp, SEQ_CST); */
2164 /* EXPR is always read. */
2167 /* Return tmp which contains the value loaded. */
2170 }
2173 exp.value = convert (build_qualified_type (TREE_TYPE (exp.value), TYPE_UNQUALIFIED), exp.value);
2175 }
2177 /* EXP is an expression of integer type. Apply the integer promotions
2178 to it and return the promoted value. */
2180 tree
2182 {
2188 /* Normally convert enums to int,
2189 but convert wide enums to something wider. */
2191 {
2199 }
2201 /* ??? This should no longer be needed now bit-fields have their
2202 proper types. */
2205 /* If it's thinner than an int, promote it like a
2206 c_promoting_integer_type_p, otherwise leave it alone. */
2212 {
2213 /* Preserve unsignedness if not really getting any wider. */
2219 }
2222 }
2225 /* Perform default promotions for C data used in expressions.
2226 Enumeral types or short or char are converted to int.
2227 In addition, manifest constants symbols are replaced by their values. */
2229 tree
2231 {
2232 tree orig_exp;
2235 tree promoted_type;
2239 /* Functions and arrays have been converted during parsing. */
2244 /* Constants can be used directly unless they're not loadable. */
2248 /* Strip no-op conversions. */
2255 {
2259 }
2273 }
2274 \f
2275 /* Look up COMPONENT in a structure or union TYPE.
2277 If the component name is not found, returns NULL_TREE. Otherwise,
2278 the return value is a TREE_LIST, with each TREE_VALUE a FIELD_DECL
2279 stepping down the chain to the component, which is in the last
2280 TREE_VALUE of the list. Normally the list is of length one, but if
2281 the component is embedded within (nested) anonymous structures or
2282 unions, the list steps down the chain to the component. */
2284 static tree
2286 {
2287 tree field;
2289 /* If TYPE_LANG_SPECIFIC is set, then it is a sorted array of pointers
2290 to the field elements. Use a binary search on this array to quickly
2291 find the element. Otherwise, do a linear search. TYPE_LANG_SPECIFIC
2292 will always be set for structures which have many elements.
2294 Duplicate field checking replaces duplicates with NULL_TREE so
2295 TYPE_LANG_SPECIFIC arrays are potentially no longer sorted. In that
2296 case just iterate using DECL_CHAIN. */
2300 {
2308 {
2313 {
2314 /* Step through all anon unions in linear fashion. */
2316 {
2319 {
2325 /* The Plan 9 compiler permits referring
2326 directly to an anonymous struct/union field
2327 using a typedef name. */
2335 }
2336 }
2338 /* Entire record is only anon unions. */
2342 /* Restart the binary search, with new lower bound. */
2344 }
2350 else
2352 }
2358 }
2359 else
2360 {
2362 {
2365 {
2371 /* The Plan 9 compiler permits referring directly to an
2372 anonymous struct/union field using a typedef
2373 name. */
2380 }
2384 }
2388 }
2391 }
2393 /* Recursively append candidate IDENTIFIER_NODEs to CANDIDATES. */
2395 static void
2398 {
2399 tree field;
2401 {
2405 candidates);
2409 }
2410 }
2412 /* Like "lookup_field", but find the closest matching IDENTIFIER_NODE,
2413 rather than returning a TREE_LIST for an exact match. */
2415 static tree
2417 {
2420 /* First, gather a list of candidates. */
2427 }
2429 /* Support function for build_component_ref's error-handling.
2431 Given DATUM_TYPE, and "DATUM.COMPONENT", where DATUM is *not* a
2432 struct or union, should we suggest "DATUM->COMPONENT" as a hint? */
2434 static bool
2436 {
2437 /* We don't do it for Objective-C, since Objective-C 2.0 dot-syntax
2438 allows "." for ptrs; we could be handling a failed attempt
2439 to access a property. */
2443 /* Only suggest it for pointers... */
2447 /* ...to structs/unions. */
2452 else
2454 }
2456 /* Make an expression to refer to the COMPONENT field of structure or
2457 union value DATUM. COMPONENT is an IDENTIFIER_NODE. LOC is the
2458 location of the COMPONENT_REF. COMPONENT_LOC is the location
2459 of COMPONENT. */
2461 tree
2463 location_t component_loc)
2464 {
2468 tree ref;
2474 /* Detect Objective-C property syntax object.property. */
2479 /* See if there is a field or component with name COMPONENT. */
2482 {
2484 {
2487 }
2492 {
2495 {
2496 /* Attempt to provide a fixit replacement hint, if
2497 we have a valid range for the component. */
2498 location_t reported_loc
2506 }
2507 else
2510 }
2512 /* Accessing elements of atomic structures or unions is undefined
2513 behavior (C11 6.5.2.3#5). */
2515 {
2519 else
2522 }
2524 /* Chain the COMPONENT_REFs if necessary down to the FIELD.
2525 This might be better solved in future the way the C++ front
2526 end does it - by giving the anonymous entities each a
2527 separate name and type, and then have build_component_ref
2528 recursively call itself. We can't do that here. */
2529 do
2530 {
2533 tree subtype;
2539 /* If this is an rvalue, it does not have qualifiers in C
2540 standard terms and we must avoid propagating such
2541 qualifiers down to a non-lvalue array that is then
2542 converted to a pointer. */
2543 use_datum_quals = (datum_lvalue
2552 NULL_TREE);
2569 }
2573 }
2575 {
2576 /* Special-case the error message for "ptr.field" for the case
2577 where the user has confused "." vs "->". */
2579 /* "loc" should be the "." token. */
2583 datum);
2585 }
2589 component);
2592 }
2593 \f
2594 /* Given an expression PTR for a pointer, return an expression
2595 for the value pointed to.
2596 ERRORSTRING is the name of the operator to appear in error messages.
2598 LOC is the location to use for the generated tree. */
2600 tree
2602 {
2605 tree ref;
2608 {
2611 {
2612 /* If a warning is issued, mark it to avoid duplicates from
2613 the backend. This only needs to be done at
2614 warn_strict_aliasing > 2. */
2619 }
2624 {
2628 }
2629 else
2630 {
2638 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
2639 so that we get the proper error message if the result is used
2640 to assign to. Also, &* is supposed to be a no-op.
2641 And ANSI C seems to specify that the type of the result
2642 should be the const type. */
2643 /* A de-reference of a pointer to const is not a const. It is valid
2644 to change it via some other pointer. */
2651 }
2652 }
2657 }
2659 /* This handles expressions of the form "a[i]", which denotes
2660 an array reference.
2662 This is logically equivalent in C to *(a+i), but we may do it differently.
2663 If A is a variable or a member, we generate a primitive ARRAY_REF.
2664 This avoids forcing the array out of registers, and can work on
2665 arrays that are not lvalues (for example, members of structures returned
2666 by functions).
2668 For vector types, allow vector[i] but not i[vector], and create
2669 *(((type*)&vectortype) + i) for the expression.
2671 LOC is the location to use for the returned expression. */
2673 tree
2675 {
2676 tree ret;
2684 /* Allow vector[index] but not index[vector]. */
2686 {
2689 {
2694 }
2697 }
2700 {
2703 }
2706 {
2709 }
2711 /* ??? Existing practice has been to warn only when the char
2712 index is syntactically the index, not for char[array]. */
2716 /* Apply default promotions *after* noticing character types. */
2727 {
2730 /* An array that is indexed by a non-constant
2731 cannot be stored in a register; we must be able to do
2732 address arithmetic on its address.
2733 Likewise an array of elements of variable size. */
2737 {
2740 }
2741 /* An array that is indexed by a constant value which is not within
2742 the array bounds cannot be stored in a register either; because we
2743 would get a crash in store_bit_field/extract_bit_field when trying
2744 to access a non-existent part of the register. */
2748 {
2751 }
2755 {
2764 "ISO C90 forbids subscripting non-lvalue "
2766 }
2770 /* Array ref is const/volatile if the array elements are
2771 or if the array is. */
2780 /* This was added by rms on 16 Nov 91.
2781 It fixes vol struct foo *a; a->elts[1]
2782 in an inline function.
2783 Hope it doesn't break something else. */
2790 }
2791 else
2792 {
2803 RO_ARRAY_INDEXING);
2807 }
2808 }
2809 \f
2810 /* Build an external reference to identifier ID. FUN indicates
2811 whether this will be used for a function call. LOC is the source
2812 location of the identifier. This sets *TYPE to the type of the
2813 identifier, which is not the same as the type of the returned value
2814 for CONST_DECLs defined as enum constants. If the type of the
2815 identifier is not available, *TYPE is set to NULL. */
2816 tree
2818 {
2819 tree ref;
2822 /* In Objective-C, an instance variable (ivar) may be preferred to
2823 whatever lookup_name() found. */
2828 {
2831 }
2833 /* Implicit function declaration. */
2836 /* Don't complain about something that's already been
2837 complained about. */
2839 else
2840 {
2843 }
2853 /* Recursive call does not count as usage. */
2855 {
2857 }
2860 {
2867 }
2870 {
2876 {
2881 }
2885 }
2890 {
2895 }
2896 /* C99 6.7.4p3: An inline definition of a function with external
2897 linkage ... shall not contain a reference to an identifier with
2898 internal linkage. */
2907 csi_internal);
2910 }
2912 /* Record details of decls possibly used inside sizeof or typeof. */
2913 struct maybe_used_decl
2914 {
2915 /* The decl. */
2916 tree decl;
2917 /* The level seen at (in_sizeof + in_typeof). */
2919 /* The next one at this level or above, or NULL. */
2921 };
2925 /* Record that DECL, an undefined static function reference seen
2926 inside sizeof or typeof, might be used if the operand of sizeof is
2927 a VLA type or the operand of typeof is a variably modified
2928 type. */
2930 static void
2932 {
2938 }
2940 /* Pop the stack of decls possibly used inside sizeof or typeof. If
2941 USED is false, just discard them. If it is true, mark them used
2942 (if no longer inside sizeof or typeof) or move them to the next
2943 level up (if still inside sizeof or typeof). */
2945 void
2947 {
2951 {
2953 {
2956 else
2958 }
2960 }
2963 }
2965 /* Return the result of sizeof applied to EXPR. */
2967 struct c_expr
2969 {
2972 {
2977 }
2978 else
2979 {
2984 {
2985 auto_diagnostic_group d;
2987 "%<sizeof%> on array function parameter %qE will "
2991 }
3000 {
3001 /* sizeof is evaluated when given a vla (C99 6.5.3.4p2). */
3006 }
3008 }
3010 }
3012 /* Return the result of sizeof applied to T, a structure for the type
3013 name passed to sizeof (rather than the type itself). LOC is the
3014 location of the original expression. */
3016 struct c_expr
3018 {
3019 tree type;
3030 {
3033 }
3034 else
3037 {
3038 /* If the type is a [*] array, it is a VLA but is represented as
3039 having a size of zero. In such a case we must ensure that
3040 the result of sizeof does not get folded to a constant by
3041 c_fully_fold, because if the size is evaluated the result is
3042 not constant and so constraints on zero or negative size
3043 arrays must not be applied when this sizeof call is inside
3044 another array declarator. */
3050 }
3054 }
3056 /* Build a function call to function FUNCTION with parameters PARAMS.
3057 The function call is at LOC.
3058 PARAMS is a list--a chain of TREE_LIST nodes--in which the
3059 TREE_VALUE of each node is a parameter-expression.
3060 FUNCTION's data type may be a function type or a pointer-to-function. */
3062 tree
3064 {
3066 tree ret;
3074 }
3076 /* Give a note about the location of the declaration of DECL. */
3078 static void
3080 {
3084 }
3086 /* Build a function call to function FUNCTION with parameters PARAMS.
3087 If FUNCTION is the result of resolving an overloaded target built-in,
3088 ORIG_FUNDECL is the original function decl, otherwise it is null.
3089 ORIGTYPES, if not NULL, is a vector of types; each element is
3090 either NULL or the original type of the corresponding element in
3091 PARAMS. The original type may differ from TREE_TYPE of the
3092 parameter for enums. FUNCTION's data type may be a function type
3093 or pointer-to-function. This function changes the elements of
3094 PARAMS. */
3096 tree
3100 {
3103 tree tem;
3108 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
3111 /* Convert anything with function type to a pointer-to-function. */
3113 {
3121 /* Atomic functions have type checking/casting already done. They are
3122 often rewritten and don't match the original parameter list. */
3125 }
3129 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
3130 expressions, like those used for ObjC messenger dispatches. */
3143 {
3147 function);
3149 {
3152 function);
3154 }
3155 else
3159 }
3164 /* fntype now gets the type of function pointed to. */
3167 /* Convert the parameters to the types declared in the
3168 function prototype, or apply default promotions. */
3175 /* Check that the function is called through a compatible prototype.
3176 If it is not, warn. */
3181 {
3184 /* This situation leads to run-time undefined behavior. We can't,
3185 therefore, simply error unless we can prove that all possible
3186 executions of the program must execute the code. */
3193 }
3197 /* Check that arguments to builtin functions match the expectations. */
3204 /* Check that the arguments to the function are valid. */
3210 {
3212 result
3215 else
3221 }
3222 else
3225 /* If -Wnonnull warning has been diagnosed, avoid diagnosing it again
3226 later. */
3230 /* In this improbable scenario, a nested function returns a VM type.
3231 Create a TARGET_EXPR so that the call always has a LHS, much as
3232 what the C++ FE does for functions returning non-PODs. */
3234 {
3238 }
3241 {
3246 }
3248 }
3250 /* Like build_function_call_vec, but call also resolve_overloaded_builtin. */
3252 tree
3256 {
3257 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
3260 /* Convert anything with function type to a pointer-to-function. */
3262 {
3263 /* Implement type-directed function overloading for builtins.
3264 resolve_overloaded_builtin and targetm.resolve_overloaded_builtin
3265 handle all the type checking. The result is a complete expression
3266 that implements this function call. */
3270 }
3272 }
3273 \f
3274 /* Helper for convert_arguments called to convert the VALue of argument
3275 number ARGNUM from ORIGTYPE to the corresponding parameter number
3276 PARMNUM and TYPE.
3277 PLOC is the location where the conversion is being performed.
3278 FUNCTION and FUNDECL are the same as in convert_arguments.
3279 VALTYPE is the original type of VAL before the conversion and,
3280 for EXCESS_PRECISION_EXPR, the operand of the expression.
3281 NPC is true if VAL represents the null pointer constant (VAL itself
3282 will have been folded to an integer constant).
3283 RNAME is the same as FUNCTION except in Objective C when it's
3284 the function selector.
3285 EXCESS_PRECISION is true when VAL was originally represented
3286 as EXCESS_PRECISION_EXPR.
3287 WARNOPT is the same as in convert_for_assignment. */
3289 static tree
3294 {
3295 /* Formal parm type is specified by a function prototype. */
3298 {
3302 }
3304 /* Optionally warn about conversions that differ from the default
3305 conversions. */
3307 {
3313 "passing argument %d of %qE as integer rather "
3319 "passing argument %d of %qE as integer rather "
3325 "passing argument %d of %qE as complex rather "
3331 "passing argument %d of %qE as floating rather "
3337 "passing argument %d of %qE as complex rather "
3343 "passing argument %d of %qE as floating rather "
3346 /* ??? At some point, messages should be written about
3347 conversions between complex types, but that's too messy
3348 to do now. */
3351 {
3352 /* Warn if any argument is passed as `float',
3353 since without a prototype it would be `double'. */
3357 "passing argument %d of %qE as %<float%> "
3361 /* Warn if mismatch between argument and prototype
3362 for decimal float types. Warn of conversions with
3363 binary float types and of precision narrowing due to
3364 prototype. */
3372 && (formal_prec
3375 && (valtype
3376 != dfloat64_type_node
3377 && (valtype
3380 && (valtype
3383 "passing argument %d of %qE as %qT "
3387 }
3388 /* Detect integer changing in width or signedness.
3389 These warnings are only activated with
3390 -Wtraditional-conversion, not with -Wtraditional. */
3394 {
3403 /* No warning if function asks for enum
3404 and the actual arg is that enum type. */
3405 ;
3408 "passing argument %d of %qE "
3412 ;
3413 /* Don't complain if the formal parameter type
3414 is an enum, because we can't tell now whether
3415 the value was an enum--even the same enum. */
3417 ;
3420 /* Change in signedness doesn't matter
3421 if a constant value is unaffected. */
3422 ;
3423 /* If the value is extended from a narrower
3424 unsigned type, it doesn't matter whether we
3425 pass it as signed or unsigned; the value
3426 certainly is the same either way. */
3429 ;
3432 "passing argument %d of %qE "
3435 else
3437 "passing argument %d of %qE "
3440 }
3441 }
3443 /* Possibly restore an EXCESS_PRECISION_EXPR for the
3444 sake of better warnings from convert_and_check. */
3459 }
3461 /* Convert the argument expressions in the vector VALUES
3462 to the types in the list TYPELIST.
3464 If TYPELIST is exhausted, or when an element has NULL as its type,
3465 perform the default conversions.
3467 ORIGTYPES is the original types of the expressions in VALUES. This
3468 holds the type of enum values which have been converted to integral
3469 types. It may be NULL.
3471 FUNCTION is a tree for the called function. It is used only for
3472 error messages, where it is formatted with %qE.
3474 This is also where warnings about wrong number of args are generated.
3476 ARG_LOC are locations of function arguments (if any).
3478 Returns the actual number of arguments processed (which may be less
3479 than the length of VALUES in some error situations), or -1 on
3480 failure. */
3482 static int
3486 {
3493 tree selector;
3495 /* Change pointer to function to the function itself for
3496 diagnostics. */
3501 /* Handle an ObjC selector specially for diagnostics. */
3504 /* For a call to a built-in function declared without a prototype,
3505 set to the built-in function's argument list. */
3508 /* For type-generic built-in functions, determine whether excess
3509 precision should be removed (classification) or not
3510 (comparison). */
3513 {
3516 {
3517 /* For a call to a built-in function declared without a prototype
3518 use the types of the parameters of the internal built-in to
3519 match those of the arguments to. */
3522 }
3524 /* For type-generic built-in functions, determine whether excess
3525 precision should be removed (classification) or not
3526 (comparison). */
3529 {
3542 /* The last argument of these type-generic builtins
3543 should not be promoted. */
3549 }
3550 }
3552 /* Scan the given expressions (VALUES) and types (TYPELIST), producing
3553 individual converted arguments. */
3561 {
3562 /* The type of the function parameter (if it was declared with one). */
3564 /* The type of the built-in function parameter (if the function
3565 is a built-in). Used to detect type incompatibilities in
3566 calls to built-ins declared without a prototype. */
3567 tree builtin_type = (builtin_typetail
3569 /* The original type of the argument being passed to the function. */
3571 /* The called function (or function selector in Objective C). */
3575 /* Set for EXCESS_PRECISION_EXPR arguments. */
3577 /* The value of the argument after conversion to the type
3578 of the function parameter it is passed to. */
3579 tree parmval;
3580 /* Some __atomic_* builtins have additional hidden argument at
3581 position 0. */
3582 location_t ploc
3588 {
3591 else
3595 }
3598 {
3600 "too many arguments to built-in function %qE "
3604 }
3607 {
3610 }
3612 /* Determine if VAL is a null pointer constant before folding it. */
3615 /* If there is excess precision and a prototype, convert once to
3616 the required type rather than converting via the semantic
3617 type. Likewise without a prototype a float value represented
3618 as long double should be converted once to double. But for
3619 type-generic classification functions excess precision must
3620 be removed here. */
3623 {
3626 }
3632 /* Some floating-point arguments must be promoted to double when
3633 no type is specified by a prototype. This applies to
3634 arguments of type float, and to architecture-specific types
3635 (ARM __fp16), but not to _FloatN or _FloatNx types. */
3644 {
3645 /* Promote this argument, unless it has a _FloatN or
3646 _FloatNx type. */
3650 {
3653 }
3654 }
3657 {
3662 }
3664 {
3667 else
3668 {
3669 /* Convert `float' to `double'. */
3672 "implicit conversion from %qT to %qT when passing "
3676 }
3677 }
3680 /* A "double" argument with excess precision being passed
3681 without a prototype or in variable arguments.
3682 The last argument of __builtin_*_overflow_p should not be
3683 promoted. */
3687 {
3690 }
3692 {
3694 }
3695 else
3696 /* Convert `short' and `char' to full-size `int'. */
3704 {
3705 /* For a call to a built-in function declared without a prototype,
3706 perform the conversions from the argument to the expected type
3707 but issue warnings rather than errors for any mismatches.
3708 Ignore the converted argument and use the PARMVAL obtained
3709 above by applying default conversions instead. */
3713 excess_precision,
3714 OPT_Wbuiltin_declaration_mismatch);
3715 }
3722 }
3727 {
3731 }
3734 {
3740 "too few arguments to built-in function %qE "
3743 }
3746 }
3747 \f
3748 /* This is the entry point used by the parser to build unary operators
3749 in the input. CODE, a tree_code, specifies the unary operator, and
3750 ARG is the operand. For unary plus, the C parser currently uses
3751 CONVERT_EXPR for code.
3753 LOC is the location to use for the tree generated.
3754 */
3756 struct c_expr
3758 {
3765 {
3767 }
3768 else
3769 {
3774 }
3776 /* We are typically called when parsing a prefix token at LOC acting on
3777 ARG. Reflect this by updating the source range of the result to
3778 start at LOC and end at the end of ARG. */
3783 }
3785 /* Returns true if TYPE is a character type, *not* including wchar_t. */
3787 bool
3789 {
3795 }
3797 /* This is the entry point used by the parser to build binary operators
3798 in the input. CODE, a tree_code, specifies the binary operator, and
3799 ARG1 and ARG2 are the operands. In addition to constructing the
3800 expression, we check for operands that were written with other binary
3801 operators in a way that is likely to confuse the user.
3803 LOCATION is the location of the binary operator. */
3805 struct c_expr
3808 {
3826 {
3831 }
3840 /* Check for cases such as x+y<<z which users are likely
3841 to misinterpret. */
3851 {
3855 {
3859 else
3861 }
3863 {
3867 else
3869 }
3872 }
3878 /* Avoid warning for !!x == y. */
3881 {
3882 /* Avoid warning for !b == y where b has _Bool type. */
3887 {
3889 do
3890 {
3897 else
3899 }
3901 }
3904 }
3906 /* Warn about comparisons against string literals, with the exception
3907 of testing for equality or inequality of a string literal with NULL. */
3909 {
3916 /* Warn for ptr == '\0', it's likely that it should've been ptr[0]. */
3920 {
3921 auto_diagnostic_group d;
3923 "comparison between pointer and zero character "
3927 }
3931 {
3932 auto_diagnostic_group d;
3934 "comparison between pointer and zero character "
3938 }
3939 }
3943 "comparison with string literal results in unspecified "
3957 /* Warn about comparisons of different enum types. */
3968 }
3969 \f
3970 /* Return a tree for the difference of pointers OP0 and OP1.
3971 The resulting tree has type ptrdiff_t. If POINTER_SUBTRACT sanitization is
3972 enabled, assign to INSTRUMENT_EXPR call to libsanitizer. */
3974 static tree
3976 {
3986 /* If the operands point into different address spaces, we need to
3987 explicitly convert them to pointers into the common address space
3988 before we can subtract the numerical address values. */
3990 {
3991 addr_space_t as_common;
3992 tree common_type;
3994 /* Determine the common superset address space. This is guaranteed
3995 to exist because the caller verified that comp_target_types
3996 returned non-zero. */
4003 }
4005 /* Determine integer type result of the subtraction. This will usually
4006 be the same as the result type (ptrdiff_t), but may need to be a wider
4007 type if pointers for the address space are wider than ptrdiff_t. */
4010 else
4022 {
4028 }
4030 /* First do the subtraction, then build the divide operator
4031 and only convert at the very end.
4032 Do not do default conversions in case restype is a short type. */
4034 /* POINTER_DIFF_EXPR requires a signed integer type of the same size as
4035 pointers. If some platform cannot provide that, or has a larger
4036 ptrdiff_type to support differences larger than half the address
4037 space, cast the pointers to some larger integer type and do the
4038 computations in that type. */
4042 else
4043 {
4044 /* Cast away qualifiers. */
4048 }
4050 /* This generates an error if op1 is pointer to incomplete type. */
4063 /* Divide by the size, in easiest possible way. */
4067 /* Convert to final result type if necessary. */
4069 }
4070 \f
4071 /* Expand atomic compound assignments into an appropriate sequence as
4072 specified by the C11 standard section 6.5.16.2.
4074 _Atomic T1 E1
4075 T2 E2
4076 E1 op= E2
4078 This sequence is used for all types for which these operations are
4079 supported.
4081 In addition, built-in versions of the 'fe' prefixed routines may
4082 need to be invoked for floating point (real, complex or vector) when
4083 floating-point exceptions are supported. See 6.5.16.2 footnote 113.
4085 T1 newval;
4086 T1 old;
4087 T1 *addr
4088 T2 val
4089 fenv_t fenv
4091 addr = &E1;
4092 val = (E2);
4093 __atomic_load (addr, &old, SEQ_CST);
4094 feholdexcept (&fenv);
4095 loop:
4096 newval = old op val;
4097 if (__atomic_compare_exchange_strong (addr, &old, &newval, SEQ_CST,
4098 SEQ_CST))
4099 goto done;
4100 feclearexcept (FE_ALL_EXCEPT);
4101 goto loop:
4102 done:
4103 feupdateenv (&fenv);
4105 The compiler will issue the __atomic_fetch_* built-in when possible,
4106 otherwise it will generate the generic form of the atomic operations.
4107 This requires temp(s) and has their address taken. The atomic processing
4108 is smart enough to figure out when the size of an object can utilize
4109 a lock-free version, and convert the built-in call to the appropriate
4110 lock-free routine. The optimizers will then dispose of any temps that
4111 are no longer required, and lock-free implementations are utilized as
4112 long as there is target support for the required size.
4114 If the operator is NOP_EXPR, then this is a simple assignment, and
4115 an __atomic_store is issued to perform the assignment rather than
4116 the above loop. */
4118 /* Build an atomic assignment at LOC, expanding into the proper
4119 sequence to store LHS MODIFYCODE= RHS. Return a value representing
4120 the result of the operation, unless RETURN_OLD_P, in which case
4121 return the old value of LHS (this is only for postincrement and
4122 postdecrement). */
4124 static tree
4127 {
4140 tree nonatomic_rhs_semantic_type;
4141 tree rhs_type;
4148 /* Allocate enough vector items for a compare_exchange. */
4151 /* Create a compound statement to hold the sequence of statements
4152 with a loop. */
4154 {
4157 /* For consistency with build_modify_expr on non-_Atomic,
4158 mark the lhs as read. Also, it would be very hard to match
4159 such expressions in mark_exp_read. */
4161 }
4163 /* Remove any excess precision (which is only present here in the
4164 case of compound assignments). */
4166 {
4169 }
4172 /* Fold the RHS if it hasn't already been folded. */
4176 /* Remove the qualifiers for the rest of the expressions and create
4177 the VAL temp variable to hold the RHS. */
4181 TYPE_UNQUALIFIED);
4186 NULL_TREE);
4192 /* NOP_EXPR indicates it's a straight store of the RHS. Simply issue
4193 an atomic_store. */
4195 {
4197 /* Build __atomic_store (&lhs, &val, SEQ_CST) */
4208 /* VAL is the value which was stored, return a COMPOUND_STMT of
4209 the statement and that value. */
4211 }
4213 /* Attempt to implement the atomic operation as an __atomic_fetch_* or
4214 __atomic_*_fetch built-in rather than a CAS loop. atomic_bool type
4215 isn't applicable for such builtins. ??? Do we want to handle enums? */
4218 {
4219 built_in_function fncode;
4221 {
4224 fncode = (return_old_p
4225 ? BUILT_IN_ATOMIC_FETCH_ADD_N
4229 fncode = (return_old_p
4230 ? BUILT_IN_ATOMIC_FETCH_SUB_N
4234 fncode = (return_old_p
4235 ? BUILT_IN_ATOMIC_FETCH_AND_N
4239 fncode = (return_old_p
4240 ? BUILT_IN_ATOMIC_FETCH_OR_N
4244 fncode = (return_old_p
4245 ? BUILT_IN_ATOMIC_FETCH_XOR_N
4250 }
4252 /* We can only use "_1" through "_16" variants of the atomic fetch
4253 built-ins. */
4258 /* If this is a pointer type, we need to multiply by the size of
4259 the pointer target type. */
4261 {
4263 /* ??? This would introduce -Wdiscarded-qualifiers
4264 warning: __atomic_fetch_* expect volatile void *
4265 type as the first argument. (Assignments between
4266 atomic and non-atomic objects are OK.) */
4273 }
4275 /* Build __atomic_fetch_* (&lhs, &val, SEQ_CST), or
4276 __atomic_*_fetch (&lhs, &val, SEQ_CST). */
4291 /* Finish the compound statement. */
4294 /* NEWVAL is the value which was stored, return a COMPOUND_STMT of
4295 the statement and that value. */
4297 }
4299 cas_loop:
4300 /* Create the variables and labels required for the op= form. */
4317 /* __atomic_load (addr, &old, SEQ_CST). */
4324 NULL_TREE);
4328 /* Create the expressions for floating-point environment
4329 manipulation, if required. */
4339 /* loop: */
4342 /* newval = old + val; */
4347 {
4351 }
4352 else
4358 {
4360 NULL_TREE);
4363 }
4365 /* if (__atomic_compare_exchange (addr, &old, &new, false, SEQ_CST, SEQ_CST))
4366 goto done; */
4386 /* goto loop; */
4391 /* done: */
4397 /* Finish the compound statement. */
4400 /* NEWVAL is the value that was successfully stored, return a
4401 COMPOUND_EXPR of the statement and the appropriate value. */
4404 }
4406 /* Construct and perhaps optimize a tree representation
4407 for a unary operation. CODE, a tree_code, specifies the operation
4408 and XARG is the operand.
4409 For any CODE other than ADDR_EXPR, NOCONVERT suppresses the default
4410 promotions (such as from short to int).
4411 For ADDR_EXPR, the default promotions are not applied; NOCONVERT allows
4412 non-lvalues; this is only used to handle conversion of non-lvalue arrays
4413 to pointers in C99.
4415 LOCATION is the location of the operator. */
4417 tree
4420 {
4421 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
4425 tree val;
4446 {
4449 }
4452 {
4455 }
4458 {
4460 /* This is used for unary plus, because a CONVERT_EXPR
4461 is enough to prevent anybody from looking inside for
4462 associativity, but won't generate any code. */
4466 {
4469 }
4479 {
4482 }
4488 /* ~ works on integer types and non float vectors. */
4492 {
4495 /* Warn if the expression has boolean value. */
4501 {
4502 auto_diagnostic_group d;
4505 {
4509 }
4510 }
4513 }
4515 {
4521 }
4522 else
4523 {
4526 }
4531 {
4534 }
4541 {
4544 }
4550 /* Conjugating a real value is a no-op, but allow it anyway. */
4553 {
4556 }
4565 {
4569 }
4571 {
4574 }
4575 else
4578 /* If the TRUTH_NOT_EXPR has been folded, reset the location. */
4598 {
4601 noconvert);
4609 }
4611 /* Complain about anything that is not a true lvalue. In
4612 Objective-C, skip this check for property_refs. */
4617 ? lv_increment
4622 {
4626 else
4629 }
4632 {
4636 else
4639 }
4641 /* Ensure the argument is fully folded inside any SAVE_EXPR. */
4647 /* Increment or decrement the real part of the value,
4648 and don't change the imaginary part. */
4650 {
4657 {
4669 }
4670 }
4672 /* Report invalid types. */
4678 {
4681 else
4685 }
4687 {
4688 tree inc;
4692 /* Compute the increment. */
4695 {
4696 /* If pointer target is an incomplete type,
4697 we just cannot know how to do the arithmetic. */
4699 {
4704 else
4708 }
4711 {
4715 else
4718 }
4719 else
4725 }
4727 {
4728 /* For signed fract types, we invert ++ to -- or
4729 -- to ++, and change inc from 1 to -1, because
4730 it is not possible to represent 1 in signed fract constants.
4731 For unsigned fract types, the result always overflows and
4732 we get an undefined (original) or the maximum value. */
4744 }
4745 else
4746 {
4751 }
4753 /* If 'arg' is an Objective-C PROPERTY_REF expression, then we
4754 need to ask Objective-C to build the increment or decrement
4755 expression for it. */
4760 /* Report a read-only lvalue. */
4762 {
4768 }
4775 /* If the argument is atomic, use the special code sequences for
4776 atomic compound assignment. */
4778 {
4783 ? PLUS_EXPR
4786 ? inc
4791 }
4795 else
4800 }
4803 /* Note that this operation never does default_conversion. */
4805 /* The operand of unary '&' must be an lvalue (which excludes
4806 expressions of type void), or, in C99, the result of a [] or
4807 unary '*' operator. */
4813 /* Let &* cancel out to simplify resulting code. */
4815 {
4816 /* Don't let this be an lvalue. */
4821 }
4823 /* Anything not already handled and not a true memory reference
4824 or a non-lvalue array is an error. */
4829 /* Move address operations inside C_MAYBE_CONST_EXPR to simplify
4830 folding later. */
4832 {
4835 noconvert);
4842 }
4844 /* Ordinary case; arg is a COMPONENT_REF or a decl. */
4847 /* If the lvalue is const or volatile, merge that into the type
4848 to which the address will point. This is only needed
4849 for function types. */
4853 {
4863 }
4866 {
4869 {
4873 }
4875 /* fall through */
4879 {
4883 {
4887 }
4892 "address of array with reverse scalar storage "
4894 }
4898 }
4908 /* ??? Cope with user tricks that amount to offsetof. Delete this
4909 when we have proper support for integer constant expressions. */
4913 {
4916 }
4925 }
4930 ret = (require_constant_value
4933 else
4935 return_build_unary_op:
4946 }
4948 /* Return nonzero if REF is an lvalue valid for this language.
4949 Lvalues can be assigned, unless their type has TYPE_READONLY.
4950 Lvalues can have their address taken, unless they have C_DECL_REGISTER. */
4952 bool
4954 {
4958 {
4973 /* MEM_REFs can appear from -fgimple parsing or folding, so allow them
4974 here as well. */
4989 }
4990 }
4991 \f
4992 /* Give a warning for storing in something that is read-only in GCC
4993 terms but not const in ISO C terms. */
4995 static void
4997 {
4999 {
5011 }
5013 }
5016 /* Return nonzero if REF is an lvalue valid for this language;
5017 otherwise, print an error message and return zero. USE says
5018 how the lvalue is being used and so selects the error message.
5019 LOCATION is the location at which any error should be reported. */
5021 static int
5023 {
5030 }
5031 \f
5032 /* Mark EXP saying that we need to be able to take the
5033 address of it; it should not be allocated in a register.
5034 Returns true if successful. ARRAY_REF_P is true if this
5035 is for ARRAY_REF construction - in that case we don't want
5036 to look through VIEW_CONVERT_EXPR from VECTOR_TYPE to ARRAY_TYPE,
5037 it is fine to use ARRAY_REFs for vector subscripts on vector
5038 register variables. */
5040 bool
5042 {
5047 {
5058 {
5062 }
5063 /* FALLTHRU */
5086 {
5088 {
5089 error
5092 }
5094 }
5096 {
5099 else
5102 }
5104 /* FALLTHRU */
5107 /* FALLTHRU */
5110 }
5111 }
5112 \f
5113 /* Convert EXPR to TYPE, warning about conversion problems with
5114 constants. SEMANTIC_TYPE is the type this conversion would use
5115 without excess precision. If SEMANTIC_TYPE is NULL, this function
5116 is equivalent to convert_and_check. This function is a wrapper that
5117 handles conversions that may be different than
5118 the usual ones because of excess precision. */
5120 static tree
5122 tree semantic_type)
5123 {
5127 /* For C11, integer conversions may have results with excess
5128 precision. */
5134 {
5135 /* For integers, we need to check the real conversion, not
5136 the conversion to the excess precision type. */
5138 }
5139 /* Result type is the excess precision type, which should be
5140 large enough, so do not check. */
5142 }
5144 /* If EXPR refers to a built-in declared without a prototype returns
5145 the actual type of the built-in and, if non-null, set *BLTIN to
5146 a pointer to the built-in. Otherwise return the type of EXPR
5147 and clear *BLTIN if non-null. */
5149 static tree
5151 {
5152 tree dummy;
5176 }
5178 /* Build and return a conditional expression IFEXP ? OP1 : OP2. If
5179 IFEXP_BCP then the condition is a call to __builtin_constant_p, and
5180 if folded to an integer constant then the unselected half may
5181 contain arbitrary operations not normally permitted in constant
5182 expressions. Set the location of the expression to LOC. */
5184 tree
5188 {
5189 tree type1;
5190 tree type2;
5198 tree ret;
5210 /* Promote both alternatives. */
5235 /* C90 does not permit non-lvalue arrays in conditional expressions.
5236 In C99 they will be pointers by now. */
5238 {
5241 }
5249 {
5252 {
5256 }
5258 {
5262 }
5263 }
5266 {
5277 }
5279 /* Quickly detect the usual case where op1 and op2 have the same type
5280 after promotion. */
5282 {
5285 else
5287 }
5292 {
5293 /* In C11, a conditional expression between a floating-point
5294 type and an integer type should convert the integer type to
5295 the evaluation format of the floating-point type, with
5296 possible excess precision. */
5300 {
5301 tree eptype;
5304 {
5308 }
5311 {
5315 }
5316 }
5321 "implicit conversion from %qT to %qT to "
5323 colon_loc);
5325 /* If -Wsign-compare, warn here if type1 and type2 have
5326 different signedness. We'll promote the signed to unsigned
5327 and later code won't know it used to be different.
5328 Do this check on the original types, so that explicit casts
5329 will be considered, but default promotions won't. */
5331 {
5336 {
5339 /* Do not warn if the result type is signed, since the
5340 signed type will only be chosen if it can represent
5341 all the values of the unsigned type. */
5344 else
5345 {
5349 /* Do not warn if the signed quantity is an
5350 unsuffixed integer literal (or some static
5351 constant expression involving such literals) and
5352 it is non-negative. This warning requires the
5353 operands to be folded for best results, so do
5354 that folding in this case even without
5355 warn_sign_compare to avoid warning options
5356 possibly affecting code generation. */
5357 c_inhibit_evaluation_warnings
5361 c_inhibit_evaluation_warnings
5364 c_inhibit_evaluation_warnings
5368 c_inhibit_evaluation_warnings
5372 {
5375 || (unsigned_op1
5380 "operand of %<?:%> changes signedness from "
5381 "%qT to %qT due to unsignedness of other "
5384 else
5386 "operand of %<?:%> changes signedness from "
5387 "%qT to %qT due to unsignedness of other "
5390 }
5395 }
5396 }
5397 }
5398 }
5400 {
5405 }
5407 {
5410 addr_space_t as_common;
5419 {
5423 }
5428 {
5433 {
5434 /* roles are swapped */
5437 }
5441 {
5444 "pointer to array loses qualifier "
5448 "pointer to array loses qualifier "
5450 }
5453 "ISO C forbids conditional expr between "
5455 /* for array, use qualifiers of element type */
5459 }
5460 /* Objective-C pointer comparisons are a bit more lenient. */
5463 else
5464 {
5468 "pointer type mismatch between %qT and %qT "
5471 else
5474 result_type = build_pointer_type
5476 }
5477 }
5479 {
5483 else
5484 {
5486 }
5488 }
5490 {
5494 else
5495 {
5497 }
5499 }
5502 {
5505 else
5506 {
5509 }
5510 }
5512 /* Merge const and volatile flags of the incoming types. */
5513 result_type
5519 semantic_result_type);
5521 semantic_result_type);
5524 {
5527 }
5529 {
5532 }
5534 && op1_int_operands
5537 {
5544 }
5546 /* Need to convert condition operand into a vector mask. */
5548 {
5555 }
5559 else
5560 {
5562 {
5563 /* Use c_fully_fold here, since C_MAYBE_CONST_EXPR might be
5564 nested inside of the expression. */
5567 }
5571 }
5577 /* If the OP1 and OP2 are the same and don't have side-effects,
5578 warn here, because the COND_EXPR will be turned into OP1. */
5586 }
5587 \f
5588 /* EXPR is an expression, location LOC, whose result is discarded.
5589 Warn if it is a call to a nodiscard function (or a COMPOUND_EXPR
5590 whose right-hand operand is such a call, possibly recursively). */
5592 static void
5594 {
5598 {
5602 }
5608 tree attr;
5613 {
5618 auto_diagnostic_group d;
5622 "ignoring return value of %qD, declared with "
5624 else
5626 "ignoring return value of %qD, declared with "
5630 }
5631 else
5632 {
5640 auto_diagnostic_group d;
5644 "ignoring return value of type %qT, declared "
5647 else
5649 "ignoring return value of type %qT, declared "
5652 {
5654 {
5659 }
5660 }
5661 }
5662 }
5664 /* Return a compound expression that performs two expressions and
5665 returns the value of the second of them.
5667 LOC is the location of the COMPOUND_EXPR. */
5669 tree
5671 {
5674 tree ret;
5686 {
5689 }
5692 {
5693 /* The left-hand operand of a comma expression is like an expression
5694 statement: with -Wunused, we should warn if it doesn't have
5695 any side-effects, unless it was explicitly cast to (void). */
5697 {
5705 else
5708 }
5709 }
5712 {
5716 {
5720 }
5726 }
5728 /* With -Wunused, we should also warn if the left-hand operand does have
5729 side-effects, but computes a value which is not used. For example, in
5730 `foo() + bar(), baz()' the result of the `+' operator is not used,
5731 so we should issue a warning. */
5743 && expr1_int_operands
5752 }
5754 /* Issue -Wcast-qual warnings when appropriate. TYPE is the type to
5755 which we are casting. OTYPE is the type of the expression being
5756 cast. Both TYPE and OTYPE are pointer types. LOC is the location
5757 of the cast. -Wcast-qual appeared on the command line. Named
5758 address space qualifiers are not handled here, because they result
5759 in different warnings. */
5761 static void
5763 {
5770 /* Check that the qualifiers on IN_TYPE are a superset of the
5771 qualifiers of IN_OTYPE. The outermost level of POINTER_TYPE
5772 nodes is uninteresting and we stop as soon as we hit a
5773 non-POINTER_TYPE node on either type. */
5774 do
5775 {
5779 /* GNU C allows cv-qualified function types. 'const' means the
5780 function is very pure, 'volatile' means it can't return. We
5781 need to warn when such qualifiers are added, not when they're
5782 taken away. */
5787 else
5790 }
5799 /* There are qualifiers present in IN_OTYPE that are not present
5800 in IN_TYPE. */
5803 discarded);
5808 /* A cast from **T to const **T is unsafe, because it can cause a
5809 const value to be changed with no additional warning. We only
5810 issue this warning if T is the same on both sides, and we only
5811 issue the warning if there are the same number of pointers on
5812 both sides, as otherwise the cast is clearly unsafe anyhow. A
5813 cast is unsafe when a qualifier is added at one level and const
5814 is not present at all outer levels.
5816 To issue this warning, we check at each level whether the cast
5817 adds new qualifiers not already seen. We don't need to special
5818 case function types, as they won't have the same
5819 TYPE_MAIN_VARIANT. */
5829 do
5830 {
5835 {
5837 "to be safe all intermediate pointers in cast from "
5841 }
5844 }
5846 }
5848 /* Heuristic check if two parameter types can be considered ABI-equivalent. */
5850 static bool
5852 {
5860 /* The signedness of the parameter matters only when an integral
5861 type smaller than int is promoted to int, otherwise only the
5862 precision of the parameter matters.
5863 This check should make sure that the callee does not see
5864 undefined values in argument registers. */
5874 }
5876 /* Check if a type cast between two function types can be considered safe. */
5878 static bool
5880 {
5899 }
5901 /* Build an expression representing a cast to type TYPE of expression EXPR.
5902 LOC is the location of the cast-- typically the open paren of the cast. */
5904 tree
5906 {
5907 tree value;
5921 /* The ObjC front-end uses TYPE_MAIN_VARIANT to tie together types differing
5922 only in <protocol> qualifications. But when constructing cast expressions,
5923 the protocols do matter and must be kept around. */
5930 {
5933 }
5936 {
5939 }
5942 {
5946 }
5949 {
5954 /* Convert to remove any qualifiers from VALUE's type. */
5956 }
5958 {
5959 tree field;
5968 {
5969 tree t;
5981 }
5984 }
5985 else
5986 {
5990 {
5994 }
5998 /* Optionally warn about potentially worrisome casts. */
6004 /* Warn about conversions between pointers to disjoint
6005 address spaces. */
6009 {
6012 addr_space_t as_common;
6015 {
6026 else
6031 }
6032 }
6034 /* Warn about possible alignment problems. */
6040 /* Don't warn about opaque types, where the actual alignment
6041 restriction is unknown. */
6052 /* Unlike conversion of integers to pointers, where the
6053 warning is disabled for converting constants because
6054 of cases such as SIG_*, warn about converting constant
6055 pointers to integers. In some cases it may cause unwanted
6056 sign extension, and a warning is appropriate. */
6063 "cast from function call of type %qT "
6069 /* Don't warn about converting any constant. */
6078 /* If pedantic, warn for conversions between function and object
6079 pointer types, except for converting a null pointer constant
6080 to function pointer type. */
6105 "cast between incompatible function types"
6111 /* Ignore any integer overflow caused by the cast. */
6113 {
6115 {
6117 {
6118 /* Avoid clobbering a shared constant. */
6121 }
6122 }
6124 /* Reset VALUE's overflow flags, ensuring constant sharing. */
6126 }
6127 }
6129 /* Don't let a cast be an lvalue. */
6133 /* Don't allow the results of casting to floating-point or complex
6134 types be confused with actual constants, or casts involving
6135 integer and pointer types other than direct integer-to-integer
6136 and integer-to-pointer be confused with integer constant
6137 expressions and null pointer constants. */
6147 /* If the expression has integer operands and so can occur in an
6148 unevaluated part of an integer constant expression, ensure the
6149 return value reflects this. */
6158 }
6160 /* Interpret a cast of expression EXPR to type TYPE. LOC is the
6161 location of the open paren of the cast, or the position of the cast
6162 expr. */
6163 tree
6165 {
6166 tree type;
6169 tree ret;
6172 /* This avoids warnings about unprototyped casts on
6173 integers. E.g. "#define SIG_DFL (void(*)())0". */
6185 {
6192 }
6197 /* C++ does not permits types to be defined in a cast, but it
6198 allows references to incomplete types. */
6204 }
6205 \f
6206 /* Build an assignment expression of lvalue LHS from value RHS.
6207 If LHS_ORIGTYPE is not NULL, it is the original type of LHS, which
6208 may differ from TREE_TYPE (LHS) for an enum bitfield.
6209 MODIFYCODE is the code for a binary operator that we use
6210 to combine the old value of LHS with RHS to get the new value.
6211 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
6212 If RHS_ORIGTYPE is not NULL_TREE, it is the original type of RHS,
6213 which may differ from TREE_TYPE (RHS) for an enum value.
6215 LOCATION is the location of the MODIFYCODE operator.
6216 RHS_LOC is the location of the RHS. */
6218 tree
6222 {
6223 tree result;
6224 tree newrhs;
6231 /* Types that aren't fully specified cannot be used in assignments. */
6234 /* Avoid duplicate error messages from operands that had errors. */
6238 /* Ensure an error for assigning a non-lvalue array to an array in
6239 C90. */
6241 {
6244 }
6246 /* For ObjC properties, defer this check. */
6255 {
6258 rhs_origtype);
6267 }
6269 /* If a binary op has been requested, combine the old LHS value with the RHS
6270 producing the value we should actually store into the LHS. */
6273 {
6277 /* Construct the RHS for any non-atomic compound assignemnt. */
6279 {
6280 /* If in LHS op= RHS the RHS has side-effects, ensure they
6281 are preevaluated before the rest of the assignment expression's
6282 side-effects, because RHS could contain e.g. function calls
6283 that modify LHS. */
6285 {
6288 else
6293 newrhs);
6294 }
6298 /* The original type of the right hand side is no longer
6299 meaningful. */
6301 }
6302 }
6305 {
6306 /* Check if we are modifying an Objective-C property reference;
6307 if so, we need to generate setter calls. */
6310 else
6315 /* Else, do the check that we postponed for Objective-C. */
6318 }
6320 /* Give an error for storing in something that is 'const'. */
6325 {
6328 }
6332 /* If storing into a structure or union member,
6333 it has probably been given type `int'.
6334 Compute the type that would go with
6335 the actual amount of storage the member occupies. */
6344 /* If storing in a field that is in actuality a short or narrower than one,
6345 we must store in the field in its actual type. */
6348 {
6351 }
6353 /* Issue -Wc++-compat warnings about an assignment to an enum type
6354 when LHS does not have its original type. This happens for,
6355 e.g., an enum bitfield in a struct. */
6360 {
6362 ? rhs_origtype
6369 }
6371 /* Remove qualifiers. */
6375 /* Convert new value to destination type. Fold it first, then
6376 restore any excess precision information, for the sake of
6377 conversion warnings. */
6380 {
6383 {
6385 {
6388 }
6393 }
6394 else
6401 }
6403 /* Emit ObjC write barrier, if necessary. */
6405 {
6408 {
6411 }
6412 }
6414 /* Scan operands. */
6418 else
6419 {
6423 }
6425 /* If we got the LHS in a different type for storing in,
6426 convert the result back to the nominal type of LHS
6427 so that the value we return always has the same type
6428 as the LHS argument. */
6438 return_result:
6442 }
6443 \f
6444 /* Return whether STRUCT_TYPE has an anonymous field with type TYPE.
6445 This is used to implement -fplan9-extensions. */
6447 static bool
6449 {
6450 tree field;
6458 {
6461 TYPE_QUAL_ATOMIC)
6465 {
6469 }
6473 {
6477 }
6478 }
6480 }
6482 /* RHS is an expression whose type is pointer to struct. If there is
6483 an anonymous field in RHS with type TYPE, then return a pointer to
6484 that field in RHS. This is used with -fplan9-extensions. This
6485 returns NULL if no conversion could be found. */
6487 static tree
6489 {
6493 tree ret;
6502 TYPE_QUAL_ATOMIC)
6510 {
6516 TYPE_QUAL_ATOMIC)
6519 {
6523 }
6525 lhs_main_type))
6526 {
6531 }
6532 }
6539 NULL_TREE);
6543 {
6546 }
6549 }
6551 /* Issue an error message for a bad initializer component.
6552 GMSGID identifies the message.
6553 The component name is taken from the spelling stack. */
6557 {
6560 auto_diagnostic_group d;
6562 /* The gmsgid may be a format string with %< and %>. */
6571 }
6573 /* Issue a pedantic warning for a bad initializer component. OPT is
6574 the option OPT_* (from options.h) controlling this warning or 0 if
6575 it is unconditionally given. GMSGID identifies the message. The
6576 component name is taken from the spelling stack. */
6580 {
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. */
6585 auto_diagnostic_group d;
6593 }
6595 /* Issue a warning for a bad initializer component.
6597 OPT is the OPT_W* value corresponding to the warning option that
6598 controls this warning. GMSGID identifies the message. The
6599 component name is taken from the spelling stack. */
6601 static void
6603 {
6607 auto_diagnostic_group d;
6609 /* Use the location where a macro was expanded rather than where
6610 it was defined to make sure macros defined in system headers
6611 but used incorrectly elsewhere are diagnosed. */
6614 /* The gmsgid may be a format string with %< and %>. */
6619 }
6620 \f
6621 /* If TYPE is an array type and EXPR is a parenthesized string
6622 constant, warn if pedantic that EXPR is being used to initialize an
6623 object of type TYPE. */
6625 void
6627 {
6634 }
6636 /* Attempt to locate the parameter with the given index within FNDECL,
6637 returning DECL_SOURCE_LOCATION (FNDECL) if it can't be found. */
6639 static location_t
6641 {
6643 tree param;
6645 /* Locate param by index within DECL_ARGUMENTS (fndecl). */
6649 ;
6651 /* If something went wrong (e.g. if we have a builtin and thus no arguments),
6652 return DECL_SOURCE_LOCATION (FNDECL). */
6657 }
6659 /* Issue a note about a mismatching argument for parameter PARMNUM
6660 to FUNDECL, for types EXPECTED_TYPE and ACTUAL_TYPE.
6661 Attempt to issue the note at the pertinent parameter of the decl;
6662 failing that issue it at the location of FUNDECL; failing that
6663 issue it at PLOC. */
6665 static void
6668 {
6669 location_t loc;
6672 else
6678 }
6680 /* Issue a warning when an argument of ARGTYPE is passed to a built-in
6681 function FUNDECL declared without prototype to parameter PARMNUM of
6682 PARMTYPE when ARGTYPE does not promote to PARMTYPE. */
6684 static void
6687 {
6692 /* Avoid warning for enum arguments that promote to an integer type
6693 of the same size/mode. */
6705 /* This diagnoses even signed/unsigned mismatches. Those might be
6706 safe in many cases but GCC may emit suboptimal code for them so
6707 warning on those cases drives efficiency improvements. */
6711 "in a call to built-in function declared without "
6714 "in a call to built-in function declared without "
6719 fundecl);
6720 }
6722 /* Convert value RHS to type TYPE as preparation for an assignment to
6723 an lvalue of type TYPE. If ORIGTYPE is not NULL_TREE, it is the
6724 original type of RHS; this differs from TREE_TYPE (RHS) for enum
6725 types. NULL_POINTER_CONSTANT says whether RHS was a null pointer
6726 constant before any folding.
6727 The real work of conversion is done by `convert'.
6728 The purpose of this function is to generate error messages
6729 for assignments that are not allowed in C.
6730 ERRTYPE says whether it is argument passing, assignment,
6731 initialization or return.
6733 In the following example, '~' denotes where EXPR_LOC and '^' where
6734 LOCATION point to:
6736 f (var); [ic_argpass]
6737 ^ ~~~
6738 x = var; [ic_assign]
6739 ^ ~~~;
6740 int x = var; [ic_init]
6741 ^^^
6742 return x; [ic_return]
6743 ^
6745 FUNCTION is a tree for the function being called.
6746 PARMNUM is the number of the argument, for printing in error messages.
6747 WARNOPT may be set to a warning option to issue the corresponding warning
6748 rather than an error for invalid conversions. Used for calls to built-in
6749 functions declared without a prototype. */
6751 static tree
6756 {
6759 tree rhstype;
6764 /* Use the expansion point location to handle cases such as user's
6765 function returning a wrong-type macro defined in a system header. */
6769 {
6770 tree selector;
6771 /* Change pointer to function to the function itself for
6772 diagnostics. */
6777 /* Handle an ObjC selector specially for diagnostics. */
6781 {
6784 }
6785 }
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. */
6790 #define PEDWARN_FOR_ASSIGNMENT(LOCATION, PLOC, OPT, AR, AS, IN, RE) \
6791 do { \
6792 switch (errtype) \
6793 { \
6794 case ic_argpass: \
6795 { \
6796 auto_diagnostic_group d; \
6797 if (pedwarn (PLOC, OPT, AR, parmnum, rname)) \
6798 inform_for_arg (fundecl, (PLOC), parmnum, type, rhstype); \
6799 } \
6800 break; \
6801 case ic_assign: \
6802 pedwarn (LOCATION, OPT, AS); \
6803 break; \
6804 case ic_init: \
6805 pedwarn_init (LOCATION, OPT, IN); \
6806 break; \
6807 case ic_return: \
6808 pedwarn (LOCATION, OPT, RE); \
6809 break; \
6810 default: \
6811 gcc_unreachable (); \
6812 } \
6813 } while (0)
6815 /* This macro is used to emit diagnostics to ensure that all format
6816 strings are complete sentences, visible to gettext and checked at
6817 compile time. It can be called with 'pedwarn' or 'warning_at'. */
6818 #define WARNING_FOR_QUALIFIERS(PEDWARN, LOCATION, PLOC, OPT, AR, AS, IN, RE, QUALS) \
6819 do { \
6820 switch (errtype) \
6821 { \
6822 case ic_argpass: \
6823 { \
6824 auto_diagnostic_group d; \
6825 if (PEDWARN) { \
6826 if (pedwarn (PLOC, OPT, AR, parmnum, rname, QUALS)) \
6827 inform_for_arg (fundecl, (PLOC), parmnum, type, rhstype); \
6828 } else { \
6829 if (warning_at (PLOC, OPT, AR, parmnum, rname, QUALS)) \
6830 inform_for_arg (fundecl, (PLOC), parmnum, type, rhstype); \
6831 } \
6832 } \
6833 break; \
6834 case ic_assign: \
6835 if (PEDWARN) \
6836 pedwarn (LOCATION, OPT, AS, QUALS); \
6837 else \
6838 warning_at (LOCATION, OPT, AS, QUALS); \
6839 break; \
6840 case ic_init: \
6841 if (PEDWARN) \
6842 pedwarn (LOCATION, OPT, IN, QUALS); \
6843 else \
6844 warning_at (LOCATION, OPT, IN, QUALS); \
6845 break; \
6846 case ic_return: \
6847 if (PEDWARN) \
6848 pedwarn (LOCATION, OPT, RE, QUALS); \
6849 else \
6850 warning_at (LOCATION, OPT, RE, QUALS); \
6851 break; \
6852 default: \
6853 gcc_unreachable (); \
6854 } \
6855 } while (0)
6857 /* This macro is used to emit diagnostics to ensure that all format
6858 strings are complete sentences, visible to gettext and checked at
6859 compile time. It is the same as PEDWARN_FOR_ASSIGNMENT but with an
6860 extra parameter to enumerate qualifiers. */
6861 #define PEDWARN_FOR_QUALIFIERS(LOCATION, PLOC, OPT, AR, AS, IN, RE, QUALS) \
6862 WARNING_FOR_QUALIFIERS (true, LOCATION, PLOC, OPT, AR, AS, IN, RE, QUALS)
6875 {
6879 {
6895 }
6898 }
6901 {
6907 {
6932 }
6933 }
6936 {
6942 {
6947 }
6948 }
6951 {
6954 }
6957 {
6958 /* Except for passing an argument to an unprototyped function,
6959 this is a constraint violation. When passing an argument to
6960 an unprototyped function, it is compile-time undefined;
6961 making it a constraint in that case was rejected in
6962 DR#252. */
6966 else
6969 }
6977 /* A non-reference type can convert to a reference. This handles
6978 va_start, va_copy and possibly port built-ins. */
6980 {
6982 {
6986 else
6989 }
7006 }
7007 /* Some types can interconvert without explicit casts. */
7011 /* Arithmetic types all interconvert, and enum is treated like int. */
7020 {
7023 rhstype);
7035 }
7037 /* Aggregates in different TUs might need conversion. */
7044 /* Conversion to a transparent union or record from its member types.
7045 This applies only to function arguments. */
7049 {
7053 {
7064 {
7068 /* Any non-function converts to a [const][volatile] void *
7069 and vice versa; otherwise, targets must be the same.
7070 Meanwhile, the lhs target must have all the qualifiers of
7071 the rhs. */
7075 {
7078 /* If this type won't generate any warnings, use it. */
7086 /* Keep looking for a better type, but remember this one. */
7089 }
7090 }
7092 /* Can convert integer zero to any pointer type. */
7094 {
7097 }
7098 }
7101 {
7103 {
7104 /* We have only a marginally acceptable member type;
7105 it needs a warning. */
7109 /* Const and volatile mean something different for function
7110 types, so the usual warnings are not appropriate. */
7113 {
7114 /* Because const and volatile on functions are
7115 restrictions that say the function will not do
7116 certain things, it is okay to use a const or volatile
7117 function where an ordinary one is wanted, but not
7118 vice-versa. */
7122 OPT_Wdiscarded_qualifiers,
7124 "makes %q#v qualified function "
7127 "function pointer from "
7130 "function pointer from "
7135 }
7139 OPT_Wdiscarded_qualifiers,
7151 }
7159 }
7160 }
7162 /* Conversions among pointers */
7165 {
7166 /* If RHS refers to a built-in declared without a prototype
7167 BLTIN is the declaration of the built-in with a prototype
7168 and RHSTYPE is set to the actual type of the built-in. */
7169 tree bltin;
7178 addr_space_t asl;
7179 addr_space_t asr;
7184 TYPE_QUAL_ATOMIC)
7189 TYPE_QUAL_ATOMIC)
7191 /* Opaque pointers are treated like void pointers. */
7194 /* The Plan 9 compiler permits a pointer to a struct to be
7195 automatically converted into a pointer to an anonymous field
7196 within the struct. */
7201 {
7204 {
7210 }
7211 }
7213 /* C++ does not allow the implicit conversion void* -> T*. However,
7214 for the purpose of reducing the number of false positives, we
7215 tolerate the special case of
7217 int *p = NULL;
7219 where NULL is typically defined in C to be '(void *) 0'. */
7222 OPT_Wc___compat,
7223 "request for implicit conversion "
7226 /* See if the pointers point to incompatible address spaces. */
7231 {
7233 {
7235 {
7240 else
7243 }
7245 {
7250 else
7253 }
7255 {
7260 else
7263 }
7265 {
7270 else
7273 }
7276 }
7278 }
7280 /* Check if the right-hand side has a format attribute but the
7281 left-hand side doesn't. */
7284 {
7286 {
7289 "argument %d of %qE might be "
7295 "assignment left-hand side might be "
7300 "initialization left-hand side might be "
7305 "return type might be "
7310 }
7311 }
7313 /* See if the pointers point to incompatible scalar storage orders. */
7317 {
7318 tree t;
7321 {
7323 /* Do not warn for built-in functions, for example memcpy, since we
7324 control how they behave and they can be useful in this area. */
7328 "passing argument %d of %qE from incompatible "
7332 /* Do not warn if the RHS is a call to a function that returns a
7333 pointer that is not an alias. */
7338 "assignment to %qT from pointer type %qT with "
7342 /* Likewise. */
7347 "initialization of %qT from pointer type %qT with "
7352 "returning %qT from pointer type with incompatible "
7357 }
7358 }
7360 /* Any non-function converts to a [const][volatile] void *
7361 and vice versa; otherwise, targets must be the same.
7362 Meanwhile, the lhs target must have all the qualifiers of the rhs. */
7366 || is_opaque_pointer
7372 {
7373 /* Warn about loss of qualifers from pointers to arrays with
7374 qualifiers on the element type. */
7376 {
7384 OPT_Wdiscarded_array_qualifiers,
7394 }
7397 ||
7399 && !null_pointer_constant
7403 "%qE between function pointer "
7411 /* Const and volatile mean something different for function types,
7412 so the usual warnings are not appropriate. */
7415 {
7416 /* Assignments between atomic and non-atomic objects are OK. */
7422 /* Don't warn about loss of qualifier for conversions from
7423 qualified void* to pointers to arrays with corresponding
7424 qualifier on the element type (except for pedantic before C23). */
7427 OPT_Wdiscarded_qualifiers,
7441 /* If this is not a case of ignoring a mismatch in signedness,
7442 no warning. */
7445 ;
7446 /* If there is a mismatch, do warn. */
7449 {
7451 {
7452 auto_diagnostic_group d;
7456 "pointer targets in passing argument %d of "
7459 rhstype);
7460 }
7464 "pointer targets in assignment from %qT to %qT "
7469 "pointer targets in initialization of %qT "
7471 rhstype);
7475 "returning %qT from a function with return type "
7480 }
7481 }
7484 {
7485 /* Because const and volatile on functions are restrictions
7486 that say the function will not do certain things,
7487 it is okay to use a const or volatile function
7488 where an ordinary one is wanted, but not vice-versa. */
7492 OPT_Wdiscarded_qualifiers,
7494 "%q#v qualified function pointer "
7503 }
7504 }
7505 /* Avoid warning about the volatile ObjC EH puts on decls. */
7507 {
7509 {
7511 {
7512 auto_diagnostic_group d;
7516 "passing argument %d of %qE from incompatible "
7519 }
7524 "assignment to %qT from pointer to "
7527 else
7535 "initialization of %qT from pointer to "
7538 else
7540 "initialization of %qT from incompatible "
7547 "returning pointer to %qD of type %qT from "
7550 else
7552 "returning %qT from a function with incompatible "
7557 }
7558 }
7560 /* If RHS isn't an address, check pointer or array of packed
7561 struct or union. */
7565 }
7567 {
7568 /* ??? This should not be an error when inlining calls to
7569 unprototyped functions. */
7573 else
7576 }
7578 {
7579 /* An explicit constant 0 can convert to a pointer,
7580 or one that results from arithmetic, even including
7581 a cast to integer type. */
7584 {
7586 {
7587 auto_diagnostic_group d;
7591 "passing argument %d of %qE makes pointer from "
7594 }
7598 "assignment to %qT from %qT makes pointer from integer "
7603 "initialization of %qT from %qT makes pointer from "
7608 "function with return type %qT makes pointer from "
7613 }
7616 }
7618 {
7620 {
7622 {
7623 auto_diagnostic_group d;
7627 "passing argument %d of %qE makes integer from "
7630 }
7634 "assignment to %qT from %qT makes integer from pointer "
7639 "initialization of %qT from %qT makes integer from "
7644 "function with return type %qT makes integer from "
7649 }
7652 }
7654 {
7655 tree ret;
7661 }
7664 {
7666 {
7667 auto_diagnostic_group d;
7673 else
7676 }
7679 {
7684 else
7687 }
7689 {
7694 else
7697 }
7699 {
7704 else
7707 }
7710 }
7713 }
7714 \f
7715 /* If VALUE is a compound expr all of whose expressions are constant, then
7716 return its value. Otherwise, return error_mark_node.
7718 This is for handling COMPOUND_EXPRs as initializer elements
7719 which is allowed with a warning when -pedantic is specified. */
7721 static tree
7723 {
7725 {
7730 endtype);
7731 }
7734 else
7736 }
7737 \f
7738 /* Perform appropriate conversions on the initial value of a variable,
7739 store it in the declaration DECL,
7740 and print any error messages that are appropriate.
7741 If ORIGTYPE is not NULL_TREE, it is the original type of INIT.
7742 If the init is invalid, store an ERROR_MARK.
7744 INIT_LOC is the location of the initial value. */
7746 void
7748 {
7752 /* If variable's type was invalidly declared, just ignore it. */
7758 /* Digest the specified initializer into an expression. */
7765 /* Store the expression if valid; else report error. */
7775 /* ANSI wants warnings about out-of-range constant initializers. */
7780 /* Check if we need to set array size from compound literal size. */
7784 {
7791 {
7795 {
7796 /* For int foo[] = (int [3]){1}; we need to set array size
7797 now since later on array initializer will be just the
7798 brace enclosed list of the compound literal. */
7806 }
7807 }
7808 }
7809 }
7810 \f
7811 /* Methods for storing and printing names for error messages. */
7813 /* Implement a spelling stack that allows components of a name to be pushed
7814 and popped. Each element on the stack is this structure. */
7816 struct spelling
7817 {
7819 union
7820 {
7824 };
7826 #define SPELLING_STRING 1
7827 #define SPELLING_MEMBER 2
7828 #define SPELLING_BOUNDS 3
7834 /* Macros to save and restore the spelling stack around push_... functions.
7835 Alternative to SAVE_SPELLING_STACK. */
7837 #define SPELLING_DEPTH() (spelling - spelling_base)
7838 #define RESTORE_SPELLING_DEPTH(DEPTH) (spelling = spelling_base + (DEPTH))
7840 /* Push an element on the spelling stack with type KIND and assign VALUE
7841 to MEMBER. */
7843 #define PUSH_SPELLING(KIND, VALUE, MEMBER) \
7844 { \
7845 int depth = SPELLING_DEPTH (); \
7846 \
7847 if (depth >= spelling_size) \
7848 { \
7849 spelling_size += 10; \
7850 spelling_base = XRESIZEVEC (struct spelling, spelling_base, \
7851 spelling_size); \
7852 RESTORE_SPELLING_DEPTH (depth); \
7853 } \
7854 \
7855 spelling->kind = (KIND); \
7856 spelling->MEMBER = (VALUE); \
7857 spelling++; \
7858 }
7860 /* Push STRING on the stack. Printed literally. */
7862 static void
7864 {
7866 }
7868 /* Push a member name on the stack. Printed as '.' STRING. */
7870 static void
7872 {
7878 }
7880 /* Push an array bounds on the stack. Printed as [BOUNDS]. */
7882 static void
7884 {
7886 }
7888 /* Compute the maximum size in bytes of the printed spelling. */
7890 static int
7892 {
7897 {
7900 else
7902 }
7905 }
7907 /* Print the spelling to BUFFER and return it. */
7911 {
7917 {
7920 }
7921 else
7922 {
7927 ;
7928 }
7931 }
7933 /* Digest the parser output INIT as an initializer for type TYPE.
7934 Return a C expression of type TYPE to represent the initial value.
7936 If ORIGTYPE is not NULL_TREE, it is the original type of INIT.
7938 NULL_POINTER_CONSTANT is true if INIT is a null pointer constant.
7940 If INIT is a string constant, STRICT_STRING is true if it is
7941 unparenthesized or we should not warn here for it being parenthesized.
7942 For other types of INIT, STRICT_STRING is not used.
7944 INIT_LOC is the location of the INIT.
7946 REQUIRE_CONSTANT requests an error if non-constant initializers or
7947 elements are seen. */
7949 static tree
7953 {
7960 || !init
7967 {
7969 {
7972 }
7974 }
7976 /* Initialization of an array of chars from a string constant
7977 optionally enclosed in braces. */
7981 {
7982 tree typ1
7985 TYPE_QUAL_ATOMIC)
7987 /* Note that an array could be both an array of character type
7988 and an array of wchar_t if wchar_t is signed char or unsigned
7989 char. */
7998 {
8016 {
8019 }
8024 {
8029 }
8034 {
8038 /* Subtract the size of a single (possibly wide) character
8039 because it's ok to ignore the terminating null char
8040 that is counted in the length of the constant. */
8051 {
8052 unsigned HOST_WIDE_INT size
8057 }
8058 }
8062 }
8064 {
8068 }
8069 }
8071 /* Build a VECTOR_CST from a *constant* vector constructor. If the
8072 vector constructor is not constant (e.g. {1,2,3,foo()}) then punt
8073 below and handle as a constructor. */
8078 {
8085 {
8087 tree value;
8090 /* Iterate through elements and check if all constructor
8091 elements are *_CSTs. */
8094 {
8097 }
8102 }
8103 }
8108 /* Any type can be initialized
8109 from an expression of the same type, optionally with braces. */
8122 {
8124 {
8126 {
8129 inside_init = array_to_pointer_conversion
8131 else
8132 {
8135 }
8136 }
8137 }
8140 /* Although the types are compatible, we may require a
8141 conversion. */
8146 {
8147 /* As an extension, allow initializing objects with static storage
8148 duration with compound literals (which are then treated just as
8149 the brace enclosed list they contain). Also allow this for
8150 vectors, as we can only assign them with compound literals. */
8156 }
8160 {
8164 }
8166 /* Compound expressions can only occur here if -Wpedantic or
8167 -pedantic-errors is specified. In the later case, we always want
8168 an error. In the former case, we simply want a warning. */
8171 {
8172 inside_init
8177 else
8182 }
8186 {
8189 }
8194 /* Added to enable additional -Wsuggest-attribute=format warnings. */
8201 }
8203 /* Handle scalar types, including conversions. */
8208 {
8215 inside_init);
8216 inside_init
8222 /* Check to see if we have already given an error message. */
8224 ;
8226 {
8229 }
8233 {
8237 }
8243 }
8245 /* Come here only for records and arrays. */
8248 {
8251 }
8255 }
8256 \f
8257 /* Handle initializers that use braces. */
8259 /* Type of object we are accumulating a constructor for.
8260 This type is always a RECORD_TYPE, UNION_TYPE or ARRAY_TYPE. */
8263 /* For a RECORD_TYPE or UNION_TYPE, this is the chain of fields
8264 left to fill. */
8267 /* For an ARRAY_TYPE, this is the specified index
8268 at which to store the next element we get. */
8271 /* For an ARRAY_TYPE, this is the maximum index. */
8274 /* For a RECORD_TYPE, this is the first field not yet written out. */
8277 /* For an ARRAY_TYPE, this is the index of the first element
8278 not yet written out. */
8281 /* In a RECORD_TYPE, the byte index of the next consecutive field.
8282 This is so we can generate gaps between fields, when appropriate. */
8285 /* If we are saving up the elements rather than allocating them,
8286 this is the list of elements so far (in reverse order,
8287 most recent first). */
8290 /* 1 if constructor should be incrementally stored into a constructor chain,
8291 0 if all the elements should be kept in AVL tree. */
8294 /* 1 if so far this constructor's elements are all compile-time constants. */
8297 /* 1 if so far this constructor's elements are all valid address constants. */
8300 /* 1 if this constructor has an element that cannot be part of a
8301 constant expression. */
8304 /* 1 if this constructor is erroneous so far. */
8307 /* 1 if this constructor is the universal zero initializer { 0 }. */
8310 /* Structure for managing pending initializer elements, organized as an
8311 AVL tree. */
8313 struct init_node
8314 {
8318 tree purpose;
8319 tree value;
8320 tree origtype;
8321 };
8323 /* Tree of pending elements at this constructor level.
8324 These are elements encountered out of order
8325 which belong at places we haven't reached yet in actually
8326 writing the output.
8327 Will never hold tree nodes across GC runs. */
8330 /* The SPELLING_DEPTH of this constructor. */
8333 /* DECL node for which an initializer is being read.
8334 0 means we are reading a constructor expression
8335 such as (struct foo) {...}. */
8338 /* Nonzero if this is an initializer for a top-level decl. */
8341 /* Nonzero if there were any member designators in this initializer. */
8344 /* Nesting depth of designator list. */
8347 /* Nonzero if there were diagnosed errors in this designator list. */
8350 \f
8351 /* This stack has a level for each implicit or explicit level of
8352 structuring in the initializer, including the outermost one. It
8353 saves the values of most of the variables above. */
8357 struct constructor_stack
8358 {
8360 tree type;
8361 tree fields;
8362 tree index;
8363 tree max_index;
8364 tree unfilled_index;
8365 tree unfilled_fields;
8366 tree bit_index;
8371 /* If value nonzero, this value should replace the entire
8372 constructor at this level. */
8384 };
8388 /* This stack represents designators from some range designator up to
8389 the last designator in the list. */
8391 struct constructor_range_stack
8392 {
8395 tree range_start;
8396 tree index;
8397 tree range_end;
8398 tree fields;
8399 };
8403 /* This stack records separate initializers that are nested.
8404 Nested initializers can't happen in ANSI C, but GNU C allows them
8405 in cases like { ... (struct foo) { ... } ... }. */
8407 struct initializer_stack
8408 {
8410 tree decl;
8421 };
8424 \f
8425 /* Prepare to parse and output the initializer for variable DECL. */
8427 void
8430 {
8453 {
8455 require_constant_elements
8457 /* For a scalar, you can always use any value to initialize,
8458 even within braces. */
8461 }
8462 else
8463 {
8467 }
8480 }
8482 void
8484 {
8487 /* Free the whole constructor stack of this initializer. */
8489 {
8493 }
8497 /* Pop back to the data of the outer initializer (if any). */
8512 }
8513 \f
8514 /* Call here when we see the initializer is surrounded by braces.
8515 This is instead of a call to push_init_level;
8516 it is matched by a call to pop_init_level.
8518 TYPE is the type to initialize, for a constructor expression.
8519 For an initializer for a decl, TYPE is zero. */
8521 void
8523 {
8573 {
8575 /* Skip any nameless bit fields at the beginning. */
8582 }
8584 {
8586 {
8587 constructor_max_index
8590 /* Detect non-empty initializations of zero-length arrays. */
8595 /* constructor_max_index needs to be an INTEGER_CST. Attempts
8596 to initialize VLAs will cause a proper error; avoid tree
8597 checking errors as well by setting a safe value. */
8602 constructor_index
8605 }
8606 else
8607 {
8610 }
8613 }
8615 {
8616 /* Vectors are like simple fixed-size arrays. */
8617 constructor_max_index =
8621 }
8622 else
8623 {
8624 /* Handle the case of int x = {5}; */
8627 }
8628 }
8629 \f
8632 /* Called when we see an open brace for a nested initializer. Finish
8633 off any pending levels with implicit braces. */
8634 void
8636 {
8638 {
8643 last_init_list_comma),
8646 && constructor_max_index
8648 constructor_index))
8651 last_init_list_comma),
8653 else
8655 }
8656 }
8658 /* Push down into a subobject, for initialization.
8659 If this is for an explicit set of braces, IMPLICIT is 0.
8660 If it is because the next element belongs at a lower level,
8661 IMPLICIT is 1 (or 2 if the push is because of designator list). */
8663 void
8666 {
8670 /* Unless this is an explicit brace, we need to preserve previous
8671 content if any. */
8673 {
8678 }
8716 {
8721 }
8723 /* Don't die if an entire brace-pair level is superfluous
8724 in the containing level. */
8726 ;
8728 {
8729 /* Don't die if there are extra init elts at the end. */
8732 else
8733 {
8736 constructor_depth++;
8737 }
8738 /* If upper initializer is designated, then mark this as
8739 designated too to prevent bogus warnings. */
8741 }
8743 {
8746 constructor_depth++;
8747 }
8750 {
8755 }
8758 {
8767 }
8770 {
8775 }
8778 {
8780 /* Skip any nameless bit fields at the beginning. */
8787 }
8789 {
8790 /* Vectors are like simple fixed-size arrays. */
8791 constructor_max_index =
8795 }
8797 {
8799 {
8800 constructor_max_index
8803 /* Detect non-empty initializations of zero-length arrays. */
8808 /* constructor_max_index needs to be an INTEGER_CST. Attempts
8809 to initialize VLAs will cause a proper error; avoid tree
8810 checking errors as well by setting a safe value. */
8815 constructor_index
8818 }
8819 else
8824 {
8825 /* We need to split the char/wchar array into individual
8826 characters, so that we don't have to special case it
8827 everywhere. */
8829 }
8830 }
8831 else
8832 {
8837 }
8838 }
8840 /* At the end of an implicit or explicit brace level,
8841 finish up that level of constructor. If a single expression
8842 with redundant braces initialized that level, return the
8843 c_expr structure for that expression. Otherwise, the original_code
8844 element is set to ERROR_MARK.
8845 If we were outputting the elements as they are read, return 0 as the value
8846 from inner levels (process_init_element ignores that),
8847 but return error_mark_node as the value from the outermost level
8848 (that's what we want to put in DECL_INITIAL).
8849 Otherwise, return a CONSTRUCTOR expression as the value. */
8851 struct c_expr
8854 location_t insert_before)
8855 {
8863 {
8864 /* When we come to an explicit close brace,
8865 pop any inner levels that didn't have explicit braces. */
8869 insert_before),
8872 }
8873 else
8878 /* Now output all pending elements. */
8884 /* Error for initializing a flexible array member, or a zero-length
8885 array member in an inappropriate context. */
8890 {
8891 /* Silently discard empty initializations. The parser will
8892 already have pedwarned for empty brackets. */
8895 else
8896 {
8901 else
8905 /* We have already issued an error message for the existence
8906 of a flexible array member not at the end of the structure.
8907 Discard the initializer so that we do not die later. */
8910 }
8911 }
8914 {
8916 /* Initialization with { } counts as zeroinit. */
8920 /* This might be zeroinit as well. */
8925 /* If the constructor has more than one element, it can't be { 0 }. */
8928 }
8930 /* Warn when some structs are initialized with direct aggregation. */
8933 {
8936 OPT_Wmissing_braces,
8938 }
8940 /* Warn when some struct elements are implicitly initialized to zero. */
8942 && constructor_type
8945 {
8946 /* Do not warn for flexible array members or zero-length arrays. */
8953 /* Do not warn if this level of the initializer uses member
8954 designators; it is likely to be deliberate. */
8955 && !constructor_designated
8956 /* Do not warn about initializing with { 0 } or with { }. */
8958 {
8961 constructor_unfilled_fields,
8962 constructor_type))
8965 }
8966 }
8968 /* Pad out the end of the structure. */
8970 /* If this closes a superfluous brace pair,
8971 just pass out the element between them. */
8974 ;
8978 {
8979 /* A nonincremental scalar initializer--just return
8980 the element, after verifying there is just one. */
8982 {
8986 }
8988 {
8991 }
8992 else
8994 }
8995 else
8996 {
8999 else
9000 {
9002 constructor_elements);
9009 }
9010 }
9013 {
9018 }
9047 }
9049 /* Common handling for both array range and field name designators.
9050 ARRAY argument is nonzero for array ranges. Returns false for success. */
9052 static bool
9055 {
9056 tree subtype;
9059 /* Don't die if an entire brace-pair level is superfluous
9060 in the containing level, or for an erroneous type. */
9064 /* If there were errors in this designator list already, bail out
9065 silently. */
9069 /* Likewise for an initializer for a variable-size type. Those are
9070 diagnosed in digest_init. */
9076 {
9079 /* Designator list starts at the level of closest explicit
9080 braces. */
9084 last_init_list_comma),
9088 }
9091 {
9103 }
9107 {
9110 }
9112 {
9115 }
9121 }
9123 /* If there are range designators in designator list, push a new designator
9124 to constructor_range_stack. RANGE_END is end of such stack range or
9125 NULL_TREE if there is no range designator at this level. */
9127 static void
9129 {
9145 }
9147 /* Within an array initializer, specify the next index to be initialized.
9148 FIRST is that index. If LAST is nonzero, then initialize a range
9149 of indices, running from FIRST through LAST. */
9151 void
9154 {
9162 {
9165 }
9168 {
9172 "array index in initializer is not "
9174 }
9177 {
9181 "array index in initializer is not "
9183 }
9196 else
9197 {
9203 {
9206 }
9209 {
9213 {
9216 }
9217 else
9218 {
9222 {
9226 }
9227 }
9228 }
9230 designator_depth++;
9234 }
9235 }
9237 /* Within a struct initializer, specify the next field to be initialized. */
9239 void
9242 {
9243 tree field;
9251 {
9254 }
9259 {
9262 {
9268 }
9269 else
9272 }
9273 else
9274 do
9275 {
9277 designator_depth++;
9283 {
9286 }
9287 }
9289 }
9290 \f
9291 /* Add a new initializer to the tree of pending initializers. PURPOSE
9292 identifies the initializer, either array index or field in a structure.
9293 VALUE is the value of that index or field. If ORIGTYPE is not
9294 NULL_TREE, it is the original type of VALUE.
9296 IMPLICIT is true if value comes from pop_init_level (1),
9297 the new initializer has been merged with the existing one
9298 and thus no warnings should be emitted about overriding an
9299 existing initializer. */
9301 static void
9304 {
9311 {
9313 {
9319 else
9320 {
9322 {
9325 "initialized field with side-effects "
9330 }
9334 }
9335 }
9336 }
9337 else
9338 {
9339 tree bitpos;
9343 {
9349 else
9350 {
9352 {
9355 "initialized field with side-effects "
9360 }
9364 }
9365 }
9366 }
9381 {
9385 {
9389 {
9391 {
9392 /* L rotation. */
9405 {
9408 else
9410 }
9411 else
9413 }
9414 else
9415 {
9416 /* LR rotation. */
9438 {
9441 else
9443 }
9444 else
9446 }
9448 }
9449 else
9450 {
9451 /* p->balance == +1; growth of left side balances the node. */
9454 }
9455 }
9457 {
9459 /* Growth propagation from right side. */
9462 {
9464 {
9465 /* R rotation. */
9478 {
9481 else
9483 }
9484 else
9486 }
9488 {
9489 /* RL rotation */
9511 {
9514 else
9516 }
9517 else
9519 }
9521 }
9522 else
9523 {
9524 /* p->balance == -1; growth of right side balances the node. */
9527 }
9528 }
9532 }
9533 }
9535 /* Build AVL tree from a sorted chain. */
9537 static void
9539 {
9549 braced_init_obstack);
9552 {
9554 /* Skip any nameless bit fields at the beginning. */
9559 }
9561 {
9563 constructor_unfilled_index
9566 else
9568 }
9570 }
9572 /* Build AVL tree from a string constant. */
9574 static void
9577 {
9594 p < end
9595 && !(constructor_max_index
9598 {
9600 {
9603 }
9604 else
9605 {
9609 {
9612 else
9617 }
9618 }
9621 {
9624 {
9626 {
9629 }
9630 }
9632 {
9635 }
9639 }
9645 braced_init_obstack);
9646 }
9649 }
9651 /* Return value of FIELD in pending initializer or NULL_TREE if the field was
9652 not initialized yet. */
9654 static tree
9656 {
9660 {
9667 {
9672 else
9674 }
9675 }
9677 {
9681 && (!constructor_unfilled_fields
9688 {
9693 else
9695 }
9696 }
9698 {
9702 }
9704 }
9706 /* "Output" the next constructor element.
9707 At top level, really output it to assembler code now.
9708 Otherwise, collect it in a list from which we will make a CONSTRUCTOR.
9709 If ORIGTYPE is not NULL_TREE, it is the original type of VALUE.
9710 TYPE is the data type that the containing data type wants here.
9711 FIELD is the field (a FIELD_DECL) or the index that this element fills.
9712 If VALUE is a string constant, STRICT_STRING is true if it is
9713 unparenthesized or we should not warn here for it being parenthesized.
9714 For other types of VALUE, STRICT_STRING is not used.
9716 PENDING if true means output pending elements that belong
9717 right after this element. (PENDING is normally true;
9718 it is false while outputting pending elements, to avoid recursion.)
9720 IMPLICIT is true if value comes from pop_init_level (1),
9721 the new initializer has been merged with the existing one
9722 and thus no warnings should be emitted about overriding an
9723 existing initializer. */
9725 static void
9729 {
9735 {
9738 }
9751 {
9752 /* As an extension, allow initializing objects with static storage
9753 duration with compound literals (which are then treated just as
9754 the brace enclosed list they contain). */
9760 }
9764 {
9767 }
9777 && TYPE_REVERSE_STORAGE_ORDER
9786 /* Digest the initializer and issue any errors about incompatible
9787 types before issuing errors about non-constant initializers. */
9792 require_constant_value);
9794 {
9797 }
9801 /* Proceed to check the constness of the original initializer. */
9803 {
9805 {
9808 }
9812 }
9818 /* Issue -Wc++-compat warnings about initializing a bitfield with
9819 enum type. */
9827 {
9834 }
9836 /* If this field is empty and does not have side effects (and is not at
9837 the end of structure), don't do anything other than checking the
9838 initializer. */
9848 /* Finally, set VALUE to the initializer value digested above. */
9851 /* If this element doesn't come next in sequence,
9852 put it on constructor_pending_elts. */
9854 && (!constructor_incremental
9856 {
9862 braced_init_obstack);
9864 }
9866 && (!constructor_incremental
9868 {
9869 /* We do this for records but not for unions. In a union,
9870 no matter which field is specified, it can be initialized
9871 right away since it starts at the beginning of the union. */
9873 {
9876 else
9877 {
9885 }
9886 }
9889 braced_init_obstack);
9891 }
9894 {
9896 {
9903 }
9905 /* We can have just one union field set. */
9907 }
9909 /* Otherwise, output this element either to
9910 constructor_elements or to the assembler file. */
9915 /* Advance the variable that indicates sequential elements output. */
9917 constructor_unfilled_index
9919 bitsize_one_node);
9921 {
9922 constructor_unfilled_fields
9925 /* Skip any nameless bit fields. */
9928 constructor_unfilled_fields =
9930 }
9934 /* Now output any pending elements which have become next. */
9937 }
9939 /* For two FIELD_DECLs in the same chain, return -1 if field1
9940 comes before field2, 1 if field1 comes after field2 and
9941 0 if field1 == field2. */
9943 static int
9945 {
9952 {
9953 /* If one of the fields has non-zero bitsize, then that
9954 field must be the last one in a sequence of zero
9955 sized fields, fields after it will have bigger
9956 bit_position. */
9965 /* Otherwise, fallback to DECL_CHAIN walk to find out
9966 which field comes earlier. Walk chains of both
9967 fields, so that if field1 and field2 are close to each
9968 other in either order, it is found soon even for large
9969 sequences of zero sized fields. */
9972 {
9976 {
9979 }
9990 }
9991 }
9994 else
9996 }
9998 /* Output any pending elements which have become next.
9999 As we output elements, constructor_unfilled_{fields,index}
10000 advances, which may cause other elements to become next;
10001 if so, they too are output.
10003 If ALL is 0, we return when there are
10004 no more pending elements to output now.
10006 If ALL is 1, we output space as necessary so that
10007 we can output all the pending elements. */
10008 static void
10010 {
10012 tree next;
10014 retry:
10016 /* Look through the whole pending tree.
10017 If we find an element that should be output now,
10018 output it. Otherwise, set NEXT to the element
10019 that comes first among those still pending. */
10023 {
10025 {
10027 constructor_unfilled_index))
10031 braced_init_obstack);
10034 {
10035 /* Advance to the next smaller node. */
10038 else
10039 {
10040 /* We have reached the smallest node bigger than the
10041 current unfilled index. Fill the space first. */
10044 }
10045 }
10046 else
10047 {
10048 /* Advance to the next bigger node. */
10051 else
10052 {
10053 /* We have reached the biggest node in a subtree. Find
10054 the parent of it, which is the next bigger node. */
10060 {
10063 }
10064 }
10065 }
10066 }
10068 {
10069 /* If the current record is complete we are done. */
10079 braced_init_obstack);
10081 {
10082 /* Advance to the next smaller node. */
10085 else
10086 {
10087 /* We have reached the smallest node bigger than the
10088 current unfilled field. Fill the space first. */
10091 }
10092 }
10093 else
10094 {
10095 /* Advance to the next bigger node. */
10098 else
10099 {
10100 /* We have reached the biggest node in a subtree. Find
10101 the parent of it, which is the next bigger node. */
10108 {
10111 }
10112 }
10113 }
10114 }
10115 }
10117 /* Ordinarily return, but not if we want to output all
10118 and there are elements left. */
10122 /* If it's not incremental, just skip over the gap, so that after
10123 jumping to retry we will output the next successive element. */
10129 /* ELT now points to the node in the pending tree with the next
10130 initializer to output. */
10132 }
10133 \f
10134 /* Expression VALUE coincides with the start of type TYPE in a braced
10135 initializer. Return true if we should treat VALUE as initializing
10136 the first element of TYPE, false if we should treat it as initializing
10137 TYPE as a whole.
10139 If the initializer is clearly invalid, the question becomes:
10140 which choice gives the best error message? */
10142 static bool
10144 {
10154 /* GNU vectors can be initialized elementwise. However, treat any
10155 kind of vector value as initializing the vector type as a whole,
10156 regardless of whether the value is a GNU vector. Such initializers
10157 are valid if and only if they would have been valid in a non-braced
10158 initializer like:
10160 TYPE foo = VALUE;
10162 so recursing into the vector type would be at best confusing or at
10163 worst wrong. For example, when -flax-vector-conversions is in effect,
10164 it's possible to initialize a V8HI from a V4SI, even though the vectors
10165 have different element types and different numbers of elements. */
10173 }
10175 /* Add one non-braced element to the current constructor level.
10176 This adjusts the current position within the constructor's type.
10177 This may also start or terminate implicit levels
10178 to handle a partly-braced initializer.
10180 Once this has found the correct level for the new element,
10181 it calls output_init_element.
10183 IMPLICIT is true if value comes from pop_init_level (1),
10184 the new initializer has been merged with the existing one
10185 and thus no warnings should be emitted about overriding an
10186 existing initializer. */
10188 void
10191 {
10193 int string_flag
10204 /* Handle superfluous braces around string cst as in
10205 char x[] = {"foo"}; */
10207 && constructor_type
10208 && !was_designated
10212 {
10217 }
10220 {
10223 }
10225 /* Ignore elements of a brace group if it is entirely superfluous
10226 and has already been diagnosed, or if the type is erroneous. */
10230 /* Ignore elements of an initializer for a variable-size type.
10231 Those are diagnosed in digest_init. */
10241 OPT_Wdesignated_init,
10242 "positional initialization of field "
10245 /* If we've exhausted any levels that didn't have braces,
10246 pop them now. */
10248 {
10253 last_init_list_comma),
10257 && constructor_max_index
10259 constructor_index))
10262 last_init_list_comma),
10264 else
10266 }
10268 /* In the case of [LO ... HI] = VALUE, only evaluate VALUE once. */
10270 {
10271 /* If value is a compound literal and we'll be just using its
10272 content, don't put it into a SAVE_EXPR. */
10275 {
10278 {
10281 }
10286 }
10287 }
10290 {
10292 {
10293 tree fieldtype;
10297 {
10300 }
10307 /* Error for non-static initialization of a flexible array member. */
10309 && !require_constant_value
10312 {
10316 }
10318 /* Error for initialization of a flexible array member with
10319 a string constant if the structure is in an array. E.g.:
10320 struct S { int x; char y[]; };
10321 struct S s[] = { { 1, "foo" } };
10322 is invalid. */
10328 {
10333 {
10336 }
10338 {
10342 }
10343 }
10345 /* Accept a string constant to initialize a subarray. */
10351 /* Otherwise, if we have come to a subaggregate,
10352 and we don't have an element of its type, push into it. */
10355 {
10358 }
10361 {
10366 braced_init_obstack);
10368 }
10369 else
10370 /* Do the bookkeeping for an element that was
10371 directly output as a constructor. */
10372 {
10373 /* For a record, keep track of end position of last field. */
10375 constructor_bit_index
10380 /* If the current field was the first one not yet written out,
10381 it isn't now, so update. */
10383 {
10385 /* Skip any nameless bit fields. */
10387 && (DECL_UNNAMED_BIT_FIELD
10389 constructor_unfilled_fields =
10391 }
10392 }
10395 /* Skip any nameless bit fields at the beginning. */
10399 }
10401 {
10402 tree fieldtype;
10406 {
10410 }
10417 /* Warn that traditional C rejects initialization of unions.
10418 We skip the warning if the value is zero. This is done
10419 under the assumption that the zero initializer in user
10420 code appears conditioned on e.g. __STDC__ to avoid
10421 "missing initializer" warnings and relies on default
10422 initialization to zero in the traditional C case.
10423 We also skip the warning if the initializer is designated,
10424 again on the assumption that this must be conditional on
10425 __STDC__ anyway (and we've already complained about the
10426 member-designator already). */
10433 /* Accept a string constant to initialize a subarray. */
10439 /* Otherwise, if we have come to a subaggregate,
10440 and we don't have an element of its type, push into it. */
10443 {
10446 }
10449 {
10454 braced_init_obstack);
10456 }
10457 else
10458 /* Do the bookkeeping for an element that was
10459 directly output as a constructor. */
10460 {
10463 }
10466 }
10468 {
10472 /* Accept a string constant to initialize a subarray. */
10478 /* Otherwise, if we have come to a subaggregate,
10479 and we don't have an element of its type, push into it. */
10482 {
10485 }
10490 {
10494 }
10496 /* Now output the actual element. */
10498 {
10503 braced_init_obstack);
10505 }
10507 constructor_index
10512 /* If we are doing the bookkeeping for an element that was
10513 directly output as a constructor, we must update
10514 constructor_unfilled_index. */
10516 }
10518 {
10521 /* Do a basic check of initializer size. Note that vectors
10522 always have a fixed size derived from their type. */
10524 {
10528 }
10530 /* Now output the actual element. */
10532 {
10538 braced_init_obstack);
10539 }
10541 constructor_index
10546 /* If we are doing the bookkeeping for an element that was
10547 directly output as a constructor, we must update
10548 constructor_unfilled_index. */
10550 }
10552 /* Handle the sole element allowed in a braced initializer
10553 for a scalar variable. */
10556 {
10560 }
10561 else
10562 {
10567 braced_init_obstack);
10569 }
10571 /* Handle range initializers either at this level or anywhere higher
10572 in the designator stack. */
10574 {
10581 {
10585 braced_init_obstack,
10586 last_init_list_comma),
10588 }
10592 {
10596 braced_init_obstack,
10597 last_init_list_comma),
10599 }
10607 {
10611 {
10614 }
10623 }
10628 }
10631 }
10634 }
10635 \f
10636 /* Build a complete asm-statement, whose components are a CV_QUALIFIER
10637 (guaranteed to be 'volatile' or null) and ARGS (represented using
10638 an ASM_EXPR node). */
10639 tree
10641 {
10645 }
10647 /* Build an asm-expr, whose components are a STRING, some OUTPUTS,
10648 some INPUTS, and some CLOBBERS. The latter three may be NULL.
10649 SIMPLE indicates whether there was anything at all after the
10650 string in the asm expression -- asm("blah") and asm("blah" : )
10651 are subtly different. We use a ASM_EXPR node to represent this.
10652 LOC is the location of the asm, and IS_INLINE says whether this
10653 is asm inline. */
10654 tree
10657 {
10658 tree tail;
10659 tree args;
10672 /* Remove output conversions that change the type but not the mode. */
10674 {
10679 /* ??? Really, this should not be here. Users should be using a
10680 proper lvalue, dammit. But there's a long history of using casts
10681 in the output operands. In cases like longlong.h, this becomes a
10682 primitive form of typechecking -- if the cast can be removed, then
10683 the output operand had a type of the proper width; otherwise we'll
10684 get an error. Gross, but ... */
10702 {
10703 /* If the operand is going to end up in memory,
10704 mark it addressable. */
10710 {
10713 }
10714 }
10715 else
10719 }
10722 {
10723 tree input;
10730 {
10731 /* If the operand is going to end up in memory,
10732 mark it addressable. */
10734 {
10737 /* Strip the nops as we allow this case. FIXME, this really
10738 should be rejected or made deprecated. */
10742 }
10743 else
10744 {
10752 {
10755 }
10756 }
10757 }
10758 else
10762 }
10766 /* asm statements without outputs, including simple ones, are treated
10767 as volatile. */
10773 }
10774 \f
10775 /* Generate a goto statement to LABEL. LOC is the location of the
10776 GOTO. */
10778 tree
10780 {
10785 {
10790 }
10791 }
10793 /* Generate a computed goto statement to EXPR. LOC is the location of
10794 the GOTO. */
10796 tree
10798 {
10800 tree t;
10805 {
10809 }
10815 }
10817 /* Generate a C `return' statement. RETVAL is the expression for what
10818 to return, or a null pointer for `return;' with no value. LOC is
10819 the location of the return statement, or the location of the expression,
10820 if the statement has any. If ORIGTYPE is not NULL_TREE, it
10821 is the original type of RETVAL. */
10823 tree
10825 {
10830 /* Use the expansion point to handle cases such as returning NULL
10831 in a function returning void. */
10839 {
10843 {
10846 }
10852 }
10855 {
10859 {
10862 warned_here = pedwarn
10865 else
10866 warned_here = warning_at
10873 }
10874 }
10876 {
10880 warned_here = pedwarn
10883 else
10884 warned_here = pedwarn
10890 }
10891 else
10892 {
10897 tree inner;
10915 /* Strip any conversions, additions, and subtractions, and see if
10916 we are returning the address of a local variable. Warn if so. */
10918 {
10920 {
10921 CASE_CONVERT:
10929 /* If the second operand of the MINUS_EXPR has a pointer
10930 type (or is converted from it), this may be valid, so
10931 don't give a warning. */
10932 {
10945 }
10959 {
10963 else
10964 {
10969 }
10970 }
10975 }
10978 }
10985 }
10991 }
10992 \f
10994 /* The SWITCH_STMT being built. */
10995 tree switch_stmt;
10997 /* The original type of the testing expression, i.e. before the
10998 default conversion is applied. */
10999 tree orig_type;
11001 /* A splay-tree mapping the low element of a case range to the high
11002 element, or NULL_TREE if there is no high element. Used to
11003 determine whether or not a new case label duplicates an old case
11004 label. We need a tree, rather than simply a hash table, because
11005 of the GNU case range extension. */
11006 splay_tree cases;
11008 /* The bindings at the point of the switch. This is used for
11009 warnings crossing decls when branching to a case label. */
11012 /* Whether the switch includes any break statements. */
11015 /* The next node on the stack. */
11018 /* Remember whether the controlling expression had boolean type
11019 before integer promotions for the sake of -Wswitch-bool. */
11021 };
11023 /* A stack of the currently active switch statements. The innermost
11024 switch statement is on the top of the stack. There is no need to
11025 mark the stack for garbage collection because it is only active
11026 during the processing of the body of a function, and we never
11027 collect at that point. */
11031 /* Start a C switch statement, testing expression EXP. Return the new
11032 SWITCH_STMT. SWITCH_LOC is the location of the `switch'.
11033 SWITCH_COND_LOC is the location of the switch's condition.
11034 EXPLICIT_CAST_P is true if the expression EXP has an explicit cast. */
11036 tree
11038 location_t switch_cond_loc,
11040 {
11046 {
11050 {
11052 {
11055 }
11057 }
11058 else
11059 {
11063 /* Warn if the condition has boolean value. */
11069 /* Explicit cast to int suppresses this warning. */
11086 }
11087 }
11089 /* Add this new SWITCH_STMT to the stack. */
11102 }
11104 /* Process a case label at location LOC. */
11106 tree
11108 {
11112 {
11117 }
11120 {
11125 }
11128 {
11131 else
11134 }
11138 loc))
11147 }
11149 /* Finish the switch statement. TYPE is the original type of the
11150 controlling expression of the switch, or NULL_TREE. */
11152 void
11154 {
11156 location_t switch_location;
11160 /* Emit warnings as needed. */
11170 /* Pop the stack. */
11175 }
11176 \f
11177 /* Emit an if statement. IF_LOCUS is the location of the 'if'. COND,
11178 THEN_BLOCK and ELSE_BLOCK are expressions to be used; ELSE_BLOCK
11179 may be null. */
11181 void
11183 tree else_block)
11184 {
11185 tree stmt;
11190 }
11192 tree
11194 {
11195 /* In switch statements break is sometimes stylistically used after
11196 a return statement. This can lead to spurious warnings about
11197 control reaching the end of a non-void function when it is
11198 inlined. Note that we are calling block_may_fallthru with
11199 language specific tree nodes; this works because
11200 block_may_fallthru returns true when given something it does not
11201 understand. */
11206 {
11223 }
11224 else
11226 {
11239 }
11244 {
11245 /* The foreach expander produces low-level code using gotos instead
11246 of a structured loop construct. */
11249 }
11251 }
11253 /* A helper routine for c_process_expr_stmt and c_finish_stmt_expr. */
11255 static void
11257 {
11262 ;
11264 {
11268 }
11270 {
11274 {
11278 }
11286 }
11287 else
11289 }
11291 /* Process an expression as if it were a complete statement. Emit
11292 diagnostics, but do not call ADD_STMT. LOC is the location of the
11293 statement. */
11295 tree
11297 {
11298 tree exprv;
11313 /* If we're not processing a statement expression, warn about unused values.
11314 Warnings for statement expressions will be emitted later, once we figure
11315 out which is the result. */
11330 /* If the expression is not of a type to which we cannot assign a line
11331 number, wrap the thing in a no-op NOP_EXPR. */
11333 {
11336 }
11339 }
11341 /* Emit an expression as a statement. LOC is the location of the
11342 expression. */
11344 tree
11346 {
11349 else
11351 }
11353 /* Do the opposite and emit a statement as an expression. To begin,
11354 create a new binding level and return it. */
11356 tree
11358 {
11359 tree ret;
11361 /* We must force a BLOCK for this level so that, if it is not expanded
11362 later, there is a way to turn off the entire subtree of blocks that
11363 are contained in it. */
11368 ? NULL
11371 /* Mark the current statement list as belonging to a statement list. */
11375 }
11377 /* LOC is the location of the compound statement to which this body
11378 belongs. */
11380 tree
11382 {
11389 ? NULL
11392 /* Locate the last statement in BODY. See c_end_compound_stmt
11393 about always returning a BIND_EXPR. */
11397 continue_searching:
11399 {
11405 /* This can happen with degenerate cases like ({ }). No value. */
11409 /* If we're supposed to generate side effects warnings, process
11410 all of the statements except the last. */
11412 {
11415 {
11416 location_t tloc;
11421 }
11422 }
11425 }
11427 /* If the end of the list is exception related, then the list was split
11428 by a call to push_cleanup. Continue searching. */
11431 {
11435 }
11440 /* In the case that the BIND_EXPR is not necessary, return the
11441 expression out from inside it. */
11443 /* Skip nested debug stmts. */
11446 {
11447 /* Even if this looks constant, do not allow it in a constant
11448 expression. */
11450 /* Do not warn if the return value of a statement expression is
11451 unused. */
11454 }
11456 /* Extract the type of said expression. */
11459 /* If we're not returning a value at all, then the BIND_EXPR that
11460 we already have is a fine expression to return. */
11464 /* Now that we've located the expression containing the value, it seems
11465 silly to make voidify_wrapper_expr repeat the process. Create a
11466 temporary of the appropriate type and stick it in a TARGET_EXPR. */
11469 /* Unwrap a no-op NOP_EXPR as added by c_finish_expr_stmt. This avoids
11470 tree_expr_nonnegative_p giving up immediately. */
11479 {
11483 }
11484 }
11485 \f
11486 /* Begin and end compound statements. This is as simple as pushing
11487 and popping new statement lists from the tree. */
11489 tree
11491 {
11496 }
11498 /* End a compound statement. STMT is the statement. LOC is the
11499 location of the compound statement-- this is usually the location
11500 of the opening brace. */
11502 tree
11504 {
11508 {
11512 }
11517 /* If this compound statement is nested immediately inside a statement
11518 expression, then force a BIND_EXPR to be created. Otherwise we'll
11519 do the wrong thing for ({ { 1; } }) or ({ 1; { } }). In particular,
11520 STATEMENT_LISTs merge, and thus we can lose track of what statement
11521 was really last. */
11525 {
11529 }
11532 }
11534 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
11535 when the current scope is exited. EH_ONLY is true when this is not
11536 meant to apply to normal control flow transfer. */
11538 void
11540 {
11552 }
11553 \f
11554 /* Build a vector comparison of ARG0 and ARG1 using CODE opcode
11555 into a value of TYPE type. Comparison is done via VEC_COND_EXPR. */
11557 static tree
11560 {
11566 }
11568 /* Possibly warn about an address of OP never being NULL in a comparison
11569 operation CODE involving null. */
11571 static void
11573 {
11578 {
11579 /* Allow casts to intptr_t to suppress the warning. */
11584 }
11587 {
11588 /* Allow a cast to void* to suppress the warning. */
11593 /* Adding any value to a null pointer, including zero, is undefined
11594 in C. This includes the expression &p[0] where p is the null
11595 pointer, although &p[0] will have been folded to p by this point
11596 and so not diagnosed. */
11599 "the comparison will always evaluate as %<false%> "
11601 op);
11602 else
11604 "the comparison will always evaluate as %<true%> "
11606 op);
11609 }
11618 {
11619 /* The address of either complex part may not be null. */
11622 "the comparison will always evaluate as %<false%> "
11624 op);
11625 else
11627 "the comparison will always evaluate as %<true%> "
11629 op);
11631 }
11633 /* Set to true in the loop below if OP dereferences is operand.
11634 In such a case the ultimate target need not be a decl for
11635 the null [in]equality test to be constant. */
11638 /* Get the outermost array or object, or member. */
11640 {
11642 {
11643 /* Get the member (its address is never null). */
11646 }
11648 /* Get the outer array/object to refer to in the warning. */
11651 }
11659 "the comparison will always evaluate as %<false%> "
11661 op);
11662 else
11664 "the comparison will always evaluate as %<true%> "
11666 op);
11670 }
11672 /* Build a binary-operation expression without default conversions.
11673 CODE is the kind of expression to build.
11674 LOCATION is the operator's location.
11675 This function differs from `build' in several ways:
11676 the data type of the result is computed and recorded in it,
11677 warnings are generated if arg data types are invalid,
11678 special handling for addition and subtraction of pointers is known,
11679 and some optimization is done (operations on narrow ints
11680 are done in the narrower type when that gives the same result).
11681 Constant folding is also done before the result is returned.
11683 Note that the operands will never have enumeral types, or function
11684 or array types, because either they will have the default conversions
11685 performed or they have both just been converted to some other type in which
11686 the arithmetic is to be done. */
11688 tree
11691 {
11693 tree eptype;
11701 /* Expression code to give to the expression when it is built.
11702 Normally this is CODE, which is what the caller asked for,
11703 but in some special cases we change it. */
11706 /* Data type in which the computation is to be performed.
11707 In the simplest cases this is the common type of the arguments. */
11710 /* When the computation is in excess precision, the type of the
11711 final EXCESS_PRECISION_EXPR. */
11714 /* Nonzero means operands have already been type-converted
11715 in whatever way is necessary.
11716 Zero means they need to be converted to RESULT_TYPE. */
11719 /* Nonzero means create the expression with this type, rather than
11720 RESULT_TYPE. */
11723 /* Nonzero means after finally constructing the expression
11724 convert it to this type. */
11727 /* Nonzero if this is an operation like MIN or MAX which can
11728 safely be computed in short if both args are promoted shorts.
11729 Also implies COMMON.
11730 -1 indicates a bitwise operation; this makes a difference
11731 in the exact conditions for when it is safe to do the operation
11732 in a narrower mode. */
11735 /* Nonzero if this is a comparison operation;
11736 if both args are promoted shorts, compare the original shorts.
11737 Also implies COMMON. */
11740 /* Nonzero if this is a right-shift operation, which can be computed on the
11741 original short and then promoted if the operand is a promoted short. */
11744 /* Nonzero means set RESULT_TYPE to the common type of the args. */
11747 /* True means types are compatible as far as ObjC is concerned. */
11750 /* True means this is an arithmetic operation that may need excess
11751 precision. */
11754 /* True means this is a boolean operation that converts both its
11755 operands to truth-values. */
11758 /* Remember whether we're doing / or %. */
11761 /* Remember whether we're doing << or >>. */
11764 /* Tree holding instrumentation expression. */
11781 {
11784 int_const = (int_const_or_overflow
11787 }
11788 else
11791 /* Do not apply default conversion in mixed vector/scalar expression. */
11794 {
11797 }
11803 /* The expression codes of the data types of the arguments tell us
11804 whether the arguments are integers, floating, pointers, etc. */
11808 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
11812 /* If an error was already reported for one of the arguments,
11813 avoid reporting another error. */
11828 {
11831 }
11834 {
11852 /* Excess precision for implicit conversions of integers to
11853 floating point in C11 and later. */
11854 may_need_excess_precision = (flag_isoc11
11862 }
11864 {
11867 }
11870 {
11873 }
11875 {
11878 }
11881 {
11884 }
11888 /* In case when one of the operands of the binary operation is
11889 a vector and another is a scalar -- convert scalar to vector. */
11892 {
11897 {
11901 {
11903 tree sc;
11914 }
11916 {
11918 tree sc;
11929 }
11932 }
11933 }
11936 {
11938 /* Handle the pointer + int case. */
11940 {
11943 }
11945 {
11948 }
11949 else
11954 /* Subtraction of two similar pointers.
11955 We must subtract them as integers, then divide by object size. */
11958 {
11961 }
11962 /* Handle pointer minus int. Just like pointer plus int. */
11964 {
11967 }
11968 else
11992 {
12003 else
12004 /* Although it would be tempting to shorten always here, that
12005 loses on some targets, since the modulo instruction is
12006 undefined if the quotient can't be represented in the
12007 computation mode. We shorten only if unsigned or if
12008 dividing by something we know != -1. */
12013 }
12021 /* Allow vector types which are not floating point types. */
12040 {
12041 /* Although it would be tempting to shorten always here, that loses
12042 on some targets, since the modulo instruction is undefined if the
12043 quotient can't be represented in the computation mode. We shorten
12044 only if unsigned or if dividing by something we know != -1. */
12049 }
12063 {
12064 /* Result of these operations is always an int,
12065 but that does not mean the operands should be
12066 converted to ints! */
12069 {
12072 }
12073 else
12076 {
12079 }
12080 else
12084 }
12086 {
12087 int_const_or_overflow = (int_operands
12091 int_const = (int_const_or_overflow
12095 }
12097 {
12098 int_const_or_overflow = (int_operands
12102 int_const = (int_const_or_overflow
12106 }
12109 /* Shift operations: result has same type as first operand;
12110 always convert second operand to int.
12111 Also set SHORT_SHIFT if shifting rightward. */
12120 {
12123 }
12128 {
12131 {
12133 {
12138 }
12140 {
12144 {
12149 }
12150 }
12151 else
12152 {
12157 {
12162 }
12163 }
12164 }
12166 /* Use the type of the value to be shifted. */
12168 /* Avoid converting op1 to result_type later. */
12170 }
12180 {
12183 }
12188 {
12192 {
12193 /* Don't reject a left shift of a negative value in a context
12194 where a constant expression is needed in C90. */
12200 }
12202 {
12204 {
12209 }
12211 {
12215 {
12220 }
12221 }
12223 {
12228 }
12233 }
12235 /* Use the type of the value to be shifted. */
12237 /* Avoid converting op1 to result_type later. */
12239 }
12245 {
12246 tree intt;
12248 {
12252 }
12256 {
12260 }
12262 /* It's not precisely specified how the usual arithmetic
12263 conversions apply to the vector types. Here, we use
12264 the unsigned type if one of the operands is signed and
12265 the other one is unsigned. */
12267 {
12270 else
12274 }
12276 /* Always construct signed integer vector type. */
12278 (SCALAR_TYPE_MODE
12281 {
12286 }
12292 }
12295 OPT_Wfloat_equal,
12297 /* Result of comparison is always int,
12298 but don't convert the args to int! */
12306 {
12309 }
12311 {
12314 }
12316 {
12323 /* Anything compares with void *. void * compares with anything.
12324 Otherwise, the targets must be compatible
12325 and both must be object or both incomplete. */
12329 {
12333 }
12335 {
12339 }
12341 {
12345 }
12346 else
12347 /* Avoid warning about the volatile ObjC EH puts on decls. */
12353 {
12355 result_type = build_pointer_type
12357 }
12358 }
12360 {
12363 }
12365 {
12368 }
12381 {
12382 tree intt;
12384 {
12388 }
12392 {
12396 }
12398 /* It's not precisely specified how the usual arithmetic
12399 conversions apply to the vector types. Here, we use
12400 the unsigned type if one of the operands is signed and
12401 the other one is unsigned. */
12403 {
12406 else
12410 }
12412 /* Always construct signed integer vector type. */
12414 (SCALAR_TYPE_MODE
12417 {
12422 }
12428 }
12436 {
12439 addr_space_t as_common;
12442 {
12456 }
12458 {
12462 }
12463 else
12464 {
12466 result_type = build_pointer_type
12470 }
12471 }
12473 {
12481 }
12483 {
12491 }
12493 {
12496 }
12498 {
12501 }
12506 {
12512 }
12523 /* Used for OpenMP atomics. */
12530 }
12539 {
12541 maybe_range_label_for_tree_type_mismatch
12548 }
12553 &&
12557 {
12563 {
12566 "implicit conversion from %qT to %qT "
12567 "to match other operand of binary "
12569 location);
12572 }
12581 {
12582 /* An operation on mixed real/complex operands must be
12583 handled specially, but the language-independent code can
12584 more easily optimize the plain complex arithmetic if
12585 -fno-signed-zeros. */
12589 {
12592 }
12594 {
12599 }
12600 else
12601 {
12606 }
12610 {
12617 {
12622 /* Fall through. */
12629 }
12630 }
12631 else
12632 {
12639 {
12643 /* Fall through. */
12653 }
12654 }
12657 }
12659 /* For certain operations (which identify themselves by shorten != 0)
12660 if both args were extended from the same smaller type,
12661 do the arithmetic in that type and then extend.
12663 shorten !=0 and !=1 indicates a bitwise operation.
12664 For them, this optimization is safe only if
12665 both args are zero-extended or both are sign-extended.
12666 Otherwise, we might change the result.
12667 Eg, (short)-1 | (unsigned short)-1 is (int)-1
12668 but calculated in (unsigned short) it would be (unsigned short)-1. */
12671 {
12675 }
12677 /* Shifts can be shortened if shifting right. */
12680 {
12691 /* We can shorten only if the shift count is less than the
12692 number of bits in the smaller type size. */
12694 /* We cannot drop an unsigned shift after sign-extension. */
12696 {
12697 /* Do an unsigned shift if the operand was zero-extended. */
12698 result_type
12701 /* Convert value-to-be-shifted to that type. */
12705 }
12706 }
12708 /* Comparison operations are shortened too but differently.
12709 They identify themselves by setting short_compare = 1. */
12712 {
12713 /* Don't write &op0, etc., because that would prevent op0
12714 from being kept in a register.
12715 Instead, make copies of the our local variables and
12716 pass the copies by reference, then copy them back afterward. */
12719 tree val
12724 {
12727 }
12734 {
12740 {
12743 }
12744 else
12745 {
12746 /* Fold for the sake of possible warnings, as in
12747 build_conditional_expr. This requires the
12748 "original" values to be folded, not just op0 and
12749 op1. */
12750 c_inhibit_evaluation_warnings++;
12755 c_inhibit_evaluation_warnings--;
12757 require_constant_value,
12758 NULL);
12760 require_constant_value,
12761 NULL);
12762 }
12769 {
12774 }
12775 }
12776 }
12777 }
12779 /* At this point, RESULT_TYPE must be nonzero to avoid an error message.
12780 If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
12781 Then the expression will be built.
12782 It will be given type FINAL_TYPE if that is nonzero;
12783 otherwise, it will be given type RESULT_TYPE. */
12786 {
12787 /* Favor showing any expression locations that are available. */
12792 }
12795 {
12799 {
12802 }
12803 }
12806 {
12808 semantic_result_type);
12810 semantic_result_type);
12812 /* This can happen if one operand has a vector type, and the other
12813 has a different type. */
12816 }
12819 | SANITIZE_DIVIDE
12820 | SANITIZE_FLOAT_DIVIDE
12825 {
12826 /* OP0 and/or OP1 might have side-effects. */
12832 | SANITIZE_FLOAT_DIVIDE
12837 }
12839 /* Treat expressions in initializers specially as they can't trap. */
12841 ret = (require_constant_value
12845 else
12850 return_build_binary_op:
12853 ret = (int_operands
12870 }
12873 /* Convert EXPR to be a truth-value, validating its type for this
12874 purpose. LOCATION is the source location for the expression. */
12876 tree
12878 {
12882 {
12884 error_at (location, "used array that cannot be converted to pointer where scalar is required");
12913 }
12918 {
12923 }
12924 else
12925 /* ??? Should we also give an error for vectors rather than leaving
12926 those to give errors later? */
12930 {
12933 else
12935 }
12939 }
12940 \f
12942 /* Convert EXPR to a contained DECL, updating *TC, *TI and *SE as
12943 required. */
12945 tree
12947 {
12949 {
12951 /* Executing a compound literal inside a function reinitializes
12952 it. */
12956 }
12957 else
12959 }
12960 \f
12961 /* Generate OMP construct CODE, with BODY and CLAUSES as its compound
12962 statement. LOC is the location of the construct. */
12964 tree
12966 tree clauses)
12967 {
12977 }
12979 /* Generate OACC_DATA, with CLAUSES and BLOCK as its compound
12980 statement. LOC is the location of the OACC_DATA. */
12982 tree
12984 {
12985 tree stmt;
12996 }
12998 /* Generate OACC_HOST_DATA, with CLAUSES and BLOCK as its compound
12999 statement. LOC is the location of the OACC_HOST_DATA. */
13001 tree
13003 {
13004 tree stmt;
13015 }
13017 /* Like c_begin_compound_stmt, except force the retention of the BLOCK. */
13019 tree
13021 {
13022 tree block;
13028 }
13030 /* Generate OMP_PARALLEL, with CLAUSES and BLOCK as its compound
13031 statement. LOC is the location of the OMP_PARALLEL. */
13033 tree
13035 {
13036 tree stmt;
13047 }
13049 /* Like c_begin_compound_stmt, except force the retention of the BLOCK. */
13051 tree
13053 {
13054 tree block;
13060 }
13062 /* Generate OMP_TASK, with CLAUSES and BLOCK as its compound
13063 statement. LOC is the location of the #pragma. */
13065 tree
13067 {
13068 tree stmt;
13079 }
13081 /* Generate GOMP_cancel call for #pragma omp cancel. */
13083 void
13085 {
13096 else
13097 {
13099 "%<parallel%>, %<for%>, %<sections%> or %<taskgroup%> "
13102 }
13105 {
13110 else
13111 {
13114 {
13120 }
13121 }
13127 }
13128 else
13132 ifc);
13134 }
13136 /* Generate GOMP_cancellation_point call for
13137 #pragma omp cancellation point. */
13139 void
13141 {
13152 else
13153 {
13155 "%<parallel%>, %<for%>, %<sections%> or %<taskgroup%> "
13158 }
13162 }
13164 /* Helper function for handle_omp_array_sections. Called recursively
13165 to handle multiple array-section-subscripts. C is the clause,
13166 T current expression (initially OMP_CLAUSE_DECL), which is either
13167 a TREE_LIST for array-section-subscript (TREE_PURPOSE is low-bound
13168 expression if specified, TREE_VALUE length expression if specified,
13169 TREE_CHAIN is what it has been specified after, or some decl.
13170 TYPES vector is populated with array section types, MAYBE_ZERO_LEN
13171 set to true if any of the array-section-subscript could have length
13172 of zero (explicit or implicit), FIRST_NON_ONE is the index of the
13173 first array-section-subscript which is known not to have length
13174 of one. Given say:
13175 map(a[:b][2:1][:c][:2][:d][e:f][2:5])
13176 FIRST_NON_ONE will be 3, array-section-subscript [:b], [2:1] and [:c]
13177 all are or may have length of 1, array-section-subscript [:2] is the
13178 first one known not to have length 1. For array-section-subscript
13179 <= FIRST_NON_ONE we diagnose non-contiguous arrays if low bound isn't
13180 0 or length isn't the array domain max + 1, for > FIRST_NON_ONE we
13181 can if MAYBE_ZERO_LEN is false. MAYBE_ZERO_LEN will be true in the above
13182 case though, as some lengths could be zero. */
13184 static tree
13188 {
13191 {
13198 {
13202 }
13207 {
13209 {
13214 }
13216 {
13218 {
13222 }
13225 {
13230 else
13232 }
13233 }
13234 }
13236 {
13241 else
13246 }
13250 {
13254 }
13259 {
13264 }
13269 {
13270 /* If the array section is pointer based and the pointer
13271 itself is _Atomic qualified, we need to atomically load
13272 the pointer. */
13273 c_expr expr;
13279 }
13281 }
13296 {
13299 low_bound);
13301 }
13303 {
13306 length);
13308 }
13324 {
13326 {
13331 }
13332 }
13334 {
13336 {
13342 {
13344 {
13349 }
13350 }
13351 else
13353 }
13356 first_non_one++;
13357 }
13359 {
13363 {
13365 "for unknown bound array type length expression must "
13368 }
13371 {
13376 }
13380 {
13385 }
13390 {
13391 tree size
13395 {
13397 {
13399 "low bound %qE above array section size "
13403 }
13405 {
13411 {
13416 }
13418 }
13421 && tree_int_cst_equal
13423 low_bound))
13424 first_non_one++;
13425 }
13427 {
13435 first_non_one++;
13436 }
13438 {
13440 {
13442 "length %qE above array section size "
13446 }
13448 {
13449 tree lbpluslen
13455 {
13457 "high bound %qE above array section size "
13461 }
13462 }
13463 }
13464 }
13466 {
13474 first_non_one++;
13475 }
13477 /* For [lb:] we will need to evaluate lb more than once. */
13479 {
13482 {
13485 }
13486 }
13487 }
13489 {
13491 {
13494 "for array function parameter length expression "
13496 else
13500 }
13504 {
13509 }
13510 /* If there is a pointer type anywhere but in the very first
13511 array-section-subscript, the array section can't be contiguous. */
13515 {
13520 }
13521 }
13522 else
13523 {
13527 }
13530 /* We will need to evaluate lb more than once. */
13533 {
13536 }
13539 }
13541 /* Handle array sections for clause C. */
13543 static bool
13545 {
13558 ort);
13565 {
13568 /* Need to evaluate side effects in the length expressions
13569 if any. */
13571 {
13573 {
13576 else
13579 }
13581 }
13586 }
13587 else
13588 {
13598 {
13602 i--;
13616 {
13625 {
13626 tree size;
13629 size_one_node);
13631 {
13632 do_warn_noncontiguous:
13634 "array section is not contiguous in %qs "
13638 }
13639 }
13642 {
13645 else
13649 }
13650 }
13651 else
13652 {
13653 tree l;
13663 else
13664 {
13667 size_one_node);
13670 }
13672 {
13674 size_zero_node);
13677 else
13680 }
13682 {
13690 {
13693 {
13698 }
13701 }
13706 }
13707 else
13709 }
13710 }
13716 {
13739 else
13740 {
13745 }
13748 }
13760 {
13779 }
13783 else
13803 }
13805 }
13807 /* Helper function of finish_omp_clauses. Clone STMT as if we were making
13808 an inline call. But, remap
13809 the OMP_DECL1 VAR_DECL (omp_out resp. omp_orig) to PLACEHOLDER
13810 and OMP_DECL2 VAR_DECL (omp_in resp. omp_priv) to DECL. */
13812 static tree
13815 {
13816 copy_body_data id;
13835 }
13837 /* Helper function of c_finish_omp_clauses, called via walk_tree.
13838 Find OMP_CLAUSE_PLACEHOLDER (passed in DATA) in *TP. */
13840 static tree
13842 {
13846 }
13848 /* Similarly, but also walk aggregate fields. */
13852 static tree
13854 {
13858 {
13859 tree field;
13865 {
13874 pset);
13880 }
13881 }
13886 }
13888 /* Finish OpenMP iterators ITER. Return true if they are errorneous
13889 and clauses containing them should be removed. */
13891 static bool
13893 {
13896 {
13901 tree orig_step;
13905 {
13908 }
13910 {
13912 var);
13915 }
13917 {
13921 }
13923 {
13927 }
13930 {
13933 }
13935 {
13940 }
13947 {
13954 }
13956 {
13960 }
13966 {
13969 }
13971 tree it2;
13973 {
13982 {
13987 }
13989 {
13993 }
13995 {
13999 }
14001 {
14005 }
14006 }
14008 {
14011 }
14016 }
14018 }
14020 /* Ensure that pointers are used in OpenACC attach and detach clauses.
14021 Return true if an error has been detected. */
14023 static bool
14025 {
14029 /* OpenACC attach / detach clauses must be pointers. */
14032 {
14039 {
14043 }
14044 }
14047 }
14049 /* For all elements of CLAUSES, validate them against their constraints.
14050 Remove any elements from the list that are invalid. */
14052 tree
14054 {
14057 bitmap_head oacc_reduction_head;
14073 /* 1 if normal/task reduction has been seen, -1 if inscan reduction
14074 has been seen, -2 if mixed inscan/normal reduction diagnosed. */
14085 /* If ort == C_ORT_OMP_DECLARE_SIMD used as uniform_head instead. */
14089 /* If ort == C_ORT_OMP used as nontemporal_head or use_device_xxx_head
14090 instead and for ort == C_ORT_OMP_TARGET used as in_reduction_head. */
14096 {
14099 }
14102 {
14108 {
14124 {
14126 "%<inscan%> and non-%<inscan%> %<reduction%> clauses "
14129 }
14130 /* FALLTHRU */
14136 {
14138 {
14141 }
14146 {
14148 "%<inscan%> %<reduction%> clause with array "
14152 }
14153 }
14156 {
14159 }
14166 {
14172 {
14175 t);
14178 }
14182 {
14185 t);
14188 }
14193 index_type);
14200 }
14202 {
14207 }
14210 {
14211 /* Disallow zero sized or potentially zero sized task
14212 reductions. */
14214 {
14220 }
14222 {
14228 }
14229 }
14233 {
14238 {
14264 }
14266 {
14272 }
14273 }
14275 {
14280 }
14282 {
14292 {
14298 }
14308 decl_placeholder ? decl_placeholder
14316 {
14328 decl_placeholder ? decl_placeholder
14331 {
14336 }
14338 c_find_omp_placeholder_r,
14341 }
14342 else
14343 {
14344 tree init;
14348 else
14352 }
14358 }
14360 {
14364 {
14369 }
14375 }
14381 {
14383 "%<nowait%> clause must not be used together "
14387 }
14393 {
14398 }
14407 {
14409 "modifier should not be specified in %<linear%> "
14412 }
14415 {
14417 "linear clause applied to non-integral non-pointer "
14421 }
14423 {
14428 }
14430 {
14433 {
14435 /* map_head bitmap is used as uniform_head if
14436 declare_simd. */
14440 }
14442 {
14444 "%<linear%> clause step %qE is neither constant "
14448 }
14449 }
14451 {
14457 fold_convert
14462 }
14463 else
14468 check_dup_generic:
14470 check_dup_generic_t:
14472 {
14477 }
14486 {
14490 {
14492 "%qD appears more than once in data-sharing "
14496 }
14500 {
14502 ort == C_ORT_ACC
14505 t);
14507 }
14508 else
14510 }
14515 {
14519 }
14522 {
14526 else
14530 }
14531 else
14537 {
14538 move_implicit:
14540 /* Move firstprivate and map clauses with
14541 OMP_CLAUSE_{FIRSTPRIVATE,MAP}_IMPLICIT set to the end of
14542 clauses chain. */
14548 {
14552 }
14555 {
14559 }
14560 else
14566 }
14571 {
14575 }
14583 {
14587 }
14589 {
14596 else
14600 }
14601 else
14610 {
14614 }
14617 {
14621 }
14622 else
14629 {
14633 }
14636 {
14638 "%qE in %<aligned%> clause is neither a pointer nor "
14641 }
14643 {
14648 }
14650 {
14653 t);
14655 }
14656 else
14663 {
14667 }
14669 {
14671 "%qE appears more than once in %<nontemporal%> "
14674 }
14675 else
14682 {
14686 }
14688 {
14691 t);
14693 }
14694 else
14695 {
14699 }
14705 {
14709 }
14711 {
14714 {
14717 {
14725 sizetype,
14729 {
14732 }
14734 }
14735 }
14737 }
14738 /* FALLTHRU */
14744 {
14746 last_iterators_remove
14752 }
14753 else
14756 {
14761 {
14763 "%<depend%> clause with %<depobj%> dependence "
14766 }
14768 }
14772 {
14774 "%qE is not lvalue expression nor array section in "
14778 }
14781 {
14788 }
14791 {
14793 {
14795 "%qE does not have %<omp_depend_t%> type in "
14796 "%<depend%> clause with %<depobj%> dependence "
14799 }
14800 }
14803 {
14805 "%qE should not have %<omp_depend_t%> type in "
14806 "%<depend%> clause with dependence type other than "
14809 }
14811 {
14816 else
14817 {
14819 RO_UNARY_STAR);
14827 else
14829 }
14830 }
14836 /* FALLTHRU */
14842 {
14845 else
14846 {
14849 {
14851 "array section does not have mappable type "
14855 }
14857 {
14862 }
14867 {
14876 {
14879 }
14883 {
14886 "%qD appears more than once in motion "
14890 "%qD appears more than once in data "
14892 else
14894 "%qD appears more than once in map "
14897 }
14898 else
14899 {
14902 }
14903 }
14904 }
14910 /* In this case, we have a single array element which is a
14911 pointer, and we already set OMP_CLAUSE_SIZE in
14912 handle_omp_array_sections above. For attach/detach clauses,
14913 reset the OMP_CLAUSE_SIZE (representing a bias) to zero
14914 here. */
14917 }
14919 {
14922 }
14923 /* OpenACC attach / detach clauses must be pointers. */
14925 {
14928 }
14932 /* For attach/detach clauses, set OMP_CLAUSE_SIZE (representing a
14933 bias) to zero here, so it is not set erroneously to the pointer
14934 size later on in gimplify.c. */
14938 {
14940 {
14945 }
14947 {
14952 }
14954 {
14959 }
14961 {
14964 {
14969 }
14972 {
14977 else
14979 }
14980 }
14984 {
14989 }
14990 }
14992 {
14997 }
14999 {
15004 }
15018 {
15023 }
15027 {
15032 }
15041 {
15045 {
15049 }
15051 {
15055 else
15059 }
15060 else
15062 }
15066 {
15073 else
15077 }
15080 {
15084 }
15086 {
15090 else
15094 }
15095 else
15096 {
15101 }
15109 ;
15111 {
15114 "%qE is neither a variable nor a function name in "
15117 else
15122 }
15124 {
15129 }
15131 {
15136 }
15140 {
15142 "%qE appears more than once on the same "
15145 }
15146 else
15153 {
15157 else
15162 }
15163 /* map_head bitmap is used as uniform_head if declare_simd. */
15171 {
15174 {
15179 }
15181 {
15186 }
15187 }
15198 {
15200 "%<nowait%> clause must not be used together "
15204 }
15211 {
15213 "%<order%> clause must not be used together "
15217 }
15219 {
15220 /* Silently remove duplicates. */
15223 }
15231 {
15237 }
15304 {
15306 "%<order%> clause must not be used together "
15310 }
15326 {
15328 "%<inbranch%> clause is incompatible with "
15332 }
15343 {
15348 }
15353 }
15356 {
15360 {
15364 }
15367 {
15373 {
15380 /* The __func__ variable and similar function-local
15381 predefined variables may be listed in a shared or
15382 firstprivate clause. */
15391 }
15393 {
15399 }
15403 {
15405 "%<const%> qualified %qE may appear only in "
15408 }
15409 }
15410 }
15414 else
15416 }
15419 && safelen
15422 {
15424 "%<simdlen%> clause value is bigger than "
15428 }
15431 && schedule_clause
15434 {
15436 "%<nonmonotonic%> schedule modifier specified together "
15442 }
15445 {
15447 "%qs clause specified together with %<inscan%> "
15450 }
15453 {
15455 "%qs clause specified together with %<inscan%> "
15458 }
15462 || allocate_seen
15465 {
15469 {
15474 {
15484 }
15485 /* FALLTHRU */
15496 }
15501 {
15503 "%<linear%> clause step is a parameter %qD not "
15507 }
15513 {
15524 }
15528 else
15530 }
15534 {
15539 {
15541 "%qD specified in %<allocate%> clause but not in "
15544 }
15547 else
15549 }
15552 {
15554 "%<nogroup%> clause must not be used together with "
15557 }
15560 {
15562 {
15564 "%<detach%> clause must not be used together with "
15567 }
15568 else
15569 {
15573 {
15580 {
15582 "the event handle of a %<detach%> clause "
15585 }
15588 else
15590 }
15591 }
15592 }
15596 }
15598 /* Return code to initialize DST with a copy constructor from SRC.
15599 C doesn't have copy constructors nor assignment operators, only for
15600 _Atomic vars we need to perform __atomic_load from src into a temporary
15601 followed by __atomic_store of the temporary to dst. */
15603 tree
15605 {
15620 /* Expansion of a generic atomic load may require an addition
15621 element, so allocate enough to prevent a resize. */
15624 /* Build __atomic_load (&src, &tmp, SEQ_CST); */
15633 /* Build __atomic_store (&dst, &tmp, SEQ_CST); */
15640 }
15642 /* Create a transaction node. */
15644 tree
15646 {
15653 }
15655 /* Make a variant type in the proper way for C/C++, propagating qualifiers
15656 down to the element type of an array. If ORIG_QUAL_TYPE is not
15657 NULL, then it should be used as the qualified type
15658 ORIG_QUAL_INDIRECT levels down in array type derivation (to
15659 preserve information about the typedef name from which an array
15660 type was derived). */
15662 tree
15665 {
15670 {
15671 tree t;
15676 /* See if we already have an identically qualified type. */
15679 else
15681 {
15688 }
15690 {
15701 {
15702 tree unqualified_canon
15707 {
15708 unqualified_canon
15711 }
15714 }
15715 else
15717 }
15719 }
15721 /* A restrict-qualified pointer type must be a pointer to object or
15722 incomplete type. Note that the use of POINTER_TYPE_P also allows
15723 REFERENCE_TYPEs, which is appropriate for C++. */
15727 {
15730 }
15733 ? orig_qual_type
15735 /* A variant type does not inherit the list of incomplete vars from the
15736 type main variant. */
15742 }
15744 /* Build a VA_ARG_EXPR for the C parser. */
15746 tree
15748 {
15751 /* VA_ARG_EXPR cannot be used for a scalar va_list with reverse storage
15752 order because it takes the address of the expression. */
15755 {
15758 }
15760 {
15764 }
15769 }
15771 /* Return truthvalue of whether T1 is the same tree structure as T2.
15772 Return 1 if they are the same. Return false if they are different. */
15774 bool
15776 {
15795 /* They might have become equal now. */
15803 {
15827 /* We need to do this when determining whether or not two
15828 non-type pointer to member function template arguments
15829 are the same. */
15833 {
15837 {
15842 }
15843 }
15857 {
15872 }
15875 {
15879 /* Special case: if either target is an unallocated VAR_DECL,
15880 it means that it's going to be unified with whatever the
15881 TARGET_EXPR is really supposed to initialize, so treat it
15882 as being equivalent to anything. */
15893 }
15910 {
15919 }
15923 }
15926 {
15934 {
15938 {
15950 }
15961 }
15967 }
15968 /* We can get here with --disable-checking. */
15970 }
15972 /* Returns true when the function declaration FNDECL is implicit,
15973 introduced as a result of a call to an otherwise undeclared
15974 function, and false otherwise. */
15976 bool
15978 {
15980 }