| blob | fd0a7f81a7a92461f8939208e77d1d169e075d01 |
1 /* Build expressions with type checking for C compiler.
2 Copyright (C) 1987-2022 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
9 version.
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14 for more details.
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
21 /* This file is part of the C front end.
22 It contains routines to build C expressions given their operands,
23 including computing the types of the result, C-specific error checks,
24 and some optimization. */
56 /* Possible cases of implicit conversions. Used to select diagnostic messages
57 and control folding initializers in convert_for_assignment. */
59 ic_argpass,
60 ic_assign,
61 ic_init,
62 ic_init_const,
63 ic_return
64 };
66 /* The level of nesting inside "__alignof__". */
69 /* The level of nesting inside "sizeof". */
72 /* The level of nesting inside "typeof". */
75 /* True when parsing OpenMP loop expressions. */
78 /* The argument of last parsed sizeof expression, only to be tested
79 if expr.original_code == SIZEOF_EXPR. */
80 tree c_last_sizeof_arg;
81 location_t c_last_sizeof_loc;
83 /* Nonzero if we might need to print a "missing braces around
84 initializer" message within this initializer. */
101 tree);
127 \f
128 /* Return true if EXP is a null pointer constant, false otherwise. */
130 static bool
132 {
133 /* This should really operate on c_expr structures, but they aren't
134 yet available everywhere required. */
143 }
145 /* EXPR may appear in an unevaluated part of an integer constant
146 expression, but not in an evaluated part. Wrap it in a
147 C_MAYBE_CONST_EXPR, or mark it with TREE_OVERFLOW if it is just an
148 INTEGER_CST and we cannot create a C_MAYBE_CONST_EXPR. */
150 static tree
152 {
153 tree ret;
155 {
158 }
159 else
160 {
163 }
165 }
167 /* Having checked whether EXPR may appear in an unevaluated part of an
168 integer constant expression and found that it may, remove any
169 C_MAYBE_CONST_EXPR noting this fact and return the resulting
170 expression. */
174 {
177 else
179 }
185 const_tree t1;
186 const_tree t2;
187 /* The return value of tagged_types_tu_compatible_p if we had seen
188 these two types already. */
190 };
195 /* Do `exp = require_complete_type (loc, exp);' to make sure exp
196 does not have an incomplete type. (That includes void types.)
197 LOC is the location of the use. */
199 tree
201 {
207 /* First, detect a valid value with a complete type. */
213 }
215 /* Print an error message for invalid use of an incomplete type.
216 VALUE is the expression that was used (or 0 if that isn't known)
217 and TYPE is the type that was invalid. LOC is the location for
218 the error. */
220 void
222 {
223 /* Avoid duplicate error message. */
229 else
230 {
231 retry:
232 /* We must print an error message. Be clever about what it says. */
235 {
247 {
249 {
252 }
255 }
261 }
265 else
266 /* If this type has a typedef-name, the TYPE_NAME is a TYPE_DECL. */
268 }
269 }
271 /* Given a type, apply default promotions wrt unnamed function
272 arguments and return the new type. */
274 tree
276 {
282 {
283 /* Preserve unsignedness if not really getting any wider. */
287 else
289 }
297 }
299 /* Return true if between two named address spaces, whether there is a superset
300 named address space that encompasses both address spaces. If there is a
301 superset, return which address space is the superset. */
303 static bool
305 {
307 {
310 }
312 {
315 }
317 {
320 }
321 else
323 }
325 /* Return a variant of TYPE which has all the type qualifiers of LIKE
326 as well as those of TYPE. */
328 static tree
330 {
333 addr_space_t as_common;
335 /* If the two named address spaces are different, determine the common
336 superset address space. If there isn't one, raise an error. */
338 {
342 }
348 }
350 /* Return true iff the given tree T is a variable length array. */
352 bool
354 {
359 }
361 /* If NTYPE is a type of a non-variadic function with a prototype
362 and OTYPE is a type of a function without a prototype and ATTRS
363 contains attribute format, diagnosess and removes it from ATTRS.
364 Returns the result of build_type_attribute_variant of NTYPE and
365 the (possibly) modified ATTRS. */
367 static tree
369 {
373 {
375 "%qs attribute cannot be applied to a function that "
378 }
381 }
382 /* Return the composite type of two compatible types.
384 We assume that comptypes has already been done and returned
385 nonzero; if that isn't so, this may crash. In particular, we
386 assume that qualifiers match. */
388 tree
390 {
393 tree attributes;
395 /* Save time if the two types are the same. */
399 /* If one type is nonsense, use the other. */
408 /* Merge the attributes. */
411 /* If one is an enumerated type and the other is the compatible
412 integer type, the composite type might be either of the two
413 (DR#013 question 3). For consistency, use the enumerated type as
414 the composite type. */
424 {
426 /* For two pointers, do this recursively on the target type. */
427 {
434 }
437 {
440 tree unqual_elt;
447 /* We should not have any type quals on arrays at all. */
457 d1_variable = (!d1_zero
460 d2_variable = (!d2_zero
466 /* Save space: see if the result is identical to one of the args. */
479 /* Merge the element types, and have a size if either arg has
480 one. We may have qualifiers on the element types. To set
481 up TYPE_MAIN_VARIANT correctly, we need to form the
482 composite of the unqualified types and add the qualifiers
483 back at the end. */
488 && (d2_variable
489 || d2_zero
491 ? t1
493 /* Ensure a composite type involving a zero-length array type
494 is a zero-length type not an incomplete type. */
498 {
501 }
504 }
510 {
511 /* Try harder not to create a new aggregate type. */
516 }
520 /* Function types: prefer the one that specified arg types.
521 If both do, merge the arg types. Also merge the return types. */
522 {
530 /* Save space: see if the result is identical to one of the args. */
536 /* Simple way if one arg fails to specify argument types. */
538 {
542 }
544 {
548 }
550 /* If both args specify argument types, we must merge the two
551 lists, argument by argument. */
556 ;
565 {
566 /* A null type means arg type is not specified.
567 Take whatever the other function type has. */
569 {
572 }
574 {
577 }
579 /* Given wait (union {union wait *u; int *i} *)
580 and wait (union wait *),
581 prefer union wait * as type of parm. */
584 {
585 tree memb;
592 {
598 {
604 }
605 }
606 }
609 {
610 tree memb;
617 {
623 {
629 }
630 }
631 }
633 parm_done: ;
634 }
638 }
639 /* FALLTHRU */
643 }
645 }
647 /* Return the type of a conditional expression between pointers to
648 possibly differently qualified versions of compatible types.
650 We assume that comp_target_types has already been done and returned
651 nonzero; if that isn't so, this may crash. */
653 static tree
655 {
656 tree attributes;
659 tree target;
664 /* Save time if the two types are the same. */
668 /* If one type is nonsense, use the other. */
677 /* Merge the attributes. */
680 /* Find the composite type of the target types, and combine the
681 qualifiers of the two types' targets. Do not lose qualifiers on
682 array element types by taking the TYPE_MAIN_VARIANT. */
691 /* Strip array types to get correct qualifier for pointers to arrays */
695 /* For function types do not merge const qualifiers, but drop them
696 if used inconsistently. The middle-end uses these to mark const
697 and noreturn functions. */
700 else
703 /* If the two named address spaces are different, determine the common
704 superset address space. This is guaranteed to exist due to the
705 assumption that comp_target_type returned non-zero. */
715 }
717 /* Return the common type for two arithmetic types under the usual
718 arithmetic conversions. The default conversions have already been
719 applied, and enumerated types converted to their compatible integer
720 types. The resulting type is unqualified and has no attributes.
722 This is the type for the result of most arithmetic operations
723 if the operands have the given two types. */
725 static tree
727 {
731 /* If one type is nonsense, use the other. */
744 {
747 }
750 {
753 }
755 /* Save time if the two types are the same. */
769 /* When one operand is a decimal float type, the other operand cannot be
770 a generic float type or a complex type. We also disallow vector types
771 here. */
774 {
776 {
779 }
781 {
784 }
786 {
790 }
791 }
793 /* If one type is a vector type, return that type. (How the usual
794 arithmetic conversions apply to the vector types extension is not
795 precisely specified.) */
802 /* If one type is complex, form the common type of the non-complex
803 components, then make that complex. Use T1 or T2 if it is the
804 required type. */
806 {
815 else
817 }
819 /* If only one is real, use it as the result. */
827 /* If both are real and either are decimal floating point types, use
828 the decimal floating point type with the greater precision. */
831 {
841 }
843 /* Deal with fixed-point types. */
845 {
853 /* If one input type is saturating, the result type is saturating. */
857 /* If both fixed-point types are unsigned, the result type is unsigned.
858 When mixing fixed-point and integer types, follow the sign of the
859 fixed-point type.
860 Otherwise, the result type is signed. */
869 /* The result type is signed. */
871 {
872 /* If the input type is unsigned, we need to convert to the
873 signed type. */
875 {
881 else
885 }
887 {
893 else
897 }
898 }
901 {
904 }
905 else
906 {
908 /* Signed integers need to subtract one sign bit. */
910 }
913 {
916 }
917 else
918 {
920 /* Signed integers need to subtract one sign bit. */
922 }
927 satp);
928 }
930 /* Both real or both integers; use the one with greater precision. */
937 /* Same precision. Prefer long longs to longs to ints when the
938 same precision, following the C99 rules on integer type rank
939 (which are equivalent to the C90 rules for C90 types). */
947 {
950 else
952 }
960 {
961 /* But preserve unsignedness from the other type,
962 since long cannot hold all the values of an unsigned int. */
965 else
967 }
969 /* For floating types of the same TYPE_PRECISION (which we here
970 assume means either the same set of values, or sets of values
971 neither a subset of the other, with behavior being undefined in
972 the latter case), follow the rules from TS 18661-3: prefer
973 interchange types _FloatN, then standard types long double,
974 double, float, then extended types _FloatNx. For extended types,
975 check them starting with _Float128x as that seems most consistent
976 in spirit with preferring long double to double; for interchange
977 types, also check in that order for consistency although it's not
978 possible for more than one of them to have the same
979 precision. */
987 /* Likewise, prefer long double to double even if same size. */
991 /* Likewise, prefer double to float even if same size.
992 We got a couple of embedded targets with 32 bit doubles, and the
993 pdp11 might have 64 bit floats. */
1004 /* Otherwise prefer the unsigned one. */
1008 else
1010 }
1011 \f
1012 /* Wrapper around c_common_type that is used by c-common.cc and other
1013 front end optimizations that remove promotions. ENUMERAL_TYPEs
1014 are allowed here and are converted to their compatible integer types.
1015 BOOLEAN_TYPEs are allowed here and return either boolean_type_node or
1016 preferably a non-Boolean type as the common type. */
1017 tree
1019 {
1025 /* If both types are BOOLEAN_TYPE, then return boolean_type_node. */
1030 /* If either type is BOOLEAN_TYPE, then return the other. */
1037 }
1039 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
1040 or various other operations. Return 2 if they are compatible
1041 but a warning may be needed if you use them together. */
1043 int
1045 {
1053 }
1055 /* Like comptypes, but if it returns non-zero because enum and int are
1056 compatible, it sets *ENUM_AND_INT_P to true. */
1058 int
1060 {
1068 }
1070 /* Like comptypes, but if it returns nonzero for different types, it
1071 sets *DIFFERENT_TYPES_P to true. */
1073 int
1076 {
1084 }
1085 \f
1086 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
1087 or various other operations. Return 2 if they are compatible
1088 but a warning may be needed if you use them together. If
1089 ENUM_AND_INT_P is not NULL, and one type is an enum and the other a
1090 compatible integer type, then this sets *ENUM_AND_INT_P to true;
1091 *ENUM_AND_INT_P is never set to false. If DIFFERENT_TYPES_P is not
1092 NULL, and the types are compatible but different enough not to be
1093 permitted in C11 typedef redeclarations, then this sets
1094 *DIFFERENT_TYPES_P to true; *DIFFERENT_TYPES_P is never set to
1095 false, but may or may not be set if the types are incompatible.
1096 This differs from comptypes, in that we don't free the seen
1097 types. */
1099 static int
1102 {
1107 /* Suppress errors caused by previously reported errors. */
1113 /* Enumerated types are compatible with integer types, but this is
1114 not transitive: two enumerated types in the same translation unit
1115 are compatible with each other only if they are the same type. */
1120 {
1123 {
1128 }
1129 }
1133 {
1136 {
1141 }
1142 }
1147 /* Different classes of types can't be compatible. */
1152 /* Qualifiers must match. C99 6.7.3p9 */
1157 /* Allow for two different type nodes which have essentially the same
1158 definition. Note that we already checked for equality of the type
1159 qualifiers (just above). */
1165 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1169 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1173 {
1177 /* With these nodes, we can't determine type equivalence by
1178 looking at what is stored in the nodes themselves, because
1179 two nodes might have different TYPE_MAIN_VARIANTs but still
1180 represent the same type. For example, wchar_t and int could
1181 have the same properties (TYPE_PRECISION, TYPE_MIN_VALUE,
1182 TYPE_MAX_VALUE, etc.), but have different TYPE_MAIN_VARIANTs
1183 and are distinct types. On the other hand, int and the
1184 following typedef
1186 typedef int INT __attribute((may_alias));
1188 have identical properties, different TYPE_MAIN_VARIANTs, but
1189 represent the same type. The canonical type system keeps
1190 track of equivalence in this case, so we fall back on it. */
1194 /* Do not remove mode information. */
1204 different_types_p);
1208 {
1215 /* Target types must match incl. qualifiers. */
1218 enum_and_int_p,
1225 /* Sizes must match unless one is missing or variable. */
1232 d1_variable = (!d1_zero
1235 d2_variable = (!d2_zero
1254 }
1260 {
1270 different_types_p);
1272 different_types_p);
1273 }
1284 }
1286 }
1288 /* Return 1 if TTL and TTR are pointers to types that are equivalent, ignoring
1289 their qualifiers, except for named address spaces. If the pointers point to
1290 different named addresses, then we must determine if one address space is a
1291 subset of the other. */
1293 static int
1295 {
1302 addr_space_t as_common;
1305 /* Fail if pointers point to incompatible address spaces. */
1309 /* For pedantic record result of comptypes on arrays before losing
1310 qualifiers on the element type below. */
1317 /* Qualifiers on element types of array types that are
1318 pointer targets are lost by taking their TYPE_MAIN_VARIANT. */
1332 pedwarn_c11 (location, OPT_Wpedantic, "invalid use of pointers to arrays with different qualifiers "
1343 }
1344 \f
1345 /* Subroutines of `comptypes'. */
1347 /* Determine whether two trees derive from the same translation unit.
1348 If the CONTEXT chain ends in a null, that tree's context is still
1349 being parsed, so if two trees have context chains ending in null,
1350 they're in the same translation unit. */
1352 bool
1354 {
1357 {
1365 }
1369 {
1377 }
1380 }
1382 /* Allocate the seen two types, assuming that they are compatible. */
1386 {
1394 /* The C standard says that two structures in different translation
1395 units are compatible with each other only if the types of their
1396 fields are compatible (among other things). We assume that they
1397 are compatible until proven otherwise when building the cache.
1398 An example where this can occur is:
1399 struct a
1400 {
1401 struct a *next;
1402 };
1403 If we are comparing this against a similar struct in another TU,
1404 and did not assume they were compatible, we end up with an infinite
1405 loop. */
1408 }
1410 /* Free the seen types until we get to TU_TIL. */
1412 static void
1414 {
1417 {
1422 }
1424 }
1426 /* Return 1 if two 'struct', 'union', or 'enum' types T1 and T2 are
1427 compatible. If the two types are not the same (which has been
1428 checked earlier), this can only happen when multiple translation
1429 units are being compiled. See C99 6.2.7 paragraph 1 for the exact
1430 rules. ENUM_AND_INT_P and DIFFERENT_TYPES_P are as in
1431 comptypes_internal. */
1433 static int
1436 {
1440 /* We have to verify that the tags of the types are the same. This
1441 is harder than it looks because this may be a typedef, so we have
1442 to go look at the original type. It may even be a typedef of a
1443 typedef...
1444 In the case of compiler-created builtin structs the TYPE_DECL
1445 may be a dummy, with no DECL_ORIGINAL_TYPE. Don't fault. */
1456 /* C90 didn't have the requirement that the two tags be the same. */
1460 /* C90 didn't say what happened if one or both of the types were
1461 incomplete; we choose to follow C99 rules here, which is that they
1462 are compatible. */
1467 {
1472 }
1475 {
1477 {
1479 /* Speed up the case where the type values are in the same order. */
1484 {
1486 }
1489 {
1493 {
1496 }
1497 }
1500 {
1502 }
1504 {
1507 }
1510 {
1513 }
1516 {
1520 {
1523 }
1524 }
1526 }
1529 {
1532 {
1535 }
1537 /* Speed up the common case where the fields are in the same order. */
1540 {
1551 {
1554 }
1561 {
1564 }
1565 }
1567 {
1570 }
1573 {
1578 {
1582 enum_and_int_p,
1583 different_types_p);
1588 {
1591 }
1602 }
1604 {
1607 }
1608 }
1611 }
1614 {
1620 {
1636 }
1639 else
1642 }
1646 }
1647 }
1649 /* Return 1 if two function types F1 and F2 are compatible.
1650 If either type specifies no argument types,
1651 the other must specify a fixed number of self-promoting arg types.
1652 Otherwise, if one type specifies only the number of arguments,
1653 the other must specify that number of self-promoting arg types.
1654 Otherwise, the argument types must match.
1655 ENUM_AND_INT_P and DIFFERENT_TYPES_P are as in comptypes_internal. */
1657 static int
1660 {
1662 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1670 /* 'volatile' qualifiers on a function's return type used to mean
1671 the function is noreturn. */
1691 /* An unspecified parmlist matches any specified parmlist
1692 whose argument types don't need default promotions. */
1695 {
1698 /* If one of these types comes from a non-prototype fn definition,
1699 compare that with the other type's arglist.
1700 If they don't match, ask for a warning (but no error). */
1706 }
1708 {
1716 }
1718 /* Both types have argument lists: compare them and propagate results. */
1720 different_types_p);
1722 }
1724 /* Check two lists of types for compatibility, returning 0 for
1725 incompatible, 1 for compatible, or 2 for compatible with
1726 warning. ENUM_AND_INT_P and DIFFERENT_TYPES_P are as in
1727 comptypes_internal. */
1729 static int
1732 {
1733 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1738 {
1742 /* If one list is shorter than the other,
1743 they fail to match. */
1751 TYPE_QUAL_ATOMIC)
1756 TYPE_QUAL_ATOMIC)
1758 /* A null pointer instead of a type
1759 means there is supposed to be an argument
1760 but nothing is specified about what type it has.
1761 So match anything that self-promotes. */
1766 {
1769 }
1771 {
1774 }
1775 /* If one of the lists has an error marker, ignore this arg. */
1778 ;
1780 different_types_p)))
1781 {
1784 /* Allow wait (union {union wait *u; int *i} *)
1785 and wait (union wait *) to be compatible. */
1792 {
1793 tree memb;
1796 {
1802 TYPE_QUAL_ATOMIC)
1805 different_types_p))
1807 }
1810 }
1817 {
1818 tree memb;
1821 {
1827 TYPE_QUAL_ATOMIC)
1830 different_types_p))
1832 }
1835 }
1836 else
1838 }
1840 /* comptypes said ok, but record if it said to warn. */
1846 }
1847 }
1848 \f
1849 /* Compute the size to increment a pointer by. When a function type or void
1850 type or incomplete type is passed, size_one_node is returned.
1851 This function does not emit any diagnostics; the caller is responsible
1852 for that. */
1854 static tree
1856 {
1863 /* Convert in case a char is more than one unit. */
1867 }
1868 \f
1869 /* Return either DECL or its known constant value (if it has one). */
1871 tree
1873 {
1880 /* This is invalid if initial value is not constant.
1881 If it has either a function call, a memory reference,
1882 or a variable, then re-evaluating it could give different results. */
1884 /* Check for cases where this is sub-optimal, even though valid. */
1888 }
1890 /* Return either DECL or its known constant value (if it has one).
1891 Like the above, but always return decl outside of functions. */
1893 tree
1895 {
1896 /* Don't change a variable array bound or initial value to a constant
1897 in a place where a variable is invalid. */
1899 }
1901 /* Convert the array expression EXP to a pointer. */
1902 static tree
1904 {
1907 tree adr;
1909 tree ptrtype;
1922 /* In C++ array compound literals are temporary objects unless they are
1923 const or appear in namespace scope, so they are destroyed too soon
1924 to use them for much of anything (c++/53220). */
1926 {
1930 "converting an array compound literal to a pointer "
1932 }
1936 }
1938 /* Convert the function expression EXP to a pointer. */
1939 static tree
1941 {
1951 }
1953 /* Mark EXP as read, not just set, for set but not used -Wunused
1954 warning purposes. */
1956 void
1958 {
1960 {
1970 CASE_CONVERT:
1976 /* Pattern match what build_atomic_assign produces with modifycode
1977 NOP_EXPR. */
1981 {
1987 {
1995 {
2008 }
2010 {
2016 }
2017 }
2018 }
2019 /* FALLTHRU */
2025 }
2026 }
2028 /* Perform the default conversion of arrays and functions to pointers.
2029 Return the result of converting EXP. For any other expression, just
2030 return EXP.
2032 LOC is the location of the expression. */
2034 struct c_expr
2036 {
2042 {
2044 {
2051 {
2055 }
2061 {
2062 /* Before C99, non-lvalue arrays do not decay to pointers.
2063 Normally, using such an array would be invalid; but it can
2064 be used correctly inside sizeof or as a statement expression.
2065 Thus, do not give an error here; an error will result later. */
2067 }
2070 }
2077 }
2080 }
2082 struct c_expr
2084 {
2087 }
2089 /* Return whether EXPR should be treated as an atomic lvalue for the
2090 purposes of load and store handling. */
2092 static bool
2094 {
2102 /* Ignore _Atomic on register variables, since their addresses can't
2103 be taken so (a) atomicity is irrelevant and (b) the normal atomic
2104 sequences wouldn't work. Ignore _Atomic on structures containing
2105 bit-fields, since accessing elements of atomic structures or
2106 unions is undefined behavior (C11 6.5.2.3#5), but it's unclear if
2107 it's undefined at translation time or execution time, and the
2108 normal atomic sequences again wouldn't work. */
2110 {
2115 }
2119 }
2121 /* Convert expression EXP (location LOC) from lvalue to rvalue,
2122 including converting functions and arrays to pointers if CONVERT_P.
2123 If READ_P, also mark the expression as having been read. */
2125 struct c_expr
2128 {
2136 {
2145 /* Expansion of a generic atomic load may require an addition
2146 element, so allocate enough to prevent a resize. */
2149 /* Remove the qualifiers for the rest of the expressions and
2150 create the VAL temp variable to hold the RHS. */
2155 /* Do not disable warnings for TMP even though it's artificial.
2156 -Winvalid-memory-model depends on it. */
2158 /* Issue __atomic_load (&expr, &tmp, SEQ_CST); */
2165 /* EXPR is always read. */
2168 /* Return tmp which contains the value loaded. */
2171 }
2174 exp.value = convert (build_qualified_type (TREE_TYPE (exp.value), TYPE_UNQUALIFIED), exp.value);
2176 }
2178 /* EXP is an expression of integer type. Apply the integer promotions
2179 to it and return the promoted value. */
2181 tree
2183 {
2189 /* Normally convert enums to int,
2190 but convert wide enums to something wider. */
2192 {
2200 }
2202 /* ??? This should no longer be needed now bit-fields have their
2203 proper types. */
2206 /* If it's thinner than an int, promote it like a
2207 c_promoting_integer_type_p, otherwise leave it alone. */
2213 {
2214 /* Preserve unsignedness if not really getting any wider. */
2220 }
2223 }
2226 /* Perform default promotions for C data used in expressions.
2227 Enumeral types or short or char are converted to int.
2228 In addition, manifest constants symbols are replaced by their values. */
2230 tree
2232 {
2233 tree orig_exp;
2236 tree promoted_type;
2240 /* Functions and arrays have been converted during parsing. */
2245 /* Constants can be used directly unless they're not loadable. */
2249 /* Strip no-op conversions. */
2256 {
2260 }
2274 }
2275 \f
2276 /* Look up COMPONENT in a structure or union TYPE.
2278 If the component name is not found, returns NULL_TREE. Otherwise,
2279 the return value is a TREE_LIST, with each TREE_VALUE a FIELD_DECL
2280 stepping down the chain to the component, which is in the last
2281 TREE_VALUE of the list. Normally the list is of length one, but if
2282 the component is embedded within (nested) anonymous structures or
2283 unions, the list steps down the chain to the component. */
2285 static tree
2287 {
2288 tree field;
2290 /* If TYPE_LANG_SPECIFIC is set, then it is a sorted array of pointers
2291 to the field elements. Use a binary search on this array to quickly
2292 find the element. Otherwise, do a linear search. TYPE_LANG_SPECIFIC
2293 will always be set for structures which have many elements.
2295 Duplicate field checking replaces duplicates with NULL_TREE so
2296 TYPE_LANG_SPECIFIC arrays are potentially no longer sorted. In that
2297 case just iterate using DECL_CHAIN. */
2301 {
2309 {
2314 {
2315 /* Step through all anon unions in linear fashion. */
2317 {
2320 {
2326 /* The Plan 9 compiler permits referring
2327 directly to an anonymous struct/union field
2328 using a typedef name. */
2336 }
2337 }
2339 /* Entire record is only anon unions. */
2343 /* Restart the binary search, with new lower bound. */
2345 }
2351 else
2353 }
2359 }
2360 else
2361 {
2363 {
2366 {
2372 /* The Plan 9 compiler permits referring directly to an
2373 anonymous struct/union field using a typedef
2374 name. */
2381 }
2385 }
2389 }
2392 }
2394 /* Recursively append candidate IDENTIFIER_NODEs to CANDIDATES. */
2396 static void
2399 {
2400 tree field;
2402 {
2406 candidates);
2410 }
2411 }
2413 /* Like "lookup_field", but find the closest matching IDENTIFIER_NODE,
2414 rather than returning a TREE_LIST for an exact match. */
2416 static tree
2418 {
2421 /* First, gather a list of candidates. */
2428 }
2430 /* Support function for build_component_ref's error-handling.
2432 Given DATUM_TYPE, and "DATUM.COMPONENT", where DATUM is *not* a
2433 struct or union, should we suggest "DATUM->COMPONENT" as a hint? */
2435 static bool
2437 {
2438 /* We don't do it for Objective-C, since Objective-C 2.0 dot-syntax
2439 allows "." for ptrs; we could be handling a failed attempt
2440 to access a property. */
2444 /* Only suggest it for pointers... */
2448 /* ...to structs/unions. */
2453 else
2455 }
2457 /* Make an expression to refer to the COMPONENT field of structure or
2458 union value DATUM. COMPONENT is an IDENTIFIER_NODE. LOC is the
2459 location of the COMPONENT_REF. COMPONENT_LOC is the location
2460 of COMPONENT. ARROW_LOC is the location of the first -> operand if
2461 it is from -> operator. */
2463 tree
2466 {
2470 tree ref;
2476 /* Detect Objective-C property syntax object.property. */
2481 /* See if there is a field or component with name COMPONENT. */
2484 {
2486 {
2489 }
2494 {
2497 {
2498 /* Attempt to provide a fixit replacement hint, if
2499 we have a valid range for the component. */
2500 location_t reported_loc
2508 }
2509 else
2512 }
2514 /* Accessing elements of atomic structures or unions is undefined
2515 behavior (C11 6.5.2.3#5). */
2517 {
2521 else
2524 }
2526 /* Chain the COMPONENT_REFs if necessary down to the FIELD.
2527 This might be better solved in future the way the C++ front
2528 end does it - by giving the anonymous entities each a
2529 separate name and type, and then have build_component_ref
2530 recursively call itself. We can't do that here. */
2531 do
2532 {
2535 tree subtype;
2541 /* If this is an rvalue, it does not have qualifiers in C
2542 standard terms and we must avoid propagating such
2543 qualifiers down to a non-lvalue array that is then
2544 converted to a pointer. */
2545 use_datum_quals = (datum_lvalue
2554 NULL_TREE);
2571 }
2575 }
2577 {
2578 /* Special-case the error message for "ptr.field" for the case
2579 where the user has confused "." vs "->". */
2582 {
2586 "%qE is a pointer to pointer; did you mean to dereference "
2589 }
2590 else
2591 {
2592 /* "loc" should be the "." token. */
2596 datum);
2597 }
2599 }
2603 component);
2606 }
2607 \f
2608 /* Given an expression PTR for a pointer, return an expression
2609 for the value pointed to.
2610 ERRORSTRING is the name of the operator to appear in error messages.
2612 LOC is the location to use for the generated tree. */
2614 tree
2616 {
2619 tree ref;
2622 {
2625 {
2626 /* If a warning is issued, mark it to avoid duplicates from
2627 the backend. This only needs to be done at
2628 warn_strict_aliasing > 2. */
2633 }
2638 {
2642 }
2643 else
2644 {
2652 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
2653 so that we get the proper error message if the result is used
2654 to assign to. Also, &* is supposed to be a no-op.
2655 And ANSI C seems to specify that the type of the result
2656 should be the const type. */
2657 /* A de-reference of a pointer to const is not a const. It is valid
2658 to change it via some other pointer. */
2665 }
2666 }
2671 }
2673 /* This handles expressions of the form "a[i]", which denotes
2674 an array reference.
2676 This is logically equivalent in C to *(a+i), but we may do it differently.
2677 If A is a variable or a member, we generate a primitive ARRAY_REF.
2678 This avoids forcing the array out of registers, and can work on
2679 arrays that are not lvalues (for example, members of structures returned
2680 by functions).
2682 For vector types, allow vector[i] but not i[vector], and create
2683 *(((type*)&vectortype) + i) for the expression.
2685 LOC is the location to use for the returned expression. */
2687 tree
2689 {
2690 tree ret;
2698 /* Allow vector[index] but not index[vector]. */
2700 {
2703 {
2708 }
2711 }
2714 {
2717 }
2720 {
2723 }
2725 /* ??? Existing practice has been to warn only when the char
2726 index is syntactically the index, not for char[array]. */
2730 /* Apply default promotions *after* noticing character types. */
2741 {
2744 /* An array that is indexed by a non-constant
2745 cannot be stored in a register; we must be able to do
2746 address arithmetic on its address.
2747 Likewise an array of elements of variable size. */
2751 {
2754 }
2755 /* An array that is indexed by a constant value which is not within
2756 the array bounds cannot be stored in a register either; because we
2757 would get a crash in store_bit_field/extract_bit_field when trying
2758 to access a non-existent part of the register. */
2762 {
2765 }
2769 {
2778 "ISO C90 forbids subscripting non-lvalue "
2780 }
2784 /* Array ref is const/volatile if the array elements are
2785 or if the array is. */
2794 /* This was added by rms on 16 Nov 91.
2795 It fixes vol struct foo *a; a->elts[1]
2796 in an inline function.
2797 Hope it doesn't break something else. */
2804 }
2805 else
2806 {
2817 RO_ARRAY_INDEXING);
2821 }
2822 }
2823 \f
2824 /* Build an external reference to identifier ID. FUN indicates
2825 whether this will be used for a function call. LOC is the source
2826 location of the identifier. This sets *TYPE to the type of the
2827 identifier, which is not the same as the type of the returned value
2828 for CONST_DECLs defined as enum constants. If the type of the
2829 identifier is not available, *TYPE is set to NULL. */
2830 tree
2832 {
2833 tree ref;
2836 /* In Objective-C, an instance variable (ivar) may be preferred to
2837 whatever lookup_name() found. */
2842 {
2845 }
2847 /* Implicit function declaration. */
2850 /* Don't complain about something that's already been
2851 complained about. */
2853 else
2854 {
2857 }
2867 /* Recursive call does not count as usage. */
2869 {
2871 }
2874 {
2881 }
2884 {
2890 {
2895 }
2899 }
2904 {
2909 }
2910 /* C99 6.7.4p3: An inline definition of a function with external
2911 linkage ... shall not contain a reference to an identifier with
2912 internal linkage. */
2921 csi_internal);
2924 }
2926 /* Record details of decls possibly used inside sizeof or typeof. */
2927 struct maybe_used_decl
2928 {
2929 /* The decl. */
2930 tree decl;
2931 /* The level seen at (in_sizeof + in_typeof). */
2933 /* The next one at this level or above, or NULL. */
2935 };
2939 /* Record that DECL, an undefined static function reference seen
2940 inside sizeof or typeof, might be used if the operand of sizeof is
2941 a VLA type or the operand of typeof is a variably modified
2942 type. */
2944 static void
2946 {
2952 }
2954 /* Pop the stack of decls possibly used inside sizeof or typeof. If
2955 USED is false, just discard them. If it is true, mark them used
2956 (if no longer inside sizeof or typeof) or move them to the next
2957 level up (if still inside sizeof or typeof). */
2959 void
2961 {
2965 {
2967 {
2970 else
2972 }
2974 }
2977 }
2979 /* Return the result of sizeof applied to EXPR. */
2981 struct c_expr
2983 {
2986 {
2991 }
2992 else
2993 {
2998 {
2999 auto_diagnostic_group d;
3001 "%<sizeof%> on array function parameter %qE will "
3005 }
3014 {
3015 /* sizeof is evaluated when given a vla (C99 6.5.3.4p2). */
3020 }
3022 }
3024 }
3026 /* Return the result of sizeof applied to T, a structure for the type
3027 name passed to sizeof (rather than the type itself). LOC is the
3028 location of the original expression. */
3030 struct c_expr
3032 {
3033 tree type;
3044 {
3047 }
3048 else
3051 {
3052 /* If the type is a [*] array, it is a VLA but is represented as
3053 having a size of zero. In such a case we must ensure that
3054 the result of sizeof does not get folded to a constant by
3055 c_fully_fold, because if the size is evaluated the result is
3056 not constant and so constraints on zero or negative size
3057 arrays must not be applied when this sizeof call is inside
3058 another array declarator. */
3064 }
3068 }
3070 /* Build a function call to function FUNCTION with parameters PARAMS.
3071 The function call is at LOC.
3072 PARAMS is a list--a chain of TREE_LIST nodes--in which the
3073 TREE_VALUE of each node is a parameter-expression.
3074 FUNCTION's data type may be a function type or a pointer-to-function. */
3076 tree
3078 {
3080 tree ret;
3088 }
3090 /* Give a note about the location of the declaration of DECL. */
3092 static void
3094 {
3098 }
3100 /* Build a function call to function FUNCTION with parameters PARAMS.
3101 If FUNCTION is the result of resolving an overloaded target built-in,
3102 ORIG_FUNDECL is the original function decl, otherwise it is null.
3103 ORIGTYPES, if not NULL, is a vector of types; each element is
3104 either NULL or the original type of the corresponding element in
3105 PARAMS. The original type may differ from TREE_TYPE of the
3106 parameter for enums. FUNCTION's data type may be a function type
3107 or pointer-to-function. This function changes the elements of
3108 PARAMS. */
3110 tree
3114 {
3117 tree tem;
3122 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
3125 /* Convert anything with function type to a pointer-to-function. */
3127 {
3135 /* Atomic functions have type checking/casting already done. They are
3136 often rewritten and don't match the original parameter list. */
3139 }
3143 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
3144 expressions, like those used for ObjC messenger dispatches. */
3157 {
3161 function);
3163 {
3166 function);
3168 }
3169 else
3173 }
3178 /* fntype now gets the type of function pointed to. */
3181 /* Convert the parameters to the types declared in the
3182 function prototype, or apply default promotions. */
3189 /* Check that the function is called through a compatible prototype.
3190 If it is not, warn. */
3195 {
3198 /* This situation leads to run-time undefined behavior. We can't,
3199 therefore, simply error unless we can prove that all possible
3200 executions of the program must execute the code. */
3207 }
3211 /* Check that arguments to builtin functions match the expectations. */
3218 /* Check that the arguments to the function are valid. */
3224 {
3226 result
3229 else
3235 }
3236 else
3239 /* If -Wnonnull warning has been diagnosed, avoid diagnosing it again
3240 later. */
3244 /* In this improbable scenario, a nested function returns a VM type.
3245 Create a TARGET_EXPR so that the call always has a LHS, much as
3246 what the C++ FE does for functions returning non-PODs. */
3248 {
3252 }
3255 {
3260 }
3262 }
3264 /* Like build_function_call_vec, but call also resolve_overloaded_builtin. */
3266 tree
3270 {
3271 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
3274 /* Convert anything with function type to a pointer-to-function. */
3276 {
3277 /* Implement type-directed function overloading for builtins.
3278 resolve_overloaded_builtin and targetm.resolve_overloaded_builtin
3279 handle all the type checking. The result is a complete expression
3280 that implements this function call. */
3284 }
3286 }
3287 \f
3288 /* Helper for convert_arguments called to convert the VALue of argument
3289 number ARGNUM from ORIGTYPE to the corresponding parameter number
3290 PARMNUM and TYPE.
3291 PLOC is the location where the conversion is being performed.
3292 FUNCTION and FUNDECL are the same as in convert_arguments.
3293 VALTYPE is the original type of VAL before the conversion and,
3294 for EXCESS_PRECISION_EXPR, the operand of the expression.
3295 NPC is true if VAL represents the null pointer constant (VAL itself
3296 will have been folded to an integer constant).
3297 RNAME is the same as FUNCTION except in Objective C when it's
3298 the function selector.
3299 EXCESS_PRECISION is true when VAL was originally represented
3300 as EXCESS_PRECISION_EXPR.
3301 WARNOPT is the same as in convert_for_assignment. */
3303 static tree
3308 {
3309 /* Formal parm type is specified by a function prototype. */
3312 {
3316 }
3318 /* Optionally warn about conversions that differ from the default
3319 conversions. */
3321 {
3327 "passing argument %d of %qE as integer rather "
3333 "passing argument %d of %qE as integer rather "
3339 "passing argument %d of %qE as complex rather "
3345 "passing argument %d of %qE as floating rather "
3351 "passing argument %d of %qE as complex rather "
3357 "passing argument %d of %qE as floating rather "
3360 /* ??? At some point, messages should be written about
3361 conversions between complex types, but that's too messy
3362 to do now. */
3365 {
3366 /* Warn if any argument is passed as `float',
3367 since without a prototype it would be `double'. */
3371 "passing argument %d of %qE as %<float%> "
3375 /* Warn if mismatch between argument and prototype
3376 for decimal float types. Warn of conversions with
3377 binary float types and of precision narrowing due to
3378 prototype. */
3386 && (formal_prec
3389 && (valtype
3390 != dfloat64_type_node
3391 && (valtype
3394 && (valtype
3397 "passing argument %d of %qE as %qT "
3401 }
3402 /* Detect integer changing in width or signedness.
3403 These warnings are only activated with
3404 -Wtraditional-conversion, not with -Wtraditional. */
3408 {
3417 /* No warning if function asks for enum
3418 and the actual arg is that enum type. */
3419 ;
3422 "passing argument %d of %qE "
3426 ;
3427 /* Don't complain if the formal parameter type
3428 is an enum, because we can't tell now whether
3429 the value was an enum--even the same enum. */
3431 ;
3434 /* Change in signedness doesn't matter
3435 if a constant value is unaffected. */
3436 ;
3437 /* If the value is extended from a narrower
3438 unsigned type, it doesn't matter whether we
3439 pass it as signed or unsigned; the value
3440 certainly is the same either way. */
3443 ;
3446 "passing argument %d of %qE "
3449 else
3451 "passing argument %d of %qE "
3454 }
3455 }
3457 /* Possibly restore an EXCESS_PRECISION_EXPR for the
3458 sake of better warnings from convert_and_check. */
3473 }
3475 /* Convert the argument expressions in the vector VALUES
3476 to the types in the list TYPELIST.
3478 If TYPELIST is exhausted, or when an element has NULL as its type,
3479 perform the default conversions.
3481 ORIGTYPES is the original types of the expressions in VALUES. This
3482 holds the type of enum values which have been converted to integral
3483 types. It may be NULL.
3485 FUNCTION is a tree for the called function. It is used only for
3486 error messages, where it is formatted with %qE.
3488 This is also where warnings about wrong number of args are generated.
3490 ARG_LOC are locations of function arguments (if any).
3492 Returns the actual number of arguments processed (which may be less
3493 than the length of VALUES in some error situations), or -1 on
3494 failure. */
3496 static int
3500 {
3507 tree selector;
3509 /* Change pointer to function to the function itself for
3510 diagnostics. */
3515 /* Handle an ObjC selector specially for diagnostics. */
3518 /* For a call to a built-in function declared without a prototype,
3519 set to the built-in function's argument list. */
3522 /* For type-generic built-in functions, determine whether excess
3523 precision should be removed (classification) or not
3524 (comparison). */
3527 {
3530 {
3531 /* For a call to a built-in function declared without a prototype
3532 use the types of the parameters of the internal built-in to
3533 match those of the arguments to. */
3536 }
3538 /* For type-generic built-in functions, determine whether excess
3539 precision should be removed (classification) or not
3540 (comparison). */
3543 {
3556 /* The last argument of these type-generic builtins
3557 should not be promoted. */
3563 }
3564 }
3566 /* Scan the given expressions (VALUES) and types (TYPELIST), producing
3567 individual converted arguments. */
3575 {
3576 /* The type of the function parameter (if it was declared with one). */
3578 /* The type of the built-in function parameter (if the function
3579 is a built-in). Used to detect type incompatibilities in
3580 calls to built-ins declared without a prototype. */
3581 tree builtin_type = (builtin_typetail
3583 /* The original type of the argument being passed to the function. */
3585 /* The called function (or function selector in Objective C). */
3589 /* Set for EXCESS_PRECISION_EXPR arguments. */
3591 /* The value of the argument after conversion to the type
3592 of the function parameter it is passed to. */
3593 tree parmval;
3594 /* Some __atomic_* builtins have additional hidden argument at
3595 position 0. */
3596 location_t ploc
3602 {
3605 else
3609 }
3612 {
3614 "too many arguments to built-in function %qE "
3618 }
3621 {
3624 }
3626 /* Determine if VAL is a null pointer constant before folding it. */
3629 /* If there is excess precision and a prototype, convert once to
3630 the required type rather than converting via the semantic
3631 type. Likewise without a prototype a float value represented
3632 as long double should be converted once to double. But for
3633 type-generic classification functions excess precision must
3634 be removed here. */
3637 {
3640 }
3646 /* Some floating-point arguments must be promoted to double when
3647 no type is specified by a prototype. This applies to
3648 arguments of type float, and to architecture-specific types
3649 (ARM __fp16), but not to _FloatN or _FloatNx types. */
3658 {
3659 /* Promote this argument, unless it has a _FloatN or
3660 _FloatNx type. */
3664 {
3667 }
3668 }
3671 {
3676 }
3678 {
3681 else
3682 {
3683 /* Convert `float' to `double'. */
3686 "implicit conversion from %qT to %qT when passing "
3690 }
3691 }
3694 /* A "double" argument with excess precision being passed
3695 without a prototype or in variable arguments.
3696 The last argument of __builtin_*_overflow_p should not be
3697 promoted. */
3701 {
3704 }
3706 {
3708 }
3709 else
3710 /* Convert `short' and `char' to full-size `int'. */
3718 {
3719 /* For a call to a built-in function declared without a prototype,
3720 perform the conversions from the argument to the expected type
3721 but issue warnings rather than errors for any mismatches.
3722 Ignore the converted argument and use the PARMVAL obtained
3723 above by applying default conversions instead. */
3727 excess_precision,
3728 OPT_Wbuiltin_declaration_mismatch);
3729 }
3736 }
3741 {
3745 }
3748 {
3754 "too few arguments to built-in function %qE "
3757 }
3760 }
3761 \f
3762 /* This is the entry point used by the parser to build unary operators
3763 in the input. CODE, a tree_code, specifies the unary operator, and
3764 ARG is the operand. For unary plus, the C parser currently uses
3765 CONVERT_EXPR for code.
3767 LOC is the location to use for the tree generated.
3768 */
3770 struct c_expr
3772 {
3779 {
3781 }
3782 else
3783 {
3788 }
3790 /* We are typically called when parsing a prefix token at LOC acting on
3791 ARG. Reflect this by updating the source range of the result to
3792 start at LOC and end at the end of ARG. */
3797 }
3799 /* Returns true if TYPE is a character type, *not* including wchar_t. */
3801 bool
3803 {
3809 }
3811 /* This is the entry point used by the parser to build binary operators
3812 in the input. CODE, a tree_code, specifies the binary operator, and
3813 ARG1 and ARG2 are the operands. In addition to constructing the
3814 expression, we check for operands that were written with other binary
3815 operators in a way that is likely to confuse the user.
3817 LOCATION is the location of the binary operator. */
3819 struct c_expr
3822 {
3840 {
3845 }
3854 /* Check for cases such as x+y<<z which users are likely
3855 to misinterpret. */
3865 {
3869 {
3873 else
3875 }
3877 {
3881 else
3883 }
3886 }
3892 /* Avoid warning for !!x == y. */
3895 {
3896 /* Avoid warning for !b == y where b has _Bool type. */
3901 {
3903 do
3904 {
3911 else
3913 }
3915 }
3918 }
3920 /* Warn about comparisons against string literals, with the exception
3921 of testing for equality or inequality of a string literal with NULL. */
3923 {
3930 /* Warn for ptr == '\0', it's likely that it should've been ptr[0]. */
3934 {
3935 auto_diagnostic_group d;
3937 "comparison between pointer and zero character "
3941 }
3945 {
3946 auto_diagnostic_group d;
3948 "comparison between pointer and zero character "
3952 }
3953 }
3957 "comparison with string literal results in unspecified "
3971 /* Warn about comparisons of different enum types. */
3982 }
3983 \f
3984 /* Return a tree for the difference of pointers OP0 and OP1.
3985 The resulting tree has type ptrdiff_t. If POINTER_SUBTRACT sanitization is
3986 enabled, assign to INSTRUMENT_EXPR call to libsanitizer. */
3988 static tree
3990 {
4000 /* If the operands point into different address spaces, we need to
4001 explicitly convert them to pointers into the common address space
4002 before we can subtract the numerical address values. */
4004 {
4005 addr_space_t as_common;
4006 tree common_type;
4008 /* Determine the common superset address space. This is guaranteed
4009 to exist because the caller verified that comp_target_types
4010 returned non-zero. */
4017 }
4019 /* Determine integer type result of the subtraction. This will usually
4020 be the same as the result type (ptrdiff_t), but may need to be a wider
4021 type if pointers for the address space are wider than ptrdiff_t. */
4024 else
4036 {
4042 }
4044 /* First do the subtraction, then build the divide operator
4045 and only convert at the very end.
4046 Do not do default conversions in case restype is a short type. */
4048 /* POINTER_DIFF_EXPR requires a signed integer type of the same size as
4049 pointers. If some platform cannot provide that, or has a larger
4050 ptrdiff_type to support differences larger than half the address
4051 space, cast the pointers to some larger integer type and do the
4052 computations in that type. */
4056 else
4057 {
4058 /* Cast away qualifiers. */
4062 }
4064 /* This generates an error if op1 is pointer to incomplete type. */
4077 /* Divide by the size, in easiest possible way. */
4081 /* Convert to final result type if necessary. */
4083 }
4084 \f
4085 /* Expand atomic compound assignments into an appropriate sequence as
4086 specified by the C11 standard section 6.5.16.2.
4088 _Atomic T1 E1
4089 T2 E2
4090 E1 op= E2
4092 This sequence is used for all types for which these operations are
4093 supported.
4095 In addition, built-in versions of the 'fe' prefixed routines may
4096 need to be invoked for floating point (real, complex or vector) when
4097 floating-point exceptions are supported. See 6.5.16.2 footnote 113.
4099 T1 newval;
4100 T1 old;
4101 T1 *addr
4102 T2 val
4103 fenv_t fenv
4105 addr = &E1;
4106 val = (E2);
4107 __atomic_load (addr, &old, SEQ_CST);
4108 feholdexcept (&fenv);
4109 loop:
4110 newval = old op val;
4111 if (__atomic_compare_exchange_strong (addr, &old, &newval, SEQ_CST,
4112 SEQ_CST))
4113 goto done;
4114 feclearexcept (FE_ALL_EXCEPT);
4115 goto loop:
4116 done:
4117 feupdateenv (&fenv);
4119 The compiler will issue the __atomic_fetch_* built-in when possible,
4120 otherwise it will generate the generic form of the atomic operations.
4121 This requires temp(s) and has their address taken. The atomic processing
4122 is smart enough to figure out when the size of an object can utilize
4123 a lock-free version, and convert the built-in call to the appropriate
4124 lock-free routine. The optimizers will then dispose of any temps that
4125 are no longer required, and lock-free implementations are utilized as
4126 long as there is target support for the required size.
4128 If the operator is NOP_EXPR, then this is a simple assignment, and
4129 an __atomic_store is issued to perform the assignment rather than
4130 the above loop. */
4132 /* Build an atomic assignment at LOC, expanding into the proper
4133 sequence to store LHS MODIFYCODE= RHS. Return a value representing
4134 the result of the operation, unless RETURN_OLD_P, in which case
4135 return the old value of LHS (this is only for postincrement and
4136 postdecrement). */
4138 static tree
4141 {
4154 tree nonatomic_rhs_semantic_type;
4155 tree rhs_type;
4162 /* Allocate enough vector items for a compare_exchange. */
4165 /* Create a compound statement to hold the sequence of statements
4166 with a loop. */
4168 {
4171 /* For consistency with build_modify_expr on non-_Atomic,
4172 mark the lhs as read. Also, it would be very hard to match
4173 such expressions in mark_exp_read. */
4175 }
4177 /* Remove any excess precision (which is only present here in the
4178 case of compound assignments). */
4180 {
4183 }
4186 /* Fold the RHS if it hasn't already been folded. */
4190 /* Remove the qualifiers for the rest of the expressions and create
4191 the VAL temp variable to hold the RHS. */
4195 TYPE_UNQUALIFIED);
4200 NULL_TREE);
4206 /* NOP_EXPR indicates it's a straight store of the RHS. Simply issue
4207 an atomic_store. */
4209 {
4211 /* Build __atomic_store (&lhs, &val, SEQ_CST) */
4222 /* VAL is the value which was stored, return a COMPOUND_STMT of
4223 the statement and that value. */
4225 }
4227 /* Attempt to implement the atomic operation as an __atomic_fetch_* or
4228 __atomic_*_fetch built-in rather than a CAS loop. atomic_bool type
4229 isn't applicable for such builtins. ??? Do we want to handle enums? */
4232 {
4233 built_in_function fncode;
4235 {
4238 fncode = (return_old_p
4239 ? BUILT_IN_ATOMIC_FETCH_ADD_N
4243 fncode = (return_old_p
4244 ? BUILT_IN_ATOMIC_FETCH_SUB_N
4248 fncode = (return_old_p
4249 ? BUILT_IN_ATOMIC_FETCH_AND_N
4253 fncode = (return_old_p
4254 ? BUILT_IN_ATOMIC_FETCH_OR_N
4258 fncode = (return_old_p
4259 ? BUILT_IN_ATOMIC_FETCH_XOR_N
4264 }
4266 /* We can only use "_1" through "_16" variants of the atomic fetch
4267 built-ins. */
4272 /* If this is a pointer type, we need to multiply by the size of
4273 the pointer target type. */
4275 {
4277 /* ??? This would introduce -Wdiscarded-qualifiers
4278 warning: __atomic_fetch_* expect volatile void *
4279 type as the first argument. (Assignments between
4280 atomic and non-atomic objects are OK.) */
4287 }
4289 /* Build __atomic_fetch_* (&lhs, &val, SEQ_CST), or
4290 __atomic_*_fetch (&lhs, &val, SEQ_CST). */
4305 /* Finish the compound statement. */
4308 /* NEWVAL is the value which was stored, return a COMPOUND_STMT of
4309 the statement and that value. */
4311 }
4313 cas_loop:
4314 /* Create the variables and labels required for the op= form. */
4331 /* __atomic_load (addr, &old, SEQ_CST). */
4338 NULL_TREE);
4342 /* Create the expressions for floating-point environment
4343 manipulation, if required. */
4353 /* loop: */
4356 /* newval = old + val; */
4361 {
4365 }
4366 else
4372 {
4374 NULL_TREE);
4377 }
4379 /* if (__atomic_compare_exchange (addr, &old, &new, false, SEQ_CST, SEQ_CST))
4380 goto done; */
4400 /* goto loop; */
4405 /* done: */
4411 /* Finish the compound statement. */
4414 /* NEWVAL is the value that was successfully stored, return a
4415 COMPOUND_EXPR of the statement and the appropriate value. */
4418 }
4420 /* Construct and perhaps optimize a tree representation
4421 for a unary operation. CODE, a tree_code, specifies the operation
4422 and XARG is the operand.
4423 For any CODE other than ADDR_EXPR, NOCONVERT suppresses the default
4424 promotions (such as from short to int).
4425 For ADDR_EXPR, the default promotions are not applied; NOCONVERT allows
4426 non-lvalues; this is only used to handle conversion of non-lvalue arrays
4427 to pointers in C99.
4429 LOCATION is the location of the operator. */
4431 tree
4434 {
4435 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
4439 tree val;
4460 {
4463 }
4466 {
4469 }
4472 {
4474 /* This is used for unary plus, because a CONVERT_EXPR
4475 is enough to prevent anybody from looking inside for
4476 associativity, but won't generate any code. */
4480 {
4483 }
4493 {
4496 }
4502 /* ~ works on integer types and non float vectors. */
4506 {
4509 /* Warn if the expression has boolean value. */
4515 {
4516 auto_diagnostic_group d;
4519 {
4523 }
4524 }
4527 }
4529 {
4535 }
4536 else
4537 {
4540 }
4545 {
4548 }
4555 {
4558 }
4564 /* Conjugating a real value is a no-op, but allow it anyway. */
4567 {
4570 }
4579 {
4583 }
4585 {
4588 }
4589 else
4592 /* If the TRUTH_NOT_EXPR has been folded, reset the location. */
4612 {
4615 noconvert);
4623 }
4625 /* Complain about anything that is not a true lvalue. In
4626 Objective-C, skip this check for property_refs. */
4631 ? lv_increment
4636 {
4640 else
4643 }
4646 {
4650 else
4653 }
4655 /* Ensure the argument is fully folded inside any SAVE_EXPR. */
4661 /* Increment or decrement the real part of the value,
4662 and don't change the imaginary part. */
4664 {
4671 {
4683 }
4684 }
4686 /* Report invalid types. */
4692 {
4695 else
4699 }
4701 {
4702 tree inc;
4706 /* Compute the increment. */
4709 {
4710 /* If pointer target is an incomplete type,
4711 we just cannot know how to do the arithmetic. */
4713 {
4718 else
4722 }
4725 {
4729 else
4732 }
4733 else
4739 }
4741 {
4742 /* For signed fract types, we invert ++ to -- or
4743 -- to ++, and change inc from 1 to -1, because
4744 it is not possible to represent 1 in signed fract constants.
4745 For unsigned fract types, the result always overflows and
4746 we get an undefined (original) or the maximum value. */
4758 }
4759 else
4760 {
4765 }
4767 /* If 'arg' is an Objective-C PROPERTY_REF expression, then we
4768 need to ask Objective-C to build the increment or decrement
4769 expression for it. */
4774 /* Report a read-only lvalue. */
4776 {
4782 }
4789 /* If the argument is atomic, use the special code sequences for
4790 atomic compound assignment. */
4792 {
4797 ? PLUS_EXPR
4800 ? inc
4805 }
4809 else
4814 }
4817 /* Note that this operation never does default_conversion. */
4819 /* The operand of unary '&' must be an lvalue (which excludes
4820 expressions of type void), or, in C99, the result of a [] or
4821 unary '*' operator. */
4827 /* Let &* cancel out to simplify resulting code. */
4829 {
4830 /* Don't let this be an lvalue. */
4835 }
4837 /* Anything not already handled and not a true memory reference
4838 or a non-lvalue array is an error. */
4843 /* Move address operations inside C_MAYBE_CONST_EXPR to simplify
4844 folding later. */
4846 {
4849 noconvert);
4856 }
4858 /* Ordinary case; arg is a COMPONENT_REF or a decl. */
4861 /* If the lvalue is const or volatile, merge that into the type
4862 to which the address will point. This is only needed
4863 for function types. */
4867 {
4877 }
4880 {
4883 {
4887 }
4889 /* fall through */
4893 {
4897 {
4901 }
4906 "address of array with reverse scalar storage "
4908 }
4912 }
4922 /* ??? Cope with user tricks that amount to offsetof. Delete this
4923 when we have proper support for integer constant expressions. */
4927 {
4930 }
4943 }
4948 ret = (require_constant_value
4951 else
4953 return_build_unary_op:
4964 }
4966 /* Return nonzero if REF is an lvalue valid for this language.
4967 Lvalues can be assigned, unless their type has TYPE_READONLY.
4968 Lvalues can have their address taken, unless they have C_DECL_REGISTER. */
4970 bool
4972 {
4976 {
4991 /* MEM_REFs can appear from -fgimple parsing or folding, so allow them
4992 here as well. */
5007 }
5008 }
5009 \f
5010 /* Give a warning for storing in something that is read-only in GCC
5011 terms but not const in ISO C terms. */
5013 static void
5015 {
5017 {
5029 }
5031 }
5034 /* Return nonzero if REF is an lvalue valid for this language;
5035 otherwise, print an error message and return zero. USE says
5036 how the lvalue is being used and so selects the error message.
5037 LOCATION is the location at which any error should be reported. */
5039 static int
5041 {
5048 }
5049 \f
5050 /* Mark EXP saying that we need to be able to take the
5051 address of it; it should not be allocated in a register.
5052 Returns true if successful. ARRAY_REF_P is true if this
5053 is for ARRAY_REF construction - in that case we don't want
5054 to look through VIEW_CONVERT_EXPR from VECTOR_TYPE to ARRAY_TYPE,
5055 it is fine to use ARRAY_REFs for vector subscripts on vector
5056 register variables. */
5058 bool
5060 {
5065 {
5076 {
5080 }
5081 /* FALLTHRU */
5104 {
5106 {
5107 error
5110 }
5112 }
5114 {
5117 else
5120 }
5122 /* FALLTHRU */
5125 /* FALLTHRU */
5128 }
5129 }
5130 \f
5131 /* Convert EXPR to TYPE, warning about conversion problems with
5132 constants. SEMANTIC_TYPE is the type this conversion would use
5133 without excess precision. If SEMANTIC_TYPE is NULL, this function
5134 is equivalent to convert_and_check. This function is a wrapper that
5135 handles conversions that may be different than
5136 the usual ones because of excess precision. */
5138 static tree
5140 tree semantic_type)
5141 {
5145 /* For C11, integer conversions may have results with excess
5146 precision. */
5152 {
5153 /* For integers, we need to check the real conversion, not
5154 the conversion to the excess precision type. */
5156 }
5157 /* Result type is the excess precision type, which should be
5158 large enough, so do not check. */
5160 }
5162 /* If EXPR refers to a built-in declared without a prototype returns
5163 the actual type of the built-in and, if non-null, set *BLTIN to
5164 a pointer to the built-in. Otherwise return the type of EXPR
5165 and clear *BLTIN if non-null. */
5167 static tree
5169 {
5170 tree dummy;
5194 }
5196 /* Build and return a conditional expression IFEXP ? OP1 : OP2. If
5197 IFEXP_BCP then the condition is a call to __builtin_constant_p, and
5198 if folded to an integer constant then the unselected half may
5199 contain arbitrary operations not normally permitted in constant
5200 expressions. Set the location of the expression to LOC. */
5202 tree
5206 {
5207 tree type1;
5208 tree type2;
5216 tree ret;
5228 /* Promote both alternatives. */
5253 /* C90 does not permit non-lvalue arrays in conditional expressions.
5254 In C99 they will be pointers by now. */
5256 {
5259 }
5267 {
5270 {
5274 }
5276 {
5280 }
5281 }
5284 {
5295 }
5297 /* Quickly detect the usual case where op1 and op2 have the same type
5298 after promotion. */
5300 {
5303 else
5305 }
5310 {
5311 /* In C11, a conditional expression between a floating-point
5312 type and an integer type should convert the integer type to
5313 the evaluation format of the floating-point type, with
5314 possible excess precision. */
5318 {
5319 tree eptype;
5322 {
5326 }
5329 {
5333 }
5334 }
5339 "implicit conversion from %qT to %qT to "
5341 colon_loc);
5343 /* If -Wsign-compare, warn here if type1 and type2 have
5344 different signedness. We'll promote the signed to unsigned
5345 and later code won't know it used to be different.
5346 Do this check on the original types, so that explicit casts
5347 will be considered, but default promotions won't. */
5349 {
5354 {
5357 /* Do not warn if the result type is signed, since the
5358 signed type will only be chosen if it can represent
5359 all the values of the unsigned type. */
5362 else
5363 {
5367 /* Do not warn if the signed quantity is an
5368 unsuffixed integer literal (or some static
5369 constant expression involving such literals) and
5370 it is non-negative. This warning requires the
5371 operands to be folded for best results, so do
5372 that folding in this case even without
5373 warn_sign_compare to avoid warning options
5374 possibly affecting code generation. */
5375 c_inhibit_evaluation_warnings
5379 c_inhibit_evaluation_warnings
5382 c_inhibit_evaluation_warnings
5386 c_inhibit_evaluation_warnings
5390 {
5393 || (unsigned_op1
5398 "operand of %<?:%> changes signedness from "
5399 "%qT to %qT due to unsignedness of other "
5402 else
5404 "operand of %<?:%> changes signedness from "
5405 "%qT to %qT due to unsignedness of other "
5408 }
5413 }
5414 }
5415 }
5416 }
5418 {
5423 }
5425 {
5428 addr_space_t as_common;
5437 {
5441 }
5446 {
5451 {
5452 /* roles are swapped */
5455 }
5459 {
5462 "pointer to array loses qualifier "
5466 "pointer to array loses qualifier "
5468 }
5471 "ISO C forbids conditional expr between "
5473 /* for array, use qualifiers of element type */
5477 }
5478 /* Objective-C pointer comparisons are a bit more lenient. */
5481 else
5482 {
5486 "pointer type mismatch between %qT and %qT "
5489 else
5492 result_type = build_pointer_type
5494 }
5495 }
5497 {
5501 else
5502 {
5504 }
5506 }
5508 {
5512 else
5513 {
5515 }
5517 }
5520 {
5523 else
5524 {
5527 }
5528 }
5530 /* Merge const and volatile flags of the incoming types. */
5531 result_type
5537 semantic_result_type);
5539 semantic_result_type);
5542 {
5545 }
5547 {
5550 }
5552 && op1_int_operands
5555 {
5562 }
5564 /* Need to convert condition operand into a vector mask. */
5566 {
5573 }
5577 else
5578 {
5580 {
5581 /* Use c_fully_fold here, since C_MAYBE_CONST_EXPR might be
5582 nested inside of the expression. */
5585 }
5589 }
5595 /* If the OP1 and OP2 are the same and don't have side-effects,
5596 warn here, because the COND_EXPR will be turned into OP1. */
5604 }
5605 \f
5606 /* EXPR is an expression, location LOC, whose result is discarded.
5607 Warn if it is a call to a nodiscard function (or a COMPOUND_EXPR
5608 whose right-hand operand is such a call, possibly recursively). */
5610 static void
5612 {
5616 {
5620 }
5626 tree attr;
5631 {
5636 auto_diagnostic_group d;
5640 "ignoring return value of %qD, declared with "
5642 else
5644 "ignoring return value of %qD, declared with "
5648 }
5649 else
5650 {
5658 auto_diagnostic_group d;
5662 "ignoring return value of type %qT, declared "
5665 else
5667 "ignoring return value of type %qT, declared "
5670 {
5672 {
5677 }
5678 }
5679 }
5680 }
5682 /* Return a compound expression that performs two expressions and
5683 returns the value of the second of them.
5685 LOC is the location of the COMPOUND_EXPR. */
5687 tree
5689 {
5692 tree ret;
5704 {
5707 }
5710 {
5711 /* The left-hand operand of a comma expression is like an expression
5712 statement: with -Wunused, we should warn if it doesn't have
5713 any side-effects, unless it was explicitly cast to (void). */
5715 {
5723 else
5726 }
5727 }
5730 {
5734 {
5738 }
5744 }
5746 /* With -Wunused, we should also warn if the left-hand operand does have
5747 side-effects, but computes a value which is not used. For example, in
5748 `foo() + bar(), baz()' the result of the `+' operator is not used,
5749 so we should issue a warning. */
5761 && expr1_int_operands
5770 }
5772 /* Issue -Wcast-qual warnings when appropriate. TYPE is the type to
5773 which we are casting. OTYPE is the type of the expression being
5774 cast. Both TYPE and OTYPE are pointer types. LOC is the location
5775 of the cast. -Wcast-qual appeared on the command line. Named
5776 address space qualifiers are not handled here, because they result
5777 in different warnings. */
5779 static void
5781 {
5788 /* Check that the qualifiers on IN_TYPE are a superset of the
5789 qualifiers of IN_OTYPE. The outermost level of POINTER_TYPE
5790 nodes is uninteresting and we stop as soon as we hit a
5791 non-POINTER_TYPE node on either type. */
5792 do
5793 {
5797 /* GNU C allows cv-qualified function types. 'const' means the
5798 function is very pure, 'volatile' means it can't return. We
5799 need to warn when such qualifiers are added, not when they're
5800 taken away. */
5805 else
5808 }
5817 /* There are qualifiers present in IN_OTYPE that are not present
5818 in IN_TYPE. */
5821 discarded);
5826 /* A cast from **T to const **T is unsafe, because it can cause a
5827 const value to be changed with no additional warning. We only
5828 issue this warning if T is the same on both sides, and we only
5829 issue the warning if there are the same number of pointers on
5830 both sides, as otherwise the cast is clearly unsafe anyhow. A
5831 cast is unsafe when a qualifier is added at one level and const
5832 is not present at all outer levels.
5834 To issue this warning, we check at each level whether the cast
5835 adds new qualifiers not already seen. We don't need to special
5836 case function types, as they won't have the same
5837 TYPE_MAIN_VARIANT. */
5847 do
5848 {
5853 {
5855 "to be safe all intermediate pointers in cast from "
5859 }
5862 }
5864 }
5866 /* Heuristic check if two parameter types can be considered ABI-equivalent. */
5868 static bool
5870 {
5878 /* The signedness of the parameter matters only when an integral
5879 type smaller than int is promoted to int, otherwise only the
5880 precision of the parameter matters.
5881 This check should make sure that the callee does not see
5882 undefined values in argument registers. */
5892 }
5894 /* Check if a type cast between two function types can be considered safe. */
5896 static bool
5898 {
5917 }
5919 /* Build an expression representing a cast to type TYPE of expression EXPR.
5920 LOC is the location of the cast-- typically the open paren of the cast. */
5922 tree
5924 {
5925 tree value;
5939 /* The ObjC front-end uses TYPE_MAIN_VARIANT to tie together types differing
5940 only in <protocol> qualifications. But when constructing cast expressions,
5941 the protocols do matter and must be kept around. */
5948 {
5951 }
5954 {
5957 }
5960 {
5964 }
5967 {
5972 /* Convert to remove any qualifiers from VALUE's type. */
5974 }
5976 {
5977 tree field;
5986 {
5987 tree t;
5999 }
6002 }
6003 else
6004 {
6008 {
6012 }
6016 /* Optionally warn about potentially worrisome casts. */
6022 /* Warn about conversions between pointers to disjoint
6023 address spaces. */
6027 {
6030 addr_space_t as_common;
6033 {
6044 else
6049 }
6050 }
6052 /* Warn about possible alignment problems. */
6058 /* Don't warn about opaque types, where the actual alignment
6059 restriction is unknown. */
6070 /* Unlike conversion of integers to pointers, where the
6071 warning is disabled for converting constants because
6072 of cases such as SIG_*, warn about converting constant
6073 pointers to integers. In some cases it may cause unwanted
6074 sign extension, and a warning is appropriate. */
6081 "cast from function call of type %qT "
6087 /* Don't warn about converting any constant. */
6096 /* If pedantic, warn for conversions between function and object
6097 pointer types, except for converting a null pointer constant
6098 to function pointer type. */
6123 "cast between incompatible function types"
6129 /* Ignore any integer overflow caused by the cast. */
6131 {
6133 {
6135 {
6136 /* Avoid clobbering a shared constant. */
6139 }
6140 }
6142 /* Reset VALUE's overflow flags, ensuring constant sharing. */
6144 }
6145 }
6147 /* Don't let a cast be an lvalue. */
6151 /* Don't allow the results of casting to floating-point or complex
6152 types be confused with actual constants, or casts involving
6153 integer and pointer types other than direct integer-to-integer
6154 and integer-to-pointer be confused with integer constant
6155 expressions and null pointer constants. */
6165 /* If the expression has integer operands and so can occur in an
6166 unevaluated part of an integer constant expression, ensure the
6167 return value reflects this. */
6176 }
6178 /* Interpret a cast of expression EXPR to type TYPE. LOC is the
6179 location of the open paren of the cast, or the position of the cast
6180 expr. */
6181 tree
6183 {
6184 tree type;
6187 tree ret;
6190 /* This avoids warnings about unprototyped casts on
6191 integers. E.g. "#define SIG_DFL (void(*)())0". */
6203 {
6210 }
6215 /* C++ does not permits types to be defined in a cast, but it
6216 allows references to incomplete types. */
6222 }
6223 \f
6224 /* Build an assignment expression of lvalue LHS from value RHS.
6225 If LHS_ORIGTYPE is not NULL, it is the original type of LHS, which
6226 may differ from TREE_TYPE (LHS) for an enum bitfield.
6227 MODIFYCODE is the code for a binary operator that we use
6228 to combine the old value of LHS with RHS to get the new value.
6229 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
6230 If RHS_ORIGTYPE is not NULL_TREE, it is the original type of RHS,
6231 which may differ from TREE_TYPE (RHS) for an enum value.
6233 LOCATION is the location of the MODIFYCODE operator.
6234 RHS_LOC is the location of the RHS. */
6236 tree
6240 {
6241 tree result;
6242 tree newrhs;
6249 /* Types that aren't fully specified cannot be used in assignments. */
6252 /* Avoid duplicate error messages from operands that had errors. */
6256 /* Ensure an error for assigning a non-lvalue array to an array in
6257 C90. */
6259 {
6262 }
6264 /* For ObjC properties, defer this check. */
6273 {
6276 rhs_origtype);
6285 }
6287 /* If a binary op has been requested, combine the old LHS value with the RHS
6288 producing the value we should actually store into the LHS. */
6291 {
6295 /* Construct the RHS for any non-atomic compound assignemnt. */
6297 {
6298 /* If in LHS op= RHS the RHS has side-effects, ensure they
6299 are preevaluated before the rest of the assignment expression's
6300 side-effects, because RHS could contain e.g. function calls
6301 that modify LHS. */
6303 {
6306 else
6311 newrhs);
6312 }
6316 /* The original type of the right hand side is no longer
6317 meaningful. */
6319 }
6320 }
6323 {
6324 /* Check if we are modifying an Objective-C property reference;
6325 if so, we need to generate setter calls. */
6328 else
6333 /* Else, do the check that we postponed for Objective-C. */
6336 }
6338 /* Give an error for storing in something that is 'const'. */
6343 {
6346 }
6350 /* If storing into a structure or union member,
6351 it has probably been given type `int'.
6352 Compute the type that would go with
6353 the actual amount of storage the member occupies. */
6362 /* If storing in a field that is in actuality a short or narrower than one,
6363 we must store in the field in its actual type. */
6366 {
6369 }
6371 /* Issue -Wc++-compat warnings about an assignment to an enum type
6372 when LHS does not have its original type. This happens for,
6373 e.g., an enum bitfield in a struct. */
6378 {
6380 ? rhs_origtype
6387 }
6389 /* Remove qualifiers. */
6393 /* Convert new value to destination type. Fold it first, then
6394 restore any excess precision information, for the sake of
6395 conversion warnings. */
6398 {
6401 {
6403 {
6406 }
6411 }
6412 else
6419 }
6421 /* Emit ObjC write barrier, if necessary. */
6423 {
6426 {
6429 }
6430 }
6432 /* Scan operands. */
6436 else
6437 {
6441 }
6443 /* If we got the LHS in a different type for storing in,
6444 convert the result back to the nominal type of LHS
6445 so that the value we return always has the same type
6446 as the LHS argument. */
6456 return_result:
6460 }
6461 \f
6462 /* Return whether STRUCT_TYPE has an anonymous field with type TYPE.
6463 This is used to implement -fplan9-extensions. */
6465 static bool
6467 {
6468 tree field;
6476 {
6479 TYPE_QUAL_ATOMIC)
6483 {
6487 }
6491 {
6495 }
6496 }
6498 }
6500 /* RHS is an expression whose type is pointer to struct. If there is
6501 an anonymous field in RHS with type TYPE, then return a pointer to
6502 that field in RHS. This is used with -fplan9-extensions. This
6503 returns NULL if no conversion could be found. */
6505 static tree
6507 {
6511 tree ret;
6520 TYPE_QUAL_ATOMIC)
6528 {
6534 TYPE_QUAL_ATOMIC)
6537 {
6541 }
6543 lhs_main_type))
6544 {
6549 }
6550 }
6557 NULL_TREE);
6561 {
6564 }
6567 }
6569 /* Issue an error message for a bad initializer component.
6570 GMSGID identifies the message.
6571 The component name is taken from the spelling stack. */
6575 {
6578 auto_diagnostic_group d;
6580 /* The gmsgid may be a format string with %< and %>. */
6589 }
6591 /* Issue a pedantic warning for a bad initializer component. OPT is
6592 the option OPT_* (from options.h) controlling this warning or 0 if
6593 it is unconditionally given. GMSGID identifies the message. The
6594 component name is taken from the spelling stack. */
6598 {
6599 /* Use the location where a macro was expanded rather than where
6600 it was defined to make sure macros defined in system headers
6601 but used incorrectly elsewhere are diagnosed. */
6603 auto_diagnostic_group d;
6611 }
6613 /* Issue a warning for a bad initializer component.
6615 OPT is the OPT_W* value corresponding to the warning option that
6616 controls this warning. GMSGID identifies the message. The
6617 component name is taken from the spelling stack. */
6619 static void
6621 {
6625 auto_diagnostic_group d;
6627 /* Use the location where a macro was expanded rather than where
6628 it was defined to make sure macros defined in system headers
6629 but used incorrectly elsewhere are diagnosed. */
6632 /* The gmsgid may be a format string with %< and %>. */
6637 }
6638 \f
6639 /* If TYPE is an array type and EXPR is a parenthesized string
6640 constant, warn if pedantic that EXPR is being used to initialize an
6641 object of type TYPE. */
6643 void
6645 {
6652 }
6654 /* Attempt to locate the parameter with the given index within FNDECL,
6655 returning DECL_SOURCE_LOCATION (FNDECL) if it can't be found. */
6657 static location_t
6659 {
6661 tree param;
6663 /* Locate param by index within DECL_ARGUMENTS (fndecl). */
6667 ;
6669 /* If something went wrong (e.g. if we have a builtin and thus no arguments),
6670 return DECL_SOURCE_LOCATION (FNDECL). */
6675 }
6677 /* Issue a note about a mismatching argument for parameter PARMNUM
6678 to FUNDECL, for types EXPECTED_TYPE and ACTUAL_TYPE.
6679 Attempt to issue the note at the pertinent parameter of the decl;
6680 failing that issue it at the location of FUNDECL; failing that
6681 issue it at PLOC. */
6683 static void
6686 {
6687 location_t loc;
6690 else
6696 }
6698 /* Issue a warning when an argument of ARGTYPE is passed to a built-in
6699 function FUNDECL declared without prototype to parameter PARMNUM of
6700 PARMTYPE when ARGTYPE does not promote to PARMTYPE. */
6702 static void
6705 {
6710 /* Avoid warning for enum arguments that promote to an integer type
6711 of the same size/mode. */
6723 /* This diagnoses even signed/unsigned mismatches. Those might be
6724 safe in many cases but GCC may emit suboptimal code for them so
6725 warning on those cases drives efficiency improvements. */
6729 "in a call to built-in function declared without "
6732 "in a call to built-in function declared without "
6737 fundecl);
6738 }
6740 /* Convert value RHS to type TYPE as preparation for an assignment to
6741 an lvalue of type TYPE. If ORIGTYPE is not NULL_TREE, it is the
6742 original type of RHS; this differs from TREE_TYPE (RHS) for enum
6743 types. NULL_POINTER_CONSTANT says whether RHS was a null pointer
6744 constant before any folding.
6745 The real work of conversion is done by `convert'.
6746 The purpose of this function is to generate error messages
6747 for assignments that are not allowed in C.
6748 ERRTYPE says whether it is argument passing, assignment,
6749 initialization or return.
6751 In the following example, '~' denotes where EXPR_LOC and '^' where
6752 LOCATION point to:
6754 f (var); [ic_argpass]
6755 ^ ~~~
6756 x = var; [ic_assign]
6757 ^ ~~~;
6758 int x = var; [ic_init]
6759 ^^^
6760 return x; [ic_return]
6761 ^
6763 FUNCTION is a tree for the function being called.
6764 PARMNUM is the number of the argument, for printing in error messages.
6765 WARNOPT may be set to a warning option to issue the corresponding warning
6766 rather than an error for invalid conversions. Used for calls to built-in
6767 functions declared without a prototype. */
6769 static tree
6774 {
6777 tree rhstype;
6782 /* Use the expansion point location to handle cases such as user's
6783 function returning a wrong-type macro defined in a system header. */
6787 {
6788 tree selector;
6789 /* Change pointer to function to the function itself for
6790 diagnostics. */
6795 /* Handle an ObjC selector specially for diagnostics. */
6799 {
6802 }
6803 }
6805 /* This macro is used to emit diagnostics to ensure that all format
6806 strings are complete sentences, visible to gettext and checked at
6807 compile time. */
6808 #define PEDWARN_FOR_ASSIGNMENT(LOCATION, PLOC, OPT, AR, AS, IN, RE) \
6809 do { \
6810 switch (errtype) \
6811 { \
6812 case ic_argpass: \
6813 { \
6814 auto_diagnostic_group d; \
6815 if (pedwarn (PLOC, OPT, AR, parmnum, rname)) \
6816 inform_for_arg (fundecl, (PLOC), parmnum, type, rhstype); \
6817 } \
6818 break; \
6819 case ic_assign: \
6820 pedwarn (LOCATION, OPT, AS); \
6821 break; \
6822 case ic_init: \
6823 case ic_init_const: \
6824 pedwarn_init (LOCATION, OPT, IN); \
6825 break; \
6826 case ic_return: \
6827 pedwarn (LOCATION, OPT, RE); \
6828 break; \
6829 default: \
6830 gcc_unreachable (); \
6831 } \
6832 } while (0)
6834 /* This macro is used to emit diagnostics to ensure that all format
6835 strings are complete sentences, visible to gettext and checked at
6836 compile time. It can be called with 'pedwarn' or 'warning_at'. */
6837 #define WARNING_FOR_QUALIFIERS(PEDWARN, LOCATION, PLOC, OPT, AR, AS, IN, RE, QUALS) \
6838 do { \
6839 switch (errtype) \
6840 { \
6841 case ic_argpass: \
6842 { \
6843 auto_diagnostic_group d; \
6844 if (PEDWARN) { \
6845 if (pedwarn (PLOC, OPT, AR, parmnum, rname, QUALS)) \
6846 inform_for_arg (fundecl, (PLOC), parmnum, type, rhstype); \
6847 } else { \
6848 if (warning_at (PLOC, OPT, AR, parmnum, rname, QUALS)) \
6849 inform_for_arg (fundecl, (PLOC), parmnum, type, rhstype); \
6850 } \
6851 } \
6852 break; \
6853 case ic_assign: \
6854 if (PEDWARN) \
6855 pedwarn (LOCATION, OPT, AS, QUALS); \
6856 else \
6857 warning_at (LOCATION, OPT, AS, QUALS); \
6858 break; \
6859 case ic_init: \
6860 case ic_init_const: \
6861 if (PEDWARN) \
6862 pedwarn (LOCATION, OPT, IN, QUALS); \
6863 else \
6864 warning_at (LOCATION, OPT, IN, QUALS); \
6865 break; \
6866 case ic_return: \
6867 if (PEDWARN) \
6868 pedwarn (LOCATION, OPT, RE, QUALS); \
6869 else \
6870 warning_at (LOCATION, OPT, RE, QUALS); \
6871 break; \
6872 default: \
6873 gcc_unreachable (); \
6874 } \
6875 } while (0)
6877 /* This macro is used to emit diagnostics to ensure that all format
6878 strings are complete sentences, visible to gettext and checked at
6879 compile time. It is the same as PEDWARN_FOR_ASSIGNMENT but with an
6880 extra parameter to enumerate qualifiers. */
6881 #define PEDWARN_FOR_QUALIFIERS(LOCATION, PLOC, OPT, AR, AS, IN, RE, QUALS) \
6882 WARNING_FOR_QUALIFIERS (true, LOCATION, PLOC, OPT, AR, AS, IN, RE, QUALS)
6895 {
6899 {
6916 }
6919 }
6922 {
6928 {
6954 }
6955 }
6958 {
6964 {
6969 }
6970 }
6973 {
6976 }
6979 {
6980 /* Except for passing an argument to an unprototyped function,
6981 this is a constraint violation. When passing an argument to
6982 an unprototyped function, it is compile-time undefined;
6983 making it a constraint in that case was rejected in
6984 DR#252. */
6988 else
6991 }
6999 /* A non-reference type can convert to a reference. This handles
7000 va_start, va_copy and possibly port built-ins. */
7002 {
7004 {
7008 else
7011 }
7028 }
7029 /* Some types can interconvert without explicit casts. */
7033 /* Arithmetic types all interconvert, and enum is treated like int. */
7042 {
7045 rhstype);
7058 }
7060 /* Aggregates in different TUs might need conversion. */
7067 /* Conversion to a transparent union or record from its member types.
7068 This applies only to function arguments. */
7072 {
7076 {
7087 {
7091 /* Any non-function converts to a [const][volatile] void *
7092 and vice versa; otherwise, targets must be the same.
7093 Meanwhile, the lhs target must have all the qualifiers of
7094 the rhs. */
7098 {
7101 /* If this type won't generate any warnings, use it. */
7109 /* Keep looking for a better type, but remember this one. */
7112 }
7113 }
7115 /* Can convert integer zero to any pointer type. */
7117 {
7120 }
7121 }
7124 {
7126 {
7127 /* We have only a marginally acceptable member type;
7128 it needs a warning. */
7132 /* Const and volatile mean something different for function
7133 types, so the usual warnings are not appropriate. */
7136 {
7137 /* Because const and volatile on functions are
7138 restrictions that say the function will not do
7139 certain things, it is okay to use a const or volatile
7140 function where an ordinary one is wanted, but not
7141 vice-versa. */
7145 OPT_Wdiscarded_qualifiers,
7147 "makes %q#v qualified function "
7150 "function pointer from "
7153 "function pointer from "
7158 }
7162 OPT_Wdiscarded_qualifiers,
7174 }
7182 }
7183 }
7185 /* Conversions among pointers */
7188 {
7189 /* If RHS refers to a built-in declared without a prototype
7190 BLTIN is the declaration of the built-in with a prototype
7191 and RHSTYPE is set to the actual type of the built-in. */
7192 tree bltin;
7201 addr_space_t asl;
7202 addr_space_t asr;
7207 TYPE_QUAL_ATOMIC)
7212 TYPE_QUAL_ATOMIC)
7214 /* Opaque pointers are treated like void pointers. */
7217 /* The Plan 9 compiler permits a pointer to a struct to be
7218 automatically converted into a pointer to an anonymous field
7219 within the struct. */
7224 {
7227 {
7233 }
7234 }
7236 /* C++ does not allow the implicit conversion void* -> T*. However,
7237 for the purpose of reducing the number of false positives, we
7238 tolerate the special case of
7240 int *p = NULL;
7242 where NULL is typically defined in C to be '(void *) 0'. */
7245 OPT_Wc___compat,
7246 "request for implicit conversion "
7249 /* See if the pointers point to incompatible address spaces. */
7254 {
7256 {
7258 {
7263 else
7266 }
7268 {
7273 else
7276 }
7279 {
7284 else
7287 }
7289 {
7294 else
7297 }
7300 }
7302 }
7304 /* Check if the right-hand side has a format attribute but the
7305 left-hand side doesn't. */
7308 {
7310 {
7313 "argument %d of %qE might be "
7319 "assignment left-hand side might be "
7325 "initialization left-hand side might be "
7330 "return type might be "
7335 }
7336 }
7338 /* See if the pointers point to incompatible scalar storage orders. */
7342 {
7343 tree t;
7346 {
7348 /* Do not warn for built-in functions, for example memcpy, since we
7349 control how they behave and they can be useful in this area. */
7353 "passing argument %d of %qE from incompatible "
7357 /* Do not warn if the RHS is a call to a function that returns a
7358 pointer that is not an alias. */
7363 "assignment to %qT from pointer type %qT with "
7368 /* Likewise. */
7373 "initialization of %qT from pointer type %qT with "
7378 "returning %qT from pointer type with incompatible "
7383 }
7384 }
7386 /* Any non-function converts to a [const][volatile] void *
7387 and vice versa; otherwise, targets must be the same.
7388 Meanwhile, the lhs target must have all the qualifiers of the rhs. */
7392 || is_opaque_pointer
7398 {
7399 /* Warn about loss of qualifers from pointers to arrays with
7400 qualifiers on the element type. */
7402 {
7410 OPT_Wdiscarded_array_qualifiers,
7420 }
7423 ||
7425 && !null_pointer_constant
7429 "%qE between function pointer "
7437 /* Const and volatile mean something different for function types,
7438 so the usual warnings are not appropriate. */
7441 {
7442 /* Assignments between atomic and non-atomic objects are OK. */
7448 /* Don't warn about loss of qualifier for conversions from
7449 qualified void* to pointers to arrays with corresponding
7450 qualifier on the element type (except for pedantic before C23). */
7453 OPT_Wdiscarded_qualifiers,
7467 /* If this is not a case of ignoring a mismatch in signedness,
7468 no warning. */
7471 ;
7472 /* If there is a mismatch, do warn. */
7475 {
7477 {
7478 auto_diagnostic_group d;
7482 "pointer targets in passing argument %d of "
7485 rhstype);
7486 }
7490 "pointer targets in assignment from %qT to %qT "
7496 "pointer targets in initialization of %qT "
7498 rhstype);
7502 "returning %qT from a function with return type "
7507 }
7508 }
7511 {
7512 /* Because const and volatile on functions are restrictions
7513 that say the function will not do certain things,
7514 it is okay to use a const or volatile function
7515 where an ordinary one is wanted, but not vice-versa. */
7519 OPT_Wdiscarded_qualifiers,
7521 "%q#v qualified function pointer "
7530 }
7531 }
7532 /* Avoid warning about the volatile ObjC EH puts on decls. */
7534 {
7536 {
7538 {
7539 auto_diagnostic_group d;
7543 "passing argument %d of %qE from incompatible "
7546 }
7551 "assignment to %qT from pointer to "
7554 else
7563 "initialization of %qT from pointer to "
7566 else
7568 "initialization of %qT from incompatible "
7575 "returning pointer to %qD of type %qT from "
7578 else
7580 "returning %qT from a function with incompatible "
7585 }
7586 }
7588 /* If RHS isn't an address, check pointer or array of packed
7589 struct or union. */
7593 }
7595 {
7596 /* ??? This should not be an error when inlining calls to
7597 unprototyped functions. */
7601 else
7604 }
7606 {
7607 /* An explicit constant 0 can convert to a pointer,
7608 or one that results from arithmetic, even including
7609 a cast to integer type. */
7612 {
7614 {
7615 auto_diagnostic_group d;
7619 "passing argument %d of %qE makes pointer from "
7622 }
7626 "assignment to %qT from %qT makes pointer from integer "
7632 "initialization of %qT from %qT makes pointer from "
7637 "function with return type %qT makes pointer from "
7642 }
7645 }
7647 {
7649 {
7651 {
7652 auto_diagnostic_group d;
7656 "passing argument %d of %qE makes integer from "
7659 }
7663 "assignment to %qT from %qT makes integer from pointer "
7669 "initialization of %qT from %qT makes integer from "
7674 "function with return type %qT makes integer from "
7679 }
7682 }
7684 {
7685 tree ret;
7691 }
7694 {
7696 {
7697 auto_diagnostic_group d;
7703 else
7706 }
7709 {
7714 else
7717 }
7720 {
7725 else
7728 }
7730 {
7735 else
7738 }
7741 }
7744 }
7745 \f
7746 /* If VALUE is a compound expr all of whose expressions are constant, then
7747 return its value. Otherwise, return error_mark_node.
7749 This is for handling COMPOUND_EXPRs as initializer elements
7750 which is allowed with a warning when -pedantic is specified. */
7752 static tree
7754 {
7756 {
7761 endtype);
7762 }
7765 else
7767 }
7768 \f
7769 /* Perform appropriate conversions on the initial value of a variable,
7770 store it in the declaration DECL,
7771 and print any error messages that are appropriate.
7772 If ORIGTYPE is not NULL_TREE, it is the original type of INIT.
7773 If the init is invalid, store an ERROR_MARK.
7775 INIT_LOC is the location of the initial value. */
7777 void
7779 {
7783 /* If variable's type was invalidly declared, just ignore it. */
7789 /* Digest the specified initializer into an expression. */
7796 /* Store the expression if valid; else report error. */
7806 /* ANSI wants warnings about out-of-range constant initializers. */
7811 /* Check if we need to set array size from compound literal size. */
7815 {
7822 {
7826 {
7827 /* For int foo[] = (int [3]){1}; we need to set array size
7828 now since later on array initializer will be just the
7829 brace enclosed list of the compound literal. */
7837 }
7838 }
7839 }
7840 }
7841 \f
7842 /* Methods for storing and printing names for error messages. */
7844 /* Implement a spelling stack that allows components of a name to be pushed
7845 and popped. Each element on the stack is this structure. */
7847 struct spelling
7848 {
7850 union
7851 {
7855 };
7857 #define SPELLING_STRING 1
7858 #define SPELLING_MEMBER 2
7859 #define SPELLING_BOUNDS 3
7865 /* Macros to save and restore the spelling stack around push_... functions.
7866 Alternative to SAVE_SPELLING_STACK. */
7868 #define SPELLING_DEPTH() (spelling - spelling_base)
7869 #define RESTORE_SPELLING_DEPTH(DEPTH) (spelling = spelling_base + (DEPTH))
7871 /* Push an element on the spelling stack with type KIND and assign VALUE
7872 to MEMBER. */
7874 #define PUSH_SPELLING(KIND, VALUE, MEMBER) \
7875 { \
7876 int depth = SPELLING_DEPTH (); \
7877 \
7878 if (depth >= spelling_size) \
7879 { \
7880 spelling_size += 10; \
7881 spelling_base = XRESIZEVEC (struct spelling, spelling_base, \
7882 spelling_size); \
7883 RESTORE_SPELLING_DEPTH (depth); \
7884 } \
7885 \
7886 spelling->kind = (KIND); \
7887 spelling->MEMBER = (VALUE); \
7888 spelling++; \
7889 }
7891 /* Push STRING on the stack. Printed literally. */
7893 static void
7895 {
7897 }
7899 /* Push a member name on the stack. Printed as '.' STRING. */
7901 static void
7903 {
7909 }
7911 /* Push an array bounds on the stack. Printed as [BOUNDS]. */
7913 static void
7915 {
7917 }
7919 /* Compute the maximum size in bytes of the printed spelling. */
7921 static int
7923 {
7928 {
7931 else
7933 }
7936 }
7938 /* Print the spelling to BUFFER and return it. */
7942 {
7948 {
7951 }
7952 else
7953 {
7958 ;
7959 }
7962 }
7964 /* Digest the parser output INIT as an initializer for type TYPE.
7965 Return a C expression of type TYPE to represent the initial value.
7967 If ORIGTYPE is not NULL_TREE, it is the original type of INIT.
7969 NULL_POINTER_CONSTANT is true if INIT is a null pointer constant.
7971 If INIT is a string constant, STRICT_STRING is true if it is
7972 unparenthesized or we should not warn here for it being parenthesized.
7973 For other types of INIT, STRICT_STRING is not used.
7975 INIT_LOC is the location of the INIT.
7977 REQUIRE_CONSTANT requests an error if non-constant initializers or
7978 elements are seen. */
7980 static tree
7984 {
7991 || !init
7998 {
8000 {
8003 }
8005 }
8007 /* Initialization of an array of chars from a string constant
8008 optionally enclosed in braces. */
8012 {
8013 tree typ1
8016 TYPE_QUAL_ATOMIC)
8018 /* Note that an array could be both an array of character type
8019 and an array of wchar_t if wchar_t is signed char or unsigned
8020 char. */
8029 {
8047 {
8050 }
8055 {
8060 }
8065 {
8069 /* Subtract the size of a single (possibly wide) character
8070 because it's ok to ignore the terminating null char
8071 that is counted in the length of the constant. */
8082 {
8083 unsigned HOST_WIDE_INT size
8088 }
8089 }
8093 }
8095 {
8099 }
8100 }
8102 /* Build a VECTOR_CST from a *constant* vector constructor. If the
8103 vector constructor is not constant (e.g. {1,2,3,foo()}) then punt
8104 below and handle as a constructor. */
8109 {
8116 {
8118 tree value;
8121 /* Iterate through elements and check if all constructor
8122 elements are *_CSTs. */
8125 {
8128 }
8133 }
8134 }
8139 /* Any type can be initialized
8140 from an expression of the same type, optionally with braces. */
8153 {
8155 {
8157 {
8160 inside_init = array_to_pointer_conversion
8162 else
8163 {
8166 }
8167 }
8168 }
8171 /* Although the types are compatible, we may require a
8172 conversion. */
8177 {
8178 /* As an extension, allow initializing objects with static storage
8179 duration with compound literals (which are then treated just as
8180 the brace enclosed list they contain). Also allow this for
8181 vectors, as we can only assign them with compound literals. */
8187 }
8191 {
8195 }
8197 /* Compound expressions can only occur here if -Wpedantic or
8198 -pedantic-errors is specified. In the later case, we always want
8199 an error. In the former case, we simply want a warning. */
8202 {
8203 inside_init
8208 else
8213 }
8217 {
8220 }
8225 /* Added to enable additional -Wsuggest-attribute=format warnings. */
8229 (require_constant
8230 ? ic_init_const
8234 }
8236 /* Handle scalar types, including conversions. */
8241 {
8248 inside_init);
8249 inside_init
8256 /* Check to see if we have already given an error message. */
8258 ;
8260 {
8263 }
8267 {
8271 }
8277 }
8279 /* Come here only for records and arrays. */
8282 {
8285 }
8289 }
8290 \f
8291 /* Handle initializers that use braces. */
8293 /* Type of object we are accumulating a constructor for.
8294 This type is always a RECORD_TYPE, UNION_TYPE or ARRAY_TYPE. */
8297 /* For a RECORD_TYPE or UNION_TYPE, this is the chain of fields
8298 left to fill. */
8301 /* For an ARRAY_TYPE, this is the specified index
8302 at which to store the next element we get. */
8305 /* For an ARRAY_TYPE, this is the maximum index. */
8308 /* For a RECORD_TYPE, this is the first field not yet written out. */
8311 /* For an ARRAY_TYPE, this is the index of the first element
8312 not yet written out. */
8315 /* In a RECORD_TYPE, the byte index of the next consecutive field.
8316 This is so we can generate gaps between fields, when appropriate. */
8319 /* If we are saving up the elements rather than allocating them,
8320 this is the list of elements so far (in reverse order,
8321 most recent first). */
8324 /* 1 if constructor should be incrementally stored into a constructor chain,
8325 0 if all the elements should be kept in AVL tree. */
8328 /* 1 if so far this constructor's elements are all compile-time constants. */
8331 /* 1 if so far this constructor's elements are all valid address constants. */
8334 /* 1 if this constructor has an element that cannot be part of a
8335 constant expression. */
8338 /* 1 if this constructor is erroneous so far. */
8341 /* 1 if this constructor is the universal zero initializer { 0 }. */
8344 /* Structure for managing pending initializer elements, organized as an
8345 AVL tree. */
8347 struct init_node
8348 {
8352 tree purpose;
8353 tree value;
8354 tree origtype;
8355 };
8357 /* Tree of pending elements at this constructor level.
8358 These are elements encountered out of order
8359 which belong at places we haven't reached yet in actually
8360 writing the output.
8361 Will never hold tree nodes across GC runs. */
8364 /* The SPELLING_DEPTH of this constructor. */
8367 /* DECL node for which an initializer is being read.
8368 0 means we are reading a constructor expression
8369 such as (struct foo) {...}. */
8372 /* Nonzero if this is an initializer for a top-level decl. */
8375 /* Nonzero if there were any member designators in this initializer. */
8378 /* Nesting depth of designator list. */
8381 /* Nonzero if there were diagnosed errors in this designator list. */
8384 \f
8385 /* This stack has a level for each implicit or explicit level of
8386 structuring in the initializer, including the outermost one. It
8387 saves the values of most of the variables above. */
8391 struct constructor_stack
8392 {
8394 tree type;
8395 tree fields;
8396 tree index;
8397 tree max_index;
8398 tree unfilled_index;
8399 tree unfilled_fields;
8400 tree bit_index;
8405 /* If value nonzero, this value should replace the entire
8406 constructor at this level. */
8418 };
8422 /* This stack represents designators from some range designator up to
8423 the last designator in the list. */
8425 struct constructor_range_stack
8426 {
8429 tree range_start;
8430 tree index;
8431 tree range_end;
8432 tree fields;
8433 };
8437 /* This stack records separate initializers that are nested.
8438 Nested initializers can't happen in ANSI C, but GNU C allows them
8439 in cases like { ... (struct foo) { ... } ... }. */
8441 struct initializer_stack
8442 {
8444 tree decl;
8456 };
8459 \f
8460 /* Prepare to parse and output the initializer for variable DECL. */
8462 void
8465 {
8489 {
8491 require_constant_elements
8493 /* For a scalar, you can always use any value to initialize,
8494 even within braces. */
8497 }
8498 else
8499 {
8503 }
8516 }
8518 void
8520 {
8523 /* Free the whole constructor stack of this initializer. */
8525 {
8529 }
8533 /* Pop back to the data of the outer initializer (if any). */
8549 }
8550 \f
8551 /* Call here when we see the initializer is surrounded by braces.
8552 This is instead of a call to push_init_level;
8553 it is matched by a call to pop_init_level.
8555 TYPE is the type to initialize, for a constructor expression.
8556 For an initializer for a decl, TYPE is zero. */
8558 void
8560 {
8610 {
8612 /* Skip any nameless bit fields at the beginning. */
8619 }
8621 {
8623 {
8624 constructor_max_index
8627 /* Detect non-empty initializations of zero-length arrays. */
8632 /* constructor_max_index needs to be an INTEGER_CST. Attempts
8633 to initialize VLAs will cause a proper error; avoid tree
8634 checking errors as well by setting a safe value. */
8639 constructor_index
8642 }
8643 else
8644 {
8647 }
8650 }
8652 {
8653 /* Vectors are like simple fixed-size arrays. */
8654 constructor_max_index =
8658 }
8659 else
8660 {
8661 /* Handle the case of int x = {5}; */
8664 }
8665 }
8666 \f
8669 /* Called when we see an open brace for a nested initializer. Finish
8670 off any pending levels with implicit braces. */
8671 void
8673 {
8675 {
8680 last_init_list_comma),
8683 && constructor_max_index
8685 constructor_index))
8688 last_init_list_comma),
8690 else
8692 }
8693 }
8695 /* Push down into a subobject, for initialization.
8696 If this is for an explicit set of braces, IMPLICIT is 0.
8697 If it is because the next element belongs at a lower level,
8698 IMPLICIT is 1 (or 2 if the push is because of designator list). */
8700 void
8703 {
8707 /* Unless this is an explicit brace, we need to preserve previous
8708 content if any. */
8710 {
8715 }
8750 /* If the upper initializer is designated, then mark this as
8751 designated too to prevent bogus warnings. */
8755 {
8760 }
8762 /* Don't die if an entire brace-pair level is superfluous
8763 in the containing level. */
8765 ;
8767 {
8768 /* Don't die if there are extra init elts at the end. */
8771 else
8772 {
8775 constructor_depth++;
8776 }
8777 }
8779 {
8782 constructor_depth++;
8783 }
8786 {
8791 }
8794 {
8803 }
8806 {
8811 }
8814 {
8816 /* Skip any nameless bit fields at the beginning. */
8823 }
8825 {
8826 /* Vectors are like simple fixed-size arrays. */
8827 constructor_max_index =
8831 }
8833 {
8835 {
8836 constructor_max_index
8839 /* Detect non-empty initializations of zero-length arrays. */
8844 /* constructor_max_index needs to be an INTEGER_CST. Attempts
8845 to initialize VLAs will cause a proper error; avoid tree
8846 checking errors as well by setting a safe value. */
8851 constructor_index
8854 }
8855 else
8860 {
8861 /* We need to split the char/wchar array into individual
8862 characters, so that we don't have to special case it
8863 everywhere. */
8865 }
8866 }
8867 else
8868 {
8873 }
8874 }
8876 /* At the end of an implicit or explicit brace level,
8877 finish up that level of constructor. If a single expression
8878 with redundant braces initialized that level, return the
8879 c_expr structure for that expression. Otherwise, the original_code
8880 element is set to ERROR_MARK.
8881 If we were outputting the elements as they are read, return 0 as the value
8882 from inner levels (process_init_element ignores that),
8883 but return error_mark_node as the value from the outermost level
8884 (that's what we want to put in DECL_INITIAL).
8885 Otherwise, return a CONSTRUCTOR expression as the value. */
8887 struct c_expr
8890 location_t insert_before)
8891 {
8899 {
8900 /* When we come to an explicit close brace,
8901 pop any inner levels that didn't have explicit braces. */
8905 insert_before),
8908 }
8909 else
8914 /* Now output all pending elements. */
8920 /* Error for initializing a flexible array member, or a zero-length
8921 array member in an inappropriate context. */
8926 {
8927 /* Silently discard empty initializations. The parser will
8928 already have pedwarned for empty brackets. */
8931 else
8932 {
8937 else
8941 /* We have already issued an error message for the existence
8942 of a flexible array member not at the end of the structure.
8943 Discard the initializer so that we do not die later. */
8946 }
8947 }
8950 {
8952 /* Initialization with { } counts as zeroinit. */
8956 /* This might be zeroinit as well. */
8961 /* If the constructor has more than one element, it can't be { 0 }. */
8964 }
8966 /* Warn when some structs are initialized with direct aggregation. */
8969 {
8972 OPT_Wmissing_braces,
8974 }
8976 /* Warn when some struct elements are implicitly initialized to zero. */
8978 && constructor_type
8981 {
8982 /* Do not warn for flexible array members or zero-length arrays. */
8989 /* Do not warn if this level of the initializer uses member
8990 designators; it is likely to be deliberate. */
8991 && !constructor_designated
8992 /* Do not warn about initializing with { 0 } or with { }. */
8994 {
8997 constructor_unfilled_fields,
8998 constructor_type))
9001 }
9002 }
9004 /* Pad out the end of the structure. */
9006 /* If this closes a superfluous brace pair,
9007 just pass out the element between them. */
9010 ;
9014 {
9015 /* A nonincremental scalar initializer--just return
9016 the element, after verifying there is just one. */
9018 {
9022 }
9024 {
9027 }
9028 else
9030 }
9031 else
9032 {
9035 else
9036 {
9038 constructor_elements);
9045 }
9046 }
9049 {
9054 }
9083 }
9085 /* Common handling for both array range and field name designators.
9086 ARRAY argument is nonzero for array ranges. Returns false for success. */
9088 static bool
9091 {
9092 tree subtype;
9095 /* Don't die if an entire brace-pair level is superfluous
9096 in the containing level, or for an erroneous type. */
9100 /* If there were errors in this designator list already, bail out
9101 silently. */
9105 /* Likewise for an initializer for a variable-size type. Those are
9106 diagnosed in digest_init. */
9112 {
9115 /* Designator list starts at the level of closest explicit
9116 braces. */
9120 last_init_list_comma),
9124 }
9127 {
9139 }
9143 {
9146 }
9148 {
9151 }
9157 }
9159 /* If there are range designators in designator list, push a new designator
9160 to constructor_range_stack. RANGE_END is end of such stack range or
9161 NULL_TREE if there is no range designator at this level. */
9163 static void
9165 {
9181 }
9183 /* Within an array initializer, specify the next index to be initialized.
9184 FIRST is that index. If LAST is nonzero, then initialize a range
9185 of indices, running from FIRST through LAST. */
9187 void
9190 {
9198 {
9201 }
9204 {
9208 "array index in initializer is not "
9210 }
9213 {
9217 "array index in initializer is not "
9219 }
9232 else
9233 {
9239 {
9242 }
9245 {
9249 {
9252 }
9253 else
9254 {
9258 {
9262 }
9263 }
9264 }
9266 designator_depth++;
9270 }
9271 }
9273 /* Within a struct initializer, specify the next field to be initialized. */
9275 void
9278 {
9279 tree field;
9287 {
9290 }
9295 {
9298 {
9304 }
9305 else
9308 }
9309 else
9310 do
9311 {
9313 designator_depth++;
9319 {
9322 }
9323 }
9325 }
9326 \f
9327 /* Add a new initializer to the tree of pending initializers. PURPOSE
9328 identifies the initializer, either array index or field in a structure.
9329 VALUE is the value of that index or field. If ORIGTYPE is not
9330 NULL_TREE, it is the original type of VALUE.
9332 IMPLICIT is true if value comes from pop_init_level (1),
9333 the new initializer has been merged with the existing one
9334 and thus no warnings should be emitted about overriding an
9335 existing initializer. */
9337 static void
9340 {
9347 {
9349 {
9355 else
9356 {
9358 {
9361 "initialized field with side-effects "
9366 }
9370 }
9371 }
9372 }
9373 else
9374 {
9375 tree bitpos;
9379 {
9385 else
9386 {
9388 {
9391 "initialized field with side-effects "
9396 }
9400 }
9401 }
9402 }
9417 {
9421 {
9425 {
9427 {
9428 /* L rotation. */
9441 {
9444 else
9446 }
9447 else
9449 }
9450 else
9451 {
9452 /* LR rotation. */
9474 {
9477 else
9479 }
9480 else
9482 }
9484 }
9485 else
9486 {
9487 /* p->balance == +1; growth of left side balances the node. */
9490 }
9491 }
9493 {
9495 /* Growth propagation from right side. */
9498 {
9500 {
9501 /* R rotation. */
9514 {
9517 else
9519 }
9520 else
9522 }
9524 {
9525 /* RL rotation */
9547 {
9550 else
9552 }
9553 else
9555 }
9557 }
9558 else
9559 {
9560 /* p->balance == -1; growth of right side balances the node. */
9563 }
9564 }
9568 }
9569 }
9571 /* Build AVL tree from a sorted chain. */
9573 static void
9575 {
9585 braced_init_obstack);
9588 {
9590 /* Skip any nameless bit fields at the beginning. */
9595 }
9597 {
9599 constructor_unfilled_index
9602 else
9604 }
9606 }
9608 /* Build AVL tree from a string constant. */
9610 static void
9613 {
9630 p < end
9631 && !(constructor_max_index
9634 {
9636 {
9639 }
9640 else
9641 {
9645 {
9648 else
9653 }
9654 }
9657 {
9660 {
9662 {
9665 }
9666 }
9668 {
9671 }
9675 }
9681 braced_init_obstack);
9682 }
9685 }
9687 /* Return value of FIELD in pending initializer or NULL_TREE if the field was
9688 not initialized yet. */
9690 static tree
9692 {
9696 {
9703 {
9708 else
9710 }
9711 }
9713 {
9717 && (!constructor_unfilled_fields
9724 {
9729 else
9731 }
9732 }
9734 {
9738 }
9740 }
9742 /* "Output" the next constructor element.
9743 At top level, really output it to assembler code now.
9744 Otherwise, collect it in a list from which we will make a CONSTRUCTOR.
9745 If ORIGTYPE is not NULL_TREE, it is the original type of VALUE.
9746 TYPE is the data type that the containing data type wants here.
9747 FIELD is the field (a FIELD_DECL) or the index that this element fills.
9748 If VALUE is a string constant, STRICT_STRING is true if it is
9749 unparenthesized or we should not warn here for it being parenthesized.
9750 For other types of VALUE, STRICT_STRING is not used.
9752 PENDING if true means output pending elements that belong
9753 right after this element. (PENDING is normally true;
9754 it is false while outputting pending elements, to avoid recursion.)
9756 IMPLICIT is true if value comes from pop_init_level (1),
9757 the new initializer has been merged with the existing one
9758 and thus no warnings should be emitted about overriding an
9759 existing initializer. */
9761 static void
9765 {
9771 {
9774 }
9787 {
9788 /* As an extension, allow initializing objects with static storage
9789 duration with compound literals (which are then treated just as
9790 the brace enclosed list they contain). */
9796 }
9800 {
9803 }
9813 && TYPE_REVERSE_STORAGE_ORDER
9822 /* Digest the initializer and issue any errors about incompatible
9823 types before issuing errors about non-constant initializers. */
9828 require_constant_value);
9830 {
9833 }
9837 /* Proceed to check the constness of the original initializer. */
9839 {
9841 {
9844 }
9848 }
9854 /* Issue -Wc++-compat warnings about initializing a bitfield with
9855 enum type. */
9863 {
9870 }
9872 /* If this field is empty and does not have side effects (and is not at
9873 the end of structure), don't do anything other than checking the
9874 initializer. */
9884 /* Finally, set VALUE to the initializer value digested above. */
9887 /* If this element doesn't come next in sequence,
9888 put it on constructor_pending_elts. */
9890 && (!constructor_incremental
9892 {
9898 braced_init_obstack);
9900 }
9902 && (!constructor_incremental
9904 {
9905 /* We do this for records but not for unions. In a union,
9906 no matter which field is specified, it can be initialized
9907 right away since it starts at the beginning of the union. */
9909 {
9912 else
9913 {
9921 }
9922 }
9925 braced_init_obstack);
9927 }
9930 {
9932 {
9939 }
9941 /* We can have just one union field set. */
9943 }
9945 /* Otherwise, output this element either to
9946 constructor_elements or to the assembler file. */
9951 /* Advance the variable that indicates sequential elements output. */
9953 constructor_unfilled_index
9955 bitsize_one_node);
9957 {
9958 constructor_unfilled_fields
9961 /* Skip any nameless bit fields. */
9964 constructor_unfilled_fields =
9966 }
9970 /* Now output any pending elements which have become next. */
9973 }
9975 /* For two FIELD_DECLs in the same chain, return -1 if field1
9976 comes before field2, 1 if field1 comes after field2 and
9977 0 if field1 == field2. */
9979 static int
9981 {
9988 {
9989 /* If one of the fields has non-zero bitsize, then that
9990 field must be the last one in a sequence of zero
9991 sized fields, fields after it will have bigger
9992 bit_position. */
10001 /* Otherwise, fallback to DECL_CHAIN walk to find out
10002 which field comes earlier. Walk chains of both
10003 fields, so that if field1 and field2 are close to each
10004 other in either order, it is found soon even for large
10005 sequences of zero sized fields. */
10008 {
10012 {
10015 }
10026 }
10027 }
10030 else
10032 }
10034 /* Output any pending elements which have become next.
10035 As we output elements, constructor_unfilled_{fields,index}
10036 advances, which may cause other elements to become next;
10037 if so, they too are output.
10039 If ALL is 0, we return when there are
10040 no more pending elements to output now.
10042 If ALL is 1, we output space as necessary so that
10043 we can output all the pending elements. */
10044 static void
10046 {
10048 tree next;
10050 retry:
10052 /* Look through the whole pending tree.
10053 If we find an element that should be output now,
10054 output it. Otherwise, set NEXT to the element
10055 that comes first among those still pending. */
10059 {
10061 {
10063 constructor_unfilled_index))
10067 braced_init_obstack);
10070 {
10071 /* Advance to the next smaller node. */
10074 else
10075 {
10076 /* We have reached the smallest node bigger than the
10077 current unfilled index. Fill the space first. */
10080 }
10081 }
10082 else
10083 {
10084 /* Advance to the next bigger node. */
10087 else
10088 {
10089 /* We have reached the biggest node in a subtree. Find
10090 the parent of it, which is the next bigger node. */
10096 {
10099 }
10100 }
10101 }
10102 }
10104 {
10105 /* If the current record is complete we are done. */
10115 braced_init_obstack);
10117 {
10118 /* Advance to the next smaller node. */
10121 else
10122 {
10123 /* We have reached the smallest node bigger than the
10124 current unfilled field. Fill the space first. */
10127 }
10128 }
10129 else
10130 {
10131 /* Advance to the next bigger node. */
10134 else
10135 {
10136 /* We have reached the biggest node in a subtree. Find
10137 the parent of it, which is the next bigger node. */
10144 {
10147 }
10148 }
10149 }
10150 }
10151 }
10153 /* Ordinarily return, but not if we want to output all
10154 and there are elements left. */
10158 /* If it's not incremental, just skip over the gap, so that after
10159 jumping to retry we will output the next successive element. */
10165 /* ELT now points to the node in the pending tree with the next
10166 initializer to output. */
10168 }
10169 \f
10170 /* Expression VALUE coincides with the start of type TYPE in a braced
10171 initializer. Return true if we should treat VALUE as initializing
10172 the first element of TYPE, false if we should treat it as initializing
10173 TYPE as a whole.
10175 If the initializer is clearly invalid, the question becomes:
10176 which choice gives the best error message? */
10178 static bool
10180 {
10190 /* GNU vectors can be initialized elementwise. However, treat any
10191 kind of vector value as initializing the vector type as a whole,
10192 regardless of whether the value is a GNU vector. Such initializers
10193 are valid if and only if they would have been valid in a non-braced
10194 initializer like:
10196 TYPE foo = VALUE;
10198 so recursing into the vector type would be at best confusing or at
10199 worst wrong. For example, when -flax-vector-conversions is in effect,
10200 it's possible to initialize a V8HI from a V4SI, even though the vectors
10201 have different element types and different numbers of elements. */
10209 }
10211 /* Add one non-braced element to the current constructor level.
10212 This adjusts the current position within the constructor's type.
10213 This may also start or terminate implicit levels
10214 to handle a partly-braced initializer.
10216 Once this has found the correct level for the new element,
10217 it calls output_init_element.
10219 IMPLICIT is true if value comes from pop_init_level (1),
10220 the new initializer has been merged with the existing one
10221 and thus no warnings should be emitted about overriding an
10222 existing initializer. */
10224 void
10227 {
10229 int string_flag
10240 /* Handle superfluous braces around string cst as in
10241 char x[] = {"foo"}; */
10243 && constructor_type
10244 && !was_designated
10248 {
10253 }
10256 {
10259 }
10261 /* Ignore elements of a brace group if it is entirely superfluous
10262 and has already been diagnosed, or if the type is erroneous. */
10266 /* Ignore elements of an initializer for a variable-size type.
10267 Those are diagnosed in digest_init. */
10277 OPT_Wdesignated_init,
10278 "positional initialization of field "
10281 /* If we've exhausted any levels that didn't have braces,
10282 pop them now. */
10284 {
10289 last_init_list_comma),
10293 && constructor_max_index
10295 constructor_index))
10298 last_init_list_comma),
10300 else
10302 }
10304 /* In the case of [LO ... HI] = VALUE, only evaluate VALUE once. */
10306 {
10307 /* If value is a compound literal and we'll be just using its
10308 content, don't put it into a SAVE_EXPR. */
10311 {
10314 {
10317 }
10322 }
10323 }
10326 {
10328 {
10329 tree fieldtype;
10333 {
10336 }
10343 /* Error for non-static initialization of a flexible array member. */
10345 && !require_constant_value
10348 {
10352 }
10354 /* Error for initialization of a flexible array member with
10355 a string constant if the structure is in an array. E.g.:
10356 struct S { int x; char y[]; };
10357 struct S s[] = { { 1, "foo" } };
10358 is invalid. */
10364 {
10369 {
10372 }
10374 {
10378 }
10379 }
10381 /* Accept a string constant to initialize a subarray. */
10387 /* Otherwise, if we have come to a subaggregate,
10388 and we don't have an element of its type, push into it. */
10391 {
10394 }
10397 {
10402 braced_init_obstack);
10404 }
10405 else
10406 /* Do the bookkeeping for an element that was
10407 directly output as a constructor. */
10408 {
10409 /* For a record, keep track of end position of last field. */
10411 constructor_bit_index
10416 /* If the current field was the first one not yet written out,
10417 it isn't now, so update. */
10419 {
10421 /* Skip any nameless bit fields. */
10423 && (DECL_UNNAMED_BIT_FIELD
10425 constructor_unfilled_fields =
10427 }
10428 }
10431 /* Skip any nameless bit fields at the beginning. */
10435 }
10437 {
10438 tree fieldtype;
10442 {
10446 }
10453 /* Warn that traditional C rejects initialization of unions.
10454 We skip the warning if the value is zero. This is done
10455 under the assumption that the zero initializer in user
10456 code appears conditioned on e.g. __STDC__ to avoid
10457 "missing initializer" warnings and relies on default
10458 initialization to zero in the traditional C case.
10459 We also skip the warning if the initializer is designated,
10460 again on the assumption that this must be conditional on
10461 __STDC__ anyway (and we've already complained about the
10462 member-designator already). */
10469 /* Accept a string constant to initialize a subarray. */
10475 /* Otherwise, if we have come to a subaggregate,
10476 and we don't have an element of its type, push into it. */
10479 {
10482 }
10485 {
10490 braced_init_obstack);
10492 }
10493 else
10494 /* Do the bookkeeping for an element that was
10495 directly output as a constructor. */
10496 {
10499 }
10502 }
10504 {
10508 /* Accept a string constant to initialize a subarray. */
10514 /* Otherwise, if we have come to a subaggregate,
10515 and we don't have an element of its type, push into it. */
10518 {
10521 }
10526 {
10530 }
10532 /* Now output the actual element. */
10534 {
10539 braced_init_obstack);
10541 }
10543 constructor_index
10548 /* If we are doing the bookkeeping for an element that was
10549 directly output as a constructor, we must update
10550 constructor_unfilled_index. */
10552 }
10554 {
10557 /* Do a basic check of initializer size. Note that vectors
10558 always have a fixed size derived from their type. */
10560 {
10564 }
10566 /* Now output the actual element. */
10568 {
10574 braced_init_obstack);
10575 }
10577 constructor_index
10582 /* If we are doing the bookkeeping for an element that was
10583 directly output as a constructor, we must update
10584 constructor_unfilled_index. */
10586 }
10588 /* Handle the sole element allowed in a braced initializer
10589 for a scalar variable. */
10592 {
10596 }
10597 else
10598 {
10603 braced_init_obstack);
10605 }
10607 /* Handle range initializers either at this level or anywhere higher
10608 in the designator stack. */
10610 {
10617 {
10621 braced_init_obstack,
10622 last_init_list_comma),
10624 }
10628 {
10632 braced_init_obstack,
10633 last_init_list_comma),
10635 }
10643 {
10647 {
10650 }
10659 }
10664 }
10667 }
10670 }
10671 \f
10672 /* Build a complete asm-statement, whose components are a CV_QUALIFIER
10673 (guaranteed to be 'volatile' or null) and ARGS (represented using
10674 an ASM_EXPR node). */
10675 tree
10677 {
10681 }
10683 /* Build an asm-expr, whose components are a STRING, some OUTPUTS,
10684 some INPUTS, and some CLOBBERS. The latter three may be NULL.
10685 SIMPLE indicates whether there was anything at all after the
10686 string in the asm expression -- asm("blah") and asm("blah" : )
10687 are subtly different. We use a ASM_EXPR node to represent this.
10688 LOC is the location of the asm, and IS_INLINE says whether this
10689 is asm inline. */
10690 tree
10693 {
10694 tree tail;
10695 tree args;
10708 /* Remove output conversions that change the type but not the mode. */
10710 {
10715 /* ??? Really, this should not be here. Users should be using a
10716 proper lvalue, dammit. But there's a long history of using casts
10717 in the output operands. In cases like longlong.h, this becomes a
10718 primitive form of typechecking -- if the cast can be removed, then
10719 the output operand had a type of the proper width; otherwise we'll
10720 get an error. Gross, but ... */
10738 {
10739 /* If the operand is going to end up in memory,
10740 mark it addressable. */
10746 {
10749 }
10750 }
10751 else
10755 }
10758 {
10759 tree input;
10766 {
10767 /* If the operand is going to end up in memory,
10768 mark it addressable. */
10770 {
10773 /* Strip the nops as we allow this case. FIXME, this really
10774 should be rejected or made deprecated. */
10778 }
10779 else
10780 {
10788 {
10791 }
10792 }
10793 }
10794 else
10798 }
10802 /* asm statements without outputs, including simple ones, are treated
10803 as volatile. */
10809 }
10810 \f
10811 /* Generate a goto statement to LABEL. LOC is the location of the
10812 GOTO. */
10814 tree
10816 {
10821 {
10826 }
10827 }
10829 /* Generate a computed goto statement to EXPR. LOC is the location of
10830 the GOTO. */
10832 tree
10834 {
10836 tree t;
10841 {
10845 }
10851 }
10853 /* Generate a C `return' statement. RETVAL is the expression for what
10854 to return, or a null pointer for `return;' with no value. LOC is
10855 the location of the return statement, or the location of the expression,
10856 if the statement has any. If ORIGTYPE is not NULL_TREE, it
10857 is the original type of RETVAL. */
10859 tree
10861 {
10866 /* Use the expansion point to handle cases such as returning NULL
10867 in a function returning void. */
10875 {
10879 {
10882 }
10888 }
10891 {
10895 {
10898 warned_here = pedwarn
10901 else
10902 warned_here = warning_at
10909 }
10910 }
10912 {
10916 warned_here = pedwarn
10919 else
10920 warned_here = pedwarn
10926 }
10927 else
10928 {
10933 tree inner;
10951 /* Strip any conversions, additions, and subtractions, and see if
10952 we are returning the address of a local variable. Warn if so. */
10954 {
10956 {
10957 CASE_CONVERT:
10965 /* If the second operand of the MINUS_EXPR has a pointer
10966 type (or is converted from it), this may be valid, so
10967 don't give a warning. */
10968 {
10981 }
10995 {
10999 else
11000 {
11005 }
11006 }
11011 }
11014 }
11021 }
11027 }
11028 \f
11030 /* The SWITCH_STMT being built. */
11031 tree switch_stmt;
11033 /* The original type of the testing expression, i.e. before the
11034 default conversion is applied. */
11035 tree orig_type;
11037 /* A splay-tree mapping the low element of a case range to the high
11038 element, or NULL_TREE if there is no high element. Used to
11039 determine whether or not a new case label duplicates an old case
11040 label. We need a tree, rather than simply a hash table, because
11041 of the GNU case range extension. */
11042 splay_tree cases;
11044 /* The bindings at the point of the switch. This is used for
11045 warnings crossing decls when branching to a case label. */
11048 /* Whether the switch includes any break statements. */
11051 /* The next node on the stack. */
11054 /* Remember whether the controlling expression had boolean type
11055 before integer promotions for the sake of -Wswitch-bool. */
11057 };
11059 /* A stack of the currently active switch statements. The innermost
11060 switch statement is on the top of the stack. There is no need to
11061 mark the stack for garbage collection because it is only active
11062 during the processing of the body of a function, and we never
11063 collect at that point. */
11067 /* Start a C switch statement, testing expression EXP. Return the new
11068 SWITCH_STMT. SWITCH_LOC is the location of the `switch'.
11069 SWITCH_COND_LOC is the location of the switch's condition.
11070 EXPLICIT_CAST_P is true if the expression EXP has an explicit cast. */
11072 tree
11074 location_t switch_cond_loc,
11076 {
11082 {
11086 {
11088 {
11091 }
11093 }
11094 else
11095 {
11099 /* Warn if the condition has boolean value. */
11105 /* Explicit cast to int suppresses this warning. */
11122 }
11123 }
11125 /* Add this new SWITCH_STMT to the stack. */
11138 }
11140 /* Process a case label at location LOC. */
11142 tree
11144 {
11148 {
11153 }
11156 {
11161 }
11164 {
11167 else
11170 }
11174 loc))
11183 }
11185 /* Finish the switch statement. TYPE is the original type of the
11186 controlling expression of the switch, or NULL_TREE. */
11188 void
11190 {
11192 location_t switch_location;
11196 /* Emit warnings as needed. */
11206 /* Pop the stack. */
11211 }
11212 \f
11213 /* Emit an if statement. IF_LOCUS is the location of the 'if'. COND,
11214 THEN_BLOCK and ELSE_BLOCK are expressions to be used; ELSE_BLOCK
11215 may be null. */
11217 void
11219 tree else_block)
11220 {
11221 tree stmt;
11226 }
11228 tree
11230 {
11231 /* In switch statements break is sometimes stylistically used after
11232 a return statement. This can lead to spurious warnings about
11233 control reaching the end of a non-void function when it is
11234 inlined. Note that we are calling block_may_fallthru with
11235 language specific tree nodes; this works because
11236 block_may_fallthru returns true when given something it does not
11237 understand. */
11242 {
11259 }
11260 else
11262 {
11275 }
11281 {
11282 /* The foreach expander produces low-level code using gotos instead
11283 of a structured loop construct. */
11286 }
11288 }
11290 /* A helper routine for c_process_expr_stmt and c_finish_stmt_expr. */
11292 static void
11294 {
11299 ;
11301 {
11305 }
11307 {
11311 {
11315 }
11323 }
11324 else
11326 }
11328 /* Process an expression as if it were a complete statement. Emit
11329 diagnostics, but do not call ADD_STMT. LOC is the location of the
11330 statement. */
11332 tree
11334 {
11335 tree exprv;
11350 /* If we're not processing a statement expression, warn about unused values.
11351 Warnings for statement expressions will be emitted later, once we figure
11352 out which is the result. */
11367 /* If the expression is not of a type to which we cannot assign a line
11368 number, wrap the thing in a no-op NOP_EXPR. */
11370 {
11373 }
11376 }
11378 /* Emit an expression as a statement. LOC is the location of the
11379 expression. */
11381 tree
11383 {
11386 else
11388 }
11390 /* Do the opposite and emit a statement as an expression. To begin,
11391 create a new binding level and return it. */
11393 tree
11395 {
11396 tree ret;
11398 /* We must force a BLOCK for this level so that, if it is not expanded
11399 later, there is a way to turn off the entire subtree of blocks that
11400 are contained in it. */
11405 ? NULL
11408 /* Mark the current statement list as belonging to a statement list. */
11412 }
11414 /* LOC is the location of the compound statement to which this body
11415 belongs. */
11417 tree
11419 {
11426 ? NULL
11429 /* Locate the last statement in BODY. See c_end_compound_stmt
11430 about always returning a BIND_EXPR. */
11434 continue_searching:
11436 {
11442 /* This can happen with degenerate cases like ({ }). No value. */
11446 /* If we're supposed to generate side effects warnings, process
11447 all of the statements except the last. */
11449 {
11452 {
11453 location_t tloc;
11458 }
11459 }
11462 }
11464 /* If the end of the list is exception related, then the list was split
11465 by a call to push_cleanup. Continue searching. */
11468 {
11472 }
11477 /* In the case that the BIND_EXPR is not necessary, return the
11478 expression out from inside it. */
11480 /* Skip nested debug stmts. */
11483 {
11484 /* Even if this looks constant, do not allow it in a constant
11485 expression. */
11487 /* Do not warn if the return value of a statement expression is
11488 unused. */
11491 }
11493 /* Extract the type of said expression. */
11496 /* If we're not returning a value at all, then the BIND_EXPR that
11497 we already have is a fine expression to return. */
11501 /* Now that we've located the expression containing the value, it seems
11502 silly to make voidify_wrapper_expr repeat the process. Create a
11503 temporary of the appropriate type and stick it in a TARGET_EXPR. */
11506 /* Unwrap a no-op NOP_EXPR as added by c_finish_expr_stmt. This avoids
11507 tree_expr_nonnegative_p giving up immediately. */
11516 {
11520 }
11521 }
11522 \f
11523 /* Begin and end compound statements. This is as simple as pushing
11524 and popping new statement lists from the tree. */
11526 tree
11528 {
11533 }
11535 /* End a compound statement. STMT is the statement. LOC is the
11536 location of the compound statement-- this is usually the location
11537 of the opening brace. */
11539 tree
11541 {
11545 {
11549 }
11554 /* If this compound statement is nested immediately inside a statement
11555 expression, then force a BIND_EXPR to be created. Otherwise we'll
11556 do the wrong thing for ({ { 1; } }) or ({ 1; { } }). In particular,
11557 STATEMENT_LISTs merge, and thus we can lose track of what statement
11558 was really last. */
11562 {
11566 }
11569 }
11571 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
11572 when the current scope is exited. EH_ONLY is true when this is not
11573 meant to apply to normal control flow transfer. */
11575 void
11577 {
11589 }
11590 \f
11591 /* Build a vector comparison of ARG0 and ARG1 using CODE opcode
11592 into a value of TYPE type. Comparison is done via VEC_COND_EXPR. */
11594 static tree
11597 {
11603 }
11605 /* Possibly warn about an address of OP never being NULL in a comparison
11606 operation CODE involving null. */
11608 static void
11610 {
11611 /* Prevent warnings issued for macro expansion. */
11618 {
11619 /* Allow casts to intptr_t to suppress the warning. */
11624 }
11627 {
11628 /* Allow a cast to void* to suppress the warning. */
11633 /* Adding any value to a null pointer, including zero, is undefined
11634 in C. This includes the expression &p[0] where p is the null
11635 pointer, although &p[0] will have been folded to p by this point
11636 and so not diagnosed. */
11639 "the comparison will always evaluate as %<false%> "
11641 op);
11642 else
11644 "the comparison will always evaluate as %<true%> "
11646 op);
11649 }
11658 {
11659 /* The address of either complex part may not be null. */
11662 "the comparison will always evaluate as %<false%> "
11664 op);
11665 else
11667 "the comparison will always evaluate as %<true%> "
11669 op);
11671 }
11673 /* Set to true in the loop below if OP dereferences is operand.
11674 In such a case the ultimate target need not be a decl for
11675 the null [in]equality test to be constant. */
11678 /* Get the outermost array or object, or member. */
11680 {
11682 {
11683 /* Get the member (its address is never null). */
11686 }
11688 /* Get the outer array/object to refer to in the warning. */
11691 }
11699 "the comparison will always evaluate as %<false%> "
11701 op);
11702 else
11704 "the comparison will always evaluate as %<true%> "
11706 op);
11710 }
11712 /* Build a binary-operation expression without default conversions.
11713 CODE is the kind of expression to build.
11714 LOCATION is the operator's location.
11715 This function differs from `build' in several ways:
11716 the data type of the result is computed and recorded in it,
11717 warnings are generated if arg data types are invalid,
11718 special handling for addition and subtraction of pointers is known,
11719 and some optimization is done (operations on narrow ints
11720 are done in the narrower type when that gives the same result).
11721 Constant folding is also done before the result is returned.
11723 Note that the operands will never have enumeral types, or function
11724 or array types, because either they will have the default conversions
11725 performed or they have both just been converted to some other type in which
11726 the arithmetic is to be done. */
11728 tree
11731 {
11733 tree eptype;
11741 /* Expression code to give to the expression when it is built.
11742 Normally this is CODE, which is what the caller asked for,
11743 but in some special cases we change it. */
11746 /* Data type in which the computation is to be performed.
11747 In the simplest cases this is the common type of the arguments. */
11750 /* When the computation is in excess precision, the type of the
11751 final EXCESS_PRECISION_EXPR. */
11754 /* Nonzero means operands have already been type-converted
11755 in whatever way is necessary.
11756 Zero means they need to be converted to RESULT_TYPE. */
11759 /* Nonzero means create the expression with this type, rather than
11760 RESULT_TYPE. */
11763 /* Nonzero means after finally constructing the expression
11764 convert it to this type. */
11767 /* Nonzero if this is an operation like MIN or MAX which can
11768 safely be computed in short if both args are promoted shorts.
11769 Also implies COMMON.
11770 -1 indicates a bitwise operation; this makes a difference
11771 in the exact conditions for when it is safe to do the operation
11772 in a narrower mode. */
11775 /* Nonzero if this is a comparison operation;
11776 if both args are promoted shorts, compare the original shorts.
11777 Also implies COMMON. */
11780 /* Nonzero if this is a right-shift operation, which can be computed on the
11781 original short and then promoted if the operand is a promoted short. */
11784 /* Nonzero means set RESULT_TYPE to the common type of the args. */
11787 /* True means types are compatible as far as ObjC is concerned. */
11790 /* True means this is an arithmetic operation that may need excess
11791 precision. */
11794 /* True means this is a boolean operation that converts both its
11795 operands to truth-values. */
11798 /* Remember whether we're doing / or %. */
11801 /* Remember whether we're doing << or >>. */
11804 /* Tree holding instrumentation expression. */
11821 {
11824 int_const = (int_const_or_overflow
11827 }
11828 else
11831 /* Do not apply default conversion in mixed vector/scalar expression. */
11834 {
11837 }
11843 /* The expression codes of the data types of the arguments tell us
11844 whether the arguments are integers, floating, pointers, etc. */
11848 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
11852 /* If an error was already reported for one of the arguments,
11853 avoid reporting another error. */
11868 {
11871 }
11874 {
11892 /* Excess precision for implicit conversions of integers to
11893 floating point in C11 and later. */
11894 may_need_excess_precision = (flag_isoc11
11902 }
11904 {
11907 }
11910 {
11913 }
11915 {
11918 }
11921 {
11924 }
11928 /* In case when one of the operands of the binary operation is
11929 a vector and another is a scalar -- convert scalar to vector. */
11932 {
11937 {
11941 {
11943 tree sc;
11954 }
11956 {
11958 tree sc;
11969 }
11972 }
11973 }
11976 {
11978 /* Handle the pointer + int case. */
11980 {
11983 }
11985 {
11988 }
11989 else
11994 /* Subtraction of two similar pointers.
11995 We must subtract them as integers, then divide by object size. */
11998 {
12001 }
12002 /* Handle pointer minus int. Just like pointer plus int. */
12004 {
12007 }
12008 else
12032 {
12043 else
12044 /* Although it would be tempting to shorten always here, that
12045 loses on some targets, since the modulo instruction is
12046 undefined if the quotient can't be represented in the
12047 computation mode. We shorten only if unsigned or if
12048 dividing by something we know != -1. */
12053 }
12061 /* Allow vector types which are not floating point types. */
12080 {
12081 /* Although it would be tempting to shorten always here, that loses
12082 on some targets, since the modulo instruction is undefined if the
12083 quotient can't be represented in the computation mode. We shorten
12084 only if unsigned or if dividing by something we know != -1. */
12089 }
12103 {
12104 /* Result of these operations is always an int,
12105 but that does not mean the operands should be
12106 converted to ints! */
12109 {
12112 }
12113 else
12116 {
12119 }
12120 else
12124 }
12126 {
12127 int_const_or_overflow = (int_operands
12131 int_const = (int_const_or_overflow
12135 }
12137 {
12138 int_const_or_overflow = (int_operands
12142 int_const = (int_const_or_overflow
12146 }
12149 /* Shift operations: result has same type as first operand;
12150 always convert second operand to int.
12151 Also set SHORT_SHIFT if shifting rightward. */
12160 {
12163 }
12168 {
12171 {
12173 {
12178 }
12180 {
12184 {
12189 }
12190 }
12191 else
12192 {
12197 {
12202 }
12203 }
12204 }
12206 /* Use the type of the value to be shifted. */
12208 /* Avoid converting op1 to result_type later. */
12210 }
12220 {
12223 }
12228 {
12233 {
12234 /* Don't reject a left shift of a negative value in a context
12235 where a constant expression is needed in C90. */
12241 }
12243 {
12245 {
12250 }
12252 {
12256 {
12261 }
12262 }
12264 {
12269 }
12274 }
12276 /* Use the type of the value to be shifted. */
12278 /* Avoid converting op1 to result_type later. */
12280 }
12286 {
12287 tree intt;
12289 {
12293 }
12297 {
12301 }
12303 /* It's not precisely specified how the usual arithmetic
12304 conversions apply to the vector types. Here, we use
12305 the unsigned type if one of the operands is signed and
12306 the other one is unsigned. */
12308 {
12311 else
12315 }
12317 /* Always construct signed integer vector type. */
12319 (SCALAR_TYPE_MODE
12322 {
12327 }
12333 }
12336 OPT_Wfloat_equal,
12338 /* Result of comparison is always int,
12339 but don't convert the args to int! */
12347 {
12350 }
12352 {
12355 }
12357 {
12364 /* Anything compares with void *. void * compares with anything.
12365 Otherwise, the targets must be compatible
12366 and both must be object or both incomplete. */
12370 {
12374 }
12376 {
12380 }
12382 {
12386 }
12387 else
12388 /* Avoid warning about the volatile ObjC EH puts on decls. */
12394 {
12396 result_type = build_pointer_type
12398 }
12399 }
12401 {
12404 }
12406 {
12409 }
12422 {
12423 tree intt;
12425 {
12429 }
12433 {
12437 }
12439 /* It's not precisely specified how the usual arithmetic
12440 conversions apply to the vector types. Here, we use
12441 the unsigned type if one of the operands is signed and
12442 the other one is unsigned. */
12444 {
12447 else
12451 }
12453 /* Always construct signed integer vector type. */
12455 (SCALAR_TYPE_MODE
12458 {
12463 }
12469 }
12477 {
12480 addr_space_t as_common;
12483 {
12497 }
12499 {
12503 }
12504 else
12505 {
12507 result_type = build_pointer_type
12511 }
12512 }
12514 {
12522 }
12524 {
12532 }
12534 {
12537 }
12539 {
12542 }
12547 {
12553 }
12564 /* Used for OpenMP atomics. */
12571 }
12580 {
12582 maybe_range_label_for_tree_type_mismatch
12589 }
12594 &&
12598 {
12604 {
12607 "implicit conversion from %qT to %qT "
12608 "to match other operand of binary "
12610 location);
12613 }
12622 {
12623 /* An operation on mixed real/complex operands must be
12624 handled specially, but the language-independent code can
12625 more easily optimize the plain complex arithmetic if
12626 -fno-signed-zeros. */
12630 {
12633 }
12635 {
12640 }
12641 else
12642 {
12647 }
12651 {
12658 {
12663 /* Fall through. */
12670 }
12671 }
12672 else
12673 {
12680 {
12684 /* Fall through. */
12694 }
12695 }
12698 }
12700 /* For certain operations (which identify themselves by shorten != 0)
12701 if both args were extended from the same smaller type,
12702 do the arithmetic in that type and then extend.
12704 shorten !=0 and !=1 indicates a bitwise operation.
12705 For them, this optimization is safe only if
12706 both args are zero-extended or both are sign-extended.
12707 Otherwise, we might change the result.
12708 Eg, (short)-1 | (unsigned short)-1 is (int)-1
12709 but calculated in (unsigned short) it would be (unsigned short)-1. */
12712 {
12716 }
12718 /* Shifts can be shortened if shifting right. */
12721 {
12732 /* We can shorten only if the shift count is less than the
12733 number of bits in the smaller type size. */
12735 /* We cannot drop an unsigned shift after sign-extension. */
12737 {
12738 /* Do an unsigned shift if the operand was zero-extended. */
12739 result_type
12742 /* Convert value-to-be-shifted to that type. */
12746 }
12747 }
12749 /* Comparison operations are shortened too but differently.
12750 They identify themselves by setting short_compare = 1. */
12753 {
12754 /* Don't write &op0, etc., because that would prevent op0
12755 from being kept in a register.
12756 Instead, make copies of the our local variables and
12757 pass the copies by reference, then copy them back afterward. */
12760 tree val
12765 {
12768 }
12775 {
12781 {
12784 }
12785 else
12786 {
12787 /* Fold for the sake of possible warnings, as in
12788 build_conditional_expr. This requires the
12789 "original" values to be folded, not just op0 and
12790 op1. */
12791 c_inhibit_evaluation_warnings++;
12796 c_inhibit_evaluation_warnings--;
12798 require_constant_value,
12799 NULL);
12801 require_constant_value,
12802 NULL);
12803 }
12810 {
12815 }
12816 }
12817 }
12818 }
12820 /* At this point, RESULT_TYPE must be nonzero to avoid an error message.
12821 If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
12822 Then the expression will be built.
12823 It will be given type FINAL_TYPE if that is nonzero;
12824 otherwise, it will be given type RESULT_TYPE. */
12827 {
12828 /* Favor showing any expression locations that are available. */
12833 }
12836 {
12840 {
12843 }
12844 }
12847 {
12849 semantic_result_type);
12851 semantic_result_type);
12853 /* This can happen if one operand has a vector type, and the other
12854 has a different type. */
12857 }
12860 | SANITIZE_DIVIDE
12861 | SANITIZE_FLOAT_DIVIDE
12866 {
12867 /* OP0 and/or OP1 might have side-effects. */
12873 | SANITIZE_FLOAT_DIVIDE
12878 }
12880 /* Treat expressions in initializers specially as they can't trap. */
12882 ret = (require_constant_value
12886 else
12891 return_build_binary_op:
12894 ret = (int_operands
12911 }
12914 /* Convert EXPR to be a truth-value, validating its type for this
12915 purpose. LOCATION is the source location for the expression. */
12917 tree
12919 {
12923 {
12925 error_at (location, "used array that cannot be converted to pointer where scalar is required");
12954 }
12959 {
12964 }
12965 else
12966 /* ??? Should we also give an error for vectors rather than leaving
12967 those to give errors later? */
12971 {
12974 else
12976 }
12980 }
12981 \f
12983 /* Convert EXPR to a contained DECL, updating *TC, *TI and *SE as
12984 required. */
12986 tree
12988 {
12990 {
12992 /* Executing a compound literal inside a function reinitializes
12993 it. */
12997 }
12998 else
13000 }
13001 \f
13002 /* Generate OMP construct CODE, with BODY and CLAUSES as its compound
13003 statement. LOC is the location of the construct. */
13005 tree
13007 tree clauses)
13008 {
13018 }
13020 /* Generate OACC_DATA, with CLAUSES and BLOCK as its compound
13021 statement. LOC is the location of the OACC_DATA. */
13023 tree
13025 {
13026 tree stmt;
13037 }
13039 /* Generate OACC_HOST_DATA, with CLAUSES and BLOCK as its compound
13040 statement. LOC is the location of the OACC_HOST_DATA. */
13042 tree
13044 {
13045 tree stmt;
13056 }
13058 /* Like c_begin_compound_stmt, except force the retention of the BLOCK. */
13060 tree
13062 {
13063 tree block;
13069 }
13071 /* Generate OMP_PARALLEL, with CLAUSES and BLOCK as its compound
13072 statement. LOC is the location of the OMP_PARALLEL. */
13074 tree
13076 {
13077 tree stmt;
13088 }
13090 /* Like c_begin_compound_stmt, except force the retention of the BLOCK. */
13092 tree
13094 {
13095 tree block;
13101 }
13103 /* Generate OMP_TASK, with CLAUSES and BLOCK as its compound
13104 statement. LOC is the location of the #pragma. */
13106 tree
13108 {
13109 tree stmt;
13120 }
13122 /* Generate GOMP_cancel call for #pragma omp cancel. */
13124 void
13126 {
13137 else
13138 {
13140 "%<parallel%>, %<for%>, %<sections%> or %<taskgroup%> "
13143 }
13146 {
13151 else
13152 {
13155 {
13161 }
13162 }
13168 }
13169 else
13173 ifc);
13175 }
13177 /* Generate GOMP_cancellation_point call for
13178 #pragma omp cancellation point. */
13180 void
13182 {
13193 else
13194 {
13196 "%<parallel%>, %<for%>, %<sections%> or %<taskgroup%> "
13199 }
13203 }
13205 /* Helper function for handle_omp_array_sections. Called recursively
13206 to handle multiple array-section-subscripts. C is the clause,
13207 T current expression (initially OMP_CLAUSE_DECL), which is either
13208 a TREE_LIST for array-section-subscript (TREE_PURPOSE is low-bound
13209 expression if specified, TREE_VALUE length expression if specified,
13210 TREE_CHAIN is what it has been specified after, or some decl.
13211 TYPES vector is populated with array section types, MAYBE_ZERO_LEN
13212 set to true if any of the array-section-subscript could have length
13213 of zero (explicit or implicit), FIRST_NON_ONE is the index of the
13214 first array-section-subscript which is known not to have length
13215 of one. Given say:
13216 map(a[:b][2:1][:c][:2][:d][e:f][2:5])
13217 FIRST_NON_ONE will be 3, array-section-subscript [:b], [2:1] and [:c]
13218 all are or may have length of 1, array-section-subscript [:2] is the
13219 first one known not to have length 1. For array-section-subscript
13220 <= FIRST_NON_ONE we diagnose non-contiguous arrays if low bound isn't
13221 0 or length isn't the array domain max + 1, for > FIRST_NON_ONE we
13222 can if MAYBE_ZERO_LEN is false. MAYBE_ZERO_LEN will be true in the above
13223 case though, as some lengths could be zero. */
13225 static tree
13229 {
13232 {
13239 {
13243 }
13245 {
13250 }
13252 {
13255 }
13260 {
13262 {
13267 }
13269 {
13271 {
13275 }
13280 {
13285 }
13287 {
13292 else
13294 }
13295 }
13296 }
13298 {
13303 else
13308 }
13312 {
13316 }
13321 {
13326 }
13331 {
13332 /* If the array section is pointer based and the pointer
13333 itself is _Atomic qualified, we need to atomically load
13334 the pointer. */
13335 c_expr expr;
13341 }
13343 }
13358 {
13361 low_bound);
13363 }
13365 {
13368 length);
13370 }
13386 {
13388 {
13393 }
13394 }
13396 {
13398 {
13404 {
13406 {
13411 }
13412 }
13413 else
13415 }
13418 first_non_one++;
13419 }
13421 {
13425 {
13427 "for unknown bound array type length expression must "
13430 }
13433 {
13438 }
13442 {
13447 }
13452 {
13453 tree size
13457 {
13459 {
13461 "low bound %qE above array section size "
13465 }
13467 {
13473 {
13478 }
13480 }
13483 && tree_int_cst_equal
13485 low_bound))
13486 first_non_one++;
13487 }
13489 {
13497 first_non_one++;
13498 }
13500 {
13502 {
13504 "length %qE above array section size "
13508 }
13510 {
13511 tree lbpluslen
13517 {
13519 "high bound %qE above array section size "
13523 }
13524 }
13525 }
13526 }
13528 {
13536 first_non_one++;
13537 }
13539 /* For [lb:] we will need to evaluate lb more than once. */
13541 {
13544 {
13547 }
13548 }
13549 }
13551 {
13553 {
13556 "for array function parameter length expression "
13558 else
13562 }
13566 {
13571 }
13572 /* If there is a pointer type anywhere but in the very first
13573 array-section-subscript, the array section could be non-contiguous. */
13577 {
13578 /* If any prior dimension has a non-one length, then deem this
13579 array section as non-contiguous. */
13582 {
13585 {
13590 }
13591 }
13592 }
13593 }
13594 else
13595 {
13599 }
13602 /* We will need to evaluate lb more than once. */
13605 {
13608 }
13611 }
13613 /* Handle array sections for clause C. */
13615 static bool
13617 {
13630 ort);
13637 {
13640 /* Need to evaluate side effects in the length expressions
13641 if any. */
13643 {
13645 {
13648 else
13651 }
13653 }
13658 }
13659 else
13660 {
13670 {
13674 i--;
13688 {
13697 {
13698 tree size;
13701 size_one_node);
13703 {
13704 do_warn_noncontiguous:
13706 "array section is not contiguous in %qs "
13710 }
13711 }
13714 {
13717 else
13721 }
13722 }
13723 else
13724 {
13725 tree l;
13735 else
13736 {
13739 size_one_node);
13742 }
13744 {
13746 size_zero_node);
13749 else
13752 }
13754 {
13762 {
13765 {
13770 }
13773 }
13778 }
13779 else
13781 }
13782 }
13788 {
13811 else
13812 {
13817 }
13820 }
13834 {
13853 }
13857 else
13877 }
13879 }
13881 /* Helper function of finish_omp_clauses. Clone STMT as if we were making
13882 an inline call. But, remap
13883 the OMP_DECL1 VAR_DECL (omp_out resp. omp_orig) to PLACEHOLDER
13884 and OMP_DECL2 VAR_DECL (omp_in resp. omp_priv) to DECL. */
13886 static tree
13889 {
13890 copy_body_data id;
13908 }
13910 /* Helper function of c_finish_omp_clauses, called via walk_tree.
13911 Find OMP_CLAUSE_PLACEHOLDER (passed in DATA) in *TP. */
13913 static tree
13915 {
13919 }
13921 /* Similarly, but also walk aggregate fields. */
13925 static tree
13927 {
13931 {
13932 tree field;
13938 {
13947 pset);
13953 }
13954 }
13959 }
13961 /* Finish OpenMP iterators ITER. Return true if they are errorneous
13962 and clauses containing them should be removed. */
13964 static bool
13966 {
13969 {
13974 tree orig_step;
13978 {
13981 }
13983 {
13985 var);
13988 }
13990 {
13994 }
13996 {
14000 }
14003 {
14006 }
14008 {
14013 }
14020 {
14027 }
14029 {
14033 }
14039 {
14042 }
14044 tree it2;
14046 {
14055 {
14060 }
14062 {
14066 }
14068 {
14072 }
14074 {
14078 }
14079 }
14081 {
14084 }
14089 }
14091 }
14093 /* Ensure that pointers are used in OpenACC attach and detach clauses.
14094 Return true if an error has been detected. */
14096 static bool
14098 {
14102 /* OpenACC attach / detach clauses must be pointers. */
14105 {
14112 {
14116 }
14117 }
14120 }
14122 /* For all elements of CLAUSES, validate them against their constraints.
14123 Remove any elements from the list that are invalid. */
14125 tree
14127 {
14147 /* 1 if normal/task reduction has been seen, -1 if inscan reduction
14148 has been seen, -2 if mixed inscan/normal reduction diagnosed. */
14159 /* If ort == C_ORT_OMP_DECLARE_SIMD used as uniform_head instead. */
14163 /* If ort == C_ORT_OMP used as nontemporal_head or use_device_xxx_head
14164 instead and for ort == C_ORT_OMP_TARGET used as in_reduction_head. */
14171 {
14174 }
14177 {
14183 {
14199 {
14201 "%<inscan%> and non-%<inscan%> %<reduction%> clauses "
14204 }
14205 /* FALLTHRU */
14211 {
14213 {
14216 }
14221 {
14223 "%<inscan%> %<reduction%> clause with array "
14227 }
14228 }
14231 {
14234 }
14241 {
14247 {
14250 t);
14253 }
14257 {
14260 t);
14263 }
14268 index_type);
14275 }
14277 {
14282 }
14285 {
14286 /* Disallow zero sized or potentially zero sized task
14287 reductions. */
14289 {
14295 }
14297 {
14303 }
14304 }
14308 {
14313 {
14339 }
14341 {
14347 }
14348 }
14350 {
14355 }
14357 {
14367 {
14373 }
14383 decl_placeholder ? decl_placeholder
14391 {
14403 decl_placeholder ? decl_placeholder
14406 {
14411 }
14413 c_find_omp_placeholder_r,
14416 }
14417 else
14418 {
14419 tree init;
14423 else
14427 }
14433 }
14435 {
14439 {
14444 }
14450 }
14456 {
14458 "%<nowait%> clause must not be used together "
14462 }
14468 {
14473 }
14483 {
14485 "modifier should not be specified in %<linear%> "
14486 "clause on %<simd%> or %<for%> constructs when not "
14489 }
14492 {
14494 "linear clause applied to non-integral non-pointer "
14498 }
14500 {
14505 }
14507 {
14510 {
14512 /* map_head bitmap is used as uniform_head if
14513 declare_simd. */
14517 }
14519 {
14521 "%<linear%> clause step %qE is neither constant "
14525 }
14526 }
14528 {
14534 fold_convert
14539 }
14540 else
14545 check_dup_generic:
14547 check_dup_generic_t:
14549 {
14554 }
14563 {
14567 {
14569 "%qD appears more than once in data-sharing "
14573 }
14577 {
14579 ort == C_ORT_ACC
14582 t);
14584 }
14585 else
14587 }
14592 {
14596 }
14601 {
14605 else
14609 }
14610 else
14616 {
14617 move_implicit:
14619 /* Move firstprivate and map clauses with
14620 OMP_CLAUSE_{FIRSTPRIVATE,MAP}_IMPLICIT set to the end of
14621 clauses chain. */
14627 {
14631 }
14634 {
14638 }
14639 else
14645 }
14650 {
14654 }
14662 {
14666 }
14668 {
14675 else
14679 }
14680 else
14689 {
14693 }
14696 {
14700 }
14701 else
14708 {
14712 }
14715 {
14717 "%qE in %<aligned%> clause is neither a pointer nor "
14720 }
14722 {
14727 }
14729 {
14732 t);
14734 }
14735 else
14742 {
14746 }
14748 {
14750 "%qE appears more than once in %<nontemporal%> "
14753 }
14754 else
14761 {
14765 }
14767 {
14770 t);
14772 }
14773 else
14774 {
14778 }
14784 {
14788 }
14790 {
14793 {
14796 {
14804 sizetype,
14808 {
14811 }
14813 }
14814 }
14816 }
14817 /* FALLTHRU */
14823 {
14825 last_iterators_remove
14831 }
14832 else
14835 {
14840 {
14842 "%<depend%> clause with %<depobj%> dependence "
14845 }
14847 }
14852 {
14855 {
14857 "%<omp_all_memory%> used with %<depend%> kind "
14860 }
14861 }
14863 {
14865 "%qE is not lvalue expression nor array section in "
14869 }
14872 {
14879 }
14882 {
14884 {
14886 "%qE does not have %<omp_depend_t%> type in "
14887 "%<depend%> clause with %<depobj%> dependence "
14890 }
14891 }
14894 {
14896 "%qE should not have %<omp_depend_t%> type in "
14897 "%<depend%> clause with dependence type other than "
14900 }
14902 {
14905 else
14906 {
14910 {
14913 }
14915 RO_UNARY_STAR);
14917 {
14920 }
14921 }
14927 else
14929 }
14935 /* FALLTHRU */
14941 {
14944 else
14945 {
14948 {
14950 "array section does not have mappable type "
14954 }
14956 {
14961 }
14966 {
14967 do
14968 {
14972 {
14977 }
14978 }
14988 {
14991 }
14995 {
14998 "%qD appears more than once in motion "
15002 "%qD appears more than once in data "
15004 else
15006 "%qD appears more than once in map "
15009 }
15010 else
15011 {
15014 }
15015 }
15016 }
15022 /* In this case, we have a single array element which is a
15023 pointer, and we already set OMP_CLAUSE_SIZE in
15024 handle_omp_array_sections above. For attach/detach clauses,
15025 reset the OMP_CLAUSE_SIZE (representing a bias) to zero
15026 here. */
15029 }
15031 {
15034 }
15035 /* OpenACC attach / detach clauses must be pointers. */
15037 {
15040 }
15044 /* For attach/detach clauses, set OMP_CLAUSE_SIZE (representing a
15045 bias) to zero here, so it is not set erroneously to the pointer
15046 size later on in gimplify.cc. */
15050 {
15055 }
15057 {
15060 }
15066 {
15072 }
15076 {
15078 {
15083 }
15085 {
15090 }
15092 {
15097 }
15099 {
15102 {
15107 }
15110 {
15115 else
15117 }
15121 {
15126 }
15127 }
15131 {
15136 }
15137 }
15139 {
15144 }
15146 {
15151 }
15155 && !indir_component_ref_p
15166 {
15171 }
15175 {
15180 }
15189 {
15193 {
15197 }
15200 {
15204 else
15208 }
15209 else
15211 }
15214 {
15221 else
15225 }
15228 {
15232 }
15235 {
15239 else
15243 }
15244 else
15245 {
15250 }
15263 ;
15265 {
15268 "%qE is neither a variable nor a function name in "
15270 else
15274 }
15276 {
15279 cname);
15281 }
15283 {
15286 cname);
15288 }
15292 {
15294 "%qE appears more than once on the same "
15297 }
15298 else
15305 {
15309 else
15314 }
15315 /* map_head bitmap is used as uniform_head if declare_simd. */
15325 {
15328 {
15333 }
15335 {
15340 }
15341 }
15347 {
15350 else
15351 {
15355 }
15356 }
15370 {
15372 "%<nowait%> clause must not be used together "
15376 }
15383 {
15385 "%<order%> clause must not be used together "
15389 }
15391 {
15392 /* Silently remove duplicates. */
15395 }
15403 {
15409 }
15476 {
15478 "%<order%> clause must not be used together "
15482 }
15498 {
15500 "%<inbranch%> clause is incompatible with "
15504 }
15515 {
15520 }
15525 }
15528 {
15532 {
15536 }
15539 {
15545 {
15552 /* The __func__ variable and similar function-local
15553 predefined variables may be listed in a shared or
15554 firstprivate clause. */
15563 }
15565 {
15571 }
15575 {
15577 "%<const%> qualified %qE may appear only in "
15580 }
15581 }
15582 }
15586 else
15588 }
15591 && safelen
15594 {
15596 "%<simdlen%> clause value is bigger than "
15600 }
15603 && schedule_clause
15606 {
15608 "%<nonmonotonic%> schedule modifier specified together "
15614 }
15617 {
15619 "%qs clause specified together with %<inscan%> "
15622 }
15625 {
15627 "%qs clause specified together with %<inscan%> "
15630 }
15634 || allocate_seen
15637 {
15641 {
15646 {
15656 }
15657 /* FALLTHRU */
15668 }
15673 {
15675 "%<linear%> clause step is a parameter %qD not "
15679 }
15685 {
15696 }
15700 else
15702 }
15706 {
15711 {
15713 "%qD specified in %<allocate%> clause but not in "
15716 }
15719 else
15721 }
15724 {
15726 "%<nogroup%> clause must not be used together with "
15729 }
15732 {
15734 {
15736 "%<detach%> clause must not be used together with "
15739 }
15740 else
15741 {
15745 {
15752 {
15754 "the event handle of a %<detach%> clause "
15757 }
15760 else
15762 }
15763 }
15764 }
15768 }
15770 /* Return code to initialize DST with a copy constructor from SRC.
15771 C doesn't have copy constructors nor assignment operators, only for
15772 _Atomic vars we need to perform __atomic_load from src into a temporary
15773 followed by __atomic_store of the temporary to dst. */
15775 tree
15777 {
15792 /* Expansion of a generic atomic load may require an addition
15793 element, so allocate enough to prevent a resize. */
15796 /* Build __atomic_load (&src, &tmp, SEQ_CST); */
15805 /* Build __atomic_store (&dst, &tmp, SEQ_CST); */
15812 }
15814 /* Create a transaction node. */
15816 tree
15818 {
15825 }
15827 /* Make a variant type in the proper way for C/C++, propagating qualifiers
15828 down to the element type of an array. If ORIG_QUAL_TYPE is not
15829 NULL, then it should be used as the qualified type
15830 ORIG_QUAL_INDIRECT levels down in array type derivation (to
15831 preserve information about the typedef name from which an array
15832 type was derived). */
15834 tree
15837 {
15842 {
15843 tree t;
15848 /* See if we already have an identically qualified type. */
15851 else
15853 {
15860 }
15862 {
15873 {
15874 tree unqualified_canon
15879 {
15880 unqualified_canon
15883 }
15886 }
15887 else
15889 }
15891 }
15893 /* A restrict-qualified pointer type must be a pointer to object or
15894 incomplete type. Note that the use of POINTER_TYPE_P also allows
15895 REFERENCE_TYPEs, which is appropriate for C++. */
15899 {
15902 }
15905 ? orig_qual_type
15907 /* A variant type does not inherit the list of incomplete vars from the
15908 type main variant. */
15914 }
15916 /* Build a VA_ARG_EXPR for the C parser. */
15918 tree
15920 {
15923 /* VA_ARG_EXPR cannot be used for a scalar va_list with reverse storage
15924 order because it takes the address of the expression. */
15927 {
15930 }
15932 {
15936 }
15938 {
15940 type);
15942 }
15947 }
15949 /* Return truthvalue of whether T1 is the same tree structure as T2.
15950 Return 1 if they are the same. Return false if they are different. */
15952 bool
15954 {
15973 /* They might have become equal now. */
15981 {
16005 /* We need to do this when determining whether or not two
16006 non-type pointer to member function template arguments
16007 are the same. */
16011 {
16015 {
16020 }
16021 }
16035 {
16050 }
16053 {
16057 /* Special case: if either target is an unallocated VAR_DECL,
16058 it means that it's going to be unified with whatever the
16059 TARGET_EXPR is really supposed to initialize, so treat it
16060 as being equivalent to anything. */
16071 }
16088 {
16097 }
16101 }
16104 {
16112 {
16116 {
16128 }
16139 }
16145 }
16146 }
16148 /* Returns true when the function declaration FNDECL is implicit,
16149 introduced as a result of a call to an otherwise undeclared
16150 function, and false otherwise. */
16152 bool
16154 {
16156 }