| blob | 184b4063709dc65e6cb4f18b9bff2f7dee114954 |
1 /* Build expressions with type checking for C compiler.
2 Copyright (C) 1987, 1988, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009
4 Free Software Foundation, Inc.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 3, or (at your option) any later
11 version.
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16 for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
23 /* This file is part of the C front end.
24 It contains routines to build C expressions given their operands,
25 including computing the types of the result, C-specific error checks,
26 and some optimization. */
49 /* Possible cases of implicit bad conversions. Used to select
50 diagnostic messages in convert_for_assignment. */
52 ic_argpass,
53 ic_assign,
54 ic_init,
55 ic_return
56 };
58 /* Whether we are building a boolean conversion inside
59 convert_for_assignment, or some other late binary operation. If
60 build_binary_op is called (from code shared with C++) in this case,
61 then the operands have already been folded and the result will not
62 be folded again, so C_MAYBE_CONST_EXPR should not be generated. */
65 /* The level of nesting inside "__alignof__". */
68 /* The level of nesting inside "sizeof". */
71 /* The level of nesting inside "typeof". */
74 /* Nonzero if we've already printed a "missing braces around initializer"
75 message within this initializer. */
89 tree);
113 \f
114 /* Return true if EXP is a null pointer constant, false otherwise. */
116 static bool
118 {
119 /* This should really operate on c_expr structures, but they aren't
120 yet available everywhere required. */
129 }
131 /* EXPR may appear in an unevaluated part of an integer constant
132 expression, but not in an evaluated part. Wrap it in a
133 C_MAYBE_CONST_EXPR, or mark it with TREE_OVERFLOW if it is just an
134 INTEGER_CST and we cannot create a C_MAYBE_CONST_EXPR. */
136 static tree
138 {
139 tree ret;
141 {
144 }
145 else
146 {
149 }
151 }
153 /* Having checked whether EXPR may appear in an unevaluated part of an
154 integer constant expression and found that it may, remove any
155 C_MAYBE_CONST_EXPR noting this fact and return the resulting
156 expression. */
160 {
163 else
165 }
171 const_tree t1;
172 const_tree t2;
173 /* The return value of tagged_types_tu_compatible_p if we had seen
174 these two types already. */
176 };
181 /* Do `exp = require_complete_type (exp);' to make sure exp
182 does not have an incomplete type. (That includes void types.) */
184 tree
186 {
192 /* First, detect a valid value with a complete type. */
198 }
200 /* Print an error message for invalid use of an incomplete type.
201 VALUE is the expression that was used (or 0 if that isn't known)
202 and TYPE is the type that was invalid. */
204 void
206 {
209 /* Avoid duplicate error message. */
216 else
217 {
218 retry:
219 /* We must print an error message. Be clever about what it says. */
222 {
241 {
243 {
246 }
249 }
255 }
260 else
261 /* If this type has a typedef-name, the TYPE_NAME is a TYPE_DECL. */
263 }
264 }
266 /* Given a type, apply default promotions wrt unnamed function
267 arguments and return the new type. */
269 tree
271 {
276 {
277 /* Preserve unsignedness if not really getting any wider. */
282 }
285 }
287 /* Return true if between two named address spaces, whether there is a superset
288 named address space that encompasses both address spaces. If there is a
289 superset, return which address space is the superset. */
291 static bool
293 {
295 {
298 }
300 {
303 }
305 {
308 }
309 else
311 }
313 /* Return a variant of TYPE which has all the type qualifiers of LIKE
314 as well as those of TYPE. */
316 static tree
318 {
321 addr_space_t as_common;
323 /* If the two named address spaces are different, determine the common
324 superset address space. If there isn't one, raise an error. */
326 {
330 }
336 }
338 /* Return true iff the given tree T is a variable length array. */
340 bool
342 {
347 }
348 \f
349 /* Return the composite type of two compatible types.
351 We assume that comptypes has already been done and returned
352 nonzero; if that isn't so, this may crash. In particular, we
353 assume that qualifiers match. */
355 tree
357 {
360 tree attributes;
362 /* Save time if the two types are the same. */
366 /* If one type is nonsense, use the other. */
375 /* Merge the attributes. */
378 /* If one is an enumerated type and the other is the compatible
379 integer type, the composite type might be either of the two
380 (DR#013 question 3). For consistency, use the enumerated type as
381 the composite type. */
391 {
393 /* For two pointers, do this recursively on the target type. */
394 {
401 }
404 {
407 tree unqual_elt;
414 /* We should not have any type quals on arrays at all. */
424 d1_variable = (!d1_zero
427 d2_variable = (!d2_zero
433 /* Save space: see if the result is identical to one of the args. */
446 /* Merge the element types, and have a size if either arg has
447 one. We may have qualifiers on the element types. To set
448 up TYPE_MAIN_VARIANT correctly, we need to form the
449 composite of the unqualified types and add the qualifiers
450 back at the end. */
455 && (d2_variable
456 || d2_zero
458 ? t1
460 /* Ensure a composite type involving a zero-length array type
461 is a zero-length type not an incomplete type. */
465 {
468 }
471 }
477 {
478 /* Try harder not to create a new aggregate type. */
483 }
487 /* Function types: prefer the one that specified arg types.
488 If both do, merge the arg types. Also merge the return types. */
489 {
497 /* Save space: see if the result is identical to one of the args. */
503 /* Simple way if one arg fails to specify argument types. */
505 {
509 }
511 {
515 }
517 /* If both args specify argument types, we must merge the two
518 lists, argument by argument. */
519 /* Tell global_bindings_p to return false so that variable_size
520 doesn't die on VLAs in parameter types. */
533 {
534 /* A null type means arg type is not specified.
535 Take whatever the other function type has. */
537 {
540 }
542 {
545 }
547 /* Given wait (union {union wait *u; int *i} *)
548 and wait (union wait *),
549 prefer union wait * as type of parm. */
552 {
553 tree memb;
560 {
566 {
572 }
573 }
574 }
577 {
578 tree memb;
585 {
591 {
597 }
598 }
599 }
601 parm_done: ;
602 }
607 /* ... falls through ... */
608 }
612 }
614 }
616 /* Return the type of a conditional expression between pointers to
617 possibly differently qualified versions of compatible types.
619 We assume that comp_target_types has already been done and returned
620 nonzero; if that isn't so, this may crash. */
622 static tree
624 {
625 tree attributes;
628 tree target;
633 /* Save time if the two types are the same. */
637 /* If one type is nonsense, use the other. */
646 /* Merge the attributes. */
649 /* Find the composite type of the target types, and combine the
650 qualifiers of the two types' targets. Do not lose qualifiers on
651 array element types by taking the TYPE_MAIN_VARIANT. */
660 /* For function types do not merge const qualifiers, but drop them
661 if used inconsistently. The middle-end uses these to mark const
662 and noreturn functions. */
668 else
671 /* If the two named address spaces are different, determine the common
672 superset address space. This is guaranteed to exist due to the
673 assumption that comp_target_type returned non-zero. */
683 }
685 /* Return the common type for two arithmetic types under the usual
686 arithmetic conversions. The default conversions have already been
687 applied, and enumerated types converted to their compatible integer
688 types. The resulting type is unqualified and has no attributes.
690 This is the type for the result of most arithmetic operations
691 if the operands have the given two types. */
693 static tree
695 {
699 /* If one type is nonsense, use the other. */
717 /* Save time if the two types are the same. */
731 /* When one operand is a decimal float type, the other operand cannot be
732 a generic float type or a complex type. We also disallow vector types
733 here. */
736 {
738 {
741 }
743 {
746 }
748 {
751 }
752 }
754 /* If one type is a vector type, return that type. (How the usual
755 arithmetic conversions apply to the vector types extension is not
756 precisely specified.) */
763 /* If one type is complex, form the common type of the non-complex
764 components, then make that complex. Use T1 or T2 if it is the
765 required type. */
767 {
776 else
778 }
780 /* If only one is real, use it as the result. */
788 /* If both are real and either are decimal floating point types, use
789 the decimal floating point type with the greater precision. */
792 {
802 }
804 /* Deal with fixed-point types. */
806 {
814 /* If one input type is saturating, the result type is saturating. */
818 /* If both fixed-point types are unsigned, the result type is unsigned.
819 When mixing fixed-point and integer types, follow the sign of the
820 fixed-point type.
821 Otherwise, the result type is signed. */
830 /* The result type is signed. */
832 {
833 /* If the input type is unsigned, we need to convert to the
834 signed type. */
836 {
842 else
845 }
847 {
853 else
856 }
857 }
860 {
863 }
864 else
865 {
867 /* Signed integers need to subtract one sign bit. */
869 }
872 {
875 }
876 else
877 {
879 /* Signed integers need to subtract one sign bit. */
881 }
886 satp);
887 }
889 /* Both real or both integers; use the one with greater precision. */
896 /* Same precision. Prefer long longs to longs to ints when the
897 same precision, following the C99 rules on integer type rank
898 (which are equivalent to the C90 rules for C90 types). */
906 {
909 else
911 }
919 {
920 /* But preserve unsignedness from the other type,
921 since long cannot hold all the values of an unsigned int. */
924 else
926 }
928 /* Likewise, prefer long double to double even if same size. */
933 /* Otherwise prefer the unsigned one. */
937 else
939 }
940 \f
941 /* Wrapper around c_common_type that is used by c-common.c and other
942 front end optimizations that remove promotions. ENUMERAL_TYPEs
943 are allowed here and are converted to their compatible integer types.
944 BOOLEAN_TYPEs are allowed here and return either boolean_type_node or
945 preferably a non-Boolean type as the common type. */
946 tree
948 {
954 /* If both types are BOOLEAN_TYPE, then return boolean_type_node. */
959 /* If either type is BOOLEAN_TYPE, then return the other. */
966 }
968 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
969 or various other operations. Return 2 if they are compatible
970 but a warning may be needed if you use them together. */
972 int
974 {
982 }
984 /* Like comptypes, but if it returns non-zero because enum and int are
985 compatible, it sets *ENUM_AND_INT_P to true. */
987 static int
989 {
997 }
998 \f
999 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
1000 or various other operations. Return 2 if they are compatible
1001 but a warning may be needed if you use them together. If
1002 ENUM_AND_INT_P is not NULL, and one type is an enum and the other a
1003 compatible integer type, then this sets *ENUM_AND_INT_P to true;
1004 *ENUM_AND_INT_P is never set to false. This differs from
1005 comptypes, in that we don't free the seen types. */
1007 static int
1009 {
1014 /* Suppress errors caused by previously reported errors. */
1020 /* If either type is the internal version of sizetype, return the
1021 language version. */
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 {
1040 }
1042 {
1046 }
1051 /* Different classes of types can't be compatible. */
1056 /* Qualifiers must match. C99 6.7.3p9 */
1061 /* Allow for two different type nodes which have essentially the same
1062 definition. Note that we already checked for equality of the type
1063 qualifiers (just above). */
1069 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1073 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1077 {
1079 /* Do not remove mode or aliasing information. */
1085 enum_and_int_p));
1093 {
1100 /* Target types must match incl. qualifiers. */
1103 enum_and_int_p)))
1106 /* Sizes must match unless one is missing or variable. */
1113 d1_variable = (!d1_zero
1116 d2_variable = (!d2_zero
1132 }
1138 {
1149 }
1155 enum_and_int_p));
1160 }
1162 }
1164 /* Return 1 if TTL and TTR are pointers to types that are equivalent, ignoring
1165 their qualifiers, except for named address spaces. If the pointers point to
1166 different named addresses, then we must determine if one address space is a
1167 subset of the other. */
1169 static int
1171 {
1177 addr_space_t as_common;
1180 /* Fail if pointers point to incompatible address spaces. */
1184 /* Do not lose qualifiers on element types of array types that are
1185 pointer targets by taking their TYPE_MAIN_VARIANT. */
1201 }
1202 \f
1203 /* Subroutines of `comptypes'. */
1205 /* Determine whether two trees derive from the same translation unit.
1206 If the CONTEXT chain ends in a null, that tree's context is still
1207 being parsed, so if two trees have context chains ending in null,
1208 they're in the same translation unit. */
1209 int
1211 {
1214 {
1222 }
1226 {
1234 }
1237 }
1239 /* Allocate the seen two types, assuming that they are compatible. */
1243 {
1251 /* The C standard says that two structures in different translation
1252 units are compatible with each other only if the types of their
1253 fields are compatible (among other things). We assume that they
1254 are compatible until proven otherwise when building the cache.
1255 An example where this can occur is:
1256 struct a
1257 {
1258 struct a *next;
1259 };
1260 If we are comparing this against a similar struct in another TU,
1261 and did not assume they were compatible, we end up with an infinite
1262 loop. */
1265 }
1267 /* Free the seen types until we get to TU_TIL. */
1269 static void
1271 {
1274 {
1279 }
1281 }
1283 /* Return 1 if two 'struct', 'union', or 'enum' types T1 and T2 are
1284 compatible. If the two types are not the same (which has been
1285 checked earlier), this can only happen when multiple translation
1286 units are being compiled. See C99 6.2.7 paragraph 1 for the exact
1287 rules. ENUM_AND_INT_P is as in comptypes_internal. */
1289 static int
1292 {
1296 /* We have to verify that the tags of the types are the same. This
1297 is harder than it looks because this may be a typedef, so we have
1298 to go look at the original type. It may even be a typedef of a
1299 typedef...
1300 In the case of compiler-created builtin structs the TYPE_DECL
1301 may be a dummy, with no DECL_ORIGINAL_TYPE. Don't fault. */
1312 /* C90 didn't have the requirement that the two tags be the same. */
1316 /* C90 didn't say what happened if one or both of the types were
1317 incomplete; we choose to follow C99 rules here, which is that they
1318 are compatible. */
1323 {
1328 }
1331 {
1333 {
1335 /* Speed up the case where the type values are in the same order. */
1340 {
1342 }
1345 {
1349 {
1352 }
1353 }
1356 {
1358 }
1360 {
1363 }
1366 {
1369 }
1372 {
1376 {
1379 }
1380 }
1382 }
1385 {
1388 {
1391 }
1393 /* Speed up the common case where the fields are in the same order. */
1396 {
1402 enum_and_int_p);
1407 {
1410 }
1417 {
1420 }
1421 }
1423 {
1426 }
1429 {
1434 {
1438 enum_and_int_p);
1443 {
1446 }
1457 }
1459 {
1462 }
1463 }
1466 }
1469 {
1475 {
1481 enum_and_int_p);
1491 }
1494 else
1497 }
1501 }
1502 }
1504 /* Return 1 if two function types F1 and F2 are compatible.
1505 If either type specifies no argument types,
1506 the other must specify a fixed number of self-promoting arg types.
1507 Otherwise, if one type specifies only the number of arguments,
1508 the other must specify that number of self-promoting arg types.
1509 Otherwise, the argument types must match.
1510 ENUM_AND_INT_P is as in comptypes_internal. */
1512 static int
1515 {
1517 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1525 /* 'volatile' qualifiers on a function's return type used to mean
1526 the function is noreturn. */
1542 /* An unspecified parmlist matches any specified parmlist
1543 whose argument types don't need default promotions. */
1546 {
1549 /* If one of these types comes from a non-prototype fn definition,
1550 compare that with the other type's arglist.
1551 If they don't match, ask for a warning (but no error). */
1554 enum_and_int_p))
1557 }
1559 {
1564 enum_and_int_p))
1567 }
1569 /* Both types have argument lists: compare them and propagate results. */
1572 }
1574 /* Check two lists of types for compatibility, returning 0 for
1575 incompatible, 1 for compatible, or 2 for compatible with
1576 warning. ENUM_AND_INT_P is as in comptypes_internal. */
1578 static int
1581 {
1582 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1587 {
1591 /* If one list is shorter than the other,
1592 they fail to match. */
1601 /* A null pointer instead of a type
1602 means there is supposed to be an argument
1603 but nothing is specified about what type it has.
1604 So match anything that self-promotes. */
1606 {
1609 }
1611 {
1614 }
1615 /* If one of the lists has an error marker, ignore this arg. */
1618 ;
1620 {
1621 /* Allow wait (union {union wait *u; int *i} *)
1622 and wait (union wait *) to be compatible. */
1629 {
1630 tree memb;
1633 {
1640 }
1643 }
1650 {
1651 tree memb;
1654 {
1661 }
1664 }
1665 else
1667 }
1669 /* comptypes said ok, but record if it said to warn. */
1675 }
1676 }
1677 \f
1678 /* Compute the size to increment a pointer by. */
1680 static tree
1682 {
1689 {
1692 }
1694 /* Convert in case a char is more than one unit. */
1698 }
1699 \f
1700 /* Return either DECL or its known constant value (if it has one). */
1702 tree
1704 {
1706 in a place where a variable is invalid. Note that DECL_INITIAL
1707 isn't valid for a PARM_DECL. */
1714 /* This is invalid if initial value is not constant.
1715 If it has either a function call, a memory reference,
1716 or a variable, then re-evaluating it could give different results. */
1718 /* Check for cases where this is sub-optimal, even though valid. */
1722 }
1724 /* Convert the array expression EXP to a pointer. */
1725 static tree
1727 {
1730 tree adr;
1732 tree ptrtype;
1748 }
1750 /* Convert the function expression EXP to a pointer. */
1751 static tree
1753 {
1764 }
1766 /* Perform the default conversion of arrays and functions to pointers.
1767 Return the result of converting EXP. For any other expression, just
1768 return EXP.
1770 LOC is the location of the expression. */
1772 struct c_expr
1774 {
1780 {
1782 {
1789 {
1793 }
1800 {
1801 /* Before C99, non-lvalue arrays do not decay to pointers.
1802 Normally, using such an array would be invalid; but it can
1803 be used correctly inside sizeof or as a statement expression.
1804 Thus, do not give an error here; an error will result later. */
1806 }
1809 }
1816 }
1819 }
1822 /* EXP is an expression of integer type. Apply the integer promotions
1823 to it and return the promoted value. */
1825 tree
1827 {
1833 /* Normally convert enums to int,
1834 but convert wide enums to something wider. */
1836 {
1844 }
1846 /* ??? This should no longer be needed now bit-fields have their
1847 proper types. */
1850 /* If it's thinner than an int, promote it like a
1851 c_promoting_integer_type_p, otherwise leave it alone. */
1857 {
1858 /* Preserve unsignedness if not really getting any wider. */
1864 }
1867 }
1870 /* Perform default promotions for C data used in expressions.
1871 Enumeral types or short or char are converted to int.
1872 In addition, manifest constants symbols are replaced by their values. */
1874 tree
1876 {
1877 tree orig_exp;
1880 tree promoted_type;
1882 /* Functions and arrays have been converted during parsing. */
1887 /* Constants can be used directly unless they're not loadable. */
1891 /* Strip no-op conversions. */
1899 {
1902 }
1916 }
1917 \f
1918 /* Look up COMPONENT in a structure or union DECL.
1920 If the component name is not found, returns NULL_TREE. Otherwise,
1921 the return value is a TREE_LIST, with each TREE_VALUE a FIELD_DECL
1922 stepping down the chain to the component, which is in the last
1923 TREE_VALUE of the list. Normally the list is of length one, but if
1924 the component is embedded within (nested) anonymous structures or
1925 unions, the list steps down the chain to the component. */
1927 static tree
1929 {
1931 tree field;
1933 /* If TYPE_LANG_SPECIFIC is set, then it is a sorted array of pointers
1934 to the field elements. Use a binary search on this array to quickly
1935 find the element. Otherwise, do a linear search. TYPE_LANG_SPECIFIC
1936 will always be set for structures which have many elements. */
1939 {
1947 {
1952 {
1953 /* Step through all anon unions in linear fashion. */
1955 {
1959 {
1964 }
1965 }
1967 /* Entire record is only anon unions. */
1971 /* Restart the binary search, with new lower bound. */
1973 }
1979 else
1981 }
1987 }
1988 else
1989 {
1991 {
1995 {
2000 }
2004 }
2008 }
2011 }
2013 /* Make an expression to refer to the COMPONENT field of structure or
2014 union value DATUM. COMPONENT is an IDENTIFIER_NODE. LOC is the
2015 location of the COMPONENT_REF. */
2017 tree
2019 {
2023 tree ref;
2029 /* See if there is a field or component with name COMPONENT. */
2032 {
2034 {
2037 }
2042 {
2045 }
2047 /* Chain the COMPONENT_REFs if necessary down to the FIELD.
2048 This might be better solved in future the way the C++ front
2049 end does it - by giving the anonymous entities each a
2050 separate name and type, and then have build_component_ref
2051 recursively call itself. We can't do that here. */
2052 do
2053 {
2056 tree subtype;
2062 /* If this is an rvalue, it does not have qualifiers in C
2063 standard terms and we must avoid propagating such
2064 qualifiers down to a non-lvalue array that is then
2065 converted to a pointer. */
2066 use_datum_quals = (datum_lvalue
2075 NULL_TREE);
2090 }
2094 }
2098 component);
2101 }
2102 \f
2103 /* Given an expression PTR for a pointer, return an expression
2104 for the value pointed to.
2105 ERRORSTRING is the name of the operator to appear in error messages.
2107 LOC is the location to use for the generated tree. */
2109 tree
2111 {
2114 tree ref;
2117 {
2120 {
2121 /* If a warning is issued, mark it to avoid duplicates from
2122 the backend. This only needs to be done at
2123 warn_strict_aliasing > 2. */
2128 }
2133 {
2137 }
2138 else
2139 {
2145 {
2148 }
2152 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
2153 so that we get the proper error message if the result is used
2154 to assign to. Also, &* is supposed to be a no-op.
2155 And ANSI C seems to specify that the type of the result
2156 should be the const type. */
2157 /* A de-reference of a pointer to const is not a const. It is valid
2158 to change it via some other pointer. */
2165 }
2166 }
2171 }
2173 /* This handles expressions of the form "a[i]", which denotes
2174 an array reference.
2176 This is logically equivalent in C to *(a+i), but we may do it differently.
2177 If A is a variable or a member, we generate a primitive ARRAY_REF.
2178 This avoids forcing the array out of registers, and can work on
2179 arrays that are not lvalues (for example, members of structures returned
2180 by functions).
2182 LOC is the location to use for the returned expression. */
2184 tree
2186 {
2187 tree ret;
2195 {
2196 tree temp;
2199 {
2202 }
2207 }
2210 {
2213 }
2216 {
2219 }
2221 /* ??? Existing practice has been to warn only when the char
2222 index is syntactically the index, not for char[array]. */
2226 /* Apply default promotions *after* noticing character types. */
2232 {
2235 /* An array that is indexed by a non-constant
2236 cannot be stored in a register; we must be able to do
2237 address arithmetic on its address.
2238 Likewise an array of elements of variable size. */
2242 {
2245 }
2246 /* An array that is indexed by a constant value which is not within
2247 the array bounds cannot be stored in a register either; because we
2248 would get a crash in store_bit_field/extract_bit_field when trying
2249 to access a non-existent part of the register. */
2253 {
2256 }
2259 {
2269 }
2273 /* Array ref is const/volatile if the array elements are
2274 or if the array is. */
2283 /* This was added by rms on 16 Nov 91.
2284 It fixes vol struct foo *a; a->elts[1]
2285 in an inline function.
2286 Hope it doesn't break something else. */
2291 }
2292 else
2293 {
2302 return build_indirect_ref
2305 }
2306 }
2307 \f
2308 /* Build an external reference to identifier ID. FUN indicates
2309 whether this will be used for a function call. LOC is the source
2310 location of the identifier. This sets *TYPE to the type of the
2311 identifier, which is not the same as the type of the returned value
2312 for CONST_DECLs defined as enum constants. If the type of the
2313 identifier is not available, *TYPE is set to NULL. */
2314 tree
2316 {
2317 tree ref;
2320 /* In Objective-C, an instance variable (ivar) may be preferred to
2321 whatever lookup_name() found. */
2326 {
2329 }
2331 /* Implicit function declaration. */
2334 /* Don't complain about something that's already been
2335 complained about. */
2337 else
2338 {
2341 }
2349 /* Recursive call does not count as usage. */
2351 {
2353 }
2356 {
2363 }
2366 {
2372 {
2377 }
2381 }
2387 {
2392 }
2393 /* C99 6.7.4p3: An inline definition of a function with external
2394 linkage ... shall not contain a reference to an identifier with
2395 internal linkage. */
2404 csi_internal);
2407 }
2409 /* Record details of decls possibly used inside sizeof or typeof. */
2410 struct maybe_used_decl
2411 {
2412 /* The decl. */
2413 tree decl;
2414 /* The level seen at (in_sizeof + in_typeof). */
2416 /* The next one at this level or above, or NULL. */
2418 };
2422 /* Record that DECL, an undefined static function reference seen
2423 inside sizeof or typeof, might be used if the operand of sizeof is
2424 a VLA type or the operand of typeof is a variably modified
2425 type. */
2427 static void
2429 {
2435 }
2437 /* Pop the stack of decls possibly used inside sizeof or typeof. If
2438 USED is false, just discard them. If it is true, mark them used
2439 (if no longer inside sizeof or typeof) or move them to the next
2440 level up (if still inside sizeof or typeof). */
2442 void
2444 {
2448 {
2450 {
2453 else
2455 }
2457 }
2460 }
2462 /* Return the result of sizeof applied to EXPR. */
2464 struct c_expr
2466 {
2469 {
2474 }
2475 else
2476 {
2484 {
2485 /* sizeof is evaluated when given a vla (C99 6.5.3.4p2). */
2490 }
2492 }
2494 }
2496 /* Return the result of sizeof applied to T, a structure for the type
2497 name passed to sizeof (rather than the type itself). LOC is the
2498 location of the original expression. */
2500 struct c_expr
2502 {
2503 tree type;
2513 {
2514 /* If the type is a [*] array, it is a VLA but is represented as
2515 having a size of zero. In such a case we must ensure that
2516 the result of sizeof does not get folded to a constant by
2517 c_fully_fold, because if the size is evaluated the result is
2518 not constant and so constraints on zero or negative size
2519 arrays must not be applied when this sizeof call is inside
2520 another array declarator. */
2526 }
2530 }
2532 /* Build a function call to function FUNCTION with parameters PARAMS.
2533 The function call is at LOC.
2534 PARAMS is a list--a chain of TREE_LIST nodes--in which the
2535 TREE_VALUE of each node is a parameter-expression.
2536 FUNCTION's data type may be a function type or a pointer-to-function. */
2538 tree
2540 {
2542 tree ret;
2550 }
2552 /* Build a function call to function FUNCTION with parameters PARAMS.
2553 ORIGTYPES, if not NULL, is a vector of types; each element is
2554 either NULL or the original type of the corresponding element in
2555 PARAMS. The original type may differ from TREE_TYPE of the
2556 parameter for enums. FUNCTION's data type may be a function type
2557 or pointer-to-function. This function changes the elements of
2558 PARAMS. */
2560 tree
2563 {
2566 tree tem;
2571 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
2574 /* Convert anything with function type to a pointer-to-function. */
2576 {
2577 /* Implement type-directed function overloading for builtins.
2578 resolve_overloaded_builtin and targetm.resolve_overloaded_builtin
2579 handle all the type checking. The result is a complete expression
2580 that implements this function call. */
2587 }
2591 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
2592 expressions, like those used for ObjC messenger dispatches. */
2606 {
2609 }
2614 /* fntype now gets the type of function pointed to. */
2617 /* Convert the parameters to the types declared in the
2618 function prototype, or apply default promotions. */
2625 /* Check that the function is called through a compatible prototype.
2626 If it is not, replace the call by a trap, wrapped up in a compound
2627 expression if necessary. This has the nice side-effect to prevent
2628 the tree-inliner from generating invalid assignment trees which may
2629 blow up in the RTL expander later. */
2634 {
2637 NULL_TREE);
2640 /* This situation leads to run-time undefined behavior. We can't,
2641 therefore, simply error unless we can prove that all possible
2642 executions of the program must execute the code. */
2644 /* We can, however, treat "undefined" any way we please.
2645 Call abort to encourage the user to fix the program. */
2647 /* Before the abort, allow the function arguments to exit or
2648 call longjmp. */
2654 {
2659 }
2660 else
2661 {
2662 tree rhs;
2668 else
2673 }
2674 }
2678 /* Check that arguments to builtin functions match the expectations. */
2685 /* Check that the arguments to the function are valid. */
2691 {
2693 result =
2696 else
2702 }
2703 else
2708 {
2713 }
2715 }
2716 \f
2717 /* Convert the argument expressions in the vector VALUES
2718 to the types in the list TYPELIST.
2720 If TYPELIST is exhausted, or when an element has NULL as its type,
2721 perform the default conversions.
2723 ORIGTYPES is the original types of the expressions in VALUES. This
2724 holds the type of enum values which have been converted to integral
2725 types. It may be NULL.
2727 FUNCTION is a tree for the called function. It is used only for
2728 error messages, where it is formatted with %qE.
2730 This is also where warnings about wrong number of args are generated.
2732 Returns the actual number of arguments processed (which may be less
2733 than the length of VALUES in some error situations), or -1 on
2734 failure. */
2736 static int
2739 {
2746 tree selector;
2748 /* Change pointer to function to the function itself for
2749 diagnostics. */
2754 /* Handle an ObjC selector specially for diagnostics. */
2757 /* For type-generic built-in functions, determine whether excess
2758 precision should be removed (classification) or not
2759 (comparison). */
2763 {
2765 {
2778 }
2779 }
2781 /* Scan the given expressions and types, producing individual
2782 converted arguments. */
2787 {
2795 tree parmval;
2798 {
2801 }
2804 {
2807 }
2811 /* If there is excess precision and a prototype, convert once to
2812 the required type rather than converting via the semantic
2813 type. Likewise without a prototype a float value represented
2814 as long double should be converted once to double. But for
2815 type-generic classification functions excess precision must
2816 be removed here. */
2819 {
2822 }
2829 {
2830 /* Formal parm type is specified by a function prototype. */
2833 {
2836 }
2837 else
2838 {
2839 tree origtype;
2841 /* Optionally warn about conversions that
2842 differ from the default conversions. */
2844 {
2877 /* ??? At some point, messages should be written about
2878 conversions between complex types, but that's too messy
2879 to do now. */
2882 {
2883 /* Warn if any argument is passed as `float',
2884 since without a prototype it would be `double'. */
2891 /* Warn if mismatch between argument and prototype
2892 for decimal float types. Warn of conversions with
2893 binary float types and of precision narrowing due to
2894 prototype. */
2902 && (formal_prec
2905 && (valtype
2906 != dfloat64_type_node
2907 && (valtype
2910 && (valtype
2916 }
2917 /* Detect integer changing in width or signedness.
2918 These warnings are only activated with
2919 -Wtraditional-conversion, not with -Wtraditional. */
2922 {
2929 /* No warning if function asks for enum
2930 and the actual arg is that enum type. */
2931 ;
2934 "passing argument %d of %qE "
2938 ;
2939 /* Don't complain if the formal parameter type
2940 is an enum, because we can't tell now whether
2941 the value was an enum--even the same enum. */
2943 ;
2946 /* Change in signedness doesn't matter
2947 if a constant value is unaffected. */
2948 ;
2949 /* If the value is extended from a narrower
2950 unsigned type, it doesn't matter whether we
2951 pass it as signed or unsigned; the value
2952 certainly is the same either way. */
2955 ;
2958 "passing argument %d of %qE "
2961 else
2963 "passing argument %d of %qE "
2965 }
2966 }
2968 /* Possibly restore an EXCESS_PRECISION_EXPR for the
2969 sake of better warnings from convert_and_check. */
2973 ? NULL_TREE
2984 }
2985 }
2990 {
2993 else
2994 /* Convert `float' to `double'. */
2996 }
2998 /* A "double" argument with excess precision being passed
2999 without a prototype or in variable arguments. */
3003 {
3006 }
3007 else
3008 /* Convert `short' and `char' to full-size `int'. */
3017 }
3022 {
3025 }
3028 }
3029 \f
3030 /* This is the entry point used by the parser to build unary operators
3031 in the input. CODE, a tree_code, specifies the unary operator, and
3032 ARG is the operand. For unary plus, the C parser currently uses
3033 CONVERT_EXPR for code.
3035 LOC is the location to use for the tree generated.
3036 */
3038 struct c_expr
3040 {
3051 }
3053 /* This is the entry point used by the parser to build binary operators
3054 in the input. CODE, a tree_code, specifies the binary operator, and
3055 ARG1 and ARG2 are the operands. In addition to constructing the
3056 expression, we check for operands that were written with other binary
3057 operators in a way that is likely to confuse the user.
3059 LOCATION is the location of the binary operator. */
3061 struct c_expr
3064 {
3087 /* Check for cases such as x+y<<z which users are likely
3088 to misinterpret. */
3096 /* Warn about comparisons against string literals, with the exception
3097 of testing for equality or inequality of a string literal with NULL. */
3099 {
3104 }
3115 /* Warn about comparisons of different enum types. */
3126 }
3127 \f
3128 /* Return a tree for the difference of pointers OP0 and OP1.
3129 The resulting tree has type int. */
3131 static tree
3133 {
3143 /* If the operands point into different address spaces, we need to
3144 explicitly convert them to pointers into the common address space
3145 before we can subtract the numerical address values. */
3147 {
3148 addr_space_t as_common;
3149 tree common_type;
3151 /* Determine the common superset address space. This is guaranteed
3152 to exist because the caller verified that comp_target_types
3153 returned non-zero. */
3160 }
3162 /* Determine integer type to perform computations in. This will usually
3163 be the same as the result type (ptrdiff_t), but may need to be a wider
3164 type if pointers for the address space are wider than ptrdiff_t. */
3168 else
3179 /* If the conversion to ptrdiff_type does anything like widening or
3180 converting a partial to an integral mode, we get a convert_expression
3181 that is in the way to do any simplifications.
3182 (fold-const.c doesn't know that the extra bits won't be needed.
3183 split_tree uses STRIP_SIGN_NOPS, which leaves conversions to a
3184 different mode in place.)
3185 So first try to find a common term here 'by hand'; we want to cover
3186 at least the cases that occur in legal static initializers. */
3191 else
3197 else
3201 {
3204 }
3205 else
3209 {
3212 }
3213 else
3217 {
3220 }
3223 /* First do the subtraction as integers;
3224 then drop through to build the divide operator.
3225 Do not do default conversions on the minus operator
3226 in case restype is a short type. */
3231 /* This generates an error if op1 is pointer to incomplete type. */
3235 /* This generates an error if op0 is pointer to incomplete type. */
3238 /* Divide by the size, in easiest possible way. */
3242 /* Convert to final result type if necessary. */
3244 }
3245 \f
3246 /* Construct and perhaps optimize a tree representation
3247 for a unary operation. CODE, a tree_code, specifies the operation
3248 and XARG is the operand.
3249 For any CODE other than ADDR_EXPR, FLAG nonzero suppresses
3250 the default promotions (such as from short to int).
3251 For ADDR_EXPR, the default promotions are not applied; FLAG nonzero
3252 allows non-lvalues; this is only used to handle conversion of non-lvalue
3253 arrays to pointers in C99.
3255 LOCATION is the location of the operator. */
3257 tree
3260 {
3261 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
3265 tree val;
3287 {
3290 }
3293 {
3296 }
3299 {
3301 /* This is used for unary plus, because a CONVERT_EXPR
3302 is enough to prevent anybody from looking inside for
3303 associativity, but won't generate any code. */
3307 {
3310 }
3320 {
3323 }
3329 /* ~ works on integer types and non float vectors. */
3333 {
3336 }
3338 {
3344 }
3345 else
3346 {
3349 }
3354 {
3357 }
3363 /* Conjugating a real value is a no-op, but allow it anyway. */
3366 {
3369 }
3378 {
3382 }
3385 /* If the TRUTH_NOT_EXPR has been folded, reset the location. */
3396 else
3408 else
3421 {
3431 }
3433 /* Complain about anything that is not a true lvalue. */
3436 ? lv_increment
3441 {
3445 else
3448 }
3450 /* Ensure the argument is fully folded inside any SAVE_EXPR. */
3453 /* Increment or decrement the real part of the value,
3454 and don't change the imaginary part. */
3456 {
3471 }
3473 /* Report invalid types. */
3477 {
3480 else
3484 }
3486 {
3487 tree inc;
3491 /* Compute the increment. */
3494 {
3495 /* If pointer target is an undefined struct,
3496 we just cannot know how to do the arithmetic. */
3498 {
3502 else
3505 }
3508 {
3512 else
3515 }
3519 }
3521 {
3522 /* For signed fract types, we invert ++ to -- or
3523 -- to ++, and change inc from 1 to -1, because
3524 it is not possible to represent 1 in signed fract constants.
3525 For unsigned fract types, the result always overflows and
3526 we get an undefined (original) or the maximum value. */
3538 }
3539 else
3540 {
3543 }
3545 /* Report a read-only lvalue. */
3547 {
3553 }
3562 else
3569 }
3572 /* Note that this operation never does default_conversion. */
3574 /* The operand of unary '&' must be an lvalue (which excludes
3575 expressions of type void), or, in C99, the result of a [] or
3576 unary '*' operator. */
3583 /* Let &* cancel out to simplify resulting code. */
3585 {
3586 /* Don't let this be an lvalue. */
3591 }
3593 /* For &x[y], return x+y */
3595 {
3602 op0)
3605 }
3607 /* Anything not already handled and not a true memory reference
3608 or a non-lvalue array is an error. */
3613 /* Move address operations inside C_MAYBE_CONST_EXPR to simplify
3614 folding later. */
3616 {
3625 }
3627 /* Ordinary case; arg is a COMPONENT_REF or a decl. */
3630 /* If the lvalue is const or volatile, merge that into the type
3631 to which the address will point. Note that you can't get a
3632 restricted pointer by taking the address of something, so we
3633 only have to deal with `const' and `volatile' here. */
3648 /* ??? Cope with user tricks that amount to offsetof. Delete this
3649 when we have proper support for integer constant expressions. */
3653 {
3660 }
3669 }
3674 ret = (require_constant_value
3677 else
3679 return_build_unary_op:
3690 }
3692 /* Return nonzero if REF is an lvalue valid for this language.
3693 Lvalues can be assigned, unless their type has TYPE_READONLY.
3694 Lvalues can have their address taken, unless they have C_DECL_REGISTER. */
3696 bool
3698 {
3702 {
3729 }
3730 }
3731 \f
3732 /* Give an error for storing in something that is 'const'. */
3734 static void
3736 {
3739 /* Using this macro rather than (for example) arrays of messages
3740 ensures that all the format strings are checked at compile
3741 time. */
3742 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
3743 : (use == lv_increment ? (I) \
3744 : (use == lv_decrement ? (D) : (AS))))
3746 {
3749 else
3755 }
3761 arg);
3762 else
3767 arg);
3768 }
3770 /* Give a warning for storing in something that is read-only in GCC
3771 terms but not const in ISO C terms. */
3773 static void
3775 {
3777 {
3789 }
3791 }
3794 /* Return nonzero if REF is an lvalue valid for this language;
3795 otherwise, print an error message and return zero. USE says
3796 how the lvalue is being used and so selects the error message. */
3798 static int
3800 {
3807 }
3808 \f
3809 /* Mark EXP saying that we need to be able to take the
3810 address of it; it should not be allocated in a register.
3811 Returns true if successful. */
3813 bool
3815 {
3820 {
3823 {
3824 error
3827 }
3829 /* ... fall through ... */
3849 {
3851 {
3852 error
3855 }
3857 }
3859 {
3862 else
3865 }
3867 /* drops in */
3870 /* drops out */
3873 }
3874 }
3875 \f
3876 /* Build and return a conditional expression IFEXP ? OP1 : OP2. If
3877 IFEXP_BCP then the condition is a call to __builtin_constant_p, and
3878 if folded to an integer constant then the unselected half may
3879 contain arbitrary operations not normally permitted in constant
3880 expressions. Set the location of the expression to LOC. */
3882 tree
3885 tree op2_original_type)
3886 {
3887 tree type1;
3888 tree type2;
3896 tree ret;
3909 /* Promote both alternatives. */
3926 /* C90 does not permit non-lvalue arrays in conditional expressions.
3927 In C99 they will be pointers by now. */
3929 {
3932 }
3942 {
3945 {
3949 }
3951 {
3955 }
3956 }
3959 {
3970 }
3972 /* Quickly detect the usual case where op1 and op2 have the same type
3973 after promotion. */
3975 {
3978 else
3980 }
3985 {
3988 /* If -Wsign-compare, warn here if type1 and type2 have
3989 different signedness. We'll promote the signed to unsigned
3990 and later code won't know it used to be different.
3991 Do this check on the original types, so that explicit casts
3992 will be considered, but default promotions won't. */
3994 {
3999 {
4002 /* Do not warn if the result type is signed, since the
4003 signed type will only be chosen if it can represent
4004 all the values of the unsigned type. */
4007 else
4008 {
4012 /* Do not warn if the signed quantity is an
4013 unsuffixed integer literal (or some static
4014 constant expression involving such literals) and
4015 it is non-negative. This warning requires the
4016 operands to be folded for best results, so do
4017 that folding in this case even without
4018 warn_sign_compare to avoid warning options
4019 possibly affecting code generation. */
4020 c_inhibit_evaluation_warnings
4024 c_inhibit_evaluation_warnings
4027 c_inhibit_evaluation_warnings
4031 c_inhibit_evaluation_warnings
4035 {
4038 || (unsigned_op1
4041 else
4045 }
4050 }
4051 }
4052 }
4053 }
4055 {
4060 }
4062 {
4065 addr_space_t as_common;
4074 {
4078 }
4080 {
4083 "ISO C forbids conditional expr between "
4087 }
4089 {
4092 "ISO C forbids conditional expr between "
4096 }
4097 else
4098 {
4104 result_type = build_pointer_type
4106 }
4107 }
4109 {
4113 else
4114 {
4116 }
4118 }
4120 {
4124 else
4125 {
4127 }
4129 }
4132 {
4135 else
4136 {
4139 }
4140 }
4142 /* Merge const and volatile flags of the incoming types. */
4143 result_type
4154 {
4157 }
4159 {
4162 }
4164 && op1_int_operands
4167 {
4174 }
4177 else
4178 {
4182 }
4188 }
4189 \f
4190 /* Return a compound expression that performs two expressions and
4191 returns the value of the second of them.
4193 LOC is the location of the COMPOUND_EXPR. */
4195 tree
4197 {
4200 tree ret;
4212 {
4215 }
4218 {
4219 /* The left-hand operand of a comma expression is like an expression
4220 statement: with -Wunused, we should warn if it doesn't have
4221 any side-effects, unless it was explicitly cast to (void). */
4223 {
4231 else
4234 }
4235 }
4237 /* With -Wunused, we should also warn if the left-hand operand does have
4238 side-effects, but computes a value which is not used. For example, in
4239 `foo() + bar(), baz()' the result of the `+' operator is not used,
4240 so we should issue a warning. */
4250 && expr1_int_operands
4259 }
4261 /* Issue -Wcast-qual warnings when appropriate. TYPE is the type to
4262 which we are casting. OTYPE is the type of the expression being
4263 cast. Both TYPE and OTYPE are pointer types. -Wcast-qual appeared
4264 on the command line. Named address space qualifiers are not handled
4265 here, because they result in different warnings. */
4267 static void
4269 {
4276 /* Check that the qualifiers on IN_TYPE are a superset of the
4277 qualifiers of IN_OTYPE. The outermost level of POINTER_TYPE
4278 nodes is uninteresting and we stop as soon as we hit a
4279 non-POINTER_TYPE node on either type. */
4280 do
4281 {
4285 /* GNU C allows cv-qualified function types. 'const' means the
4286 function is very pure, 'volatile' means it can't return. We
4287 need to warn when such qualifiers are added, not when they're
4288 taken away. */
4293 else
4296 }
4304 /* There are qualifiers present in IN_OTYPE that are not present
4305 in IN_TYPE. */
4312 /* A cast from **T to const **T is unsafe, because it can cause a
4313 const value to be changed with no additional warning. We only
4314 issue this warning if T is the same on both sides, and we only
4315 issue the warning if there are the same number of pointers on
4316 both sides, as otherwise the cast is clearly unsafe anyhow. A
4317 cast is unsafe when a qualifier is added at one level and const
4318 is not present at all outer levels.
4320 To issue this warning, we check at each level whether the cast
4321 adds new qualifiers not already seen. We don't need to special
4322 case function types, as they won't have the same
4323 TYPE_MAIN_VARIANT. */
4333 do
4334 {
4339 {
4344 }
4347 }
4349 }
4351 /* Build an expression representing a cast to type TYPE of expression EXPR.
4352 LOC is the location of the cast-- typically the open paren of the cast. */
4354 tree
4356 {
4357 tree value;
4367 /* The ObjC front-end uses TYPE_MAIN_VARIANT to tie together types differing
4368 only in <protocol> qualifications. But when constructing cast expressions,
4369 the protocols do matter and must be kept around. */
4376 {
4379 }
4382 {
4385 }
4388 {
4392 }
4395 {
4400 }
4402 {
4403 tree field;
4412 {
4413 tree t;
4421 }
4424 }
4425 else
4426 {
4430 {
4434 }
4438 /* Optionally warn about potentially worrisome casts. */
4444 /* Warn about conversions between pointers to disjoint
4445 address spaces. */
4449 {
4452 addr_space_t as_common;
4455 {
4466 else
4471 }
4472 }
4474 /* Warn about possible alignment problems. */
4480 /* Don't warn about opaque types, where the actual alignment
4481 restriction is unknown. */
4492 /* Unlike conversion of integers to pointers, where the
4493 warning is disabled for converting constants because
4494 of cases such as SIG_*, warn about converting constant
4495 pointers to integers. In some cases it may cause unwanted
4496 sign extension, and a warning is appropriate. */
4503 "cast from function call of type %qT "
4509 /* Don't warn about converting any constant. */
4518 /* If pedantic, warn for conversions between function and object
4519 pointer types, except for converting a null pointer constant
4520 to function pointer type. */
4541 /* Ignore any integer overflow caused by the cast. */
4543 {
4545 {
4547 {
4548 /* Avoid clobbering a shared constant. */
4551 }
4552 }
4554 /* Reset VALUE's overflow flags, ensuring constant sharing. */
4558 }
4559 }
4561 /* Don't let a cast be an lvalue. */
4565 /* Don't allow the results of casting to floating-point or complex
4566 types be confused with actual constants, or casts involving
4567 integer and pointer types other than direct integer-to-integer
4568 and integer-to-pointer be confused with integer constant
4569 expressions and null pointer constants. */
4582 }
4584 /* Interpret a cast of expression EXPR to type TYPE. LOC is the
4585 location of the open paren of the cast, or the position of the cast
4586 expr. */
4587 tree
4589 {
4590 tree type;
4593 tree ret;
4596 /* This avoids warnings about unprototyped casts on
4597 integers. E.g. "#define SIG_DFL (void(*)())0". */
4605 {
4609 }
4614 /* C++ does not permits types to be defined in a cast. */
4620 }
4621 \f
4622 /* Build an assignment expression of lvalue LHS from value RHS.
4623 If LHS_ORIGTYPE is not NULL, it is the original type of LHS, which
4624 may differ from TREE_TYPE (LHS) for an enum bitfield.
4625 MODIFYCODE is the code for a binary operator that we use
4626 to combine the old value of LHS with RHS to get the new value.
4627 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
4628 If RHS_ORIGTYPE is not NULL_TREE, it is the original type of RHS,
4629 which may differ from TREE_TYPE (RHS) for an enum value.
4631 LOCATION is the location of the MODIFYCODE operator.
4632 RHS_LOC is the location of the RHS. */
4634 tree
4638 {
4639 tree result;
4640 tree newrhs;
4646 /* Types that aren't fully specified cannot be used in assignments. */
4649 /* Avoid duplicate error messages from operands that had errors. */
4657 {
4660 }
4665 {
4668 rhs_origtype);
4677 }
4679 /* If a binary op has been requested, combine the old LHS value with the RHS
4680 producing the value we should actually store into the LHS. */
4683 {
4689 /* The original type of the right hand side is no longer
4690 meaningful. */
4692 }
4694 /* Give an error for storing in something that is 'const'. */
4700 {
4703 }
4707 /* If storing into a structure or union member,
4708 it has probably been given type `int'.
4709 Compute the type that would go with
4710 the actual amount of storage the member occupies. */
4719 /* If storing in a field that is in actuality a short or narrower than one,
4720 we must store in the field in its actual type. */
4723 {
4726 }
4728 /* Issue -Wc++-compat warnings about an assignment to an enum type
4729 when LHS does not have its original type. This happens for,
4730 e.g., an enum bitfield in a struct. */
4735 {
4737 ? rhs_origtype
4743 }
4745 /* Convert new value to destination type. Fold it first, then
4746 restore any excess precision information, for the sake of
4747 conversion warnings. */
4758 /* Emit ObjC write barrier, if necessary. */
4760 {
4763 {
4766 }
4767 }
4769 /* Scan operands. */
4775 /* If we got the LHS in a different type for storing in,
4776 convert the result back to the nominal type of LHS
4777 so that the value we return always has the same type
4778 as the LHS argument. */
4787 }
4788 \f
4789 /* Convert value RHS to type TYPE as preparation for an assignment to
4790 an lvalue of type TYPE. If ORIGTYPE is not NULL_TREE, it is the
4791 original type of RHS; this differs from TREE_TYPE (RHS) for enum
4792 types. NULL_POINTER_CONSTANT says whether RHS was a null pointer
4793 constant before any folding.
4794 The real work of conversion is done by `convert'.
4795 The purpose of this function is to generate error messages
4796 for assignments that are not allowed in C.
4797 ERRTYPE says whether it is argument passing, assignment,
4798 initialization or return.
4800 LOCATION is the location of the RHS.
4801 FUNCTION is a tree for the function being called.
4802 PARMNUM is the number of the argument, for printing in error messages. */
4804 static tree
4809 {
4812 tree rhstype;
4818 {
4819 tree selector;
4820 /* Change pointer to function to the function itself for
4821 diagnostics. */
4826 /* Handle an ObjC selector specially for diagnostics. */
4830 {
4833 }
4834 }
4836 /* This macro is used to emit diagnostics to ensure that all format
4837 strings are complete sentences, visible to gettext and checked at
4838 compile time. */
4839 #define WARN_FOR_ASSIGNMENT(LOCATION, OPT, AR, AS, IN, RE) \
4840 do { \
4841 switch (errtype) \
4842 { \
4843 case ic_argpass: \
4844 if (pedwarn (LOCATION, OPT, AR, parmnum, rname)) \
4845 inform ((fundecl && !DECL_IS_BUILTIN (fundecl)) \
4846 ? DECL_SOURCE_LOCATION (fundecl) : LOCATION, \
4848 type, rhstype); \
4849 break; \
4850 case ic_assign: \
4851 pedwarn (LOCATION, OPT, AS); \
4852 break; \
4853 case ic_init: \
4854 pedwarn (LOCATION, OPT, IN); \
4855 break; \
4856 case ic_return: \
4857 pedwarn (LOCATION, OPT, RE); \
4858 break; \
4859 default: \
4860 gcc_unreachable (); \
4861 } \
4862 } while (0)
4874 {
4878 {
4894 }
4897 }
4900 {
4905 {
4915 }
4916 }
4922 {
4923 /* Except for passing an argument to an unprototyped function,
4924 this is a constraint violation. When passing an argument to
4925 an unprototyped function, it is compile-time undefined;
4926 making it a constraint in that case was rejected in
4927 DR#252. */
4930 }
4934 /* A type converts to a reference to it.
4935 This code doesn't fully support references, it's just for the
4936 special case of va_start and va_copy. */
4939 {
4941 {
4944 }
4950 /* We already know that these two types are compatible, but they
4951 may not be exactly identical. In fact, `TREE_TYPE (type)' is
4952 likely to be __builtin_va_list and `TREE_TYPE (rhs)' is
4953 likely to be va_list, a typedef to __builtin_va_list, which
4954 is different enough that it will cause problems later. */
4956 {
4959 }
4964 }
4965 /* Some types can interconvert without explicit casts. */
4969 /* Arithmetic types all interconvert, and enum is treated like int. */
4978 {
4979 tree ret;
4987 }
4989 /* Aggregates in different TUs might need conversion. */
4995 /* Conversion to a transparent union from its member types.
4996 This applies only to function arguments. */
4999 {
5003 {
5014 {
5018 /* Any non-function converts to a [const][volatile] void *
5019 and vice versa; otherwise, targets must be the same.
5020 Meanwhile, the lhs target must have all the qualifiers of
5021 the rhs. */
5024 {
5025 /* If this type won't generate any warnings, use it. */
5035 /* Keep looking for a better type, but remember this one. */
5038 }
5039 }
5041 /* Can convert integer zero to any pointer type. */
5043 {
5046 }
5047 }
5050 {
5052 {
5053 /* We have only a marginally acceptable member type;
5054 it needs a warning. */
5058 /* Const and volatile mean something different for function
5059 types, so the usual warnings are not appropriate. */
5062 {
5063 /* Because const and volatile on functions are
5064 restrictions that say the function will not do
5065 certain things, it is okay to use a const or volatile
5066 function where an ordinary one is wanted, but not
5067 vice-versa. */
5072 "makes qualified function "
5075 "function pointer from "
5078 "function pointer from "
5082 }
5096 }
5104 }
5105 }
5107 /* Conversions among pointers */
5110 {
5117 addr_space_t asl;
5118 addr_space_t asr;
5124 /* Opaque pointers are treated like void pointers. */
5127 /* C++ does not allow the implicit conversion void* -> T*. However,
5128 for the purpose of reducing the number of false positives, we
5129 tolerate the special case of
5131 int *p = NULL;
5133 where NULL is typically defined in C to be '(void *) 0'. */
5136 "request for implicit conversion "
5139 /* See if the pointers point to incompatible address spaces. */
5144 {
5146 {
5165 }
5167 }
5169 /* Check if the right-hand side has a format attribute but the
5170 left-hand side doesn't. */
5173 {
5175 {
5178 "argument %d of %qE might be "
5184 "assignment left-hand side might be "
5189 "initialization left-hand side might be "
5194 "return type might be "
5199 }
5200 }
5202 /* Any non-function converts to a [const][volatile] void *
5203 and vice versa; otherwise, targets must be the same.
5204 Meanwhile, the lhs target must have all the qualifiers of the rhs. */
5207 || is_opaque_pointer
5210 {
5213 ||
5215 && !null_pointer_constant
5219 "%qE between function pointer "
5227 /* Const and volatile mean something different for function types,
5228 so the usual warnings are not appropriate. */
5231 {
5234 {
5235 /* Types differing only by the presence of the 'volatile'
5236 qualifier are acceptable if the 'volatile' has been added
5237 in by the Objective-C EH machinery. */
5248 }
5249 /* If this is not a case of ignoring a mismatch in signedness,
5250 no warning. */
5253 ;
5254 /* If there is a mismatch, do warn. */
5265 }
5268 {
5269 /* Because const and volatile on functions are restrictions
5270 that say the function will not do certain things,
5271 it is okay to use a const or volatile function
5272 where an ordinary one is wanted, but not vice-versa. */
5277 "qualified function pointer "
5285 }
5286 }
5287 else
5288 /* Avoid warning about the volatile ObjC EH puts on decls. */
5299 }
5301 {
5302 /* ??? This should not be an error when inlining calls to
5303 unprototyped functions. */
5306 }
5308 {
5309 /* An explicit constant 0 can convert to a pointer,
5310 or one that results from arithmetic, even including
5311 a cast to integer type. */
5324 }
5326 {
5337 }
5339 {
5340 tree ret;
5346 }
5349 {
5367 "incompatible types when returning type %qT but %qT was "
5372 }
5375 }
5376 \f
5377 /* If VALUE is a compound expr all of whose expressions are constant, then
5378 return its value. Otherwise, return error_mark_node.
5380 This is for handling COMPOUND_EXPRs as initializer elements
5381 which is allowed with a warning when -pedantic is specified. */
5383 static tree
5385 {
5387 {
5392 endtype);
5393 }
5396 else
5398 }
5399 \f
5400 /* Perform appropriate conversions on the initial value of a variable,
5401 store it in the declaration DECL,
5402 and print any error messages that are appropriate.
5403 If ORIGTYPE is not NULL_TREE, it is the original type of INIT.
5404 If the init is invalid, store an ERROR_MARK.
5406 INIT_LOC is the location of the initial value. */
5408 void
5410 {
5414 /* If variable's type was invalidly declared, just ignore it. */
5420 /* Digest the specified initializer into an expression. */
5427 /* Store the expression if valid; else report error. */
5436 /* ANSI wants warnings about out-of-range constant initializers. */
5441 /* Check if we need to set array size from compound literal size. */
5445 {
5452 {
5456 {
5457 /* For int foo[] = (int [3]){1}; we need to set array size
5458 now since later on array initializer will be just the
5459 brace enclosed list of the compound literal. */
5465 }
5466 }
5467 }
5468 }
5469 \f
5470 /* Methods for storing and printing names for error messages. */
5472 /* Implement a spelling stack that allows components of a name to be pushed
5473 and popped. Each element on the stack is this structure. */
5475 struct spelling
5476 {
5478 union
5479 {
5483 };
5485 #define SPELLING_STRING 1
5486 #define SPELLING_MEMBER 2
5487 #define SPELLING_BOUNDS 3
5493 /* Macros to save and restore the spelling stack around push_... functions.
5494 Alternative to SAVE_SPELLING_STACK. */
5496 #define SPELLING_DEPTH() (spelling - spelling_base)
5497 #define RESTORE_SPELLING_DEPTH(DEPTH) (spelling = spelling_base + (DEPTH))
5499 /* Push an element on the spelling stack with type KIND and assign VALUE
5500 to MEMBER. */
5502 #define PUSH_SPELLING(KIND, VALUE, MEMBER) \
5503 { \
5504 int depth = SPELLING_DEPTH (); \
5505 \
5506 if (depth >= spelling_size) \
5507 { \
5508 spelling_size += 10; \
5509 spelling_base = XRESIZEVEC (struct spelling, spelling_base, \
5510 spelling_size); \
5511 RESTORE_SPELLING_DEPTH (depth); \
5512 } \
5513 \
5514 spelling->kind = (KIND); \
5515 spelling->MEMBER = (VALUE); \
5516 spelling++; \
5517 }
5519 /* Push STRING on the stack. Printed literally. */
5521 static void
5523 {
5525 }
5527 /* Push a member name on the stack. Printed as '.' STRING. */
5529 static void
5531 {
5537 }
5539 /* Push an array bounds on the stack. Printed as [BOUNDS]. */
5541 static void
5543 {
5545 }
5547 /* Compute the maximum size in bytes of the printed spelling. */
5549 static int
5551 {
5556 {
5559 else
5561 }
5564 }
5566 /* Print the spelling to BUFFER and return it. */
5570 {
5576 {
5579 }
5580 else
5581 {
5586 ;
5587 }
5590 }
5592 /* Issue an error message for a bad initializer component.
5593 MSGID identifies the message.
5594 The component name is taken from the spelling stack. */
5596 void
5598 {
5605 }
5607 /* Issue a pedantic warning for a bad initializer component. OPT is
5608 the option OPT_* (from options.h) controlling this warning or 0 if
5609 it is unconditionally given. MSGID identifies the message. The
5610 component name is taken from the spelling stack. */
5612 void
5614 {
5621 }
5623 /* Issue a warning for a bad initializer component.
5625 OPT is the OPT_W* value corresponding to the warning option that
5626 controls this warning. MSGID identifies the message. The
5627 component name is taken from the spelling stack. */
5629 static void
5631 {
5638 }
5639 \f
5640 /* If TYPE is an array type and EXPR is a parenthesized string
5641 constant, warn if pedantic that EXPR is being used to initialize an
5642 object of type TYPE. */
5644 void
5646 {
5653 }
5655 /* Digest the parser output INIT as an initializer for type TYPE.
5656 Return a C expression of type TYPE to represent the initial value.
5658 If ORIGTYPE is not NULL_TREE, it is the original type of INIT.
5660 NULL_POINTER_CONSTANT is true if INIT is a null pointer constant.
5662 If INIT is a string constant, STRICT_STRING is true if it is
5663 unparenthesized or we should not warn here for it being parenthesized.
5664 For other types of INIT, STRICT_STRING is not used.
5666 INIT_LOC is the location of the INIT.
5668 REQUIRE_CONSTANT requests an error if non-constant initializers or
5669 elements are seen. */
5671 static tree
5675 {
5682 || !init
5690 {
5693 }
5697 /* Initialization of an array of chars from a string constant
5698 optionally enclosed in braces. */
5702 {
5704 /* Note that an array could be both an array of character type
5705 and an array of wchar_t if wchar_t is signed char or unsigned
5706 char. */
5715 {
5732 {
5734 {
5737 }
5738 }
5739 else
5740 {
5742 {
5746 }
5748 {
5752 }
5753 }
5759 {
5762 /* Subtract the size of a single (possibly wide) character
5763 because it's ok to ignore the terminating null char
5764 that is counted in the length of the constant. */
5766 (len
5777 }
5780 }
5782 {
5786 }
5787 }
5789 /* Build a VECTOR_CST from a *constant* vector constructor. If the
5790 vector constructor is not constant (e.g. {1,2,3,foo()}) then punt
5791 below and handle as a constructor. */
5796 {
5803 {
5805 tree value;
5808 /* Iterate through elements and check if all constructor
5809 elements are *_CSTs. */
5812 {
5815 }
5820 }
5821 }
5826 /* Any type can be initialized
5827 from an expression of the same type, optionally with braces. */
5840 {
5842 {
5844 {
5847 inside_init = array_to_pointer_conversion
5849 else
5850 {
5853 }
5854 }
5855 }
5858 /* Although the types are compatible, we may require a
5859 conversion. */
5865 {
5866 /* As an extension, allow initializing objects with static storage
5867 duration with compound literals (which are then treated just as
5868 the brace enclosed list they contain). Also allow this for
5869 vectors, as we can only assign them with compound literals. */
5872 }
5876 {
5879 }
5881 /* Compound expressions can only occur here if -pedantic or
5882 -pedantic-errors is specified. In the later case, we always want
5883 an error. In the former case, we simply want a warning. */
5886 {
5887 inside_init
5892 else
5897 }
5901 {
5904 }
5909 /* Added to enable additional -Wmissing-format-attribute warnings. */
5912 origtype,
5916 }
5918 /* Handle scalar types, including conversions. */
5923 {
5930 inside_init);
5931 inside_init
5936 /* Check to see if we have already given an error message. */
5938 ;
5940 {
5943 }
5947 {
5950 }
5956 }
5958 /* Come here only for records and arrays. */
5961 {
5964 }
5968 }
5969 \f
5970 /* Handle initializers that use braces. */
5972 /* Type of object we are accumulating a constructor for.
5973 This type is always a RECORD_TYPE, UNION_TYPE or ARRAY_TYPE. */
5976 /* For a RECORD_TYPE or UNION_TYPE, this is the chain of fields
5977 left to fill. */
5980 /* For an ARRAY_TYPE, this is the specified index
5981 at which to store the next element we get. */
5984 /* For an ARRAY_TYPE, this is the maximum index. */
5987 /* For a RECORD_TYPE, this is the first field not yet written out. */
5990 /* For an ARRAY_TYPE, this is the index of the first element
5991 not yet written out. */
5994 /* In a RECORD_TYPE, the byte index of the next consecutive field.
5995 This is so we can generate gaps between fields, when appropriate. */
5998 /* If we are saving up the elements rather than allocating them,
5999 this is the list of elements so far (in reverse order,
6000 most recent first). */
6003 /* 1 if constructor should be incrementally stored into a constructor chain,
6004 0 if all the elements should be kept in AVL tree. */
6007 /* 1 if so far this constructor's elements are all compile-time constants. */
6010 /* 1 if so far this constructor's elements are all valid address constants. */
6013 /* 1 if this constructor has an element that cannot be part of a
6014 constant expression. */
6017 /* 1 if this constructor is erroneous so far. */
6020 /* Structure for managing pending initializer elements, organized as an
6021 AVL tree. */
6023 struct init_node
6024 {
6028 tree purpose;
6029 tree value;
6030 tree origtype;
6031 };
6033 /* Tree of pending elements at this constructor level.
6034 These are elements encountered out of order
6035 which belong at places we haven't reached yet in actually
6036 writing the output.
6037 Will never hold tree nodes across GC runs. */
6040 /* The SPELLING_DEPTH of this constructor. */
6043 /* DECL node for which an initializer is being read.
6044 0 means we are reading a constructor expression
6045 such as (struct foo) {...}. */
6048 /* Nonzero if this is an initializer for a top-level decl. */
6051 /* Nonzero if there were any member designators in this initializer. */
6054 /* Nesting depth of designator list. */
6057 /* Nonzero if there were diagnosed errors in this designator list. */
6060 \f
6061 /* This stack has a level for each implicit or explicit level of
6062 structuring in the initializer, including the outermost one. It
6063 saves the values of most of the variables above. */
6067 struct constructor_stack
6068 {
6070 tree type;
6071 tree fields;
6072 tree index;
6073 tree max_index;
6074 tree unfilled_index;
6075 tree unfilled_fields;
6076 tree bit_index;
6081 /* If value nonzero, this value should replace the entire
6082 constructor at this level. */
6093 };
6097 /* This stack represents designators from some range designator up to
6098 the last designator in the list. */
6100 struct constructor_range_stack
6101 {
6104 tree range_start;
6105 tree index;
6106 tree range_end;
6107 tree fields;
6108 };
6112 /* This stack records separate initializers that are nested.
6113 Nested initializers can't happen in ANSI C, but GNU C allows them
6114 in cases like { ... (struct foo) { ... } ... }. */
6116 struct initializer_stack
6117 {
6119 tree decl;
6129 };
6132 \f
6133 /* Prepare to parse and output the initializer for variable DECL. */
6135 void
6137 {
6159 {
6161 require_constant_elements
6163 /* For a scalar, you can always use any value to initialize,
6164 even within braces. */
6170 }
6171 else
6172 {
6176 }
6189 }
6191 void
6193 {
6196 /* Free the whole constructor stack of this initializer. */
6198 {
6202 }
6206 /* Pop back to the data of the outer initializer (if any). */
6221 }
6222 \f
6223 /* Call here when we see the initializer is surrounded by braces.
6224 This is instead of a call to push_init_level;
6225 it is matched by a call to pop_init_level.
6227 TYPE is the type to initialize, for a constructor expression.
6228 For an initializer for a decl, TYPE is zero. */
6230 void
6232 {
6281 {
6283 /* Skip any nameless bit fields at the beginning. */
6290 }
6292 {
6294 {
6295 constructor_max_index
6298 /* Detect non-empty initializations of zero-length arrays. */
6303 /* constructor_max_index needs to be an INTEGER_CST. Attempts
6304 to initialize VLAs will cause a proper error; avoid tree
6305 checking errors as well by setting a safe value. */
6310 constructor_index
6313 }
6314 else
6315 {
6318 }
6321 }
6323 {
6324 /* Vectors are like simple fixed-size arrays. */
6325 constructor_max_index =
6329 }
6330 else
6331 {
6332 /* Handle the case of int x = {5}; */
6335 }
6336 }
6337 \f
6338 /* Push down into a subobject, for initialization.
6339 If this is for an explicit set of braces, IMPLICIT is 0.
6340 If it is because the next element belongs at a lower level,
6341 IMPLICIT is 1 (or 2 if the push is because of designator list). */
6343 void
6345 {
6349 /* If we've exhausted any levels that didn't have braces,
6350 pop them now. If implicit == 1, this will have been done in
6351 process_init_element; do not repeat it here because in the case
6352 of excess initializers for an empty aggregate this leads to an
6353 infinite cycle of popping a level and immediately recreating
6354 it. */
6356 {
6358 {
6364 && constructor_max_index
6366 constructor_index))
6368 else
6370 }
6371 }
6373 /* Unless this is an explicit brace, we need to preserve previous
6374 content if any. */
6376 {
6383 }
6420 {
6425 }
6427 /* Don't die if an entire brace-pair level is superfluous
6428 in the containing level. */
6430 ;
6433 {
6434 /* Don't die if there are extra init elts at the end. */
6437 else
6438 {
6441 constructor_depth++;
6442 }
6443 }
6445 {
6448 constructor_depth++;
6449 }
6452 {
6457 }
6460 {
6469 }
6472 {
6475 }
6479 {
6481 /* Skip any nameless bit fields at the beginning. */
6488 }
6490 {
6491 /* Vectors are like simple fixed-size arrays. */
6492 constructor_max_index =
6496 }
6498 {
6500 {
6501 constructor_max_index
6504 /* Detect non-empty initializations of zero-length arrays. */
6509 /* constructor_max_index needs to be an INTEGER_CST. Attempts
6510 to initialize VLAs will cause a proper error; avoid tree
6511 checking errors as well by setting a safe value. */
6516 constructor_index
6519 }
6520 else
6525 {
6526 /* We need to split the char/wchar array into individual
6527 characters, so that we don't have to special case it
6528 everywhere. */
6530 }
6531 }
6532 else
6533 {
6538 }
6539 }
6541 /* At the end of an implicit or explicit brace level,
6542 finish up that level of constructor. If a single expression
6543 with redundant braces initialized that level, return the
6544 c_expr structure for that expression. Otherwise, the original_code
6545 element is set to ERROR_MARK.
6546 If we were outputting the elements as they are read, return 0 as the value
6547 from inner levels (process_init_element ignores that),
6548 but return error_mark_node as the value from the outermost level
6549 (that's what we want to put in DECL_INITIAL).
6550 Otherwise, return a CONSTRUCTOR expression as the value. */
6552 struct c_expr
6554 {
6562 {
6563 /* When we come to an explicit close brace,
6564 pop any inner levels that didn't have explicit braces. */
6569 }
6571 /* Now output all pending elements. */
6577 /* Error for initializing a flexible array member, or a zero-length
6578 array member in an inappropriate context. */
6583 {
6584 /* Silently discard empty initializations. The parser will
6585 already have pedwarned for empty brackets. */
6588 else
6589 {
6594 else
6598 /* We have already issued an error message for the existence
6599 of a flexible array member not at the end of the structure.
6600 Discard the initializer so that we do not die later. */
6603 }
6604 }
6606 /* Warn when some struct elements are implicitly initialized to zero. */
6608 && constructor_type
6611 {
6612 /* Do not warn for flexible array members or zero-length arrays. */
6618 /* Do not warn if this level of the initializer uses member
6619 designators; it is likely to be deliberate. */
6621 {
6626 }
6627 }
6629 /* Pad out the end of the structure. */
6631 /* If this closes a superfluous brace pair,
6632 just pass out the element between them. */
6635 ;
6640 {
6641 /* A nonincremental scalar initializer--just return
6642 the element, after verifying there is just one. */
6644 {
6648 }
6650 {
6653 }
6654 else
6656 }
6657 else
6658 {
6661 else
6662 {
6664 constructor_elements);
6671 }
6672 }
6675 {
6680 }
6708 }
6710 /* Common handling for both array range and field name designators.
6711 ARRAY argument is nonzero for array ranges. Returns zero for success. */
6713 static int
6715 {
6716 tree subtype;
6719 /* Don't die if an entire brace-pair level is superfluous
6720 in the containing level. */
6724 /* If there were errors in this designator list already, bail out
6725 silently. */
6730 {
6733 /* Designator list starts at the level of closest explicit
6734 braces. */
6739 }
6742 {
6754 }
6758 {
6761 }
6763 {
6766 }
6771 }
6773 /* If there are range designators in designator list, push a new designator
6774 to constructor_range_stack. RANGE_END is end of such stack range or
6775 NULL_TREE if there is no range designator at this level. */
6777 static void
6779 {
6793 }
6795 /* Within an array initializer, specify the next index to be initialized.
6796 FIRST is that index. If LAST is nonzero, then initialize a range
6797 of indices, running from FIRST through LAST. */
6799 void
6801 {
6809 {
6812 }
6815 {
6819 "array index in initializer is not "
6821 }
6824 {
6828 "array index in initializer is not "
6830 }
6843 else
6844 {
6851 {
6855 {
6858 }
6859 else
6860 {
6864 {
6867 }
6868 }
6869 }
6871 designator_depth++;
6875 }
6876 }
6878 /* Within a struct initializer, specify the next field to be initialized. */
6880 void
6882 {
6883 tree tail;
6892 {
6895 }
6899 {
6902 }
6906 else
6907 {
6909 designator_depth++;
6913 }
6914 }
6915 \f
6916 /* Add a new initializer to the tree of pending initializers. PURPOSE
6917 identifies the initializer, either array index or field in a structure.
6918 VALUE is the value of that index or field. If ORIGTYPE is not
6919 NULL_TREE, it is the original type of VALUE.
6921 IMPLICIT is true if value comes from pop_init_level (1),
6922 the new initializer has been merged with the existing one
6923 and thus no warnings should be emitted about overriding an
6924 existing initializer. */
6926 static void
6928 {
6935 {
6937 {
6943 else
6944 {
6946 {
6951 }
6955 }
6956 }
6957 }
6958 else
6959 {
6960 tree bitpos;
6964 {
6970 else
6971 {
6973 {
6978 }
6982 }
6983 }
6984 }
6998 {
7002 {
7006 {
7008 {
7009 /* L rotation. */
7022 {
7025 else
7027 }
7028 else
7030 }
7031 else
7032 {
7033 /* LR rotation. */
7055 {
7058 else
7060 }
7061 else
7063 }
7065 }
7066 else
7067 {
7068 /* p->balance == +1; growth of left side balances the node. */
7071 }
7072 }
7074 {
7076 /* Growth propagation from right side. */
7079 {
7081 {
7082 /* R rotation. */
7095 {
7098 else
7100 }
7101 else
7103 }
7105 {
7106 /* RL rotation */
7128 {
7131 else
7133 }
7134 else
7136 }
7138 }
7139 else
7140 {
7141 /* p->balance == -1; growth of right side balances the node. */
7144 }
7145 }
7149 }
7150 }
7152 /* Build AVL tree from a sorted chain. */
7154 static void
7156 {
7168 {
7170 /* Skip any nameless bit fields at the beginning. */
7176 }
7178 {
7180 constructor_unfilled_index
7183 else
7185 }
7187 }
7189 /* Build AVL tree from a string constant. */
7191 static void
7193 {
7210 {
7212 {
7215 }
7216 else
7217 {
7221 {
7224 else
7229 }
7230 }
7233 {
7236 {
7238 {
7241 }
7242 }
7244 {
7247 }
7252 }
7256 }
7259 }
7261 /* Return value of FIELD in pending initializer or zero if the field was
7262 not initialized yet. */
7264 static tree
7266 {
7270 {
7277 {
7282 else
7284 }
7285 }
7287 {
7291 && (!constructor_unfilled_fields
7298 {
7303 else
7305 }
7306 }
7308 {
7313 }
7315 }
7317 /* "Output" the next constructor element.
7318 At top level, really output it to assembler code now.
7319 Otherwise, collect it in a list from which we will make a CONSTRUCTOR.
7320 If ORIGTYPE is not NULL_TREE, it is the original type of VALUE.
7321 TYPE is the data type that the containing data type wants here.
7322 FIELD is the field (a FIELD_DECL) or the index that this element fills.
7323 If VALUE is a string constant, STRICT_STRING is true if it is
7324 unparenthesized or we should not warn here for it being parenthesized.
7325 For other types of VALUE, STRICT_STRING is not used.
7327 PENDING if non-nil means output pending elements that belong
7328 right after this element. (PENDING is normally 1;
7329 it is 0 while outputting pending elements, to avoid recursion.)
7331 IMPLICIT is true if value comes from pop_init_level (1),
7332 the new initializer has been merged with the existing one
7333 and thus no warnings should be emitted about overriding an
7334 existing initializer. */
7336 static void
7339 {
7346 {
7349 }
7362 {
7363 /* As an extension, allow initializing objects with static storage
7364 duration with compound literals (which are then treated just as
7365 the brace enclosed list they contain). */
7368 }
7372 {
7375 }
7392 {
7394 {
7397 }
7401 }
7407 /* Issue -Wc++-compat warnings about initializing a bitfield with
7408 enum type. */
7416 {
7423 }
7425 /* If this field is empty (and not at the end of structure),
7426 don't do anything other than checking the initializer. */
7440 {
7443 }
7447 /* If this element doesn't come next in sequence,
7448 put it on constructor_pending_elts. */
7450 && (!constructor_incremental
7452 {
7459 }
7461 && (!constructor_incremental
7463 {
7464 /* We do this for records but not for unions. In a union,
7465 no matter which field is specified, it can be initialized
7466 right away since it starts at the beginning of the union. */
7468 {
7471 else
7472 {
7480 }
7481 }
7485 }
7488 {
7490 {
7497 }
7499 /* We can have just one union field set. */
7501 }
7503 /* Otherwise, output this element either to
7504 constructor_elements or to the assembler file. */
7510 /* Advance the variable that indicates sequential elements output. */
7512 constructor_unfilled_index
7514 bitsize_one_node);
7516 {
7517 constructor_unfilled_fields
7520 /* Skip any nameless bit fields. */
7524 constructor_unfilled_fields =
7526 }
7530 /* Now output any pending elements which have become next. */
7533 }
7535 /* Output any pending elements which have become next.
7536 As we output elements, constructor_unfilled_{fields,index}
7537 advances, which may cause other elements to become next;
7538 if so, they too are output.
7540 If ALL is 0, we return when there are
7541 no more pending elements to output now.
7543 If ALL is 1, we output space as necessary so that
7544 we can output all the pending elements. */
7546 static void
7548 {
7550 tree next;
7552 retry:
7554 /* Look through the whole pending tree.
7555 If we find an element that should be output now,
7556 output it. Otherwise, set NEXT to the element
7557 that comes first among those still pending. */
7561 {
7563 {
7565 constructor_unfilled_index))
7571 {
7572 /* Advance to the next smaller node. */
7575 else
7576 {
7577 /* We have reached the smallest node bigger than the
7578 current unfilled index. Fill the space first. */
7581 }
7582 }
7583 else
7584 {
7585 /* Advance to the next bigger node. */
7588 else
7589 {
7590 /* We have reached the biggest node in a subtree. Find
7591 the parent of it, which is the next bigger node. */
7597 {
7600 }
7601 }
7602 }
7603 }
7606 {
7609 /* If the current record is complete we are done. */
7615 /* We can't compare fields here because there might be empty
7616 fields in between. */
7618 {
7623 }
7625 {
7626 /* Advance to the next smaller node. */
7629 else
7630 {
7631 /* We have reached the smallest node bigger than the
7632 current unfilled field. Fill the space first. */
7635 }
7636 }
7637 else
7638 {
7639 /* Advance to the next bigger node. */
7642 else
7643 {
7644 /* We have reached the biggest node in a subtree. Find
7645 the parent of it, which is the next bigger node. */
7652 {
7655 }
7656 }
7657 }
7658 }
7659 }
7661 /* Ordinarily return, but not if we want to output all
7662 and there are elements left. */
7666 /* If it's not incremental, just skip over the gap, so that after
7667 jumping to retry we will output the next successive element. */
7674 /* ELT now points to the node in the pending tree with the next
7675 initializer to output. */
7677 }
7678 \f
7679 /* Add one non-braced element to the current constructor level.
7680 This adjusts the current position within the constructor's type.
7681 This may also start or terminate implicit levels
7682 to handle a partly-braced initializer.
7684 Once this has found the correct level for the new element,
7685 it calls output_init_element.
7687 IMPLICIT is true if value comes from pop_init_level (1),
7688 the new initializer has been merged with the existing one
7689 and thus no warnings should be emitted about overriding an
7690 existing initializer. */
7692 void
7694 {
7702 /* Handle superfluous braces around string cst as in
7703 char x[] = {"foo"}; */
7705 && constructor_type
7709 {
7714 }
7717 {
7720 }
7722 /* Ignore elements of a brace group if it is entirely superfluous
7723 and has already been diagnosed. */
7727 /* If we've exhausted any levels that didn't have braces,
7728 pop them now. */
7730 {
7739 constructor_index)))
7741 else
7743 }
7745 /* In the case of [LO ... HI] = VALUE, only evaluate VALUE once. */
7747 {
7748 /* If value is a compound literal and we'll be just using its
7749 content, don't put it into a SAVE_EXPR. */
7751 || !require_constant_value
7753 {
7756 {
7759 }
7764 }
7765 }
7768 {
7770 {
7771 tree fieldtype;
7775 {
7779 }
7786 /* Error for non-static initialization of a flexible array member. */
7788 && !require_constant_value
7791 {
7794 }
7796 /* Accept a string constant to initialize a subarray. */
7802 /* Otherwise, if we have come to a subaggregate,
7803 and we don't have an element of its type, push into it. */
7809 {
7812 }
7815 {
7821 }
7822 else
7823 /* Do the bookkeeping for an element that was
7824 directly output as a constructor. */
7825 {
7826 /* For a record, keep track of end position of last field. */
7828 constructor_bit_index
7833 /* If the current field was the first one not yet written out,
7834 it isn't now, so update. */
7836 {
7838 /* Skip any nameless bit fields. */
7842 constructor_unfilled_fields =
7844 }
7845 }
7848 /* Skip any nameless bit fields at the beginning. */
7853 }
7855 {
7856 tree fieldtype;
7860 {
7864 }
7871 /* Warn that traditional C rejects initialization of unions.
7872 We skip the warning if the value is zero. This is done
7873 under the assumption that the zero initializer in user
7874 code appears conditioned on e.g. __STDC__ to avoid
7875 "missing initializer" warnings and relies on default
7876 initialization to zero in the traditional C case.
7877 We also skip the warning if the initializer is designated,
7878 again on the assumption that this must be conditional on
7879 __STDC__ anyway (and we've already complained about the
7880 member-designator already). */
7887 /* Accept a string constant to initialize a subarray. */
7893 /* Otherwise, if we have come to a subaggregate,
7894 and we don't have an element of its type, push into it. */
7900 {
7903 }
7906 {
7912 }
7913 else
7914 /* Do the bookkeeping for an element that was
7915 directly output as a constructor. */
7916 {
7919 }
7922 }
7924 {
7928 /* Accept a string constant to initialize a subarray. */
7934 /* Otherwise, if we have come to a subaggregate,
7935 and we don't have an element of its type, push into it. */
7941 {
7944 }
7949 {
7953 }
7955 /* Now output the actual element. */
7957 {
7963 }
7965 constructor_index
7970 /* If we are doing the bookkeeping for an element that was
7971 directly output as a constructor, we must update
7972 constructor_unfilled_index. */
7974 }
7976 {
7979 /* Do a basic check of initializer size. Note that vectors
7980 always have a fixed size derived from their type. */
7982 {
7986 }
7988 /* Now output the actual element. */
7990 {
7996 }
7998 constructor_index
8003 /* If we are doing the bookkeeping for an element that was
8004 directly output as a constructor, we must update
8005 constructor_unfilled_index. */
8007 }
8009 /* Handle the sole element allowed in a braced initializer
8010 for a scalar variable. */
8013 {
8017 }
8018 else
8019 {
8025 }
8027 /* Handle range initializers either at this level or anywhere higher
8028 in the designator stack. */
8030 {
8037 {
8040 }
8044 {
8047 }
8055 {
8059 {
8062 }
8070 }
8075 }
8078 }
8081 }
8082 \f
8083 /* Build a complete asm-statement, whose components are a CV_QUALIFIER
8084 (guaranteed to be 'volatile' or null) and ARGS (represented using
8085 an ASM_EXPR node). */
8086 tree
8088 {
8092 }
8094 /* Build an asm-expr, whose components are a STRING, some OUTPUTS,
8095 some INPUTS, and some CLOBBERS. The latter three may be NULL.
8096 SIMPLE indicates whether there was anything at all after the
8097 string in the asm expression -- asm("blah") and asm("blah" : )
8098 are subtly different. We use a ASM_EXPR node to represent this. */
8099 tree
8102 {
8103 tree tail;
8104 tree args;
8117 /* Remove output conversions that change the type but not the mode. */
8119 {
8122 /* ??? Really, this should not be here. Users should be using a
8123 proper lvalue, dammit. But there's a long history of using casts
8124 in the output operands. In cases like longlong.h, this becomes a
8125 primitive form of typechecking -- if the cast can be removed, then
8126 the output operand had a type of the proper width; otherwise we'll
8127 get an error. Gross, but ... */
8146 {
8147 /* If the operand is going to end up in memory,
8148 mark it addressable. */
8151 }
8152 else
8156 }
8159 {
8160 tree input;
8167 {
8168 /* If the operand is going to end up in memory,
8169 mark it addressable. */
8171 {
8172 /* Strip the nops as we allow this case. FIXME, this really
8173 should be rejected or made deprecated. */
8177 }
8178 }
8179 else
8183 }
8185 /* ASMs with labels cannot have outputs. This should have been
8186 enforced by the parser. */
8191 /* asm statements without outputs, including simple ones, are treated
8192 as volatile. */
8197 }
8198 \f
8199 /* Generate a goto statement to LABEL. LOC is the location of the
8200 GOTO. */
8202 tree
8204 {
8209 {
8213 }
8214 }
8216 /* Generate a computed goto statement to EXPR. LOC is the location of
8217 the GOTO. */
8219 tree
8221 {
8222 tree t;
8229 }
8231 /* Generate a C `return' statement. RETVAL is the expression for what
8232 to return, or a null pointer for `return;' with no value. LOC is
8233 the location of the return statement. If ORIGTYPE is not NULL_TREE, it
8234 is the original type of RETVAL. */
8236 tree
8238 {
8248 {
8252 {
8255 }
8259 }
8262 {
8266 {
8268 "%<return%> with no value, in "
8271 }
8272 }
8274 {
8279 else
8282 }
8283 else
8284 {
8286 ic_return,
8289 tree inner;
8297 /* Strip any conversions, additions, and subtractions, and see if
8298 we are returning the address of a local variable. Warn if so. */
8300 {
8302 {
8303 CASE_CONVERT:
8311 /* If the second operand of the MINUS_EXPR has a pointer
8312 type (or is converted from it), this may be valid, so
8313 don't give a warning. */
8314 {
8327 }
8346 }
8349 }
8356 }
8361 }
8362 \f
8364 /* The SWITCH_EXPR being built. */
8365 tree switch_expr;
8367 /* The original type of the testing expression, i.e. before the
8368 default conversion is applied. */
8369 tree orig_type;
8371 /* A splay-tree mapping the low element of a case range to the high
8372 element, or NULL_TREE if there is no high element. Used to
8373 determine whether or not a new case label duplicates an old case
8374 label. We need a tree, rather than simply a hash table, because
8375 of the GNU case range extension. */
8376 splay_tree cases;
8378 /* The bindings at the point of the switch. This is used for
8379 warnings crossing decls when branching to a case label. */
8382 /* The next node on the stack. */
8384 };
8386 /* A stack of the currently active switch statements. The innermost
8387 switch statement is on the top of the stack. There is no need to
8388 mark the stack for garbage collection because it is only active
8389 during the processing of the body of a function, and we never
8390 collect at that point. */
8394 /* Start a C switch statement, testing expression EXP. Return the new
8395 SWITCH_EXPR. SWITCH_LOC is the location of the `switch'.
8396 SWITCH_COND_LOC is the location of the switch's condition. */
8398 tree
8400 location_t switch_cond_loc,
8401 tree exp)
8402 {
8407 {
8411 {
8413 {
8416 }
8418 }
8419 else
8420 {
8435 }
8436 }
8438 /* Add this new SWITCH_EXPR to the stack. */
8449 }
8451 /* Process a case label at location LOC. */
8453 tree
8455 {
8459 {
8464 }
8467 {
8472 }
8475 {
8478 else
8481 }
8485 loc))
8495 }
8497 /* Finish the switch statement. */
8499 void
8501 {
8503 location_t switch_location;
8507 /* Emit warnings as needed. */
8513 /* Pop the stack. */
8518 }
8519 \f
8520 /* Emit an if statement. IF_LOCUS is the location of the 'if'. COND,
8521 THEN_BLOCK and ELSE_BLOCK are expressions to be used; ELSE_BLOCK
8522 may be null. NESTED_IF is true if THEN_BLOCK contains another IF
8523 statement, and was not surrounded with parenthesis. */
8525 void
8528 {
8529 tree stmt;
8531 /* Diagnose an ambiguous else if if-then-else is nested inside if-then. */
8533 {
8536 /* We know from the grammar productions that there is an IF nested
8537 within THEN_BLOCK. Due to labels and c99 conditional declarations,
8538 it might not be exactly THEN_BLOCK, but should be the last
8539 non-container statement within. */
8542 {
8557 }
8558 found:
8563 }
8568 }
8570 /* Emit a general-purpose loop construct. START_LOCUS is the location of
8571 the beginning of the loop. COND is the loop condition. COND_IS_FIRST
8572 is false for DO loops. INCR is the FOR increment expression. BODY is
8573 the statement controlled by the loop. BLAB is the break label. CLAB is
8574 the continue label. Everything is allowed to be NULL. */
8576 void
8579 {
8582 /* If the condition is zero don't generate a loop construct. */
8584 {
8586 {
8590 }
8591 }
8592 else
8593 {
8596 /* If we have an exit condition, then we build an IF with gotos either
8597 out of the loop, or to the top of it. If there's no exit condition,
8598 then we just build a jump back to the top. */
8602 {
8603 /* Canonicalize the loop condition to the end. This means
8604 generating a branch to the loop condition. Reuse the
8605 continue label, if possible. */
8607 {
8609 {
8612 }
8613 else
8617 }
8623 else
8626 }
8629 }
8643 }
8645 tree
8647 {
8651 /* In switch statements break is sometimes stylistically used after
8652 a return statement. This can lead to spurious warnings about
8653 control reaching the end of a non-void function when it is
8654 inlined. Note that we are calling block_may_fallthru with
8655 language specific tree nodes; this works because
8656 block_may_fallthru returns true when given something it does not
8657 understand. */
8661 {
8664 }
8666 ;
8668 {
8672 else
8683 }
8692 }
8694 /* A helper routine for c_process_expr_stmt and c_finish_stmt_expr. */
8696 static void
8698 {
8700 ;
8702 {
8705 }
8706 else
8708 }
8710 /* Process an expression as if it were a complete statement. Emit
8711 diagnostics, but do not call ADD_STMT. LOC is the location of the
8712 statement. */
8714 tree
8716 {
8730 /* If we're not processing a statement expression, warn about unused values.
8731 Warnings for statement expressions will be emitted later, once we figure
8732 out which is the result. */
8737 /* If the expression is not of a type to which we cannot assign a line
8738 number, wrap the thing in a no-op NOP_EXPR. */
8740 {
8743 }
8746 }
8748 /* Emit an expression as a statement. LOC is the location of the
8749 expression. */
8751 tree
8753 {
8756 else
8758 }
8760 /* Do the opposite and emit a statement as an expression. To begin,
8761 create a new binding level and return it. */
8763 tree
8765 {
8766 tree ret;
8768 /* We must force a BLOCK for this level so that, if it is not expanded
8769 later, there is a way to turn off the entire subtree of blocks that
8770 are contained in it. */
8775 ? NULL
8778 /* Mark the current statement list as belonging to a statement list. */
8782 }
8784 /* LOC is the location of the compound statement to which this body
8785 belongs. */
8787 tree
8789 {
8796 ? NULL
8799 /* Locate the last statement in BODY. See c_end_compound_stmt
8800 about always returning a BIND_EXPR. */
8804 continue_searching:
8806 {
8807 tree_stmt_iterator i;
8809 /* This can happen with degenerate cases like ({ }). No value. */
8813 /* If we're supposed to generate side effects warnings, process
8814 all of the statements except the last. */
8816 {
8818 {
8819 location_t tloc;
8824 }
8825 }
8826 else
8830 }
8832 /* If the end of the list is exception related, then the list was split
8833 by a call to push_cleanup. Continue searching. */
8836 {
8840 }
8845 /* In the case that the BIND_EXPR is not necessary, return the
8846 expression out from inside it. */
8849 {
8850 /* Even if this looks constant, do not allow it in a constant
8851 expression. */
8853 /* Do not warn if the return value of a statement expression is
8854 unused. */
8857 }
8859 /* Extract the type of said expression. */
8862 /* If we're not returning a value at all, then the BIND_EXPR that
8863 we already have is a fine expression to return. */
8867 /* Now that we've located the expression containing the value, it seems
8868 silly to make voidify_wrapper_expr repeat the process. Create a
8869 temporary of the appropriate type and stick it in a TARGET_EXPR. */
8872 /* Unwrap a no-op NOP_EXPR as added by c_finish_expr_stmt. This avoids
8873 tree_expr_nonnegative_p giving up immediately. */
8882 {
8886 }
8887 }
8888 \f
8889 /* Begin and end compound statements. This is as simple as pushing
8890 and popping new statement lists from the tree. */
8892 tree
8894 {
8899 }
8901 /* End a compound statement. STMT is the statement. LOC is the
8902 location of the compound statement-- this is usually the location
8903 of the opening brace. */
8905 tree
8907 {
8911 {
8915 }
8920 /* If this compound statement is nested immediately inside a statement
8921 expression, then force a BIND_EXPR to be created. Otherwise we'll
8922 do the wrong thing for ({ { 1; } }) or ({ 1; { } }). In particular,
8923 STATEMENT_LISTs merge, and thus we can lose track of what statement
8924 was really last. */
8928 {
8932 }
8935 }
8937 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
8938 when the current scope is exited. EH_ONLY is true when this is not
8939 meant to apply to normal control flow transfer. */
8941 void
8943 {
8955 }
8956 \f
8957 /* Build a binary-operation expression without default conversions.
8958 CODE is the kind of expression to build.
8959 LOCATION is the operator's location.
8960 This function differs from `build' in several ways:
8961 the data type of the result is computed and recorded in it,
8962 warnings are generated if arg data types are invalid,
8963 special handling for addition and subtraction of pointers is known,
8964 and some optimization is done (operations on narrow ints
8965 are done in the narrower type when that gives the same result).
8966 Constant folding is also done before the result is returned.
8968 Note that the operands will never have enumeral types, or function
8969 or array types, because either they will have the default conversions
8970 performed or they have both just been converted to some other type in which
8971 the arithmetic is to be done. */
8973 tree
8976 {
8978 tree eptype;
8986 /* Expression code to give to the expression when it is built.
8987 Normally this is CODE, which is what the caller asked for,
8988 but in some special cases we change it. */
8991 /* Data type in which the computation is to be performed.
8992 In the simplest cases this is the common type of the arguments. */
8995 /* When the computation is in excess precision, the type of the
8996 final EXCESS_PRECISION_EXPR. */
8999 /* Nonzero means operands have already been type-converted
9000 in whatever way is necessary.
9001 Zero means they need to be converted to RESULT_TYPE. */
9004 /* Nonzero means create the expression with this type, rather than
9005 RESULT_TYPE. */
9008 /* Nonzero means after finally constructing the expression
9009 convert it to this type. */
9012 /* Nonzero if this is an operation like MIN or MAX which can
9013 safely be computed in short if both args are promoted shorts.
9014 Also implies COMMON.
9015 -1 indicates a bitwise operation; this makes a difference
9016 in the exact conditions for when it is safe to do the operation
9017 in a narrower mode. */
9020 /* Nonzero if this is a comparison operation;
9021 if both args are promoted shorts, compare the original shorts.
9022 Also implies COMMON. */
9025 /* Nonzero if this is a right-shift operation, which can be computed on the
9026 original short and then promoted if the operand is a promoted short. */
9029 /* Nonzero means set RESULT_TYPE to the common type of the args. */
9032 /* True means types are compatible as far as ObjC is concerned. */
9035 /* True means this is an arithmetic operation that may need excess
9036 precision. */
9053 {
9056 int_const = (int_const_or_overflow
9059 }
9060 else
9064 {
9067 }
9072 /* The expression codes of the data types of the arguments tell us
9073 whether the arguments are integers, floating, pointers, etc. */
9077 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
9081 /* If an error was already reported for one of the arguments,
9082 avoid reporting another error. */
9089 {
9092 }
9095 {
9109 }
9111 {
9114 }
9117 {
9120 }
9122 {
9125 }
9128 {
9131 }
9136 {
9138 /* Handle the pointer + int case. */
9140 {
9143 }
9145 {
9148 }
9149 else
9154 /* Subtraction of two similar pointers.
9155 We must subtract them as integers, then divide by object size. */
9158 {
9161 }
9162 /* Handle pointer minus int. Just like pointer plus int. */
9164 {
9167 }
9168 else
9189 {
9200 else
9201 /* Although it would be tempting to shorten always here, that
9202 loses on some targets, since the modulo instruction is
9203 undefined if the quotient can't be represented in the
9204 computation mode. We shorten only if unsigned or if
9205 dividing by something we know != -1. */
9210 }
9218 /* Allow vector types which are not floating point types. */
9235 {
9236 /* Although it would be tempting to shorten always here, that loses
9237 on some targets, since the modulo instruction is undefined if the
9238 quotient can't be represented in the computation mode. We shorten
9239 only if unsigned or if dividing by something we know != -1. */
9244 }
9258 {
9259 /* Result of these operations is always an int,
9260 but that does not mean the operands should be
9261 converted to ints! */
9266 }
9268 {
9269 int_const_or_overflow = (int_operands
9273 int_const = (int_const_or_overflow
9277 }
9279 {
9280 int_const_or_overflow = (int_operands
9284 int_const = (int_const_or_overflow
9288 }
9291 /* Shift operations: result has same type as first operand;
9292 always convert second operand to int.
9293 Also set SHORT_SHIFT if shifting rightward. */
9298 {
9300 {
9302 {
9306 }
9307 else
9308 {
9313 {
9317 }
9318 }
9319 }
9321 /* Use the type of the value to be shifted. */
9323 /* Convert the shift-count to an integer, regardless of size
9324 of value being shifted. */
9327 /* Avoid converting op1 to result_type later. */
9329 }
9335 {
9337 {
9339 {
9343 }
9346 {
9350 }
9351 }
9353 /* Use the type of the value to be shifted. */
9355 /* Convert the shift-count to an integer, regardless of size
9356 of value being shifted. */
9359 /* Avoid converting op1 to result_type later. */
9361 }
9368 OPT_Wfloat_equal,
9370 /* Result of comparison is always int,
9371 but don't convert the args to int! */
9379 {
9386 /* Anything compares with void *. void * compares with anything.
9387 Otherwise, the targets must be compatible
9388 and both must be object or both incomplete. */
9396 {
9400 }
9402 {
9406 }
9408 {
9412 }
9413 else
9414 /* Avoid warning about the volatile ObjC EH puts on decls. */
9420 {
9422 result_type = build_pointer_type
9424 }
9425 }
9427 {
9434 }
9436 {
9443 }
9445 {
9448 }
9450 {
9453 }
9467 {
9470 addr_space_t as_common;
9473 {
9482 }
9484 {
9488 }
9489 else
9490 {
9492 result_type = build_pointer_type
9496 }
9497 }
9499 {
9507 }
9509 {
9513 }
9515 {
9518 }
9520 {
9523 }
9528 }
9537 {
9540 }
9544 &&
9547 {
9553 {
9557 }
9566 {
9567 /* An operation on mixed real/complex operands must be
9568 handled specially, but the language-independent code can
9569 more easily optimize the plain complex arithmetic if
9570 -fno-signed-zeros. */
9574 {
9577 }
9579 {
9584 }
9585 else
9586 {
9591 }
9595 {
9602 {
9606 /* Fall through. */
9613 }
9614 }
9615 else
9616 {
9623 {
9626 /* Fall through. */
9636 }
9637 }
9640 }
9642 /* For certain operations (which identify themselves by shorten != 0)
9643 if both args were extended from the same smaller type,
9644 do the arithmetic in that type and then extend.
9646 shorten !=0 and !=1 indicates a bitwise operation.
9647 For them, this optimization is safe only if
9648 both args are zero-extended or both are sign-extended.
9649 Otherwise, we might change the result.
9650 Eg, (short)-1 | (unsigned short)-1 is (int)-1
9651 but calculated in (unsigned short) it would be (unsigned short)-1. */
9654 {
9658 }
9660 /* Shifts can be shortened if shifting right. */
9663 {
9674 /* We can shorten only if the shift count is less than the
9675 number of bits in the smaller type size. */
9677 /* We cannot drop an unsigned shift after sign-extension. */
9679 {
9680 /* Do an unsigned shift if the operand was zero-extended. */
9681 result_type
9684 /* Convert value-to-be-shifted to that type. */
9688 }
9689 }
9691 /* Comparison operations are shortened too but differently.
9692 They identify themselves by setting short_compare = 1. */
9695 {
9696 /* Don't write &op0, etc., because that would prevent op0
9697 from being kept in a register.
9698 Instead, make copies of the our local variables and
9699 pass the copies by reference, then copy them back afterward. */
9702 tree val
9706 {
9709 }
9716 {
9722 {
9725 }
9726 else
9727 {
9728 /* Fold for the sake of possible warnings, as in
9729 build_conditional_expr. This requires the
9730 "original" values to be folded, not just op0 and
9731 op1. */
9732 c_inhibit_evaluation_warnings++;
9737 c_inhibit_evaluation_warnings--;
9739 require_constant_value,
9740 NULL);
9742 require_constant_value,
9743 NULL);
9744 }
9751 {
9756 }
9757 }
9758 }
9759 }
9761 /* At this point, RESULT_TYPE must be nonzero to avoid an error message.
9762 If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
9763 Then the expression will be built.
9764 It will be given type FINAL_TYPE if that is nonzero;
9765 otherwise, it will be given type RESULT_TYPE. */
9768 {
9771 }
9774 {
9780 /* This can happen if one operand has a vector type, and the other
9781 has a different type. */
9784 }
9787 {
9790 {
9793 }
9794 }
9796 /* Treat expressions in initializers specially as they can't trap. */
9798 ret = (require_constant_value
9802 else
9807 return_build_binary_op:
9810 ret = (int_operands
9820 }
9823 /* Convert EXPR to be a truth-value, validating its type for this
9824 purpose. LOCATION is the source location for the expression. */
9826 tree
9828 {
9832 {
9834 error_at (location, "used array that cannot be converted to pointer where scalar is required");
9850 }
9857 /* ??? Should we also give an error for void and vectors rather than
9858 leaving those to give errors later? */
9862 {
9865 else
9867 }
9871 }
9872 \f
9874 /* Convert EXPR to a contained DECL, updating *TC, *TI and *SE as
9875 required. */
9877 tree
9879 {
9881 {
9883 /* Executing a compound literal inside a function reinitializes
9884 it. */
9888 }
9889 else
9891 }
9892 \f
9893 /* Like c_begin_compound_stmt, except force the retention of the BLOCK. */
9895 tree
9897 {
9898 tree block;
9904 }
9906 /* Generate OMP_PARALLEL, with CLAUSES and BLOCK as its compound
9907 statement. LOC is the location of the OMP_PARALLEL. */
9909 tree
9911 {
9912 tree stmt;
9923 }
9925 /* Like c_begin_compound_stmt, except force the retention of the BLOCK. */
9927 tree
9929 {
9930 tree block;
9936 }
9938 /* Generate OMP_TASK, with CLAUSES and BLOCK as its compound
9939 statement. LOC is the location of the #pragma. */
9941 tree
9943 {
9944 tree stmt;
9955 }
9957 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
9958 Remove any elements from the list that are invalid. */
9960 tree
9962 {
9973 {
9979 {
9997 {
10001 }
10003 {
10008 {
10030 }
10032 {
10037 }
10038 }
10049 {
10053 }
10056 check_dup_generic:
10059 {
10063 }
10067 {
10071 }
10072 else
10082 {
10086 }
10089 {
10093 }
10094 else
10104 {
10108 }
10111 {
10115 }
10116 else
10133 }
10136 {
10140 {
10144 }
10147 {
10153 {
10164 }
10166 {
10171 }
10172 }
10173 }
10177 else
10179 }
10183 }
10185 /* Make a variant type in the proper way for C/C++, propagating qualifiers
10186 down to the element type of an array. */
10188 tree
10190 {
10195 {
10196 tree t;
10198 type_quals);
10200 /* See if we already have an identically qualified type. */
10202 {
10209 }
10211 {
10222 {
10223 tree unqualified_canon
10229 }
10230 else
10232 }
10234 }
10236 /* A restrict-qualified pointer type must be a pointer to object or
10237 incomplete type. Note that the use of POINTER_TYPE_P also allows
10238 REFERENCE_TYPEs, which is appropriate for C++. */
10242 {
10245 }
10248 }
10250 /* Build a VA_ARG_EXPR for the C parser. */
10252 tree
10254 {
10259 }