| blob | b0ef90a58690cc3bf4ddc7fe91847be962c3abc6 |
1 /* Build expressions with type checking for C compiler.
2 Copyright (C) 1987-2013 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. */
43 /* Possible cases of implicit bad conversions. Used to select
44 diagnostic messages in convert_for_assignment. */
46 ic_argpass,
47 ic_assign,
48 ic_init,
49 ic_return
50 };
52 /* The level of nesting inside "__alignof__". */
55 /* The level of nesting inside "sizeof". */
58 /* The level of nesting inside "typeof". */
61 /* The argument of last parsed sizeof expression, only to be tested
62 if expr.original_code == SIZEOF_EXPR. */
63 tree c_last_sizeof_arg;
65 /* Nonzero if we've already printed a "missing braces around initializer"
66 message within this initializer. */
106 \f
107 /* Return true if EXP is a null pointer constant, false otherwise. */
109 static bool
111 {
112 /* This should really operate on c_expr structures, but they aren't
113 yet available everywhere required. */
122 }
124 /* EXPR may appear in an unevaluated part of an integer constant
125 expression, but not in an evaluated part. Wrap it in a
126 C_MAYBE_CONST_EXPR, or mark it with TREE_OVERFLOW if it is just an
127 INTEGER_CST and we cannot create a C_MAYBE_CONST_EXPR. */
129 static tree
131 {
132 tree ret;
134 {
137 }
138 else
139 {
142 }
144 }
146 /* Having checked whether EXPR may appear in an unevaluated part of an
147 integer constant expression and found that it may, remove any
148 C_MAYBE_CONST_EXPR noting this fact and return the resulting
149 expression. */
153 {
156 else
158 }
164 const_tree t1;
165 const_tree t2;
166 /* The return value of tagged_types_tu_compatible_p if we had seen
167 these two types already. */
169 };
174 /* Do `exp = require_complete_type (exp);' to make sure exp
175 does not have an incomplete type. (That includes void types.) */
177 tree
179 {
185 /* First, detect a valid value with a complete type. */
191 }
193 /* Print an error message for invalid use of an incomplete type.
194 VALUE is the expression that was used (or 0 if that isn't known)
195 and TYPE is the type that was invalid. */
197 void
199 {
202 /* Avoid duplicate error message. */
209 else
210 {
211 retry:
212 /* We must print an error message. Be clever about what it says. */
215 {
234 {
236 {
239 }
242 }
248 }
253 else
254 /* If this type has a typedef-name, the TYPE_NAME is a TYPE_DECL. */
256 }
257 }
259 /* Given a type, apply default promotions wrt unnamed function
260 arguments and return the new type. */
262 tree
264 {
269 {
270 /* Preserve unsignedness if not really getting any wider. */
275 }
278 }
280 /* Return true if between two named address spaces, whether there is a superset
281 named address space that encompasses both address spaces. If there is a
282 superset, return which address space is the superset. */
284 static bool
286 {
288 {
291 }
293 {
296 }
298 {
301 }
302 else
304 }
306 /* Return a variant of TYPE which has all the type qualifiers of LIKE
307 as well as those of TYPE. */
309 static tree
311 {
314 addr_space_t as_common;
316 /* If the two named address spaces are different, determine the common
317 superset address space. If there isn't one, raise an error. */
319 {
323 }
329 }
331 /* Return true iff the given tree T is a variable length array. */
333 bool
335 {
340 }
341 \f
342 /* Return the composite type of two compatible types.
344 We assume that comptypes has already been done and returned
345 nonzero; if that isn't so, this may crash. In particular, we
346 assume that qualifiers match. */
348 tree
350 {
353 tree attributes;
355 /* Save time if the two types are the same. */
359 /* If one type is nonsense, use the other. */
368 /* Merge the attributes. */
371 /* If one is an enumerated type and the other is the compatible
372 integer type, the composite type might be either of the two
373 (DR#013 question 3). For consistency, use the enumerated type as
374 the composite type. */
384 {
386 /* For two pointers, do this recursively on the target type. */
387 {
394 }
397 {
400 tree unqual_elt;
407 /* We should not have any type quals on arrays at all. */
417 d1_variable = (!d1_zero
420 d2_variable = (!d2_zero
426 /* Save space: see if the result is identical to one of the args. */
439 /* Merge the element types, and have a size if either arg has
440 one. We may have qualifiers on the element types. To set
441 up TYPE_MAIN_VARIANT correctly, we need to form the
442 composite of the unqualified types and add the qualifiers
443 back at the end. */
448 && (d2_variable
449 || d2_zero
451 ? t1
453 /* Ensure a composite type involving a zero-length array type
454 is a zero-length type not an incomplete type. */
458 {
461 }
464 }
470 {
471 /* Try harder not to create a new aggregate type. */
476 }
480 /* Function types: prefer the one that specified arg types.
481 If both do, merge the arg types. Also merge the return types. */
482 {
490 /* Save space: see if the result is identical to one of the args. */
496 /* Simple way if one arg fails to specify argument types. */
498 {
502 }
504 {
508 }
510 /* If both args specify argument types, we must merge the two
511 lists, argument by argument. */
523 {
524 /* A null type means arg type is not specified.
525 Take whatever the other function type has. */
527 {
530 }
532 {
535 }
537 /* Given wait (union {union wait *u; int *i} *)
538 and wait (union wait *),
539 prefer union wait * as type of parm. */
542 {
543 tree memb;
550 {
556 {
562 }
563 }
564 }
567 {
568 tree memb;
575 {
581 {
587 }
588 }
589 }
591 parm_done: ;
592 }
596 /* ... falls through ... */
597 }
601 }
603 }
605 /* Return the type of a conditional expression between pointers to
606 possibly differently qualified versions of compatible types.
608 We assume that comp_target_types has already been done and returned
609 nonzero; if that isn't so, this may crash. */
611 static tree
613 {
614 tree attributes;
617 tree target;
622 /* Save time if the two types are the same. */
626 /* If one type is nonsense, use the other. */
635 /* Merge the attributes. */
638 /* Find the composite type of the target types, and combine the
639 qualifiers of the two types' targets. Do not lose qualifiers on
640 array element types by taking the TYPE_MAIN_VARIANT. */
649 /* For function types do not merge const qualifiers, but drop them
650 if used inconsistently. The middle-end uses these to mark const
651 and noreturn functions. */
657 else
660 /* If the two named address spaces are different, determine the common
661 superset address space. This is guaranteed to exist due to the
662 assumption that comp_target_type returned non-zero. */
672 }
674 /* Return the common type for two arithmetic types under the usual
675 arithmetic conversions. The default conversions have already been
676 applied, and enumerated types converted to their compatible integer
677 types. The resulting type is unqualified and has no attributes.
679 This is the type for the result of most arithmetic operations
680 if the operands have the given two types. */
682 static tree
684 {
688 /* If one type is nonsense, use the other. */
706 /* Save time if the two types are the same. */
720 /* When one operand is a decimal float type, the other operand cannot be
721 a generic float type or a complex type. We also disallow vector types
722 here. */
725 {
727 {
730 }
732 {
735 }
737 {
740 }
741 }
743 /* If one type is a vector type, return that type. (How the usual
744 arithmetic conversions apply to the vector types extension is not
745 precisely specified.) */
752 /* If one type is complex, form the common type of the non-complex
753 components, then make that complex. Use T1 or T2 if it is the
754 required type. */
756 {
765 else
767 }
769 /* If only one is real, use it as the result. */
777 /* If both are real and either are decimal floating point types, use
778 the decimal floating point type with the greater precision. */
781 {
791 }
793 /* Deal with fixed-point types. */
795 {
803 /* If one input type is saturating, the result type is saturating. */
807 /* If both fixed-point types are unsigned, the result type is unsigned.
808 When mixing fixed-point and integer types, follow the sign of the
809 fixed-point type.
810 Otherwise, the result type is signed. */
819 /* The result type is signed. */
821 {
822 /* If the input type is unsigned, we need to convert to the
823 signed type. */
825 {
831 else
834 }
836 {
842 else
845 }
846 }
849 {
852 }
853 else
854 {
856 /* Signed integers need to subtract one sign bit. */
858 }
861 {
864 }
865 else
866 {
868 /* Signed integers need to subtract one sign bit. */
870 }
875 satp);
876 }
878 /* Both real or both integers; use the one with greater precision. */
885 /* Same precision. Prefer long longs to longs to ints when the
886 same precision, following the C99 rules on integer type rank
887 (which are equivalent to the C90 rules for C90 types). */
895 {
898 else
900 }
908 {
909 /* But preserve unsignedness from the other type,
910 since long cannot hold all the values of an unsigned int. */
913 else
915 }
917 /* Likewise, prefer long double to double even if same size. */
922 /* Otherwise prefer the unsigned one. */
926 else
928 }
929 \f
930 /* Wrapper around c_common_type that is used by c-common.c and other
931 front end optimizations that remove promotions. ENUMERAL_TYPEs
932 are allowed here and are converted to their compatible integer types.
933 BOOLEAN_TYPEs are allowed here and return either boolean_type_node or
934 preferably a non-Boolean type as the common type. */
935 tree
937 {
943 /* If both types are BOOLEAN_TYPE, then return boolean_type_node. */
948 /* If either type is BOOLEAN_TYPE, then return the other. */
955 }
957 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
958 or various other operations. Return 2 if they are compatible
959 but a warning may be needed if you use them together. */
961 int
963 {
971 }
973 /* Like comptypes, but if it returns non-zero because enum and int are
974 compatible, it sets *ENUM_AND_INT_P to true. */
976 static int
978 {
986 }
988 /* Like comptypes, but if it returns nonzero for different types, it
989 sets *DIFFERENT_TYPES_P to true. */
991 int
994 {
1002 }
1003 \f
1004 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
1005 or various other operations. Return 2 if they are compatible
1006 but a warning may be needed if you use them together. If
1007 ENUM_AND_INT_P is not NULL, and one type is an enum and the other a
1008 compatible integer type, then this sets *ENUM_AND_INT_P to true;
1009 *ENUM_AND_INT_P is never set to false. If DIFFERENT_TYPES_P is not
1010 NULL, and the types are compatible but different enough not to be
1011 permitted in C11 typedef redeclarations, then this sets
1012 *DIFFERENT_TYPES_P to true; *DIFFERENT_TYPES_P is never set to
1013 false, but may or may not be set if the types are incompatible.
1014 This differs from comptypes, in that we don't free the seen
1015 types. */
1017 static int
1020 {
1025 /* Suppress errors caused by previously reported errors. */
1031 /* Enumerated types are compatible with integer types, but this is
1032 not transitive: two enumerated types in the same translation unit
1033 are compatible with each other only if they are the same type. */
1036 {
1039 {
1044 }
1045 }
1047 {
1050 {
1055 }
1056 }
1061 /* Different classes of types can't be compatible. */
1066 /* Qualifiers must match. C99 6.7.3p9 */
1071 /* Allow for two different type nodes which have essentially the same
1072 definition. Note that we already checked for equality of the type
1073 qualifiers (just above). */
1079 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1083 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1087 {
1089 /* Do not remove mode or aliasing information. */
1100 different_types_p);
1104 {
1111 /* Target types must match incl. qualifiers. */
1114 enum_and_int_p,
1115 different_types_p)))
1121 /* Sizes must match unless one is missing or variable. */
1128 d1_variable = (!d1_zero
1131 d2_variable = (!d2_zero
1150 }
1156 {
1166 different_types_p);
1168 different_types_p);
1169 }
1180 }
1182 }
1184 /* Return 1 if TTL and TTR are pointers to types that are equivalent, ignoring
1185 their qualifiers, except for named address spaces. If the pointers point to
1186 different named addresses, then we must determine if one address space is a
1187 subset of the other. */
1189 static int
1191 {
1197 addr_space_t as_common;
1200 /* Fail if pointers point to incompatible address spaces. */
1204 /* Do not lose qualifiers on element types of array types that are
1205 pointer targets by taking their TYPE_MAIN_VARIANT. */
1221 }
1222 \f
1223 /* Subroutines of `comptypes'. */
1225 /* Determine whether two trees derive from the same translation unit.
1226 If the CONTEXT chain ends in a null, that tree's context is still
1227 being parsed, so if two trees have context chains ending in null,
1228 they're in the same translation unit. */
1229 int
1231 {
1234 {
1242 }
1246 {
1254 }
1257 }
1259 /* Allocate the seen two types, assuming that they are compatible. */
1263 {
1271 /* The C standard says that two structures in different translation
1272 units are compatible with each other only if the types of their
1273 fields are compatible (among other things). We assume that they
1274 are compatible until proven otherwise when building the cache.
1275 An example where this can occur is:
1276 struct a
1277 {
1278 struct a *next;
1279 };
1280 If we are comparing this against a similar struct in another TU,
1281 and did not assume they were compatible, we end up with an infinite
1282 loop. */
1285 }
1287 /* Free the seen types until we get to TU_TIL. */
1289 static void
1291 {
1294 {
1299 }
1301 }
1303 /* Return 1 if two 'struct', 'union', or 'enum' types T1 and T2 are
1304 compatible. If the two types are not the same (which has been
1305 checked earlier), this can only happen when multiple translation
1306 units are being compiled. See C99 6.2.7 paragraph 1 for the exact
1307 rules. ENUM_AND_INT_P and DIFFERENT_TYPES_P are as in
1308 comptypes_internal. */
1310 static int
1313 {
1317 /* We have to verify that the tags of the types are the same. This
1318 is harder than it looks because this may be a typedef, so we have
1319 to go look at the original type. It may even be a typedef of a
1320 typedef...
1321 In the case of compiler-created builtin structs the TYPE_DECL
1322 may be a dummy, with no DECL_ORIGINAL_TYPE. Don't fault. */
1333 /* C90 didn't have the requirement that the two tags be the same. */
1337 /* C90 didn't say what happened if one or both of the types were
1338 incomplete; we choose to follow C99 rules here, which is that they
1339 are compatible. */
1344 {
1349 }
1352 {
1354 {
1356 /* Speed up the case where the type values are in the same order. */
1361 {
1363 }
1366 {
1370 {
1373 }
1374 }
1377 {
1379 }
1381 {
1384 }
1387 {
1390 }
1393 {
1397 {
1400 }
1401 }
1403 }
1406 {
1409 {
1412 }
1414 /* Speed up the common case where the fields are in the same order. */
1417 {
1428 {
1431 }
1438 {
1441 }
1442 }
1444 {
1447 }
1450 {
1455 {
1459 enum_and_int_p,
1460 different_types_p);
1465 {
1468 }
1479 }
1481 {
1484 }
1485 }
1488 }
1491 {
1497 {
1513 }
1516 else
1519 }
1523 }
1524 }
1526 /* Return 1 if two function types F1 and F2 are compatible.
1527 If either type specifies no argument types,
1528 the other must specify a fixed number of self-promoting arg types.
1529 Otherwise, if one type specifies only the number of arguments,
1530 the other must specify that number of self-promoting arg types.
1531 Otherwise, the argument types must match.
1532 ENUM_AND_INT_P and DIFFERENT_TYPES_P are as in comptypes_internal. */
1534 static int
1537 {
1539 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1547 /* 'volatile' qualifiers on a function's return type used to mean
1548 the function is noreturn. */
1568 /* An unspecified parmlist matches any specified parmlist
1569 whose argument types don't need default promotions. */
1572 {
1575 /* If one of these types comes from a non-prototype fn definition,
1576 compare that with the other type's arglist.
1577 If they don't match, ask for a warning (but no error). */
1583 }
1585 {
1593 }
1595 /* Both types have argument lists: compare them and propagate results. */
1597 different_types_p);
1599 }
1601 /* Check two lists of types for compatibility, returning 0 for
1602 incompatible, 1 for compatible, or 2 for compatible with
1603 warning. ENUM_AND_INT_P and DIFFERENT_TYPES_P are as in
1604 comptypes_internal. */
1606 static int
1609 {
1610 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1615 {
1619 /* If one list is shorter than the other,
1620 they fail to match. */
1629 /* A null pointer instead of a type
1630 means there is supposed to be an argument
1631 but nothing is specified about what type it has.
1632 So match anything that self-promotes. */
1637 {
1640 }
1642 {
1645 }
1646 /* If one of the lists has an error marker, ignore this arg. */
1649 ;
1651 different_types_p)))
1652 {
1655 /* Allow wait (union {union wait *u; int *i} *)
1656 and wait (union wait *) to be compatible. */
1663 {
1664 tree memb;
1667 {
1673 different_types_p))
1675 }
1678 }
1685 {
1686 tree memb;
1689 {
1695 different_types_p))
1697 }
1700 }
1701 else
1703 }
1705 /* comptypes said ok, but record if it said to warn. */
1711 }
1712 }
1713 \f
1714 /* Compute the size to increment a pointer by. */
1716 static tree
1718 {
1725 {
1728 }
1730 /* Convert in case a char is more than one unit. */
1734 }
1735 \f
1736 /* Return either DECL or its known constant value (if it has one). */
1738 tree
1740 {
1742 in a place where a variable is invalid. Note that DECL_INITIAL
1743 isn't valid for a PARM_DECL. */
1750 /* This is invalid if initial value is not constant.
1751 If it has either a function call, a memory reference,
1752 or a variable, then re-evaluating it could give different results. */
1754 /* Check for cases where this is sub-optimal, even though valid. */
1758 }
1760 /* Convert the array expression EXP to a pointer. */
1761 static tree
1763 {
1766 tree adr;
1768 tree ptrtype;
1782 /* In C++ array compound literals are temporary objects unless they are
1783 const or appear in namespace scope, so they are destroyed too soon
1784 to use them for much of anything (c++/53220). */
1786 {
1790 "converting an array compound literal to a pointer "
1792 }
1796 }
1798 /* Convert the function expression EXP to a pointer. */
1799 static tree
1801 {
1812 }
1814 /* Mark EXP as read, not just set, for set but not used -Wunused
1815 warning purposes. */
1817 void
1819 {
1821 {
1831 CASE_CONVERT:
1841 }
1842 }
1844 /* Perform the default conversion of arrays and functions to pointers.
1845 Return the result of converting EXP. For any other expression, just
1846 return EXP.
1848 LOC is the location of the expression. */
1850 struct c_expr
1852 {
1858 {
1860 {
1867 {
1871 }
1878 {
1879 /* Before C99, non-lvalue arrays do not decay to pointers.
1880 Normally, using such an array would be invalid; but it can
1881 be used correctly inside sizeof or as a statement expression.
1882 Thus, do not give an error here; an error will result later. */
1884 }
1887 }
1894 }
1897 }
1899 struct c_expr
1901 {
1904 }
1906 /* EXP is an expression of integer type. Apply the integer promotions
1907 to it and return the promoted value. */
1909 tree
1911 {
1917 /* Normally convert enums to int,
1918 but convert wide enums to something wider. */
1920 {
1928 }
1930 /* ??? This should no longer be needed now bit-fields have their
1931 proper types. */
1934 /* If it's thinner than an int, promote it like a
1935 c_promoting_integer_type_p, otherwise leave it alone. */
1941 {
1942 /* Preserve unsignedness if not really getting any wider. */
1948 }
1951 }
1954 /* Perform default promotions for C data used in expressions.
1955 Enumeral types or short or char are converted to int.
1956 In addition, manifest constants symbols are replaced by their values. */
1958 tree
1960 {
1961 tree orig_exp;
1964 tree promoted_type;
1968 /* Functions and arrays have been converted during parsing. */
1973 /* Constants can be used directly unless they're not loadable. */
1977 /* Strip no-op conversions. */
1985 {
1988 }
2002 }
2003 \f
2004 /* Look up COMPONENT in a structure or union TYPE.
2006 If the component name is not found, returns NULL_TREE. Otherwise,
2007 the return value is a TREE_LIST, with each TREE_VALUE a FIELD_DECL
2008 stepping down the chain to the component, which is in the last
2009 TREE_VALUE of the list. Normally the list is of length one, but if
2010 the component is embedded within (nested) anonymous structures or
2011 unions, the list steps down the chain to the component. */
2013 static tree
2015 {
2016 tree field;
2018 /* If TYPE_LANG_SPECIFIC is set, then it is a sorted array of pointers
2019 to the field elements. Use a binary search on this array to quickly
2020 find the element. Otherwise, do a linear search. TYPE_LANG_SPECIFIC
2021 will always be set for structures which have many elements. */
2024 {
2032 {
2037 {
2038 /* Step through all anon unions in linear fashion. */
2040 {
2044 {
2050 /* The Plan 9 compiler permits referring
2051 directly to an anonymous struct/union field
2052 using a typedef name. */
2060 }
2061 }
2063 /* Entire record is only anon unions. */
2067 /* Restart the binary search, with new lower bound. */
2069 }
2075 else
2077 }
2083 }
2084 else
2085 {
2087 {
2091 {
2097 /* The Plan 9 compiler permits referring directly to an
2098 anonymous struct/union field using a typedef
2099 name. */
2106 }
2110 }
2114 }
2117 }
2119 /* Make an expression to refer to the COMPONENT field of structure or
2120 union value DATUM. COMPONENT is an IDENTIFIER_NODE. LOC is the
2121 location of the COMPONENT_REF. */
2123 tree
2125 {
2129 tree ref;
2135 /* Detect Objective-C property syntax object.property. */
2140 /* See if there is a field or component with name COMPONENT. */
2143 {
2145 {
2148 }
2153 {
2156 }
2158 /* Chain the COMPONENT_REFs if necessary down to the FIELD.
2159 This might be better solved in future the way the C++ front
2160 end does it - by giving the anonymous entities each a
2161 separate name and type, and then have build_component_ref
2162 recursively call itself. We can't do that here. */
2163 do
2164 {
2167 tree subtype;
2173 /* If this is an rvalue, it does not have qualifiers in C
2174 standard terms and we must avoid propagating such
2175 qualifiers down to a non-lvalue array that is then
2176 converted to a pointer. */
2177 use_datum_quals = (datum_lvalue
2186 NULL_TREE);
2201 }
2205 }
2209 component);
2212 }
2213 \f
2214 /* Given an expression PTR for a pointer, return an expression
2215 for the value pointed to.
2216 ERRORSTRING is the name of the operator to appear in error messages.
2218 LOC is the location to use for the generated tree. */
2220 tree
2222 {
2225 tree ref;
2228 {
2231 {
2232 /* If a warning is issued, mark it to avoid duplicates from
2233 the backend. This only needs to be done at
2234 warn_strict_aliasing > 2. */
2239 }
2244 {
2248 }
2249 else
2250 {
2256 {
2259 }
2263 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
2264 so that we get the proper error message if the result is used
2265 to assign to. Also, &* is supposed to be a no-op.
2266 And ANSI C seems to specify that the type of the result
2267 should be the const type. */
2268 /* A de-reference of a pointer to const is not a const. It is valid
2269 to change it via some other pointer. */
2276 }
2277 }
2282 }
2284 /* This handles expressions of the form "a[i]", which denotes
2285 an array reference.
2287 This is logically equivalent in C to *(a+i), but we may do it differently.
2288 If A is a variable or a member, we generate a primitive ARRAY_REF.
2289 This avoids forcing the array out of registers, and can work on
2290 arrays that are not lvalues (for example, members of structures returned
2291 by functions).
2293 For vector types, allow vector[i] but not i[vector], and create
2294 *(((type*)&vectortype) + i) for the expression.
2296 LOC is the location to use for the returned expression. */
2298 tree
2300 {
2301 tree ret;
2309 /* Allow vector[index] but not index[vector]. */
2311 {
2312 tree temp;
2315 {
2320 }
2325 }
2328 {
2331 }
2334 {
2337 }
2339 /* ??? Existing practice has been to warn only when the char
2340 index is syntactically the index, not for char[array]. */
2344 /* Apply default promotions *after* noticing character types. */
2352 {
2355 /* An array that is indexed by a non-constant
2356 cannot be stored in a register; we must be able to do
2357 address arithmetic on its address.
2358 Likewise an array of elements of variable size. */
2362 {
2365 }
2366 /* An array that is indexed by a constant value which is not within
2367 the array bounds cannot be stored in a register either; because we
2368 would get a crash in store_bit_field/extract_bit_field when trying
2369 to access a non-existent part of the register. */
2373 {
2376 }
2379 {
2389 }
2393 /* Array ref is const/volatile if the array elements are
2394 or if the array is. */
2403 /* This was added by rms on 16 Nov 91.
2404 It fixes vol struct foo *a; a->elts[1]
2405 in an inline function.
2406 Hope it doesn't break something else. */
2411 }
2412 else
2413 {
2422 return build_indirect_ref
2424 RO_ARRAY_INDEXING);
2425 }
2426 }
2427 \f
2428 /* Build an external reference to identifier ID. FUN indicates
2429 whether this will be used for a function call. LOC is the source
2430 location of the identifier. This sets *TYPE to the type of the
2431 identifier, which is not the same as the type of the returned value
2432 for CONST_DECLs defined as enum constants. If the type of the
2433 identifier is not available, *TYPE is set to NULL. */
2434 tree
2436 {
2437 tree ref;
2440 /* In Objective-C, an instance variable (ivar) may be preferred to
2441 whatever lookup_name() found. */
2446 {
2449 }
2451 /* Implicit function declaration. */
2454 /* Don't complain about something that's already been
2455 complained about. */
2457 else
2458 {
2461 }
2469 /* Recursive call does not count as usage. */
2471 {
2473 }
2476 {
2483 }
2486 {
2492 {
2497 }
2501 }
2507 {
2512 }
2513 /* C99 6.7.4p3: An inline definition of a function with external
2514 linkage ... shall not contain a reference to an identifier with
2515 internal linkage. */
2524 csi_internal);
2527 }
2529 /* Record details of decls possibly used inside sizeof or typeof. */
2530 struct maybe_used_decl
2531 {
2532 /* The decl. */
2533 tree decl;
2534 /* The level seen at (in_sizeof + in_typeof). */
2536 /* The next one at this level or above, or NULL. */
2538 };
2542 /* Record that DECL, an undefined static function reference seen
2543 inside sizeof or typeof, might be used if the operand of sizeof is
2544 a VLA type or the operand of typeof is a variably modified
2545 type. */
2547 static void
2549 {
2555 }
2557 /* Pop the stack of decls possibly used inside sizeof or typeof. If
2558 USED is false, just discard them. If it is true, mark them used
2559 (if no longer inside sizeof or typeof) or move them to the next
2560 level up (if still inside sizeof or typeof). */
2562 void
2564 {
2568 {
2570 {
2573 else
2575 }
2577 }
2580 }
2582 /* Return the result of sizeof applied to EXPR. */
2584 struct c_expr
2586 {
2589 {
2594 }
2595 else
2596 {
2605 {
2606 /* sizeof is evaluated when given a vla (C99 6.5.3.4p2). */
2611 }
2613 }
2615 }
2617 /* Return the result of sizeof applied to T, a structure for the type
2618 name passed to sizeof (rather than the type itself). LOC is the
2619 location of the original expression. */
2621 struct c_expr
2623 {
2624 tree type;
2635 {
2636 /* If the type is a [*] array, it is a VLA but is represented as
2637 having a size of zero. In such a case we must ensure that
2638 the result of sizeof does not get folded to a constant by
2639 c_fully_fold, because if the size is evaluated the result is
2640 not constant and so constraints on zero or negative size
2641 arrays must not be applied when this sizeof call is inside
2642 another array declarator. */
2648 }
2652 }
2654 /* Build a function call to function FUNCTION with parameters PARAMS.
2655 The function call is at LOC.
2656 PARAMS is a list--a chain of TREE_LIST nodes--in which the
2657 TREE_VALUE of each node is a parameter-expression.
2658 FUNCTION's data type may be a function type or a pointer-to-function. */
2660 tree
2662 {
2664 tree ret;
2672 }
2674 /* Give a note about the location of the declaration of DECL. */
2677 {
2680 }
2682 /* Build a function call to function FUNCTION with parameters PARAMS.
2683 ORIGTYPES, if not NULL, is a vector of types; each element is
2684 either NULL or the original type of the corresponding element in
2685 PARAMS. The original type may differ from TREE_TYPE of the
2686 parameter for enums. FUNCTION's data type may be a function type
2687 or pointer-to-function. This function changes the elements of
2688 PARAMS. */
2690 tree
2694 {
2697 tree tem;
2702 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
2705 /* Convert anything with function type to a pointer-to-function. */
2707 {
2708 /* Implement type-directed function overloading for builtins.
2709 resolve_overloaded_builtin and targetm.resolve_overloaded_builtin
2710 handle all the type checking. The result is a complete expression
2711 that implements this function call. */
2721 /* Atomic functions have type checking/casting already done. They are
2722 often rewritten and don't match the original parameter list. */
2725 }
2729 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
2730 expressions, like those used for ObjC messenger dispatches. */
2743 {
2747 function);
2749 {
2752 function);
2754 }
2755 else
2759 }
2764 /* fntype now gets the type of function pointed to. */
2767 /* Convert the parameters to the types declared in the
2768 function prototype, or apply default promotions. */
2775 /* Check that the function is called through a compatible prototype.
2776 If it is not, replace the call by a trap, wrapped up in a compound
2777 expression if necessary. This has the nice side-effect to prevent
2778 the tree-inliner from generating invalid assignment trees which may
2779 blow up in the RTL expander later. */
2784 {
2788 NULL_TREE);
2791 /* This situation leads to run-time undefined behavior. We can't,
2792 therefore, simply error unless we can prove that all possible
2793 executions of the program must execute the code. */
2795 /* We can, however, treat "undefined" any way we please.
2796 Call abort to encourage the user to fix the program. */
2798 /* Before the abort, allow the function arguments to exit or
2799 call longjmp. */
2804 {
2809 }
2810 else
2811 {
2812 tree rhs;
2817 NULL),
2819 else
2824 }
2825 }
2829 /* Check that arguments to builtin functions match the expectations. */
2836 /* Check that the arguments to the function are valid. */
2841 {
2843 result =
2846 else
2852 }
2853 else
2858 {
2863 }
2865 }
2866 \f
2867 /* Convert the argument expressions in the vector VALUES
2868 to the types in the list TYPELIST.
2870 If TYPELIST is exhausted, or when an element has NULL as its type,
2871 perform the default conversions.
2873 ORIGTYPES is the original types of the expressions in VALUES. This
2874 holds the type of enum values which have been converted to integral
2875 types. It may be NULL.
2877 FUNCTION is a tree for the called function. It is used only for
2878 error messages, where it is formatted with %qE.
2880 This is also where warnings about wrong number of args are generated.
2882 Returns the actual number of arguments processed (which may be less
2883 than the length of VALUES in some error situations), or -1 on
2884 failure. */
2886 static int
2889 {
2896 tree selector;
2898 /* Change pointer to function to the function itself for
2899 diagnostics. */
2904 /* Handle an ObjC selector specially for diagnostics. */
2907 /* For type-generic built-in functions, determine whether excess
2908 precision should be removed (classification) or not
2909 (comparison). */
2913 {
2915 {
2928 }
2929 }
2931 /* Scan the given expressions and types, producing individual
2932 converted arguments. */
2937 {
2945 tree parmval;
2948 {
2952 else
2957 }
2960 {
2963 }
2967 /* If there is excess precision and a prototype, convert once to
2968 the required type rather than converting via the semantic
2969 type. Likewise without a prototype a float value represented
2970 as long double should be converted once to double. But for
2971 type-generic classification functions excess precision must
2972 be removed here. */
2975 {
2978 }
2985 {
2986 /* Formal parm type is specified by a function prototype. */
2989 {
2992 }
2993 else
2994 {
2995 tree origtype;
2997 /* Optionally warn about conversions that
2998 differ from the default conversions. */
3000 {
3033 /* ??? At some point, messages should be written about
3034 conversions between complex types, but that's too messy
3035 to do now. */
3038 {
3039 /* Warn if any argument is passed as `float',
3040 since without a prototype it would be `double'. */
3047 /* Warn if mismatch between argument and prototype
3048 for decimal float types. Warn of conversions with
3049 binary float types and of precision narrowing due to
3050 prototype. */
3058 && (formal_prec
3061 && (valtype
3062 != dfloat64_type_node
3063 && (valtype
3066 && (valtype
3072 }
3073 /* Detect integer changing in width or signedness.
3074 These warnings are only activated with
3075 -Wtraditional-conversion, not with -Wtraditional. */
3078 {
3085 /* No warning if function asks for enum
3086 and the actual arg is that enum type. */
3087 ;
3090 "passing argument %d of %qE "
3094 ;
3095 /* Don't complain if the formal parameter type
3096 is an enum, because we can't tell now whether
3097 the value was an enum--even the same enum. */
3099 ;
3102 /* Change in signedness doesn't matter
3103 if a constant value is unaffected. */
3104 ;
3105 /* If the value is extended from a narrower
3106 unsigned type, it doesn't matter whether we
3107 pass it as signed or unsigned; the value
3108 certainly is the same either way. */
3111 ;
3114 "passing argument %d of %qE "
3117 else
3119 "passing argument %d of %qE "
3121 }
3122 }
3124 /* Possibly restore an EXCESS_PRECISION_EXPR for the
3125 sake of better warnings from convert_and_check. */
3138 }
3139 }
3144 {
3147 else
3148 {
3149 /* Convert `float' to `double'. */
3152 "implicit conversion from %qT to %qT when passing "
3156 }
3157 }
3159 /* A "double" argument with excess precision being passed
3160 without a prototype or in variable arguments. */
3164 {
3167 }
3168 else
3169 /* Convert `short' and `char' to full-size `int'. */
3178 }
3183 {
3188 }
3191 }
3192 \f
3193 /* This is the entry point used by the parser to build unary operators
3194 in the input. CODE, a tree_code, specifies the unary operator, and
3195 ARG is the operand. For unary plus, the C parser currently uses
3196 CONVERT_EXPR for code.
3198 LOC is the location to use for the tree generated.
3199 */
3201 struct c_expr
3203 {
3214 }
3216 /* This is the entry point used by the parser to build binary operators
3217 in the input. CODE, a tree_code, specifies the binary operator, and
3218 ARG1 and ARG2 are the operands. In addition to constructing the
3219 expression, we check for operands that were written with other binary
3220 operators in a way that is likely to confuse the user.
3222 LOCATION is the location of the binary operator. */
3224 struct c_expr
3227 {
3250 /* Check for cases such as x+y<<z which users are likely
3251 to misinterpret. */
3260 /* Warn about comparisons against string literals, with the exception
3261 of testing for equality or inequality of a string literal with NULL. */
3263 {
3268 }
3279 /* Warn about comparisons of different enum types. */
3290 }
3291 \f
3292 /* Return a tree for the difference of pointers OP0 and OP1.
3293 The resulting tree has type int. */
3295 static tree
3297 {
3307 /* If the operands point into different address spaces, we need to
3308 explicitly convert them to pointers into the common address space
3309 before we can subtract the numerical address values. */
3311 {
3312 addr_space_t as_common;
3313 tree common_type;
3315 /* Determine the common superset address space. This is guaranteed
3316 to exist because the caller verified that comp_target_types
3317 returned non-zero. */
3324 }
3326 /* Determine integer type to perform computations in. This will usually
3327 be the same as the result type (ptrdiff_t), but may need to be a wider
3328 type if pointers for the address space are wider than ptrdiff_t. */
3331 else
3342 /* If the conversion to ptrdiff_type does anything like widening or
3343 converting a partial to an integral mode, we get a convert_expression
3344 that is in the way to do any simplifications.
3345 (fold-const.c doesn't know that the extra bits won't be needed.
3346 split_tree uses STRIP_SIGN_NOPS, which leaves conversions to a
3347 different mode in place.)
3348 So first try to find a common term here 'by hand'; we want to cover
3349 at least the cases that occur in legal static initializers. */
3354 else
3360 else
3364 {
3367 }
3368 else
3372 {
3375 }
3376 else
3380 {
3383 }
3386 /* First do the subtraction as integers;
3387 then drop through to build the divide operator.
3388 Do not do default conversions on the minus operator
3389 in case restype is a short type. */
3394 /* This generates an error if op1 is pointer to incomplete type. */
3398 /* This generates an error if op0 is pointer to incomplete type. */
3401 /* Divide by the size, in easiest possible way. */
3405 /* Convert to final result type if necessary. */
3407 }
3408 \f
3409 /* Construct and perhaps optimize a tree representation
3410 for a unary operation. CODE, a tree_code, specifies the operation
3411 and XARG is the operand.
3412 For any CODE other than ADDR_EXPR, FLAG nonzero suppresses
3413 the default promotions (such as from short to int).
3414 For ADDR_EXPR, the default promotions are not applied; FLAG nonzero
3415 allows non-lvalues; this is only used to handle conversion of non-lvalue
3416 arrays to pointers in C99.
3418 LOCATION is the location of the operator. */
3420 tree
3423 {
3424 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
3428 tree val;
3450 {
3453 }
3456 {
3459 }
3462 {
3464 /* This is used for unary plus, because a CONVERT_EXPR
3465 is enough to prevent anybody from looking inside for
3466 associativity, but won't generate any code. */
3470 {
3473 }
3483 {
3486 }
3492 /* ~ works on integer types and non float vectors. */
3496 {
3499 }
3501 {
3507 }
3508 else
3509 {
3512 }
3517 {
3520 }
3526 /* Conjugating a real value is a no-op, but allow it anyway. */
3529 {
3532 }
3541 {
3545 }
3547 {
3550 }
3551 else
3554 /* If the TRUTH_NOT_EXPR has been folded, reset the location. */
3574 {
3584 }
3586 /* Complain about anything that is not a true lvalue. In
3587 Objective-C, skip this check for property_refs. */
3592 ? lv_increment
3597 {
3601 else
3604 }
3606 /* Ensure the argument is fully folded inside any SAVE_EXPR. */
3609 /* Increment or decrement the real part of the value,
3610 and don't change the imaginary part. */
3612 {
3627 }
3629 /* Report invalid types. */
3634 {
3637 else
3641 }
3643 {
3644 tree inc;
3648 /* Compute the increment. */
3651 {
3652 /* If pointer target is an undefined struct,
3653 we just cannot know how to do the arithmetic. */
3655 {
3659 else
3662 }
3665 {
3669 else
3672 }
3676 }
3678 {
3679 /* For signed fract types, we invert ++ to -- or
3680 -- to ++, and change inc from 1 to -1, because
3681 it is not possible to represent 1 in signed fract constants.
3682 For unsigned fract types, the result always overflows and
3683 we get an undefined (original) or the maximum value. */
3695 }
3696 else
3697 {
3702 }
3704 /* If 'arg' is an Objective-C PROPERTY_REF expression, then we
3705 need to ask Objective-C to build the increment or decrement
3706 expression for it. */
3711 /* Report a read-only lvalue. */
3713 {
3719 }
3728 else
3735 }
3738 /* Note that this operation never does default_conversion. */
3740 /* The operand of unary '&' must be an lvalue (which excludes
3741 expressions of type void), or, in C99, the result of a [] or
3742 unary '*' operator. */
3749 /* Let &* cancel out to simplify resulting code. */
3751 {
3752 /* Don't let this be an lvalue. */
3757 }
3759 /* For &x[y], return x+y */
3761 {
3765 }
3767 /* Anything not already handled and not a true memory reference
3768 or a non-lvalue array is an error. */
3773 /* Move address operations inside C_MAYBE_CONST_EXPR to simplify
3774 folding later. */
3776 {
3785 }
3787 /* Ordinary case; arg is a COMPONENT_REF or a decl. */
3790 /* If the lvalue is const or volatile, merge that into the type
3791 to which the address will point. This is only needed
3792 for function types. */
3796 {
3806 }
3816 /* ??? Cope with user tricks that amount to offsetof. Delete this
3817 when we have proper support for integer constant expressions. */
3821 {
3824 }
3833 }
3838 ret = (require_constant_value
3841 else
3843 return_build_unary_op:
3854 }
3856 /* Return nonzero if REF is an lvalue valid for this language.
3857 Lvalues can be assigned, unless their type has TYPE_READONLY.
3858 Lvalues can have their address taken, unless they have C_DECL_REGISTER. */
3860 bool
3862 {
3866 {
3893 }
3894 }
3895 \f
3896 /* Give a warning for storing in something that is read-only in GCC
3897 terms but not const in ISO C terms. */
3899 static void
3901 {
3903 {
3915 }
3917 }
3920 /* Return nonzero if REF is an lvalue valid for this language;
3921 otherwise, print an error message and return zero. USE says
3922 how the lvalue is being used and so selects the error message.
3923 LOCATION is the location at which any error should be reported. */
3925 static int
3927 {
3934 }
3935 \f
3936 /* Mark EXP saying that we need to be able to take the
3937 address of it; it should not be allocated in a register.
3938 Returns true if successful. */
3940 bool
3942 {
3947 {
3950 {
3951 error
3954 }
3956 /* ... fall through ... */
3976 {
3978 {
3979 error
3982 }
3984 }
3986 {
3989 else
3992 }
3994 /* drops in */
3997 /* drops out */
4000 }
4001 }
4002 \f
4003 /* Convert EXPR to TYPE, warning about conversion problems with
4004 constants. SEMANTIC_TYPE is the type this conversion would use
4005 without excess precision. If SEMANTIC_TYPE is NULL, this function
4006 is equivalent to convert_and_check. This function is a wrapper that
4007 handles conversions that may be different than
4008 the usual ones because of excess precision. */
4010 static tree
4012 {
4021 {
4022 /* For integers, we need to check the real conversion, not
4023 the conversion to the excess precision type. */
4025 }
4026 /* Result type is the excess precision type, which should be
4027 large enough, so do not check. */
4029 }
4031 /* Build and return a conditional expression IFEXP ? OP1 : OP2. If
4032 IFEXP_BCP then the condition is a call to __builtin_constant_p, and
4033 if folded to an integer constant then the unselected half may
4034 contain arbitrary operations not normally permitted in constant
4035 expressions. Set the location of the expression to LOC. */
4037 tree
4040 tree op2_original_type)
4041 {
4042 tree type1;
4043 tree type2;
4051 tree ret;
4063 /* Promote both alternatives. */
4080 /* C90 does not permit non-lvalue arrays in conditional expressions.
4081 In C99 they will be pointers by now. */
4083 {
4086 }
4094 {
4097 {
4101 }
4103 {
4107 }
4108 }
4111 {
4122 }
4124 /* Quickly detect the usual case where op1 and op2 have the same type
4125 after promotion. */
4127 {
4130 else
4132 }
4137 {
4140 "implicit conversion from %qT to %qT to "
4142 colon_loc);
4144 /* If -Wsign-compare, warn here if type1 and type2 have
4145 different signedness. We'll promote the signed to unsigned
4146 and later code won't know it used to be different.
4147 Do this check on the original types, so that explicit casts
4148 will be considered, but default promotions won't. */
4150 {
4155 {
4158 /* Do not warn if the result type is signed, since the
4159 signed type will only be chosen if it can represent
4160 all the values of the unsigned type. */
4163 else
4164 {
4168 /* Do not warn if the signed quantity is an
4169 unsuffixed integer literal (or some static
4170 constant expression involving such literals) and
4171 it is non-negative. This warning requires the
4172 operands to be folded for best results, so do
4173 that folding in this case even without
4174 warn_sign_compare to avoid warning options
4175 possibly affecting code generation. */
4176 c_inhibit_evaluation_warnings
4180 c_inhibit_evaluation_warnings
4183 c_inhibit_evaluation_warnings
4187 c_inhibit_evaluation_warnings
4191 {
4194 || (unsigned_op1
4197 else
4201 }
4206 }
4207 }
4208 }
4209 }
4211 {
4216 }
4218 {
4221 addr_space_t as_common;
4230 {
4234 }
4236 {
4239 "ISO C forbids conditional expr between "
4243 }
4245 {
4248 "ISO C forbids conditional expr between "
4252 }
4253 /* Objective-C pointer comparisons are a bit more lenient. */
4256 else
4257 {
4262 result_type = build_pointer_type
4264 }
4265 }
4267 {
4271 else
4272 {
4274 }
4276 }
4278 {
4282 else
4283 {
4285 }
4287 }
4290 {
4293 else
4294 {
4297 }
4298 }
4300 /* Merge const and volatile flags of the incoming types. */
4301 result_type
4310 {
4313 }
4315 {
4318 }
4320 && op1_int_operands
4323 {
4330 }
4333 else
4334 {
4336 {
4337 /* Use c_fully_fold here, since C_MAYBE_CONST_EXPR might be
4338 nested inside of the expression. */
4341 }
4345 }
4351 }
4352 \f
4353 /* Return a compound expression that performs two expressions and
4354 returns the value of the second of them.
4356 LOC is the location of the COMPOUND_EXPR. */
4358 tree
4360 {
4363 tree ret;
4375 {
4378 }
4381 {
4382 /* The left-hand operand of a comma expression is like an expression
4383 statement: with -Wunused, we should warn if it doesn't have
4384 any side-effects, unless it was explicitly cast to (void). */
4386 {
4394 else
4397 }
4398 }
4400 /* With -Wunused, we should also warn if the left-hand operand does have
4401 side-effects, but computes a value which is not used. For example, in
4402 `foo() + bar(), baz()' the result of the `+' operator is not used,
4403 so we should issue a warning. */
4413 && expr1_int_operands
4422 }
4424 /* Issue -Wcast-qual warnings when appropriate. TYPE is the type to
4425 which we are casting. OTYPE is the type of the expression being
4426 cast. Both TYPE and OTYPE are pointer types. LOC is the location
4427 of the cast. -Wcast-qual appeared on the command line. Named
4428 address space qualifiers are not handled here, because they result
4429 in different warnings. */
4431 static void
4433 {
4440 /* Check that the qualifiers on IN_TYPE are a superset of the
4441 qualifiers of IN_OTYPE. The outermost level of POINTER_TYPE
4442 nodes is uninteresting and we stop as soon as we hit a
4443 non-POINTER_TYPE node on either type. */
4444 do
4445 {
4449 /* GNU C allows cv-qualified function types. 'const' means the
4450 function is very pure, 'volatile' means it can't return. We
4451 need to warn when such qualifiers are added, not when they're
4452 taken away. */
4457 else
4460 }
4469 /* There are qualifiers present in IN_OTYPE that are not present
4470 in IN_TYPE. */
4473 discarded);
4478 /* A cast from **T to const **T is unsafe, because it can cause a
4479 const value to be changed with no additional warning. We only
4480 issue this warning if T is the same on both sides, and we only
4481 issue the warning if there are the same number of pointers on
4482 both sides, as otherwise the cast is clearly unsafe anyhow. A
4483 cast is unsafe when a qualifier is added at one level and const
4484 is not present at all outer levels.
4486 To issue this warning, we check at each level whether the cast
4487 adds new qualifiers not already seen. We don't need to special
4488 case function types, as they won't have the same
4489 TYPE_MAIN_VARIANT. */
4499 do
4500 {
4505 {
4507 "to be safe all intermediate pointers in cast from "
4511 }
4514 }
4516 }
4518 /* Build an expression representing a cast to type TYPE of expression EXPR.
4519 LOC is the location of the cast-- typically the open paren of the cast. */
4521 tree
4523 {
4524 tree value;
4534 /* The ObjC front-end uses TYPE_MAIN_VARIANT to tie together types differing
4535 only in <protocol> qualifications. But when constructing cast expressions,
4536 the protocols do matter and must be kept around. */
4543 {
4546 }
4549 {
4552 }
4555 {
4559 }
4562 {
4567 }
4569 {
4570 tree field;
4579 {
4580 tree t;
4592 }
4595 }
4596 else
4597 {
4601 {
4605 }
4609 /* Optionally warn about potentially worrisome casts. */
4615 /* Warn about conversions between pointers to disjoint
4616 address spaces. */
4620 {
4623 addr_space_t as_common;
4626 {
4637 else
4642 }
4643 }
4645 /* Warn about possible alignment problems. */
4651 /* Don't warn about opaque types, where the actual alignment
4652 restriction is unknown. */
4663 /* Unlike conversion of integers to pointers, where the
4664 warning is disabled for converting constants because
4665 of cases such as SIG_*, warn about converting constant
4666 pointers to integers. In some cases it may cause unwanted
4667 sign extension, and a warning is appropriate. */
4674 "cast from function call of type %qT "
4680 /* Don't warn about converting any constant. */
4689 /* If pedantic, warn for conversions between function and object
4690 pointer types, except for converting a null pointer constant
4691 to function pointer type. */
4712 /* Ignore any integer overflow caused by the cast. */
4714 {
4716 {
4718 {
4719 /* Avoid clobbering a shared constant. */
4722 }
4723 }
4725 /* Reset VALUE's overflow flags, ensuring constant sharing. */
4729 }
4730 }
4732 /* Don't let a cast be an lvalue. */
4736 /* Don't allow the results of casting to floating-point or complex
4737 types be confused with actual constants, or casts involving
4738 integer and pointer types other than direct integer-to-integer
4739 and integer-to-pointer be confused with integer constant
4740 expressions and null pointer constants. */
4753 }
4755 /* Interpret a cast of expression EXPR to type TYPE. LOC is the
4756 location of the open paren of the cast, or the position of the cast
4757 expr. */
4758 tree
4760 {
4761 tree type;
4764 tree ret;
4767 /* This avoids warnings about unprototyped casts on
4768 integers. E.g. "#define SIG_DFL (void(*)())0". */
4776 {
4783 }
4788 /* C++ does not permits types to be defined in a cast, but it
4789 allows references to incomplete types. */
4795 }
4796 \f
4797 /* Build an assignment expression of lvalue LHS from value RHS.
4798 If LHS_ORIGTYPE is not NULL, it is the original type of LHS, which
4799 may differ from TREE_TYPE (LHS) for an enum bitfield.
4800 MODIFYCODE is the code for a binary operator that we use
4801 to combine the old value of LHS with RHS to get the new value.
4802 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
4803 If RHS_ORIGTYPE is not NULL_TREE, it is the original type of RHS,
4804 which may differ from TREE_TYPE (RHS) for an enum value.
4806 LOCATION is the location of the MODIFYCODE operator.
4807 RHS_LOC is the location of the RHS. */
4809 tree
4813 {
4814 tree result;
4815 tree newrhs;
4821 /* Types that aren't fully specified cannot be used in assignments. */
4824 /* Avoid duplicate error messages from operands that had errors. */
4828 /* For ObjC properties, defer this check. */
4833 {
4836 }
4841 {
4844 rhs_origtype);
4853 }
4855 /* If a binary op has been requested, combine the old LHS value with the RHS
4856 producing the value we should actually store into the LHS. */
4859 {
4865 /* The original type of the right hand side is no longer
4866 meaningful. */
4868 }
4871 {
4872 /* Check if we are modifying an Objective-C property reference;
4873 if so, we need to generate setter calls. */
4878 /* Else, do the check that we postponed for Objective-C. */
4881 }
4883 /* Give an error for storing in something that is 'const'. */
4889 {
4892 }
4896 /* If storing into a structure or union member,
4897 it has probably been given type `int'.
4898 Compute the type that would go with
4899 the actual amount of storage the member occupies. */
4908 /* If storing in a field that is in actuality a short or narrower than one,
4909 we must store in the field in its actual type. */
4912 {
4915 }
4917 /* Issue -Wc++-compat warnings about an assignment to an enum type
4918 when LHS does not have its original type. This happens for,
4919 e.g., an enum bitfield in a struct. */
4924 {
4926 ? rhs_origtype
4932 }
4934 /* Convert new value to destination type. Fold it first, then
4935 restore any excess precision information, for the sake of
4936 conversion warnings. */
4947 /* Emit ObjC write barrier, if necessary. */
4949 {
4952 {
4955 }
4956 }
4958 /* Scan operands. */
4964 /* If we got the LHS in a different type for storing in,
4965 convert the result back to the nominal type of LHS
4966 so that the value we return always has the same type
4967 as the LHS argument. */
4976 }
4977 \f
4978 /* Return whether STRUCT_TYPE has an anonymous field with type TYPE.
4979 This is used to implement -fplan9-extensions. */
4981 static bool
4983 {
4984 tree field;
4993 {
4996 {
5000 }
5005 {
5009 }
5010 }
5012 }
5014 /* RHS is an expression whose type is pointer to struct. If there is
5015 an anonymous field in RHS with type TYPE, then return a pointer to
5016 that field in RHS. This is used with -fplan9-extensions. This
5017 returns NULL if no conversion could be found. */
5019 static tree
5021 {
5025 tree ret;
5040 {
5046 {
5050 }
5052 lhs_main_type))
5053 {
5058 }
5059 }
5066 NULL_TREE);
5070 {
5073 }
5076 }
5078 /* Convert value RHS to type TYPE as preparation for an assignment to
5079 an lvalue of type TYPE. If ORIGTYPE is not NULL_TREE, it is the
5080 original type of RHS; this differs from TREE_TYPE (RHS) for enum
5081 types. NULL_POINTER_CONSTANT says whether RHS was a null pointer
5082 constant before any folding.
5083 The real work of conversion is done by `convert'.
5084 The purpose of this function is to generate error messages
5085 for assignments that are not allowed in C.
5086 ERRTYPE says whether it is argument passing, assignment,
5087 initialization or return.
5089 LOCATION is the location of the RHS.
5090 FUNCTION is a tree for the function being called.
5091 PARMNUM is the number of the argument, for printing in error messages. */
5093 static tree
5098 {
5101 tree rhstype;
5107 {
5108 tree selector;
5109 /* Change pointer to function to the function itself for
5110 diagnostics. */
5115 /* Handle an ObjC selector specially for diagnostics. */
5119 {
5122 }
5123 }
5125 /* This macro is used to emit diagnostics to ensure that all format
5126 strings are complete sentences, visible to gettext and checked at
5127 compile time. */
5128 #define WARN_FOR_ASSIGNMENT(LOCATION, OPT, AR, AS, IN, RE) \
5129 do { \
5130 switch (errtype) \
5131 { \
5132 case ic_argpass: \
5133 if (pedwarn (LOCATION, OPT, AR, parmnum, rname)) \
5134 inform ((fundecl && !DECL_IS_BUILTIN (fundecl)) \
5135 ? DECL_SOURCE_LOCATION (fundecl) : LOCATION, \
5137 type, rhstype); \
5138 break; \
5139 case ic_assign: \
5140 pedwarn (LOCATION, OPT, AS); \
5141 break; \
5142 case ic_init: \
5143 pedwarn_init (LOCATION, OPT, IN); \
5144 break; \
5145 case ic_return: \
5146 pedwarn (LOCATION, OPT, RE); \
5147 break; \
5148 default: \
5149 gcc_unreachable (); \
5150 } \
5151 } while (0)
5153 /* This macro is used to emit diagnostics to ensure that all format
5154 strings are complete sentences, visible to gettext and checked at
5155 compile time. It is the same as WARN_FOR_ASSIGNMENT but with an
5156 extra parameter to enumerate qualifiers. */
5158 #define WARN_FOR_QUALIFIERS(LOCATION, OPT, AR, AS, IN, RE, QUALS) \
5159 do { \
5160 switch (errtype) \
5161 { \
5162 case ic_argpass: \
5163 if (pedwarn (LOCATION, OPT, AR, parmnum, rname, QUALS)) \
5164 inform ((fundecl && !DECL_IS_BUILTIN (fundecl)) \
5165 ? DECL_SOURCE_LOCATION (fundecl) : LOCATION, \
5167 type, rhstype); \
5168 break; \
5169 case ic_assign: \
5170 pedwarn (LOCATION, OPT, AS, QUALS); \
5171 break; \
5172 case ic_init: \
5173 pedwarn (LOCATION, OPT, IN, QUALS); \
5174 break; \
5175 case ic_return: \
5176 pedwarn (LOCATION, OPT, RE, QUALS); \
5177 break; \
5178 default: \
5179 gcc_unreachable (); \
5180 } \
5181 } while (0)
5193 {
5197 {
5213 }
5216 }
5219 {
5224 {
5234 }
5235 }
5241 {
5242 /* Except for passing an argument to an unprototyped function,
5243 this is a constraint violation. When passing an argument to
5244 an unprototyped function, it is compile-time undefined;
5245 making it a constraint in that case was rejected in
5246 DR#252. */
5249 }
5253 /* A type converts to a reference to it.
5254 This code doesn't fully support references, it's just for the
5255 special case of va_start and va_copy. */
5258 {
5260 {
5263 }
5269 /* We already know that these two types are compatible, but they
5270 may not be exactly identical. In fact, `TREE_TYPE (type)' is
5271 likely to be __builtin_va_list and `TREE_TYPE (rhs)' is
5272 likely to be va_list, a typedef to __builtin_va_list, which
5273 is different enough that it will cause problems later. */
5275 {
5278 }
5283 }
5284 /* Some types can interconvert without explicit casts. */
5288 /* Arithmetic types all interconvert, and enum is treated like int. */
5297 {
5298 tree ret;
5306 }
5308 /* Aggregates in different TUs might need conversion. */
5314 /* Conversion to a transparent union or record from its member types.
5315 This applies only to function arguments. */
5319 {
5323 {
5334 {
5338 /* Any non-function converts to a [const][volatile] void *
5339 and vice versa; otherwise, targets must be the same.
5340 Meanwhile, the lhs target must have all the qualifiers of
5341 the rhs. */
5344 {
5345 /* If this type won't generate any warnings, use it. */
5355 /* Keep looking for a better type, but remember this one. */
5358 }
5359 }
5361 /* Can convert integer zero to any pointer type. */
5363 {
5366 }
5367 }
5370 {
5372 {
5373 /* We have only a marginally acceptable member type;
5374 it needs a warning. */
5378 /* Const and volatile mean something different for function
5379 types, so the usual warnings are not appropriate. */
5382 {
5383 /* Because const and volatile on functions are
5384 restrictions that say the function will not do
5385 certain things, it is okay to use a const or volatile
5386 function where an ordinary one is wanted, but not
5387 vice-versa. */
5392 "makes %q#v qualified function "
5395 "function pointer from "
5398 "function pointer from "
5403 }
5418 }
5426 }
5427 }
5429 /* Conversions among pointers */
5432 {
5439 addr_space_t asl;
5440 addr_space_t asr;
5446 /* Opaque pointers are treated like void pointers. */
5449 /* The Plan 9 compiler permits a pointer to a struct to be
5450 automatically converted into a pointer to an anonymous field
5451 within the struct. */
5456 {
5459 {
5465 }
5466 }
5468 /* C++ does not allow the implicit conversion void* -> T*. However,
5469 for the purpose of reducing the number of false positives, we
5470 tolerate the special case of
5472 int *p = NULL;
5474 where NULL is typically defined in C to be '(void *) 0'. */
5477 "request for implicit conversion "
5480 /* See if the pointers point to incompatible address spaces. */
5485 {
5487 {
5506 }
5508 }
5510 /* Check if the right-hand side has a format attribute but the
5511 left-hand side doesn't. */
5514 {
5516 {
5519 "argument %d of %qE might be "
5525 "assignment left-hand side might be "
5530 "initialization left-hand side might be "
5535 "return type might be "
5540 }
5541 }
5543 /* Any non-function converts to a [const][volatile] void *
5544 and vice versa; otherwise, targets must be the same.
5545 Meanwhile, the lhs target must have all the qualifiers of the rhs. */
5548 || is_opaque_pointer
5553 {
5556 ||
5558 && !null_pointer_constant
5562 "%qE between function pointer "
5570 /* Const and volatile mean something different for function types,
5571 so the usual warnings are not appropriate. */
5574 {
5577 {
5588 }
5589 /* If this is not a case of ignoring a mismatch in signedness,
5590 no warning. */
5593 ;
5594 /* If there is a mismatch, do warn. */
5605 }
5608 {
5609 /* Because const and volatile on functions are restrictions
5610 that say the function will not do certain things,
5611 it is okay to use a const or volatile function
5612 where an ordinary one is wanted, but not vice-versa. */
5617 "%q#v qualified function pointer "
5626 }
5627 }
5628 else
5629 /* Avoid warning about the volatile ObjC EH puts on decls. */
5640 }
5642 {
5643 /* ??? This should not be an error when inlining calls to
5644 unprototyped functions. */
5647 }
5649 {
5650 /* An explicit constant 0 can convert to a pointer,
5651 or one that results from arithmetic, even including
5652 a cast to integer type. */
5665 }
5667 {
5678 }
5680 {
5681 tree ret;
5687 }
5690 {
5708 "incompatible types when returning type %qT but %qT was "
5713 }
5716 }
5717 \f
5718 /* If VALUE is a compound expr all of whose expressions are constant, then
5719 return its value. Otherwise, return error_mark_node.
5721 This is for handling COMPOUND_EXPRs as initializer elements
5722 which is allowed with a warning when -pedantic is specified. */
5724 static tree
5726 {
5728 {
5733 endtype);
5734 }
5737 else
5739 }
5740 \f
5741 /* Perform appropriate conversions on the initial value of a variable,
5742 store it in the declaration DECL,
5743 and print any error messages that are appropriate.
5744 If ORIGTYPE is not NULL_TREE, it is the original type of INIT.
5745 If the init is invalid, store an ERROR_MARK.
5747 INIT_LOC is the location of the initial value. */
5749 void
5751 {
5755 /* If variable's type was invalidly declared, just ignore it. */
5761 /* Digest the specified initializer into an expression. */
5768 /* Store the expression if valid; else report error. */
5777 /* ANSI wants warnings about out-of-range constant initializers. */
5782 /* Check if we need to set array size from compound literal size. */
5786 {
5793 {
5797 {
5798 /* For int foo[] = (int [3]){1}; we need to set array size
5799 now since later on array initializer will be just the
5800 brace enclosed list of the compound literal. */
5808 }
5809 }
5810 }
5811 }
5812 \f
5813 /* Methods for storing and printing names for error messages. */
5815 /* Implement a spelling stack that allows components of a name to be pushed
5816 and popped. Each element on the stack is this structure. */
5818 struct spelling
5819 {
5821 union
5822 {
5826 };
5828 #define SPELLING_STRING 1
5829 #define SPELLING_MEMBER 2
5830 #define SPELLING_BOUNDS 3
5836 /* Macros to save and restore the spelling stack around push_... functions.
5837 Alternative to SAVE_SPELLING_STACK. */
5839 #define SPELLING_DEPTH() (spelling - spelling_base)
5840 #define RESTORE_SPELLING_DEPTH(DEPTH) (spelling = spelling_base + (DEPTH))
5842 /* Push an element on the spelling stack with type KIND and assign VALUE
5843 to MEMBER. */
5845 #define PUSH_SPELLING(KIND, VALUE, MEMBER) \
5846 { \
5847 int depth = SPELLING_DEPTH (); \
5848 \
5849 if (depth >= spelling_size) \
5850 { \
5851 spelling_size += 10; \
5852 spelling_base = XRESIZEVEC (struct spelling, spelling_base, \
5853 spelling_size); \
5854 RESTORE_SPELLING_DEPTH (depth); \
5855 } \
5856 \
5857 spelling->kind = (KIND); \
5858 spelling->MEMBER = (VALUE); \
5859 spelling++; \
5860 }
5862 /* Push STRING on the stack. Printed literally. */
5864 static void
5866 {
5868 }
5870 /* Push a member name on the stack. Printed as '.' STRING. */
5872 static void
5874 {
5880 }
5882 /* Push an array bounds on the stack. Printed as [BOUNDS]. */
5884 static void
5886 {
5888 }
5890 /* Compute the maximum size in bytes of the printed spelling. */
5892 static int
5894 {
5899 {
5902 else
5904 }
5907 }
5909 /* Print the spelling to BUFFER and return it. */
5913 {
5919 {
5922 }
5923 else
5924 {
5929 ;
5930 }
5933 }
5935 /* Issue an error message for a bad initializer component.
5936 GMSGID identifies the message.
5937 The component name is taken from the spelling stack. */
5939 void
5941 {
5944 /* The gmsgid may be a format string with %< and %>. */
5949 }
5951 /* Issue a pedantic warning for a bad initializer component. OPT is
5952 the option OPT_* (from options.h) controlling this warning or 0 if
5953 it is unconditionally given. GMSGID identifies the message. The
5954 component name is taken from the spelling stack. */
5956 void
5958 {
5961 /* The gmsgid may be a format string with %< and %>. */
5966 }
5968 /* Issue a warning for a bad initializer component.
5970 OPT is the OPT_W* value corresponding to the warning option that
5971 controls this warning. GMSGID identifies the message. The
5972 component name is taken from the spelling stack. */
5974 static void
5976 {
5979 /* The gmsgid may be a format string with %< and %>. */
5984 }
5985 \f
5986 /* If TYPE is an array type and EXPR is a parenthesized string
5987 constant, warn if pedantic that EXPR is being used to initialize an
5988 object of type TYPE. */
5990 void
5992 {
5999 }
6001 /* Digest the parser output INIT as an initializer for type TYPE.
6002 Return a C expression of type TYPE to represent the initial value.
6004 If ORIGTYPE is not NULL_TREE, it is the original type of INIT.
6006 NULL_POINTER_CONSTANT is true if INIT is a null pointer constant.
6008 If INIT is a string constant, STRICT_STRING is true if it is
6009 unparenthesized or we should not warn here for it being parenthesized.
6010 For other types of INIT, STRICT_STRING is not used.
6012 INIT_LOC is the location of the INIT.
6014 REQUIRE_CONSTANT requests an error if non-constant initializers or
6015 elements are seen. */
6017 static tree
6021 {
6028 || !init
6036 {
6039 }
6043 /* Initialization of an array of chars from a string constant
6044 optionally enclosed in braces. */
6048 {
6050 /* Note that an array could be both an array of character type
6051 and an array of wchar_t if wchar_t is signed char or unsigned
6052 char. */
6061 {
6078 {
6080 {
6083 }
6084 }
6085 else
6086 {
6088 {
6092 }
6094 {
6098 }
6099 }
6105 {
6108 /* Subtract the size of a single (possibly wide) character
6109 because it's ok to ignore the terminating null char
6110 that is counted in the length of the constant. */
6112 (len
6123 }
6126 }
6128 {
6132 }
6133 }
6135 /* Build a VECTOR_CST from a *constant* vector constructor. If the
6136 vector constructor is not constant (e.g. {1,2,3,foo()}) then punt
6137 below and handle as a constructor. */
6142 {
6149 {
6151 tree value;
6154 /* Iterate through elements and check if all constructor
6155 elements are *_CSTs. */
6158 {
6161 }
6166 }
6167 }
6172 /* Any type can be initialized
6173 from an expression of the same type, optionally with braces. */
6186 {
6188 {
6190 {
6193 inside_init = array_to_pointer_conversion
6195 else
6196 {
6199 }
6200 }
6201 }
6204 /* Although the types are compatible, we may require a
6205 conversion. */
6211 {
6212 /* As an extension, allow initializing objects with static storage
6213 duration with compound literals (which are then treated just as
6214 the brace enclosed list they contain). Also allow this for
6215 vectors, as we can only assign them with compound literals. */
6218 }
6222 {
6225 }
6227 /* Compound expressions can only occur here if -Wpedantic or
6228 -pedantic-errors is specified. In the later case, we always want
6229 an error. In the former case, we simply want a warning. */
6232 {
6233 inside_init
6238 else
6243 }
6247 {
6250 }
6255 /* Added to enable additional -Wsuggest-attribute=format warnings. */
6258 origtype,
6262 }
6264 /* Handle scalar types, including conversions. */
6269 {
6276 inside_init);
6277 inside_init
6282 /* Check to see if we have already given an error message. */
6284 ;
6286 {
6289 }
6293 {
6296 }
6302 }
6304 /* Come here only for records and arrays. */
6307 {
6310 }
6314 }
6315 \f
6316 /* Handle initializers that use braces. */
6318 /* Type of object we are accumulating a constructor for.
6319 This type is always a RECORD_TYPE, UNION_TYPE or ARRAY_TYPE. */
6322 /* For a RECORD_TYPE or UNION_TYPE, this is the chain of fields
6323 left to fill. */
6326 /* For an ARRAY_TYPE, this is the specified index
6327 at which to store the next element we get. */
6330 /* For an ARRAY_TYPE, this is the maximum index. */
6333 /* For a RECORD_TYPE, this is the first field not yet written out. */
6336 /* For an ARRAY_TYPE, this is the index of the first element
6337 not yet written out. */
6340 /* In a RECORD_TYPE, the byte index of the next consecutive field.
6341 This is so we can generate gaps between fields, when appropriate. */
6344 /* If we are saving up the elements rather than allocating them,
6345 this is the list of elements so far (in reverse order,
6346 most recent first). */
6349 /* 1 if constructor should be incrementally stored into a constructor chain,
6350 0 if all the elements should be kept in AVL tree. */
6353 /* 1 if so far this constructor's elements are all compile-time constants. */
6356 /* 1 if so far this constructor's elements are all valid address constants. */
6359 /* 1 if this constructor has an element that cannot be part of a
6360 constant expression. */
6363 /* 1 if this constructor is erroneous so far. */
6366 /* Structure for managing pending initializer elements, organized as an
6367 AVL tree. */
6369 struct init_node
6370 {
6374 tree purpose;
6375 tree value;
6376 tree origtype;
6377 };
6379 /* Tree of pending elements at this constructor level.
6380 These are elements encountered out of order
6381 which belong at places we haven't reached yet in actually
6382 writing the output.
6383 Will never hold tree nodes across GC runs. */
6386 /* The SPELLING_DEPTH of this constructor. */
6389 /* DECL node for which an initializer is being read.
6390 0 means we are reading a constructor expression
6391 such as (struct foo) {...}. */
6394 /* Nonzero if this is an initializer for a top-level decl. */
6397 /* Nonzero if there were any member designators in this initializer. */
6400 /* Nesting depth of designator list. */
6403 /* Nonzero if there were diagnosed errors in this designator list. */
6406 \f
6407 /* This stack has a level for each implicit or explicit level of
6408 structuring in the initializer, including the outermost one. It
6409 saves the values of most of the variables above. */
6413 struct constructor_stack
6414 {
6416 tree type;
6417 tree fields;
6418 tree index;
6419 tree max_index;
6420 tree unfilled_index;
6421 tree unfilled_fields;
6422 tree bit_index;
6427 /* If value nonzero, this value should replace the entire
6428 constructor at this level. */
6439 };
6443 /* This stack represents designators from some range designator up to
6444 the last designator in the list. */
6446 struct constructor_range_stack
6447 {
6450 tree range_start;
6451 tree index;
6452 tree range_end;
6453 tree fields;
6454 };
6458 /* This stack records separate initializers that are nested.
6459 Nested initializers can't happen in ANSI C, but GNU C allows them
6460 in cases like { ... (struct foo) { ... } ... }. */
6462 struct initializer_stack
6463 {
6465 tree decl;
6475 };
6478 \f
6479 /* Prepare to parse and output the initializer for variable DECL. */
6481 void
6483 {
6505 {
6507 require_constant_elements
6509 /* For a scalar, you can always use any value to initialize,
6510 even within braces. */
6516 }
6517 else
6518 {
6522 }
6535 }
6537 void
6539 {
6542 /* Free the whole constructor stack of this initializer. */
6544 {
6548 }
6552 /* Pop back to the data of the outer initializer (if any). */
6567 }
6568 \f
6569 /* Call here when we see the initializer is surrounded by braces.
6570 This is instead of a call to push_init_level;
6571 it is matched by a call to pop_init_level.
6573 TYPE is the type to initialize, for a constructor expression.
6574 For an initializer for a decl, TYPE is zero. */
6576 void
6578 {
6627 {
6629 /* Skip any nameless bit fields at the beginning. */
6636 }
6638 {
6640 {
6641 constructor_max_index
6644 /* Detect non-empty initializations of zero-length arrays. */
6649 /* constructor_max_index needs to be an INTEGER_CST. Attempts
6650 to initialize VLAs will cause a proper error; avoid tree
6651 checking errors as well by setting a safe value. */
6656 constructor_index
6659 }
6660 else
6661 {
6664 }
6667 }
6669 {
6670 /* Vectors are like simple fixed-size arrays. */
6671 constructor_max_index =
6675 }
6676 else
6677 {
6678 /* Handle the case of int x = {5}; */
6681 }
6682 }
6683 \f
6684 /* Push down into a subobject, for initialization.
6685 If this is for an explicit set of braces, IMPLICIT is 0.
6686 If it is because the next element belongs at a lower level,
6687 IMPLICIT is 1 (or 2 if the push is because of designator list). */
6689 void
6691 {
6695 /* If we've exhausted any levels that didn't have braces,
6696 pop them now. If implicit == 1, this will have been done in
6697 process_init_element; do not repeat it here because in the case
6698 of excess initializers for an empty aggregate this leads to an
6699 infinite cycle of popping a level and immediately recreating
6700 it. */
6702 {
6704 {
6711 && constructor_max_index
6713 constructor_index))
6716 else
6718 }
6719 }
6721 /* Unless this is an explicit brace, we need to preserve previous
6722 content if any. */
6724 {
6731 }
6768 {
6773 }
6775 /* Don't die if an entire brace-pair level is superfluous
6776 in the containing level. */
6778 ;
6781 {
6782 /* Don't die if there are extra init elts at the end. */
6785 else
6786 {
6789 constructor_depth++;
6790 }
6791 }
6793 {
6796 constructor_depth++;
6797 }
6800 {
6805 }
6808 {
6817 }
6820 {
6823 }
6827 {
6829 /* Skip any nameless bit fields at the beginning. */
6836 }
6838 {
6839 /* Vectors are like simple fixed-size arrays. */
6840 constructor_max_index =
6844 }
6846 {
6848 {
6849 constructor_max_index
6852 /* Detect non-empty initializations of zero-length arrays. */
6857 /* constructor_max_index needs to be an INTEGER_CST. Attempts
6858 to initialize VLAs will cause a proper error; avoid tree
6859 checking errors as well by setting a safe value. */
6864 constructor_index
6867 }
6868 else
6873 {
6874 /* We need to split the char/wchar array into individual
6875 characters, so that we don't have to special case it
6876 everywhere. */
6878 }
6879 }
6880 else
6881 {
6886 }
6887 }
6889 /* At the end of an implicit or explicit brace level,
6890 finish up that level of constructor. If a single expression
6891 with redundant braces initialized that level, return the
6892 c_expr structure for that expression. Otherwise, the original_code
6893 element is set to ERROR_MARK.
6894 If we were outputting the elements as they are read, return 0 as the value
6895 from inner levels (process_init_element ignores that),
6896 but return error_mark_node as the value from the outermost level
6897 (that's what we want to put in DECL_INITIAL).
6898 Otherwise, return a CONSTRUCTOR expression as the value. */
6900 struct c_expr
6902 {
6910 {
6911 /* When we come to an explicit close brace,
6912 pop any inner levels that didn't have explicit braces. */
6914 {
6917 }
6919 }
6921 /* Now output all pending elements. */
6927 /* Error for initializing a flexible array member, or a zero-length
6928 array member in an inappropriate context. */
6933 {
6934 /* Silently discard empty initializations. The parser will
6935 already have pedwarned for empty brackets. */
6938 else
6939 {
6944 else
6948 /* We have already issued an error message for the existence
6949 of a flexible array member not at the end of the structure.
6950 Discard the initializer so that we do not die later. */
6953 }
6954 }
6956 /* Warn when some struct elements are implicitly initialized to zero. */
6958 && constructor_type
6961 {
6966 /* Do not warn for flexible array members or zero-length arrays. */
6973 /* Do not warn if this level of the initializer uses member
6974 designators; it is likely to be deliberate. */
6975 && !constructor_designated
6976 /* Do not warn about initializing with ` = {0}'. */
6978 {
6981 constructor_unfilled_fields,
6982 constructor_type))
6985 }
6986 }
6988 /* Pad out the end of the structure. */
6990 /* If this closes a superfluous brace pair,
6991 just pass out the element between them. */
6994 ;
6999 {
7000 /* A nonincremental scalar initializer--just return
7001 the element, after verifying there is just one. */
7003 {
7007 }
7009 {
7012 }
7013 else
7015 }
7016 else
7017 {
7020 else
7021 {
7023 constructor_elements);
7030 }
7031 }
7034 {
7039 }
7067 }
7069 /* Common handling for both array range and field name designators.
7070 ARRAY argument is nonzero for array ranges. Returns zero for success. */
7072 static int
7074 {
7075 tree subtype;
7078 /* Don't die if an entire brace-pair level is superfluous
7079 in the containing level. */
7083 /* If there were errors in this designator list already, bail out
7084 silently. */
7089 {
7092 /* Designator list starts at the level of closest explicit
7093 braces. */
7095 {
7098 }
7101 }
7104 {
7116 }
7120 {
7123 }
7125 {
7128 }
7133 }
7135 /* If there are range designators in designator list, push a new designator
7136 to constructor_range_stack. RANGE_END is end of such stack range or
7137 NULL_TREE if there is no range designator at this level. */
7139 static void
7141 {
7157 }
7159 /* Within an array initializer, specify the next index to be initialized.
7160 FIRST is that index. If LAST is nonzero, then initialize a range
7161 of indices, running from FIRST through LAST. */
7163 void
7166 {
7174 {
7177 }
7180 {
7184 "array index in initializer is not "
7186 }
7189 {
7193 "array index in initializer is not "
7195 }
7208 else
7209 {
7216 {
7220 {
7223 }
7224 else
7225 {
7229 {
7232 }
7233 }
7234 }
7236 designator_depth++;
7240 }
7241 }
7243 /* Within a struct initializer, specify the next field to be initialized. */
7245 void
7247 {
7248 tree field;
7257 {
7260 }
7266 else
7267 do
7268 {
7270 designator_depth++;
7276 {
7279 }
7280 }
7282 }
7283 \f
7284 /* Add a new initializer to the tree of pending initializers. PURPOSE
7285 identifies the initializer, either array index or field in a structure.
7286 VALUE is the value of that index or field. If ORIGTYPE is not
7287 NULL_TREE, it is the original type of VALUE.
7289 IMPLICIT is true if value comes from pop_init_level (1),
7290 the new initializer has been merged with the existing one
7291 and thus no warnings should be emitted about overriding an
7292 existing initializer. */
7294 static void
7297 {
7304 {
7306 {
7312 else
7313 {
7315 {
7320 }
7324 }
7325 }
7326 }
7327 else
7328 {
7329 tree bitpos;
7333 {
7339 else
7340 {
7342 {
7347 }
7351 }
7352 }
7353 }
7368 {
7372 {
7376 {
7378 {
7379 /* L rotation. */
7392 {
7395 else
7397 }
7398 else
7400 }
7401 else
7402 {
7403 /* LR rotation. */
7425 {
7428 else
7430 }
7431 else
7433 }
7435 }
7436 else
7437 {
7438 /* p->balance == +1; growth of left side balances the node. */
7441 }
7442 }
7444 {
7446 /* Growth propagation from right side. */
7449 {
7451 {
7452 /* R rotation. */
7465 {
7468 else
7470 }
7471 else
7473 }
7475 {
7476 /* RL rotation */
7498 {
7501 else
7503 }
7504 else
7506 }
7508 }
7509 else
7510 {
7511 /* p->balance == -1; growth of right side balances the node. */
7514 }
7515 }
7519 }
7520 }
7522 /* Build AVL tree from a sorted chain. */
7524 static void
7526 {
7535 {
7537 braced_init_obstack);
7538 }
7541 {
7543 /* Skip any nameless bit fields at the beginning. */
7549 }
7551 {
7553 constructor_unfilled_index
7556 else
7558 }
7560 }
7562 /* Build AVL tree from a string constant. */
7564 static void
7567 {
7582 p < end
7583 && !(constructor_max_index
7586 {
7588 {
7591 }
7592 else
7593 {
7597 {
7600 else
7605 }
7606 }
7609 {
7612 {
7614 {
7617 }
7618 }
7620 {
7623 }
7628 }
7632 braced_init_obstack);
7633 }
7636 }
7638 /* Return value of FIELD in pending initializer or zero if the field was
7639 not initialized yet. */
7641 static tree
7643 {
7647 {
7654 {
7659 else
7661 }
7662 }
7664 {
7668 && (!constructor_unfilled_fields
7675 {
7680 else
7682 }
7683 }
7685 {
7689 }
7691 }
7693 /* "Output" the next constructor element.
7694 At top level, really output it to assembler code now.
7695 Otherwise, collect it in a list from which we will make a CONSTRUCTOR.
7696 If ORIGTYPE is not NULL_TREE, it is the original type of VALUE.
7697 TYPE is the data type that the containing data type wants here.
7698 FIELD is the field (a FIELD_DECL) or the index that this element fills.
7699 If VALUE is a string constant, STRICT_STRING is true if it is
7700 unparenthesized or we should not warn here for it being parenthesized.
7701 For other types of VALUE, STRICT_STRING is not used.
7703 PENDING if non-nil means output pending elements that belong
7704 right after this element. (PENDING is normally 1;
7705 it is 0 while outputting pending elements, to avoid recursion.)
7707 IMPLICIT is true if value comes from pop_init_level (1),
7708 the new initializer has been merged with the existing one
7709 and thus no warnings should be emitted about overriding an
7710 existing initializer. */
7712 static void
7716 {
7722 {
7725 }
7738 {
7739 /* As an extension, allow initializing objects with static storage
7740 duration with compound literals (which are then treated just as
7741 the brace enclosed list they contain). */
7744 }
7748 {
7751 }
7768 {
7770 {
7773 }
7777 }
7783 /* Issue -Wc++-compat warnings about initializing a bitfield with
7784 enum type. */
7792 {
7799 }
7801 /* If this field is empty (and not at the end of structure),
7802 don't do anything other than checking the initializer. */
7816 {
7819 }
7823 /* If this element doesn't come next in sequence,
7824 put it on constructor_pending_elts. */
7826 && (!constructor_incremental
7828 {
7834 braced_init_obstack);
7836 }
7838 && (!constructor_incremental
7840 {
7841 /* We do this for records but not for unions. In a union,
7842 no matter which field is specified, it can be initialized
7843 right away since it starts at the beginning of the union. */
7845 {
7848 else
7849 {
7857 }
7858 }
7861 braced_init_obstack);
7863 }
7866 {
7868 {
7874 }
7876 /* We can have just one union field set. */
7878 }
7880 /* Otherwise, output this element either to
7881 constructor_elements or to the assembler file. */
7886 /* Advance the variable that indicates sequential elements output. */
7888 constructor_unfilled_index
7890 bitsize_one_node);
7892 {
7893 constructor_unfilled_fields
7896 /* Skip any nameless bit fields. */
7900 constructor_unfilled_fields =
7902 }
7906 /* Now output any pending elements which have become next. */
7909 }
7911 /* Output any pending elements which have become next.
7912 As we output elements, constructor_unfilled_{fields,index}
7913 advances, which may cause other elements to become next;
7914 if so, they too are output.
7916 If ALL is 0, we return when there are
7917 no more pending elements to output now.
7919 If ALL is 1, we output space as necessary so that
7920 we can output all the pending elements. */
7921 static void
7923 {
7925 tree next;
7927 retry:
7929 /* Look through the whole pending tree.
7930 If we find an element that should be output now,
7931 output it. Otherwise, set NEXT to the element
7932 that comes first among those still pending. */
7936 {
7938 {
7940 constructor_unfilled_index))
7944 braced_init_obstack);
7947 {
7948 /* Advance to the next smaller node. */
7951 else
7952 {
7953 /* We have reached the smallest node bigger than the
7954 current unfilled index. Fill the space first. */
7957 }
7958 }
7959 else
7960 {
7961 /* Advance to the next bigger node. */
7964 else
7965 {
7966 /* We have reached the biggest node in a subtree. Find
7967 the parent of it, which is the next bigger node. */
7973 {
7976 }
7977 }
7978 }
7979 }
7982 {
7985 /* If the current record is complete we are done. */
7991 /* We can't compare fields here because there might be empty
7992 fields in between. */
7994 {
7999 braced_init_obstack);
8000 }
8002 {
8003 /* Advance to the next smaller node. */
8006 else
8007 {
8008 /* We have reached the smallest node bigger than the
8009 current unfilled field. Fill the space first. */
8012 }
8013 }
8014 else
8015 {
8016 /* Advance to the next bigger node. */
8019 else
8020 {
8021 /* We have reached the biggest node in a subtree. Find
8022 the parent of it, which is the next bigger node. */
8029 {
8032 }
8033 }
8034 }
8035 }
8036 }
8038 /* Ordinarily return, but not if we want to output all
8039 and there are elements left. */
8043 /* If it's not incremental, just skip over the gap, so that after
8044 jumping to retry we will output the next successive element. */
8051 /* ELT now points to the node in the pending tree with the next
8052 initializer to output. */
8054 }
8055 \f
8056 /* Add one non-braced element to the current constructor level.
8057 This adjusts the current position within the constructor's type.
8058 This may also start or terminate implicit levels
8059 to handle a partly-braced initializer.
8061 Once this has found the correct level for the new element,
8062 it calls output_init_element.
8064 IMPLICIT is true if value comes from pop_init_level (1),
8065 the new initializer has been merged with the existing one
8066 and thus no warnings should be emitted about overriding an
8067 existing initializer. */
8069 void
8072 {
8080 /* Handle superfluous braces around string cst as in
8081 char x[] = {"foo"}; */
8083 && constructor_type
8087 {
8092 }
8095 {
8098 }
8100 /* Ignore elements of a brace group if it is entirely superfluous
8101 and has already been diagnosed. */
8105 /* If we've exhausted any levels that didn't have braces,
8106 pop them now. */
8108 {
8116 && constructor_max_index
8118 constructor_index))
8121 else
8123 }
8125 /* In the case of [LO ... HI] = VALUE, only evaluate VALUE once. */
8127 {
8128 /* If value is a compound literal and we'll be just using its
8129 content, don't put it into a SAVE_EXPR. */
8131 || !require_constant_value
8133 {
8136 {
8139 }
8144 }
8145 }
8148 {
8150 {
8151 tree fieldtype;
8155 {
8159 }
8166 /* Error for non-static initialization of a flexible array member. */
8168 && !require_constant_value
8171 {
8174 }
8176 /* Accept a string constant to initialize a subarray. */
8182 /* Otherwise, if we have come to a subaggregate,
8183 and we don't have an element of its type, push into it. */
8189 {
8192 }
8195 {
8200 braced_init_obstack);
8202 }
8203 else
8204 /* Do the bookkeeping for an element that was
8205 directly output as a constructor. */
8206 {
8207 /* For a record, keep track of end position of last field. */
8209 constructor_bit_index
8214 /* If the current field was the first one not yet written out,
8215 it isn't now, so update. */
8217 {
8219 /* Skip any nameless bit fields. */
8223 constructor_unfilled_fields =
8225 }
8226 }
8229 /* Skip any nameless bit fields at the beginning. */
8234 }
8236 {
8237 tree fieldtype;
8241 {
8245 }
8252 /* Warn that traditional C rejects initialization of unions.
8253 We skip the warning if the value is zero. This is done
8254 under the assumption that the zero initializer in user
8255 code appears conditioned on e.g. __STDC__ to avoid
8256 "missing initializer" warnings and relies on default
8257 initialization to zero in the traditional C case.
8258 We also skip the warning if the initializer is designated,
8259 again on the assumption that this must be conditional on
8260 __STDC__ anyway (and we've already complained about the
8261 member-designator already). */
8268 /* Accept a string constant to initialize a subarray. */
8274 /* Otherwise, if we have come to a subaggregate,
8275 and we don't have an element of its type, push into it. */
8281 {
8284 }
8287 {
8292 braced_init_obstack);
8294 }
8295 else
8296 /* Do the bookkeeping for an element that was
8297 directly output as a constructor. */
8298 {
8301 }
8304 }
8306 {
8310 /* Accept a string constant to initialize a subarray. */
8316 /* Otherwise, if we have come to a subaggregate,
8317 and we don't have an element of its type, push into it. */
8323 {
8326 }
8331 {
8335 }
8337 /* Now output the actual element. */
8339 {
8344 braced_init_obstack);
8346 }
8348 constructor_index
8353 /* If we are doing the bookkeeping for an element that was
8354 directly output as a constructor, we must update
8355 constructor_unfilled_index. */
8357 }
8359 {
8362 /* Do a basic check of initializer size. Note that vectors
8363 always have a fixed size derived from their type. */
8365 {
8369 }
8371 /* Now output the actual element. */
8373 {
8379 braced_init_obstack);
8380 }
8382 constructor_index
8387 /* If we are doing the bookkeeping for an element that was
8388 directly output as a constructor, we must update
8389 constructor_unfilled_index. */
8391 }
8393 /* Handle the sole element allowed in a braced initializer
8394 for a scalar variable. */
8397 {
8401 }
8402 else
8403 {
8408 braced_init_obstack);
8410 }
8412 /* Handle range initializers either at this level or anywhere higher
8413 in the designator stack. */
8415 {
8422 {
8425 braced_init_obstack),
8427 }
8431 {
8435 }
8443 {
8447 {
8450 }
8458 }
8463 }
8466 }
8469 }
8470 \f
8471 /* Build a complete asm-statement, whose components are a CV_QUALIFIER
8472 (guaranteed to be 'volatile' or null) and ARGS (represented using
8473 an ASM_EXPR node). */
8474 tree
8476 {
8480 }
8482 /* Build an asm-expr, whose components are a STRING, some OUTPUTS,
8483 some INPUTS, and some CLOBBERS. The latter three may be NULL.
8484 SIMPLE indicates whether there was anything at all after the
8485 string in the asm expression -- asm("blah") and asm("blah" : )
8486 are subtly different. We use a ASM_EXPR node to represent this. */
8487 tree
8490 {
8491 tree tail;
8492 tree args;
8505 /* Remove output conversions that change the type but not the mode. */
8507 {
8512 /* ??? Really, this should not be here. Users should be using a
8513 proper lvalue, dammit. But there's a long history of using casts
8514 in the output operands. In cases like longlong.h, this becomes a
8515 primitive form of typechecking -- if the cast can be removed, then
8516 the output operand had a type of the proper width; otherwise we'll
8517 get an error. Gross, but ... */
8536 {
8537 /* If the operand is going to end up in memory,
8538 mark it addressable. */
8544 {
8547 }
8548 }
8549 else
8553 }
8556 {
8557 tree input;
8564 {
8565 /* If the operand is going to end up in memory,
8566 mark it addressable. */
8568 {
8571 /* Strip the nops as we allow this case. FIXME, this really
8572 should be rejected or made deprecated. */
8576 }
8577 else
8578 {
8586 {
8589 }
8590 }
8591 }
8592 else
8596 }
8598 /* ASMs with labels cannot have outputs. This should have been
8599 enforced by the parser. */
8604 /* asm statements without outputs, including simple ones, are treated
8605 as volatile. */
8610 }
8611 \f
8612 /* Generate a goto statement to LABEL. LOC is the location of the
8613 GOTO. */
8615 tree
8617 {
8622 {
8626 }
8627 }
8629 /* Generate a computed goto statement to EXPR. LOC is the location of
8630 the GOTO. */
8632 tree
8634 {
8635 tree t;
8642 }
8644 /* Generate a C `return' statement. RETVAL is the expression for what
8645 to return, or a null pointer for `return;' with no value. LOC is
8646 the location of the return statement. If ORIGTYPE is not NULL_TREE, it
8647 is the original type of RETVAL. */
8649 tree
8651 {
8661 {
8665 {
8668 }
8672 }
8675 {
8679 {
8681 "%<return%> with no value, in "
8684 }
8685 }
8687 {
8692 else
8695 }
8696 else
8697 {
8699 ic_return,
8702 tree inner;
8716 /* Strip any conversions, additions, and subtractions, and see if
8717 we are returning the address of a local variable. Warn if so. */
8719 {
8721 {
8722 CASE_CONVERT:
8730 /* If the second operand of the MINUS_EXPR has a pointer
8731 type (or is converted from it), this may be valid, so
8732 don't give a warning. */
8733 {
8746 }
8766 }
8769 }
8776 }
8781 }
8782 \f
8784 /* The SWITCH_EXPR being built. */
8785 tree switch_expr;
8787 /* The original type of the testing expression, i.e. before the
8788 default conversion is applied. */
8789 tree orig_type;
8791 /* A splay-tree mapping the low element of a case range to the high
8792 element, or NULL_TREE if there is no high element. Used to
8793 determine whether or not a new case label duplicates an old case
8794 label. We need a tree, rather than simply a hash table, because
8795 of the GNU case range extension. */
8796 splay_tree cases;
8798 /* The bindings at the point of the switch. This is used for
8799 warnings crossing decls when branching to a case label. */
8802 /* The next node on the stack. */
8804 };
8806 /* A stack of the currently active switch statements. The innermost
8807 switch statement is on the top of the stack. There is no need to
8808 mark the stack for garbage collection because it is only active
8809 during the processing of the body of a function, and we never
8810 collect at that point. */
8814 /* Start a C switch statement, testing expression EXP. Return the new
8815 SWITCH_EXPR. SWITCH_LOC is the location of the `switch'.
8816 SWITCH_COND_LOC is the location of the switch's condition. */
8818 tree
8820 location_t switch_cond_loc,
8821 tree exp)
8822 {
8827 {
8831 {
8833 {
8836 }
8838 }
8839 else
8840 {
8855 }
8856 }
8858 /* Add this new SWITCH_EXPR to the stack. */
8869 }
8871 /* Process a case label at location LOC. */
8873 tree
8875 {
8879 {
8884 }
8887 {
8892 }
8895 {
8898 else
8901 }
8905 loc))
8915 }
8917 /* Finish the switch statement. */
8919 void
8921 {
8923 location_t switch_location;
8927 /* Emit warnings as needed. */
8933 /* Pop the stack. */
8938 }
8939 \f
8940 /* Emit an if statement. IF_LOCUS is the location of the 'if'. COND,
8941 THEN_BLOCK and ELSE_BLOCK are expressions to be used; ELSE_BLOCK
8942 may be null. NESTED_IF is true if THEN_BLOCK contains another IF
8943 statement, and was not surrounded with parenthesis. */
8945 void
8948 {
8949 tree stmt;
8951 /* Diagnose an ambiguous else if if-then-else is nested inside if-then. */
8953 {
8956 /* We know from the grammar productions that there is an IF nested
8957 within THEN_BLOCK. Due to labels and c99 conditional declarations,
8958 it might not be exactly THEN_BLOCK, but should be the last
8959 non-container statement within. */
8962 {
8977 }
8978 found:
8983 }
8988 }
8990 /* Emit a general-purpose loop construct. START_LOCUS is the location of
8991 the beginning of the loop. COND is the loop condition. COND_IS_FIRST
8992 is false for DO loops. INCR is the FOR increment expression. BODY is
8993 the statement controlled by the loop. BLAB is the break label. CLAB is
8994 the continue label. Everything is allowed to be NULL. */
8996 void
8999 {
9002 /* If the condition is zero don't generate a loop construct. */
9004 {
9006 {
9010 }
9011 }
9012 else
9013 {
9016 /* If we have an exit condition, then we build an IF with gotos either
9017 out of the loop, or to the top of it. If there's no exit condition,
9018 then we just build a jump back to the top. */
9022 {
9023 /* Canonicalize the loop condition to the end. This means
9024 generating a branch to the loop condition. Reuse the
9025 continue label, if possible. */
9027 {
9029 {
9032 }
9033 else
9037 }
9043 else
9046 }
9049 }
9063 }
9065 tree
9067 {
9071 /* In switch statements break is sometimes stylistically used after
9072 a return statement. This can lead to spurious warnings about
9073 control reaching the end of a non-void function when it is
9074 inlined. Note that we are calling block_may_fallthru with
9075 language specific tree nodes; this works because
9076 block_may_fallthru returns true when given something it does not
9077 understand. */
9081 {
9084 }
9086 ;
9088 {
9092 else
9103 }
9112 }
9114 /* A helper routine for c_process_expr_stmt and c_finish_stmt_expr. */
9116 static void
9118 {
9120 ;
9122 {
9125 }
9126 else
9128 }
9130 /* Process an expression as if it were a complete statement. Emit
9131 diagnostics, but do not call ADD_STMT. LOC is the location of the
9132 statement. */
9134 tree
9136 {
9137 tree exprv;
9152 /* If we're not processing a statement expression, warn about unused values.
9153 Warnings for statement expressions will be emitted later, once we figure
9154 out which is the result. */
9169 /* If the expression is not of a type to which we cannot assign a line
9170 number, wrap the thing in a no-op NOP_EXPR. */
9172 {
9175 }
9178 }
9180 /* Emit an expression as a statement. LOC is the location of the
9181 expression. */
9183 tree
9185 {
9188 else
9190 }
9192 /* Do the opposite and emit a statement as an expression. To begin,
9193 create a new binding level and return it. */
9195 tree
9197 {
9198 tree ret;
9200 /* We must force a BLOCK for this level so that, if it is not expanded
9201 later, there is a way to turn off the entire subtree of blocks that
9202 are contained in it. */
9207 ? NULL
9210 /* Mark the current statement list as belonging to a statement list. */
9214 }
9216 /* LOC is the location of the compound statement to which this body
9217 belongs. */
9219 tree
9221 {
9228 ? NULL
9231 /* Locate the last statement in BODY. See c_end_compound_stmt
9232 about always returning a BIND_EXPR. */
9236 continue_searching:
9238 {
9239 tree_stmt_iterator i;
9241 /* This can happen with degenerate cases like ({ }). No value. */
9245 /* If we're supposed to generate side effects warnings, process
9246 all of the statements except the last. */
9248 {
9250 {
9251 location_t tloc;
9256 }
9257 }
9258 else
9262 }
9264 /* If the end of the list is exception related, then the list was split
9265 by a call to push_cleanup. Continue searching. */
9268 {
9272 }
9277 /* In the case that the BIND_EXPR is not necessary, return the
9278 expression out from inside it. */
9281 {
9282 /* Even if this looks constant, do not allow it in a constant
9283 expression. */
9285 /* Do not warn if the return value of a statement expression is
9286 unused. */
9289 }
9291 /* Extract the type of said expression. */
9294 /* If we're not returning a value at all, then the BIND_EXPR that
9295 we already have is a fine expression to return. */
9299 /* Now that we've located the expression containing the value, it seems
9300 silly to make voidify_wrapper_expr repeat the process. Create a
9301 temporary of the appropriate type and stick it in a TARGET_EXPR. */
9304 /* Unwrap a no-op NOP_EXPR as added by c_finish_expr_stmt. This avoids
9305 tree_expr_nonnegative_p giving up immediately. */
9314 {
9318 }
9319 }
9320 \f
9321 /* Begin and end compound statements. This is as simple as pushing
9322 and popping new statement lists from the tree. */
9324 tree
9326 {
9331 }
9333 /* End a compound statement. STMT is the statement. LOC is the
9334 location of the compound statement-- this is usually the location
9335 of the opening brace. */
9337 tree
9339 {
9343 {
9347 }
9352 /* If this compound statement is nested immediately inside a statement
9353 expression, then force a BIND_EXPR to be created. Otherwise we'll
9354 do the wrong thing for ({ { 1; } }) or ({ 1; { } }). In particular,
9355 STATEMENT_LISTs merge, and thus we can lose track of what statement
9356 was really last. */
9360 {
9364 }
9367 }
9369 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
9370 when the current scope is exited. EH_ONLY is true when this is not
9371 meant to apply to normal control flow transfer. */
9373 void
9375 {
9387 }
9388 \f
9389 /* Build a binary-operation expression without default conversions.
9390 CODE is the kind of expression to build.
9391 LOCATION is the operator's location.
9392 This function differs from `build' in several ways:
9393 the data type of the result is computed and recorded in it,
9394 warnings are generated if arg data types are invalid,
9395 special handling for addition and subtraction of pointers is known,
9396 and some optimization is done (operations on narrow ints
9397 are done in the narrower type when that gives the same result).
9398 Constant folding is also done before the result is returned.
9400 Note that the operands will never have enumeral types, or function
9401 or array types, because either they will have the default conversions
9402 performed or they have both just been converted to some other type in which
9403 the arithmetic is to be done. */
9405 tree
9408 {
9410 tree eptype;
9418 /* Expression code to give to the expression when it is built.
9419 Normally this is CODE, which is what the caller asked for,
9420 but in some special cases we change it. */
9423 /* Data type in which the computation is to be performed.
9424 In the simplest cases this is the common type of the arguments. */
9427 /* When the computation is in excess precision, the type of the
9428 final EXCESS_PRECISION_EXPR. */
9431 /* Nonzero means operands have already been type-converted
9432 in whatever way is necessary.
9433 Zero means they need to be converted to RESULT_TYPE. */
9436 /* Nonzero means create the expression with this type, rather than
9437 RESULT_TYPE. */
9440 /* Nonzero means after finally constructing the expression
9441 convert it to this type. */
9444 /* Nonzero if this is an operation like MIN or MAX which can
9445 safely be computed in short if both args are promoted shorts.
9446 Also implies COMMON.
9447 -1 indicates a bitwise operation; this makes a difference
9448 in the exact conditions for when it is safe to do the operation
9449 in a narrower mode. */
9452 /* Nonzero if this is a comparison operation;
9453 if both args are promoted shorts, compare the original shorts.
9454 Also implies COMMON. */
9457 /* Nonzero if this is a right-shift operation, which can be computed on the
9458 original short and then promoted if the operand is a promoted short. */
9461 /* Nonzero means set RESULT_TYPE to the common type of the args. */
9464 /* True means types are compatible as far as ObjC is concerned. */
9467 /* True means this is an arithmetic operation that may need excess
9468 precision. */
9471 /* True means this is a boolean operation that converts both its
9472 operands to truth-values. */
9489 {
9492 int_const = (int_const_or_overflow
9495 }
9496 else
9499 /* Do not apply default conversion in mixed vector/scalar expression. */
9503 {
9506 }
9511 /* The expression codes of the data types of the arguments tell us
9512 whether the arguments are integers, floating, pointers, etc. */
9516 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
9520 /* If an error was already reported for one of the arguments,
9521 avoid reporting another error. */
9528 {
9531 }
9534 {
9548 }
9550 {
9553 }
9556 {
9559 }
9561 {
9564 }
9567 {
9570 }
9574 /* In case when one of the operands of the binary operation is
9575 a vector and another is a scalar -- convert scalar to vector. */
9577 {
9582 {
9586 {
9588 tree sc;
9599 }
9601 {
9603 tree sc;
9614 }
9617 }
9618 }
9621 {
9623 /* Handle the pointer + int case. */
9625 {
9628 }
9630 {
9633 }
9634 else
9639 /* Subtraction of two similar pointers.
9640 We must subtract them as integers, then divide by object size. */
9643 {
9646 }
9647 /* Handle pointer minus int. Just like pointer plus int. */
9649 {
9652 }
9653 else
9674 {
9685 else
9686 /* Although it would be tempting to shorten always here, that
9687 loses on some targets, since the modulo instruction is
9688 undefined if the quotient can't be represented in the
9689 computation mode. We shorten only if unsigned or if
9690 dividing by something we know != -1. */
9695 }
9703 /* Allow vector types which are not floating point types. */
9720 {
9721 /* Although it would be tempting to shorten always here, that loses
9722 on some targets, since the modulo instruction is undefined if the
9723 quotient can't be represented in the computation mode. We shorten
9724 only if unsigned or if dividing by something we know != -1. */
9729 }
9743 {
9744 /* Result of these operations is always an int,
9745 but that does not mean the operands should be
9746 converted to ints! */
9749 {
9752 }
9753 else
9756 {
9759 }
9760 else
9764 }
9766 {
9767 int_const_or_overflow = (int_operands
9771 int_const = (int_const_or_overflow
9775 }
9777 {
9778 int_const_or_overflow = (int_operands
9782 int_const = (int_const_or_overflow
9786 }
9789 /* Shift operations: result has same type as first operand;
9790 always convert second operand to int.
9791 Also set SHORT_SHIFT if shifting rightward. */
9796 {
9799 }
9804 {
9807 }
9810 {
9812 {
9814 {
9818 }
9819 else
9820 {
9825 {
9829 }
9830 }
9831 }
9833 /* Use the type of the value to be shifted. */
9835 /* Convert the non vector shift-count to an integer, regardless
9836 of size of value being shifted. */
9840 /* Avoid converting op1 to result_type later. */
9842 }
9848 {
9851 }
9856 {
9859 }
9862 {
9864 {
9866 {
9870 }
9873 {
9877 }
9878 }
9880 /* Use the type of the value to be shifted. */
9882 /* Convert the non vector shift-count to an integer, regardless
9883 of size of value being shifted. */
9887 /* Avoid converting op1 to result_type later. */
9889 }
9895 {
9896 tree intt;
9898 {
9902 }
9905 {
9909 }
9911 /* Always construct signed integer vector type. */
9918 }
9921 OPT_Wfloat_equal,
9923 /* Result of comparison is always int,
9924 but don't convert the args to int! */
9932 {
9935 {
9938 OPT_Waddress,
9939 "the comparison will always evaluate as %<false%> "
9942 else
9944 OPT_Waddress,
9945 "the comparison will always evaluate as %<true%> "
9948 }
9950 }
9952 {
9955 {
9958 OPT_Waddress,
9959 "the comparison will always evaluate as %<false%> "
9962 else
9964 OPT_Waddress,
9965 "the comparison will always evaluate as %<true%> "
9968 }
9970 }
9972 {
9979 /* Anything compares with void *. void * compares with anything.
9980 Otherwise, the targets must be compatible
9981 and both must be object or both incomplete. */
9985 {
9989 }
9991 {
9995 }
9997 {
10001 }
10002 else
10003 /* Avoid warning about the volatile ObjC EH puts on decls. */
10009 {
10011 result_type = build_pointer_type
10013 }
10014 }
10016 {
10019 }
10021 {
10024 }
10032 {
10033 tree intt;
10035 {
10039 }
10042 {
10046 }
10048 /* Always construct signed integer vector type. */
10055 }
10063 {
10066 addr_space_t as_common;
10069 {
10083 }
10085 {
10089 }
10090 else
10091 {
10093 result_type = build_pointer_type
10097 }
10098 }
10100 {
10108 }
10110 {
10118 }
10120 {
10123 }
10125 {
10128 }
10133 }
10142 {
10145 }
10149 &&
10152 {
10158 {
10161 "implicit conversion from %qT to %qT "
10162 "to match other operand of binary "
10164 location);
10167 }
10176 {
10177 /* An operation on mixed real/complex operands must be
10178 handled specially, but the language-independent code can
10179 more easily optimize the plain complex arithmetic if
10180 -fno-signed-zeros. */
10184 {
10187 }
10189 {
10194 }
10195 else
10196 {
10201 }
10205 {
10212 {
10217 /* Fall through. */
10224 }
10225 }
10226 else
10227 {
10234 {
10238 /* Fall through. */
10248 }
10249 }
10252 }
10254 /* For certain operations (which identify themselves by shorten != 0)
10255 if both args were extended from the same smaller type,
10256 do the arithmetic in that type and then extend.
10258 shorten !=0 and !=1 indicates a bitwise operation.
10259 For them, this optimization is safe only if
10260 both args are zero-extended or both are sign-extended.
10261 Otherwise, we might change the result.
10262 Eg, (short)-1 | (unsigned short)-1 is (int)-1
10263 but calculated in (unsigned short) it would be (unsigned short)-1. */
10266 {
10270 }
10272 /* Shifts can be shortened if shifting right. */
10275 {
10286 /* We can shorten only if the shift count is less than the
10287 number of bits in the smaller type size. */
10289 /* We cannot drop an unsigned shift after sign-extension. */
10291 {
10292 /* Do an unsigned shift if the operand was zero-extended. */
10293 result_type
10296 /* Convert value-to-be-shifted to that type. */
10300 }
10301 }
10303 /* Comparison operations are shortened too but differently.
10304 They identify themselves by setting short_compare = 1. */
10307 {
10308 /* Don't write &op0, etc., because that would prevent op0
10309 from being kept in a register.
10310 Instead, make copies of the our local variables and
10311 pass the copies by reference, then copy them back afterward. */
10314 tree val
10318 {
10321 }
10328 {
10334 {
10337 }
10338 else
10339 {
10340 /* Fold for the sake of possible warnings, as in
10341 build_conditional_expr. This requires the
10342 "original" values to be folded, not just op0 and
10343 op1. */
10344 c_inhibit_evaluation_warnings++;
10349 c_inhibit_evaluation_warnings--;
10351 require_constant_value,
10352 NULL);
10354 require_constant_value,
10355 NULL);
10356 }
10363 {
10368 }
10369 }
10370 }
10371 }
10373 /* At this point, RESULT_TYPE must be nonzero to avoid an error message.
10374 If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
10375 Then the expression will be built.
10376 It will be given type FINAL_TYPE if that is nonzero;
10377 otherwise, it will be given type RESULT_TYPE. */
10380 {
10383 }
10386 {
10390 {
10393 }
10394 }
10397 {
10401 /* This can happen if one operand has a vector type, and the other
10402 has a different type. */
10405 }
10407 /* Treat expressions in initializers specially as they can't trap. */
10409 ret = (require_constant_value
10413 else
10418 return_build_binary_op:
10421 ret = (int_operands
10431 }
10434 /* Convert EXPR to be a truth-value, validating its type for this
10435 purpose. LOCATION is the source location for the expression. */
10437 tree
10439 {
10443 {
10445 error_at (location, "used array that cannot be converted to pointer where scalar is required");
10469 }
10474 {
10479 }
10480 else
10481 /* ??? Should we also give an error for vectors rather than leaving
10482 those to give errors later? */
10486 {
10489 else
10491 }
10495 }
10496 \f
10498 /* Convert EXPR to a contained DECL, updating *TC, *TI and *SE as
10499 required. */
10501 tree
10503 {
10505 {
10507 /* Executing a compound literal inside a function reinitializes
10508 it. */
10512 }
10513 else
10515 }
10516 \f
10517 /* Like c_begin_compound_stmt, except force the retention of the BLOCK. */
10519 tree
10521 {
10522 tree block;
10528 }
10530 /* Generate OMP_PARALLEL, with CLAUSES and BLOCK as its compound
10531 statement. LOC is the location of the OMP_PARALLEL. */
10533 tree
10535 {
10536 tree stmt;
10547 }
10549 /* Like c_begin_compound_stmt, except force the retention of the BLOCK. */
10551 tree
10553 {
10554 tree block;
10560 }
10562 /* Generate OMP_TASK, with CLAUSES and BLOCK as its compound
10563 statement. LOC is the location of the #pragma. */
10565 tree
10567 {
10568 tree stmt;
10579 }
10581 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
10582 Remove any elements from the list that are invalid. */
10584 tree
10586 {
10597 {
10603 {
10621 {
10625 }
10628 {
10633 {
10665 }
10667 {
10672 }
10673 }
10684 {
10688 }
10691 check_dup_generic:
10694 {
10698 }
10702 {
10706 }
10707 else
10717 {
10721 }
10724 {
10728 }
10729 else
10739 {
10743 }
10746 {
10750 }
10751 else
10770 }
10773 {
10777 {
10781 }
10784 {
10790 {
10794 /* const vars may be specified in firstprivate clause. */
10805 }
10807 {
10812 }
10813 }
10814 }
10818 else
10820 }
10824 }
10826 /* Create a transaction node. */
10828 tree
10830 {
10837 }
10839 /* Make a variant type in the proper way for C/C++, propagating qualifiers
10840 down to the element type of an array. */
10842 tree
10844 {
10849 {
10850 tree t;
10852 type_quals);
10854 /* See if we already have an identically qualified type. */
10856 {
10863 }
10865 {
10876 {
10877 tree unqualified_canon
10883 }
10884 else
10886 }
10888 }
10890 /* A restrict-qualified pointer type must be a pointer to object or
10891 incomplete type. Note that the use of POINTER_TYPE_P also allows
10892 REFERENCE_TYPEs, which is appropriate for C++. */
10896 {
10899 }
10902 }
10904 /* Build a VA_ARG_EXPR for the C parser. */
10906 tree
10908 {
10913 }