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 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
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
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
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. */
48 static int missing_braces_mentioned;
50 /* 1 if we explained undeclared var errors. */
51 static int undeclared_variable_notice;
53 static tree qualify_type PARAMS ((tree, tree));
54 static int comp_target_types PARAMS ((tree, tree));
55 static int function_types_compatible_p PARAMS ((tree, tree));
56 static int type_lists_compatible_p PARAMS ((tree, tree));
57 static tree decl_constant_value_for_broken_optimization PARAMS ((tree));
58 static tree lookup_field PARAMS ((tree, tree, tree *));
59 static tree convert_arguments PARAMS ((tree, tree, tree, tree));
60 static tree pointer_int_sum PARAMS ((enum tree_code, tree, tree));
61 static tree pointer_diff PARAMS ((tree, tree));
62 static tree unary_complex_lvalue PARAMS ((enum tree_code, tree));
63 static void pedantic_lvalue_warning PARAMS ((enum tree_code));
64 static tree internal_build_compound_expr PARAMS ((tree, int));
65 static tree convert_for_assignment PARAMS ((tree, tree, const char *,
67 static void warn_for_assignment PARAMS ((const char *, const char *,
69 static tree valid_compound_expr_initializer PARAMS ((tree, tree));
70 static void push_string PARAMS ((const char *));
71 static void push_member_name PARAMS ((tree));
72 static void push_array_bounds PARAMS ((int));
73 static int spelling_length PARAMS ((void));
74 static char *print_spelling PARAMS ((char *));
75 static void warning_init PARAMS ((const char *));
76 static tree digest_init PARAMS ((tree, tree, int, int));
77 static void output_init_element PARAMS ((tree, tree, tree, int));
78 static void output_pending_init_elements PARAMS ((int));
79 static int set_designator PARAMS ((int));
80 static void push_range_stack PARAMS ((tree));
81 static void add_pending_init PARAMS ((tree, tree));
82 static void set_nonincremental_init PARAMS ((void));
83 static void set_nonincremental_init_from_string PARAMS ((tree));
84 static tree find_init_member PARAMS ((tree));
86 /* Do `exp = require_complete_type (exp);' to make sure exp
87 does not have an incomplete type. (That includes void types.) */
90 require_complete_type (value)
93 tree type = TREE_TYPE (value);
95 if (TREE_CODE (value) == ERROR_MARK)
96 return error_mark_node;
98 /* First, detect a valid value with a complete type. */
99 if (COMPLETE_TYPE_P (type))
102 incomplete_type_error (value, type);
103 return error_mark_node;
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. */
111 incomplete_type_error (value, type)
115 const char *type_code_string;
117 /* Avoid duplicate error message. */
118 if (TREE_CODE (type) == ERROR_MARK)
121 if (value != 0 && (TREE_CODE (value) == VAR_DECL
122 || TREE_CODE (value) == PARM_DECL))
123 error ("`%s' has an incomplete type",
124 IDENTIFIER_POINTER (DECL_NAME (value)));
128 /* We must print an error message. Be clever about what it says. */
130 switch (TREE_CODE (type))
133 type_code_string = "struct";
137 type_code_string = "union";
141 type_code_string = "enum";
145 error ("invalid use of void expression");
149 if (TYPE_DOMAIN (type))
151 type = TREE_TYPE (type);
154 error ("invalid use of array with unspecified bounds");
161 if (TREE_CODE (TYPE_NAME (type)) == IDENTIFIER_NODE)
162 error ("invalid use of undefined type `%s %s'",
163 type_code_string, IDENTIFIER_POINTER (TYPE_NAME (type)));
165 /* If this type has a typedef-name, the TYPE_NAME is a TYPE_DECL. */
166 error ("invalid use of incomplete typedef `%s'",
167 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type))));
171 /* Return a variant of TYPE which has all the type qualifiers of LIKE
172 as well as those of TYPE. */
175 qualify_type (type, like)
178 return c_build_qualified_type (type,
179 TYPE_QUALS (type) | TYPE_QUALS (like));
182 /* Return the common type of two types.
183 We assume that comptypes has already been done and returned 1;
184 if that isn't so, this may crash. In particular, we assume that qualifiers
187 This is the type for the result of most arithmetic operations
188 if the operands have the given two types. */
194 enum tree_code code1;
195 enum tree_code code2;
198 /* Save time if the two types are the same. */
200 if (t1 == t2) return t1;
202 /* If one type is nonsense, use the other. */
203 if (t1 == error_mark_node)
205 if (t2 == error_mark_node)
208 /* Merge the attributes. */
209 attributes = (*targetm.merge_type_attributes) (t1, t2);
211 /* Treat an enum type as the unsigned integer type of the same width. */
213 if (TREE_CODE (t1) == ENUMERAL_TYPE)
214 t1 = type_for_size (TYPE_PRECISION (t1), 1);
215 if (TREE_CODE (t2) == ENUMERAL_TYPE)
216 t2 = type_for_size (TYPE_PRECISION (t2), 1);
218 code1 = TREE_CODE (t1);
219 code2 = TREE_CODE (t2);
221 /* If one type is complex, form the common type of the non-complex
222 components, then make that complex. Use T1 or T2 if it is the
224 if (code1 == COMPLEX_TYPE || code2 == COMPLEX_TYPE)
226 tree subtype1 = code1 == COMPLEX_TYPE ? TREE_TYPE (t1) : t1;
227 tree subtype2 = code2 == COMPLEX_TYPE ? TREE_TYPE (t2) : t2;
228 tree subtype = common_type (subtype1, subtype2);
230 if (code1 == COMPLEX_TYPE && TREE_TYPE (t1) == subtype)
231 return build_type_attribute_variant (t1, attributes);
232 else if (code2 == COMPLEX_TYPE && TREE_TYPE (t2) == subtype)
233 return build_type_attribute_variant (t2, attributes);
235 return build_type_attribute_variant (build_complex_type (subtype),
243 /* If only one is real, use it as the result. */
245 if (code1 == REAL_TYPE && code2 != REAL_TYPE)
246 return build_type_attribute_variant (t1, attributes);
248 if (code2 == REAL_TYPE && code1 != REAL_TYPE)
249 return build_type_attribute_variant (t2, attributes);
251 /* Both real or both integers; use the one with greater precision. */
253 if (TYPE_PRECISION (t1) > TYPE_PRECISION (t2))
254 return build_type_attribute_variant (t1, attributes);
255 else if (TYPE_PRECISION (t2) > TYPE_PRECISION (t1))
256 return build_type_attribute_variant (t2, attributes);
258 /* Same precision. Prefer longs to ints even when same size. */
260 if (TYPE_MAIN_VARIANT (t1) == long_unsigned_type_node
261 || TYPE_MAIN_VARIANT (t2) == long_unsigned_type_node)
262 return build_type_attribute_variant (long_unsigned_type_node,
265 if (TYPE_MAIN_VARIANT (t1) == long_integer_type_node
266 || TYPE_MAIN_VARIANT (t2) == long_integer_type_node)
268 /* But preserve unsignedness from the other type,
269 since long cannot hold all the values of an unsigned int. */
270 if (TREE_UNSIGNED (t1) || TREE_UNSIGNED (t2))
271 t1 = long_unsigned_type_node;
273 t1 = long_integer_type_node;
274 return build_type_attribute_variant (t1, attributes);
277 /* Likewise, prefer long double to double even if same size. */
278 if (TYPE_MAIN_VARIANT (t1) == long_double_type_node
279 || TYPE_MAIN_VARIANT (t2) == long_double_type_node)
280 return build_type_attribute_variant (long_double_type_node,
283 /* Otherwise prefer the unsigned one. */
285 if (TREE_UNSIGNED (t1))
286 return build_type_attribute_variant (t1, attributes);
288 return build_type_attribute_variant (t2, attributes);
291 /* For two pointers, do this recursively on the target type,
292 and combine the qualifiers of the two types' targets. */
293 /* This code was turned off; I don't know why.
294 But ANSI C specifies doing this with the qualifiers.
295 So I turned it on again. */
297 tree pointed_to_1 = TREE_TYPE (t1);
298 tree pointed_to_2 = TREE_TYPE (t2);
299 tree target = common_type (TYPE_MAIN_VARIANT (pointed_to_1),
300 TYPE_MAIN_VARIANT (pointed_to_2));
301 t1 = build_pointer_type (c_build_qualified_type
303 TYPE_QUALS (pointed_to_1) |
304 TYPE_QUALS (pointed_to_2)));
305 return build_type_attribute_variant (t1, attributes);
308 t1 = build_pointer_type (common_type (TREE_TYPE (t1), TREE_TYPE (t2)));
309 return build_type_attribute_variant (t1, attributes);
314 tree elt = common_type (TREE_TYPE (t1), TREE_TYPE (t2));
315 /* Save space: see if the result is identical to one of the args. */
316 if (elt == TREE_TYPE (t1) && TYPE_DOMAIN (t1))
317 return build_type_attribute_variant (t1, attributes);
318 if (elt == TREE_TYPE (t2) && TYPE_DOMAIN (t2))
319 return build_type_attribute_variant (t2, attributes);
320 /* Merge the element types, and have a size if either arg has one. */
321 t1 = build_array_type (elt, TYPE_DOMAIN (TYPE_DOMAIN (t1) ? t1 : t2));
322 return build_type_attribute_variant (t1, attributes);
326 /* Function types: prefer the one that specified arg types.
327 If both do, merge the arg types. Also merge the return types. */
329 tree valtype = common_type (TREE_TYPE (t1), TREE_TYPE (t2));
330 tree p1 = TYPE_ARG_TYPES (t1);
331 tree p2 = TYPE_ARG_TYPES (t2);
336 /* Save space: see if the result is identical to one of the args. */
337 if (valtype == TREE_TYPE (t1) && ! TYPE_ARG_TYPES (t2))
338 return build_type_attribute_variant (t1, attributes);
339 if (valtype == TREE_TYPE (t2) && ! TYPE_ARG_TYPES (t1))
340 return build_type_attribute_variant (t2, attributes);
342 /* Simple way if one arg fails to specify argument types. */
343 if (TYPE_ARG_TYPES (t1) == 0)
345 t1 = build_function_type (valtype, TYPE_ARG_TYPES (t2));
346 return build_type_attribute_variant (t1, attributes);
348 if (TYPE_ARG_TYPES (t2) == 0)
350 t1 = build_function_type (valtype, TYPE_ARG_TYPES (t1));
351 return build_type_attribute_variant (t1, attributes);
354 /* If both args specify argument types, we must merge the two
355 lists, argument by argument. */
358 declare_parm_level (1);
360 len = list_length (p1);
363 for (i = 0; i < len; i++)
364 newargs = tree_cons (NULL_TREE, NULL_TREE, newargs);
369 p1 = TREE_CHAIN (p1), p2 = TREE_CHAIN (p2), n = TREE_CHAIN (n))
371 /* A null type means arg type is not specified.
372 Take whatever the other function type has. */
373 if (TREE_VALUE (p1) == 0)
375 TREE_VALUE (n) = TREE_VALUE (p2);
378 if (TREE_VALUE (p2) == 0)
380 TREE_VALUE (n) = TREE_VALUE (p1);
384 /* Given wait (union {union wait *u; int *i} *)
385 and wait (union wait *),
386 prefer union wait * as type of parm. */
387 if (TREE_CODE (TREE_VALUE (p1)) == UNION_TYPE
388 && TREE_VALUE (p1) != TREE_VALUE (p2))
391 for (memb = TYPE_FIELDS (TREE_VALUE (p1));
392 memb; memb = TREE_CHAIN (memb))
393 if (comptypes (TREE_TYPE (memb), TREE_VALUE (p2)))
395 TREE_VALUE (n) = TREE_VALUE (p2);
397 pedwarn ("function types not truly compatible in ISO C");
401 if (TREE_CODE (TREE_VALUE (p2)) == UNION_TYPE
402 && TREE_VALUE (p2) != TREE_VALUE (p1))
405 for (memb = TYPE_FIELDS (TREE_VALUE (p2));
406 memb; memb = TREE_CHAIN (memb))
407 if (comptypes (TREE_TYPE (memb), TREE_VALUE (p1)))
409 TREE_VALUE (n) = TREE_VALUE (p1);
411 pedwarn ("function types not truly compatible in ISO C");
415 TREE_VALUE (n) = common_type (TREE_VALUE (p1), TREE_VALUE (p2));
421 t1 = build_function_type (valtype, newargs);
422 /* ... falls through ... */
426 return build_type_attribute_variant (t1, attributes);
431 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
432 or various other operations. Return 2 if they are compatible
433 but a warning may be needed if you use them together. */
436 comptypes (type1, type2)
443 /* Suppress errors caused by previously reported errors. */
445 if (t1 == t2 || !t1 || !t2
446 || TREE_CODE (t1) == ERROR_MARK || TREE_CODE (t2) == ERROR_MARK)
449 /* If either type is the internal version of sizetype, return the
451 if (TREE_CODE (t1) == INTEGER_TYPE && TYPE_IS_SIZETYPE (t1)
452 && TYPE_DOMAIN (t1) != 0)
453 t1 = TYPE_DOMAIN (t1);
455 if (TREE_CODE (t2) == INTEGER_TYPE && TYPE_IS_SIZETYPE (t2)
456 && TYPE_DOMAIN (t2) != 0)
457 t2 = TYPE_DOMAIN (t2);
459 /* Treat an enum type as the integer type of the same width and
462 if (TREE_CODE (t1) == ENUMERAL_TYPE)
463 t1 = type_for_size (TYPE_PRECISION (t1), TREE_UNSIGNED (t1));
464 if (TREE_CODE (t2) == ENUMERAL_TYPE)
465 t2 = type_for_size (TYPE_PRECISION (t2), TREE_UNSIGNED (t2));
470 /* Different classes of types can't be compatible. */
472 if (TREE_CODE (t1) != TREE_CODE (t2)) return 0;
474 /* Qualifiers must match. */
476 if (TYPE_QUALS (t1) != TYPE_QUALS (t2))
479 /* Allow for two different type nodes which have essentially the same
480 definition. Note that we already checked for equality of the type
481 qualifiers (just above). */
483 if (TYPE_MAIN_VARIANT (t1) == TYPE_MAIN_VARIANT (t2))
486 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
487 if (! (attrval = (*targetm.comp_type_attributes) (t1, t2)))
490 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
493 switch (TREE_CODE (t1))
496 val = (TREE_TYPE (t1) == TREE_TYPE (t2)
497 ? 1 : comptypes (TREE_TYPE (t1), TREE_TYPE (t2)));
501 val = function_types_compatible_p (t1, t2);
506 tree d1 = TYPE_DOMAIN (t1);
507 tree d2 = TYPE_DOMAIN (t2);
508 bool d1_variable, d2_variable;
509 bool d1_zero, d2_zero;
512 /* Target types must match incl. qualifiers. */
513 if (TREE_TYPE (t1) != TREE_TYPE (t2)
514 && 0 == (val = comptypes (TREE_TYPE (t1), TREE_TYPE (t2))))
517 /* Sizes must match unless one is missing or variable. */
518 if (d1 == 0 || d2 == 0 || d1 == d2)
521 d1_zero = ! TYPE_MAX_VALUE (d1);
522 d2_zero = ! TYPE_MAX_VALUE (d2);
524 d1_variable = (! d1_zero
525 && (TREE_CODE (TYPE_MIN_VALUE (d1)) != INTEGER_CST
526 || TREE_CODE (TYPE_MAX_VALUE (d1)) != INTEGER_CST));
527 d2_variable = (! d2_zero
528 && (TREE_CODE (TYPE_MIN_VALUE (d2)) != INTEGER_CST
529 || TREE_CODE (TYPE_MAX_VALUE (d2)) != INTEGER_CST));
531 if (d1_variable || d2_variable)
533 if (d1_zero && d2_zero)
535 if (d1_zero || d2_zero
536 || ! tree_int_cst_equal (TYPE_MIN_VALUE (d1), TYPE_MIN_VALUE (d2))
537 || ! tree_int_cst_equal (TYPE_MAX_VALUE (d1), TYPE_MAX_VALUE (d2)))
544 if (maybe_objc_comptypes (t1, t2, 0) == 1)
551 return attrval == 2 && val == 1 ? 2 : val;
554 /* Return 1 if TTL and TTR are pointers to types that are equivalent,
555 ignoring their qualifiers. */
558 comp_target_types (ttl, ttr)
563 /* Give maybe_objc_comptypes a crack at letting these types through. */
564 if ((val = maybe_objc_comptypes (ttl, ttr, 1)) >= 0)
567 val = comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (ttl)),
568 TYPE_MAIN_VARIANT (TREE_TYPE (ttr)));
570 if (val == 2 && pedantic)
571 pedwarn ("types are not quite compatible");
575 /* Subroutines of `comptypes'. */
577 /* Return 1 if two function types F1 and F2 are compatible.
578 If either type specifies no argument types,
579 the other must specify a fixed number of self-promoting arg types.
580 Otherwise, if one type specifies only the number of arguments,
581 the other must specify that number of self-promoting arg types.
582 Otherwise, the argument types must match. */
585 function_types_compatible_p (f1, f2)
589 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
593 if (!(TREE_TYPE (f1) == TREE_TYPE (f2)
594 || (val = comptypes (TREE_TYPE (f1), TREE_TYPE (f2)))))
597 args1 = TYPE_ARG_TYPES (f1);
598 args2 = TYPE_ARG_TYPES (f2);
600 /* An unspecified parmlist matches any specified parmlist
601 whose argument types don't need default promotions. */
605 if (!self_promoting_args_p (args2))
607 /* If one of these types comes from a non-prototype fn definition,
608 compare that with the other type's arglist.
609 If they don't match, ask for a warning (but no error). */
610 if (TYPE_ACTUAL_ARG_TYPES (f1)
611 && 1 != type_lists_compatible_p (args2, TYPE_ACTUAL_ARG_TYPES (f1)))
617 if (!self_promoting_args_p (args1))
619 if (TYPE_ACTUAL_ARG_TYPES (f2)
620 && 1 != type_lists_compatible_p (args1, TYPE_ACTUAL_ARG_TYPES (f2)))
625 /* Both types have argument lists: compare them and propagate results. */
626 val1 = type_lists_compatible_p (args1, args2);
627 return val1 != 1 ? val1 : val;
630 /* Check two lists of types for compatibility,
631 returning 0 for incompatible, 1 for compatible,
632 or 2 for compatible with warning. */
635 type_lists_compatible_p (args1, args2)
638 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
644 if (args1 == 0 && args2 == 0)
646 /* If one list is shorter than the other,
647 they fail to match. */
648 if (args1 == 0 || args2 == 0)
650 /* A null pointer instead of a type
651 means there is supposed to be an argument
652 but nothing is specified about what type it has.
653 So match anything that self-promotes. */
654 if (TREE_VALUE (args1) == 0)
656 if (simple_type_promotes_to (TREE_VALUE (args2)) != NULL_TREE)
659 else if (TREE_VALUE (args2) == 0)
661 if (simple_type_promotes_to (TREE_VALUE (args1)) != NULL_TREE)
664 else if (! (newval = comptypes (TYPE_MAIN_VARIANT (TREE_VALUE (args1)),
665 TYPE_MAIN_VARIANT (TREE_VALUE (args2)))))
667 /* Allow wait (union {union wait *u; int *i} *)
668 and wait (union wait *) to be compatible. */
669 if (TREE_CODE (TREE_VALUE (args1)) == UNION_TYPE
670 && (TYPE_NAME (TREE_VALUE (args1)) == 0
671 || TYPE_TRANSPARENT_UNION (TREE_VALUE (args1)))
672 && TREE_CODE (TYPE_SIZE (TREE_VALUE (args1))) == INTEGER_CST
673 && tree_int_cst_equal (TYPE_SIZE (TREE_VALUE (args1)),
674 TYPE_SIZE (TREE_VALUE (args2))))
677 for (memb = TYPE_FIELDS (TREE_VALUE (args1));
678 memb; memb = TREE_CHAIN (memb))
679 if (comptypes (TREE_TYPE (memb), TREE_VALUE (args2)))
684 else if (TREE_CODE (TREE_VALUE (args2)) == UNION_TYPE
685 && (TYPE_NAME (TREE_VALUE (args2)) == 0
686 || TYPE_TRANSPARENT_UNION (TREE_VALUE (args2)))
687 && TREE_CODE (TYPE_SIZE (TREE_VALUE (args2))) == INTEGER_CST
688 && tree_int_cst_equal (TYPE_SIZE (TREE_VALUE (args2)),
689 TYPE_SIZE (TREE_VALUE (args1))))
692 for (memb = TYPE_FIELDS (TREE_VALUE (args2));
693 memb; memb = TREE_CHAIN (memb))
694 if (comptypes (TREE_TYPE (memb), TREE_VALUE (args1)))
703 /* comptypes said ok, but record if it said to warn. */
707 args1 = TREE_CHAIN (args1);
708 args2 = TREE_CHAIN (args2);
712 /* Compute the value of the `sizeof' operator. */
718 enum tree_code code = TREE_CODE (type);
721 if (code == FUNCTION_TYPE)
723 if (pedantic || warn_pointer_arith)
724 pedwarn ("sizeof applied to a function type");
725 size = size_one_node;
727 else if (code == VOID_TYPE)
729 if (pedantic || warn_pointer_arith)
730 pedwarn ("sizeof applied to a void type");
731 size = size_one_node;
733 else if (code == ERROR_MARK)
734 size = size_one_node;
735 else if (!COMPLETE_TYPE_P (type))
737 error ("sizeof applied to an incomplete type");
738 size = size_zero_node;
741 /* Convert in case a char is more than one unit. */
742 size = size_binop (CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type),
743 size_int (TYPE_PRECISION (char_type_node)
746 /* SIZE will have an integer type with TYPE_IS_SIZETYPE set.
747 TYPE_IS_SIZETYPE means that certain things (like overflow) will
748 never happen. However, this node should really have type
749 `size_t', which is just a typedef for an ordinary integer type. */
750 return fold (build1 (NOP_EXPR, c_size_type_node, size));
754 c_sizeof_nowarn (type)
757 enum tree_code code = TREE_CODE (type);
760 if (code == FUNCTION_TYPE || code == VOID_TYPE || code == ERROR_MARK)
761 size = size_one_node;
762 else if (!COMPLETE_TYPE_P (type))
763 size = size_zero_node;
765 /* Convert in case a char is more than one unit. */
766 size = size_binop (CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type),
767 size_int (TYPE_PRECISION (char_type_node)
770 /* SIZE will have an integer type with TYPE_IS_SIZETYPE set.
771 TYPE_IS_SIZETYPE means that certain things (like overflow) will
772 never happen. However, this node should really have type
773 `size_t', which is just a typedef for an ordinary integer type. */
774 return fold (build1 (NOP_EXPR, c_size_type_node, size));
777 /* Compute the size to increment a pointer by. */
780 c_size_in_bytes (type)
783 enum tree_code code = TREE_CODE (type);
785 if (code == FUNCTION_TYPE || code == VOID_TYPE || code == ERROR_MARK)
786 return size_one_node;
788 if (!COMPLETE_OR_VOID_TYPE_P (type))
790 error ("arithmetic on pointer to an incomplete type");
791 return size_one_node;
794 /* Convert in case a char is more than one unit. */
795 return size_binop (CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type),
796 size_int (TYPE_PRECISION (char_type_node)
800 /* Return either DECL or its known constant value (if it has one). */
803 decl_constant_value (decl)
806 if (/* Don't change a variable array bound or initial value to a constant
807 in a place where a variable is invalid. */
808 current_function_decl != 0
809 && ! TREE_THIS_VOLATILE (decl)
810 && TREE_READONLY (decl)
811 && DECL_INITIAL (decl) != 0
812 && TREE_CODE (DECL_INITIAL (decl)) != ERROR_MARK
813 /* This is invalid if initial value is not constant.
814 If it has either a function call, a memory reference,
815 or a variable, then re-evaluating it could give different results. */
816 && TREE_CONSTANT (DECL_INITIAL (decl))
817 /* Check for cases where this is sub-optimal, even though valid. */
818 && TREE_CODE (DECL_INITIAL (decl)) != CONSTRUCTOR)
819 return DECL_INITIAL (decl);
823 /* Return either DECL or its known constant value (if it has one), but
824 return DECL if pedantic or DECL has mode BLKmode. This is for
825 bug-compatibility with the old behavior of decl_constant_value
826 (before GCC 3.0); every use of this function is a bug and it should
827 be removed before GCC 3.1. It is not appropriate to use pedantic
828 in a way that affects optimization, and BLKmode is probably not the
829 right test for avoiding misoptimizations either. */
832 decl_constant_value_for_broken_optimization (decl)
835 if (pedantic || DECL_MODE (decl) == BLKmode)
838 return decl_constant_value (decl);
841 /* Perform default promotions for C data used in expressions.
842 Arrays and functions are converted to pointers;
843 enumeral types or short or char, to int.
844 In addition, manifest constants symbols are replaced by their values. */
847 default_conversion (exp)
850 tree type = TREE_TYPE (exp);
851 enum tree_code code = TREE_CODE (type);
853 /* Constants can be used directly unless they're not loadable. */
854 if (TREE_CODE (exp) == CONST_DECL)
855 exp = DECL_INITIAL (exp);
857 /* Replace a nonvolatile const static variable with its value unless
858 it is an array, in which case we must be sure that taking the
859 address of the array produces consistent results. */
860 else if (optimize && TREE_CODE (exp) == VAR_DECL && code != ARRAY_TYPE)
862 exp = decl_constant_value_for_broken_optimization (exp);
863 type = TREE_TYPE (exp);
866 /* Strip NON_LVALUE_EXPRs and no-op conversions, since we aren't using as
869 Do not use STRIP_NOPS here! It will remove conversions from pointer
870 to integer and cause infinite recursion. */
871 while (TREE_CODE (exp) == NON_LVALUE_EXPR
872 || (TREE_CODE (exp) == NOP_EXPR
873 && TREE_TYPE (TREE_OPERAND (exp, 0)) == TREE_TYPE (exp)))
874 exp = TREE_OPERAND (exp, 0);
876 /* Normally convert enums to int,
877 but convert wide enums to something wider. */
878 if (code == ENUMERAL_TYPE)
880 type = type_for_size (MAX (TYPE_PRECISION (type),
881 TYPE_PRECISION (integer_type_node)),
883 || (TYPE_PRECISION (type)
884 >= TYPE_PRECISION (integer_type_node)))
885 && TREE_UNSIGNED (type)));
887 return convert (type, exp);
890 if (TREE_CODE (exp) == COMPONENT_REF
891 && DECL_C_BIT_FIELD (TREE_OPERAND (exp, 1))
892 /* If it's thinner than an int, promote it like a
893 c_promoting_integer_type_p, otherwise leave it alone. */
894 && 0 > compare_tree_int (DECL_SIZE (TREE_OPERAND (exp, 1)),
895 TYPE_PRECISION (integer_type_node)))
896 return convert (flag_traditional && TREE_UNSIGNED (type)
897 ? unsigned_type_node : integer_type_node,
900 if (c_promoting_integer_type_p (type))
902 /* Traditionally, unsignedness is preserved in default promotions.
903 Also preserve unsignedness if not really getting any wider. */
904 if (TREE_UNSIGNED (type)
906 || TYPE_PRECISION (type) == TYPE_PRECISION (integer_type_node)))
907 return convert (unsigned_type_node, exp);
909 return convert (integer_type_node, exp);
912 if (flag_traditional && !flag_allow_single_precision
913 && TYPE_MAIN_VARIANT (type) == float_type_node)
914 return convert (double_type_node, exp);
916 if (code == VOID_TYPE)
918 error ("void value not ignored as it ought to be");
919 return error_mark_node;
921 if (code == FUNCTION_TYPE)
923 return build_unary_op (ADDR_EXPR, exp, 0);
925 if (code == ARRAY_TYPE)
928 tree restype = TREE_TYPE (type);
933 if (TREE_CODE_CLASS (TREE_CODE (exp)) == 'r' || DECL_P (exp))
935 constp = TREE_READONLY (exp);
936 volatilep = TREE_THIS_VOLATILE (exp);
939 if (TYPE_QUALS (type) || constp || volatilep)
941 = c_build_qualified_type (restype,
943 | (constp * TYPE_QUAL_CONST)
944 | (volatilep * TYPE_QUAL_VOLATILE));
946 if (TREE_CODE (exp) == INDIRECT_REF)
947 return convert (TYPE_POINTER_TO (restype),
948 TREE_OPERAND (exp, 0));
950 if (TREE_CODE (exp) == COMPOUND_EXPR)
952 tree op1 = default_conversion (TREE_OPERAND (exp, 1));
953 return build (COMPOUND_EXPR, TREE_TYPE (op1),
954 TREE_OPERAND (exp, 0), op1);
958 && ! (TREE_CODE (exp) == CONSTRUCTOR && TREE_STATIC (exp)))
960 error ("invalid use of non-lvalue array");
961 return error_mark_node;
964 ptrtype = build_pointer_type (restype);
966 if (TREE_CODE (exp) == VAR_DECL)
968 /* ??? This is not really quite correct
969 in that the type of the operand of ADDR_EXPR
970 is not the target type of the type of the ADDR_EXPR itself.
971 Question is, can this lossage be avoided? */
972 adr = build1 (ADDR_EXPR, ptrtype, exp);
973 if (mark_addressable (exp) == 0)
974 return error_mark_node;
975 TREE_CONSTANT (adr) = staticp (exp);
976 TREE_SIDE_EFFECTS (adr) = 0; /* Default would be, same as EXP. */
979 /* This way is better for a COMPONENT_REF since it can
980 simplify the offset for a component. */
981 adr = build_unary_op (ADDR_EXPR, exp, 1);
982 return convert (ptrtype, adr);
987 /* Look up component name in the structure type definition.
989 If this component name is found indirectly within an anonymous union,
990 store in *INDIRECT the component which directly contains
991 that anonymous union. Otherwise, set *INDIRECT to 0. */
994 lookup_field (type, component, indirect)
995 tree type, component;
1000 /* If TYPE_LANG_SPECIFIC is set, then it is a sorted array of pointers
1001 to the field elements. Use a binary search on this array to quickly
1002 find the element. Otherwise, do a linear search. TYPE_LANG_SPECIFIC
1003 will always be set for structures which have many elements. */
1005 if (TYPE_LANG_SPECIFIC (type))
1008 tree *field_array = &TYPE_LANG_SPECIFIC (type)->elts[0];
1010 field = TYPE_FIELDS (type);
1012 top = TYPE_LANG_SPECIFIC (type)->len;
1013 while (top - bot > 1)
1015 half = (top - bot + 1) >> 1;
1016 field = field_array[bot+half];
1018 if (DECL_NAME (field) == NULL_TREE)
1020 /* Step through all anon unions in linear fashion. */
1021 while (DECL_NAME (field_array[bot]) == NULL_TREE)
1023 tree anon = 0, junk;
1025 field = field_array[bot++];
1026 if (TREE_CODE (TREE_TYPE (field)) == RECORD_TYPE
1027 || TREE_CODE (TREE_TYPE (field)) == UNION_TYPE)
1028 anon = lookup_field (TREE_TYPE (field), component, &junk);
1030 if (anon != NULL_TREE)
1037 /* Entire record is only anon unions. */
1041 /* Restart the binary search, with new lower bound. */
1045 if (DECL_NAME (field) == component)
1047 if (DECL_NAME (field) < component)
1053 if (DECL_NAME (field_array[bot]) == component)
1054 field = field_array[bot];
1055 else if (DECL_NAME (field) != component)
1060 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
1062 if (DECL_NAME (field) == NULL_TREE)
1067 if (TREE_CODE (TREE_TYPE (field)) == RECORD_TYPE
1068 || TREE_CODE (TREE_TYPE (field)) == UNION_TYPE)
1069 anon = lookup_field (TREE_TYPE (field), component, &junk);
1071 if (anon != NULL_TREE)
1078 if (DECL_NAME (field) == component)
1083 *indirect = NULL_TREE;
1087 /* Make an expression to refer to the COMPONENT field of
1088 structure or union value DATUM. COMPONENT is an IDENTIFIER_NODE. */
1091 build_component_ref (datum, component)
1092 tree datum, component;
1094 tree type = TREE_TYPE (datum);
1095 enum tree_code code = TREE_CODE (type);
1099 /* If DATUM is a COMPOUND_EXPR or COND_EXPR, move our reference inside it
1100 unless we are not to support things not strictly ANSI. */
1101 switch (TREE_CODE (datum))
1105 tree value = build_component_ref (TREE_OPERAND (datum, 1), component);
1106 return build (COMPOUND_EXPR, TREE_TYPE (value),
1107 TREE_OPERAND (datum, 0), value);
1110 return build_conditional_expr
1111 (TREE_OPERAND (datum, 0),
1112 build_component_ref (TREE_OPERAND (datum, 1), component),
1113 build_component_ref (TREE_OPERAND (datum, 2), component));
1119 /* See if there is a field or component with name COMPONENT. */
1121 if (code == RECORD_TYPE || code == UNION_TYPE)
1125 if (!COMPLETE_TYPE_P (type))
1127 incomplete_type_error (NULL_TREE, type);
1128 return error_mark_node;
1131 field = lookup_field (type, component, &indirect);
1135 error ("%s has no member named `%s'",
1136 code == RECORD_TYPE ? "structure" : "union",
1137 IDENTIFIER_POINTER (component));
1138 return error_mark_node;
1140 if (TREE_TYPE (field) == error_mark_node)
1141 return error_mark_node;
1143 /* If FIELD was found buried within an anonymous union,
1144 make one COMPONENT_REF to get that anonymous union,
1145 then fall thru to make a second COMPONENT_REF to get FIELD. */
1148 ref = build (COMPONENT_REF, TREE_TYPE (indirect), datum, indirect);
1149 if (TREE_READONLY (datum) || TREE_READONLY (indirect))
1150 TREE_READONLY (ref) = 1;
1151 if (TREE_THIS_VOLATILE (datum) || TREE_THIS_VOLATILE (indirect))
1152 TREE_THIS_VOLATILE (ref) = 1;
1156 ref = build (COMPONENT_REF, TREE_TYPE (field), datum, field);
1158 if (TREE_READONLY (datum) || TREE_READONLY (field))
1159 TREE_READONLY (ref) = 1;
1160 if (TREE_THIS_VOLATILE (datum) || TREE_THIS_VOLATILE (field))
1161 TREE_THIS_VOLATILE (ref) = 1;
1165 else if (code != ERROR_MARK)
1166 error ("request for member `%s' in something not a structure or union",
1167 IDENTIFIER_POINTER (component));
1169 return error_mark_node;
1172 /* Given an expression PTR for a pointer, return an expression
1173 for the value pointed to.
1174 ERRORSTRING is the name of the operator to appear in error messages. */
1177 build_indirect_ref (ptr, errorstring)
1179 const char *errorstring;
1181 tree pointer = default_conversion (ptr);
1182 tree type = TREE_TYPE (pointer);
1184 if (TREE_CODE (type) == POINTER_TYPE)
1186 if (TREE_CODE (pointer) == ADDR_EXPR
1188 && (TREE_TYPE (TREE_OPERAND (pointer, 0))
1189 == TREE_TYPE (type)))
1190 return TREE_OPERAND (pointer, 0);
1193 tree t = TREE_TYPE (type);
1194 tree ref = build1 (INDIRECT_REF, TYPE_MAIN_VARIANT (t), pointer);
1196 if (!COMPLETE_OR_VOID_TYPE_P (t) && TREE_CODE (t) != ARRAY_TYPE)
1198 error ("dereferencing pointer to incomplete type");
1199 return error_mark_node;
1201 if (VOID_TYPE_P (t) && skip_evaluation == 0)
1202 warning ("dereferencing `void *' pointer");
1204 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
1205 so that we get the proper error message if the result is used
1206 to assign to. Also, &* is supposed to be a no-op.
1207 And ANSI C seems to specify that the type of the result
1208 should be the const type. */
1209 /* A de-reference of a pointer to const is not a const. It is valid
1210 to change it via some other pointer. */
1211 TREE_READONLY (ref) = TYPE_READONLY (t);
1212 TREE_SIDE_EFFECTS (ref)
1213 = TYPE_VOLATILE (t) || TREE_SIDE_EFFECTS (pointer) || flag_volatile;
1214 TREE_THIS_VOLATILE (ref) = TYPE_VOLATILE (t);
1218 else if (TREE_CODE (pointer) != ERROR_MARK)
1219 error ("invalid type argument of `%s'", errorstring);
1220 return error_mark_node;
1223 /* This handles expressions of the form "a[i]", which denotes
1226 This is logically equivalent in C to *(a+i), but we may do it differently.
1227 If A is a variable or a member, we generate a primitive ARRAY_REF.
1228 This avoids forcing the array out of registers, and can work on
1229 arrays that are not lvalues (for example, members of structures returned
1233 build_array_ref (array, index)
1238 error ("subscript missing in array reference");
1239 return error_mark_node;
1242 if (TREE_TYPE (array) == error_mark_node
1243 || TREE_TYPE (index) == error_mark_node)
1244 return error_mark_node;
1246 if (TREE_CODE (TREE_TYPE (array)) == ARRAY_TYPE
1247 && TREE_CODE (array) != INDIRECT_REF)
1251 /* Subscripting with type char is likely to lose
1252 on a machine where chars are signed.
1253 So warn on any machine, but optionally.
1254 Don't warn for unsigned char since that type is safe.
1255 Don't warn for signed char because anyone who uses that
1256 must have done so deliberately. */
1257 if (warn_char_subscripts
1258 && TYPE_MAIN_VARIANT (TREE_TYPE (index)) == char_type_node)
1259 warning ("array subscript has type `char'");
1261 /* Apply default promotions *after* noticing character types. */
1262 index = default_conversion (index);
1264 /* Require integer *after* promotion, for sake of enums. */
1265 if (TREE_CODE (TREE_TYPE (index)) != INTEGER_TYPE)
1267 error ("array subscript is not an integer");
1268 return error_mark_node;
1271 /* An array that is indexed by a non-constant
1272 cannot be stored in a register; we must be able to do
1273 address arithmetic on its address.
1274 Likewise an array of elements of variable size. */
1275 if (TREE_CODE (index) != INTEGER_CST
1276 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array)))
1277 && TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array)))) != INTEGER_CST))
1279 if (mark_addressable (array) == 0)
1280 return error_mark_node;
1282 /* An array that is indexed by a constant value which is not within
1283 the array bounds cannot be stored in a register either; because we
1284 would get a crash in store_bit_field/extract_bit_field when trying
1285 to access a non-existent part of the register. */
1286 if (TREE_CODE (index) == INTEGER_CST
1287 && TYPE_VALUES (TREE_TYPE (array))
1288 && ! int_fits_type_p (index, TYPE_VALUES (TREE_TYPE (array))))
1290 if (mark_addressable (array) == 0)
1291 return error_mark_node;
1297 while (TREE_CODE (foo) == COMPONENT_REF)
1298 foo = TREE_OPERAND (foo, 0);
1299 if (TREE_CODE (foo) == VAR_DECL && DECL_REGISTER (foo))
1300 pedwarn ("ISO C forbids subscripting `register' array");
1301 else if (! flag_isoc99 && ! lvalue_p (foo))
1302 pedwarn ("ISO C89 forbids subscripting non-lvalue array");
1305 type = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (array)));
1306 rval = build (ARRAY_REF, type, array, index);
1307 /* Array ref is const/volatile if the array elements are
1308 or if the array is. */
1309 TREE_READONLY (rval)
1310 |= (TYPE_READONLY (TREE_TYPE (TREE_TYPE (array)))
1311 | TREE_READONLY (array));
1312 TREE_SIDE_EFFECTS (rval)
1313 |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array)))
1314 | TREE_SIDE_EFFECTS (array));
1315 TREE_THIS_VOLATILE (rval)
1316 |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array)))
1317 /* This was added by rms on 16 Nov 91.
1318 It fixes vol struct foo *a; a->elts[1]
1319 in an inline function.
1320 Hope it doesn't break something else. */
1321 | TREE_THIS_VOLATILE (array));
1322 return require_complete_type (fold (rval));
1326 tree ar = default_conversion (array);
1327 tree ind = default_conversion (index);
1329 /* Do the same warning check as above, but only on the part that's
1330 syntactically the index and only if it is also semantically
1332 if (warn_char_subscripts
1333 && TREE_CODE (TREE_TYPE (index)) == INTEGER_TYPE
1334 && TYPE_MAIN_VARIANT (TREE_TYPE (index)) == char_type_node)
1335 warning ("subscript has type `char'");
1337 /* Put the integer in IND to simplify error checking. */
1338 if (TREE_CODE (TREE_TYPE (ar)) == INTEGER_TYPE)
1345 if (ar == error_mark_node)
1348 if (TREE_CODE (TREE_TYPE (ar)) != POINTER_TYPE
1349 || TREE_CODE (TREE_TYPE (TREE_TYPE (ar))) == FUNCTION_TYPE)
1351 error ("subscripted value is neither array nor pointer");
1352 return error_mark_node;
1354 if (TREE_CODE (TREE_TYPE (ind)) != INTEGER_TYPE)
1356 error ("array subscript is not an integer");
1357 return error_mark_node;
1360 return build_indirect_ref (build_binary_op (PLUS_EXPR, ar, ind, 0),
1365 /* Build an external reference to identifier ID. FUN indicates
1366 whether this will be used for a function call. */
1368 build_external_ref (id, fun)
1373 tree decl = lookup_name (id);
1374 tree objc_ivar = lookup_objc_ivar (id);
1376 if (!decl || decl == error_mark_node || C_DECL_ANTICIPATED (decl))
1382 if (!decl || decl == error_mark_node)
1383 /* Ordinary implicit function declaration. */
1384 ref = implicitly_declare (id);
1387 /* Implicit declaration of built-in function. Don't
1388 change the built-in declaration, but don't let this
1389 go by silently, either. */
1390 implicit_decl_warning (id);
1392 /* only issue this warning once */
1393 C_DECL_ANTICIPATED (decl) = 0;
1399 /* Reference to undeclared variable, including reference to
1400 builtin outside of function-call context. */
1401 if (current_function_decl == 0)
1402 error ("`%s' undeclared here (not in a function)",
1403 IDENTIFIER_POINTER (id));
1406 if (IDENTIFIER_GLOBAL_VALUE (id) != error_mark_node
1407 || IDENTIFIER_ERROR_LOCUS (id) != current_function_decl)
1409 error ("`%s' undeclared (first use in this function)",
1410 IDENTIFIER_POINTER (id));
1412 if (! undeclared_variable_notice)
1414 error ("(Each undeclared identifier is reported only once");
1415 error ("for each function it appears in.)");
1416 undeclared_variable_notice = 1;
1419 IDENTIFIER_GLOBAL_VALUE (id) = error_mark_node;
1420 IDENTIFIER_ERROR_LOCUS (id) = current_function_decl;
1422 return error_mark_node;
1427 /* Properly declared variable or function reference. */
1430 else if (decl != objc_ivar && IDENTIFIER_LOCAL_VALUE (id))
1432 warning ("local declaration of `%s' hides instance variable",
1433 IDENTIFIER_POINTER (id));
1440 if (TREE_TYPE (ref) == error_mark_node)
1441 return error_mark_node;
1443 assemble_external (ref);
1444 TREE_USED (ref) = 1;
1446 if (TREE_CODE (ref) == CONST_DECL)
1448 ref = DECL_INITIAL (ref);
1449 TREE_CONSTANT (ref) = 1;
1455 /* Build a function call to function FUNCTION with parameters PARAMS.
1456 PARAMS is a list--a chain of TREE_LIST nodes--in which the
1457 TREE_VALUE of each node is a parameter-expression.
1458 FUNCTION's data type may be a function type or a pointer-to-function. */
1461 build_function_call (function, params)
1462 tree function, params;
1464 tree fntype, fundecl = 0;
1465 tree coerced_params;
1466 tree name = NULL_TREE, assembler_name = NULL_TREE, result;
1468 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
1469 STRIP_TYPE_NOPS (function);
1471 /* Convert anything with function type to a pointer-to-function. */
1472 if (TREE_CODE (function) == FUNCTION_DECL)
1474 name = DECL_NAME (function);
1475 assembler_name = DECL_ASSEMBLER_NAME (function);
1477 /* Differs from default_conversion by not setting TREE_ADDRESSABLE
1478 (because calling an inline function does not mean the function
1479 needs to be separately compiled). */
1480 fntype = build_type_variant (TREE_TYPE (function),
1481 TREE_READONLY (function),
1482 TREE_THIS_VOLATILE (function));
1484 function = build1 (ADDR_EXPR, build_pointer_type (fntype), function);
1487 function = default_conversion (function);
1489 fntype = TREE_TYPE (function);
1491 if (TREE_CODE (fntype) == ERROR_MARK)
1492 return error_mark_node;
1494 if (!(TREE_CODE (fntype) == POINTER_TYPE
1495 && TREE_CODE (TREE_TYPE (fntype)) == FUNCTION_TYPE))
1497 error ("called object is not a function");
1498 return error_mark_node;
1501 /* fntype now gets the type of function pointed to. */
1502 fntype = TREE_TYPE (fntype);
1504 /* Convert the parameters to the types declared in the
1505 function prototype, or apply default promotions. */
1508 = convert_arguments (TYPE_ARG_TYPES (fntype), params, name, fundecl);
1510 /* Check for errors in format strings. */
1513 check_function_format (NULL, TYPE_ATTRIBUTES (fntype), coerced_params);
1515 /* Recognize certain built-in functions so we can make tree-codes
1516 other than CALL_EXPR. We do this when it enables fold-const.c
1517 to do something useful. */
1519 if (TREE_CODE (function) == ADDR_EXPR
1520 && TREE_CODE (TREE_OPERAND (function, 0)) == FUNCTION_DECL
1521 && DECL_BUILT_IN (TREE_OPERAND (function, 0)))
1523 result = expand_tree_builtin (TREE_OPERAND (function, 0),
1524 params, coerced_params);
1529 result = build (CALL_EXPR, TREE_TYPE (fntype),
1530 function, coerced_params, NULL_TREE);
1531 TREE_SIDE_EFFECTS (result) = 1;
1532 result = fold (result);
1534 if (VOID_TYPE_P (TREE_TYPE (result)))
1536 return require_complete_type (result);
1539 /* Convert the argument expressions in the list VALUES
1540 to the types in the list TYPELIST. The result is a list of converted
1541 argument expressions.
1543 If TYPELIST is exhausted, or when an element has NULL as its type,
1544 perform the default conversions.
1546 PARMLIST is the chain of parm decls for the function being called.
1547 It may be 0, if that info is not available.
1548 It is used only for generating error messages.
1550 NAME is an IDENTIFIER_NODE or 0. It is used only for error messages.
1552 This is also where warnings about wrong number of args are generated.
1554 Both VALUES and the returned value are chains of TREE_LIST nodes
1555 with the elements of the list in the TREE_VALUE slots of those nodes. */
1558 convert_arguments (typelist, values, name, fundecl)
1559 tree typelist, values, name, fundecl;
1561 tree typetail, valtail;
1565 /* Scan the given expressions and types, producing individual
1566 converted arguments and pushing them on RESULT in reverse order. */
1568 for (valtail = values, typetail = typelist, parmnum = 0;
1570 valtail = TREE_CHAIN (valtail), parmnum++)
1572 tree type = typetail ? TREE_VALUE (typetail) : 0;
1573 tree val = TREE_VALUE (valtail);
1575 if (type == void_type_node)
1578 error ("too many arguments to function `%s'",
1579 IDENTIFIER_POINTER (name));
1581 error ("too many arguments to function");
1585 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
1586 /* Do not use STRIP_NOPS here! We do not want an enumerator with value 0
1587 to convert automatically to a pointer. */
1588 if (TREE_CODE (val) == NON_LVALUE_EXPR)
1589 val = TREE_OPERAND (val, 0);
1591 if (TREE_CODE (TREE_TYPE (val)) == ARRAY_TYPE
1592 || TREE_CODE (TREE_TYPE (val)) == FUNCTION_TYPE)
1593 val = default_conversion (val);
1595 val = require_complete_type (val);
1599 /* Formal parm type is specified by a function prototype. */
1602 if (!COMPLETE_TYPE_P (type))
1604 error ("type of formal parameter %d is incomplete", parmnum + 1);
1609 /* Optionally warn about conversions that
1610 differ from the default conversions. */
1611 if (warn_conversion || warn_traditional)
1613 int formal_prec = TYPE_PRECISION (type);
1615 if (INTEGRAL_TYPE_P (type)
1616 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
1617 warn_for_assignment ("%s as integer rather than floating due to prototype", (char *) 0, name, parmnum + 1);
1618 if (INTEGRAL_TYPE_P (type)
1619 && TREE_CODE (TREE_TYPE (val)) == COMPLEX_TYPE)
1620 warn_for_assignment ("%s as integer rather than complex due to prototype", (char *) 0, name, parmnum + 1);
1621 else if (TREE_CODE (type) == COMPLEX_TYPE
1622 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
1623 warn_for_assignment ("%s as complex rather than floating due to prototype", (char *) 0, name, parmnum + 1);
1624 else if (TREE_CODE (type) == REAL_TYPE
1625 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
1626 warn_for_assignment ("%s as floating rather than integer due to prototype", (char *) 0, name, parmnum + 1);
1627 else if (TREE_CODE (type) == COMPLEX_TYPE
1628 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
1629 warn_for_assignment ("%s as complex rather than integer due to prototype", (char *) 0, name, parmnum + 1);
1630 else if (TREE_CODE (type) == REAL_TYPE
1631 && TREE_CODE (TREE_TYPE (val)) == COMPLEX_TYPE)
1632 warn_for_assignment ("%s as floating rather than complex due to prototype", (char *) 0, name, parmnum + 1);
1633 /* ??? At some point, messages should be written about
1634 conversions between complex types, but that's too messy
1636 else if (TREE_CODE (type) == REAL_TYPE
1637 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
1639 /* Warn if any argument is passed as `float',
1640 since without a prototype it would be `double'. */
1641 if (formal_prec == TYPE_PRECISION (float_type_node))
1642 warn_for_assignment ("%s as `float' rather than `double' due to prototype", (char *) 0, name, parmnum + 1);
1644 /* Detect integer changing in width or signedness.
1645 These warnings are only activated with
1646 -Wconversion, not with -Wtraditional. */
1647 else if (warn_conversion && INTEGRAL_TYPE_P (type)
1648 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
1650 tree would_have_been = default_conversion (val);
1651 tree type1 = TREE_TYPE (would_have_been);
1653 if (TREE_CODE (type) == ENUMERAL_TYPE
1654 && (TYPE_MAIN_VARIANT (type)
1655 == TYPE_MAIN_VARIANT (TREE_TYPE (val))))
1656 /* No warning if function asks for enum
1657 and the actual arg is that enum type. */
1659 else if (formal_prec != TYPE_PRECISION (type1))
1660 warn_for_assignment ("%s with different width due to prototype", (char *) 0, name, parmnum + 1);
1661 else if (TREE_UNSIGNED (type) == TREE_UNSIGNED (type1))
1663 /* Don't complain if the formal parameter type
1664 is an enum, because we can't tell now whether
1665 the value was an enum--even the same enum. */
1666 else if (TREE_CODE (type) == ENUMERAL_TYPE)
1668 else if (TREE_CODE (val) == INTEGER_CST
1669 && int_fits_type_p (val, type))
1670 /* Change in signedness doesn't matter
1671 if a constant value is unaffected. */
1673 /* Likewise for a constant in a NOP_EXPR. */
1674 else if (TREE_CODE (val) == NOP_EXPR
1675 && TREE_CODE (TREE_OPERAND (val, 0)) == INTEGER_CST
1676 && int_fits_type_p (TREE_OPERAND (val, 0), type))
1678 #if 0 /* We never get such tree structure here. */
1679 else if (TREE_CODE (TREE_TYPE (val)) == ENUMERAL_TYPE
1680 && int_fits_type_p (TYPE_MIN_VALUE (TREE_TYPE (val)), type)
1681 && int_fits_type_p (TYPE_MAX_VALUE (TREE_TYPE (val)), type))
1682 /* Change in signedness doesn't matter
1683 if an enum value is unaffected. */
1686 /* If the value is extended from a narrower
1687 unsigned type, it doesn't matter whether we
1688 pass it as signed or unsigned; the value
1689 certainly is the same either way. */
1690 else if (TYPE_PRECISION (TREE_TYPE (val)) < TYPE_PRECISION (type)
1691 && TREE_UNSIGNED (TREE_TYPE (val)))
1693 else if (TREE_UNSIGNED (type))
1694 warn_for_assignment ("%s as unsigned due to prototype", (char *) 0, name, parmnum + 1);
1696 warn_for_assignment ("%s as signed due to prototype", (char *) 0, name, parmnum + 1);
1700 parmval = convert_for_assignment (type, val,
1701 (char *) 0, /* arg passing */
1702 fundecl, name, parmnum + 1);
1704 if (PROMOTE_PROTOTYPES
1705 && INTEGRAL_TYPE_P (type)
1706 && (TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node)))
1707 parmval = default_conversion (parmval);
1709 result = tree_cons (NULL_TREE, parmval, result);
1711 else if (TREE_CODE (TREE_TYPE (val)) == REAL_TYPE
1712 && (TYPE_PRECISION (TREE_TYPE (val))
1713 < TYPE_PRECISION (double_type_node)))
1714 /* Convert `float' to `double'. */
1715 result = tree_cons (NULL_TREE, convert (double_type_node, val), result);
1717 /* Convert `short' and `char' to full-size `int'. */
1718 result = tree_cons (NULL_TREE, default_conversion (val), result);
1721 typetail = TREE_CHAIN (typetail);
1724 if (typetail != 0 && TREE_VALUE (typetail) != void_type_node)
1727 error ("too few arguments to function `%s'",
1728 IDENTIFIER_POINTER (name));
1730 error ("too few arguments to function");
1733 return nreverse (result);
1736 /* This is the entry point used by the parser
1737 for binary operators in the input.
1738 In addition to constructing the expression,
1739 we check for operands that were written with other binary operators
1740 in a way that is likely to confuse the user. */
1743 parser_build_binary_op (code, arg1, arg2)
1744 enum tree_code code;
1747 tree result = build_binary_op (code, arg1, arg2, 1);
1750 char class1 = TREE_CODE_CLASS (TREE_CODE (arg1));
1751 char class2 = TREE_CODE_CLASS (TREE_CODE (arg2));
1752 enum tree_code code1 = ERROR_MARK;
1753 enum tree_code code2 = ERROR_MARK;
1755 if (IS_EXPR_CODE_CLASS (class1))
1756 code1 = C_EXP_ORIGINAL_CODE (arg1);
1757 if (IS_EXPR_CODE_CLASS (class2))
1758 code2 = C_EXP_ORIGINAL_CODE (arg2);
1760 /* Check for cases such as x+y<<z which users are likely
1761 to misinterpret. If parens are used, C_EXP_ORIGINAL_CODE
1762 is cleared to prevent these warnings. */
1763 if (warn_parentheses)
1765 if (code == LSHIFT_EXPR || code == RSHIFT_EXPR)
1767 if (code1 == PLUS_EXPR || code1 == MINUS_EXPR
1768 || code2 == PLUS_EXPR || code2 == MINUS_EXPR)
1769 warning ("suggest parentheses around + or - inside shift");
1772 if (code == TRUTH_ORIF_EXPR)
1774 if (code1 == TRUTH_ANDIF_EXPR
1775 || code2 == TRUTH_ANDIF_EXPR)
1776 warning ("suggest parentheses around && within ||");
1779 if (code == BIT_IOR_EXPR)
1781 if (code1 == BIT_AND_EXPR || code1 == BIT_XOR_EXPR
1782 || code1 == PLUS_EXPR || code1 == MINUS_EXPR
1783 || code2 == BIT_AND_EXPR || code2 == BIT_XOR_EXPR
1784 || code2 == PLUS_EXPR || code2 == MINUS_EXPR)
1785 warning ("suggest parentheses around arithmetic in operand of |");
1786 /* Check cases like x|y==z */
1787 if (TREE_CODE_CLASS (code1) == '<' || TREE_CODE_CLASS (code2) == '<')
1788 warning ("suggest parentheses around comparison in operand of |");
1791 if (code == BIT_XOR_EXPR)
1793 if (code1 == BIT_AND_EXPR
1794 || code1 == PLUS_EXPR || code1 == MINUS_EXPR
1795 || code2 == BIT_AND_EXPR
1796 || code2 == PLUS_EXPR || code2 == MINUS_EXPR)
1797 warning ("suggest parentheses around arithmetic in operand of ^");
1798 /* Check cases like x^y==z */
1799 if (TREE_CODE_CLASS (code1) == '<' || TREE_CODE_CLASS (code2) == '<')
1800 warning ("suggest parentheses around comparison in operand of ^");
1803 if (code == BIT_AND_EXPR)
1805 if (code1 == PLUS_EXPR || code1 == MINUS_EXPR
1806 || code2 == PLUS_EXPR || code2 == MINUS_EXPR)
1807 warning ("suggest parentheses around + or - in operand of &");
1808 /* Check cases like x&y==z */
1809 if (TREE_CODE_CLASS (code1) == '<' || TREE_CODE_CLASS (code2) == '<')
1810 warning ("suggest parentheses around comparison in operand of &");
1814 /* Similarly, check for cases like 1<=i<=10 that are probably errors. */
1815 if (TREE_CODE_CLASS (code) == '<' && extra_warnings
1816 && (TREE_CODE_CLASS (code1) == '<' || TREE_CODE_CLASS (code2) == '<'))
1817 warning ("comparisons like X<=Y<=Z do not have their mathematical meaning");
1819 unsigned_conversion_warning (result, arg1);
1820 unsigned_conversion_warning (result, arg2);
1821 overflow_warning (result);
1823 class = TREE_CODE_CLASS (TREE_CODE (result));
1825 /* Record the code that was specified in the source,
1826 for the sake of warnings about confusing nesting. */
1827 if (IS_EXPR_CODE_CLASS (class))
1828 C_SET_EXP_ORIGINAL_CODE (result, code);
1831 int flag = TREE_CONSTANT (result);
1832 /* We used to use NOP_EXPR rather than NON_LVALUE_EXPR
1833 so that convert_for_assignment wouldn't strip it.
1834 That way, we got warnings for things like p = (1 - 1).
1835 But it turns out we should not get those warnings. */
1836 result = build1 (NON_LVALUE_EXPR, TREE_TYPE (result), result);
1837 C_SET_EXP_ORIGINAL_CODE (result, code);
1838 TREE_CONSTANT (result) = flag;
1844 /* Build a binary-operation expression without default conversions.
1845 CODE is the kind of expression to build.
1846 This function differs from `build' in several ways:
1847 the data type of the result is computed and recorded in it,
1848 warnings are generated if arg data types are invalid,
1849 special handling for addition and subtraction of pointers is known,
1850 and some optimization is done (operations on narrow ints
1851 are done in the narrower type when that gives the same result).
1852 Constant folding is also done before the result is returned.
1854 Note that the operands will never have enumeral types, or function
1855 or array types, because either they will have the default conversions
1856 performed or they have both just been converted to some other type in which
1857 the arithmetic is to be done. */
1860 build_binary_op (code, orig_op0, orig_op1, convert_p)
1861 enum tree_code code;
1862 tree orig_op0, orig_op1;
1866 enum tree_code code0, code1;
1869 /* Expression code to give to the expression when it is built.
1870 Normally this is CODE, which is what the caller asked for,
1871 but in some special cases we change it. */
1872 enum tree_code resultcode = code;
1874 /* Data type in which the computation is to be performed.
1875 In the simplest cases this is the common type of the arguments. */
1876 tree result_type = NULL;
1878 /* Nonzero means operands have already been type-converted
1879 in whatever way is necessary.
1880 Zero means they need to be converted to RESULT_TYPE. */
1883 /* Nonzero means create the expression with this type, rather than
1885 tree build_type = 0;
1887 /* Nonzero means after finally constructing the expression
1888 convert it to this type. */
1889 tree final_type = 0;
1891 /* Nonzero if this is an operation like MIN or MAX which can
1892 safely be computed in short if both args are promoted shorts.
1893 Also implies COMMON.
1894 -1 indicates a bitwise operation; this makes a difference
1895 in the exact conditions for when it is safe to do the operation
1896 in a narrower mode. */
1899 /* Nonzero if this is a comparison operation;
1900 if both args are promoted shorts, compare the original shorts.
1901 Also implies COMMON. */
1902 int short_compare = 0;
1904 /* Nonzero if this is a right-shift operation, which can be computed on the
1905 original short and then promoted if the operand is a promoted short. */
1906 int short_shift = 0;
1908 /* Nonzero means set RESULT_TYPE to the common type of the args. */
1913 op0 = default_conversion (orig_op0);
1914 op1 = default_conversion (orig_op1);
1922 type0 = TREE_TYPE (op0);
1923 type1 = TREE_TYPE (op1);
1925 /* The expression codes of the data types of the arguments tell us
1926 whether the arguments are integers, floating, pointers, etc. */
1927 code0 = TREE_CODE (type0);
1928 code1 = TREE_CODE (type1);
1930 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
1931 STRIP_TYPE_NOPS (op0);
1932 STRIP_TYPE_NOPS (op1);
1934 /* If an error was already reported for one of the arguments,
1935 avoid reporting another error. */
1937 if (code0 == ERROR_MARK || code1 == ERROR_MARK)
1938 return error_mark_node;
1943 /* Handle the pointer + int case. */
1944 if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
1945 return pointer_int_sum (PLUS_EXPR, op0, op1);
1946 else if (code1 == POINTER_TYPE && code0 == INTEGER_TYPE)
1947 return pointer_int_sum (PLUS_EXPR, op1, op0);
1953 /* Subtraction of two similar pointers.
1954 We must subtract them as integers, then divide by object size. */
1955 if (code0 == POINTER_TYPE && code1 == POINTER_TYPE
1956 && comp_target_types (type0, type1))
1957 return pointer_diff (op0, op1);
1958 /* Handle pointer minus int. Just like pointer plus int. */
1959 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
1960 return pointer_int_sum (MINUS_EXPR, op0, op1);
1969 case TRUNC_DIV_EXPR:
1971 case FLOOR_DIV_EXPR:
1972 case ROUND_DIV_EXPR:
1973 case EXACT_DIV_EXPR:
1974 /* Floating point division by zero is a legitimate way to obtain
1975 infinities and NaNs. */
1976 if (warn_div_by_zero && skip_evaluation == 0 && integer_zerop (op1))
1977 warning ("division by zero");
1979 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
1980 || code0 == COMPLEX_TYPE)
1981 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
1982 || code1 == COMPLEX_TYPE))
1984 if (!(code0 == INTEGER_TYPE && code1 == INTEGER_TYPE))
1985 resultcode = RDIV_EXPR;
1987 /* Although it would be tempting to shorten always here, that
1988 loses on some targets, since the modulo instruction is
1989 undefined if the quotient can't be represented in the
1990 computation mode. We shorten only if unsigned or if
1991 dividing by something we know != -1. */
1992 shorten = (TREE_UNSIGNED (TREE_TYPE (orig_op0))
1993 || (TREE_CODE (op1) == INTEGER_CST
1994 && ! integer_all_onesp (op1)));
2000 case BIT_ANDTC_EXPR:
2003 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
2005 /* If one operand is a constant, and the other is a short type
2006 that has been converted to an int,
2007 really do the work in the short type and then convert the
2008 result to int. If we are lucky, the constant will be 0 or 1
2009 in the short type, making the entire operation go away. */
2010 if (TREE_CODE (op0) == INTEGER_CST
2011 && TREE_CODE (op1) == NOP_EXPR
2012 && TYPE_PRECISION (type1) > TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op1, 0)))
2013 && TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op1, 0))))
2015 final_type = result_type;
2016 op1 = TREE_OPERAND (op1, 0);
2017 result_type = TREE_TYPE (op1);
2019 if (TREE_CODE (op1) == INTEGER_CST
2020 && TREE_CODE (op0) == NOP_EXPR
2021 && TYPE_PRECISION (type0) > TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op0, 0)))
2022 && TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0, 0))))
2024 final_type = result_type;
2025 op0 = TREE_OPERAND (op0, 0);
2026 result_type = TREE_TYPE (op0);
2030 case TRUNC_MOD_EXPR:
2031 case FLOOR_MOD_EXPR:
2032 if (warn_div_by_zero && skip_evaluation == 0 && integer_zerop (op1))
2033 warning ("division by zero");
2035 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
2037 /* Although it would be tempting to shorten always here, that loses
2038 on some targets, since the modulo instruction is undefined if the
2039 quotient can't be represented in the computation mode. We shorten
2040 only if unsigned or if dividing by something we know != -1. */
2041 shorten = (TREE_UNSIGNED (TREE_TYPE (orig_op0))
2042 || (TREE_CODE (op1) == INTEGER_CST
2043 && ! integer_all_onesp (op1)));
2048 case TRUTH_ANDIF_EXPR:
2049 case TRUTH_ORIF_EXPR:
2050 case TRUTH_AND_EXPR:
2052 case TRUTH_XOR_EXPR:
2053 if ((code0 == INTEGER_TYPE || code0 == POINTER_TYPE
2054 || code0 == REAL_TYPE || code0 == COMPLEX_TYPE)
2055 && (code1 == INTEGER_TYPE || code1 == POINTER_TYPE
2056 || code1 == REAL_TYPE || code1 == COMPLEX_TYPE))
2058 /* Result of these operations is always an int,
2059 but that does not mean the operands should be
2060 converted to ints! */
2061 result_type = integer_type_node;
2062 op0 = truthvalue_conversion (op0);
2063 op1 = truthvalue_conversion (op1);
2068 /* Shift operations: result has same type as first operand;
2069 always convert second operand to int.
2070 Also set SHORT_SHIFT if shifting rightward. */
2073 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
2075 if (TREE_CODE (op1) == INTEGER_CST && skip_evaluation == 0)
2077 if (tree_int_cst_sgn (op1) < 0)
2078 warning ("right shift count is negative");
2081 if (! integer_zerop (op1))
2084 if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
2085 warning ("right shift count >= width of type");
2089 /* Use the type of the value to be shifted.
2090 This is what most traditional C compilers do. */
2091 result_type = type0;
2092 /* Unless traditional, convert the shift-count to an integer,
2093 regardless of size of value being shifted. */
2094 if (! flag_traditional)
2096 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
2097 op1 = convert (integer_type_node, op1);
2098 /* Avoid converting op1 to result_type later. */
2105 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
2107 if (TREE_CODE (op1) == INTEGER_CST && skip_evaluation == 0)
2109 if (tree_int_cst_sgn (op1) < 0)
2110 warning ("left shift count is negative");
2112 else if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
2113 warning ("left shift count >= width of type");
2116 /* Use the type of the value to be shifted.
2117 This is what most traditional C compilers do. */
2118 result_type = type0;
2119 /* Unless traditional, convert the shift-count to an integer,
2120 regardless of size of value being shifted. */
2121 if (! flag_traditional)
2123 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
2124 op1 = convert (integer_type_node, op1);
2125 /* Avoid converting op1 to result_type later. */
2133 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
2135 if (TREE_CODE (op1) == INTEGER_CST && skip_evaluation == 0)
2137 if (tree_int_cst_sgn (op1) < 0)
2138 warning ("shift count is negative");
2139 else if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
2140 warning ("shift count >= width of type");
2143 /* Use the type of the value to be shifted.
2144 This is what most traditional C compilers do. */
2145 result_type = type0;
2146 /* Unless traditional, convert the shift-count to an integer,
2147 regardless of size of value being shifted. */
2148 if (! flag_traditional)
2150 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
2151 op1 = convert (integer_type_node, op1);
2152 /* Avoid converting op1 to result_type later. */
2160 if (warn_float_equal && (code0 == REAL_TYPE || code1 == REAL_TYPE))
2161 warning ("comparing floating point with == or != is unsafe");
2162 /* Result of comparison is always int,
2163 but don't convert the args to int! */
2164 build_type = integer_type_node;
2165 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
2166 || code0 == COMPLEX_TYPE)
2167 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
2168 || code1 == COMPLEX_TYPE))
2170 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
2172 tree tt0 = TREE_TYPE (type0);
2173 tree tt1 = TREE_TYPE (type1);
2174 /* Anything compares with void *. void * compares with anything.
2175 Otherwise, the targets must be compatible
2176 and both must be object or both incomplete. */
2177 if (comp_target_types (type0, type1))
2178 result_type = common_type (type0, type1);
2179 else if (VOID_TYPE_P (tt0))
2181 /* op0 != orig_op0 detects the case of something
2182 whose value is 0 but which isn't a valid null ptr const. */
2183 if (pedantic && (!integer_zerop (op0) || op0 != orig_op0)
2184 && TREE_CODE (tt1) == FUNCTION_TYPE)
2185 pedwarn ("ISO C forbids comparison of `void *' with function pointer");
2187 else if (VOID_TYPE_P (tt1))
2189 if (pedantic && (!integer_zerop (op1) || op1 != orig_op1)
2190 && TREE_CODE (tt0) == FUNCTION_TYPE)
2191 pedwarn ("ISO C forbids comparison of `void *' with function pointer");
2194 pedwarn ("comparison of distinct pointer types lacks a cast");
2196 if (result_type == NULL_TREE)
2197 result_type = ptr_type_node;
2199 else if (code0 == POINTER_TYPE && TREE_CODE (op1) == INTEGER_CST
2200 && integer_zerop (op1))
2201 result_type = type0;
2202 else if (code1 == POINTER_TYPE && TREE_CODE (op0) == INTEGER_CST
2203 && integer_zerop (op0))
2204 result_type = type1;
2205 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
2207 result_type = type0;
2208 if (! flag_traditional)
2209 pedwarn ("comparison between pointer and integer");
2211 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
2213 result_type = type1;
2214 if (! flag_traditional)
2215 pedwarn ("comparison between pointer and integer");
2221 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE)
2222 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE))
2224 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
2226 if (comp_target_types (type0, type1))
2228 result_type = common_type (type0, type1);
2230 && TREE_CODE (TREE_TYPE (type0)) == FUNCTION_TYPE)
2231 pedwarn ("ISO C forbids ordered comparisons of pointers to functions");
2235 result_type = ptr_type_node;
2236 pedwarn ("comparison of distinct pointer types lacks a cast");
2245 build_type = integer_type_node;
2246 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE)
2247 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE))
2249 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
2251 if (comp_target_types (type0, type1))
2253 result_type = common_type (type0, type1);
2254 if (!COMPLETE_TYPE_P (TREE_TYPE (type0))
2255 != !COMPLETE_TYPE_P (TREE_TYPE (type1)))
2256 pedwarn ("comparison of complete and incomplete pointers");
2258 && TREE_CODE (TREE_TYPE (type0)) == FUNCTION_TYPE)
2259 pedwarn ("ISO C forbids ordered comparisons of pointers to functions");
2263 result_type = ptr_type_node;
2264 pedwarn ("comparison of distinct pointer types lacks a cast");
2267 else if (code0 == POINTER_TYPE && TREE_CODE (op1) == INTEGER_CST
2268 && integer_zerop (op1))
2270 result_type = type0;
2271 if (pedantic || extra_warnings)
2272 pedwarn ("ordered comparison of pointer with integer zero");
2274 else if (code1 == POINTER_TYPE && TREE_CODE (op0) == INTEGER_CST
2275 && integer_zerop (op0))
2277 result_type = type1;
2279 pedwarn ("ordered comparison of pointer with integer zero");
2281 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
2283 result_type = type0;
2284 if (! flag_traditional)
2285 pedwarn ("comparison between pointer and integer");
2287 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
2289 result_type = type1;
2290 if (! flag_traditional)
2291 pedwarn ("comparison between pointer and integer");
2295 case UNORDERED_EXPR:
2302 build_type = integer_type_node;
2303 if (code0 != REAL_TYPE || code1 != REAL_TYPE)
2305 error ("unordered comparison on non-floating point argument");
2306 return error_mark_node;
2315 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE || code0 == COMPLEX_TYPE)
2317 (code1 == INTEGER_TYPE || code1 == REAL_TYPE || code1 == COMPLEX_TYPE))
2319 int none_complex = (code0 != COMPLEX_TYPE && code1 != COMPLEX_TYPE);
2321 if (shorten || common || short_compare)
2322 result_type = common_type (type0, type1);
2324 /* For certain operations (which identify themselves by shorten != 0)
2325 if both args were extended from the same smaller type,
2326 do the arithmetic in that type and then extend.
2328 shorten !=0 and !=1 indicates a bitwise operation.
2329 For them, this optimization is safe only if
2330 both args are zero-extended or both are sign-extended.
2331 Otherwise, we might change the result.
2332 Eg, (short)-1 | (unsigned short)-1 is (int)-1
2333 but calculated in (unsigned short) it would be (unsigned short)-1. */
2335 if (shorten && none_complex)
2337 int unsigned0, unsigned1;
2338 tree arg0 = get_narrower (op0, &unsigned0);
2339 tree arg1 = get_narrower (op1, &unsigned1);
2340 /* UNS is 1 if the operation to be done is an unsigned one. */
2341 int uns = TREE_UNSIGNED (result_type);
2344 final_type = result_type;
2346 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
2347 but it *requires* conversion to FINAL_TYPE. */
2349 if ((TYPE_PRECISION (TREE_TYPE (op0))
2350 == TYPE_PRECISION (TREE_TYPE (arg0)))
2351 && TREE_TYPE (op0) != final_type)
2352 unsigned0 = TREE_UNSIGNED (TREE_TYPE (op0));
2353 if ((TYPE_PRECISION (TREE_TYPE (op1))
2354 == TYPE_PRECISION (TREE_TYPE (arg1)))
2355 && TREE_TYPE (op1) != final_type)
2356 unsigned1 = TREE_UNSIGNED (TREE_TYPE (op1));
2358 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
2360 /* For bitwise operations, signedness of nominal type
2361 does not matter. Consider only how operands were extended. */
2365 /* Note that in all three cases below we refrain from optimizing
2366 an unsigned operation on sign-extended args.
2367 That would not be valid. */
2369 /* Both args variable: if both extended in same way
2370 from same width, do it in that width.
2371 Do it unsigned if args were zero-extended. */
2372 if ((TYPE_PRECISION (TREE_TYPE (arg0))
2373 < TYPE_PRECISION (result_type))
2374 && (TYPE_PRECISION (TREE_TYPE (arg1))
2375 == TYPE_PRECISION (TREE_TYPE (arg0)))
2376 && unsigned0 == unsigned1
2377 && (unsigned0 || !uns))
2379 = signed_or_unsigned_type (unsigned0,
2380 common_type (TREE_TYPE (arg0), TREE_TYPE (arg1)));
2381 else if (TREE_CODE (arg0) == INTEGER_CST
2382 && (unsigned1 || !uns)
2383 && (TYPE_PRECISION (TREE_TYPE (arg1))
2384 < TYPE_PRECISION (result_type))
2385 && (type = signed_or_unsigned_type (unsigned1,
2387 int_fits_type_p (arg0, type)))
2389 else if (TREE_CODE (arg1) == INTEGER_CST
2390 && (unsigned0 || !uns)
2391 && (TYPE_PRECISION (TREE_TYPE (arg0))
2392 < TYPE_PRECISION (result_type))
2393 && (type = signed_or_unsigned_type (unsigned0,
2395 int_fits_type_p (arg1, type)))
2399 /* Shifts can be shortened if shifting right. */
2404 tree arg0 = get_narrower (op0, &unsigned_arg);
2406 final_type = result_type;
2408 if (arg0 == op0 && final_type == TREE_TYPE (op0))
2409 unsigned_arg = TREE_UNSIGNED (TREE_TYPE (op0));
2411 if (TYPE_PRECISION (TREE_TYPE (arg0)) < TYPE_PRECISION (result_type)
2412 /* We can shorten only if the shift count is less than the
2413 number of bits in the smaller type size. */
2414 && compare_tree_int (op1, TYPE_PRECISION (TREE_TYPE (arg0))) < 0
2415 /* We cannot drop an unsigned shift after sign-extension. */
2416 && (!TREE_UNSIGNED (final_type) || unsigned_arg))
2418 /* Do an unsigned shift if the operand was zero-extended. */
2420 = signed_or_unsigned_type (unsigned_arg, TREE_TYPE (arg0));
2421 /* Convert value-to-be-shifted to that type. */
2422 if (TREE_TYPE (op0) != result_type)
2423 op0 = convert (result_type, op0);
2428 /* Comparison operations are shortened too but differently.
2429 They identify themselves by setting short_compare = 1. */
2433 /* Don't write &op0, etc., because that would prevent op0
2434 from being kept in a register.
2435 Instead, make copies of the our local variables and
2436 pass the copies by reference, then copy them back afterward. */
2437 tree xop0 = op0, xop1 = op1, xresult_type = result_type;
2438 enum tree_code xresultcode = resultcode;
2440 = shorten_compare (&xop0, &xop1, &xresult_type, &xresultcode);
2445 op0 = xop0, op1 = xop1;
2447 resultcode = xresultcode;
2449 if ((warn_sign_compare < 0 ? extra_warnings : warn_sign_compare != 0)
2450 && skip_evaluation == 0)
2452 int op0_signed = ! TREE_UNSIGNED (TREE_TYPE (orig_op0));
2453 int op1_signed = ! TREE_UNSIGNED (TREE_TYPE (orig_op1));
2454 int unsignedp0, unsignedp1;
2455 tree primop0 = get_narrower (op0, &unsignedp0);
2456 tree primop1 = get_narrower (op1, &unsignedp1);
2460 STRIP_TYPE_NOPS (xop0);
2461 STRIP_TYPE_NOPS (xop1);
2463 /* Give warnings for comparisons between signed and unsigned
2464 quantities that may fail.
2466 Do the checking based on the original operand trees, so that
2467 casts will be considered, but default promotions won't be.
2469 Do not warn if the comparison is being done in a signed type,
2470 since the signed type will only be chosen if it can represent
2471 all the values of the unsigned type. */
2472 if (! TREE_UNSIGNED (result_type))
2474 /* Do not warn if both operands are the same signedness. */
2475 else if (op0_signed == op1_signed)
2482 sop = xop0, uop = xop1;
2484 sop = xop1, uop = xop0;
2486 /* Do not warn if the signed quantity is an
2487 unsuffixed integer literal (or some static
2488 constant expression involving such literals or a
2489 conditional expression involving such literals)
2490 and it is non-negative. */
2491 if (tree_expr_nonnegative_p (sop))
2493 /* Do not warn if the comparison is an equality operation,
2494 the unsigned quantity is an integral constant, and it
2495 would fit in the result if the result were signed. */
2496 else if (TREE_CODE (uop) == INTEGER_CST
2497 && (resultcode == EQ_EXPR || resultcode == NE_EXPR)
2498 && int_fits_type_p (uop, signed_type (result_type)))
2500 /* Do not warn if the unsigned quantity is an enumeration
2501 constant and its maximum value would fit in the result
2502 if the result were signed. */
2503 else if (TREE_CODE (uop) == INTEGER_CST
2504 && TREE_CODE (TREE_TYPE (uop)) == ENUMERAL_TYPE
2505 && int_fits_type_p (TYPE_MAX_VALUE (TREE_TYPE(uop)),
2506 signed_type (result_type)))
2509 warning ("comparison between signed and unsigned");
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. */
2520 if ((TREE_CODE (primop0) == BIT_NOT_EXPR)
2521 != (TREE_CODE (primop1) == BIT_NOT_EXPR))
2523 if (TREE_CODE (primop0) == BIT_NOT_EXPR)
2524 primop0 = get_narrower (TREE_OPERAND (primop0, 0),
2527 primop1 = get_narrower (TREE_OPERAND (primop1, 0),
2530 if (host_integerp (primop0, 0) || host_integerp (primop1, 0))
2533 HOST_WIDE_INT constant, mask;
2534 int unsignedp, bits;
2536 if (host_integerp (primop0, 0))
2539 unsignedp = unsignedp1;
2540 constant = tree_low_cst (primop0, 0);
2545 unsignedp = unsignedp0;
2546 constant = tree_low_cst (primop1, 0);
2549 bits = TYPE_PRECISION (TREE_TYPE (primop));
2550 if (bits < TYPE_PRECISION (result_type)
2551 && bits < HOST_BITS_PER_WIDE_INT && unsignedp)
2553 mask = (~ (HOST_WIDE_INT) 0) << bits;
2554 if ((mask & constant) != mask)
2555 warning ("comparison of promoted ~unsigned with constant");
2558 else if (unsignedp0 && unsignedp1
2559 && (TYPE_PRECISION (TREE_TYPE (primop0))
2560 < TYPE_PRECISION (result_type))
2561 && (TYPE_PRECISION (TREE_TYPE (primop1))
2562 < TYPE_PRECISION (result_type)))
2563 warning ("comparison of promoted ~unsigned with unsigned");
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. */
2577 binary_op_error (code);
2578 return error_mark_node;
2583 if (TREE_TYPE (op0) != result_type)
2584 op0 = convert (result_type, op0);
2585 if (TREE_TYPE (op1) != result_type)
2586 op1 = convert (result_type, op1);
2589 if (build_type == NULL_TREE)
2590 build_type = result_type;
2593 tree result = build (resultcode, build_type, op0, op1);
2596 folded = fold (result);
2597 if (folded == result)
2598 TREE_CONSTANT (folded) = TREE_CONSTANT (op0) & TREE_CONSTANT (op1);
2599 if (final_type != 0)
2600 return convert (final_type, folded);
2605 /* Return a tree for the sum or difference (RESULTCODE says which)
2606 of pointer PTROP and integer INTOP. */
2609 pointer_int_sum (resultcode, ptrop, intop)
2610 enum tree_code resultcode;
2618 /* The result is a pointer of the same type that is being added. */
2620 tree result_type = TREE_TYPE (ptrop);
2622 if (TREE_CODE (TREE_TYPE (result_type)) == VOID_TYPE)
2624 if (pedantic || warn_pointer_arith)
2625 pedwarn ("pointer of type `void *' used in arithmetic");
2626 size_exp = integer_one_node;
2628 else if (TREE_CODE (TREE_TYPE (result_type)) == FUNCTION_TYPE)
2630 if (pedantic || warn_pointer_arith)
2631 pedwarn ("pointer to a function used in arithmetic");
2632 size_exp = integer_one_node;
2635 size_exp = c_size_in_bytes (TREE_TYPE (result_type));
2637 /* If what we are about to multiply by the size of the elements
2638 contains a constant term, apply distributive law
2639 and multiply that constant term separately.
2640 This helps produce common subexpressions. */
2642 if ((TREE_CODE (intop) == PLUS_EXPR || TREE_CODE (intop) == MINUS_EXPR)
2643 && ! TREE_CONSTANT (intop)
2644 && TREE_CONSTANT (TREE_OPERAND (intop, 1))
2645 && TREE_CONSTANT (size_exp)
2646 /* If the constant comes from pointer subtraction,
2647 skip this optimization--it would cause an error. */
2648 && TREE_CODE (TREE_TYPE (TREE_OPERAND (intop, 0))) == INTEGER_TYPE
2649 /* If the constant is unsigned, and smaller than the pointer size,
2650 then we must skip this optimization. This is because it could cause
2651 an overflow error if the constant is negative but INTOP is not. */
2652 && (! TREE_UNSIGNED (TREE_TYPE (intop))
2653 || (TYPE_PRECISION (TREE_TYPE (intop))
2654 == TYPE_PRECISION (TREE_TYPE (ptrop)))))
2656 enum tree_code subcode = resultcode;
2657 tree int_type = TREE_TYPE (intop);
2658 if (TREE_CODE (intop) == MINUS_EXPR)
2659 subcode = (subcode == PLUS_EXPR ? MINUS_EXPR : PLUS_EXPR);
2660 /* Convert both subexpression types to the type of intop,
2661 because weird cases involving pointer arithmetic
2662 can result in a sum or difference with different type args. */
2663 ptrop = build_binary_op (subcode, ptrop,
2664 convert (int_type, TREE_OPERAND (intop, 1)), 1);
2665 intop = convert (int_type, TREE_OPERAND (intop, 0));
2668 /* Convert the integer argument to a type the same size as sizetype
2669 so the multiply won't overflow spuriously. */
2671 if (TYPE_PRECISION (TREE_TYPE (intop)) != TYPE_PRECISION (sizetype)
2672 || TREE_UNSIGNED (TREE_TYPE (intop)) != TREE_UNSIGNED (sizetype))
2673 intop = convert (type_for_size (TYPE_PRECISION (sizetype),
2674 TREE_UNSIGNED (sizetype)), intop);
2676 /* Replace the integer argument with a suitable product by the object size.
2677 Do this multiplication as signed, then convert to the appropriate
2678 pointer type (actually unsigned integral). */
2680 intop = convert (result_type,
2681 build_binary_op (MULT_EXPR, intop,
2682 convert (TREE_TYPE (intop), size_exp), 1));
2684 /* Create the sum or difference. */
2686 result = build (resultcode, result_type, ptrop, intop);
2688 folded = fold (result);
2689 if (folded == result)
2690 TREE_CONSTANT (folded) = TREE_CONSTANT (ptrop) & TREE_CONSTANT (intop);
2694 /* Return a tree for the difference of pointers OP0 and OP1.
2695 The resulting tree has type int. */
2698 pointer_diff (op0, op1)
2701 tree result, folded;
2702 tree restype = ptrdiff_type_node;
2704 tree target_type = TREE_TYPE (TREE_TYPE (op0));
2705 tree con0, con1, lit0, lit1;
2706 tree orig_op1 = op1;
2708 if (pedantic || warn_pointer_arith)
2710 if (TREE_CODE (target_type) == VOID_TYPE)
2711 pedwarn ("pointer of type `void *' used in subtraction");
2712 if (TREE_CODE (target_type) == FUNCTION_TYPE)
2713 pedwarn ("pointer to a function used in subtraction");
2716 /* If the conversion to ptrdiff_type does anything like widening or
2717 converting a partial to an integral mode, we get a convert_expression
2718 that is in the way to do any simplifications.
2719 (fold-const.c doesn't know that the extra bits won't be needed.
2720 split_tree uses STRIP_SIGN_NOPS, which leaves conversions to a
2721 different mode in place.)
2722 So first try to find a common term here 'by hand'; we want to cover
2723 at least the cases that occur in legal static initializers. */
2724 con0 = TREE_CODE (op0) == NOP_EXPR ? TREE_OPERAND (op0, 0) : op0;
2725 con1 = TREE_CODE (op1) == NOP_EXPR ? TREE_OPERAND (op1, 0) : op1;
2727 if (TREE_CODE (con0) == PLUS_EXPR)
2729 lit0 = TREE_OPERAND (con0, 1);
2730 con0 = TREE_OPERAND (con0, 0);
2733 lit0 = integer_zero_node;
2735 if (TREE_CODE (con1) == PLUS_EXPR)
2737 lit1 = TREE_OPERAND (con1, 1);
2738 con1 = TREE_OPERAND (con1, 0);
2741 lit1 = integer_zero_node;
2743 if (operand_equal_p (con0, con1, 0))
2750 /* First do the subtraction as integers;
2751 then drop through to build the divide operator.
2752 Do not do default conversions on the minus operator
2753 in case restype is a short type. */
2755 op0 = build_binary_op (MINUS_EXPR, convert (restype, op0),
2756 convert (restype, op1), 0);
2757 /* This generates an error if op1 is pointer to incomplete type. */
2758 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (TREE_TYPE (orig_op1))))
2759 error ("arithmetic on pointer to an incomplete type");
2761 /* This generates an error if op0 is pointer to incomplete type. */
2762 op1 = c_size_in_bytes (target_type);
2764 /* Divide by the size, in easiest possible way. */
2766 result = build (EXACT_DIV_EXPR, restype, op0, convert (restype, op1));
2768 folded = fold (result);
2769 if (folded == result)
2770 TREE_CONSTANT (folded) = TREE_CONSTANT (op0) & TREE_CONSTANT (op1);
2774 /* Construct and perhaps optimize a tree representation
2775 for a unary operation. CODE, a tree_code, specifies the operation
2776 and XARG is the operand. NOCONVERT nonzero suppresses
2777 the default promotions (such as from short to int). */
2780 build_unary_op (code, xarg, noconvert)
2781 enum tree_code code;
2785 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
2788 enum tree_code typecode = TREE_CODE (TREE_TYPE (arg));
2791 if (typecode == ERROR_MARK)
2792 return error_mark_node;
2793 if (typecode == ENUMERAL_TYPE || typecode == BOOLEAN_TYPE)
2794 typecode = INTEGER_TYPE;
2799 /* This is used for unary plus, because a CONVERT_EXPR
2800 is enough to prevent anybody from looking inside for
2801 associativity, but won't generate any code. */
2802 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2803 || typecode == COMPLEX_TYPE))
2805 error ("wrong type argument to unary plus");
2806 return error_mark_node;
2808 else if (!noconvert)
2809 arg = default_conversion (arg);
2813 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2814 || typecode == COMPLEX_TYPE))
2816 error ("wrong type argument to unary minus");
2817 return error_mark_node;
2819 else if (!noconvert)
2820 arg = default_conversion (arg);
2824 if (typecode == COMPLEX_TYPE)
2828 pedwarn ("ISO C does not support `~' for complex conjugation");
2830 arg = default_conversion (arg);
2832 else if (typecode != INTEGER_TYPE)
2834 error ("wrong type argument to bit-complement");
2835 return error_mark_node;
2837 else if (!noconvert)
2838 arg = default_conversion (arg);
2842 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2843 || typecode == COMPLEX_TYPE))
2845 error ("wrong type argument to abs");
2846 return error_mark_node;
2848 else if (!noconvert)
2849 arg = default_conversion (arg);
2853 /* Conjugating a real value is a no-op, but allow it anyway. */
2854 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2855 || typecode == COMPLEX_TYPE))
2857 error ("wrong type argument to conjugation");
2858 return error_mark_node;
2860 else if (!noconvert)
2861 arg = default_conversion (arg);
2864 case TRUTH_NOT_EXPR:
2865 if (typecode != INTEGER_TYPE
2866 && typecode != REAL_TYPE && typecode != POINTER_TYPE
2867 && typecode != COMPLEX_TYPE
2868 /* These will convert to a pointer. */
2869 && typecode != ARRAY_TYPE && typecode != FUNCTION_TYPE)
2871 error ("wrong type argument to unary exclamation mark");
2872 return error_mark_node;
2874 arg = truthvalue_conversion (arg);
2875 return invert_truthvalue (arg);
2881 if (TREE_CODE (arg) == COMPLEX_CST)
2882 return TREE_REALPART (arg);
2883 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
2884 return fold (build1 (REALPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg));
2889 if (TREE_CODE (arg) == COMPLEX_CST)
2890 return TREE_IMAGPART (arg);
2891 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
2892 return fold (build1 (IMAGPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg));
2894 return convert (TREE_TYPE (arg), integer_zero_node);
2896 case PREINCREMENT_EXPR:
2897 case POSTINCREMENT_EXPR:
2898 case PREDECREMENT_EXPR:
2899 case POSTDECREMENT_EXPR:
2900 /* Handle complex lvalues (when permitted)
2901 by reduction to simpler cases. */
2903 val = unary_complex_lvalue (code, arg);
2907 /* Increment or decrement the real part of the value,
2908 and don't change the imaginary part. */
2909 if (typecode == COMPLEX_TYPE)
2914 pedwarn ("ISO C does not support `++' and `--' on complex types");
2916 arg = stabilize_reference (arg);
2917 real = build_unary_op (REALPART_EXPR, arg, 1);
2918 imag = build_unary_op (IMAGPART_EXPR, arg, 1);
2919 return build (COMPLEX_EXPR, TREE_TYPE (arg),
2920 build_unary_op (code, real, 1), imag);
2923 /* Report invalid types. */
2925 if (typecode != POINTER_TYPE
2926 && typecode != INTEGER_TYPE && typecode != REAL_TYPE)
2928 error ("wrong type argument to %s",
2929 code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR
2930 ? "increment" : "decrement");
2931 return error_mark_node;
2936 tree result_type = TREE_TYPE (arg);
2938 arg = get_unwidened (arg, 0);
2939 argtype = TREE_TYPE (arg);
2941 /* Compute the increment. */
2943 if (typecode == POINTER_TYPE)
2945 /* If pointer target is an undefined struct,
2946 we just cannot know how to do the arithmetic. */
2947 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (result_type)))
2948 error ("%s of pointer to unknown structure",
2949 code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR
2950 ? "increment" : "decrement");
2951 else if ((pedantic || warn_pointer_arith)
2952 && (TREE_CODE (TREE_TYPE (result_type)) == FUNCTION_TYPE
2953 || TREE_CODE (TREE_TYPE (result_type)) == VOID_TYPE))
2954 pedwarn ("wrong type argument to %s",
2955 code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR
2956 ? "increment" : "decrement");
2957 inc = c_size_in_bytes (TREE_TYPE (result_type));
2960 inc = integer_one_node;
2962 inc = convert (argtype, inc);
2964 /* Handle incrementing a cast-expression. */
2967 switch (TREE_CODE (arg))
2972 case FIX_TRUNC_EXPR:
2973 case FIX_FLOOR_EXPR:
2974 case FIX_ROUND_EXPR:
2976 pedantic_lvalue_warning (CONVERT_EXPR);
2977 /* If the real type has the same machine representation
2978 as the type it is cast to, we can make better output
2979 by adding directly to the inside of the cast. */
2980 if ((TREE_CODE (TREE_TYPE (arg))
2981 == TREE_CODE (TREE_TYPE (TREE_OPERAND (arg, 0))))
2982 && (TYPE_MODE (TREE_TYPE (arg))
2983 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (arg, 0)))))
2984 arg = TREE_OPERAND (arg, 0);
2987 tree incremented, modify, value;
2988 if (TREE_CODE (TREE_TYPE (arg)) == BOOLEAN_TYPE)
2989 value = boolean_increment (code, arg);
2992 arg = stabilize_reference (arg);
2993 if (code == PREINCREMENT_EXPR || code == PREDECREMENT_EXPR)
2996 value = save_expr (arg);
2997 incremented = build (((code == PREINCREMENT_EXPR
2998 || code == POSTINCREMENT_EXPR)
2999 ? PLUS_EXPR : MINUS_EXPR),
3000 argtype, value, inc);
3001 TREE_SIDE_EFFECTS (incremented) = 1;
3002 modify = build_modify_expr (arg, NOP_EXPR, incremented);
3003 value = build (COMPOUND_EXPR, TREE_TYPE (arg), modify, value);
3005 TREE_USED (value) = 1;
3015 /* Complain about anything else that is not a true lvalue. */
3016 if (!lvalue_or_else (arg, ((code == PREINCREMENT_EXPR
3017 || code == POSTINCREMENT_EXPR)
3018 ? "invalid lvalue in increment"
3019 : "invalid lvalue in decrement")))
3020 return error_mark_node;
3022 /* Report a read-only lvalue. */
3023 if (TREE_READONLY (arg))
3024 readonly_warning (arg,
3025 ((code == PREINCREMENT_EXPR
3026 || code == POSTINCREMENT_EXPR)
3027 ? "increment" : "decrement"));
3029 if (TREE_CODE (TREE_TYPE (arg)) == BOOLEAN_TYPE)
3030 val = boolean_increment (code, arg);
3032 val = build (code, TREE_TYPE (arg), arg, inc);
3033 TREE_SIDE_EFFECTS (val) = 1;
3034 val = convert (result_type, val);
3035 if (TREE_CODE (val) != code)
3036 TREE_NO_UNUSED_WARNING (val) = 1;
3041 /* Note that this operation never does default_conversion
3042 regardless of NOCONVERT. */
3044 /* Let &* cancel out to simplify resulting code. */
3045 if (TREE_CODE (arg) == INDIRECT_REF)
3047 /* Don't let this be an lvalue. */
3048 if (lvalue_p (TREE_OPERAND (arg, 0)))
3049 return non_lvalue (TREE_OPERAND (arg, 0));
3050 return TREE_OPERAND (arg, 0);
3053 /* For &x[y], return x+y */
3054 if (TREE_CODE (arg) == ARRAY_REF)
3056 if (mark_addressable (TREE_OPERAND (arg, 0)) == 0)
3057 return error_mark_node;
3058 return build_binary_op (PLUS_EXPR, TREE_OPERAND (arg, 0),
3059 TREE_OPERAND (arg, 1), 1);
3062 /* Handle complex lvalues (when permitted)
3063 by reduction to simpler cases. */
3064 val = unary_complex_lvalue (code, arg);
3068 #if 0 /* Turned off because inconsistent;
3069 float f; *&(int)f = 3.4 stores in int format
3070 whereas (int)f = 3.4 stores in float format. */
3071 /* Address of a cast is just a cast of the address
3072 of the operand of the cast. */
3073 switch (TREE_CODE (arg))
3078 case FIX_TRUNC_EXPR:
3079 case FIX_FLOOR_EXPR:
3080 case FIX_ROUND_EXPR:
3083 pedwarn ("ISO C forbids the address of a cast expression");
3084 return convert (build_pointer_type (TREE_TYPE (arg)),
3085 build_unary_op (ADDR_EXPR, TREE_OPERAND (arg, 0),
3090 /* Allow the address of a constructor if all the elements
3092 if (TREE_CODE (arg) == CONSTRUCTOR && TREE_CONSTANT (arg))
3094 /* Anything not already handled and not a true memory reference
3096 else if (typecode != FUNCTION_TYPE
3097 && !lvalue_or_else (arg, "invalid lvalue in unary `&'"))
3098 return error_mark_node;
3100 /* Ordinary case; arg is a COMPONENT_REF or a decl. */
3101 argtype = TREE_TYPE (arg);
3103 /* If the lvalue is const or volatile, merge that into the type
3104 to which the address will point. Note that you can't get a
3105 restricted pointer by taking the address of something, so we
3106 only have to deal with `const' and `volatile' here. */
3107 if ((DECL_P (arg) || TREE_CODE_CLASS (TREE_CODE (arg)) == 'r')
3108 && (TREE_READONLY (arg) || TREE_THIS_VOLATILE (arg)))
3109 argtype = c_build_type_variant (argtype,
3110 TREE_READONLY (arg),
3111 TREE_THIS_VOLATILE (arg));
3113 argtype = build_pointer_type (argtype);
3115 if (mark_addressable (arg) == 0)
3116 return error_mark_node;
3121 if (TREE_CODE (arg) == COMPONENT_REF)
3123 tree field = TREE_OPERAND (arg, 1);
3125 addr = build_unary_op (ADDR_EXPR, TREE_OPERAND (arg, 0), 0);
3127 if (DECL_C_BIT_FIELD (field))
3129 error ("attempt to take address of bit-field structure member `%s'",
3130 IDENTIFIER_POINTER (DECL_NAME (field)));
3131 return error_mark_node;
3134 addr = fold (build (PLUS_EXPR, argtype,
3135 convert (argtype, addr),
3136 convert (argtype, byte_position (field))));
3139 addr = build1 (code, argtype, arg);
3141 /* Address of a static or external variable or
3142 file-scope function counts as a constant. */
3144 && ! (TREE_CODE (arg) == FUNCTION_DECL
3145 && DECL_CONTEXT (arg) != 0))
3146 TREE_CONSTANT (addr) = 1;
3155 argtype = TREE_TYPE (arg);
3156 return fold (build1 (code, argtype, arg));
3160 /* If CONVERSIONS is a conversion expression or a nested sequence of such,
3161 convert ARG with the same conversions in the same order
3162 and return the result. */
3165 convert_sequence (conversions, arg)
3169 switch (TREE_CODE (conversions))
3174 case FIX_TRUNC_EXPR:
3175 case FIX_FLOOR_EXPR:
3176 case FIX_ROUND_EXPR:
3178 return convert (TREE_TYPE (conversions),
3179 convert_sequence (TREE_OPERAND (conversions, 0),
3188 /* Return nonzero if REF is an lvalue valid for this language.
3189 Lvalues can be assigned, unless their type has TYPE_READONLY.
3190 Lvalues can have their address taken, unless they have DECL_REGISTER. */
3196 enum tree_code code = TREE_CODE (ref);
3203 return lvalue_p (TREE_OPERAND (ref, 0));
3214 return (TREE_CODE (TREE_TYPE (ref)) != FUNCTION_TYPE
3215 && TREE_CODE (TREE_TYPE (ref)) != METHOD_TYPE);
3219 return TREE_CODE (TREE_TYPE (ref)) == ARRAY_TYPE;
3226 /* Return nonzero if REF is an lvalue valid for this language;
3227 otherwise, print an error message and return zero. */
3230 lvalue_or_else (ref, msgid)
3234 int win = lvalue_p (ref);
3237 error ("%s", msgid);
3242 /* Apply unary lvalue-demanding operator CODE to the expression ARG
3243 for certain kinds of expressions which are not really lvalues
3244 but which we can accept as lvalues.
3246 If ARG is not a kind of expression we can handle, return zero. */
3249 unary_complex_lvalue (code, arg)
3250 enum tree_code code;
3253 /* Handle (a, b) used as an "lvalue". */
3254 if (TREE_CODE (arg) == COMPOUND_EXPR)
3256 tree real_result = build_unary_op (code, TREE_OPERAND (arg, 1), 0);
3258 /* If this returns a function type, it isn't really being used as
3259 an lvalue, so don't issue a warning about it. */
3260 if (TREE_CODE (TREE_TYPE (arg)) != FUNCTION_TYPE)
3261 pedantic_lvalue_warning (COMPOUND_EXPR);
3263 return build (COMPOUND_EXPR, TREE_TYPE (real_result),
3264 TREE_OPERAND (arg, 0), real_result);
3267 /* Handle (a ? b : c) used as an "lvalue". */
3268 if (TREE_CODE (arg) == COND_EXPR)
3270 pedantic_lvalue_warning (COND_EXPR);
3271 if (TREE_CODE (TREE_TYPE (arg)) != FUNCTION_TYPE)
3272 pedantic_lvalue_warning (COMPOUND_EXPR);
3274 return (build_conditional_expr
3275 (TREE_OPERAND (arg, 0),
3276 build_unary_op (code, TREE_OPERAND (arg, 1), 0),
3277 build_unary_op (code, TREE_OPERAND (arg, 2), 0)));
3283 /* If pedantic, warn about improper lvalue. CODE is either COND_EXPR
3284 COMPOUND_EXPR, or CONVERT_EXPR (for casts). */
3287 pedantic_lvalue_warning (code)
3288 enum tree_code code;
3294 pedwarn ("ISO C forbids use of conditional expressions as lvalues");
3297 pedwarn ("ISO C forbids use of compound expressions as lvalues");
3300 pedwarn ("ISO C forbids use of cast expressions as lvalues");
3305 /* Warn about storing in something that is `const'. */
3308 readonly_warning (arg, msgid)
3312 if (TREE_CODE (arg) == COMPONENT_REF)
3314 if (TYPE_READONLY (TREE_TYPE (TREE_OPERAND (arg, 0))))
3315 readonly_warning (TREE_OPERAND (arg, 0), msgid);
3317 pedwarn ("%s of read-only member `%s'", _(msgid),
3318 IDENTIFIER_POINTER (DECL_NAME (TREE_OPERAND (arg, 1))));
3320 else if (TREE_CODE (arg) == VAR_DECL)
3321 pedwarn ("%s of read-only variable `%s'", _(msgid),
3322 IDENTIFIER_POINTER (DECL_NAME (arg)));
3324 pedwarn ("%s of read-only location", _(msgid));
3327 /* Mark EXP saying that we need to be able to take the
3328 address of it; it should not be allocated in a register.
3329 Value is 1 if successful. */
3332 mark_addressable (exp)
3337 switch (TREE_CODE (x))
3340 if (DECL_C_BIT_FIELD (TREE_OPERAND (x, 1)))
3342 error ("cannot take address of bitfield `%s'",
3343 IDENTIFIER_POINTER (DECL_NAME (TREE_OPERAND (x, 1))));
3347 /* ... fall through ... */
3353 x = TREE_OPERAND (x, 0);
3357 TREE_ADDRESSABLE (x) = 1;
3364 if (DECL_REGISTER (x) && !TREE_ADDRESSABLE (x)
3365 && DECL_NONLOCAL (x))
3367 if (TREE_PUBLIC (x))
3369 error ("global register variable `%s' used in nested function",
3370 IDENTIFIER_POINTER (DECL_NAME (x)));
3373 pedwarn ("register variable `%s' used in nested function",
3374 IDENTIFIER_POINTER (DECL_NAME (x)));
3376 else if (DECL_REGISTER (x) && !TREE_ADDRESSABLE (x))
3378 if (TREE_PUBLIC (x))
3380 error ("address of global register variable `%s' requested",
3381 IDENTIFIER_POINTER (DECL_NAME (x)));
3385 /* If we are making this addressable due to its having
3386 volatile components, give a different error message. Also
3387 handle the case of an unnamed parameter by not trying
3388 to give the name. */
3390 else if (C_TYPE_FIELDS_VOLATILE (TREE_TYPE (x)))
3392 error ("cannot put object with volatile field into register");
3396 pedwarn ("address of register variable `%s' requested",
3397 IDENTIFIER_POINTER (DECL_NAME (x)));
3399 put_var_into_stack (x);
3403 TREE_ADDRESSABLE (x) = 1;
3404 #if 0 /* poplevel deals with this now. */
3405 if (DECL_CONTEXT (x) == 0)
3406 TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (x)) = 1;
3414 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
3417 build_conditional_expr (ifexp, op1, op2)
3418 tree ifexp, op1, op2;
3422 enum tree_code code1;
3423 enum tree_code code2;
3424 tree result_type = NULL;
3425 tree orig_op1 = op1, orig_op2 = op2;
3427 ifexp = truthvalue_conversion (default_conversion (ifexp));
3429 #if 0 /* Produces wrong result if within sizeof. */
3430 /* Don't promote the operands separately if they promote
3431 the same way. Return the unpromoted type and let the combined
3432 value get promoted if necessary. */
3434 if (TREE_TYPE (op1) == TREE_TYPE (op2)
3435 && TREE_CODE (TREE_TYPE (op1)) != ARRAY_TYPE
3436 && TREE_CODE (TREE_TYPE (op1)) != ENUMERAL_TYPE
3437 && TREE_CODE (TREE_TYPE (op1)) != FUNCTION_TYPE)
3439 if (TREE_CODE (ifexp) == INTEGER_CST)
3440 return pedantic_non_lvalue (integer_zerop (ifexp) ? op2 : op1);
3442 return fold (build (COND_EXPR, TREE_TYPE (op1), ifexp, op1, op2));
3446 /* Promote both alternatives. */
3448 if (TREE_CODE (TREE_TYPE (op1)) != VOID_TYPE)
3449 op1 = default_conversion (op1);
3450 if (TREE_CODE (TREE_TYPE (op2)) != VOID_TYPE)
3451 op2 = default_conversion (op2);
3453 if (TREE_CODE (ifexp) == ERROR_MARK
3454 || TREE_CODE (TREE_TYPE (op1)) == ERROR_MARK
3455 || TREE_CODE (TREE_TYPE (op2)) == ERROR_MARK)
3456 return error_mark_node;
3458 type1 = TREE_TYPE (op1);
3459 code1 = TREE_CODE (type1);
3460 type2 = TREE_TYPE (op2);
3461 code2 = TREE_CODE (type2);
3463 /* Quickly detect the usual case where op1 and op2 have the same type
3465 if (TYPE_MAIN_VARIANT (type1) == TYPE_MAIN_VARIANT (type2))
3468 result_type = type1;
3470 result_type = TYPE_MAIN_VARIANT (type1);
3472 else if ((code1 == INTEGER_TYPE || code1 == REAL_TYPE
3473 || code1 == COMPLEX_TYPE)
3474 && (code2 == INTEGER_TYPE || code2 == REAL_TYPE
3475 || code2 == COMPLEX_TYPE))
3477 result_type = common_type (type1, type2);
3479 /* If -Wsign-compare, warn here if type1 and type2 have
3480 different signedness. We'll promote the signed to unsigned
3481 and later code won't know it used to be different.
3482 Do this check on the original types, so that explicit casts
3483 will be considered, but default promotions won't. */
3484 if ((warn_sign_compare < 0 ? extra_warnings : warn_sign_compare)
3485 && !skip_evaluation)
3487 int unsigned_op1 = TREE_UNSIGNED (TREE_TYPE (orig_op1));
3488 int unsigned_op2 = TREE_UNSIGNED (TREE_TYPE (orig_op2));
3490 if (unsigned_op1 ^ unsigned_op2)
3492 /* Do not warn if the result type is signed, since the
3493 signed type will only be chosen if it can represent
3494 all the values of the unsigned type. */
3495 if (! TREE_UNSIGNED (result_type))
3497 /* Do not warn if the signed quantity is an unsuffixed
3498 integer literal (or some static constant expression
3499 involving such literals) and it is non-negative. */
3500 else if ((unsigned_op2 && tree_expr_nonnegative_p (op1))
3501 || (unsigned_op1 && tree_expr_nonnegative_p (op2)))
3504 warning ("signed and unsigned type in conditional expression");
3508 else if (code1 == VOID_TYPE || code2 == VOID_TYPE)
3510 if (pedantic && (code1 != VOID_TYPE || code2 != VOID_TYPE))
3511 pedwarn ("ISO C forbids conditional expr with only one void side");
3512 result_type = void_type_node;
3514 else if (code1 == POINTER_TYPE && code2 == POINTER_TYPE)
3516 if (comp_target_types (type1, type2))
3517 result_type = common_type (type1, type2);
3518 else if (integer_zerop (op1) && TREE_TYPE (type1) == void_type_node
3519 && TREE_CODE (orig_op1) != NOP_EXPR)
3520 result_type = qualify_type (type2, type1);
3521 else if (integer_zerop (op2) && TREE_TYPE (type2) == void_type_node
3522 && TREE_CODE (orig_op2) != NOP_EXPR)
3523 result_type = qualify_type (type1, type2);
3524 else if (VOID_TYPE_P (TREE_TYPE (type1)))
3526 if (pedantic && TREE_CODE (TREE_TYPE (type2)) == FUNCTION_TYPE)
3527 pedwarn ("ISO C forbids conditional expr between `void *' and function pointer");
3528 result_type = build_pointer_type (qualify_type (TREE_TYPE (type1),
3529 TREE_TYPE (type2)));
3531 else if (VOID_TYPE_P (TREE_TYPE (type2)))
3533 if (pedantic && TREE_CODE (TREE_TYPE (type1)) == FUNCTION_TYPE)
3534 pedwarn ("ISO C forbids conditional expr between `void *' and function pointer");
3535 result_type = build_pointer_type (qualify_type (TREE_TYPE (type2),
3536 TREE_TYPE (type1)));
3540 pedwarn ("pointer type mismatch in conditional expression");
3541 result_type = build_pointer_type (void_type_node);
3544 else if (code1 == POINTER_TYPE && code2 == INTEGER_TYPE)
3546 if (! integer_zerop (op2))
3547 pedwarn ("pointer/integer type mismatch in conditional expression");
3550 op2 = null_pointer_node;
3552 result_type = type1;
3554 else if (code2 == POINTER_TYPE && code1 == INTEGER_TYPE)
3556 if (!integer_zerop (op1))
3557 pedwarn ("pointer/integer type mismatch in conditional expression");
3560 op1 = null_pointer_node;
3562 result_type = type2;
3567 if (flag_cond_mismatch)
3568 result_type = void_type_node;
3571 error ("type mismatch in conditional expression");
3572 return error_mark_node;
3576 /* Merge const and volatile flags of the incoming types. */
3578 = build_type_variant (result_type,
3579 TREE_READONLY (op1) || TREE_READONLY (op2),
3580 TREE_THIS_VOLATILE (op1) || TREE_THIS_VOLATILE (op2));
3582 if (result_type != TREE_TYPE (op1))
3583 op1 = convert_and_check (result_type, op1);
3584 if (result_type != TREE_TYPE (op2))
3585 op2 = convert_and_check (result_type, op2);
3587 if (TREE_CODE (ifexp) == INTEGER_CST)
3588 return pedantic_non_lvalue (integer_zerop (ifexp) ? op2 : op1);
3590 return fold (build (COND_EXPR, result_type, ifexp, op1, op2));
3593 /* Given a list of expressions, return a compound expression
3594 that performs them all and returns the value of the last of them. */
3597 build_compound_expr (list)
3600 return internal_build_compound_expr (list, TRUE);
3604 internal_build_compound_expr (list, first_p)
3610 if (TREE_CHAIN (list) == 0)
3612 /* Convert arrays to pointers when there really is a comma operator. */
3613 if (!first_p && TREE_CODE (TREE_TYPE (TREE_VALUE (list))) == ARRAY_TYPE)
3614 TREE_VALUE (list) = default_conversion (TREE_VALUE (list));
3616 #if 0 /* If something inside inhibited lvalueness, we should not override. */
3617 /* Consider (x, y+0), which is not an lvalue since y+0 is not. */
3619 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
3620 if (TREE_CODE (list) == NON_LVALUE_EXPR)
3621 list = TREE_OPERAND (list, 0);
3624 /* Don't let (0, 0) be null pointer constant. */
3625 if (!first_p && integer_zerop (TREE_VALUE (list)))
3626 return non_lvalue (TREE_VALUE (list));
3627 return TREE_VALUE (list);
3630 rest = internal_build_compound_expr (TREE_CHAIN (list), FALSE);
3632 if (! TREE_SIDE_EFFECTS (TREE_VALUE (list)))
3634 /* The left-hand operand of a comma expression is like an expression
3635 statement: with -W or -Wunused, we should warn if it doesn't have
3636 any side-effects, unless it was explicitly cast to (void). */
3637 if ((extra_warnings || warn_unused_value)
3638 && ! (TREE_CODE (TREE_VALUE (list)) == CONVERT_EXPR
3639 && VOID_TYPE_P (TREE_TYPE (TREE_VALUE (list)))))
3640 warning ("left-hand operand of comma expression has no effect");
3642 /* When pedantic, a compound expression can be neither an lvalue
3643 nor an integer constant expression. */
3648 /* With -Wunused, we should also warn if the left-hand operand does have
3649 side-effects, but computes a value which is not used. For example, in
3650 `foo() + bar(), baz()' the result of the `+' operator is not used,
3651 so we should issue a warning. */
3652 else if (warn_unused_value)
3653 warn_if_unused_value (TREE_VALUE (list));
3655 return build (COMPOUND_EXPR, TREE_TYPE (rest), TREE_VALUE (list), rest);
3658 /* Build an expression representing a cast to type TYPE of expression EXPR. */
3661 build_c_cast (type, expr)
3667 if (type == error_mark_node || expr == error_mark_node)
3668 return error_mark_node;
3669 type = TYPE_MAIN_VARIANT (type);
3672 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
3673 if (TREE_CODE (value) == NON_LVALUE_EXPR)
3674 value = TREE_OPERAND (value, 0);
3677 if (TREE_CODE (type) == ARRAY_TYPE)
3679 error ("cast specifies array type");
3680 return error_mark_node;
3683 if (TREE_CODE (type) == FUNCTION_TYPE)
3685 error ("cast specifies function type");
3686 return error_mark_node;
3689 if (type == TYPE_MAIN_VARIANT (TREE_TYPE (value)))
3693 if (TREE_CODE (type) == RECORD_TYPE
3694 || TREE_CODE (type) == UNION_TYPE)
3695 pedwarn ("ISO C forbids casting nonscalar to the same type");
3698 else if (TREE_CODE (type) == UNION_TYPE)
3701 if (TREE_CODE (TREE_TYPE (value)) == ARRAY_TYPE
3702 || TREE_CODE (TREE_TYPE (value)) == FUNCTION_TYPE)
3703 value = default_conversion (value);
3705 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
3706 if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (field)),
3707 TYPE_MAIN_VARIANT (TREE_TYPE (value))))
3716 pedwarn ("ISO C forbids casts to union type");
3717 if (TYPE_NAME (type) != 0)
3719 if (TREE_CODE (TYPE_NAME (type)) == IDENTIFIER_NODE)
3720 name = IDENTIFIER_POINTER (TYPE_NAME (type));
3722 name = IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type)));
3726 t = digest_init (type, build (CONSTRUCTOR, type, NULL_TREE,
3727 build_tree_list (field, value)),
3729 TREE_CONSTANT (t) = TREE_CONSTANT (value);
3732 error ("cast to union type from type not present in union");
3733 return error_mark_node;
3739 /* If casting to void, avoid the error that would come
3740 from default_conversion in the case of a non-lvalue array. */
3741 if (type == void_type_node)
3742 return build1 (CONVERT_EXPR, type, value);
3744 /* Convert functions and arrays to pointers,
3745 but don't convert any other types. */
3746 if (TREE_CODE (TREE_TYPE (value)) == FUNCTION_TYPE
3747 || TREE_CODE (TREE_TYPE (value)) == ARRAY_TYPE)
3748 value = default_conversion (value);
3749 otype = TREE_TYPE (value);
3751 /* Optionally warn about potentially worrisome casts. */
3754 && TREE_CODE (type) == POINTER_TYPE
3755 && TREE_CODE (otype) == POINTER_TYPE)
3757 tree in_type = type;
3758 tree in_otype = otype;
3761 /* Check that the qualifiers on IN_TYPE are a superset of
3762 the qualifiers of IN_OTYPE. The outermost level of
3763 POINTER_TYPE nodes is uninteresting and we stop as soon
3764 as we hit a non-POINTER_TYPE node on either type. */
3767 in_otype = TREE_TYPE (in_otype);
3768 in_type = TREE_TYPE (in_type);
3769 warn |= (TYPE_QUALS (in_otype) & ~TYPE_QUALS (in_type));
3771 while (TREE_CODE (in_type) == POINTER_TYPE
3772 && TREE_CODE (in_otype) == POINTER_TYPE);
3775 /* There are qualifiers present in IN_OTYPE that are not
3776 present in IN_TYPE. */
3777 warning ("cast discards qualifiers from pointer target type");
3780 /* Warn about possible alignment problems. */
3781 if (STRICT_ALIGNMENT && warn_cast_align
3782 && TREE_CODE (type) == POINTER_TYPE
3783 && TREE_CODE (otype) == POINTER_TYPE
3784 && TREE_CODE (TREE_TYPE (otype)) != VOID_TYPE
3785 && TREE_CODE (TREE_TYPE (otype)) != FUNCTION_TYPE
3786 /* Don't warn about opaque types, where the actual alignment
3787 restriction is unknown. */
3788 && !((TREE_CODE (TREE_TYPE (otype)) == UNION_TYPE
3789 || TREE_CODE (TREE_TYPE (otype)) == RECORD_TYPE)
3790 && TYPE_MODE (TREE_TYPE (otype)) == VOIDmode)
3791 && TYPE_ALIGN (TREE_TYPE (type)) > TYPE_ALIGN (TREE_TYPE (otype)))
3792 warning ("cast increases required alignment of target type");
3794 if (TREE_CODE (type) == INTEGER_TYPE
3795 && TREE_CODE (otype) == POINTER_TYPE
3796 && TYPE_PRECISION (type) != TYPE_PRECISION (otype)
3797 && !TREE_CONSTANT (value))
3798 warning ("cast from pointer to integer of different size");
3800 if (warn_bad_function_cast
3801 && TREE_CODE (value) == CALL_EXPR
3802 && TREE_CODE (type) != TREE_CODE (otype))
3803 warning ("cast does not match function type");
3805 if (TREE_CODE (type) == POINTER_TYPE
3806 && TREE_CODE (otype) == INTEGER_TYPE
3807 && TYPE_PRECISION (type) != TYPE_PRECISION (otype)
3808 /* Don't warn about converting any constant. */
3809 && !TREE_CONSTANT (value))
3810 warning ("cast to pointer from integer of different size");
3813 value = convert (type, value);
3815 /* Ignore any integer overflow caused by the cast. */
3816 if (TREE_CODE (value) == INTEGER_CST)
3818 TREE_OVERFLOW (value) = TREE_OVERFLOW (ovalue);
3819 TREE_CONSTANT_OVERFLOW (value) = TREE_CONSTANT_OVERFLOW (ovalue);
3823 /* Pedantically, don't ley (void *) (FOO *) 0 be a null pointer constant. */
3824 if (pedantic && TREE_CODE (value) == INTEGER_CST
3825 && TREE_CODE (expr) == INTEGER_CST
3826 && TREE_CODE (TREE_TYPE (expr)) != INTEGER_TYPE)
3827 value = non_lvalue (value);
3829 /* If pedantic, don't let a cast be an lvalue. */
3830 if (value == expr && pedantic)
3831 value = non_lvalue (value);
3836 /* Interpret a cast of expression EXPR to type TYPE. */
3838 c_cast_expr (type, expr)
3841 int saved_wsp = warn_strict_prototypes;
3843 /* This avoids warnings about unprototyped casts on
3844 integers. E.g. "#define SIG_DFL (void(*)())0". */
3845 if (TREE_CODE (expr) == INTEGER_CST)
3846 warn_strict_prototypes = 0;
3847 type = groktypename (type);
3848 warn_strict_prototypes = saved_wsp;
3850 return build_c_cast (type, expr);
3854 /* Build an assignment expression of lvalue LHS from value RHS.
3855 MODIFYCODE is the code for a binary operator that we use
3856 to combine the old value of LHS with RHS to get the new value.
3857 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment. */
3860 build_modify_expr (lhs, modifycode, rhs)
3862 enum tree_code modifycode;
3866 tree lhstype = TREE_TYPE (lhs);
3867 tree olhstype = lhstype;
3869 /* Types that aren't fully specified cannot be used in assignments. */
3870 lhs = require_complete_type (lhs);
3872 /* Avoid duplicate error messages from operands that had errors. */
3873 if (TREE_CODE (lhs) == ERROR_MARK || TREE_CODE (rhs) == ERROR_MARK)
3874 return error_mark_node;
3876 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
3877 /* Do not use STRIP_NOPS here. We do not want an enumerator
3878 whose value is 0 to count as a null pointer constant. */
3879 if (TREE_CODE (rhs) == NON_LVALUE_EXPR)
3880 rhs = TREE_OPERAND (rhs, 0);
3884 /* Handle control structure constructs used as "lvalues". */
3886 switch (TREE_CODE (lhs))
3888 /* Handle (a, b) used as an "lvalue". */
3890 pedantic_lvalue_warning (COMPOUND_EXPR);
3891 newrhs = build_modify_expr (TREE_OPERAND (lhs, 1), modifycode, rhs);
3892 if (TREE_CODE (newrhs) == ERROR_MARK)
3893 return error_mark_node;
3894 return build (COMPOUND_EXPR, lhstype,
3895 TREE_OPERAND (lhs, 0), newrhs);
3897 /* Handle (a ? b : c) used as an "lvalue". */
3899 pedantic_lvalue_warning (COND_EXPR);
3900 rhs = save_expr (rhs);
3902 /* Produce (a ? (b = rhs) : (c = rhs))
3903 except that the RHS goes through a save-expr
3904 so the code to compute it is only emitted once. */
3906 = build_conditional_expr (TREE_OPERAND (lhs, 0),
3907 build_modify_expr (TREE_OPERAND (lhs, 1),
3909 build_modify_expr (TREE_OPERAND (lhs, 2),
3911 if (TREE_CODE (cond) == ERROR_MARK)
3913 /* Make sure the code to compute the rhs comes out
3914 before the split. */
3915 return build (COMPOUND_EXPR, TREE_TYPE (lhs),
3916 /* But cast it to void to avoid an "unused" error. */
3917 convert (void_type_node, rhs), cond);
3923 /* If a binary op has been requested, combine the old LHS value with the RHS
3924 producing the value we should actually store into the LHS. */
3926 if (modifycode != NOP_EXPR)
3928 lhs = stabilize_reference (lhs);
3929 newrhs = build_binary_op (modifycode, lhs, rhs, 1);
3932 /* Handle a cast used as an "lvalue".
3933 We have already performed any binary operator using the value as cast.
3934 Now convert the result to the cast type of the lhs,
3935 and then true type of the lhs and store it there;
3936 then convert result back to the cast type to be the value
3937 of the assignment. */
3939 switch (TREE_CODE (lhs))
3944 case FIX_TRUNC_EXPR:
3945 case FIX_FLOOR_EXPR:
3946 case FIX_ROUND_EXPR:
3948 if (TREE_CODE (TREE_TYPE (newrhs)) == ARRAY_TYPE
3949 || TREE_CODE (TREE_TYPE (newrhs)) == FUNCTION_TYPE)
3950 newrhs = default_conversion (newrhs);
3952 tree inner_lhs = TREE_OPERAND (lhs, 0);
3954 result = build_modify_expr (inner_lhs, NOP_EXPR,
3955 convert (TREE_TYPE (inner_lhs),
3956 convert (lhstype, newrhs)));
3957 if (TREE_CODE (result) == ERROR_MARK)
3959 pedantic_lvalue_warning (CONVERT_EXPR);
3960 return convert (TREE_TYPE (lhs), result);
3967 /* Now we have handled acceptable kinds of LHS that are not truly lvalues.
3968 Reject anything strange now. */
3970 if (!lvalue_or_else (lhs, "invalid lvalue in assignment"))
3971 return error_mark_node;
3973 /* Warn about storing in something that is `const'. */
3975 if (TREE_READONLY (lhs) || TYPE_READONLY (lhstype)
3976 || ((TREE_CODE (lhstype) == RECORD_TYPE
3977 || TREE_CODE (lhstype) == UNION_TYPE)
3978 && C_TYPE_FIELDS_READONLY (lhstype)))
3979 readonly_warning (lhs, "assignment");
3981 /* If storing into a structure or union member,
3982 it has probably been given type `int'.
3983 Compute the type that would go with
3984 the actual amount of storage the member occupies. */
3986 if (TREE_CODE (lhs) == COMPONENT_REF
3987 && (TREE_CODE (lhstype) == INTEGER_TYPE
3988 || TREE_CODE (lhstype) == BOOLEAN_TYPE
3989 || TREE_CODE (lhstype) == REAL_TYPE
3990 || TREE_CODE (lhstype) == ENUMERAL_TYPE))
3991 lhstype = TREE_TYPE (get_unwidened (lhs, 0));
3993 /* If storing in a field that is in actuality a short or narrower than one,
3994 we must store in the field in its actual type. */
3996 if (lhstype != TREE_TYPE (lhs))
3998 lhs = copy_node (lhs);
3999 TREE_TYPE (lhs) = lhstype;
4002 /* Convert new value to destination type. */
4004 newrhs = convert_for_assignment (lhstype, newrhs, _("assignment"),
4005 NULL_TREE, NULL_TREE, 0);
4006 if (TREE_CODE (newrhs) == ERROR_MARK)
4007 return error_mark_node;
4011 result = build (MODIFY_EXPR, lhstype, lhs, newrhs);
4012 TREE_SIDE_EFFECTS (result) = 1;
4014 /* If we got the LHS in a different type for storing in,
4015 convert the result back to the nominal type of LHS
4016 so that the value we return always has the same type
4017 as the LHS argument. */
4019 if (olhstype == TREE_TYPE (result))
4021 return convert_for_assignment (olhstype, result, _("assignment"),
4022 NULL_TREE, NULL_TREE, 0);
4025 /* Convert value RHS to type TYPE as preparation for an assignment
4026 to an lvalue of type TYPE.
4027 The real work of conversion is done by `convert'.
4028 The purpose of this function is to generate error messages
4029 for assignments that are not allowed in C.
4030 ERRTYPE is a string to use in error messages:
4031 "assignment", "return", etc. If it is null, this is parameter passing
4032 for a function call (and different error messages are output).
4034 FUNNAME is the name of the function being called,
4035 as an IDENTIFIER_NODE, or null.
4036 PARMNUM is the number of the argument, for printing in error messages. */
4039 convert_for_assignment (type, rhs, errtype, fundecl, funname, parmnum)
4041 const char *errtype;
4042 tree fundecl, funname;
4045 enum tree_code codel = TREE_CODE (type);
4047 enum tree_code coder;
4049 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
4050 /* Do not use STRIP_NOPS here. We do not want an enumerator
4051 whose value is 0 to count as a null pointer constant. */
4052 if (TREE_CODE (rhs) == NON_LVALUE_EXPR)
4053 rhs = TREE_OPERAND (rhs, 0);
4055 if (TREE_CODE (TREE_TYPE (rhs)) == ARRAY_TYPE
4056 || TREE_CODE (TREE_TYPE (rhs)) == FUNCTION_TYPE)
4057 rhs = default_conversion (rhs);
4058 else if (optimize && TREE_CODE (rhs) == VAR_DECL)
4059 rhs = decl_constant_value_for_broken_optimization (rhs);
4061 rhstype = TREE_TYPE (rhs);
4062 coder = TREE_CODE (rhstype);
4064 if (coder == ERROR_MARK)
4065 return error_mark_node;
4067 if (TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (rhstype))
4069 overflow_warning (rhs);
4070 /* Check for Objective-C protocols. This will issue a warning if
4071 there are protocol violations. No need to use the return value. */
4072 maybe_objc_comptypes (type, rhstype, 0);
4076 if (coder == VOID_TYPE)
4078 error ("void value not ignored as it ought to be");
4079 return error_mark_node;
4081 /* A type converts to a reference to it.
4082 This code doesn't fully support references, it's just for the
4083 special case of va_start and va_copy. */
4084 if (codel == REFERENCE_TYPE
4085 && comptypes (TREE_TYPE (type), TREE_TYPE (rhs)) == 1)
4087 if (mark_addressable (rhs) == 0)
4088 return error_mark_node;
4089 rhs = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (rhs)), rhs);
4091 /* We already know that these two types are compatible, but they
4092 may not be exactly identical. In fact, `TREE_TYPE (type)' is
4093 likely to be __builtin_va_list and `TREE_TYPE (rhs)' is
4094 likely to be va_list, a typedef to __builtin_va_list, which
4095 is different enough that it will cause problems later. */
4096 if (TREE_TYPE (TREE_TYPE (rhs)) != TREE_TYPE (type))
4097 rhs = build1 (NOP_EXPR, build_pointer_type (TREE_TYPE (type)), rhs);
4099 rhs = build1 (NOP_EXPR, type, rhs);
4102 /* Arithmetic types all interconvert, and enum is treated like int. */
4103 else if ((codel == INTEGER_TYPE || codel == REAL_TYPE
4104 || codel == ENUMERAL_TYPE || codel == COMPLEX_TYPE
4105 || codel == BOOLEAN_TYPE)
4106 && (coder == INTEGER_TYPE || coder == REAL_TYPE
4107 || coder == ENUMERAL_TYPE || coder == COMPLEX_TYPE
4108 || coder == BOOLEAN_TYPE))
4109 return convert_and_check (type, rhs);
4111 /* Conversion to a transparent union from its member types.
4112 This applies only to function arguments. */
4113 else if (codel == UNION_TYPE && TYPE_TRANSPARENT_UNION (type) && ! errtype)
4116 tree marginal_memb_type = 0;
4118 for (memb_types = TYPE_FIELDS (type); memb_types;
4119 memb_types = TREE_CHAIN (memb_types))
4121 tree memb_type = TREE_TYPE (memb_types);
4123 if (comptypes (TYPE_MAIN_VARIANT (memb_type),
4124 TYPE_MAIN_VARIANT (rhstype)))
4127 if (TREE_CODE (memb_type) != POINTER_TYPE)
4130 if (coder == POINTER_TYPE)
4132 tree ttl = TREE_TYPE (memb_type);
4133 tree ttr = TREE_TYPE (rhstype);
4135 /* Any non-function converts to a [const][volatile] void *
4136 and vice versa; otherwise, targets must be the same.
4137 Meanwhile, the lhs target must have all the qualifiers of
4139 if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
4140 || comp_target_types (memb_type, rhstype))
4142 /* If this type won't generate any warnings, use it. */
4143 if (TYPE_QUALS (ttl) == TYPE_QUALS (ttr)
4144 || ((TREE_CODE (ttr) == FUNCTION_TYPE
4145 && TREE_CODE (ttl) == FUNCTION_TYPE)
4146 ? ((TYPE_QUALS (ttl) | TYPE_QUALS (ttr))
4147 == TYPE_QUALS (ttr))
4148 : ((TYPE_QUALS (ttl) | TYPE_QUALS (ttr))
4149 == TYPE_QUALS (ttl))))
4152 /* Keep looking for a better type, but remember this one. */
4153 if (! marginal_memb_type)
4154 marginal_memb_type = memb_type;
4158 /* Can convert integer zero to any pointer type. */
4159 if (integer_zerop (rhs)
4160 || (TREE_CODE (rhs) == NOP_EXPR
4161 && integer_zerop (TREE_OPERAND (rhs, 0))))
4163 rhs = null_pointer_node;
4168 if (memb_types || marginal_memb_type)
4172 /* We have only a marginally acceptable member type;
4173 it needs a warning. */
4174 tree ttl = TREE_TYPE (marginal_memb_type);
4175 tree ttr = TREE_TYPE (rhstype);
4177 /* Const and volatile mean something different for function
4178 types, so the usual warnings are not appropriate. */
4179 if (TREE_CODE (ttr) == FUNCTION_TYPE
4180 && TREE_CODE (ttl) == FUNCTION_TYPE)
4182 /* Because const and volatile on functions are
4183 restrictions that say the function will not do
4184 certain things, it is okay to use a const or volatile
4185 function where an ordinary one is wanted, but not
4187 if (TYPE_QUALS (ttl) & ~TYPE_QUALS (ttr))
4188 warn_for_assignment ("%s makes qualified function pointer from unqualified",
4189 errtype, funname, parmnum);
4191 else if (TYPE_QUALS (ttr) & ~TYPE_QUALS (ttl))
4192 warn_for_assignment ("%s discards qualifiers from pointer target type",
4197 if (pedantic && ! DECL_IN_SYSTEM_HEADER (fundecl))
4198 pedwarn ("ISO C prohibits argument conversion to union type");
4200 return build1 (NOP_EXPR, type, rhs);
4204 /* Conversions among pointers */
4205 else if ((codel == POINTER_TYPE || codel == REFERENCE_TYPE)
4206 && (coder == POINTER_TYPE || coder == REFERENCE_TYPE))
4208 tree ttl = TREE_TYPE (type);
4209 tree ttr = TREE_TYPE (rhstype);
4211 /* Any non-function converts to a [const][volatile] void *
4212 and vice versa; otherwise, targets must be the same.
4213 Meanwhile, the lhs target must have all the qualifiers of the rhs. */
4214 if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
4215 || comp_target_types (type, rhstype)
4216 || (unsigned_type (TYPE_MAIN_VARIANT (ttl))
4217 == unsigned_type (TYPE_MAIN_VARIANT (ttr))))
4220 && ((VOID_TYPE_P (ttl) && TREE_CODE (ttr) == FUNCTION_TYPE)
4223 /* Check TREE_CODE to catch cases like (void *) (char *) 0
4224 which are not ANSI null ptr constants. */
4225 && (!integer_zerop (rhs) || TREE_CODE (rhs) == NOP_EXPR)
4226 && TREE_CODE (ttl) == FUNCTION_TYPE)))
4227 warn_for_assignment ("ISO C forbids %s between function pointer and `void *'",
4228 errtype, funname, parmnum);
4229 /* Const and volatile mean something different for function types,
4230 so the usual warnings are not appropriate. */
4231 else if (TREE_CODE (ttr) != FUNCTION_TYPE
4232 && TREE_CODE (ttl) != FUNCTION_TYPE)
4234 if (TYPE_QUALS (ttr) & ~TYPE_QUALS (ttl))
4235 warn_for_assignment ("%s discards qualifiers from pointer target type",
4236 errtype, funname, parmnum);
4237 /* If this is not a case of ignoring a mismatch in signedness,
4239 else if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
4240 || comp_target_types (type, rhstype))
4242 /* If there is a mismatch, do warn. */
4244 warn_for_assignment ("pointer targets in %s differ in signedness",
4245 errtype, funname, parmnum);
4247 else if (TREE_CODE (ttl) == FUNCTION_TYPE
4248 && TREE_CODE (ttr) == FUNCTION_TYPE)
4250 /* Because const and volatile on functions are restrictions
4251 that say the function will not do certain things,
4252 it is okay to use a const or volatile function
4253 where an ordinary one is wanted, but not vice-versa. */
4254 if (TYPE_QUALS (ttl) & ~TYPE_QUALS (ttr))
4255 warn_for_assignment ("%s makes qualified function pointer from unqualified",
4256 errtype, funname, parmnum);
4260 warn_for_assignment ("%s from incompatible pointer type",
4261 errtype, funname, parmnum);
4262 return convert (type, rhs);
4264 else if (codel == POINTER_TYPE && coder == INTEGER_TYPE)
4266 /* An explicit constant 0 can convert to a pointer,
4267 or one that results from arithmetic, even including
4268 a cast to integer type. */
4269 if (! (TREE_CODE (rhs) == INTEGER_CST && integer_zerop (rhs))
4271 ! (TREE_CODE (rhs) == NOP_EXPR
4272 && TREE_CODE (TREE_TYPE (rhs)) == INTEGER_TYPE
4273 && TREE_CODE (TREE_OPERAND (rhs, 0)) == INTEGER_CST
4274 && integer_zerop (TREE_OPERAND (rhs, 0))))
4276 warn_for_assignment ("%s makes pointer from integer without a cast",
4277 errtype, funname, parmnum);
4278 return convert (type, rhs);
4280 return null_pointer_node;
4282 else if (codel == INTEGER_TYPE && coder == POINTER_TYPE)
4284 warn_for_assignment ("%s makes integer from pointer without a cast",
4285 errtype, funname, parmnum);
4286 return convert (type, rhs);
4288 else if (codel == BOOLEAN_TYPE && coder == POINTER_TYPE)
4289 return convert (type, rhs);
4295 tree selector = maybe_building_objc_message_expr ();
4297 if (selector && parmnum > 2)
4298 error ("incompatible type for argument %d of `%s'",
4299 parmnum - 2, IDENTIFIER_POINTER (selector));
4301 error ("incompatible type for argument %d of `%s'",
4302 parmnum, IDENTIFIER_POINTER (funname));
4305 error ("incompatible type for argument %d of indirect function call",
4309 error ("incompatible types in %s", errtype);
4311 return error_mark_node;
4314 /* Print a warning using MSGID.
4315 It gets OPNAME as its one parameter.
4316 If OPNAME is null, it is replaced by "passing arg ARGNUM of `FUNCTION'".
4317 FUNCTION and ARGNUM are handled specially if we are building an
4318 Objective-C selector. */
4321 warn_for_assignment (msgid, opname, function, argnum)
4329 tree selector = maybe_building_objc_message_expr ();
4332 if (selector && argnum > 2)
4334 function = selector;
4339 /* Function name is known; supply it. */
4340 const char *const argstring = _("passing arg %d of `%s'");
4341 new_opname = (char *) alloca (IDENTIFIER_LENGTH (function)
4342 + strlen (argstring) + 1 + 25
4344 sprintf (new_opname, argstring, argnum,
4345 IDENTIFIER_POINTER (function));
4349 /* Function name unknown (call through ptr); just give arg number.*/
4350 const char *const argnofun = _("passing arg %d of pointer to function");
4351 new_opname = (char *) alloca (strlen (argnofun) + 1 + 25 /*%d*/ + 1);
4352 sprintf (new_opname, argnofun, argnum);
4354 opname = new_opname;
4356 pedwarn (msgid, opname);
4359 /* If VALUE is a compound expr all of whose expressions are constant, then
4360 return its value. Otherwise, return error_mark_node.
4362 This is for handling COMPOUND_EXPRs as initializer elements
4363 which is allowed with a warning when -pedantic is specified. */
4366 valid_compound_expr_initializer (value, endtype)
4370 if (TREE_CODE (value) == COMPOUND_EXPR)
4372 if (valid_compound_expr_initializer (TREE_OPERAND (value, 0), endtype)
4374 return error_mark_node;
4375 return valid_compound_expr_initializer (TREE_OPERAND (value, 1),
4378 else if (! TREE_CONSTANT (value)
4379 && ! initializer_constant_valid_p (value, endtype))
4380 return error_mark_node;
4385 /* Perform appropriate conversions on the initial value of a variable,
4386 store it in the declaration DECL,
4387 and print any error messages that are appropriate.
4388 If the init is invalid, store an ERROR_MARK. */
4391 store_init_value (decl, init)
4396 /* If variable's type was invalidly declared, just ignore it. */
4398 type = TREE_TYPE (decl);
4399 if (TREE_CODE (type) == ERROR_MARK)
4402 /* Digest the specified initializer into an expression. */
4404 value = digest_init (type, init, TREE_STATIC (decl),
4405 TREE_STATIC (decl) || (pedantic && !flag_isoc99));
4407 /* Store the expression if valid; else report error. */
4410 /* Note that this is the only place we can detect the error
4411 in a case such as struct foo bar = (struct foo) { x, y };
4412 where there is one initial value which is a constructor expression. */
4413 if (value == error_mark_node)
4415 else if (TREE_STATIC (decl) && ! TREE_CONSTANT (value))
4417 error ("initializer for static variable is not constant");
4418 value = error_mark_node;
4420 else if (TREE_STATIC (decl)
4421 && initializer_constant_valid_p (value, TREE_TYPE (value)) == 0)
4423 error ("initializer for static variable uses complicated arithmetic");
4424 value = error_mark_node;
4428 if (pedantic && TREE_CODE (value) == CONSTRUCTOR)
4430 if (! TREE_CONSTANT (value))
4431 pedwarn ("aggregate initializer is not constant");
4432 else if (! TREE_STATIC (value))
4433 pedwarn ("aggregate initializer uses complicated arithmetic");
4438 if (warn_traditional && !in_system_header
4439 && AGGREGATE_TYPE_P (TREE_TYPE (decl)) && ! TREE_STATIC (decl))
4440 warning ("traditional C rejects automatic aggregate initialization");
4442 DECL_INITIAL (decl) = value;
4444 /* ANSI wants warnings about out-of-range constant initializers. */
4445 STRIP_TYPE_NOPS (value);
4446 constant_expression_warning (value);
4449 /* Methods for storing and printing names for error messages. */
4451 /* Implement a spelling stack that allows components of a name to be pushed
4452 and popped. Each element on the stack is this structure. */
4464 #define SPELLING_STRING 1
4465 #define SPELLING_MEMBER 2
4466 #define SPELLING_BOUNDS 3
4468 static struct spelling *spelling; /* Next stack element (unused). */
4469 static struct spelling *spelling_base; /* Spelling stack base. */
4470 static int spelling_size; /* Size of the spelling stack. */
4472 /* Macros to save and restore the spelling stack around push_... functions.
4473 Alternative to SAVE_SPELLING_STACK. */
4475 #define SPELLING_DEPTH() (spelling - spelling_base)
4476 #define RESTORE_SPELLING_DEPTH(DEPTH) (spelling = spelling_base + (DEPTH))
4478 /* Save and restore the spelling stack around arbitrary C code. */
4480 #define SAVE_SPELLING_DEPTH(code) \
4482 int __depth = SPELLING_DEPTH (); \
4484 RESTORE_SPELLING_DEPTH (__depth); \
4487 /* Push an element on the spelling stack with type KIND and assign VALUE
4490 #define PUSH_SPELLING(KIND, VALUE, MEMBER) \
4492 int depth = SPELLING_DEPTH (); \
4494 if (depth >= spelling_size) \
4496 spelling_size += 10; \
4497 if (spelling_base == 0) \
4499 = (struct spelling *) xmalloc (spelling_size * sizeof (struct spelling)); \
4502 = (struct spelling *) xrealloc (spelling_base, \
4503 spelling_size * sizeof (struct spelling)); \
4504 RESTORE_SPELLING_DEPTH (depth); \
4507 spelling->kind = (KIND); \
4508 spelling->MEMBER = (VALUE); \
4512 /* Push STRING on the stack. Printed literally. */
4515 push_string (string)
4518 PUSH_SPELLING (SPELLING_STRING, string, u.s);
4521 /* Push a member name on the stack. Printed as '.' STRING. */
4524 push_member_name (decl)
4528 const char *const string
4529 = DECL_NAME (decl) ? IDENTIFIER_POINTER (DECL_NAME (decl)) : "<anonymous>";
4530 PUSH_SPELLING (SPELLING_MEMBER, string, u.s);
4533 /* Push an array bounds on the stack. Printed as [BOUNDS]. */
4536 push_array_bounds (bounds)
4539 PUSH_SPELLING (SPELLING_BOUNDS, bounds, u.i);
4542 /* Compute the maximum size in bytes of the printed spelling. */
4550 for (p = spelling_base; p < spelling; p++)
4552 if (p->kind == SPELLING_BOUNDS)
4555 size += strlen (p->u.s) + 1;
4561 /* Print the spelling to BUFFER and return it. */
4564 print_spelling (buffer)
4570 for (p = spelling_base; p < spelling; p++)
4571 if (p->kind == SPELLING_BOUNDS)
4573 sprintf (d, "[%d]", p->u.i);
4579 if (p->kind == SPELLING_MEMBER)
4581 for (s = p->u.s; (*d = *s++); d++)
4588 /* Issue an error message for a bad initializer component.
4589 MSGID identifies the message.
4590 The component name is taken from the spelling stack. */
4598 error ("%s", msgid);
4599 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4601 error ("(near initialization for `%s')", ofwhat);
4604 /* Issue a pedantic warning for a bad initializer component.
4605 MSGID identifies the message.
4606 The component name is taken from the spelling stack. */
4609 pedwarn_init (msgid)
4614 pedwarn ("%s", msgid);
4615 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4617 pedwarn ("(near initialization for `%s')", ofwhat);
4620 /* Issue a warning for a bad initializer component.
4621 MSGID identifies the message.
4622 The component name is taken from the spelling stack. */
4625 warning_init (msgid)
4630 warning ("%s", msgid);
4631 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4633 warning ("(near initialization for `%s')", ofwhat);
4636 /* Digest the parser output INIT as an initializer for type TYPE.
4637 Return a C expression of type TYPE to represent the initial value.
4639 The arguments REQUIRE_CONSTANT and CONSTRUCTOR_CONSTANT request errors
4640 if non-constant initializers or elements are seen. CONSTRUCTOR_CONSTANT
4641 applies only to elements of constructors. */
4644 digest_init (type, init, require_constant, constructor_constant)
4646 int require_constant, constructor_constant;
4648 enum tree_code code = TREE_CODE (type);
4649 tree inside_init = init;
4651 if (type == error_mark_node
4652 || init == error_mark_node
4653 || TREE_TYPE (init) == error_mark_node)
4654 return error_mark_node;
4656 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
4657 /* Do not use STRIP_NOPS here. We do not want an enumerator
4658 whose value is 0 to count as a null pointer constant. */
4659 if (TREE_CODE (init) == NON_LVALUE_EXPR)
4660 inside_init = TREE_OPERAND (init, 0);
4662 inside_init = fold (inside_init);
4664 /* Initialization of an array of chars from a string constant
4665 optionally enclosed in braces. */
4667 if (code == ARRAY_TYPE)
4669 tree typ1 = TYPE_MAIN_VARIANT (TREE_TYPE (type));
4670 if ((typ1 == char_type_node
4671 || typ1 == signed_char_type_node
4672 || typ1 == unsigned_char_type_node
4673 || typ1 == unsigned_wchar_type_node
4674 || typ1 == signed_wchar_type_node)
4675 && ((inside_init && TREE_CODE (inside_init) == STRING_CST)))
4677 if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
4678 TYPE_MAIN_VARIANT (type)))
4681 if ((TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (inside_init)))
4683 && TYPE_PRECISION (typ1) == TYPE_PRECISION (char_type_node))
4685 error_init ("char-array initialized from wide string");
4686 return error_mark_node;
4688 if ((TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (inside_init)))
4690 && TYPE_PRECISION (typ1) != TYPE_PRECISION (char_type_node))
4692 error_init ("int-array initialized from non-wide string");
4693 return error_mark_node;
4696 TREE_TYPE (inside_init) = type;
4697 if (TYPE_DOMAIN (type) != 0
4698 && TYPE_SIZE (type) != 0
4699 && TREE_CODE (TYPE_SIZE (type)) == INTEGER_CST
4700 /* Subtract 1 (or sizeof (wchar_t))
4701 because it's ok to ignore the terminating null char
4702 that is counted in the length of the constant. */
4703 && 0 > compare_tree_int (TYPE_SIZE_UNIT (type),
4704 TREE_STRING_LENGTH (inside_init)
4705 - ((TYPE_PRECISION (typ1)
4706 != TYPE_PRECISION (char_type_node))
4707 ? (TYPE_PRECISION (wchar_type_node)
4710 pedwarn_init ("initializer-string for array of chars is too long");
4716 /* Any type can be initialized
4717 from an expression of the same type, optionally with braces. */
4719 if (inside_init && TREE_TYPE (inside_init) != 0
4720 && (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
4721 TYPE_MAIN_VARIANT (type))
4722 || (code == ARRAY_TYPE
4723 && comptypes (TREE_TYPE (inside_init), type))
4724 || (code == POINTER_TYPE
4725 && (TREE_CODE (TREE_TYPE (inside_init)) == ARRAY_TYPE
4726 || TREE_CODE (TREE_TYPE (inside_init)) == FUNCTION_TYPE)
4727 && comptypes (TREE_TYPE (TREE_TYPE (inside_init)),
4728 TREE_TYPE (type)))))
4730 if (code == POINTER_TYPE
4731 && (TREE_CODE (TREE_TYPE (inside_init)) == ARRAY_TYPE
4732 || TREE_CODE (TREE_TYPE (inside_init)) == FUNCTION_TYPE))
4733 inside_init = default_conversion (inside_init);
4734 else if (code == ARRAY_TYPE && TREE_CODE (inside_init) != STRING_CST
4735 && TREE_CODE (inside_init) != CONSTRUCTOR)
4737 error_init ("array initialized from non-constant array expression");
4738 return error_mark_node;
4741 if (optimize && TREE_CODE (inside_init) == VAR_DECL)
4742 inside_init = decl_constant_value_for_broken_optimization (inside_init);
4744 /* Compound expressions can only occur here if -pedantic or
4745 -pedantic-errors is specified. In the later case, we always want
4746 an error. In the former case, we simply want a warning. */
4747 if (require_constant && pedantic
4748 && TREE_CODE (inside_init) == COMPOUND_EXPR)
4751 = valid_compound_expr_initializer (inside_init,
4752 TREE_TYPE (inside_init));
4753 if (inside_init == error_mark_node)
4754 error_init ("initializer element is not constant");
4756 pedwarn_init ("initializer element is not constant");
4757 if (flag_pedantic_errors)
4758 inside_init = error_mark_node;
4760 else if (require_constant
4761 && (!TREE_CONSTANT (inside_init)
4762 /* This test catches things like `7 / 0' which
4763 result in an expression for which TREE_CONSTANT
4764 is true, but which is not actually something
4765 that is a legal constant. We really should not
4766 be using this function, because it is a part of
4767 the back-end. Instead, the expression should
4768 already have been turned into ERROR_MARK_NODE. */
4769 || !initializer_constant_valid_p (inside_init,
4770 TREE_TYPE (inside_init))))
4772 error_init ("initializer element is not constant");
4773 inside_init = error_mark_node;
4779 /* Handle scalar types, including conversions. */
4781 if (code == INTEGER_TYPE || code == REAL_TYPE || code == POINTER_TYPE
4782 || code == ENUMERAL_TYPE || code == BOOLEAN_TYPE || code == COMPLEX_TYPE)
4784 /* Note that convert_for_assignment calls default_conversion
4785 for arrays and functions. We must not call it in the
4786 case where inside_init is a null pointer constant. */
4788 = convert_for_assignment (type, init, _("initialization"),
4789 NULL_TREE, NULL_TREE, 0);
4791 if (require_constant && ! TREE_CONSTANT (inside_init))
4793 error_init ("initializer element is not constant");
4794 inside_init = error_mark_node;
4796 else if (require_constant
4797 && initializer_constant_valid_p (inside_init, TREE_TYPE (inside_init)) == 0)
4799 error_init ("initializer element is not computable at load time");
4800 inside_init = error_mark_node;
4806 /* Come here only for records and arrays. */
4808 if (COMPLETE_TYPE_P (type) && TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST)
4810 error_init ("variable-sized object may not be initialized");
4811 return error_mark_node;
4814 /* Traditionally, you can write struct foo x = 0;
4815 and it initializes the first element of x to 0. */
4816 if (flag_traditional)
4818 tree top = 0, prev = 0, otype = type;
4819 while (TREE_CODE (type) == RECORD_TYPE
4820 || TREE_CODE (type) == ARRAY_TYPE
4821 || TREE_CODE (type) == QUAL_UNION_TYPE
4822 || TREE_CODE (type) == UNION_TYPE)
4824 tree temp = build (CONSTRUCTOR, type, NULL_TREE, NULL_TREE);
4828 TREE_OPERAND (prev, 1) = build_tree_list (NULL_TREE, temp);
4830 if (TREE_CODE (type) == ARRAY_TYPE)
4831 type = TREE_TYPE (type);
4832 else if (TYPE_FIELDS (type))
4833 type = TREE_TYPE (TYPE_FIELDS (type));
4836 error_init ("invalid initializer");
4837 return error_mark_node;
4843 TREE_OPERAND (prev, 1)
4844 = build_tree_list (NULL_TREE,
4845 digest_init (type, init, require_constant,
4846 constructor_constant));
4850 return error_mark_node;
4852 error_init ("invalid initializer");
4853 return error_mark_node;
4856 /* Handle initializers that use braces. */
4858 /* Type of object we are accumulating a constructor for.
4859 This type is always a RECORD_TYPE, UNION_TYPE or ARRAY_TYPE. */
4860 static tree constructor_type;
4862 /* For a RECORD_TYPE or UNION_TYPE, this is the chain of fields
4864 static tree constructor_fields;
4866 /* For an ARRAY_TYPE, this is the specified index
4867 at which to store the next element we get. */
4868 static tree constructor_index;
4870 /* For an ARRAY_TYPE, this is the maximum index. */
4871 static tree constructor_max_index;
4873 /* For a RECORD_TYPE, this is the first field not yet written out. */
4874 static tree constructor_unfilled_fields;
4876 /* For an ARRAY_TYPE, this is the index of the first element
4877 not yet written out. */
4878 static tree constructor_unfilled_index;
4880 /* In a RECORD_TYPE, the byte index of the next consecutive field.
4881 This is so we can generate gaps between fields, when appropriate. */
4882 static tree constructor_bit_index;
4884 /* If we are saving up the elements rather than allocating them,
4885 this is the list of elements so far (in reverse order,
4886 most recent first). */
4887 static tree constructor_elements;
4889 /* 1 if constructor should be incrementally stored into a constructor chain,
4890 0 if all the elements should be kept in AVL tree. */
4891 static int constructor_incremental;
4893 /* 1 if so far this constructor's elements are all compile-time constants. */
4894 static int constructor_constant;
4896 /* 1 if so far this constructor's elements are all valid address constants. */
4897 static int constructor_simple;
4899 /* 1 if this constructor is erroneous so far. */
4900 static int constructor_erroneous;
4902 /* 1 if have called defer_addressed_constants. */
4903 static int constructor_subconstants_deferred;
4905 /* Structure for managing pending initializer elements, organized as an
4910 struct init_node *left, *right;
4911 struct init_node *parent;
4917 /* Tree of pending elements at this constructor level.
4918 These are elements encountered out of order
4919 which belong at places we haven't reached yet in actually
4921 Will never hold tree nodes across GC runs. */
4922 static struct init_node *constructor_pending_elts;
4924 /* The SPELLING_DEPTH of this constructor. */
4925 static int constructor_depth;
4927 /* 0 if implicitly pushing constructor levels is allowed. */
4928 int constructor_no_implicit = 0; /* 0 for C; 1 for some other languages. */
4930 static int require_constant_value;
4931 static int require_constant_elements;
4933 /* DECL node for which an initializer is being read.
4934 0 means we are reading a constructor expression
4935 such as (struct foo) {...}. */
4936 static tree constructor_decl;
4938 /* start_init saves the ASMSPEC arg here for really_start_incremental_init. */
4939 static const char *constructor_asmspec;
4941 /* Nonzero if this is an initializer for a top-level decl. */
4942 static int constructor_top_level;
4944 /* Nonzero if there were any member designators in this initializer. */
4945 static int constructor_designated;
4947 /* Nesting depth of designator list. */
4948 static int designator_depth;
4950 /* Nonzero if there were diagnosed errors in this designator list. */
4951 static int designator_errorneous;
4954 /* This stack has a level for each implicit or explicit level of
4955 structuring in the initializer, including the outermost one. It
4956 saves the values of most of the variables above. */
4958 struct constructor_range_stack;
4960 struct constructor_stack
4962 struct constructor_stack *next;
4967 tree unfilled_index;
4968 tree unfilled_fields;
4971 struct init_node *pending_elts;
4974 /* If nonzero, this value should replace the entire
4975 constructor at this level. */
4976 tree replacement_value;
4977 struct constructor_range_stack *range_stack;
4987 struct constructor_stack *constructor_stack;
4989 /* This stack represents designators from some range designator up to
4990 the last designator in the list. */
4992 struct constructor_range_stack
4994 struct constructor_range_stack *next, *prev;
4995 struct constructor_stack *stack;
5002 struct constructor_range_stack *constructor_range_stack;
5004 /* This stack records separate initializers that are nested.
5005 Nested initializers can't happen in ANSI C, but GNU C allows them
5006 in cases like { ... (struct foo) { ... } ... }. */
5008 struct initializer_stack
5010 struct initializer_stack *next;
5012 const char *asmspec;
5013 struct constructor_stack *constructor_stack;
5014 struct constructor_range_stack *constructor_range_stack;
5016 struct spelling *spelling;
5017 struct spelling *spelling_base;
5020 char require_constant_value;
5021 char require_constant_elements;
5025 struct initializer_stack *initializer_stack;
5027 /* Prepare to parse and output the initializer for variable DECL. */
5030 start_init (decl, asmspec_tree, top_level)
5036 struct initializer_stack *p
5037 = (struct initializer_stack *) xmalloc (sizeof (struct initializer_stack));
5038 const char *asmspec = 0;
5041 asmspec = TREE_STRING_POINTER (asmspec_tree);
5043 p->decl = constructor_decl;
5044 p->asmspec = constructor_asmspec;
5045 p->require_constant_value = require_constant_value;
5046 p->require_constant_elements = require_constant_elements;
5047 p->constructor_stack = constructor_stack;
5048 p->constructor_range_stack = constructor_range_stack;
5049 p->elements = constructor_elements;
5050 p->spelling = spelling;
5051 p->spelling_base = spelling_base;
5052 p->spelling_size = spelling_size;
5053 p->deferred = constructor_subconstants_deferred;
5054 p->top_level = constructor_top_level;
5055 p->next = initializer_stack;
5056 initializer_stack = p;
5058 constructor_decl = decl;
5059 constructor_asmspec = asmspec;
5060 constructor_subconstants_deferred = 0;
5061 constructor_designated = 0;
5062 constructor_top_level = top_level;
5066 require_constant_value = TREE_STATIC (decl);
5067 require_constant_elements
5068 = ((TREE_STATIC (decl) || (pedantic && !flag_isoc99))
5069 /* For a scalar, you can always use any value to initialize,
5070 even within braces. */
5071 && (TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE
5072 || TREE_CODE (TREE_TYPE (decl)) == RECORD_TYPE
5073 || TREE_CODE (TREE_TYPE (decl)) == UNION_TYPE
5074 || TREE_CODE (TREE_TYPE (decl)) == QUAL_UNION_TYPE));
5075 locus = IDENTIFIER_POINTER (DECL_NAME (decl));
5079 require_constant_value = 0;
5080 require_constant_elements = 0;
5081 locus = "(anonymous)";
5084 constructor_stack = 0;
5085 constructor_range_stack = 0;
5087 missing_braces_mentioned = 0;
5091 RESTORE_SPELLING_DEPTH (0);
5094 push_string (locus);
5100 struct initializer_stack *p = initializer_stack;
5102 /* Output subconstants (string constants, usually)
5103 that were referenced within this initializer and saved up.
5104 Must do this if and only if we called defer_addressed_constants. */
5105 if (constructor_subconstants_deferred)
5106 output_deferred_addressed_constants ();
5108 /* Free the whole constructor stack of this initializer. */
5109 while (constructor_stack)
5111 struct constructor_stack *q = constructor_stack;
5112 constructor_stack = q->next;
5116 if (constructor_range_stack)
5119 /* Pop back to the data of the outer initializer (if any). */
5120 constructor_decl = p->decl;
5121 constructor_asmspec = p->asmspec;
5122 require_constant_value = p->require_constant_value;
5123 require_constant_elements = p->require_constant_elements;
5124 constructor_stack = p->constructor_stack;
5125 constructor_range_stack = p->constructor_range_stack;
5126 constructor_elements = p->elements;
5127 spelling = p->spelling;
5128 spelling_base = p->spelling_base;
5129 spelling_size = p->spelling_size;
5130 constructor_subconstants_deferred = p->deferred;
5131 constructor_top_level = p->top_level;
5132 initializer_stack = p->next;
5136 /* Call here when we see the initializer is surrounded by braces.
5137 This is instead of a call to push_init_level;
5138 it is matched by a call to pop_init_level.
5140 TYPE is the type to initialize, for a constructor expression.
5141 For an initializer for a decl, TYPE is zero. */
5144 really_start_incremental_init (type)
5147 struct constructor_stack *p
5148 = (struct constructor_stack *) xmalloc (sizeof (struct constructor_stack));
5151 type = TREE_TYPE (constructor_decl);
5153 p->type = constructor_type;
5154 p->fields = constructor_fields;
5155 p->index = constructor_index;
5156 p->max_index = constructor_max_index;
5157 p->unfilled_index = constructor_unfilled_index;
5158 p->unfilled_fields = constructor_unfilled_fields;
5159 p->bit_index = constructor_bit_index;
5160 p->elements = constructor_elements;
5161 p->constant = constructor_constant;
5162 p->simple = constructor_simple;
5163 p->erroneous = constructor_erroneous;
5164 p->pending_elts = constructor_pending_elts;
5165 p->depth = constructor_depth;
5166 p->replacement_value = 0;
5170 p->incremental = constructor_incremental;
5171 p->designated = constructor_designated;
5173 constructor_stack = p;
5175 constructor_constant = 1;
5176 constructor_simple = 1;
5177 constructor_depth = SPELLING_DEPTH ();
5178 constructor_elements = 0;
5179 constructor_pending_elts = 0;
5180 constructor_type = type;
5181 constructor_incremental = 1;
5182 constructor_designated = 0;
5183 designator_depth = 0;
5184 designator_errorneous = 0;
5186 if (TREE_CODE (constructor_type) == RECORD_TYPE
5187 || TREE_CODE (constructor_type) == UNION_TYPE)
5189 constructor_fields = TYPE_FIELDS (constructor_type);
5190 /* Skip any nameless bit fields at the beginning. */
5191 while (constructor_fields != 0 && DECL_C_BIT_FIELD (constructor_fields)
5192 && DECL_NAME (constructor_fields) == 0)
5193 constructor_fields = TREE_CHAIN (constructor_fields);
5195 constructor_unfilled_fields = constructor_fields;
5196 constructor_bit_index = bitsize_zero_node;
5198 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5200 if (TYPE_DOMAIN (constructor_type))
5202 constructor_max_index
5203 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type));
5205 /* Detect non-empty initializations of zero-length arrays. */
5206 if (constructor_max_index == NULL_TREE
5207 && TYPE_SIZE (constructor_type))
5208 constructor_max_index = build_int_2 (-1, -1);
5211 = convert (bitsizetype,
5212 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
5215 constructor_index = bitsize_zero_node;
5217 constructor_unfilled_index = constructor_index;
5221 /* Handle the case of int x = {5}; */
5222 constructor_fields = constructor_type;
5223 constructor_unfilled_fields = constructor_type;
5227 /* Push down into a subobject, for initialization.
5228 If this is for an explicit set of braces, IMPLICIT is 0.
5229 If it is because the next element belongs at a lower level,
5230 IMPLICIT is 1 (or 2 if the push is because of designator list). */
5233 push_init_level (implicit)
5236 struct constructor_stack *p;
5237 tree value = NULL_TREE;
5239 /* If we've exhausted any levels that didn't have braces,
5241 while (constructor_stack->implicit)
5243 if ((TREE_CODE (constructor_type) == RECORD_TYPE
5244 || TREE_CODE (constructor_type) == UNION_TYPE)
5245 && constructor_fields == 0)
5246 process_init_element (pop_init_level (1));
5247 else if (TREE_CODE (constructor_type) == ARRAY_TYPE
5248 && tree_int_cst_lt (constructor_max_index, constructor_index))
5249 process_init_element (pop_init_level (1));
5254 /* Unless this is an explicit brace, we need to preserve previous
5258 if ((TREE_CODE (constructor_type) == RECORD_TYPE
5259 || TREE_CODE (constructor_type) == UNION_TYPE)
5260 && constructor_fields)
5261 value = find_init_member (constructor_fields);
5262 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5263 value = find_init_member (constructor_index);
5266 p = (struct constructor_stack *) xmalloc (sizeof (struct constructor_stack));
5267 p->type = constructor_type;
5268 p->fields = constructor_fields;
5269 p->index = constructor_index;
5270 p->max_index = constructor_max_index;
5271 p->unfilled_index = constructor_unfilled_index;
5272 p->unfilled_fields = constructor_unfilled_fields;
5273 p->bit_index = constructor_bit_index;
5274 p->elements = constructor_elements;
5275 p->constant = constructor_constant;
5276 p->simple = constructor_simple;
5277 p->erroneous = constructor_erroneous;
5278 p->pending_elts = constructor_pending_elts;
5279 p->depth = constructor_depth;
5280 p->replacement_value = 0;
5281 p->implicit = implicit;
5283 p->incremental = constructor_incremental;
5284 p->designated = constructor_designated;
5285 p->next = constructor_stack;
5287 constructor_stack = p;
5289 constructor_constant = 1;
5290 constructor_simple = 1;
5291 constructor_depth = SPELLING_DEPTH ();
5292 constructor_elements = 0;
5293 constructor_incremental = 1;
5294 constructor_designated = 0;
5295 constructor_pending_elts = 0;
5298 p->range_stack = constructor_range_stack;
5299 constructor_range_stack = 0;
5300 designator_depth = 0;
5301 designator_errorneous = 0;
5304 /* Don't die if an entire brace-pair level is superfluous
5305 in the containing level. */
5306 if (constructor_type == 0)
5308 else if (TREE_CODE (constructor_type) == RECORD_TYPE
5309 || TREE_CODE (constructor_type) == UNION_TYPE)
5311 /* Don't die if there are extra init elts at the end. */
5312 if (constructor_fields == 0)
5313 constructor_type = 0;
5316 constructor_type = TREE_TYPE (constructor_fields);
5317 push_member_name (constructor_fields);
5318 constructor_depth++;
5321 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5323 constructor_type = TREE_TYPE (constructor_type);
5324 push_array_bounds (tree_low_cst (constructor_index, 0));
5325 constructor_depth++;
5328 if (constructor_type == 0)
5330 error_init ("extra brace group at end of initializer");
5331 constructor_fields = 0;
5332 constructor_unfilled_fields = 0;
5336 if (value && TREE_CODE (value) == CONSTRUCTOR)
5338 constructor_constant = TREE_CONSTANT (value);
5339 constructor_simple = TREE_STATIC (value);
5340 constructor_elements = TREE_OPERAND (value, 1);
5341 if (constructor_elements
5342 && (TREE_CODE (constructor_type) == RECORD_TYPE
5343 || TREE_CODE (constructor_type) == ARRAY_TYPE))
5344 set_nonincremental_init ();
5347 if (implicit == 1 && warn_missing_braces && !missing_braces_mentioned)
5349 missing_braces_mentioned = 1;
5350 warning_init ("missing braces around initializer");
5353 if (TREE_CODE (constructor_type) == RECORD_TYPE
5354 || TREE_CODE (constructor_type) == UNION_TYPE)
5356 constructor_fields = TYPE_FIELDS (constructor_type);
5357 /* Skip any nameless bit fields at the beginning. */
5358 while (constructor_fields != 0 && DECL_C_BIT_FIELD (constructor_fields)
5359 && DECL_NAME (constructor_fields) == 0)
5360 constructor_fields = TREE_CHAIN (constructor_fields);
5362 constructor_unfilled_fields = constructor_fields;
5363 constructor_bit_index = bitsize_zero_node;
5365 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5367 if (TYPE_DOMAIN (constructor_type))
5369 constructor_max_index
5370 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type));
5372 /* Detect non-empty initializations of zero-length arrays. */
5373 if (constructor_max_index == NULL_TREE
5374 && TYPE_SIZE (constructor_type))
5375 constructor_max_index = build_int_2 (-1, -1);
5378 = convert (bitsizetype,
5379 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
5382 constructor_index = bitsize_zero_node;
5384 constructor_unfilled_index = constructor_index;
5385 if (value && TREE_CODE (value) == STRING_CST)
5387 /* We need to split the char/wchar array into individual
5388 characters, so that we don't have to special case it
5390 set_nonincremental_init_from_string (value);
5395 warning_init ("braces around scalar initializer");
5396 constructor_fields = constructor_type;
5397 constructor_unfilled_fields = constructor_type;
5401 /* At the end of an implicit or explicit brace level,
5402 finish up that level of constructor.
5403 If we were outputting the elements as they are read, return 0
5404 from inner levels (process_init_element ignores that),
5405 but return error_mark_node from the outermost level
5406 (that's what we want to put in DECL_INITIAL).
5407 Otherwise, return a CONSTRUCTOR expression. */
5410 pop_init_level (implicit)
5413 struct constructor_stack *p;
5414 HOST_WIDE_INT size = 0;
5415 tree constructor = 0;
5419 /* When we come to an explicit close brace,
5420 pop any inner levels that didn't have explicit braces. */
5421 while (constructor_stack->implicit)
5422 process_init_element (pop_init_level (1));
5424 if (constructor_range_stack)
5428 p = constructor_stack;
5430 if (constructor_type != 0)
5431 size = int_size_in_bytes (constructor_type);
5433 /* Error for initializing a flexible array member, or a zero-length
5434 array member in an inappropriate context. */
5435 if (constructor_type && constructor_fields
5436 && TREE_CODE (constructor_type) == ARRAY_TYPE
5437 && TYPE_DOMAIN (constructor_type)
5438 && ! TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type)))
5440 /* Silently discard empty initializations. The parser will
5441 already have pedwarned for empty brackets. */
5442 if (integer_zerop (constructor_unfilled_index))
5443 constructor_type = NULL_TREE;
5444 else if (! TYPE_SIZE (constructor_type))
5446 if (constructor_depth > 2)
5447 error_init ("initialization of flexible array member in a nested context");
5449 pedwarn_init ("initialization of a flexible array member");
5451 /* We have already issued an error message for the existence
5452 of a flexible array member not at the end of the structure.
5453 Discard the initializer so that we do not abort later. */
5454 if (TREE_CHAIN (constructor_fields) != NULL_TREE)
5455 constructor_type = NULL_TREE;
5458 /* Zero-length arrays are no longer special, so we should no longer
5463 /* Warn when some struct elements are implicitly initialized to zero. */
5466 && TREE_CODE (constructor_type) == RECORD_TYPE
5467 && constructor_unfilled_fields)
5469 /* Do not warn for flexible array members or zero-length arrays. */
5470 while (constructor_unfilled_fields
5471 && (! DECL_SIZE (constructor_unfilled_fields)
5472 || integer_zerop (DECL_SIZE (constructor_unfilled_fields))))
5473 constructor_unfilled_fields = TREE_CHAIN (constructor_unfilled_fields);
5475 /* Do not warn if this level of the initializer uses member
5476 designators; it is likely to be deliberate. */
5477 if (constructor_unfilled_fields && !constructor_designated)
5479 push_member_name (constructor_unfilled_fields);
5480 warning_init ("missing initializer");
5481 RESTORE_SPELLING_DEPTH (constructor_depth);
5485 /* Now output all pending elements. */
5486 constructor_incremental = 1;
5487 output_pending_init_elements (1);
5489 /* Pad out the end of the structure. */
5490 if (p->replacement_value)
5491 /* If this closes a superfluous brace pair,
5492 just pass out the element between them. */
5493 constructor = p->replacement_value;
5494 else if (constructor_type == 0)
5496 else if (TREE_CODE (constructor_type) != RECORD_TYPE
5497 && TREE_CODE (constructor_type) != UNION_TYPE
5498 && TREE_CODE (constructor_type) != ARRAY_TYPE)
5500 /* A nonincremental scalar initializer--just return
5501 the element, after verifying there is just one. */
5502 if (constructor_elements == 0)
5504 if (!constructor_erroneous)
5505 error_init ("empty scalar initializer");
5506 constructor = error_mark_node;
5508 else if (TREE_CHAIN (constructor_elements) != 0)
5510 error_init ("extra elements in scalar initializer");
5511 constructor = TREE_VALUE (constructor_elements);
5514 constructor = TREE_VALUE (constructor_elements);
5518 if (constructor_erroneous)
5519 constructor = error_mark_node;
5522 constructor = build (CONSTRUCTOR, constructor_type, NULL_TREE,
5523 nreverse (constructor_elements));
5524 if (constructor_constant)
5525 TREE_CONSTANT (constructor) = 1;
5526 if (constructor_constant && constructor_simple)
5527 TREE_STATIC (constructor) = 1;
5531 constructor_type = p->type;
5532 constructor_fields = p->fields;
5533 constructor_index = p->index;
5534 constructor_max_index = p->max_index;
5535 constructor_unfilled_index = p->unfilled_index;
5536 constructor_unfilled_fields = p->unfilled_fields;
5537 constructor_bit_index = p->bit_index;
5538 constructor_elements = p->elements;
5539 constructor_constant = p->constant;
5540 constructor_simple = p->simple;
5541 constructor_erroneous = p->erroneous;
5542 constructor_incremental = p->incremental;
5543 constructor_designated = p->designated;
5544 constructor_pending_elts = p->pending_elts;
5545 constructor_depth = p->depth;
5547 constructor_range_stack = p->range_stack;
5548 RESTORE_SPELLING_DEPTH (constructor_depth);
5550 constructor_stack = p->next;
5553 if (constructor == 0)
5555 if (constructor_stack == 0)
5556 return error_mark_node;
5562 /* Common handling for both array range and field name designators.
5563 ARRAY argument is non-zero for array ranges. Returns zero for success. */
5566 set_designator (array)
5570 enum tree_code subcode;
5572 /* Don't die if an entire brace-pair level is superfluous
5573 in the containing level. */
5574 if (constructor_type == 0)
5577 /* If there were errors in this designator list already, bail out silently. */
5578 if (designator_errorneous)
5581 if (!designator_depth)
5583 if (constructor_range_stack)
5586 /* Designator list starts at the level of closest explicit
5588 while (constructor_stack->implicit)
5589 process_init_element (pop_init_level (1));
5590 constructor_designated = 1;
5594 if (constructor_no_implicit)
5596 error_init ("initialization designators may not nest");
5600 if (TREE_CODE (constructor_type) == RECORD_TYPE
5601 || TREE_CODE (constructor_type) == UNION_TYPE)
5603 subtype = TREE_TYPE (constructor_fields);
5604 if (subtype != error_mark_node)
5605 subtype = TYPE_MAIN_VARIANT (subtype);
5607 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5609 subtype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
5614 subcode = TREE_CODE (subtype);
5615 if (array && subcode != ARRAY_TYPE)
5617 error_init ("array index in non-array initializer");
5620 else if (!array && subcode != RECORD_TYPE && subcode != UNION_TYPE)
5622 error_init ("field name not in record or union initializer");
5626 constructor_designated = 1;
5627 push_init_level (2);
5631 /* If there are range designators in designator list, push a new designator
5632 to constructor_range_stack. RANGE_END is end of such stack range or
5633 NULL_TREE if there is no range designator at this level. */
5636 push_range_stack (range_end)
5639 struct constructor_range_stack *p;
5641 p = (struct constructor_range_stack *)
5642 ggc_alloc (sizeof (struct constructor_range_stack));
5643 p->prev = constructor_range_stack;
5645 p->fields = constructor_fields;
5646 p->range_start = constructor_index;
5647 p->index = constructor_index;
5648 p->stack = constructor_stack;
5649 p->range_end = range_end;
5650 if (constructor_range_stack)
5651 constructor_range_stack->next = p;
5652 constructor_range_stack = p;
5655 /* Within an array initializer, specify the next index to be initialized.
5656 FIRST is that index. If LAST is nonzero, then initialize a range
5657 of indices, running from FIRST through LAST. */
5660 set_init_index (first, last)
5663 if (set_designator (1))
5666 designator_errorneous = 1;
5668 while ((TREE_CODE (first) == NOP_EXPR
5669 || TREE_CODE (first) == CONVERT_EXPR
5670 || TREE_CODE (first) == NON_LVALUE_EXPR)
5671 && (TYPE_MODE (TREE_TYPE (first))
5672 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (first, 0)))))
5673 first = TREE_OPERAND (first, 0);
5676 while ((TREE_CODE (last) == NOP_EXPR
5677 || TREE_CODE (last) == CONVERT_EXPR
5678 || TREE_CODE (last) == NON_LVALUE_EXPR)
5679 && (TYPE_MODE (TREE_TYPE (last))
5680 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (last, 0)))))
5681 last = TREE_OPERAND (last, 0);
5683 if (TREE_CODE (first) != INTEGER_CST)
5684 error_init ("nonconstant array index in initializer");
5685 else if (last != 0 && TREE_CODE (last) != INTEGER_CST)
5686 error_init ("nonconstant array index in initializer");
5687 else if (TREE_CODE (constructor_type) != ARRAY_TYPE)
5688 error_init ("array index in non-array initializer");
5689 else if (constructor_max_index
5690 && tree_int_cst_lt (constructor_max_index, first))
5691 error_init ("array index in initializer exceeds array bounds");
5694 constructor_index = convert (bitsizetype, first);
5698 if (tree_int_cst_equal (first, last))
5700 else if (tree_int_cst_lt (last, first))
5702 error_init ("empty index range in initializer");
5707 last = convert (bitsizetype, last);
5708 if (constructor_max_index != 0
5709 && tree_int_cst_lt (constructor_max_index, last))
5711 error_init ("array index range in initializer exceeds array bounds");
5718 designator_errorneous = 0;
5719 if (constructor_range_stack || last)
5720 push_range_stack (last);
5724 /* Within a struct initializer, specify the next field to be initialized. */
5727 set_init_label (fieldname)
5732 if (set_designator (0))
5735 designator_errorneous = 1;
5737 if (TREE_CODE (constructor_type) != RECORD_TYPE
5738 && TREE_CODE (constructor_type) != UNION_TYPE)
5740 error_init ("field name not in record or union initializer");
5744 for (tail = TYPE_FIELDS (constructor_type); tail;
5745 tail = TREE_CHAIN (tail))
5747 if (DECL_NAME (tail) == fieldname)
5752 error ("unknown field `%s' specified in initializer",
5753 IDENTIFIER_POINTER (fieldname));
5756 constructor_fields = tail;
5758 designator_errorneous = 0;
5759 if (constructor_range_stack)
5760 push_range_stack (NULL_TREE);
5764 /* Add a new initializer to the tree of pending initializers. PURPOSE
5765 indentifies the initializer, either array index or field in a structure.
5766 VALUE is the value of that index or field. */
5769 add_pending_init (purpose, value)
5770 tree purpose, value;
5772 struct init_node *p, **q, *r;
5774 q = &constructor_pending_elts;
5777 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5782 if (tree_int_cst_lt (purpose, p->purpose))
5784 else if (tree_int_cst_lt (p->purpose, purpose))
5788 if (TREE_SIDE_EFFECTS (p->value))
5789 warning_init ("initialized field with side-effects overwritten");
5799 bitpos = bit_position (purpose);
5803 if (tree_int_cst_lt (bitpos, bit_position (p->purpose)))
5805 else if (p->purpose != purpose)
5809 if (TREE_SIDE_EFFECTS (p->value))
5810 warning_init ("initialized field with side-effects overwritten");
5817 r = (struct init_node *) ggc_alloc (sizeof (struct init_node));
5818 r->purpose = purpose;
5829 struct init_node *s;
5833 if (p->balance == 0)
5835 else if (p->balance < 0)
5842 p->left->parent = p;
5859 constructor_pending_elts = r;
5864 struct init_node *t = r->right;
5868 r->right->parent = r;
5873 p->left->parent = p;
5876 p->balance = t->balance < 0;
5877 r->balance = -(t->balance > 0);
5892 constructor_pending_elts = t;
5898 /* p->balance == +1; growth of left side balances the node. */
5903 else /* r == p->right */
5905 if (p->balance == 0)
5906 /* Growth propagation from right side. */
5908 else if (p->balance > 0)
5915 p->right->parent = p;
5932 constructor_pending_elts = r;
5934 else /* r->balance == -1 */
5937 struct init_node *t = r->left;
5941 r->left->parent = r;
5946 p->right->parent = p;
5949 r->balance = (t->balance < 0);
5950 p->balance = -(t->balance > 0);
5965 constructor_pending_elts = t;
5971 /* p->balance == -1; growth of right side balances the node. */
5982 /* Build AVL tree from a sorted chain. */
5985 set_nonincremental_init ()
5989 if (TREE_CODE (constructor_type) != RECORD_TYPE
5990 && TREE_CODE (constructor_type) != ARRAY_TYPE)
5993 for (chain = constructor_elements; chain; chain = TREE_CHAIN (chain))
5994 add_pending_init (TREE_PURPOSE (chain), TREE_VALUE (chain));
5995 constructor_elements = 0;
5996 if (TREE_CODE (constructor_type) == RECORD_TYPE)
5998 constructor_unfilled_fields = TYPE_FIELDS (constructor_type);
5999 /* Skip any nameless bit fields at the beginning. */
6000 while (constructor_unfilled_fields != 0
6001 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
6002 && DECL_NAME (constructor_unfilled_fields) == 0)
6003 constructor_unfilled_fields = TREE_CHAIN (constructor_unfilled_fields);
6006 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6008 if (TYPE_DOMAIN (constructor_type))
6009 constructor_unfilled_index
6010 = convert (bitsizetype,
6011 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
6013 constructor_unfilled_index = bitsize_zero_node;
6015 constructor_incremental = 0;
6018 /* Build AVL tree from a string constant. */
6021 set_nonincremental_init_from_string (str)
6024 tree value, purpose, type;
6025 HOST_WIDE_INT val[2];
6026 const char *p, *end;
6027 int byte, wchar_bytes, charwidth, bitpos;
6029 if (TREE_CODE (constructor_type) != ARRAY_TYPE)
6032 if (TYPE_PRECISION (TREE_TYPE (TREE_TYPE (str)))
6033 == TYPE_PRECISION (char_type_node))
6035 else if (TYPE_PRECISION (TREE_TYPE (TREE_TYPE (str)))
6036 == TYPE_PRECISION (wchar_type_node))
6037 wchar_bytes = TYPE_PRECISION (wchar_type_node) / BITS_PER_UNIT;
6041 charwidth = TYPE_PRECISION (char_type_node);
6042 type = TREE_TYPE (constructor_type);
6043 p = TREE_STRING_POINTER (str);
6044 end = p + TREE_STRING_LENGTH (str);
6046 for (purpose = bitsize_zero_node;
6047 p < end && !tree_int_cst_lt (constructor_max_index, purpose);
6048 purpose = size_binop (PLUS_EXPR, purpose, bitsize_one_node))
6050 if (wchar_bytes == 1)
6052 val[1] = (unsigned char) *p++;
6059 for (byte = 0; byte < wchar_bytes; byte++)
6061 if (BYTES_BIG_ENDIAN)
6062 bitpos = (wchar_bytes - byte - 1) * charwidth;
6064 bitpos = byte * charwidth;
6065 val[bitpos < HOST_BITS_PER_WIDE_INT]
6066 |= ((unsigned HOST_WIDE_INT) ((unsigned char) *p++))
6067 << (bitpos % HOST_BITS_PER_WIDE_INT);
6071 if (!TREE_UNSIGNED (type))
6073 bitpos = ((wchar_bytes - 1) * charwidth) + HOST_BITS_PER_CHAR;
6074 if (bitpos < HOST_BITS_PER_WIDE_INT)
6076 if (val[1] & (((HOST_WIDE_INT) 1) << (bitpos - 1)))
6078 val[1] |= ((HOST_WIDE_INT) -1) << bitpos;
6082 else if (bitpos == HOST_BITS_PER_WIDE_INT)
6087 else if (val[0] & (((HOST_WIDE_INT) 1)
6088 << (bitpos - 1 - HOST_BITS_PER_WIDE_INT)))
6089 val[0] |= ((HOST_WIDE_INT) -1)
6090 << (bitpos - HOST_BITS_PER_WIDE_INT);
6093 value = build_int_2 (val[1], val[0]);
6094 TREE_TYPE (value) = type;
6095 add_pending_init (purpose, value);
6098 constructor_incremental = 0;
6101 /* Return value of FIELD in pending initializer or zero if the field was
6102 not initialized yet. */
6105 find_init_member (field)
6108 struct init_node *p;
6110 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6112 if (constructor_incremental
6113 && tree_int_cst_lt (field, constructor_unfilled_index))
6114 set_nonincremental_init ();
6116 p = constructor_pending_elts;
6119 if (tree_int_cst_lt (field, p->purpose))
6121 else if (tree_int_cst_lt (p->purpose, field))
6127 else if (TREE_CODE (constructor_type) == RECORD_TYPE)
6129 tree bitpos = bit_position (field);
6131 if (constructor_incremental
6132 && (!constructor_unfilled_fields
6133 || tree_int_cst_lt (bitpos,
6134 bit_position (constructor_unfilled_fields))))
6135 set_nonincremental_init ();
6137 p = constructor_pending_elts;
6140 if (field == p->purpose)
6142 else if (tree_int_cst_lt (bitpos, bit_position (p->purpose)))
6148 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6150 if (constructor_elements
6151 && TREE_PURPOSE (constructor_elements) == field)
6152 return TREE_VALUE (constructor_elements);
6157 /* "Output" the next constructor element.
6158 At top level, really output it to assembler code now.
6159 Otherwise, collect it in a list from which we will make a CONSTRUCTOR.
6160 TYPE is the data type that the containing data type wants here.
6161 FIELD is the field (a FIELD_DECL) or the index that this element fills.
6163 PENDING if non-nil means output pending elements that belong
6164 right after this element. (PENDING is normally 1;
6165 it is 0 while outputting pending elements, to avoid recursion.) */
6168 output_init_element (value, type, field, pending)
6169 tree value, type, field;
6172 if (TREE_CODE (TREE_TYPE (value)) == FUNCTION_TYPE
6173 || (TREE_CODE (TREE_TYPE (value)) == ARRAY_TYPE
6174 && !(TREE_CODE (value) == STRING_CST
6175 && TREE_CODE (type) == ARRAY_TYPE
6176 && TREE_CODE (TREE_TYPE (type)) == INTEGER_TYPE)
6177 && !comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (value)),
6178 TYPE_MAIN_VARIANT (type))))
6179 value = default_conversion (value);
6181 if (value == error_mark_node)
6182 constructor_erroneous = 1;
6183 else if (!TREE_CONSTANT (value))
6184 constructor_constant = 0;
6185 else if (initializer_constant_valid_p (value, TREE_TYPE (value)) == 0
6186 || ((TREE_CODE (constructor_type) == RECORD_TYPE
6187 || TREE_CODE (constructor_type) == UNION_TYPE)
6188 && DECL_C_BIT_FIELD (field)
6189 && TREE_CODE (value) != INTEGER_CST))
6190 constructor_simple = 0;
6192 if (require_constant_value && ! TREE_CONSTANT (value))
6194 error_init ("initializer element is not constant");
6195 value = error_mark_node;
6197 else if (require_constant_elements
6198 && initializer_constant_valid_p (value, TREE_TYPE (value)) == 0)
6199 pedwarn ("initializer element is not computable at load time");
6201 /* If this field is empty (and not at the end of structure),
6202 don't do anything other than checking the initializer. */
6204 && (TREE_TYPE (field) == error_mark_node
6205 || (COMPLETE_TYPE_P (TREE_TYPE (field))
6206 && integer_zerop (TYPE_SIZE (TREE_TYPE (field)))
6207 && (TREE_CODE (constructor_type) == ARRAY_TYPE
6208 || TREE_CHAIN (field)))))
6211 if (value == error_mark_node)
6213 constructor_erroneous = 1;
6217 /* If this element doesn't come next in sequence,
6218 put it on constructor_pending_elts. */
6219 if (TREE_CODE (constructor_type) == ARRAY_TYPE
6220 && (!constructor_incremental
6221 || !tree_int_cst_equal (field, constructor_unfilled_index)))
6223 if (constructor_incremental
6224 && tree_int_cst_lt (field, constructor_unfilled_index))
6225 set_nonincremental_init ();
6227 add_pending_init (field,
6228 digest_init (type, value, require_constant_value,
6229 require_constant_elements));
6232 else if (TREE_CODE (constructor_type) == RECORD_TYPE
6233 && (!constructor_incremental
6234 || field != constructor_unfilled_fields))
6236 /* We do this for records but not for unions. In a union,
6237 no matter which field is specified, it can be initialized
6238 right away since it starts at the beginning of the union. */
6239 if (constructor_incremental)
6241 if (!constructor_unfilled_fields)
6242 set_nonincremental_init ();
6245 tree bitpos, unfillpos;
6247 bitpos = bit_position (field);
6248 unfillpos = bit_position (constructor_unfilled_fields);
6250 if (tree_int_cst_lt (bitpos, unfillpos))
6251 set_nonincremental_init ();
6255 add_pending_init (field,
6256 digest_init (type, value, require_constant_value,
6257 require_constant_elements));
6260 else if (TREE_CODE (constructor_type) == UNION_TYPE
6261 && constructor_elements)
6263 if (TREE_SIDE_EFFECTS (TREE_VALUE (constructor_elements)))
6264 warning_init ("initialized field with side-effects overwritten");
6266 /* We can have just one union field set. */
6267 constructor_elements = 0;
6270 /* Otherwise, output this element either to
6271 constructor_elements or to the assembler file. */
6273 if (field && TREE_CODE (field) == INTEGER_CST)
6274 field = copy_node (field);
6275 constructor_elements
6276 = tree_cons (field, digest_init (type, value,
6277 require_constant_value,
6278 require_constant_elements),
6279 constructor_elements);
6281 /* Advance the variable that indicates sequential elements output. */
6282 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6283 constructor_unfilled_index
6284 = size_binop (PLUS_EXPR, constructor_unfilled_index,
6286 else if (TREE_CODE (constructor_type) == RECORD_TYPE)
6288 constructor_unfilled_fields
6289 = TREE_CHAIN (constructor_unfilled_fields);
6291 /* Skip any nameless bit fields. */
6292 while (constructor_unfilled_fields != 0
6293 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
6294 && DECL_NAME (constructor_unfilled_fields) == 0)
6295 constructor_unfilled_fields =
6296 TREE_CHAIN (constructor_unfilled_fields);
6298 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6299 constructor_unfilled_fields = 0;
6301 /* Now output any pending elements which have become next. */
6303 output_pending_init_elements (0);
6306 /* Output any pending elements which have become next.
6307 As we output elements, constructor_unfilled_{fields,index}
6308 advances, which may cause other elements to become next;
6309 if so, they too are output.
6311 If ALL is 0, we return when there are
6312 no more pending elements to output now.
6314 If ALL is 1, we output space as necessary so that
6315 we can output all the pending elements. */
6318 output_pending_init_elements (all)
6321 struct init_node *elt = constructor_pending_elts;
6326 /* Look thru the whole pending tree.
6327 If we find an element that should be output now,
6328 output it. Otherwise, set NEXT to the element
6329 that comes first among those still pending. */
6334 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6336 if (tree_int_cst_equal (elt->purpose,
6337 constructor_unfilled_index))
6338 output_init_element (elt->value,
6339 TREE_TYPE (constructor_type),
6340 constructor_unfilled_index, 0);
6341 else if (tree_int_cst_lt (constructor_unfilled_index,
6344 /* Advance to the next smaller node. */
6349 /* We have reached the smallest node bigger than the
6350 current unfilled index. Fill the space first. */
6351 next = elt->purpose;
6357 /* Advance to the next bigger node. */
6362 /* We have reached the biggest node in a subtree. Find
6363 the parent of it, which is the next bigger node. */
6364 while (elt->parent && elt->parent->right == elt)
6367 if (elt && tree_int_cst_lt (constructor_unfilled_index,
6370 next = elt->purpose;
6376 else if (TREE_CODE (constructor_type) == RECORD_TYPE
6377 || TREE_CODE (constructor_type) == UNION_TYPE)
6379 tree ctor_unfilled_bitpos, elt_bitpos;
6381 /* If the current record is complete we are done. */
6382 if (constructor_unfilled_fields == 0)
6385 ctor_unfilled_bitpos = bit_position (constructor_unfilled_fields);
6386 elt_bitpos = bit_position (elt->purpose);
6387 /* We can't compare fields here because there might be empty
6388 fields in between. */
6389 if (tree_int_cst_equal (elt_bitpos, ctor_unfilled_bitpos))
6391 constructor_unfilled_fields = elt->purpose;
6392 output_init_element (elt->value, TREE_TYPE (elt->purpose),
6395 else if (tree_int_cst_lt (ctor_unfilled_bitpos, elt_bitpos))
6397 /* Advance to the next smaller node. */
6402 /* We have reached the smallest node bigger than the
6403 current unfilled field. Fill the space first. */
6404 next = elt->purpose;
6410 /* Advance to the next bigger node. */
6415 /* We have reached the biggest node in a subtree. Find
6416 the parent of it, which is the next bigger node. */
6417 while (elt->parent && elt->parent->right == elt)
6421 && (tree_int_cst_lt (ctor_unfilled_bitpos,
6422 bit_position (elt->purpose))))
6424 next = elt->purpose;
6432 /* Ordinarily return, but not if we want to output all
6433 and there are elements left. */
6434 if (! (all && next != 0))
6437 /* If it's not incremental, just skip over the gap, so that after
6438 jumping to retry we will output the next successive element. */
6439 if (TREE_CODE (constructor_type) == RECORD_TYPE
6440 || TREE_CODE (constructor_type) == UNION_TYPE)
6441 constructor_unfilled_fields = next;
6442 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6443 constructor_unfilled_index = next;
6445 /* ELT now points to the node in the pending tree with the next
6446 initializer to output. */
6450 /* Add one non-braced element to the current constructor level.
6451 This adjusts the current position within the constructor's type.
6452 This may also start or terminate implicit levels
6453 to handle a partly-braced initializer.
6455 Once this has found the correct level for the new element,
6456 it calls output_init_element. */
6459 process_init_element (value)
6462 tree orig_value = value;
6463 int string_flag = value != 0 && TREE_CODE (value) == STRING_CST;
6465 designator_depth = 0;
6466 designator_errorneous = 0;
6468 /* Handle superfluous braces around string cst as in
6469 char x[] = {"foo"}; */
6472 && TREE_CODE (constructor_type) == ARRAY_TYPE
6473 && TREE_CODE (TREE_TYPE (constructor_type)) == INTEGER_TYPE
6474 && integer_zerop (constructor_unfilled_index))
6476 if (constructor_stack->replacement_value)
6477 error_init ("excess elements in char array initializer");
6478 constructor_stack->replacement_value = value;
6482 if (constructor_stack->replacement_value != 0)
6484 error_init ("excess elements in struct initializer");
6488 /* Ignore elements of a brace group if it is entirely superfluous
6489 and has already been diagnosed. */
6490 if (constructor_type == 0)
6493 /* If we've exhausted any levels that didn't have braces,
6495 while (constructor_stack->implicit)
6497 if ((TREE_CODE (constructor_type) == RECORD_TYPE
6498 || TREE_CODE (constructor_type) == UNION_TYPE)
6499 && constructor_fields == 0)
6500 process_init_element (pop_init_level (1));
6501 else if (TREE_CODE (constructor_type) == ARRAY_TYPE
6502 && (constructor_max_index == 0
6503 || tree_int_cst_lt (constructor_max_index,
6504 constructor_index)))
6505 process_init_element (pop_init_level (1));
6510 /* In the case of [LO ... HI] = VALUE, only evaluate VALUE once. */
6511 if (constructor_range_stack)
6512 value = save_expr (value);
6516 if (TREE_CODE (constructor_type) == RECORD_TYPE)
6519 enum tree_code fieldcode;
6521 if (constructor_fields == 0)
6523 pedwarn_init ("excess elements in struct initializer");
6527 fieldtype = TREE_TYPE (constructor_fields);
6528 if (fieldtype != error_mark_node)
6529 fieldtype = TYPE_MAIN_VARIANT (fieldtype);
6530 fieldcode = TREE_CODE (fieldtype);
6532 /* Accept a string constant to initialize a subarray. */
6534 && fieldcode == ARRAY_TYPE
6535 && TREE_CODE (TREE_TYPE (fieldtype)) == INTEGER_TYPE
6538 /* Otherwise, if we have come to a subaggregate,
6539 and we don't have an element of its type, push into it. */
6540 else if (value != 0 && !constructor_no_implicit
6541 && value != error_mark_node
6542 && TYPE_MAIN_VARIANT (TREE_TYPE (value)) != fieldtype
6543 && (fieldcode == RECORD_TYPE || fieldcode == ARRAY_TYPE
6544 || fieldcode == UNION_TYPE))
6546 push_init_level (1);
6552 push_member_name (constructor_fields);
6553 output_init_element (value, fieldtype, constructor_fields, 1);
6554 RESTORE_SPELLING_DEPTH (constructor_depth);
6557 /* Do the bookkeeping for an element that was
6558 directly output as a constructor. */
6560 /* For a record, keep track of end position of last field. */
6561 if (DECL_SIZE (constructor_fields))
6562 constructor_bit_index
6563 = size_binop (PLUS_EXPR,
6564 bit_position (constructor_fields),
6565 DECL_SIZE (constructor_fields));
6567 constructor_unfilled_fields = TREE_CHAIN (constructor_fields);
6568 /* Skip any nameless bit fields. */
6569 while (constructor_unfilled_fields != 0
6570 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
6571 && DECL_NAME (constructor_unfilled_fields) == 0)
6572 constructor_unfilled_fields =
6573 TREE_CHAIN (constructor_unfilled_fields);
6576 constructor_fields = TREE_CHAIN (constructor_fields);
6577 /* Skip any nameless bit fields at the beginning. */
6578 while (constructor_fields != 0
6579 && DECL_C_BIT_FIELD (constructor_fields)
6580 && DECL_NAME (constructor_fields) == 0)
6581 constructor_fields = TREE_CHAIN (constructor_fields);
6583 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6586 enum tree_code fieldcode;
6588 if (constructor_fields == 0)
6590 pedwarn_init ("excess elements in union initializer");
6594 fieldtype = TREE_TYPE (constructor_fields);
6595 if (fieldtype != error_mark_node)
6596 fieldtype = TYPE_MAIN_VARIANT (fieldtype);
6597 fieldcode = TREE_CODE (fieldtype);
6599 /* Warn that traditional C rejects initialization of unions.
6600 We skip the warning if the value is zero. This is done
6601 under the assumption that the zero initializer in user
6602 code appears conditioned on e.g. __STDC__ to avoid
6603 "missing initializer" warnings and relies on default
6604 initialization to zero in the traditional C case.
6605 We also skip the warning if the initializer is designated,
6606 again on the assumption that this must be conditional on
6607 __STDC__ anyway (and we've already complained about the
6608 member-designator already). */
6609 if (warn_traditional && !in_system_header && !constructor_designated
6610 && !(value && (integer_zerop (value) || real_zerop (value))))
6611 warning ("traditional C rejects initialization of unions");
6613 /* Accept a string constant to initialize a subarray. */
6615 && fieldcode == ARRAY_TYPE
6616 && TREE_CODE (TREE_TYPE (fieldtype)) == INTEGER_TYPE
6619 /* Otherwise, if we have come to a subaggregate,
6620 and we don't have an element of its type, push into it. */
6621 else if (value != 0 && !constructor_no_implicit
6622 && value != error_mark_node
6623 && TYPE_MAIN_VARIANT (TREE_TYPE (value)) != fieldtype
6624 && (fieldcode == RECORD_TYPE || fieldcode == ARRAY_TYPE
6625 || fieldcode == UNION_TYPE))
6627 push_init_level (1);
6633 push_member_name (constructor_fields);
6634 output_init_element (value, fieldtype, constructor_fields, 1);
6635 RESTORE_SPELLING_DEPTH (constructor_depth);
6638 /* Do the bookkeeping for an element that was
6639 directly output as a constructor. */
6641 constructor_bit_index = DECL_SIZE (constructor_fields);
6642 constructor_unfilled_fields = TREE_CHAIN (constructor_fields);
6645 constructor_fields = 0;
6647 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6649 tree elttype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
6650 enum tree_code eltcode = TREE_CODE (elttype);
6652 /* Accept a string constant to initialize a subarray. */
6654 && eltcode == ARRAY_TYPE
6655 && TREE_CODE (TREE_TYPE (elttype)) == INTEGER_TYPE
6658 /* Otherwise, if we have come to a subaggregate,
6659 and we don't have an element of its type, push into it. */
6660 else if (value != 0 && !constructor_no_implicit
6661 && value != error_mark_node
6662 && TYPE_MAIN_VARIANT (TREE_TYPE (value)) != elttype
6663 && (eltcode == RECORD_TYPE || eltcode == ARRAY_TYPE
6664 || eltcode == UNION_TYPE))
6666 push_init_level (1);
6670 if (constructor_max_index != 0
6671 && (tree_int_cst_lt (constructor_max_index, constructor_index)
6672 || integer_all_onesp (constructor_max_index)))
6674 pedwarn_init ("excess elements in array initializer");
6678 /* Now output the actual element. */
6681 push_array_bounds (tree_low_cst (constructor_index, 0));
6682 output_init_element (value, elttype, constructor_index, 1);
6683 RESTORE_SPELLING_DEPTH (constructor_depth);
6687 = size_binop (PLUS_EXPR, constructor_index, bitsize_one_node);
6690 /* If we are doing the bookkeeping for an element that was
6691 directly output as a constructor, we must update
6692 constructor_unfilled_index. */
6693 constructor_unfilled_index = constructor_index;
6696 /* Handle the sole element allowed in a braced initializer
6697 for a scalar variable. */
6698 else if (constructor_fields == 0)
6700 pedwarn_init ("excess elements in scalar initializer");
6706 output_init_element (value, constructor_type, NULL_TREE, 1);
6707 constructor_fields = 0;
6710 /* Handle range initializers either at this level or anywhere higher
6711 in the designator stack. */
6712 if (constructor_range_stack)
6714 struct constructor_range_stack *p, *range_stack;
6717 range_stack = constructor_range_stack;
6718 constructor_range_stack = 0;
6719 while (constructor_stack != range_stack->stack)
6721 if (!constructor_stack->implicit)
6723 process_init_element (pop_init_level (1));
6725 for (p = range_stack;
6726 !p->range_end || tree_int_cst_equal (p->index, p->range_end);
6729 if (!constructor_stack->implicit)
6731 process_init_element (pop_init_level (1));
6734 p->index = size_binop (PLUS_EXPR, p->index, bitsize_one_node);
6735 if (tree_int_cst_equal (p->index, p->range_end) && !p->prev)
6740 constructor_index = p->index;
6741 constructor_fields = p->fields;
6742 if (finish && p->range_end && p->index == p->range_start)
6750 push_init_level (2);
6751 p->stack = constructor_stack;
6752 if (p->range_end && tree_int_cst_equal (p->index, p->range_end))
6753 p->index = p->range_start;
6757 constructor_range_stack = range_stack;
6764 constructor_range_stack = 0;
6767 /* Build a simple asm-statement, from one string literal. */
6769 simple_asm_stmt (expr)
6774 if (TREE_CODE (expr) == ADDR_EXPR)
6775 expr = TREE_OPERAND (expr, 0);
6777 if (TREE_CODE (expr) == STRING_CST)
6781 if (TREE_CHAIN (expr))
6782 expr = combine_strings (expr);
6783 stmt = add_stmt (build_stmt (ASM_STMT, NULL_TREE, expr,
6784 NULL_TREE, NULL_TREE,
6786 ASM_INPUT_P (stmt) = 1;
6790 error ("argument of `asm' is not a constant string");
6794 /* Build an asm-statement, whose components are a CV_QUALIFIER, a
6795 STRING, some OUTPUTS, some INPUTS, and some CLOBBERS. */
6798 build_asm_stmt (cv_qualifier, string, outputs, inputs, clobbers)
6807 if (TREE_CHAIN (string))
6808 string = combine_strings (string);
6809 if (TREE_CODE (string) != STRING_CST)
6811 error ("asm template is not a string constant");
6815 if (cv_qualifier != NULL_TREE
6816 && cv_qualifier != ridpointers[(int) RID_VOLATILE])
6818 warning ("%s qualifier ignored on asm",
6819 IDENTIFIER_POINTER (cv_qualifier));
6820 cv_qualifier = NULL_TREE;
6823 /* We can remove output conversions that change the type,
6824 but not the mode. */
6825 for (tail = outputs; tail; tail = TREE_CHAIN (tail))
6827 tree output = TREE_VALUE (tail);
6829 STRIP_NOPS (output);
6830 TREE_VALUE (tail) = output;
6832 /* Allow conversions as LHS here. build_modify_expr as called below
6833 will do the right thing with them. */
6834 while (TREE_CODE (output) == NOP_EXPR
6835 || TREE_CODE (output) == CONVERT_EXPR
6836 || TREE_CODE (output) == FLOAT_EXPR
6837 || TREE_CODE (output) == FIX_TRUNC_EXPR
6838 || TREE_CODE (output) == FIX_FLOOR_EXPR
6839 || TREE_CODE (output) == FIX_ROUND_EXPR
6840 || TREE_CODE (output) == FIX_CEIL_EXPR)
6841 output = TREE_OPERAND (output, 0);
6843 lvalue_or_else (TREE_VALUE (tail), "invalid lvalue in asm statement");
6846 /* Remove output conversions that change the type but not the mode. */
6847 for (tail = outputs; tail; tail = TREE_CHAIN (tail))
6849 tree output = TREE_VALUE (tail);
6850 STRIP_NOPS (output);
6851 TREE_VALUE (tail) = output;
6854 /* Perform default conversions on array and function inputs.
6855 Don't do this for other types as it would screw up operands
6856 expected to be in memory. */
6857 for (tail = inputs; tail; tail = TREE_CHAIN (tail))
6858 if (TREE_CODE (TREE_TYPE (TREE_VALUE (tail))) == ARRAY_TYPE
6859 || TREE_CODE (TREE_TYPE (TREE_VALUE (tail))) == FUNCTION_TYPE)
6860 TREE_VALUE (tail) = default_conversion (TREE_VALUE (tail));
6862 return add_stmt (build_stmt (ASM_STMT, cv_qualifier, string,
6863 outputs, inputs, clobbers));
6866 /* Expand an ASM statement with operands, handling output operands
6867 that are not variables or INDIRECT_REFS by transforming such
6868 cases into cases that expand_asm_operands can handle.
6870 Arguments are same as for expand_asm_operands. */
6873 c_expand_asm_operands (string, outputs, inputs, clobbers, vol, filename, line)
6874 tree string, outputs, inputs, clobbers;
6876 const char *filename;
6879 int noutputs = list_length (outputs);
6881 /* o[I] is the place that output number I should be written. */
6882 tree *o = (tree *) alloca (noutputs * sizeof (tree));
6885 /* Record the contents of OUTPUTS before it is modified. */
6886 for (i = 0, tail = outputs; tail; tail = TREE_CHAIN (tail), i++)
6887 o[i] = TREE_VALUE (tail);
6889 /* Generate the ASM_OPERANDS insn; store into the TREE_VALUEs of
6890 OUTPUTS some trees for where the values were actually stored. */
6891 expand_asm_operands (string, outputs, inputs, clobbers, vol, filename, line);
6893 /* Copy all the intermediate outputs into the specified outputs. */
6894 for (i = 0, tail = outputs; tail; tail = TREE_CHAIN (tail), i++)
6896 if (o[i] != TREE_VALUE (tail))
6898 expand_expr (build_modify_expr (o[i], NOP_EXPR, TREE_VALUE (tail)),
6899 NULL_RTX, VOIDmode, EXPAND_NORMAL);
6902 /* Restore the original value so that it's correct the next
6903 time we expand this function. */
6904 TREE_VALUE (tail) = o[i];
6906 /* Detect modification of read-only values.
6907 (Otherwise done by build_modify_expr.) */
6910 tree type = TREE_TYPE (o[i]);
6911 if (TREE_READONLY (o[i])
6912 || TYPE_READONLY (type)
6913 || ((TREE_CODE (type) == RECORD_TYPE
6914 || TREE_CODE (type) == UNION_TYPE)
6915 && C_TYPE_FIELDS_READONLY (type)))
6916 readonly_warning (o[i], "modification by `asm'");
6920 /* Those MODIFY_EXPRs could do autoincrements. */
6924 /* Expand a C `return' statement.
6925 RETVAL is the expression for what to return,
6926 or a null pointer for `return;' with no value. */
6929 c_expand_return (retval)
6932 tree valtype = TREE_TYPE (TREE_TYPE (current_function_decl));
6934 if (TREE_THIS_VOLATILE (current_function_decl))
6935 warning ("function declared `noreturn' has a `return' statement");
6939 current_function_returns_null = 1;
6940 if ((warn_return_type || flag_isoc99)
6941 && valtype != 0 && TREE_CODE (valtype) != VOID_TYPE)
6942 pedwarn_c99 ("`return' with no value, in function returning non-void");
6944 else if (valtype == 0 || TREE_CODE (valtype) == VOID_TYPE)
6946 current_function_returns_null = 1;
6947 if (pedantic || TREE_CODE (TREE_TYPE (retval)) != VOID_TYPE)
6948 pedwarn ("`return' with a value, in function returning void");
6952 tree t = convert_for_assignment (valtype, retval, _("return"),
6953 NULL_TREE, NULL_TREE, 0);
6954 tree res = DECL_RESULT (current_function_decl);
6957 if (t == error_mark_node)
6960 inner = t = convert (TREE_TYPE (res), t);
6962 /* Strip any conversions, additions, and subtractions, and see if
6963 we are returning the address of a local variable. Warn if so. */
6966 switch (TREE_CODE (inner))
6968 case NOP_EXPR: case NON_LVALUE_EXPR: case CONVERT_EXPR:
6970 inner = TREE_OPERAND (inner, 0);
6974 /* If the second operand of the MINUS_EXPR has a pointer
6975 type (or is converted from it), this may be valid, so
6976 don't give a warning. */
6978 tree op1 = TREE_OPERAND (inner, 1);
6980 while (! POINTER_TYPE_P (TREE_TYPE (op1))
6981 && (TREE_CODE (op1) == NOP_EXPR
6982 || TREE_CODE (op1) == NON_LVALUE_EXPR
6983 || TREE_CODE (op1) == CONVERT_EXPR))
6984 op1 = TREE_OPERAND (op1, 0);
6986 if (POINTER_TYPE_P (TREE_TYPE (op1)))
6989 inner = TREE_OPERAND (inner, 0);
6994 inner = TREE_OPERAND (inner, 0);
6996 while (TREE_CODE_CLASS (TREE_CODE (inner)) == 'r')
6997 inner = TREE_OPERAND (inner, 0);
6999 if (TREE_CODE (inner) == VAR_DECL
7000 && ! DECL_EXTERNAL (inner)
7001 && ! TREE_STATIC (inner)
7002 && DECL_CONTEXT (inner) == current_function_decl)
7003 warning ("function returns address of local variable");
7013 retval = build (MODIFY_EXPR, TREE_TYPE (res), res, t);
7014 current_function_returns_value = 1;
7017 return add_stmt (build_return_stmt (retval));
7021 /* The SWITCH_STMT being built. */
7023 /* A splay-tree mapping the low element of a case range to the high
7024 element, or NULL_TREE if there is no high element. Used to
7025 determine whether or not a new case label duplicates an old case
7026 label. We need a tree, rather than simply a hash table, because
7027 of the GNU case range extension. */
7029 /* The next node on the stack. */
7030 struct c_switch *next;
7033 /* A stack of the currently active switch statements. The innermost
7034 switch statement is on the top of the stack. There is no need to
7035 mark the stack for garbage collection because it is only active
7036 during the processing of the body of a function, and we never
7037 collect at that point. */
7039 static struct c_switch *switch_stack;
7041 /* Start a C switch statement, testing expression EXP. Return the new
7048 enum tree_code code;
7050 struct c_switch *cs;
7052 if (exp != error_mark_node)
7054 code = TREE_CODE (TREE_TYPE (exp));
7055 type = TREE_TYPE (exp);
7057 if (! INTEGRAL_TYPE_P (type)
7058 && code != ERROR_MARK)
7060 error ("switch quantity not an integer");
7061 exp = integer_zero_node;
7066 type = TYPE_MAIN_VARIANT (TREE_TYPE (exp));
7068 if (warn_traditional && !in_system_header
7069 && (type == long_integer_type_node
7070 || type == long_unsigned_type_node))
7071 warning ("`long' switch expression not converted to `int' in ISO C");
7073 exp = default_conversion (exp);
7074 type = TREE_TYPE (exp);
7075 index = get_unwidened (exp, NULL_TREE);
7076 /* We can't strip a conversion from a signed type to an
7077 unsigned, because if we did, int_fits_type_p would do the
7078 wrong thing when checking case values for being in range,
7079 and it's too hard to do the right thing. */
7080 if (TREE_UNSIGNED (TREE_TYPE (exp))
7081 == TREE_UNSIGNED (TREE_TYPE (index)))
7086 /* Add this new SWITCH_STMT to the stack. */
7087 cs = (struct c_switch *) xmalloc (sizeof (*cs));
7088 cs->switch_stmt = build_stmt (SWITCH_STMT, exp, NULL_TREE, NULL_TREE);
7089 cs->cases = splay_tree_new (case_compare, NULL, NULL);
7090 cs->next = switch_stack;
7093 return add_stmt (switch_stack->switch_stmt);
7096 /* Process a case label. */
7099 do_case (low_value, high_value)
7103 tree label = NULL_TREE;
7107 label = c_add_case_label (switch_stack->cases,
7108 SWITCH_COND (switch_stack->switch_stmt),
7109 low_value, high_value);
7110 if (label == error_mark_node)
7114 error ("case label not within a switch statement");
7116 error ("`default' label not within a switch statement");
7121 /* Finish the switch statement. */
7126 struct c_switch *cs = switch_stack;
7128 RECHAIN_STMTS (cs->switch_stmt, SWITCH_BODY (cs->switch_stmt));
7130 /* Pop the stack. */
7131 switch_stack = switch_stack->next;
7132 splay_tree_delete (cs->cases);