| blob | f6e8d538d7531a5229bda9e011d47a91c3e56a40 |
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 /* Given a type, apply default promotions wrt unnamed function
177 arguments and return the new type. */
179 tree
181 tree type;
182 {
187 {
188 /* Preserve unsignedness if not really getting any wider. */
193 }
196 }
198 /* Return a variant of TYPE which has all the type qualifiers of LIKE
199 as well as those of TYPE. */
201 static tree
204 {
207 }
208 \f
209 /* Return the common type of two types.
210 We assume that comptypes has already been done and returned 1;
211 if that isn't so, this may crash. In particular, we assume that qualifiers
212 match.
214 This is the type for the result of most arithmetic operations
215 if the operands have the given two types. */
217 tree
220 {
223 tree attributes;
225 /* Save time if the two types are the same. */
229 /* If one type is nonsense, use the other. */
235 /* Merge the attributes. */
238 /* Treat an enum type as the unsigned integer type of the same width. */
248 /* If one type is complex, form the common type of the non-complex
249 components, then make that complex. Use T1 or T2 if it is the
250 required type. */
252 {
261 else
263 attributes);
264 }
267 {
270 /* If only one is real, use it as the result. */
278 /* Both real or both integers; use the one with greater precision. */
285 /* Same precision. Prefer longs to ints even when same size. */
290 attributes);
294 {
295 /* But preserve unsignedness from the other type,
296 since long cannot hold all the values of an unsigned int. */
299 else
302 }
304 /* Likewise, prefer long double to double even if same size. */
308 attributes);
310 /* Otherwise prefer the unsigned one. */
314 else
318 /* For two pointers, do this recursively on the target type,
319 and combine the qualifiers of the two types' targets. */
320 /* This code was turned off; I don't know why.
321 But ANSI C specifies doing this with the qualifiers.
322 So I turned it on again. */
323 {
333 }
334 #if 0
337 #endif
340 {
342 /* Save space: see if the result is identical to one of the args. */
347 /* Merge the element types, and have a size if either arg has one. */
350 }
353 /* Function types: prefer the one that specified arg types.
354 If both do, merge the arg types. Also merge the return types. */
355 {
363 /* Save space: see if the result is identical to one of the args. */
369 /* Simple way if one arg fails to specify argument types. */
371 {
374 }
376 {
379 }
381 /* If both args specify argument types, we must merge the two
382 lists, argument by argument. */
397 {
398 /* A null type means arg type is not specified.
399 Take whatever the other function type has. */
401 {
404 }
406 {
409 }
411 /* Given wait (union {union wait *u; int *i} *)
412 and wait (union wait *),
413 prefer union wait * as type of parm. */
416 {
417 tree memb;
421 {
426 }
427 }
430 {
431 tree memb;
435 {
440 }
441 }
443 parm_done: ;
444 }
449 /* ... falls through ... */
450 }
454 }
456 }
457 \f
458 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
459 or various other operations. Return 2 if they are compatible
460 but a warning may be needed if you use them together. */
462 int
465 {
470 /* Suppress errors caused by previously reported errors. */
476 /* If either type is the internal version of sizetype, return the
477 language version. */
486 /* Treat an enum type as the integer type of the same width and
487 signedness. */
497 /* Different classes of types can't be compatible. */
501 /* Qualifiers must match. */
506 /* Allow for two different type nodes which have essentially the same
507 definition. Note that we already checked for equality of the type
508 qualifiers (just above). */
513 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
517 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
521 {
532 {
539 /* Target types must match incl. qualifiers. */
544 /* Sizes must match unless one is missing or variable. */
551 d1_variable = (! d1_zero
554 d2_variable = (! d2_zero
568 }
577 }
579 }
581 /* Return 1 if TTL and TTR are pointers to types that are equivalent,
582 ignoring their qualifiers. */
584 static int
587 {
590 /* Give maybe_objc_comptypes a crack at letting these types through. */
600 }
601 \f
602 /* Subroutines of `comptypes'. */
604 /* Return 1 if two function types F1 and F2 are compatible.
605 If either type specifies no argument types,
606 the other must specify a fixed number of self-promoting arg types.
607 Otherwise, if one type specifies only the number of arguments,
608 the other must specify that number of self-promoting arg types.
609 Otherwise, the argument types must match. */
611 static int
614 {
616 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
627 /* An unspecified parmlist matches any specified parmlist
628 whose argument types don't need default promotions. */
631 {
634 /* If one of these types comes from a non-prototype fn definition,
635 compare that with the other type's arglist.
636 If they don't match, ask for a warning (but no error). */
641 }
643 {
650 }
652 /* Both types have argument lists: compare them and propagate results. */
655 }
657 /* Check two lists of types for compatibility,
658 returning 0 for incompatible, 1 for compatible,
659 or 2 for compatible with warning. */
661 static int
664 {
665 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
670 {
673 /* If one list is shorter than the other,
674 they fail to match. */
677 /* A null pointer instead of a type
678 means there is supposed to be an argument
679 but nothing is specified about what type it has.
680 So match anything that self-promotes. */
682 {
685 }
687 {
690 }
693 {
694 /* Allow wait (union {union wait *u; int *i} *)
695 and wait (union wait *) to be compatible. */
702 {
703 tree memb;
710 }
717 {
718 tree memb;
725 }
726 else
728 }
730 /* comptypes said ok, but record if it said to warn. */
736 }
737 }
738 \f
739 tree
741 tree type;
742 {
744 tree size;
750 else
751 /* Convert in case a char is more than one unit. */
756 /* SIZE will have an integer type with TYPE_IS_SIZETYPE set.
757 TYPE_IS_SIZETYPE means that certain things (like overflow) will
758 never happen. However, this node should really have type
759 `size_t', which is just a typedef for an ordinary integer type. */
761 }
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. */
1167 {
1183 }
1186 }
1192 }
1193 \f
1194 /* Given an expression PTR for a pointer, return an expression
1195 for the value pointed to.
1196 ERRORSTRING is the name of the operator to appear in error messages. */
1198 tree
1200 tree ptr;
1202 {
1207 {
1209 && !flag_volatile
1213 else
1214 {
1219 {
1222 }
1226 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
1227 so that we get the proper error message if the result is used
1228 to assign to. Also, &* is supposed to be a no-op.
1229 And ANSI C seems to specify that the type of the result
1230 should be the const type. */
1231 /* A de-reference of a pointer to const is not a const. It is valid
1232 to change it via some other pointer. */
1238 }
1239 }
1243 }
1245 /* This handles expressions of the form "a[i]", which denotes
1246 an array reference.
1248 This is logically equivalent in C to *(a+i), but we may do it differently.
1249 If A is a variable or a member, we generate a primitive ARRAY_REF.
1250 This avoids forcing the array out of registers, and can work on
1251 arrays that are not lvalues (for example, members of structures returned
1252 by functions). */
1254 tree
1257 {
1259 {
1262 }
1270 {
1273 /* Subscripting with type char is likely to lose
1274 on a machine where chars are signed.
1275 So warn on any machine, but optionally.
1276 Don't warn for unsigned char since that type is safe.
1277 Don't warn for signed char because anyone who uses that
1278 must have done so deliberately. */
1283 /* Apply default promotions *after* noticing character types. */
1286 /* Require integer *after* promotion, for sake of enums. */
1288 {
1291 }
1293 /* An array that is indexed by a non-constant
1294 cannot be stored in a register; we must be able to do
1295 address arithmetic on its address.
1296 Likewise an array of elements of variable size. */
1300 {
1303 }
1304 /* An array that is indexed by a constant value which is not within
1305 the array bounds cannot be stored in a register either; because we
1306 would get a crash in store_bit_field/extract_bit_field when trying
1307 to access a non-existent part of the register. */
1311 {
1314 }
1317 {
1325 }
1329 /* Array ref is const/volatile if the array elements are
1330 or if the array is. */
1339 /* This was added by rms on 16 Nov 91.
1340 It fixes vol struct foo *a; a->elts[1]
1341 in an inline function.
1342 Hope it doesn't break something else. */
1345 }
1347 {
1351 /* Do the same warning check as above, but only on the part that's
1352 syntactically the index and only if it is also semantically
1353 the index. */
1359 /* Put the integer in IND to simplify error checking. */
1361 {
1365 }
1372 {
1375 }
1377 {
1380 }
1384 }
1385 }
1386 \f
1387 /* Build an external reference to identifier ID. FUN indicates
1388 whether this will be used for a function call. */
1389 tree
1391 tree id;
1393 {
1394 tree ref;
1402 {
1406 {
1408 /* Ordinary implicit function declaration. */
1410 else
1411 {
1412 /* Implicit declaration of built-in function. Don't
1413 change the built-in declaration, but don't let this
1414 go by silently, either. */
1417 /* only issue this warning once */
1420 }
1421 }
1422 else
1423 {
1424 /* Reference to undeclared variable, including reference to
1425 builtin outside of function-call context. */
1429 else
1430 {
1433 {
1438 {
1442 }
1443 }
1446 }
1448 }
1449 }
1450 else
1451 {
1452 /* Properly declared variable or function reference. */
1456 {
1460 }
1461 else
1463 }
1472 {
1475 }
1478 }
1480 /* Build a function call to function FUNCTION with parameters PARAMS.
1481 PARAMS is a list--a chain of TREE_LIST nodes--in which the
1482 TREE_VALUE of each node is a parameter-expression.
1483 FUNCTION's data type may be a function type or a pointer-to-function. */
1485 tree
1488 {
1490 tree coerced_params;
1493 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
1496 /* Convert anything with function type to a pointer-to-function. */
1498 {
1502 /* Differs from default_conversion by not setting TREE_ADDRESSABLE
1503 (because calling an inline function does not mean the function
1504 needs to be separately compiled). */
1510 }
1511 else
1521 {
1524 }
1529 /* fntype now gets the type of function pointed to. */
1532 /* Convert the parameters to the types declared in the
1533 function prototype, or apply default promotions. */
1535 coerced_params
1538 /* Check that the arguments to the function are valid. */
1542 /* Recognize certain built-in functions so we can make tree-codes
1543 other than CALL_EXPR. We do this when it enables fold-const.c
1544 to do something useful. */
1549 {
1554 }
1564 }
1565 \f
1566 /* Convert the argument expressions in the list VALUES
1567 to the types in the list TYPELIST. The result is a list of converted
1568 argument expressions.
1570 If TYPELIST is exhausted, or when an element has NULL as its type,
1571 perform the default conversions.
1573 PARMLIST is the chain of parm decls for the function being called.
1574 It may be 0, if that info is not available.
1575 It is used only for generating error messages.
1577 NAME is an IDENTIFIER_NODE or 0. It is used only for error messages.
1579 This is also where warnings about wrong number of args are generated.
1581 Both VALUES and the returned value are chains of TREE_LIST nodes
1582 with the elements of the list in the TREE_VALUE slots of those nodes. */
1584 static tree
1587 {
1592 /* Scan the given expressions and types, producing individual
1593 converted arguments and pushing them on RESULT in reverse order. */
1596 valtail;
1598 {
1603 {
1607 else
1610 }
1612 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
1613 /* Do not use STRIP_NOPS here! We do not want an enumerator with value 0
1614 to convert automatically to a pointer. */
1623 {
1624 /* Formal parm type is specified by a function prototype. */
1625 tree parmval;
1628 {
1631 }
1632 else
1633 {
1634 /* Optionally warn about conversions that
1635 differ from the default conversions. */
1637 {
1642 warn_for_assignment ("%s as integer rather than floating due to prototype", (char *) 0, name, parmnum + 1);
1645 warn_for_assignment ("%s as integer rather than complex due to prototype", (char *) 0, name, parmnum + 1);
1648 warn_for_assignment ("%s as complex rather than floating due to prototype", (char *) 0, name, parmnum + 1);
1651 warn_for_assignment ("%s as floating rather than integer due to prototype", (char *) 0, name, parmnum + 1);
1654 warn_for_assignment ("%s as complex rather than integer due to prototype", (char *) 0, name, parmnum + 1);
1657 warn_for_assignment ("%s as floating rather than complex due to prototype", (char *) 0, name, parmnum + 1);
1658 /* ??? At some point, messages should be written about
1659 conversions between complex types, but that's too messy
1660 to do now. */
1663 {
1664 /* Warn if any argument is passed as `float',
1665 since without a prototype it would be `double'. */
1667 warn_for_assignment ("%s as `float' rather than `double' due to prototype", (char *) 0, name, parmnum + 1);
1668 }
1669 /* Detect integer changing in width or signedness.
1670 These warnings are only activated with
1671 -Wconversion, not with -Wtraditional. */
1674 {
1681 /* No warning if function asks for enum
1682 and the actual arg is that enum type. */
1683 ;
1685 warn_for_assignment ("%s with different width due to prototype", (char *) 0, name, parmnum + 1);
1687 ;
1688 /* Don't complain if the formal parameter type
1689 is an enum, because we can't tell now whether
1690 the value was an enum--even the same enum. */
1692 ;
1695 /* Change in signedness doesn't matter
1696 if a constant value is unaffected. */
1697 ;
1698 /* Likewise for a constant in a NOP_EXPR. */
1702 ;
1707 /* Change in signedness doesn't matter
1708 if an enum value is unaffected. */
1709 ;
1710 #endif
1711 /* If the value is extended from a narrower
1712 unsigned type, it doesn't matter whether we
1713 pass it as signed or unsigned; the value
1714 certainly is the same either way. */
1717 ;
1720 else
1722 }
1723 }
1733 }
1735 }
1739 /* Convert `float' to `double'. */
1741 else
1742 /* Convert `short' and `char' to full-size `int'. */
1747 }
1750 {
1754 else
1756 }
1759 }
1760 \f
1761 /* This is the entry point used by the parser
1762 for binary operators in the input.
1763 In addition to constructing the expression,
1764 we check for operands that were written with other binary operators
1765 in a way that is likely to confuse the user. */
1767 tree
1771 {
1788 /* Check for cases such as x+y<<z which users are likely
1789 to misinterpret. If parens are used, C_EXP_ORIGINAL_CODE
1790 is cleared to prevent these warnings. */
1792 {
1794 {
1798 }
1801 {
1805 }
1808 {
1814 /* Check cases like x|y==z */
1817 }
1820 {
1826 /* Check cases like x^y==z */
1829 }
1832 {
1836 /* Check cases like x&y==z */
1839 }
1840 }
1842 /* Similarly, check for cases like 1<=i<=10 that are probably errors. */
1853 /* Record the code that was specified in the source,
1854 for the sake of warnings about confusing nesting. */
1857 else
1858 {
1860 /* We used to use NOP_EXPR rather than NON_LVALUE_EXPR
1861 so that convert_for_assignment wouldn't strip it.
1862 That way, we got warnings for things like p = (1 - 1).
1863 But it turns out we should not get those warnings. */
1867 }
1870 }
1872 /* Build a binary-operation expression without default conversions.
1873 CODE is the kind of expression to build.
1874 This function differs from `build' in several ways:
1875 the data type of the result is computed and recorded in it,
1876 warnings are generated if arg data types are invalid,
1877 special handling for addition and subtraction of pointers is known,
1878 and some optimization is done (operations on narrow ints
1879 are done in the narrower type when that gives the same result).
1880 Constant folding is also done before the result is returned.
1882 Note that the operands will never have enumeral types, or function
1883 or array types, because either they will have the default conversions
1884 performed or they have both just been converted to some other type in which
1885 the arithmetic is to be done. */
1887 tree
1892 {
1897 /* Expression code to give to the expression when it is built.
1898 Normally this is CODE, which is what the caller asked for,
1899 but in some special cases we change it. */
1902 /* Data type in which the computation is to be performed.
1903 In the simplest cases this is the common type of the arguments. */
1906 /* Nonzero means operands have already been type-converted
1907 in whatever way is necessary.
1908 Zero means they need to be converted to RESULT_TYPE. */
1911 /* Nonzero means create the expression with this type, rather than
1912 RESULT_TYPE. */
1915 /* Nonzero means after finally constructing the expression
1916 convert it to this type. */
1919 /* Nonzero if this is an operation like MIN or MAX which can
1920 safely be computed in short if both args are promoted shorts.
1921 Also implies COMMON.
1922 -1 indicates a bitwise operation; this makes a difference
1923 in the exact conditions for when it is safe to do the operation
1924 in a narrower mode. */
1927 /* Nonzero if this is a comparison operation;
1928 if both args are promoted shorts, compare the original shorts.
1929 Also implies COMMON. */
1932 /* Nonzero if this is a right-shift operation, which can be computed on the
1933 original short and then promoted if the operand is a promoted short. */
1936 /* Nonzero means set RESULT_TYPE to the common type of the args. */
1940 {
1943 }
1944 else
1945 {
1948 }
1953 /* The expression codes of the data types of the arguments tell us
1954 whether the arguments are integers, floating, pointers, etc. */
1958 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
1962 /* If an error was already reported for one of the arguments,
1963 avoid reporting another error. */
1969 {
1971 /* Handle the pointer + int case. */
1976 else
1981 /* Subtraction of two similar pointers.
1982 We must subtract them as integers, then divide by object size. */
1986 /* Handle pointer minus int. Just like pointer plus int. */
1989 else
2002 /* Floating point division by zero is a legitimate way to obtain
2003 infinities and NaNs. */
2011 {
2014 else
2015 /* Although it would be tempting to shorten always here, that
2016 loses on some targets, since the modulo instruction is
2017 undefined if the quotient can't be represented in the
2018 computation mode. We shorten only if unsigned or if
2019 dividing by something we know != -1. */
2024 }
2043 {
2044 /* Although it would be tempting to shorten always here, that loses
2045 on some targets, since the modulo instruction is undefined if the
2046 quotient can't be represented in the computation mode. We shorten
2047 only if unsigned or if dividing by something we know != -1. */
2052 }
2064 {
2065 /* Result of these operations is always an int,
2066 but that does not mean the operands should be
2067 converted to ints! */
2072 }
2075 /* Shift operations: result has same type as first operand;
2076 always convert second operand to int.
2077 Also set SHORT_SHIFT if shifting rightward. */
2081 {
2083 {
2086 else
2087 {
2093 }
2094 }
2096 /* Use the type of the value to be shifted. */
2098 /* Convert the shift-count to an integer, regardless of size
2099 of value being shifted. */
2102 /* Avoid converting op1 to result_type later. */
2104 }
2109 {
2111 {
2117 }
2119 /* Use the type of the value to be shifted. */
2121 /* Convert the shift-count to an integer, regardless of size
2122 of value being shifted. */
2125 /* Avoid converting op1 to result_type later. */
2127 }
2133 {
2135 {
2140 }
2142 /* Use the type of the value to be shifted. */
2144 /* Convert the shift-count to an integer, regardless of size
2145 of value being shifted. */
2148 /* Avoid converting op1 to result_type later. */
2150 }
2157 /* Result of comparison is always int,
2158 but don't convert the args to int! */
2168 {
2171 /* Anything compares with void *. void * compares with anything.
2172 Otherwise, the targets must be compatible
2173 and both must be object or both incomplete. */
2177 {
2178 /* op0 != orig_op0 detects the case of something
2179 whose value is 0 but which isn't a valid null ptr const. */
2183 }
2185 {
2189 }
2190 else
2195 }
2203 {
2206 }
2208 {
2211 }
2220 {
2222 {
2227 }
2228 else
2229 {
2232 }
2233 }
2245 {
2247 {
2255 }
2256 else
2257 {
2260 }
2261 }
2264 {
2268 }
2271 {
2275 }
2277 {
2280 }
2282 {
2285 }
2297 {
2300 }
2306 }
2310 &&
2313 {
2319 /* For certain operations (which identify themselves by shorten != 0)
2320 if both args were extended from the same smaller type,
2321 do the arithmetic in that type and then extend.
2323 shorten !=0 and !=1 indicates a bitwise operation.
2324 For them, this optimization is safe only if
2325 both args are zero-extended or both are sign-extended.
2326 Otherwise, we might change the result.
2327 Eg, (short)-1 | (unsigned short)-1 is (int)-1
2328 but calculated in (unsigned short) it would be (unsigned short)-1. */
2331 {
2335 /* UNS is 1 if the operation to be done is an unsigned one. */
2337 tree type;
2341 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
2342 but it *requires* conversion to FINAL_TYPE. */
2353 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
2355 /* For bitwise operations, signedness of nominal type
2356 does not matter. Consider only how operands were extended. */
2360 /* Note that in all three cases below we refrain from optimizing
2361 an unsigned operation on sign-extended args.
2362 That would not be valid. */
2364 /* Both args variable: if both extended in same way
2365 from same width, do it in that width.
2366 Do it unsigned if args were zero-extended. */
2373 result_type
2374 = c_common_signed_or_unsigned_type
2380 && (type
2389 && (type
2394 }
2396 /* Shifts can be shortened if shifting right. */
2399 {
2409 /* We can shorten only if the shift count is less than the
2410 number of bits in the smaller type size. */
2412 /* We cannot drop an unsigned shift after sign-extension. */
2414 {
2415 /* Do an unsigned shift if the operand was zero-extended. */
2416 result_type
2419 /* Convert value-to-be-shifted to that type. */
2423 }
2424 }
2426 /* Comparison operations are shortened too but differently.
2427 They identify themselves by setting short_compare = 1. */
2430 {
2431 /* Don't write &op0, etc., because that would prevent op0
2432 from being kept in a register.
2433 Instead, make copies of the our local variables and
2434 pass the copies by reference, then copy them back afterward. */
2437 tree val
2449 {
2461 /* Give warnings for comparisons between signed and unsigned
2462 quantities that may fail.
2464 Do the checking based on the original operand trees, so that
2465 casts will be considered, but default promotions won't be.
2467 Do not warn if the comparison is being done in a signed type,
2468 since the signed type will only be chosen if it can represent
2469 all the values of the unsigned type. */
2472 /* Do not warn if both operands are the same signedness. */
2475 else
2476 {
2481 else
2484 /* Do not warn if the signed quantity is an
2485 unsuffixed integer literal (or some static
2486 constant expression involving such literals or a
2487 conditional expression involving such literals)
2488 and it is non-negative. */
2491 /* Do not warn if the comparison is an equality operation,
2492 the unsigned quantity is an integral constant, and it
2493 would fit in the result if the result were signed. */
2496 && int_fits_type_p
2499 /* Do not warn if the unsigned quantity is an enumeration
2500 constant and its maximum value would fit in the result
2501 if the result were signed. */
2504 && int_fits_type_p
2508 else
2510 }
2512 /* Warn if two unsigned values are being compared in a size
2513 larger than their original size, and one (and only one) is the
2514 result of a `~' operator. This comparison will always fail.
2516 Also warn if one operand is a constant, and the constant
2517 does not have all bits set that are set in the ~ operand
2518 when it is extended. */
2522 {
2526 else
2531 {
2532 tree primop;
2537 {
2541 }
2542 else
2543 {
2547 }
2552 {
2556 }
2557 }
2564 }
2565 }
2566 }
2567 }
2569 /* At this point, RESULT_TYPE must be nonzero to avoid an error message.
2570 If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
2571 Then the expression will be built.
2572 It will be given type FINAL_TYPE if that is nonzero;
2573 otherwise, it will be given type RESULT_TYPE. */
2576 {
2579 }
2582 {
2587 }
2592 {
2594 tree folded;
2602 }
2603 }
2604 \f
2605 /* Return a tree for the difference of pointers OP0 and OP1.
2606 The resulting tree has type int. */
2608 static tree
2611 {
2620 {
2625 }
2627 /* If the conversion to ptrdiff_type does anything like widening or
2628 converting a partial to an integral mode, we get a convert_expression
2629 that is in the way to do any simplifications.
2630 (fold-const.c doesn't know that the extra bits won't be needed.
2631 split_tree uses STRIP_SIGN_NOPS, which leaves conversions to a
2632 different mode in place.)
2633 So first try to find a common term here 'by hand'; we want to cover
2634 at least the cases that occur in legal static initializers. */
2639 {
2642 }
2643 else
2647 {
2650 }
2651 else
2655 {
2658 }
2661 /* First do the subtraction as integers;
2662 then drop through to build the divide operator.
2663 Do not do default conversions on the minus operator
2664 in case restype is a short type. */
2668 /* This generates an error if op1 is pointer to incomplete type. */
2672 /* This generates an error if op0 is pointer to incomplete type. */
2675 /* Divide by the size, in easiest possible way. */
2683 }
2684 \f
2685 /* Construct and perhaps optimize a tree representation
2686 for a unary operation. CODE, a tree_code, specifies the operation
2687 and XARG is the operand.
2688 For any CODE other than ADDR_EXPR, FLAG nonzero suppresses
2689 the default promotions (such as from short to int).
2690 For ADDR_EXPR, the default promotions are not applied; FLAG nonzero
2691 allows non-lvalues; this is only used to handle conversion of non-lvalue
2692 arrays to pointers in C99. */
2694 tree
2697 tree xarg;
2699 {
2700 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
2704 tree val;
2713 {
2715 /* This is used for unary plus, because a CONVERT_EXPR
2716 is enough to prevent anybody from looking inside for
2717 associativity, but won't generate any code. */
2720 {
2723 }
2733 {
2736 }
2743 {
2746 }
2748 {
2754 }
2755 else
2756 {
2759 }
2765 {
2768 }
2774 /* Conjugating a real value is a no-op, but allow it anyway. */
2777 {
2780 }
2789 /* These will convert to a pointer. */
2791 {
2794 }
2806 else
2814 else
2821 /* Handle complex lvalues (when permitted)
2822 by reduction to simpler cases. */
2828 /* Increment or decrement the real part of the value,
2829 and don't change the imaginary part. */
2831 {
2842 }
2844 /* Report invalid types. */
2848 {
2851 else
2855 }
2857 {
2858 tree inc;
2864 /* Compute the increment. */
2867 {
2868 /* If pointer target is an undefined struct,
2869 we just cannot know how to do the arithmetic. */
2871 {
2874 else
2876 }
2880 {
2883 else
2885 }
2888 }
2889 else
2894 /* Handle incrementing a cast-expression. */
2898 {
2907 /* If the real type has the same machine representation
2908 as the type it is cast to, we can make better output
2909 by adding directly to the inside of the cast. */
2915 else
2916 {
2920 else
2921 {
2925 else
2934 }
2937 }
2942 }
2943 give_up:
2945 /* Complain about anything else that is not a true lvalue. */
2952 /* Report a read-only lvalue. */
2961 else
2968 }
2971 /* Note that this operation never does default_conversion. */
2973 /* Let &* cancel out to simplify resulting code. */
2975 {
2976 /* Don't let this be an lvalue. */
2980 }
2982 /* For &x[y], return x+y */
2984 {
2989 }
2991 /* Handle complex lvalues (when permitted)
2992 by reduction to simpler cases. */
2998 float f; *&(int)f = 3.4 stores in int format
2999 whereas (int)f = 3.4 stores in float format. */
3000 /* Address of a cast is just a cast of the address
3001 of the operand of the cast. */
3003 {
3016 }
3017 #endif
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 #if 0
3085 /* If CONVERSIONS is a conversion expression or a nested sequence of such,
3086 convert ARG with the same conversions in the same order
3087 and return the result. */
3089 static tree
3091 tree conversions;
3092 tree arg;
3093 {
3095 {
3105 arg));
3109 }
3110 }
3113 /* Return nonzero if REF is an lvalue valid for this language.
3114 Lvalues can be assigned, unless their type has TYPE_READONLY.
3115 Lvalues can have their address taken, unless they have DECL_REGISTER. */
3117 int
3119 tree ref;
3120 {
3124 {
3149 }
3150 }
3152 /* Return nonzero if REF is an lvalue valid for this language;
3153 otherwise, print an error message and return zero. */
3155 int
3157 tree ref;
3159 {
3166 }
3168 /* Apply unary lvalue-demanding operator CODE to the expression ARG
3169 for certain kinds of expressions which are not really lvalues
3170 but which we can accept as lvalues. If FLAG is nonzero, then
3171 non-lvalues are OK since we may be converting a non-lvalue array to
3172 a pointer in C99.
3174 If ARG is not a kind of expression we can handle, return zero. */
3176 static tree
3179 tree arg;
3181 {
3182 /* Handle (a, b) used as an "lvalue". */
3184 {
3187 /* If this returns a function type, it isn't really being used as
3188 an lvalue, so don't issue a warning about it. */
3194 }
3196 /* Handle (a ? b : c) used as an "lvalue". */
3198 {
3208 }
3211 }
3213 /* If pedantic, warn about improper lvalue. CODE is either COND_EXPR
3214 COMPOUND_EXPR, or CONVERT_EXPR (for casts). */
3216 static void
3219 {
3222 {
3232 }
3233 }
3234 \f
3235 /* Warn about storing in something that is `const'. */
3237 void
3239 tree arg;
3241 {
3243 {
3246 else
3249 }
3253 else
3255 }
3256 \f
3257 /* Mark EXP saying that we need to be able to take the
3258 address of it; it should not be allocated in a register.
3259 Returns true if successful. */
3261 bool
3263 tree exp;
3264 {
3269 {
3272 {
3276 }
3278 /* ... fall through ... */
3298 {
3300 {
3304 }
3307 }
3309 {
3311 {
3315 }
3317 /* If we are making this addressable due to its having
3318 volatile components, give a different error message. Also
3319 handle the case of an unnamed parameter by not trying
3320 to give the name. */
3323 {
3326 }
3330 }
3333 /* drops in */
3339 #endif
3343 }
3344 }
3345 \f
3346 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
3348 tree
3351 {
3352 tree type1;
3353 tree type2;
3362 /* Don't promote the operands separately if they promote
3363 the same way. Return the unpromoted type and let the combined
3364 value get promoted if necessary. */
3370 {
3375 }
3376 #endif
3378 /* Promote both alternatives. */
3395 /* Quickly detect the usual case where op1 and op2 have the same type
3396 after promotion. */
3398 {
3401 else
3403 }
3408 {
3411 /* If -Wsign-compare, warn here if type1 and type2 have
3412 different signedness. We'll promote the signed to unsigned
3413 and later code won't know it used to be different.
3414 Do this check on the original types, so that explicit casts
3415 will be considered, but default promotions won't. */
3418 {
3423 {
3424 /* Do not warn if the result type is signed, since the
3425 signed type will only be chosen if it can represent
3426 all the values of the unsigned type. */
3429 /* Do not warn if the signed quantity is an unsuffixed
3430 integer literal (or some static constant expression
3431 involving such literals) and it is non-negative. */
3435 else
3437 }
3438 }
3439 }
3441 {
3445 }
3447 {
3457 {
3462 }
3464 {
3469 }
3470 else
3471 {
3474 }
3475 }
3477 {
3480 else
3481 {
3483 }
3485 }
3487 {
3490 else
3491 {
3493 }
3495 }
3498 {
3501 else
3502 {
3505 }
3506 }
3508 /* Merge const and volatile flags of the incoming types. */
3509 result_type
3523 }
3524 \f
3525 /* Given a list of expressions, return a compound expression
3526 that performs them all and returns the value of the last of them. */
3528 tree
3530 tree list;
3531 {
3533 }
3535 static tree
3537 tree list;
3539 {
3540 tree rest;
3543 {
3544 /* Convert arrays and functions to pointers when there
3545 really is a comma operator. */
3551 /* Consider (x, y+0), which is not an lvalue since y+0 is not. */
3553 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
3556 #endif
3558 /* Don't let (0, 0) be null pointer constant. */
3562 }
3567 {
3568 /* The left-hand operand of a comma expression is like an expression
3569 statement: with -W or -Wunused, we should warn if it doesn't have
3570 any side-effects, unless it was explicitly cast to (void). */
3576 /* When pedantic, a compound expression can be neither an lvalue
3577 nor an integer constant expression. */
3580 }
3582 /* With -Wunused, we should also warn if the left-hand operand does have
3583 side-effects, but computes a value which is not used. For example, in
3584 `foo() + bar(), baz()' the result of the `+' operator is not used,
3585 so we should issue a warning. */
3590 }
3592 /* Build an expression representing a cast to type TYPE of expression EXPR. */
3594 tree
3596 tree type;
3597 tree expr;
3598 {
3605 #if 0
3606 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
3609 #endif
3612 {
3615 }
3618 {
3621 }
3624 {
3626 {
3630 }
3631 }
3633 {
3634 tree field;
3643 {
3645 tree t;
3650 {
3653 else
3655 }
3656 else
3662 }
3665 }
3666 else
3667 {
3670 /* If casting to void, avoid the error that would come
3671 from default_conversion in the case of a non-lvalue array. */
3675 /* Convert functions and arrays to pointers,
3676 but don't convert any other types. */
3680 /* Optionally warn about potentially worrisome casts. */
3685 {
3691 /* Check that the qualifiers on IN_TYPE are a superset of
3692 the qualifiers of IN_OTYPE. The outermost level of
3693 POINTER_TYPE nodes is uninteresting and we stop as soon
3694 as we hit a non-POINTER_TYPE node on either type. */
3695 do
3696 {
3700 /* GNU C allows cv-qualified function types. 'const'
3701 means the function is very pure, 'volatile' means it
3702 can't return. We need to warn when such qualifiers
3703 are added, not when they're taken away. */
3707 else
3709 }
3717 /* There are qualifiers present in IN_OTYPE that are not
3718 present in IN_TYPE. */
3720 }
3722 /* Warn about possible alignment problems. */
3728 /* Don't warn about opaque types, where the actual alignment
3729 restriction is unknown. */
3750 /* Don't warn about converting any constant. */
3757 /* Ignore any integer overflow caused by the cast. */
3759 {
3762 }
3763 }
3765 /* Pedantically, don't let (void *) (FOO *) 0 be a null pointer constant. */
3771 /* If pedantic, don't let a cast be an lvalue. */
3776 }
3778 /* Interpret a cast of expression EXPR to type TYPE. */
3779 tree
3782 {
3785 /* This avoids warnings about unprototyped casts on
3786 integers. E.g. "#define SIG_DFL (void(*)())0". */
3793 }
3795 \f
3796 /* Build an assignment expression of lvalue LHS from value RHS.
3797 MODIFYCODE is the code for a binary operator that we use
3798 to combine the old value of LHS with RHS to get the new value.
3799 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment. */
3801 tree
3805 {
3806 tree result;
3807 tree newrhs;
3811 /* Types that aren't fully specified cannot be used in assignments. */
3814 /* Avoid duplicate error messages from operands that had errors. */
3818 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
3819 /* Do not use STRIP_NOPS here. We do not want an enumerator
3820 whose value is 0 to count as a null pointer constant. */
3826 /* Handle control structure constructs used as "lvalues". */
3829 {
3830 /* Handle (a, b) used as an "lvalue". */
3839 /* Handle (a ? b : c) used as an "lvalue". */
3843 {
3844 /* Produce (a ? (b = rhs) : (c = rhs))
3845 except that the RHS goes through a save-expr
3846 so the code to compute it is only emitted once. */
3847 tree cond
3855 /* Make sure the code to compute the rhs comes out
3856 before the split. */
3858 /* But cast it to void to avoid an "unused" error. */
3860 }
3863 }
3865 /* If a binary op has been requested, combine the old LHS value with the RHS
3866 producing the value we should actually store into the LHS. */
3869 {
3872 }
3874 /* Handle a cast used as an "lvalue".
3875 We have already performed any binary operator using the value as cast.
3876 Now convert the result to the cast type of the lhs,
3877 and then true type of the lhs and store it there;
3878 then convert result back to the cast type to be the value
3879 of the assignment. */
3882 {
3891 {
3893 tree result;
3901 }
3905 }
3907 /* Now we have handled acceptable kinds of LHS that are not truly lvalues.
3908 Reject anything strange now. */
3913 /* Warn about storing in something that is `const'. */
3921 /* If storing into a structure or union member,
3922 it has probably been given type `int'.
3923 Compute the type that would go with
3924 the actual amount of storage the member occupies. */
3933 /* If storing in a field that is in actuality a short or narrower than one,
3934 we must store in the field in its actual type. */
3937 {
3940 }
3942 /* Convert new value to destination type. */
3949 /* Scan operands */
3954 /* If we got the LHS in a different type for storing in,
3955 convert the result back to the nominal type of LHS
3956 so that the value we return always has the same type
3957 as the LHS argument. */
3963 }
3964 \f
3965 /* Convert value RHS to type TYPE as preparation for an assignment
3966 to an lvalue of type TYPE.
3967 The real work of conversion is done by `convert'.
3968 The purpose of this function is to generate error messages
3969 for assignments that are not allowed in C.
3970 ERRTYPE is a string to use in error messages:
3971 "assignment", "return", etc. If it is null, this is parameter passing
3972 for a function call (and different error messages are output).
3974 FUNNAME is the name of the function being called,
3975 as an IDENTIFIER_NODE, or null.
3976 PARMNUM is the number of the argument, for printing in error messages. */
3978 static tree
3984 {
3986 tree rhstype;
3989 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
3990 /* Do not use STRIP_NOPS here. We do not want an enumerator
3991 whose value is 0 to count as a null pointer constant. */
4008 {
4010 /* Check for Objective-C protocols. This will issue a warning if
4011 there are protocol violations. No need to use the return value. */
4014 }
4017 {
4020 }
4021 /* A type converts to a reference to it.
4022 This code doesn't fully support references, it's just for the
4023 special case of va_start and va_copy. */
4026 {
4028 {
4031 }
4036 /* We already know that these two types are compatible, but they
4037 may not be exactly identical. In fact, `TREE_TYPE (type)' is
4038 likely to be __builtin_va_list and `TREE_TYPE (rhs)' is
4039 likely to be va_list, a typedef to __builtin_va_list, which
4040 is different enough that it will cause problems later. */
4046 }
4047 /* Arithmetic types all interconvert, and enum is treated like int. */
4056 /* Conversion to a transparent union from its member types.
4057 This applies only to function arguments. */
4059 {
4060 tree memb_types;
4065 {
4076 {
4080 /* Any non-function converts to a [const][volatile] void *
4081 and vice versa; otherwise, targets must be the same.
4082 Meanwhile, the lhs target must have all the qualifiers of
4083 the rhs. */
4086 {
4087 /* If this type won't generate any warnings, use it. */
4097 /* Keep looking for a better type, but remember this one. */
4100 }
4101 }
4103 /* Can convert integer zero to any pointer type. */
4107 {
4110 }
4111 }
4114 {
4116 {
4117 /* We have only a marginally acceptable member type;
4118 it needs a warning. */
4122 /* Const and volatile mean something different for function
4123 types, so the usual warnings are not appropriate. */
4126 {
4127 /* Because const and volatile on functions are
4128 restrictions that say the function will not do
4129 certain things, it is okay to use a const or volatile
4130 function where an ordinary one is wanted, but not
4131 vice-versa. */
4135 }
4139 parmnum);
4140 }
4146 }
4147 }
4149 /* Conversions among pointers */
4152 {
4156 /* Any non-function converts to a [const][volatile] void *
4157 and vice versa; otherwise, targets must be the same.
4158 Meanwhile, the lhs target must have all the qualifiers of the rhs. */
4163 {
4166 ||
4168 /* Check TREE_CODE to catch cases like (void *) (char *) 0
4169 which are not ANSI null ptr constants. */
4174 /* Const and volatile mean something different for function types,
4175 so the usual warnings are not appropriate. */
4178 {
4182 /* If this is not a case of ignoring a mismatch in signedness,
4183 no warning. */
4186 ;
4187 /* If there is a mismatch, do warn. */
4191 }
4194 {
4195 /* Because const and volatile on functions are restrictions
4196 that say the function will not do certain things,
4197 it is okay to use a const or volatile function
4198 where an ordinary one is wanted, but not vice-versa. */
4202 }
4203 }
4204 else
4208 }
4210 {
4211 /* An explicit constant 0 can convert to a pointer,
4212 or one that results from arithmetic, even including
4213 a cast to integer type. */
4215 &&
4220 {
4224 }
4226 }
4228 {
4232 }
4237 {
4239 {
4245 else
4248 }
4249 else
4251 parmnum);
4252 }
4253 else
4257 }
4259 /* Convert VALUE for assignment into inlined parameter PARM. */
4261 tree
4264 {
4267 /* If FN was prototyped, the value has been converted already
4268 in convert_arguments. */
4281 }
4283 /* Print a warning using MSGID.
4284 It gets OPNAME as its one parameter.
4285 If OPNAME is null, it is replaced by "passing arg ARGNUM of `FUNCTION'".
4286 FUNCTION and ARGNUM are handled specially if we are building an
4287 Objective-C selector. */
4289 static void
4293 tree function;
4295 {
4297 {
4302 {
4305 }
4307 {
4308 /* Function name is known; supply it. */
4315 }
4316 else
4317 {
4318 /* Function name unknown (call through ptr); just give arg number. */
4322 }
4324 }
4326 }
4327 \f
4328 /* If VALUE is a compound expr all of whose expressions are constant, then
4329 return its value. Otherwise, return error_mark_node.
4331 This is for handling COMPOUND_EXPRs as initializer elements
4332 which is allowed with a warning when -pedantic is specified. */
4334 static tree
4336 tree value;
4337 tree endtype;
4338 {
4340 {
4345 endtype);
4346 }
4350 else
4352 }
4353 \f
4354 /* Perform appropriate conversions on the initial value of a variable,
4355 store it in the declaration DECL,
4356 and print any error messages that are appropriate.
4357 If the init is invalid, store an ERROR_MARK. */
4359 void
4362 {
4365 /* If variable's type was invalidly declared, just ignore it. */
4371 /* Digest the specified initializer into an expression. */
4375 /* Store the expression if valid; else report error. */
4377 #if 0
4378 /* Note that this is the only place we can detect the error
4379 in a case such as struct foo bar = (struct foo) { x, y };
4380 where there is one initial value which is a constructor expression. */
4382 ;
4384 {
4387 }
4390 {
4393 }
4394 else
4395 {
4397 {
4402 }
4403 }
4404 #endif
4412 /* ANSI wants warnings about out-of-range constant initializers. */
4416 /* Check if we need to set array size from compound literal size. */
4420 {
4428 {
4432 {
4433 /* For int foo[] = (int [3]){1}; we need to set array size
4434 now since later on array initializer will be just the
4435 brace enclosed list of the compound literal. */
4439 }
4440 }
4441 }
4442 }
4443 \f
4444 /* Methods for storing and printing names for error messages. */
4446 /* Implement a spelling stack that allows components of a name to be pushed
4447 and popped. Each element on the stack is this structure. */
4449 struct spelling
4450 {
4452 union
4453 {
4457 };
4459 #define SPELLING_STRING 1
4460 #define SPELLING_MEMBER 2
4461 #define SPELLING_BOUNDS 3
4467 /* Macros to save and restore the spelling stack around push_... functions.
4468 Alternative to SAVE_SPELLING_STACK. */
4470 #define SPELLING_DEPTH() (spelling - spelling_base)
4471 #define RESTORE_SPELLING_DEPTH(DEPTH) (spelling = spelling_base + (DEPTH))
4473 /* Push an element on the spelling stack with type KIND and assign VALUE
4474 to MEMBER. */
4476 #define PUSH_SPELLING(KIND, VALUE, MEMBER) \
4477 { \
4478 int depth = SPELLING_DEPTH (); \
4479 \
4480 if (depth >= spelling_size) \
4481 { \
4482 spelling_size += 10; \
4483 if (spelling_base == 0) \
4484 spelling_base \
4485 = (struct spelling *) xmalloc (spelling_size * sizeof (struct spelling)); \
4486 else \
4487 spelling_base \
4488 = (struct spelling *) xrealloc (spelling_base, \
4489 spelling_size * sizeof (struct spelling)); \
4490 RESTORE_SPELLING_DEPTH (depth); \
4491 } \
4492 \
4493 spelling->kind = (KIND); \
4494 spelling->MEMBER = (VALUE); \
4495 spelling++; \
4496 }
4498 /* Push STRING on the stack. Printed literally. */
4500 static void
4503 {
4505 }
4507 /* Push a member name on the stack. Printed as '.' STRING. */
4509 static void
4511 tree decl;
4513 {
4517 }
4519 /* Push an array bounds on the stack. Printed as [BOUNDS]. */
4521 static void
4524 {
4526 }
4528 /* Compute the maximum size in bytes of the printed spelling. */
4530 static int
4532 {
4537 {
4540 else
4542 }
4545 }
4547 /* Print the spelling to BUFFER and return it. */
4552 {
4558 {
4561 }
4562 else
4563 {
4568 ;
4569 }
4572 }
4574 /* Issue an error message for a bad initializer component.
4575 MSGID identifies the message.
4576 The component name is taken from the spelling stack. */
4578 void
4581 {
4588 }
4590 /* Issue a pedantic warning for a bad initializer component.
4591 MSGID identifies the message.
4592 The component name is taken from the spelling stack. */
4594 void
4597 {
4604 }
4606 /* Issue a warning for a bad initializer component.
4607 MSGID identifies the message.
4608 The component name is taken from the spelling stack. */
4610 static void
4613 {
4620 }
4621 \f
4622 /* Digest the parser output INIT as an initializer for type TYPE.
4623 Return a C expression of type TYPE to represent the initial value.
4625 REQUIRE_CONSTANT requests an error if non-constant initializers or
4626 elements are seen. */
4628 static tree
4632 {
4641 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
4642 /* Do not use STRIP_NOPS here. We do not want an enumerator
4643 whose value is 0 to count as a null pointer constant. */
4649 /* Initialization of an array of chars from a string constant
4650 optionally enclosed in braces. */
4653 {
4661 {
4669 {
4672 }
4676 {
4679 }
4685 /* Subtract 1 (or sizeof (wchar_t))
4686 because it's ok to ignore the terminating null char
4687 that is counted in the length of the constant. */
4698 }
4699 }
4701 /* Any type can be initialized
4702 from an expression of the same type, optionally with braces. */
4716 {
4722 {
4723 /* As an extension, allow initializing objects with static storage
4724 duration with compound literals (which are then treated just as
4725 the brace enclosed list they contain). */
4728 }
4732 {
4735 }
4740 /* Compound expressions can only occur here if -pedantic or
4741 -pedantic-errors is specified. In the later case, we always want
4742 an error. In the former case, we simply want a warning. */
4745 {
4746 inside_init
4751 else
4755 }
4758 /* This test catches things like `7 / 0' which
4759 result in an expression for which TREE_CONSTANT
4760 is true, but which is not actually something
4761 that is a legal constant. We really should not
4762 be using this function, because it is a part of
4763 the back-end. Instead, the expression should
4764 already have been turned into ERROR_MARK_NODE. */
4767 {
4770 }
4773 }
4775 /* Handle scalar types, including conversions. */
4779 {
4780 /* Note that convert_for_assignment calls default_conversion
4781 for arrays and functions. We must not call it in the
4782 case where inside_init is a null pointer constant. */
4783 inside_init
4788 {
4791 }
4794 {
4797 }
4800 }
4802 /* Come here only for records and arrays. */
4805 {
4808 }
4812 }
4813 \f
4814 /* Handle initializers that use braces. */
4816 /* Type of object we are accumulating a constructor for.
4817 This type is always a RECORD_TYPE, UNION_TYPE or ARRAY_TYPE. */
4820 /* For a RECORD_TYPE or UNION_TYPE, this is the chain of fields
4821 left to fill. */
4824 /* For an ARRAY_TYPE, this is the specified index
4825 at which to store the next element we get. */
4828 /* For an ARRAY_TYPE, this is the maximum index. */
4831 /* For a RECORD_TYPE, this is the first field not yet written out. */
4834 /* For an ARRAY_TYPE, this is the index of the first element
4835 not yet written out. */
4838 /* In a RECORD_TYPE, the byte index of the next consecutive field.
4839 This is so we can generate gaps between fields, when appropriate. */
4842 /* If we are saving up the elements rather than allocating them,
4843 this is the list of elements so far (in reverse order,
4844 most recent first). */
4847 /* 1 if constructor should be incrementally stored into a constructor chain,
4848 0 if all the elements should be kept in AVL tree. */
4851 /* 1 if so far this constructor's elements are all compile-time constants. */
4854 /* 1 if so far this constructor's elements are all valid address constants. */
4857 /* 1 if this constructor is erroneous so far. */
4860 /* 1 if have called defer_addressed_constants. */
4863 /* Structure for managing pending initializer elements, organized as an
4864 AVL tree. */
4866 struct init_node
4867 {
4871 tree purpose;
4872 tree value;
4873 };
4875 /* Tree of pending elements at this constructor level.
4876 These are elements encountered out of order
4877 which belong at places we haven't reached yet in actually
4878 writing the output.
4879 Will never hold tree nodes across GC runs. */
4882 /* The SPELLING_DEPTH of this constructor. */
4885 /* 0 if implicitly pushing constructor levels is allowed. */
4891 /* DECL node for which an initializer is being read.
4892 0 means we are reading a constructor expression
4893 such as (struct foo) {...}. */
4896 /* start_init saves the ASMSPEC arg here for really_start_incremental_init. */
4899 /* Nonzero if this is an initializer for a top-level decl. */
4902 /* Nonzero if there were any member designators in this initializer. */
4905 /* Nesting depth of designator list. */
4908 /* Nonzero if there were diagnosed errors in this designator list. */
4911 \f
4912 /* This stack has a level for each implicit or explicit level of
4913 structuring in the initializer, including the outermost one. It
4914 saves the values of most of the variables above. */
4918 struct constructor_stack
4919 {
4921 tree type;
4922 tree fields;
4923 tree index;
4924 tree max_index;
4925 tree unfilled_index;
4926 tree unfilled_fields;
4927 tree bit_index;
4928 tree elements;
4932 /* If nonzero, this value should replace the entire
4933 constructor at this level. */
4934 tree replacement_value;
4943 };
4947 /* This stack represents designators from some range designator up to
4948 the last designator in the list. */
4950 struct constructor_range_stack
4951 {
4954 tree range_start;
4955 tree index;
4956 tree range_end;
4957 tree fields;
4958 };
4962 /* This stack records separate initializers that are nested.
4963 Nested initializers can't happen in ANSI C, but GNU C allows them
4964 in cases like { ... (struct foo) { ... } ... }. */
4966 struct initializer_stack
4967 {
4969 tree decl;
4973 tree elements;
4981 };
4984 \f
4985 /* Prepare to parse and output the initializer for variable DECL. */
4987 void
4989 tree decl;
4990 tree asmspec_tree;
4992 {
5023 {
5025 require_constant_elements
5027 /* For a scalar, you can always use any value to initialize,
5028 even within braces. */
5034 }
5035 else
5036 {
5040 }
5053 }
5055 void
5057 {
5060 /* Output subconstants (string constants, usually)
5061 that were referenced within this initializer and saved up.
5062 Must do this if and only if we called defer_addressed_constants. */
5066 /* Free the whole constructor stack of this initializer. */
5068 {
5072 }
5077 /* Pop back to the data of the outer initializer (if any). */
5092 }
5093 \f
5094 /* Call here when we see the initializer is surrounded by braces.
5095 This is instead of a call to push_init_level;
5096 it is matched by a call to pop_init_level.
5098 TYPE is the type to initialize, for a constructor expression.
5099 For an initializer for a decl, TYPE is zero. */
5101 void
5103 tree type;
5104 {
5146 {
5148 /* Skip any nameless bit fields at the beginning. */
5155 }
5157 {
5159 {
5160 constructor_max_index
5163 /* Detect non-empty initializations of zero-length arrays. */
5168 /* constructor_max_index needs to be an INTEGER_CST. Attempts
5169 to initialize VLAs will cause an proper error; avoid tree
5170 checking errors as well by setting a safe value. */
5175 constructor_index
5178 }
5179 else
5183 }
5185 {
5186 /* Vectors are like simple fixed-size arrays. */
5187 constructor_max_index =
5191 }
5192 else
5193 {
5194 /* Handle the case of int x = {5}; */
5197 }
5198 }
5199 \f
5200 /* Push down into a subobject, for initialization.
5201 If this is for an explicit set of braces, IMPLICIT is 0.
5202 If it is because the next element belongs at a lower level,
5203 IMPLICIT is 1 (or 2 if the push is because of designator list). */
5205 void
5208 {
5212 /* If we've exhausted any levels that didn't have braces,
5213 pop them now. */
5215 {
5223 else
5225 }
5227 /* Unless this is an explicit brace, we need to preserve previous
5228 content if any. */
5230 {
5237 }
5270 {
5275 }
5277 /* Don't die if an entire brace-pair level is superfluous
5278 in the containing level. */
5280 ;
5283 {
5284 /* Don't die if there are extra init elts at the end. */
5287 else
5288 {
5291 constructor_depth++;
5292 }
5293 }
5295 {
5298 constructor_depth++;
5299 }
5302 {
5307 }
5310 {
5318 }
5321 {
5324 }
5328 {
5330 /* Skip any nameless bit fields at the beginning. */
5337 }
5339 {
5340 /* Vectors are like simple fixed-size arrays. */
5341 constructor_max_index =
5345 }
5347 {
5349 {
5350 constructor_max_index
5353 /* Detect non-empty initializations of zero-length arrays. */
5358 /* constructor_max_index needs to be an INTEGER_CST. Attempts
5359 to initialize VLAs will cause an proper error; avoid tree
5360 checking errors as well by setting a safe value. */
5365 constructor_index
5368 }
5369 else
5374 {
5375 /* We need to split the char/wchar array into individual
5376 characters, so that we don't have to special case it
5377 everywhere. */
5379 }
5380 }
5381 else
5382 {
5386 }
5387 }
5389 /* At the end of an implicit or explicit brace level,
5390 finish up that level of constructor.
5391 If we were outputting the elements as they are read, return 0
5392 from inner levels (process_init_element ignores that),
5393 but return error_mark_node from the outermost level
5394 (that's what we want to put in DECL_INITIAL).
5395 Otherwise, return a CONSTRUCTOR expression. */
5397 tree
5400 {
5405 {
5406 /* When we come to an explicit close brace,
5407 pop any inner levels that didn't have explicit braces. */
5413 }
5417 /* Error for initializing a flexible array member, or a zero-length
5418 array member in an inappropriate context. */
5423 {
5424 /* Silently discard empty initializations. The parser will
5425 already have pedwarned for empty brackets. */
5429 {
5435 /* We have already issued an error message for the existence
5436 of a flexible array member not at the end of the structure.
5437 Discard the initializer so that we do not abort later. */
5440 }
5441 else
5442 /* Zero-length arrays are no longer special, so we should no longer
5443 get here. */
5445 }
5447 /* Warn when some struct elements are implicitly initialized to zero. */
5449 && constructor_type
5452 {
5453 /* Do not warn for flexible array members or zero-length arrays. */
5459 /* Do not warn if this level of the initializer uses member
5460 designators; it is likely to be deliberate. */
5462 {
5466 }
5467 }
5469 /* Now output all pending elements. */
5473 /* Pad out the end of the structure. */
5475 /* If this closes a superfluous brace pair,
5476 just pass out the element between them. */
5479 ;
5484 {
5485 /* A nonincremental scalar initializer--just return
5486 the element, after verifying there is just one. */
5488 {
5492 }
5494 {
5497 }
5498 else
5500 }
5501 else
5502 {
5505 else
5506 {
5513 }
5514 }
5539 {
5543 }
5545 }
5547 /* Common handling for both array range and field name designators.
5548 ARRAY argument is non-zero for array ranges. Returns zero for success. */
5550 static int
5553 {
5554 tree subtype;
5557 /* Don't die if an entire brace-pair level is superfluous
5558 in the containing level. */
5562 /* If there were errors in this designator list already, bail out silently. */
5567 {
5571 /* Designator list starts at the level of closest explicit
5572 braces. */
5577 }
5580 {
5583 }
5587 {
5591 }
5593 {
5595 }
5596 else
5601 {
5604 }
5606 {
5609 }
5614 }
5616 /* If there are range designators in designator list, push a new designator
5617 to constructor_range_stack. RANGE_END is end of such stack range or
5618 NULL_TREE if there is no range designator at this level. */
5620 static void
5622 tree range_end;
5623 {
5638 }
5640 /* Within an array initializer, specify the next index to be initialized.
5641 FIRST is that index. If LAST is nonzero, then initialize a range
5642 of indices, running from FIRST through LAST. */
5644 void
5647 {
5677 else
5678 {
5682 {
5686 {
5689 }
5690 else
5691 {
5695 {
5698 }
5699 }
5700 }
5702 designator_depth++;
5706 }
5707 }
5709 /* Within a struct initializer, specify the next field to be initialized. */
5711 void
5713 tree fieldname;
5714 {
5715 tree tail;
5724 {
5727 }
5731 {
5734 }
5739 else
5740 {
5742 designator_depth++;
5746 }
5747 }
5748 \f
5749 /* Add a new initializer to the tree of pending initializers. PURPOSE
5750 identifies the initializer, either array index or field in a structure.
5751 VALUE is the value of that index or field. */
5753 static void
5756 {
5763 {
5765 {
5771 else
5772 {
5777 }
5778 }
5779 }
5780 else
5781 {
5782 tree bitpos;
5786 {
5792 else
5793 {
5798 }
5799 }
5800 }
5813 {
5817 {
5821 {
5823 {
5824 /* L rotation. */
5837 {
5840 else
5842 }
5843 else
5845 }
5846 else
5847 {
5848 /* LR rotation. */
5870 {
5873 else
5875 }
5876 else
5878 }
5880 }
5881 else
5882 {
5883 /* p->balance == +1; growth of left side balances the node. */
5886 }
5887 }
5889 {
5891 /* Growth propagation from right side. */
5894 {
5896 {
5897 /* R rotation. */
5910 {
5913 else
5915 }
5916 else
5918 }
5920 {
5921 /* RL rotation */
5943 {
5946 else
5948 }
5949 else
5951 }
5953 }
5954 else
5955 {
5956 /* p->balance == -1; growth of right side balances the node. */
5959 }
5960 }
5964 }
5965 }
5967 /* Build AVL tree from a sorted chain. */
5969 static void
5971 {
5972 tree chain;
5982 {
5984 /* Skip any nameless bit fields at the beginning. */
5990 }
5992 {
5994 constructor_unfilled_index
5997 else
5999 }
6001 }
6003 /* Build AVL tree from a string constant. */
6005 static void
6007 tree str;
6008 {
6023 else
6034 {
6036 {
6039 }
6040 else
6041 {
6045 {
6048 else
6053 }
6054 }
6057 {
6060 {
6062 {
6065 }
6066 }
6068 {
6071 }
6076 }
6081 }
6084 }
6086 /* Return value of FIELD in pending initializer or zero if the field was
6087 not initialized yet. */
6089 static tree
6091 tree field;
6092 {
6096 {
6103 {
6108 else
6110 }
6111 }
6113 {
6117 && (!constructor_unfilled_fields
6124 {
6129 else
6131 }
6132 }
6134 {
6138 }
6140 }
6142 /* "Output" the next constructor element.
6143 At top level, really output it to assembler code now.
6144 Otherwise, collect it in a list from which we will make a CONSTRUCTOR.
6145 TYPE is the data type that the containing data type wants here.
6146 FIELD is the field (a FIELD_DECL) or the index that this element fills.
6148 PENDING if non-nil means output pending elements that belong
6149 right after this element. (PENDING is normally 1;
6150 it is 0 while outputting pending elements, to avoid recursion.) */
6152 static void
6156 {
6168 {
6169 /* As an extension, allow initializing objects with static storage
6170 duration with compound literals (which are then treated just as
6171 the brace enclosed list they contain). */
6174 }
6188 {
6191 }
6196 /* If this field is empty (and not at the end of structure),
6197 don't do anything other than checking the initializer. */
6208 {
6211 }
6213 /* If this element doesn't come next in sequence,
6214 put it on constructor_pending_elts. */
6216 && (!constructor_incremental
6218 {
6225 }
6227 && (!constructor_incremental
6229 {
6230 /* We do this for records but not for unions. In a union,
6231 no matter which field is specified, it can be initialized
6232 right away since it starts at the beginning of the union. */
6234 {
6237 else
6238 {
6246 }
6247 }
6251 }
6254 {
6258 /* We can have just one union field set. */
6260 }
6262 /* Otherwise, output this element either to
6263 constructor_elements or to the assembler file. */
6267 constructor_elements
6270 /* Advance the variable that indicates sequential elements output. */
6272 constructor_unfilled_index
6274 bitsize_one_node);
6276 {
6277 constructor_unfilled_fields
6280 /* Skip any nameless bit fields. */
6284 constructor_unfilled_fields =
6286 }
6290 /* Now output any pending elements which have become next. */
6293 }
6295 /* Output any pending elements which have become next.
6296 As we output elements, constructor_unfilled_{fields,index}
6297 advances, which may cause other elements to become next;
6298 if so, they too are output.
6300 If ALL is 0, we return when there are
6301 no more pending elements to output now.
6303 If ALL is 1, we output space as necessary so that
6304 we can output all the pending elements. */
6306 static void
6309 {
6311 tree next;
6313 retry:
6315 /* Look thru the whole pending tree.
6316 If we find an element that should be output now,
6317 output it. Otherwise, set NEXT to the element
6318 that comes first among those still pending. */
6322 {
6324 {
6326 constructor_unfilled_index))
6332 {
6333 /* Advance to the next smaller node. */
6336 else
6337 {
6338 /* We have reached the smallest node bigger than the
6339 current unfilled index. Fill the space first. */
6342 }
6343 }
6344 else
6345 {
6346 /* Advance to the next bigger node. */
6349 else
6350 {
6351 /* We have reached the biggest node in a subtree. Find
6352 the parent of it, which is the next bigger node. */
6358 {
6361 }
6362 }
6363 }
6364 }
6367 {
6370 /* If the current record is complete we are done. */
6376 /* We can't compare fields here because there might be empty
6377 fields in between. */
6379 {
6383 }
6385 {
6386 /* Advance to the next smaller node. */
6389 else
6390 {
6391 /* We have reached the smallest node bigger than the
6392 current unfilled field. Fill the space first. */
6395 }
6396 }
6397 else
6398 {
6399 /* Advance to the next bigger node. */
6402 else
6403 {
6404 /* We have reached the biggest node in a subtree. Find
6405 the parent of it, which is the next bigger node. */
6412 {
6415 }
6416 }
6417 }
6418 }
6419 }
6421 /* Ordinarily return, but not if we want to output all
6422 and there are elements left. */
6426 /* If it's not incremental, just skip over the gap, so that after
6427 jumping to retry we will output the next successive element. */
6434 /* ELT now points to the node in the pending tree with the next
6435 initializer to output. */
6437 }
6438 \f
6439 /* Add one non-braced element to the current constructor level.
6440 This adjusts the current position within the constructor's type.
6441 This may also start or terminate implicit levels
6442 to handle a partly-braced initializer.
6444 Once this has found the correct level for the new element,
6445 it calls output_init_element. */
6447 void
6449 tree value;
6450 {
6457 /* Handle superfluous braces around string cst as in
6458 char x[] = {"foo"}; */
6460 && constructor_type
6464 {
6469 }
6472 {
6475 }
6477 /* Ignore elements of a brace group if it is entirely superfluous
6478 and has already been diagnosed. */
6482 /* If we've exhausted any levels that didn't have braces,
6483 pop them now. */
6485 {
6493 constructor_index)))
6495 else
6497 }
6499 /* In the case of [LO ... HI] = VALUE, only evaluate VALUE once. */
6501 {
6502 /* If value is a compound literal and we'll be just using its
6503 content, don't put it into a SAVE_EXPR. */
6505 || !require_constant_value
6508 }
6511 {
6513 {
6514 tree fieldtype;
6518 {
6521 }
6528 /* Error for non-static initialization of a flexible array member. */
6530 && !require_constant_value
6533 {
6536 }
6538 /* Accept a string constant to initialize a subarray. */
6544 /* Otherwise, if we have come to a subaggregate,
6545 and we don't have an element of its type, push into it. */
6551 {
6554 }
6557 {
6561 }
6562 else
6563 /* Do the bookkeeping for an element that was
6564 directly output as a constructor. */
6565 {
6566 /* For a record, keep track of end position of last field. */
6568 constructor_bit_index
6574 /* Skip any nameless bit fields. */
6578 constructor_unfilled_fields =
6580 }
6583 /* Skip any nameless bit fields at the beginning. */
6588 }
6590 {
6591 tree fieldtype;
6595 {
6598 }
6605 /* Warn that traditional C rejects initialization of unions.
6606 We skip the warning if the value is zero. This is done
6607 under the assumption that the zero initializer in user
6608 code appears conditioned on e.g. __STDC__ to avoid
6609 "missing initializer" warnings and relies on default
6610 initialization to zero in the traditional C case.
6611 We also skip the warning if the initializer is designated,
6612 again on the assumption that this must be conditional on
6613 __STDC__ anyway (and we've already complained about the
6614 member-designator already). */
6619 /* Accept a string constant to initialize a subarray. */
6625 /* Otherwise, if we have come to a subaggregate,
6626 and we don't have an element of its type, push into it. */
6632 {
6635 }
6638 {
6642 }
6643 else
6644 /* Do the bookkeeping for an element that was
6645 directly output as a constructor. */
6646 {
6649 }
6652 }
6654 {
6658 /* Accept a string constant to initialize a subarray. */
6664 /* Otherwise, if we have come to a subaggregate,
6665 and we don't have an element of its type, push into it. */
6671 {
6674 }
6679 {
6682 }
6684 /* Now output the actual element. */
6686 {
6690 }
6692 constructor_index
6696 /* If we are doing the bookkeeping for an element that was
6697 directly output as a constructor, we must update
6698 constructor_unfilled_index. */
6700 }
6702 {
6705 /* Do a basic check of initializer size. Note that vectors
6706 always have a fixed size derived from their type. */
6708 {
6711 }
6713 /* Now output the actual element. */
6717 constructor_index
6721 /* If we are doing the bookkeeping for an element that was
6722 directly output as a constructor, we must update
6723 constructor_unfilled_index. */
6725 }
6727 /* Handle the sole element allowed in a braced initializer
6728 for a scalar variable. */
6730 {
6733 }
6734 else
6735 {
6739 }
6741 /* Handle range initializers either at this level or anywhere higher
6742 in the designator stack. */
6744 {
6751 {
6755 }
6759 {
6763 }
6770 {
6774 {
6777 }
6785 }
6790 }
6793 }
6796 }
6797 \f
6798 /* Build a simple asm-statement, from one string literal. */
6799 tree
6801 tree expr;
6802 {
6809 {
6810 tree stmt;
6814 NULL_TREE));
6817 }
6821 }
6823 /* Build an asm-statement, whose components are a CV_QUALIFIER, a
6824 STRING, some OUTPUTS, some INPUTS, and some CLOBBERS. */
6826 tree
6828 tree cv_qualifier;
6829 tree string;
6830 tree outputs;
6831 tree inputs;
6832 tree clobbers;
6833 {
6834 tree tail;
6837 {
6840 }
6844 {
6848 }
6850 /* We can remove output conversions that change the type,
6851 but not the mode. */
6853 {
6859 /* Allow conversions as LHS here. build_modify_expr as called below
6860 will do the right thing with them. */
6871 }
6873 /* Remove output conversions that change the type but not the mode. */
6875 {
6879 }
6881 /* Perform default conversions on array and function inputs.
6882 Don't do this for other types as it would screw up operands
6883 expected to be in memory. */
6889 }
6891 /* Expand an ASM statement with operands, handling output operands
6892 that are not variables or INDIRECT_REFS by transforming such
6893 cases into cases that expand_asm_operands can handle.
6895 Arguments are same as for expand_asm_operands. */
6897 void
6903 {
6906 /* o[I] is the place that output number I should be written. */
6908 tree tail;
6910 /* Record the contents of OUTPUTS before it is modified. */
6914 /* Generate the ASM_OPERANDS insn; store into the TREE_VALUEs of
6915 OUTPUTS some trees for where the values were actually stored. */
6918 /* Copy all the intermediate outputs into the specified outputs. */
6920 {
6922 {
6927 /* Restore the original value so that it's correct the next
6928 time we expand this function. */
6930 }
6931 /* Detect modification of read-only values.
6932 (Otherwise done by build_modify_expr.) */
6933 else
6934 {
6942 }
6943 }
6945 /* Those MODIFY_EXPRs could do autoincrements. */
6947 }
6948 \f
6949 /* Expand a C `return' statement.
6950 RETVAL is the expression for what to return,
6951 or a null pointer for `return;' with no value. */
6953 tree
6955 tree retval;
6956 {
6963 {
6968 }
6970 {
6974 }
6975 else
6976 {
6980 tree inner;
6988 /* Strip any conversions, additions, and subtractions, and see if
6989 we are returning the address of a local variable. Warn if so. */
6991 {
6993 {
7000 /* If the second operand of the MINUS_EXPR has a pointer
7001 type (or is converted from it), this may be valid, so
7002 don't give a warning. */
7003 {
7017 }
7034 }
7037 }
7040 }
7043 }
7044 \f
7046 /* The SWITCH_STMT being built. */
7047 tree switch_stmt;
7048 /* A splay-tree mapping the low element of a case range to the high
7049 element, or NULL_TREE if there is no high element. Used to
7050 determine whether or not a new case label duplicates an old case
7051 label. We need a tree, rather than simply a hash table, because
7052 of the GNU case range extension. */
7053 splay_tree cases;
7054 /* The next node on the stack. */
7056 };
7058 /* A stack of the currently active switch statements. The innermost
7059 switch statement is on the top of the stack. There is no need to
7060 mark the stack for garbage collection because it is only active
7061 during the processing of the body of a function, and we never
7062 collect at that point. */
7066 /* Start a C switch statement, testing expression EXP. Return the new
7067 SWITCH_STMT. */
7069 tree
7071 tree exp;
7072 {
7078 {
7084 {
7087 }
7088 else
7089 {
7099 }
7100 }
7102 /* Add this new SWITCH_STMT to the stack. */
7110 }
7112 /* Process a case label. */
7114 tree
7116 tree low_value;
7117 tree high_value;
7118 {
7122 {
7128 }
7131 else
7135 }
7137 /* Finish the switch statement. */
7139 void
7141 {
7146 /* Pop the stack. */
7150 }