| blob | 4134113557a39663b45389272626f0f4c72234e6 |
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). */
48 /* Nonzero if we've already printed a "missing braces around initializer"
49 message within this initializer. */
52 /* 1 if we explained undeclared var errors. */
87 \f
88 /* Do `exp = require_complete_type (exp);' to make sure exp
89 does not have an incomplete type. (That includes void types.) */
91 tree
93 tree value;
94 {
100 /* First, detect a valid value with a complete type. */
106 }
108 /* Print an error message for invalid use of an incomplete type.
109 VALUE is the expression that was used (or 0 if that isn't known)
110 and TYPE is the type that was invalid. */
112 void
114 tree value;
115 tree type;
116 {
119 /* Avoid duplicate error message. */
127 else
128 {
129 retry:
130 /* We must print an error message. Be clever about what it says. */
133 {
152 {
154 {
157 }
160 }
166 }
171 else
172 /* If this type has a typedef-name, the TYPE_NAME is a TYPE_DECL. */
175 }
176 }
178 /* Given a type, apply default promotions wrt unnamed function
179 arguments and return the new type. */
181 tree
183 tree type;
184 {
189 {
190 /* Preserve unsignedness if not really getting any wider. */
195 }
198 }
200 /* Return a variant of TYPE which has all the type qualifiers of LIKE
201 as well as those of TYPE. */
203 static tree
206 {
209 }
210 \f
211 /* Return the common type of two types.
212 We assume that comptypes has already been done and returned 1;
213 if that isn't so, this may crash. In particular, we assume that qualifiers
214 match.
216 This is the type for the result of most arithmetic operations
217 if the operands have the given two types. */
219 tree
222 {
225 tree attributes;
227 /* Save time if the two types are the same. */
231 /* If one type is nonsense, use the other. */
237 /* Merge the attributes. */
240 /* Treat an enum type as the unsigned integer type of the same width. */
250 /* If one type is complex, form the common type of the non-complex
251 components, then make that complex. Use T1 or T2 if it is the
252 required type. */
254 {
263 else
265 attributes);
266 }
269 {
272 /* If only one is real, use it as the result. */
280 /* Both real or both integers; use the one with greater precision. */
287 /* Same precision. Prefer longs to ints even when same size. */
292 attributes);
296 {
297 /* But preserve unsignedness from the other type,
298 since long cannot hold all the values of an unsigned int. */
301 else
304 }
306 /* Likewise, prefer long double to double even if same size. */
310 attributes);
312 /* Otherwise prefer the unsigned one. */
316 else
320 /* For two pointers, do this recursively on the target type,
321 and combine the qualifiers of the two types' targets. */
322 /* This code was turned off; I don't know why.
323 But ANSI C specifies doing this with the qualifiers.
324 So I turned it on again. */
325 {
335 }
336 #if 0
339 #endif
342 {
344 /* Save space: see if the result is identical to one of the args. */
349 /* Merge the element types, and have a size if either arg has one. */
352 }
355 /* Function types: prefer the one that specified arg types.
356 If both do, merge the arg types. Also merge the return types. */
357 {
365 /* Save space: see if the result is identical to one of the args. */
371 /* Simple way if one arg fails to specify argument types. */
373 {
376 }
378 {
381 }
383 /* If both args specify argument types, we must merge the two
384 lists, argument by argument. */
399 {
400 /* A null type means arg type is not specified.
401 Take whatever the other function type has. */
403 {
406 }
408 {
411 }
413 /* Given wait (union {union wait *u; int *i} *)
414 and wait (union wait *),
415 prefer union wait * as type of parm. */
418 {
419 tree memb;
423 {
428 }
429 }
432 {
433 tree memb;
437 {
442 }
443 }
445 parm_done: ;
446 }
451 /* ... falls through ... */
452 }
456 }
458 }
459 \f
460 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
461 or various other operations. Return 2 if they are compatible
462 but a warning may be needed if you use them together. */
464 int
467 {
472 /* Suppress errors caused by previously reported errors. */
478 /* If either type is the internal version of sizetype, return the
479 language version. */
488 /* Treat an enum type as the integer type of the same width and
489 signedness. */
499 /* Different classes of types can't be compatible. */
503 /* Qualifiers must match. */
508 /* Allow for two different type nodes which have essentially the same
509 definition. Note that we already checked for equality of the type
510 qualifiers (just above). */
515 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
519 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
523 {
534 {
541 /* Target types must match incl. qualifiers. */
546 /* Sizes must match unless one is missing or variable. */
553 d1_variable = (! d1_zero
556 d2_variable = (! d2_zero
570 }
579 }
581 }
583 /* Return 1 if TTL and TTR are pointers to types that are equivalent,
584 ignoring their qualifiers. REFLEXIVE is only used by ObjC - set it
585 to 1 or 0 depending if the check of the pointer types is meant to
586 be reflexive or not (typically, assignments are not reflexive,
587 while comparisons are reflexive).
588 */
590 static int
594 {
597 /* Give objc_comptypes a crack at letting these types through. */
607 }
608 \f
609 /* Subroutines of `comptypes'. */
611 /* Return 1 if two function types F1 and F2 are compatible.
612 If either type specifies no argument types,
613 the other must specify a fixed number of self-promoting arg types.
614 Otherwise, if one type specifies only the number of arguments,
615 the other must specify that number of self-promoting arg types.
616 Otherwise, the argument types must match. */
618 static int
621 {
623 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
634 /* An unspecified parmlist matches any specified parmlist
635 whose argument types don't need default promotions. */
638 {
641 /* If one of these types comes from a non-prototype fn definition,
642 compare that with the other type's arglist.
643 If they don't match, ask for a warning (but no error). */
648 }
650 {
657 }
659 /* Both types have argument lists: compare them and propagate results. */
662 }
664 /* Check two lists of types for compatibility,
665 returning 0 for incompatible, 1 for compatible,
666 or 2 for compatible with warning. */
668 static int
671 {
672 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
677 {
680 /* If one list is shorter than the other,
681 they fail to match. */
684 /* A null pointer instead of a type
685 means there is supposed to be an argument
686 but nothing is specified about what type it has.
687 So match anything that self-promotes. */
689 {
692 }
694 {
697 }
700 {
701 /* Allow wait (union {union wait *u; int *i} *)
702 and wait (union wait *) to be compatible. */
709 {
710 tree memb;
717 }
724 {
725 tree memb;
732 }
733 else
735 }
737 /* comptypes said ok, but record if it said to warn. */
743 }
744 }
745 \f
746 /* Compute the size to increment a pointer by. */
748 tree
750 tree type;
751 {
758 {
761 }
763 /* Convert in case a char is more than one unit. */
767 }
768 \f
769 /* Return either DECL or its known constant value (if it has one). */
771 tree
773 tree decl;
774 {
776 in a place where a variable is invalid. */
782 /* This is invalid if initial value is not constant.
783 If it has either a function call, a memory reference,
784 or a variable, then re-evaluating it could give different results. */
786 /* Check for cases where this is sub-optimal, even though valid. */
790 }
792 /* Return either DECL or its known constant value (if it has one), but
793 return DECL if pedantic or DECL has mode BLKmode. This is for
794 bug-compatibility with the old behavior of decl_constant_value
795 (before GCC 3.0); every use of this function is a bug and it should
796 be removed before GCC 3.1. It is not appropriate to use pedantic
797 in a way that affects optimization, and BLKmode is probably not the
798 right test for avoiding misoptimizations either. */
800 static tree
802 tree decl;
803 {
806 else
808 }
811 /* Perform the default conversion of arrays and functions to pointers.
812 Return the result of converting EXP. For any other expression, just
813 return EXP. */
815 static tree
817 tree exp;
818 {
819 tree orig_exp;
824 /* Strip NON_LVALUE_EXPRs and no-op conversions, since we aren't using as
825 an lvalue.
827 Do not use STRIP_NOPS here! It will remove conversions from pointer
828 to integer and cause infinite recursion. */
833 {
837 }
839 /* Preserve the original expression code. */
844 {
846 }
848 {
849 tree adr;
851 tree ptrtype;
857 {
860 }
863 restype
874 {
878 }
882 {
883 /* Before C99, non-lvalue arrays do not decay to pointers.
884 Normally, using such an array would be invalid; but it can
885 be used correctly inside sizeof or as a statement expression.
886 Thus, do not give an error here; an error will result later. */
888 }
893 {
894 /* ??? This is not really quite correct
895 in that the type of the operand of ADDR_EXPR
896 is not the target type of the type of the ADDR_EXPR itself.
897 Question is, can this lossage be avoided? */
904 }
905 /* This way is better for a COMPONENT_REF since it can
906 simplify the offset for a component. */
909 }
911 }
913 /* Perform default promotions for C data used in expressions.
914 Arrays and functions are converted to pointers;
915 enumeral types or short or char, to int.
916 In addition, manifest constants symbols are replaced by their values. */
918 tree
920 tree exp;
921 {
922 tree orig_exp;
929 /* Constants can be used directly unless they're not loadable. */
933 /* Replace a nonvolatile const static variable with its value unless
934 it is an array, in which case we must be sure that taking the
935 address of the array produces consistent results. */
937 {
940 }
942 /* Strip NON_LVALUE_EXPRs and no-op conversions, since we aren't using as
943 an lvalue.
945 Do not use STRIP_NOPS here! It will remove conversions from pointer
946 to integer and cause infinite recursion. */
953 /* Preserve the original expression code. */
957 /* Normally convert enums to int,
958 but convert wide enums to something wider. */
960 {
968 }
972 /* If it's thinner than an int, promote it like a
973 c_promoting_integer_type_p, otherwise leave it alone. */
979 {
980 /* Preserve unsignedness if not really getting any wider. */
986 }
989 {
992 }
994 }
995 \f
996 /* Look up COMPONENT in a structure or union DECL.
998 If the component name is not found, returns NULL_TREE. Otherwise,
999 the return value is a TREE_LIST, with each TREE_VALUE a FIELD_DECL
1000 stepping down the chain to the component, which is in the last
1001 TREE_VALUE of the list. Normally the list is of length one, but if
1002 the component is embedded within (nested) anonymous structures or
1003 unions, the list steps down the chain to the component. */
1005 static tree
1008 {
1010 tree field;
1012 /* If TYPE_LANG_SPECIFIC is set, then it is a sorted array of pointers
1013 to the field elements. Use a binary search on this array to quickly
1014 find the element. Otherwise, do a linear search. TYPE_LANG_SPECIFIC
1015 will always be set for structures which have many elements. */
1018 {
1026 {
1031 {
1032 /* Step through all anon unions in linear fashion. */
1034 {
1038 {
1043 }
1044 }
1046 /* Entire record is only anon unions. */
1050 /* Restart the binary search, with new lower bound. */
1052 }
1058 else
1060 }
1066 }
1067 else
1068 {
1070 {
1074 {
1079 }
1083 }
1087 }
1090 }
1092 /* Make an expression to refer to the COMPONENT field of
1093 structure or union value DATUM. COMPONENT is an IDENTIFIER_NODE. */
1095 tree
1098 {
1102 tree ref;
1104 /* If DATUM is a COMPOUND_EXPR, move our reference inside it.
1105 If pedantic ensure that the arguments are not lvalues; otherwise,
1106 if the component is an array, it would wrongly decay to a pointer in
1107 C89 mode.
1108 We cannot do this with a COND_EXPR, because in a conditional expression
1109 the default promotions are applied to both sides, and this would yield
1110 the wrong type of the result; for example, if the components have
1111 type "char". */
1113 {
1115 {
1119 }
1122 }
1124 /* See if there is a field or component with name COMPONENT. */
1127 {
1129 {
1132 }
1137 {
1142 }
1144 /* Chain the COMPONENT_REFs if necessary down to the FIELD.
1145 This might be better solved in future the way the C++ front
1146 end does it - by giving the anonymous entities each a
1147 separate name and type, and then have build_component_ref
1148 recursively call itself. We can't do that here. */
1150 {
1166 }
1169 }
1175 }
1176 \f
1177 /* Given an expression PTR for a pointer, return an expression
1178 for the value pointed to.
1179 ERRORSTRING is the name of the operator to appear in error messages. */
1181 tree
1183 tree ptr;
1185 {
1190 {
1192 && !flag_volatile
1196 else
1197 {
1202 {
1205 }
1209 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
1210 so that we get the proper error message if the result is used
1211 to assign to. Also, &* is supposed to be a no-op.
1212 And ANSI C seems to specify that the type of the result
1213 should be the const type. */
1214 /* A de-reference of a pointer to const is not a const. It is valid
1215 to change it via some other pointer. */
1221 }
1222 }
1226 }
1228 /* This handles expressions of the form "a[i]", which denotes
1229 an array reference.
1231 This is logically equivalent in C to *(a+i), but we may do it differently.
1232 If A is a variable or a member, we generate a primitive ARRAY_REF.
1233 This avoids forcing the array out of registers, and can work on
1234 arrays that are not lvalues (for example, members of structures returned
1235 by functions). */
1237 tree
1240 {
1242 {
1245 }
1253 {
1256 /* Subscripting with type char is likely to lose
1257 on a machine where chars are signed.
1258 So warn on any machine, but optionally.
1259 Don't warn for unsigned char since that type is safe.
1260 Don't warn for signed char because anyone who uses that
1261 must have done so deliberately. */
1266 /* Apply default promotions *after* noticing character types. */
1269 /* Require integer *after* promotion, for sake of enums. */
1271 {
1274 }
1276 /* An array that is indexed by a non-constant
1277 cannot be stored in a register; we must be able to do
1278 address arithmetic on its address.
1279 Likewise an array of elements of variable size. */
1283 {
1286 }
1287 /* An array that is indexed by a constant value which is not within
1288 the array bounds cannot be stored in a register either; because we
1289 would get a crash in store_bit_field/extract_bit_field when trying
1290 to access a non-existent part of the register. */
1294 {
1297 }
1300 {
1308 }
1312 /* Array ref is const/volatile if the array elements are
1313 or if the array is. */
1322 /* This was added by rms on 16 Nov 91.
1323 It fixes vol struct foo *a; a->elts[1]
1324 in an inline function.
1325 Hope it doesn't break something else. */
1328 }
1330 {
1334 /* Do the same warning check as above, but only on the part that's
1335 syntactically the index and only if it is also semantically
1336 the index. */
1342 /* Put the integer in IND to simplify error checking. */
1344 {
1348 }
1355 {
1358 }
1360 {
1363 }
1367 }
1368 }
1369 \f
1370 /* Build an external reference to identifier ID. FUN indicates
1371 whether this will be used for a function call. */
1372 tree
1374 tree id;
1376 {
1377 tree ref;
1385 {
1389 {
1391 /* Ordinary implicit function declaration. */
1393 else
1394 {
1395 /* Implicit declaration of built-in function. Don't
1396 change the built-in declaration, but don't let this
1397 go by silently, either. */
1400 /* only issue this warning once */
1403 }
1404 }
1405 else
1406 {
1407 /* Reference to undeclared variable, including reference to
1408 builtin outside of function-call context. */
1412 else
1413 {
1416 {
1421 {
1425 }
1426 }
1429 }
1431 }
1432 }
1433 else
1434 {
1435 /* Properly declared variable or function reference. */
1439 {
1443 }
1444 else
1446 }
1456 {
1459 }
1462 }
1464 /* Build a function call to function FUNCTION with parameters PARAMS.
1465 PARAMS is a list--a chain of TREE_LIST nodes--in which the
1466 TREE_VALUE of each node is a parameter-expression.
1467 FUNCTION's data type may be a function type or a pointer-to-function. */
1469 tree
1472 {
1474 tree coerced_params;
1477 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
1480 /* Convert anything with function type to a pointer-to-function. */
1482 {
1485 /* Differs from default_conversion by not setting TREE_ADDRESSABLE
1486 (because calling an inline function does not mean the function
1487 needs to be separately compiled). */
1493 }
1494 else
1504 {
1507 }
1512 /* fntype now gets the type of function pointed to. */
1515 /* Convert the parameters to the types declared in the
1516 function prototype, or apply default promotions. */
1518 coerced_params
1521 /* Check that the arguments to the function are valid. */
1525 /* Recognize certain built-in functions so we can make tree-codes
1526 other than CALL_EXPR. We do this when it enables fold-const.c
1527 to do something useful. */
1532 {
1537 }
1547 }
1548 \f
1549 /* Convert the argument expressions in the list VALUES
1550 to the types in the list TYPELIST. The result is a list of converted
1551 argument expressions.
1553 If TYPELIST is exhausted, or when an element has NULL as its type,
1554 perform the default conversions.
1556 PARMLIST is the chain of parm decls for the function being called.
1557 It may be 0, if that info is not available.
1558 It is used only for generating error messages.
1560 NAME is an IDENTIFIER_NODE or 0. It is used only for error messages.
1562 This is also where warnings about wrong number of args are generated.
1564 Both VALUES and the returned value are chains of TREE_LIST nodes
1565 with the elements of the list in the TREE_VALUE slots of those nodes. */
1567 static tree
1570 {
1575 /* Scan the given expressions and types, producing individual
1576 converted arguments and pushing them on RESULT in reverse order. */
1579 valtail;
1581 {
1586 {
1590 else
1593 }
1595 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
1596 /* Do not use STRIP_NOPS here! We do not want an enumerator with value 0
1597 to convert automatically to a pointer. */
1606 {
1607 /* Formal parm type is specified by a function prototype. */
1608 tree parmval;
1611 {
1614 }
1615 else
1616 {
1617 /* Optionally warn about conversions that
1618 differ from the default conversions. */
1620 {
1625 warn_for_assignment ("%s as integer rather than floating due to prototype", (char *) 0, name, parmnum + 1);
1628 warn_for_assignment ("%s as integer rather than complex due to prototype", (char *) 0, name, parmnum + 1);
1631 warn_for_assignment ("%s as complex rather than floating due to prototype", (char *) 0, name, parmnum + 1);
1634 warn_for_assignment ("%s as floating rather than integer due to prototype", (char *) 0, name, parmnum + 1);
1637 warn_for_assignment ("%s as complex rather than integer due to prototype", (char *) 0, name, parmnum + 1);
1640 warn_for_assignment ("%s as floating rather than complex due to prototype", (char *) 0, name, parmnum + 1);
1641 /* ??? At some point, messages should be written about
1642 conversions between complex types, but that's too messy
1643 to do now. */
1646 {
1647 /* Warn if any argument is passed as `float',
1648 since without a prototype it would be `double'. */
1650 warn_for_assignment ("%s as `float' rather than `double' due to prototype", (char *) 0, name, parmnum + 1);
1651 }
1652 /* Detect integer changing in width or signedness.
1653 These warnings are only activated with
1654 -Wconversion, not with -Wtraditional. */
1657 {
1664 /* No warning if function asks for enum
1665 and the actual arg is that enum type. */
1666 ;
1668 warn_for_assignment ("%s with different width due to prototype", (char *) 0, name, parmnum + 1);
1670 ;
1671 /* Don't complain if the formal parameter type
1672 is an enum, because we can't tell now whether
1673 the value was an enum--even the same enum. */
1675 ;
1678 /* Change in signedness doesn't matter
1679 if a constant value is unaffected. */
1680 ;
1681 /* Likewise for a constant in a NOP_EXPR. */
1685 ;
1690 /* Change in signedness doesn't matter
1691 if an enum value is unaffected. */
1692 ;
1693 #endif
1694 /* If the value is extended from a narrower
1695 unsigned type, it doesn't matter whether we
1696 pass it as signed or unsigned; the value
1697 certainly is the same either way. */
1700 ;
1703 else
1705 }
1706 }
1716 }
1718 }
1722 /* Convert `float' to `double'. */
1724 else
1725 /* Convert `short' and `char' to full-size `int'. */
1730 }
1733 {
1737 else
1739 }
1742 }
1743 \f
1744 /* This is the entry point used by the parser
1745 for binary operators in the input.
1746 In addition to constructing the expression,
1747 we check for operands that were written with other binary operators
1748 in a way that is likely to confuse the user. */
1750 tree
1754 {
1771 /* Check for cases such as x+y<<z which users are likely
1772 to misinterpret. If parens are used, C_EXP_ORIGINAL_CODE
1773 is cleared to prevent these warnings. */
1775 {
1777 {
1781 }
1784 {
1788 }
1791 {
1797 /* Check cases like x|y==z */
1800 }
1803 {
1809 /* Check cases like x^y==z */
1812 }
1815 {
1819 /* Check cases like x&y==z */
1822 }
1823 }
1825 /* Similarly, check for cases like 1<=i<=10 that are probably errors. */
1836 /* Record the code that was specified in the source,
1837 for the sake of warnings about confusing nesting. */
1840 else
1841 {
1843 /* We used to use NOP_EXPR rather than NON_LVALUE_EXPR
1844 so that convert_for_assignment wouldn't strip it.
1845 That way, we got warnings for things like p = (1 - 1).
1846 But it turns out we should not get those warnings. */
1850 }
1853 }
1855 /* Build a binary-operation expression without default conversions.
1856 CODE is the kind of expression to build.
1857 This function differs from `build' in several ways:
1858 the data type of the result is computed and recorded in it,
1859 warnings are generated if arg data types are invalid,
1860 special handling for addition and subtraction of pointers is known,
1861 and some optimization is done (operations on narrow ints
1862 are done in the narrower type when that gives the same result).
1863 Constant folding is also done before the result is returned.
1865 Note that the operands will never have enumeral types, or function
1866 or array types, because either they will have the default conversions
1867 performed or they have both just been converted to some other type in which
1868 the arithmetic is to be done. */
1870 tree
1875 {
1880 /* Expression code to give to the expression when it is built.
1881 Normally this is CODE, which is what the caller asked for,
1882 but in some special cases we change it. */
1885 /* Data type in which the computation is to be performed.
1886 In the simplest cases this is the common type of the arguments. */
1889 /* Nonzero means operands have already been type-converted
1890 in whatever way is necessary.
1891 Zero means they need to be converted to RESULT_TYPE. */
1894 /* Nonzero means create the expression with this type, rather than
1895 RESULT_TYPE. */
1898 /* Nonzero means after finally constructing the expression
1899 convert it to this type. */
1902 /* Nonzero if this is an operation like MIN or MAX which can
1903 safely be computed in short if both args are promoted shorts.
1904 Also implies COMMON.
1905 -1 indicates a bitwise operation; this makes a difference
1906 in the exact conditions for when it is safe to do the operation
1907 in a narrower mode. */
1910 /* Nonzero if this is a comparison operation;
1911 if both args are promoted shorts, compare the original shorts.
1912 Also implies COMMON. */
1915 /* Nonzero if this is a right-shift operation, which can be computed on the
1916 original short and then promoted if the operand is a promoted short. */
1919 /* Nonzero means set RESULT_TYPE to the common type of the args. */
1923 {
1926 }
1927 else
1928 {
1931 }
1936 /* The expression codes of the data types of the arguments tell us
1937 whether the arguments are integers, floating, pointers, etc. */
1941 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
1945 /* If an error was already reported for one of the arguments,
1946 avoid reporting another error. */
1952 {
1954 /* Handle the pointer + int case. */
1959 else
1964 /* Subtraction of two similar pointers.
1965 We must subtract them as integers, then divide by object size. */
1969 /* Handle pointer minus int. Just like pointer plus int. */
1972 else
1985 /* Floating point division by zero is a legitimate way to obtain
1986 infinities and NaNs. */
1994 {
1997 else
1998 /* Although it would be tempting to shorten always here, that
1999 loses on some targets, since the modulo instruction is
2000 undefined if the quotient can't be represented in the
2001 computation mode. We shorten only if unsigned or if
2002 dividing by something we know != -1. */
2007 }
2026 {
2027 /* Although it would be tempting to shorten always here, that loses
2028 on some targets, since the modulo instruction is undefined if the
2029 quotient can't be represented in the computation mode. We shorten
2030 only if unsigned or if dividing by something we know != -1. */
2035 }
2047 {
2048 /* Result of these operations is always an int,
2049 but that does not mean the operands should be
2050 converted to ints! */
2055 }
2058 /* Shift operations: result has same type as first operand;
2059 always convert second operand to int.
2060 Also set SHORT_SHIFT if shifting rightward. */
2064 {
2066 {
2069 else
2070 {
2076 }
2077 }
2079 /* Use the type of the value to be shifted. */
2081 /* Convert the shift-count to an integer, regardless of size
2082 of value being shifted. */
2085 /* Avoid converting op1 to result_type later. */
2087 }
2092 {
2094 {
2100 }
2102 /* Use the type of the value to be shifted. */
2104 /* Convert the shift-count to an integer, regardless of size
2105 of value being shifted. */
2108 /* Avoid converting op1 to result_type later. */
2110 }
2116 {
2118 {
2123 }
2125 /* Use the type of the value to be shifted. */
2127 /* Convert the shift-count to an integer, regardless of size
2128 of value being shifted. */
2131 /* Avoid converting op1 to result_type later. */
2133 }
2140 /* Result of comparison is always int,
2141 but don't convert the args to int! */
2151 {
2154 /* Anything compares with void *. void * compares with anything.
2155 Otherwise, the targets must be compatible
2156 and both must be object or both incomplete. */
2160 {
2161 /* op0 != orig_op0 detects the case of something
2162 whose value is 0 but which isn't a valid null ptr const. */
2166 }
2168 {
2172 }
2173 else
2178 }
2186 {
2189 }
2191 {
2194 }
2203 {
2205 {
2210 }
2211 else
2212 {
2215 }
2216 }
2228 {
2230 {
2238 }
2239 else
2240 {
2243 }
2244 }
2247 {
2251 }
2254 {
2258 }
2260 {
2263 }
2265 {
2268 }
2280 {
2283 }
2289 }
2293 &&
2296 {
2302 /* For certain operations (which identify themselves by shorten != 0)
2303 if both args were extended from the same smaller type,
2304 do the arithmetic in that type and then extend.
2306 shorten !=0 and !=1 indicates a bitwise operation.
2307 For them, this optimization is safe only if
2308 both args are zero-extended or both are sign-extended.
2309 Otherwise, we might change the result.
2310 Eg, (short)-1 | (unsigned short)-1 is (int)-1
2311 but calculated in (unsigned short) it would be (unsigned short)-1. */
2314 {
2318 /* UNS is 1 if the operation to be done is an unsigned one. */
2320 tree type;
2324 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
2325 but it *requires* conversion to FINAL_TYPE. */
2336 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
2338 /* For bitwise operations, signedness of nominal type
2339 does not matter. Consider only how operands were extended. */
2343 /* Note that in all three cases below we refrain from optimizing
2344 an unsigned operation on sign-extended args.
2345 That would not be valid. */
2347 /* Both args variable: if both extended in same way
2348 from same width, do it in that width.
2349 Do it unsigned if args were zero-extended. */
2356 result_type
2357 = c_common_signed_or_unsigned_type
2363 && (type
2372 && (type
2377 }
2379 /* Shifts can be shortened if shifting right. */
2382 {
2392 /* We can shorten only if the shift count is less than the
2393 number of bits in the smaller type size. */
2395 /* We cannot drop an unsigned shift after sign-extension. */
2397 {
2398 /* Do an unsigned shift if the operand was zero-extended. */
2399 result_type
2402 /* Convert value-to-be-shifted to that type. */
2406 }
2407 }
2409 /* Comparison operations are shortened too but differently.
2410 They identify themselves by setting short_compare = 1. */
2413 {
2414 /* Don't write &op0, etc., because that would prevent op0
2415 from being kept in a register.
2416 Instead, make copies of the our local variables and
2417 pass the copies by reference, then copy them back afterward. */
2420 tree val
2432 {
2444 /* Give warnings for comparisons between signed and unsigned
2445 quantities that may fail.
2447 Do the checking based on the original operand trees, so that
2448 casts will be considered, but default promotions won't be.
2450 Do not warn if the comparison is being done in a signed type,
2451 since the signed type will only be chosen if it can represent
2452 all the values of the unsigned type. */
2455 /* Do not warn if both operands are the same signedness. */
2458 else
2459 {
2464 else
2467 /* Do not warn if the signed quantity is an
2468 unsuffixed integer literal (or some static
2469 constant expression involving such literals or a
2470 conditional expression involving such literals)
2471 and it is non-negative. */
2474 /* Do not warn if the comparison is an equality operation,
2475 the unsigned quantity is an integral constant, and it
2476 would fit in the result if the result were signed. */
2479 && int_fits_type_p
2482 /* Do not warn if the unsigned quantity is an enumeration
2483 constant and its maximum value would fit in the result
2484 if the result were signed. */
2487 && int_fits_type_p
2491 else
2493 }
2495 /* Warn if two unsigned values are being compared in a size
2496 larger than their original size, and one (and only one) is the
2497 result of a `~' operator. This comparison will always fail.
2499 Also warn if one operand is a constant, and the constant
2500 does not have all bits set that are set in the ~ operand
2501 when it is extended. */
2505 {
2509 else
2514 {
2515 tree primop;
2520 {
2524 }
2525 else
2526 {
2530 }
2535 {
2539 }
2540 }
2547 }
2548 }
2549 }
2550 }
2552 /* At this point, RESULT_TYPE must be nonzero to avoid an error message.
2553 If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
2554 Then the expression will be built.
2555 It will be given type FINAL_TYPE if that is nonzero;
2556 otherwise, it will be given type RESULT_TYPE. */
2559 {
2562 }
2565 {
2570 }
2575 {
2577 tree folded;
2585 }
2586 }
2587 \f
2589 /* Return true if `t' is known to be non-negative. */
2591 int
2593 tree t;
2594 {
2596 {
2599 /* Find the last statement in the chain, ignoring the final
2600 * scope statement */
2605 }
2607 }
2609 /* Return a tree for the difference of pointers OP0 and OP1.
2610 The resulting tree has type int. */
2612 static tree
2615 {
2624 {
2629 }
2631 /* If the conversion to ptrdiff_type does anything like widening or
2632 converting a partial to an integral mode, we get a convert_expression
2633 that is in the way to do any simplifications.
2634 (fold-const.c doesn't know that the extra bits won't be needed.
2635 split_tree uses STRIP_SIGN_NOPS, which leaves conversions to a
2636 different mode in place.)
2637 So first try to find a common term here 'by hand'; we want to cover
2638 at least the cases that occur in legal static initializers. */
2643 {
2646 }
2647 else
2651 {
2654 }
2655 else
2659 {
2662 }
2665 /* First do the subtraction as integers;
2666 then drop through to build the divide operator.
2667 Do not do default conversions on the minus operator
2668 in case restype is a short type. */
2672 /* This generates an error if op1 is pointer to incomplete type. */
2676 /* This generates an error if op0 is pointer to incomplete type. */
2679 /* Divide by the size, in easiest possible way. */
2687 }
2688 \f
2689 /* Construct and perhaps optimize a tree representation
2690 for a unary operation. CODE, a tree_code, specifies the operation
2691 and XARG is the operand.
2692 For any CODE other than ADDR_EXPR, FLAG nonzero suppresses
2693 the default promotions (such as from short to int).
2694 For ADDR_EXPR, the default promotions are not applied; FLAG nonzero
2695 allows non-lvalues; this is only used to handle conversion of non-lvalue
2696 arrays to pointers in C99. */
2698 tree
2701 tree xarg;
2703 {
2704 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
2708 tree val;
2717 {
2719 /* This is used for unary plus, because a CONVERT_EXPR
2720 is enough to prevent anybody from looking inside for
2721 associativity, but won't generate any code. */
2724 {
2727 }
2737 {
2740 }
2747 {
2750 }
2752 {
2758 }
2759 else
2760 {
2763 }
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 Returns true if successful. */
3265 bool
3267 tree exp;
3268 {
3273 {
3276 {
3280 }
3282 /* ... fall through ... */
3302 {
3304 {
3308 }
3311 }
3313 {
3315 {
3319 }
3321 /* If we are making this addressable due to its having
3322 volatile components, give a different error message. Also
3323 handle the case of an unnamed parameter by not trying
3324 to give the name. */
3327 {
3330 }
3334 }
3337 /* drops in */
3343 #endif
3347 }
3348 }
3349 \f
3350 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
3352 tree
3355 {
3356 tree type1;
3357 tree type2;
3366 /* Don't promote the operands separately if they promote
3367 the same way. Return the unpromoted type and let the combined
3368 value get promoted if necessary. */
3374 {
3379 }
3380 #endif
3382 /* Promote both alternatives. */
3399 /* Quickly detect the usual case where op1 and op2 have the same type
3400 after promotion. */
3402 {
3405 else
3407 }
3412 {
3415 /* If -Wsign-compare, warn here if type1 and type2 have
3416 different signedness. We'll promote the signed to unsigned
3417 and later code won't know it used to be different.
3418 Do this check on the original types, so that explicit casts
3419 will be considered, but default promotions won't. */
3422 {
3427 {
3428 /* Do not warn if the result type is signed, since the
3429 signed type will only be chosen if it can represent
3430 all the values of the unsigned type. */
3433 /* Do not warn if the signed quantity is an unsuffixed
3434 integer literal (or some static constant expression
3435 involving such literals) and it is non-negative. */
3439 else
3441 }
3442 }
3443 }
3445 {
3449 }
3451 {
3461 {
3466 }
3468 {
3473 }
3474 else
3475 {
3478 }
3479 }
3481 {
3484 else
3485 {
3487 }
3489 }
3491 {
3494 else
3495 {
3497 }
3499 }
3502 {
3505 else
3506 {
3509 }
3510 }
3512 /* Merge const and volatile flags of the incoming types. */
3513 result_type
3527 }
3528 \f
3529 /* Given a list of expressions, return a compound expression
3530 that performs them all and returns the value of the last of them. */
3532 tree
3534 tree list;
3535 {
3537 }
3539 static tree
3541 tree list;
3543 {
3544 tree rest;
3547 {
3548 /* Convert arrays and functions to pointers when there
3549 really is a comma operator. */
3555 /* Consider (x, y+0), which is not an lvalue since y+0 is not. */
3557 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
3560 #endif
3562 /* Don't let (0, 0) be null pointer constant. */
3566 }
3571 {
3572 /* The left-hand operand of a comma expression is like an expression
3573 statement: with -Wextra or -Wunused, we should warn if it doesn't have
3574 any side-effects, unless it was explicitly cast to (void). */
3580 /* When pedantic, a compound expression can be neither an lvalue
3581 nor an integer constant expression. */
3584 }
3586 /* With -Wunused, we should also warn if the left-hand operand does have
3587 side-effects, but computes a value which is not used. For example, in
3588 `foo() + bar(), baz()' the result of the `+' operator is not used,
3589 so we should issue a warning. */
3594 }
3596 /* Build an expression representing a cast to type TYPE of expression EXPR. */
3598 tree
3600 tree type;
3601 tree expr;
3602 {
3608 /* The ObjC front-end uses TYPE_MAIN_VARIANT to tie together types differing
3609 only in <protocol> qualifications. But when constructing cast expressions,
3610 the protocols do matter and must be kept around. */
3614 #if 0
3615 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
3618 #endif
3621 {
3624 }
3627 {
3630 }
3633 {
3635 {
3639 }
3640 }
3642 {
3643 tree field;
3652 {
3653 tree t;
3661 }
3664 }
3665 else
3666 {
3669 /* If casting to void, avoid the error that would come
3670 from default_conversion in the case of a non-lvalue array. */
3674 /* Convert functions and arrays to pointers,
3675 but don't convert any other types. */
3679 /* Optionally warn about potentially worrisome casts. */
3684 {
3690 /* Check that the qualifiers on IN_TYPE are a superset of
3691 the qualifiers of IN_OTYPE. The outermost level of
3692 POINTER_TYPE nodes is uninteresting and we stop as soon
3693 as we hit a non-POINTER_TYPE node on either type. */
3694 do
3695 {
3699 /* GNU C allows cv-qualified function types. 'const'
3700 means the function is very pure, 'volatile' means it
3701 can't return. We need to warn when such qualifiers
3702 are added, not when they're taken away. */
3706 else
3708 }
3716 /* There are qualifiers present in IN_OTYPE that are not
3717 present in IN_TYPE. */
3719 }
3721 /* Warn about possible alignment problems. */
3727 /* Don't warn about opaque types, where the actual alignment
3728 restriction is unknown. */
3749 /* Don't warn about converting any constant. */
3759 {
3760 /* Casting the address of a decl to non void pointer. Warn
3761 if the cast breaks type based aliasing. */
3768 }
3773 /* Ignore any integer overflow caused by the cast. */
3775 {
3778 }
3779 }
3781 /* Pedantically, don't let (void *) (FOO *) 0 be a null pointer constant. */
3787 /* If pedantic, don't let a cast be an lvalue. */
3792 }
3794 /* Interpret a cast of expression EXPR to type TYPE. */
3795 tree
3798 {
3801 /* This avoids warnings about unprototyped casts on
3802 integers. E.g. "#define SIG_DFL (void(*)())0". */
3809 }
3811 \f
3812 /* Build an assignment expression of lvalue LHS from value RHS.
3813 MODIFYCODE is the code for a binary operator that we use
3814 to combine the old value of LHS with RHS to get the new value.
3815 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment. */
3817 tree
3821 {
3822 tree result;
3823 tree newrhs;
3827 /* Types that aren't fully specified cannot be used in assignments. */
3830 /* Avoid duplicate error messages from operands that had errors. */
3834 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
3835 /* Do not use STRIP_NOPS here. We do not want an enumerator
3836 whose value is 0 to count as a null pointer constant. */
3842 /* Handle control structure constructs used as "lvalues". */
3845 {
3846 /* Handle (a, b) used as an "lvalue". */
3855 /* Handle (a ? b : c) used as an "lvalue". */
3859 {
3860 /* Produce (a ? (b = rhs) : (c = rhs))
3861 except that the RHS goes through a save-expr
3862 so the code to compute it is only emitted once. */
3863 tree cond
3871 /* Make sure the code to compute the rhs comes out
3872 before the split. */
3874 /* But cast it to void to avoid an "unused" error. */
3876 }
3879 }
3881 /* If a binary op has been requested, combine the old LHS value with the RHS
3882 producing the value we should actually store into the LHS. */
3885 {
3888 }
3890 /* Handle a cast used as an "lvalue".
3891 We have already performed any binary operator using the value as cast.
3892 Now convert the result to the cast type of the lhs,
3893 and then true type of the lhs and store it there;
3894 then convert result back to the cast type to be the value
3895 of the assignment. */
3898 {
3907 {
3909 tree result;
3917 }
3921 }
3923 /* Now we have handled acceptable kinds of LHS that are not truly lvalues.
3924 Reject anything strange now. */
3929 /* Warn about storing in something that is `const'. */
3937 /* If storing into a structure or union member,
3938 it has probably been given type `int'.
3939 Compute the type that would go with
3940 the actual amount of storage the member occupies. */
3949 /* If storing in a field that is in actuality a short or narrower than one,
3950 we must store in the field in its actual type. */
3953 {
3956 }
3958 /* Convert new value to destination type. */
3965 /* Scan operands */
3970 /* If we got the LHS in a different type for storing in,
3971 convert the result back to the nominal type of LHS
3972 so that the value we return always has the same type
3973 as the LHS argument. */
3979 }
3980 \f
3981 /* Convert value RHS to type TYPE as preparation for an assignment
3982 to an lvalue of type TYPE.
3983 The real work of conversion is done by `convert'.
3984 The purpose of this function is to generate error messages
3985 for assignments that are not allowed in C.
3986 ERRTYPE is a string to use in error messages:
3987 "assignment", "return", etc. If it is null, this is parameter passing
3988 for a function call (and different error messages are output).
3990 FUNNAME is the name of the function being called,
3991 as an IDENTIFIER_NODE, or null.
3992 PARMNUM is the number of the argument, for printing in error messages. */
3994 static tree
4000 {
4002 tree rhstype;
4005 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
4006 /* Do not use STRIP_NOPS here. We do not want an enumerator
4007 whose value is 0 to count as a null pointer constant. */
4024 {
4026 /* Check for Objective-C protocols. This will automatically
4027 issue a warning if there are protocol violations. No need to
4028 use the return value. */
4032 }
4035 {
4038 }
4039 /* A type converts to a reference to it.
4040 This code doesn't fully support references, it's just for the
4041 special case of va_start and va_copy. */
4044 {
4046 {
4049 }
4054 /* We already know that these two types are compatible, but they
4055 may not be exactly identical. In fact, `TREE_TYPE (type)' is
4056 likely to be __builtin_va_list and `TREE_TYPE (rhs)' is
4057 likely to be va_list, a typedef to __builtin_va_list, which
4058 is different enough that it will cause problems later. */
4064 }
4065 /* Arithmetic types all interconvert, and enum is treated like int. */
4074 /* Conversion to a transparent union from its member types.
4075 This applies only to function arguments. */
4077 {
4078 tree memb_types;
4083 {
4094 {
4098 /* Any non-function converts to a [const][volatile] void *
4099 and vice versa; otherwise, targets must be the same.
4100 Meanwhile, the lhs target must have all the qualifiers of
4101 the rhs. */
4104 {
4105 /* If this type won't generate any warnings, use it. */
4115 /* Keep looking for a better type, but remember this one. */
4118 }
4119 }
4121 /* Can convert integer zero to any pointer type. */
4125 {
4128 }
4129 }
4132 {
4134 {
4135 /* We have only a marginally acceptable member type;
4136 it needs a warning. */
4140 /* Const and volatile mean something different for function
4141 types, so the usual warnings are not appropriate. */
4144 {
4145 /* Because const and volatile on functions are
4146 restrictions that say the function will not do
4147 certain things, it is okay to use a const or volatile
4148 function where an ordinary one is wanted, but not
4149 vice-versa. */
4153 }
4157 parmnum);
4158 }
4164 }
4165 }
4167 /* Conversions among pointers */
4170 {
4174 /* Any non-function converts to a [const][volatile] void *
4175 and vice versa; otherwise, targets must be the same.
4176 Meanwhile, the lhs target must have all the qualifiers of the rhs. */
4181 {
4184 ||
4186 /* Check TREE_CODE to catch cases like (void *) (char *) 0
4187 which are not ANSI null ptr constants. */
4192 /* Const and volatile mean something different for function types,
4193 so the usual warnings are not appropriate. */
4196 {
4200 /* If this is not a case of ignoring a mismatch in signedness,
4201 no warning. */
4204 ;
4205 /* If there is a mismatch, do warn. */
4209 }
4212 {
4213 /* Because const and volatile on functions are restrictions
4214 that say the function will not do certain things,
4215 it is okay to use a const or volatile function
4216 where an ordinary one is wanted, but not vice-versa. */
4220 }
4221 }
4222 else
4226 }
4228 {
4229 /* An explicit constant 0 can convert to a pointer,
4230 or one that results from arithmetic, even including
4231 a cast to integer type. */
4233 &&
4238 {
4242 }
4244 }
4246 {
4250 }
4255 {
4257 {
4263 else
4266 }
4267 else
4269 parmnum);
4270 }
4271 else
4275 }
4277 /* Convert VALUE for assignment into inlined parameter PARM. */
4279 tree
4282 {
4285 /* If FN was prototyped, the value has been converted already
4286 in convert_arguments. */
4299 }
4301 /* Print a warning using MSGID.
4302 It gets OPNAME as its one parameter.
4303 if OPNAME is null and ARGNUM is 0, it is replaced by "passing arg of `FUNCTION'".
4304 Otherwise if OPNAME is null, it is replaced by "passing arg ARGNUM of `FUNCTION'".
4305 FUNCTION and ARGNUM are handled specially if we are building an
4306 Objective-C selector. */
4308 static void
4312 tree function;
4314 {
4316 {
4321 {
4324 }
4326 {
4328 {
4329 /* Function name is known; supply it. */
4336 }
4337 else
4338 {
4339 /* Function name unknown (call through ptr). */
4343 }
4344 }
4346 {
4347 /* Function name is known; supply it. */
4354 }
4355 else
4356 {
4357 /* Function name unknown (call through ptr); just give arg number. */
4361 }
4363 }
4365 }
4366 \f
4367 /* If VALUE is a compound expr all of whose expressions are constant, then
4368 return its value. Otherwise, return error_mark_node.
4370 This is for handling COMPOUND_EXPRs as initializer elements
4371 which is allowed with a warning when -pedantic is specified. */
4373 static tree
4375 tree value;
4376 tree endtype;
4377 {
4379 {
4384 endtype);
4385 }
4389 else
4391 }
4392 \f
4393 /* Perform appropriate conversions on the initial value of a variable,
4394 store it in the declaration DECL,
4395 and print any error messages that are appropriate.
4396 If the init is invalid, store an ERROR_MARK. */
4398 void
4401 {
4404 /* If variable's type was invalidly declared, just ignore it. */
4410 /* Digest the specified initializer into an expression. */
4414 /* Store the expression if valid; else report error. */
4416 #if 0
4417 /* Note that this is the only place we can detect the error
4418 in a case such as struct foo bar = (struct foo) { x, y };
4419 where there is one initial value which is a constructor expression. */
4421 ;
4423 {
4426 }
4429 {
4432 }
4433 else
4434 {
4436 {
4441 }
4442 }
4443 #endif
4451 /* ANSI wants warnings about out-of-range constant initializers. */
4455 /* Check if we need to set array size from compound literal size. */
4459 {
4467 {
4471 {
4472 /* For int foo[] = (int [3]){1}; we need to set array size
4473 now since later on array initializer will be just the
4474 brace enclosed list of the compound literal. */
4478 }
4479 }
4480 }
4481 }
4482 \f
4483 /* Methods for storing and printing names for error messages. */
4485 /* Implement a spelling stack that allows components of a name to be pushed
4486 and popped. Each element on the stack is this structure. */
4488 struct spelling
4489 {
4491 union
4492 {
4496 };
4498 #define SPELLING_STRING 1
4499 #define SPELLING_MEMBER 2
4500 #define SPELLING_BOUNDS 3
4506 /* Macros to save and restore the spelling stack around push_... functions.
4507 Alternative to SAVE_SPELLING_STACK. */
4509 #define SPELLING_DEPTH() (spelling - spelling_base)
4510 #define RESTORE_SPELLING_DEPTH(DEPTH) (spelling = spelling_base + (DEPTH))
4512 /* Push an element on the spelling stack with type KIND and assign VALUE
4513 to MEMBER. */
4515 #define PUSH_SPELLING(KIND, VALUE, MEMBER) \
4516 { \
4517 int depth = SPELLING_DEPTH (); \
4518 \
4519 if (depth >= spelling_size) \
4520 { \
4521 spelling_size += 10; \
4522 if (spelling_base == 0) \
4523 spelling_base \
4524 = (struct spelling *) xmalloc (spelling_size * sizeof (struct spelling)); \
4525 else \
4526 spelling_base \
4527 = (struct spelling *) xrealloc (spelling_base, \
4528 spelling_size * sizeof (struct spelling)); \
4529 RESTORE_SPELLING_DEPTH (depth); \
4530 } \
4531 \
4532 spelling->kind = (KIND); \
4533 spelling->MEMBER = (VALUE); \
4534 spelling++; \
4535 }
4537 /* Push STRING on the stack. Printed literally. */
4539 static void
4542 {
4544 }
4546 /* Push a member name on the stack. Printed as '.' STRING. */
4548 static void
4550 tree decl;
4552 {
4556 }
4558 /* Push an array bounds on the stack. Printed as [BOUNDS]. */
4560 static void
4563 {
4565 }
4567 /* Compute the maximum size in bytes of the printed spelling. */
4569 static int
4571 {
4576 {
4579 else
4581 }
4584 }
4586 /* Print the spelling to BUFFER and return it. */
4591 {
4597 {
4600 }
4601 else
4602 {
4607 ;
4608 }
4611 }
4613 /* Issue an error message for a bad initializer component.
4614 MSGID identifies the message.
4615 The component name is taken from the spelling stack. */
4617 void
4620 {
4627 }
4629 /* Issue a pedantic warning for a bad initializer component.
4630 MSGID identifies the message.
4631 The component name is taken from the spelling stack. */
4633 void
4636 {
4643 }
4645 /* Issue a warning for a bad initializer component.
4646 MSGID identifies the message.
4647 The component name is taken from the spelling stack. */
4649 static void
4652 {
4659 }
4660 \f
4661 /* Digest the parser output INIT as an initializer for type TYPE.
4662 Return a C expression of type TYPE to represent the initial value.
4664 REQUIRE_CONSTANT requests an error if non-constant initializers or
4665 elements are seen. */
4667 static tree
4671 {
4680 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
4681 /* Do not use STRIP_NOPS here. We do not want an enumerator
4682 whose value is 0 to count as a null pointer constant. */
4688 /* Initialization of an array of chars from a string constant
4689 optionally enclosed in braces. */
4692 {
4700 {
4708 {
4711 }
4715 {
4718 }
4724 /* Subtract 1 (or sizeof (wchar_t))
4725 because it's ok to ignore the terminating null char
4726 that is counted in the length of the constant. */
4737 }
4738 }
4740 /* Any type can be initialized
4741 from an expression of the same type, optionally with braces. */
4755 {
4761 {
4762 /* As an extension, allow initializing objects with static storage
4763 duration with compound literals (which are then treated just as
4764 the brace enclosed list they contain). */
4767 }
4771 {
4774 }
4779 /* Compound expressions can only occur here if -pedantic or
4780 -pedantic-errors is specified. In the later case, we always want
4781 an error. In the former case, we simply want a warning. */
4784 {
4785 inside_init
4790 else
4794 }
4797 /* This test catches things like `7 / 0' which
4798 result in an expression for which TREE_CONSTANT
4799 is true, but which is not actually something
4800 that is a legal constant. We really should not
4801 be using this function, because it is a part of
4802 the back-end. Instead, the expression should
4803 already have been turned into ERROR_MARK_NODE. */
4806 {
4809 }
4812 }
4814 /* Handle scalar types, including conversions. */
4818 {
4819 /* Note that convert_for_assignment calls default_conversion
4820 for arrays and functions. We must not call it in the
4821 case where inside_init is a null pointer constant. */
4822 inside_init
4827 {
4830 }
4833 {
4836 }
4839 }
4841 /* Come here only for records and arrays. */
4844 {
4847 }
4851 }
4852 \f
4853 /* Handle initializers that use braces. */
4855 /* Type of object we are accumulating a constructor for.
4856 This type is always a RECORD_TYPE, UNION_TYPE or ARRAY_TYPE. */
4859 /* For a RECORD_TYPE or UNION_TYPE, this is the chain of fields
4860 left to fill. */
4863 /* For an ARRAY_TYPE, this is the specified index
4864 at which to store the next element we get. */
4867 /* For an ARRAY_TYPE, this is the maximum index. */
4870 /* For a RECORD_TYPE, this is the first field not yet written out. */
4873 /* For an ARRAY_TYPE, this is the index of the first element
4874 not yet written out. */
4877 /* In a RECORD_TYPE, the byte index of the next consecutive field.
4878 This is so we can generate gaps between fields, when appropriate. */
4881 /* If we are saving up the elements rather than allocating them,
4882 this is the list of elements so far (in reverse order,
4883 most recent first). */
4886 /* 1 if constructor should be incrementally stored into a constructor chain,
4887 0 if all the elements should be kept in AVL tree. */
4890 /* 1 if so far this constructor's elements are all compile-time constants. */
4893 /* 1 if so far this constructor's elements are all valid address constants. */
4896 /* 1 if this constructor is erroneous so far. */
4899 /* 1 if have called defer_addressed_constants. */
4902 /* Structure for managing pending initializer elements, organized as an
4903 AVL tree. */
4905 struct init_node
4906 {
4910 tree purpose;
4911 tree value;
4912 };
4914 /* Tree of pending elements at this constructor level.
4915 These are elements encountered out of order
4916 which belong at places we haven't reached yet in actually
4917 writing the output.
4918 Will never hold tree nodes across GC runs. */
4921 /* The SPELLING_DEPTH of this constructor. */
4924 /* 0 if implicitly pushing constructor levels is allowed. */
4930 /* DECL node for which an initializer is being read.
4931 0 means we are reading a constructor expression
4932 such as (struct foo) {...}. */
4935 /* start_init saves the ASMSPEC arg here for really_start_incremental_init. */
4938 /* Nonzero if this is an initializer for a top-level decl. */
4941 /* Nonzero if there were any member designators in this initializer. */
4944 /* Nesting depth of designator list. */
4947 /* Nonzero if there were diagnosed errors in this designator list. */
4950 \f
4951 /* This stack has a level for each implicit or explicit level of
4952 structuring in the initializer, including the outermost one. It
4953 saves the values of most of the variables above. */
4957 struct constructor_stack
4958 {
4960 tree type;
4961 tree fields;
4962 tree index;
4963 tree max_index;
4964 tree unfilled_index;
4965 tree unfilled_fields;
4966 tree bit_index;
4967 tree elements;
4971 /* If nonzero, this value should replace the entire
4972 constructor at this level. */
4973 tree replacement_value;
4982 };
4986 /* This stack represents designators from some range designator up to
4987 the last designator in the list. */
4989 struct constructor_range_stack
4990 {
4993 tree range_start;
4994 tree index;
4995 tree range_end;
4996 tree fields;
4997 };
5001 /* This stack records separate initializers that are nested.
5002 Nested initializers can't happen in ANSI C, but GNU C allows them
5003 in cases like { ... (struct foo) { ... } ... }. */
5005 struct initializer_stack
5006 {
5008 tree decl;
5012 tree elements;
5020 };
5023 \f
5024 /* Prepare to parse and output the initializer for variable DECL. */
5026 void
5028 tree decl;
5029 tree asmspec_tree;
5031 {
5062 {
5064 require_constant_elements
5066 /* For a scalar, you can always use any value to initialize,
5067 even within braces. */
5073 }
5074 else
5075 {
5079 }
5092 }
5094 void
5096 {
5099 /* Output subconstants (string constants, usually)
5100 that were referenced within this initializer and saved up.
5101 Must do this if and only if we called defer_addressed_constants. */
5105 /* Free the whole constructor stack of this initializer. */
5107 {
5111 }
5116 /* Pop back to the data of the outer initializer (if any). */
5131 }
5132 \f
5133 /* Call here when we see the initializer is surrounded by braces.
5134 This is instead of a call to push_init_level;
5135 it is matched by a call to pop_init_level.
5137 TYPE is the type to initialize, for a constructor expression.
5138 For an initializer for a decl, TYPE is zero. */
5140 void
5142 tree type;
5143 {
5185 {
5187 /* Skip any nameless bit fields at the beginning. */
5194 }
5196 {
5198 {
5199 constructor_max_index
5202 /* Detect non-empty initializations of zero-length arrays. */
5207 /* constructor_max_index needs to be an INTEGER_CST. Attempts
5208 to initialize VLAs will cause a proper error; avoid tree
5209 checking errors as well by setting a safe value. */
5214 constructor_index
5217 }
5218 else
5222 }
5224 {
5225 /* Vectors are like simple fixed-size arrays. */
5226 constructor_max_index =
5230 }
5231 else
5232 {
5233 /* Handle the case of int x = {5}; */
5236 }
5237 }
5238 \f
5239 /* Push down into a subobject, for initialization.
5240 If this is for an explicit set of braces, IMPLICIT is 0.
5241 If it is because the next element belongs at a lower level,
5242 IMPLICIT is 1 (or 2 if the push is because of designator list). */
5244 void
5247 {
5251 /* If we've exhausted any levels that didn't have braces,
5252 pop them now. */
5254 {
5262 else
5264 }
5266 /* Unless this is an explicit brace, we need to preserve previous
5267 content if any. */
5269 {
5276 }
5309 {
5314 }
5316 /* Don't die if an entire brace-pair level is superfluous
5317 in the containing level. */
5319 ;
5322 {
5323 /* Don't die if there are extra init elts at the end. */
5326 else
5327 {
5330 constructor_depth++;
5331 }
5332 }
5334 {
5337 constructor_depth++;
5338 }
5341 {
5346 }
5349 {
5357 }
5360 {
5363 }
5367 {
5369 /* Skip any nameless bit fields at the beginning. */
5376 }
5378 {
5379 /* Vectors are like simple fixed-size arrays. */
5380 constructor_max_index =
5384 }
5386 {
5388 {
5389 constructor_max_index
5392 /* Detect non-empty initializations of zero-length arrays. */
5397 /* constructor_max_index needs to be an INTEGER_CST. Attempts
5398 to initialize VLAs will cause a proper error; avoid tree
5399 checking errors as well by setting a safe value. */
5404 constructor_index
5407 }
5408 else
5413 {
5414 /* We need to split the char/wchar array into individual
5415 characters, so that we don't have to special case it
5416 everywhere. */
5418 }
5419 }
5420 else
5421 {
5425 }
5426 }
5428 /* At the end of an implicit or explicit brace level,
5429 finish up that level of constructor.
5430 If we were outputting the elements as they are read, return 0
5431 from inner levels (process_init_element ignores that),
5432 but return error_mark_node from the outermost level
5433 (that's what we want to put in DECL_INITIAL).
5434 Otherwise, return a CONSTRUCTOR expression. */
5436 tree
5439 {
5444 {
5445 /* When we come to an explicit close brace,
5446 pop any inner levels that didn't have explicit braces. */
5452 }
5456 /* Error for initializing a flexible array member, or a zero-length
5457 array member in an inappropriate context. */
5462 {
5463 /* Silently discard empty initializations. The parser will
5464 already have pedwarned for empty brackets. */
5468 {
5474 /* We have already issued an error message for the existence
5475 of a flexible array member not at the end of the structure.
5476 Discard the initializer so that we do not abort later. */
5479 }
5480 else
5481 /* Zero-length arrays are no longer special, so we should no longer
5482 get here. */
5484 }
5486 /* Warn when some struct elements are implicitly initialized to zero. */
5488 && constructor_type
5491 {
5492 /* Do not warn for flexible array members or zero-length arrays. */
5498 /* Do not warn if this level of the initializer uses member
5499 designators; it is likely to be deliberate. */
5501 {
5505 }
5506 }
5508 /* Now output all pending elements. */
5512 /* Pad out the end of the structure. */
5514 /* If this closes a superfluous brace pair,
5515 just pass out the element between them. */
5518 ;
5523 {
5524 /* A nonincremental scalar initializer--just return
5525 the element, after verifying there is just one. */
5527 {
5531 }
5533 {
5536 }
5537 else
5539 }
5540 else
5541 {
5544 else
5545 {
5552 }
5553 }
5578 {
5582 }
5584 }
5586 /* Common handling for both array range and field name designators.
5587 ARRAY argument is nonzero for array ranges. Returns zero for success. */
5589 static int
5592 {
5593 tree subtype;
5596 /* Don't die if an entire brace-pair level is superfluous
5597 in the containing level. */
5601 /* If there were errors in this designator list already, bail out silently. */
5606 {
5610 /* Designator list starts at the level of closest explicit
5611 braces. */
5616 }
5619 {
5622 }
5626 {
5630 }
5632 {
5634 }
5635 else
5640 {
5643 }
5645 {
5648 }
5653 }
5655 /* If there are range designators in designator list, push a new designator
5656 to constructor_range_stack. RANGE_END is end of such stack range or
5657 NULL_TREE if there is no range designator at this level. */
5659 static void
5661 tree range_end;
5662 {
5677 }
5679 /* Within an array initializer, specify the next index to be initialized.
5680 FIRST is that index. If LAST is nonzero, then initialize a range
5681 of indices, running from FIRST through LAST. */
5683 void
5686 {
5716 else
5717 {
5721 {
5725 {
5728 }
5729 else
5730 {
5734 {
5737 }
5738 }
5739 }
5741 designator_depth++;
5745 }
5746 }
5748 /* Within a struct initializer, specify the next field to be initialized. */
5750 void
5752 tree fieldname;
5753 {
5754 tree tail;
5763 {
5766 }
5770 {
5773 }
5778 else
5779 {
5781 designator_depth++;
5785 }
5786 }
5787 \f
5788 /* Add a new initializer to the tree of pending initializers. PURPOSE
5789 identifies the initializer, either array index or field in a structure.
5790 VALUE is the value of that index or field. */
5792 static void
5795 {
5802 {
5804 {
5810 else
5811 {
5816 }
5817 }
5818 }
5819 else
5820 {
5821 tree bitpos;
5825 {
5831 else
5832 {
5837 }
5838 }
5839 }
5852 {
5856 {
5860 {
5862 {
5863 /* L rotation. */
5876 {
5879 else
5881 }
5882 else
5884 }
5885 else
5886 {
5887 /* LR rotation. */
5909 {
5912 else
5914 }
5915 else
5917 }
5919 }
5920 else
5921 {
5922 /* p->balance == +1; growth of left side balances the node. */
5925 }
5926 }
5928 {
5930 /* Growth propagation from right side. */
5933 {
5935 {
5936 /* R rotation. */
5949 {
5952 else
5954 }
5955 else
5957 }
5959 {
5960 /* RL rotation */
5982 {
5985 else
5987 }
5988 else
5990 }
5992 }
5993 else
5994 {
5995 /* p->balance == -1; growth of right side balances the node. */
5998 }
5999 }
6003 }
6004 }
6006 /* Build AVL tree from a sorted chain. */
6008 static void
6010 {
6011 tree chain;
6021 {
6023 /* Skip any nameless bit fields at the beginning. */
6029 }
6031 {
6033 constructor_unfilled_index
6036 else
6038 }
6040 }
6042 /* Build AVL tree from a string constant. */
6044 static void
6046 tree str;
6047 {
6062 else
6073 {
6075 {
6078 }
6079 else
6080 {
6084 {
6087 else
6092 }
6093 }
6096 {
6099 {
6101 {
6104 }
6105 }
6107 {
6110 }
6115 }
6120 }
6123 }
6125 /* Return value of FIELD in pending initializer or zero if the field was
6126 not initialized yet. */
6128 static tree
6130 tree field;
6131 {
6135 {
6142 {
6147 else
6149 }
6150 }
6152 {
6156 && (!constructor_unfilled_fields
6163 {
6168 else
6170 }
6171 }
6173 {
6177 }
6179 }
6181 /* "Output" the next constructor element.
6182 At top level, really output it to assembler code now.
6183 Otherwise, collect it in a list from which we will make a CONSTRUCTOR.
6184 TYPE is the data type that the containing data type wants here.
6185 FIELD is the field (a FIELD_DECL) or the index that this element fills.
6187 PENDING if non-nil means output pending elements that belong
6188 right after this element. (PENDING is normally 1;
6189 it is 0 while outputting pending elements, to avoid recursion.) */
6191 static void
6195 {
6207 {
6208 /* As an extension, allow initializing objects with static storage
6209 duration with compound literals (which are then treated just as
6210 the brace enclosed list they contain). */
6213 }
6227 {
6230 }
6235 /* If this field is empty (and not at the end of structure),
6236 don't do anything other than checking the initializer. */
6247 {
6250 }
6252 /* If this element doesn't come next in sequence,
6253 put it on constructor_pending_elts. */
6255 && (!constructor_incremental
6257 {
6264 }
6266 && (!constructor_incremental
6268 {
6269 /* We do this for records but not for unions. In a union,
6270 no matter which field is specified, it can be initialized
6271 right away since it starts at the beginning of the union. */
6273 {
6276 else
6277 {
6285 }
6286 }
6290 }
6293 {
6297 /* We can have just one union field set. */
6299 }
6301 /* Otherwise, output this element either to
6302 constructor_elements or to the assembler file. */
6306 constructor_elements
6309 /* Advance the variable that indicates sequential elements output. */
6311 constructor_unfilled_index
6313 bitsize_one_node);
6315 {
6316 constructor_unfilled_fields
6319 /* Skip any nameless bit fields. */
6323 constructor_unfilled_fields =
6325 }
6329 /* Now output any pending elements which have become next. */
6332 }
6334 /* Output any pending elements which have become next.
6335 As we output elements, constructor_unfilled_{fields,index}
6336 advances, which may cause other elements to become next;
6337 if so, they too are output.
6339 If ALL is 0, we return when there are
6340 no more pending elements to output now.
6342 If ALL is 1, we output space as necessary so that
6343 we can output all the pending elements. */
6345 static void
6348 {
6350 tree next;
6352 retry:
6354 /* Look thru the whole pending tree.
6355 If we find an element that should be output now,
6356 output it. Otherwise, set NEXT to the element
6357 that comes first among those still pending. */
6361 {
6363 {
6365 constructor_unfilled_index))
6371 {
6372 /* Advance to the next smaller node. */
6375 else
6376 {
6377 /* We have reached the smallest node bigger than the
6378 current unfilled index. Fill the space first. */
6381 }
6382 }
6383 else
6384 {
6385 /* Advance to the next bigger node. */
6388 else
6389 {
6390 /* We have reached the biggest node in a subtree. Find
6391 the parent of it, which is the next bigger node. */
6397 {
6400 }
6401 }
6402 }
6403 }
6406 {
6409 /* If the current record is complete we are done. */
6415 /* We can't compare fields here because there might be empty
6416 fields in between. */
6418 {
6422 }
6424 {
6425 /* Advance to the next smaller node. */
6428 else
6429 {
6430 /* We have reached the smallest node bigger than the
6431 current unfilled field. Fill the space first. */
6434 }
6435 }
6436 else
6437 {
6438 /* Advance to the next bigger node. */
6441 else
6442 {
6443 /* We have reached the biggest node in a subtree. Find
6444 the parent of it, which is the next bigger node. */
6451 {
6454 }
6455 }
6456 }
6457 }
6458 }
6460 /* Ordinarily return, but not if we want to output all
6461 and there are elements left. */
6465 /* If it's not incremental, just skip over the gap, so that after
6466 jumping to retry we will output the next successive element. */
6473 /* ELT now points to the node in the pending tree with the next
6474 initializer to output. */
6476 }
6477 \f
6478 /* Add one non-braced element to the current constructor level.
6479 This adjusts the current position within the constructor's type.
6480 This may also start or terminate implicit levels
6481 to handle a partly-braced initializer.
6483 Once this has found the correct level for the new element,
6484 it calls output_init_element. */
6486 void
6488 tree value;
6489 {
6496 /* Handle superfluous braces around string cst as in
6497 char x[] = {"foo"}; */
6499 && constructor_type
6503 {
6508 }
6511 {
6514 }
6516 /* Ignore elements of a brace group if it is entirely superfluous
6517 and has already been diagnosed. */
6521 /* If we've exhausted any levels that didn't have braces,
6522 pop them now. */
6524 {
6532 constructor_index)))
6534 else
6536 }
6538 /* In the case of [LO ... HI] = VALUE, only evaluate VALUE once. */
6540 {
6541 /* If value is a compound literal and we'll be just using its
6542 content, don't put it into a SAVE_EXPR. */
6544 || !require_constant_value
6547 }
6550 {
6552 {
6553 tree fieldtype;
6557 {
6560 }
6567 /* Error for non-static initialization of a flexible array member. */
6569 && !require_constant_value
6572 {
6575 }
6577 /* Accept a string constant to initialize a subarray. */
6583 /* Otherwise, if we have come to a subaggregate,
6584 and we don't have an element of its type, push into it. */
6590 {
6593 }
6596 {
6600 }
6601 else
6602 /* Do the bookkeeping for an element that was
6603 directly output as a constructor. */
6604 {
6605 /* For a record, keep track of end position of last field. */
6607 constructor_bit_index
6612 /* If the current field was the first one not yet written out,
6613 it isn't now, so update. */
6615 {
6617 /* Skip any nameless bit fields. */
6621 constructor_unfilled_fields =
6623 }
6624 }
6627 /* Skip any nameless bit fields at the beginning. */
6632 }
6634 {
6635 tree fieldtype;
6639 {
6642 }
6649 /* Warn that traditional C rejects initialization of unions.
6650 We skip the warning if the value is zero. This is done
6651 under the assumption that the zero initializer in user
6652 code appears conditioned on e.g. __STDC__ to avoid
6653 "missing initializer" warnings and relies on default
6654 initialization to zero in the traditional C case.
6655 We also skip the warning if the initializer is designated,
6656 again on the assumption that this must be conditional on
6657 __STDC__ anyway (and we've already complained about the
6658 member-designator already). */
6663 /* Accept a string constant to initialize a subarray. */
6669 /* Otherwise, if we have come to a subaggregate,
6670 and we don't have an element of its type, push into it. */
6676 {
6679 }
6682 {
6686 }
6687 else
6688 /* Do the bookkeeping for an element that was
6689 directly output as a constructor. */
6690 {
6693 }
6696 }
6698 {
6702 /* Accept a string constant to initialize a subarray. */
6708 /* Otherwise, if we have come to a subaggregate,
6709 and we don't have an element of its type, push into it. */
6715 {
6718 }
6723 {
6726 }
6728 /* Now output the actual element. */
6730 {
6734 }
6736 constructor_index
6740 /* If we are doing the bookkeeping for an element that was
6741 directly output as a constructor, we must update
6742 constructor_unfilled_index. */
6744 }
6746 {
6749 /* Do a basic check of initializer size. Note that vectors
6750 always have a fixed size derived from their type. */
6752 {
6755 }
6757 /* Now output the actual element. */
6761 constructor_index
6765 /* If we are doing the bookkeeping for an element that was
6766 directly output as a constructor, we must update
6767 constructor_unfilled_index. */
6769 }
6771 /* Handle the sole element allowed in a braced initializer
6772 for a scalar variable. */
6774 {
6777 }
6778 else
6779 {
6783 }
6785 /* Handle range initializers either at this level or anywhere higher
6786 in the designator stack. */
6788 {
6795 {
6799 }
6803 {
6807 }
6814 {
6818 {
6821 }
6829 }
6834 }
6837 }
6840 }
6841 \f
6842 /* Build a simple asm-statement, from one string literal. */
6843 tree
6845 tree expr;
6846 {
6853 {
6854 tree stmt;
6856 /* Simple asm statements are treated as volatile. */
6861 }
6865 }
6867 /* Build an asm-statement, whose components are a CV_QUALIFIER, a
6868 STRING, some OUTPUTS, some INPUTS, and some CLOBBERS. */
6870 tree
6872 tree cv_qualifier;
6873 tree string;
6874 tree outputs;
6875 tree inputs;
6876 tree clobbers;
6877 {
6878 tree tail;
6881 {
6884 }
6888 {
6892 }
6894 /* We can remove output conversions that change the type,
6895 but not the mode. */
6897 {
6903 /* Allow conversions as LHS here. build_modify_expr as called below
6904 will do the right thing with them. */
6915 }
6917 /* Remove output conversions that change the type but not the mode. */
6919 {
6923 }
6925 /* Perform default conversions on array and function inputs.
6926 Don't do this for other types as it would screw up operands
6927 expected to be in memory. */
6933 }
6935 /* Expand an ASM statement with operands, handling output operands
6936 that are not variables or INDIRECT_REFS by transforming such
6937 cases into cases that expand_asm_operands can handle.
6939 Arguments are same as for expand_asm_operands. */
6941 void
6947 {
6950 /* o[I] is the place that output number I should be written. */
6952 tree tail;
6954 /* Record the contents of OUTPUTS before it is modified. */
6956 {
6960 }
6962 /* Generate the ASM_OPERANDS insn; store into the TREE_VALUEs of
6963 OUTPUTS some trees for where the values were actually stored. */
6966 /* Copy all the intermediate outputs into the specified outputs. */
6968 {
6970 {
6975 /* Restore the original value so that it's correct the next
6976 time we expand this function. */
6978 }
6979 /* Detect modification of read-only values.
6980 (Otherwise done by build_modify_expr.) */
6981 else
6982 {
6990 }
6991 }
6993 /* Those MODIFY_EXPRs could do autoincrements. */
6995 }
6996 \f
6997 /* Expand a C `return' statement.
6998 RETVAL is the expression for what to return,
6999 or a null pointer for `return;' with no value. */
7001 tree
7003 tree retval;
7004 {
7011 {
7016 }
7018 {
7022 }
7023 else
7024 {
7028 tree inner;
7036 /* Strip any conversions, additions, and subtractions, and see if
7037 we are returning the address of a local variable. Warn if so. */
7039 {
7041 {
7048 /* If the second operand of the MINUS_EXPR has a pointer
7049 type (or is converted from it), this may be valid, so
7050 don't give a warning. */
7051 {
7065 }
7082 }
7085 }
7088 }
7091 }
7092 \f
7094 /* The SWITCH_STMT being built. */
7095 tree switch_stmt;
7096 /* A splay-tree mapping the low element of a case range to the high
7097 element, or NULL_TREE if there is no high element. Used to
7098 determine whether or not a new case label duplicates an old case
7099 label. We need a tree, rather than simply a hash table, because
7100 of the GNU case range extension. */
7101 splay_tree cases;
7102 /* The next node on the stack. */
7104 };
7106 /* A stack of the currently active switch statements. The innermost
7107 switch statement is on the top of the stack. There is no need to
7108 mark the stack for garbage collection because it is only active
7109 during the processing of the body of a function, and we never
7110 collect at that point. */
7114 /* Start a C switch statement, testing expression EXP. Return the new
7115 SWITCH_STMT. */
7117 tree
7119 tree exp;
7120 {
7126 {
7132 {
7135 }
7136 else
7137 {
7147 }
7148 }
7150 /* Add this new SWITCH_STMT to the stack. */
7158 }
7160 /* Process a case label. */
7162 tree
7164 tree low_value;
7165 tree high_value;
7166 {
7170 {
7176 }
7179 else
7183 }
7185 /* Finish the switch statement. */
7187 void
7189 {
7194 /* Pop the stack. */
7198 }