| blob | 1772557449c4ffb400faaa3a1bb27ab25b82ebfa |
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 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). */
46 /* Nonzero if we've already printed a "missing braces around initializer"
47 message within this initializer. */
50 /* 1 if we explained undeclared var errors. */
85 \f
86 /* Do `exp = require_complete_type (exp);' to make sure exp
87 does not have an incomplete type. (That includes void types.) */
89 tree
91 tree value;
92 {
98 /* First, detect a valid value with a complete type. */
104 }
106 /* Print an error message for invalid use of an incomplete type.
107 VALUE is the expression that was used (or 0 if that isn't known)
108 and TYPE is the type that was invalid. */
110 void
112 tree value;
113 tree type;
114 {
117 /* Avoid duplicate error message. */
125 else
126 {
127 retry:
128 /* We must print an error message. Be clever about what it says. */
131 {
150 {
152 {
155 }
158 }
164 }
169 else
170 /* If this type has a typedef-name, the TYPE_NAME is a TYPE_DECL. */
173 }
174 }
176 /* Return a variant of TYPE which has all the type qualifiers of LIKE
177 as well as those of TYPE. */
179 static tree
182 {
185 }
186 \f
187 /* Return the common type of two types.
188 We assume that comptypes has already been done and returned 1;
189 if that isn't so, this may crash. In particular, we assume that qualifiers
190 match.
192 This is the type for the result of most arithmetic operations
193 if the operands have the given two types. */
195 tree
198 {
201 tree attributes;
203 /* Save time if the two types are the same. */
207 /* If one type is nonsense, use the other. */
213 /* Merge the attributes. */
216 /* Treat an enum type as the unsigned integer type of the same width. */
226 /* If one type is complex, form the common type of the non-complex
227 components, then make that complex. Use T1 or T2 if it is the
228 required type. */
230 {
239 else
241 attributes);
242 }
245 {
248 /* If only one is real, use it as the result. */
256 /* Both real or both integers; use the one with greater precision. */
263 /* Same precision. Prefer longs to ints even when same size. */
268 attributes);
272 {
273 /* But preserve unsignedness from the other type,
274 since long cannot hold all the values of an unsigned int. */
277 else
280 }
282 /* Likewise, prefer long double to double even if same size. */
286 attributes);
288 /* Otherwise prefer the unsigned one. */
292 else
296 /* For two pointers, do this recursively on the target type,
297 and combine the qualifiers of the two types' targets. */
298 /* This code was turned off; I don't know why.
299 But ANSI C specifies doing this with the qualifiers.
300 So I turned it on again. */
301 {
311 }
312 #if 0
315 #endif
318 {
320 /* Save space: see if the result is identical to one of the args. */
325 /* Merge the element types, and have a size if either arg has one. */
328 }
331 /* Function types: prefer the one that specified arg types.
332 If both do, merge the arg types. Also merge the return types. */
333 {
341 /* Save space: see if the result is identical to one of the args. */
347 /* Simple way if one arg fails to specify argument types. */
349 {
352 }
354 {
357 }
359 /* If both args specify argument types, we must merge the two
360 lists, argument by argument. */
375 {
376 /* A null type means arg type is not specified.
377 Take whatever the other function type has. */
379 {
382 }
384 {
387 }
389 /* Given wait (union {union wait *u; int *i} *)
390 and wait (union wait *),
391 prefer union wait * as type of parm. */
394 {
395 tree memb;
399 {
404 }
405 }
408 {
409 tree memb;
413 {
418 }
419 }
421 parm_done: ;
422 }
427 /* ... falls through ... */
428 }
432 }
434 }
435 \f
436 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
437 or various other operations. Return 2 if they are compatible
438 but a warning may be needed if you use them together. */
440 int
443 {
448 /* Suppress errors caused by previously reported errors. */
454 /* If either type is the internal version of sizetype, return the
455 language version. */
464 /* Treat an enum type as the integer type of the same width and
465 signedness. */
475 /* Different classes of types can't be compatible. */
479 /* Qualifiers must match. */
484 /* Allow for two different type nodes which have essentially the same
485 definition. Note that we already checked for equality of the type
486 qualifiers (just above). */
491 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
495 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
499 {
510 {
517 /* Target types must match incl. qualifiers. */
522 /* Sizes must match unless one is missing or variable. */
529 d1_variable = (! d1_zero
532 d2_variable = (! d2_zero
546 }
555 }
557 }
559 /* Return 1 if TTL and TTR are pointers to types that are equivalent,
560 ignoring their qualifiers. */
562 static int
565 {
568 /* Give maybe_objc_comptypes a crack at letting these types through. */
578 }
579 \f
580 /* Subroutines of `comptypes'. */
582 /* Return 1 if two function types F1 and F2 are compatible.
583 If either type specifies no argument types,
584 the other must specify a fixed number of self-promoting arg types.
585 Otherwise, if one type specifies only the number of arguments,
586 the other must specify that number of self-promoting arg types.
587 Otherwise, the argument types must match. */
589 static int
592 {
594 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
605 /* An unspecified parmlist matches any specified parmlist
606 whose argument types don't need default promotions. */
609 {
612 /* If one of these types comes from a non-prototype fn definition,
613 compare that with the other type's arglist.
614 If they don't match, ask for a warning (but no error). */
619 }
621 {
628 }
630 /* Both types have argument lists: compare them and propagate results. */
633 }
635 /* Check two lists of types for compatibility,
636 returning 0 for incompatible, 1 for compatible,
637 or 2 for compatible with warning. */
639 static int
642 {
643 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
648 {
651 /* If one list is shorter than the other,
652 they fail to match. */
655 /* A null pointer instead of a type
656 means there is supposed to be an argument
657 but nothing is specified about what type it has.
658 So match anything that self-promotes. */
660 {
663 }
665 {
668 }
671 {
672 /* Allow wait (union {union wait *u; int *i} *)
673 and wait (union wait *) to be compatible. */
680 {
681 tree memb;
688 }
695 {
696 tree memb;
703 }
704 else
706 }
708 /* comptypes said ok, but record if it said to warn. */
714 }
715 }
716 \f
717 /* Compute the value of the `sizeof' operator. */
719 tree
721 tree type;
722 {
724 tree size;
727 {
731 }
733 {
737 }
741 {
744 }
745 else
746 /* Convert in case a char is more than one unit. */
751 /* SIZE will have an integer type with TYPE_IS_SIZETYPE set.
752 TYPE_IS_SIZETYPE means that certain things (like overflow) will
753 never happen. However, this node should really have type
754 `size_t', which is just a typedef for an ordinary integer type. */
756 }
758 tree
760 tree type;
761 {
763 tree size;
769 else
770 /* Convert in case a char is more than one unit. */
775 /* SIZE will have an integer type with TYPE_IS_SIZETYPE set.
776 TYPE_IS_SIZETYPE means that certain things (like overflow) will
777 never happen. However, this node should really have type
778 `size_t', which is just a typedef for an ordinary integer type. */
780 }
782 /* Compute the size to increment a pointer by. */
784 tree
786 tree type;
787 {
794 {
797 }
799 /* Convert in case a char is more than one unit. */
803 }
804 \f
805 /* Return either DECL or its known constant value (if it has one). */
807 tree
809 tree decl;
810 {
812 in a place where a variable is invalid. */
818 /* This is invalid if initial value is not constant.
819 If it has either a function call, a memory reference,
820 or a variable, then re-evaluating it could give different results. */
822 /* Check for cases where this is sub-optimal, even though valid. */
826 }
828 /* Return either DECL or its known constant value (if it has one), but
829 return DECL if pedantic or DECL has mode BLKmode. This is for
830 bug-compatibility with the old behavior of decl_constant_value
831 (before GCC 3.0); every use of this function is a bug and it should
832 be removed before GCC 3.1. It is not appropriate to use pedantic
833 in a way that affects optimization, and BLKmode is probably not the
834 right test for avoiding misoptimizations either. */
836 static tree
838 tree decl;
839 {
842 else
844 }
847 /* Perform the default conversion of arrays and functions to pointers.
848 Return the result of converting EXP. For any other expression, just
849 return EXP. */
851 static tree
853 tree exp;
854 {
855 tree orig_exp;
860 /* Strip NON_LVALUE_EXPRs and no-op conversions, since we aren't using as
861 an lvalue.
863 Do not use STRIP_NOPS here! It will remove conversions from pointer
864 to integer and cause infinite recursion. */
869 {
873 }
875 /* Preserve the original expression code. */
880 {
882 }
884 {
885 tree adr;
887 tree ptrtype;
893 {
896 }
899 restype
910 {
914 }
918 {
919 /* Before C99, non-lvalue arrays do not decay to pointers.
920 Normally, using such an array would be invalid; but it can
921 be used correctly inside sizeof or as a statement expression.
922 Thus, do not give an error here; an error will result later. */
924 }
929 {
930 /* ??? This is not really quite correct
931 in that the type of the operand of ADDR_EXPR
932 is not the target type of the type of the ADDR_EXPR itself.
933 Question is, can this lossage be avoided? */
940 }
941 /* This way is better for a COMPONENT_REF since it can
942 simplify the offset for a component. */
945 }
947 }
949 /* Perform default promotions for C data used in expressions.
950 Arrays and functions are converted to pointers;
951 enumeral types or short or char, to int.
952 In addition, manifest constants symbols are replaced by their values. */
954 tree
956 tree exp;
957 {
958 tree orig_exp;
965 /* Constants can be used directly unless they're not loadable. */
969 /* Replace a nonvolatile const static variable with its value unless
970 it is an array, in which case we must be sure that taking the
971 address of the array produces consistent results. */
973 {
976 }
978 /* Strip NON_LVALUE_EXPRs and no-op conversions, since we aren't using as
979 an lvalue.
981 Do not use STRIP_NOPS here! It will remove conversions from pointer
982 to integer and cause infinite recursion. */
989 /* Preserve the original expression code. */
993 /* Normally convert enums to int,
994 but convert wide enums to something wider. */
996 {
1004 }
1008 /* If it's thinner than an int, promote it like a
1009 c_promoting_integer_type_p, otherwise leave it alone. */
1015 {
1016 /* Preserve unsignedness if not really getting any wider. */
1022 }
1025 {
1028 }
1030 }
1031 \f
1032 /* Look up COMPONENT in a structure or union DECL.
1034 If the component name is not found, returns NULL_TREE. Otherwise,
1035 the return value is a TREE_LIST, with each TREE_VALUE a FIELD_DECL
1036 stepping down the chain to the component, which is in the last
1037 TREE_VALUE of the list. Normally the list is of length one, but if
1038 the component is embedded within (nested) anonymous structures or
1039 unions, the list steps down the chain to the component. */
1041 static tree
1044 {
1046 tree field;
1048 /* If TYPE_LANG_SPECIFIC is set, then it is a sorted array of pointers
1049 to the field elements. Use a binary search on this array to quickly
1050 find the element. Otherwise, do a linear search. TYPE_LANG_SPECIFIC
1051 will always be set for structures which have many elements. */
1054 {
1062 {
1067 {
1068 /* Step through all anon unions in linear fashion. */
1070 {
1074 {
1079 }
1080 }
1082 /* Entire record is only anon unions. */
1086 /* Restart the binary search, with new lower bound. */
1088 }
1094 else
1096 }
1102 }
1103 else
1104 {
1106 {
1110 {
1115 }
1119 }
1123 }
1126 }
1128 /* Make an expression to refer to the COMPONENT field of
1129 structure or union value DATUM. COMPONENT is an IDENTIFIER_NODE. */
1131 tree
1134 {
1138 tree ref;
1140 /* If DATUM is a COMPOUND_EXPR, move our reference inside it.
1141 If pedantic ensure that the arguments are not lvalues; otherwise,
1142 if the component is an array, it would wrongly decay to a pointer in
1143 C89 mode.
1144 We cannot do this with a COND_EXPR, because in a conditional expression
1145 the default promotions are applied to both sides, and this would yield
1146 the wrong type of the result; for example, if the components have
1147 type "char". */
1149 {
1151 {
1155 }
1158 }
1160 /* See if there is a field or component with name COMPONENT. */
1163 {
1165 {
1168 }
1173 {
1178 }
1180 /* Chain the COMPONENT_REFs if necessary down to the FIELD.
1181 This might be better solved in future the way the C++ front
1182 end does it - by giving the anonymous entities each a
1183 separate name and type, and then have build_component_ref
1184 recursively call itself. We can't do that here. */
1186 {
1202 }
1205 }
1211 }
1212 \f
1213 /* Given an expression PTR for a pointer, return an expression
1214 for the value pointed to.
1215 ERRORSTRING is the name of the operator to appear in error messages. */
1217 tree
1219 tree ptr;
1221 {
1226 {
1228 && !flag_volatile
1232 else
1233 {
1238 {
1241 }
1245 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
1246 so that we get the proper error message if the result is used
1247 to assign to. Also, &* is supposed to be a no-op.
1248 And ANSI C seems to specify that the type of the result
1249 should be the const type. */
1250 /* A de-reference of a pointer to const is not a const. It is valid
1251 to change it via some other pointer. */
1257 }
1258 }
1262 }
1264 /* This handles expressions of the form "a[i]", which denotes
1265 an array reference.
1267 This is logically equivalent in C to *(a+i), but we may do it differently.
1268 If A is a variable or a member, we generate a primitive ARRAY_REF.
1269 This avoids forcing the array out of registers, and can work on
1270 arrays that are not lvalues (for example, members of structures returned
1271 by functions). */
1273 tree
1276 {
1278 {
1281 }
1289 {
1292 /* Subscripting with type char is likely to lose
1293 on a machine where chars are signed.
1294 So warn on any machine, but optionally.
1295 Don't warn for unsigned char since that type is safe.
1296 Don't warn for signed char because anyone who uses that
1297 must have done so deliberately. */
1302 /* Apply default promotions *after* noticing character types. */
1305 /* Require integer *after* promotion, for sake of enums. */
1307 {
1310 }
1312 /* An array that is indexed by a non-constant
1313 cannot be stored in a register; we must be able to do
1314 address arithmetic on its address.
1315 Likewise an array of elements of variable size. */
1319 {
1322 }
1323 /* An array that is indexed by a constant value which is not within
1324 the array bounds cannot be stored in a register either; because we
1325 would get a crash in store_bit_field/extract_bit_field when trying
1326 to access a non-existent part of the register. */
1330 {
1333 }
1336 {
1344 }
1348 /* Array ref is const/volatile if the array elements are
1349 or if the array is. */
1358 /* This was added by rms on 16 Nov 91.
1359 It fixes vol struct foo *a; a->elts[1]
1360 in an inline function.
1361 Hope it doesn't break something else. */
1364 }
1366 {
1370 /* Do the same warning check as above, but only on the part that's
1371 syntactically the index and only if it is also semantically
1372 the index. */
1378 /* Put the integer in IND to simplify error checking. */
1380 {
1384 }
1391 {
1394 }
1396 {
1399 }
1403 }
1404 }
1405 \f
1406 /* Build an external reference to identifier ID. FUN indicates
1407 whether this will be used for a function call. */
1408 tree
1410 tree id;
1412 {
1413 tree ref;
1421 {
1425 {
1427 /* Ordinary implicit function declaration. */
1429 else
1430 {
1431 /* Implicit declaration of built-in function. Don't
1432 change the built-in declaration, but don't let this
1433 go by silently, either. */
1436 /* only issue this warning once */
1439 }
1440 }
1441 else
1442 {
1443 /* Reference to undeclared variable, including reference to
1444 builtin outside of function-call context. */
1448 else
1449 {
1452 {
1457 {
1461 }
1462 }
1465 }
1467 }
1468 }
1469 else
1470 {
1471 /* Properly declared variable or function reference. */
1475 {
1479 }
1480 else
1482 }
1491 {
1494 }
1497 }
1499 /* Build a function call to function FUNCTION with parameters PARAMS.
1500 PARAMS is a list--a chain of TREE_LIST nodes--in which the
1501 TREE_VALUE of each node is a parameter-expression.
1502 FUNCTION's data type may be a function type or a pointer-to-function. */
1504 tree
1507 {
1509 tree coerced_params;
1512 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
1515 /* Convert anything with function type to a pointer-to-function. */
1517 {
1521 /* Differs from default_conversion by not setting TREE_ADDRESSABLE
1522 (because calling an inline function does not mean the function
1523 needs to be separately compiled). */
1529 }
1530 else
1540 {
1543 }
1548 /* fntype now gets the type of function pointed to. */
1551 /* Convert the parameters to the types declared in the
1552 function prototype, or apply default promotions. */
1554 coerced_params
1557 /* Check for errors in format strings. */
1562 /* Recognize certain built-in functions so we can make tree-codes
1563 other than CALL_EXPR. We do this when it enables fold-const.c
1564 to do something useful. */
1569 {
1574 }
1584 }
1585 \f
1586 /* Convert the argument expressions in the list VALUES
1587 to the types in the list TYPELIST. The result is a list of converted
1588 argument expressions.
1590 If TYPELIST is exhausted, or when an element has NULL as its type,
1591 perform the default conversions.
1593 PARMLIST is the chain of parm decls for the function being called.
1594 It may be 0, if that info is not available.
1595 It is used only for generating error messages.
1597 NAME is an IDENTIFIER_NODE or 0. It is used only for error messages.
1599 This is also where warnings about wrong number of args are generated.
1601 Both VALUES and the returned value are chains of TREE_LIST nodes
1602 with the elements of the list in the TREE_VALUE slots of those nodes. */
1604 static tree
1607 {
1612 /* Scan the given expressions and types, producing individual
1613 converted arguments and pushing them on RESULT in reverse order. */
1616 valtail;
1618 {
1623 {
1627 else
1630 }
1632 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
1633 /* Do not use STRIP_NOPS here! We do not want an enumerator with value 0
1634 to convert automatically to a pointer. */
1643 {
1644 /* Formal parm type is specified by a function prototype. */
1645 tree parmval;
1648 {
1651 }
1652 else
1653 {
1654 /* Optionally warn about conversions that
1655 differ from the default conversions. */
1657 {
1662 warn_for_assignment ("%s as integer rather than floating due to prototype", (char *) 0, name, parmnum + 1);
1665 warn_for_assignment ("%s as integer rather than complex due to prototype", (char *) 0, name, parmnum + 1);
1668 warn_for_assignment ("%s as complex rather than floating due to prototype", (char *) 0, name, parmnum + 1);
1671 warn_for_assignment ("%s as floating rather than integer due to prototype", (char *) 0, name, parmnum + 1);
1674 warn_for_assignment ("%s as complex rather than integer due to prototype", (char *) 0, name, parmnum + 1);
1677 warn_for_assignment ("%s as floating rather than complex due to prototype", (char *) 0, name, parmnum + 1);
1678 /* ??? At some point, messages should be written about
1679 conversions between complex types, but that's too messy
1680 to do now. */
1683 {
1684 /* Warn if any argument is passed as `float',
1685 since without a prototype it would be `double'. */
1687 warn_for_assignment ("%s as `float' rather than `double' due to prototype", (char *) 0, name, parmnum + 1);
1688 }
1689 /* Detect integer changing in width or signedness.
1690 These warnings are only activated with
1691 -Wconversion, not with -Wtraditional. */
1694 {
1701 /* No warning if function asks for enum
1702 and the actual arg is that enum type. */
1703 ;
1705 warn_for_assignment ("%s with different width due to prototype", (char *) 0, name, parmnum + 1);
1707 ;
1708 /* Don't complain if the formal parameter type
1709 is an enum, because we can't tell now whether
1710 the value was an enum--even the same enum. */
1712 ;
1715 /* Change in signedness doesn't matter
1716 if a constant value is unaffected. */
1717 ;
1718 /* Likewise for a constant in a NOP_EXPR. */
1722 ;
1727 /* Change in signedness doesn't matter
1728 if an enum value is unaffected. */
1729 ;
1730 #endif
1731 /* If the value is extended from a narrower
1732 unsigned type, it doesn't matter whether we
1733 pass it as signed or unsigned; the value
1734 certainly is the same either way. */
1737 ;
1740 else
1742 }
1743 }
1753 }
1755 }
1759 /* Convert `float' to `double'. */
1761 else
1762 /* Convert `short' and `char' to full-size `int'. */
1767 }
1770 {
1774 else
1776 }
1779 }
1780 \f
1781 /* This is the entry point used by the parser
1782 for binary operators in the input.
1783 In addition to constructing the expression,
1784 we check for operands that were written with other binary operators
1785 in a way that is likely to confuse the user. */
1787 tree
1791 {
1808 /* Check for cases such as x+y<<z which users are likely
1809 to misinterpret. If parens are used, C_EXP_ORIGINAL_CODE
1810 is cleared to prevent these warnings. */
1812 {
1814 {
1818 }
1821 {
1825 }
1828 {
1834 /* Check cases like x|y==z */
1837 }
1840 {
1846 /* Check cases like x^y==z */
1849 }
1852 {
1856 /* Check cases like x&y==z */
1859 }
1860 }
1862 /* Similarly, check for cases like 1<=i<=10 that are probably errors. */
1873 /* Record the code that was specified in the source,
1874 for the sake of warnings about confusing nesting. */
1877 else
1878 {
1880 /* We used to use NOP_EXPR rather than NON_LVALUE_EXPR
1881 so that convert_for_assignment wouldn't strip it.
1882 That way, we got warnings for things like p = (1 - 1).
1883 But it turns out we should not get those warnings. */
1887 }
1890 }
1892 /* Build a binary-operation expression without default conversions.
1893 CODE is the kind of expression to build.
1894 This function differs from `build' in several ways:
1895 the data type of the result is computed and recorded in it,
1896 warnings are generated if arg data types are invalid,
1897 special handling for addition and subtraction of pointers is known,
1898 and some optimization is done (operations on narrow ints
1899 are done in the narrower type when that gives the same result).
1900 Constant folding is also done before the result is returned.
1902 Note that the operands will never have enumeral types, or function
1903 or array types, because either they will have the default conversions
1904 performed or they have both just been converted to some other type in which
1905 the arithmetic is to be done. */
1907 tree
1912 {
1917 /* Expression code to give to the expression when it is built.
1918 Normally this is CODE, which is what the caller asked for,
1919 but in some special cases we change it. */
1922 /* Data type in which the computation is to be performed.
1923 In the simplest cases this is the common type of the arguments. */
1926 /* Nonzero means operands have already been type-converted
1927 in whatever way is necessary.
1928 Zero means they need to be converted to RESULT_TYPE. */
1931 /* Nonzero means create the expression with this type, rather than
1932 RESULT_TYPE. */
1935 /* Nonzero means after finally constructing the expression
1936 convert it to this type. */
1939 /* Nonzero if this is an operation like MIN or MAX which can
1940 safely be computed in short if both args are promoted shorts.
1941 Also implies COMMON.
1942 -1 indicates a bitwise operation; this makes a difference
1943 in the exact conditions for when it is safe to do the operation
1944 in a narrower mode. */
1947 /* Nonzero if this is a comparison operation;
1948 if both args are promoted shorts, compare the original shorts.
1949 Also implies COMMON. */
1952 /* Nonzero if this is a right-shift operation, which can be computed on the
1953 original short and then promoted if the operand is a promoted short. */
1956 /* Nonzero means set RESULT_TYPE to the common type of the args. */
1960 {
1963 }
1964 else
1965 {
1968 }
1973 /* The expression codes of the data types of the arguments tell us
1974 whether the arguments are integers, floating, pointers, etc. */
1978 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
1982 /* If an error was already reported for one of the arguments,
1983 avoid reporting another error. */
1989 {
1991 /* Handle the pointer + int case. */
1996 else
2001 /* Subtraction of two similar pointers.
2002 We must subtract them as integers, then divide by object size. */
2006 /* Handle pointer minus int. Just like pointer plus int. */
2009 else
2022 /* Floating point division by zero is a legitimate way to obtain
2023 infinities and NaNs. */
2031 {
2034 else
2035 /* Although it would be tempting to shorten always here, that
2036 loses on some targets, since the modulo instruction is
2037 undefined if the quotient can't be represented in the
2038 computation mode. We shorten only if unsigned or if
2039 dividing by something we know != -1. */
2044 }
2061 {
2062 /* Although it would be tempting to shorten always here, that loses
2063 on some targets, since the modulo instruction is undefined if the
2064 quotient can't be represented in the computation mode. We shorten
2065 only if unsigned or if dividing by something we know != -1. */
2070 }
2082 {
2083 /* Result of these operations is always an int,
2084 but that does not mean the operands should be
2085 converted to ints! */
2090 }
2093 /* Shift operations: result has same type as first operand;
2094 always convert second operand to int.
2095 Also set SHORT_SHIFT if shifting rightward. */
2099 {
2101 {
2104 else
2105 {
2111 }
2112 }
2114 /* Use the type of the value to be shifted. */
2116 /* Convert the shift-count to an integer, regardless of size
2117 of value being shifted. */
2120 /* Avoid converting op1 to result_type later. */
2122 }
2127 {
2129 {
2135 }
2137 /* Use the type of the value to be shifted. */
2139 /* Convert the shift-count to an integer, regardless of size
2140 of value being shifted. */
2143 /* Avoid converting op1 to result_type later. */
2145 }
2151 {
2153 {
2158 }
2160 /* Use the type of the value to be shifted. */
2162 /* Convert the shift-count to an integer, regardless of size
2163 of value being shifted. */
2166 /* Avoid converting op1 to result_type later. */
2168 }
2175 /* Result of comparison is always int,
2176 but don't convert the args to int! */
2184 {
2187 /* Anything compares with void *. void * compares with anything.
2188 Otherwise, the targets must be compatible
2189 and both must be object or both incomplete. */
2193 {
2194 /* op0 != orig_op0 detects the case of something
2195 whose value is 0 but which isn't a valid null ptr const. */
2199 }
2201 {
2205 }
2206 else
2211 }
2219 {
2222 }
2224 {
2227 }
2236 {
2238 {
2243 }
2244 else
2245 {
2248 }
2249 }
2261 {
2263 {
2271 }
2272 else
2273 {
2276 }
2277 }
2280 {
2284 }
2287 {
2291 }
2293 {
2296 }
2298 {
2301 }
2313 {
2316 }
2322 }
2325 &&
2327 {
2333 /* For certain operations (which identify themselves by shorten != 0)
2334 if both args were extended from the same smaller type,
2335 do the arithmetic in that type and then extend.
2337 shorten !=0 and !=1 indicates a bitwise operation.
2338 For them, this optimization is safe only if
2339 both args are zero-extended or both are sign-extended.
2340 Otherwise, we might change the result.
2341 Eg, (short)-1 | (unsigned short)-1 is (int)-1
2342 but calculated in (unsigned short) it would be (unsigned short)-1. */
2345 {
2349 /* UNS is 1 if the operation to be done is an unsigned one. */
2351 tree type;
2355 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
2356 but it *requires* conversion to FINAL_TYPE. */
2367 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
2369 /* For bitwise operations, signedness of nominal type
2370 does not matter. Consider only how operands were extended. */
2374 /* Note that in all three cases below we refrain from optimizing
2375 an unsigned operation on sign-extended args.
2376 That would not be valid. */
2378 /* Both args variable: if both extended in same way
2379 from same width, do it in that width.
2380 Do it unsigned if args were zero-extended. */
2387 result_type
2406 }
2408 /* Shifts can be shortened if shifting right. */
2411 {
2421 /* We can shorten only if the shift count is less than the
2422 number of bits in the smaller type size. */
2424 /* We cannot drop an unsigned shift after sign-extension. */
2426 {
2427 /* Do an unsigned shift if the operand was zero-extended. */
2428 result_type
2430 /* Convert value-to-be-shifted to that type. */
2434 }
2435 }
2437 /* Comparison operations are shortened too but differently.
2438 They identify themselves by setting short_compare = 1. */
2441 {
2442 /* Don't write &op0, etc., because that would prevent op0
2443 from being kept in a register.
2444 Instead, make copies of the our local variables and
2445 pass the copies by reference, then copy them back afterward. */
2448 tree val
2460 {
2472 /* Give warnings for comparisons between signed and unsigned
2473 quantities that may fail.
2475 Do the checking based on the original operand trees, so that
2476 casts will be considered, but default promotions won't be.
2478 Do not warn if the comparison is being done in a signed type,
2479 since the signed type will only be chosen if it can represent
2480 all the values of the unsigned type. */
2483 /* Do not warn if both operands are the same signedness. */
2486 else
2487 {
2492 else
2495 /* Do not warn if the signed quantity is an
2496 unsuffixed integer literal (or some static
2497 constant expression involving such literals or a
2498 conditional expression involving such literals)
2499 and it is non-negative. */
2502 /* Do not warn if the comparison is an equality operation,
2503 the unsigned quantity is an integral constant, and it
2504 would fit in the result if the result were signed. */
2509 /* Do not warn if the unsigned quantity is an enumeration
2510 constant and its maximum value would fit in the result
2511 if the result were signed. */
2517 else
2519 }
2521 /* Warn if two unsigned values are being compared in a size
2522 larger than their original size, and one (and only one) is the
2523 result of a `~' operator. This comparison will always fail.
2525 Also warn if one operand is a constant, and the constant
2526 does not have all bits set that are set in the ~ operand
2527 when it is extended. */
2531 {
2535 else
2540 {
2541 tree primop;
2546 {
2550 }
2551 else
2552 {
2556 }
2561 {
2565 }
2566 }
2573 }
2574 }
2575 }
2576 }
2578 /* At this point, RESULT_TYPE must be nonzero to avoid an error message.
2579 If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
2580 Then the expression will be built.
2581 It will be given type FINAL_TYPE if that is nonzero;
2582 otherwise, it will be given type RESULT_TYPE. */
2585 {
2588 }
2591 {
2596 }
2601 {
2603 tree folded;
2611 }
2612 }
2613 \f
2614 /* Return a tree for the difference of pointers OP0 and OP1.
2615 The resulting tree has type int. */
2617 static tree
2620 {
2629 {
2634 }
2636 /* If the conversion to ptrdiff_type does anything like widening or
2637 converting a partial to an integral mode, we get a convert_expression
2638 that is in the way to do any simplifications.
2639 (fold-const.c doesn't know that the extra bits won't be needed.
2640 split_tree uses STRIP_SIGN_NOPS, which leaves conversions to a
2641 different mode in place.)
2642 So first try to find a common term here 'by hand'; we want to cover
2643 at least the cases that occur in legal static initializers. */
2648 {
2651 }
2652 else
2656 {
2659 }
2660 else
2664 {
2667 }
2670 /* First do the subtraction as integers;
2671 then drop through to build the divide operator.
2672 Do not do default conversions on the minus operator
2673 in case restype is a short type. */
2677 /* This generates an error if op1 is pointer to incomplete type. */
2681 /* This generates an error if op0 is pointer to incomplete type. */
2684 /* Divide by the size, in easiest possible way. */
2692 }
2693 \f
2694 /* Construct and perhaps optimize a tree representation
2695 for a unary operation. CODE, a tree_code, specifies the operation
2696 and XARG is the operand.
2697 For any CODE other than ADDR_EXPR, FLAG nonzero suppresses
2698 the default promotions (such as from short to int).
2699 For ADDR_EXPR, the default promotions are not applied; FLAG nonzero
2700 allows non-lvalues; this is only used to handle conversion of non-lvalue
2701 arrays to pointers in C99. */
2703 tree
2706 tree xarg;
2708 {
2709 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
2713 tree val;
2722 {
2724 /* This is used for unary plus, because a CONVERT_EXPR
2725 is enough to prevent anybody from looking inside for
2726 associativity, but won't generate any code. */
2729 {
2732 }
2740 {
2743 }
2750 {
2756 }
2758 {
2761 }
2769 {
2772 }
2778 /* Conjugating a real value is a no-op, but allow it anyway. */
2781 {
2784 }
2793 /* These will convert to a pointer. */
2795 {
2798 }
2810 else
2818 else
2825 /* Handle complex lvalues (when permitted)
2826 by reduction to simpler cases. */
2832 /* Increment or decrement the real part of the value,
2833 and don't change the imaginary part. */
2835 {
2846 }
2848 /* Report invalid types. */
2852 {
2855 else
2859 }
2861 {
2862 tree inc;
2868 /* Compute the increment. */
2871 {
2872 /* If pointer target is an undefined struct,
2873 we just cannot know how to do the arithmetic. */
2875 {
2878 else
2880 }
2884 {
2887 else
2889 }
2892 }
2893 else
2898 /* Handle incrementing a cast-expression. */
2902 {
2911 /* If the real type has the same machine representation
2912 as the type it is cast to, we can make better output
2913 by adding directly to the inside of the cast. */
2919 else
2920 {
2924 else
2925 {
2929 else
2938 }
2941 }
2946 }
2947 give_up:
2949 /* Complain about anything else that is not a true lvalue. */
2956 /* Report a read-only lvalue. */
2965 else
2972 }
2975 /* Note that this operation never does default_conversion. */
2977 /* Let &* cancel out to simplify resulting code. */
2979 {
2980 /* Don't let this be an lvalue. */
2984 }
2986 /* For &x[y], return x+y */
2988 {
2993 }
2995 /* Handle complex lvalues (when permitted)
2996 by reduction to simpler cases. */
3002 float f; *&(int)f = 3.4 stores in int format
3003 whereas (int)f = 3.4 stores in float format. */
3004 /* Address of a cast is just a cast of the address
3005 of the operand of the cast. */
3007 {
3020 }
3021 #endif
3023 /* Anything not already handled and not a true memory reference
3024 or a non-lvalue array is an error. */
3029 /* Ordinary case; arg is a COMPONENT_REF or a decl. */
3032 /* If the lvalue is const or volatile, merge that into the type
3033 to which the address will point. Note that you can't get a
3034 restricted pointer by taking the address of something, so we
3035 only have to deal with `const' and `volatile' here. */
3047 {
3048 tree addr;
3051 {
3057 {
3061 }
3066 }
3067 else
3070 /* Address of a static or external variable or
3071 file-scope function counts as a constant. */
3077 }
3081 }
3086 }
3088 #if 0
3089 /* If CONVERSIONS is a conversion expression or a nested sequence of such,
3090 convert ARG with the same conversions in the same order
3091 and return the result. */
3093 static tree
3095 tree conversions;
3096 tree arg;
3097 {
3099 {
3109 arg));
3113 }
3114 }
3117 /* Return nonzero if REF is an lvalue valid for this language.
3118 Lvalues can be assigned, unless their type has TYPE_READONLY.
3119 Lvalues can have their address taken, unless they have DECL_REGISTER. */
3121 int
3123 tree ref;
3124 {
3128 {
3153 }
3154 }
3156 /* Return nonzero if REF is an lvalue valid for this language;
3157 otherwise, print an error message and return zero. */
3159 int
3161 tree ref;
3163 {
3170 }
3172 /* Apply unary lvalue-demanding operator CODE to the expression ARG
3173 for certain kinds of expressions which are not really lvalues
3174 but which we can accept as lvalues. If FLAG is nonzero, then
3175 non-lvalues are OK since we may be converting a non-lvalue array to
3176 a pointer in C99.
3178 If ARG is not a kind of expression we can handle, return zero. */
3180 static tree
3183 tree arg;
3185 {
3186 /* Handle (a, b) used as an "lvalue". */
3188 {
3191 /* If this returns a function type, it isn't really being used as
3192 an lvalue, so don't issue a warning about it. */
3198 }
3200 /* Handle (a ? b : c) used as an "lvalue". */
3202 {
3212 }
3215 }
3217 /* If pedantic, warn about improper lvalue. CODE is either COND_EXPR
3218 COMPOUND_EXPR, or CONVERT_EXPR (for casts). */
3220 static void
3223 {
3226 {
3236 }
3237 }
3238 \f
3239 /* Warn about storing in something that is `const'. */
3241 void
3243 tree arg;
3245 {
3247 {
3250 else
3253 }
3257 else
3259 }
3260 \f
3261 /* Mark EXP saying that we need to be able to take the
3262 address of it; it should not be allocated in a register.
3263 Value is 1 if successful. */
3265 int
3267 tree exp;
3268 {
3272 {
3275 {
3279 }
3281 /* ... fall through ... */
3301 {
3303 {
3307 }
3310 }
3312 {
3314 {
3318 }
3320 /* If we are making this addressable due to its having
3321 volatile components, give a different error message. Also
3322 handle the case of an unnamed parameter by not trying
3323 to give the name. */
3326 {
3329 }
3333 }
3336 /* drops in */
3342 #endif
3346 }
3347 }
3348 \f
3349 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
3351 tree
3354 {
3355 tree type1;
3356 tree type2;
3365 /* Don't promote the operands separately if they promote
3366 the same way. Return the unpromoted type and let the combined
3367 value get promoted if necessary. */
3373 {
3378 }
3379 #endif
3381 /* Promote both alternatives. */
3398 /* Quickly detect the usual case where op1 and op2 have the same type
3399 after promotion. */
3401 {
3404 else
3406 }
3411 {
3414 /* If -Wsign-compare, warn here if type1 and type2 have
3415 different signedness. We'll promote the signed to unsigned
3416 and later code won't know it used to be different.
3417 Do this check on the original types, so that explicit casts
3418 will be considered, but default promotions won't. */
3421 {
3426 {
3427 /* Do not warn if the result type is signed, since the
3428 signed type will only be chosen if it can represent
3429 all the values of the unsigned type. */
3432 /* Do not warn if the signed quantity is an unsuffixed
3433 integer literal (or some static constant expression
3434 involving such literals) and it is non-negative. */
3438 else
3440 }
3441 }
3442 }
3444 {
3448 }
3450 {
3460 {
3465 }
3467 {
3472 }
3473 else
3474 {
3477 }
3478 }
3480 {
3483 else
3484 {
3486 }
3488 }
3490 {
3493 else
3494 {
3496 }
3498 }
3501 {
3504 else
3505 {
3508 }
3509 }
3511 /* Merge const and volatile flags of the incoming types. */
3512 result_type
3526 }
3527 \f
3528 /* Given a list of expressions, return a compound expression
3529 that performs them all and returns the value of the last of them. */
3531 tree
3533 tree list;
3534 {
3536 }
3538 static tree
3540 tree list;
3542 {
3543 tree rest;
3546 {
3547 /* Convert arrays and functions to pointers when there
3548 really is a comma operator. */
3554 /* Consider (x, y+0), which is not an lvalue since y+0 is not. */
3556 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
3559 #endif
3561 /* Don't let (0, 0) be null pointer constant. */
3565 }
3570 {
3571 /* The left-hand operand of a comma expression is like an expression
3572 statement: with -W or -Wunused, we should warn if it doesn't have
3573 any side-effects, unless it was explicitly cast to (void). */
3579 /* When pedantic, a compound expression can be neither an lvalue
3580 nor an integer constant expression. */
3583 }
3585 /* With -Wunused, we should also warn if the left-hand operand does have
3586 side-effects, but computes a value which is not used. For example, in
3587 `foo() + bar(), baz()' the result of the `+' operator is not used,
3588 so we should issue a warning. */
3593 }
3595 /* Build an expression representing a cast to type TYPE of expression EXPR. */
3597 tree
3599 tree type;
3600 tree expr;
3601 {
3608 #if 0
3609 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
3612 #endif
3615 {
3618 }
3621 {
3624 }
3627 {
3629 {
3633 }
3634 }
3636 {
3637 tree field;
3646 {
3648 tree t;
3653 {
3656 else
3658 }
3659 else
3665 }
3668 }
3669 else
3670 {
3673 /* If casting to void, avoid the error that would come
3674 from default_conversion in the case of a non-lvalue array. */
3678 /* Convert functions and arrays to pointers,
3679 but don't convert any other types. */
3683 /* Optionally warn about potentially worrisome casts. */
3688 {
3694 /* Check that the qualifiers on IN_TYPE are a superset of
3695 the qualifiers of IN_OTYPE. The outermost level of
3696 POINTER_TYPE nodes is uninteresting and we stop as soon
3697 as we hit a non-POINTER_TYPE node on either type. */
3698 do
3699 {
3703 /* GNU C allows cv-qualified function types. 'const'
3704 means the function is very pure, 'volatile' means it
3705 can't return. We need to warn when such qualifiers
3706 are added, not when they're taken away. */
3710 else
3712 }
3720 /* There are qualifiers present in IN_OTYPE that are not
3721 present in IN_TYPE. */
3723 }
3725 /* Warn about possible alignment problems. */
3731 /* Don't warn about opaque types, where the actual alignment
3732 restriction is unknown. */
3753 /* Don't warn about converting any constant. */
3760 /* Ignore any integer overflow caused by the cast. */
3762 {
3765 }
3766 }
3768 /* Pedantically, don't let (void *) (FOO *) 0 be a null pointer constant. */
3774 /* If pedantic, don't let a cast be an lvalue. */
3779 }
3781 /* Interpret a cast of expression EXPR to type TYPE. */
3782 tree
3785 {
3788 /* This avoids warnings about unprototyped casts on
3789 integers. E.g. "#define SIG_DFL (void(*)())0". */
3796 }
3798 \f
3799 /* Build an assignment expression of lvalue LHS from value RHS.
3800 MODIFYCODE is the code for a binary operator that we use
3801 to combine the old value of LHS with RHS to get the new value.
3802 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment. */
3804 tree
3808 {
3809 tree result;
3810 tree newrhs;
3814 /* Types that aren't fully specified cannot be used in assignments. */
3817 /* Avoid duplicate error messages from operands that had errors. */
3821 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
3822 /* Do not use STRIP_NOPS here. We do not want an enumerator
3823 whose value is 0 to count as a null pointer constant. */
3829 /* Handle control structure constructs used as "lvalues". */
3832 {
3833 /* Handle (a, b) used as an "lvalue". */
3842 /* Handle (a ? b : c) used as an "lvalue". */
3846 {
3847 /* Produce (a ? (b = rhs) : (c = rhs))
3848 except that the RHS goes through a save-expr
3849 so the code to compute it is only emitted once. */
3850 tree cond
3858 /* Make sure the code to compute the rhs comes out
3859 before the split. */
3861 /* But cast it to void to avoid an "unused" error. */
3863 }
3866 }
3868 /* If a binary op has been requested, combine the old LHS value with the RHS
3869 producing the value we should actually store into the LHS. */
3872 {
3875 }
3877 /* Handle a cast used as an "lvalue".
3878 We have already performed any binary operator using the value as cast.
3879 Now convert the result to the cast type of the lhs,
3880 and then true type of the lhs and store it there;
3881 then convert result back to the cast type to be the value
3882 of the assignment. */
3885 {
3894 {
3896 tree result;
3904 }
3908 }
3910 /* Now we have handled acceptable kinds of LHS that are not truly lvalues.
3911 Reject anything strange now. */
3916 /* Warn about storing in something that is `const'. */
3924 /* If storing into a structure or union member,
3925 it has probably been given type `int'.
3926 Compute the type that would go with
3927 the actual amount of storage the member occupies. */
3936 /* If storing in a field that is in actuality a short or narrower than one,
3937 we must store in the field in its actual type. */
3940 {
3943 }
3945 /* Convert new value to destination type. */
3952 /* Scan operands */
3957 /* If we got the LHS in a different type for storing in,
3958 convert the result back to the nominal type of LHS
3959 so that the value we return always has the same type
3960 as the LHS argument. */
3966 }
3967 \f
3968 /* Convert value RHS to type TYPE as preparation for an assignment
3969 to an lvalue of type TYPE.
3970 The real work of conversion is done by `convert'.
3971 The purpose of this function is to generate error messages
3972 for assignments that are not allowed in C.
3973 ERRTYPE is a string to use in error messages:
3974 "assignment", "return", etc. If it is null, this is parameter passing
3975 for a function call (and different error messages are output).
3977 FUNNAME is the name of the function being called,
3978 as an IDENTIFIER_NODE, or null.
3979 PARMNUM is the number of the argument, for printing in error messages. */
3981 static tree
3987 {
3989 tree rhstype;
3992 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
3993 /* Do not use STRIP_NOPS here. We do not want an enumerator
3994 whose value is 0 to count as a null pointer constant. */
4011 {
4013 /* Check for Objective-C protocols. This will issue a warning if
4014 there are protocol violations. No need to use the return value. */
4017 }
4020 {
4023 }
4024 /* A type converts to a reference to it.
4025 This code doesn't fully support references, it's just for the
4026 special case of va_start and va_copy. */
4029 {
4031 {
4034 }
4039 /* We already know that these two types are compatible, but they
4040 may not be exactly identical. In fact, `TREE_TYPE (type)' is
4041 likely to be __builtin_va_list and `TREE_TYPE (rhs)' is
4042 likely to be va_list, a typedef to __builtin_va_list, which
4043 is different enough that it will cause problems later. */
4049 }
4050 /* Arithmetic types all interconvert, and enum is treated like int. */
4059 /* Conversion to a transparent union from its member types.
4060 This applies only to function arguments. */
4062 {
4063 tree memb_types;
4068 {
4079 {
4083 /* Any non-function converts to a [const][volatile] void *
4084 and vice versa; otherwise, targets must be the same.
4085 Meanwhile, the lhs target must have all the qualifiers of
4086 the rhs. */
4089 {
4090 /* If this type won't generate any warnings, use it. */
4100 /* Keep looking for a better type, but remember this one. */
4103 }
4104 }
4106 /* Can convert integer zero to any pointer type. */
4110 {
4113 }
4114 }
4117 {
4119 {
4120 /* We have only a marginally acceptable member type;
4121 it needs a warning. */
4125 /* Const and volatile mean something different for function
4126 types, so the usual warnings are not appropriate. */
4129 {
4130 /* Because const and volatile on functions are
4131 restrictions that say the function will not do
4132 certain things, it is okay to use a const or volatile
4133 function where an ordinary one is wanted, but not
4134 vice-versa. */
4138 }
4142 parmnum);
4143 }
4149 }
4150 }
4152 /* Conversions among pointers */
4155 {
4159 /* Any non-function converts to a [const][volatile] void *
4160 and vice versa; otherwise, targets must be the same.
4161 Meanwhile, the lhs target must have all the qualifiers of the rhs. */
4166 {
4169 ||
4171 /* Check TREE_CODE to catch cases like (void *) (char *) 0
4172 which are not ANSI null ptr constants. */
4177 /* Const and volatile mean something different for function types,
4178 so the usual warnings are not appropriate. */
4181 {
4185 /* If this is not a case of ignoring a mismatch in signedness,
4186 no warning. */
4189 ;
4190 /* If there is a mismatch, do warn. */
4194 }
4197 {
4198 /* Because const and volatile on functions are restrictions
4199 that say the function will not do certain things,
4200 it is okay to use a const or volatile function
4201 where an ordinary one is wanted, but not vice-versa. */
4205 }
4206 }
4207 else
4211 }
4213 {
4214 /* An explicit constant 0 can convert to a pointer,
4215 or one that results from arithmetic, even including
4216 a cast to integer type. */
4218 &&
4223 {
4227 }
4229 }
4231 {
4235 }
4240 {
4242 {
4248 else
4251 }
4252 else
4254 parmnum);
4255 }
4256 else
4260 }
4262 /* Convert VALUE for assignment into inlined parameter PARM. */
4264 tree
4267 {
4270 /* If FN was prototyped, the value has been converted already
4271 in convert_arguments. */
4284 }
4286 /* Print a warning using MSGID.
4287 It gets OPNAME as its one parameter.
4288 If OPNAME is null, it is replaced by "passing arg ARGNUM of `FUNCTION'".
4289 FUNCTION and ARGNUM are handled specially if we are building an
4290 Objective-C selector. */
4292 static void
4296 tree function;
4298 {
4300 {
4305 {
4308 }
4310 {
4311 /* Function name is known; supply it. */
4318 }
4319 else
4320 {
4321 /* Function name unknown (call through ptr); just give arg number. */
4325 }
4327 }
4329 }
4330 \f
4331 /* If VALUE is a compound expr all of whose expressions are constant, then
4332 return its value. Otherwise, return error_mark_node.
4334 This is for handling COMPOUND_EXPRs as initializer elements
4335 which is allowed with a warning when -pedantic is specified. */
4337 static tree
4339 tree value;
4340 tree endtype;
4341 {
4343 {
4348 endtype);
4349 }
4353 else
4355 }
4356 \f
4357 /* Perform appropriate conversions on the initial value of a variable,
4358 store it in the declaration DECL,
4359 and print any error messages that are appropriate.
4360 If the init is invalid, store an ERROR_MARK. */
4362 void
4365 {
4368 /* If variable's type was invalidly declared, just ignore it. */
4374 /* Digest the specified initializer into an expression. */
4378 /* Store the expression if valid; else report error. */
4380 #if 0
4381 /* Note that this is the only place we can detect the error
4382 in a case such as struct foo bar = (struct foo) { x, y };
4383 where there is one initial value which is a constructor expression. */
4385 ;
4387 {
4390 }
4393 {
4396 }
4397 else
4398 {
4400 {
4405 }
4406 }
4407 #endif
4415 /* ANSI wants warnings about out-of-range constant initializers. */
4419 /* Check if we need to set array size from compound literal size. */
4423 {
4431 {
4435 {
4436 /* For int foo[] = (int [3]){1}; we need to set array size
4437 now since later on array initializer will be just the
4438 brace enclosed list of the compound literal. */
4442 }
4443 }
4444 }
4445 }
4446 \f
4447 /* Methods for storing and printing names for error messages. */
4449 /* Implement a spelling stack that allows components of a name to be pushed
4450 and popped. Each element on the stack is this structure. */
4452 struct spelling
4453 {
4455 union
4456 {
4460 };
4462 #define SPELLING_STRING 1
4463 #define SPELLING_MEMBER 2
4464 #define SPELLING_BOUNDS 3
4470 /* Macros to save and restore the spelling stack around push_... functions.
4471 Alternative to SAVE_SPELLING_STACK. */
4473 #define SPELLING_DEPTH() (spelling - spelling_base)
4474 #define RESTORE_SPELLING_DEPTH(DEPTH) (spelling = spelling_base + (DEPTH))
4476 /* Save and restore the spelling stack around arbitrary C code. */
4478 #define SAVE_SPELLING_DEPTH(code) \
4479 { \
4480 int __depth = SPELLING_DEPTH (); \
4481 code; \
4482 RESTORE_SPELLING_DEPTH (__depth); \
4483 }
4485 /* Push an element on the spelling stack with type KIND and assign VALUE
4486 to MEMBER. */
4488 #define PUSH_SPELLING(KIND, VALUE, MEMBER) \
4489 { \
4490 int depth = SPELLING_DEPTH (); \
4491 \
4492 if (depth >= spelling_size) \
4493 { \
4494 spelling_size += 10; \
4495 if (spelling_base == 0) \
4496 spelling_base \
4497 = (struct spelling *) xmalloc (spelling_size * sizeof (struct spelling)); \
4498 else \
4499 spelling_base \
4500 = (struct spelling *) xrealloc (spelling_base, \
4501 spelling_size * sizeof (struct spelling)); \
4502 RESTORE_SPELLING_DEPTH (depth); \
4503 } \
4504 \
4505 spelling->kind = (KIND); \
4506 spelling->MEMBER = (VALUE); \
4507 spelling++; \
4508 }
4510 /* Push STRING on the stack. Printed literally. */
4512 static void
4515 {
4517 }
4519 /* Push a member name on the stack. Printed as '.' STRING. */
4521 static void
4523 tree decl;
4525 {
4529 }
4531 /* Push an array bounds on the stack. Printed as [BOUNDS]. */
4533 static void
4536 {
4538 }
4540 /* Compute the maximum size in bytes of the printed spelling. */
4542 static int
4544 {
4549 {
4552 else
4554 }
4557 }
4559 /* Print the spelling to BUFFER and return it. */
4564 {
4570 {
4573 }
4574 else
4575 {
4580 ;
4581 }
4584 }
4586 /* Issue an error message for a bad initializer component.
4587 MSGID identifies the message.
4588 The component name is taken from the spelling stack. */
4590 void
4593 {
4600 }
4602 /* Issue a pedantic warning for a bad initializer component.
4603 MSGID identifies the message.
4604 The component name is taken from the spelling stack. */
4606 void
4609 {
4616 }
4618 /* Issue a warning for a bad initializer component.
4619 MSGID identifies the message.
4620 The component name is taken from the spelling stack. */
4622 static void
4625 {
4632 }
4633 \f
4634 /* Digest the parser output INIT as an initializer for type TYPE.
4635 Return a C expression of type TYPE to represent the initial value.
4637 REQUIRE_CONSTANT requests an error if non-constant initializers or
4638 elements are seen. */
4640 static tree
4644 {
4653 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
4654 /* Do not use STRIP_NOPS here. We do not want an enumerator
4655 whose value is 0 to count as a null pointer constant. */
4661 /* Initialization of an array of chars from a string constant
4662 optionally enclosed in braces. */
4665 {
4673 {
4681 {
4684 }
4688 {
4691 }
4697 /* Subtract 1 (or sizeof (wchar_t))
4698 because it's ok to ignore the terminating null char
4699 that is counted in the length of the constant. */
4710 }
4711 }
4713 /* Any type can be initialized
4714 from an expression of the same type, optionally with braces. */
4728 {
4734 {
4735 /* As an extension, allow initializing objects with static storage
4736 duration with compound literals (which are then treated just as
4737 the brace enclosed list they contain). */
4740 }
4744 {
4747 }
4752 /* Compound expressions can only occur here if -pedantic or
4753 -pedantic-errors is specified. In the later case, we always want
4754 an error. In the former case, we simply want a warning. */
4757 {
4758 inside_init
4763 else
4767 }
4770 /* This test catches things like `7 / 0' which
4771 result in an expression for which TREE_CONSTANT
4772 is true, but which is not actually something
4773 that is a legal constant. We really should not
4774 be using this function, because it is a part of
4775 the back-end. Instead, the expression should
4776 already have been turned into ERROR_MARK_NODE. */
4779 {
4782 }
4785 }
4787 /* Handle scalar types, including conversions. */
4791 {
4792 /* Note that convert_for_assignment calls default_conversion
4793 for arrays and functions. We must not call it in the
4794 case where inside_init is a null pointer constant. */
4795 inside_init
4800 {
4803 }
4806 {
4809 }
4812 }
4814 /* Come here only for records and arrays. */
4817 {
4820 }
4824 }
4825 \f
4826 /* Handle initializers that use braces. */
4828 /* Type of object we are accumulating a constructor for.
4829 This type is always a RECORD_TYPE, UNION_TYPE or ARRAY_TYPE. */
4832 /* For a RECORD_TYPE or UNION_TYPE, this is the chain of fields
4833 left to fill. */
4836 /* For an ARRAY_TYPE, this is the specified index
4837 at which to store the next element we get. */
4840 /* For an ARRAY_TYPE, this is the maximum index. */
4843 /* For a RECORD_TYPE, this is the first field not yet written out. */
4846 /* For an ARRAY_TYPE, this is the index of the first element
4847 not yet written out. */
4850 /* In a RECORD_TYPE, the byte index of the next consecutive field.
4851 This is so we can generate gaps between fields, when appropriate. */
4854 /* If we are saving up the elements rather than allocating them,
4855 this is the list of elements so far (in reverse order,
4856 most recent first). */
4859 /* 1 if constructor should be incrementally stored into a constructor chain,
4860 0 if all the elements should be kept in AVL tree. */
4863 /* 1 if so far this constructor's elements are all compile-time constants. */
4866 /* 1 if so far this constructor's elements are all valid address constants. */
4869 /* 1 if this constructor is erroneous so far. */
4872 /* 1 if have called defer_addressed_constants. */
4875 /* Structure for managing pending initializer elements, organized as an
4876 AVL tree. */
4878 struct init_node
4879 {
4883 tree purpose;
4884 tree value;
4885 };
4887 /* Tree of pending elements at this constructor level.
4888 These are elements encountered out of order
4889 which belong at places we haven't reached yet in actually
4890 writing the output.
4891 Will never hold tree nodes across GC runs. */
4894 /* The SPELLING_DEPTH of this constructor. */
4897 /* 0 if implicitly pushing constructor levels is allowed. */
4903 /* DECL node for which an initializer is being read.
4904 0 means we are reading a constructor expression
4905 such as (struct foo) {...}. */
4908 /* start_init saves the ASMSPEC arg here for really_start_incremental_init. */
4911 /* Nonzero if this is an initializer for a top-level decl. */
4914 /* Nonzero if there were any member designators in this initializer. */
4917 /* Nesting depth of designator list. */
4920 /* Nonzero if there were diagnosed errors in this designator list. */
4923 \f
4924 /* This stack has a level for each implicit or explicit level of
4925 structuring in the initializer, including the outermost one. It
4926 saves the values of most of the variables above. */
4930 struct constructor_stack
4931 {
4933 tree type;
4934 tree fields;
4935 tree index;
4936 tree max_index;
4937 tree unfilled_index;
4938 tree unfilled_fields;
4939 tree bit_index;
4940 tree elements;
4944 /* If nonzero, this value should replace the entire
4945 constructor at this level. */
4946 tree replacement_value;
4955 };
4959 /* This stack represents designators from some range designator up to
4960 the last designator in the list. */
4962 struct constructor_range_stack
4963 {
4966 tree range_start;
4967 tree index;
4968 tree range_end;
4969 tree fields;
4970 };
4974 /* This stack records separate initializers that are nested.
4975 Nested initializers can't happen in ANSI C, but GNU C allows them
4976 in cases like { ... (struct foo) { ... } ... }. */
4978 struct initializer_stack
4979 {
4981 tree decl;
4985 tree elements;
4993 };
4996 \f
4997 /* Prepare to parse and output the initializer for variable DECL. */
4999 void
5001 tree decl;
5002 tree asmspec_tree;
5004 {
5035 {
5037 require_constant_elements
5039 /* For a scalar, you can always use any value to initialize,
5040 even within braces. */
5046 }
5047 else
5048 {
5052 }
5065 }
5067 void
5069 {
5072 /* Output subconstants (string constants, usually)
5073 that were referenced within this initializer and saved up.
5074 Must do this if and only if we called defer_addressed_constants. */
5078 /* Free the whole constructor stack of this initializer. */
5080 {
5084 }
5089 /* Pop back to the data of the outer initializer (if any). */
5104 }
5105 \f
5106 /* Call here when we see the initializer is surrounded by braces.
5107 This is instead of a call to push_init_level;
5108 it is matched by a call to pop_init_level.
5110 TYPE is the type to initialize, for a constructor expression.
5111 For an initializer for a decl, TYPE is zero. */
5113 void
5115 tree type;
5116 {
5158 {
5160 /* Skip any nameless bit fields at the beginning. */
5167 }
5169 {
5171 {
5172 constructor_max_index
5175 /* Detect non-empty initializations of zero-length arrays. */
5180 /* constructor_max_index needs to be an INTEGER_CST. Attempts
5181 to initialize VLAs will cause an proper error; avoid tree
5182 checking errors as well by setting a safe value. */
5187 constructor_index
5190 }
5191 else
5195 }
5197 {
5198 /* Vectors are like simple fixed-size arrays. */
5199 constructor_max_index =
5203 }
5204 else
5205 {
5206 /* Handle the case of int x = {5}; */
5209 }
5210 }
5211 \f
5212 /* Push down into a subobject, for initialization.
5213 If this is for an explicit set of braces, IMPLICIT is 0.
5214 If it is because the next element belongs at a lower level,
5215 IMPLICIT is 1 (or 2 if the push is because of designator list). */
5217 void
5220 {
5224 /* If we've exhausted any levels that didn't have braces,
5225 pop them now. */
5227 {
5235 else
5237 }
5239 /* Unless this is an explicit brace, we need to preserve previous
5240 content if any. */
5242 {
5249 }
5282 {
5287 }
5289 /* Don't die if an entire brace-pair level is superfluous
5290 in the containing level. */
5292 ;
5295 {
5296 /* Don't die if there are extra init elts at the end. */
5299 else
5300 {
5303 constructor_depth++;
5304 }
5305 }
5307 {
5310 constructor_depth++;
5311 }
5314 {
5319 }
5322 {
5330 }
5333 {
5336 }
5340 {
5342 /* Skip any nameless bit fields at the beginning. */
5349 }
5351 {
5352 /* Vectors are like simple fixed-size arrays. */
5353 constructor_max_index =
5357 }
5359 {
5361 {
5362 constructor_max_index
5365 /* Detect non-empty initializations of zero-length arrays. */
5370 /* constructor_max_index needs to be an INTEGER_CST. Attempts
5371 to initialize VLAs will cause an proper error; avoid tree
5372 checking errors as well by setting a safe value. */
5377 constructor_index
5380 }
5381 else
5386 {
5387 /* We need to split the char/wchar array into individual
5388 characters, so that we don't have to special case it
5389 everywhere. */
5391 }
5392 }
5393 else
5394 {
5398 }
5399 }
5401 /* At the end of an implicit or explicit brace level,
5402 finish up that level of constructor.
5403 If we were outputting the elements as they are read, return 0
5404 from inner levels (process_init_element ignores that),
5405 but return error_mark_node from the outermost level
5406 (that's what we want to put in DECL_INITIAL).
5407 Otherwise, return a CONSTRUCTOR expression. */
5409 tree
5412 {
5417 {
5418 /* When we come to an explicit close brace,
5419 pop any inner levels that didn't have explicit braces. */
5425 }
5429 /* Error for initializing a flexible array member, or a zero-length
5430 array member in an inappropriate context. */
5435 {
5436 /* Silently discard empty initializations. The parser will
5437 already have pedwarned for empty brackets. */
5441 {
5447 /* We have already issued an error message for the existence
5448 of a flexible array member not at the end of the structure.
5449 Discard the initializer so that we do not abort later. */
5452 }
5453 else
5454 /* Zero-length arrays are no longer special, so we should no longer
5455 get here. */
5457 }
5459 /* Warn when some struct elements are implicitly initialized to zero. */
5461 && constructor_type
5464 {
5465 /* Do not warn for flexible array members or zero-length arrays. */
5471 /* Do not warn if this level of the initializer uses member
5472 designators; it is likely to be deliberate. */
5474 {
5478 }
5479 }
5481 /* Now output all pending elements. */
5485 /* Pad out the end of the structure. */
5487 /* If this closes a superfluous brace pair,
5488 just pass out the element between them. */
5491 ;
5496 {
5497 /* A nonincremental scalar initializer--just return
5498 the element, after verifying there is just one. */
5500 {
5504 }
5506 {
5509 }
5510 else
5512 }
5513 else
5514 {
5517 else
5518 {
5525 }
5526 }
5551 {
5555 }
5557 }
5559 /* Common handling for both array range and field name designators.
5560 ARRAY argument is non-zero for array ranges. Returns zero for success. */
5562 static int
5565 {
5566 tree subtype;
5569 /* Don't die if an entire brace-pair level is superfluous
5570 in the containing level. */
5574 /* If there were errors in this designator list already, bail out silently. */
5579 {
5583 /* Designator list starts at the level of closest explicit
5584 braces. */
5589 }
5592 {
5595 }
5599 {
5603 }
5605 {
5607 }
5608 else
5613 {
5616 }
5618 {
5621 }
5626 }
5628 /* If there are range designators in designator list, push a new designator
5629 to constructor_range_stack. RANGE_END is end of such stack range or
5630 NULL_TREE if there is no range designator at this level. */
5632 static void
5634 tree range_end;
5635 {
5650 }
5652 /* Within an array initializer, specify the next index to be initialized.
5653 FIRST is that index. If LAST is nonzero, then initialize a range
5654 of indices, running from FIRST through LAST. */
5656 void
5659 {
5689 else
5690 {
5694 {
5698 {
5701 }
5702 else
5703 {
5707 {
5710 }
5711 }
5712 }
5714 designator_depth++;
5718 }
5719 }
5721 /* Within a struct initializer, specify the next field to be initialized. */
5723 void
5725 tree fieldname;
5726 {
5727 tree tail;
5736 {
5739 }
5743 {
5746 }
5751 else
5752 {
5754 designator_depth++;
5758 }
5759 }
5760 \f
5761 /* Add a new initializer to the tree of pending initializers. PURPOSE
5762 identifies the initializer, either array index or field in a structure.
5763 VALUE is the value of that index or field. */
5765 static void
5768 {
5775 {
5777 {
5783 else
5784 {
5789 }
5790 }
5791 }
5792 else
5793 {
5794 tree bitpos;
5798 {
5804 else
5805 {
5810 }
5811 }
5812 }
5825 {
5829 {
5833 {
5835 {
5836 /* L rotation. */
5849 {
5852 else
5854 }
5855 else
5857 }
5858 else
5859 {
5860 /* LR rotation. */
5882 {
5885 else
5887 }
5888 else
5890 }
5892 }
5893 else
5894 {
5895 /* p->balance == +1; growth of left side balances the node. */
5898 }
5899 }
5901 {
5903 /* Growth propagation from right side. */
5906 {
5908 {
5909 /* R rotation. */
5922 {
5925 else
5927 }
5928 else
5930 }
5932 {
5933 /* RL rotation */
5955 {
5958 else
5960 }
5961 else
5963 }
5965 }
5966 else
5967 {
5968 /* p->balance == -1; growth of right side balances the node. */
5971 }
5972 }
5976 }
5977 }
5979 /* Build AVL tree from a sorted chain. */
5981 static void
5983 {
5984 tree chain;
5994 {
5996 /* Skip any nameless bit fields at the beginning. */
6002 }
6004 {
6006 constructor_unfilled_index
6009 else
6011 }
6013 }
6015 /* Build AVL tree from a string constant. */
6017 static void
6019 tree str;
6020 {
6035 else
6046 {
6048 {
6051 }
6052 else
6053 {
6057 {
6060 else
6065 }
6066 }
6069 {
6072 {
6074 {
6077 }
6078 }
6080 {
6083 }
6088 }
6093 }
6096 }
6098 /* Return value of FIELD in pending initializer or zero if the field was
6099 not initialized yet. */
6101 static tree
6103 tree field;
6104 {
6108 {
6115 {
6120 else
6122 }
6123 }
6125 {
6129 && (!constructor_unfilled_fields
6136 {
6141 else
6143 }
6144 }
6146 {
6150 }
6152 }
6154 /* "Output" the next constructor element.
6155 At top level, really output it to assembler code now.
6156 Otherwise, collect it in a list from which we will make a CONSTRUCTOR.
6157 TYPE is the data type that the containing data type wants here.
6158 FIELD is the field (a FIELD_DECL) or the index that this element fills.
6160 PENDING if non-nil means output pending elements that belong
6161 right after this element. (PENDING is normally 1;
6162 it is 0 while outputting pending elements, to avoid recursion.) */
6164 static void
6168 {
6180 {
6181 /* As an extension, allow initializing objects with static storage
6182 duration with compound literals (which are then treated just as
6183 the brace enclosed list they contain). */
6186 }
6200 {
6203 }
6208 /* If this field is empty (and not at the end of structure),
6209 don't do anything other than checking the initializer. */
6220 {
6223 }
6225 /* If this element doesn't come next in sequence,
6226 put it on constructor_pending_elts. */
6228 && (!constructor_incremental
6230 {
6237 }
6239 && (!constructor_incremental
6241 {
6242 /* We do this for records but not for unions. In a union,
6243 no matter which field is specified, it can be initialized
6244 right away since it starts at the beginning of the union. */
6246 {
6249 else
6250 {
6258 }
6259 }
6263 }
6266 {
6270 /* We can have just one union field set. */
6272 }
6274 /* Otherwise, output this element either to
6275 constructor_elements or to the assembler file. */
6279 constructor_elements
6282 /* Advance the variable that indicates sequential elements output. */
6284 constructor_unfilled_index
6286 bitsize_one_node);
6288 {
6289 constructor_unfilled_fields
6292 /* Skip any nameless bit fields. */
6296 constructor_unfilled_fields =
6298 }
6302 /* Now output any pending elements which have become next. */
6305 }
6307 /* Output any pending elements which have become next.
6308 As we output elements, constructor_unfilled_{fields,index}
6309 advances, which may cause other elements to become next;
6310 if so, they too are output.
6312 If ALL is 0, we return when there are
6313 no more pending elements to output now.
6315 If ALL is 1, we output space as necessary so that
6316 we can output all the pending elements. */
6318 static void
6321 {
6323 tree next;
6325 retry:
6327 /* Look thru the whole pending tree.
6328 If we find an element that should be output now,
6329 output it. Otherwise, set NEXT to the element
6330 that comes first among those still pending. */
6334 {
6336 {
6338 constructor_unfilled_index))
6344 {
6345 /* Advance to the next smaller node. */
6348 else
6349 {
6350 /* We have reached the smallest node bigger than the
6351 current unfilled index. Fill the space first. */
6354 }
6355 }
6356 else
6357 {
6358 /* Advance to the next bigger node. */
6361 else
6362 {
6363 /* We have reached the biggest node in a subtree. Find
6364 the parent of it, which is the next bigger node. */
6370 {
6373 }
6374 }
6375 }
6376 }
6379 {
6382 /* If the current record is complete we are done. */
6388 /* We can't compare fields here because there might be empty
6389 fields in between. */
6391 {
6395 }
6397 {
6398 /* Advance to the next smaller node. */
6401 else
6402 {
6403 /* We have reached the smallest node bigger than the
6404 current unfilled field. Fill the space first. */
6407 }
6408 }
6409 else
6410 {
6411 /* Advance to the next bigger node. */
6414 else
6415 {
6416 /* We have reached the biggest node in a subtree. Find
6417 the parent of it, which is the next bigger node. */
6424 {
6427 }
6428 }
6429 }
6430 }
6431 }
6433 /* Ordinarily return, but not if we want to output all
6434 and there are elements left. */
6438 /* If it's not incremental, just skip over the gap, so that after
6439 jumping to retry we will output the next successive element. */
6446 /* ELT now points to the node in the pending tree with the next
6447 initializer to output. */
6449 }
6450 \f
6451 /* Add one non-braced element to the current constructor level.
6452 This adjusts the current position within the constructor's type.
6453 This may also start or terminate implicit levels
6454 to handle a partly-braced initializer.
6456 Once this has found the correct level for the new element,
6457 it calls output_init_element. */
6459 void
6461 tree value;
6462 {
6469 /* Handle superfluous braces around string cst as in
6470 char x[] = {"foo"}; */
6472 && constructor_type
6476 {
6481 }
6484 {
6487 }
6489 /* Ignore elements of a brace group if it is entirely superfluous
6490 and has already been diagnosed. */
6494 /* If we've exhausted any levels that didn't have braces,
6495 pop them now. */
6497 {
6505 constructor_index)))
6507 else
6509 }
6511 /* In the case of [LO ... HI] = VALUE, only evaluate VALUE once. */
6513 {
6514 /* If value is a compound literal and we'll be just using its
6515 content, don't put it into a SAVE_EXPR. */
6517 || !require_constant_value
6520 }
6523 {
6525 {
6526 tree fieldtype;
6530 {
6533 }
6540 /* Accept a string constant to initialize a subarray. */
6546 /* Otherwise, if we have come to a subaggregate,
6547 and we don't have an element of its type, push into it. */
6553 {
6556 }
6559 {
6563 }
6564 else
6565 /* Do the bookkeeping for an element that was
6566 directly output as a constructor. */
6567 {
6568 /* For a record, keep track of end position of last field. */
6570 constructor_bit_index
6576 /* Skip any nameless bit fields. */
6580 constructor_unfilled_fields =
6582 }
6585 /* Skip any nameless bit fields at the beginning. */
6590 }
6592 {
6593 tree fieldtype;
6597 {
6600 }
6607 /* Warn that traditional C rejects initialization of unions.
6608 We skip the warning if the value is zero. This is done
6609 under the assumption that the zero initializer in user
6610 code appears conditioned on e.g. __STDC__ to avoid
6611 "missing initializer" warnings and relies on default
6612 initialization to zero in the traditional C case.
6613 We also skip the warning if the initializer is designated,
6614 again on the assumption that this must be conditional on
6615 __STDC__ anyway (and we've already complained about the
6616 member-designator already). */
6621 /* Accept a string constant to initialize a subarray. */
6627 /* Otherwise, if we have come to a subaggregate,
6628 and we don't have an element of its type, push into it. */
6634 {
6637 }
6640 {
6644 }
6645 else
6646 /* Do the bookkeeping for an element that was
6647 directly output as a constructor. */
6648 {
6651 }
6654 }
6656 {
6660 /* Accept a string constant to initialize a subarray. */
6666 /* Otherwise, if we have come to a subaggregate,
6667 and we don't have an element of its type, push into it. */
6673 {
6676 }
6681 {
6684 }
6686 /* Now output the actual element. */
6688 {
6692 }
6694 constructor_index
6698 /* If we are doing the bookkeeping for an element that was
6699 directly output as a constructor, we must update
6700 constructor_unfilled_index. */
6702 }
6704 {
6707 /* Do a basic check of initializer size. Note that vectors
6708 always have a fixed size derived from their type. */
6710 {
6713 }
6715 /* Now output the actual element. */
6719 constructor_index
6723 /* If we are doing the bookkeeping for an element that was
6724 directly output as a constructor, we must update
6725 constructor_unfilled_index. */
6727 }
6729 /* Handle the sole element allowed in a braced initializer
6730 for a scalar variable. */
6732 {
6735 }
6736 else
6737 {
6741 }
6743 /* Handle range initializers either at this level or anywhere higher
6744 in the designator stack. */
6746 {
6753 {
6757 }
6761 {
6765 }
6772 {
6776 {
6779 }
6787 }
6792 }
6795 }
6798 }
6799 \f
6800 /* Build a simple asm-statement, from one string literal. */
6801 tree
6803 tree expr;
6804 {
6811 {
6812 tree stmt;
6818 NULL_TREE));
6821 }
6825 }
6827 /* Build an asm-statement, whose components are a CV_QUALIFIER, a
6828 STRING, some OUTPUTS, some INPUTS, and some CLOBBERS. */
6830 tree
6832 tree cv_qualifier;
6833 tree string;
6834 tree outputs;
6835 tree inputs;
6836 tree clobbers;
6837 {
6838 tree tail;
6843 {
6846 }
6850 {
6854 }
6856 /* We can remove output conversions that change the type,
6857 but not the mode. */
6859 {
6865 /* Allow conversions as LHS here. build_modify_expr as called below
6866 will do the right thing with them. */
6877 }
6879 /* Remove output conversions that change the type but not the mode. */
6881 {
6885 }
6887 /* Perform default conversions on array and function inputs.
6888 Don't do this for other types as it would screw up operands
6889 expected to be in memory. */
6895 }
6897 /* Expand an ASM statement with operands, handling output operands
6898 that are not variables or INDIRECT_REFS by transforming such
6899 cases into cases that expand_asm_operands can handle.
6901 Arguments are same as for expand_asm_operands. */
6903 void
6909 {
6912 /* o[I] is the place that output number I should be written. */
6914 tree tail;
6916 /* Record the contents of OUTPUTS before it is modified. */
6920 /* Generate the ASM_OPERANDS insn; store into the TREE_VALUEs of
6921 OUTPUTS some trees for where the values were actually stored. */
6924 /* Copy all the intermediate outputs into the specified outputs. */
6926 {
6928 {
6933 /* Restore the original value so that it's correct the next
6934 time we expand this function. */
6936 }
6937 /* Detect modification of read-only values.
6938 (Otherwise done by build_modify_expr.) */
6939 else
6940 {
6948 }
6949 }
6951 /* Those MODIFY_EXPRs could do autoincrements. */
6953 }
6954 \f
6955 /* Expand a C `return' statement.
6956 RETVAL is the expression for what to return,
6957 or a null pointer for `return;' with no value. */
6959 tree
6961 tree retval;
6962 {
6969 {
6974 }
6976 {
6980 }
6981 else
6982 {
6986 tree inner;
6994 /* Strip any conversions, additions, and subtractions, and see if
6995 we are returning the address of a local variable. Warn if so. */
6997 {
6999 {
7006 /* If the second operand of the MINUS_EXPR has a pointer
7007 type (or is converted from it), this may be valid, so
7008 don't give a warning. */
7009 {
7023 }
7040 }
7043 }
7046 }
7049 }
7050 \f
7052 /* The SWITCH_STMT being built. */
7053 tree switch_stmt;
7054 /* A splay-tree mapping the low element of a case range to the high
7055 element, or NULL_TREE if there is no high element. Used to
7056 determine whether or not a new case label duplicates an old case
7057 label. We need a tree, rather than simply a hash table, because
7058 of the GNU case range extension. */
7059 splay_tree cases;
7060 /* The next node on the stack. */
7062 };
7064 /* A stack of the currently active switch statements. The innermost
7065 switch statement is on the top of the stack. There is no need to
7066 mark the stack for garbage collection because it is only active
7067 during the processing of the body of a function, and we never
7068 collect at that point. */
7072 /* Start a C switch statement, testing expression EXP. Return the new
7073 SWITCH_STMT. */
7075 tree
7077 tree exp;
7078 {
7084 {
7090 {
7093 }
7094 else
7095 {
7105 }
7106 }
7108 /* Add this new SWITCH_STMT to the stack. */
7116 }
7118 /* Process a case label. */
7120 tree
7122 tree low_value;
7123 tree high_value;
7124 {
7128 {
7134 }
7137 else
7141 }
7143 /* Finish the switch statement. */
7145 void
7147 {
7152 /* Pop the stack. */
7156 }