| blob | fb5c288b54988d7038cc46dc14e2dfb6a177446a |
1 /* Build expressions with type checking for C compiler.
2 Copyright (C) 1987-2020 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. */
748 /* Save time if the two types are the same. */
762 /* When one operand is a decimal float type, the other operand cannot be
763 a generic float type or a complex type. We also disallow vector types
764 here. */
767 {
769 {
772 }
774 {
777 }
779 {
783 }
784 }
786 /* If one type is a vector type, return that type. (How the usual
787 arithmetic conversions apply to the vector types extension is not
788 precisely specified.) */
795 /* If one type is complex, form the common type of the non-complex
796 components, then make that complex. Use T1 or T2 if it is the
797 required type. */
799 {
808 else
810 }
812 /* If only one is real, use it as the result. */
820 /* If both are real and either are decimal floating point types, use
821 the decimal floating point type with the greater precision. */
824 {
834 }
836 /* Deal with fixed-point types. */
838 {
846 /* If one input type is saturating, the result type is saturating. */
850 /* If both fixed-point types are unsigned, the result type is unsigned.
851 When mixing fixed-point and integer types, follow the sign of the
852 fixed-point type.
853 Otherwise, the result type is signed. */
862 /* The result type is signed. */
864 {
865 /* If the input type is unsigned, we need to convert to the
866 signed type. */
868 {
874 else
878 }
880 {
886 else
890 }
891 }
894 {
897 }
898 else
899 {
901 /* Signed integers need to subtract one sign bit. */
903 }
906 {
909 }
910 else
911 {
913 /* Signed integers need to subtract one sign bit. */
915 }
920 satp);
921 }
923 /* Both real or both integers; use the one with greater precision. */
930 /* Same precision. Prefer long longs to longs to ints when the
931 same precision, following the C99 rules on integer type rank
932 (which are equivalent to the C90 rules for C90 types). */
940 {
943 else
945 }
953 {
954 /* But preserve unsignedness from the other type,
955 since long cannot hold all the values of an unsigned int. */
958 else
960 }
962 /* For floating types of the same TYPE_PRECISION (which we here
963 assume means either the same set of values, or sets of values
964 neither a subset of the other, with behavior being undefined in
965 the latter case), follow the rules from TS 18661-3: prefer
966 interchange types _FloatN, then standard types long double,
967 double, float, then extended types _FloatNx. For extended types,
968 check them starting with _Float128x as that seems most consistent
969 in spirit with preferring long double to double; for interchange
970 types, also check in that order for consistency although it's not
971 possible for more than one of them to have the same
972 precision. */
980 /* Likewise, prefer long double to double even if same size. */
984 /* Likewise, prefer double to float even if same size.
985 We got a couple of embedded targets with 32 bit doubles, and the
986 pdp11 might have 64 bit floats. */
997 /* Otherwise prefer the unsigned one. */
1001 else
1003 }
1004 \f
1005 /* Wrapper around c_common_type that is used by c-common.c and other
1006 front end optimizations that remove promotions. ENUMERAL_TYPEs
1007 are allowed here and are converted to their compatible integer types.
1008 BOOLEAN_TYPEs are allowed here and return either boolean_type_node or
1009 preferably a non-Boolean type as the common type. */
1010 tree
1012 {
1018 /* If both types are BOOLEAN_TYPE, then return boolean_type_node. */
1023 /* If either type is BOOLEAN_TYPE, then return the other. */
1030 }
1032 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
1033 or various other operations. Return 2 if they are compatible
1034 but a warning may be needed if you use them together. */
1036 int
1038 {
1046 }
1048 /* Like comptypes, but if it returns non-zero because enum and int are
1049 compatible, it sets *ENUM_AND_INT_P to true. */
1051 static int
1053 {
1061 }
1063 /* Like comptypes, but if it returns nonzero for different types, it
1064 sets *DIFFERENT_TYPES_P to true. */
1066 int
1069 {
1077 }
1078 \f
1079 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
1080 or various other operations. Return 2 if they are compatible
1081 but a warning may be needed if you use them together. If
1082 ENUM_AND_INT_P is not NULL, and one type is an enum and the other a
1083 compatible integer type, then this sets *ENUM_AND_INT_P to true;
1084 *ENUM_AND_INT_P is never set to false. If DIFFERENT_TYPES_P is not
1085 NULL, and the types are compatible but different enough not to be
1086 permitted in C11 typedef redeclarations, then this sets
1087 *DIFFERENT_TYPES_P to true; *DIFFERENT_TYPES_P is never set to
1088 false, but may or may not be set if the types are incompatible.
1089 This differs from comptypes, in that we don't free the seen
1090 types. */
1092 static int
1095 {
1100 /* Suppress errors caused by previously reported errors. */
1106 /* Enumerated types are compatible with integer types, but this is
1107 not transitive: two enumerated types in the same translation unit
1108 are compatible with each other only if they are the same type. */
1111 {
1114 {
1119 }
1120 }
1122 {
1125 {
1130 }
1131 }
1136 /* Different classes of types can't be compatible. */
1141 /* Qualifiers must match. C99 6.7.3p9 */
1146 /* Allow for two different type nodes which have essentially the same
1147 definition. Note that we already checked for equality of the type
1148 qualifiers (just above). */
1154 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1158 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1162 {
1166 /* With these nodes, we can't determine type equivalence by
1167 looking at what is stored in the nodes themselves, because
1168 two nodes might have different TYPE_MAIN_VARIANTs but still
1169 represent the same type. For example, wchar_t and int could
1170 have the same properties (TYPE_PRECISION, TYPE_MIN_VALUE,
1171 TYPE_MAX_VALUE, etc.), but have different TYPE_MAIN_VARIANTs
1172 and are distinct types. On the other hand, int and the
1173 following typedef
1175 typedef int INT __attribute((may_alias));
1177 have identical properties, different TYPE_MAIN_VARIANTs, but
1178 represent the same type. The canonical type system keeps
1179 track of equivalence in this case, so we fall back on it. */
1183 /* Do not remove mode information. */
1193 different_types_p);
1197 {
1204 /* Target types must match incl. qualifiers. */
1207 enum_and_int_p,
1214 /* Sizes must match unless one is missing or variable. */
1221 d1_variable = (!d1_zero
1224 d2_variable = (!d2_zero
1243 }
1249 {
1259 different_types_p);
1261 different_types_p);
1262 }
1273 }
1275 }
1277 /* Return 1 if TTL and TTR are pointers to types that are equivalent, ignoring
1278 their qualifiers, except for named address spaces. If the pointers point to
1279 different named addresses, then we must determine if one address space is a
1280 subset of the other. */
1282 static int
1284 {
1291 addr_space_t as_common;
1294 /* Fail if pointers point to incompatible address spaces. */
1298 /* For pedantic record result of comptypes on arrays before losing
1299 qualifiers on the element type below. */
1306 /* Qualifiers on element types of array types that are
1307 pointer targets are lost by taking their TYPE_MAIN_VARIANT. */
1332 }
1333 \f
1334 /* Subroutines of `comptypes'. */
1336 /* Determine whether two trees derive from the same translation unit.
1337 If the CONTEXT chain ends in a null, that tree's context is still
1338 being parsed, so if two trees have context chains ending in null,
1339 they're in the same translation unit. */
1341 bool
1343 {
1346 {
1354 }
1358 {
1366 }
1369 }
1371 /* Allocate the seen two types, assuming that they are compatible. */
1375 {
1383 /* The C standard says that two structures in different translation
1384 units are compatible with each other only if the types of their
1385 fields are compatible (among other things). We assume that they
1386 are compatible until proven otherwise when building the cache.
1387 An example where this can occur is:
1388 struct a
1389 {
1390 struct a *next;
1391 };
1392 If we are comparing this against a similar struct in another TU,
1393 and did not assume they were compatible, we end up with an infinite
1394 loop. */
1397 }
1399 /* Free the seen types until we get to TU_TIL. */
1401 static void
1403 {
1406 {
1411 }
1413 }
1415 /* Return 1 if two 'struct', 'union', or 'enum' types T1 and T2 are
1416 compatible. If the two types are not the same (which has been
1417 checked earlier), this can only happen when multiple translation
1418 units are being compiled. See C99 6.2.7 paragraph 1 for the exact
1419 rules. ENUM_AND_INT_P and DIFFERENT_TYPES_P are as in
1420 comptypes_internal. */
1422 static int
1425 {
1429 /* We have to verify that the tags of the types are the same. This
1430 is harder than it looks because this may be a typedef, so we have
1431 to go look at the original type. It may even be a typedef of a
1432 typedef...
1433 In the case of compiler-created builtin structs the TYPE_DECL
1434 may be a dummy, with no DECL_ORIGINAL_TYPE. Don't fault. */
1445 /* C90 didn't have the requirement that the two tags be the same. */
1449 /* C90 didn't say what happened if one or both of the types were
1450 incomplete; we choose to follow C99 rules here, which is that they
1451 are compatible. */
1456 {
1461 }
1464 {
1466 {
1468 /* Speed up the case where the type values are in the same order. */
1473 {
1475 }
1478 {
1482 {
1485 }
1486 }
1489 {
1491 }
1493 {
1496 }
1499 {
1502 }
1505 {
1509 {
1512 }
1513 }
1515 }
1518 {
1521 {
1524 }
1526 /* Speed up the common case where the fields are in the same order. */
1529 {
1540 {
1543 }
1550 {
1553 }
1554 }
1556 {
1559 }
1562 {
1567 {
1571 enum_and_int_p,
1572 different_types_p);
1577 {
1580 }
1591 }
1593 {
1596 }
1597 }
1600 }
1603 {
1609 {
1625 }
1628 else
1631 }
1635 }
1636 }
1638 /* Return 1 if two function types F1 and F2 are compatible.
1639 If either type specifies no argument types,
1640 the other must specify a fixed number of self-promoting arg types.
1641 Otherwise, if one type specifies only the number of arguments,
1642 the other must specify that number of self-promoting arg types.
1643 Otherwise, the argument types must match.
1644 ENUM_AND_INT_P and DIFFERENT_TYPES_P are as in comptypes_internal. */
1646 static int
1649 {
1651 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1659 /* 'volatile' qualifiers on a function's return type used to mean
1660 the function is noreturn. */
1680 /* An unspecified parmlist matches any specified parmlist
1681 whose argument types don't need default promotions. */
1684 {
1687 /* If one of these types comes from a non-prototype fn definition,
1688 compare that with the other type's arglist.
1689 If they don't match, ask for a warning (but no error). */
1695 }
1697 {
1705 }
1707 /* Both types have argument lists: compare them and propagate results. */
1709 different_types_p);
1711 }
1713 /* Check two lists of types for compatibility, returning 0 for
1714 incompatible, 1 for compatible, or 2 for compatible with
1715 warning. ENUM_AND_INT_P and DIFFERENT_TYPES_P are as in
1716 comptypes_internal. */
1718 static int
1721 {
1722 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1727 {
1731 /* If one list is shorter than the other,
1732 they fail to match. */
1740 TYPE_QUAL_ATOMIC)
1745 TYPE_QUAL_ATOMIC)
1747 /* A null pointer instead of a type
1748 means there is supposed to be an argument
1749 but nothing is specified about what type it has.
1750 So match anything that self-promotes. */
1755 {
1758 }
1760 {
1763 }
1764 /* If one of the lists has an error marker, ignore this arg. */
1767 ;
1769 different_types_p)))
1770 {
1773 /* Allow wait (union {union wait *u; int *i} *)
1774 and wait (union wait *) to be compatible. */
1781 {
1782 tree memb;
1785 {
1791 TYPE_QUAL_ATOMIC)
1794 different_types_p))
1796 }
1799 }
1806 {
1807 tree memb;
1810 {
1816 TYPE_QUAL_ATOMIC)
1819 different_types_p))
1821 }
1824 }
1825 else
1827 }
1829 /* comptypes said ok, but record if it said to warn. */
1835 }
1836 }
1837 \f
1838 /* Compute the size to increment a pointer by. When a function type or void
1839 type or incomplete type is passed, size_one_node is returned.
1840 This function does not emit any diagnostics; the caller is responsible
1841 for that. */
1843 static tree
1845 {
1852 /* Convert in case a char is more than one unit. */
1856 }
1857 \f
1858 /* Return either DECL or its known constant value (if it has one). */
1860 tree
1862 {
1869 /* This is invalid if initial value is not constant.
1870 If it has either a function call, a memory reference,
1871 or a variable, then re-evaluating it could give different results. */
1873 /* Check for cases where this is sub-optimal, even though valid. */
1877 }
1879 /* Return either DECL or its known constant value (if it has one).
1880 Like the above, but always return decl outside of functions. */
1882 tree
1884 {
1885 /* Don't change a variable array bound or initial value to a constant
1886 in a place where a variable is invalid. */
1888 }
1890 /* Convert the array expression EXP to a pointer. */
1891 static tree
1893 {
1896 tree adr;
1898 tree ptrtype;
1912 /* In C++ array compound literals are temporary objects unless they are
1913 const or appear in namespace scope, so they are destroyed too soon
1914 to use them for much of anything (c++/53220). */
1916 {
1920 "converting an array compound literal to a pointer "
1922 }
1926 }
1928 /* Convert the function expression EXP to a pointer. */
1929 static tree
1931 {
1942 }
1944 /* Mark EXP as read, not just set, for set but not used -Wunused
1945 warning purposes. */
1947 void
1949 {
1951 {
1961 CASE_CONVERT:
1972 }
1973 }
1975 /* Perform the default conversion of arrays and functions to pointers.
1976 Return the result of converting EXP. For any other expression, just
1977 return EXP.
1979 LOC is the location of the expression. */
1981 struct c_expr
1983 {
1989 {
1991 {
1998 {
2002 }
2009 {
2010 /* Before C99, non-lvalue arrays do not decay to pointers.
2011 Normally, using such an array would be invalid; but it can
2012 be used correctly inside sizeof or as a statement expression.
2013 Thus, do not give an error here; an error will result later. */
2015 }
2018 }
2025 }
2028 }
2030 struct c_expr
2032 {
2035 }
2037 /* Return whether EXPR should be treated as an atomic lvalue for the
2038 purposes of load and store handling. */
2040 static bool
2042 {
2050 /* Ignore _Atomic on register variables, since their addresses can't
2051 be taken so (a) atomicity is irrelevant and (b) the normal atomic
2052 sequences wouldn't work. Ignore _Atomic on structures containing
2053 bit-fields, since accessing elements of atomic structures or
2054 unions is undefined behavior (C11 6.5.2.3#5), but it's unclear if
2055 it's undefined at translation time or execution time, and the
2056 normal atomic sequences again wouldn't work. */
2058 {
2063 }
2067 }
2069 /* Convert expression EXP (location LOC) from lvalue to rvalue,
2070 including converting functions and arrays to pointers if CONVERT_P.
2071 If READ_P, also mark the expression as having been read. */
2073 struct c_expr
2076 {
2084 {
2093 /* Expansion of a generic atomic load may require an addition
2094 element, so allocate enough to prevent a resize. */
2097 /* Remove the qualifiers for the rest of the expressions and
2098 create the VAL temp variable to hold the RHS. */
2105 /* Issue __atomic_load (&expr, &tmp, SEQ_CST); */
2112 /* EXPR is always read. */
2115 /* Return tmp which contains the value loaded. */
2118 }
2120 }
2122 /* EXP is an expression of integer type. Apply the integer promotions
2123 to it and return the promoted value. */
2125 tree
2127 {
2133 /* Normally convert enums to int,
2134 but convert wide enums to something wider. */
2136 {
2144 }
2146 /* ??? This should no longer be needed now bit-fields have their
2147 proper types. */
2150 /* If it's thinner than an int, promote it like a
2151 c_promoting_integer_type_p, otherwise leave it alone. */
2157 {
2158 /* Preserve unsignedness if not really getting any wider. */
2164 }
2167 }
2170 /* Perform default promotions for C data used in expressions.
2171 Enumeral types or short or char are converted to int.
2172 In addition, manifest constants symbols are replaced by their values. */
2174 tree
2176 {
2177 tree orig_exp;
2180 tree promoted_type;
2184 /* Functions and arrays have been converted during parsing. */
2189 /* Constants can be used directly unless they're not loadable. */
2193 /* Strip no-op conversions. */
2201 {
2205 }
2219 }
2220 \f
2221 /* Look up COMPONENT in a structure or union TYPE.
2223 If the component name is not found, returns NULL_TREE. Otherwise,
2224 the return value is a TREE_LIST, with each TREE_VALUE a FIELD_DECL
2225 stepping down the chain to the component, which is in the last
2226 TREE_VALUE of the list. Normally the list is of length one, but if
2227 the component is embedded within (nested) anonymous structures or
2228 unions, the list steps down the chain to the component. */
2230 static tree
2232 {
2233 tree field;
2235 /* If TYPE_LANG_SPECIFIC is set, then it is a sorted array of pointers
2236 to the field elements. Use a binary search on this array to quickly
2237 find the element. Otherwise, do a linear search. TYPE_LANG_SPECIFIC
2238 will always be set for structures which have many elements.
2240 Duplicate field checking replaces duplicates with NULL_TREE so
2241 TYPE_LANG_SPECIFIC arrays are potentially no longer sorted. In that
2242 case just iterate using DECL_CHAIN. */
2246 {
2254 {
2259 {
2260 /* Step through all anon unions in linear fashion. */
2262 {
2265 {
2271 /* The Plan 9 compiler permits referring
2272 directly to an anonymous struct/union field
2273 using a typedef name. */
2281 }
2282 }
2284 /* Entire record is only anon unions. */
2288 /* Restart the binary search, with new lower bound. */
2290 }
2296 else
2298 }
2304 }
2305 else
2306 {
2308 {
2311 {
2317 /* The Plan 9 compiler permits referring directly to an
2318 anonymous struct/union field using a typedef
2319 name. */
2326 }
2330 }
2334 }
2337 }
2339 /* Recursively append candidate IDENTIFIER_NODEs to CANDIDATES. */
2341 static void
2344 {
2345 tree field;
2347 {
2351 candidates);
2355 }
2356 }
2358 /* Like "lookup_field", but find the closest matching IDENTIFIER_NODE,
2359 rather than returning a TREE_LIST for an exact match. */
2361 static tree
2363 {
2366 /* First, gather a list of candidates. */
2373 }
2375 /* Support function for build_component_ref's error-handling.
2377 Given DATUM_TYPE, and "DATUM.COMPONENT", where DATUM is *not* a
2378 struct or union, should we suggest "DATUM->COMPONENT" as a hint? */
2380 static bool
2382 {
2383 /* We don't do it for Objective-C, since Objective-C 2.0 dot-syntax
2384 allows "." for ptrs; we could be handling a failed attempt
2385 to access a property. */
2389 /* Only suggest it for pointers... */
2393 /* ...to structs/unions. */
2398 else
2400 }
2402 /* Make an expression to refer to the COMPONENT field of structure or
2403 union value DATUM. COMPONENT is an IDENTIFIER_NODE. LOC is the
2404 location of the COMPONENT_REF. COMPONENT_LOC is the location
2405 of COMPONENT. */
2407 tree
2409 location_t component_loc)
2410 {
2414 tree ref;
2420 /* Detect Objective-C property syntax object.property. */
2425 /* See if there is a field or component with name COMPONENT. */
2428 {
2430 {
2433 }
2438 {
2441 {
2442 /* Attempt to provide a fixit replacement hint, if
2443 we have a valid range for the component. */
2444 location_t reported_loc
2452 }
2453 else
2456 }
2458 /* Accessing elements of atomic structures or unions is undefined
2459 behavior (C11 6.5.2.3#5). */
2461 {
2465 else
2468 }
2470 /* Chain the COMPONENT_REFs if necessary down to the FIELD.
2471 This might be better solved in future the way the C++ front
2472 end does it - by giving the anonymous entities each a
2473 separate name and type, and then have build_component_ref
2474 recursively call itself. We can't do that here. */
2475 do
2476 {
2479 tree subtype;
2485 /* If this is an rvalue, it does not have qualifiers in C
2486 standard terms and we must avoid propagating such
2487 qualifiers down to a non-lvalue array that is then
2488 converted to a pointer. */
2489 use_datum_quals = (datum_lvalue
2498 NULL_TREE);
2513 }
2517 }
2519 {
2520 /* Special-case the error message for "ptr.field" for the case
2521 where the user has confused "." vs "->". */
2523 /* "loc" should be the "." token. */
2527 datum);
2529 }
2533 component);
2536 }
2537 \f
2538 /* Given an expression PTR for a pointer, return an expression
2539 for the value pointed to.
2540 ERRORSTRING is the name of the operator to appear in error messages.
2542 LOC is the location to use for the generated tree. */
2544 tree
2546 {
2549 tree ref;
2552 {
2555 {
2556 /* If a warning is issued, mark it to avoid duplicates from
2557 the backend. This only needs to be done at
2558 warn_strict_aliasing > 2. */
2563 }
2568 {
2572 }
2573 else
2574 {
2582 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
2583 so that we get the proper error message if the result is used
2584 to assign to. Also, &* is supposed to be a no-op.
2585 And ANSI C seems to specify that the type of the result
2586 should be the const type. */
2587 /* A de-reference of a pointer to const is not a const. It is valid
2588 to change it via some other pointer. */
2595 }
2596 }
2601 }
2603 /* This handles expressions of the form "a[i]", which denotes
2604 an array reference.
2606 This is logically equivalent in C to *(a+i), but we may do it differently.
2607 If A is a variable or a member, we generate a primitive ARRAY_REF.
2608 This avoids forcing the array out of registers, and can work on
2609 arrays that are not lvalues (for example, members of structures returned
2610 by functions).
2612 For vector types, allow vector[i] but not i[vector], and create
2613 *(((type*)&vectortype) + i) for the expression.
2615 LOC is the location to use for the returned expression. */
2617 tree
2619 {
2620 tree ret;
2628 /* Allow vector[index] but not index[vector]. */
2630 {
2633 {
2638 }
2641 }
2644 {
2647 }
2650 {
2653 }
2655 /* ??? Existing practice has been to warn only when the char
2656 index is syntactically the index, not for char[array]. */
2660 /* Apply default promotions *after* noticing character types. */
2671 {
2674 /* An array that is indexed by a non-constant
2675 cannot be stored in a register; we must be able to do
2676 address arithmetic on its address.
2677 Likewise an array of elements of variable size. */
2681 {
2684 }
2685 /* An array that is indexed by a constant value which is not within
2686 the array bounds cannot be stored in a register either; because we
2687 would get a crash in store_bit_field/extract_bit_field when trying
2688 to access a non-existent part of the register. */
2692 {
2695 }
2699 {
2708 "ISO C90 forbids subscripting non-lvalue "
2710 }
2714 /* Array ref is const/volatile if the array elements are
2715 or if the array is. */
2724 /* This was added by rms on 16 Nov 91.
2725 It fixes vol struct foo *a; a->elts[1]
2726 in an inline function.
2727 Hope it doesn't break something else. */
2734 }
2735 else
2736 {
2747 RO_ARRAY_INDEXING);
2751 }
2752 }
2753 \f
2754 /* Build an external reference to identifier ID. FUN indicates
2755 whether this will be used for a function call. LOC is the source
2756 location of the identifier. This sets *TYPE to the type of the
2757 identifier, which is not the same as the type of the returned value
2758 for CONST_DECLs defined as enum constants. If the type of the
2759 identifier is not available, *TYPE is set to NULL. */
2760 tree
2762 {
2763 tree ref;
2766 /* In Objective-C, an instance variable (ivar) may be preferred to
2767 whatever lookup_name() found. */
2772 {
2775 }
2777 /* Implicit function declaration. */
2780 /* Don't complain about something that's already been
2781 complained about. */
2783 else
2784 {
2787 }
2795 /* Recursive call does not count as usage. */
2797 {
2799 }
2802 {
2809 }
2812 {
2818 {
2823 }
2827 }
2832 {
2837 }
2838 /* C99 6.7.4p3: An inline definition of a function with external
2839 linkage ... shall not contain a reference to an identifier with
2840 internal linkage. */
2849 csi_internal);
2852 }
2854 /* Record details of decls possibly used inside sizeof or typeof. */
2855 struct maybe_used_decl
2856 {
2857 /* The decl. */
2858 tree decl;
2859 /* The level seen at (in_sizeof + in_typeof). */
2861 /* The next one at this level or above, or NULL. */
2863 };
2867 /* Record that DECL, an undefined static function reference seen
2868 inside sizeof or typeof, might be used if the operand of sizeof is
2869 a VLA type or the operand of typeof is a variably modified
2870 type. */
2872 static void
2874 {
2880 }
2882 /* Pop the stack of decls possibly used inside sizeof or typeof. If
2883 USED is false, just discard them. If it is true, mark them used
2884 (if no longer inside sizeof or typeof) or move them to the next
2885 level up (if still inside sizeof or typeof). */
2887 void
2889 {
2893 {
2895 {
2898 else
2900 }
2902 }
2905 }
2907 /* Return the result of sizeof applied to EXPR. */
2909 struct c_expr
2911 {
2914 {
2919 }
2920 else
2921 {
2926 {
2927 auto_diagnostic_group d;
2929 "%<sizeof%> on array function parameter %qE will "
2933 }
2942 {
2943 /* sizeof is evaluated when given a vla (C99 6.5.3.4p2). */
2948 }
2950 }
2952 }
2954 /* Return the result of sizeof applied to T, a structure for the type
2955 name passed to sizeof (rather than the type itself). LOC is the
2956 location of the original expression. */
2958 struct c_expr
2960 {
2961 tree type;
2973 {
2974 /* If the type is a [*] array, it is a VLA but is represented as
2975 having a size of zero. In such a case we must ensure that
2976 the result of sizeof does not get folded to a constant by
2977 c_fully_fold, because if the size is evaluated the result is
2978 not constant and so constraints on zero or negative size
2979 arrays must not be applied when this sizeof call is inside
2980 another array declarator. */
2986 }
2990 }
2992 /* Build a function call to function FUNCTION with parameters PARAMS.
2993 The function call is at LOC.
2994 PARAMS is a list--a chain of TREE_LIST nodes--in which the
2995 TREE_VALUE of each node is a parameter-expression.
2996 FUNCTION's data type may be a function type or a pointer-to-function. */
2998 tree
3000 {
3002 tree ret;
3010 }
3012 /* Give a note about the location of the declaration of DECL. */
3014 static void
3016 {
3019 }
3021 /* Build a function call to function FUNCTION with parameters PARAMS.
3022 If FUNCTION is the result of resolving an overloaded target built-in,
3023 ORIG_FUNDECL is the original function decl, otherwise it is null.
3024 ORIGTYPES, if not NULL, is a vector of types; each element is
3025 either NULL or the original type of the corresponding element in
3026 PARAMS. The original type may differ from TREE_TYPE of the
3027 parameter for enums. FUNCTION's data type may be a function type
3028 or pointer-to-function. This function changes the elements of
3029 PARAMS. */
3031 tree
3035 {
3038 tree tem;
3043 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
3046 /* Convert anything with function type to a pointer-to-function. */
3048 {
3056 /* Atomic functions have type checking/casting already done. They are
3057 often rewritten and don't match the original parameter list. */
3060 }
3064 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
3065 expressions, like those used for ObjC messenger dispatches. */
3078 {
3082 function);
3084 {
3087 function);
3089 }
3090 else
3094 }
3099 /* fntype now gets the type of function pointed to. */
3102 /* Convert the parameters to the types declared in the
3103 function prototype, or apply default promotions. */
3110 /* Check that the function is called through a compatible prototype.
3111 If it is not, warn. */
3116 {
3119 /* This situation leads to run-time undefined behavior. We can't,
3120 therefore, simply error unless we can prove that all possible
3121 executions of the program must execute the code. */
3128 }
3132 /* Check that arguments to builtin functions match the expectations. */
3139 /* Check that the arguments to the function are valid. */
3145 {
3147 result
3150 else
3156 }
3157 else
3160 /* If -Wnonnull warning has been diagnosed, avoid diagnosing it again
3161 later. */
3165 /* In this improbable scenario, a nested function returns a VM type.
3166 Create a TARGET_EXPR so that the call always has a LHS, much as
3167 what the C++ FE does for functions returning non-PODs. */
3169 {
3173 }
3176 {
3181 }
3183 }
3185 /* Like build_function_call_vec, but call also resolve_overloaded_builtin. */
3187 tree
3191 {
3192 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
3195 /* Convert anything with function type to a pointer-to-function. */
3197 {
3198 /* Implement type-directed function overloading for builtins.
3199 resolve_overloaded_builtin and targetm.resolve_overloaded_builtin
3200 handle all the type checking. The result is a complete expression
3201 that implements this function call. */
3205 }
3207 }
3208 \f
3209 /* Helper for convert_arguments called to convert the VALue of argument
3210 number ARGNUM from ORIGTYPE to the corresponding parameter number
3211 PARMNUM and TYPE.
3212 PLOC is the location where the conversion is being performed.
3213 FUNCTION and FUNDECL are the same as in convert_arguments.
3214 VALTYPE is the original type of VAL before the conversion and,
3215 for EXCESS_PRECISION_EXPR, the operand of the expression.
3216 NPC is true if VAL represents the null pointer constant (VAL itself
3217 will have been folded to an integer constant).
3218 RNAME is the same as FUNCTION except in Objective C when it's
3219 the function selector.
3220 EXCESS_PRECISION is true when VAL was originally represented
3221 as EXCESS_PRECISION_EXPR.
3222 WARNOPT is the same as in convert_for_assignment. */
3224 static tree
3229 {
3230 /* Formal parm type is specified by a function prototype. */
3233 {
3237 }
3239 /* Optionally warn about conversions that differ from the default
3240 conversions. */
3242 {
3248 "passing argument %d of %qE as integer rather "
3254 "passing argument %d of %qE as integer rather "
3260 "passing argument %d of %qE as complex rather "
3266 "passing argument %d of %qE as floating rather "
3272 "passing argument %d of %qE as complex rather "
3278 "passing argument %d of %qE as floating rather "
3281 /* ??? At some point, messages should be written about
3282 conversions between complex types, but that's too messy
3283 to do now. */
3286 {
3287 /* Warn if any argument is passed as `float',
3288 since without a prototype it would be `double'. */
3292 "passing argument %d of %qE as %<float%> "
3296 /* Warn if mismatch between argument and prototype
3297 for decimal float types. Warn of conversions with
3298 binary float types and of precision narrowing due to
3299 prototype. */
3307 && (formal_prec
3310 && (valtype
3311 != dfloat64_type_node
3312 && (valtype
3315 && (valtype
3318 "passing argument %d of %qE as %qT "
3322 }
3323 /* Detect integer changing in width or signedness.
3324 These warnings are only activated with
3325 -Wtraditional-conversion, not with -Wtraditional. */
3329 {
3338 /* No warning if function asks for enum
3339 and the actual arg is that enum type. */
3340 ;
3343 "passing argument %d of %qE "
3347 ;
3348 /* Don't complain if the formal parameter type
3349 is an enum, because we can't tell now whether
3350 the value was an enum--even the same enum. */
3352 ;
3355 /* Change in signedness doesn't matter
3356 if a constant value is unaffected. */
3357 ;
3358 /* If the value is extended from a narrower
3359 unsigned type, it doesn't matter whether we
3360 pass it as signed or unsigned; the value
3361 certainly is the same either way. */
3364 ;
3367 "passing argument %d of %qE "
3370 else
3372 "passing argument %d of %qE "
3375 }
3376 }
3378 /* Possibly restore an EXCESS_PRECISION_EXPR for the
3379 sake of better warnings from convert_and_check. */
3394 }
3396 /* Convert the argument expressions in the vector VALUES
3397 to the types in the list TYPELIST.
3399 If TYPELIST is exhausted, or when an element has NULL as its type,
3400 perform the default conversions.
3402 ORIGTYPES is the original types of the expressions in VALUES. This
3403 holds the type of enum values which have been converted to integral
3404 types. It may be NULL.
3406 FUNCTION is a tree for the called function. It is used only for
3407 error messages, where it is formatted with %qE.
3409 This is also where warnings about wrong number of args are generated.
3411 ARG_LOC are locations of function arguments (if any).
3413 Returns the actual number of arguments processed (which may be less
3414 than the length of VALUES in some error situations), or -1 on
3415 failure. */
3417 static int
3421 {
3428 tree selector;
3430 /* Change pointer to function to the function itself for
3431 diagnostics. */
3436 /* Handle an ObjC selector specially for diagnostics. */
3439 /* For a call to a built-in function declared without a prototype,
3440 set to the built-in function's argument list. */
3443 /* For type-generic built-in functions, determine whether excess
3444 precision should be removed (classification) or not
3445 (comparison). */
3448 {
3451 {
3452 /* For a call to a built-in function declared without a prototype
3453 use the types of the parameters of the internal built-in to
3454 match those of the arguments to. */
3457 }
3459 /* For type-generic built-in functions, determine whether excess
3460 precision should be removed (classification) or not
3461 (comparison). */
3464 {
3477 /* The last argument of these type-generic builtins
3478 should not be promoted. */
3484 }
3485 }
3487 /* Scan the given expressions (VALUES) and types (TYPELIST), producing
3488 individual converted arguments. */
3496 {
3497 /* The type of the function parameter (if it was declared with one). */
3499 /* The type of the built-in function parameter (if the function
3500 is a built-in). Used to detect type incompatibilities in
3501 calls to built-ins declared without a prototype. */
3502 tree builtin_type = (builtin_typetail
3504 /* The original type of the argument being passed to the function. */
3506 /* The called function (or function selector in Objective C). */
3510 /* Set for EXCESS_PRECISION_EXPR arguments. */
3512 /* The value of the argument after conversion to the type
3513 of the function parameter it is passed to. */
3514 tree parmval;
3515 /* Some __atomic_* builtins have additional hidden argument at
3516 position 0. */
3517 location_t ploc
3523 {
3526 else
3530 }
3533 {
3535 "too many arguments to built-in function %qE "
3539 }
3542 {
3545 }
3547 /* Determine if VAL is a null pointer constant before folding it. */
3550 /* If there is excess precision and a prototype, convert once to
3551 the required type rather than converting via the semantic
3552 type. Likewise without a prototype a float value represented
3553 as long double should be converted once to double. But for
3554 type-generic classification functions excess precision must
3555 be removed here. */
3558 {
3561 }
3567 /* Some floating-point arguments must be promoted to double when
3568 no type is specified by a prototype. This applies to
3569 arguments of type float, and to architecture-specific types
3570 (ARM __fp16), but not to _FloatN or _FloatNx types. */
3579 {
3580 /* Promote this argument, unless it has a _FloatN or
3581 _FloatNx type. */
3585 {
3588 }
3589 }
3592 {
3597 }
3599 {
3602 else
3603 {
3604 /* Convert `float' to `double'. */
3607 "implicit conversion from %qT to %qT when passing "
3611 }
3612 }
3615 /* A "double" argument with excess precision being passed
3616 without a prototype or in variable arguments.
3617 The last argument of __builtin_*_overflow_p should not be
3618 promoted. */
3622 {
3625 }
3627 {
3629 }
3630 else
3631 /* Convert `short' and `char' to full-size `int'. */
3639 {
3640 /* For a call to a built-in function declared without a prototype,
3641 perform the conversions from the argument to the expected type
3642 but issue warnings rather than errors for any mismatches.
3643 Ignore the converted argument and use the PARMVAL obtained
3644 above by applying default conversions instead. */
3648 excess_precision,
3649 OPT_Wbuiltin_declaration_mismatch);
3650 }
3657 }
3662 {
3666 }
3669 {
3675 "too few arguments to built-in function %qE "
3678 }
3681 }
3682 \f
3683 /* This is the entry point used by the parser to build unary operators
3684 in the input. CODE, a tree_code, specifies the unary operator, and
3685 ARG is the operand. For unary plus, the C parser currently uses
3686 CONVERT_EXPR for code.
3688 LOC is the location to use for the tree generated.
3689 */
3691 struct c_expr
3693 {
3700 {
3702 }
3703 else
3704 {
3709 }
3711 /* We are typically called when parsing a prefix token at LOC acting on
3712 ARG. Reflect this by updating the source range of the result to
3713 start at LOC and end at the end of ARG. */
3718 }
3720 /* Returns true if TYPE is a character type, *not* including wchar_t. */
3722 static bool
3724 {
3730 }
3732 /* This is the entry point used by the parser to build binary operators
3733 in the input. CODE, a tree_code, specifies the binary operator, and
3734 ARG1 and ARG2 are the operands. In addition to constructing the
3735 expression, we check for operands that were written with other binary
3736 operators in a way that is likely to confuse the user.
3738 LOCATION is the location of the binary operator. */
3740 struct c_expr
3743 {
3761 {
3766 }
3775 /* Check for cases such as x+y<<z which users are likely
3776 to misinterpret. */
3786 {
3790 {
3794 else
3796 }
3798 {
3802 else
3804 }
3807 }
3813 /* Avoid warning for !!x == y. */
3816 {
3817 /* Avoid warning for !b == y where b has _Bool type. */
3822 {
3824 do
3825 {
3832 else
3834 }
3836 }
3839 }
3841 /* Warn about comparisons against string literals, with the exception
3842 of testing for equality or inequality of a string literal with NULL. */
3844 {
3851 /* Warn for ptr == '\0', it's likely that it should've been ptr[0]. */
3855 {
3856 auto_diagnostic_group d;
3858 "comparison between pointer and zero character "
3862 }
3866 {
3867 auto_diagnostic_group d;
3869 "comparison between pointer and zero character "
3873 }
3874 }
3885 /* Warn about comparisons of different enum types. */
3896 }
3897 \f
3898 /* Return a tree for the difference of pointers OP0 and OP1.
3899 The resulting tree has type ptrdiff_t. If POINTER_SUBTRACT sanitization is
3900 enabled, assign to INSTRUMENT_EXPR call to libsanitizer. */
3902 static tree
3904 {
3914 /* If the operands point into different address spaces, we need to
3915 explicitly convert them to pointers into the common address space
3916 before we can subtract the numerical address values. */
3918 {
3919 addr_space_t as_common;
3920 tree common_type;
3922 /* Determine the common superset address space. This is guaranteed
3923 to exist because the caller verified that comp_target_types
3924 returned non-zero. */
3931 }
3933 /* Determine integer type result of the subtraction. This will usually
3934 be the same as the result type (ptrdiff_t), but may need to be a wider
3935 type if pointers for the address space are wider than ptrdiff_t. */
3938 else
3949 {
3957 }
3959 /* First do the subtraction, then build the divide operator
3960 and only convert at the very end.
3961 Do not do default conversions in case restype is a short type. */
3963 /* POINTER_DIFF_EXPR requires a signed integer type of the same size as
3964 pointers. If some platform cannot provide that, or has a larger
3965 ptrdiff_type to support differences larger than half the address
3966 space, cast the pointers to some larger integer type and do the
3967 computations in that type. */
3971 else
3972 {
3973 /* Cast away qualifiers. */
3977 }
3979 /* This generates an error if op1 is pointer to incomplete type. */
3992 /* Divide by the size, in easiest possible way. */
3996 /* Convert to final result type if necessary. */
3998 }
3999 \f
4000 /* Expand atomic compound assignments into an appropriate sequence as
4001 specified by the C11 standard section 6.5.16.2.
4003 _Atomic T1 E1
4004 T2 E2
4005 E1 op= E2
4007 This sequence is used for all types for which these operations are
4008 supported.
4010 In addition, built-in versions of the 'fe' prefixed routines may
4011 need to be invoked for floating point (real, complex or vector) when
4012 floating-point exceptions are supported. See 6.5.16.2 footnote 113.
4014 T1 newval;
4015 T1 old;
4016 T1 *addr
4017 T2 val
4018 fenv_t fenv
4020 addr = &E1;
4021 val = (E2);
4022 __atomic_load (addr, &old, SEQ_CST);
4023 feholdexcept (&fenv);
4024 loop:
4025 newval = old op val;
4026 if (__atomic_compare_exchange_strong (addr, &old, &newval, SEQ_CST,
4027 SEQ_CST))
4028 goto done;
4029 feclearexcept (FE_ALL_EXCEPT);
4030 goto loop:
4031 done:
4032 feupdateenv (&fenv);
4034 The compiler will issue the __atomic_fetch_* built-in when possible,
4035 otherwise it will generate the generic form of the atomic operations.
4036 This requires temp(s) and has their address taken. The atomic processing
4037 is smart enough to figure out when the size of an object can utilize
4038 a lock-free version, and convert the built-in call to the appropriate
4039 lock-free routine. The optimizers will then dispose of any temps that
4040 are no longer required, and lock-free implementations are utilized as
4041 long as there is target support for the required size.
4043 If the operator is NOP_EXPR, then this is a simple assignment, and
4044 an __atomic_store is issued to perform the assignment rather than
4045 the above loop. */
4047 /* Build an atomic assignment at LOC, expanding into the proper
4048 sequence to store LHS MODIFYCODE= RHS. Return a value representing
4049 the result of the operation, unless RETURN_OLD_P, in which case
4050 return the old value of LHS (this is only for postincrement and
4051 postdecrement). */
4053 static tree
4056 {
4061 tree compound_stmt;
4069 tree nonatomic_rhs_semantic_type;
4070 tree rhs_type;
4077 /* Allocate enough vector items for a compare_exchange. */
4080 /* Create a compound statement to hold the sequence of statements
4081 with a loop. */
4084 /* Remove any excess precision (which is only present here in the
4085 case of compound assignments). */
4087 {
4090 }
4093 /* Fold the RHS if it hasn't already been folded. */
4097 /* Remove the qualifiers for the rest of the expressions and create
4098 the VAL temp variable to hold the RHS. */
4102 TYPE_UNQUALIFIED);
4107 NULL_TREE);
4111 /* NOP_EXPR indicates it's a straight store of the RHS. Simply issue
4112 an atomic_store. */
4114 {
4115 /* Build __atomic_store (&lhs, &val, SEQ_CST) */
4124 /* Finish the compound statement. */
4127 /* VAL is the value which was stored, return a COMPOUND_STMT of
4128 the statement and that value. */
4130 }
4132 /* Attempt to implement the atomic operation as an __atomic_fetch_* or
4133 __atomic_*_fetch built-in rather than a CAS loop. atomic_bool type
4134 isn't applicable for such builtins. ??? Do we want to handle enums? */
4137 {
4138 built_in_function fncode;
4140 {
4143 fncode = (return_old_p
4144 ? BUILT_IN_ATOMIC_FETCH_ADD_N
4148 fncode = (return_old_p
4149 ? BUILT_IN_ATOMIC_FETCH_SUB_N
4153 fncode = (return_old_p
4154 ? BUILT_IN_ATOMIC_FETCH_AND_N
4158 fncode = (return_old_p
4159 ? BUILT_IN_ATOMIC_FETCH_OR_N
4163 fncode = (return_old_p
4164 ? BUILT_IN_ATOMIC_FETCH_XOR_N
4169 }
4171 /* We can only use "_1" through "_16" variants of the atomic fetch
4172 built-ins. */
4177 /* If this is a pointer type, we need to multiply by the size of
4178 the pointer target type. */
4180 {
4182 /* ??? This would introduce -Wdiscarded-qualifiers
4183 warning: __atomic_fetch_* expect volatile void *
4184 type as the first argument. (Assignments between
4185 atomic and non-atomic objects are OK.) */
4192 }
4194 /* Build __atomic_fetch_* (&lhs, &val, SEQ_CST), or
4195 __atomic_*_fetch (&lhs, &val, SEQ_CST). */
4210 /* Finish the compound statement. */
4213 /* NEWVAL is the value which was stored, return a COMPOUND_STMT of
4214 the statement and that value. */
4216 }
4218 cas_loop:
4219 /* Create the variables and labels required for the op= form. */
4236 /* __atomic_load (addr, &old, SEQ_CST). */
4243 NULL_TREE);
4247 /* Create the expressions for floating-point environment
4248 manipulation, if required. */
4258 /* loop: */
4261 /* newval = old + val; */
4266 {
4270 }
4271 else
4277 {
4279 NULL_TREE);
4282 }
4284 /* if (__atomic_compare_exchange (addr, &old, &new, false, SEQ_CST, SEQ_CST))
4285 goto done; */
4305 /* goto loop; */
4310 /* done: */
4316 /* Finish the compound statement. */
4319 /* NEWVAL is the value that was successfully stored, return a
4320 COMPOUND_EXPR of the statement and the appropriate value. */
4323 }
4325 /* Construct and perhaps optimize a tree representation
4326 for a unary operation. CODE, a tree_code, specifies the operation
4327 and XARG is the operand.
4328 For any CODE other than ADDR_EXPR, NOCONVERT suppresses the default
4329 promotions (such as from short to int).
4330 For ADDR_EXPR, the default promotions are not applied; NOCONVERT allows
4331 non-lvalues; this is only used to handle conversion of non-lvalue arrays
4332 to pointers in C99.
4334 LOCATION is the location of the operator. */
4336 tree
4339 {
4340 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
4344 tree val;
4365 {
4368 }
4371 {
4374 }
4377 {
4379 /* This is used for unary plus, because a CONVERT_EXPR
4380 is enough to prevent anybody from looking inside for
4381 associativity, but won't generate any code. */
4385 {
4388 }
4398 {
4401 }
4407 /* ~ works on integer types and non float vectors. */
4411 {
4414 /* Warn if the expression has boolean value. */
4420 {
4421 auto_diagnostic_group d;
4424 {
4428 }
4429 }
4432 }
4434 {
4440 }
4441 else
4442 {
4445 }
4450 {
4453 }
4460 {
4463 }
4469 /* Conjugating a real value is a no-op, but allow it anyway. */
4472 {
4475 }
4484 {
4488 }
4490 {
4493 }
4494 else
4497 /* If the TRUTH_NOT_EXPR has been folded, reset the location. */
4517 {
4520 noconvert);
4528 }
4530 /* Complain about anything that is not a true lvalue. In
4531 Objective-C, skip this check for property_refs. */
4536 ? lv_increment
4541 {
4545 else
4548 }
4551 {
4555 else
4558 }
4560 /* Ensure the argument is fully folded inside any SAVE_EXPR. */
4566 /* Increment or decrement the real part of the value,
4567 and don't change the imaginary part. */
4569 {
4576 {
4588 }
4589 }
4591 /* Report invalid types. */
4597 {
4600 else
4604 }
4606 {
4607 tree inc;
4611 /* Compute the increment. */
4614 {
4615 /* If pointer target is an incomplete type,
4616 we just cannot know how to do the arithmetic. */
4618 {
4623 else
4627 }
4630 {
4634 else
4637 }
4638 else
4644 }
4646 {
4647 /* For signed fract types, we invert ++ to -- or
4648 -- to ++, and change inc from 1 to -1, because
4649 it is not possible to represent 1 in signed fract constants.
4650 For unsigned fract types, the result always overflows and
4651 we get an undefined (original) or the maximum value. */
4663 }
4664 else
4665 {
4670 }
4672 /* If 'arg' is an Objective-C PROPERTY_REF expression, then we
4673 need to ask Objective-C to build the increment or decrement
4674 expression for it. */
4679 /* Report a read-only lvalue. */
4681 {
4687 }
4694 /* If the argument is atomic, use the special code sequences for
4695 atomic compound assignment. */
4697 {
4702 ? PLUS_EXPR
4705 ? inc
4710 }
4714 else
4721 }
4724 /* Note that this operation never does default_conversion. */
4726 /* The operand of unary '&' must be an lvalue (which excludes
4727 expressions of type void), or, in C99, the result of a [] or
4728 unary '*' operator. */
4734 /* Let &* cancel out to simplify resulting code. */
4736 {
4737 /* Don't let this be an lvalue. */
4742 }
4744 /* Anything not already handled and not a true memory reference
4745 or a non-lvalue array is an error. */
4750 /* Move address operations inside C_MAYBE_CONST_EXPR to simplify
4751 folding later. */
4753 {
4756 noconvert);
4763 }
4765 /* Ordinary case; arg is a COMPONENT_REF or a decl. */
4768 /* If the lvalue is const or volatile, merge that into the type
4769 to which the address will point. This is only needed
4770 for function types. */
4774 {
4784 }
4787 {
4790 {
4794 }
4796 /* fall through */
4800 {
4803 {
4807 }
4812 "address of array with reverse scalar storage "
4814 }
4818 }
4828 /* ??? Cope with user tricks that amount to offsetof. Delete this
4829 when we have proper support for integer constant expressions. */
4833 {
4836 }
4845 }
4850 ret = (require_constant_value
4853 else
4855 return_build_unary_op:
4866 }
4868 /* Return nonzero if REF is an lvalue valid for this language.
4869 Lvalues can be assigned, unless their type has TYPE_READONLY.
4870 Lvalues can have their address taken, unless they have C_DECL_REGISTER. */
4872 bool
4874 {
4878 {
4905 }
4906 }
4907 \f
4908 /* Give a warning for storing in something that is read-only in GCC
4909 terms but not const in ISO C terms. */
4911 static void
4913 {
4915 {
4927 }
4929 }
4932 /* Return nonzero if REF is an lvalue valid for this language;
4933 otherwise, print an error message and return zero. USE says
4934 how the lvalue is being used and so selects the error message.
4935 LOCATION is the location at which any error should be reported. */
4937 static int
4939 {
4946 }
4947 \f
4948 /* Mark EXP saying that we need to be able to take the
4949 address of it; it should not be allocated in a register.
4950 Returns true if successful. ARRAY_REF_P is true if this
4951 is for ARRAY_REF construction - in that case we don't want
4952 to look through VIEW_CONVERT_EXPR from VECTOR_TYPE to ARRAY_TYPE,
4953 it is fine to use ARRAY_REFs for vector subscripts on vector
4954 register variables. */
4956 bool
4958 {
4963 {
4969 /* FALLTHRU */
4993 {
4995 {
4996 error
4999 }
5001 }
5003 {
5006 else
5009 }
5011 /* FALLTHRU */
5014 /* FALLTHRU */
5017 }
5018 }
5019 \f
5020 /* Convert EXPR to TYPE, warning about conversion problems with
5021 constants. SEMANTIC_TYPE is the type this conversion would use
5022 without excess precision. If SEMANTIC_TYPE is NULL, this function
5023 is equivalent to convert_and_check. This function is a wrapper that
5024 handles conversions that may be different than
5025 the usual ones because of excess precision. */
5027 static tree
5029 tree semantic_type)
5030 {
5034 /* For C11, integer conversions may have results with excess
5035 precision. */
5041 {
5042 /* For integers, we need to check the real conversion, not
5043 the conversion to the excess precision type. */
5045 }
5046 /* Result type is the excess precision type, which should be
5047 large enough, so do not check. */
5049 }
5051 /* If EXPR refers to a built-in declared without a prototype returns
5052 the actual type of the built-in and, if non-null, set *BLTIN to
5053 a pointer to the built-in. Otherwise return the type of EXPR
5054 and clear *BLTIN if non-null. */
5056 static tree
5058 {
5059 tree dummy;
5083 }
5085 /* Build and return a conditional expression IFEXP ? OP1 : OP2. If
5086 IFEXP_BCP then the condition is a call to __builtin_constant_p, and
5087 if folded to an integer constant then the unselected half may
5088 contain arbitrary operations not normally permitted in constant
5089 expressions. Set the location of the expression to LOC. */
5091 tree
5095 {
5096 tree type1;
5097 tree type2;
5105 tree ret;
5117 /* Promote both alternatives. */
5142 /* C90 does not permit non-lvalue arrays in conditional expressions.
5143 In C99 they will be pointers by now. */
5145 {
5148 }
5156 {
5159 {
5163 }
5165 {
5169 }
5170 }
5173 {
5184 }
5186 /* Quickly detect the usual case where op1 and op2 have the same type
5187 after promotion. */
5189 {
5192 else
5194 }
5199 {
5200 /* In C11, a conditional expression between a floating-point
5201 type and an integer type should convert the integer type to
5202 the evaluation format of the floating-point type, with
5203 possible excess precision. */
5207 {
5208 tree eptype;
5211 {
5215 }
5218 {
5222 }
5223 }
5228 "implicit conversion from %qT to %qT to "
5230 colon_loc);
5232 /* If -Wsign-compare, warn here if type1 and type2 have
5233 different signedness. We'll promote the signed to unsigned
5234 and later code won't know it used to be different.
5235 Do this check on the original types, so that explicit casts
5236 will be considered, but default promotions won't. */
5238 {
5243 {
5246 /* Do not warn if the result type is signed, since the
5247 signed type will only be chosen if it can represent
5248 all the values of the unsigned type. */
5251 else
5252 {
5256 /* Do not warn if the signed quantity is an
5257 unsuffixed integer literal (or some static
5258 constant expression involving such literals) and
5259 it is non-negative. This warning requires the
5260 operands to be folded for best results, so do
5261 that folding in this case even without
5262 warn_sign_compare to avoid warning options
5263 possibly affecting code generation. */
5264 c_inhibit_evaluation_warnings
5268 c_inhibit_evaluation_warnings
5271 c_inhibit_evaluation_warnings
5275 c_inhibit_evaluation_warnings
5279 {
5282 || (unsigned_op1
5287 "operand of %<?:%> changes signedness from "
5288 "%qT to %qT due to unsignedness of other "
5291 else
5293 "operand of %<?:%> changes signedness from "
5294 "%qT to %qT due to unsignedness of other "
5297 }
5302 }
5303 }
5304 }
5305 }
5307 {
5312 }
5314 {
5317 addr_space_t as_common;
5326 {
5330 }
5333 {
5338 "pointer to array loses qualifier "
5343 "ISO C forbids conditional expr between "
5347 }
5350 {
5355 "pointer to array loses qualifier "
5360 "ISO C forbids conditional expr between "
5364 }
5365 /* Objective-C pointer comparisons are a bit more lenient. */
5368 else
5369 {
5373 "pointer type mismatch between %qT and %qT "
5376 else
5379 result_type = build_pointer_type
5381 }
5382 }
5384 {
5388 else
5389 {
5391 }
5393 }
5395 {
5399 else
5400 {
5402 }
5404 }
5407 {
5410 else
5411 {
5414 }
5415 }
5417 /* Merge const and volatile flags of the incoming types. */
5418 result_type
5424 semantic_result_type);
5426 semantic_result_type);
5429 {
5432 }
5434 {
5437 }
5439 && op1_int_operands
5442 {
5449 }
5451 /* Need to convert condition operand into a vector mask. */
5453 {
5460 }
5464 else
5465 {
5467 {
5468 /* Use c_fully_fold here, since C_MAYBE_CONST_EXPR might be
5469 nested inside of the expression. */
5472 }
5476 }
5482 /* If the OP1 and OP2 are the same and don't have side-effects,
5483 warn here, because the COND_EXPR will be turned into OP1. */
5491 }
5492 \f
5493 /* Return a compound expression that performs two expressions and
5494 returns the value of the second of them.
5496 LOC is the location of the COMPOUND_EXPR. */
5498 tree
5500 {
5503 tree ret;
5515 {
5518 }
5521 {
5522 /* The left-hand operand of a comma expression is like an expression
5523 statement: with -Wunused, we should warn if it doesn't have
5524 any side-effects, unless it was explicitly cast to (void). */
5526 {
5534 else
5537 }
5538 }
5541 {
5545 {
5549 }
5555 }
5557 /* With -Wunused, we should also warn if the left-hand operand does have
5558 side-effects, but computes a value which is not used. For example, in
5559 `foo() + bar(), baz()' the result of the `+' operator is not used,
5560 so we should issue a warning. */
5570 && expr1_int_operands
5579 }
5581 /* Issue -Wcast-qual warnings when appropriate. TYPE is the type to
5582 which we are casting. OTYPE is the type of the expression being
5583 cast. Both TYPE and OTYPE are pointer types. LOC is the location
5584 of the cast. -Wcast-qual appeared on the command line. Named
5585 address space qualifiers are not handled here, because they result
5586 in different warnings. */
5588 static void
5590 {
5597 /* Check that the qualifiers on IN_TYPE are a superset of the
5598 qualifiers of IN_OTYPE. The outermost level of POINTER_TYPE
5599 nodes is uninteresting and we stop as soon as we hit a
5600 non-POINTER_TYPE node on either type. */
5601 do
5602 {
5606 /* GNU C allows cv-qualified function types. 'const' means the
5607 function is very pure, 'volatile' means it can't return. We
5608 need to warn when such qualifiers are added, not when they're
5609 taken away. */
5614 else
5617 }
5626 /* There are qualifiers present in IN_OTYPE that are not present
5627 in IN_TYPE. */
5630 discarded);
5635 /* A cast from **T to const **T is unsafe, because it can cause a
5636 const value to be changed with no additional warning. We only
5637 issue this warning if T is the same on both sides, and we only
5638 issue the warning if there are the same number of pointers on
5639 both sides, as otherwise the cast is clearly unsafe anyhow. A
5640 cast is unsafe when a qualifier is added at one level and const
5641 is not present at all outer levels.
5643 To issue this warning, we check at each level whether the cast
5644 adds new qualifiers not already seen. We don't need to special
5645 case function types, as they won't have the same
5646 TYPE_MAIN_VARIANT. */
5656 do
5657 {
5662 {
5664 "to be safe all intermediate pointers in cast from "
5668 }
5671 }
5673 }
5675 /* Heuristic check if two parameter types can be considered ABI-equivalent. */
5677 static bool
5679 {
5687 /* The signedness of the parameter matters only when an integral
5688 type smaller than int is promoted to int, otherwise only the
5689 precision of the parameter matters.
5690 This check should make sure that the callee does not see
5691 undefined values in argument registers. */
5701 }
5703 /* Check if a type cast between two function types can be considered safe. */
5705 static bool
5707 {
5726 }
5728 /* Build an expression representing a cast to type TYPE of expression EXPR.
5729 LOC is the location of the cast-- typically the open paren of the cast. */
5731 tree
5733 {
5734 tree value;
5748 /* The ObjC front-end uses TYPE_MAIN_VARIANT to tie together types differing
5749 only in <protocol> qualifications. But when constructing cast expressions,
5750 the protocols do matter and must be kept around. */
5757 {
5760 }
5763 {
5766 }
5769 {
5773 }
5776 {
5781 /* Convert to remove any qualifiers from VALUE's type. */
5783 }
5785 {
5786 tree field;
5795 {
5796 tree t;
5808 }
5811 }
5812 else
5813 {
5817 {
5821 }
5825 /* Optionally warn about potentially worrisome casts. */
5831 /* Warn about conversions between pointers to disjoint
5832 address spaces. */
5836 {
5839 addr_space_t as_common;
5842 {
5853 else
5858 }
5859 }
5861 /* Warn about possible alignment problems. */
5867 /* Don't warn about opaque types, where the actual alignment
5868 restriction is unknown. */
5879 /* Unlike conversion of integers to pointers, where the
5880 warning is disabled for converting constants because
5881 of cases such as SIG_*, warn about converting constant
5882 pointers to integers. In some cases it may cause unwanted
5883 sign extension, and a warning is appropriate. */
5890 "cast from function call of type %qT "
5896 /* Don't warn about converting any constant. */
5905 /* If pedantic, warn for conversions between function and object
5906 pointer types, except for converting a null pointer constant
5907 to function pointer type. */
5932 "cast between incompatible function types"
5938 /* Ignore any integer overflow caused by the cast. */
5940 {
5942 {
5944 {
5945 /* Avoid clobbering a shared constant. */
5948 }
5949 }
5951 /* Reset VALUE's overflow flags, ensuring constant sharing. */
5953 }
5954 }
5956 /* Don't let a cast be an lvalue. */
5960 /* Don't allow the results of casting to floating-point or complex
5961 types be confused with actual constants, or casts involving
5962 integer and pointer types other than direct integer-to-integer
5963 and integer-to-pointer be confused with integer constant
5964 expressions and null pointer constants. */
5974 /* If the expression has integer operands and so can occur in an
5975 unevaluated part of an integer constant expression, ensure the
5976 return value reflects this. */
5984 }
5986 /* Interpret a cast of expression EXPR to type TYPE. LOC is the
5987 location of the open paren of the cast, or the position of the cast
5988 expr. */
5989 tree
5991 {
5992 tree type;
5995 tree ret;
5998 /* This avoids warnings about unprototyped casts on
5999 integers. E.g. "#define SIG_DFL (void(*)())0". */
6011 {
6018 }
6023 /* C++ does not permits types to be defined in a cast, but it
6024 allows references to incomplete types. */
6030 }
6031 \f
6032 /* Build an assignment expression of lvalue LHS from value RHS.
6033 If LHS_ORIGTYPE is not NULL, it is the original type of LHS, which
6034 may differ from TREE_TYPE (LHS) for an enum bitfield.
6035 MODIFYCODE is the code for a binary operator that we use
6036 to combine the old value of LHS with RHS to get the new value.
6037 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
6038 If RHS_ORIGTYPE is not NULL_TREE, it is the original type of RHS,
6039 which may differ from TREE_TYPE (RHS) for an enum value.
6041 LOCATION is the location of the MODIFYCODE operator.
6042 RHS_LOC is the location of the RHS. */
6044 tree
6048 {
6049 tree result;
6050 tree newrhs;
6057 /* Types that aren't fully specified cannot be used in assignments. */
6060 /* Avoid duplicate error messages from operands that had errors. */
6064 /* Ensure an error for assigning a non-lvalue array to an array in
6065 C90. */
6067 {
6070 }
6072 /* For ObjC properties, defer this check. */
6081 {
6084 rhs_origtype);
6093 }
6095 /* If a binary op has been requested, combine the old LHS value with the RHS
6096 producing the value we should actually store into the LHS. */
6099 {
6103 /* Construct the RHS for any non-atomic compound assignemnt. */
6105 {
6106 /* If in LHS op= RHS the RHS has side-effects, ensure they
6107 are preevaluated before the rest of the assignment expression's
6108 side-effects, because RHS could contain e.g. function calls
6109 that modify LHS. */
6111 {
6114 else
6119 newrhs);
6120 }
6124 /* The original type of the right hand side is no longer
6125 meaningful. */
6127 }
6128 }
6131 {
6132 /* Check if we are modifying an Objective-C property reference;
6133 if so, we need to generate setter calls. */
6136 else
6141 /* Else, do the check that we postponed for Objective-C. */
6144 }
6146 /* Give an error for storing in something that is 'const'. */
6151 {
6154 }
6158 /* If storing into a structure or union member,
6159 it has probably been given type `int'.
6160 Compute the type that would go with
6161 the actual amount of storage the member occupies. */
6170 /* If storing in a field that is in actuality a short or narrower than one,
6171 we must store in the field in its actual type. */
6174 {
6177 }
6179 /* Issue -Wc++-compat warnings about an assignment to an enum type
6180 when LHS does not have its original type. This happens for,
6181 e.g., an enum bitfield in a struct. */
6186 {
6188 ? rhs_origtype
6195 }
6197 /* If the lhs is atomic, remove that qualifier. */
6199 {
6206 }
6208 /* Convert new value to destination type. Fold it first, then
6209 restore any excess precision information, for the sake of
6210 conversion warnings. */
6213 {
6216 {
6218 {
6221 }
6226 }
6227 else
6234 }
6236 /* Emit ObjC write barrier, if necessary. */
6238 {
6241 {
6244 }
6245 }
6247 /* Scan operands. */
6251 else
6252 {
6256 }
6258 /* If we got the LHS in a different type for storing in,
6259 convert the result back to the nominal type of LHS
6260 so that the value we return always has the same type
6261 as the LHS argument. */
6271 return_result:
6275 }
6276 \f
6277 /* Return whether STRUCT_TYPE has an anonymous field with type TYPE.
6278 This is used to implement -fplan9-extensions. */
6280 static bool
6282 {
6283 tree field;
6291 {
6294 TYPE_QUAL_ATOMIC)
6298 {
6302 }
6306 {
6310 }
6311 }
6313 }
6315 /* RHS is an expression whose type is pointer to struct. If there is
6316 an anonymous field in RHS with type TYPE, then return a pointer to
6317 that field in RHS. This is used with -fplan9-extensions. This
6318 returns NULL if no conversion could be found. */
6320 static tree
6322 {
6326 tree ret;
6335 TYPE_QUAL_ATOMIC)
6343 {
6349 TYPE_QUAL_ATOMIC)
6352 {
6356 }
6358 lhs_main_type))
6359 {
6364 }
6365 }
6372 NULL_TREE);
6376 {
6379 }
6382 }
6384 /* Issue an error message for a bad initializer component.
6385 GMSGID identifies the message.
6386 The component name is taken from the spelling stack. */
6390 {
6393 auto_diagnostic_group d;
6395 /* The gmsgid may be a format string with %< and %>. */
6404 }
6406 /* Issue a pedantic warning for a bad initializer component. OPT is
6407 the option OPT_* (from options.h) controlling this warning or 0 if
6408 it is unconditionally given. GMSGID identifies the message. The
6409 component name is taken from the spelling stack. */
6413 {
6414 /* Use the location where a macro was expanded rather than where
6415 it was defined to make sure macros defined in system headers
6416 but used incorrectly elsewhere are diagnosed. */
6418 auto_diagnostic_group d;
6426 }
6428 /* Issue a warning for a bad initializer component.
6430 OPT is the OPT_W* value corresponding to the warning option that
6431 controls this warning. GMSGID identifies the message. The
6432 component name is taken from the spelling stack. */
6434 static void
6436 {
6440 auto_diagnostic_group d;
6442 /* Use the location where a macro was expanded rather than where
6443 it was defined to make sure macros defined in system headers
6444 but used incorrectly elsewhere are diagnosed. */
6447 /* The gmsgid may be a format string with %< and %>. */
6452 }
6453 \f
6454 /* If TYPE is an array type and EXPR is a parenthesized string
6455 constant, warn if pedantic that EXPR is being used to initialize an
6456 object of type TYPE. */
6458 void
6460 {
6467 }
6469 /* Attempt to locate the parameter with the given index within FNDECL,
6470 returning DECL_SOURCE_LOCATION (FNDECL) if it can't be found. */
6472 static location_t
6474 {
6476 tree param;
6478 /* Locate param by index within DECL_ARGUMENTS (fndecl). */
6482 ;
6484 /* If something went wrong (e.g. if we have a builtin and thus no arguments),
6485 return DECL_SOURCE_LOCATION (FNDECL). */
6490 }
6492 /* Issue a note about a mismatching argument for parameter PARMNUM
6493 to FUNDECL, for types EXPECTED_TYPE and ACTUAL_TYPE.
6494 Attempt to issue the note at the pertinent parameter of the decl;
6495 failing that issue it at the location of FUNDECL; failing that
6496 issue it at PLOC. */
6498 static void
6501 {
6502 location_t loc;
6505 else
6511 }
6513 /* Issue a warning when an argument of ARGTYPE is passed to a built-in
6514 function FUNDECL declared without prototype to parameter PARMNUM of
6515 PARMTYPE when ARGTYPE does not promote to PARMTYPE. */
6517 static void
6520 {
6525 /* Avoid warning for enum arguments that promote to an integer type
6526 of the same size/mode. */
6538 /* This diagnoses even signed/unsigned mismatches. Those might be
6539 safe in many cases but GCC may emit suboptimal code for them so
6540 warning on those cases drives efficiency improvements. */
6544 "in a call to built-in function declared without "
6547 "in a call to built-in function declared without "
6552 fundecl);
6553 }
6555 /* Convert value RHS to type TYPE as preparation for an assignment to
6556 an lvalue of type TYPE. If ORIGTYPE is not NULL_TREE, it is the
6557 original type of RHS; this differs from TREE_TYPE (RHS) for enum
6558 types. NULL_POINTER_CONSTANT says whether RHS was a null pointer
6559 constant before any folding.
6560 The real work of conversion is done by `convert'.
6561 The purpose of this function is to generate error messages
6562 for assignments that are not allowed in C.
6563 ERRTYPE says whether it is argument passing, assignment,
6564 initialization or return.
6566 In the following example, '~' denotes where EXPR_LOC and '^' where
6567 LOCATION point to:
6569 f (var); [ic_argpass]
6570 ^ ~~~
6571 x = var; [ic_assign]
6572 ^ ~~~;
6573 int x = var; [ic_init]
6574 ^^^
6575 return x; [ic_return]
6576 ^
6578 FUNCTION is a tree for the function being called.
6579 PARMNUM is the number of the argument, for printing in error messages.
6580 WARNOPT may be set to a warning option to issue the corresponding warning
6581 rather than an error for invalid conversions. Used for calls to built-in
6582 functions declared without a prototype. */
6584 static tree
6589 {
6592 tree rhstype;
6597 /* Use the expansion point location to handle cases such as user's
6598 function returning a wrong-type macro defined in a system header. */
6602 {
6603 tree selector;
6604 /* Change pointer to function to the function itself for
6605 diagnostics. */
6610 /* Handle an ObjC selector specially for diagnostics. */
6614 {
6617 }
6618 }
6620 /* This macro is used to emit diagnostics to ensure that all format
6621 strings are complete sentences, visible to gettext and checked at
6622 compile time. */
6623 #define PEDWARN_FOR_ASSIGNMENT(LOCATION, PLOC, OPT, AR, AS, IN, RE) \
6624 do { \
6625 switch (errtype) \
6626 { \
6627 case ic_argpass: \
6628 { \
6629 auto_diagnostic_group d; \
6630 if (pedwarn (PLOC, OPT, AR, parmnum, rname)) \
6631 inform_for_arg (fundecl, (PLOC), parmnum, type, rhstype); \
6632 } \
6633 break; \
6634 case ic_assign: \
6635 pedwarn (LOCATION, OPT, AS); \
6636 break; \
6637 case ic_init: \
6638 pedwarn_init (LOCATION, OPT, IN); \
6639 break; \
6640 case ic_return: \
6641 pedwarn (LOCATION, OPT, RE); \
6642 break; \
6643 default: \
6644 gcc_unreachable (); \
6645 } \
6646 } while (0)
6648 /* This macro is used to emit diagnostics to ensure that all format
6649 strings are complete sentences, visible to gettext and checked at
6650 compile time. It is the same as PEDWARN_FOR_ASSIGNMENT but with an
6651 extra parameter to enumerate qualifiers. */
6652 #define PEDWARN_FOR_QUALIFIERS(LOCATION, PLOC, OPT, AR, AS, IN, RE, QUALS) \
6653 do { \
6654 switch (errtype) \
6655 { \
6656 case ic_argpass: \
6657 { \
6658 auto_diagnostic_group d; \
6659 if (pedwarn (PLOC, OPT, AR, parmnum, rname, QUALS)) \
6660 inform_for_arg (fundecl, (PLOC), parmnum, type, rhstype); \
6661 } \
6662 break; \
6663 case ic_assign: \
6664 pedwarn (LOCATION, OPT, AS, QUALS); \
6665 break; \
6666 case ic_init: \
6667 pedwarn (LOCATION, OPT, IN, QUALS); \
6668 break; \
6669 case ic_return: \
6670 pedwarn (LOCATION, OPT, RE, QUALS); \
6671 break; \
6672 default: \
6673 gcc_unreachable (); \
6674 } \
6675 } while (0)
6677 /* This macro is used to emit diagnostics to ensure that all format
6678 strings are complete sentences, visible to gettext and checked at
6679 compile time. It is the same as PEDWARN_FOR_QUALIFIERS but uses
6680 warning_at instead of pedwarn. */
6681 #define WARNING_FOR_QUALIFIERS(LOCATION, PLOC, OPT, AR, AS, IN, RE, QUALS) \
6682 do { \
6683 switch (errtype) \
6684 { \
6685 case ic_argpass: \
6686 { \
6687 auto_diagnostic_group d; \
6688 if (warning_at (PLOC, OPT, AR, parmnum, rname, QUALS)) \
6689 inform_for_arg (fundecl, (PLOC), parmnum, type, rhstype); \
6690 } \
6691 break; \
6692 case ic_assign: \
6693 warning_at (LOCATION, OPT, AS, QUALS); \
6694 break; \
6695 case ic_init: \
6696 warning_at (LOCATION, OPT, IN, QUALS); \
6697 break; \
6698 case ic_return: \
6699 warning_at (LOCATION, OPT, RE, QUALS); \
6700 break; \
6701 default: \
6702 gcc_unreachable (); \
6703 } \
6704 } while (0)
6716 {
6720 {
6736 }
6739 }
6742 {
6748 {
6773 }
6774 }
6777 {
6783 {
6788 }
6789 }
6792 {
6795 }
6798 {
6799 /* Except for passing an argument to an unprototyped function,
6800 this is a constraint violation. When passing an argument to
6801 an unprototyped function, it is compile-time undefined;
6802 making it a constraint in that case was rejected in
6803 DR#252. */
6807 else
6810 }
6818 /* A non-reference type can convert to a reference. This handles
6819 va_start, va_copy and possibly port built-ins. */
6821 {
6823 {
6827 else
6830 }
6847 }
6848 /* Some types can interconvert without explicit casts. */
6852 /* Arithmetic types all interconvert, and enum is treated like int. */
6861 {
6864 rhstype);
6876 }
6878 /* Aggregates in different TUs might need conversion. */
6885 /* Conversion to a transparent union or record from its member types.
6886 This applies only to function arguments. */
6890 {
6894 {
6905 {
6909 /* Any non-function converts to a [const][volatile] void *
6910 and vice versa; otherwise, targets must be the same.
6911 Meanwhile, the lhs target must have all the qualifiers of
6912 the rhs. */
6916 {
6919 /* If this type won't generate any warnings, use it. */
6927 /* Keep looking for a better type, but remember this one. */
6930 }
6931 }
6933 /* Can convert integer zero to any pointer type. */
6935 {
6938 }
6939 }
6942 {
6944 {
6945 /* We have only a marginally acceptable member type;
6946 it needs a warning. */
6950 /* Const and volatile mean something different for function
6951 types, so the usual warnings are not appropriate. */
6954 {
6955 /* Because const and volatile on functions are
6956 restrictions that say the function will not do
6957 certain things, it is okay to use a const or volatile
6958 function where an ordinary one is wanted, but not
6959 vice-versa. */
6963 OPT_Wdiscarded_qualifiers,
6965 "makes %q#v qualified function "
6968 "function pointer from "
6971 "function pointer from "
6976 }
6980 OPT_Wdiscarded_qualifiers,
6992 }
7000 }
7001 }
7003 /* Conversions among pointers */
7006 {
7007 /* If RHS refers to a built-in declared without a prototype
7008 BLTIN is the declaration of the built-in with a prototype
7009 and RHSTYPE is set to the actual type of the built-in. */
7010 tree bltin;
7019 addr_space_t asl;
7020 addr_space_t asr;
7025 TYPE_QUAL_ATOMIC)
7030 TYPE_QUAL_ATOMIC)
7032 /* Opaque pointers are treated like void pointers. */
7035 /* The Plan 9 compiler permits a pointer to a struct to be
7036 automatically converted into a pointer to an anonymous field
7037 within the struct. */
7042 {
7045 {
7051 }
7052 }
7054 /* C++ does not allow the implicit conversion void* -> T*. However,
7055 for the purpose of reducing the number of false positives, we
7056 tolerate the special case of
7058 int *p = NULL;
7060 where NULL is typically defined in C to be '(void *) 0'. */
7063 OPT_Wc___compat,
7064 "request for implicit conversion "
7067 /* See if the pointers point to incompatible address spaces. */
7072 {
7074 {
7076 {
7081 else
7084 }
7086 {
7091 else
7094 }
7096 {
7101 else
7104 }
7106 {
7111 else
7114 }
7117 }
7119 }
7121 /* Check if the right-hand side has a format attribute but the
7122 left-hand side doesn't. */
7125 {
7127 {
7130 "argument %d of %qE might be "
7136 "assignment left-hand side might be "
7141 "initialization left-hand side might be "
7146 "return type might be "
7151 }
7152 }
7154 /* See if the pointers point to incompatible scalar storage orders. */
7158 {
7160 {
7162 /* Do not warn for built-in functions, for example memcpy, since we
7163 control how they behave and they can be useful in this area. */
7166 "passing argument %d of %qE from incompatible "
7171 "assignment to %qT from pointer type %qT with "
7176 "initialization of %qT from pointer type %qT with "
7181 "returning %qT from pointer type with incompatible "
7186 }
7187 }
7189 /* Any non-function converts to a [const][volatile] void *
7190 and vice versa; otherwise, targets must be the same.
7191 Meanwhile, the lhs target must have all the qualifiers of the rhs. */
7195 || is_opaque_pointer
7201 {
7202 /* Warn about loss of qualifers from pointers to arrays with
7203 qualifiers on the element type. */
7205 {
7212 OPT_Wdiscarded_array_qualifiers,
7222 }
7225 ||
7227 && !null_pointer_constant
7231 "%qE between function pointer "
7239 /* Const and volatile mean something different for function types,
7240 so the usual warnings are not appropriate. */
7243 {
7244 /* Don't warn about loss of qualifier for conversions from
7245 qualified void* to pointers to arrays with corresponding
7246 qualifier on the element type. */
7250 /* Assignments between atomic and non-atomic objects are OK. */
7253 {
7255 OPT_Wdiscarded_qualifiers,
7265 }
7266 /* If this is not a case of ignoring a mismatch in signedness,
7267 no warning. */
7270 ;
7271 /* If there is a mismatch, do warn. */
7274 {
7276 {
7277 auto_diagnostic_group d;
7281 "pointer targets in passing argument %d of "
7284 rhstype);
7285 }
7289 "pointer targets in assignment from %qT to %qT "
7294 "pointer targets in initialization of %qT "
7296 rhstype);
7300 "returning %qT from a function with return type "
7305 }
7306 }
7309 {
7310 /* Because const and volatile on functions are restrictions
7311 that say the function will not do certain things,
7312 it is okay to use a const or volatile function
7313 where an ordinary one is wanted, but not vice-versa. */
7317 OPT_Wdiscarded_qualifiers,
7319 "%q#v qualified function pointer "
7328 }
7329 }
7330 /* Avoid warning about the volatile ObjC EH puts on decls. */
7332 {
7334 {
7336 {
7337 auto_diagnostic_group d;
7341 "passing argument %d of %qE from incompatible "
7344 }
7349 "assignment to %qT from pointer to "
7352 else
7360 "initialization of %qT from pointer to "
7363 else
7365 "initialization of %qT from incompatible "
7372 "returning pointer to %qD of type %qT from "
7375 else
7377 "returning %qT from a function with incompatible "
7382 }
7383 }
7385 /* If RHS isn't an address, check pointer or array of packed
7386 struct or union. */
7390 }
7392 {
7393 /* ??? This should not be an error when inlining calls to
7394 unprototyped functions. */
7398 else
7401 }
7403 {
7404 /* An explicit constant 0 can convert to a pointer,
7405 or one that results from arithmetic, even including
7406 a cast to integer type. */
7409 {
7411 {
7412 auto_diagnostic_group d;
7416 "passing argument %d of %qE makes pointer from "
7419 }
7423 "assignment to %qT from %qT makes pointer from integer "
7428 "initialization of %qT from %qT makes pointer from "
7433 "function with return type %qT makes pointer from "
7438 }
7441 }
7443 {
7445 {
7447 {
7448 auto_diagnostic_group d;
7452 "passing argument %d of %qE makes integer from "
7455 }
7459 "assignment to %qT from %qT makes integer from pointer "
7464 "initialization of %qT from %qT makes integer from "
7469 "function with return type %qT makes integer from "
7474 }
7477 }
7479 {
7480 tree ret;
7486 }
7489 {
7491 {
7492 auto_diagnostic_group d;
7498 else
7501 }
7504 {
7509 else
7512 }
7514 {
7519 else
7522 }
7524 {
7529 else
7532 }
7535 }
7538 }
7539 \f
7540 /* If VALUE is a compound expr all of whose expressions are constant, then
7541 return its value. Otherwise, return error_mark_node.
7543 This is for handling COMPOUND_EXPRs as initializer elements
7544 which is allowed with a warning when -pedantic is specified. */
7546 static tree
7548 {
7550 {
7555 endtype);
7556 }
7559 else
7561 }
7562 \f
7563 /* Perform appropriate conversions on the initial value of a variable,
7564 store it in the declaration DECL,
7565 and print any error messages that are appropriate.
7566 If ORIGTYPE is not NULL_TREE, it is the original type of INIT.
7567 If the init is invalid, store an ERROR_MARK.
7569 INIT_LOC is the location of the initial value. */
7571 void
7573 {
7577 /* If variable's type was invalidly declared, just ignore it. */
7583 /* Digest the specified initializer into an expression. */
7590 /* Store the expression if valid; else report error. */
7600 /* ANSI wants warnings about out-of-range constant initializers. */
7605 /* Check if we need to set array size from compound literal size. */
7609 {
7616 {
7620 {
7621 /* For int foo[] = (int [3]){1}; we need to set array size
7622 now since later on array initializer will be just the
7623 brace enclosed list of the compound literal. */
7631 }
7632 }
7633 }
7634 }
7635 \f
7636 /* Methods for storing and printing names for error messages. */
7638 /* Implement a spelling stack that allows components of a name to be pushed
7639 and popped. Each element on the stack is this structure. */
7641 struct spelling
7642 {
7644 union
7645 {
7649 };
7651 #define SPELLING_STRING 1
7652 #define SPELLING_MEMBER 2
7653 #define SPELLING_BOUNDS 3
7659 /* Macros to save and restore the spelling stack around push_... functions.
7660 Alternative to SAVE_SPELLING_STACK. */
7662 #define SPELLING_DEPTH() (spelling - spelling_base)
7663 #define RESTORE_SPELLING_DEPTH(DEPTH) (spelling = spelling_base + (DEPTH))
7665 /* Push an element on the spelling stack with type KIND and assign VALUE
7666 to MEMBER. */
7668 #define PUSH_SPELLING(KIND, VALUE, MEMBER) \
7669 { \
7670 int depth = SPELLING_DEPTH (); \
7671 \
7672 if (depth >= spelling_size) \
7673 { \
7674 spelling_size += 10; \
7675 spelling_base = XRESIZEVEC (struct spelling, spelling_base, \
7676 spelling_size); \
7677 RESTORE_SPELLING_DEPTH (depth); \
7678 } \
7679 \
7680 spelling->kind = (KIND); \
7681 spelling->MEMBER = (VALUE); \
7682 spelling++; \
7683 }
7685 /* Push STRING on the stack. Printed literally. */
7687 static void
7689 {
7691 }
7693 /* Push a member name on the stack. Printed as '.' STRING. */
7695 static void
7697 {
7703 }
7705 /* Push an array bounds on the stack. Printed as [BOUNDS]. */
7707 static void
7709 {
7711 }
7713 /* Compute the maximum size in bytes of the printed spelling. */
7715 static int
7717 {
7722 {
7725 else
7727 }
7730 }
7732 /* Print the spelling to BUFFER and return it. */
7736 {
7742 {
7745 }
7746 else
7747 {
7752 ;
7753 }
7756 }
7758 /* Digest the parser output INIT as an initializer for type TYPE.
7759 Return a C expression of type TYPE to represent the initial value.
7761 If ORIGTYPE is not NULL_TREE, it is the original type of INIT.
7763 NULL_POINTER_CONSTANT is true if INIT is a null pointer constant.
7765 If INIT is a string constant, STRICT_STRING is true if it is
7766 unparenthesized or we should not warn here for it being parenthesized.
7767 For other types of INIT, STRICT_STRING is not used.
7769 INIT_LOC is the location of the INIT.
7771 REQUIRE_CONSTANT requests an error if non-constant initializers or
7772 elements are seen. */
7774 static tree
7778 {
7785 || !init
7792 {
7794 {
7797 }
7799 }
7801 /* Initialization of an array of chars from a string constant
7802 optionally enclosed in braces. */
7806 {
7807 tree typ1
7810 TYPE_QUAL_ATOMIC)
7812 /* Note that an array could be both an array of character type
7813 and an array of wchar_t if wchar_t is signed char or unsigned
7814 char. */
7823 {
7841 {
7844 }
7849 {
7854 }
7859 {
7863 /* Subtract the size of a single (possibly wide) character
7864 because it's ok to ignore the terminating null char
7865 that is counted in the length of the constant. */
7876 {
7877 unsigned HOST_WIDE_INT size
7882 }
7883 }
7887 }
7889 {
7893 }
7894 }
7896 /* Build a VECTOR_CST from a *constant* vector constructor. If the
7897 vector constructor is not constant (e.g. {1,2,3,foo()}) then punt
7898 below and handle as a constructor. */
7903 {
7910 {
7912 tree value;
7915 /* Iterate through elements and check if all constructor
7916 elements are *_CSTs. */
7919 {
7922 }
7927 }
7928 }
7933 /* Any type can be initialized
7934 from an expression of the same type, optionally with braces. */
7947 {
7949 {
7951 {
7954 inside_init = array_to_pointer_conversion
7956 else
7957 {
7960 }
7961 }
7962 }
7965 /* Although the types are compatible, we may require a
7966 conversion. */
7971 {
7972 /* As an extension, allow initializing objects with static storage
7973 duration with compound literals (which are then treated just as
7974 the brace enclosed list they contain). Also allow this for
7975 vectors, as we can only assign them with compound literals. */
7981 }
7985 {
7989 }
7991 /* Compound expressions can only occur here if -Wpedantic or
7992 -pedantic-errors is specified. In the later case, we always want
7993 an error. In the former case, we simply want a warning. */
7996 {
7997 inside_init
8002 else
8007 }
8011 {
8014 }
8019 /* Added to enable additional -Wsuggest-attribute=format warnings. */
8026 }
8028 /* Handle scalar types, including conversions. */
8033 {
8040 inside_init);
8041 inside_init
8047 /* Check to see if we have already given an error message. */
8049 ;
8051 {
8054 }
8058 {
8062 }
8068 }
8070 /* Come here only for records and arrays. */
8073 {
8076 }
8080 }
8081 \f
8082 /* Handle initializers that use braces. */
8084 /* Type of object we are accumulating a constructor for.
8085 This type is always a RECORD_TYPE, UNION_TYPE or ARRAY_TYPE. */
8088 /* For a RECORD_TYPE or UNION_TYPE, this is the chain of fields
8089 left to fill. */
8092 /* For an ARRAY_TYPE, this is the specified index
8093 at which to store the next element we get. */
8096 /* For an ARRAY_TYPE, this is the maximum index. */
8099 /* For a RECORD_TYPE, this is the first field not yet written out. */
8102 /* For an ARRAY_TYPE, this is the index of the first element
8103 not yet written out. */
8106 /* In a RECORD_TYPE, the byte index of the next consecutive field.
8107 This is so we can generate gaps between fields, when appropriate. */
8110 /* If we are saving up the elements rather than allocating them,
8111 this is the list of elements so far (in reverse order,
8112 most recent first). */
8115 /* 1 if constructor should be incrementally stored into a constructor chain,
8116 0 if all the elements should be kept in AVL tree. */
8119 /* 1 if so far this constructor's elements are all compile-time constants. */
8122 /* 1 if so far this constructor's elements are all valid address constants. */
8125 /* 1 if this constructor has an element that cannot be part of a
8126 constant expression. */
8129 /* 1 if this constructor is erroneous so far. */
8132 /* 1 if this constructor is the universal zero initializer { 0 }. */
8135 /* Structure for managing pending initializer elements, organized as an
8136 AVL tree. */
8138 struct init_node
8139 {
8143 tree purpose;
8144 tree value;
8145 tree origtype;
8146 };
8148 /* Tree of pending elements at this constructor level.
8149 These are elements encountered out of order
8150 which belong at places we haven't reached yet in actually
8151 writing the output.
8152 Will never hold tree nodes across GC runs. */
8155 /* The SPELLING_DEPTH of this constructor. */
8158 /* DECL node for which an initializer is being read.
8159 0 means we are reading a constructor expression
8160 such as (struct foo) {...}. */
8163 /* Nonzero if this is an initializer for a top-level decl. */
8166 /* Nonzero if there were any member designators in this initializer. */
8169 /* Nesting depth of designator list. */
8172 /* Nonzero if there were diagnosed errors in this designator list. */
8175 \f
8176 /* This stack has a level for each implicit or explicit level of
8177 structuring in the initializer, including the outermost one. It
8178 saves the values of most of the variables above. */
8182 struct constructor_stack
8183 {
8185 tree type;
8186 tree fields;
8187 tree index;
8188 tree max_index;
8189 tree unfilled_index;
8190 tree unfilled_fields;
8191 tree bit_index;
8196 /* If value nonzero, this value should replace the entire
8197 constructor at this level. */
8209 };
8213 /* This stack represents designators from some range designator up to
8214 the last designator in the list. */
8216 struct constructor_range_stack
8217 {
8220 tree range_start;
8221 tree index;
8222 tree range_end;
8223 tree fields;
8224 };
8228 /* This stack records separate initializers that are nested.
8229 Nested initializers can't happen in ANSI C, but GNU C allows them
8230 in cases like { ... (struct foo) { ... } ... }. */
8232 struct initializer_stack
8233 {
8235 tree decl;
8246 };
8249 \f
8250 /* Prepare to parse and output the initializer for variable DECL. */
8252 void
8255 {
8278 {
8280 require_constant_elements
8282 /* For a scalar, you can always use any value to initialize,
8283 even within braces. */
8286 }
8287 else
8288 {
8292 }
8305 }
8307 void
8309 {
8312 /* Free the whole constructor stack of this initializer. */
8314 {
8318 }
8322 /* Pop back to the data of the outer initializer (if any). */
8337 }
8338 \f
8339 /* Call here when we see the initializer is surrounded by braces.
8340 This is instead of a call to push_init_level;
8341 it is matched by a call to pop_init_level.
8343 TYPE is the type to initialize, for a constructor expression.
8344 For an initializer for a decl, TYPE is zero. */
8346 void
8348 {
8398 {
8400 /* Skip any nameless bit fields at the beginning. */
8407 }
8409 {
8411 {
8412 constructor_max_index
8415 /* Detect non-empty initializations of zero-length arrays. */
8420 /* constructor_max_index needs to be an INTEGER_CST. Attempts
8421 to initialize VLAs will cause a proper error; avoid tree
8422 checking errors as well by setting a safe value. */
8427 constructor_index
8430 }
8431 else
8432 {
8435 }
8438 }
8440 {
8441 /* Vectors are like simple fixed-size arrays. */
8442 constructor_max_index =
8446 }
8447 else
8448 {
8449 /* Handle the case of int x = {5}; */
8452 }
8453 }
8454 \f
8457 /* Called when we see an open brace for a nested initializer. Finish
8458 off any pending levels with implicit braces. */
8459 void
8461 {
8463 {
8468 last_init_list_comma),
8471 && constructor_max_index
8473 constructor_index))
8476 last_init_list_comma),
8478 else
8480 }
8481 }
8483 /* Push down into a subobject, for initialization.
8484 If this is for an explicit set of braces, IMPLICIT is 0.
8485 If it is because the next element belongs at a lower level,
8486 IMPLICIT is 1 (or 2 if the push is because of designator list). */
8488 void
8491 {
8495 /* Unless this is an explicit brace, we need to preserve previous
8496 content if any. */
8498 {
8503 }
8541 {
8546 }
8548 /* Don't die if an entire brace-pair level is superfluous
8549 in the containing level. */
8551 ;
8553 {
8554 /* Don't die if there are extra init elts at the end. */
8557 else
8558 {
8561 constructor_depth++;
8562 }
8563 /* If upper initializer is designated, then mark this as
8564 designated too to prevent bogus warnings. */
8566 }
8568 {
8571 constructor_depth++;
8572 }
8575 {
8580 }
8583 {
8592 }
8595 {
8600 }
8603 {
8605 /* Skip any nameless bit fields at the beginning. */
8612 }
8614 {
8615 /* Vectors are like simple fixed-size arrays. */
8616 constructor_max_index =
8620 }
8622 {
8624 {
8625 constructor_max_index
8628 /* Detect non-empty initializations of zero-length arrays. */
8633 /* constructor_max_index needs to be an INTEGER_CST. Attempts
8634 to initialize VLAs will cause a proper error; avoid tree
8635 checking errors as well by setting a safe value. */
8640 constructor_index
8643 }
8644 else
8649 {
8650 /* We need to split the char/wchar array into individual
8651 characters, so that we don't have to special case it
8652 everywhere. */
8654 }
8655 }
8656 else
8657 {
8662 }
8663 }
8665 /* At the end of an implicit or explicit brace level,
8666 finish up that level of constructor. If a single expression
8667 with redundant braces initialized that level, return the
8668 c_expr structure for that expression. Otherwise, the original_code
8669 element is set to ERROR_MARK.
8670 If we were outputting the elements as they are read, return 0 as the value
8671 from inner levels (process_init_element ignores that),
8672 but return error_mark_node as the value from the outermost level
8673 (that's what we want to put in DECL_INITIAL).
8674 Otherwise, return a CONSTRUCTOR expression as the value. */
8676 struct c_expr
8679 location_t insert_before)
8680 {
8688 {
8689 /* When we come to an explicit close brace,
8690 pop any inner levels that didn't have explicit braces. */
8694 insert_before),
8697 }
8698 else
8703 /* Now output all pending elements. */
8709 /* Error for initializing a flexible array member, or a zero-length
8710 array member in an inappropriate context. */
8715 {
8716 /* Silently discard empty initializations. The parser will
8717 already have pedwarned for empty brackets. */
8720 else
8721 {
8726 else
8730 /* We have already issued an error message for the existence
8731 of a flexible array member not at the end of the structure.
8732 Discard the initializer so that we do not die later. */
8735 }
8736 }
8739 {
8741 /* Initialization with { } counts as zeroinit. */
8745 /* This might be zeroinit as well. */
8750 /* If the constructor has more than one element, it can't be { 0 }. */
8753 }
8755 /* Warn when some structs are initialized with direct aggregation. */
8758 {
8761 OPT_Wmissing_braces,
8763 }
8765 /* Warn when some struct elements are implicitly initialized to zero. */
8767 && constructor_type
8770 {
8771 /* Do not warn for flexible array members or zero-length arrays. */
8778 /* Do not warn if this level of the initializer uses member
8779 designators; it is likely to be deliberate. */
8780 && !constructor_designated
8781 /* Do not warn about initializing with { 0 } or with { }. */
8783 {
8786 constructor_unfilled_fields,
8787 constructor_type))
8790 }
8791 }
8793 /* Pad out the end of the structure. */
8795 /* If this closes a superfluous brace pair,
8796 just pass out the element between them. */
8799 ;
8803 {
8804 /* A nonincremental scalar initializer--just return
8805 the element, after verifying there is just one. */
8807 {
8811 }
8813 {
8816 }
8817 else
8819 }
8820 else
8821 {
8824 else
8825 {
8827 constructor_elements);
8834 }
8835 }
8838 {
8843 }
8872 }
8874 /* Common handling for both array range and field name designators.
8875 ARRAY argument is nonzero for array ranges. Returns false for success. */
8877 static bool
8880 {
8881 tree subtype;
8884 /* Don't die if an entire brace-pair level is superfluous
8885 in the containing level, or for an erroneous type. */
8889 /* If there were errors in this designator list already, bail out
8890 silently. */
8894 /* Likewise for an initializer for a variable-size type. Those are
8895 diagnosed in digest_init. */
8901 {
8904 /* Designator list starts at the level of closest explicit
8905 braces. */
8909 last_init_list_comma),
8913 }
8916 {
8928 }
8932 {
8935 }
8937 {
8940 }
8946 }
8948 /* If there are range designators in designator list, push a new designator
8949 to constructor_range_stack. RANGE_END is end of such stack range or
8950 NULL_TREE if there is no range designator at this level. */
8952 static void
8954 {
8970 }
8972 /* Within an array initializer, specify the next index to be initialized.
8973 FIRST is that index. If LAST is nonzero, then initialize a range
8974 of indices, running from FIRST through LAST. */
8976 void
8979 {
8987 {
8990 }
8993 {
8997 "array index in initializer is not "
8999 }
9002 {
9006 "array index in initializer is not "
9008 }
9021 else
9022 {
9028 {
9031 }
9034 {
9038 {
9041 }
9042 else
9043 {
9047 {
9051 }
9052 }
9053 }
9055 designator_depth++;
9059 }
9060 }
9062 /* Within a struct initializer, specify the next field to be initialized. */
9064 void
9067 {
9068 tree field;
9076 {
9079 }
9084 {
9087 {
9093 }
9094 else
9097 }
9098 else
9099 do
9100 {
9102 designator_depth++;
9108 {
9111 }
9112 }
9114 }
9115 \f
9116 /* Add a new initializer to the tree of pending initializers. PURPOSE
9117 identifies the initializer, either array index or field in a structure.
9118 VALUE is the value of that index or field. If ORIGTYPE is not
9119 NULL_TREE, it is the original type of VALUE.
9121 IMPLICIT is true if value comes from pop_init_level (1),
9122 the new initializer has been merged with the existing one
9123 and thus no warnings should be emitted about overriding an
9124 existing initializer. */
9126 static void
9129 {
9136 {
9138 {
9144 else
9145 {
9147 {
9150 "initialized field with side-effects "
9155 }
9159 }
9160 }
9161 }
9162 else
9163 {
9164 tree bitpos;
9168 {
9174 else
9175 {
9177 {
9180 "initialized field with side-effects "
9185 }
9189 }
9190 }
9191 }
9206 {
9210 {
9214 {
9216 {
9217 /* L rotation. */
9230 {
9233 else
9235 }
9236 else
9238 }
9239 else
9240 {
9241 /* LR rotation. */
9263 {
9266 else
9268 }
9269 else
9271 }
9273 }
9274 else
9275 {
9276 /* p->balance == +1; growth of left side balances the node. */
9279 }
9280 }
9282 {
9284 /* Growth propagation from right side. */
9287 {
9289 {
9290 /* R rotation. */
9303 {
9306 else
9308 }
9309 else
9311 }
9313 {
9314 /* RL rotation */
9336 {
9339 else
9341 }
9342 else
9344 }
9346 }
9347 else
9348 {
9349 /* p->balance == -1; growth of right side balances the node. */
9352 }
9353 }
9357 }
9358 }
9360 /* Build AVL tree from a sorted chain. */
9362 static void
9364 {
9374 braced_init_obstack);
9377 {
9379 /* Skip any nameless bit fields at the beginning. */
9384 }
9386 {
9388 constructor_unfilled_index
9391 else
9393 }
9395 }
9397 /* Build AVL tree from a string constant. */
9399 static void
9402 {
9419 p < end
9420 && !(constructor_max_index
9423 {
9425 {
9428 }
9429 else
9430 {
9434 {
9437 else
9442 }
9443 }
9446 {
9449 {
9451 {
9454 }
9455 }
9457 {
9460 }
9464 }
9470 braced_init_obstack);
9471 }
9474 }
9476 /* Return value of FIELD in pending initializer or NULL_TREE if the field was
9477 not initialized yet. */
9479 static tree
9481 {
9485 {
9492 {
9497 else
9499 }
9500 }
9502 {
9506 && (!constructor_unfilled_fields
9513 {
9518 else
9520 }
9521 }
9523 {
9527 }
9529 }
9531 /* "Output" the next constructor element.
9532 At top level, really output it to assembler code now.
9533 Otherwise, collect it in a list from which we will make a CONSTRUCTOR.
9534 If ORIGTYPE is not NULL_TREE, it is the original type of VALUE.
9535 TYPE is the data type that the containing data type wants here.
9536 FIELD is the field (a FIELD_DECL) or the index that this element fills.
9537 If VALUE is a string constant, STRICT_STRING is true if it is
9538 unparenthesized or we should not warn here for it being parenthesized.
9539 For other types of VALUE, STRICT_STRING is not used.
9541 PENDING if true means output pending elements that belong
9542 right after this element. (PENDING is normally true;
9543 it is false while outputting pending elements, to avoid recursion.)
9545 IMPLICIT is true if value comes from pop_init_level (1),
9546 the new initializer has been merged with the existing one
9547 and thus no warnings should be emitted about overriding an
9548 existing initializer. */
9550 static void
9554 {
9560 {
9563 }
9576 {
9577 /* As an extension, allow initializing objects with static storage
9578 duration with compound literals (which are then treated just as
9579 the brace enclosed list they contain). */
9585 }
9589 {
9592 }
9602 && TYPE_REVERSE_STORAGE_ORDER
9611 /* Digest the initializer and issue any errors about incompatible
9612 types before issuing errors about non-constant initializers. */
9617 require_constant_value);
9619 {
9622 }
9626 /* Proceed to check the constness of the original initializer. */
9628 {
9630 {
9633 }
9637 }
9643 /* Issue -Wc++-compat warnings about initializing a bitfield with
9644 enum type. */
9652 {
9659 }
9661 /* If this field is empty and does not have side effects (and is not at
9662 the end of structure), don't do anything other than checking the
9663 initializer. */
9673 /* Finally, set VALUE to the initializer value digested above. */
9676 /* If this element doesn't come next in sequence,
9677 put it on constructor_pending_elts. */
9679 && (!constructor_incremental
9681 {
9687 braced_init_obstack);
9689 }
9691 && (!constructor_incremental
9693 {
9694 /* We do this for records but not for unions. In a union,
9695 no matter which field is specified, it can be initialized
9696 right away since it starts at the beginning of the union. */
9698 {
9701 else
9702 {
9710 }
9711 }
9714 braced_init_obstack);
9716 }
9719 {
9721 {
9728 }
9730 /* We can have just one union field set. */
9732 }
9734 /* Otherwise, output this element either to
9735 constructor_elements or to the assembler file. */
9740 /* Advance the variable that indicates sequential elements output. */
9742 constructor_unfilled_index
9744 bitsize_one_node);
9746 {
9747 constructor_unfilled_fields
9750 /* Skip any nameless bit fields. */
9753 constructor_unfilled_fields =
9755 }
9759 /* Now output any pending elements which have become next. */
9762 }
9764 /* For two FIELD_DECLs in the same chain, return -1 if field1
9765 comes before field2, 1 if field1 comes after field2 and
9766 0 if field1 == field2. */
9768 static int
9770 {
9777 {
9778 /* If one of the fields has non-zero bitsize, then that
9779 field must be the last one in a sequence of zero
9780 sized fields, fields after it will have bigger
9781 bit_position. */
9790 /* Otherwise, fallback to DECL_CHAIN walk to find out
9791 which field comes earlier. Walk chains of both
9792 fields, so that if field1 and field2 are close to each
9793 other in either order, it is found soon even for large
9794 sequences of zero sized fields. */
9797 {
9801 {
9804 }
9815 }
9816 }
9819 else
9821 }
9823 /* Output any pending elements which have become next.
9824 As we output elements, constructor_unfilled_{fields,index}
9825 advances, which may cause other elements to become next;
9826 if so, they too are output.
9828 If ALL is 0, we return when there are
9829 no more pending elements to output now.
9831 If ALL is 1, we output space as necessary so that
9832 we can output all the pending elements. */
9833 static void
9835 {
9837 tree next;
9839 retry:
9841 /* Look through the whole pending tree.
9842 If we find an element that should be output now,
9843 output it. Otherwise, set NEXT to the element
9844 that comes first among those still pending. */
9848 {
9850 {
9852 constructor_unfilled_index))
9856 braced_init_obstack);
9859 {
9860 /* Advance to the next smaller node. */
9863 else
9864 {
9865 /* We have reached the smallest node bigger than the
9866 current unfilled index. Fill the space first. */
9869 }
9870 }
9871 else
9872 {
9873 /* Advance to the next bigger node. */
9876 else
9877 {
9878 /* We have reached the biggest node in a subtree. Find
9879 the parent of it, which is the next bigger node. */
9885 {
9888 }
9889 }
9890 }
9891 }
9893 {
9894 /* If the current record is complete we are done. */
9904 braced_init_obstack);
9906 {
9907 /* Advance to the next smaller node. */
9910 else
9911 {
9912 /* We have reached the smallest node bigger than the
9913 current unfilled field. Fill the space first. */
9916 }
9917 }
9918 else
9919 {
9920 /* Advance to the next bigger node. */
9923 else
9924 {
9925 /* We have reached the biggest node in a subtree. Find
9926 the parent of it, which is the next bigger node. */
9933 {
9936 }
9937 }
9938 }
9939 }
9940 }
9942 /* Ordinarily return, but not if we want to output all
9943 and there are elements left. */
9947 /* If it's not incremental, just skip over the gap, so that after
9948 jumping to retry we will output the next successive element. */
9954 /* ELT now points to the node in the pending tree with the next
9955 initializer to output. */
9957 }
9958 \f
9959 /* Add one non-braced element to the current constructor level.
9960 This adjusts the current position within the constructor's type.
9961 This may also start or terminate implicit levels
9962 to handle a partly-braced initializer.
9964 Once this has found the correct level for the new element,
9965 it calls output_init_element.
9967 IMPLICIT is true if value comes from pop_init_level (1),
9968 the new initializer has been merged with the existing one
9969 and thus no warnings should be emitted about overriding an
9970 existing initializer. */
9972 void
9975 {
9977 int string_flag
9988 /* Handle superfluous braces around string cst as in
9989 char x[] = {"foo"}; */
9991 && constructor_type
9992 && !was_designated
9996 {
10001 }
10004 {
10007 }
10009 /* Ignore elements of a brace group if it is entirely superfluous
10010 and has already been diagnosed, or if the type is erroneous. */
10014 /* Ignore elements of an initializer for a variable-size type.
10015 Those are diagnosed in digest_init. */
10025 OPT_Wdesignated_init,
10026 "positional initialization of field "
10029 /* If we've exhausted any levels that didn't have braces,
10030 pop them now. */
10032 {
10037 last_init_list_comma),
10041 && constructor_max_index
10043 constructor_index))
10046 last_init_list_comma),
10048 else
10050 }
10052 /* In the case of [LO ... HI] = VALUE, only evaluate VALUE once. */
10054 {
10055 /* If value is a compound literal and we'll be just using its
10056 content, don't put it into a SAVE_EXPR. */
10059 {
10062 {
10065 }
10070 }
10071 }
10074 {
10076 {
10077 tree fieldtype;
10081 {
10084 }
10091 /* Error for non-static initialization of a flexible array member. */
10093 && !require_constant_value
10096 {
10100 }
10102 /* Error for initialization of a flexible array member with
10103 a string constant if the structure is in an array. E.g.:
10104 struct S { int x; char y[]; };
10105 struct S s[] = { { 1, "foo" } };
10106 is invalid. */
10112 {
10117 {
10120 }
10122 {
10126 }
10127 }
10129 /* Accept a string constant to initialize a subarray. */
10135 /* Otherwise, if we have come to a subaggregate,
10136 and we don't have an element of its type, push into it. */
10143 {
10146 }
10149 {
10154 braced_init_obstack);
10156 }
10157 else
10158 /* Do the bookkeeping for an element that was
10159 directly output as a constructor. */
10160 {
10161 /* For a record, keep track of end position of last field. */
10163 constructor_bit_index
10168 /* If the current field was the first one not yet written out,
10169 it isn't now, so update. */
10171 {
10173 /* Skip any nameless bit fields. */
10175 && (DECL_UNNAMED_BIT_FIELD
10177 constructor_unfilled_fields =
10179 }
10180 }
10183 /* Skip any nameless bit fields at the beginning. */
10187 }
10189 {
10190 tree fieldtype;
10194 {
10198 }
10205 /* Warn that traditional C rejects initialization of unions.
10206 We skip the warning if the value is zero. This is done
10207 under the assumption that the zero initializer in user
10208 code appears conditioned on e.g. __STDC__ to avoid
10209 "missing initializer" warnings and relies on default
10210 initialization to zero in the traditional C case.
10211 We also skip the warning if the initializer is designated,
10212 again on the assumption that this must be conditional on
10213 __STDC__ anyway (and we've already complained about the
10214 member-designator already). */
10221 /* Accept a string constant to initialize a subarray. */
10227 /* Otherwise, if we have come to a subaggregate,
10228 and we don't have an element of its type, push into it. */
10235 {
10238 }
10241 {
10246 braced_init_obstack);
10248 }
10249 else
10250 /* Do the bookkeeping for an element that was
10251 directly output as a constructor. */
10252 {
10255 }
10258 }
10260 {
10264 /* Accept a string constant to initialize a subarray. */
10270 /* Otherwise, if we have come to a subaggregate,
10271 and we don't have an element of its type, push into it. */
10278 {
10281 }
10286 {
10290 }
10292 /* Now output the actual element. */
10294 {
10299 braced_init_obstack);
10301 }
10303 constructor_index
10308 /* If we are doing the bookkeeping for an element that was
10309 directly output as a constructor, we must update
10310 constructor_unfilled_index. */
10312 }
10314 {
10317 /* Do a basic check of initializer size. Note that vectors
10318 always have a fixed size derived from their type. */
10320 {
10324 }
10326 /* Now output the actual element. */
10328 {
10334 braced_init_obstack);
10335 }
10337 constructor_index
10342 /* If we are doing the bookkeeping for an element that was
10343 directly output as a constructor, we must update
10344 constructor_unfilled_index. */
10346 }
10348 /* Handle the sole element allowed in a braced initializer
10349 for a scalar variable. */
10352 {
10356 }
10357 else
10358 {
10363 braced_init_obstack);
10365 }
10367 /* Handle range initializers either at this level or anywhere higher
10368 in the designator stack. */
10370 {
10377 {
10381 braced_init_obstack,
10382 last_init_list_comma),
10384 }
10388 {
10392 braced_init_obstack,
10393 last_init_list_comma),
10395 }
10403 {
10407 {
10410 }
10419 }
10424 }
10427 }
10430 }
10431 \f
10432 /* Build a complete asm-statement, whose components are a CV_QUALIFIER
10433 (guaranteed to be 'volatile' or null) and ARGS (represented using
10434 an ASM_EXPR node). */
10435 tree
10437 {
10441 }
10443 /* Build an asm-expr, whose components are a STRING, some OUTPUTS,
10444 some INPUTS, and some CLOBBERS. The latter three may be NULL.
10445 SIMPLE indicates whether there was anything at all after the
10446 string in the asm expression -- asm("blah") and asm("blah" : )
10447 are subtly different. We use a ASM_EXPR node to represent this.
10448 LOC is the location of the asm, and IS_INLINE says whether this
10449 is asm inline. */
10450 tree
10453 {
10454 tree tail;
10455 tree args;
10468 /* Remove output conversions that change the type but not the mode. */
10470 {
10475 /* ??? Really, this should not be here. Users should be using a
10476 proper lvalue, dammit. But there's a long history of using casts
10477 in the output operands. In cases like longlong.h, this becomes a
10478 primitive form of typechecking -- if the cast can be removed, then
10479 the output operand had a type of the proper width; otherwise we'll
10480 get an error. Gross, but ... */
10498 {
10499 /* If the operand is going to end up in memory,
10500 mark it addressable. */
10506 {
10509 }
10510 }
10511 else
10515 }
10518 {
10519 tree input;
10526 {
10527 /* If the operand is going to end up in memory,
10528 mark it addressable. */
10530 {
10533 /* Strip the nops as we allow this case. FIXME, this really
10534 should be rejected or made deprecated. */
10538 }
10539 else
10540 {
10548 {
10551 }
10552 }
10553 }
10554 else
10558 }
10560 /* ASMs with labels cannot have outputs. This should have been
10561 enforced by the parser. */
10566 /* asm statements without outputs, including simple ones, are treated
10567 as volatile. */
10573 }
10574 \f
10575 /* Generate a goto statement to LABEL. LOC is the location of the
10576 GOTO. */
10578 tree
10580 {
10585 {
10590 }
10591 }
10593 /* Generate a computed goto statement to EXPR. LOC is the location of
10594 the GOTO. */
10596 tree
10598 {
10599 tree t;
10606 }
10608 /* Generate a C `return' statement. RETVAL is the expression for what
10609 to return, or a null pointer for `return;' with no value. LOC is
10610 the location of the return statement, or the location of the expression,
10611 if the statement has any. If ORIGTYPE is not NULL_TREE, it
10612 is the original type of RETVAL. */
10614 tree
10616 {
10621 /* Use the expansion point to handle cases such as returning NULL
10622 in a function returning void. */
10630 {
10634 {
10637 }
10641 }
10644 {
10648 {
10651 warned_here = pedwarn
10654 else
10655 warned_here = warning_at
10662 }
10663 }
10665 {
10669 warned_here = pedwarn
10672 else
10673 warned_here = pedwarn
10679 }
10680 else
10681 {
10686 tree inner;
10704 /* Strip any conversions, additions, and subtractions, and see if
10705 we are returning the address of a local variable. Warn if so. */
10707 {
10709 {
10710 CASE_CONVERT:
10718 /* If the second operand of the MINUS_EXPR has a pointer
10719 type (or is converted from it), this may be valid, so
10720 don't give a warning. */
10721 {
10734 }
10748 {
10752 else
10753 {
10758 }
10759 }
10764 }
10767 }
10774 }
10779 }
10780 \f
10782 /* The SWITCH_EXPR being built. */
10783 tree switch_expr;
10785 /* The original type of the testing expression, i.e. before the
10786 default conversion is applied. */
10787 tree orig_type;
10789 /* A splay-tree mapping the low element of a case range to the high
10790 element, or NULL_TREE if there is no high element. Used to
10791 determine whether or not a new case label duplicates an old case
10792 label. We need a tree, rather than simply a hash table, because
10793 of the GNU case range extension. */
10794 splay_tree cases;
10796 /* The bindings at the point of the switch. This is used for
10797 warnings crossing decls when branching to a case label. */
10800 /* The next node on the stack. */
10803 /* Remember whether the controlling expression had boolean type
10804 before integer promotions for the sake of -Wswitch-bool. */
10806 };
10808 /* A stack of the currently active switch statements. The innermost
10809 switch statement is on the top of the stack. There is no need to
10810 mark the stack for garbage collection because it is only active
10811 during the processing of the body of a function, and we never
10812 collect at that point. */
10816 /* Start a C switch statement, testing expression EXP. Return the new
10817 SWITCH_EXPR. SWITCH_LOC is the location of the `switch'.
10818 SWITCH_COND_LOC is the location of the switch's condition.
10819 EXPLICIT_CAST_P is true if the expression EXP has an explicit cast. */
10821 tree
10823 location_t switch_cond_loc,
10825 {
10831 {
10835 {
10837 {
10840 }
10842 }
10843 else
10844 {
10848 /* Warn if the condition has boolean value. */
10854 /* Explicit cast to int suppresses this warning. */
10871 }
10872 }
10874 /* Add this new SWITCH_EXPR to the stack. */
10886 }
10888 /* Process a case label at location LOC. */
10890 tree
10892 {
10896 {
10901 }
10904 {
10909 }
10912 {
10915 else
10918 }
10922 loc))
10931 }
10933 /* Finish the switch statement. TYPE is the original type of the
10934 controlling expression of the switch, or NULL_TREE. */
10936 void
10938 {
10940 location_t switch_location;
10944 /* Emit warnings as needed. */
10952 /* Pop the stack. */
10957 }
10958 \f
10959 /* Emit an if statement. IF_LOCUS is the location of the 'if'. COND,
10960 THEN_BLOCK and ELSE_BLOCK are expressions to be used; ELSE_BLOCK
10961 may be null. */
10963 void
10965 tree else_block)
10966 {
10967 tree stmt;
10972 }
10974 /* Emit a general-purpose loop construct. START_LOCUS is the location of
10975 the beginning of the loop. COND is the loop condition. COND_IS_FIRST
10976 is false for DO loops. INCR is the FOR increment expression. BODY is
10977 the statement controlled by the loop. BLAB is the break label. CLAB is
10978 the continue label. Everything is allowed to be NULL.
10979 COND_LOCUS is the location of the loop condition, INCR_LOCUS is the
10980 location of the FOR increment expression. */
10982 void
10986 {
10989 /* If the condition is zero don't generate a loop construct. */
10991 {
10993 {
10997 }
10998 }
10999 else
11000 {
11003 /* If we have an exit condition, then we build an IF with gotos either
11004 out of the loop, or to the top of it. If there's no exit condition,
11005 then we just build a jump back to the top. */
11009 {
11010 /* Canonicalize the loop condition to the end. This means
11011 generating a branch to the loop condition. Reuse the
11012 continue label, if possible. */
11014 {
11016 {
11019 }
11020 else
11024 }
11029 }
11030 else
11031 {
11032 /* For the backward-goto's location of an unconditional loop
11033 use the beginning of the body, or, if there is none, the
11034 top of the loop. */
11039 }
11042 }
11049 {
11051 {
11055 }
11057 }
11061 {
11065 }
11070 }
11072 tree
11074 {
11078 /* In switch statements break is sometimes stylistically used after
11079 a return statement. This can lead to spurious warnings about
11080 control reaching the end of a non-void function when it is
11081 inlined. Note that we are calling block_may_fallthru with
11082 language specific tree nodes; this works because
11083 block_may_fallthru returns true when given something it does not
11084 understand. */
11088 {
11091 }
11093 ;
11095 {
11099 else
11111 else
11117 }
11126 }
11128 /* A helper routine for c_process_expr_stmt and c_finish_stmt_expr. */
11130 static void
11132 {
11134 ;
11136 {
11139 }
11141 {
11145 {
11149 }
11157 }
11158 else
11160 }
11162 /* Process an expression as if it were a complete statement. Emit
11163 diagnostics, but do not call ADD_STMT. LOC is the location of the
11164 statement. */
11166 tree
11168 {
11169 tree exprv;
11184 /* If we're not processing a statement expression, warn about unused values.
11185 Warnings for statement expressions will be emitted later, once we figure
11186 out which is the result. */
11201 /* If the expression is not of a type to which we cannot assign a line
11202 number, wrap the thing in a no-op NOP_EXPR. */
11204 {
11207 }
11210 }
11212 /* Emit an expression as a statement. LOC is the location of the
11213 expression. */
11215 tree
11217 {
11220 else
11222 }
11224 /* Do the opposite and emit a statement as an expression. To begin,
11225 create a new binding level and return it. */
11227 tree
11229 {
11230 tree ret;
11232 /* We must force a BLOCK for this level so that, if it is not expanded
11233 later, there is a way to turn off the entire subtree of blocks that
11234 are contained in it. */
11239 ? NULL
11242 /* Mark the current statement list as belonging to a statement list. */
11246 }
11248 /* LOC is the location of the compound statement to which this body
11249 belongs. */
11251 tree
11253 {
11260 ? NULL
11263 /* Locate the last statement in BODY. See c_end_compound_stmt
11264 about always returning a BIND_EXPR. */
11268 continue_searching:
11270 {
11276 /* This can happen with degenerate cases like ({ }). No value. */
11280 /* If we're supposed to generate side effects warnings, process
11281 all of the statements except the last. */
11283 {
11286 {
11287 location_t tloc;
11292 }
11293 }
11296 }
11298 /* If the end of the list is exception related, then the list was split
11299 by a call to push_cleanup. Continue searching. */
11302 {
11306 }
11311 /* In the case that the BIND_EXPR is not necessary, return the
11312 expression out from inside it. */
11314 /* Skip nested debug stmts. */
11317 {
11318 /* Even if this looks constant, do not allow it in a constant
11319 expression. */
11321 /* Do not warn if the return value of a statement expression is
11322 unused. */
11325 }
11327 /* Extract the type of said expression. */
11330 /* If we're not returning a value at all, then the BIND_EXPR that
11331 we already have is a fine expression to return. */
11335 /* Now that we've located the expression containing the value, it seems
11336 silly to make voidify_wrapper_expr repeat the process. Create a
11337 temporary of the appropriate type and stick it in a TARGET_EXPR. */
11340 /* Unwrap a no-op NOP_EXPR as added by c_finish_expr_stmt. This avoids
11341 tree_expr_nonnegative_p giving up immediately. */
11350 {
11354 }
11355 }
11356 \f
11357 /* Begin and end compound statements. This is as simple as pushing
11358 and popping new statement lists from the tree. */
11360 tree
11362 {
11367 }
11369 /* End a compound statement. STMT is the statement. LOC is the
11370 location of the compound statement-- this is usually the location
11371 of the opening brace. */
11373 tree
11375 {
11379 {
11383 }
11388 /* If this compound statement is nested immediately inside a statement
11389 expression, then force a BIND_EXPR to be created. Otherwise we'll
11390 do the wrong thing for ({ { 1; } }) or ({ 1; { } }). In particular,
11391 STATEMENT_LISTs merge, and thus we can lose track of what statement
11392 was really last. */
11396 {
11400 }
11403 }
11405 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
11406 when the current scope is exited. EH_ONLY is true when this is not
11407 meant to apply to normal control flow transfer. */
11409 void
11411 {
11423 }
11424 \f
11425 /* Build a vector comparison of ARG0 and ARG1 using CODE opcode
11426 into a value of TYPE type. Comparison is done via VEC_COND_EXPR. */
11428 static tree
11431 {
11437 }
11439 /* Build a binary-operation expression without default conversions.
11440 CODE is the kind of expression to build.
11441 LOCATION is the operator's location.
11442 This function differs from `build' in several ways:
11443 the data type of the result is computed and recorded in it,
11444 warnings are generated if arg data types are invalid,
11445 special handling for addition and subtraction of pointers is known,
11446 and some optimization is done (operations on narrow ints
11447 are done in the narrower type when that gives the same result).
11448 Constant folding is also done before the result is returned.
11450 Note that the operands will never have enumeral types, or function
11451 or array types, because either they will have the default conversions
11452 performed or they have both just been converted to some other type in which
11453 the arithmetic is to be done. */
11455 tree
11458 {
11460 tree eptype;
11468 /* Expression code to give to the expression when it is built.
11469 Normally this is CODE, which is what the caller asked for,
11470 but in some special cases we change it. */
11473 /* Data type in which the computation is to be performed.
11474 In the simplest cases this is the common type of the arguments. */
11477 /* When the computation is in excess precision, the type of the
11478 final EXCESS_PRECISION_EXPR. */
11481 /* Nonzero means operands have already been type-converted
11482 in whatever way is necessary.
11483 Zero means they need to be converted to RESULT_TYPE. */
11486 /* Nonzero means create the expression with this type, rather than
11487 RESULT_TYPE. */
11490 /* Nonzero means after finally constructing the expression
11491 convert it to this type. */
11494 /* Nonzero if this is an operation like MIN or MAX which can
11495 safely be computed in short if both args are promoted shorts.
11496 Also implies COMMON.
11497 -1 indicates a bitwise operation; this makes a difference
11498 in the exact conditions for when it is safe to do the operation
11499 in a narrower mode. */
11502 /* Nonzero if this is a comparison operation;
11503 if both args are promoted shorts, compare the original shorts.
11504 Also implies COMMON. */
11507 /* Nonzero if this is a right-shift operation, which can be computed on the
11508 original short and then promoted if the operand is a promoted short. */
11511 /* Nonzero means set RESULT_TYPE to the common type of the args. */
11514 /* True means types are compatible as far as ObjC is concerned. */
11517 /* True means this is an arithmetic operation that may need excess
11518 precision. */
11521 /* True means this is a boolean operation that converts both its
11522 operands to truth-values. */
11525 /* Remember whether we're doing / or %. */
11528 /* Remember whether we're doing << or >>. */
11531 /* Tree holding instrumentation expression. */
11548 {
11551 int_const = (int_const_or_overflow
11554 }
11555 else
11558 /* Do not apply default conversion in mixed vector/scalar expression. */
11561 {
11564 }
11570 /* The expression codes of the data types of the arguments tell us
11571 whether the arguments are integers, floating, pointers, etc. */
11575 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
11579 /* If an error was already reported for one of the arguments,
11580 avoid reporting another error. */
11595 {
11598 }
11601 {
11619 /* Excess precision for implicit conversions of integers to
11620 floating point in C11 and later. */
11621 may_need_excess_precision = (flag_isoc11
11629 }
11631 {
11634 }
11637 {
11640 }
11642 {
11645 }
11648 {
11651 }
11655 /* In case when one of the operands of the binary operation is
11656 a vector and another is a scalar -- convert scalar to vector. */
11659 {
11664 {
11668 {
11670 tree sc;
11681 }
11683 {
11685 tree sc;
11696 }
11699 }
11700 }
11703 {
11705 /* Handle the pointer + int case. */
11707 {
11710 }
11712 {
11715 }
11716 else
11721 /* Subtraction of two similar pointers.
11722 We must subtract them as integers, then divide by object size. */
11725 {
11728 }
11729 /* Handle pointer minus int. Just like pointer plus int. */
11731 {
11734 }
11735 else
11759 {
11770 else
11771 /* Although it would be tempting to shorten always here, that
11772 loses on some targets, since the modulo instruction is
11773 undefined if the quotient can't be represented in the
11774 computation mode. We shorten only if unsigned or if
11775 dividing by something we know != -1. */
11780 }
11788 /* Allow vector types which are not floating point types. */
11807 {
11808 /* Although it would be tempting to shorten always here, that loses
11809 on some targets, since the modulo instruction is undefined if the
11810 quotient can't be represented in the computation mode. We shorten
11811 only if unsigned or if dividing by something we know != -1. */
11816 }
11830 {
11831 /* Result of these operations is always an int,
11832 but that does not mean the operands should be
11833 converted to ints! */
11836 {
11839 }
11840 else
11843 {
11846 }
11847 else
11851 }
11853 {
11854 int_const_or_overflow = (int_operands
11858 int_const = (int_const_or_overflow
11862 }
11864 {
11865 int_const_or_overflow = (int_operands
11869 int_const = (int_const_or_overflow
11873 }
11876 /* Shift operations: result has same type as first operand;
11877 always convert second operand to int.
11878 Also set SHORT_SHIFT if shifting rightward. */
11887 {
11890 }
11895 {
11898 {
11900 {
11905 }
11907 {
11911 {
11916 }
11917 }
11918 else
11919 {
11924 {
11929 }
11930 }
11931 }
11933 /* Use the type of the value to be shifted. */
11935 /* Avoid converting op1 to result_type later. */
11937 }
11947 {
11950 }
11955 {
11959 {
11960 /* Don't reject a left shift of a negative value in a context
11961 where a constant expression is needed in C90. */
11967 }
11969 {
11971 {
11976 }
11978 {
11982 {
11987 }
11988 }
11990 {
11995 }
12000 }
12002 /* Use the type of the value to be shifted. */
12004 /* Avoid converting op1 to result_type later. */
12006 }
12012 {
12013 tree intt;
12015 {
12019 }
12023 {
12027 }
12029 /* It's not precisely specified how the usual arithmetic
12030 conversions apply to the vector types. Here, we use
12031 the unsigned type if one of the operands is signed and
12032 the other one is unsigned. */
12034 {
12037 else
12041 }
12043 /* Always construct signed integer vector type. */
12045 (SCALAR_TYPE_MODE
12048 {
12053 }
12059 }
12062 OPT_Wfloat_equal,
12064 /* Result of comparison is always int,
12065 but don't convert the args to int! */
12073 {
12077 {
12080 OPT_Waddress,
12081 "the comparison will always evaluate as %<false%> "
12084 else
12086 OPT_Waddress,
12087 "the comparison will always evaluate as %<true%> "
12090 }
12092 }
12094 {
12098 {
12101 OPT_Waddress,
12102 "the comparison will always evaluate as %<false%> "
12105 else
12107 OPT_Waddress,
12108 "the comparison will always evaluate as %<true%> "
12111 }
12113 }
12115 {
12122 /* Anything compares with void *. void * compares with anything.
12123 Otherwise, the targets must be compatible
12124 and both must be object or both incomplete. */
12128 {
12132 }
12134 {
12138 }
12140 {
12144 }
12145 else
12146 /* Avoid warning about the volatile ObjC EH puts on decls. */
12152 {
12154 result_type = build_pointer_type
12156 }
12157 }
12159 {
12162 }
12164 {
12167 }
12180 {
12181 tree intt;
12183 {
12187 }
12191 {
12195 }
12197 /* It's not precisely specified how the usual arithmetic
12198 conversions apply to the vector types. Here, we use
12199 the unsigned type if one of the operands is signed and
12200 the other one is unsigned. */
12202 {
12205 else
12209 }
12211 /* Always construct signed integer vector type. */
12213 (SCALAR_TYPE_MODE
12216 {
12221 }
12227 }
12235 {
12238 addr_space_t as_common;
12241 {
12255 }
12257 {
12261 }
12262 else
12263 {
12265 result_type = build_pointer_type
12269 }
12270 }
12272 {
12280 }
12282 {
12290 }
12292 {
12295 }
12297 {
12300 }
12304 {
12310 }
12321 }
12330 {
12332 maybe_range_label_for_tree_type_mismatch
12339 }
12344 &&
12348 {
12354 {
12357 "implicit conversion from %qT to %qT "
12358 "to match other operand of binary "
12360 location);
12363 }
12372 {
12373 /* An operation on mixed real/complex operands must be
12374 handled specially, but the language-independent code can
12375 more easily optimize the plain complex arithmetic if
12376 -fno-signed-zeros. */
12380 {
12383 }
12385 {
12390 }
12391 else
12392 {
12397 }
12401 {
12408 {
12413 /* Fall through. */
12420 }
12421 }
12422 else
12423 {
12430 {
12434 /* Fall through. */
12444 }
12445 }
12448 }
12450 /* For certain operations (which identify themselves by shorten != 0)
12451 if both args were extended from the same smaller type,
12452 do the arithmetic in that type and then extend.
12454 shorten !=0 and !=1 indicates a bitwise operation.
12455 For them, this optimization is safe only if
12456 both args are zero-extended or both are sign-extended.
12457 Otherwise, we might change the result.
12458 Eg, (short)-1 | (unsigned short)-1 is (int)-1
12459 but calculated in (unsigned short) it would be (unsigned short)-1. */
12462 {
12466 }
12468 /* Shifts can be shortened if shifting right. */
12471 {
12482 /* We can shorten only if the shift count is less than the
12483 number of bits in the smaller type size. */
12485 /* We cannot drop an unsigned shift after sign-extension. */
12487 {
12488 /* Do an unsigned shift if the operand was zero-extended. */
12489 result_type
12492 /* Convert value-to-be-shifted to that type. */
12496 }
12497 }
12499 /* Comparison operations are shortened too but differently.
12500 They identify themselves by setting short_compare = 1. */
12503 {
12504 /* Don't write &op0, etc., because that would prevent op0
12505 from being kept in a register.
12506 Instead, make copies of the our local variables and
12507 pass the copies by reference, then copy them back afterward. */
12510 tree val
12515 {
12518 }
12525 {
12531 {
12534 }
12535 else
12536 {
12537 /* Fold for the sake of possible warnings, as in
12538 build_conditional_expr. This requires the
12539 "original" values to be folded, not just op0 and
12540 op1. */
12541 c_inhibit_evaluation_warnings++;
12546 c_inhibit_evaluation_warnings--;
12548 require_constant_value,
12549 NULL);
12551 require_constant_value,
12552 NULL);
12553 }
12560 {
12565 }
12566 }
12567 }
12568 }
12570 /* At this point, RESULT_TYPE must be nonzero to avoid an error message.
12571 If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
12572 Then the expression will be built.
12573 It will be given type FINAL_TYPE if that is nonzero;
12574 otherwise, it will be given type RESULT_TYPE. */
12577 {
12578 /* Favor showing any expression locations that are available. */
12583 }
12586 {
12590 {
12593 }
12594 }
12597 {
12599 semantic_result_type);
12601 semantic_result_type);
12603 /* This can happen if one operand has a vector type, and the other
12604 has a different type. */
12607 }
12614 {
12615 /* OP0 and/or OP1 might have side-effects. */
12625 }
12627 /* Treat expressions in initializers specially as they can't trap. */
12629 ret = (require_constant_value
12633 else
12638 return_build_binary_op:
12641 ret = (int_operands
12658 }
12661 /* Convert EXPR to be a truth-value, validating its type for this
12662 purpose. LOCATION is the source location for the expression. */
12664 tree
12666 {
12670 {
12672 error_at (location, "used array that cannot be converted to pointer where scalar is required");
12701 }
12706 {
12711 }
12712 else
12713 /* ??? Should we also give an error for vectors rather than leaving
12714 those to give errors later? */
12718 {
12721 else
12723 }
12727 }
12728 \f
12730 /* Convert EXPR to a contained DECL, updating *TC, *TI and *SE as
12731 required. */
12733 tree
12735 {
12737 {
12739 /* Executing a compound literal inside a function reinitializes
12740 it. */
12744 }
12745 else
12747 }
12748 \f
12749 /* Generate OMP construct CODE, with BODY and CLAUSES as its compound
12750 statement. LOC is the location of the construct. */
12752 tree
12754 tree clauses)
12755 {
12765 }
12767 /* Generate OACC_DATA, with CLAUSES and BLOCK as its compound
12768 statement. LOC is the location of the OACC_DATA. */
12770 tree
12772 {
12773 tree stmt;
12784 }
12786 /* Generate OACC_HOST_DATA, with CLAUSES and BLOCK as its compound
12787 statement. LOC is the location of the OACC_HOST_DATA. */
12789 tree
12791 {
12792 tree stmt;
12803 }
12805 /* Like c_begin_compound_stmt, except force the retention of the BLOCK. */
12807 tree
12809 {
12810 tree block;
12816 }
12818 /* Generate OMP_PARALLEL, with CLAUSES and BLOCK as its compound
12819 statement. LOC is the location of the OMP_PARALLEL. */
12821 tree
12823 {
12824 tree stmt;
12835 }
12837 /* Like c_begin_compound_stmt, except force the retention of the BLOCK. */
12839 tree
12841 {
12842 tree block;
12848 }
12850 /* Generate OMP_TASK, with CLAUSES and BLOCK as its compound
12851 statement. LOC is the location of the #pragma. */
12853 tree
12855 {
12856 tree stmt;
12867 }
12869 /* Generate GOMP_cancel call for #pragma omp cancel. */
12871 void
12873 {
12884 else
12885 {
12887 "%<parallel%>, %<for%>, %<sections%> or %<taskgroup%> "
12890 }
12893 {
12898 else
12899 {
12902 {
12908 }
12909 }
12915 }
12916 else
12920 ifc);
12922 }
12924 /* Generate GOMP_cancellation_point call for
12925 #pragma omp cancellation point. */
12927 void
12929 {
12940 else
12941 {
12943 "%<parallel%>, %<for%>, %<sections%> or %<taskgroup%> "
12946 }
12950 }
12952 /* Helper function for handle_omp_array_sections. Called recursively
12953 to handle multiple array-section-subscripts. C is the clause,
12954 T current expression (initially OMP_CLAUSE_DECL), which is either
12955 a TREE_LIST for array-section-subscript (TREE_PURPOSE is low-bound
12956 expression if specified, TREE_VALUE length expression if specified,
12957 TREE_CHAIN is what it has been specified after, or some decl.
12958 TYPES vector is populated with array section types, MAYBE_ZERO_LEN
12959 set to true if any of the array-section-subscript could have length
12960 of zero (explicit or implicit), FIRST_NON_ONE is the index of the
12961 first array-section-subscript which is known not to have length
12962 of one. Given say:
12963 map(a[:b][2:1][:c][:2][:d][e:f][2:5])
12964 FIRST_NON_ONE will be 3, array-section-subscript [:b], [2:1] and [:c]
12965 all are or may have length of 1, array-section-subscript [:2] is the
12966 first one known not to have length 1. For array-section-subscript
12967 <= FIRST_NON_ONE we diagnose non-contiguous arrays if low bound isn't
12968 0 or length isn't the array domain max + 1, for > FIRST_NON_ONE we
12969 can if MAYBE_ZERO_LEN is false. MAYBE_ZERO_LEN will be true in the above
12970 case though, as some lengths could be zero. */
12972 static tree
12976 {
12979 {
12985 {
12989 }
12994 {
12996 {
13001 }
13003 {
13005 {
13009 }
13012 {
13017 else
13019 }
13020 }
13021 }
13023 {
13028 else
13033 }
13036 {
13040 }
13044 {
13049 }
13053 {
13054 /* If the array section is pointer based and the pointer
13055 itself is _Atomic qualified, we need to atomically load
13056 the pointer. */
13057 c_expr expr;
13063 }
13065 }
13080 {
13083 low_bound);
13085 }
13087 {
13090 length);
13092 }
13108 {
13110 {
13115 }
13116 }
13118 {
13120 {
13125 {
13127 {
13132 }
13133 }
13134 else
13136 }
13139 first_non_one++;
13140 }
13142 {
13146 {
13148 "for unknown bound array type length expression must "
13151 }
13154 {
13159 }
13163 {
13168 }
13173 {
13174 tree size
13178 {
13180 {
13182 "low bound %qE above array section size "
13186 }
13188 {
13193 {
13198 }
13200 }
13203 && tree_int_cst_equal
13205 low_bound))
13206 first_non_one++;
13207 }
13209 {
13216 first_non_one++;
13217 }
13219 {
13221 {
13223 "length %qE above array section size "
13227 }
13229 {
13230 tree lbpluslen
13236 {
13238 "high bound %qE above array section size "
13242 }
13243 }
13244 }
13245 }
13247 {
13254 first_non_one++;
13255 }
13257 /* For [lb:] we will need to evaluate lb more than once. */
13259 {
13262 {
13265 }
13266 }
13267 }
13269 {
13271 {
13275 }
13279 {
13284 }
13285 /* If there is a pointer type anywhere but in the very first
13286 array-section-subscript, the array section can't be contiguous. */
13289 {
13294 }
13295 }
13296 else
13297 {
13301 }
13304 /* We will need to evaluate lb more than once. */
13307 {
13310 }
13313 }
13315 /* Handle array sections for clause C. */
13317 static bool
13319 {
13331 ort);
13337 {
13340 /* Need to evaluate side effects in the length expressions
13341 if any. */
13343 {
13345 {
13348 else
13351 }
13353 }
13358 }
13359 else
13360 {
13370 {
13374 i--;
13388 {
13397 {
13398 tree size;
13401 size_one_node);
13403 {
13404 do_warn_noncontiguous:
13406 "array section is not contiguous in %qs "
13410 }
13411 }
13414 {
13417 else
13421 }
13422 }
13423 else
13424 {
13425 tree l;
13435 else
13436 {
13439 size_one_node);
13442 }
13444 {
13446 size_zero_node);
13449 else
13452 }
13454 {
13462 {
13465 {
13470 }
13473 }
13478 }
13479 else
13481 }
13482 }
13488 {
13511 else
13512 {
13517 }
13520 }
13533 {
13552 }
13557 {
13561 }
13562 else
13581 }
13583 }
13585 /* Helper function of finish_omp_clauses. Clone STMT as if we were making
13586 an inline call. But, remap
13587 the OMP_DECL1 VAR_DECL (omp_out resp. omp_orig) to PLACEHOLDER
13588 and OMP_DECL2 VAR_DECL (omp_in resp. omp_priv) to DECL. */
13590 static tree
13593 {
13594 copy_body_data id;
13613 }
13615 /* Helper function of c_finish_omp_clauses, called via walk_tree.
13616 Find OMP_CLAUSE_PLACEHOLDER (passed in DATA) in *TP. */
13618 static tree
13620 {
13624 }
13626 /* Similarly, but also walk aggregate fields. */
13630 static tree
13632 {
13636 {
13637 tree field;
13643 {
13652 pset);
13658 }
13659 }
13664 }
13666 /* Finish OpenMP iterators ITER. Return true if they are errorneous
13667 and clauses containing them should be removed. */
13669 static bool
13671 {
13674 {
13679 tree orig_step;
13683 {
13686 }
13688 {
13690 var);
13693 }
13695 {
13699 }
13701 {
13705 }
13708 {
13711 }
13713 {
13718 }
13725 {
13732 }
13734 {
13738 }
13744 {
13747 }
13749 tree it2;
13751 {
13760 {
13765 }
13767 {
13771 }
13773 {
13777 }
13779 {
13783 }
13784 }
13786 {
13789 }
13794 }
13796 }
13798 /* Ensure that pointers are used in OpenACC attach and detach clauses.
13799 Return true if an error has been detected. */
13801 static bool
13803 {
13807 /* OpenACC attach / detach clauses must be pointers. */
13810 {
13817 {
13821 }
13822 }
13825 }
13827 /* For all elements of CLAUSES, validate them against their constraints.
13828 Remove any elements from the list that are invalid. */
13830 tree
13832 {
13848 /* 1 if normal/task reduction has been seen, -1 if inscan reduction
13849 has been seen, -2 if mixed inscan/normal reduction diagnosed. */
13857 /* If ort == C_ORT_OMP_DECLARE_SIMD used as uniform_head instead. */
13860 /* If ort == C_ORT_OMP used as nontemporal_head or use_device_xxx_head
13861 instead. */
13867 {
13870 }
13873 {
13879 {
13895 {
13897 "%<inscan%> and non-%<inscan%> %<reduction%> clauses "
13900 }
13901 /* FALLTHRU */
13907 {
13909 {
13912 }
13917 {
13919 "%<inscan%> %<reduction%> clause with array "
13923 }
13924 }
13927 {
13930 }
13937 {
13943 {
13946 t);
13949 }
13953 {
13956 t);
13959 }
13969 }
13971 {
13976 }
13979 {
13980 /* Disallow zero sized or potentially zero sized task
13981 reductions. */
13983 {
13989 }
13991 {
13997 }
13998 }
14002 {
14007 {
14039 }
14041 {
14047 }
14048 }
14050 {
14055 }
14057 {
14067 {
14073 }
14083 decl_placeholder ? decl_placeholder
14091 {
14103 decl_placeholder ? decl_placeholder
14106 {
14111 }
14113 c_find_omp_placeholder_r,
14116 }
14117 else
14118 {
14119 tree init;
14123 else
14127 }
14133 }
14135 {
14139 {
14144 }
14150 }
14156 {
14158 "%<nowait%> clause must not be used together "
14162 }
14168 {
14173 }
14182 {
14184 "modifier should not be specified in %<linear%> "
14187 }
14190 {
14192 "linear clause applied to non-integral non-pointer "
14196 }
14198 {
14203 }
14205 {
14208 {
14210 /* map_head bitmap is used as uniform_head if
14211 declare_simd. */
14215 }
14217 {
14219 "%<linear%> clause step %qE is neither constant "
14223 }
14224 }
14226 {
14232 fold_convert
14237 }
14238 else
14243 check_dup_generic:
14245 check_dup_generic_t:
14247 {
14252 }
14259 {
14261 {
14263 ort == C_ORT_ACC
14266 t);
14268 }
14269 else
14271 }
14275 {
14279 }
14282 {
14286 else
14290 }
14291 else
14300 {
14304 }
14307 {
14311 }
14313 {
14317 else
14321 }
14322 else
14331 {
14335 }
14338 {
14342 }
14343 else
14350 {
14354 }
14357 {
14359 "%qE in %<aligned%> clause is neither a pointer nor "
14362 }
14364 {
14369 }
14371 {
14374 t);
14376 }
14377 else
14384 {
14388 }
14390 {
14392 "%qE appears more than once in %<nontemporal%> "
14395 }
14396 else
14403 {
14407 }
14409 {
14412 {
14415 {
14423 sizetype,
14427 {
14430 }
14432 }
14433 }
14435 }
14439 {
14441 last_iterators_remove
14447 }
14448 else
14451 {
14455 {
14457 "%<depend%> clause with %<depobj%> dependence "
14460 }
14462 }
14466 {
14468 "%qE is not lvalue expression nor array section in "
14471 }
14474 {
14478 }
14480 {
14482 {
14484 "%qE does not have %<omp_depend_t%> type in "
14485 "%<depend%> clause with %<depobj%> dependence "
14488 }
14489 }
14491 {
14493 "%qE should not have %<omp_depend_t%> type in "
14494 "%<depend%> clause with dependence type other than "
14497 }
14499 {
14504 else
14505 {
14507 RO_UNARY_STAR);
14515 else
14517 }
14518 }
14527 {
14530 else
14531 {
14534 {
14536 "array section does not have mappable type "
14540 }
14542 {
14547 }
14552 {
14558 {
14561 "%qD appears more than once in motion "
14565 "%qD appears more than once in data "
14567 else
14569 "%qD appears more than once in map "
14572 }
14573 else
14574 {
14577 }
14578 }
14579 }
14585 /* In this case, we have a single array element which is a
14586 pointer, and we already set OMP_CLAUSE_SIZE in
14587 handle_omp_array_sections above. For attach/detach clauses,
14588 reset the OMP_CLAUSE_SIZE (representing a bias) to zero
14589 here. */
14592 }
14594 {
14597 }
14598 /* OpenACC attach / detach clauses must be pointers. */
14600 {
14603 }
14607 /* For attach/detach clauses, set OMP_CLAUSE_SIZE (representing a
14608 bias) to zero here, so it is not set erroneously to the pointer
14609 size later on in gimplify.c. */
14613 {
14615 {
14620 }
14622 {
14627 }
14629 {
14634 }
14636 {
14639 {
14644 }
14647 {
14652 else
14654 }
14655 }
14659 {
14662 }
14663 }
14665 {
14670 }
14672 {
14677 }
14691 {
14696 }
14700 {
14705 }
14708 {
14711 {
14715 }
14717 {
14721 else
14725 }
14726 else
14728 }
14730 {
14737 else
14741 }
14744 {
14748 else
14752 }
14753 else
14754 {
14759 }
14767 ;
14769 {
14772 "%qE is neither a variable nor a function name in "
14775 else
14780 }
14782 {
14787 }
14789 {
14794 }
14798 {
14800 "%qE appears more than once on the same "
14803 }
14804 else
14811 {
14815 else
14820 }
14821 /* map_head bitmap is used as uniform_head if declare_simd. */
14829 {
14832 {
14837 }
14839 {
14844 }
14845 }
14856 {
14858 "%<nowait%> clause must not be used together "
14862 }
14869 {
14871 "%<order%> clause must not be used together "
14875 }
14877 {
14878 /* Silently remove duplicates. */
14881 }
14941 {
14943 "%<order%> clause must not be used together "
14947 }
14963 {
14965 "%<inbranch%> clause is incompatible with "
14969 }
14980 {
14985 }
14990 }
14993 {
14997 {
15001 }
15004 {
15010 {
15017 /* The __func__ variable and similar function-local
15018 predefined variables may be listed in a shared or
15019 firstprivate clause. */
15028 }
15030 {
15036 }
15040 {
15042 "%<const%> qualified %qE may appear only in "
15045 }
15046 }
15047 }
15051 else
15053 }
15056 && safelen
15059 {
15061 "%<simdlen%> clause value is bigger than "
15065 }
15068 && schedule_clause
15071 {
15073 "%<nonmonotonic%> schedule modifier specified together "
15079 }
15082 {
15084 "%qs clause specified together with %<inscan%> "
15087 }
15090 {
15092 "%qs clause specified together with %<inscan%> "
15095 }
15099 {
15105 {
15107 "%<linear%> clause step is a parameter %qD not "
15111 }
15117 else
15119 }
15122 {
15124 "%<nogroup%> clause must not be used together with "
15127 }
15131 }
15133 /* Return code to initialize DST with a copy constructor from SRC.
15134 C doesn't have copy constructors nor assignment operators, only for
15135 _Atomic vars we need to perform __atomic_load from src into a temporary
15136 followed by __atomic_store of the temporary to dst. */
15138 tree
15140 {
15155 /* Expansion of a generic atomic load may require an addition
15156 element, so allocate enough to prevent a resize. */
15159 /* Build __atomic_load (&src, &tmp, SEQ_CST); */
15168 /* Build __atomic_store (&dst, &tmp, SEQ_CST); */
15175 }
15177 /* Create a transaction node. */
15179 tree
15181 {
15188 }
15190 /* Make a variant type in the proper way for C/C++, propagating qualifiers
15191 down to the element type of an array. If ORIG_QUAL_TYPE is not
15192 NULL, then it should be used as the qualified type
15193 ORIG_QUAL_INDIRECT levels down in array type derivation (to
15194 preserve information about the typedef name from which an array
15195 type was derived). */
15197 tree
15200 {
15205 {
15206 tree t;
15211 /* See if we already have an identically qualified type. */
15214 else
15216 {
15223 }
15225 {
15236 {
15237 tree unqualified_canon
15242 {
15243 unqualified_canon
15246 }
15249 }
15250 else
15252 }
15254 }
15256 /* A restrict-qualified pointer type must be a pointer to object or
15257 incomplete type. Note that the use of POINTER_TYPE_P also allows
15258 REFERENCE_TYPEs, which is appropriate for C++. */
15262 {
15265 }
15268 ? orig_qual_type
15270 /* A variant type does not inherit the list of incomplete vars from the
15271 type main variant. */
15277 }
15279 /* Build a VA_ARG_EXPR for the C parser. */
15281 tree
15283 {
15286 /* VA_ARG_EXPR cannot be used for a scalar va_list with reverse storage
15287 order because it takes the address of the expression. */
15290 {
15293 }
15295 {
15299 }
15304 }
15306 /* Return truthvalue of whether T1 is the same tree structure as T2.
15307 Return 1 if they are the same. Return false if they are different. */
15309 bool
15311 {
15330 /* They might have become equal now. */
15338 {
15362 /* We need to do this when determining whether or not two
15363 non-type pointer to member function template arguments
15364 are the same. */
15368 {
15372 {
15377 }
15378 }
15392 {
15407 }
15410 {
15414 /* Special case: if either target is an unallocated VAR_DECL,
15415 it means that it's going to be unified with whatever the
15416 TARGET_EXPR is really supposed to initialize, so treat it
15417 as being equivalent to anything. */
15428 }
15445 {
15454 }
15458 }
15461 {
15469 {
15473 {
15485 }
15496 }
15502 }
15503 /* We can get here with --disable-checking. */
15505 }
15507 /* Returns true when the function declaration FNDECL is implicit,
15508 introduced as a result of a call to an otherwise undeclared
15509 function, and false otherwise. */
15511 bool
15513 {
15515 }