| blob | 8d6ed0be9fddca702900bb0ae3b7f31ef28df5ef |
1 /* Build expressions with type checking for C compiler.
2 Copyright (C) 1987, 1988, 1991, 1992, 1993, 1994, 1995, 1996, 1997,
3 1998, 1999, 2000, 2001, 2002, 2003 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
10 version.
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
15 for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
20 02111-1307, USA. */
23 /* This file is part of the C front end.
24 It contains routines to build C expressions given their operands,
25 including computing the types of the result, C-specific error checks,
26 and some optimization.
28 There are also routines to build RETURN_STMT nodes and CASE_STMT nodes,
29 and to process initializations in declarations (since they work
30 like a strange sort of assignment). */
48 /* Nonzero if we've already printed a "missing braces around initializer"
49 message within this initializer. */
52 /* 1 if we explained undeclared var errors. */
88 \f
89 /* Do `exp = require_complete_type (exp);' to make sure exp
90 does not have an incomplete type. (That includes void types.) */
92 tree
94 tree value;
95 {
101 /* First, detect a valid value with a complete type. */
107 }
109 /* Print an error message for invalid use of an incomplete type.
110 VALUE is the expression that was used (or 0 if that isn't known)
111 and TYPE is the type that was invalid. */
113 void
115 tree value;
116 tree type;
117 {
120 /* Avoid duplicate error message. */
128 else
129 {
130 retry:
131 /* We must print an error message. Be clever about what it says. */
134 {
153 {
155 {
158 }
161 }
167 }
172 else
173 /* If this type has a typedef-name, the TYPE_NAME is a TYPE_DECL. */
176 }
177 }
179 /* Given a type, apply default promotions wrt unnamed function
180 arguments and return the new type. */
182 tree
184 tree type;
185 {
190 {
191 /* Preserve unsignedness if not really getting any wider. */
196 }
199 }
201 /* Return a variant of TYPE which has all the type qualifiers of LIKE
202 as well as those of TYPE. */
204 static tree
207 {
210 }
211 \f
212 /* Return the common type of two types.
213 We assume that comptypes has already been done and returned 1;
214 if that isn't so, this may crash. In particular, we assume that qualifiers
215 match.
217 This is the type for the result of most arithmetic operations
218 if the operands have the given two types. */
220 tree
223 {
226 tree attributes;
228 /* Save time if the two types are the same. */
232 /* If one type is nonsense, use the other. */
238 /* Merge the attributes. */
241 /* Treat an enum type as the unsigned integer type of the same width. */
251 /* If one type is complex, form the common type of the non-complex
252 components, then make that complex. Use T1 or T2 if it is the
253 required type. */
255 {
264 else
266 attributes);
267 }
270 {
273 /* If only one is real, use it as the result. */
281 /* Both real or both integers; use the one with greater precision. */
288 /* Same precision. Prefer longs to ints even when same size. */
293 attributes);
297 {
298 /* But preserve unsignedness from the other type,
299 since long cannot hold all the values of an unsigned int. */
302 else
305 }
307 /* Likewise, prefer long double to double even if same size. */
311 attributes);
313 /* Otherwise prefer the unsigned one. */
317 else
321 /* For two pointers, do this recursively on the target type,
322 and combine the qualifiers of the two types' targets. */
323 /* This code was turned off; I don't know why.
324 But ANSI C specifies doing this with the qualifiers.
325 So I turned it on again. */
326 {
336 }
339 {
341 /* Save space: see if the result is identical to one of the args. */
346 /* Merge the element types, and have a size if either arg has one. */
349 }
352 /* Function types: prefer the one that specified arg types.
353 If both do, merge the arg types. Also merge the return types. */
354 {
362 /* Save space: see if the result is identical to one of the args. */
368 /* Simple way if one arg fails to specify argument types. */
370 {
373 }
375 {
378 }
380 /* If both args specify argument types, we must merge the two
381 lists, argument by argument. */
396 {
397 /* A null type means arg type is not specified.
398 Take whatever the other function type has. */
400 {
403 }
405 {
408 }
410 /* Given wait (union {union wait *u; int *i} *)
411 and wait (union wait *),
412 prefer union wait * as type of parm. */
415 {
416 tree memb;
420 {
425 }
426 }
429 {
430 tree memb;
434 {
439 }
440 }
442 parm_done: ;
443 }
448 /* ... falls through ... */
449 }
453 }
455 }
456 \f
457 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
458 or various other operations. Return 2 if they are compatible
459 but a warning may be needed if you use them together. */
461 int
464 {
469 /* Suppress errors caused by previously reported errors. */
475 /* If either type is the internal version of sizetype, return the
476 language version. */
485 /* Treat an enum type as the integer type of the same width and
486 signedness. */
496 /* Different classes of types can't be compatible. */
500 /* Qualifiers must match. */
505 /* Allow for two different type nodes which have essentially the same
506 definition. Note that we already checked for equality of the type
507 qualifiers (just above). */
512 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
516 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
520 {
531 {
538 /* Target types must match incl. qualifiers. */
543 /* Sizes must match unless one is missing or variable. */
550 d1_variable = (! d1_zero
553 d2_variable = (! d2_zero
567 }
575 /* The target might allow certain vector types to be compatible. */
582 }
584 }
586 /* Return 1 if TTL and TTR are pointers to types that are equivalent,
587 ignoring their qualifiers. REFLEXIVE is only used by ObjC - set it
588 to 1 or 0 depending if the check of the pointer types is meant to
589 be reflexive or not (typically, assignments are not reflexive,
590 while comparisons are reflexive).
591 */
593 static int
597 {
600 /* Give objc_comptypes a crack at letting these types through. */
610 }
611 \f
612 /* Subroutines of `comptypes'. */
614 /* Return 1 if two function types F1 and F2 are compatible.
615 If either type specifies no argument types,
616 the other must specify a fixed number of self-promoting arg types.
617 Otherwise, if one type specifies only the number of arguments,
618 the other must specify that number of self-promoting arg types.
619 Otherwise, the argument types must match. */
621 static int
624 {
626 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
634 /* 'volatile' qualifiers on a function's return type mean the function
635 is noreturn. */
651 /* An unspecified parmlist matches any specified parmlist
652 whose argument types don't need default promotions. */
655 {
658 /* If one of these types comes from a non-prototype fn definition,
659 compare that with the other type's arglist.
660 If they don't match, ask for a warning (but no error). */
665 }
667 {
674 }
676 /* Both types have argument lists: compare them and propagate results. */
679 }
681 /* Check two lists of types for compatibility,
682 returning 0 for incompatible, 1 for compatible,
683 or 2 for compatible with warning. */
685 static int
688 {
689 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
694 {
697 /* If one list is shorter than the other,
698 they fail to match. */
701 /* A null pointer instead of a type
702 means there is supposed to be an argument
703 but nothing is specified about what type it has.
704 So match anything that self-promotes. */
706 {
709 }
711 {
714 }
717 {
718 /* Allow wait (union {union wait *u; int *i} *)
719 and wait (union wait *) to be compatible. */
726 {
727 tree memb;
734 }
741 {
742 tree memb;
749 }
750 else
752 }
754 /* comptypes said ok, but record if it said to warn. */
760 }
761 }
762 \f
763 /* Compute the size to increment a pointer by. */
765 tree
767 tree type;
768 {
775 {
778 }
780 /* Convert in case a char is more than one unit. */
784 }
785 \f
786 /* Return either DECL or its known constant value (if it has one). */
788 tree
790 tree decl;
791 {
793 in a place where a variable is invalid. */
799 /* This is invalid if initial value is not constant.
800 If it has either a function call, a memory reference,
801 or a variable, then re-evaluating it could give different results. */
803 /* Check for cases where this is sub-optimal, even though valid. */
807 }
809 /* Return either DECL or its known constant value (if it has one), but
810 return DECL if pedantic or DECL has mode BLKmode. This is for
811 bug-compatibility with the old behavior of decl_constant_value
812 (before GCC 3.0); every use of this function is a bug and it should
813 be removed before GCC 3.1. It is not appropriate to use pedantic
814 in a way that affects optimization, and BLKmode is probably not the
815 right test for avoiding misoptimizations either. */
817 static tree
819 tree decl;
820 {
823 else
825 }
828 /* Perform the default conversion of arrays and functions to pointers.
829 Return the result of converting EXP. For any other expression, just
830 return EXP. */
832 static tree
834 tree exp;
835 {
836 tree orig_exp;
841 /* Strip NON_LVALUE_EXPRs and no-op conversions, since we aren't using as
842 an lvalue.
844 Do not use STRIP_NOPS here! It will remove conversions from pointer
845 to integer and cause infinite recursion. */
850 {
854 }
856 /* Preserve the original expression code. */
861 {
863 }
865 {
866 tree adr;
868 tree ptrtype;
874 {
877 }
880 restype
891 {
895 }
899 {
900 /* Before C99, non-lvalue arrays do not decay to pointers.
901 Normally, using such an array would be invalid; but it can
902 be used correctly inside sizeof or as a statement expression.
903 Thus, do not give an error here; an error will result later. */
905 }
910 {
911 /* ??? This is not really quite correct
912 in that the type of the operand of ADDR_EXPR
913 is not the target type of the type of the ADDR_EXPR itself.
914 Question is, can this lossage be avoided? */
921 }
922 /* This way is better for a COMPONENT_REF since it can
923 simplify the offset for a component. */
926 }
928 }
930 /* Perform default promotions for C data used in expressions.
931 Arrays and functions are converted to pointers;
932 enumeral types or short or char, to int.
933 In addition, manifest constants symbols are replaced by their values. */
935 tree
937 tree exp;
938 {
939 tree orig_exp;
946 /* Constants can be used directly unless they're not loadable. */
950 /* Replace a nonvolatile const static variable with its value unless
951 it is an array, in which case we must be sure that taking the
952 address of the array produces consistent results. */
954 {
957 }
959 /* Strip NON_LVALUE_EXPRs and no-op conversions, since we aren't using as
960 an lvalue.
962 Do not use STRIP_NOPS here! It will remove conversions from pointer
963 to integer and cause infinite recursion. */
970 /* Preserve the original expression code. */
974 /* Normally convert enums to int,
975 but convert wide enums to something wider. */
977 {
985 }
989 /* If it's thinner than an int, promote it like a
990 c_promoting_integer_type_p, otherwise leave it alone. */
996 {
997 /* Preserve unsignedness if not really getting any wider. */
1003 }
1006 {
1009 }
1011 }
1012 \f
1013 /* Look up COMPONENT in a structure or union DECL.
1015 If the component name is not found, returns NULL_TREE. Otherwise,
1016 the return value is a TREE_LIST, with each TREE_VALUE a FIELD_DECL
1017 stepping down the chain to the component, which is in the last
1018 TREE_VALUE of the list. Normally the list is of length one, but if
1019 the component is embedded within (nested) anonymous structures or
1020 unions, the list steps down the chain to the component. */
1022 static tree
1025 {
1027 tree field;
1029 /* If TYPE_LANG_SPECIFIC is set, then it is a sorted array of pointers
1030 to the field elements. Use a binary search on this array to quickly
1031 find the element. Otherwise, do a linear search. TYPE_LANG_SPECIFIC
1032 will always be set for structures which have many elements. */
1035 {
1043 {
1048 {
1049 /* Step through all anon unions in linear fashion. */
1051 {
1055 {
1060 }
1061 }
1063 /* Entire record is only anon unions. */
1067 /* Restart the binary search, with new lower bound. */
1069 }
1075 else
1077 }
1083 }
1084 else
1085 {
1087 {
1091 {
1096 }
1100 }
1104 }
1107 }
1109 /* Make an expression to refer to the COMPONENT field of
1110 structure or union value DATUM. COMPONENT is an IDENTIFIER_NODE. */
1112 tree
1115 {
1119 tree ref;
1121 /* If DATUM is a COMPOUND_EXPR, move our reference inside it.
1122 If pedantic ensure that the arguments are not lvalues; otherwise,
1123 if the component is an array, it would wrongly decay to a pointer in
1124 C89 mode.
1125 We cannot do this with a COND_EXPR, because in a conditional expression
1126 the default promotions are applied to both sides, and this would yield
1127 the wrong type of the result; for example, if the components have
1128 type "char". */
1130 {
1132 {
1136 }
1139 }
1141 /* See if there is a field or component with name COMPONENT. */
1144 {
1146 {
1149 }
1154 {
1159 }
1161 /* Chain the COMPONENT_REFs if necessary down to the FIELD.
1162 This might be better solved in future the way the C++ front
1163 end does it - by giving the anonymous entities each a
1164 separate name and type, and then have build_component_ref
1165 recursively call itself. We can't do that here. */
1166 do
1167 {
1185 }
1189 }
1195 }
1196 \f
1197 /* Given an expression PTR for a pointer, return an expression
1198 for the value pointed to.
1199 ERRORSTRING is the name of the operator to appear in error messages. */
1201 tree
1203 tree ptr;
1205 {
1210 {
1215 else
1216 {
1221 {
1224 }
1228 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
1229 so that we get the proper error message if the result is used
1230 to assign to. Also, &* is supposed to be a no-op.
1231 And ANSI C seems to specify that the type of the result
1232 should be the const type. */
1233 /* A de-reference of a pointer to const is not a const. It is valid
1234 to change it via some other pointer. */
1240 }
1241 }
1245 }
1247 /* This handles expressions of the form "a[i]", which denotes
1248 an array reference.
1250 This is logically equivalent in C to *(a+i), but we may do it differently.
1251 If A is a variable or a member, we generate a primitive ARRAY_REF.
1252 This avoids forcing the array out of registers, and can work on
1253 arrays that are not lvalues (for example, members of structures returned
1254 by functions). */
1256 tree
1259 {
1261 {
1264 }
1272 {
1275 /* Subscripting with type char is likely to lose
1276 on a machine where chars are signed.
1277 So warn on any machine, but optionally.
1278 Don't warn for unsigned char since that type is safe.
1279 Don't warn for signed char because anyone who uses that
1280 must have done so deliberately. */
1285 /* Apply default promotions *after* noticing character types. */
1288 /* Require integer *after* promotion, for sake of enums. */
1290 {
1293 }
1295 /* An array that is indexed by a non-constant
1296 cannot be stored in a register; we must be able to do
1297 address arithmetic on its address.
1298 Likewise an array of elements of variable size. */
1302 {
1305 }
1306 /* An array that is indexed by a constant value which is not within
1307 the array bounds cannot be stored in a register either; because we
1308 would get a crash in store_bit_field/extract_bit_field when trying
1309 to access a non-existent part of the register. */
1313 {
1316 }
1319 {
1327 }
1331 /* Array ref is const/volatile if the array elements are
1332 or if the array is. */
1341 /* This was added by rms on 16 Nov 91.
1342 It fixes vol struct foo *a; a->elts[1]
1343 in an inline function.
1344 Hope it doesn't break something else. */
1347 }
1349 {
1353 /* Do the same warning check as above, but only on the part that's
1354 syntactically the index and only if it is also semantically
1355 the index. */
1361 /* Put the integer in IND to simplify error checking. */
1363 {
1367 }
1374 {
1377 }
1379 {
1382 }
1386 }
1387 }
1388 \f
1389 /* Issue an error message for a reference to an undeclared variable ID,
1390 including a reference to a builtin outside of function-call context.
1391 Arrange to suppress further errors for the same identifier. */
1392 static void
1394 tree id;
1395 {
1397 {
1401 }
1402 else
1403 {
1408 {
1412 }
1414 /* Set IDENTIFIER_SYMBOL_VALUE (id) to error_mark_node
1415 at function scope. This suppresses further warnings
1416 about this undeclared identifier in this function. */
1418 }
1419 }
1421 /* Build an external reference to identifier ID. FUN indicates
1422 whether this will be used for a function call. */
1423 tree
1425 tree id;
1427 {
1428 tree ref;
1433 {
1434 /* Properly declared variable or function reference. */
1438 {
1442 }
1443 else
1445 }
1449 /* Implicit function declaration. */
1452 /* Don't complain about something that's already been
1453 complained about. */
1455 else
1456 {
1459 }
1472 {
1475 }
1481 {
1486 }
1489 }
1491 /* Build a function call to function FUNCTION with parameters PARAMS.
1492 PARAMS is a list--a chain of TREE_LIST nodes--in which the
1493 TREE_VALUE of each node is a parameter-expression.
1494 FUNCTION's data type may be a function type or a pointer-to-function. */
1496 tree
1499 {
1501 tree coerced_params;
1504 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
1507 /* Convert anything with function type to a pointer-to-function. */
1509 {
1512 /* Differs from default_conversion by not setting TREE_ADDRESSABLE
1513 (because calling an inline function does not mean the function
1514 needs to be separately compiled). */
1520 }
1521 else
1531 {
1534 }
1539 /* fntype now gets the type of function pointed to. */
1542 /* Convert the parameters to the types declared in the
1543 function prototype, or apply default promotions. */
1545 coerced_params
1548 /* Check that the arguments to the function are valid. */
1552 /* Recognize certain built-in functions so we can make tree-codes
1553 other than CALL_EXPR. We do this when it enables fold-const.c
1554 to do something useful. */
1559 {
1564 }
1574 }
1575 \f
1576 /* Convert the argument expressions in the list VALUES
1577 to the types in the list TYPELIST. The result is a list of converted
1578 argument expressions.
1580 If TYPELIST is exhausted, or when an element has NULL as its type,
1581 perform the default conversions.
1583 PARMLIST is the chain of parm decls for the function being called.
1584 It may be 0, if that info is not available.
1585 It is used only for generating error messages.
1587 NAME is an IDENTIFIER_NODE or 0. It is used only for error messages.
1589 This is also where warnings about wrong number of args are generated.
1591 Both VALUES and the returned value are chains of TREE_LIST nodes
1592 with the elements of the list in the TREE_VALUE slots of those nodes. */
1594 static tree
1597 {
1602 /* Scan the given expressions and types, producing individual
1603 converted arguments and pushing them on RESULT in reverse order. */
1606 valtail;
1608 {
1613 {
1617 else
1620 }
1622 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
1623 /* Do not use STRIP_NOPS here! We do not want an enumerator with value 0
1624 to convert automatically to a pointer. */
1633 {
1634 /* Formal parm type is specified by a function prototype. */
1635 tree parmval;
1638 {
1641 }
1642 else
1643 {
1644 /* Optionally warn about conversions that
1645 differ from the default conversions. */
1647 {
1652 warn_for_assignment ("%s as integer rather than floating due to prototype", (char *) 0, name, parmnum + 1);
1655 warn_for_assignment ("%s as integer rather than complex due to prototype", (char *) 0, name, parmnum + 1);
1658 warn_for_assignment ("%s as complex rather than floating due to prototype", (char *) 0, name, parmnum + 1);
1661 warn_for_assignment ("%s as floating rather than integer due to prototype", (char *) 0, name, parmnum + 1);
1664 warn_for_assignment ("%s as complex rather than integer due to prototype", (char *) 0, name, parmnum + 1);
1667 warn_for_assignment ("%s as floating rather than complex due to prototype", (char *) 0, name, parmnum + 1);
1668 /* ??? At some point, messages should be written about
1669 conversions between complex types, but that's too messy
1670 to do now. */
1673 {
1674 /* Warn if any argument is passed as `float',
1675 since without a prototype it would be `double'. */
1677 warn_for_assignment ("%s as `float' rather than `double' due to prototype", (char *) 0, name, parmnum + 1);
1678 }
1679 /* Detect integer changing in width or signedness.
1680 These warnings are only activated with
1681 -Wconversion, not with -Wtraditional. */
1684 {
1691 /* No warning if function asks for enum
1692 and the actual arg is that enum type. */
1693 ;
1695 warn_for_assignment ("%s with different width due to prototype", (char *) 0, name, parmnum + 1);
1697 ;
1698 /* Don't complain if the formal parameter type
1699 is an enum, because we can't tell now whether
1700 the value was an enum--even the same enum. */
1702 ;
1705 /* Change in signedness doesn't matter
1706 if a constant value is unaffected. */
1707 ;
1708 /* Likewise for a constant in a NOP_EXPR. */
1712 ;
1713 /* If the value is extended from a narrower
1714 unsigned type, it doesn't matter whether we
1715 pass it as signed or unsigned; the value
1716 certainly is the same either way. */
1719 ;
1722 else
1724 }
1725 }
1735 }
1737 }
1741 /* Convert `float' to `double'. */
1743 else
1744 /* Convert `short' and `char' to full-size `int'. */
1749 }
1752 {
1756 else
1758 }
1761 }
1762 \f
1763 /* This is the entry point used by the parser
1764 for binary operators in the input.
1765 In addition to constructing the expression,
1766 we check for operands that were written with other binary operators
1767 in a way that is likely to confuse the user. */
1769 tree
1773 {
1790 /* Check for cases such as x+y<<z which users are likely
1791 to misinterpret. If parens are used, C_EXP_ORIGINAL_CODE
1792 is cleared to prevent these warnings. */
1794 {
1796 {
1800 }
1803 {
1807 }
1810 {
1816 /* Check cases like x|y==z */
1819 }
1822 {
1828 /* Check cases like x^y==z */
1831 }
1834 {
1838 /* Check cases like x&y==z */
1841 }
1842 }
1844 /* Similarly, check for cases like 1<=i<=10 that are probably errors. */
1855 /* Record the code that was specified in the source,
1856 for the sake of warnings about confusing nesting. */
1859 else
1860 {
1862 /* We used to use NOP_EXPR rather than NON_LVALUE_EXPR
1863 so that convert_for_assignment wouldn't strip it.
1864 That way, we got warnings for things like p = (1 - 1).
1865 But it turns out we should not get those warnings. */
1869 }
1872 }
1874 /* Build a binary-operation expression without default conversions.
1875 CODE is the kind of expression to build.
1876 This function differs from `build' in several ways:
1877 the data type of the result is computed and recorded in it,
1878 warnings are generated if arg data types are invalid,
1879 special handling for addition and subtraction of pointers is known,
1880 and some optimization is done (operations on narrow ints
1881 are done in the narrower type when that gives the same result).
1882 Constant folding is also done before the result is returned.
1884 Note that the operands will never have enumeral types, or function
1885 or array types, because either they will have the default conversions
1886 performed or they have both just been converted to some other type in which
1887 the arithmetic is to be done. */
1889 tree
1894 {
1899 /* Expression code to give to the expression when it is built.
1900 Normally this is CODE, which is what the caller asked for,
1901 but in some special cases we change it. */
1904 /* Data type in which the computation is to be performed.
1905 In the simplest cases this is the common type of the arguments. */
1908 /* Nonzero means operands have already been type-converted
1909 in whatever way is necessary.
1910 Zero means they need to be converted to RESULT_TYPE. */
1913 /* Nonzero means create the expression with this type, rather than
1914 RESULT_TYPE. */
1917 /* Nonzero means after finally constructing the expression
1918 convert it to this type. */
1921 /* Nonzero if this is an operation like MIN or MAX which can
1922 safely be computed in short if both args are promoted shorts.
1923 Also implies COMMON.
1924 -1 indicates a bitwise operation; this makes a difference
1925 in the exact conditions for when it is safe to do the operation
1926 in a narrower mode. */
1929 /* Nonzero if this is a comparison operation;
1930 if both args are promoted shorts, compare the original shorts.
1931 Also implies COMMON. */
1934 /* Nonzero if this is a right-shift operation, which can be computed on the
1935 original short and then promoted if the operand is a promoted short. */
1938 /* Nonzero means set RESULT_TYPE to the common type of the args. */
1942 {
1945 }
1946 else
1947 {
1950 }
1955 /* The expression codes of the data types of the arguments tell us
1956 whether the arguments are integers, floating, pointers, etc. */
1960 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
1964 /* If an error was already reported for one of the arguments,
1965 avoid reporting another error. */
1971 {
1973 /* Handle the pointer + int case. */
1978 else
1983 /* Subtraction of two similar pointers.
1984 We must subtract them as integers, then divide by object size. */
1988 /* Handle pointer minus int. Just like pointer plus int. */
1991 else
2004 /* Floating point division by zero is a legitimate way to obtain
2005 infinities and NaNs. */
2013 {
2016 else
2017 /* Although it would be tempting to shorten always here, that
2018 loses on some targets, since the modulo instruction is
2019 undefined if the quotient can't be represented in the
2020 computation mode. We shorten only if unsigned or if
2021 dividing by something we know != -1. */
2026 }
2045 {
2046 /* Although it would be tempting to shorten always here, that loses
2047 on some targets, since the modulo instruction is undefined if the
2048 quotient can't be represented in the computation mode. We shorten
2049 only if unsigned or if dividing by something we know != -1. */
2054 }
2066 {
2067 /* Result of these operations is always an int,
2068 but that does not mean the operands should be
2069 converted to ints! */
2074 }
2077 /* Shift operations: result has same type as first operand;
2078 always convert second operand to int.
2079 Also set SHORT_SHIFT if shifting rightward. */
2083 {
2085 {
2088 else
2089 {
2095 }
2096 }
2098 /* Use the type of the value to be shifted. */
2100 /* Convert the shift-count to an integer, regardless of size
2101 of value being shifted. */
2104 /* Avoid converting op1 to result_type later. */
2106 }
2111 {
2113 {
2119 }
2121 /* Use the type of the value to be shifted. */
2123 /* Convert the shift-count to an integer, regardless of size
2124 of value being shifted. */
2127 /* Avoid converting op1 to result_type later. */
2129 }
2135 {
2137 {
2142 }
2144 /* Use the type of the value to be shifted. */
2146 /* Convert the shift-count to an integer, regardless of size
2147 of value being shifted. */
2150 /* Avoid converting op1 to result_type later. */
2152 }
2159 /* Result of comparison is always int,
2160 but don't convert the args to int! */
2170 {
2173 /* Anything compares with void *. void * compares with anything.
2174 Otherwise, the targets must be compatible
2175 and both must be object or both incomplete. */
2179 {
2180 /* op0 != orig_op0 detects the case of something
2181 whose value is 0 but which isn't a valid null ptr const. */
2185 }
2187 {
2191 }
2192 else
2197 }
2205 {
2208 }
2210 {
2213 }
2222 {
2224 {
2229 }
2230 else
2231 {
2234 }
2235 }
2247 {
2249 {
2257 }
2258 else
2259 {
2262 }
2263 }
2266 {
2270 }
2273 {
2277 }
2279 {
2282 }
2284 {
2287 }
2299 {
2302 }
2308 }
2312 &&
2315 {
2321 /* For certain operations (which identify themselves by shorten != 0)
2322 if both args were extended from the same smaller type,
2323 do the arithmetic in that type and then extend.
2325 shorten !=0 and !=1 indicates a bitwise operation.
2326 For them, this optimization is safe only if
2327 both args are zero-extended or both are sign-extended.
2328 Otherwise, we might change the result.
2329 Eg, (short)-1 | (unsigned short)-1 is (int)-1
2330 but calculated in (unsigned short) it would be (unsigned short)-1. */
2333 {
2337 /* UNS is 1 if the operation to be done is an unsigned one. */
2339 tree type;
2343 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
2344 but it *requires* conversion to FINAL_TYPE. */
2355 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
2357 /* For bitwise operations, signedness of nominal type
2358 does not matter. Consider only how operands were extended. */
2362 /* Note that in all three cases below we refrain from optimizing
2363 an unsigned operation on sign-extended args.
2364 That would not be valid. */
2366 /* Both args variable: if both extended in same way
2367 from same width, do it in that width.
2368 Do it unsigned if args were zero-extended. */
2375 result_type
2376 = c_common_signed_or_unsigned_type
2382 && (type
2391 && (type
2396 }
2398 /* Shifts can be shortened if shifting right. */
2401 {
2411 /* We can shorten only if the shift count is less than the
2412 number of bits in the smaller type size. */
2414 /* We cannot drop an unsigned shift after sign-extension. */
2416 {
2417 /* Do an unsigned shift if the operand was zero-extended. */
2418 result_type
2421 /* Convert value-to-be-shifted to that type. */
2425 }
2426 }
2428 /* Comparison operations are shortened too but differently.
2429 They identify themselves by setting short_compare = 1. */
2432 {
2433 /* Don't write &op0, etc., because that would prevent op0
2434 from being kept in a register.
2435 Instead, make copies of the our local variables and
2436 pass the copies by reference, then copy them back afterward. */
2439 tree val
2450 {
2462 /* Give warnings for comparisons between signed and unsigned
2463 quantities that may fail.
2465 Do the checking based on the original operand trees, so that
2466 casts will be considered, but default promotions won't be.
2468 Do not warn if the comparison is being done in a signed type,
2469 since the signed type will only be chosen if it can represent
2470 all the values of the unsigned type. */
2473 /* Do not warn if both operands are the same signedness. */
2476 else
2477 {
2482 else
2485 /* Do not warn if the signed quantity is an
2486 unsuffixed integer literal (or some static
2487 constant expression involving such literals or a
2488 conditional expression involving such literals)
2489 and it is non-negative. */
2492 /* Do not warn if the comparison is an equality operation,
2493 the unsigned quantity is an integral constant, and it
2494 would fit in the result if the result were signed. */
2497 && int_fits_type_p
2500 /* Do not warn if the unsigned quantity is an enumeration
2501 constant and its maximum value would fit in the result
2502 if the result were signed. */
2505 && int_fits_type_p
2509 else
2511 }
2513 /* Warn if two unsigned values are being compared in a size
2514 larger than their original size, and one (and only one) is the
2515 result of a `~' operator. This comparison will always fail.
2517 Also warn if one operand is a constant, and the constant
2518 does not have all bits set that are set in the ~ operand
2519 when it is extended. */
2523 {
2527 else
2532 {
2533 tree primop;
2538 {
2542 }
2543 else
2544 {
2548 }
2553 {
2557 }
2558 }
2565 }
2566 }
2567 }
2568 }
2570 /* At this point, RESULT_TYPE must be nonzero to avoid an error message.
2571 If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
2572 Then the expression will be built.
2573 It will be given type FINAL_TYPE if that is nonzero;
2574 otherwise, it will be given type RESULT_TYPE. */
2577 {
2580 }
2583 {
2588 }
2593 {
2595 tree folded;
2603 }
2604 }
2605 \f
2607 /* Return true if `t' is known to be non-negative. */
2609 int
2611 tree t;
2612 {
2614 {
2617 /* Find the last statement in the chain, ignoring the final
2618 * scope statement */
2623 }
2625 }
2627 /* Return a tree for the difference of pointers OP0 and OP1.
2628 The resulting tree has type int. */
2630 static tree
2633 {
2642 {
2647 }
2649 /* If the conversion to ptrdiff_type does anything like widening or
2650 converting a partial to an integral mode, we get a convert_expression
2651 that is in the way to do any simplifications.
2652 (fold-const.c doesn't know that the extra bits won't be needed.
2653 split_tree uses STRIP_SIGN_NOPS, which leaves conversions to a
2654 different mode in place.)
2655 So first try to find a common term here 'by hand'; we want to cover
2656 at least the cases that occur in legal static initializers. */
2661 {
2664 }
2665 else
2669 {
2672 }
2673 else
2677 {
2680 }
2683 /* First do the subtraction as integers;
2684 then drop through to build the divide operator.
2685 Do not do default conversions on the minus operator
2686 in case restype is a short type. */
2690 /* This generates an error if op1 is pointer to incomplete type. */
2694 /* This generates an error if op0 is pointer to incomplete type. */
2697 /* Divide by the size, in easiest possible way. */
2705 }
2706 \f
2707 /* Construct and perhaps optimize a tree representation
2708 for a unary operation. CODE, a tree_code, specifies the operation
2709 and XARG is the operand.
2710 For any CODE other than ADDR_EXPR, FLAG nonzero suppresses
2711 the default promotions (such as from short to int).
2712 For ADDR_EXPR, the default promotions are not applied; FLAG nonzero
2713 allows non-lvalues; this is only used to handle conversion of non-lvalue
2714 arrays to pointers in C99. */
2716 tree
2719 tree xarg;
2721 {
2722 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
2726 tree val;
2735 {
2737 /* This is used for unary plus, because a CONVERT_EXPR
2738 is enough to prevent anybody from looking inside for
2739 associativity, but won't generate any code. */
2742 {
2745 }
2755 {
2758 }
2765 {
2768 }
2770 {
2776 }
2777 else
2778 {
2781 }
2787 {
2790 }
2796 /* Conjugating a real value is a no-op, but allow it anyway. */
2799 {
2802 }
2811 /* These will convert to a pointer. */
2813 {
2816 }
2828 else
2836 else
2843 /* Handle complex lvalues (when permitted)
2844 by reduction to simpler cases. */
2850 /* Increment or decrement the real part of the value,
2851 and don't change the imaginary part. */
2853 {
2864 }
2866 /* Report invalid types. */
2870 {
2873 else
2877 }
2879 {
2880 tree inc;
2886 /* Compute the increment. */
2889 {
2890 /* If pointer target is an undefined struct,
2891 we just cannot know how to do the arithmetic. */
2893 {
2896 else
2898 }
2902 {
2905 else
2907 }
2910 }
2911 else
2916 /* Handle incrementing a cast-expression. */
2920 {
2929 /* If the real type has the same machine representation
2930 as the type it is cast to, we can make better output
2931 by adding directly to the inside of the cast. */
2937 else
2938 {
2942 else
2943 {
2947 else
2956 }
2959 }
2964 }
2965 give_up:
2967 /* Complain about anything else that is not a true lvalue. */
2974 /* Report a read-only lvalue. */
2983 else
2990 }
2993 /* Note that this operation never does default_conversion. */
2995 /* Let &* cancel out to simplify resulting code. */
2997 {
2998 /* Don't let this be an lvalue. */
3002 }
3004 /* For &x[y], return x+y */
3006 {
3011 }
3013 /* Handle complex lvalues (when permitted)
3014 by reduction to simpler cases. */
3019 /* Anything not already handled and not a true memory reference
3020 or a non-lvalue array is an error. */
3025 /* Ordinary case; arg is a COMPONENT_REF or a decl. */
3028 /* If the lvalue is const or volatile, merge that into the type
3029 to which the address will point. Note that you can't get a
3030 restricted pointer by taking the address of something, so we
3031 only have to deal with `const' and `volatile' here. */
3043 {
3044 tree addr;
3047 {
3053 {
3057 }
3062 }
3063 else
3066 /* Address of a static or external variable or
3067 file-scope function counts as a constant. */
3073 }
3077 }
3082 }
3084 /* Return nonzero if REF is an lvalue valid for this language.
3085 Lvalues can be assigned, unless their type has TYPE_READONLY.
3086 Lvalues can have their address taken, unless they have DECL_REGISTER. */
3088 int
3090 tree ref;
3091 {
3095 {
3120 }
3121 }
3123 /* Return nonzero if REF is an lvalue valid for this language;
3124 otherwise, print an error message and return zero. */
3126 int
3128 tree ref;
3130 {
3137 }
3139 /* Apply unary lvalue-demanding operator CODE to the expression ARG
3140 for certain kinds of expressions which are not really lvalues
3141 but which we can accept as lvalues. If FLAG is nonzero, then
3142 non-lvalues are OK since we may be converting a non-lvalue array to
3143 a pointer in C99.
3145 If ARG is not a kind of expression we can handle, return zero. */
3147 static tree
3150 tree arg;
3152 {
3153 /* Handle (a, b) used as an "lvalue". */
3155 {
3158 /* If this returns a function type, it isn't really being used as
3159 an lvalue, so don't issue a warning about it. */
3165 }
3167 /* Handle (a ? b : c) used as an "lvalue". */
3169 {
3179 }
3182 }
3184 /* If pedantic, warn about improper lvalue. CODE is either COND_EXPR
3185 COMPOUND_EXPR, or CONVERT_EXPR (for casts). */
3187 static void
3190 {
3193 {
3203 }
3204 }
3205 \f
3206 /* Warn about storing in something that is `const'. */
3208 void
3210 tree arg;
3212 {
3214 {
3217 else
3220 }
3224 else
3226 }
3227 \f
3228 /* Mark EXP saying that we need to be able to take the
3229 address of it; it should not be allocated in a register.
3230 Returns true if successful. */
3232 bool
3234 tree exp;
3235 {
3240 {
3243 {
3247 }
3249 /* ... fall through ... */
3269 {
3271 {
3275 }
3278 }
3280 {
3282 {
3286 }
3288 /* If we are making this addressable due to its having
3289 volatile components, give a different error message. Also
3290 handle the case of an unnamed parameter by not trying
3291 to give the name. */
3294 {
3297 }
3301 }
3304 /* drops in */
3309 }
3310 }
3311 \f
3312 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
3314 tree
3317 {
3318 tree type1;
3319 tree type2;
3327 /* Promote both alternatives. */
3344 /* Quickly detect the usual case where op1 and op2 have the same type
3345 after promotion. */
3347 {
3350 else
3352 }
3357 {
3360 /* If -Wsign-compare, warn here if type1 and type2 have
3361 different signedness. We'll promote the signed to unsigned
3362 and later code won't know it used to be different.
3363 Do this check on the original types, so that explicit casts
3364 will be considered, but default promotions won't. */
3366 {
3371 {
3372 /* Do not warn if the result type is signed, since the
3373 signed type will only be chosen if it can represent
3374 all the values of the unsigned type. */
3377 /* Do not warn if the signed quantity is an unsuffixed
3378 integer literal (or some static constant expression
3379 involving such literals) and it is non-negative. */
3383 else
3385 }
3386 }
3387 }
3389 {
3393 }
3395 {
3405 {
3410 }
3412 {
3417 }
3418 else
3419 {
3422 }
3423 }
3425 {
3428 else
3429 {
3431 }
3433 }
3435 {
3438 else
3439 {
3441 }
3443 }
3446 {
3449 else
3450 {
3453 }
3454 }
3456 /* Merge const and volatile flags of the incoming types. */
3457 result_type
3471 }
3472 \f
3473 /* Given a list of expressions, return a compound expression
3474 that performs them all and returns the value of the last of them. */
3476 tree
3478 tree list;
3479 {
3481 }
3483 static tree
3485 tree list;
3487 {
3488 tree rest;
3491 {
3492 /* Convert arrays and functions to pointers when there
3493 really is a comma operator. */
3498 /* Don't let (0, 0) be null pointer constant. */
3502 }
3507 {
3508 /* The left-hand operand of a comma expression is like an expression
3509 statement: with -Wextra or -Wunused, we should warn if it doesn't have
3510 any side-effects, unless it was explicitly cast to (void). */
3516 /* When pedantic, a compound expression can be neither an lvalue
3517 nor an integer constant expression. */
3520 }
3522 /* With -Wunused, we should also warn if the left-hand operand does have
3523 side-effects, but computes a value which is not used. For example, in
3524 `foo() + bar(), baz()' the result of the `+' operator is not used,
3525 so we should issue a warning. */
3530 }
3532 /* Build an expression representing a cast to type TYPE of expression EXPR. */
3534 tree
3536 tree type;
3537 tree expr;
3538 {
3544 /* The ObjC front-end uses TYPE_MAIN_VARIANT to tie together types differing
3545 only in <protocol> qualifications. But when constructing cast expressions,
3546 the protocols do matter and must be kept around. */
3551 {
3554 }
3557 {
3560 }
3563 {
3565 {
3569 }
3570 }
3572 {
3573 tree field;
3582 {
3583 tree t;
3593 }
3596 }
3597 else
3598 {
3601 /* If casting to void, avoid the error that would come
3602 from default_conversion in the case of a non-lvalue array. */
3606 /* Convert functions and arrays to pointers,
3607 but don't convert any other types. */
3611 /* Optionally warn about potentially worrisome casts. */
3616 {
3622 /* Check that the qualifiers on IN_TYPE are a superset of
3623 the qualifiers of IN_OTYPE. The outermost level of
3624 POINTER_TYPE nodes is uninteresting and we stop as soon
3625 as we hit a non-POINTER_TYPE node on either type. */
3626 do
3627 {
3631 /* GNU C allows cv-qualified function types. 'const'
3632 means the function is very pure, 'volatile' means it
3633 can't return. We need to warn when such qualifiers
3634 are added, not when they're taken away. */
3638 else
3640 }
3648 /* There are qualifiers present in IN_OTYPE that are not
3649 present in IN_TYPE. */
3651 }
3653 /* Warn about possible alignment problems. */
3659 /* Don't warn about opaque types, where the actual alignment
3660 restriction is unknown. */
3681 /* Don't warn about converting any constant. */
3691 {
3692 /* Casting the address of a decl to non void pointer. Warn
3693 if the cast breaks type based aliasing. */
3700 }
3703 /* Replace a nonvolatile const static variable with its value. */
3708 /* Ignore any integer overflow caused by the cast. */
3710 {
3713 }
3714 }
3716 /* Pedantically, don't let (void *) (FOO *) 0 be a null pointer constant. */
3722 /* If pedantic, don't let a cast be an lvalue. */
3727 }
3729 /* Interpret a cast of expression EXPR to type TYPE. */
3730 tree
3733 {
3736 /* This avoids warnings about unprototyped casts on
3737 integers. E.g. "#define SIG_DFL (void(*)())0". */
3744 }
3746 \f
3747 /* Build an assignment expression of lvalue LHS from value RHS.
3748 MODIFYCODE is the code for a binary operator that we use
3749 to combine the old value of LHS with RHS to get the new value.
3750 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment. */
3752 tree
3756 {
3757 tree result;
3758 tree newrhs;
3762 /* Types that aren't fully specified cannot be used in assignments. */
3765 /* Avoid duplicate error messages from operands that had errors. */
3769 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
3770 /* Do not use STRIP_NOPS here. We do not want an enumerator
3771 whose value is 0 to count as a null pointer constant. */
3777 /* Handle control structure constructs used as "lvalues". */
3780 {
3781 /* Handle (a, b) used as an "lvalue". */
3790 /* Handle (a ? b : c) used as an "lvalue". */
3794 {
3795 /* Produce (a ? (b = rhs) : (c = rhs))
3796 except that the RHS goes through a save-expr
3797 so the code to compute it is only emitted once. */
3798 tree cond
3806 /* Make sure the code to compute the rhs comes out
3807 before the split. */
3809 /* But cast it to void to avoid an "unused" error. */
3811 }
3814 }
3816 /* If a binary op has been requested, combine the old LHS value with the RHS
3817 producing the value we should actually store into the LHS. */
3820 {
3823 }
3825 /* Handle a cast used as an "lvalue".
3826 We have already performed any binary operator using the value as cast.
3827 Now convert the result to the cast type of the lhs,
3828 and then true type of the lhs and store it there;
3829 then convert result back to the cast type to be the value
3830 of the assignment. */
3833 {
3842 {
3844 tree result;
3852 }
3856 }
3858 /* Now we have handled acceptable kinds of LHS that are not truly lvalues.
3859 Reject anything strange now. */
3864 /* Warn about storing in something that is `const'. */
3872 /* If storing into a structure or union member,
3873 it has probably been given type `int'.
3874 Compute the type that would go with
3875 the actual amount of storage the member occupies. */
3884 /* If storing in a field that is in actuality a short or narrower than one,
3885 we must store in the field in its actual type. */
3888 {
3891 }
3893 /* Convert new value to destination type. */
3900 /* Scan operands */
3905 /* If we got the LHS in a different type for storing in,
3906 convert the result back to the nominal type of LHS
3907 so that the value we return always has the same type
3908 as the LHS argument. */
3914 }
3915 \f
3916 /* Convert value RHS to type TYPE as preparation for an assignment
3917 to an lvalue of type TYPE.
3918 The real work of conversion is done by `convert'.
3919 The purpose of this function is to generate error messages
3920 for assignments that are not allowed in C.
3921 ERRTYPE is a string to use in error messages:
3922 "assignment", "return", etc. If it is null, this is parameter passing
3923 for a function call (and different error messages are output).
3925 FUNNAME is the name of the function being called,
3926 as an IDENTIFIER_NODE, or null.
3927 PARMNUM is the number of the argument, for printing in error messages. */
3929 static tree
3935 {
3937 tree rhstype;
3940 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
3941 /* Do not use STRIP_NOPS here. We do not want an enumerator
3942 whose value is 0 to count as a null pointer constant. */
3959 {
3961 /* Check for Objective-C protocols. This will automatically
3962 issue a warning if there are protocol violations. No need to
3963 use the return value. */
3967 }
3970 {
3973 }
3974 /* A type converts to a reference to it.
3975 This code doesn't fully support references, it's just for the
3976 special case of va_start and va_copy. */
3979 {
3981 {
3984 }
3989 /* We already know that these two types are compatible, but they
3990 may not be exactly identical. In fact, `TREE_TYPE (type)' is
3991 likely to be __builtin_va_list and `TREE_TYPE (rhs)' is
3992 likely to be va_list, a typedef to __builtin_va_list, which
3993 is different enough that it will cause problems later. */
3999 }
4000 /* Some types can interconvert without explicit casts. */
4005 /* Arithmetic types all interconvert, and enum is treated like int. */
4014 /* Conversion to a transparent union from its member types.
4015 This applies only to function arguments. */
4017 {
4018 tree memb_types;
4023 {
4034 {
4038 /* Any non-function converts to a [const][volatile] void *
4039 and vice versa; otherwise, targets must be the same.
4040 Meanwhile, the lhs target must have all the qualifiers of
4041 the rhs. */
4044 {
4045 /* If this type won't generate any warnings, use it. */
4055 /* Keep looking for a better type, but remember this one. */
4058 }
4059 }
4061 /* Can convert integer zero to any pointer type. */
4065 {
4068 }
4069 }
4072 {
4074 {
4075 /* We have only a marginally acceptable member type;
4076 it needs a warning. */
4080 /* Const and volatile mean something different for function
4081 types, so the usual warnings are not appropriate. */
4084 {
4085 /* Because const and volatile on functions are
4086 restrictions that say the function will not do
4087 certain things, it is okay to use a const or volatile
4088 function where an ordinary one is wanted, but not
4089 vice-versa. */
4093 }
4097 parmnum);
4098 }
4104 }
4105 }
4107 /* Conversions among pointers */
4110 {
4115 /* Opaque pointers are treated like void pointers. */
4121 /* Any non-function converts to a [const][volatile] void *
4122 and vice versa; otherwise, targets must be the same.
4123 Meanwhile, the lhs target must have all the qualifiers of the rhs. */
4126 || is_opaque_pointer
4129 {
4132 ||
4134 /* Check TREE_CODE to catch cases like (void *) (char *) 0
4135 which are not ANSI null ptr constants. */
4140 /* Const and volatile mean something different for function types,
4141 so the usual warnings are not appropriate. */
4144 {
4148 /* If this is not a case of ignoring a mismatch in signedness,
4149 no warning. */
4152 ;
4153 /* If there is a mismatch, do warn. */
4157 }
4160 {
4161 /* Because const and volatile on functions are restrictions
4162 that say the function will not do certain things,
4163 it is okay to use a const or volatile function
4164 where an ordinary one is wanted, but not vice-versa. */
4168 }
4169 }
4170 else
4174 }
4176 {
4177 /* An explicit constant 0 can convert to a pointer,
4178 or one that results from arithmetic, even including
4179 a cast to integer type. */
4181 &&
4186 {
4190 }
4192 }
4194 {
4198 }
4203 {
4205 {
4211 else
4214 }
4215 else
4217 parmnum);
4218 }
4219 else
4223 }
4225 /* Convert VALUE for assignment into inlined parameter PARM. */
4227 tree
4230 {
4233 /* If FN was prototyped, the value has been converted already
4234 in convert_arguments. */
4247 }
4249 /* Print a warning using MSGID.
4250 It gets OPNAME as its one parameter.
4251 if OPNAME is null and ARGNUM is 0, it is replaced by "passing arg of `FUNCTION'".
4252 Otherwise if OPNAME is null, it is replaced by "passing arg ARGNUM of `FUNCTION'".
4253 FUNCTION and ARGNUM are handled specially if we are building an
4254 Objective-C selector. */
4256 static void
4260 tree function;
4262 {
4264 {
4269 {
4272 }
4274 {
4276 {
4277 /* Function name is known; supply it. */
4284 }
4285 else
4286 {
4287 /* Function name unknown (call through ptr). */
4291 }
4292 }
4294 {
4295 /* Function name is known; supply it. */
4302 }
4303 else
4304 {
4305 /* Function name unknown (call through ptr); just give arg number. */
4309 }
4311 }
4313 }
4314 \f
4315 /* If VALUE is a compound expr all of whose expressions are constant, then
4316 return its value. Otherwise, return error_mark_node.
4318 This is for handling COMPOUND_EXPRs as initializer elements
4319 which is allowed with a warning when -pedantic is specified. */
4321 static tree
4323 tree value;
4324 tree endtype;
4325 {
4327 {
4332 endtype);
4333 }
4337 else
4339 }
4340 \f
4341 /* Perform appropriate conversions on the initial value of a variable,
4342 store it in the declaration DECL,
4343 and print any error messages that are appropriate.
4344 If the init is invalid, store an ERROR_MARK. */
4346 void
4349 {
4352 /* If variable's type was invalidly declared, just ignore it. */
4358 /* Digest the specified initializer into an expression. */
4362 /* Store the expression if valid; else report error. */
4370 /* ANSI wants warnings about out-of-range constant initializers. */
4374 /* Check if we need to set array size from compound literal size. */
4378 {
4386 {
4390 {
4391 /* For int foo[] = (int [3]){1}; we need to set array size
4392 now since later on array initializer will be just the
4393 brace enclosed list of the compound literal. */
4397 }
4398 }
4399 }
4400 }
4401 \f
4402 /* Methods for storing and printing names for error messages. */
4404 /* Implement a spelling stack that allows components of a name to be pushed
4405 and popped. Each element on the stack is this structure. */
4407 struct spelling
4408 {
4410 union
4411 {
4415 };
4417 #define SPELLING_STRING 1
4418 #define SPELLING_MEMBER 2
4419 #define SPELLING_BOUNDS 3
4425 /* Macros to save and restore the spelling stack around push_... functions.
4426 Alternative to SAVE_SPELLING_STACK. */
4428 #define SPELLING_DEPTH() (spelling - spelling_base)
4429 #define RESTORE_SPELLING_DEPTH(DEPTH) (spelling = spelling_base + (DEPTH))
4431 /* Push an element on the spelling stack with type KIND and assign VALUE
4432 to MEMBER. */
4434 #define PUSH_SPELLING(KIND, VALUE, MEMBER) \
4435 { \
4436 int depth = SPELLING_DEPTH (); \
4437 \
4438 if (depth >= spelling_size) \
4439 { \
4440 spelling_size += 10; \
4441 if (spelling_base == 0) \
4442 spelling_base \
4443 = (struct spelling *) xmalloc (spelling_size * sizeof (struct spelling)); \
4444 else \
4445 spelling_base \
4446 = (struct spelling *) xrealloc (spelling_base, \
4447 spelling_size * sizeof (struct spelling)); \
4448 RESTORE_SPELLING_DEPTH (depth); \
4449 } \
4450 \
4451 spelling->kind = (KIND); \
4452 spelling->MEMBER = (VALUE); \
4453 spelling++; \
4454 }
4456 /* Push STRING on the stack. Printed literally. */
4458 static void
4461 {
4463 }
4465 /* Push a member name on the stack. Printed as '.' STRING. */
4467 static void
4469 tree decl;
4471 {
4475 }
4477 /* Push an array bounds on the stack. Printed as [BOUNDS]. */
4479 static void
4482 {
4484 }
4486 /* Compute the maximum size in bytes of the printed spelling. */
4488 static int
4490 {
4495 {
4498 else
4500 }
4503 }
4505 /* Print the spelling to BUFFER and return it. */
4510 {
4516 {
4519 }
4520 else
4521 {
4526 ;
4527 }
4530 }
4532 /* Issue an error message for a bad initializer component.
4533 MSGID identifies the message.
4534 The component name is taken from the spelling stack. */
4536 void
4539 {
4546 }
4548 /* Issue a pedantic warning for a bad initializer component.
4549 MSGID identifies the message.
4550 The component name is taken from the spelling stack. */
4552 void
4555 {
4562 }
4564 /* Issue a warning for a bad initializer component.
4565 MSGID identifies the message.
4566 The component name is taken from the spelling stack. */
4568 static void
4571 {
4578 }
4579 \f
4580 /* Digest the parser output INIT as an initializer for type TYPE.
4581 Return a C expression of type TYPE to represent the initial value.
4583 REQUIRE_CONSTANT requests an error if non-constant initializers or
4584 elements are seen. */
4586 static tree
4590 {
4599 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
4600 /* Do not use STRIP_NOPS here. We do not want an enumerator
4601 whose value is 0 to count as a null pointer constant. */
4607 /* Initialization of an array of chars from a string constant
4608 optionally enclosed in braces. */
4611 {
4619 {
4627 {
4630 }
4634 {
4637 }
4643 /* Subtract 1 (or sizeof (wchar_t))
4644 because it's ok to ignore the terminating null char
4645 that is counted in the length of the constant. */
4656 }
4657 }
4659 /* Build a VECTOR_CST from a *constant* vector constructor. If the
4660 vector constructor is not constant (e.g. {1,2,3,foo()}) then punt
4661 below and handle as a constructor. */
4665 {
4670 else
4672 }
4674 /* Any type can be initialized
4675 from an expression of the same type, optionally with braces. */
4689 {
4695 {
4696 /* As an extension, allow initializing objects with static storage
4697 duration with compound literals (which are then treated just as
4698 the brace enclosed list they contain). */
4701 }
4705 {
4708 }
4713 /* Compound expressions can only occur here if -pedantic or
4714 -pedantic-errors is specified. In the later case, we always want
4715 an error. In the former case, we simply want a warning. */
4718 {
4719 inside_init
4724 else
4728 }
4731 /* This test catches things like `7 / 0' which
4732 result in an expression for which TREE_CONSTANT
4733 is true, but which is not actually something
4734 that is a legal constant. We really should not
4735 be using this function, because it is a part of
4736 the back-end. Instead, the expression should
4737 already have been turned into ERROR_MARK_NODE. */
4740 {
4743 }
4746 }
4748 /* Handle scalar types, including conversions. */
4752 {
4753 /* Note that convert_for_assignment calls default_conversion
4754 for arrays and functions. We must not call it in the
4755 case where inside_init is a null pointer constant. */
4756 inside_init
4761 {
4764 }
4767 {
4770 }
4773 }
4775 /* Come here only for records and arrays. */
4778 {
4781 }
4785 }
4786 \f
4787 /* Handle initializers that use braces. */
4789 /* Type of object we are accumulating a constructor for.
4790 This type is always a RECORD_TYPE, UNION_TYPE or ARRAY_TYPE. */
4793 /* For a RECORD_TYPE or UNION_TYPE, this is the chain of fields
4794 left to fill. */
4797 /* For an ARRAY_TYPE, this is the specified index
4798 at which to store the next element we get. */
4801 /* For an ARRAY_TYPE, this is the maximum index. */
4804 /* For a RECORD_TYPE, this is the first field not yet written out. */
4807 /* For an ARRAY_TYPE, this is the index of the first element
4808 not yet written out. */
4811 /* In a RECORD_TYPE, the byte index of the next consecutive field.
4812 This is so we can generate gaps between fields, when appropriate. */
4815 /* If we are saving up the elements rather than allocating them,
4816 this is the list of elements so far (in reverse order,
4817 most recent first). */
4820 /* 1 if constructor should be incrementally stored into a constructor chain,
4821 0 if all the elements should be kept in AVL tree. */
4824 /* 1 if so far this constructor's elements are all compile-time constants. */
4827 /* 1 if so far this constructor's elements are all valid address constants. */
4830 /* 1 if this constructor is erroneous so far. */
4833 /* Structure for managing pending initializer elements, organized as an
4834 AVL tree. */
4836 struct init_node
4837 {
4841 tree purpose;
4842 tree value;
4843 };
4845 /* Tree of pending elements at this constructor level.
4846 These are elements encountered out of order
4847 which belong at places we haven't reached yet in actually
4848 writing the output.
4849 Will never hold tree nodes across GC runs. */
4852 /* The SPELLING_DEPTH of this constructor. */
4855 /* 0 if implicitly pushing constructor levels is allowed. */
4861 /* DECL node for which an initializer is being read.
4862 0 means we are reading a constructor expression
4863 such as (struct foo) {...}. */
4866 /* start_init saves the ASMSPEC arg here for really_start_incremental_init. */
4869 /* Nonzero if this is an initializer for a top-level decl. */
4872 /* Nonzero if there were any member designators in this initializer. */
4875 /* Nesting depth of designator list. */
4878 /* Nonzero if there were diagnosed errors in this designator list. */
4881 \f
4882 /* This stack has a level for each implicit or explicit level of
4883 structuring in the initializer, including the outermost one. It
4884 saves the values of most of the variables above. */
4888 struct constructor_stack
4889 {
4891 tree type;
4892 tree fields;
4893 tree index;
4894 tree max_index;
4895 tree unfilled_index;
4896 tree unfilled_fields;
4897 tree bit_index;
4898 tree elements;
4902 /* If nonzero, this value should replace the entire
4903 constructor at this level. */
4904 tree replacement_value;
4913 };
4917 /* This stack represents designators from some range designator up to
4918 the last designator in the list. */
4920 struct constructor_range_stack
4921 {
4924 tree range_start;
4925 tree index;
4926 tree range_end;
4927 tree fields;
4928 };
4932 /* This stack records separate initializers that are nested.
4933 Nested initializers can't happen in ANSI C, but GNU C allows them
4934 in cases like { ... (struct foo) { ... } ... }. */
4936 struct initializer_stack
4937 {
4939 tree decl;
4943 tree elements;
4950 };
4953 \f
4954 /* Prepare to parse and output the initializer for variable DECL. */
4956 void
4958 tree decl;
4959 tree asmspec_tree;
4961 {
4990 {
4992 require_constant_elements
4994 /* For a scalar, you can always use any value to initialize,
4995 even within braces. */
5001 }
5002 else
5003 {
5007 }
5020 }
5022 void
5024 {
5027 /* Free the whole constructor stack of this initializer. */
5029 {
5033 }
5038 /* Pop back to the data of the outer initializer (if any). */
5052 }
5053 \f
5054 /* Call here when we see the initializer is surrounded by braces.
5055 This is instead of a call to push_init_level;
5056 it is matched by a call to pop_init_level.
5058 TYPE is the type to initialize, for a constructor expression.
5059 For an initializer for a decl, TYPE is zero. */
5061 void
5063 tree type;
5064 {
5109 {
5111 /* Skip any nameless bit fields at the beginning. */
5118 }
5120 {
5122 {
5123 constructor_max_index
5126 /* Detect non-empty initializations of zero-length arrays. */
5131 /* constructor_max_index needs to be an INTEGER_CST. Attempts
5132 to initialize VLAs will cause a proper error; avoid tree
5133 checking errors as well by setting a safe value. */
5138 constructor_index
5141 }
5142 else
5146 }
5148 {
5149 /* Vectors are like simple fixed-size arrays. */
5150 constructor_max_index =
5154 }
5155 else
5156 {
5157 /* Handle the case of int x = {5}; */
5160 }
5161 }
5162 \f
5163 /* Push down into a subobject, for initialization.
5164 If this is for an explicit set of braces, IMPLICIT is 0.
5165 If it is because the next element belongs at a lower level,
5166 IMPLICIT is 1 (or 2 if the push is because of designator list). */
5168 void
5171 {
5175 /* If we've exhausted any levels that didn't have braces,
5176 pop them now. */
5178 {
5184 && constructor_max_index
5187 else
5189 }
5191 /* Unless this is an explicit brace, we need to preserve previous
5192 content if any. */
5194 {
5201 }
5234 {
5239 }
5241 /* Don't die if an entire brace-pair level is superfluous
5242 in the containing level. */
5244 ;
5247 {
5248 /* Don't die if there are extra init elts at the end. */
5251 else
5252 {
5255 constructor_depth++;
5256 }
5257 }
5259 {
5262 constructor_depth++;
5263 }
5266 {
5271 }
5274 {
5282 }
5285 {
5288 }
5292 {
5294 /* Skip any nameless bit fields at the beginning. */
5301 }
5303 {
5304 /* Vectors are like simple fixed-size arrays. */
5305 constructor_max_index =
5309 }
5311 {
5313 {
5314 constructor_max_index
5317 /* Detect non-empty initializations of zero-length arrays. */
5322 /* constructor_max_index needs to be an INTEGER_CST. Attempts
5323 to initialize VLAs will cause a proper error; avoid tree
5324 checking errors as well by setting a safe value. */
5329 constructor_index
5332 }
5333 else
5338 {
5339 /* We need to split the char/wchar array into individual
5340 characters, so that we don't have to special case it
5341 everywhere. */
5343 }
5344 }
5345 else
5346 {
5350 }
5351 }
5353 /* At the end of an implicit or explicit brace level,
5354 finish up that level of constructor.
5355 If we were outputting the elements as they are read, return 0
5356 from inner levels (process_init_element ignores that),
5357 but return error_mark_node from the outermost level
5358 (that's what we want to put in DECL_INITIAL).
5359 Otherwise, return a CONSTRUCTOR expression. */
5361 tree
5364 {
5369 {
5370 /* When we come to an explicit close brace,
5371 pop any inner levels that didn't have explicit braces. */
5377 }
5381 /* Error for initializing a flexible array member, or a zero-length
5382 array member in an inappropriate context. */
5387 {
5388 /* Silently discard empty initializations. The parser will
5389 already have pedwarned for empty brackets. */
5393 {
5399 /* We have already issued an error message for the existence
5400 of a flexible array member not at the end of the structure.
5401 Discard the initializer so that we do not abort later. */
5404 }
5405 else
5406 /* Zero-length arrays are no longer special, so we should no longer
5407 get here. */
5409 }
5411 /* Warn when some struct elements are implicitly initialized to zero. */
5413 && constructor_type
5416 {
5417 /* Do not warn for flexible array members or zero-length arrays. */
5423 /* Do not warn if this level of the initializer uses member
5424 designators; it is likely to be deliberate. */
5426 {
5430 }
5431 }
5433 /* Now output all pending elements. */
5437 /* Pad out the end of the structure. */
5439 /* If this closes a superfluous brace pair,
5440 just pass out the element between them. */
5443 ;
5448 {
5449 /* A nonincremental scalar initializer--just return
5450 the element, after verifying there is just one. */
5452 {
5456 }
5458 {
5461 }
5462 else
5464 }
5465 else
5466 {
5469 else
5470 {
5477 }
5478 }
5503 {
5507 }
5509 }
5511 /* Common handling for both array range and field name designators.
5512 ARRAY argument is nonzero for array ranges. Returns zero for success. */
5514 static int
5517 {
5518 tree subtype;
5521 /* Don't die if an entire brace-pair level is superfluous
5522 in the containing level. */
5526 /* If there were errors in this designator list already, bail out silently. */
5531 {
5535 /* Designator list starts at the level of closest explicit
5536 braces. */
5541 }
5544 {
5547 }
5551 {
5555 }
5557 {
5559 }
5560 else
5565 {
5568 }
5570 {
5573 }
5578 }
5580 /* If there are range designators in designator list, push a new designator
5581 to constructor_range_stack. RANGE_END is end of such stack range or
5582 NULL_TREE if there is no range designator at this level. */
5584 static void
5586 tree range_end;
5587 {
5602 }
5604 /* Within an array initializer, specify the next index to be initialized.
5605 FIRST is that index. If LAST is nonzero, then initialize a range
5606 of indices, running from FIRST through LAST. */
5608 void
5611 {
5641 else
5642 {
5646 {
5650 {
5653 }
5654 else
5655 {
5659 {
5662 }
5663 }
5664 }
5666 designator_depth++;
5670 }
5671 }
5673 /* Within a struct initializer, specify the next field to be initialized. */
5675 void
5677 tree fieldname;
5678 {
5679 tree tail;
5688 {
5691 }
5695 {
5698 }
5703 else
5704 {
5706 designator_depth++;
5710 }
5711 }
5712 \f
5713 /* Add a new initializer to the tree of pending initializers. PURPOSE
5714 identifies the initializer, either array index or field in a structure.
5715 VALUE is the value of that index or field. */
5717 static void
5720 {
5727 {
5729 {
5735 else
5736 {
5741 }
5742 }
5743 }
5744 else
5745 {
5746 tree bitpos;
5750 {
5756 else
5757 {
5762 }
5763 }
5764 }
5777 {
5781 {
5785 {
5787 {
5788 /* L rotation. */
5801 {
5804 else
5806 }
5807 else
5809 }
5810 else
5811 {
5812 /* LR rotation. */
5834 {
5837 else
5839 }
5840 else
5842 }
5844 }
5845 else
5846 {
5847 /* p->balance == +1; growth of left side balances the node. */
5850 }
5851 }
5853 {
5855 /* Growth propagation from right side. */
5858 {
5860 {
5861 /* R rotation. */
5874 {
5877 else
5879 }
5880 else
5882 }
5884 {
5885 /* RL rotation */
5907 {
5910 else
5912 }
5913 else
5915 }
5917 }
5918 else
5919 {
5920 /* p->balance == -1; growth of right side balances the node. */
5923 }
5924 }
5928 }
5929 }
5931 /* Build AVL tree from a sorted chain. */
5933 static void
5935 {
5936 tree chain;
5946 {
5948 /* Skip any nameless bit fields at the beginning. */
5954 }
5956 {
5958 constructor_unfilled_index
5961 else
5963 }
5965 }
5967 /* Build AVL tree from a string constant. */
5969 static void
5971 tree str;
5972 {
5987 else
5998 {
6000 {
6003 }
6004 else
6005 {
6009 {
6012 else
6017 }
6018 }
6021 {
6024 {
6026 {
6029 }
6030 }
6032 {
6035 }
6040 }
6045 }
6048 }
6050 /* Return value of FIELD in pending initializer or zero if the field was
6051 not initialized yet. */
6053 static tree
6055 tree field;
6056 {
6060 {
6067 {
6072 else
6074 }
6075 }
6077 {
6081 && (!constructor_unfilled_fields
6088 {
6093 else
6095 }
6096 }
6098 {
6102 }
6104 }
6106 /* "Output" the next constructor element.
6107 At top level, really output it to assembler code now.
6108 Otherwise, collect it in a list from which we will make a CONSTRUCTOR.
6109 TYPE is the data type that the containing data type wants here.
6110 FIELD is the field (a FIELD_DECL) or the index that this element fills.
6112 PENDING if non-nil means output pending elements that belong
6113 right after this element. (PENDING is normally 1;
6114 it is 0 while outputting pending elements, to avoid recursion.) */
6116 static void
6120 {
6122 {
6125 }
6137 {
6138 /* As an extension, allow initializing objects with static storage
6139 duration with compound literals (which are then treated just as
6140 the brace enclosed list they contain). */
6143 }
6157 {
6160 }
6165 /* If this field is empty (and not at the end of structure),
6166 don't do anything other than checking the initializer. */
6177 {
6180 }
6182 /* If this element doesn't come next in sequence,
6183 put it on constructor_pending_elts. */
6185 && (!constructor_incremental
6187 {
6194 }
6196 && (!constructor_incremental
6198 {
6199 /* We do this for records but not for unions. In a union,
6200 no matter which field is specified, it can be initialized
6201 right away since it starts at the beginning of the union. */
6203 {
6206 else
6207 {
6215 }
6216 }
6220 }
6223 {
6227 /* We can have just one union field set. */
6229 }
6231 /* Otherwise, output this element either to
6232 constructor_elements or to the assembler file. */
6236 constructor_elements
6239 /* Advance the variable that indicates sequential elements output. */
6241 constructor_unfilled_index
6243 bitsize_one_node);
6245 {
6246 constructor_unfilled_fields
6249 /* Skip any nameless bit fields. */
6253 constructor_unfilled_fields =
6255 }
6259 /* Now output any pending elements which have become next. */
6262 }
6264 /* Output any pending elements which have become next.
6265 As we output elements, constructor_unfilled_{fields,index}
6266 advances, which may cause other elements to become next;
6267 if so, they too are output.
6269 If ALL is 0, we return when there are
6270 no more pending elements to output now.
6272 If ALL is 1, we output space as necessary so that
6273 we can output all the pending elements. */
6275 static void
6278 {
6280 tree next;
6282 retry:
6284 /* Look thru the whole pending tree.
6285 If we find an element that should be output now,
6286 output it. Otherwise, set NEXT to the element
6287 that comes first among those still pending. */
6291 {
6293 {
6295 constructor_unfilled_index))
6301 {
6302 /* Advance to the next smaller node. */
6305 else
6306 {
6307 /* We have reached the smallest node bigger than the
6308 current unfilled index. Fill the space first. */
6311 }
6312 }
6313 else
6314 {
6315 /* Advance to the next bigger node. */
6318 else
6319 {
6320 /* We have reached the biggest node in a subtree. Find
6321 the parent of it, which is the next bigger node. */
6327 {
6330 }
6331 }
6332 }
6333 }
6336 {
6339 /* If the current record is complete we are done. */
6345 /* We can't compare fields here because there might be empty
6346 fields in between. */
6348 {
6352 }
6354 {
6355 /* Advance to the next smaller node. */
6358 else
6359 {
6360 /* We have reached the smallest node bigger than the
6361 current unfilled field. Fill the space first. */
6364 }
6365 }
6366 else
6367 {
6368 /* Advance to the next bigger node. */
6371 else
6372 {
6373 /* We have reached the biggest node in a subtree. Find
6374 the parent of it, which is the next bigger node. */
6381 {
6384 }
6385 }
6386 }
6387 }
6388 }
6390 /* Ordinarily return, but not if we want to output all
6391 and there are elements left. */
6395 /* If it's not incremental, just skip over the gap, so that after
6396 jumping to retry we will output the next successive element. */
6403 /* ELT now points to the node in the pending tree with the next
6404 initializer to output. */
6406 }
6407 \f
6408 /* Add one non-braced element to the current constructor level.
6409 This adjusts the current position within the constructor's type.
6410 This may also start or terminate implicit levels
6411 to handle a partly-braced initializer.
6413 Once this has found the correct level for the new element,
6414 it calls output_init_element. */
6416 void
6418 tree value;
6419 {
6426 /* Handle superfluous braces around string cst as in
6427 char x[] = {"foo"}; */
6429 && constructor_type
6433 {
6438 }
6441 {
6444 }
6446 /* Ignore elements of a brace group if it is entirely superfluous
6447 and has already been diagnosed. */
6451 /* If we've exhausted any levels that didn't have braces,
6452 pop them now. */
6454 {
6462 constructor_index)))
6464 else
6466 }
6468 /* In the case of [LO ... HI] = VALUE, only evaluate VALUE once. */
6470 {
6471 /* If value is a compound literal and we'll be just using its
6472 content, don't put it into a SAVE_EXPR. */
6474 || !require_constant_value
6477 }
6480 {
6482 {
6483 tree fieldtype;
6487 {
6490 }
6497 /* Error for non-static initialization of a flexible array member. */
6499 && !require_constant_value
6502 {
6505 }
6507 /* Accept a string constant to initialize a subarray. */
6513 /* Otherwise, if we have come to a subaggregate,
6514 and we don't have an element of its type, push into it. */
6520 {
6523 }
6526 {
6530 }
6531 else
6532 /* Do the bookkeeping for an element that was
6533 directly output as a constructor. */
6534 {
6535 /* For a record, keep track of end position of last field. */
6537 constructor_bit_index
6542 /* If the current field was the first one not yet written out,
6543 it isn't now, so update. */
6545 {
6547 /* Skip any nameless bit fields. */
6551 constructor_unfilled_fields =
6553 }
6554 }
6557 /* Skip any nameless bit fields at the beginning. */
6562 }
6564 {
6565 tree fieldtype;
6569 {
6572 }
6579 /* Warn that traditional C rejects initialization of unions.
6580 We skip the warning if the value is zero. This is done
6581 under the assumption that the zero initializer in user
6582 code appears conditioned on e.g. __STDC__ to avoid
6583 "missing initializer" warnings and relies on default
6584 initialization to zero in the traditional C case.
6585 We also skip the warning if the initializer is designated,
6586 again on the assumption that this must be conditional on
6587 __STDC__ anyway (and we've already complained about the
6588 member-designator already). */
6593 /* Accept a string constant to initialize a subarray. */
6599 /* Otherwise, if we have come to a subaggregate,
6600 and we don't have an element of its type, push into it. */
6606 {
6609 }
6612 {
6616 }
6617 else
6618 /* Do the bookkeeping for an element that was
6619 directly output as a constructor. */
6620 {
6623 }
6626 }
6628 {
6632 /* Accept a string constant to initialize a subarray. */
6638 /* Otherwise, if we have come to a subaggregate,
6639 and we don't have an element of its type, push into it. */
6645 {
6648 }
6653 {
6656 }
6658 /* Now output the actual element. */
6660 {
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. */
6691 constructor_index
6695 /* If we are doing the bookkeeping for an element that was
6696 directly output as a constructor, we must update
6697 constructor_unfilled_index. */
6699 }
6701 /* Handle the sole element allowed in a braced initializer
6702 for a scalar variable. */
6704 {
6707 }
6708 else
6709 {
6713 }
6715 /* Handle range initializers either at this level or anywhere higher
6716 in the designator stack. */
6718 {
6725 {
6729 }
6733 {
6737 }
6744 {
6748 {
6751 }
6759 }
6764 }
6767 }
6770 }
6771 \f
6772 /* Build a simple asm-statement, from one string literal. */
6773 tree
6775 tree expr;
6776 {
6783 {
6784 tree stmt;
6786 /* Simple asm statements are treated as volatile. */
6791 }
6795 }
6797 /* Build an asm-statement, whose components are a CV_QUALIFIER, a
6798 STRING, some OUTPUTS, some INPUTS, and some CLOBBERS. */
6800 tree
6802 tree cv_qualifier;
6803 tree string;
6804 tree outputs;
6805 tree inputs;
6806 tree clobbers;
6807 {
6808 tree tail;
6811 {
6814 }
6818 {
6822 }
6824 /* We can remove output conversions that change the type,
6825 but not the mode. */
6827 {
6833 /* Allow conversions as LHS here. build_modify_expr as called below
6834 will do the right thing with them. */
6845 }
6847 /* Remove output conversions that change the type but not the mode. */
6849 {
6853 }
6855 /* Perform default conversions on array and function inputs.
6856 Don't do this for other types as it would screw up operands
6857 expected to be in memory. */
6863 }
6865 /* Expand an ASM statement with operands, handling output operands
6866 that are not variables or INDIRECT_REFS by transforming such
6867 cases into cases that expand_asm_operands can handle.
6869 Arguments are same as for expand_asm_operands. */
6871 void
6877 {
6880 /* o[I] is the place that output number I should be written. */
6882 tree tail;
6884 /* Record the contents of OUTPUTS before it is modified. */
6886 {
6890 }
6892 /* Generate the ASM_OPERANDS insn; store into the TREE_VALUEs of
6893 OUTPUTS some trees for where the values were actually stored. */
6896 /* Copy all the intermediate outputs into the specified outputs. */
6898 {
6900 {
6905 /* Restore the original value so that it's correct the next
6906 time we expand this function. */
6908 }
6909 /* Detect modification of read-only values.
6910 (Otherwise done by build_modify_expr.) */
6911 else
6912 {
6920 }
6921 }
6923 /* Those MODIFY_EXPRs could do autoincrements. */
6925 }
6926 \f
6927 /* Expand a C `return' statement.
6928 RETVAL is the expression for what to return,
6929 or a null pointer for `return;' with no value. */
6931 tree
6933 tree retval;
6934 {
6941 {
6946 }
6948 {
6952 }
6953 else
6954 {
6958 tree inner;
6966 /* Strip any conversions, additions, and subtractions, and see if
6967 we are returning the address of a local variable. Warn if so. */
6969 {
6971 {
6978 /* If the second operand of the MINUS_EXPR has a pointer
6979 type (or is converted from it), this may be valid, so
6980 don't give a warning. */
6981 {
6995 }
7012 }
7015 }
7018 }
7021 }
7022 \f
7024 /* The SWITCH_STMT being built. */
7025 tree switch_stmt;
7026 /* A splay-tree mapping the low element of a case range to the high
7027 element, or NULL_TREE if there is no high element. Used to
7028 determine whether or not a new case label duplicates an old case
7029 label. We need a tree, rather than simply a hash table, because
7030 of the GNU case range extension. */
7031 splay_tree cases;
7032 /* The next node on the stack. */
7034 };
7036 /* A stack of the currently active switch statements. The innermost
7037 switch statement is on the top of the stack. There is no need to
7038 mark the stack for garbage collection because it is only active
7039 during the processing of the body of a function, and we never
7040 collect at that point. */
7044 /* Start a C switch statement, testing expression EXP. Return the new
7045 SWITCH_STMT. */
7047 tree
7049 tree exp;
7050 {
7056 {
7062 {
7065 }
7066 else
7067 {
7077 }
7078 }
7080 /* Add this new SWITCH_STMT to the stack. */
7088 }
7090 /* Process a case label. */
7092 tree
7094 tree low_value;
7095 tree high_value;
7096 {
7100 {
7109 {
7110 /* Attach the first case label to the SWITCH_BODY. */
7113 }
7114 }
7117 else
7121 }
7123 /* Finish the switch statement. */
7125 void
7127 {
7130 /* Rechain the next statements to the SWITCH_STMT. */
7133 /* Pop the stack. */
7137 }