| blob | dccf9229965d4277f5fcd4a371128ed4710110e6 |
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
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 2, 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 COPYING. If not, write to the Free
20 Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
21 02110-1301, USA. */
24 /* This file is part of the C front end.
25 It contains routines to build C expressions given their operands,
26 including computing the types of the result, C-specific error checks,
27 and some optimization. */
49 /* Possible cases of implicit bad conversions. Used to select
50 diagnostic messages in convert_for_assignment. */
52 ic_argpass,
53 ic_argpass_nonproto,
54 ic_assign,
55 ic_init,
56 ic_return
57 };
59 /* The level of nesting inside "__alignof__". */
62 /* The level of nesting inside "sizeof". */
65 /* The level of nesting inside "typeof". */
71 /* Nonzero if we've already printed a "missing braces around initializer"
72 message within this initializer. */
110 \f
111 /* Return true if EXP is a null pointer constant, false otherwise. */
113 static bool
115 {
116 /* This should really operate on c_expr structures, but they aren't
117 yet available everywhere required. */
126 }
131 tree t1;
132 tree t2;
133 /* The return value of tagged_types_tu_compatible_p if we had seen
134 these two types already. */
136 };
141 /* Do `exp = require_complete_type (exp);' to make sure exp
142 does not have an incomplete type. (That includes void types.) */
144 tree
146 {
152 /* First, detect a valid value with a complete type. */
158 }
160 /* Print an error message for invalid use of an incomplete type.
161 VALUE is the expression that was used (or 0 if that isn't known)
162 and TYPE is the type that was invalid. */
164 void
166 {
169 /* Avoid duplicate error message. */
176 else
177 {
178 retry:
179 /* We must print an error message. Be clever about what it says. */
182 {
201 {
203 {
206 }
209 }
215 }
220 else
221 /* If this type has a typedef-name, the TYPE_NAME is a TYPE_DECL. */
223 }
224 }
226 /* Given a type, apply default promotions wrt unnamed function
227 arguments and return the new type. */
229 tree
231 {
236 {
237 /* Preserve unsignedness if not really getting any wider. */
242 }
245 }
247 /* Return a variant of TYPE which has all the type qualifiers of LIKE
248 as well as those of TYPE. */
250 static tree
252 {
255 }
257 /* Return true iff the given tree T is a variable length array. */
259 bool
261 {
266 }
267 \f
268 /* Return the composite type of two compatible types.
270 We assume that comptypes has already been done and returned
271 nonzero; if that isn't so, this may crash. In particular, we
272 assume that qualifiers match. */
274 tree
276 {
279 tree attributes;
281 /* Save time if the two types are the same. */
285 /* If one type is nonsense, use the other. */
294 /* Merge the attributes. */
297 /* If one is an enumerated type and the other is the compatible
298 integer type, the composite type might be either of the two
299 (DR#013 question 3). For consistency, use the enumerated type as
300 the composite type. */
310 {
312 /* For two pointers, do this recursively on the target type. */
313 {
320 }
323 {
326 tree unqual_elt;
332 /* We should not have any type quals on arrays at all. */
338 d1_variable = (!d1_zero
341 d2_variable = (!d2_zero
347 /* Save space: see if the result is identical to one of the args. */
360 /* Merge the element types, and have a size if either arg has
361 one. We may have qualifiers on the element types. To set
362 up TYPE_MAIN_VARIANT correctly, we need to form the
363 composite of the unqualified types and add the qualifiers
364 back at the end. */
369 && (d2_variable
370 || d2_zero
372 ? t1
376 }
382 {
383 /* Try harder not to create a new aggregate type. */
388 }
392 /* Function types: prefer the one that specified arg types.
393 If both do, merge the arg types. Also merge the return types. */
394 {
402 /* Save space: see if the result is identical to one of the args. */
408 /* Simple way if one arg fails to specify argument types. */
410 {
414 }
416 {
420 }
422 /* If both args specify argument types, we must merge the two
423 lists, argument by argument. */
424 /* Tell global_bindings_p to return false so that variable_size
425 doesn't die on VLAs in parameter types. */
438 {
439 /* A null type means arg type is not specified.
440 Take whatever the other function type has. */
442 {
445 }
447 {
450 }
452 /* Given wait (union {union wait *u; int *i} *)
453 and wait (union wait *),
454 prefer union wait * as type of parm. */
457 {
458 tree memb;
465 {
471 {
477 }
478 }
479 }
482 {
483 tree memb;
490 {
496 {
502 }
503 }
504 }
506 parm_done: ;
507 }
512 /* ... falls through ... */
513 }
517 }
519 }
521 /* Return the type of a conditional expression between pointers to
522 possibly differently qualified versions of compatible types.
524 We assume that comp_target_types has already been done and returned
525 nonzero; if that isn't so, this may crash. */
527 static tree
529 {
530 tree attributes;
533 tree target;
535 /* Save time if the two types are the same. */
539 /* If one type is nonsense, use the other. */
548 /* Merge the attributes. */
551 /* Find the composite type of the target types, and combine the
552 qualifiers of the two types' targets. Do not lose qualifiers on
553 array element types by taking the TYPE_MAIN_VARIANT. */
566 }
568 /* Return the common type for two arithmetic types under the usual
569 arithmetic conversions. The default conversions have already been
570 applied, and enumerated types converted to their compatible integer
571 types. The resulting type is unqualified and has no attributes.
573 This is the type for the result of most arithmetic operations
574 if the operands have the given two types. */
576 static tree
578 {
582 /* If one type is nonsense, use the other. */
600 /* Save time if the two types are the same. */
612 /* When one operand is a decimal float type, the other operand cannot be
613 a generic float type or a complex type. We also disallow vector types
614 here. */
617 {
619 {
622 }
624 {
627 }
629 {
632 }
633 }
635 /* If one type is a vector type, return that type. (How the usual
636 arithmetic conversions apply to the vector types extension is not
637 precisely specified.) */
644 /* If one type is complex, form the common type of the non-complex
645 components, then make that complex. Use T1 or T2 if it is the
646 required type. */
648 {
657 else
659 }
661 /* If only one is real, use it as the result. */
669 /* If both are real and either are decimal floating point types, use
670 the decimal floating point type with the greater precision. */
673 {
683 }
685 /* Both real or both integers; use the one with greater precision. */
692 /* Same precision. Prefer long longs to longs to ints when the
693 same precision, following the C99 rules on integer type rank
694 (which are equivalent to the C90 rules for C90 types). */
702 {
705 else
707 }
715 {
716 /* But preserve unsignedness from the other type,
717 since long cannot hold all the values of an unsigned int. */
720 else
722 }
724 /* Likewise, prefer long double to double even if same size. */
729 /* Otherwise prefer the unsigned one. */
733 else
735 }
736 \f
737 /* Wrapper around c_common_type that is used by c-common.c and other
738 front end optimizations that remove promotions. ENUMERAL_TYPEs
739 are allowed here and are converted to their compatible integer types.
740 BOOLEAN_TYPEs are allowed here and return either boolean_type_node or
741 preferably a non-Boolean type as the common type. */
742 tree
744 {
750 /* If both types are BOOLEAN_TYPE, then return boolean_type_node. */
755 /* If either type is BOOLEAN_TYPE, then return the other. */
762 }
764 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
765 or various other operations. Return 2 if they are compatible
766 but a warning may be needed if you use them together. */
768 int
770 {
778 }
779 \f
780 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
781 or various other operations. Return 2 if they are compatible
782 but a warning may be needed if you use them together. This
783 differs from comptypes, in that we don't free the seen types. */
785 static int
787 {
792 /* Suppress errors caused by previously reported errors. */
798 /* If either type is the internal version of sizetype, return the
799 language version. */
809 /* Enumerated types are compatible with integer types, but this is
810 not transitive: two enumerated types in the same translation unit
811 are compatible with each other only if they are the same type. */
821 /* Different classes of types can't be compatible. */
826 /* Qualifiers must match. C99 6.7.3p9 */
831 /* Allow for two different type nodes which have essentially the same
832 definition. Note that we already checked for equality of the type
833 qualifiers (just above). */
839 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
843 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
847 {
849 /* Do not remove mode or aliasing information. */
862 {
869 /* Target types must match incl. qualifiers. */
874 /* Sizes must match unless one is missing or variable. */
881 d1_variable = (!d1_zero
884 d2_variable = (!d2_zero
900 }
906 {
917 }
927 }
929 }
931 /* Return 1 if TTL and TTR are pointers to types that are equivalent,
932 ignoring their qualifiers. */
934 static int
936 {
940 /* Do not lose qualifiers on element types of array types that are
941 pointer targets by taking their TYPE_MAIN_VARIANT. */
953 }
954 \f
955 /* Subroutines of `comptypes'. */
957 /* Determine whether two trees derive from the same translation unit.
958 If the CONTEXT chain ends in a null, that tree's context is still
959 being parsed, so if two trees have context chains ending in null,
960 they're in the same translation unit. */
961 int
963 {
966 {
974 }
978 {
986 }
989 }
991 /* Allocate the seen two types, assuming that they are compatible. */
995 {
1003 /* The C standard says that two structures in different translation
1004 units are compatible with each other only if the types of their
1005 fields are compatible (among other things). We assume that they
1006 are compatible until proven otherwise when building the cache.
1007 An example where this can occur is:
1008 struct a
1009 {
1010 struct a *next;
1011 };
1012 If we are comparing this against a similar struct in another TU,
1013 and did not assume they were compatible, we end up with an infinite
1014 loop. */
1017 }
1019 /* Free the seen types until we get to TU_TIL. */
1021 static void
1023 {
1026 {
1030 }
1032 }
1034 /* Return 1 if two 'struct', 'union', or 'enum' types T1 and T2 are
1035 compatible. If the two types are not the same (which has been
1036 checked earlier), this can only happen when multiple translation
1037 units are being compiled. See C99 6.2.7 paragraph 1 for the exact
1038 rules. */
1040 static int
1042 {
1046 /* We have to verify that the tags of the types are the same. This
1047 is harder than it looks because this may be a typedef, so we have
1048 to go look at the original type. It may even be a typedef of a
1049 typedef...
1050 In the case of compiler-created builtin structs the TYPE_DECL
1051 may be a dummy, with no DECL_ORIGINAL_TYPE. Don't fault. */
1062 /* C90 didn't have the requirement that the two tags be the same. */
1066 /* C90 didn't say what happened if one or both of the types were
1067 incomplete; we choose to follow C99 rules here, which is that they
1068 are compatible. */
1073 {
1078 }
1081 {
1083 {
1085 /* Speed up the case where the type values are in the same order. */
1090 {
1092 }
1095 {
1099 {
1102 }
1103 }
1106 {
1108 }
1110 {
1113 }
1116 {
1119 }
1122 {
1126 {
1129 }
1130 }
1132 }
1135 {
1138 {
1141 }
1143 /* Speed up the common case where the fields are in the same order. */
1146 {
1155 {
1158 }
1165 {
1168 }
1169 }
1171 {
1174 }
1177 {
1183 {
1187 {
1190 }
1201 }
1203 {
1206 }
1207 }
1210 }
1213 {
1219 {
1234 }
1237 else
1240 }
1244 }
1245 }
1247 /* Return 1 if two function types F1 and F2 are compatible.
1248 If either type specifies no argument types,
1249 the other must specify a fixed number of self-promoting arg types.
1250 Otherwise, if one type specifies only the number of arguments,
1251 the other must specify that number of self-promoting arg types.
1252 Otherwise, the argument types must match. */
1254 static int
1256 {
1258 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1266 /* 'volatile' qualifiers on a function's return type used to mean
1267 the function is noreturn. */
1283 /* An unspecified parmlist matches any specified parmlist
1284 whose argument types don't need default promotions. */
1287 {
1290 /* If one of these types comes from a non-prototype fn definition,
1291 compare that with the other type's arglist.
1292 If they don't match, ask for a warning (but no error). */
1297 }
1299 {
1306 }
1308 /* Both types have argument lists: compare them and propagate results. */
1311 }
1313 /* Check two lists of types for compatibility,
1314 returning 0 for incompatible, 1 for compatible,
1315 or 2 for compatible with warning. */
1317 static int
1319 {
1320 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1325 {
1329 /* If one list is shorter than the other,
1330 they fail to match. */
1339 /* A null pointer instead of a type
1340 means there is supposed to be an argument
1341 but nothing is specified about what type it has.
1342 So match anything that self-promotes. */
1344 {
1347 }
1349 {
1352 }
1353 /* If one of the lists has an error marker, ignore this arg. */
1356 ;
1358 {
1359 /* Allow wait (union {union wait *u; int *i} *)
1360 and wait (union wait *) to be compatible. */
1367 {
1368 tree memb;
1371 {
1378 }
1381 }
1388 {
1389 tree memb;
1392 {
1399 }
1402 }
1403 else
1405 }
1407 /* comptypes said ok, but record if it said to warn. */
1413 }
1414 }
1415 \f
1416 /* Compute the size to increment a pointer by. */
1418 static tree
1420 {
1427 {
1430 }
1432 /* Convert in case a char is more than one unit. */
1436 }
1437 \f
1438 /* Return either DECL or its known constant value (if it has one). */
1440 tree
1442 {
1444 in a place where a variable is invalid. Note that DECL_INITIAL
1445 isn't valid for a PARM_DECL. */
1452 /* This is invalid if initial value is not constant.
1453 If it has either a function call, a memory reference,
1454 or a variable, then re-evaluating it could give different results. */
1456 /* Check for cases where this is sub-optimal, even though valid. */
1460 }
1462 /* Return either DECL or its known constant value (if it has one), but
1463 return DECL if pedantic or DECL has mode BLKmode. This is for
1464 bug-compatibility with the old behavior of decl_constant_value
1465 (before GCC 3.0); every use of this function is a bug and it should
1466 be removed before GCC 3.1. It is not appropriate to use pedantic
1467 in a way that affects optimization, and BLKmode is probably not the
1468 right test for avoiding misoptimizations either. */
1470 static tree
1472 {
1473 tree ret;
1479 /* Avoid unwanted tree sharing between the initializer and current
1480 function's body where the tree can be modified e.g. by the
1481 gimplifier. */
1485 }
1487 /* Convert the array expression EXP to a pointer. */
1488 static tree
1490 {
1493 tree adr;
1495 tree ptrtype;
1510 {
1511 /* We are making an ADDR_EXPR of ptrtype. This is a valid
1512 ADDR_EXPR because it's the best way of representing what
1513 happens in C when we take the address of an array and place
1514 it in a pointer to the element type. */
1520 }
1522 /* This way is better for a COMPONENT_REF since it can
1523 simplify the offset for a component. */
1526 }
1528 /* Convert the function expression EXP to a pointer. */
1529 static tree
1531 {
1542 }
1544 /* Perform the default conversion of arrays and functions to pointers.
1545 Return the result of converting EXP. For any other expression, just
1546 return EXP after removing NOPs. */
1548 struct c_expr
1550 {
1556 {
1558 {
1566 {
1570 }
1577 {
1578 /* Before C99, non-lvalue arrays do not decay to pointers.
1579 Normally, using such an array would be invalid; but it can
1580 be used correctly inside sizeof or as a statement expression.
1581 Thus, do not give an error here; an error will result later. */
1583 }
1586 }
1596 }
1599 }
1602 /* EXP is an expression of integer type. Apply the integer promotions
1603 to it and return the promoted value. */
1605 tree
1607 {
1613 /* Normally convert enums to int,
1614 but convert wide enums to something wider. */
1616 {
1624 }
1626 /* ??? This should no longer be needed now bit-fields have their
1627 proper types. */
1630 /* If it's thinner than an int, promote it like a
1631 c_promoting_integer_type_p, otherwise leave it alone. */
1637 {
1638 /* Preserve unsignedness if not really getting any wider. */
1644 }
1647 }
1650 /* Perform default promotions for C data used in expressions.
1651 Enumeral types or short or char are converted to int.
1652 In addition, manifest constants symbols are replaced by their values. */
1654 tree
1656 {
1657 tree orig_exp;
1661 /* Functions and arrays have been converted during parsing. */
1666 /* Constants can be used directly unless they're not loadable. */
1670 /* Replace a nonvolatile const static variable with its value unless
1671 it is an array, in which case we must be sure that taking the
1672 address of the array produces consistent results. */
1674 {
1677 }
1679 /* Strip no-op conversions. */
1690 {
1693 }
1695 }
1696 \f
1697 /* Look up COMPONENT in a structure or union DECL.
1699 If the component name is not found, returns NULL_TREE. Otherwise,
1700 the return value is a TREE_LIST, with each TREE_VALUE a FIELD_DECL
1701 stepping down the chain to the component, which is in the last
1702 TREE_VALUE of the list. Normally the list is of length one, but if
1703 the component is embedded within (nested) anonymous structures or
1704 unions, the list steps down the chain to the component. */
1706 static tree
1708 {
1710 tree field;
1712 /* If TYPE_LANG_SPECIFIC is set, then it is a sorted array of pointers
1713 to the field elements. Use a binary search on this array to quickly
1714 find the element. Otherwise, do a linear search. TYPE_LANG_SPECIFIC
1715 will always be set for structures which have many elements. */
1718 {
1726 {
1731 {
1732 /* Step through all anon unions in linear fashion. */
1734 {
1738 {
1743 }
1744 }
1746 /* Entire record is only anon unions. */
1750 /* Restart the binary search, with new lower bound. */
1752 }
1758 else
1760 }
1766 }
1767 else
1768 {
1770 {
1774 {
1779 }
1783 }
1787 }
1790 }
1792 /* Make an expression to refer to the COMPONENT field of
1793 structure or union value DATUM. COMPONENT is an IDENTIFIER_NODE. */
1795 tree
1797 {
1801 tree ref;
1806 /* See if there is a field or component with name COMPONENT. */
1809 {
1811 {
1814 }
1819 {
1822 }
1824 /* Chain the COMPONENT_REFs if necessary down to the FIELD.
1825 This might be better solved in future the way the C++ front
1826 end does it - by giving the anonymous entities each a
1827 separate name and type, and then have build_component_ref
1828 recursively call itself. We can't do that here. */
1829 do
1830 {
1833 tree subtype;
1843 NULL_TREE);
1855 }
1859 }
1862 component);
1865 }
1866 \f
1867 /* Given an expression PTR for a pointer, return an expression
1868 for the value pointed to.
1869 ERRORSTRING is the name of the operator to appear in error messages. */
1871 tree
1873 {
1878 {
1882 {
1883 /* If a warning is issued, mark it to avoid duplicates from
1884 the backend. This only needs to be done at
1885 warn_strict_aliasing > 2. */
1890 }
1896 else
1897 {
1899 tree ref;
1904 {
1907 }
1911 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
1912 so that we get the proper error message if the result is used
1913 to assign to. Also, &* is supposed to be a no-op.
1914 And ANSI C seems to specify that the type of the result
1915 should be the const type. */
1916 /* A de-reference of a pointer to const is not a const. It is valid
1917 to change it via some other pointer. */
1923 }
1924 }
1928 }
1930 /* This handles expressions of the form "a[i]", which denotes
1931 an array reference.
1933 This is logically equivalent in C to *(a+i), but we may do it differently.
1934 If A is a variable or a member, we generate a primitive ARRAY_REF.
1935 This avoids forcing the array out of registers, and can work on
1936 arrays that are not lvalues (for example, members of structures returned
1937 by functions). */
1939 tree
1941 {
1949 {
1950 tree temp;
1953 {
1956 }
1961 }
1964 {
1967 }
1970 {
1973 }
1975 /* ??? Existing practice has been to warn only when the char
1976 index is syntactically the index, not for char[array]. */
1980 /* Apply default promotions *after* noticing character types. */
1986 {
1989 /* An array that is indexed by a non-constant
1990 cannot be stored in a register; we must be able to do
1991 address arithmetic on its address.
1992 Likewise an array of elements of variable size. */
1996 {
1999 }
2000 /* An array that is indexed by a constant value which is not within
2001 the array bounds cannot be stored in a register either; because we
2002 would get a crash in store_bit_field/extract_bit_field when trying
2003 to access a non-existent part of the register. */
2007 {
2010 }
2013 {
2021 }
2027 /* Array ref is const/volatile if the array elements are
2028 or if the array is. */
2037 /* This was added by rms on 16 Nov 91.
2038 It fixes vol struct foo *a; a->elts[1]
2039 in an inline function.
2040 Hope it doesn't break something else. */
2043 }
2044 else
2045 {
2056 }
2057 }
2058 \f
2059 /* Build an external reference to identifier ID. FUN indicates
2060 whether this will be used for a function call. LOC is the source
2061 location of the identifier. */
2062 tree
2064 {
2065 tree ref;
2068 /* In Objective-C, an instance variable (ivar) may be preferred to
2069 whatever lookup_name() found. */
2075 /* Implicit function declaration. */
2078 /* Don't complain about something that's already been
2079 complained about. */
2081 else
2082 {
2085 }
2098 {
2105 }
2108 {
2113 }
2119 {
2124 }
2125 /* C99 6.7.4p3: An inline definition of a function with external
2126 linkage ... shall not contain a reference to an identifier with
2127 internal linkage. */
2138 }
2140 /* Record details of decls possibly used inside sizeof or typeof. */
2141 struct maybe_used_decl
2142 {
2143 /* The decl. */
2144 tree decl;
2145 /* The level seen at (in_sizeof + in_typeof). */
2147 /* The next one at this level or above, or NULL. */
2149 };
2153 /* Record that DECL, an undefined static function reference seen
2154 inside sizeof or typeof, might be used if the operand of sizeof is
2155 a VLA type or the operand of typeof is a variably modified
2156 type. */
2158 static void
2160 {
2166 }
2168 /* Pop the stack of decls possibly used inside sizeof or typeof. If
2169 USED is false, just discard them. If it is true, mark them used
2170 (if no longer inside sizeof or typeof) or move them to the next
2171 level up (if still inside sizeof or typeof). */
2173 void
2175 {
2179 {
2181 {
2184 else
2186 }
2188 }
2191 }
2193 /* Return the result of sizeof applied to EXPR. */
2195 struct c_expr
2197 {
2200 {
2204 }
2205 else
2206 {
2210 {
2211 /* sizeof is evaluated when given a vla (C99 6.5.3.4p2). */
2213 }
2215 }
2217 }
2219 /* Return the result of sizeof applied to T, a structure for the type
2220 name passed to sizeof (rather than the type itself). */
2222 struct c_expr
2224 {
2225 tree type;
2233 }
2235 /* Build a function call to function FUNCTION with parameters PARAMS.
2236 PARAMS is a list--a chain of TREE_LIST nodes--in which the
2237 TREE_VALUE of each node is a parameter-expression.
2238 FUNCTION's data type may be a function type or a pointer-to-function. */
2240 tree
2242 {
2245 tree tem;
2250 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
2253 /* Convert anything with function type to a pointer-to-function. */
2255 {
2256 /* Implement type-directed function overloading for builtins.
2257 resolve_overloaded_builtin and targetm.resolve_overloaded_builtin
2258 handle all the type checking. The result is a complete expression
2259 that implements this function call. */
2266 }
2270 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
2271 expressions, like those used for ObjC messenger dispatches. */
2281 {
2284 }
2289 /* fntype now gets the type of function pointed to. */
2292 /* Check that the function is called through a compatible prototype.
2293 If it is not, replace the call by a trap, wrapped up in a compound
2294 expression if necessary. This has the nice side-effect to prevent
2295 the tree-inliner from generating invalid assignment trees which may
2296 blow up in the RTL expander later. */
2302 {
2305 NULL_TREE);
2307 /* This situation leads to run-time undefined behavior. We can't,
2308 therefore, simply error unless we can prove that all possible
2309 executions of the program must execute the code. */
2312 /* We can, however, treat "undefined" any way we please.
2313 Call abort to encourage the user to fix the program. */
2318 else
2319 {
2320 tree rhs;
2325 else
2329 }
2330 }
2332 /* Convert the parameters to the types declared in the
2333 function prototype, or apply default promotions. */
2342 /* Check that the arguments to the function are valid. */
2348 {
2355 }
2356 else
2363 }
2364 \f
2365 /* Convert the argument expressions in the list VALUES
2366 to the types in the list TYPELIST. The resulting arguments are
2367 stored in the array ARGARRAY which has size NARGS.
2369 If TYPELIST is exhausted, or when an element has NULL as its type,
2370 perform the default conversions.
2372 PARMLIST is the chain of parm decls for the function being called.
2373 It may be 0, if that info is not available.
2374 It is used only for generating error messages.
2376 FUNCTION is a tree for the called function. It is used only for
2377 error messages, where it is formatted with %qE.
2379 This is also where warnings about wrong number of args are generated.
2381 VALUES is a chain of TREE_LIST nodes with the elements of the list
2382 in the TREE_VALUE slots of those nodes.
2384 Returns the actual number of arguments processed (which may be less
2385 than NARGS in some error situations), or -1 on failure. */
2387 static int
2390 {
2393 tree selector;
2395 /* Change pointer to function to the function itself for
2396 diagnostics. */
2401 /* Handle an ObjC selector specially for diagnostics. */
2404 /* Scan the given expressions and types, producing individual
2405 converted arguments and storing them in ARGARRAY. */
2408 valtail;
2410 {
2418 {
2421 }
2424 {
2427 }
2434 {
2435 /* Formal parm type is specified by a function prototype. */
2436 tree parmval;
2439 {
2442 }
2443 else
2444 {
2445 /* Optionally warn about conversions that
2446 differ from the default conversions. */
2448 {
2481 /* ??? At some point, messages should be written about
2482 conversions between complex types, but that's too messy
2483 to do now. */
2486 {
2487 /* Warn if any argument is passed as `float',
2488 since without a prototype it would be `double'. */
2495 /* Warn if mismatch between argument and prototype
2496 for decimal float types. Warn of conversions with
2497 binary float types and of precision narrowing due to
2498 prototype. */
2506 && (formal_prec
2510 != dfloat64_type_node
2520 }
2521 /* Detect integer changing in width or signedness.
2522 These warnings are only activated with
2523 -Wtraditional-conversion, not with -Wtraditional. */
2526 {
2533 /* No warning if function asks for enum
2534 and the actual arg is that enum type. */
2535 ;
2541 ;
2542 /* Don't complain if the formal parameter type
2543 is an enum, because we can't tell now whether
2544 the value was an enum--even the same enum. */
2546 ;
2549 /* Change in signedness doesn't matter
2550 if a constant value is unaffected. */
2551 ;
2552 /* If the value is extended from a narrower
2553 unsigned type, it doesn't matter whether we
2554 pass it as signed or unsigned; the value
2555 certainly is the same either way. */
2558 ;
2563 else
2566 }
2567 }
2577 }
2579 }
2584 /* Convert `float' to `double'. */
2588 {
2591 }
2592 else
2593 /* Convert `short' and `char' to full-size `int'. */
2598 }
2603 {
2606 }
2609 }
2610 \f
2611 /* This is the entry point used by the parser to build unary operators
2612 in the input. CODE, a tree_code, specifies the unary operator, and
2613 ARG is the operand. For unary plus, the C parser currently uses
2614 CONVERT_EXPR for code. */
2616 struct c_expr
2618 {
2628 }
2630 /* This is the entry point used by the parser to build binary operators
2631 in the input. CODE, a tree_code, specifies the binary operator, and
2632 ARG1 and ARG2 are the operands. In addition to constructing the
2633 expression, we check for operands that were written with other binary
2634 operators in a way that is likely to confuse the user. */
2636 struct c_expr
2639 {
2651 /* Check for cases such as x+y<<z which users are likely
2652 to misinterpret. */
2659 /* Warn about comparisons against string literals, with the exception
2660 of testing for equality or inequality of a string literal with NULL. */
2662 {
2666 }
2677 }
2678 \f
2679 /* Return a tree for the difference of pointers OP0 and OP1.
2680 The resulting tree has type int. */
2682 static tree
2684 {
2692 {
2697 }
2699 /* If the conversion to ptrdiff_type does anything like widening or
2700 converting a partial to an integral mode, we get a convert_expression
2701 that is in the way to do any simplifications.
2702 (fold-const.c doesn't know that the extra bits won't be needed.
2703 split_tree uses STRIP_SIGN_NOPS, which leaves conversions to a
2704 different mode in place.)
2705 So first try to find a common term here 'by hand'; we want to cover
2706 at least the cases that occur in legal static initializers. */
2711 else
2717 else
2721 {
2724 }
2725 else
2729 {
2732 }
2733 else
2737 {
2740 }
2743 /* First do the subtraction as integers;
2744 then drop through to build the divide operator.
2745 Do not do default conversions on the minus operator
2746 in case restype is a short type. */
2750 /* This generates an error if op1 is pointer to incomplete type. */
2754 /* This generates an error if op0 is pointer to incomplete type. */
2757 /* Divide by the size, in easiest possible way. */
2759 }
2760 \f
2761 /* Construct and perhaps optimize a tree representation
2762 for a unary operation. CODE, a tree_code, specifies the operation
2763 and XARG is the operand.
2764 For any CODE other than ADDR_EXPR, FLAG nonzero suppresses
2765 the default promotions (such as from short to int).
2766 For ADDR_EXPR, the default promotions are not applied; FLAG nonzero
2767 allows non-lvalues; this is only used to handle conversion of non-lvalue
2768 arrays to pointers in C99. */
2770 tree
2772 {
2773 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
2777 tree val;
2788 {
2791 }
2794 {
2796 /* This is used for unary plus, because a CONVERT_EXPR
2797 is enough to prevent anybody from looking inside for
2798 associativity, but won't generate any code. */
2802 {
2805 }
2815 {
2818 }
2825 {
2828 }
2830 {
2836 }
2837 else
2838 {
2841 }
2846 {
2849 }
2855 /* Conjugating a real value is a no-op, but allow it anyway. */
2858 {
2861 }
2870 {
2873 }
2882 else
2890 else
2898 /* Increment or decrement the real part of the value,
2899 and don't change the imaginary part. */
2901 {
2913 }
2915 /* Report invalid types. */
2919 {
2922 else
2926 }
2928 {
2929 tree inc;
2935 /* Compute the increment. */
2938 {
2939 /* If pointer target is an undefined struct,
2940 we just cannot know how to do the arithmetic. */
2942 {
2945 else
2947 }
2951 {
2954 else
2956 }
2959 }
2960 else
2965 /* Complain about anything else that is not a true lvalue. */
2968 ? lv_increment
2972 /* Report a read-only lvalue. */
2974 {
2980 }
2984 else
2991 }
2994 /* Note that this operation never does default_conversion. */
2996 /* Let &* cancel out to simplify resulting code. */
2998 {
2999 /* Don't let this be an lvalue. */
3003 }
3005 /* For &x[y], return x+y */
3007 {
3016 }
3018 /* Anything not already handled and not a true memory reference
3019 or a non-lvalue array is an error. */
3024 /* Ordinary case; arg is a COMPONENT_REF or a decl. */
3027 /* If the lvalue is const or volatile, merge that into the type
3028 to which the address will point. Note that you can't get a
3029 restricted pointer by taking the address of something, so we
3030 only have to deal with `const' and `volatile' here. */
3045 /* ??? Cope with user tricks that amount to offsetof. Delete this
3046 when we have proper support for integer constant expressions. */
3050 {
3055 }
3063 }
3069 }
3071 /* Return nonzero if REF is an lvalue valid for this language.
3072 Lvalues can be assigned, unless their type has TYPE_READONLY.
3073 Lvalues can have their address taken, unless they have C_DECL_REGISTER. */
3075 static int
3077 {
3081 {
3105 }
3106 }
3107 \f
3108 /* Give an error for storing in something that is 'const'. */
3110 static void
3112 {
3115 /* Using this macro rather than (for example) arrays of messages
3116 ensures that all the format strings are checked at compile
3117 time. */
3118 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
3119 : (use == lv_increment ? (I) \
3120 : (use == lv_decrement ? (D) : (AS))))
3122 {
3125 else
3131 }
3137 arg);
3138 else
3143 }
3146 /* Return nonzero if REF is an lvalue valid for this language;
3147 otherwise, print an error message and return zero. USE says
3148 how the lvalue is being used and so selects the error message. */
3150 static int
3152 {
3159 }
3160 \f
3161 /* Mark EXP saying that we need to be able to take the
3162 address of it; it should not be allocated in a register.
3163 Returns true if successful. */
3165 bool
3167 {
3172 {
3175 {
3176 error
3179 }
3181 /* ... fall through ... */
3201 {
3203 {
3204 error
3207 }
3209 }
3211 {
3214 else
3217 }
3219 /* drops in */
3222 /* drops out */
3225 }
3226 }
3227 \f
3228 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
3230 tree
3232 {
3233 tree type1;
3234 tree type2;
3240 /* Promote both alternatives. */
3257 /* C90 does not permit non-lvalue arrays in conditional expressions.
3258 In C99 they will be pointers by now. */
3260 {
3263 }
3265 /* Quickly detect the usual case where op1 and op2 have the same type
3266 after promotion. */
3268 {
3271 else
3273 }
3278 {
3281 /* If -Wsign-compare, warn here if type1 and type2 have
3282 different signedness. We'll promote the signed to unsigned
3283 and later code won't know it used to be different.
3284 Do this check on the original types, so that explicit casts
3285 will be considered, but default promotions won't. */
3287 {
3292 {
3295 /* Do not warn if the result type is signed, since the
3296 signed type will only be chosen if it can represent
3297 all the values of the unsigned type. */
3300 /* Do not warn if the signed quantity is an unsuffixed
3301 integer literal (or some static constant expression
3302 involving such literals) and it is non-negative. */
3305 || (unsigned_op1
3308 else
3310 }
3311 }
3312 }
3314 {
3318 }
3320 {
3328 {
3334 }
3336 {
3342 }
3343 else
3344 {
3347 }
3348 }
3350 {
3353 else
3354 {
3356 }
3358 }
3360 {
3363 else
3364 {
3366 }
3368 }
3371 {
3374 else
3375 {
3378 }
3379 }
3381 /* Merge const and volatile flags of the incoming types. */
3382 result_type
3393 }
3394 \f
3395 /* Return a compound expression that performs two expressions and
3396 returns the value of the second of them. */
3398 tree
3400 {
3402 {
3403 /* The left-hand operand of a comma expression is like an expression
3404 statement: with -Wextra or -Wunused, we should warn if it doesn't have
3405 any side-effects, unless it was explicitly cast to (void). */
3407 {
3417 else
3420 }
3421 }
3423 /* With -Wunused, we should also warn if the left-hand operand does have
3424 side-effects, but computes a value which is not used. For example, in
3425 `foo() + bar(), baz()' the result of the `+' operator is not used,
3426 so we should issue a warning. */
3434 }
3436 /* Build an expression representing a cast to type TYPE of expression EXPR. */
3438 tree
3440 {
3446 /* The ObjC front-end uses TYPE_MAIN_VARIANT to tie together types differing
3447 only in <protocol> qualifications. But when constructing cast expressions,
3448 the protocols do matter and must be kept around. */
3455 {
3458 }
3461 {
3464 }
3467 {
3469 {
3473 }
3474 }
3476 {
3477 tree field;
3485 {
3486 tree t;
3496 }
3499 }
3500 else
3501 {
3509 /* Optionally warn about potentially worrisome casts. */
3514 {
3520 /* Check that the qualifiers on IN_TYPE are a superset of
3521 the qualifiers of IN_OTYPE. The outermost level of
3522 POINTER_TYPE nodes is uninteresting and we stop as soon
3523 as we hit a non-POINTER_TYPE node on either type. */
3524 do
3525 {
3529 /* GNU C allows cv-qualified function types. 'const'
3530 means the function is very pure, 'volatile' means it
3531 can't return. We need to warn when such qualifiers
3532 are added, not when they're taken away. */
3536 else
3538 }
3546 /* There are qualifiers present in IN_OTYPE that are not
3547 present in IN_TYPE. */
3549 }
3551 /* Warn about possible alignment problems. */
3557 /* Don't warn about opaque types, where the actual alignment
3558 restriction is unknown. */
3569 /* Unlike conversion of integers to pointers, where the
3570 warning is disabled for converting constants because
3571 of cases such as SIG_*, warn about converting constant
3572 pointers to integers. In some cases it may cause unwanted
3573 sign extension, and a warning is appropriate. */
3585 /* Don't warn about converting any constant. */
3593 /* If pedantic, warn for conversions between function and object
3594 pointer types, except for converting a null pointer constant
3595 to function pointer type. */
3614 /* Ignore any integer overflow caused by the cast. */
3616 {
3618 {
3620 {
3621 /* Avoid clobbering a shared constant. */
3624 }
3625 }
3627 /* Reset VALUE's overflow flags, ensuring constant sharing. */
3631 }
3632 }
3634 /* Don't let a cast be an lvalue. */
3639 }
3641 /* Interpret a cast of expression EXPR to type TYPE. */
3642 tree
3644 {
3645 tree type;
3648 /* This avoids warnings about unprototyped casts on
3649 integers. E.g. "#define SIG_DFL (void(*)())0". */
3656 }
3657 \f
3658 /* Build an assignment expression of lvalue LHS from value RHS.
3659 MODIFYCODE is the code for a binary operator that we use
3660 to combine the old value of LHS with RHS to get the new value.
3661 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment. */
3663 tree
3665 {
3666 tree result;
3667 tree newrhs;
3671 /* Types that aren't fully specified cannot be used in assignments. */
3674 /* Avoid duplicate error messages from operands that had errors. */
3685 /* If a binary op has been requested, combine the old LHS value with the RHS
3686 producing the value we should actually store into the LHS. */
3689 {
3692 }
3694 /* Give an error for storing in something that is 'const'. */
3700 {
3703 }
3705 /* If storing into a structure or union member,
3706 it has probably been given type `int'.
3707 Compute the type that would go with
3708 the actual amount of storage the member occupies. */
3717 /* If storing in a field that is in actuality a short or narrower than one,
3718 we must store in the field in its actual type. */
3721 {
3724 }
3726 /* Convert new value to destination type. */
3733 /* Emit ObjC write barrier, if necessary. */
3735 {
3739 }
3741 /* Scan operands. */
3746 /* If we got the LHS in a different type for storing in,
3747 convert the result back to the nominal type of LHS
3748 so that the value we return always has the same type
3749 as the LHS argument. */
3755 }
3756 \f
3757 /* Convert value RHS to type TYPE as preparation for an assignment
3758 to an lvalue of type TYPE.
3759 The real work of conversion is done by `convert'.
3760 The purpose of this function is to generate error messages
3761 for assignments that are not allowed in C.
3762 ERRTYPE says whether it is argument passing, assignment,
3763 initialization or return.
3765 FUNCTION is a tree for the function being called.
3766 PARMNUM is the number of the argument, for printing in error messages. */
3768 static tree
3771 {
3773 tree rhstype;
3779 {
3780 tree selector;
3781 /* Change pointer to function to the function itself for
3782 diagnostics. */
3787 /* Handle an ObjC selector specially for diagnostics. */
3791 {
3794 }
3795 }
3797 /* This macro is used to emit diagnostics to ensure that all format
3798 strings are complete sentences, visible to gettext and checked at
3799 compile time. */
3800 #define WARN_FOR_ASSIGNMENT(AR, AS, IN, RE) \
3801 do { \
3802 switch (errtype) \
3803 { \
3804 case ic_argpass: \
3805 pedwarn (AR, parmnum, rname); \
3806 break; \
3807 case ic_argpass_nonproto: \
3808 warning (0, AR, parmnum, rname); \
3809 break; \
3810 case ic_assign: \
3811 pedwarn (AS); \
3812 break; \
3813 case ic_init: \
3814 pedwarn (IN); \
3815 break; \
3816 case ic_return: \
3817 pedwarn (RE); \
3818 break; \
3819 default: \
3820 gcc_unreachable (); \
3821 } \
3822 } while (0)
3837 {
3841 {
3857 }
3860 }
3866 {
3867 /* Except for passing an argument to an unprototyped function,
3868 this is a constraint violation. When passing an argument to
3869 an unprototyped function, it is compile-time undefined;
3870 making it a constraint in that case was rejected in
3871 DR#252. */
3874 }
3875 /* A type converts to a reference to it.
3876 This code doesn't fully support references, it's just for the
3877 special case of va_start and va_copy. */
3880 {
3882 {
3885 }
3890 /* We already know that these two types are compatible, but they
3891 may not be exactly identical. In fact, `TREE_TYPE (type)' is
3892 likely to be __builtin_va_list and `TREE_TYPE (rhs)' is
3893 likely to be va_list, a typedef to __builtin_va_list, which
3894 is different enough that it will cause problems later. */
3900 }
3901 /* Some types can interconvert without explicit casts. */
3905 /* Arithmetic types all interconvert, and enum is treated like int. */
3914 /* Aggregates in different TUs might need conversion. */
3920 /* Conversion to a transparent union from its member types.
3921 This applies only to function arguments. */
3924 {
3928 {
3939 {
3943 /* Any non-function converts to a [const][volatile] void *
3944 and vice versa; otherwise, targets must be the same.
3945 Meanwhile, the lhs target must have all the qualifiers of
3946 the rhs. */
3949 {
3950 /* If this type won't generate any warnings, use it. */
3960 /* Keep looking for a better type, but remember this one. */
3963 }
3964 }
3966 /* Can convert integer zero to any pointer type. */
3968 {
3971 }
3972 }
3975 {
3977 {
3978 /* We have only a marginally acceptable member type;
3979 it needs a warning. */
3983 /* Const and volatile mean something different for function
3984 types, so the usual warnings are not appropriate. */
3987 {
3988 /* Because const and volatile on functions are
3989 restrictions that say the function will not do
3990 certain things, it is okay to use a const or volatile
3991 function where an ordinary one is wanted, but not
3992 vice-versa. */
3995 "makes qualified function "
3998 "function pointer from "
4001 "function pointer from "
4005 }
4017 }
4023 }
4024 }
4026 /* Conversions among pointers */
4029 {
4041 /* Opaque pointers are treated like void pointers. */
4047 /* C++ does not allow the implicit conversion void* -> T*. However,
4048 for the purpose of reducing the number of false positives, we
4049 tolerate the special case of
4051 int *p = NULL;
4053 where NULL is typically defined in C to be '(void *) 0'. */
4058 /* Check if the right-hand side has a format attribute but the
4059 left-hand side doesn't. */
4062 {
4064 {
4068 "argument %d of %qE might be "
4074 "assignment left-hand side might be "
4079 "initialization left-hand side might be "
4084 "return type might be "
4089 }
4090 }
4092 /* Any non-function converts to a [const][volatile] void *
4093 and vice versa; otherwise, targets must be the same.
4094 Meanwhile, the lhs target must have all the qualifiers of the rhs. */
4097 || is_opaque_pointer
4100 {
4103 ||
4108 "%qE between function pointer "
4116 /* Const and volatile mean something different for function types,
4117 so the usual warnings are not appropriate. */
4120 {
4122 {
4123 /* Types differing only by the presence of the 'volatile'
4124 qualifier are acceptable if the 'volatile' has been added
4125 in by the Objective-C EH machinery. */
4135 }
4136 /* If this is not a case of ignoring a mismatch in signedness,
4137 no warning. */
4140 ;
4141 /* If there is a mismatch, do warn. */
4151 }
4154 {
4155 /* Because const and volatile on functions are restrictions
4156 that say the function will not do certain things,
4157 it is okay to use a const or volatile function
4158 where an ordinary one is wanted, but not vice-versa. */
4161 "qualified function pointer "
4169 }
4170 }
4171 else
4172 /* Avoid warning about the volatile ObjC EH puts on decls. */
4182 }
4184 {
4185 /* ??? This should not be an error when inlining calls to
4186 unprototyped functions. */
4189 }
4191 {
4192 /* An explicit constant 0 can convert to a pointer,
4193 or one that results from arithmetic, even including
4194 a cast to integer type. */
4206 }
4208 {
4218 }
4223 {
4226 /* ??? This should not be an error when inlining calls to
4227 unprototyped functions. */
4241 }
4244 }
4246 /* Convert VALUE for assignment into inlined parameter PARM. ARGNUM
4247 is used for error and warning reporting and indicates which argument
4248 is being processed. */
4250 tree
4252 {
4255 /* If FN was prototyped at the call site, the value has been converted
4256 already in convert_arguments.
4257 However, we might see a prototype now that was not in place when
4258 the function call was seen, so check that the VALUE actually matches
4259 PARM before taking an early exit. */
4275 }
4276 \f
4277 /* If VALUE is a compound expr all of whose expressions are constant, then
4278 return its value. Otherwise, return error_mark_node.
4280 This is for handling COMPOUND_EXPRs as initializer elements
4281 which is allowed with a warning when -pedantic is specified. */
4283 static tree
4285 {
4287 {
4292 endtype);
4293 }
4296 else
4298 }
4299 \f
4300 /* Perform appropriate conversions on the initial value of a variable,
4301 store it in the declaration DECL,
4302 and print any error messages that are appropriate.
4303 If the init is invalid, store an ERROR_MARK. */
4305 void
4307 {
4310 /* If variable's type was invalidly declared, just ignore it. */
4316 /* Digest the specified initializer into an expression. */
4320 /* Store the expression if valid; else report error. */
4329 /* ANSI wants warnings about out-of-range constant initializers. */
4334 /* Check if we need to set array size from compound literal size. */
4338 {
4345 {
4349 {
4350 /* For int foo[] = (int [3]){1}; we need to set array size
4351 now since later on array initializer will be just the
4352 brace enclosed list of the compound literal. */
4358 }
4359 }
4360 }
4361 }
4362 \f
4363 /* Methods for storing and printing names for error messages. */
4365 /* Implement a spelling stack that allows components of a name to be pushed
4366 and popped. Each element on the stack is this structure. */
4368 struct spelling
4369 {
4371 union
4372 {
4376 };
4378 #define SPELLING_STRING 1
4379 #define SPELLING_MEMBER 2
4380 #define SPELLING_BOUNDS 3
4386 /* Macros to save and restore the spelling stack around push_... functions.
4387 Alternative to SAVE_SPELLING_STACK. */
4389 #define SPELLING_DEPTH() (spelling - spelling_base)
4390 #define RESTORE_SPELLING_DEPTH(DEPTH) (spelling = spelling_base + (DEPTH))
4392 /* Push an element on the spelling stack with type KIND and assign VALUE
4393 to MEMBER. */
4395 #define PUSH_SPELLING(KIND, VALUE, MEMBER) \
4396 { \
4397 int depth = SPELLING_DEPTH (); \
4398 \
4399 if (depth >= spelling_size) \
4400 { \
4401 spelling_size += 10; \
4402 spelling_base = XRESIZEVEC (struct spelling, spelling_base, \
4403 spelling_size); \
4404 RESTORE_SPELLING_DEPTH (depth); \
4405 } \
4406 \
4407 spelling->kind = (KIND); \
4408 spelling->MEMBER = (VALUE); \
4409 spelling++; \
4410 }
4412 /* Push STRING on the stack. Printed literally. */
4414 static void
4416 {
4418 }
4420 /* Push a member name on the stack. Printed as '.' STRING. */
4422 static void
4424 {
4428 }
4430 /* Push an array bounds on the stack. Printed as [BOUNDS]. */
4432 static void
4434 {
4436 }
4438 /* Compute the maximum size in bytes of the printed spelling. */
4440 static int
4442 {
4447 {
4450 else
4452 }
4455 }
4457 /* Print the spelling to BUFFER and return it. */
4461 {
4467 {
4470 }
4471 else
4472 {
4477 ;
4478 }
4481 }
4483 /* Issue an error message for a bad initializer component.
4484 MSGID identifies the message.
4485 The component name is taken from the spelling stack. */
4487 void
4489 {
4496 }
4498 /* Issue a pedantic warning for a bad initializer component.
4499 MSGID identifies the message.
4500 The component name is taken from the spelling stack. */
4502 void
4504 {
4511 }
4513 /* Issue a warning for a bad initializer component.
4514 MSGID identifies the message.
4515 The component name is taken from the spelling stack. */
4517 static void
4519 {
4526 }
4527 \f
4528 /* If TYPE is an array type and EXPR is a parenthesized string
4529 constant, warn if pedantic that EXPR is being used to initialize an
4530 object of type TYPE. */
4532 void
4534 {
4540 }
4542 /* Digest the parser output INIT as an initializer for type TYPE.
4543 Return a C expression of type TYPE to represent the initial value.
4545 If INIT is a string constant, STRICT_STRING is true if it is
4546 unparenthesized or we should not warn here for it being parenthesized.
4547 For other types of INIT, STRICT_STRING is not used.
4549 REQUIRE_CONSTANT requests an error if non-constant initializers or
4550 elements are seen. */
4552 static tree
4554 {
4559 || !init
4568 /* Initialization of an array of chars from a string constant
4569 optionally enclosed in braces. */
4573 {
4575 /* Note that an array could be both an array of character type
4576 and an array of wchar_t if wchar_t is signed char or unsigned
4577 char. */
4583 {
4590 char_string
4599 {
4602 }
4604 {
4607 }
4613 /* Subtract 1 (or sizeof (wchar_t))
4614 because it's ok to ignore the terminating null char
4615 that is counted in the length of the constant. */
4626 }
4628 {
4632 }
4633 }
4635 /* Build a VECTOR_CST from a *constant* vector constructor. If the
4636 vector constructor is not constant (e.g. {1,2,3,foo()}) then punt
4637 below and handle as a constructor. */
4642 {
4649 {
4651 tree value;
4654 /* Iterate through elements and check if all constructor
4655 elements are *_CSTs. */
4658 {
4661 }
4666 }
4667 }
4669 /* Any type can be initialized
4670 from an expression of the same type, optionally with braces. */
4683 {
4685 {
4687 {
4691 else
4692 {
4695 }
4696 }
4697 }
4700 /* Although the types are compatible, we may require a
4701 conversion. */
4707 {
4708 /* As an extension, allow initializing objects with static storage
4709 duration with compound literals (which are then treated just as
4710 the brace enclosed list they contain). Also allow this for
4711 vectors, as we can only assign them with compound literals. */
4714 }
4718 {
4721 }
4726 /* Compound expressions can only occur here if -pedantic or
4727 -pedantic-errors is specified. In the later case, we always want
4728 an error. In the former case, we simply want a warning. */
4731 {
4732 inside_init
4737 else
4741 }
4745 {
4748 }
4750 /* Added to enable additional -Wmissing-format-attribute warnings. */
4755 }
4757 /* Handle scalar types, including conversions. */
4762 {
4767 inside_init
4771 /* Check to see if we have already given an error message. */
4773 ;
4775 {
4778 }
4782 {
4785 }
4788 }
4790 /* Come here only for records and arrays. */
4793 {
4796 }
4800 }
4801 \f
4802 /* Handle initializers that use braces. */
4804 /* Type of object we are accumulating a constructor for.
4805 This type is always a RECORD_TYPE, UNION_TYPE or ARRAY_TYPE. */
4808 /* For a RECORD_TYPE or UNION_TYPE, this is the chain of fields
4809 left to fill. */
4812 /* For an ARRAY_TYPE, this is the specified index
4813 at which to store the next element we get. */
4816 /* For an ARRAY_TYPE, this is the maximum index. */
4819 /* For a RECORD_TYPE, this is the first field not yet written out. */
4822 /* For an ARRAY_TYPE, this is the index of the first element
4823 not yet written out. */
4826 /* In a RECORD_TYPE, the byte index of the next consecutive field.
4827 This is so we can generate gaps between fields, when appropriate. */
4830 /* If we are saving up the elements rather than allocating them,
4831 this is the list of elements so far (in reverse order,
4832 most recent first). */
4835 /* 1 if constructor should be incrementally stored into a constructor chain,
4836 0 if all the elements should be kept in AVL tree. */
4839 /* 1 if so far this constructor's elements are all compile-time constants. */
4842 /* 1 if so far this constructor's elements are all valid address constants. */
4845 /* 1 if this constructor is erroneous so far. */
4848 /* Structure for managing pending initializer elements, organized as an
4849 AVL tree. */
4851 struct init_node
4852 {
4856 tree purpose;
4857 tree value;
4858 };
4860 /* Tree of pending elements at this constructor level.
4861 These are elements encountered out of order
4862 which belong at places we haven't reached yet in actually
4863 writing the output.
4864 Will never hold tree nodes across GC runs. */
4867 /* The SPELLING_DEPTH of this constructor. */
4870 /* DECL node for which an initializer is being read.
4871 0 means we are reading a constructor expression
4872 such as (struct foo) {...}. */
4875 /* Nonzero if this is an initializer for a top-level decl. */
4878 /* Nonzero if there were any member designators in this initializer. */
4881 /* Nesting depth of designator list. */
4884 /* Nonzero if there were diagnosed errors in this designator list. */
4887 \f
4888 /* This stack has a level for each implicit or explicit level of
4889 structuring in the initializer, including the outermost one. It
4890 saves the values of most of the variables above. */
4894 struct constructor_stack
4895 {
4897 tree type;
4898 tree fields;
4899 tree index;
4900 tree max_index;
4901 tree unfilled_index;
4902 tree unfilled_fields;
4903 tree bit_index;
4908 /* If value nonzero, this value should replace the entire
4909 constructor at this level. */
4919 };
4923 /* This stack represents designators from some range designator up to
4924 the last designator in the list. */
4926 struct constructor_range_stack
4927 {
4930 tree range_start;
4931 tree index;
4932 tree range_end;
4933 tree fields;
4934 };
4938 /* This stack records separate initializers that are nested.
4939 Nested initializers can't happen in ANSI C, but GNU C allows them
4940 in cases like { ... (struct foo) { ... } ... }. */
4942 struct initializer_stack
4943 {
4945 tree decl;
4955 };
4958 \f
4959 /* Prepare to parse and output the initializer for variable DECL. */
4961 void
4963 {
4985 {
4987 require_constant_elements
4989 /* For a scalar, you can always use any value to initialize,
4990 even within braces. */
4996 }
4997 else
4998 {
5002 }
5015 }
5017 void
5019 {
5022 /* Free the whole constructor stack of this initializer. */
5024 {
5028 }
5032 /* Pop back to the data of the outer initializer (if any). */
5047 }
5048 \f
5049 /* Call here when we see the initializer is surrounded by braces.
5050 This is instead of a call to push_init_level;
5051 it is matched by a call to pop_init_level.
5053 TYPE is the type to initialize, for a constructor expression.
5054 For an initializer for a decl, TYPE is zero. */
5056 void
5058 {
5103 {
5105 /* Skip any nameless bit fields at the beginning. */
5112 }
5114 {
5116 {
5117 constructor_max_index
5120 /* Detect non-empty initializations of zero-length arrays. */
5125 /* constructor_max_index needs to be an INTEGER_CST. Attempts
5126 to initialize VLAs will cause a proper error; avoid tree
5127 checking errors as well by setting a safe value. */
5132 constructor_index
5135 }
5136 else
5137 {
5140 }
5143 }
5145 {
5146 /* Vectors are like simple fixed-size arrays. */
5147 constructor_max_index =
5151 }
5152 else
5153 {
5154 /* Handle the case of int x = {5}; */
5157 }
5158 }
5159 \f
5160 /* Push down into a subobject, for initialization.
5161 If this is for an explicit set of braces, IMPLICIT is 0.
5162 If it is because the next element belongs at a lower level,
5163 IMPLICIT is 1 (or 2 if the push is because of designator list). */
5165 void
5167 {
5171 /* If we've exhausted any levels that didn't have braces,
5172 pop them now. If implicit == 1, this will have been done in
5173 process_init_element; do not repeat it here because in the case
5174 of excess initializers for an empty aggregate this leads to an
5175 infinite cycle of popping a level and immediately recreating
5176 it. */
5178 {
5180 {
5186 && constructor_max_index
5188 constructor_index))
5190 else
5192 }
5193 }
5195 /* Unless this is an explicit brace, we need to preserve previous
5196 content if any. */
5198 {
5205 }
5239 {
5244 }
5246 /* Don't die if an entire brace-pair level is superfluous
5247 in the containing level. */
5249 ;
5252 {
5253 /* Don't die if there are extra init elts at the end. */
5256 else
5257 {
5260 constructor_depth++;
5261 }
5262 }
5264 {
5267 constructor_depth++;
5268 }
5271 {
5276 }
5279 {
5287 }
5290 {
5293 }
5297 {
5299 /* Skip any nameless bit fields at the beginning. */
5306 }
5308 {
5309 /* Vectors are like simple fixed-size arrays. */
5310 constructor_max_index =
5314 }
5316 {
5318 {
5319 constructor_max_index
5322 /* Detect non-empty initializations of zero-length arrays. */
5327 /* constructor_max_index needs to be an INTEGER_CST. Attempts
5328 to initialize VLAs will cause a proper error; avoid tree
5329 checking errors as well by setting a safe value. */
5334 constructor_index
5337 }
5338 else
5343 {
5344 /* We need to split the char/wchar array into individual
5345 characters, so that we don't have to special case it
5346 everywhere. */
5348 }
5349 }
5350 else
5351 {
5356 }
5357 }
5359 /* At the end of an implicit or explicit brace level,
5360 finish up that level of constructor. If a single expression
5361 with redundant braces initialized that level, return the
5362 c_expr structure for that expression. Otherwise, the original_code
5363 element is set to ERROR_MARK.
5364 If we were outputting the elements as they are read, return 0 as the value
5365 from inner levels (process_init_element ignores that),
5366 but return error_mark_node as the value from the outermost level
5367 (that's what we want to put in DECL_INITIAL).
5368 Otherwise, return a CONSTRUCTOR expression as the value. */
5370 struct c_expr
5372 {
5379 {
5380 /* When we come to an explicit close brace,
5381 pop any inner levels that didn't have explicit braces. */
5386 }
5388 /* Now output all pending elements. */
5394 /* Error for initializing a flexible array member, or a zero-length
5395 array member in an inappropriate context. */
5400 {
5401 /* Silently discard empty initializations. The parser will
5402 already have pedwarned for empty brackets. */
5405 else
5406 {
5414 /* We have already issued an error message for the existence
5415 of a flexible array member not at the end of the structure.
5416 Discard the initializer so that we do not die later. */
5419 }
5420 }
5422 /* Warn when some struct elements are implicitly initialized to zero. */
5424 && constructor_type
5427 {
5428 /* Do not warn for flexible array members or zero-length arrays. */
5434 /* Do not warn if this level of the initializer uses member
5435 designators; it is likely to be deliberate. */
5437 {
5441 }
5442 }
5444 /* Pad out the end of the structure. */
5446 /* If this closes a superfluous brace pair,
5447 just pass out the element between them. */
5450 ;
5455 {
5456 /* A nonincremental scalar initializer--just return
5457 the element, after verifying there is just one. */
5459 {
5463 }
5465 {
5468 }
5469 else
5471 }
5472 else
5473 {
5476 else
5477 {
5479 constructor_elements);
5484 }
5485 }
5512 }
5514 /* Common handling for both array range and field name designators.
5515 ARRAY argument is nonzero for array ranges. Returns zero for success. */
5517 static int
5519 {
5520 tree subtype;
5523 /* Don't die if an entire brace-pair level is superfluous
5524 in the containing level. */
5528 /* If there were errors in this designator list already, bail out
5529 silently. */
5534 {
5537 /* Designator list starts at the level of closest explicit
5538 braces. */
5543 }
5546 {
5558 }
5562 {
5565 }
5567 {
5570 }
5575 }
5577 /* If there are range designators in designator list, push a new designator
5578 to constructor_range_stack. RANGE_END is end of such stack range or
5579 NULL_TREE if there is no range designator at this level. */
5581 static void
5583 {
5597 }
5599 /* Within an array initializer, specify the next index to be initialized.
5600 FIRST is that index. If LAST is nonzero, then initialize a range
5601 of indices, running from FIRST through LAST. */
5603 void
5605 {
5613 {
5616 }
5629 else
5630 {
5634 {
5638 {
5641 }
5642 else
5643 {
5647 {
5650 }
5651 }
5652 }
5654 designator_depth++;
5658 }
5659 }
5661 /* Within a struct initializer, specify the next field to be initialized. */
5663 void
5665 {
5666 tree tail;
5675 {
5678 }
5682 {
5685 }
5689 else
5690 {
5692 designator_depth++;
5696 }
5697 }
5698 \f
5699 /* Add a new initializer to the tree of pending initializers. PURPOSE
5700 identifies the initializer, either array index or field in a structure.
5701 VALUE is the value of that index or field. */
5703 static void
5705 {
5712 {
5714 {
5720 else
5721 {
5728 }
5729 }
5730 }
5731 else
5732 {
5733 tree bitpos;
5737 {
5743 else
5744 {
5751 }
5752 }
5753 }
5766 {
5770 {
5774 {
5776 {
5777 /* L rotation. */
5790 {
5793 else
5795 }
5796 else
5798 }
5799 else
5800 {
5801 /* LR rotation. */
5823 {
5826 else
5828 }
5829 else
5831 }
5833 }
5834 else
5835 {
5836 /* p->balance == +1; growth of left side balances the node. */
5839 }
5840 }
5842 {
5844 /* Growth propagation from right side. */
5847 {
5849 {
5850 /* R rotation. */
5863 {
5866 else
5868 }
5869 else
5871 }
5873 {
5874 /* RL rotation */
5896 {
5899 else
5901 }
5902 else
5904 }
5906 }
5907 else
5908 {
5909 /* p->balance == -1; growth of right side balances the node. */
5912 }
5913 }
5917 }
5918 }
5920 /* Build AVL tree from a sorted chain. */
5922 static void
5924 {
5936 {
5938 /* Skip any nameless bit fields at the beginning. */
5944 }
5946 {
5948 constructor_unfilled_index
5951 else
5953 }
5955 }
5957 /* Build AVL tree from a string constant. */
5959 static void
5961 {
5972 else
5973 {
5977 }
5986 {
5988 {
5991 }
5992 else
5993 {
5997 {
6000 else
6005 }
6006 }
6009 {
6012 {
6014 {
6017 }
6018 }
6020 {
6023 }
6028 }
6032 }
6035 }
6037 /* Return value of FIELD in pending initializer or zero if the field was
6038 not initialized yet. */
6040 static tree
6042 {
6046 {
6053 {
6058 else
6060 }
6061 }
6063 {
6067 && (!constructor_unfilled_fields
6074 {
6079 else
6081 }
6082 }
6084 {
6089 }
6091 }
6093 /* "Output" the next constructor element.
6094 At top level, really output it to assembler code now.
6095 Otherwise, collect it in a list from which we will make a CONSTRUCTOR.
6096 TYPE is the data type that the containing data type wants here.
6097 FIELD is the field (a FIELD_DECL) or the index that this element fills.
6098 If VALUE is a string constant, STRICT_STRING is true if it is
6099 unparenthesized or we should not warn here for it being parenthesized.
6100 For other types of VALUE, STRICT_STRING is not used.
6102 PENDING if non-nil means output pending elements that belong
6103 right after this element. (PENDING is normally 1;
6104 it is 0 while outputting pending elements, to avoid recursion.) */
6106 static void
6109 {
6113 {
6116 }
6129 {
6130 /* As an extension, allow initializing objects with static storage
6131 duration with compound literals (which are then treated just as
6132 the brace enclosed list they contain). */
6135 }
6149 {
6151 {
6154 }
6157 }
6159 /* If this field is empty (and not at the end of structure),
6160 don't do anything other than checking the initializer. */
6171 {
6174 }
6176 /* If this element doesn't come next in sequence,
6177 put it on constructor_pending_elts. */
6179 && (!constructor_incremental
6181 {
6188 }
6190 && (!constructor_incremental
6192 {
6193 /* We do this for records but not for unions. In a union,
6194 no matter which field is specified, it can be initialized
6195 right away since it starts at the beginning of the union. */
6197 {
6200 else
6201 {
6209 }
6210 }
6214 }
6217 {
6224 /* We can have just one union field set. */
6226 }
6228 /* Otherwise, output this element either to
6229 constructor_elements or to the assembler file. */
6235 /* Advance the variable that indicates sequential elements output. */
6237 constructor_unfilled_index
6239 bitsize_one_node);
6241 {
6242 constructor_unfilled_fields
6245 /* Skip any nameless bit fields. */
6249 constructor_unfilled_fields =
6251 }
6255 /* Now output any pending elements which have become next. */
6258 }
6260 /* Output any pending elements which have become next.
6261 As we output elements, constructor_unfilled_{fields,index}
6262 advances, which may cause other elements to become next;
6263 if so, they too are output.
6265 If ALL is 0, we return when there are
6266 no more pending elements to output now.
6268 If ALL is 1, we output space as necessary so that
6269 we can output all the pending elements. */
6271 static void
6273 {
6275 tree next;
6277 retry:
6279 /* Look through the whole pending tree.
6280 If we find an element that should be output now,
6281 output it. Otherwise, set NEXT to the element
6282 that comes first among those still pending. */
6286 {
6288 {
6290 constructor_unfilled_index))
6296 {
6297 /* Advance to the next smaller node. */
6300 else
6301 {
6302 /* We have reached the smallest node bigger than the
6303 current unfilled index. Fill the space first. */
6306 }
6307 }
6308 else
6309 {
6310 /* Advance to the next bigger node. */
6313 else
6314 {
6315 /* We have reached the biggest node in a subtree. Find
6316 the parent of it, which is the next bigger node. */
6322 {
6325 }
6326 }
6327 }
6328 }
6331 {
6334 /* If the current record is complete we are done. */
6340 /* We can't compare fields here because there might be empty
6341 fields in between. */
6343 {
6347 }
6349 {
6350 /* Advance to the next smaller node. */
6353 else
6354 {
6355 /* We have reached the smallest node bigger than the
6356 current unfilled field. Fill the space first. */
6359 }
6360 }
6361 else
6362 {
6363 /* Advance to the next bigger node. */
6366 else
6367 {
6368 /* We have reached the biggest node in a subtree. Find
6369 the parent of it, which is the next bigger node. */
6376 {
6379 }
6380 }
6381 }
6382 }
6383 }
6385 /* Ordinarily return, but not if we want to output all
6386 and there are elements left. */
6390 /* If it's not incremental, just skip over the gap, so that after
6391 jumping to retry we will output the next successive element. */
6398 /* ELT now points to the node in the pending tree with the next
6399 initializer to output. */
6401 }
6402 \f
6403 /* Add one non-braced element to the current constructor level.
6404 This adjusts the current position within the constructor's type.
6405 This may also start or terminate implicit levels
6406 to handle a partly-braced initializer.
6408 Once this has found the correct level for the new element,
6409 it calls output_init_element. */
6411 void
6413 {
6421 /* Handle superfluous braces around string cst as in
6422 char x[] = {"foo"}; */
6424 && constructor_type
6428 {
6433 }
6436 {
6439 }
6441 /* Ignore elements of a brace group if it is entirely superfluous
6442 and has already been diagnosed. */
6446 /* If we've exhausted any levels that didn't have braces,
6447 pop them now. */
6449 {
6457 constructor_index)))
6459 else
6461 }
6463 /* In the case of [LO ... HI] = VALUE, only evaluate VALUE once. */
6465 {
6466 /* If value is a compound literal and we'll be just using its
6467 content, don't put it into a SAVE_EXPR. */
6469 || !require_constant_value
6472 }
6475 {
6477 {
6478 tree fieldtype;
6482 {
6485 }
6492 /* Error for non-static initialization of a flexible array member. */
6494 && !require_constant_value
6497 {
6500 }
6502 /* Accept a string constant to initialize a subarray. */
6508 /* Otherwise, if we have come to a subaggregate,
6509 and we don't have an element of its type, push into it. */
6515 {
6518 }
6521 {
6526 }
6527 else
6528 /* Do the bookkeeping for an element that was
6529 directly output as a constructor. */
6530 {
6531 /* For a record, keep track of end position of last field. */
6533 constructor_bit_index
6538 /* If the current field was the first one not yet written out,
6539 it isn't now, so update. */
6541 {
6543 /* Skip any nameless bit fields. */
6547 constructor_unfilled_fields =
6549 }
6550 }
6553 /* Skip any nameless bit fields at the beginning. */
6558 }
6560 {
6561 tree fieldtype;
6565 {
6568 }
6575 /* Warn that traditional C rejects initialization of unions.
6576 We skip the warning if the value is zero. This is done
6577 under the assumption that the zero initializer in user
6578 code appears conditioned on e.g. __STDC__ to avoid
6579 "missing initializer" warnings and relies on default
6580 initialization to zero in the traditional C case.
6581 We also skip the warning if the initializer is designated,
6582 again on the assumption that this must be conditional on
6583 __STDC__ anyway (and we've already complained about the
6584 member-designator already). */
6591 /* Accept a string constant to initialize a subarray. */
6597 /* Otherwise, if we have come to a subaggregate,
6598 and we don't have an element of its type, push into it. */
6604 {
6607 }
6610 {
6615 }
6616 else
6617 /* Do the bookkeeping for an element that was
6618 directly output as a constructor. */
6619 {
6622 }
6625 }
6627 {
6631 /* Accept a string constant to initialize a subarray. */
6637 /* Otherwise, if we have come to a subaggregate,
6638 and we don't have an element of its type, push into it. */
6644 {
6647 }
6652 {
6655 }
6657 /* Now output the actual element. */
6659 {
6664 }
6666 constructor_index
6670 /* If we are doing the bookkeeping for an element that was
6671 directly output as a constructor, we must update
6672 constructor_unfilled_index. */
6674 }
6676 {
6679 /* Do a basic check of initializer size. Note that vectors
6680 always have a fixed size derived from their type. */
6682 {
6685 }
6687 /* Now output the actual element. */
6692 constructor_index
6696 /* If we are doing the bookkeeping for an element that was
6697 directly output as a constructor, we must update
6698 constructor_unfilled_index. */
6700 }
6702 /* Handle the sole element allowed in a braced initializer
6703 for a scalar variable. */
6706 {
6709 }
6710 else
6711 {
6716 }
6718 /* Handle range initializers either at this level or anywhere higher
6719 in the designator stack. */
6721 {
6728 {
6731 }
6735 {
6738 }
6745 {
6749 {
6752 }
6760 }
6765 }
6768 }
6771 }
6772 \f
6773 /* Build a complete asm-statement, whose components are a CV_QUALIFIER
6774 (guaranteed to be 'volatile' or null) and ARGS (represented using
6775 an ASM_EXPR node). */
6776 tree
6778 {
6782 }
6784 /* Build an asm-expr, whose components are a STRING, some OUTPUTS,
6785 some INPUTS, and some CLOBBERS. The latter three may be NULL.
6786 SIMPLE indicates whether there was anything at all after the
6787 string in the asm expression -- asm("blah") and asm("blah" : )
6788 are subtly different. We use a ASM_EXPR node to represent this. */
6789 tree
6792 {
6793 tree tail;
6794 tree args;
6807 /* Remove output conversions that change the type but not the mode. */
6809 {
6812 /* ??? Really, this should not be here. Users should be using a
6813 proper lvalue, dammit. But there's a long history of using casts
6814 in the output operands. In cases like longlong.h, this becomes a
6815 primitive form of typechecking -- if the cast can be removed, then
6816 the output operand had a type of the proper width; otherwise we'll
6817 get an error. Gross, but ... */
6836 {
6837 /* If the operand is going to end up in memory,
6838 mark it addressable. */
6841 }
6842 else
6846 }
6849 {
6850 tree input;
6857 {
6858 /* If the operand is going to end up in memory,
6859 mark it addressable. */
6861 {
6862 /* Strip the nops as we allow this case. FIXME, this really
6863 should be rejected or made deprecated. */
6867 }
6868 }
6869 else
6873 }
6877 /* asm statements without outputs, including simple ones, are treated
6878 as volatile. */
6883 }
6884 \f
6885 /* Generate a goto statement to LABEL. */
6887 tree
6889 {
6895 {
6898 }
6901 {
6904 }
6907 {
6908 /* No jump from outside this statement expression context, so
6909 record that there is a jump from within this context. */
6915 }
6918 {
6919 /* No jump from outside this context context of identifiers with
6920 variably modified type, so record that there is a jump from
6921 within this context. */
6927 }
6931 }
6933 /* Generate a computed goto statement to EXPR. */
6935 tree
6937 {
6942 }
6944 /* Generate a C `return' statement. RETVAL is the expression for what
6945 to return, or a null pointer for `return;' with no value. */
6947 tree
6949 {
6957 {
6961 {
6965 }
6966 }
6968 {
6974 }
6975 else
6976 {
6980 tree inner;
6988 /* Strip any conversions, additions, and subtractions, and see if
6989 we are returning the address of a local variable. Warn if so. */
6991 {
6993 {
7000 /* If the second operand of the MINUS_EXPR has a pointer
7001 type (or is converted from it), this may be valid, so
7002 don't give a warning. */
7003 {
7017 }
7035 }
7038 }
7041 }
7046 }
7047 \f
7049 /* The SWITCH_EXPR being built. */
7050 tree switch_expr;
7052 /* The original type of the testing expression, i.e. before the
7053 default conversion is applied. */
7054 tree orig_type;
7056 /* A splay-tree mapping the low element of a case range to the high
7057 element, or NULL_TREE if there is no high element. Used to
7058 determine whether or not a new case label duplicates an old case
7059 label. We need a tree, rather than simply a hash table, because
7060 of the GNU case range extension. */
7061 splay_tree cases;
7063 /* Number of nested statement expressions within this switch
7064 statement; if nonzero, case and default labels may not
7065 appear. */
7068 /* Scope of outermost declarations of identifiers with variably
7069 modified type within this switch statement; if nonzero, case and
7070 default labels may not appear. */
7073 /* The next node on the stack. */
7075 };
7077 /* A stack of the currently active switch statements. The innermost
7078 switch statement is on the top of the stack. There is no need to
7079 mark the stack for garbage collection because it is only active
7080 during the processing of the body of a function, and we never
7081 collect at that point. */
7085 /* Start a C switch statement, testing expression EXP. Return the new
7086 SWITCH_EXPR. */
7088 tree
7090 {
7095 {
7099 {
7101 {
7104 }
7106 }
7107 else
7108 {
7118 }
7119 }
7121 /* Add this new SWITCH_EXPR to the stack. */
7132 }
7134 /* Process a case label. */
7136 tree
7138 {
7143 {
7150 }
7152 {
7156 else
7159 }
7161 {
7165 else
7168 }
7171 else
7175 }
7177 /* Finish the switch statement. */
7179 void
7181 {
7183 location_t switch_location;
7187 /* We must not be within a statement expression nested in the switch
7188 at this point; we might, however, be within the scope of an
7189 identifier with variably modified type nested in the switch. */
7192 /* Emit warnings as needed. */
7195 else
7201 /* Pop the stack. */
7205 }
7206 \f
7207 /* Emit an if statement. IF_LOCUS is the location of the 'if'. COND,
7208 THEN_BLOCK and ELSE_BLOCK are expressions to be used; ELSE_BLOCK
7209 may be null. NESTED_IF is true if THEN_BLOCK contains another IF
7210 statement, and was not surrounded with parenthesis. */
7212 void
7215 {
7216 tree stmt;
7218 /* Diagnose an ambiguous else if if-then-else is nested inside if-then. */
7220 {
7223 /* We know from the grammar productions that there is an IF nested
7224 within THEN_BLOCK. Due to labels and c99 conditional declarations,
7225 it might not be exactly THEN_BLOCK, but should be the last
7226 non-container statement within. */
7229 {
7244 }
7245 found:
7251 }
7258 }
7260 /* Emit a general-purpose loop construct. START_LOCUS is the location of
7261 the beginning of the loop. COND is the loop condition. COND_IS_FIRST
7262 is false for DO loops. INCR is the FOR increment expression. BODY is
7263 the statement controlled by the loop. BLAB is the break label. CLAB is
7264 the continue label. Everything is allowed to be NULL. */
7266 void
7269 {
7272 /* If the condition is zero don't generate a loop construct. */
7274 {
7276 {
7280 }
7281 }
7282 else
7283 {
7286 /* If we have an exit condition, then we build an IF with gotos either
7287 out of the loop, or to the top of it. If there's no exit condition,
7288 then we just build a jump back to the top. */
7292 {
7293 /* Canonicalize the loop condition to the end. This means
7294 generating a branch to the loop condition. Reuse the
7295 continue label, if possible. */
7297 {
7299 {
7302 }
7303 else
7307 }
7313 else
7315 }
7318 }
7332 }
7334 tree
7336 {
7340 /* In switch statements break is sometimes stylistically used after
7341 a return statement. This can lead to spurious warnings about
7342 control reaching the end of a non-void function when it is
7343 inlined. Note that we are calling block_may_fallthru with
7344 language specific tree nodes; this works because
7345 block_may_fallthru returns true when given something it does not
7346 understand. */
7350 {
7353 }
7355 ;
7357 {
7361 else
7372 }
7378 }
7380 /* A helper routine for c_process_expr_stmt and c_finish_stmt_expr. */
7382 static void
7384 {
7386 ;
7388 {
7392 }
7393 else
7395 }
7397 /* Process an expression as if it were a complete statement. Emit
7398 diagnostics, but do not call ADD_STMT. */
7400 tree
7402 {
7414 /* If we're not processing a statement expression, warn about unused values.
7415 Warnings for statement expressions will be emitted later, once we figure
7416 out which is the result. */
7421 /* If the expression is not of a type to which we cannot assign a line
7422 number, wrap the thing in a no-op NOP_EXPR. */
7430 }
7432 /* Emit an expression as a statement. */
7434 tree
7436 {
7439 else
7441 }
7443 /* Do the opposite and emit a statement as an expression. To begin,
7444 create a new binding level and return it. */
7446 tree
7448 {
7449 tree ret;
7453 /* We must force a BLOCK for this level so that, if it is not expanded
7454 later, there is a way to turn off the entire subtree of blocks that
7455 are contained in it. */
7459 {
7462 }
7466 {
7468 }
7475 /* Mark the current statement list as belonging to a statement list. */
7479 }
7481 tree
7483 {
7490 {
7493 }
7494 /* It is no longer possible to jump to labels defined within this
7495 statement expression. */
7499 {
7501 }
7502 /* It is again possible to define labels with a goto just outside
7503 this statement expression. */
7507 {
7510 }
7513 else
7518 /* Locate the last statement in BODY. See c_end_compound_stmt
7519 about always returning a BIND_EXPR. */
7523 continue_searching:
7525 {
7526 tree_stmt_iterator i;
7528 /* This can happen with degenerate cases like ({ }). No value. */
7532 /* If we're supposed to generate side effects warnings, process
7533 all of the statements except the last. */
7535 {
7538 }
7539 else
7543 }
7545 /* If the end of the list is exception related, then the list was split
7546 by a call to push_cleanup. Continue searching. */
7549 {
7553 }
7555 /* In the case that the BIND_EXPR is not necessary, return the
7556 expression out from inside it. */
7560 {
7561 /* Do not warn if the return value of a statement expression is
7562 unused. */
7566 }
7568 /* Extract the type of said expression. */
7571 /* If we're not returning a value at all, then the BIND_EXPR that
7572 we already have is a fine expression to return. */
7576 /* Now that we've located the expression containing the value, it seems
7577 silly to make voidify_wrapper_expr repeat the process. Create a
7578 temporary of the appropriate type and stick it in a TARGET_EXPR. */
7581 /* Unwrap a no-op NOP_EXPR as added by c_finish_expr_stmt. This avoids
7582 tree_expr_nonnegative_p giving up immediately. */
7592 }
7594 /* Begin the scope of an identifier of variably modified type, scope
7595 number SCOPE. Jumping from outside this scope to inside it is not
7596 permitted. */
7598 void
7600 {
7606 /* At file_scope, we don't have to do any processing. */
7615 {
7617 }
7624 }
7626 /* End a scope which may contain identifiers of variably modified
7627 type, scope number SCOPE. */
7629 void
7631 {
7636 /* We may have a number of nested scopes of identifiers with
7637 variably modified type, all at this depth. Pop each in turn. */
7639 {
7642 /* It is no longer possible to jump to labels defined within this
7643 scope. */
7647 {
7649 }
7650 /* It is again possible to define labels with a goto just outside
7651 this scope. */
7655 {
7658 }
7661 else
7665 }
7666 }
7667 \f
7668 /* Begin and end compound statements. This is as simple as pushing
7669 and popping new statement lists from the tree. */
7671 tree
7673 {
7678 }
7680 tree
7682 {
7686 {
7690 }
7695 /* If this compound statement is nested immediately inside a statement
7696 expression, then force a BIND_EXPR to be created. Otherwise we'll
7697 do the wrong thing for ({ { 1; } }) or ({ 1; { } }). In particular,
7698 STATEMENT_LISTs merge, and thus we can lose track of what statement
7699 was really last. */
7703 {
7706 }
7709 }
7711 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
7712 when the current scope is exited. EH_ONLY is true when this is not
7713 meant to apply to normal control flow transfer. */
7715 void
7717 {
7729 }
7730 \f
7731 /* Build a binary-operation expression without default conversions.
7732 CODE is the kind of expression to build.
7733 This function differs from `build' in several ways:
7734 the data type of the result is computed and recorded in it,
7735 warnings are generated if arg data types are invalid,
7736 special handling for addition and subtraction of pointers is known,
7737 and some optimization is done (operations on narrow ints
7738 are done in the narrower type when that gives the same result).
7739 Constant folding is also done before the result is returned.
7741 Note that the operands will never have enumeral types, or function
7742 or array types, because either they will have the default conversions
7743 performed or they have both just been converted to some other type in which
7744 the arithmetic is to be done. */
7746 tree
7749 {
7755 /* Expression code to give to the expression when it is built.
7756 Normally this is CODE, which is what the caller asked for,
7757 but in some special cases we change it. */
7760 /* Data type in which the computation is to be performed.
7761 In the simplest cases this is the common type of the arguments. */
7764 /* Nonzero means operands have already been type-converted
7765 in whatever way is necessary.
7766 Zero means they need to be converted to RESULT_TYPE. */
7769 /* Nonzero means create the expression with this type, rather than
7770 RESULT_TYPE. */
7773 /* Nonzero means after finally constructing the expression
7774 convert it to this type. */
7777 /* Nonzero if this is an operation like MIN or MAX which can
7778 safely be computed in short if both args are promoted shorts.
7779 Also implies COMMON.
7780 -1 indicates a bitwise operation; this makes a difference
7781 in the exact conditions for when it is safe to do the operation
7782 in a narrower mode. */
7785 /* Nonzero if this is a comparison operation;
7786 if both args are promoted shorts, compare the original shorts.
7787 Also implies COMMON. */
7790 /* Nonzero if this is a right-shift operation, which can be computed on the
7791 original short and then promoted if the operand is a promoted short. */
7794 /* Nonzero means set RESULT_TYPE to the common type of the args. */
7797 /* True means types are compatible as far as ObjC is concerned. */
7801 {
7804 }
7805 else
7806 {
7809 }
7814 /* The expression codes of the data types of the arguments tell us
7815 whether the arguments are integers, floating, pointers, etc. */
7819 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
7823 /* If an error was already reported for one of the arguments,
7824 avoid reporting another error. */
7831 {
7834 }
7839 {
7841 /* Handle the pointer + int case. */
7846 else
7851 /* Subtraction of two similar pointers.
7852 We must subtract them as integers, then divide by object size. */
7856 /* Handle pointer minus int. Just like pointer plus int. */
7859 else
7878 {
7888 else
7889 /* Although it would be tempting to shorten always here, that
7890 loses on some targets, since the modulo instruction is
7891 undefined if the quotient can't be represented in the
7892 computation mode. We shorten only if unsigned or if
7893 dividing by something we know != -1. */
7898 }
7915 {
7916 /* Although it would be tempting to shorten always here, that loses
7917 on some targets, since the modulo instruction is undefined if the
7918 quotient can't be represented in the computation mode. We shorten
7919 only if unsigned or if dividing by something we know != -1. */
7924 }
7936 {
7937 /* Result of these operations is always an int,
7938 but that does not mean the operands should be
7939 converted to ints! */
7944 }
7947 /* Shift operations: result has same type as first operand;
7948 always convert second operand to int.
7949 Also set SHORT_SHIFT if shifting rightward. */
7953 {
7955 {
7958 else
7959 {
7965 }
7966 }
7968 /* Use the type of the value to be shifted. */
7970 /* Convert the shift-count to an integer, regardless of size
7971 of value being shifted. */
7974 /* Avoid converting op1 to result_type later. */
7976 }
7981 {
7983 {
7989 }
7991 /* Use the type of the value to be shifted. */
7993 /* Convert the shift-count to an integer, regardless of size
7994 of value being shifted. */
7997 /* Avoid converting op1 to result_type later. */
7999 }
8007 /* Result of comparison is always int,
8008 but don't convert the args to int! */
8016 {
8019 /* Anything compares with void *. void * compares with anything.
8020 Otherwise, the targets must be compatible
8021 and both must be object or both incomplete. */
8025 {
8026 /* op0 != orig_op0 detects the case of something
8027 whose value is 0 but which isn't a valid null ptr const. */
8032 }
8034 {
8039 }
8040 else
8041 /* Avoid warning about the volatile ObjC EH puts on decls. */
8047 }
8049 {
8055 }
8057 {
8063 }
8065 {
8068 }
8070 {
8073 }
8085 {
8087 {
8095 }
8096 else
8097 {
8100 }
8101 }
8103 {
8107 }
8109 {
8113 }
8115 {
8118 }
8120 {
8123 }
8128 }
8137 {
8140 }
8144 &&
8147 {
8151 {
8155 }
8157 /* For certain operations (which identify themselves by shorten != 0)
8158 if both args were extended from the same smaller type,
8159 do the arithmetic in that type and then extend.
8161 shorten !=0 and !=1 indicates a bitwise operation.
8162 For them, this optimization is safe only if
8163 both args are zero-extended or both are sign-extended.
8164 Otherwise, we might change the result.
8165 Eg, (short)-1 | (unsigned short)-1 is (int)-1
8166 but calculated in (unsigned short) it would be (unsigned short)-1. */
8169 {
8173 tree type;
8175 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
8176 excessive narrowing when we call get_narrower below. For
8177 example, suppose that OP0 is of unsigned int extended
8178 from signed char and that RESULT_TYPE is long long int.
8179 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
8180 like
8182 (long long int) (unsigned int) signed_char
8184 which get_narrower would narrow down to
8186 (unsigned int) signed char
8188 If we do not cast OP0 first, get_narrower would return
8189 signed_char, which is inconsistent with the case of the
8190 explicit cast. */
8197 /* UNS is 1 if the operation to be done is an unsigned one. */
8202 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
8203 but it *requires* conversion to FINAL_TYPE. */
8214 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
8216 /* For bitwise operations, signedness of nominal type
8217 does not matter. Consider only how operands were extended. */
8221 /* Note that in all three cases below we refrain from optimizing
8222 an unsigned operation on sign-extended args.
8223 That would not be valid. */
8225 /* Both args variable: if both extended in same way
8226 from same width, do it in that width.
8227 Do it unsigned if args were zero-extended. */
8234 result_type
8235 = c_common_signed_or_unsigned_type
8241 && (type
8250 && (type
8255 }
8257 /* Shifts can be shortened if shifting right. */
8260 {
8270 /* We can shorten only if the shift count is less than the
8271 number of bits in the smaller type size. */
8273 /* We cannot drop an unsigned shift after sign-extension. */
8275 {
8276 /* Do an unsigned shift if the operand was zero-extended. */
8277 result_type
8280 /* Convert value-to-be-shifted to that type. */
8284 }
8285 }
8287 /* Comparison operations are shortened too but differently.
8288 They identify themselves by setting short_compare = 1. */
8291 {
8292 /* Don't write &op0, etc., because that would prevent op0
8293 from being kept in a register.
8294 Instead, make copies of the our local variables and
8295 pass the copies by reference, then copy them back afterward. */
8298 tree val
8309 {
8321 /* Give warnings for comparisons between signed and unsigned
8322 quantities that may fail.
8324 Do the checking based on the original operand trees, so that
8325 casts will be considered, but default promotions won't be.
8327 Do not warn if the comparison is being done in a signed type,
8328 since the signed type will only be chosen if it can represent
8329 all the values of the unsigned type. */
8332 /* Do not warn if both operands are the same signedness. */
8335 else
8336 {
8342 else
8345 /* Do not warn if the signed quantity is an
8346 unsuffixed integer literal (or some static
8347 constant expression involving such literals or a
8348 conditional expression involving such literals)
8349 and it is non-negative. */
8352 /* Do not warn if the comparison is an equality operation,
8353 the unsigned quantity is an integral constant, and it
8354 would fit in the result if the result were signed. */
8357 && int_fits_type_p
8360 /* Do not warn if the unsigned quantity is an enumeration
8361 constant and its maximum value would fit in the result
8362 if the result were signed. */
8365 && int_fits_type_p
8369 else
8371 }
8373 /* Warn if two unsigned values are being compared in a size
8374 larger than their original size, and one (and only one) is the
8375 result of a `~' operator. This comparison will always fail.
8377 Also warn if one operand is a constant, and the constant
8378 does not have all bits set that are set in the ~ operand
8379 when it is extended. */
8383 {
8387 else
8392 {
8393 tree primop;
8398 {
8402 }
8403 else
8404 {
8408 }
8413 {
8417 }
8418 }
8425 }
8426 }
8427 }
8428 }
8430 /* At this point, RESULT_TYPE must be nonzero to avoid an error message.
8431 If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
8432 Then the expression will be built.
8433 It will be given type FINAL_TYPE if that is nonzero;
8434 otherwise, it will be given type RESULT_TYPE. */
8437 {
8440 }
8443 {
8449 /* This can happen if one operand has a vector type, and the other
8450 has a different type. */
8453 }
8458 {
8459 /* Treat expressions in initializers specially as they can't trap. */
8461 build_type,
8469 }
8470 }
8473 /* Convert EXPR to be a truth-value, validating its type for this
8474 purpose. */
8476 tree
8478 {
8480 {
8498 }
8500 /* ??? Should we also give an error for void and vectors rather than
8501 leaving those to give errors later? */
8503 }
8504 \f
8506 /* Convert EXPR to a contained DECL, updating *TC, *TI and *SE as
8507 required. */
8509 tree
8512 {
8514 {
8516 /* Executing a compound literal inside a function reinitializes
8517 it. */
8521 }
8522 else
8524 }
8525 \f
8526 /* Like c_begin_compound_stmt, except force the retention of the BLOCK. */
8528 tree
8530 {
8531 tree block;
8537 }
8539 tree
8541 {
8542 tree stmt;
8552 }
8554 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
8555 Remove any elements from the list that are invalid. */
8557 tree
8559 {
8570 {
8576 {
8594 {
8597 }
8599 {
8604 {
8626 }
8628 {
8632 }
8633 }
8644 {
8647 }
8650 check_dup_generic:
8653 {
8656 }
8660 {
8663 }
8664 else
8674 {
8677 }
8680 {
8683 }
8684 else
8694 {
8697 }
8700 {
8703 }
8704 else
8719 }
8722 {
8726 {
8730 }
8733 {
8739 {
8750 }
8752 {
8756 }
8757 }
8758 }
8762 else
8764 }
8768 }