| blob | 8702373eac1f3512ba17c43234d9017f3c4217bf |
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. */
48 /* Possible cases of implicit bad conversions. Used to select
49 diagnostic messages in convert_for_assignment. */
51 ic_argpass,
52 ic_assign,
53 ic_init,
54 ic_return
55 };
57 /* Whether we are building a boolean conversion inside
58 convert_for_assignment, or some other late binary operation. If
59 build_binary_op is called (from code shared with C++) in this case,
60 then the operands have already been folded and the result will not
61 be folded again, so C_MAYBE_CONST_EXPR should not be generated. */
64 /* The level of nesting inside "__alignof__". */
67 /* The level of nesting inside "sizeof". */
70 /* The level of nesting inside "typeof". */
76 /* Nonzero if we've already printed a "missing braces around initializer"
77 message within this initializer. */
114 \f
115 /* Return true if EXP is a null pointer constant, false otherwise. */
117 static bool
119 {
120 /* This should really operate on c_expr structures, but they aren't
121 yet available everywhere required. */
130 }
132 /* EXPR may appear in an unevaluated part of an integer constant
133 expression, but not in an evaluated part. Wrap it in a
134 C_MAYBE_CONST_EXPR, or mark it with TREE_OVERFLOW if it is just an
135 INTEGER_CST and we cannot create a C_MAYBE_CONST_EXPR. */
137 static tree
139 {
140 tree ret;
142 {
145 }
146 else
147 {
150 }
152 }
158 const_tree t1;
159 const_tree t2;
160 /* The return value of tagged_types_tu_compatible_p if we had seen
161 these two types already. */
163 };
168 /* Do `exp = require_complete_type (exp);' to make sure exp
169 does not have an incomplete type. (That includes void types.) */
171 tree
173 {
179 /* First, detect a valid value with a complete type. */
185 }
187 /* Print an error message for invalid use of an incomplete type.
188 VALUE is the expression that was used (or 0 if that isn't known)
189 and TYPE is the type that was invalid. */
191 void
193 {
196 /* Avoid duplicate error message. */
203 else
204 {
205 retry:
206 /* We must print an error message. Be clever about what it says. */
209 {
228 {
230 {
233 }
236 }
242 }
247 else
248 /* If this type has a typedef-name, the TYPE_NAME is a TYPE_DECL. */
250 }
251 }
253 /* Given a type, apply default promotions wrt unnamed function
254 arguments and return the new type. */
256 tree
258 {
263 {
264 /* Preserve unsignedness if not really getting any wider. */
269 }
272 }
274 /* Return a variant of TYPE which has all the type qualifiers of LIKE
275 as well as those of TYPE. */
277 static tree
279 {
282 }
284 /* Return true iff the given tree T is a variable length array. */
286 bool
288 {
293 }
294 \f
295 /* Return the composite type of two compatible types.
297 We assume that comptypes has already been done and returned
298 nonzero; if that isn't so, this may crash. In particular, we
299 assume that qualifiers match. */
301 tree
303 {
306 tree attributes;
308 /* Save time if the two types are the same. */
312 /* If one type is nonsense, use the other. */
321 /* Merge the attributes. */
324 /* If one is an enumerated type and the other is the compatible
325 integer type, the composite type might be either of the two
326 (DR#013 question 3). For consistency, use the enumerated type as
327 the composite type. */
337 {
339 /* For two pointers, do this recursively on the target type. */
340 {
347 }
350 {
353 tree unqual_elt;
360 /* We should not have any type quals on arrays at all. */
369 d1_variable = (!d1_zero
372 d2_variable = (!d2_zero
378 /* Save space: see if the result is identical to one of the args. */
391 /* Merge the element types, and have a size if either arg has
392 one. We may have qualifiers on the element types. To set
393 up TYPE_MAIN_VARIANT correctly, we need to form the
394 composite of the unqualified types and add the qualifiers
395 back at the end. */
400 && (d2_variable
401 || d2_zero
403 ? t1
405 /* Ensure a composite type involving a zero-length array type
406 is a zero-length type not an incomplete type. */
410 {
413 }
416 }
422 {
423 /* Try harder not to create a new aggregate type. */
428 }
432 /* Function types: prefer the one that specified arg types.
433 If both do, merge the arg types. Also merge the return types. */
434 {
442 /* Save space: see if the result is identical to one of the args. */
448 /* Simple way if one arg fails to specify argument types. */
450 {
454 }
456 {
460 }
462 /* If both args specify argument types, we must merge the two
463 lists, argument by argument. */
464 /* Tell global_bindings_p to return false so that variable_size
465 doesn't die on VLAs in parameter types. */
478 {
479 /* A null type means arg type is not specified.
480 Take whatever the other function type has. */
482 {
485 }
487 {
490 }
492 /* Given wait (union {union wait *u; int *i} *)
493 and wait (union wait *),
494 prefer union wait * as type of parm. */
497 {
498 tree memb;
505 {
511 {
517 }
518 }
519 }
522 {
523 tree memb;
530 {
536 {
542 }
543 }
544 }
546 parm_done: ;
547 }
552 /* ... falls through ... */
553 }
557 }
559 }
561 /* Return the type of a conditional expression between pointers to
562 possibly differently qualified versions of compatible types.
564 We assume that comp_target_types has already been done and returned
565 nonzero; if that isn't so, this may crash. */
567 static tree
569 {
570 tree attributes;
573 tree target;
576 /* Save time if the two types are the same. */
580 /* If one type is nonsense, use the other. */
589 /* Merge the attributes. */
592 /* Find the composite type of the target types, and combine the
593 qualifiers of the two types' targets. Do not lose qualifiers on
594 array element types by taking the TYPE_MAIN_VARIANT. */
603 /* For function types do not merge const qualifiers, but drop them
604 if used inconsistently. The middle-end uses these to mark const
605 and noreturn functions. */
608 else
612 }
614 /* Return the common type for two arithmetic types under the usual
615 arithmetic conversions. The default conversions have already been
616 applied, and enumerated types converted to their compatible integer
617 types. The resulting type is unqualified and has no attributes.
619 This is the type for the result of most arithmetic operations
620 if the operands have the given two types. */
622 static tree
624 {
628 /* If one type is nonsense, use the other. */
646 /* Save time if the two types are the same. */
660 /* When one operand is a decimal float type, the other operand cannot be
661 a generic float type or a complex type. We also disallow vector types
662 here. */
665 {
667 {
670 }
672 {
675 }
677 {
680 }
681 }
683 /* If one type is a vector type, return that type. (How the usual
684 arithmetic conversions apply to the vector types extension is not
685 precisely specified.) */
692 /* If one type is complex, form the common type of the non-complex
693 components, then make that complex. Use T1 or T2 if it is the
694 required type. */
696 {
705 else
707 }
709 /* If only one is real, use it as the result. */
717 /* If both are real and either are decimal floating point types, use
718 the decimal floating point type with the greater precision. */
721 {
731 }
733 /* Deal with fixed-point types. */
735 {
743 /* If one input type is saturating, the result type is saturating. */
747 /* If both fixed-point types are unsigned, the result type is unsigned.
748 When mixing fixed-point and integer types, follow the sign of the
749 fixed-point type.
750 Otherwise, the result type is signed. */
759 /* The result type is signed. */
761 {
762 /* If the input type is unsigned, we need to convert to the
763 signed type. */
765 {
771 else
774 }
776 {
782 else
785 }
786 }
789 {
792 }
793 else
794 {
796 /* Signed integers need to subtract one sign bit. */
798 }
801 {
804 }
805 else
806 {
808 /* Signed integers need to subtract one sign bit. */
810 }
815 satp);
816 }
818 /* Both real or both integers; use the one with greater precision. */
825 /* Same precision. Prefer long longs to longs to ints when the
826 same precision, following the C99 rules on integer type rank
827 (which are equivalent to the C90 rules for C90 types). */
835 {
838 else
840 }
848 {
849 /* But preserve unsignedness from the other type,
850 since long cannot hold all the values of an unsigned int. */
853 else
855 }
857 /* Likewise, prefer long double to double even if same size. */
862 /* Otherwise prefer the unsigned one. */
866 else
868 }
869 \f
870 /* Wrapper around c_common_type that is used by c-common.c and other
871 front end optimizations that remove promotions. ENUMERAL_TYPEs
872 are allowed here and are converted to their compatible integer types.
873 BOOLEAN_TYPEs are allowed here and return either boolean_type_node or
874 preferably a non-Boolean type as the common type. */
875 tree
877 {
883 /* If both types are BOOLEAN_TYPE, then return boolean_type_node. */
888 /* If either type is BOOLEAN_TYPE, then return the other. */
895 }
897 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
898 or various other operations. Return 2 if they are compatible
899 but a warning may be needed if you use them together. */
901 int
903 {
911 }
912 \f
913 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
914 or various other operations. Return 2 if they are compatible
915 but a warning may be needed if you use them together. This
916 differs from comptypes, in that we don't free the seen types. */
918 static int
920 {
925 /* Suppress errors caused by previously reported errors. */
931 /* If either type is the internal version of sizetype, return the
932 language version. */
942 /* Enumerated types are compatible with integer types, but this is
943 not transitive: two enumerated types in the same translation unit
944 are compatible with each other only if they are the same type. */
954 /* Different classes of types can't be compatible. */
959 /* Qualifiers must match. C99 6.7.3p9 */
964 /* Allow for two different type nodes which have essentially the same
965 definition. Note that we already checked for equality of the type
966 qualifiers (just above). */
972 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
976 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
980 {
982 /* Do not remove mode or aliasing information. */
995 {
1002 /* Target types must match incl. qualifiers. */
1007 /* Sizes must match unless one is missing or variable. */
1014 d1_variable = (!d1_zero
1017 d2_variable = (!d2_zero
1033 }
1039 {
1050 }
1060 }
1062 }
1064 /* Return 1 if TTL and TTR are pointers to types that are equivalent,
1065 ignoring their qualifiers. */
1067 static int
1069 {
1073 /* Do not lose qualifiers on element types of array types that are
1074 pointer targets by taking their TYPE_MAIN_VARIANT. */
1086 }
1087 \f
1088 /* Subroutines of `comptypes'. */
1090 /* Determine whether two trees derive from the same translation unit.
1091 If the CONTEXT chain ends in a null, that tree's context is still
1092 being parsed, so if two trees have context chains ending in null,
1093 they're in the same translation unit. */
1094 int
1096 {
1099 {
1107 }
1111 {
1119 }
1122 }
1124 /* Allocate the seen two types, assuming that they are compatible. */
1128 {
1136 /* The C standard says that two structures in different translation
1137 units are compatible with each other only if the types of their
1138 fields are compatible (among other things). We assume that they
1139 are compatible until proven otherwise when building the cache.
1140 An example where this can occur is:
1141 struct a
1142 {
1143 struct a *next;
1144 };
1145 If we are comparing this against a similar struct in another TU,
1146 and did not assume they were compatible, we end up with an infinite
1147 loop. */
1150 }
1152 /* Free the seen types until we get to TU_TIL. */
1154 static void
1156 {
1159 {
1164 }
1166 }
1168 /* Return 1 if two 'struct', 'union', or 'enum' types T1 and T2 are
1169 compatible. If the two types are not the same (which has been
1170 checked earlier), this can only happen when multiple translation
1171 units are being compiled. See C99 6.2.7 paragraph 1 for the exact
1172 rules. */
1174 static int
1176 {
1180 /* We have to verify that the tags of the types are the same. This
1181 is harder than it looks because this may be a typedef, so we have
1182 to go look at the original type. It may even be a typedef of a
1183 typedef...
1184 In the case of compiler-created builtin structs the TYPE_DECL
1185 may be a dummy, with no DECL_ORIGINAL_TYPE. Don't fault. */
1196 /* C90 didn't have the requirement that the two tags be the same. */
1200 /* C90 didn't say what happened if one or both of the types were
1201 incomplete; we choose to follow C99 rules here, which is that they
1202 are compatible. */
1207 {
1212 }
1215 {
1217 {
1219 /* Speed up the case where the type values are in the same order. */
1224 {
1226 }
1229 {
1233 {
1236 }
1237 }
1240 {
1242 }
1244 {
1247 }
1250 {
1253 }
1256 {
1260 {
1263 }
1264 }
1266 }
1269 {
1272 {
1275 }
1277 /* Speed up the common case where the fields are in the same order. */
1280 {
1290 {
1293 }
1300 {
1303 }
1304 }
1306 {
1309 }
1312 {
1317 {
1325 {
1328 }
1339 }
1341 {
1344 }
1345 }
1348 }
1351 {
1357 {
1372 }
1375 else
1378 }
1382 }
1383 }
1385 /* Return 1 if two function types F1 and F2 are compatible.
1386 If either type specifies no argument types,
1387 the other must specify a fixed number of self-promoting arg types.
1388 Otherwise, if one type specifies only the number of arguments,
1389 the other must specify that number of self-promoting arg types.
1390 Otherwise, the argument types must match. */
1392 static int
1394 {
1396 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1404 /* 'volatile' qualifiers on a function's return type used to mean
1405 the function is noreturn. */
1421 /* An unspecified parmlist matches any specified parmlist
1422 whose argument types don't need default promotions. */
1425 {
1428 /* If one of these types comes from a non-prototype fn definition,
1429 compare that with the other type's arglist.
1430 If they don't match, ask for a warning (but no error). */
1435 }
1437 {
1444 }
1446 /* Both types have argument lists: compare them and propagate results. */
1449 }
1451 /* Check two lists of types for compatibility,
1452 returning 0 for incompatible, 1 for compatible,
1453 or 2 for compatible with warning. */
1455 static int
1457 {
1458 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1463 {
1467 /* If one list is shorter than the other,
1468 they fail to match. */
1477 /* A null pointer instead of a type
1478 means there is supposed to be an argument
1479 but nothing is specified about what type it has.
1480 So match anything that self-promotes. */
1482 {
1485 }
1487 {
1490 }
1491 /* If one of the lists has an error marker, ignore this arg. */
1494 ;
1496 {
1497 /* Allow wait (union {union wait *u; int *i} *)
1498 and wait (union wait *) to be compatible. */
1505 {
1506 tree memb;
1509 {
1516 }
1519 }
1526 {
1527 tree memb;
1530 {
1537 }
1540 }
1541 else
1543 }
1545 /* comptypes said ok, but record if it said to warn. */
1551 }
1552 }
1553 \f
1554 /* Compute the size to increment a pointer by. */
1556 static tree
1558 {
1565 {
1568 }
1570 /* Convert in case a char is more than one unit. */
1574 }
1575 \f
1576 /* Return either DECL or its known constant value (if it has one). */
1578 tree
1580 {
1582 in a place where a variable is invalid. Note that DECL_INITIAL
1583 isn't valid for a PARM_DECL. */
1590 /* This is invalid if initial value is not constant.
1591 If it has either a function call, a memory reference,
1592 or a variable, then re-evaluating it could give different results. */
1594 /* Check for cases where this is sub-optimal, even though valid. */
1598 }
1600 /* Convert the array expression EXP to a pointer. */
1601 static tree
1603 {
1606 tree adr;
1608 tree ptrtype;
1623 {
1624 /* We are making an ADDR_EXPR of ptrtype. This is a valid
1625 ADDR_EXPR because it's the best way of representing what
1626 happens in C when we take the address of an array and place
1627 it in a pointer to the element type. */
1633 }
1635 /* This way is better for a COMPONENT_REF since it can
1636 simplify the offset for a component. */
1639 }
1641 /* Convert the function expression EXP to a pointer. */
1642 static tree
1644 {
1655 }
1657 /* Perform the default conversion of arrays and functions to pointers.
1658 Return the result of converting EXP. For any other expression, just
1659 return EXP. */
1661 struct c_expr
1663 {
1669 {
1671 {
1678 {
1682 }
1689 {
1690 /* Before C99, non-lvalue arrays do not decay to pointers.
1691 Normally, using such an array would be invalid; but it can
1692 be used correctly inside sizeof or as a statement expression.
1693 Thus, do not give an error here; an error will result later. */
1695 }
1698 }
1705 }
1708 }
1711 /* EXP is an expression of integer type. Apply the integer promotions
1712 to it and return the promoted value. */
1714 tree
1716 {
1722 /* Normally convert enums to int,
1723 but convert wide enums to something wider. */
1725 {
1733 }
1735 /* ??? This should no longer be needed now bit-fields have their
1736 proper types. */
1739 /* If it's thinner than an int, promote it like a
1740 c_promoting_integer_type_p, otherwise leave it alone. */
1746 {
1747 /* Preserve unsignedness if not really getting any wider. */
1753 }
1756 }
1759 /* Perform default promotions for C data used in expressions.
1760 Enumeral types or short or char are converted to int.
1761 In addition, manifest constants symbols are replaced by their values. */
1763 tree
1765 {
1766 tree orig_exp;
1770 /* Functions and arrays have been converted during parsing. */
1775 /* Constants can be used directly unless they're not loadable. */
1779 /* Strip no-op conversions. */
1787 {
1790 }
1800 }
1801 \f
1802 /* Look up COMPONENT in a structure or union DECL.
1804 If the component name is not found, returns NULL_TREE. Otherwise,
1805 the return value is a TREE_LIST, with each TREE_VALUE a FIELD_DECL
1806 stepping down the chain to the component, which is in the last
1807 TREE_VALUE of the list. Normally the list is of length one, but if
1808 the component is embedded within (nested) anonymous structures or
1809 unions, the list steps down the chain to the component. */
1811 static tree
1813 {
1815 tree field;
1817 /* If TYPE_LANG_SPECIFIC is set, then it is a sorted array of pointers
1818 to the field elements. Use a binary search on this array to quickly
1819 find the element. Otherwise, do a linear search. TYPE_LANG_SPECIFIC
1820 will always be set for structures which have many elements. */
1823 {
1831 {
1836 {
1837 /* Step through all anon unions in linear fashion. */
1839 {
1843 {
1848 }
1849 }
1851 /* Entire record is only anon unions. */
1855 /* Restart the binary search, with new lower bound. */
1857 }
1863 else
1865 }
1871 }
1872 else
1873 {
1875 {
1879 {
1884 }
1888 }
1892 }
1895 }
1897 /* Make an expression to refer to the COMPONENT field of
1898 structure or union value DATUM. COMPONENT is an IDENTIFIER_NODE. */
1900 tree
1902 {
1906 tree ref;
1912 /* See if there is a field or component with name COMPONENT. */
1915 {
1917 {
1920 }
1925 {
1928 }
1930 /* Chain the COMPONENT_REFs if necessary down to the FIELD.
1931 This might be better solved in future the way the C++ front
1932 end does it - by giving the anonymous entities each a
1933 separate name and type, and then have build_component_ref
1934 recursively call itself. We can't do that here. */
1935 do
1936 {
1939 tree subtype;
1945 /* If this is an rvalue, it does not have qualifiers in C
1946 standard terms and we must avoid propagating such
1947 qualifiers down to a non-lvalue array that is then
1948 converted to a pointer. */
1949 use_datum_quals = (datum_lvalue
1958 NULL_TREE);
1972 }
1976 }
1979 component);
1982 }
1983 \f
1984 /* Given an expression PTR for a pointer, return an expression
1985 for the value pointed to.
1986 ERRORSTRING is the name of the operator to appear in error messages.
1988 LOC is the location to use for the generated tree. */
1990 tree
1992 {
1995 tree ref;
1998 {
2001 {
2002 /* If a warning is issued, mark it to avoid duplicates from
2003 the backend. This only needs to be done at
2004 warn_strict_aliasing > 2. */
2009 }
2014 {
2018 }
2019 else
2020 {
2026 {
2029 }
2033 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
2034 so that we get the proper error message if the result is used
2035 to assign to. Also, &* is supposed to be a no-op.
2036 And ANSI C seems to specify that the type of the result
2037 should be the const type. */
2038 /* A de-reference of a pointer to const is not a const. It is valid
2039 to change it via some other pointer. */
2046 }
2047 }
2052 }
2054 /* This handles expressions of the form "a[i]", which denotes
2055 an array reference.
2057 This is logically equivalent in C to *(a+i), but we may do it differently.
2058 If A is a variable or a member, we generate a primitive ARRAY_REF.
2059 This avoids forcing the array out of registers, and can work on
2060 arrays that are not lvalues (for example, members of structures returned
2061 by functions).
2063 LOC is the location to use for the returned expression. */
2065 tree
2067 {
2068 tree ret;
2076 {
2077 tree temp;
2080 {
2083 }
2088 }
2091 {
2094 }
2097 {
2100 }
2102 /* ??? Existing practice has been to warn only when the char
2103 index is syntactically the index, not for char[array]. */
2107 /* Apply default promotions *after* noticing character types. */
2113 {
2116 /* An array that is indexed by a non-constant
2117 cannot be stored in a register; we must be able to do
2118 address arithmetic on its address.
2119 Likewise an array of elements of variable size. */
2123 {
2126 }
2127 /* An array that is indexed by a constant value which is not within
2128 the array bounds cannot be stored in a register either; because we
2129 would get a crash in store_bit_field/extract_bit_field when trying
2130 to access a non-existent part of the register. */
2134 {
2137 }
2140 {
2150 }
2154 /* Array ref is const/volatile if the array elements are
2155 or if the array is. */
2164 /* This was added by rms on 16 Nov 91.
2165 It fixes vol struct foo *a; a->elts[1]
2166 in an inline function.
2167 Hope it doesn't break something else. */
2172 }
2173 else
2174 {
2183 return build_indirect_ref
2186 }
2187 }
2188 \f
2189 /* Build an external reference to identifier ID. FUN indicates
2190 whether this will be used for a function call. LOC is the source
2191 location of the identifier. */
2192 tree
2194 {
2195 tree ref;
2198 /* In Objective-C, an instance variable (ivar) may be preferred to
2199 whatever lookup_name() found. */
2205 /* Implicit function declaration. */
2208 /* Don't complain about something that's already been
2209 complained about. */
2211 else
2212 {
2215 }
2223 /* Recursive call does not count as usage. */
2225 {
2227 }
2230 {
2237 }
2240 {
2244 }
2250 {
2255 }
2256 /* C99 6.7.4p3: An inline definition of a function with external
2257 linkage ... shall not contain a reference to an identifier with
2258 internal linkage. */
2270 }
2272 /* Record details of decls possibly used inside sizeof or typeof. */
2273 struct maybe_used_decl
2274 {
2275 /* The decl. */
2276 tree decl;
2277 /* The level seen at (in_sizeof + in_typeof). */
2279 /* The next one at this level or above, or NULL. */
2281 };
2285 /* Record that DECL, an undefined static function reference seen
2286 inside sizeof or typeof, might be used if the operand of sizeof is
2287 a VLA type or the operand of typeof is a variably modified
2288 type. */
2290 static void
2292 {
2298 }
2300 /* Pop the stack of decls possibly used inside sizeof or typeof. If
2301 USED is false, just discard them. If it is true, mark them used
2302 (if no longer inside sizeof or typeof) or move them to the next
2303 level up (if still inside sizeof or typeof). */
2305 void
2307 {
2311 {
2313 {
2316 else
2318 }
2320 }
2323 }
2325 /* Return the result of sizeof applied to EXPR. */
2327 struct c_expr
2329 {
2332 {
2336 }
2337 else
2338 {
2345 {
2346 /* sizeof is evaluated when given a vla (C99 6.5.3.4p2). */
2350 }
2352 }
2354 }
2356 /* Return the result of sizeof applied to T, a structure for the type
2357 name passed to sizeof (rather than the type itself). */
2359 struct c_expr
2361 {
2362 tree type;
2370 {
2374 }
2378 }
2380 /* Build a function call to function FUNCTION with parameters PARAMS.
2381 PARAMS is a list--a chain of TREE_LIST nodes--in which the
2382 TREE_VALUE of each node is a parameter-expression.
2383 FUNCTION's data type may be a function type or a pointer-to-function. */
2385 tree
2387 {
2390 tree tem;
2395 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
2398 /* Convert anything with function type to a pointer-to-function. */
2400 {
2401 /* Implement type-directed function overloading for builtins.
2402 resolve_overloaded_builtin and targetm.resolve_overloaded_builtin
2403 handle all the type checking. The result is a complete expression
2404 that implements this function call. */
2411 }
2415 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
2416 expressions, like those used for ObjC messenger dispatches. */
2428 {
2431 }
2436 /* fntype now gets the type of function pointed to. */
2439 /* Convert the parameters to the types declared in the
2440 function prototype, or apply default promotions. */
2449 /* Check that the function is called through a compatible prototype.
2450 If it is not, replace the call by a trap, wrapped up in a compound
2451 expression if necessary. This has the nice side-effect to prevent
2452 the tree-inliner from generating invalid assignment trees which may
2453 blow up in the RTL expander later. */
2458 {
2461 NULL_TREE);
2464 /* This situation leads to run-time undefined behavior. We can't,
2465 therefore, simply error unless we can prove that all possible
2466 executions of the program must execute the code. */
2468 /* We can, however, treat "undefined" any way we please.
2469 Call abort to encourage the user to fix the program. */
2471 /* Before the abort, allow the function arguments to exit or
2472 call longjmp. */
2478 else
2479 {
2480 tree rhs;
2486 else
2490 }
2491 }
2493 /* Check that arguments to builtin functions match the expectations. */
2500 /* Check that the arguments to the function are valid. */
2506 {
2510 else
2516 }
2517 else
2524 }
2525 \f
2526 /* Convert the argument expressions in the list VALUES
2527 to the types in the list TYPELIST. The resulting arguments are
2528 stored in the array ARGARRAY which has size NARGS.
2530 If TYPELIST is exhausted, or when an element has NULL as its type,
2531 perform the default conversions.
2533 PARMLIST is the chain of parm decls for the function being called.
2534 It may be 0, if that info is not available.
2535 It is used only for generating error messages.
2537 FUNCTION is a tree for the called function. It is used only for
2538 error messages, where it is formatted with %qE.
2540 This is also where warnings about wrong number of args are generated.
2542 VALUES is a chain of TREE_LIST nodes with the elements of the list
2543 in the TREE_VALUE slots of those nodes.
2545 Returns the actual number of arguments processed (which may be less
2546 than NARGS in some error situations), or -1 on failure. */
2548 static int
2551 {
2557 tree selector;
2559 /* Change pointer to function to the function itself for
2560 diagnostics. */
2565 /* Handle an ObjC selector specially for diagnostics. */
2568 /* For type-generic built-in functions, determine whether excess
2569 precision should be removed (classification) or not
2570 (comparison). */
2574 {
2576 {
2589 }
2590 }
2592 /* Scan the given expressions and types, producing individual
2593 converted arguments and storing them in ARGARRAY. */
2596 valtail;
2598 {
2609 {
2612 }
2615 {
2618 }
2622 /* If there is excess precision and a prototype, convert once to
2623 the required type rather than converting via the semantic
2624 type. Likewise without a prototype a float value represented
2625 as long double should be converted once to double. But for
2626 type-generic classification functions excess precision must
2627 be removed here. */
2630 {
2633 }
2640 {
2641 /* Formal parm type is specified by a function prototype. */
2642 tree parmval;
2645 {
2648 }
2649 else
2650 {
2651 /* Optionally warn about conversions that
2652 differ from the default conversions. */
2654 {
2687 /* ??? At some point, messages should be written about
2688 conversions between complex types, but that's too messy
2689 to do now. */
2692 {
2693 /* Warn if any argument is passed as `float',
2694 since without a prototype it would be `double'. */
2701 /* Warn if mismatch between argument and prototype
2702 for decimal float types. Warn of conversions with
2703 binary float types and of precision narrowing due to
2704 prototype. */
2712 && (formal_prec
2715 && (valtype
2716 != dfloat64_type_node
2717 && (valtype
2720 && (valtype
2726 }
2727 /* Detect integer changing in width or signedness.
2728 These warnings are only activated with
2729 -Wtraditional-conversion, not with -Wtraditional. */
2732 {
2739 /* No warning if function asks for enum
2740 and the actual arg is that enum type. */
2741 ;
2747 ;
2748 /* Don't complain if the formal parameter type
2749 is an enum, because we can't tell now whether
2750 the value was an enum--even the same enum. */
2752 ;
2755 /* Change in signedness doesn't matter
2756 if a constant value is unaffected. */
2757 ;
2758 /* If the value is extended from a narrower
2759 unsigned type, it doesn't matter whether we
2760 pass it as signed or unsigned; the value
2761 certainly is the same either way. */
2764 ;
2769 else
2772 }
2773 }
2775 /* Possibly restore an EXCESS_PRECISION_EXPR for the
2776 sake of better warnings from convert_and_check. */
2787 }
2789 }
2794 {
2797 else
2798 /* Convert `float' to `double'. */
2800 }
2802 /* A "double" argument with excess precision being passed
2803 without a prototype or in variable arguments. */
2807 {
2810 }
2811 else
2812 /* Convert `short' and `char' to full-size `int'. */
2817 }
2822 {
2825 }
2828 }
2829 \f
2830 /* This is the entry point used by the parser to build unary operators
2831 in the input. CODE, a tree_code, specifies the unary operator, and
2832 ARG is the operand. For unary plus, the C parser currently uses
2833 CONVERT_EXPR for code.
2835 LOC is the location to use for the tree generated.
2836 */
2838 struct c_expr
2840 {
2850 }
2852 /* This is the entry point used by the parser to build binary operators
2853 in the input. CODE, a tree_code, specifies the binary operator, and
2854 ARG1 and ARG2 are the operands. In addition to constructing the
2855 expression, we check for operands that were written with other binary
2856 operators in a way that is likely to confuse the user.
2858 LOCATION is the location of the binary operator. */
2860 struct c_expr
2863 {
2879 /* Check for cases such as x+y<<z which users are likely
2880 to misinterpret. */
2887 /* Warn about comparisons against string literals, with the exception
2888 of testing for equality or inequality of a string literal with NULL. */
2890 {
2894 }
2905 }
2906 \f
2907 /* Return a tree for the difference of pointers OP0 and OP1.
2908 The resulting tree has type int. */
2910 static tree
2912 {
2926 /* If the conversion to ptrdiff_type does anything like widening or
2927 converting a partial to an integral mode, we get a convert_expression
2928 that is in the way to do any simplifications.
2929 (fold-const.c doesn't know that the extra bits won't be needed.
2930 split_tree uses STRIP_SIGN_NOPS, which leaves conversions to a
2931 different mode in place.)
2932 So first try to find a common term here 'by hand'; we want to cover
2933 at least the cases that occur in legal static initializers. */
2938 else
2944 else
2948 {
2951 }
2952 else
2956 {
2959 }
2960 else
2964 {
2967 }
2970 /* First do the subtraction as integers;
2971 then drop through to build the divide operator.
2972 Do not do default conversions on the minus operator
2973 in case restype is a short type. */
2978 /* This generates an error if op1 is pointer to incomplete type. */
2982 /* This generates an error if op0 is pointer to incomplete type. */
2985 /* Divide by the size, in easiest possible way. */
2987 }
2988 \f
2989 /* Construct and perhaps optimize a tree representation
2990 for a unary operation. CODE, a tree_code, specifies the operation
2991 and XARG is the operand.
2992 For any CODE other than ADDR_EXPR, FLAG nonzero suppresses
2993 the default promotions (such as from short to int).
2994 For ADDR_EXPR, the default promotions are not applied; FLAG nonzero
2995 allows non-lvalues; this is only used to handle conversion of non-lvalue
2996 arrays to pointers in C99.
2998 LOCATION is the location of the operator. */
3000 tree
3003 {
3004 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
3008 tree val;
3028 {
3031 }
3034 {
3037 }
3040 {
3042 /* This is used for unary plus, because a CONVERT_EXPR
3043 is enough to prevent anybody from looking inside for
3044 associativity, but won't generate any code. */
3048 {
3051 }
3061 {
3064 }
3070 /* ~ works on integer types and non float vectors. */
3074 {
3077 }
3079 {
3085 }
3086 else
3087 {
3090 }
3095 {
3098 }
3104 /* Conjugating a real value is a no-op, but allow it anyway. */
3107 {
3110 }
3119 {
3123 }
3133 else
3144 else
3156 {
3166 }
3168 /* Complain about anything that is not a true lvalue. */
3171 ? lv_increment
3175 /* Ensure the argument is fully folded inside any SAVE_EXPR. */
3178 /* Increment or decrement the real part of the value,
3179 and don't change the imaginary part. */
3181 {
3196 }
3198 /* Report invalid types. */
3202 {
3205 else
3209 }
3211 {
3212 tree inc;
3216 /* Compute the increment. */
3219 {
3220 /* If pointer target is an undefined struct,
3221 we just cannot know how to do the arithmetic. */
3223 {
3227 else
3230 }
3233 {
3237 else
3240 }
3244 }
3246 {
3247 /* For signed fract types, we invert ++ to -- or
3248 -- to ++, and change inc from 1 to -1, because
3249 it is not possible to represent 1 in signed fract constants.
3250 For unsigned fract types, the result always overflows and
3251 we get an undefined (original) or the maximum value. */
3263 }
3264 else
3265 {
3268 }
3270 /* Report a read-only lvalue. */
3272 {
3278 }
3282 else
3289 }
3292 /* Note that this operation never does default_conversion. */
3294 /* Let &* cancel out to simplify resulting code. */
3296 {
3297 /* Don't let this be an lvalue. */
3302 }
3304 /* For &x[y], return x+y */
3306 {
3315 }
3317 /* Anything not already handled and not a true memory reference
3318 or a non-lvalue array is an error. */
3323 /* Move address operations inside C_MAYBE_CONST_EXPR to simplify
3324 folding later. */
3326 {
3335 }
3337 /* Ordinary case; arg is a COMPONENT_REF or a decl. */
3340 /* If the lvalue is const or volatile, merge that into the type
3341 to which the address will point. Note that you can't get a
3342 restricted pointer by taking the address of something, so we
3343 only have to deal with `const' and `volatile' here. */
3358 /* ??? Cope with user tricks that amount to offsetof. Delete this
3359 when we have proper support for integer constant expressions. */
3363 {
3369 }
3378 }
3383 ret = (require_constant_value
3386 else
3388 return_build_unary_op:
3399 }
3401 /* Return nonzero if REF is an lvalue valid for this language.
3402 Lvalues can be assigned, unless their type has TYPE_READONLY.
3403 Lvalues can have their address taken, unless they have C_DECL_REGISTER. */
3405 static int
3407 {
3411 {
3438 }
3439 }
3440 \f
3441 /* Give an error for storing in something that is 'const'. */
3443 static void
3445 {
3448 /* Using this macro rather than (for example) arrays of messages
3449 ensures that all the format strings are checked at compile
3450 time. */
3451 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
3452 : (use == lv_increment ? (I) \
3453 : (use == lv_decrement ? (D) : (AS))))
3455 {
3458 else
3464 }
3470 arg);
3471 else
3476 arg);
3477 }
3480 /* Return nonzero if REF is an lvalue valid for this language;
3481 otherwise, print an error message and return zero. USE says
3482 how the lvalue is being used and so selects the error message. */
3484 static int
3486 {
3493 }
3494 \f
3495 /* Mark EXP saying that we need to be able to take the
3496 address of it; it should not be allocated in a register.
3497 Returns true if successful. */
3499 bool
3501 {
3506 {
3509 {
3510 error
3513 }
3515 /* ... fall through ... */
3535 {
3537 {
3538 error
3541 }
3543 }
3545 {
3548 else
3551 }
3553 /* drops in */
3556 /* drops out */
3559 }
3560 }
3561 \f
3562 /* Build and return a conditional expression IFEXP ? OP1 : OP2. If
3563 IFEXP_BCP then the condition is a call to __builtin_constant_p, and
3564 if folded to an integer constant then the unselected half may
3565 contain arbitrary operations not normally permitted in constant
3566 expressions. */
3568 tree
3570 {
3571 tree type1;
3572 tree type2;
3579 tree ret;
3582 /* Promote both alternatives. */
3599 /* C90 does not permit non-lvalue arrays in conditional expressions.
3600 In C99 they will be pointers by now. */
3602 {
3605 }
3615 {
3618 {
3622 }
3624 {
3628 }
3629 }
3631 /* Quickly detect the usual case where op1 and op2 have the same type
3632 after promotion. */
3634 {
3637 else
3639 }
3644 {
3647 /* If -Wsign-compare, warn here if type1 and type2 have
3648 different signedness. We'll promote the signed to unsigned
3649 and later code won't know it used to be different.
3650 Do this check on the original types, so that explicit casts
3651 will be considered, but default promotions won't. */
3653 {
3658 {
3661 /* Do not warn if the result type is signed, since the
3662 signed type will only be chosen if it can represent
3663 all the values of the unsigned type. */
3666 else
3667 {
3671 /* Do not warn if the signed quantity is an
3672 unsuffixed integer literal (or some static
3673 constant expression involving such literals) and
3674 it is non-negative. This warning requires the
3675 operands to be folded for best results, so do
3676 that folding in this case even without
3677 warn_sign_compare to avoid warning options
3678 possibly affecting code generation. */
3685 {
3688 || (unsigned_op1
3691 else
3693 }
3695 {
3699 }
3701 {
3705 }
3706 }
3707 }
3708 }
3709 }
3711 {
3716 }
3718 {
3726 {
3729 "ISO C forbids conditional expr between "
3733 }
3735 {
3738 "ISO C forbids conditional expr between "
3742 }
3743 else
3744 {
3749 }
3750 }
3752 {
3756 else
3757 {
3759 }
3761 }
3763 {
3767 else
3768 {
3770 }
3772 }
3775 {
3778 else
3779 {
3782 }
3783 }
3785 /* Merge const and volatile flags of the incoming types. */
3786 result_type
3799 {
3802 }
3804 {
3807 }
3809 && op1_int_operands
3812 {
3819 }
3822 else
3823 {
3827 }
3832 }
3833 \f
3834 /* Return a compound expression that performs two expressions and
3835 returns the value of the second of them. */
3837 tree
3839 {
3841 tree ret;
3846 {
3849 }
3852 {
3853 /* The left-hand operand of a comma expression is like an expression
3854 statement: with -Wunused, we should warn if it doesn't have
3855 any side-effects, unless it was explicitly cast to (void). */
3857 {
3865 else
3868 }
3869 }
3871 /* With -Wunused, we should also warn if the left-hand operand does have
3872 side-effects, but computes a value which is not used. For example, in
3873 `foo() + bar(), baz()' the result of the `+' operator is not used,
3874 so we should issue a warning. */
3892 }
3894 /* Build an expression representing a cast to type TYPE of expression EXPR. */
3896 tree
3898 {
3899 tree value;
3909 /* The ObjC front-end uses TYPE_MAIN_VARIANT to tie together types differing
3910 only in <protocol> qualifications. But when constructing cast expressions,
3911 the protocols do matter and must be kept around. */
3918 {
3921 }
3924 {
3927 }
3930 {
3934 }
3937 {
3942 }
3944 {
3945 tree field;
3954 {
3955 tree t;
3964 }
3967 }
3968 else
3969 {
3977 /* Optionally warn about potentially worrisome casts. */
3982 {
3988 /* Check that the qualifiers on IN_TYPE are a superset of
3989 the qualifiers of IN_OTYPE. The outermost level of
3990 POINTER_TYPE nodes is uninteresting and we stop as soon
3991 as we hit a non-POINTER_TYPE node on either type. */
3992 do
3993 {
3997 /* GNU C allows cv-qualified function types. 'const'
3998 means the function is very pure, 'volatile' means it
3999 can't return. We need to warn when such qualifiers
4000 are added, not when they're taken away. */
4004 else
4006 }
4014 /* There are qualifiers present in IN_OTYPE that are not
4015 present in IN_TYPE. */
4017 }
4019 /* Warn about possible alignment problems. */
4025 /* Don't warn about opaque types, where the actual alignment
4026 restriction is unknown. */
4037 /* Unlike conversion of integers to pointers, where the
4038 warning is disabled for converting constants because
4039 of cases such as SIG_*, warn about converting constant
4040 pointers to integers. In some cases it may cause unwanted
4041 sign extension, and a warning is appropriate. */
4053 /* Don't warn about converting any constant. */
4061 /* If pedantic, warn for conversions between function and object
4062 pointer types, except for converting a null pointer constant
4063 to function pointer type. */
4084 /* Ignore any integer overflow caused by the cast. */
4086 {
4088 {
4090 {
4091 /* Avoid clobbering a shared constant. */
4094 }
4095 }
4097 /* Reset VALUE's overflow flags, ensuring constant sharing. */
4101 }
4102 }
4104 /* Don't let a cast be an lvalue. */
4108 /* Don't allow the results of casting to floating-point or complex
4109 types be confused with actual constants, or casts involving
4110 integer and pointer types other than direct integer-to-integer
4111 and integer-to-pointer be confused with integer constant
4112 expressions and null pointer constants. */
4123 }
4125 /* Interpret a cast of expression EXPR to type TYPE. */
4126 tree
4128 {
4129 tree type;
4132 tree ret;
4135 /* This avoids warnings about unprototyped casts on
4136 integers. E.g. "#define SIG_DFL (void(*)())0". */
4144 {
4147 }
4149 }
4150 \f
4151 /* Build an assignment expression of lvalue LHS from value RHS.
4152 MODIFYCODE is the code for a binary operator that we use
4153 to combine the old value of LHS with RHS to get the new value.
4154 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
4156 LOCATION is the location of the MODIFYCODE operator. */
4158 tree
4161 {
4162 tree result;
4163 tree newrhs;
4169 /* Types that aren't fully specified cannot be used in assignments. */
4172 /* Avoid duplicate error messages from operands that had errors. */
4180 {
4183 }
4188 {
4199 }
4201 /* If a binary op has been requested, combine the old LHS value with the RHS
4202 producing the value we should actually store into the LHS. */
4205 {
4210 }
4212 /* Give an error for storing in something that is 'const'. */
4218 {
4221 }
4223 /* If storing into a structure or union member,
4224 it has probably been given type `int'.
4225 Compute the type that would go with
4226 the actual amount of storage the member occupies. */
4235 /* If storing in a field that is in actuality a short or narrower than one,
4236 we must store in the field in its actual type. */
4239 {
4242 }
4244 /* Convert new value to destination type. Fold it first, then
4245 restore any excess precision information, for the sake of
4246 conversion warnings. */
4257 /* Emit ObjC write barrier, if necessary. */
4259 {
4262 {
4265 }
4266 }
4268 /* Scan operands. */
4274 /* If we got the LHS in a different type for storing in,
4275 convert the result back to the nominal type of LHS
4276 so that the value we return always has the same type
4277 as the LHS argument. */
4286 }
4287 \f
4288 /* Convert value RHS to type TYPE as preparation for an assignment
4289 to an lvalue of type TYPE. NULL_POINTER_CONSTANT says whether RHS
4290 was a null pointer constant before any folding.
4291 The real work of conversion is done by `convert'.
4292 The purpose of this function is to generate error messages
4293 for assignments that are not allowed in C.
4294 ERRTYPE says whether it is argument passing, assignment,
4295 initialization or return.
4297 FUNCTION is a tree for the function being called.
4298 PARMNUM is the number of the argument, for printing in error messages. */
4300 static tree
4304 {
4307 tree rhstype;
4313 {
4314 tree selector;
4315 /* Change pointer to function to the function itself for
4316 diagnostics. */
4321 /* Handle an ObjC selector specially for diagnostics. */
4325 {
4328 }
4329 }
4331 /* This macro is used to emit diagnostics to ensure that all format
4332 strings are complete sentences, visible to gettext and checked at
4333 compile time. */
4334 #define WARN_FOR_ASSIGNMENT(LOCATION, OPT, AR, AS, IN, RE) \
4335 do { \
4336 switch (errtype) \
4337 { \
4338 case ic_argpass: \
4339 if (pedwarn (LOCATION, OPT, AR, parmnum, rname)) \
4340 inform ((fundecl && !DECL_IS_BUILTIN (fundecl)) \
4341 ? DECL_SOURCE_LOCATION (fundecl) : LOCATION, \
4343 type, rhstype); \
4344 break; \
4345 case ic_assign: \
4346 pedwarn (LOCATION, OPT, AS); \
4347 break; \
4348 case ic_init: \
4349 pedwarn (LOCATION, OPT, IN); \
4350 break; \
4351 case ic_return: \
4352 pedwarn (LOCATION, OPT, RE); \
4353 break; \
4354 default: \
4355 gcc_unreachable (); \
4356 } \
4357 } while (0)
4369 {
4373 {
4389 }
4392 }
4398 {
4399 /* Except for passing an argument to an unprototyped function,
4400 this is a constraint violation. When passing an argument to
4401 an unprototyped function, it is compile-time undefined;
4402 making it a constraint in that case was rejected in
4403 DR#252. */
4406 }
4410 /* A type converts to a reference to it.
4411 This code doesn't fully support references, it's just for the
4412 special case of va_start and va_copy. */
4415 {
4417 {
4420 }
4425 /* We already know that these two types are compatible, but they
4426 may not be exactly identical. In fact, `TREE_TYPE (type)' is
4427 likely to be __builtin_va_list and `TREE_TYPE (rhs)' is
4428 likely to be va_list, a typedef to __builtin_va_list, which
4429 is different enough that it will cause problems later. */
4435 }
4436 /* Some types can interconvert without explicit casts. */
4440 /* Arithmetic types all interconvert, and enum is treated like int. */
4449 {
4450 tree ret;
4458 }
4460 /* Aggregates in different TUs might need conversion. */
4466 /* Conversion to a transparent union from its member types.
4467 This applies only to function arguments. */
4470 {
4474 {
4485 {
4489 /* Any non-function converts to a [const][volatile] void *
4490 and vice versa; otherwise, targets must be the same.
4491 Meanwhile, the lhs target must have all the qualifiers of
4492 the rhs. */
4495 {
4496 /* If this type won't generate any warnings, use it. */
4506 /* Keep looking for a better type, but remember this one. */
4509 }
4510 }
4512 /* Can convert integer zero to any pointer type. */
4514 {
4517 }
4518 }
4521 {
4523 {
4524 /* We have only a marginally acceptable member type;
4525 it needs a warning. */
4529 /* Const and volatile mean something different for function
4530 types, so the usual warnings are not appropriate. */
4533 {
4534 /* Because const and volatile on functions are
4535 restrictions that say the function will not do
4536 certain things, it is okay to use a const or volatile
4537 function where an ordinary one is wanted, but not
4538 vice-versa. */
4542 "makes qualified function "
4545 "function pointer from "
4548 "function pointer from "
4552 }
4565 }
4573 }
4574 }
4576 /* Conversions among pointers */
4579 {
4591 /* Opaque pointers are treated like void pointers. */
4594 /* C++ does not allow the implicit conversion void* -> T*. However,
4595 for the purpose of reducing the number of false positives, we
4596 tolerate the special case of
4598 int *p = NULL;
4600 where NULL is typically defined in C to be '(void *) 0'. */
4605 /* Check if the right-hand side has a format attribute but the
4606 left-hand side doesn't. */
4609 {
4611 {
4614 "argument %d of %qE might be "
4620 "assignment left-hand side might be "
4625 "initialization left-hand side might be "
4630 "return type might be "
4635 }
4636 }
4638 /* Any non-function converts to a [const][volatile] void *
4639 and vice versa; otherwise, targets must be the same.
4640 Meanwhile, the lhs target must have all the qualifiers of the rhs. */
4643 || is_opaque_pointer
4646 {
4649 ||
4651 && !null_pointer_constant
4655 "%qE between function pointer "
4663 /* Const and volatile mean something different for function types,
4664 so the usual warnings are not appropriate. */
4667 {
4669 {
4670 /* Types differing only by the presence of the 'volatile'
4671 qualifier are acceptable if the 'volatile' has been added
4672 in by the Objective-C EH machinery. */
4683 }
4684 /* If this is not a case of ignoring a mismatch in signedness,
4685 no warning. */
4688 ;
4689 /* If there is a mismatch, do warn. */
4700 }
4703 {
4704 /* Because const and volatile on functions are restrictions
4705 that say the function will not do certain things,
4706 it is okay to use a const or volatile function
4707 where an ordinary one is wanted, but not vice-versa. */
4711 "qualified function pointer "
4719 }
4720 }
4721 else
4722 /* Avoid warning about the volatile ObjC EH puts on decls. */
4733 }
4735 {
4736 /* ??? This should not be an error when inlining calls to
4737 unprototyped functions. */
4740 }
4742 {
4743 /* An explicit constant 0 can convert to a pointer,
4744 or one that results from arithmetic, even including
4745 a cast to integer type. */
4758 }
4760 {
4771 }
4773 {
4774 tree ret;
4780 }
4783 {
4804 }
4807 }
4808 \f
4809 /* If VALUE is a compound expr all of whose expressions are constant, then
4810 return its value. Otherwise, return error_mark_node.
4812 This is for handling COMPOUND_EXPRs as initializer elements
4813 which is allowed with a warning when -pedantic is specified. */
4815 static tree
4817 {
4819 {
4824 endtype);
4825 }
4828 else
4830 }
4831 \f
4832 /* Perform appropriate conversions on the initial value of a variable,
4833 store it in the declaration DECL,
4834 and print any error messages that are appropriate.
4835 If the init is invalid, store an ERROR_MARK. */
4837 void
4839 {
4843 /* If variable's type was invalidly declared, just ignore it. */
4849 /* Digest the specified initializer into an expression. */
4855 /* Store the expression if valid; else report error. */
4864 /* ANSI wants warnings about out-of-range constant initializers. */
4869 /* Check if we need to set array size from compound literal size. */
4873 {
4880 {
4884 {
4885 /* For int foo[] = (int [3]){1}; we need to set array size
4886 now since later on array initializer will be just the
4887 brace enclosed list of the compound literal. */
4893 }
4894 }
4895 }
4896 }
4897 \f
4898 /* Methods for storing and printing names for error messages. */
4900 /* Implement a spelling stack that allows components of a name to be pushed
4901 and popped. Each element on the stack is this structure. */
4903 struct spelling
4904 {
4906 union
4907 {
4911 };
4913 #define SPELLING_STRING 1
4914 #define SPELLING_MEMBER 2
4915 #define SPELLING_BOUNDS 3
4921 /* Macros to save and restore the spelling stack around push_... functions.
4922 Alternative to SAVE_SPELLING_STACK. */
4924 #define SPELLING_DEPTH() (spelling - spelling_base)
4925 #define RESTORE_SPELLING_DEPTH(DEPTH) (spelling = spelling_base + (DEPTH))
4927 /* Push an element on the spelling stack with type KIND and assign VALUE
4928 to MEMBER. */
4930 #define PUSH_SPELLING(KIND, VALUE, MEMBER) \
4931 { \
4932 int depth = SPELLING_DEPTH (); \
4933 \
4934 if (depth >= spelling_size) \
4935 { \
4936 spelling_size += 10; \
4937 spelling_base = XRESIZEVEC (struct spelling, spelling_base, \
4938 spelling_size); \
4939 RESTORE_SPELLING_DEPTH (depth); \
4940 } \
4941 \
4942 spelling->kind = (KIND); \
4943 spelling->MEMBER = (VALUE); \
4944 spelling++; \
4945 }
4947 /* Push STRING on the stack. Printed literally. */
4949 static void
4951 {
4953 }
4955 /* Push a member name on the stack. Printed as '.' STRING. */
4957 static void
4959 {
4963 }
4965 /* Push an array bounds on the stack. Printed as [BOUNDS]. */
4967 static void
4969 {
4971 }
4973 /* Compute the maximum size in bytes of the printed spelling. */
4975 static int
4977 {
4982 {
4985 else
4987 }
4990 }
4992 /* Print the spelling to BUFFER and return it. */
4996 {
5002 {
5005 }
5006 else
5007 {
5012 ;
5013 }
5016 }
5018 /* Issue an error message for a bad initializer component.
5019 MSGID identifies the message.
5020 The component name is taken from the spelling stack. */
5022 void
5024 {
5031 }
5033 /* Issue a pedantic warning for a bad initializer component. OPT is
5034 the option OPT_* (from options.h) controlling this warning or 0 if
5035 it is unconditionally given. MSGID identifies the message. The
5036 component name is taken from the spelling stack. */
5038 void
5040 {
5047 }
5049 /* Issue a warning for a bad initializer component.
5051 OPT is the OPT_W* value corresponding to the warning option that
5052 controls this warning. MSGID identifies the message. The
5053 component name is taken from the spelling stack. */
5055 static void
5057 {
5064 }
5065 \f
5066 /* If TYPE is an array type and EXPR is a parenthesized string
5067 constant, warn if pedantic that EXPR is being used to initialize an
5068 object of type TYPE. */
5070 void
5072 {
5079 }
5081 /* Digest the parser output INIT as an initializer for type TYPE.
5082 Return a C expression of type TYPE to represent the initial value.
5084 NULL_POINTER_CONSTANT is true if INIT is a null pointer constant.
5086 If INIT is a string constant, STRICT_STRING is true if it is
5087 unparenthesized or we should not warn here for it being parenthesized.
5088 For other types of INIT, STRICT_STRING is not used.
5090 REQUIRE_CONSTANT requests an error if non-constant initializers or
5091 elements are seen. */
5093 static tree
5096 {
5103 || !init
5111 {
5114 }
5118 /* Initialization of an array of chars from a string constant
5119 optionally enclosed in braces. */
5123 {
5125 /* Note that an array could be both an array of character type
5126 and an array of wchar_t if wchar_t is signed char or unsigned
5127 char. */
5136 {
5148 {
5150 {
5153 }
5154 }
5155 else
5156 {
5158 {
5162 }
5164 {
5168 }
5169 }
5175 /* Subtract the size of a single (possibly wide) character
5176 because it's ok to ignore the terminating null char
5177 that is counted in the length of the constant. */
5186 }
5188 {
5192 }
5193 }
5195 /* Build a VECTOR_CST from a *constant* vector constructor. If the
5196 vector constructor is not constant (e.g. {1,2,3,foo()}) then punt
5197 below and handle as a constructor. */
5202 {
5209 {
5211 tree value;
5214 /* Iterate through elements and check if all constructor
5215 elements are *_CSTs. */
5218 {
5221 }
5226 }
5227 }
5232 /* Any type can be initialized
5233 from an expression of the same type, optionally with braces. */
5246 {
5248 {
5250 {
5254 else
5255 {
5258 }
5259 }
5260 }
5263 /* Although the types are compatible, we may require a
5264 conversion. */
5270 {
5271 /* As an extension, allow initializing objects with static storage
5272 duration with compound literals (which are then treated just as
5273 the brace enclosed list they contain). Also allow this for
5274 vectors, as we can only assign them with compound literals. */
5277 }
5281 {
5284 }
5286 /* Compound expressions can only occur here if -pedantic or
5287 -pedantic-errors is specified. In the later case, we always want
5288 an error. In the former case, we simply want a warning. */
5291 {
5292 inside_init
5297 else
5302 }
5306 {
5309 }
5314 /* Added to enable additional -Wmissing-format-attribute warnings. */
5317 null_pointer_constant,
5320 }
5322 /* Handle scalar types, including conversions. */
5327 {
5334 inside_init);
5335 inside_init
5337 null_pointer_constant,
5340 /* Check to see if we have already given an error message. */
5342 ;
5344 {
5347 }
5351 {
5354 }
5360 }
5362 /* Come here only for records and arrays. */
5365 {
5368 }
5372 }
5373 \f
5374 /* Handle initializers that use braces. */
5376 /* Type of object we are accumulating a constructor for.
5377 This type is always a RECORD_TYPE, UNION_TYPE or ARRAY_TYPE. */
5380 /* For a RECORD_TYPE or UNION_TYPE, this is the chain of fields
5381 left to fill. */
5384 /* For an ARRAY_TYPE, this is the specified index
5385 at which to store the next element we get. */
5388 /* For an ARRAY_TYPE, this is the maximum index. */
5391 /* For a RECORD_TYPE, this is the first field not yet written out. */
5394 /* For an ARRAY_TYPE, this is the index of the first element
5395 not yet written out. */
5398 /* In a RECORD_TYPE, the byte index of the next consecutive field.
5399 This is so we can generate gaps between fields, when appropriate. */
5402 /* If we are saving up the elements rather than allocating them,
5403 this is the list of elements so far (in reverse order,
5404 most recent first). */
5407 /* 1 if constructor should be incrementally stored into a constructor chain,
5408 0 if all the elements should be kept in AVL tree. */
5411 /* 1 if so far this constructor's elements are all compile-time constants. */
5414 /* 1 if so far this constructor's elements are all valid address constants. */
5417 /* 1 if this constructor has an element that cannot be part of a
5418 constant expression. */
5421 /* 1 if this constructor is erroneous so far. */
5424 /* Structure for managing pending initializer elements, organized as an
5425 AVL tree. */
5427 struct init_node
5428 {
5432 tree purpose;
5433 tree value;
5434 };
5436 /* Tree of pending elements at this constructor level.
5437 These are elements encountered out of order
5438 which belong at places we haven't reached yet in actually
5439 writing the output.
5440 Will never hold tree nodes across GC runs. */
5443 /* The SPELLING_DEPTH of this constructor. */
5446 /* DECL node for which an initializer is being read.
5447 0 means we are reading a constructor expression
5448 such as (struct foo) {...}. */
5451 /* Nonzero if this is an initializer for a top-level decl. */
5454 /* Nonzero if there were any member designators in this initializer. */
5457 /* Nesting depth of designator list. */
5460 /* Nonzero if there were diagnosed errors in this designator list. */
5463 \f
5464 /* This stack has a level for each implicit or explicit level of
5465 structuring in the initializer, including the outermost one. It
5466 saves the values of most of the variables above. */
5470 struct constructor_stack
5471 {
5473 tree type;
5474 tree fields;
5475 tree index;
5476 tree max_index;
5477 tree unfilled_index;
5478 tree unfilled_fields;
5479 tree bit_index;
5484 /* If value nonzero, this value should replace the entire
5485 constructor at this level. */
5496 };
5500 /* This stack represents designators from some range designator up to
5501 the last designator in the list. */
5503 struct constructor_range_stack
5504 {
5507 tree range_start;
5508 tree index;
5509 tree range_end;
5510 tree fields;
5511 };
5515 /* This stack records separate initializers that are nested.
5516 Nested initializers can't happen in ANSI C, but GNU C allows them
5517 in cases like { ... (struct foo) { ... } ... }. */
5519 struct initializer_stack
5520 {
5522 tree decl;
5532 };
5535 \f
5536 /* Prepare to parse and output the initializer for variable DECL. */
5538 void
5540 {
5562 {
5564 require_constant_elements
5566 /* For a scalar, you can always use any value to initialize,
5567 even within braces. */
5573 }
5574 else
5575 {
5579 }
5592 }
5594 void
5596 {
5599 /* Free the whole constructor stack of this initializer. */
5601 {
5605 }
5609 /* Pop back to the data of the outer initializer (if any). */
5624 }
5625 \f
5626 /* Call here when we see the initializer is surrounded by braces.
5627 This is instead of a call to push_init_level;
5628 it is matched by a call to pop_init_level.
5630 TYPE is the type to initialize, for a constructor expression.
5631 For an initializer for a decl, TYPE is zero. */
5633 void
5635 {
5682 {
5684 /* Skip any nameless bit fields at the beginning. */
5691 }
5693 {
5695 {
5696 constructor_max_index
5699 /* Detect non-empty initializations of zero-length arrays. */
5704 /* constructor_max_index needs to be an INTEGER_CST. Attempts
5705 to initialize VLAs will cause a proper error; avoid tree
5706 checking errors as well by setting a safe value. */
5711 constructor_index
5714 }
5715 else
5716 {
5719 }
5722 }
5724 {
5725 /* Vectors are like simple fixed-size arrays. */
5726 constructor_max_index =
5730 }
5731 else
5732 {
5733 /* Handle the case of int x = {5}; */
5736 }
5737 }
5738 \f
5739 /* Push down into a subobject, for initialization.
5740 If this is for an explicit set of braces, IMPLICIT is 0.
5741 If it is because the next element belongs at a lower level,
5742 IMPLICIT is 1 (or 2 if the push is because of designator list). */
5744 void
5746 {
5750 /* If we've exhausted any levels that didn't have braces,
5751 pop them now. If implicit == 1, this will have been done in
5752 process_init_element; do not repeat it here because in the case
5753 of excess initializers for an empty aggregate this leads to an
5754 infinite cycle of popping a level and immediately recreating
5755 it. */
5757 {
5759 {
5765 && constructor_max_index
5767 constructor_index))
5769 else
5771 }
5772 }
5774 /* Unless this is an explicit brace, we need to preserve previous
5775 content if any. */
5777 {
5784 }
5820 {
5825 }
5827 /* Don't die if an entire brace-pair level is superfluous
5828 in the containing level. */
5830 ;
5833 {
5834 /* Don't die if there are extra init elts at the end. */
5837 else
5838 {
5841 constructor_depth++;
5842 }
5843 }
5845 {
5848 constructor_depth++;
5849 }
5852 {
5857 }
5860 {
5869 }
5872 {
5875 }
5879 {
5881 /* Skip any nameless bit fields at the beginning. */
5888 }
5890 {
5891 /* Vectors are like simple fixed-size arrays. */
5892 constructor_max_index =
5896 }
5898 {
5900 {
5901 constructor_max_index
5904 /* Detect non-empty initializations of zero-length arrays. */
5909 /* constructor_max_index needs to be an INTEGER_CST. Attempts
5910 to initialize VLAs will cause a proper error; avoid tree
5911 checking errors as well by setting a safe value. */
5916 constructor_index
5919 }
5920 else
5925 {
5926 /* We need to split the char/wchar array into individual
5927 characters, so that we don't have to special case it
5928 everywhere. */
5930 }
5931 }
5932 else
5933 {
5938 }
5939 }
5941 /* At the end of an implicit or explicit brace level,
5942 finish up that level of constructor. If a single expression
5943 with redundant braces initialized that level, return the
5944 c_expr structure for that expression. Otherwise, the original_code
5945 element is set to ERROR_MARK.
5946 If we were outputting the elements as they are read, return 0 as the value
5947 from inner levels (process_init_element ignores that),
5948 but return error_mark_node as the value from the outermost level
5949 (that's what we want to put in DECL_INITIAL).
5950 Otherwise, return a CONSTRUCTOR expression as the value. */
5952 struct c_expr
5954 {
5961 {
5962 /* When we come to an explicit close brace,
5963 pop any inner levels that didn't have explicit braces. */
5968 }
5970 /* Now output all pending elements. */
5976 /* Error for initializing a flexible array member, or a zero-length
5977 array member in an inappropriate context. */
5982 {
5983 /* Silently discard empty initializations. The parser will
5984 already have pedwarned for empty brackets. */
5987 else
5988 {
5993 else
5997 /* We have already issued an error message for the existence
5998 of a flexible array member not at the end of the structure.
5999 Discard the initializer so that we do not die later. */
6002 }
6003 }
6005 /* Warn when some struct elements are implicitly initialized to zero. */
6007 && constructor_type
6010 {
6011 /* Do not warn for flexible array members or zero-length arrays. */
6017 /* Do not warn if this level of the initializer uses member
6018 designators; it is likely to be deliberate. */
6020 {
6025 }
6026 }
6028 /* Pad out the end of the structure. */
6030 /* If this closes a superfluous brace pair,
6031 just pass out the element between them. */
6034 ;
6039 {
6040 /* A nonincremental scalar initializer--just return
6041 the element, after verifying there is just one. */
6043 {
6047 }
6049 {
6052 }
6053 else
6055 }
6056 else
6057 {
6060 else
6061 {
6063 constructor_elements);
6070 }
6071 }
6074 {
6079 }
6107 }
6109 /* Common handling for both array range and field name designators.
6110 ARRAY argument is nonzero for array ranges. Returns zero for success. */
6112 static int
6114 {
6115 tree subtype;
6118 /* Don't die if an entire brace-pair level is superfluous
6119 in the containing level. */
6123 /* If there were errors in this designator list already, bail out
6124 silently. */
6129 {
6132 /* Designator list starts at the level of closest explicit
6133 braces. */
6138 }
6141 {
6153 }
6157 {
6160 }
6162 {
6165 }
6170 }
6172 /* If there are range designators in designator list, push a new designator
6173 to constructor_range_stack. RANGE_END is end of such stack range or
6174 NULL_TREE if there is no range designator at this level. */
6176 static void
6178 {
6192 }
6194 /* Within an array initializer, specify the next index to be initialized.
6195 FIRST is that index. If LAST is nonzero, then initialize a range
6196 of indices, running from FIRST through LAST. */
6198 void
6200 {
6208 {
6211 }
6224 else
6225 {
6232 {
6236 {
6239 }
6240 else
6241 {
6245 {
6248 }
6249 }
6250 }
6252 designator_depth++;
6256 }
6257 }
6259 /* Within a struct initializer, specify the next field to be initialized. */
6261 void
6263 {
6264 tree tail;
6273 {
6276 }
6280 {
6283 }
6287 else
6288 {
6290 designator_depth++;
6294 }
6295 }
6296 \f
6297 /* Add a new initializer to the tree of pending initializers. PURPOSE
6298 identifies the initializer, either array index or field in a structure.
6299 VALUE is the value of that index or field.
6301 IMPLICIT is true if value comes from pop_init_level (1),
6302 the new initializer has been merged with the existing one
6303 and thus no warnings should be emitted about overriding an
6304 existing initializer. */
6306 static void
6308 {
6315 {
6317 {
6323 else
6324 {
6326 {
6331 }
6334 }
6335 }
6336 }
6337 else
6338 {
6339 tree bitpos;
6343 {
6349 else
6350 {
6352 {
6357 }
6360 }
6361 }
6362 }
6375 {
6379 {
6383 {
6385 {
6386 /* L rotation. */
6399 {
6402 else
6404 }
6405 else
6407 }
6408 else
6409 {
6410 /* LR rotation. */
6432 {
6435 else
6437 }
6438 else
6440 }
6442 }
6443 else
6444 {
6445 /* p->balance == +1; growth of left side balances the node. */
6448 }
6449 }
6451 {
6453 /* Growth propagation from right side. */
6456 {
6458 {
6459 /* R rotation. */
6472 {
6475 else
6477 }
6478 else
6480 }
6482 {
6483 /* RL rotation */
6505 {
6508 else
6510 }
6511 else
6513 }
6515 }
6516 else
6517 {
6518 /* p->balance == -1; growth of right side balances the node. */
6521 }
6522 }
6526 }
6527 }
6529 /* Build AVL tree from a sorted chain. */
6531 static void
6533 {
6545 {
6547 /* Skip any nameless bit fields at the beginning. */
6553 }
6555 {
6557 constructor_unfilled_index
6560 else
6562 }
6564 }
6566 /* Build AVL tree from a string constant. */
6568 static void
6570 {
6587 {
6589 {
6592 }
6593 else
6594 {
6598 {
6601 else
6606 }
6607 }
6610 {
6613 {
6615 {
6618 }
6619 }
6621 {
6624 }
6629 }
6633 }
6636 }
6638 /* Return value of FIELD in pending initializer or zero if the field was
6639 not initialized yet. */
6641 static tree
6643 {
6647 {
6654 {
6659 else
6661 }
6662 }
6664 {
6668 && (!constructor_unfilled_fields
6675 {
6680 else
6682 }
6683 }
6685 {
6690 }
6692 }
6694 /* "Output" the next constructor element.
6695 At top level, really output it to assembler code now.
6696 Otherwise, collect it in a list from which we will make a CONSTRUCTOR.
6697 TYPE is the data type that the containing data type wants here.
6698 FIELD is the field (a FIELD_DECL) or the index that this element fills.
6699 If VALUE is a string constant, STRICT_STRING is true if it is
6700 unparenthesized or we should not warn here for it being parenthesized.
6701 For other types of VALUE, STRICT_STRING is not used.
6703 PENDING if non-nil means output pending elements that belong
6704 right after this element. (PENDING is normally 1;
6705 it is 0 while outputting pending elements, to avoid recursion.)
6707 IMPLICIT is true if value comes from pop_init_level (1),
6708 the new initializer has been merged with the existing one
6709 and thus no warnings should be emitted about overriding an
6710 existing initializer. */
6712 static void
6715 {
6722 {
6725 }
6738 {
6739 /* As an extension, allow initializing objects with static storage
6740 duration with compound literals (which are then treated just as
6741 the brace enclosed list they contain). */
6744 }
6748 {
6751 }
6768 {
6770 {
6773 }
6777 }
6783 /* If this field is empty (and not at the end of structure),
6784 don't do anything other than checking the initializer. */
6796 require_constant_value);
6798 {
6801 }
6805 /* If this element doesn't come next in sequence,
6806 put it on constructor_pending_elts. */
6808 && (!constructor_incremental
6810 {
6817 }
6819 && (!constructor_incremental
6821 {
6822 /* We do this for records but not for unions. In a union,
6823 no matter which field is specified, it can be initialized
6824 right away since it starts at the beginning of the union. */
6826 {
6829 else
6830 {
6838 }
6839 }
6843 }
6846 {
6848 {
6855 }
6857 /* We can have just one union field set. */
6859 }
6861 /* Otherwise, output this element either to
6862 constructor_elements or to the assembler file. */
6868 /* Advance the variable that indicates sequential elements output. */
6870 constructor_unfilled_index
6872 bitsize_one_node);
6874 {
6875 constructor_unfilled_fields
6878 /* Skip any nameless bit fields. */
6882 constructor_unfilled_fields =
6884 }
6888 /* Now output any pending elements which have become next. */
6891 }
6893 /* Output any pending elements which have become next.
6894 As we output elements, constructor_unfilled_{fields,index}
6895 advances, which may cause other elements to become next;
6896 if so, they too are output.
6898 If ALL is 0, we return when there are
6899 no more pending elements to output now.
6901 If ALL is 1, we output space as necessary so that
6902 we can output all the pending elements. */
6904 static void
6906 {
6908 tree next;
6910 retry:
6912 /* Look through the whole pending tree.
6913 If we find an element that should be output now,
6914 output it. Otherwise, set NEXT to the element
6915 that comes first among those still pending. */
6919 {
6921 {
6923 constructor_unfilled_index))
6929 {
6930 /* Advance to the next smaller node. */
6933 else
6934 {
6935 /* We have reached the smallest node bigger than the
6936 current unfilled index. Fill the space first. */
6939 }
6940 }
6941 else
6942 {
6943 /* Advance to the next bigger node. */
6946 else
6947 {
6948 /* We have reached the biggest node in a subtree. Find
6949 the parent of it, which is the next bigger node. */
6955 {
6958 }
6959 }
6960 }
6961 }
6964 {
6967 /* If the current record is complete we are done. */
6973 /* We can't compare fields here because there might be empty
6974 fields in between. */
6976 {
6980 }
6982 {
6983 /* Advance to the next smaller node. */
6986 else
6987 {
6988 /* We have reached the smallest node bigger than the
6989 current unfilled field. Fill the space first. */
6992 }
6993 }
6994 else
6995 {
6996 /* Advance to the next bigger node. */
6999 else
7000 {
7001 /* We have reached the biggest node in a subtree. Find
7002 the parent of it, which is the next bigger node. */
7009 {
7012 }
7013 }
7014 }
7015 }
7016 }
7018 /* Ordinarily return, but not if we want to output all
7019 and there are elements left. */
7023 /* If it's not incremental, just skip over the gap, so that after
7024 jumping to retry we will output the next successive element. */
7031 /* ELT now points to the node in the pending tree with the next
7032 initializer to output. */
7034 }
7035 \f
7036 /* Add one non-braced element to the current constructor level.
7037 This adjusts the current position within the constructor's type.
7038 This may also start or terminate implicit levels
7039 to handle a partly-braced initializer.
7041 Once this has found the correct level for the new element,
7042 it calls output_init_element.
7044 IMPLICIT is true if value comes from pop_init_level (1),
7045 the new initializer has been merged with the existing one
7046 and thus no warnings should be emitted about overriding an
7047 existing initializer. */
7049 void
7051 {
7059 /* Handle superfluous braces around string cst as in
7060 char x[] = {"foo"}; */
7062 && constructor_type
7066 {
7071 }
7074 {
7077 }
7079 /* Ignore elements of a brace group if it is entirely superfluous
7080 and has already been diagnosed. */
7084 /* If we've exhausted any levels that didn't have braces,
7085 pop them now. */
7087 {
7095 constructor_index)))
7097 else
7099 }
7101 /* In the case of [LO ... HI] = VALUE, only evaluate VALUE once. */
7103 {
7104 /* If value is a compound literal and we'll be just using its
7105 content, don't put it into a SAVE_EXPR. */
7107 || !require_constant_value
7109 {
7112 {
7115 }
7120 }
7121 }
7124 {
7126 {
7127 tree fieldtype;
7131 {
7135 }
7142 /* Error for non-static initialization of a flexible array member. */
7144 && !require_constant_value
7147 {
7150 }
7152 /* Accept a string constant to initialize a subarray. */
7158 /* Otherwise, if we have come to a subaggregate,
7159 and we don't have an element of its type, push into it. */
7165 {
7168 }
7171 {
7176 }
7177 else
7178 /* Do the bookkeeping for an element that was
7179 directly output as a constructor. */
7180 {
7181 /* For a record, keep track of end position of last field. */
7183 constructor_bit_index
7188 /* If the current field was the first one not yet written out,
7189 it isn't now, so update. */
7191 {
7193 /* Skip any nameless bit fields. */
7197 constructor_unfilled_fields =
7199 }
7200 }
7203 /* Skip any nameless bit fields at the beginning. */
7208 }
7210 {
7211 tree fieldtype;
7215 {
7219 }
7226 /* Warn that traditional C rejects initialization of unions.
7227 We skip the warning if the value is zero. This is done
7228 under the assumption that the zero initializer in user
7229 code appears conditioned on e.g. __STDC__ to avoid
7230 "missing initializer" warnings and relies on default
7231 initialization to zero in the traditional C case.
7232 We also skip the warning if the initializer is designated,
7233 again on the assumption that this must be conditional on
7234 __STDC__ anyway (and we've already complained about the
7235 member-designator already). */
7242 /* Accept a string constant to initialize a subarray. */
7248 /* Otherwise, if we have come to a subaggregate,
7249 and we don't have an element of its type, push into it. */
7255 {
7258 }
7261 {
7266 }
7267 else
7268 /* Do the bookkeeping for an element that was
7269 directly output as a constructor. */
7270 {
7273 }
7276 }
7278 {
7282 /* Accept a string constant to initialize a subarray. */
7288 /* Otherwise, if we have come to a subaggregate,
7289 and we don't have an element of its type, push into it. */
7295 {
7298 }
7303 {
7307 }
7309 /* Now output the actual element. */
7311 {
7316 }
7318 constructor_index
7322 /* If we are doing the bookkeeping for an element that was
7323 directly output as a constructor, we must update
7324 constructor_unfilled_index. */
7326 }
7328 {
7331 /* Do a basic check of initializer size. Note that vectors
7332 always have a fixed size derived from their type. */
7334 {
7338 }
7340 /* Now output the actual element. */
7345 constructor_index
7349 /* If we are doing the bookkeeping for an element that was
7350 directly output as a constructor, we must update
7351 constructor_unfilled_index. */
7353 }
7355 /* Handle the sole element allowed in a braced initializer
7356 for a scalar variable. */
7359 {
7363 }
7364 else
7365 {
7370 }
7372 /* Handle range initializers either at this level or anywhere higher
7373 in the designator stack. */
7375 {
7382 {
7385 }
7389 {
7392 }
7399 {
7403 {
7406 }
7414 }
7419 }
7422 }
7425 }
7426 \f
7427 /* Build a complete asm-statement, whose components are a CV_QUALIFIER
7428 (guaranteed to be 'volatile' or null) and ARGS (represented using
7429 an ASM_EXPR node). */
7430 tree
7432 {
7436 }
7438 /* Build an asm-expr, whose components are a STRING, some OUTPUTS,
7439 some INPUTS, and some CLOBBERS. The latter three may be NULL.
7440 SIMPLE indicates whether there was anything at all after the
7441 string in the asm expression -- asm("blah") and asm("blah" : )
7442 are subtly different. We use a ASM_EXPR node to represent this. */
7443 tree
7446 {
7447 tree tail;
7448 tree args;
7461 /* Remove output conversions that change the type but not the mode. */
7463 {
7466 /* ??? Really, this should not be here. Users should be using a
7467 proper lvalue, dammit. But there's a long history of using casts
7468 in the output operands. In cases like longlong.h, this becomes a
7469 primitive form of typechecking -- if the cast can be removed, then
7470 the output operand had a type of the proper width; otherwise we'll
7471 get an error. Gross, but ... */
7490 {
7491 /* If the operand is going to end up in memory,
7492 mark it addressable. */
7495 }
7496 else
7500 }
7503 {
7504 tree input;
7511 {
7512 /* If the operand is going to end up in memory,
7513 mark it addressable. */
7515 {
7516 /* Strip the nops as we allow this case. FIXME, this really
7517 should be rejected or made deprecated. */
7521 }
7522 }
7523 else
7527 }
7531 /* asm statements without outputs, including simple ones, are treated
7532 as volatile. */
7537 }
7538 \f
7539 /* Generate a goto statement to LABEL. */
7541 tree
7543 {
7549 {
7552 }
7555 {
7558 }
7561 {
7562 /* No jump from outside this statement expression context, so
7563 record that there is a jump from within this context. */
7569 }
7572 {
7573 /* No jump from outside this context context of identifiers with
7574 variably modified type, so record that there is a jump from
7575 within this context. */
7581 }
7585 }
7587 /* Generate a computed goto statement to EXPR. */
7589 tree
7591 {
7596 }
7598 /* Generate a C `return' statement. RETVAL is the expression for what
7599 to return, or a null pointer for `return;' with no value. */
7601 tree
7603 {
7612 {
7616 {
7619 }
7623 }
7626 {
7630 {
7632 "%<return%> with no value, in "
7635 }
7636 }
7638 {
7643 else
7646 }
7647 else
7648 {
7652 tree inner;
7660 /* Strip any conversions, additions, and subtractions, and see if
7661 we are returning the address of a local variable. Warn if so. */
7663 {
7665 {
7666 CASE_CONVERT:
7674 /* If the second operand of the MINUS_EXPR has a pointer
7675 type (or is converted from it), this may be valid, so
7676 don't give a warning. */
7677 {
7690 }
7708 }
7711 }
7717 }
7722 }
7723 \f
7725 /* The SWITCH_EXPR being built. */
7726 tree switch_expr;
7728 /* The original type of the testing expression, i.e. before the
7729 default conversion is applied. */
7730 tree orig_type;
7732 /* A splay-tree mapping the low element of a case range to the high
7733 element, or NULL_TREE if there is no high element. Used to
7734 determine whether or not a new case label duplicates an old case
7735 label. We need a tree, rather than simply a hash table, because
7736 of the GNU case range extension. */
7737 splay_tree cases;
7739 /* Number of nested statement expressions within this switch
7740 statement; if nonzero, case and default labels may not
7741 appear. */
7744 /* Scope of outermost declarations of identifiers with variably
7745 modified type within this switch statement; if nonzero, case and
7746 default labels may not appear. */
7749 /* The next node on the stack. */
7751 };
7753 /* A stack of the currently active switch statements. The innermost
7754 switch statement is on the top of the stack. There is no need to
7755 mark the stack for garbage collection because it is only active
7756 during the processing of the body of a function, and we never
7757 collect at that point. */
7761 /* Start a C switch statement, testing expression EXP. Return the new
7762 SWITCH_EXPR. */
7764 tree
7766 {
7771 {
7775 {
7777 {
7780 }
7782 }
7783 else
7784 {
7798 }
7799 }
7801 /* Add this new SWITCH_EXPR to the stack. */
7812 }
7814 /* Process a case label. */
7816 tree
7818 {
7823 {
7830 }
7832 {
7836 else
7839 }
7841 {
7845 else
7848 }
7851 else
7855 }
7857 /* Finish the switch statement. */
7859 void
7861 {
7863 location_t switch_location;
7867 /* We must not be within a statement expression nested in the switch
7868 at this point; we might, however, be within the scope of an
7869 identifier with variably modified type nested in the switch. */
7872 /* Emit warnings as needed. */
7875 else
7881 /* Pop the stack. */
7885 }
7886 \f
7887 /* Emit an if statement. IF_LOCUS is the location of the 'if'. COND,
7888 THEN_BLOCK and ELSE_BLOCK are expressions to be used; ELSE_BLOCK
7889 may be null. NESTED_IF is true if THEN_BLOCK contains another IF
7890 statement, and was not surrounded with parenthesis. */
7892 void
7895 {
7896 tree stmt;
7898 /* Diagnose an ambiguous else if if-then-else is nested inside if-then. */
7900 {
7903 /* We know from the grammar productions that there is an IF nested
7904 within THEN_BLOCK. Due to labels and c99 conditional declarations,
7905 it might not be exactly THEN_BLOCK, but should be the last
7906 non-container statement within. */
7909 {
7924 }
7925 found:
7931 }
7936 }
7938 /* Emit a general-purpose loop construct. START_LOCUS is the location of
7939 the beginning of the loop. COND is the loop condition. COND_IS_FIRST
7940 is false for DO loops. INCR is the FOR increment expression. BODY is
7941 the statement controlled by the loop. BLAB is the break label. CLAB is
7942 the continue label. Everything is allowed to be NULL. */
7944 void
7947 {
7950 /* If the condition is zero don't generate a loop construct. */
7952 {
7954 {
7958 }
7959 }
7960 else
7961 {
7964 /* If we have an exit condition, then we build an IF with gotos either
7965 out of the loop, or to the top of it. If there's no exit condition,
7966 then we just build a jump back to the top. */
7970 {
7971 /* Canonicalize the loop condition to the end. This means
7972 generating a branch to the loop condition. Reuse the
7973 continue label, if possible. */
7975 {
7977 {
7980 }
7981 else
7985 }
7991 else
7993 }
7996 }
8010 }
8012 tree
8014 {
8018 /* In switch statements break is sometimes stylistically used after
8019 a return statement. This can lead to spurious warnings about
8020 control reaching the end of a non-void function when it is
8021 inlined. Note that we are calling block_may_fallthru with
8022 language specific tree nodes; this works because
8023 block_may_fallthru returns true when given something it does not
8024 understand. */
8028 {
8031 }
8033 ;
8035 {
8039 else
8050 }
8059 }
8061 /* A helper routine for c_process_expr_stmt and c_finish_stmt_expr. */
8063 static void
8065 {
8067 ;
8069 {
8073 }
8074 else
8076 }
8078 /* Process an expression as if it were a complete statement. Emit
8079 diagnostics, but do not call ADD_STMT. */
8081 tree
8083 {
8097 /* If we're not processing a statement expression, warn about unused values.
8098 Warnings for statement expressions will be emitted later, once we figure
8099 out which is the result. */
8104 /* If the expression is not of a type to which we cannot assign a line
8105 number, wrap the thing in a no-op NOP_EXPR. */
8113 }
8115 /* Emit an expression as a statement. */
8117 tree
8119 {
8122 else
8124 }
8126 /* Do the opposite and emit a statement as an expression. To begin,
8127 create a new binding level and return it. */
8129 tree
8131 {
8132 tree ret;
8136 /* We must force a BLOCK for this level so that, if it is not expanded
8137 later, there is a way to turn off the entire subtree of blocks that
8138 are contained in it. */
8142 {
8145 }
8149 {
8151 }
8158 /* Mark the current statement list as belonging to a statement list. */
8162 }
8164 tree
8166 {
8173 {
8176 }
8177 /* It is no longer possible to jump to labels defined within this
8178 statement expression. */
8182 {
8184 }
8185 /* It is again possible to define labels with a goto just outside
8186 this statement expression. */
8190 {
8193 }
8196 else
8201 /* Locate the last statement in BODY. See c_end_compound_stmt
8202 about always returning a BIND_EXPR. */
8206 continue_searching:
8208 {
8209 tree_stmt_iterator i;
8211 /* This can happen with degenerate cases like ({ }). No value. */
8215 /* If we're supposed to generate side effects warnings, process
8216 all of the statements except the last. */
8218 {
8221 }
8222 else
8226 }
8228 /* If the end of the list is exception related, then the list was split
8229 by a call to push_cleanup. Continue searching. */
8232 {
8236 }
8238 /* In the case that the BIND_EXPR is not necessary, return the
8239 expression out from inside it. */
8243 {
8244 /* Even if this looks constant, do not allow it in a constant
8245 expression. */
8248 /* Do not warn if the return value of a statement expression is
8249 unused. */
8252 }
8254 /* Extract the type of said expression. */
8257 /* If we're not returning a value at all, then the BIND_EXPR that
8258 we already have is a fine expression to return. */
8262 /* Now that we've located the expression containing the value, it seems
8263 silly to make voidify_wrapper_expr repeat the process. Create a
8264 temporary of the appropriate type and stick it in a TARGET_EXPR. */
8267 /* Unwrap a no-op NOP_EXPR as added by c_finish_expr_stmt. This avoids
8268 tree_expr_nonnegative_p giving up immediately. */
8278 }
8280 /* Begin the scope of an identifier of variably modified type, scope
8281 number SCOPE. Jumping from outside this scope to inside it is not
8282 permitted. */
8284 void
8286 {
8292 /* At file_scope, we don't have to do any processing. */
8301 {
8303 }
8310 }
8312 /* End a scope which may contain identifiers of variably modified
8313 type, scope number SCOPE. */
8315 void
8317 {
8322 /* We may have a number of nested scopes of identifiers with
8323 variably modified type, all at this depth. Pop each in turn. */
8325 {
8328 /* It is no longer possible to jump to labels defined within this
8329 scope. */
8333 {
8335 }
8336 /* It is again possible to define labels with a goto just outside
8337 this scope. */
8341 {
8344 }
8347 else
8351 }
8352 }
8353 \f
8354 /* Begin and end compound statements. This is as simple as pushing
8355 and popping new statement lists from the tree. */
8357 tree
8359 {
8364 }
8366 tree
8368 {
8372 {
8376 }
8381 /* If this compound statement is nested immediately inside a statement
8382 expression, then force a BIND_EXPR to be created. Otherwise we'll
8383 do the wrong thing for ({ { 1; } }) or ({ 1; { } }). In particular,
8384 STATEMENT_LISTs merge, and thus we can lose track of what statement
8385 was really last. */
8389 {
8392 }
8395 }
8397 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
8398 when the current scope is exited. EH_ONLY is true when this is not
8399 meant to apply to normal control flow transfer. */
8401 void
8403 {
8415 }
8416 \f
8417 /* Build a binary-operation expression without default conversions.
8418 CODE is the kind of expression to build.
8419 LOCATION is the operator's location.
8420 This function differs from `build' in several ways:
8421 the data type of the result is computed and recorded in it,
8422 warnings are generated if arg data types are invalid,
8423 special handling for addition and subtraction of pointers is known,
8424 and some optimization is done (operations on narrow ints
8425 are done in the narrower type when that gives the same result).
8426 Constant folding is also done before the result is returned.
8428 Note that the operands will never have enumeral types, or function
8429 or array types, because either they will have the default conversions
8430 performed or they have both just been converted to some other type in which
8431 the arithmetic is to be done. */
8433 tree
8436 {
8438 tree eptype;
8445 /* Expression code to give to the expression when it is built.
8446 Normally this is CODE, which is what the caller asked for,
8447 but in some special cases we change it. */
8450 /* Data type in which the computation is to be performed.
8451 In the simplest cases this is the common type of the arguments. */
8454 /* When the computation is in excess precision, the type of the
8455 final EXCESS_PRECISION_EXPR. */
8458 /* Nonzero means operands have already been type-converted
8459 in whatever way is necessary.
8460 Zero means they need to be converted to RESULT_TYPE. */
8463 /* Nonzero means create the expression with this type, rather than
8464 RESULT_TYPE. */
8467 /* Nonzero means after finally constructing the expression
8468 convert it to this type. */
8471 /* Nonzero if this is an operation like MIN or MAX which can
8472 safely be computed in short if both args are promoted shorts.
8473 Also implies COMMON.
8474 -1 indicates a bitwise operation; this makes a difference
8475 in the exact conditions for when it is safe to do the operation
8476 in a narrower mode. */
8479 /* Nonzero if this is a comparison operation;
8480 if both args are promoted shorts, compare the original shorts.
8481 Also implies COMMON. */
8484 /* Nonzero if this is a right-shift operation, which can be computed on the
8485 original short and then promoted if the operand is a promoted short. */
8488 /* Nonzero means set RESULT_TYPE to the common type of the args. */
8491 /* True means types are compatible as far as ObjC is concerned. */
8494 /* True means this is an arithmetic operation that may need excess
8495 precision. */
8504 {
8507 int_const = (int_const_or_overflow
8510 }
8511 else
8515 {
8518 }
8519 else
8520 {
8523 }
8528 /* The expression codes of the data types of the arguments tell us
8529 whether the arguments are integers, floating, pointers, etc. */
8533 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
8537 /* If an error was already reported for one of the arguments,
8538 avoid reporting another error. */
8545 {
8548 }
8551 {
8565 }
8567 {
8570 }
8573 {
8576 }
8578 {
8581 }
8584 {
8587 }
8592 {
8594 /* Handle the pointer + int case. */
8596 {
8599 }
8601 {
8604 }
8605 else
8610 /* Subtraction of two similar pointers.
8611 We must subtract them as integers, then divide by object size. */
8614 {
8617 }
8618 /* Handle pointer minus int. Just like pointer plus int. */
8620 {
8623 }
8624 else
8645 {
8656 else
8657 /* Although it would be tempting to shorten always here, that
8658 loses on some targets, since the modulo instruction is
8659 undefined if the quotient can't be represented in the
8660 computation mode. We shorten only if unsigned or if
8661 dividing by something we know != -1. */
8666 }
8674 /* Allow vector types which are not floating point types. */
8687 {
8688 /* Although it would be tempting to shorten always here, that loses
8689 on some targets, since the modulo instruction is undefined if the
8690 quotient can't be represented in the computation mode. We shorten
8691 only if unsigned or if dividing by something we know != -1. */
8696 }
8710 {
8711 /* Result of these operations is always an int,
8712 but that does not mean the operands should be
8713 converted to ints! */
8718 }
8720 {
8721 int_const_or_overflow = (int_operands
8725 int_const = (int_const_or_overflow
8729 }
8731 {
8732 int_const_or_overflow = (int_operands
8736 int_const = (int_const_or_overflow
8740 }
8743 /* Shift operations: result has same type as first operand;
8744 always convert second operand to int.
8745 Also set SHORT_SHIFT if shifting rightward. */
8750 {
8752 {
8754 {
8758 }
8759 else
8760 {
8765 {
8769 }
8770 }
8771 }
8773 /* Use the type of the value to be shifted. */
8775 /* Convert the shift-count to an integer, regardless of size
8776 of value being shifted. */
8779 /* Avoid converting op1 to result_type later. */
8781 }
8787 {
8789 {
8791 {
8795 }
8798 {
8802 }
8803 }
8805 /* Use the type of the value to be shifted. */
8807 /* Convert the shift-count to an integer, regardless of size
8808 of value being shifted. */
8811 /* Avoid converting op1 to result_type later. */
8813 }
8820 OPT_Wfloat_equal,
8822 /* Result of comparison is always int,
8823 but don't convert the args to int! */
8831 {
8834 /* Anything compares with void *. void * compares with anything.
8835 Otherwise, the targets must be compatible
8836 and both must be object or both incomplete. */
8840 {
8841 /* op0 != orig_op0 detects the case of something
8842 whose value is 0 but which isn't a valid null ptr const. */
8847 }
8849 {
8854 }
8855 else
8856 /* Avoid warning about the volatile ObjC EH puts on decls. */
8863 }
8865 {
8872 }
8874 {
8881 }
8883 {
8886 }
8888 {
8891 }
8905 {
8907 {
8916 }
8917 else
8918 {
8922 }
8923 }
8925 {
8933 }
8935 {
8939 }
8941 {
8944 }
8946 {
8949 }
8954 }
8963 {
8966 }
8970 &&
8973 {
8977 {
8981 }
8983 /* For certain operations (which identify themselves by shorten != 0)
8984 if both args were extended from the same smaller type,
8985 do the arithmetic in that type and then extend.
8987 shorten !=0 and !=1 indicates a bitwise operation.
8988 For them, this optimization is safe only if
8989 both args are zero-extended or both are sign-extended.
8990 Otherwise, we might change the result.
8991 Eg, (short)-1 | (unsigned short)-1 is (int)-1
8992 but calculated in (unsigned short) it would be (unsigned short)-1. */
8995 {
8999 }
9001 /* Shifts can be shortened if shifting right. */
9004 {
9014 /* We can shorten only if the shift count is less than the
9015 number of bits in the smaller type size. */
9017 /* We cannot drop an unsigned shift after sign-extension. */
9019 {
9020 /* Do an unsigned shift if the operand was zero-extended. */
9021 result_type
9024 /* Convert value-to-be-shifted to that type. */
9028 }
9029 }
9031 /* Comparison operations are shortened too but differently.
9032 They identify themselves by setting short_compare = 1. */
9035 {
9036 /* Don't write &op0, etc., because that would prevent op0
9037 from being kept in a register.
9038 Instead, make copies of the our local variables and
9039 pass the copies by reference, then copy them back afterward. */
9042 tree val
9046 {
9049 }
9056 {
9062 {
9065 }
9066 else
9067 {
9068 /* Fold for the sake of possible warnings, as in
9069 build_conditional_expr. This requires the
9070 "original" values to be folded, not just op0 and
9071 op1. */
9077 require_constant_value,
9078 NULL);
9080 require_constant_value,
9081 NULL);
9082 }
9089 {
9091 {
9095 }
9097 {
9101 }
9102 }
9103 }
9104 }
9105 }
9107 /* At this point, RESULT_TYPE must be nonzero to avoid an error message.
9108 If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
9109 Then the expression will be built.
9110 It will be given type FINAL_TYPE if that is nonzero;
9111 otherwise, it will be given type RESULT_TYPE. */
9114 {
9117 }
9120 {
9126 /* This can happen if one operand has a vector type, and the other
9127 has a different type. */
9130 }
9133 {
9136 {
9139 }
9140 }
9142 /* Treat expressions in initializers specially as they can't trap. */
9144 ret = (require_constant_value
9147 else
9152 return_build_binary_op:
9155 ret = (int_operands
9165 }
9168 /* Convert EXPR to be a truth-value, validating its type for this
9169 purpose. LOCATION is the source location for the expression. */
9171 tree
9173 {
9177 {
9179 error_at (location, "used array that cannot be converted to pointer where scalar is required");
9195 }
9200 /* ??? Should we also give an error for void and vectors rather than
9201 leaving those to give errors later? */
9205 {
9208 else
9210 }
9214 }
9215 \f
9217 /* Convert EXPR to a contained DECL, updating *TC, *TI and *SE as
9218 required. */
9220 tree
9222 {
9224 {
9226 /* Executing a compound literal inside a function reinitializes
9227 it. */
9231 }
9232 else
9234 }
9235 \f
9236 /* Like c_begin_compound_stmt, except force the retention of the BLOCK. */
9238 tree
9240 {
9241 tree block;
9247 }
9249 /* Generate OMP_PARALLEL, with CLAUSES and BLOCK as its compound statement. */
9251 tree
9253 {
9254 tree stmt;
9264 }
9266 /* Like c_begin_compound_stmt, except force the retention of the BLOCK. */
9268 tree
9270 {
9271 tree block;
9277 }
9279 /* Generate OMP_TASK, with CLAUSES and BLOCK as its compound statement. */
9281 tree
9283 {
9284 tree stmt;
9294 }
9296 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
9297 Remove any elements from the list that are invalid. */
9299 tree
9301 {
9312 {
9318 {
9336 {
9339 }
9341 {
9346 {
9368 }
9370 {
9374 }
9375 }
9386 {
9389 }
9392 check_dup_generic:
9395 {
9398 }
9402 {
9405 }
9406 else
9416 {
9419 }
9422 {
9425 }
9426 else
9436 {
9439 }
9442 {
9445 }
9446 else
9463 }
9466 {
9470 {
9474 }
9477 {
9483 {
9494 }
9496 {
9500 }
9501 }
9502 }
9506 else
9508 }
9512 }
9514 /* Make a variant type in the proper way for C/C++, propagating qualifiers
9515 down to the element type of an array. */
9517 tree
9519 {
9524 {
9525 tree t;
9527 type_quals);
9529 /* See if we already have an identically qualified type. */
9531 {
9538 }
9540 {
9551 {
9552 tree unqualified_canon
9558 }
9559 else
9561 }
9563 }
9565 /* A restrict-qualified pointer type must be a pointer to object or
9566 incomplete type. Note that the use of POINTER_TYPE_P also allows
9567 REFERENCE_TYPEs, which is appropriate for C++. */
9571 {
9574 }
9577 }