| blob | 5d4e973c89e4da532848683e95133b599aef5253 |
1 /* Build expressions with type checking for C compiler.
2 Copyright (C) 1987-2018 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
9 version.
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14 for more details.
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
21 /* This file is part of the C front end.
22 It contains routines to build C expressions given their operands,
23 including computing the types of the result, C-specific error checks,
24 and some optimization. */
56 /* Possible cases of implicit bad conversions. Used to select
57 diagnostic messages in convert_for_assignment. */
59 ic_argpass,
60 ic_assign,
61 ic_init,
62 ic_return
63 };
65 /* The level of nesting inside "__alignof__". */
68 /* The level of nesting inside "sizeof". */
71 /* The level of nesting inside "typeof". */
74 /* The argument of last parsed sizeof expression, only to be tested
75 if expr.original_code == SIZEOF_EXPR. */
76 tree c_last_sizeof_arg;
77 location_t c_last_sizeof_loc;
79 /* Nonzero if we might need to print a "missing braces around
80 initializer" message within this initializer. */
97 tree);
122 \f
123 /* Return true if EXP is a null pointer constant, false otherwise. */
125 static bool
127 {
128 /* This should really operate on c_expr structures, but they aren't
129 yet available everywhere required. */
138 }
140 /* EXPR may appear in an unevaluated part of an integer constant
141 expression, but not in an evaluated part. Wrap it in a
142 C_MAYBE_CONST_EXPR, or mark it with TREE_OVERFLOW if it is just an
143 INTEGER_CST and we cannot create a C_MAYBE_CONST_EXPR. */
145 static tree
147 {
148 tree ret;
150 {
153 }
154 else
155 {
158 }
160 }
162 /* Having checked whether EXPR may appear in an unevaluated part of an
163 integer constant expression and found that it may, remove any
164 C_MAYBE_CONST_EXPR noting this fact and return the resulting
165 expression. */
169 {
172 else
174 }
180 const_tree t1;
181 const_tree t2;
182 /* The return value of tagged_types_tu_compatible_p if we had seen
183 these two types already. */
185 };
190 /* Do `exp = require_complete_type (loc, exp);' to make sure exp
191 does not have an incomplete type. (That includes void types.)
192 LOC is the location of the use. */
194 tree
196 {
202 /* First, detect a valid value with a complete type. */
208 }
210 /* Print an error message for invalid use of an incomplete type.
211 VALUE is the expression that was used (or 0 if that isn't known)
212 and TYPE is the type that was invalid. LOC is the location for
213 the error. */
215 void
217 {
218 /* Avoid duplicate error message. */
224 else
225 {
226 retry:
227 /* We must print an error message. Be clever about what it says. */
230 {
242 {
244 {
247 }
250 }
256 }
260 else
261 /* If this type has a typedef-name, the TYPE_NAME is a TYPE_DECL. */
263 }
264 }
266 /* Given a type, apply default promotions wrt unnamed function
267 arguments and return the new type. */
269 tree
271 {
277 {
278 /* Preserve unsignedness if not really getting any wider. */
282 else
284 }
292 }
294 /* Return true if between two named address spaces, whether there is a superset
295 named address space that encompasses both address spaces. If there is a
296 superset, return which address space is the superset. */
298 static bool
300 {
302 {
305 }
307 {
310 }
312 {
315 }
316 else
318 }
320 /* Return a variant of TYPE which has all the type qualifiers of LIKE
321 as well as those of TYPE. */
323 static tree
325 {
328 addr_space_t as_common;
330 /* If the two named address spaces are different, determine the common
331 superset address space. If there isn't one, raise an error. */
333 {
337 }
343 }
345 /* Return true iff the given tree T is a variable length array. */
347 bool
349 {
354 }
355 \f
356 /* Return the composite type of two compatible types.
358 We assume that comptypes has already been done and returned
359 nonzero; if that isn't so, this may crash. In particular, we
360 assume that qualifiers match. */
362 tree
364 {
367 tree attributes;
369 /* Save time if the two types are the same. */
373 /* If one type is nonsense, use the other. */
382 /* Merge the attributes. */
385 /* If one is an enumerated type and the other is the compatible
386 integer type, the composite type might be either of the two
387 (DR#013 question 3). For consistency, use the enumerated type as
388 the composite type. */
398 {
400 /* For two pointers, do this recursively on the target type. */
401 {
408 }
411 {
414 tree unqual_elt;
421 /* We should not have any type quals on arrays at all. */
431 d1_variable = (!d1_zero
434 d2_variable = (!d2_zero
440 /* Save space: see if the result is identical to one of the args. */
453 /* Merge the element types, and have a size if either arg has
454 one. We may have qualifiers on the element types. To set
455 up TYPE_MAIN_VARIANT correctly, we need to form the
456 composite of the unqualified types and add the qualifiers
457 back at the end. */
462 && (d2_variable
463 || d2_zero
465 ? t1
467 /* Ensure a composite type involving a zero-length array type
468 is a zero-length type not an incomplete type. */
472 {
475 }
478 }
484 {
485 /* Try harder not to create a new aggregate type. */
490 }
494 /* Function types: prefer the one that specified arg types.
495 If both do, merge the arg types. Also merge the return types. */
496 {
504 /* Save space: see if the result is identical to one of the args. */
510 /* Simple way if one arg fails to specify argument types. */
512 {
516 }
518 {
522 }
524 /* If both args specify argument types, we must merge the two
525 lists, argument by argument. */
530 ;
539 {
540 /* A null type means arg type is not specified.
541 Take whatever the other function type has. */
543 {
546 }
548 {
551 }
553 /* Given wait (union {union wait *u; int *i} *)
554 and wait (union wait *),
555 prefer union wait * as type of parm. */
558 {
559 tree memb;
566 {
572 {
578 }
579 }
580 }
583 {
584 tree memb;
591 {
597 {
603 }
604 }
605 }
607 parm_done: ;
608 }
612 }
613 /* FALLTHRU */
617 }
619 }
621 /* Return the type of a conditional expression between pointers to
622 possibly differently qualified versions of compatible types.
624 We assume that comp_target_types has already been done and returned
625 nonzero; if that isn't so, this may crash. */
627 static tree
629 {
630 tree attributes;
633 tree target;
638 /* Save time if the two types are the same. */
642 /* If one type is nonsense, use the other. */
651 /* Merge the attributes. */
654 /* Find the composite type of the target types, and combine the
655 qualifiers of the two types' targets. Do not lose qualifiers on
656 array element types by taking the TYPE_MAIN_VARIANT. */
665 /* Strip array types to get correct qualifier for pointers to arrays */
669 /* For function types do not merge const qualifiers, but drop them
670 if used inconsistently. The middle-end uses these to mark const
671 and noreturn functions. */
674 else
677 /* If the two named address spaces are different, determine the common
678 superset address space. This is guaranteed to exist due to the
679 assumption that comp_target_type returned non-zero. */
689 }
691 /* Return the common type for two arithmetic types under the usual
692 arithmetic conversions. The default conversions have already been
693 applied, and enumerated types converted to their compatible integer
694 types. The resulting type is unqualified and has no attributes.
696 This is the type for the result of most arithmetic operations
697 if the operands have the given two types. */
699 static tree
701 {
705 /* If one type is nonsense, use the other. */
723 /* Save time if the two types are the same. */
737 /* When one operand is a decimal float type, the other operand cannot be
738 a generic float type or a complex type. We also disallow vector types
739 here. */
742 {
744 {
747 }
749 {
752 }
754 {
757 }
758 }
760 /* If one type is a vector type, return that type. (How the usual
761 arithmetic conversions apply to the vector types extension is not
762 precisely specified.) */
769 /* If one type is complex, form the common type of the non-complex
770 components, then make that complex. Use T1 or T2 if it is the
771 required type. */
773 {
782 else
784 }
786 /* If only one is real, use it as the result. */
794 /* If both are real and either are decimal floating point types, use
795 the decimal floating point type with the greater precision. */
798 {
808 }
810 /* Deal with fixed-point types. */
812 {
820 /* If one input type is saturating, the result type is saturating. */
824 /* If both fixed-point types are unsigned, the result type is unsigned.
825 When mixing fixed-point and integer types, follow the sign of the
826 fixed-point type.
827 Otherwise, the result type is signed. */
836 /* The result type is signed. */
838 {
839 /* If the input type is unsigned, we need to convert to the
840 signed type. */
842 {
848 else
852 }
854 {
860 else
864 }
865 }
868 {
871 }
872 else
873 {
875 /* Signed integers need to subtract one sign bit. */
877 }
880 {
883 }
884 else
885 {
887 /* Signed integers need to subtract one sign bit. */
889 }
894 satp);
895 }
897 /* Both real or both integers; use the one with greater precision. */
904 /* Same precision. Prefer long longs to longs to ints when the
905 same precision, following the C99 rules on integer type rank
906 (which are equivalent to the C90 rules for C90 types). */
914 {
917 else
919 }
927 {
928 /* But preserve unsignedness from the other type,
929 since long cannot hold all the values of an unsigned int. */
932 else
934 }
936 /* For floating types of the same TYPE_PRECISION (which we here
937 assume means either the same set of values, or sets of values
938 neither a subset of the other, with behavior being undefined in
939 the latter case), follow the rules from TS 18661-3: prefer
940 interchange types _FloatN, then standard types long double,
941 double, float, then extended types _FloatNx. For extended types,
942 check them starting with _Float128x as that seems most consistent
943 in spirit with preferring long double to double; for interchange
944 types, also check in that order for consistency although it's not
945 possible for more than one of them to have the same
946 precision. */
954 /* Likewise, prefer long double to double even if same size. */
958 /* Likewise, prefer double to float even if same size.
959 We got a couple of embedded targets with 32 bit doubles, and the
960 pdp11 might have 64 bit floats. */
971 /* Otherwise prefer the unsigned one. */
975 else
977 }
978 \f
979 /* Wrapper around c_common_type that is used by c-common.c and other
980 front end optimizations that remove promotions. ENUMERAL_TYPEs
981 are allowed here and are converted to their compatible integer types.
982 BOOLEAN_TYPEs are allowed here and return either boolean_type_node or
983 preferably a non-Boolean type as the common type. */
984 tree
986 {
992 /* If both types are BOOLEAN_TYPE, then return boolean_type_node. */
997 /* If either type is BOOLEAN_TYPE, then return the other. */
1004 }
1006 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
1007 or various other operations. Return 2 if they are compatible
1008 but a warning may be needed if you use them together. */
1010 int
1012 {
1020 }
1022 /* Like comptypes, but if it returns non-zero because enum and int are
1023 compatible, it sets *ENUM_AND_INT_P to true. */
1025 static int
1027 {
1035 }
1037 /* Like comptypes, but if it returns nonzero for different types, it
1038 sets *DIFFERENT_TYPES_P to true. */
1040 int
1043 {
1051 }
1052 \f
1053 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
1054 or various other operations. Return 2 if they are compatible
1055 but a warning may be needed if you use them together. If
1056 ENUM_AND_INT_P is not NULL, and one type is an enum and the other a
1057 compatible integer type, then this sets *ENUM_AND_INT_P to true;
1058 *ENUM_AND_INT_P is never set to false. If DIFFERENT_TYPES_P is not
1059 NULL, and the types are compatible but different enough not to be
1060 permitted in C11 typedef redeclarations, then this sets
1061 *DIFFERENT_TYPES_P to true; *DIFFERENT_TYPES_P is never set to
1062 false, but may or may not be set if the types are incompatible.
1063 This differs from comptypes, in that we don't free the seen
1064 types. */
1066 static int
1069 {
1074 /* Suppress errors caused by previously reported errors. */
1080 /* Enumerated types are compatible with integer types, but this is
1081 not transitive: two enumerated types in the same translation unit
1082 are compatible with each other only if they are the same type. */
1085 {
1088 {
1093 }
1094 }
1096 {
1099 {
1104 }
1105 }
1110 /* Different classes of types can't be compatible. */
1115 /* Qualifiers must match. C99 6.7.3p9 */
1120 /* Allow for two different type nodes which have essentially the same
1121 definition. Note that we already checked for equality of the type
1122 qualifiers (just above). */
1128 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1132 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1136 {
1140 /* With these nodes, we can't determine type equivalence by
1141 looking at what is stored in the nodes themselves, because
1142 two nodes might have different TYPE_MAIN_VARIANTs but still
1143 represent the same type. For example, wchar_t and int could
1144 have the same properties (TYPE_PRECISION, TYPE_MIN_VALUE,
1145 TYPE_MAX_VALUE, etc.), but have different TYPE_MAIN_VARIANTs
1146 and are distinct types. On the other hand, int and the
1147 following typedef
1149 typedef int INT __attribute((may_alias));
1151 have identical properties, different TYPE_MAIN_VARIANTs, but
1152 represent the same type. The canonical type system keeps
1153 track of equivalence in this case, so we fall back on it. */
1157 /* Do not remove mode information. */
1167 different_types_p);
1171 {
1178 /* Target types must match incl. qualifiers. */
1181 enum_and_int_p,
1188 /* Sizes must match unless one is missing or variable. */
1195 d1_variable = (!d1_zero
1198 d2_variable = (!d2_zero
1217 }
1223 {
1233 different_types_p);
1235 different_types_p);
1236 }
1247 }
1249 }
1251 /* Return 1 if TTL and TTR are pointers to types that are equivalent, ignoring
1252 their qualifiers, except for named address spaces. If the pointers point to
1253 different named addresses, then we must determine if one address space is a
1254 subset of the other. */
1256 static int
1258 {
1265 addr_space_t as_common;
1268 /* Fail if pointers point to incompatible address spaces. */
1272 /* For pedantic record result of comptypes on arrays before losing
1273 qualifiers on the element type below. */
1280 /* Qualifiers on element types of array types that are
1281 pointer targets are lost by taking their TYPE_MAIN_VARIANT. */
1306 }
1307 \f
1308 /* Subroutines of `comptypes'. */
1310 /* Determine whether two trees derive from the same translation unit.
1311 If the CONTEXT chain ends in a null, that tree's context is still
1312 being parsed, so if two trees have context chains ending in null,
1313 they're in the same translation unit. */
1315 bool
1317 {
1320 {
1328 }
1332 {
1340 }
1343 }
1345 /* Allocate the seen two types, assuming that they are compatible. */
1349 {
1357 /* The C standard says that two structures in different translation
1358 units are compatible with each other only if the types of their
1359 fields are compatible (among other things). We assume that they
1360 are compatible until proven otherwise when building the cache.
1361 An example where this can occur is:
1362 struct a
1363 {
1364 struct a *next;
1365 };
1366 If we are comparing this against a similar struct in another TU,
1367 and did not assume they were compatible, we end up with an infinite
1368 loop. */
1371 }
1373 /* Free the seen types until we get to TU_TIL. */
1375 static void
1377 {
1380 {
1385 }
1387 }
1389 /* Return 1 if two 'struct', 'union', or 'enum' types T1 and T2 are
1390 compatible. If the two types are not the same (which has been
1391 checked earlier), this can only happen when multiple translation
1392 units are being compiled. See C99 6.2.7 paragraph 1 for the exact
1393 rules. ENUM_AND_INT_P and DIFFERENT_TYPES_P are as in
1394 comptypes_internal. */
1396 static int
1399 {
1403 /* We have to verify that the tags of the types are the same. This
1404 is harder than it looks because this may be a typedef, so we have
1405 to go look at the original type. It may even be a typedef of a
1406 typedef...
1407 In the case of compiler-created builtin structs the TYPE_DECL
1408 may be a dummy, with no DECL_ORIGINAL_TYPE. Don't fault. */
1419 /* C90 didn't have the requirement that the two tags be the same. */
1423 /* C90 didn't say what happened if one or both of the types were
1424 incomplete; we choose to follow C99 rules here, which is that they
1425 are compatible. */
1430 {
1435 }
1438 {
1440 {
1442 /* Speed up the case where the type values are in the same order. */
1447 {
1449 }
1452 {
1456 {
1459 }
1460 }
1463 {
1465 }
1467 {
1470 }
1473 {
1476 }
1479 {
1483 {
1486 }
1487 }
1489 }
1492 {
1495 {
1498 }
1500 /* Speed up the common case where the fields are in the same order. */
1503 {
1514 {
1517 }
1524 {
1527 }
1528 }
1530 {
1533 }
1536 {
1541 {
1545 enum_and_int_p,
1546 different_types_p);
1551 {
1554 }
1565 }
1567 {
1570 }
1571 }
1574 }
1577 {
1583 {
1599 }
1602 else
1605 }
1609 }
1610 }
1612 /* Return 1 if two function types F1 and F2 are compatible.
1613 If either type specifies no argument types,
1614 the other must specify a fixed number of self-promoting arg types.
1615 Otherwise, if one type specifies only the number of arguments,
1616 the other must specify that number of self-promoting arg types.
1617 Otherwise, the argument types must match.
1618 ENUM_AND_INT_P and DIFFERENT_TYPES_P are as in comptypes_internal. */
1620 static int
1623 {
1625 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1633 /* 'volatile' qualifiers on a function's return type used to mean
1634 the function is noreturn. */
1654 /* An unspecified parmlist matches any specified parmlist
1655 whose argument types don't need default promotions. */
1658 {
1661 /* If one of these types comes from a non-prototype fn definition,
1662 compare that with the other type's arglist.
1663 If they don't match, ask for a warning (but no error). */
1669 }
1671 {
1679 }
1681 /* Both types have argument lists: compare them and propagate results. */
1683 different_types_p);
1685 }
1687 /* Check two lists of types for compatibility, returning 0 for
1688 incompatible, 1 for compatible, or 2 for compatible with
1689 warning. ENUM_AND_INT_P and DIFFERENT_TYPES_P are as in
1690 comptypes_internal. */
1692 static int
1695 {
1696 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1701 {
1705 /* If one list is shorter than the other,
1706 they fail to match. */
1714 TYPE_QUAL_ATOMIC)
1719 TYPE_QUAL_ATOMIC)
1721 /* A null pointer instead of a type
1722 means there is supposed to be an argument
1723 but nothing is specified about what type it has.
1724 So match anything that self-promotes. */
1729 {
1732 }
1734 {
1737 }
1738 /* If one of the lists has an error marker, ignore this arg. */
1741 ;
1743 different_types_p)))
1744 {
1747 /* Allow wait (union {union wait *u; int *i} *)
1748 and wait (union wait *) to be compatible. */
1755 {
1756 tree memb;
1759 {
1765 TYPE_QUAL_ATOMIC)
1768 different_types_p))
1770 }
1773 }
1780 {
1781 tree memb;
1784 {
1790 TYPE_QUAL_ATOMIC)
1793 different_types_p))
1795 }
1798 }
1799 else
1801 }
1803 /* comptypes said ok, but record if it said to warn. */
1809 }
1810 }
1811 \f
1812 /* Compute the size to increment a pointer by. When a function type or void
1813 type or incomplete type is passed, size_one_node is returned.
1814 This function does not emit any diagnostics; the caller is responsible
1815 for that. */
1817 static tree
1819 {
1826 /* Convert in case a char is more than one unit. */
1830 }
1831 \f
1832 /* Return either DECL or its known constant value (if it has one). */
1834 tree
1836 {
1843 /* This is invalid if initial value is not constant.
1844 If it has either a function call, a memory reference,
1845 or a variable, then re-evaluating it could give different results. */
1847 /* Check for cases where this is sub-optimal, even though valid. */
1851 }
1853 /* Return either DECL or its known constant value (if it has one).
1854 Like the above, but always return decl outside of functions. */
1856 tree
1858 {
1859 /* Don't change a variable array bound or initial value to a constant
1860 in a place where a variable is invalid. */
1862 }
1864 /* Convert the array expression EXP to a pointer. */
1865 static tree
1867 {
1870 tree adr;
1872 tree ptrtype;
1886 /* In C++ array compound literals are temporary objects unless they are
1887 const or appear in namespace scope, so they are destroyed too soon
1888 to use them for much of anything (c++/53220). */
1890 {
1894 "converting an array compound literal to a pointer "
1896 }
1900 }
1902 /* Convert the function expression EXP to a pointer. */
1903 static tree
1905 {
1916 }
1918 /* Mark EXP as read, not just set, for set but not used -Wunused
1919 warning purposes. */
1921 void
1923 {
1925 {
1935 CASE_CONVERT:
1946 }
1947 }
1949 /* Perform the default conversion of arrays and functions to pointers.
1950 Return the result of converting EXP. For any other expression, just
1951 return EXP.
1953 LOC is the location of the expression. */
1955 struct c_expr
1957 {
1963 {
1965 {
1972 {
1976 }
1983 {
1984 /* Before C99, non-lvalue arrays do not decay to pointers.
1985 Normally, using such an array would be invalid; but it can
1986 be used correctly inside sizeof or as a statement expression.
1987 Thus, do not give an error here; an error will result later. */
1989 }
1992 }
1999 }
2002 }
2004 struct c_expr
2006 {
2009 }
2011 /* Return whether EXPR should be treated as an atomic lvalue for the
2012 purposes of load and store handling. */
2014 static bool
2016 {
2024 /* Ignore _Atomic on register variables, since their addresses can't
2025 be taken so (a) atomicity is irrelevant and (b) the normal atomic
2026 sequences wouldn't work. Ignore _Atomic on structures containing
2027 bit-fields, since accessing elements of atomic structures or
2028 unions is undefined behavior (C11 6.5.2.3#5), but it's unclear if
2029 it's undefined at translation time or execution time, and the
2030 normal atomic sequences again wouldn't work. */
2032 {
2037 }
2041 }
2043 /* Convert expression EXP (location LOC) from lvalue to rvalue,
2044 including converting functions and arrays to pointers if CONVERT_P.
2045 If READ_P, also mark the expression as having been read. */
2047 struct c_expr
2050 {
2056 {
2065 /* Expansion of a generic atomic load may require an addition
2066 element, so allocate enough to prevent a resize. */
2069 /* Remove the qualifiers for the rest of the expressions and
2070 create the VAL temp variable to hold the RHS. */
2077 /* Issue __atomic_load (&expr, &tmp, SEQ_CST); */
2084 /* EXPR is always read. */
2087 /* Return tmp which contains the value loaded. */
2090 }
2092 }
2094 /* EXP is an expression of integer type. Apply the integer promotions
2095 to it and return the promoted value. */
2097 tree
2099 {
2105 /* Normally convert enums to int,
2106 but convert wide enums to something wider. */
2108 {
2116 }
2118 /* ??? This should no longer be needed now bit-fields have their
2119 proper types. */
2122 /* If it's thinner than an int, promote it like a
2123 c_promoting_integer_type_p, otherwise leave it alone. */
2129 {
2130 /* Preserve unsignedness if not really getting any wider. */
2136 }
2139 }
2142 /* Perform default promotions for C data used in expressions.
2143 Enumeral types or short or char are converted to int.
2144 In addition, manifest constants symbols are replaced by their values. */
2146 tree
2148 {
2149 tree orig_exp;
2152 tree promoted_type;
2156 /* Functions and arrays have been converted during parsing. */
2161 /* Constants can be used directly unless they're not loadable. */
2165 /* Strip no-op conversions. */
2173 {
2177 }
2191 }
2192 \f
2193 /* Look up COMPONENT in a structure or union TYPE.
2195 If the component name is not found, returns NULL_TREE. Otherwise,
2196 the return value is a TREE_LIST, with each TREE_VALUE a FIELD_DECL
2197 stepping down the chain to the component, which is in the last
2198 TREE_VALUE of the list. Normally the list is of length one, but if
2199 the component is embedded within (nested) anonymous structures or
2200 unions, the list steps down the chain to the component. */
2202 static tree
2204 {
2205 tree field;
2207 /* If TYPE_LANG_SPECIFIC is set, then it is a sorted array of pointers
2208 to the field elements. Use a binary search on this array to quickly
2209 find the element. Otherwise, do a linear search. TYPE_LANG_SPECIFIC
2210 will always be set for structures which have many elements.
2212 Duplicate field checking replaces duplicates with NULL_TREE so
2213 TYPE_LANG_SPECIFIC arrays are potentially no longer sorted. In that
2214 case just iterate using DECL_CHAIN. */
2218 {
2226 {
2231 {
2232 /* Step through all anon unions in linear fashion. */
2234 {
2237 {
2243 /* The Plan 9 compiler permits referring
2244 directly to an anonymous struct/union field
2245 using a typedef name. */
2253 }
2254 }
2256 /* Entire record is only anon unions. */
2260 /* Restart the binary search, with new lower bound. */
2262 }
2268 else
2270 }
2276 }
2277 else
2278 {
2280 {
2283 {
2289 /* The Plan 9 compiler permits referring directly to an
2290 anonymous struct/union field using a typedef
2291 name. */
2298 }
2302 }
2306 }
2309 }
2311 /* Recursively append candidate IDENTIFIER_NODEs to CANDIDATES. */
2313 static void
2316 {
2317 tree field;
2319 {
2323 candidates);
2327 }
2328 }
2330 /* Like "lookup_field", but find the closest matching IDENTIFIER_NODE,
2331 rather than returning a TREE_LIST for an exact match. */
2333 static tree
2335 {
2338 /* First, gather a list of candidates. */
2345 }
2347 /* Support function for build_component_ref's error-handling.
2349 Given DATUM_TYPE, and "DATUM.COMPONENT", where DATUM is *not* a
2350 struct or union, should we suggest "DATUM->COMPONENT" as a hint? */
2352 static bool
2354 {
2355 /* We don't do it for Objective-C, since Objective-C 2.0 dot-syntax
2356 allows "." for ptrs; we could be handling a failed attempt
2357 to access a property. */
2361 /* Only suggest it for pointers... */
2365 /* ...to structs/unions. */
2370 else
2372 }
2374 /* Make an expression to refer to the COMPONENT field of structure or
2375 union value DATUM. COMPONENT is an IDENTIFIER_NODE. LOC is the
2376 location of the COMPONENT_REF. COMPONENT_LOC is the location
2377 of COMPONENT. */
2379 tree
2381 location_t component_loc)
2382 {
2386 tree ref;
2392 /* Detect Objective-C property syntax object.property. */
2397 /* See if there is a field or component with name COMPONENT. */
2400 {
2402 {
2405 }
2410 {
2413 {
2414 /* Attempt to provide a fixit replacement hint, if
2415 we have a valid range for the component. */
2416 location_t reported_loc
2424 }
2425 else
2428 }
2430 /* Accessing elements of atomic structures or unions is undefined
2431 behavior (C11 6.5.2.3#5). */
2433 {
2437 else
2440 }
2442 /* Chain the COMPONENT_REFs if necessary down to the FIELD.
2443 This might be better solved in future the way the C++ front
2444 end does it - by giving the anonymous entities each a
2445 separate name and type, and then have build_component_ref
2446 recursively call itself. We can't do that here. */
2447 do
2448 {
2451 tree subtype;
2457 /* If this is an rvalue, it does not have qualifiers in C
2458 standard terms and we must avoid propagating such
2459 qualifiers down to a non-lvalue array that is then
2460 converted to a pointer. */
2461 use_datum_quals = (datum_lvalue
2470 NULL_TREE);
2485 }
2489 }
2491 {
2492 /* Special-case the error message for "ptr.field" for the case
2493 where the user has confused "." vs "->". */
2495 /* "loc" should be the "." token. */
2499 datum);
2501 }
2505 component);
2508 }
2509 \f
2510 /* Given an expression PTR for a pointer, return an expression
2511 for the value pointed to.
2512 ERRORSTRING is the name of the operator to appear in error messages.
2514 LOC is the location to use for the generated tree. */
2516 tree
2518 {
2521 tree ref;
2524 {
2527 {
2528 /* If a warning is issued, mark it to avoid duplicates from
2529 the backend. This only needs to be done at
2530 warn_strict_aliasing > 2. */
2535 }
2540 {
2544 }
2545 else
2546 {
2552 {
2554 {
2558 }
2560 }
2564 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
2565 so that we get the proper error message if the result is used
2566 to assign to. Also, &* is supposed to be a no-op.
2567 And ANSI C seems to specify that the type of the result
2568 should be the const type. */
2569 /* A de-reference of a pointer to const is not a const. It is valid
2570 to change it via some other pointer. */
2577 }
2578 }
2583 }
2585 /* This handles expressions of the form "a[i]", which denotes
2586 an array reference.
2588 This is logically equivalent in C to *(a+i), but we may do it differently.
2589 If A is a variable or a member, we generate a primitive ARRAY_REF.
2590 This avoids forcing the array out of registers, and can work on
2591 arrays that are not lvalues (for example, members of structures returned
2592 by functions).
2594 For vector types, allow vector[i] but not i[vector], and create
2595 *(((type*)&vectortype) + i) for the expression.
2597 LOC is the location to use for the returned expression. */
2599 tree
2601 {
2602 tree ret;
2610 /* Allow vector[index] but not index[vector]. */
2612 {
2615 {
2620 }
2623 }
2626 {
2629 }
2632 {
2635 }
2637 /* ??? Existing practice has been to warn only when the char
2638 index is syntactically the index, not for char[array]. */
2642 /* Apply default promotions *after* noticing character types. */
2653 {
2656 /* An array that is indexed by a non-constant
2657 cannot be stored in a register; we must be able to do
2658 address arithmetic on its address.
2659 Likewise an array of elements of variable size. */
2663 {
2666 }
2667 /* An array that is indexed by a constant value which is not within
2668 the array bounds cannot be stored in a register either; because we
2669 would get a crash in store_bit_field/extract_bit_field when trying
2670 to access a non-existent part of the register. */
2674 {
2677 }
2681 {
2690 "ISO C90 forbids subscripting non-lvalue "
2692 }
2696 /* Array ref is const/volatile if the array elements are
2697 or if the array is. */
2706 /* This was added by rms on 16 Nov 91.
2707 It fixes vol struct foo *a; a->elts[1]
2708 in an inline function.
2709 Hope it doesn't break something else. */
2716 }
2717 else
2718 {
2729 RO_ARRAY_INDEXING);
2733 }
2734 }
2735 \f
2736 /* Build an external reference to identifier ID. FUN indicates
2737 whether this will be used for a function call. LOC is the source
2738 location of the identifier. This sets *TYPE to the type of the
2739 identifier, which is not the same as the type of the returned value
2740 for CONST_DECLs defined as enum constants. If the type of the
2741 identifier is not available, *TYPE is set to NULL. */
2742 tree
2744 {
2745 tree ref;
2748 /* In Objective-C, an instance variable (ivar) may be preferred to
2749 whatever lookup_name() found. */
2754 {
2757 }
2759 /* Implicit function declaration. */
2762 /* Don't complain about something that's already been
2763 complained about. */
2765 else
2766 {
2769 }
2777 /* Recursive call does not count as usage. */
2779 {
2781 }
2784 {
2791 }
2794 {
2800 {
2805 }
2809 }
2814 {
2819 }
2820 /* C99 6.7.4p3: An inline definition of a function with external
2821 linkage ... shall not contain a reference to an identifier with
2822 internal linkage. */
2831 csi_internal);
2834 }
2836 /* Record details of decls possibly used inside sizeof or typeof. */
2837 struct maybe_used_decl
2838 {
2839 /* The decl. */
2840 tree decl;
2841 /* The level seen at (in_sizeof + in_typeof). */
2843 /* The next one at this level or above, or NULL. */
2845 };
2849 /* Record that DECL, an undefined static function reference seen
2850 inside sizeof or typeof, might be used if the operand of sizeof is
2851 a VLA type or the operand of typeof is a variably modified
2852 type. */
2854 static void
2856 {
2862 }
2864 /* Pop the stack of decls possibly used inside sizeof or typeof. If
2865 USED is false, just discard them. If it is true, mark them used
2866 (if no longer inside sizeof or typeof) or move them to the next
2867 level up (if still inside sizeof or typeof). */
2869 void
2871 {
2875 {
2877 {
2880 else
2882 }
2884 }
2887 }
2889 /* Return the result of sizeof applied to EXPR. */
2891 struct c_expr
2893 {
2896 {
2901 }
2902 else
2903 {
2908 {
2909 auto_diagnostic_group d;
2911 "%<sizeof%> on array function parameter %qE will "
2915 }
2924 {
2925 /* sizeof is evaluated when given a vla (C99 6.5.3.4p2). */
2930 }
2932 }
2934 }
2936 /* Return the result of sizeof applied to T, a structure for the type
2937 name passed to sizeof (rather than the type itself). LOC is the
2938 location of the original expression. */
2940 struct c_expr
2942 {
2943 tree type;
2955 {
2956 /* If the type is a [*] array, it is a VLA but is represented as
2957 having a size of zero. In such a case we must ensure that
2958 the result of sizeof does not get folded to a constant by
2959 c_fully_fold, because if the size is evaluated the result is
2960 not constant and so constraints on zero or negative size
2961 arrays must not be applied when this sizeof call is inside
2962 another array declarator. */
2968 }
2972 }
2974 /* Build a function call to function FUNCTION with parameters PARAMS.
2975 The function call is at LOC.
2976 PARAMS is a list--a chain of TREE_LIST nodes--in which the
2977 TREE_VALUE of each node is a parameter-expression.
2978 FUNCTION's data type may be a function type or a pointer-to-function. */
2980 tree
2982 {
2984 tree ret;
2992 }
2994 /* Give a note about the location of the declaration of DECL. */
2996 static void
2998 {
3001 }
3003 /* Build a function call to function FUNCTION with parameters PARAMS.
3004 ORIGTYPES, if not NULL, is a vector of types; each element is
3005 either NULL or the original type of the corresponding element in
3006 PARAMS. The original type may differ from TREE_TYPE of the
3007 parameter for enums. FUNCTION's data type may be a function type
3008 or pointer-to-function. This function changes the elements of
3009 PARAMS. */
3011 tree
3015 {
3018 tree tem;
3023 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
3026 /* Convert anything with function type to a pointer-to-function. */
3028 {
3034 /* Atomic functions have type checking/casting already done. They are
3035 often rewritten and don't match the original parameter list. */
3038 }
3042 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
3043 expressions, like those used for ObjC messenger dispatches. */
3056 {
3060 function);
3062 {
3065 function);
3067 }
3068 else
3072 }
3077 /* fntype now gets the type of function pointed to. */
3080 /* Convert the parameters to the types declared in the
3081 function prototype, or apply default promotions. */
3088 /* Check that the function is called through a compatible prototype.
3089 If it is not, warn. */
3094 {
3097 /* This situation leads to run-time undefined behavior. We can't,
3098 therefore, simply error unless we can prove that all possible
3099 executions of the program must execute the code. */
3106 }
3110 /* Check that arguments to builtin functions match the expectations. */
3113 argarray))
3116 /* Check that the arguments to the function are valid. */
3122 {
3124 result
3127 else
3133 }
3134 else
3137 /* If -Wnonnull warning has been diagnosed, avoid diagnosing it again
3138 later. */
3142 /* In this improbable scenario, a nested function returns a VM type.
3143 Create a TARGET_EXPR so that the call always has a LHS, much as
3144 what the C++ FE does for functions returning non-PODs. */
3146 {
3150 }
3153 {
3158 }
3160 }
3162 /* Like build_function_call_vec, but call also resolve_overloaded_builtin. */
3164 tree
3168 {
3169 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
3172 /* Convert anything with function type to a pointer-to-function. */
3174 {
3175 /* Implement type-directed function overloading for builtins.
3176 resolve_overloaded_builtin and targetm.resolve_overloaded_builtin
3177 handle all the type checking. The result is a complete expression
3178 that implements this function call. */
3182 }
3184 }
3185 \f
3186 /* Convert the argument expressions in the vector VALUES
3187 to the types in the list TYPELIST.
3189 If TYPELIST is exhausted, or when an element has NULL as its type,
3190 perform the default conversions.
3192 ORIGTYPES is the original types of the expressions in VALUES. This
3193 holds the type of enum values which have been converted to integral
3194 types. It may be NULL.
3196 FUNCTION is a tree for the called function. It is used only for
3197 error messages, where it is formatted with %qE.
3199 This is also where warnings about wrong number of args are generated.
3201 ARG_LOC are locations of function arguments (if any).
3203 Returns the actual number of arguments processed (which may be less
3204 than the length of VALUES in some error situations), or -1 on
3205 failure. */
3207 static int
3211 {
3219 tree selector;
3221 /* Change pointer to function to the function itself for
3222 diagnostics. */
3227 /* Handle an ObjC selector specially for diagnostics. */
3230 /* For type-generic built-in functions, determine whether excess
3231 precision should be removed (classification) or not
3232 (comparison). */
3235 {
3237 {
3250 /* The last argument of these type-generic builtins
3251 should not be promoted. */
3257 }
3258 }
3260 /* Scan the given expressions and types, producing individual
3261 converted arguments. */
3266 {
3274 tree parmval;
3275 /* Some __atomic_* builtins have additional hidden argument at
3276 position 0. */
3277 location_t ploc
3283 {
3286 else
3290 }
3293 {
3296 }
3300 /* If there is excess precision and a prototype, convert once to
3301 the required type rather than converting via the semantic
3302 type. Likewise without a prototype a float value represented
3303 as long double should be converted once to double. But for
3304 type-generic classification functions excess precision must
3305 be removed here. */
3308 {
3311 }
3317 /* Some floating-point arguments must be promoted to double when
3318 no type is specified by a prototype. This applies to
3319 arguments of type float, and to architecture-specific types
3320 (ARM __fp16), but not to _FloatN or _FloatNx types. */
3329 {
3330 /* Promote this argument, unless it has a _FloatN or
3331 _FloatNx type. */
3335 {
3338 }
3339 }
3342 {
3343 /* Formal parm type is specified by a function prototype. */
3346 {
3350 }
3351 else
3352 {
3353 tree origtype;
3355 /* Optionally warn about conversions that
3356 differ from the default conversions. */
3358 {
3364 "passing argument %d of %qE as integer rather "
3370 "passing argument %d of %qE as integer rather "
3376 "passing argument %d of %qE as complex rather "
3382 "passing argument %d of %qE as floating rather "
3388 "passing argument %d of %qE as complex rather "
3394 "passing argument %d of %qE as floating rather "
3397 /* ??? At some point, messages should be written about
3398 conversions between complex types, but that's too messy
3399 to do now. */
3402 {
3403 /* Warn if any argument is passed as `float',
3404 since without a prototype it would be `double'. */
3408 "passing argument %d of %qE as %<float%> "
3412 /* Warn if mismatch between argument and prototype
3413 for decimal float types. Warn of conversions with
3414 binary float types and of precision narrowing due to
3415 prototype. */
3423 && (formal_prec
3426 && (valtype
3427 != dfloat64_type_node
3428 && (valtype
3431 && (valtype
3434 "passing argument %d of %qE as %qT "
3438 }
3439 /* Detect integer changing in width or signedness.
3440 These warnings are only activated with
3441 -Wtraditional-conversion, not with -Wtraditional. */
3445 {
3454 /* No warning if function asks for enum
3455 and the actual arg is that enum type. */
3456 ;
3459 "passing argument %d of %qE "
3463 ;
3464 /* Don't complain if the formal parameter type
3465 is an enum, because we can't tell now whether
3466 the value was an enum--even the same enum. */
3468 ;
3471 /* Change in signedness doesn't matter
3472 if a constant value is unaffected. */
3473 ;
3474 /* If the value is extended from a narrower
3475 unsigned type, it doesn't matter whether we
3476 pass it as signed or unsigned; the value
3477 certainly is the same either way. */
3480 ;
3483 "passing argument %d of %qE "
3486 else
3488 "passing argument %d of %qE "
3491 }
3492 }
3494 /* Possibly restore an EXCESS_PRECISION_EXPR for the
3495 sake of better warnings from convert_and_check. */
3508 }
3509 }
3511 {
3514 else
3515 {
3516 /* Convert `float' to `double'. */
3519 "implicit conversion from %qT to %qT when passing "
3523 }
3524 }
3527 /* A "double" argument with excess precision being passed
3528 without a prototype or in variable arguments.
3529 The last argument of __builtin_*_overflow_p should not be
3530 promoted. */
3534 {
3537 }
3539 {
3541 }
3542 else
3543 /* Convert `short' and `char' to full-size `int'. */
3552 }
3557 {
3561 }
3564 }
3565 \f
3566 /* This is the entry point used by the parser to build unary operators
3567 in the input. CODE, a tree_code, specifies the unary operator, and
3568 ARG is the operand. For unary plus, the C parser currently uses
3569 CONVERT_EXPR for code.
3571 LOC is the location to use for the tree generated.
3572 */
3574 struct c_expr
3576 {
3583 {
3585 }
3586 else
3587 {
3592 }
3594 /* We are typically called when parsing a prefix token at LOC acting on
3595 ARG. Reflect this by updating the source range of the result to
3596 start at LOC and end at the end of ARG. */
3601 }
3603 /* Returns true if TYPE is a character type, *not* including wchar_t. */
3605 static bool
3607 {
3613 }
3615 /* This is the entry point used by the parser to build binary operators
3616 in the input. CODE, a tree_code, specifies the binary operator, and
3617 ARG1 and ARG2 are the operands. In addition to constructing the
3618 expression, we check for operands that were written with other binary
3619 operators in a way that is likely to confuse the user.
3621 LOCATION is the location of the binary operator. */
3623 struct c_expr
3626 {
3644 {
3649 }
3658 /* Check for cases such as x+y<<z which users are likely
3659 to misinterpret. */
3669 {
3673 {
3677 else
3679 }
3681 {
3685 else
3687 }
3690 }
3696 /* Avoid warning for !!x == y. */
3699 {
3700 /* Avoid warning for !b == y where b has _Bool type. */
3705 {
3707 do
3708 {
3715 else
3717 }
3719 }
3722 }
3724 /* Warn about comparisons against string literals, with the exception
3725 of testing for equality or inequality of a string literal with NULL. */
3727 {
3734 /* Warn for ptr == '\0', it's likely that it should've been ptr[0]. */
3738 {
3739 auto_diagnostic_group d;
3741 "comparison between pointer and zero character "
3745 }
3749 {
3750 auto_diagnostic_group d;
3752 "comparison between pointer and zero character "
3756 }
3757 }
3768 /* Warn about comparisons of different enum types. */
3779 }
3780 \f
3781 /* Return a tree for the difference of pointers OP0 and OP1.
3782 The resulting tree has type ptrdiff_t. If POINTER_SUBTRACT sanitization is
3783 enabled, assign to INSTRUMENT_EXPR call to libsanitizer. */
3785 static tree
3787 {
3796 /* If the operands point into different address spaces, we need to
3797 explicitly convert them to pointers into the common address space
3798 before we can subtract the numerical address values. */
3800 {
3801 addr_space_t as_common;
3802 tree common_type;
3804 /* Determine the common superset address space. This is guaranteed
3805 to exist because the caller verified that comp_target_types
3806 returned non-zero. */
3813 }
3815 /* Determine integer type result of the subtraction. This will usually
3816 be the same as the result type (ptrdiff_t), but may need to be a wider
3817 type if pointers for the address space are wider than ptrdiff_t. */
3820 else
3831 {
3839 }
3841 /* First do the subtraction, then build the divide operator
3842 and only convert at the very end.
3843 Do not do default conversions in case restype is a short type. */
3845 /* POINTER_DIFF_EXPR requires a signed integer type of the same size as
3846 pointers. If some platform cannot provide that, or has a larger
3847 ptrdiff_type to support differences larger than half the address
3848 space, cast the pointers to some larger integer type and do the
3849 computations in that type. */
3853 else
3854 {
3855 /* Cast away qualifiers. */
3859 }
3861 /* This generates an error if op1 is pointer to incomplete type. */
3870 /* Divide by the size, in easiest possible way. */
3874 /* Convert to final result type if necessary. */
3876 }
3877 \f
3878 /* Expand atomic compound assignments into an appropriate sequence as
3879 specified by the C11 standard section 6.5.16.2.
3881 _Atomic T1 E1
3882 T2 E2
3883 E1 op= E2
3885 This sequence is used for all types for which these operations are
3886 supported.
3888 In addition, built-in versions of the 'fe' prefixed routines may
3889 need to be invoked for floating point (real, complex or vector) when
3890 floating-point exceptions are supported. See 6.5.16.2 footnote 113.
3892 T1 newval;
3893 T1 old;
3894 T1 *addr
3895 T2 val
3896 fenv_t fenv
3898 addr = &E1;
3899 val = (E2);
3900 __atomic_load (addr, &old, SEQ_CST);
3901 feholdexcept (&fenv);
3902 loop:
3903 newval = old op val;
3904 if (__atomic_compare_exchange_strong (addr, &old, &newval, SEQ_CST,
3905 SEQ_CST))
3906 goto done;
3907 feclearexcept (FE_ALL_EXCEPT);
3908 goto loop:
3909 done:
3910 feupdateenv (&fenv);
3912 The compiler will issue the __atomic_fetch_* built-in when possible,
3913 otherwise it will generate the generic form of the atomic operations.
3914 This requires temp(s) and has their address taken. The atomic processing
3915 is smart enough to figure out when the size of an object can utilize
3916 a lock-free version, and convert the built-in call to the appropriate
3917 lock-free routine. The optimizers will then dispose of any temps that
3918 are no longer required, and lock-free implementations are utilized as
3919 long as there is target support for the required size.
3921 If the operator is NOP_EXPR, then this is a simple assignment, and
3922 an __atomic_store is issued to perform the assignment rather than
3923 the above loop. */
3925 /* Build an atomic assignment at LOC, expanding into the proper
3926 sequence to store LHS MODIFYCODE= RHS. Return a value representing
3927 the result of the operation, unless RETURN_OLD_P, in which case
3928 return the old value of LHS (this is only for postincrement and
3929 postdecrement). */
3931 static tree
3934 {
3939 tree compound_stmt;
3947 tree nonatomic_rhs_semantic_type;
3948 tree rhs_type;
3955 /* Allocate enough vector items for a compare_exchange. */
3958 /* Create a compound statement to hold the sequence of statements
3959 with a loop. */
3962 /* Remove any excess precision (which is only present here in the
3963 case of compound assignments). */
3965 {
3968 }
3971 /* Fold the RHS if it hasn't already been folded. */
3975 /* Remove the qualifiers for the rest of the expressions and create
3976 the VAL temp variable to hold the RHS. */
3980 TYPE_UNQUALIFIED);
3985 NULL_TREE);
3989 /* NOP_EXPR indicates it's a straight store of the RHS. Simply issue
3990 an atomic_store. */
3992 {
3993 /* Build __atomic_store (&lhs, &val, SEQ_CST) */
4002 /* Finish the compound statement. */
4005 /* VAL is the value which was stored, return a COMPOUND_STMT of
4006 the statement and that value. */
4008 }
4010 /* Attempt to implement the atomic operation as an __atomic_fetch_* or
4011 __atomic_*_fetch built-in rather than a CAS loop. atomic_bool type
4012 isn't applicable for such builtins. ??? Do we want to handle enums? */
4015 {
4016 built_in_function fncode;
4018 {
4021 fncode = (return_old_p
4022 ? BUILT_IN_ATOMIC_FETCH_ADD_N
4026 fncode = (return_old_p
4027 ? BUILT_IN_ATOMIC_FETCH_SUB_N
4031 fncode = (return_old_p
4032 ? BUILT_IN_ATOMIC_FETCH_AND_N
4036 fncode = (return_old_p
4037 ? BUILT_IN_ATOMIC_FETCH_OR_N
4041 fncode = (return_old_p
4042 ? BUILT_IN_ATOMIC_FETCH_XOR_N
4047 }
4049 /* We can only use "_1" through "_16" variants of the atomic fetch
4050 built-ins. */
4055 /* If this is a pointer type, we need to multiply by the size of
4056 the pointer target type. */
4058 {
4060 /* ??? This would introduce -Wdiscarded-qualifiers
4061 warning: __atomic_fetch_* expect volatile void *
4062 type as the first argument. (Assignments between
4063 atomic and non-atomic objects are OK.) */
4070 }
4072 /* Build __atomic_fetch_* (&lhs, &val, SEQ_CST), or
4073 __atomic_*_fetch (&lhs, &val, SEQ_CST). */
4088 /* Finish the compound statement. */
4091 /* NEWVAL is the value which was stored, return a COMPOUND_STMT of
4092 the statement and that value. */
4094 }
4096 cas_loop:
4097 /* Create the variables and labels required for the op= form. */
4114 /* __atomic_load (addr, &old, SEQ_CST). */
4121 NULL_TREE);
4125 /* Create the expressions for floating-point environment
4126 manipulation, if required. */
4136 /* loop: */
4139 /* newval = old + val; */
4144 {
4148 }
4149 else
4155 {
4157 NULL_TREE);
4160 }
4162 /* if (__atomic_compare_exchange (addr, &old, &new, false, SEQ_CST, SEQ_CST))
4163 goto done; */
4183 /* goto loop; */
4188 /* done: */
4194 /* Finish the compound statement. */
4197 /* NEWVAL is the value that was successfully stored, return a
4198 COMPOUND_EXPR of the statement and the appropriate value. */
4201 }
4203 /* Construct and perhaps optimize a tree representation
4204 for a unary operation. CODE, a tree_code, specifies the operation
4205 and XARG is the operand.
4206 For any CODE other than ADDR_EXPR, NOCONVERT suppresses the default
4207 promotions (such as from short to int).
4208 For ADDR_EXPR, the default promotions are not applied; NOCONVERT allows
4209 non-lvalues; this is only used to handle conversion of non-lvalue arrays
4210 to pointers in C99.
4212 LOCATION is the location of the operator. */
4214 tree
4217 {
4218 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
4222 tree val;
4243 {
4246 }
4249 {
4252 }
4255 {
4257 /* This is used for unary plus, because a CONVERT_EXPR
4258 is enough to prevent anybody from looking inside for
4259 associativity, but won't generate any code. */
4263 {
4266 }
4276 {
4279 }
4285 /* ~ works on integer types and non float vectors. */
4289 {
4292 /* Warn if the expression has boolean value. */
4298 {
4299 auto_diagnostic_group d;
4302 {
4306 }
4307 }
4310 }
4312 {
4318 }
4319 else
4320 {
4323 }
4328 {
4331 }
4338 {
4341 }
4347 /* Conjugating a real value is a no-op, but allow it anyway. */
4350 {
4353 }
4362 {
4366 }
4368 {
4371 }
4372 else
4375 /* If the TRUTH_NOT_EXPR has been folded, reset the location. */
4395 {
4398 noconvert);
4406 }
4408 /* Complain about anything that is not a true lvalue. In
4409 Objective-C, skip this check for property_refs. */
4414 ? lv_increment
4419 {
4423 else
4426 }
4429 {
4433 else
4436 }
4438 /* Ensure the argument is fully folded inside any SAVE_EXPR. */
4444 /* Increment or decrement the real part of the value,
4445 and don't change the imaginary part. */
4447 {
4454 {
4466 }
4467 }
4469 /* Report invalid types. */
4474 {
4477 else
4481 }
4483 {
4484 tree inc;
4488 /* Compute the increment. */
4491 {
4492 /* If pointer target is an incomplete type,
4493 we just cannot know how to do the arithmetic. */
4495 {
4500 else
4504 }
4507 {
4511 else
4514 }
4518 }
4520 {
4521 /* For signed fract types, we invert ++ to -- or
4522 -- to ++, and change inc from 1 to -1, because
4523 it is not possible to represent 1 in signed fract constants.
4524 For unsigned fract types, the result always overflows and
4525 we get an undefined (original) or the maximum value. */
4537 }
4538 else
4539 {
4544 }
4546 /* If 'arg' is an Objective-C PROPERTY_REF expression, then we
4547 need to ask Objective-C to build the increment or decrement
4548 expression for it. */
4553 /* Report a read-only lvalue. */
4555 {
4561 }
4568 /* If the argument is atomic, use the special code sequences for
4569 atomic compound assignment. */
4571 {
4576 ? PLUS_EXPR
4579 ? inc
4584 }
4588 else
4595 }
4598 /* Note that this operation never does default_conversion. */
4600 /* The operand of unary '&' must be an lvalue (which excludes
4601 expressions of type void), or, in C99, the result of a [] or
4602 unary '*' operator. */
4608 /* Let &* cancel out to simplify resulting code. */
4610 {
4611 /* Don't let this be an lvalue. */
4616 }
4618 /* Anything not already handled and not a true memory reference
4619 or a non-lvalue array is an error. */
4624 /* Move address operations inside C_MAYBE_CONST_EXPR to simplify
4625 folding later. */
4627 {
4630 noconvert);
4637 }
4639 /* Ordinary case; arg is a COMPONENT_REF or a decl. */
4642 /* If the lvalue is const or volatile, merge that into the type
4643 to which the address will point. This is only needed
4644 for function types. */
4648 {
4658 }
4661 {
4664 {
4668 }
4670 /* fall through */
4674 {
4677 {
4681 }
4686 "address of array with reverse scalar storage "
4688 }
4692 }
4702 /* ??? Cope with user tricks that amount to offsetof. Delete this
4703 when we have proper support for integer constant expressions. */
4707 {
4710 }
4719 }
4724 ret = (require_constant_value
4727 else
4729 return_build_unary_op:
4740 }
4742 /* Return nonzero if REF is an lvalue valid for this language.
4743 Lvalues can be assigned, unless their type has TYPE_READONLY.
4744 Lvalues can have their address taken, unless they have C_DECL_REGISTER. */
4746 bool
4748 {
4752 {
4779 }
4780 }
4781 \f
4782 /* Give a warning for storing in something that is read-only in GCC
4783 terms but not const in ISO C terms. */
4785 static void
4787 {
4789 {
4801 }
4803 }
4806 /* Return nonzero if REF is an lvalue valid for this language;
4807 otherwise, print an error message and return zero. USE says
4808 how the lvalue is being used and so selects the error message.
4809 LOCATION is the location at which any error should be reported. */
4811 static int
4813 {
4820 }
4821 \f
4822 /* Mark EXP saying that we need to be able to take the
4823 address of it; it should not be allocated in a register.
4824 Returns true if successful. ARRAY_REF_P is true if this
4825 is for ARRAY_REF construction - in that case we don't want
4826 to look through VIEW_CONVERT_EXPR from VECTOR_TYPE to ARRAY_TYPE,
4827 it is fine to use ARRAY_REFs for vector subscripts on vector
4828 register variables. */
4830 bool
4832 {
4837 {
4843 /* FALLTHRU */
4867 {
4869 {
4870 error
4873 }
4875 }
4877 {
4880 else
4883 }
4885 /* FALLTHRU */
4888 /* FALLTHRU */
4891 }
4892 }
4893 \f
4894 /* Convert EXPR to TYPE, warning about conversion problems with
4895 constants. SEMANTIC_TYPE is the type this conversion would use
4896 without excess precision. If SEMANTIC_TYPE is NULL, this function
4897 is equivalent to convert_and_check. This function is a wrapper that
4898 handles conversions that may be different than
4899 the usual ones because of excess precision. */
4901 static tree
4903 tree semantic_type)
4904 {
4908 /* For C11, integer conversions may have results with excess
4909 precision. */
4915 {
4916 /* For integers, we need to check the real conversion, not
4917 the conversion to the excess precision type. */
4919 }
4920 /* Result type is the excess precision type, which should be
4921 large enough, so do not check. */
4923 }
4925 /* Build and return a conditional expression IFEXP ? OP1 : OP2. If
4926 IFEXP_BCP then the condition is a call to __builtin_constant_p, and
4927 if folded to an integer constant then the unselected half may
4928 contain arbitrary operations not normally permitted in constant
4929 expressions. Set the location of the expression to LOC. */
4931 tree
4935 {
4936 tree type1;
4937 tree type2;
4945 tree ret;
4957 /* Promote both alternatives. */
4980 /* C90 does not permit non-lvalue arrays in conditional expressions.
4981 In C99 they will be pointers by now. */
4983 {
4986 }
4994 {
4997 {
5001 }
5003 {
5007 }
5008 }
5011 {
5022 }
5024 /* Quickly detect the usual case where op1 and op2 have the same type
5025 after promotion. */
5027 {
5030 else
5032 }
5037 {
5038 /* In C11, a conditional expression between a floating-point
5039 type and an integer type should convert the integer type to
5040 the evaluation format of the floating-point type, with
5041 possible excess precision. */
5045 {
5046 tree eptype;
5049 {
5053 }
5056 {
5060 }
5061 }
5066 "implicit conversion from %qT to %qT to "
5068 colon_loc);
5070 /* If -Wsign-compare, warn here if type1 and type2 have
5071 different signedness. We'll promote the signed to unsigned
5072 and later code won't know it used to be different.
5073 Do this check on the original types, so that explicit casts
5074 will be considered, but default promotions won't. */
5076 {
5081 {
5084 /* Do not warn if the result type is signed, since the
5085 signed type will only be chosen if it can represent
5086 all the values of the unsigned type. */
5089 else
5090 {
5094 /* Do not warn if the signed quantity is an
5095 unsuffixed integer literal (or some static
5096 constant expression involving such literals) and
5097 it is non-negative. This warning requires the
5098 operands to be folded for best results, so do
5099 that folding in this case even without
5100 warn_sign_compare to avoid warning options
5101 possibly affecting code generation. */
5102 c_inhibit_evaluation_warnings
5106 c_inhibit_evaluation_warnings
5109 c_inhibit_evaluation_warnings
5113 c_inhibit_evaluation_warnings
5117 {
5120 || (unsigned_op1
5125 "operand of ?: changes signedness from "
5126 "%qT to %qT due to unsignedness of other "
5129 else
5131 "operand of ?: changes signedness from "
5132 "%qT to %qT due to unsignedness of other "
5135 }
5140 }
5141 }
5142 }
5143 }
5145 {
5150 }
5152 {
5155 addr_space_t as_common;
5164 {
5168 }
5171 {
5176 "pointer to array loses qualifier "
5181 "ISO C forbids conditional expr between "
5185 }
5188 {
5193 "pointer to array loses qualifier "
5198 "ISO C forbids conditional expr between "
5202 }
5203 /* Objective-C pointer comparisons are a bit more lenient. */
5206 else
5207 {
5212 result_type = build_pointer_type
5214 }
5215 }
5217 {
5221 else
5222 {
5224 }
5226 }
5228 {
5232 else
5233 {
5235 }
5237 }
5240 {
5243 else
5244 {
5247 }
5248 }
5250 /* Merge const and volatile flags of the incoming types. */
5251 result_type
5257 semantic_result_type);
5259 semantic_result_type);
5262 {
5265 }
5267 {
5270 }
5272 && op1_int_operands
5275 {
5282 }
5284 /* Need to convert condition operand into a vector mask. */
5286 {
5293 }
5297 else
5298 {
5300 {
5301 /* Use c_fully_fold here, since C_MAYBE_CONST_EXPR might be
5302 nested inside of the expression. */
5305 }
5309 }
5315 /* If the OP1 and OP2 are the same and don't have side-effects,
5316 warn here, because the COND_EXPR will be turned into OP1. */
5324 }
5325 \f
5326 /* Return a compound expression that performs two expressions and
5327 returns the value of the second of them.
5329 LOC is the location of the COMPOUND_EXPR. */
5331 tree
5333 {
5336 tree ret;
5348 {
5351 }
5354 {
5355 /* The left-hand operand of a comma expression is like an expression
5356 statement: with -Wunused, we should warn if it doesn't have
5357 any side-effects, unless it was explicitly cast to (void). */
5359 {
5367 else
5370 }
5371 }
5374 {
5378 {
5382 }
5388 }
5390 /* With -Wunused, we should also warn if the left-hand operand does have
5391 side-effects, but computes a value which is not used. For example, in
5392 `foo() + bar(), baz()' the result of the `+' operator is not used,
5393 so we should issue a warning. */
5403 && expr1_int_operands
5412 }
5414 /* Issue -Wcast-qual warnings when appropriate. TYPE is the type to
5415 which we are casting. OTYPE is the type of the expression being
5416 cast. Both TYPE and OTYPE are pointer types. LOC is the location
5417 of the cast. -Wcast-qual appeared on the command line. Named
5418 address space qualifiers are not handled here, because they result
5419 in different warnings. */
5421 static void
5423 {
5430 /* Check that the qualifiers on IN_TYPE are a superset of the
5431 qualifiers of IN_OTYPE. The outermost level of POINTER_TYPE
5432 nodes is uninteresting and we stop as soon as we hit a
5433 non-POINTER_TYPE node on either type. */
5434 do
5435 {
5439 /* GNU C allows cv-qualified function types. 'const' means the
5440 function is very pure, 'volatile' means it can't return. We
5441 need to warn when such qualifiers are added, not when they're
5442 taken away. */
5447 else
5450 }
5459 /* There are qualifiers present in IN_OTYPE that are not present
5460 in IN_TYPE. */
5463 discarded);
5468 /* A cast from **T to const **T is unsafe, because it can cause a
5469 const value to be changed with no additional warning. We only
5470 issue this warning if T is the same on both sides, and we only
5471 issue the warning if there are the same number of pointers on
5472 both sides, as otherwise the cast is clearly unsafe anyhow. A
5473 cast is unsafe when a qualifier is added at one level and const
5474 is not present at all outer levels.
5476 To issue this warning, we check at each level whether the cast
5477 adds new qualifiers not already seen. We don't need to special
5478 case function types, as they won't have the same
5479 TYPE_MAIN_VARIANT. */
5489 do
5490 {
5495 {
5497 "to be safe all intermediate pointers in cast from "
5501 }
5504 }
5506 }
5508 /* Heuristic check if two parameter types can be considered ABI-equivalent. */
5510 static bool
5512 {
5520 /* The signedness of the parameter matters only when an integral
5521 type smaller than int is promoted to int, otherwise only the
5522 precision of the parameter matters.
5523 This check should make sure that the callee does not see
5524 undefined values in argument registers. */
5534 }
5536 /* Check if a type cast between two function types can be considered safe. */
5538 static bool
5540 {
5559 }
5561 /* Build an expression representing a cast to type TYPE of expression EXPR.
5562 LOC is the location of the cast-- typically the open paren of the cast. */
5564 tree
5566 {
5567 tree value;
5577 /* The ObjC front-end uses TYPE_MAIN_VARIANT to tie together types differing
5578 only in <protocol> qualifications. But when constructing cast expressions,
5579 the protocols do matter and must be kept around. */
5586 {
5589 }
5592 {
5595 }
5598 {
5602 }
5605 {
5610 /* Convert to remove any qualifiers from VALUE's type. */
5612 }
5614 {
5615 tree field;
5624 {
5625 tree t;
5637 }
5640 }
5641 else
5642 {
5646 {
5650 }
5654 /* Optionally warn about potentially worrisome casts. */
5660 /* Warn about conversions between pointers to disjoint
5661 address spaces. */
5665 {
5668 addr_space_t as_common;
5671 {
5682 else
5687 }
5688 }
5690 /* Warn about possible alignment problems. */
5696 /* Don't warn about opaque types, where the actual alignment
5697 restriction is unknown. */
5708 /* Unlike conversion of integers to pointers, where the
5709 warning is disabled for converting constants because
5710 of cases such as SIG_*, warn about converting constant
5711 pointers to integers. In some cases it may cause unwanted
5712 sign extension, and a warning is appropriate. */
5719 "cast from function call of type %qT "
5725 /* Don't warn about converting any constant. */
5734 /* If pedantic, warn for conversions between function and object
5735 pointer types, except for converting a null pointer constant
5736 to function pointer type. */
5761 "cast between incompatible function types"
5767 /* Ignore any integer overflow caused by the cast. */
5769 {
5771 {
5773 {
5774 /* Avoid clobbering a shared constant. */
5777 }
5778 }
5780 /* Reset VALUE's overflow flags, ensuring constant sharing. */
5782 }
5783 }
5785 /* Don't let a cast be an lvalue. */
5789 /* Don't allow the results of casting to floating-point or complex
5790 types be confused with actual constants, or casts involving
5791 integer and pointer types other than direct integer-to-integer
5792 and integer-to-pointer be confused with integer constant
5793 expressions and null pointer constants. */
5805 }
5807 /* Interpret a cast of expression EXPR to type TYPE. LOC is the
5808 location of the open paren of the cast, or the position of the cast
5809 expr. */
5810 tree
5812 {
5813 tree type;
5816 tree ret;
5819 /* This avoids warnings about unprototyped casts on
5820 integers. E.g. "#define SIG_DFL (void(*)())0". */
5832 {
5839 }
5844 /* C++ does not permits types to be defined in a cast, but it
5845 allows references to incomplete types. */
5851 }
5852 \f
5853 /* Build an assignment expression of lvalue LHS from value RHS.
5854 If LHS_ORIGTYPE is not NULL, it is the original type of LHS, which
5855 may differ from TREE_TYPE (LHS) for an enum bitfield.
5856 MODIFYCODE is the code for a binary operator that we use
5857 to combine the old value of LHS with RHS to get the new value.
5858 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
5859 If RHS_ORIGTYPE is not NULL_TREE, it is the original type of RHS,
5860 which may differ from TREE_TYPE (RHS) for an enum value.
5862 LOCATION is the location of the MODIFYCODE operator.
5863 RHS_LOC is the location of the RHS. */
5865 tree
5869 {
5870 tree result;
5871 tree newrhs;
5878 /* Types that aren't fully specified cannot be used in assignments. */
5881 /* Avoid duplicate error messages from operands that had errors. */
5885 /* Ensure an error for assigning a non-lvalue array to an array in
5886 C90. */
5888 {
5891 }
5893 /* For ObjC properties, defer this check. */
5902 {
5905 rhs_origtype);
5914 }
5916 /* If a binary op has been requested, combine the old LHS value with the RHS
5917 producing the value we should actually store into the LHS. */
5920 {
5924 /* Construct the RHS for any non-atomic compound assignemnt. */
5926 {
5927 /* If in LHS op= RHS the RHS has side-effects, ensure they
5928 are preevaluated before the rest of the assignment expression's
5929 side-effects, because RHS could contain e.g. function calls
5930 that modify LHS. */
5932 {
5935 else
5940 newrhs);
5941 }
5945 /* The original type of the right hand side is no longer
5946 meaningful. */
5948 }
5949 }
5952 {
5953 /* Check if we are modifying an Objective-C property reference;
5954 if so, we need to generate setter calls. */
5957 else
5962 /* Else, do the check that we postponed for Objective-C. */
5965 }
5967 /* Give an error for storing in something that is 'const'. */
5972 {
5975 }
5979 /* If storing into a structure or union member,
5980 it has probably been given type `int'.
5981 Compute the type that would go with
5982 the actual amount of storage the member occupies. */
5991 /* If storing in a field that is in actuality a short or narrower than one,
5992 we must store in the field in its actual type. */
5995 {
5998 }
6000 /* Issue -Wc++-compat warnings about an assignment to an enum type
6001 when LHS does not have its original type. This happens for,
6002 e.g., an enum bitfield in a struct. */
6007 {
6009 ? rhs_origtype
6016 }
6018 /* If the lhs is atomic, remove that qualifier. */
6020 {
6027 }
6029 /* Convert new value to destination type. Fold it first, then
6030 restore any excess precision information, for the sake of
6031 conversion warnings. */
6034 {
6037 {
6040 }
6050 }
6052 /* Emit ObjC write barrier, if necessary. */
6054 {
6057 {
6060 }
6061 }
6063 /* Scan operands. */
6067 else
6068 {
6072 }
6074 /* If we got the LHS in a different type for storing in,
6075 convert the result back to the nominal type of LHS
6076 so that the value we return always has the same type
6077 as the LHS argument. */
6087 return_result:
6091 }
6092 \f
6093 /* Return whether STRUCT_TYPE has an anonymous field with type TYPE.
6094 This is used to implement -fplan9-extensions. */
6096 static bool
6098 {
6099 tree field;
6107 {
6110 TYPE_QUAL_ATOMIC)
6114 {
6118 }
6122 {
6126 }
6127 }
6129 }
6131 /* RHS is an expression whose type is pointer to struct. If there is
6132 an anonymous field in RHS with type TYPE, then return a pointer to
6133 that field in RHS. This is used with -fplan9-extensions. This
6134 returns NULL if no conversion could be found. */
6136 static tree
6138 {
6142 tree ret;
6151 TYPE_QUAL_ATOMIC)
6159 {
6165 TYPE_QUAL_ATOMIC)
6168 {
6172 }
6174 lhs_main_type))
6175 {
6180 }
6181 }
6188 NULL_TREE);
6192 {
6195 }
6198 }
6200 /* Issue an error message for a bad initializer component.
6201 GMSGID identifies the message.
6202 The component name is taken from the spelling stack. */
6204 static void
6206 {
6209 auto_diagnostic_group d;
6211 /* The gmsgid may be a format string with %< and %>. */
6216 }
6218 /* Issue a pedantic warning for a bad initializer component. OPT is
6219 the option OPT_* (from options.h) controlling this warning or 0 if
6220 it is unconditionally given. GMSGID identifies the message. The
6221 component name is taken from the spelling stack. */
6225 {
6226 /* Use the location where a macro was expanded rather than where
6227 it was defined to make sure macros defined in system headers
6228 but used incorrectly elsewhere are diagnosed. */
6230 auto_diagnostic_group d;
6238 }
6240 /* Issue a warning for a bad initializer component.
6242 OPT is the OPT_W* value corresponding to the warning option that
6243 controls this warning. GMSGID identifies the message. The
6244 component name is taken from the spelling stack. */
6246 static void
6248 {
6252 auto_diagnostic_group d;
6254 /* Use the location where a macro was expanded rather than where
6255 it was defined to make sure macros defined in system headers
6256 but used incorrectly elsewhere are diagnosed. */
6259 /* The gmsgid may be a format string with %< and %>. */
6264 }
6265 \f
6266 /* If TYPE is an array type and EXPR is a parenthesized string
6267 constant, warn if pedantic that EXPR is being used to initialize an
6268 object of type TYPE. */
6270 void
6272 {
6279 }
6281 /* Attempt to locate the parameter with the given index within FNDECL,
6282 returning DECL_SOURCE_LOCATION (FNDECL) if it can't be found. */
6284 static location_t
6286 {
6288 tree param;
6290 /* Locate param by index within DECL_ARGUMENTS (fndecl). */
6294 ;
6296 /* If something went wrong (e.g. if we have a builtin and thus no arguments),
6297 return DECL_SOURCE_LOCATION (FNDECL). */
6302 }
6304 /* Issue a note about a mismatching argument for parameter PARMNUM
6305 to FUNDECL, for types EXPECTED_TYPE and ACTUAL_TYPE.
6306 Attempt to issue the note at the pertinent parameter of the decl;
6307 failing that issue it at the location of FUNDECL; failing that
6308 issue it at PLOC. */
6310 static void
6313 {
6314 location_t loc;
6317 else
6323 }
6325 /* Convert value RHS to type TYPE as preparation for an assignment to
6326 an lvalue of type TYPE. If ORIGTYPE is not NULL_TREE, it is the
6327 original type of RHS; this differs from TREE_TYPE (RHS) for enum
6328 types. NULL_POINTER_CONSTANT says whether RHS was a null pointer
6329 constant before any folding.
6330 The real work of conversion is done by `convert'.
6331 The purpose of this function is to generate error messages
6332 for assignments that are not allowed in C.
6333 ERRTYPE says whether it is argument passing, assignment,
6334 initialization or return.
6336 In the following example, '~' denotes where EXPR_LOC and '^' where
6337 LOCATION point to:
6339 f (var); [ic_argpass]
6340 ^ ~~~
6341 x = var; [ic_assign]
6342 ^ ~~~;
6343 int x = var; [ic_init]
6344 ^^^
6345 return x; [ic_return]
6346 ^
6348 FUNCTION is a tree for the function being called.
6349 PARMNUM is the number of the argument, for printing in error messages. */
6351 static tree
6356 {
6359 tree rhstype;
6364 /* Use the expansion point location to handle cases such as user's
6365 function returning a wrong-type macro defined in a system header. */
6369 {
6370 tree selector;
6371 /* Change pointer to function to the function itself for
6372 diagnostics. */
6377 /* Handle an ObjC selector specially for diagnostics. */
6381 {
6384 }
6385 }
6387 /* This macro is used to emit diagnostics to ensure that all format
6388 strings are complete sentences, visible to gettext and checked at
6389 compile time. */
6390 #define PEDWARN_FOR_ASSIGNMENT(LOCATION, PLOC, OPT, AR, AS, IN, RE) \
6391 do { \
6392 switch (errtype) \
6393 { \
6394 case ic_argpass: \
6395 { \
6396 auto_diagnostic_group d; \
6397 if (pedwarn (PLOC, OPT, AR, parmnum, rname)) \
6398 inform_for_arg (fundecl, (PLOC), parmnum, type, rhstype); \
6399 } \
6400 break; \
6401 case ic_assign: \
6402 pedwarn (LOCATION, OPT, AS); \
6403 break; \
6404 case ic_init: \
6405 pedwarn_init (LOCATION, OPT, IN); \
6406 break; \
6407 case ic_return: \
6408 pedwarn (LOCATION, OPT, RE); \
6409 break; \
6410 default: \
6411 gcc_unreachable (); \
6412 } \
6413 } while (0)
6415 /* This macro is used to emit diagnostics to ensure that all format
6416 strings are complete sentences, visible to gettext and checked at
6417 compile time. It is the same as PEDWARN_FOR_ASSIGNMENT but with an
6418 extra parameter to enumerate qualifiers. */
6419 #define PEDWARN_FOR_QUALIFIERS(LOCATION, PLOC, OPT, AR, AS, IN, RE, QUALS) \
6420 do { \
6421 switch (errtype) \
6422 { \
6423 case ic_argpass: \
6424 { \
6425 auto_diagnostic_group d; \
6426 if (pedwarn (PLOC, OPT, AR, parmnum, rname, QUALS)) \
6427 inform_for_arg (fundecl, (PLOC), parmnum, type, rhstype); \
6428 } \
6429 break; \
6430 case ic_assign: \
6431 pedwarn (LOCATION, OPT, AS, QUALS); \
6432 break; \
6433 case ic_init: \
6434 pedwarn (LOCATION, OPT, IN, QUALS); \
6435 break; \
6436 case ic_return: \
6437 pedwarn (LOCATION, OPT, RE, QUALS); \
6438 break; \
6439 default: \
6440 gcc_unreachable (); \
6441 } \
6442 } while (0)
6444 /* This macro is used to emit diagnostics to ensure that all format
6445 strings are complete sentences, visible to gettext and checked at
6446 compile time. It is the same as PEDWARN_FOR_QUALIFIERS but uses
6447 warning_at instead of pedwarn. */
6448 #define WARNING_FOR_QUALIFIERS(LOCATION, PLOC, OPT, AR, AS, IN, RE, QUALS) \
6449 do { \
6450 switch (errtype) \
6451 { \
6452 case ic_argpass: \
6453 { \
6454 auto_diagnostic_group d; \
6455 if (warning_at (PLOC, OPT, AR, parmnum, rname, QUALS)) \
6456 inform_for_arg (fundecl, (PLOC), parmnum, type, rhstype); \
6457 } \
6458 break; \
6459 case ic_assign: \
6460 warning_at (LOCATION, OPT, AS, QUALS); \
6461 break; \
6462 case ic_init: \
6463 warning_at (LOCATION, OPT, IN, QUALS); \
6464 break; \
6465 case ic_return: \
6466 warning_at (LOCATION, OPT, RE, QUALS); \
6467 break; \
6468 default: \
6469 gcc_unreachable (); \
6470 } \
6471 } while (0)
6483 {
6487 {
6503 }
6506 }
6509 {
6515 {
6540 }
6541 }
6547 {
6548 /* Except for passing an argument to an unprototyped function,
6549 this is a constraint violation. When passing an argument to
6550 an unprototyped function, it is compile-time undefined;
6551 making it a constraint in that case was rejected in
6552 DR#252. */
6555 }
6563 /* A non-reference type can convert to a reference. This handles
6564 va_start, va_copy and possibly port built-ins. */
6566 {
6568 {
6571 }
6581 parmnum);
6588 }
6589 /* Some types can interconvert without explicit casts. */
6593 /* Arithmetic types all interconvert, and enum is treated like int. */
6602 {
6603 tree ret;
6614 }
6616 /* Aggregates in different TUs might need conversion. */
6623 /* Conversion to a transparent union or record from its member types.
6624 This applies only to function arguments. */
6628 {
6632 {
6643 {
6647 /* Any non-function converts to a [const][volatile] void *
6648 and vice versa; otherwise, targets must be the same.
6649 Meanwhile, the lhs target must have all the qualifiers of
6650 the rhs. */
6654 {
6657 /* If this type won't generate any warnings, use it. */
6665 /* Keep looking for a better type, but remember this one. */
6668 }
6669 }
6671 /* Can convert integer zero to any pointer type. */
6673 {
6676 }
6677 }
6680 {
6682 {
6683 /* We have only a marginally acceptable member type;
6684 it needs a warning. */
6688 /* Const and volatile mean something different for function
6689 types, so the usual warnings are not appropriate. */
6692 {
6693 /* Because const and volatile on functions are
6694 restrictions that say the function will not do
6695 certain things, it is okay to use a const or volatile
6696 function where an ordinary one is wanted, but not
6697 vice-versa. */
6701 OPT_Wdiscarded_qualifiers,
6703 "makes %q#v qualified function "
6706 "function pointer from "
6709 "function pointer from "
6714 }
6718 OPT_Wdiscarded_qualifiers,
6730 }
6738 }
6739 }
6741 /* Conversions among pointers */
6744 {
6751 addr_space_t asl;
6752 addr_space_t asr;
6757 TYPE_QUAL_ATOMIC)
6762 TYPE_QUAL_ATOMIC)
6764 /* Opaque pointers are treated like void pointers. */
6767 /* The Plan 9 compiler permits a pointer to a struct to be
6768 automatically converted into a pointer to an anonymous field
6769 within the struct. */
6774 {
6777 {
6783 }
6784 }
6786 /* C++ does not allow the implicit conversion void* -> T*. However,
6787 for the purpose of reducing the number of false positives, we
6788 tolerate the special case of
6790 int *p = NULL;
6792 where NULL is typically defined in C to be '(void *) 0'. */
6795 OPT_Wc___compat,
6796 "request for implicit conversion "
6799 /* See if the pointers point to incompatible address spaces. */
6804 {
6806 {
6825 }
6827 }
6829 /* Check if the right-hand side has a format attribute but the
6830 left-hand side doesn't. */
6833 {
6835 {
6838 "argument %d of %qE might be "
6844 "assignment left-hand side might be "
6849 "initialization left-hand side might be "
6854 "return type might be "
6859 }
6860 }
6862 /* Any non-function converts to a [const][volatile] void *
6863 and vice versa; otherwise, targets must be the same.
6864 Meanwhile, the lhs target must have all the qualifiers of the rhs. */
6868 || is_opaque_pointer
6874 {
6875 /* Warn about loss of qualifers from pointers to arrays with
6876 qualifiers on the element type. */
6878 {
6885 OPT_Wdiscarded_array_qualifiers,
6895 }
6898 ||
6900 && !null_pointer_constant
6904 "%qE between function pointer "
6912 /* Const and volatile mean something different for function types,
6913 so the usual warnings are not appropriate. */
6916 {
6917 /* Don't warn about loss of qualifier for conversions from
6918 qualified void* to pointers to arrays with corresponding
6919 qualifier on the element type. */
6923 /* Assignments between atomic and non-atomic objects are OK. */
6926 {
6928 OPT_Wdiscarded_qualifiers,
6938 }
6939 /* If this is not a case of ignoring a mismatch in signedness,
6940 no warning. */
6943 ;
6944 /* If there is a mismatch, do warn. */
6947 {
6949 {
6950 auto_diagnostic_group d;
6954 "pointer targets in passing argument %d of "
6957 rhstype);
6958 }
6962 "pointer targets in assignment from %qT to %qT "
6967 "pointer targets in initialization of %qT "
6969 rhstype);
6973 "returning %qT from a function with return type "
6978 }
6979 }
6982 {
6983 /* Because const and volatile on functions are restrictions
6984 that say the function will not do certain things,
6985 it is okay to use a const or volatile function
6986 where an ordinary one is wanted, but not vice-versa. */
6990 OPT_Wdiscarded_qualifiers,
6992 "%q#v qualified function pointer "
7001 }
7002 }
7003 /* Avoid warning about the volatile ObjC EH puts on decls. */
7005 {
7007 {
7009 {
7010 auto_diagnostic_group d;
7014 "passing argument %d of %qE from incompatible "
7017 }
7026 "initialization of %qT from incompatible pointer "
7031 "returning %qT from a function with incompatible "
7036 }
7037 }
7040 }
7042 {
7043 /* ??? This should not be an error when inlining calls to
7044 unprototyped functions. */
7047 }
7049 {
7050 /* An explicit constant 0 can convert to a pointer,
7051 or one that results from arithmetic, even including
7052 a cast to integer type. */
7055 {
7057 {
7058 auto_diagnostic_group d;
7062 "passing argument %d of %qE makes pointer from "
7065 }
7069 "assignment to %qT from %qT makes pointer from integer "
7074 "initialization of %qT from %qT makes pointer from "
7079 "function with return type %qT makes pointer from "
7084 }
7087 }
7089 {
7091 {
7093 {
7094 auto_diagnostic_group d;
7098 "passing argument %d of %qE makes integer from "
7101 }
7105 "assignment to %qT from %qT makes integer from pointer "
7110 "initialization of %qT from %qT makes integer from "
7115 "function with return type %qT makes integer from "
7120 }
7123 }
7125 {
7126 tree ret;
7132 }
7135 {
7137 {
7138 auto_diagnostic_group d;
7142 rname);
7144 }
7157 "incompatible types when returning type %qT but %qT was "
7162 }
7165 }
7166 \f
7167 /* If VALUE is a compound expr all of whose expressions are constant, then
7168 return its value. Otherwise, return error_mark_node.
7170 This is for handling COMPOUND_EXPRs as initializer elements
7171 which is allowed with a warning when -pedantic is specified. */
7173 static tree
7175 {
7177 {
7182 endtype);
7183 }
7186 else
7188 }
7189 \f
7190 /* Perform appropriate conversions on the initial value of a variable,
7191 store it in the declaration DECL,
7192 and print any error messages that are appropriate.
7193 If ORIGTYPE is not NULL_TREE, it is the original type of INIT.
7194 If the init is invalid, store an ERROR_MARK.
7196 INIT_LOC is the location of the initial value. */
7198 void
7200 {
7204 /* If variable's type was invalidly declared, just ignore it. */
7210 /* Digest the specified initializer into an expression. */
7217 /* Store the expression if valid; else report error. */
7227 /* ANSI wants warnings about out-of-range constant initializers. */
7232 /* Check if we need to set array size from compound literal size. */
7236 {
7243 {
7247 {
7248 /* For int foo[] = (int [3]){1}; we need to set array size
7249 now since later on array initializer will be just the
7250 brace enclosed list of the compound literal. */
7258 }
7259 }
7260 }
7261 }
7262 \f
7263 /* Methods for storing and printing names for error messages. */
7265 /* Implement a spelling stack that allows components of a name to be pushed
7266 and popped. Each element on the stack is this structure. */
7268 struct spelling
7269 {
7271 union
7272 {
7276 };
7278 #define SPELLING_STRING 1
7279 #define SPELLING_MEMBER 2
7280 #define SPELLING_BOUNDS 3
7286 /* Macros to save and restore the spelling stack around push_... functions.
7287 Alternative to SAVE_SPELLING_STACK. */
7289 #define SPELLING_DEPTH() (spelling - spelling_base)
7290 #define RESTORE_SPELLING_DEPTH(DEPTH) (spelling = spelling_base + (DEPTH))
7292 /* Push an element on the spelling stack with type KIND and assign VALUE
7293 to MEMBER. */
7295 #define PUSH_SPELLING(KIND, VALUE, MEMBER) \
7296 { \
7297 int depth = SPELLING_DEPTH (); \
7298 \
7299 if (depth >= spelling_size) \
7300 { \
7301 spelling_size += 10; \
7302 spelling_base = XRESIZEVEC (struct spelling, spelling_base, \
7303 spelling_size); \
7304 RESTORE_SPELLING_DEPTH (depth); \
7305 } \
7306 \
7307 spelling->kind = (KIND); \
7308 spelling->MEMBER = (VALUE); \
7309 spelling++; \
7310 }
7312 /* Push STRING on the stack. Printed literally. */
7314 static void
7316 {
7318 }
7320 /* Push a member name on the stack. Printed as '.' STRING. */
7322 static void
7324 {
7330 }
7332 /* Push an array bounds on the stack. Printed as [BOUNDS]. */
7334 static void
7336 {
7338 }
7340 /* Compute the maximum size in bytes of the printed spelling. */
7342 static int
7344 {
7349 {
7352 else
7354 }
7357 }
7359 /* Print the spelling to BUFFER and return it. */
7363 {
7369 {
7372 }
7373 else
7374 {
7379 ;
7380 }
7383 }
7385 /* Digest the parser output INIT as an initializer for type TYPE.
7386 Return a C expression of type TYPE to represent the initial value.
7388 If ORIGTYPE is not NULL_TREE, it is the original type of INIT.
7390 NULL_POINTER_CONSTANT is true if INIT is a null pointer constant.
7392 If INIT is a string constant, STRICT_STRING is true if it is
7393 unparenthesized or we should not warn here for it being parenthesized.
7394 For other types of INIT, STRICT_STRING is not used.
7396 INIT_LOC is the location of the INIT.
7398 REQUIRE_CONSTANT requests an error if non-constant initializers or
7399 elements are seen. */
7401 static tree
7405 {
7412 || !init
7419 {
7422 }
7425 /* Initialization of an array of chars from a string constant
7426 optionally enclosed in braces. */
7430 {
7431 tree typ1
7434 TYPE_QUAL_ATOMIC)
7436 /* Note that an array could be both an array of character type
7437 and an array of wchar_t if wchar_t is signed char or unsigned
7438 char. */
7447 {
7464 {
7466 {
7470 }
7471 }
7472 else
7473 {
7475 {
7479 }
7481 {
7485 }
7486 }
7491 {
7495 /* Subtract the size of a single (possibly wide) character
7496 because it's ok to ignore the terminating null char
7497 that is counted in the length of the constant. */
7508 {
7509 unsigned HOST_WIDE_INT size
7514 }
7515 }
7519 }
7521 {
7525 }
7526 }
7528 /* Build a VECTOR_CST from a *constant* vector constructor. If the
7529 vector constructor is not constant (e.g. {1,2,3,foo()}) then punt
7530 below and handle as a constructor. */
7535 {
7542 {
7544 tree value;
7547 /* Iterate through elements and check if all constructor
7548 elements are *_CSTs. */
7551 {
7554 }
7559 }
7560 }
7565 /* Any type can be initialized
7566 from an expression of the same type, optionally with braces. */
7579 {
7581 {
7583 {
7586 inside_init = array_to_pointer_conversion
7588 else
7589 {
7592 }
7593 }
7594 }
7597 /* Although the types are compatible, we may require a
7598 conversion. */
7603 {
7604 /* As an extension, allow initializing objects with static storage
7605 duration with compound literals (which are then treated just as
7606 the brace enclosed list they contain). Also allow this for
7607 vectors, as we can only assign them with compound literals. */
7613 }
7617 {
7621 }
7623 /* Compound expressions can only occur here if -Wpedantic or
7624 -pedantic-errors is specified. In the later case, we always want
7625 an error. In the former case, we simply want a warning. */
7628 {
7629 inside_init
7634 else
7639 }
7643 {
7646 }
7651 /* Added to enable additional -Wsuggest-attribute=format warnings. */
7658 }
7660 /* Handle scalar types, including conversions. */
7665 {
7672 inside_init);
7673 inside_init
7679 /* Check to see if we have already given an error message. */
7681 ;
7683 {
7686 }
7690 {
7694 }
7700 }
7702 /* Come here only for records and arrays. */
7705 {
7708 }
7712 }
7713 \f
7714 /* Handle initializers that use braces. */
7716 /* Type of object we are accumulating a constructor for.
7717 This type is always a RECORD_TYPE, UNION_TYPE or ARRAY_TYPE. */
7720 /* For a RECORD_TYPE or UNION_TYPE, this is the chain of fields
7721 left to fill. */
7724 /* For an ARRAY_TYPE, this is the specified index
7725 at which to store the next element we get. */
7728 /* For an ARRAY_TYPE, this is the maximum index. */
7731 /* For a RECORD_TYPE, this is the first field not yet written out. */
7734 /* For an ARRAY_TYPE, this is the index of the first element
7735 not yet written out. */
7738 /* In a RECORD_TYPE, the byte index of the next consecutive field.
7739 This is so we can generate gaps between fields, when appropriate. */
7742 /* If we are saving up the elements rather than allocating them,
7743 this is the list of elements so far (in reverse order,
7744 most recent first). */
7747 /* 1 if constructor should be incrementally stored into a constructor chain,
7748 0 if all the elements should be kept in AVL tree. */
7751 /* 1 if so far this constructor's elements are all compile-time constants. */
7754 /* 1 if so far this constructor's elements are all valid address constants. */
7757 /* 1 if this constructor has an element that cannot be part of a
7758 constant expression. */
7761 /* 1 if this constructor is erroneous so far. */
7764 /* 1 if this constructor is the universal zero initializer { 0 }. */
7767 /* Structure for managing pending initializer elements, organized as an
7768 AVL tree. */
7770 struct init_node
7771 {
7775 tree purpose;
7776 tree value;
7777 tree origtype;
7778 };
7780 /* Tree of pending elements at this constructor level.
7781 These are elements encountered out of order
7782 which belong at places we haven't reached yet in actually
7783 writing the output.
7784 Will never hold tree nodes across GC runs. */
7787 /* The SPELLING_DEPTH of this constructor. */
7790 /* DECL node for which an initializer is being read.
7791 0 means we are reading a constructor expression
7792 such as (struct foo) {...}. */
7795 /* Nonzero if this is an initializer for a top-level decl. */
7798 /* Nonzero if there were any member designators in this initializer. */
7801 /* Nesting depth of designator list. */
7804 /* Nonzero if there were diagnosed errors in this designator list. */
7807 \f
7808 /* This stack has a level for each implicit or explicit level of
7809 structuring in the initializer, including the outermost one. It
7810 saves the values of most of the variables above. */
7814 struct constructor_stack
7815 {
7817 tree type;
7818 tree fields;
7819 tree index;
7820 tree max_index;
7821 tree unfilled_index;
7822 tree unfilled_fields;
7823 tree bit_index;
7828 /* If value nonzero, this value should replace the entire
7829 constructor at this level. */
7841 };
7845 /* This stack represents designators from some range designator up to
7846 the last designator in the list. */
7848 struct constructor_range_stack
7849 {
7852 tree range_start;
7853 tree index;
7854 tree range_end;
7855 tree fields;
7856 };
7860 /* This stack records separate initializers that are nested.
7861 Nested initializers can't happen in ANSI C, but GNU C allows them
7862 in cases like { ... (struct foo) { ... } ... }. */
7864 struct initializer_stack
7865 {
7867 tree decl;
7878 };
7881 \f
7882 /* Prepare to parse and output the initializer for variable DECL. */
7884 void
7887 {
7910 {
7912 require_constant_elements
7914 /* For a scalar, you can always use any value to initialize,
7915 even within braces. */
7918 }
7919 else
7920 {
7924 }
7937 }
7939 void
7941 {
7944 /* Free the whole constructor stack of this initializer. */
7946 {
7950 }
7954 /* Pop back to the data of the outer initializer (if any). */
7969 }
7970 \f
7971 /* Call here when we see the initializer is surrounded by braces.
7972 This is instead of a call to push_init_level;
7973 it is matched by a call to pop_init_level.
7975 TYPE is the type to initialize, for a constructor expression.
7976 For an initializer for a decl, TYPE is zero. */
7978 void
7980 {
8030 {
8032 /* Skip any nameless bit fields at the beginning. */
8039 }
8041 {
8043 {
8044 constructor_max_index
8047 /* Detect non-empty initializations of zero-length arrays. */
8052 /* constructor_max_index needs to be an INTEGER_CST. Attempts
8053 to initialize VLAs will cause a proper error; avoid tree
8054 checking errors as well by setting a safe value. */
8059 constructor_index
8062 }
8063 else
8064 {
8067 }
8070 }
8072 {
8073 /* Vectors are like simple fixed-size arrays. */
8074 constructor_max_index =
8078 }
8079 else
8080 {
8081 /* Handle the case of int x = {5}; */
8084 }
8085 }
8086 \f
8089 /* Called when we see an open brace for a nested initializer. Finish
8090 off any pending levels with implicit braces. */
8091 void
8093 {
8095 {
8100 last_init_list_comma),
8103 && constructor_max_index
8105 constructor_index))
8108 last_init_list_comma),
8110 else
8112 }
8113 }
8115 /* Push down into a subobject, for initialization.
8116 If this is for an explicit set of braces, IMPLICIT is 0.
8117 If it is because the next element belongs at a lower level,
8118 IMPLICIT is 1 (or 2 if the push is because of designator list). */
8120 void
8123 {
8127 /* Unless this is an explicit brace, we need to preserve previous
8128 content if any. */
8130 {
8135 }
8173 {
8178 }
8180 /* Don't die if an entire brace-pair level is superfluous
8181 in the containing level. */
8183 ;
8185 {
8186 /* Don't die if there are extra init elts at the end. */
8189 else
8190 {
8193 constructor_depth++;
8194 }
8195 /* If upper initializer is designated, then mark this as
8196 designated too to prevent bogus warnings. */
8198 }
8200 {
8203 constructor_depth++;
8204 }
8207 {
8212 }
8215 {
8224 }
8227 {
8232 }
8235 {
8237 /* Skip any nameless bit fields at the beginning. */
8244 }
8246 {
8247 /* Vectors are like simple fixed-size arrays. */
8248 constructor_max_index =
8252 }
8254 {
8256 {
8257 constructor_max_index
8260 /* Detect non-empty initializations of zero-length arrays. */
8265 /* constructor_max_index needs to be an INTEGER_CST. Attempts
8266 to initialize VLAs will cause a proper error; avoid tree
8267 checking errors as well by setting a safe value. */
8272 constructor_index
8275 }
8276 else
8281 {
8282 /* We need to split the char/wchar array into individual
8283 characters, so that we don't have to special case it
8284 everywhere. */
8286 }
8287 }
8288 else
8289 {
8294 }
8295 }
8297 /* At the end of an implicit or explicit brace level,
8298 finish up that level of constructor. If a single expression
8299 with redundant braces initialized that level, return the
8300 c_expr structure for that expression. Otherwise, the original_code
8301 element is set to ERROR_MARK.
8302 If we were outputting the elements as they are read, return 0 as the value
8303 from inner levels (process_init_element ignores that),
8304 but return error_mark_node as the value from the outermost level
8305 (that's what we want to put in DECL_INITIAL).
8306 Otherwise, return a CONSTRUCTOR expression as the value. */
8308 struct c_expr
8311 location_t insert_before)
8312 {
8320 {
8321 /* When we come to an explicit close brace,
8322 pop any inner levels that didn't have explicit braces. */
8326 insert_before),
8329 }
8330 else
8335 /* Now output all pending elements. */
8341 /* Error for initializing a flexible array member, or a zero-length
8342 array member in an inappropriate context. */
8347 {
8348 /* Silently discard empty initializations. The parser will
8349 already have pedwarned for empty brackets. */
8352 else
8353 {
8358 else
8362 /* We have already issued an error message for the existence
8363 of a flexible array member not at the end of the structure.
8364 Discard the initializer so that we do not die later. */
8367 }
8368 }
8371 {
8373 /* Initialization with { } counts as zeroinit. */
8377 /* This might be zeroinit as well. */
8382 /* If the constructor has more than one element, it can't be { 0 }. */
8385 }
8387 /* Warn when some structs are initialized with direct aggregation. */
8390 {
8393 OPT_Wmissing_braces,
8395 }
8397 /* Warn when some struct elements are implicitly initialized to zero. */
8399 && constructor_type
8402 {
8403 /* Do not warn for flexible array members or zero-length arrays. */
8410 /* Do not warn if this level of the initializer uses member
8411 designators; it is likely to be deliberate. */
8412 && !constructor_designated
8413 /* Do not warn about initializing with { 0 } or with { }. */
8415 {
8418 constructor_unfilled_fields,
8419 constructor_type))
8422 }
8423 }
8425 /* Pad out the end of the structure. */
8427 /* If this closes a superfluous brace pair,
8428 just pass out the element between them. */
8431 ;
8435 {
8436 /* A nonincremental scalar initializer--just return
8437 the element, after verifying there is just one. */
8439 {
8443 }
8445 {
8448 }
8449 else
8451 }
8452 else
8453 {
8456 else
8457 {
8459 constructor_elements);
8466 }
8467 }
8470 {
8475 }
8504 }
8506 /* Common handling for both array range and field name designators.
8507 ARRAY argument is nonzero for array ranges. Returns false for success. */
8509 static bool
8512 {
8513 tree subtype;
8516 /* Don't die if an entire brace-pair level is superfluous
8517 in the containing level. */
8521 /* If there were errors in this designator list already, bail out
8522 silently. */
8527 {
8530 /* Designator list starts at the level of closest explicit
8531 braces. */
8535 last_init_list_comma),
8539 }
8542 {
8554 }
8558 {
8561 }
8563 {
8566 }
8572 }
8574 /* If there are range designators in designator list, push a new designator
8575 to constructor_range_stack. RANGE_END is end of such stack range or
8576 NULL_TREE if there is no range designator at this level. */
8578 static void
8580 {
8596 }
8598 /* Within an array initializer, specify the next index to be initialized.
8599 FIRST is that index. If LAST is nonzero, then initialize a range
8600 of indices, running from FIRST through LAST. */
8602 void
8605 {
8613 {
8616 }
8619 {
8623 "array index in initializer is not "
8625 }
8628 {
8632 "array index in initializer is not "
8634 }
8647 else
8648 {
8654 {
8657 }
8660 {
8664 {
8667 }
8668 else
8669 {
8673 {
8677 }
8678 }
8679 }
8681 designator_depth++;
8685 }
8686 }
8688 /* Within a struct initializer, specify the next field to be initialized. */
8690 void
8693 {
8694 tree field;
8702 {
8705 }
8710 {
8713 {
8719 }
8720 else
8723 }
8724 else
8725 do
8726 {
8728 designator_depth++;
8734 {
8737 }
8738 }
8740 }
8741 \f
8742 /* Add a new initializer to the tree of pending initializers. PURPOSE
8743 identifies the initializer, either array index or field in a structure.
8744 VALUE is the value of that index or field. If ORIGTYPE is not
8745 NULL_TREE, it is the original type of VALUE.
8747 IMPLICIT is true if value comes from pop_init_level (1),
8748 the new initializer has been merged with the existing one
8749 and thus no warnings should be emitted about overriding an
8750 existing initializer. */
8752 static void
8755 {
8762 {
8764 {
8770 else
8771 {
8773 {
8776 "initialized field with side-effects "
8781 }
8785 }
8786 }
8787 }
8788 else
8789 {
8790 tree bitpos;
8794 {
8800 else
8801 {
8803 {
8806 "initialized field with side-effects "
8811 }
8815 }
8816 }
8817 }
8832 {
8836 {
8840 {
8842 {
8843 /* L rotation. */
8856 {
8859 else
8861 }
8862 else
8864 }
8865 else
8866 {
8867 /* LR rotation. */
8889 {
8892 else
8894 }
8895 else
8897 }
8899 }
8900 else
8901 {
8902 /* p->balance == +1; growth of left side balances the node. */
8905 }
8906 }
8908 {
8910 /* Growth propagation from right side. */
8913 {
8915 {
8916 /* R rotation. */
8929 {
8932 else
8934 }
8935 else
8937 }
8939 {
8940 /* RL rotation */
8962 {
8965 else
8967 }
8968 else
8970 }
8972 }
8973 else
8974 {
8975 /* p->balance == -1; growth of right side balances the node. */
8978 }
8979 }
8983 }
8984 }
8986 /* Build AVL tree from a sorted chain. */
8988 static void
8990 {
9000 braced_init_obstack);
9003 {
9005 /* Skip any nameless bit fields at the beginning. */
9010 }
9012 {
9014 constructor_unfilled_index
9017 else
9019 }
9021 }
9023 /* Build AVL tree from a string constant. */
9025 static void
9028 {
9045 p < end
9046 && !(constructor_max_index
9049 {
9051 {
9054 }
9055 else
9056 {
9060 {
9063 else
9068 }
9069 }
9072 {
9075 {
9077 {
9080 }
9081 }
9083 {
9086 }
9090 }
9096 braced_init_obstack);
9097 }
9100 }
9102 /* Return value of FIELD in pending initializer or NULL_TREE if the field was
9103 not initialized yet. */
9105 static tree
9107 {
9111 {
9118 {
9123 else
9125 }
9126 }
9128 {
9132 && (!constructor_unfilled_fields
9139 {
9144 else
9146 }
9147 }
9149 {
9153 }
9155 }
9157 /* "Output" the next constructor element.
9158 At top level, really output it to assembler code now.
9159 Otherwise, collect it in a list from which we will make a CONSTRUCTOR.
9160 If ORIGTYPE is not NULL_TREE, it is the original type of VALUE.
9161 TYPE is the data type that the containing data type wants here.
9162 FIELD is the field (a FIELD_DECL) or the index that this element fills.
9163 If VALUE is a string constant, STRICT_STRING is true if it is
9164 unparenthesized or we should not warn here for it being parenthesized.
9165 For other types of VALUE, STRICT_STRING is not used.
9167 PENDING if true means output pending elements that belong
9168 right after this element. (PENDING is normally true;
9169 it is false while outputting pending elements, to avoid recursion.)
9171 IMPLICIT is true if value comes from pop_init_level (1),
9172 the new initializer has been merged with the existing one
9173 and thus no warnings should be emitted about overriding an
9174 existing initializer. */
9176 static void
9180 {
9186 {
9189 }
9202 {
9203 /* As an extension, allow initializing objects with static storage
9204 duration with compound literals (which are then treated just as
9205 the brace enclosed list they contain). */
9211 }
9215 {
9218 }
9228 && TYPE_REVERSE_STORAGE_ORDER
9237 /* Digest the initializer and issue any errors about incompatible
9238 types before issuing errors about non-constant initializers. */
9243 require_constant_value);
9245 {
9248 }
9252 /* Proceed to check the constness of the original initializer. */
9254 {
9256 {
9259 }
9263 }
9269 /* Issue -Wc++-compat warnings about initializing a bitfield with
9270 enum type. */
9278 {
9285 }
9287 /* If this field is empty and does not have side effects (and is not at
9288 the end of structure), don't do anything other than checking the
9289 initializer. */
9299 /* Finally, set VALUE to the initializer value digested above. */
9302 /* If this element doesn't come next in sequence,
9303 put it on constructor_pending_elts. */
9305 && (!constructor_incremental
9307 {
9313 braced_init_obstack);
9315 }
9317 && (!constructor_incremental
9319 {
9320 /* We do this for records but not for unions. In a union,
9321 no matter which field is specified, it can be initialized
9322 right away since it starts at the beginning of the union. */
9324 {
9327 else
9328 {
9336 }
9337 }
9340 braced_init_obstack);
9342 }
9345 {
9347 {
9354 }
9356 /* We can have just one union field set. */
9358 }
9360 /* Otherwise, output this element either to
9361 constructor_elements or to the assembler file. */
9366 /* Advance the variable that indicates sequential elements output. */
9368 constructor_unfilled_index
9370 bitsize_one_node);
9372 {
9373 constructor_unfilled_fields
9376 /* Skip any nameless bit fields. */
9379 constructor_unfilled_fields =
9381 }
9385 /* Now output any pending elements which have become next. */
9388 }
9390 /* For two FIELD_DECLs in the same chain, return -1 if field1
9391 comes before field2, 1 if field1 comes after field2 and
9392 0 if field1 == field2. */
9394 static int
9396 {
9403 {
9404 /* If one of the fields has non-zero bitsize, then that
9405 field must be the last one in a sequence of zero
9406 sized fields, fields after it will have bigger
9407 bit_position. */
9416 /* Otherwise, fallback to DECL_CHAIN walk to find out
9417 which field comes earlier. Walk chains of both
9418 fields, so that if field1 and field2 are close to each
9419 other in either order, it is found soon even for large
9420 sequences of zero sized fields. */
9423 {
9427 {
9430 }
9441 }
9442 }
9445 else
9447 }
9449 /* Output any pending elements which have become next.
9450 As we output elements, constructor_unfilled_{fields,index}
9451 advances, which may cause other elements to become next;
9452 if so, they too are output.
9454 If ALL is 0, we return when there are
9455 no more pending elements to output now.
9457 If ALL is 1, we output space as necessary so that
9458 we can output all the pending elements. */
9459 static void
9461 {
9463 tree next;
9465 retry:
9467 /* Look through the whole pending tree.
9468 If we find an element that should be output now,
9469 output it. Otherwise, set NEXT to the element
9470 that comes first among those still pending. */
9474 {
9476 {
9478 constructor_unfilled_index))
9482 braced_init_obstack);
9485 {
9486 /* Advance to the next smaller node. */
9489 else
9490 {
9491 /* We have reached the smallest node bigger than the
9492 current unfilled index. Fill the space first. */
9495 }
9496 }
9497 else
9498 {
9499 /* Advance to the next bigger node. */
9502 else
9503 {
9504 /* We have reached the biggest node in a subtree. Find
9505 the parent of it, which is the next bigger node. */
9511 {
9514 }
9515 }
9516 }
9517 }
9519 {
9520 /* If the current record is complete we are done. */
9530 braced_init_obstack);
9532 {
9533 /* Advance to the next smaller node. */
9536 else
9537 {
9538 /* We have reached the smallest node bigger than the
9539 current unfilled field. Fill the space first. */
9542 }
9543 }
9544 else
9545 {
9546 /* Advance to the next bigger node. */
9549 else
9550 {
9551 /* We have reached the biggest node in a subtree. Find
9552 the parent of it, which is the next bigger node. */
9559 {
9562 }
9563 }
9564 }
9565 }
9566 }
9568 /* Ordinarily return, but not if we want to output all
9569 and there are elements left. */
9573 /* If it's not incremental, just skip over the gap, so that after
9574 jumping to retry we will output the next successive element. */
9580 /* ELT now points to the node in the pending tree with the next
9581 initializer to output. */
9583 }
9584 \f
9585 /* Add one non-braced element to the current constructor level.
9586 This adjusts the current position within the constructor's type.
9587 This may also start or terminate implicit levels
9588 to handle a partly-braced initializer.
9590 Once this has found the correct level for the new element,
9591 it calls output_init_element.
9593 IMPLICIT is true if value comes from pop_init_level (1),
9594 the new initializer has been merged with the existing one
9595 and thus no warnings should be emitted about overriding an
9596 existing initializer. */
9598 void
9601 {
9603 int string_flag
9614 /* Handle superfluous braces around string cst as in
9615 char x[] = {"foo"}; */
9617 && constructor_type
9618 && !was_designated
9622 {
9627 }
9630 {
9633 }
9635 /* Ignore elements of a brace group if it is entirely superfluous
9636 and has already been diagnosed. */
9645 OPT_Wdesignated_init,
9646 "positional initialization of field "
9649 /* If we've exhausted any levels that didn't have braces,
9650 pop them now. */
9652 {
9657 last_init_list_comma),
9661 && constructor_max_index
9663 constructor_index))
9666 last_init_list_comma),
9668 else
9670 }
9672 /* In the case of [LO ... HI] = VALUE, only evaluate VALUE once. */
9674 {
9675 /* If value is a compound literal and we'll be just using its
9676 content, don't put it into a SAVE_EXPR. */
9679 {
9682 {
9685 }
9690 }
9691 }
9694 {
9696 {
9697 tree fieldtype;
9701 {
9704 }
9711 /* Error for non-static initialization of a flexible array member. */
9713 && !require_constant_value
9716 {
9720 }
9722 /* Error for initialization of a flexible array member with
9723 a string constant if the structure is in an array. E.g.:
9724 struct S { int x; char y[]; };
9725 struct S s[] = { { 1, "foo" } };
9726 is invalid. */
9732 {
9737 {
9740 }
9742 {
9746 }
9747 }
9749 /* Accept a string constant to initialize a subarray. */
9755 /* Otherwise, if we have come to a subaggregate,
9756 and we don't have an element of its type, push into it. */
9762 {
9765 }
9768 {
9773 braced_init_obstack);
9775 }
9776 else
9777 /* Do the bookkeeping for an element that was
9778 directly output as a constructor. */
9779 {
9780 /* For a record, keep track of end position of last field. */
9782 constructor_bit_index
9787 /* If the current field was the first one not yet written out,
9788 it isn't now, so update. */
9790 {
9792 /* Skip any nameless bit fields. */
9794 && (DECL_UNNAMED_BIT_FIELD
9796 constructor_unfilled_fields =
9798 }
9799 }
9802 /* Skip any nameless bit fields at the beginning. */
9806 }
9808 {
9809 tree fieldtype;
9813 {
9817 }
9824 /* Warn that traditional C rejects initialization of unions.
9825 We skip the warning if the value is zero. This is done
9826 under the assumption that the zero initializer in user
9827 code appears conditioned on e.g. __STDC__ to avoid
9828 "missing initializer" warnings and relies on default
9829 initialization to zero in the traditional C case.
9830 We also skip the warning if the initializer is designated,
9831 again on the assumption that this must be conditional on
9832 __STDC__ anyway (and we've already complained about the
9833 member-designator already). */
9840 /* Accept a string constant to initialize a subarray. */
9846 /* Otherwise, if we have come to a subaggregate,
9847 and we don't have an element of its type, push into it. */
9853 {
9856 }
9859 {
9864 braced_init_obstack);
9866 }
9867 else
9868 /* Do the bookkeeping for an element that was
9869 directly output as a constructor. */
9870 {
9873 }
9876 }
9878 {
9882 /* Accept a string constant to initialize a subarray. */
9888 /* Otherwise, if we have come to a subaggregate,
9889 and we don't have an element of its type, push into it. */
9895 {
9898 }
9903 {
9907 }
9909 /* Now output the actual element. */
9911 {
9916 braced_init_obstack);
9918 }
9920 constructor_index
9925 /* If we are doing the bookkeeping for an element that was
9926 directly output as a constructor, we must update
9927 constructor_unfilled_index. */
9929 }
9931 {
9934 /* Do a basic check of initializer size. Note that vectors
9935 always have a fixed size derived from their type. */
9937 {
9941 }
9943 /* Now output the actual element. */
9945 {
9951 braced_init_obstack);
9952 }
9954 constructor_index
9959 /* If we are doing the bookkeeping for an element that was
9960 directly output as a constructor, we must update
9961 constructor_unfilled_index. */
9963 }
9965 /* Handle the sole element allowed in a braced initializer
9966 for a scalar variable. */
9969 {
9973 }
9974 else
9975 {
9980 braced_init_obstack);
9982 }
9984 /* Handle range initializers either at this level or anywhere higher
9985 in the designator stack. */
9987 {
9994 {
9998 braced_init_obstack,
9999 last_init_list_comma),
10001 }
10005 {
10009 braced_init_obstack,
10010 last_init_list_comma),
10012 }
10020 {
10024 {
10027 }
10036 }
10041 }
10044 }
10047 }
10048 \f
10049 /* Build a complete asm-statement, whose components are a CV_QUALIFIER
10050 (guaranteed to be 'volatile' or null) and ARGS (represented using
10051 an ASM_EXPR node). */
10052 tree
10054 {
10058 }
10060 /* Build an asm-expr, whose components are a STRING, some OUTPUTS,
10061 some INPUTS, and some CLOBBERS. The latter three may be NULL.
10062 SIMPLE indicates whether there was anything at all after the
10063 string in the asm expression -- asm("blah") and asm("blah" : )
10064 are subtly different. We use a ASM_EXPR node to represent this. */
10065 tree
10068 {
10069 tree tail;
10070 tree args;
10083 /* Remove output conversions that change the type but not the mode. */
10085 {
10090 /* ??? Really, this should not be here. Users should be using a
10091 proper lvalue, dammit. But there's a long history of using casts
10092 in the output operands. In cases like longlong.h, this becomes a
10093 primitive form of typechecking -- if the cast can be removed, then
10094 the output operand had a type of the proper width; otherwise we'll
10095 get an error. Gross, but ... */
10113 {
10114 /* If the operand is going to end up in memory,
10115 mark it addressable. */
10121 {
10124 }
10125 }
10126 else
10130 }
10133 {
10134 tree input;
10141 {
10142 /* If the operand is going to end up in memory,
10143 mark it addressable. */
10145 {
10148 /* Strip the nops as we allow this case. FIXME, this really
10149 should be rejected or made deprecated. */
10153 }
10154 else
10155 {
10163 {
10166 }
10167 }
10168 }
10169 else
10173 }
10175 /* ASMs with labels cannot have outputs. This should have been
10176 enforced by the parser. */
10181 /* asm statements without outputs, including simple ones, are treated
10182 as volatile. */
10187 }
10188 \f
10189 /* Generate a goto statement to LABEL. LOC is the location of the
10190 GOTO. */
10192 tree
10194 {
10199 {
10204 }
10205 }
10207 /* Generate a computed goto statement to EXPR. LOC is the location of
10208 the GOTO. */
10210 tree
10212 {
10213 tree t;
10220 }
10222 /* Generate a C `return' statement. RETVAL is the expression for what
10223 to return, or a null pointer for `return;' with no value. LOC is
10224 the location of the return statement, or the location of the expression,
10225 if the statement has any. If ORIGTYPE is not NULL_TREE, it
10226 is the original type of RETVAL. */
10228 tree
10230 {
10235 /* Use the expansion point to handle cases such as returning NULL
10236 in a function returning void. */
10244 {
10248 {
10251 }
10255 }
10258 {
10262 {
10265 warned_here = pedwarn
10268 else
10269 warned_here = warning_at
10276 }
10277 }
10279 {
10283 warned_here = pedwarn
10286 else
10287 warned_here = pedwarn
10293 }
10294 else
10295 {
10300 tree inner;
10318 /* Strip any conversions, additions, and subtractions, and see if
10319 we are returning the address of a local variable. Warn if so. */
10321 {
10323 {
10324 CASE_CONVERT:
10332 /* If the second operand of the MINUS_EXPR has a pointer
10333 type (or is converted from it), this may be valid, so
10334 don't give a warning. */
10335 {
10348 }
10361 {
10365 else
10366 {
10371 }
10372 }
10377 }
10380 }
10387 }
10392 }
10393 \f
10395 /* The SWITCH_EXPR being built. */
10396 tree switch_expr;
10398 /* The original type of the testing expression, i.e. before the
10399 default conversion is applied. */
10400 tree orig_type;
10402 /* A splay-tree mapping the low element of a case range to the high
10403 element, or NULL_TREE if there is no high element. Used to
10404 determine whether or not a new case label duplicates an old case
10405 label. We need a tree, rather than simply a hash table, because
10406 of the GNU case range extension. */
10407 splay_tree cases;
10409 /* The bindings at the point of the switch. This is used for
10410 warnings crossing decls when branching to a case label. */
10413 /* The next node on the stack. */
10416 /* Remember whether the controlling expression had boolean type
10417 before integer promotions for the sake of -Wswitch-bool. */
10420 /* Remember whether there was a case value that is outside the
10421 range of the ORIG_TYPE. */
10423 };
10425 /* A stack of the currently active switch statements. The innermost
10426 switch statement is on the top of the stack. There is no need to
10427 mark the stack for garbage collection because it is only active
10428 during the processing of the body of a function, and we never
10429 collect at that point. */
10433 /* Start a C switch statement, testing expression EXP. Return the new
10434 SWITCH_EXPR. SWITCH_LOC is the location of the `switch'.
10435 SWITCH_COND_LOC is the location of the switch's condition.
10436 EXPLICIT_CAST_P is true if the expression EXP has an explicit cast. */
10438 tree
10440 location_t switch_cond_loc,
10442 {
10448 {
10452 {
10454 {
10457 }
10459 }
10460 else
10461 {
10465 /* Warn if the condition has boolean value. */
10471 /* Explicit cast to int suppresses this warning. */
10488 }
10489 }
10491 /* Add this new SWITCH_EXPR to the stack. */
10504 }
10506 /* Process a case label at location LOC. */
10508 tree
10510 {
10514 {
10519 }
10522 {
10527 }
10530 {
10533 else
10536 }
10540 loc))
10551 }
10553 /* Finish the switch statement. TYPE is the original type of the
10554 controlling expression of the switch, or NULL_TREE. */
10556 void
10558 {
10560 location_t switch_location;
10564 /* Emit warnings as needed. */
10573 /* Pop the stack. */
10578 }
10579 \f
10580 /* Emit an if statement. IF_LOCUS is the location of the 'if'. COND,
10581 THEN_BLOCK and ELSE_BLOCK are expressions to be used; ELSE_BLOCK
10582 may be null. */
10584 void
10586 tree else_block)
10587 {
10588 tree stmt;
10593 }
10595 /* Emit a general-purpose loop construct. START_LOCUS is the location of
10596 the beginning of the loop. COND is the loop condition. COND_IS_FIRST
10597 is false for DO loops. INCR is the FOR increment expression. BODY is
10598 the statement controlled by the loop. BLAB is the break label. CLAB is
10599 the continue label. Everything is allowed to be NULL. */
10601 void
10604 {
10607 /* If the condition is zero don't generate a loop construct. */
10609 {
10611 {
10615 }
10616 }
10617 else
10618 {
10621 /* If we have an exit condition, then we build an IF with gotos either
10622 out of the loop, or to the top of it. If there's no exit condition,
10623 then we just build a jump back to the top. */
10627 {
10628 /* Canonicalize the loop condition to the end. This means
10629 generating a branch to the loop condition. Reuse the
10630 continue label, if possible. */
10632 {
10634 {
10637 }
10638 else
10642 }
10648 else
10651 }
10652 else
10653 {
10654 /* For the backward-goto's location of an unconditional loop
10655 use the beginning of the body, or, if there is none, the
10656 top of the loop. */
10661 }
10664 }
10678 }
10680 tree
10682 {
10686 /* In switch statements break is sometimes stylistically used after
10687 a return statement. This can lead to spurious warnings about
10688 control reaching the end of a non-void function when it is
10689 inlined. Note that we are calling block_may_fallthru with
10690 language specific tree nodes; this works because
10691 block_may_fallthru returns true when given something it does not
10692 understand. */
10696 {
10699 }
10701 ;
10703 {
10707 else
10719 else
10725 }
10734 }
10736 /* A helper routine for c_process_expr_stmt and c_finish_stmt_expr. */
10738 static void
10740 {
10742 ;
10744 {
10747 }
10749 {
10753 {
10757 }
10765 }
10766 else
10768 }
10770 /* Process an expression as if it were a complete statement. Emit
10771 diagnostics, but do not call ADD_STMT. LOC is the location of the
10772 statement. */
10774 tree
10776 {
10777 tree exprv;
10792 /* If we're not processing a statement expression, warn about unused values.
10793 Warnings for statement expressions will be emitted later, once we figure
10794 out which is the result. */
10809 /* If the expression is not of a type to which we cannot assign a line
10810 number, wrap the thing in a no-op NOP_EXPR. */
10812 {
10815 }
10818 }
10820 /* Emit an expression as a statement. LOC is the location of the
10821 expression. */
10823 tree
10825 {
10828 else
10830 }
10832 /* Do the opposite and emit a statement as an expression. To begin,
10833 create a new binding level and return it. */
10835 tree
10837 {
10838 tree ret;
10840 /* We must force a BLOCK for this level so that, if it is not expanded
10841 later, there is a way to turn off the entire subtree of blocks that
10842 are contained in it. */
10847 ? NULL
10850 /* Mark the current statement list as belonging to a statement list. */
10854 }
10856 /* LOC is the location of the compound statement to which this body
10857 belongs. */
10859 tree
10861 {
10868 ? NULL
10871 /* Locate the last statement in BODY. See c_end_compound_stmt
10872 about always returning a BIND_EXPR. */
10876 continue_searching:
10878 {
10884 /* This can happen with degenerate cases like ({ }). No value. */
10888 /* If we're supposed to generate side effects warnings, process
10889 all of the statements except the last. */
10891 {
10894 {
10895 location_t tloc;
10900 }
10901 }
10904 }
10906 /* If the end of the list is exception related, then the list was split
10907 by a call to push_cleanup. Continue searching. */
10910 {
10914 }
10919 /* In the case that the BIND_EXPR is not necessary, return the
10920 expression out from inside it. */
10922 /* Skip nested debug stmts. */
10925 {
10926 /* Even if this looks constant, do not allow it in a constant
10927 expression. */
10929 /* Do not warn if the return value of a statement expression is
10930 unused. */
10933 }
10935 /* Extract the type of said expression. */
10938 /* If we're not returning a value at all, then the BIND_EXPR that
10939 we already have is a fine expression to return. */
10943 /* Now that we've located the expression containing the value, it seems
10944 silly to make voidify_wrapper_expr repeat the process. Create a
10945 temporary of the appropriate type and stick it in a TARGET_EXPR. */
10948 /* Unwrap a no-op NOP_EXPR as added by c_finish_expr_stmt. This avoids
10949 tree_expr_nonnegative_p giving up immediately. */
10958 {
10962 }
10963 }
10964 \f
10965 /* Begin and end compound statements. This is as simple as pushing
10966 and popping new statement lists from the tree. */
10968 tree
10970 {
10975 }
10977 /* End a compound statement. STMT is the statement. LOC is the
10978 location of the compound statement-- this is usually the location
10979 of the opening brace. */
10981 tree
10983 {
10987 {
10991 }
10996 /* If this compound statement is nested immediately inside a statement
10997 expression, then force a BIND_EXPR to be created. Otherwise we'll
10998 do the wrong thing for ({ { 1; } }) or ({ 1; { } }). In particular,
10999 STATEMENT_LISTs merge, and thus we can lose track of what statement
11000 was really last. */
11004 {
11008 }
11011 }
11013 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
11014 when the current scope is exited. EH_ONLY is true when this is not
11015 meant to apply to normal control flow transfer. */
11017 void
11019 {
11031 }
11032 \f
11033 /* Build a vector comparison of ARG0 and ARG1 using CODE opcode
11034 into a value of TYPE type. Comparison is done via VEC_COND_EXPR. */
11036 static tree
11039 {
11045 }
11047 /* Subclass of range_label for labelling the type of EXPR when reporting
11048 a type mismatch between EXPR and OTHER_EXPR.
11049 Either or both of EXPR and OTHER_EXPR could be NULL. */
11052 {
11056 {
11057 }
11060 {
11072 }
11075 tree m_expr;
11076 tree m_other_expr;
11077 };
11079 /* Build a binary-operation expression without default conversions.
11080 CODE is the kind of expression to build.
11081 LOCATION is the operator's location.
11082 This function differs from `build' in several ways:
11083 the data type of the result is computed and recorded in it,
11084 warnings are generated if arg data types are invalid,
11085 special handling for addition and subtraction of pointers is known,
11086 and some optimization is done (operations on narrow ints
11087 are done in the narrower type when that gives the same result).
11088 Constant folding is also done before the result is returned.
11090 Note that the operands will never have enumeral types, or function
11091 or array types, because either they will have the default conversions
11092 performed or they have both just been converted to some other type in which
11093 the arithmetic is to be done. */
11095 tree
11098 {
11100 tree eptype;
11108 /* Expression code to give to the expression when it is built.
11109 Normally this is CODE, which is what the caller asked for,
11110 but in some special cases we change it. */
11113 /* Data type in which the computation is to be performed.
11114 In the simplest cases this is the common type of the arguments. */
11117 /* When the computation is in excess precision, the type of the
11118 final EXCESS_PRECISION_EXPR. */
11121 /* Nonzero means operands have already been type-converted
11122 in whatever way is necessary.
11123 Zero means they need to be converted to RESULT_TYPE. */
11126 /* Nonzero means create the expression with this type, rather than
11127 RESULT_TYPE. */
11130 /* Nonzero means after finally constructing the expression
11131 convert it to this type. */
11134 /* Nonzero if this is an operation like MIN or MAX which can
11135 safely be computed in short if both args are promoted shorts.
11136 Also implies COMMON.
11137 -1 indicates a bitwise operation; this makes a difference
11138 in the exact conditions for when it is safe to do the operation
11139 in a narrower mode. */
11142 /* Nonzero if this is a comparison operation;
11143 if both args are promoted shorts, compare the original shorts.
11144 Also implies COMMON. */
11147 /* Nonzero if this is a right-shift operation, which can be computed on the
11148 original short and then promoted if the operand is a promoted short. */
11151 /* Nonzero means set RESULT_TYPE to the common type of the args. */
11154 /* True means types are compatible as far as ObjC is concerned. */
11157 /* True means this is an arithmetic operation that may need excess
11158 precision. */
11161 /* True means this is a boolean operation that converts both its
11162 operands to truth-values. */
11165 /* Remember whether we're doing / or %. */
11168 /* Remember whether we're doing << or >>. */
11171 /* Tree holding instrumentation expression. */
11188 {
11191 int_const = (int_const_or_overflow
11194 }
11195 else
11198 /* Do not apply default conversion in mixed vector/scalar expression. */
11201 {
11204 }
11210 /* The expression codes of the data types of the arguments tell us
11211 whether the arguments are integers, floating, pointers, etc. */
11215 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
11219 /* If an error was already reported for one of the arguments,
11220 avoid reporting another error. */
11235 {
11238 }
11241 {
11259 /* Excess precision for implicit conversions of integers to
11260 floating point in C11 and later. */
11261 may_need_excess_precision = (flag_isoc11
11269 }
11271 {
11274 }
11277 {
11280 }
11282 {
11285 }
11288 {
11291 }
11295 /* In case when one of the operands of the binary operation is
11296 a vector and another is a scalar -- convert scalar to vector. */
11298 {
11303 {
11307 {
11309 tree sc;
11320 }
11322 {
11324 tree sc;
11335 }
11338 }
11339 }
11342 {
11344 /* Handle the pointer + int case. */
11346 {
11349 }
11351 {
11354 }
11355 else
11360 /* Subtraction of two similar pointers.
11361 We must subtract them as integers, then divide by object size. */
11364 {
11367 }
11368 /* Handle pointer minus int. Just like pointer plus int. */
11370 {
11373 }
11374 else
11396 {
11407 else
11408 /* Although it would be tempting to shorten always here, that
11409 loses on some targets, since the modulo instruction is
11410 undefined if the quotient can't be represented in the
11411 computation mode. We shorten only if unsigned or if
11412 dividing by something we know != -1. */
11417 }
11425 /* Allow vector types which are not floating point types. */
11443 {
11444 /* Although it would be tempting to shorten always here, that loses
11445 on some targets, since the modulo instruction is undefined if the
11446 quotient can't be represented in the computation mode. We shorten
11447 only if unsigned or if dividing by something we know != -1. */
11452 }
11466 {
11467 /* Result of these operations is always an int,
11468 but that does not mean the operands should be
11469 converted to ints! */
11472 {
11475 }
11476 else
11479 {
11482 }
11483 else
11487 }
11489 {
11490 int_const_or_overflow = (int_operands
11494 int_const = (int_const_or_overflow
11498 }
11500 {
11501 int_const_or_overflow = (int_operands
11505 int_const = (int_const_or_overflow
11509 }
11512 /* Shift operations: result has same type as first operand;
11513 always convert second operand to int.
11514 Also set SHORT_SHIFT if shifting rightward. */
11522 {
11525 }
11530 {
11533 {
11535 {
11540 }
11542 {
11546 {
11551 }
11552 }
11553 else
11554 {
11559 {
11564 }
11565 }
11566 }
11568 /* Use the type of the value to be shifted. */
11570 /* Avoid converting op1 to result_type later. */
11572 }
11581 {
11584 }
11589 {
11593 {
11594 /* Don't reject a left shift of a negative value in a context
11595 where a constant expression is needed in C90. */
11601 }
11603 {
11605 {
11610 }
11612 {
11616 {
11621 }
11622 }
11624 {
11629 }
11634 }
11636 /* Use the type of the value to be shifted. */
11638 /* Avoid converting op1 to result_type later. */
11640 }
11646 {
11647 tree intt;
11649 {
11653 }
11657 {
11661 }
11663 /* It's not precisely specified how the usual arithmetic
11664 conversions apply to the vector types. Here, we use
11665 the unsigned type if one of the operands is signed and
11666 the other one is unsigned. */
11668 {
11671 else
11675 }
11677 /* Always construct signed integer vector type. */
11679 (SCALAR_TYPE_MODE
11682 {
11687 }
11693 }
11696 OPT_Wfloat_equal,
11698 /* Result of comparison is always int,
11699 but don't convert the args to int! */
11707 {
11711 {
11714 OPT_Waddress,
11715 "the comparison will always evaluate as %<false%> "
11718 else
11720 OPT_Waddress,
11721 "the comparison will always evaluate as %<true%> "
11724 }
11726 }
11728 {
11732 {
11735 OPT_Waddress,
11736 "the comparison will always evaluate as %<false%> "
11739 else
11741 OPT_Waddress,
11742 "the comparison will always evaluate as %<true%> "
11745 }
11747 }
11749 {
11756 /* Anything compares with void *. void * compares with anything.
11757 Otherwise, the targets must be compatible
11758 and both must be object or both incomplete. */
11762 {
11766 }
11768 {
11772 }
11774 {
11778 }
11779 else
11780 /* Avoid warning about the volatile ObjC EH puts on decls. */
11786 {
11788 result_type = build_pointer_type
11790 }
11791 }
11793 {
11796 }
11798 {
11801 }
11814 {
11815 tree intt;
11817 {
11821 }
11825 {
11829 }
11831 /* It's not precisely specified how the usual arithmetic
11832 conversions apply to the vector types. Here, we use
11833 the unsigned type if one of the operands is signed and
11834 the other one is unsigned. */
11836 {
11839 else
11843 }
11845 /* Always construct signed integer vector type. */
11847 (SCALAR_TYPE_MODE
11850 {
11855 }
11861 }
11869 {
11872 addr_space_t as_common;
11875 {
11889 }
11891 {
11895 }
11896 else
11897 {
11899 result_type = build_pointer_type
11903 }
11904 }
11906 {
11914 }
11916 {
11924 }
11926 {
11929 }
11931 {
11934 }
11938 {
11944 }
11955 }
11963 {
11965 maybe_range_label_for_tree_type_mismatch
11972 }
11976 &&
11979 {
11985 {
11988 "implicit conversion from %qT to %qT "
11989 "to match other operand of binary "
11991 location);
11994 }
12003 {
12004 /* An operation on mixed real/complex operands must be
12005 handled specially, but the language-independent code can
12006 more easily optimize the plain complex arithmetic if
12007 -fno-signed-zeros. */
12011 {
12014 }
12016 {
12021 }
12022 else
12023 {
12028 }
12032 {
12039 {
12044 /* Fall through. */
12051 }
12052 }
12053 else
12054 {
12061 {
12065 /* Fall through. */
12075 }
12076 }
12079 }
12081 /* For certain operations (which identify themselves by shorten != 0)
12082 if both args were extended from the same smaller type,
12083 do the arithmetic in that type and then extend.
12085 shorten !=0 and !=1 indicates a bitwise operation.
12086 For them, this optimization is safe only if
12087 both args are zero-extended or both are sign-extended.
12088 Otherwise, we might change the result.
12089 Eg, (short)-1 | (unsigned short)-1 is (int)-1
12090 but calculated in (unsigned short) it would be (unsigned short)-1. */
12093 {
12097 }
12099 /* Shifts can be shortened if shifting right. */
12102 {
12113 /* We can shorten only if the shift count is less than the
12114 number of bits in the smaller type size. */
12116 /* We cannot drop an unsigned shift after sign-extension. */
12118 {
12119 /* Do an unsigned shift if the operand was zero-extended. */
12120 result_type
12123 /* Convert value-to-be-shifted to that type. */
12127 }
12128 }
12130 /* Comparison operations are shortened too but differently.
12131 They identify themselves by setting short_compare = 1. */
12134 {
12135 /* Don't write &op0, etc., because that would prevent op0
12136 from being kept in a register.
12137 Instead, make copies of the our local variables and
12138 pass the copies by reference, then copy them back afterward. */
12141 tree val
12146 {
12149 }
12156 {
12162 {
12165 }
12166 else
12167 {
12168 /* Fold for the sake of possible warnings, as in
12169 build_conditional_expr. This requires the
12170 "original" values to be folded, not just op0 and
12171 op1. */
12172 c_inhibit_evaluation_warnings++;
12177 c_inhibit_evaluation_warnings--;
12179 require_constant_value,
12180 NULL);
12182 require_constant_value,
12183 NULL);
12184 }
12191 {
12196 }
12197 }
12198 }
12199 }
12201 /* At this point, RESULT_TYPE must be nonzero to avoid an error message.
12202 If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
12203 Then the expression will be built.
12204 It will be given type FINAL_TYPE if that is nonzero;
12205 otherwise, it will be given type RESULT_TYPE. */
12208 {
12210 maybe_range_label_for_tree_type_mismatch
12217 }
12220 {
12224 {
12227 }
12228 }
12231 {
12233 semantic_result_type);
12235 semantic_result_type);
12237 /* This can happen if one operand has a vector type, and the other
12238 has a different type. */
12241 }
12248 {
12249 /* OP0 and/or OP1 might have side-effects. */
12259 }
12261 /* Treat expressions in initializers specially as they can't trap. */
12263 ret = (require_constant_value
12267 else
12272 return_build_binary_op:
12275 ret = (int_operands
12292 }
12295 /* Convert EXPR to be a truth-value, validating its type for this
12296 purpose. LOCATION is the source location for the expression. */
12298 tree
12300 {
12304 {
12306 error_at (location, "used array that cannot be converted to pointer where scalar is required");
12335 }
12340 {
12345 }
12346 else
12347 /* ??? Should we also give an error for vectors rather than leaving
12348 those to give errors later? */
12352 {
12355 else
12357 }
12361 }
12362 \f
12364 /* Convert EXPR to a contained DECL, updating *TC, *TI and *SE as
12365 required. */
12367 tree
12369 {
12371 {
12373 /* Executing a compound literal inside a function reinitializes
12374 it. */
12378 }
12379 else
12381 }
12382 \f
12383 /* Generate OMP construct CODE, with BODY and CLAUSES as its compound
12384 statement. LOC is the location of the construct. */
12386 tree
12388 tree clauses)
12389 {
12399 }
12401 /* Generate OACC_DATA, with CLAUSES and BLOCK as its compound
12402 statement. LOC is the location of the OACC_DATA. */
12404 tree
12406 {
12407 tree stmt;
12418 }
12420 /* Generate OACC_HOST_DATA, with CLAUSES and BLOCK as its compound
12421 statement. LOC is the location of the OACC_HOST_DATA. */
12423 tree
12425 {
12426 tree stmt;
12437 }
12439 /* Like c_begin_compound_stmt, except force the retention of the BLOCK. */
12441 tree
12443 {
12444 tree block;
12450 }
12452 /* Generate OMP_PARALLEL, with CLAUSES and BLOCK as its compound
12453 statement. LOC is the location of the OMP_PARALLEL. */
12455 tree
12457 {
12458 tree stmt;
12469 }
12471 /* Like c_begin_compound_stmt, except force the retention of the BLOCK. */
12473 tree
12475 {
12476 tree block;
12482 }
12484 /* Generate OMP_TASK, with CLAUSES and BLOCK as its compound
12485 statement. LOC is the location of the #pragma. */
12487 tree
12489 {
12490 tree stmt;
12501 }
12503 /* Generate GOMP_cancel call for #pragma omp cancel. */
12505 void
12507 {
12518 else
12519 {
12521 "%<parallel%>, %<for%>, %<sections%> or %<taskgroup%> "
12524 }
12527 {
12537 }
12538 else
12542 ifc);
12544 }
12546 /* Generate GOMP_cancellation_point call for
12547 #pragma omp cancellation point. */
12549 void
12551 {
12562 else
12563 {
12565 "%<parallel%>, %<for%>, %<sections%> or %<taskgroup%> "
12568 }
12572 }
12574 /* Helper function for handle_omp_array_sections. Called recursively
12575 to handle multiple array-section-subscripts. C is the clause,
12576 T current expression (initially OMP_CLAUSE_DECL), which is either
12577 a TREE_LIST for array-section-subscript (TREE_PURPOSE is low-bound
12578 expression if specified, TREE_VALUE length expression if specified,
12579 TREE_CHAIN is what it has been specified after, or some decl.
12580 TYPES vector is populated with array section types, MAYBE_ZERO_LEN
12581 set to true if any of the array-section-subscript could have length
12582 of zero (explicit or implicit), FIRST_NON_ONE is the index of the
12583 first array-section-subscript which is known not to have length
12584 of one. Given say:
12585 map(a[:b][2:1][:c][:2][:d][e:f][2:5])
12586 FIRST_NON_ONE will be 3, array-section-subscript [:b], [2:1] and [:c]
12587 all are or may have length of 1, array-section-subscript [:2] is the
12588 first one known not to have length 1. For array-section-subscript
12589 <= FIRST_NON_ONE we diagnose non-contiguous arrays if low bound isn't
12590 0 or length isn't the array domain max + 1, for > FIRST_NON_ONE we
12591 can if MAYBE_ZERO_LEN is false. MAYBE_ZERO_LEN will be true in the above
12592 case though, as some lengths could be zero. */
12594 static tree
12598 {
12601 {
12607 {
12611 }
12617 {
12619 {
12624 }
12626 {
12628 {
12632 }
12634 }
12635 }
12637 {
12642 else
12647 }
12650 {
12654 }
12658 {
12663 }
12667 {
12668 /* If the array section is pointer based and the pointer
12669 itself is _Atomic qualified, we need to atomically load
12670 the pointer. */
12671 c_expr expr;
12677 }
12679 }
12694 {
12697 low_bound);
12699 }
12701 {
12704 length);
12706 }
12721 {
12723 {
12728 {
12730 {
12735 }
12736 }
12737 else
12739 }
12742 first_non_one++;
12743 }
12745 {
12749 {
12751 "for unknown bound array type length expression must "
12754 }
12757 {
12762 }
12766 {
12771 }
12776 {
12777 tree size
12781 {
12783 {
12785 "low bound %qE above array section size "
12789 }
12791 {
12796 {
12801 }
12803 }
12806 && tree_int_cst_equal
12808 low_bound))
12809 first_non_one++;
12810 }
12812 {
12819 first_non_one++;
12820 }
12822 {
12824 {
12826 "length %qE above array section size "
12830 }
12832 {
12833 tree lbpluslen
12839 {
12841 "high bound %qE above array section size "
12845 }
12846 }
12847 }
12848 }
12850 {
12857 first_non_one++;
12858 }
12860 /* For [lb:] we will need to evaluate lb more than once. */
12862 {
12865 {
12868 }
12869 }
12870 }
12872 {
12874 {
12878 }
12882 {
12887 }
12888 /* If there is a pointer type anywhere but in the very first
12889 array-section-subscript, the array section can't be contiguous. */
12892 {
12897 }
12898 }
12899 else
12900 {
12904 }
12907 /* We will need to evaluate lb more than once. */
12910 {
12913 }
12916 }
12918 /* Handle array sections for clause C. */
12920 static bool
12922 {
12934 ort);
12940 {
12943 /* Need to evaluate side effects in the length expressions
12944 if any. */
12946 {
12948 {
12951 else
12954 }
12956 }
12961 }
12962 else
12963 {
12973 {
12977 i--;
12991 {
13000 {
13001 tree size;
13004 size_one_node);
13006 {
13007 do_warn_noncontiguous:
13009 "array section is not contiguous in %qs "
13013 }
13014 }
13017 {
13020 else
13024 }
13025 }
13026 else
13027 {
13028 tree l;
13038 else
13039 {
13042 size_one_node);
13045 }
13047 {
13049 size_zero_node);
13052 else
13055 }
13057 {
13065 {
13068 {
13073 }
13076 }
13081 }
13082 else
13084 }
13085 }
13091 {
13114 else
13115 {
13120 }
13123 }
13136 {
13154 }
13160 else
13179 }
13181 }
13183 /* Helper function of finish_omp_clauses. Clone STMT as if we were making
13184 an inline call. But, remap
13185 the OMP_DECL1 VAR_DECL (omp_out resp. omp_orig) to PLACEHOLDER
13186 and OMP_DECL2 VAR_DECL (omp_in resp. omp_priv) to DECL. */
13188 static tree
13191 {
13192 copy_body_data id;
13211 }
13213 /* Helper function of c_finish_omp_clauses, called via walk_tree.
13214 Find OMP_CLAUSE_PLACEHOLDER (passed in DATA) in *TP. */
13216 static tree
13218 {
13222 }
13224 /* Similarly, but also walk aggregate fields. */
13228 static tree
13230 {
13234 {
13235 tree field;
13241 {
13250 pset);
13256 }
13257 }
13262 }
13264 /* Finish OpenMP iterators ITER. Return true if they are errorneous
13265 and clauses containing them should be removed. */
13267 static bool
13269 {
13272 {
13277 tree orig_step;
13281 {
13284 }
13286 {
13288 var);
13291 }
13293 {
13297 }
13299 {
13303 }
13306 {
13309 }
13311 {
13316 }
13323 {
13330 }
13332 {
13336 }
13342 {
13345 }
13347 tree it2;
13349 {
13358 {
13363 }
13365 {
13369 }
13371 {
13375 }
13377 {
13381 }
13382 }
13384 {
13387 }
13392 }
13394 }
13396 /* For all elements of CLAUSES, validate them against their constraints.
13397 Remove any elements from the list that are invalid. */
13399 tree
13401 {
13423 /* If ort == C_ORT_OMP_DECLARE_SIMD used as uniform_head instead. */
13426 /* If ort == C_ORT_OMP used as nontemporal_head instead. */
13432 {
13435 }
13438 {
13444 {
13456 /* FALLTHRU */
13462 {
13464 {
13467 }
13470 }
13473 {
13476 }
13483 {
13489 {
13492 t);
13495 }
13499 {
13502 t);
13505 }
13515 }
13517 {
13522 }
13525 {
13526 /* Disallow zero sized or potentially zero sized task
13527 reductions. */
13529 {
13535 }
13537 {
13543 }
13544 }
13548 {
13553 {
13585 }
13587 {
13593 }
13594 }
13596 {
13601 }
13603 {
13613 {
13619 }
13629 decl_placeholder ? decl_placeholder
13637 {
13649 decl_placeholder ? decl_placeholder
13652 {
13657 }
13659 c_find_omp_placeholder_r,
13662 }
13663 else
13664 {
13665 tree init;
13669 else
13673 }
13679 }
13681 {
13685 {
13690 }
13696 }
13702 {
13704 "%<nowait%> clause must not be used together "
13708 }
13714 {
13719 }
13728 {
13730 "modifier should not be specified in %<linear%> "
13733 }
13736 {
13738 "linear clause applied to non-integral non-pointer "
13742 }
13744 {
13749 }
13751 {
13754 {
13756 /* map_head bitmap is used as uniform_head if
13757 declare_simd. */
13761 }
13763 {
13765 "%<linear%> clause step %qE is neither constant "
13769 }
13770 }
13772 {
13778 fold_convert
13783 }
13784 else
13789 check_dup_generic:
13791 check_dup_generic_t:
13793 {
13798 }
13801 {
13803 {
13806 t);
13808 }
13809 else
13811 }
13815 {
13819 }
13822 {
13826 else
13830 }
13831 else
13840 {
13844 }
13847 {
13851 }
13853 {
13857 else
13861 }
13862 else
13871 {
13875 }
13878 {
13882 }
13883 else
13890 {
13894 }
13897 {
13899 "%qE in %<aligned%> clause is neither a pointer nor "
13902 }
13904 {
13909 }
13911 {
13914 t);
13916 }
13917 else
13924 {
13928 }
13930 {
13932 "%qE appears more than once in %<nontemporal%> "
13935 }
13936 else
13943 {
13947 }
13949 {
13952 {
13955 {
13963 sizetype,
13967 {
13970 }
13972 }
13973 }
13975 }
13979 {
13981 last_iterators_remove
13987 }
13988 else
13991 {
13995 {
13997 "%<depend%> clause with %<depobj%> dependence "
14000 }
14002 }
14006 {
14008 "%qE is not lvalue expression nor array section in "
14011 }
14014 {
14018 }
14020 {
14022 {
14024 "%qE does not have %<omp_depend_t%> type in "
14025 "%<depend%> clause with %<depobj%> dependence "
14028 }
14029 }
14031 {
14033 "%qE should not have %<omp_depend_t%> type in "
14034 "%<depend%> clause with dependence type other than "
14037 }
14039 {
14044 else
14045 {
14047 RO_UNARY_STAR);
14055 else
14057 }
14058 }
14067 {
14070 else
14071 {
14074 {
14076 "array section does not have mappable type "
14080 }
14082 {
14087 }
14092 {
14098 {
14101 "%qD appears more than once in motion "
14105 "%qD appears more than once in data "
14107 else
14109 "%qD appears more than once in map "
14112 }
14113 else
14114 {
14117 }
14118 }
14119 }
14121 }
14123 {
14126 }
14130 {
14132 {
14137 }
14139 {
14144 }
14146 {
14151 }
14153 {
14156 {
14161 }
14163 }
14167 {
14170 }
14171 }
14173 {
14178 }
14180 {
14185 }
14199 {
14204 }
14208 {
14213 }
14216 {
14219 {
14223 }
14225 {
14229 else
14233 }
14234 else
14236 }
14238 {
14245 else
14249 }
14252 {
14256 else
14260 }
14261 else
14262 {
14267 }
14275 ;
14277 {
14280 "%qE is neither a variable nor a function name in "
14283 else
14288 }
14290 {
14295 }
14297 {
14302 }
14306 {
14308 "%qE appears more than once on the same "
14311 }
14312 else
14319 {
14323 else
14328 }
14329 /* map_head bitmap is used as uniform_head if declare_simd. */
14338 {
14343 }
14348 {
14350 "%<nowait%> clause must not be used together "
14354 }
14426 {
14428 "%<inbranch%> clause is incompatible with "
14432 }
14439 }
14442 {
14446 {
14450 }
14453 {
14459 {
14470 }
14472 {
14478 }
14482 {
14484 "%<const%> qualified %qE may appear only in "
14487 }
14488 }
14489 }
14493 else
14495 }
14498 && safelen
14501 {
14503 "%<simdlen%> clause value is bigger than "
14507 }
14510 && schedule_clause
14513 {
14515 "%<nonmonotonic%> schedule modifier specified together "
14521 }
14525 {
14531 {
14533 "%<linear%> clause step is a parameter %qD not "
14537 }
14541 else
14543 }
14546 {
14548 "%<nogroup%> clause must not be used together with "
14551 }
14555 }
14557 /* Return code to initialize DST with a copy constructor from SRC.
14558 C doesn't have copy constructors nor assignment operators, only for
14559 _Atomic vars we need to perform __atomic_load from src into a temporary
14560 followed by __atomic_store of the temporary to dst. */
14562 tree
14564 {
14579 /* Expansion of a generic atomic load may require an addition
14580 element, so allocate enough to prevent a resize. */
14583 /* Build __atomic_load (&src, &tmp, SEQ_CST); */
14592 /* Build __atomic_store (&dst, &tmp, SEQ_CST); */
14599 }
14601 /* Create a transaction node. */
14603 tree
14605 {
14612 }
14614 /* Make a variant type in the proper way for C/C++, propagating qualifiers
14615 down to the element type of an array. If ORIG_QUAL_TYPE is not
14616 NULL, then it should be used as the qualified type
14617 ORIG_QUAL_INDIRECT levels down in array type derivation (to
14618 preserve information about the typedef name from which an array
14619 type was derived). */
14621 tree
14624 {
14629 {
14630 tree t;
14635 /* See if we already have an identically qualified type. */
14638 else
14640 {
14647 }
14649 {
14660 {
14661 tree unqualified_canon
14666 {
14667 unqualified_canon
14670 }
14673 }
14674 else
14676 }
14678 }
14680 /* A restrict-qualified pointer type must be a pointer to object or
14681 incomplete type. Note that the use of POINTER_TYPE_P also allows
14682 REFERENCE_TYPEs, which is appropriate for C++. */
14686 {
14689 }
14692 ? orig_qual_type
14694 /* A variant type does not inherit the list of incomplete vars from the
14695 type main variant. */
14700 }
14702 /* Build a VA_ARG_EXPR for the C parser. */
14704 tree
14706 {
14709 /* VA_ARG_EXPR cannot be used for a scalar va_list with reverse storage
14710 order because it takes the address of the expression. */
14713 {
14716 }
14718 {
14722 }
14727 }
14729 /* Return truthvalue of whether T1 is the same tree structure as T2.
14730 Return 1 if they are the same. Return false if they are different. */
14732 bool
14734 {
14753 /* They might have become equal now. */
14761 {
14785 /* We need to do this when determining whether or not two
14786 non-type pointer to member function template arguments
14787 are the same. */
14791 {
14795 {
14800 }
14801 }
14815 {
14830 }
14833 {
14837 /* Special case: if either target is an unallocated VAR_DECL,
14838 it means that it's going to be unified with whatever the
14839 TARGET_EXPR is really supposed to initialize, so treat it
14840 as being equivalent to anything. */
14851 }
14868 {
14877 }
14881 }
14884 {
14892 {
14896 {
14908 }
14919 }
14925 }
14926 /* We can get here with --disable-checking. */
14928 }
14930 /* Returns true when the function declaration FNDECL is implicit,
14931 introduced as a result of a call to an otherwise undeclared
14932 function, and false otherwise. */
14934 bool
14936 {
14938 }