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 == TREE_TYPE (val))
1655 /* No warning if function asks for enum
1656 and the actual arg is that enum type. */
1658 else if (formal_prec != TYPE_PRECISION (type1))
1659 warn_for_assignment ("%s with different width due to prototype", (char *) 0, name, parmnum + 1);
1660 else if (TREE_UNSIGNED (type) == TREE_UNSIGNED (type1))
1662 /* Don't complain if the formal parameter type
1663 is an enum, because we can't tell now whether
1664 the value was an enum--even the same enum. */
1665 else if (TREE_CODE (type) == ENUMERAL_TYPE)
1667 else if (TREE_CODE (val) == INTEGER_CST
1668 && int_fits_type_p (val, type))
1669 /* Change in signedness doesn't matter
1670 if a constant value is unaffected. */
1672 /* Likewise for a constant in a NOP_EXPR. */
1673 else if (TREE_CODE (val) == NOP_EXPR
1674 && TREE_CODE (TREE_OPERAND (val, 0)) == INTEGER_CST
1675 && int_fits_type_p (TREE_OPERAND (val, 0), type))
1677 #if 0 /* We never get such tree structure here. */
1678 else if (TREE_CODE (TREE_TYPE (val)) == ENUMERAL_TYPE
1679 && int_fits_type_p (TYPE_MIN_VALUE (TREE_TYPE (val)), type)
1680 && int_fits_type_p (TYPE_MAX_VALUE (TREE_TYPE (val)), type))
1681 /* Change in signedness doesn't matter
1682 if an enum value is unaffected. */
1685 /* If the value is extended from a narrower
1686 unsigned type, it doesn't matter whether we
1687 pass it as signed or unsigned; the value
1688 certainly is the same either way. */
1689 else if (TYPE_PRECISION (TREE_TYPE (val)) < TYPE_PRECISION (type)
1690 && TREE_UNSIGNED (TREE_TYPE (val)))
1692 else if (TREE_UNSIGNED (type))
1693 warn_for_assignment ("%s as unsigned due to prototype", (char *) 0, name, parmnum + 1);
1695 warn_for_assignment ("%s as signed due to prototype", (char *) 0, name, parmnum + 1);
1699 parmval = convert_for_assignment (type, val,
1700 (char *) 0, /* arg passing */
1701 fundecl, name, parmnum + 1);
1703 if (PROMOTE_PROTOTYPES
1704 && INTEGRAL_TYPE_P (type)
1705 && (TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node)))
1706 parmval = default_conversion (parmval);
1708 result = tree_cons (NULL_TREE, parmval, result);
1710 else if (TREE_CODE (TREE_TYPE (val)) == REAL_TYPE
1711 && (TYPE_PRECISION (TREE_TYPE (val))
1712 < TYPE_PRECISION (double_type_node)))
1713 /* Convert `float' to `double'. */
1714 result = tree_cons (NULL_TREE, convert (double_type_node, val), result);
1716 /* Convert `short' and `char' to full-size `int'. */
1717 result = tree_cons (NULL_TREE, default_conversion (val), result);
1720 typetail = TREE_CHAIN (typetail);
1723 if (typetail != 0 && TREE_VALUE (typetail) != void_type_node)
1726 error ("too few arguments to function `%s'",
1727 IDENTIFIER_POINTER (name));
1729 error ("too few arguments to function");
1732 return nreverse (result);
1735 /* This is the entry point used by the parser
1736 for binary operators in the input.
1737 In addition to constructing the expression,
1738 we check for operands that were written with other binary operators
1739 in a way that is likely to confuse the user. */
1742 parser_build_binary_op (code, arg1, arg2)
1743 enum tree_code code;
1746 tree result = build_binary_op (code, arg1, arg2, 1);
1749 char class1 = TREE_CODE_CLASS (TREE_CODE (arg1));
1750 char class2 = TREE_CODE_CLASS (TREE_CODE (arg2));
1751 enum tree_code code1 = ERROR_MARK;
1752 enum tree_code code2 = ERROR_MARK;
1754 if (class1 == 'e' || class1 == '1'
1755 || class1 == '2' || class1 == '<')
1756 code1 = C_EXP_ORIGINAL_CODE (arg1);
1757 if (class2 == 'e' || class2 == '1'
1758 || class2 == '2' || class2 == '<')
1759 code2 = C_EXP_ORIGINAL_CODE (arg2);
1761 /* Check for cases such as x+y<<z which users are likely
1762 to misinterpret. If parens are used, C_EXP_ORIGINAL_CODE
1763 is cleared to prevent these warnings. */
1764 if (warn_parentheses)
1766 if (code == LSHIFT_EXPR || code == RSHIFT_EXPR)
1768 if (code1 == PLUS_EXPR || code1 == MINUS_EXPR
1769 || code2 == PLUS_EXPR || code2 == MINUS_EXPR)
1770 warning ("suggest parentheses around + or - inside shift");
1773 if (code == TRUTH_ORIF_EXPR)
1775 if (code1 == TRUTH_ANDIF_EXPR
1776 || code2 == TRUTH_ANDIF_EXPR)
1777 warning ("suggest parentheses around && within ||");
1780 if (code == BIT_IOR_EXPR)
1782 if (code1 == BIT_AND_EXPR || code1 == BIT_XOR_EXPR
1783 || code1 == PLUS_EXPR || code1 == MINUS_EXPR
1784 || code2 == BIT_AND_EXPR || code2 == BIT_XOR_EXPR
1785 || code2 == PLUS_EXPR || code2 == MINUS_EXPR)
1786 warning ("suggest parentheses around arithmetic in operand of |");
1787 /* Check cases like x|y==z */
1788 if (TREE_CODE_CLASS (code1) == '<' || TREE_CODE_CLASS (code2) == '<')
1789 warning ("suggest parentheses around comparison in operand of |");
1792 if (code == BIT_XOR_EXPR)
1794 if (code1 == BIT_AND_EXPR
1795 || code1 == PLUS_EXPR || code1 == MINUS_EXPR
1796 || code2 == BIT_AND_EXPR
1797 || code2 == PLUS_EXPR || code2 == MINUS_EXPR)
1798 warning ("suggest parentheses around arithmetic in operand of ^");
1799 /* Check cases like x^y==z */
1800 if (TREE_CODE_CLASS (code1) == '<' || TREE_CODE_CLASS (code2) == '<')
1801 warning ("suggest parentheses around comparison in operand of ^");
1804 if (code == BIT_AND_EXPR)
1806 if (code1 == PLUS_EXPR || code1 == MINUS_EXPR
1807 || code2 == PLUS_EXPR || code2 == MINUS_EXPR)
1808 warning ("suggest parentheses around + or - in operand of &");
1809 /* Check cases like x&y==z */
1810 if (TREE_CODE_CLASS (code1) == '<' || TREE_CODE_CLASS (code2) == '<')
1811 warning ("suggest parentheses around comparison in operand of &");
1815 /* Similarly, check for cases like 1<=i<=10 that are probably errors. */
1816 if (TREE_CODE_CLASS (code) == '<' && extra_warnings
1817 && (TREE_CODE_CLASS (code1) == '<' || TREE_CODE_CLASS (code2) == '<'))
1818 warning ("comparisons like X<=Y<=Z do not have their mathematical meaning");
1820 unsigned_conversion_warning (result, arg1);
1821 unsigned_conversion_warning (result, arg2);
1822 overflow_warning (result);
1824 class = TREE_CODE_CLASS (TREE_CODE (result));
1826 /* Record the code that was specified in the source,
1827 for the sake of warnings about confusing nesting. */
1828 if (class == 'e' || class == '1'
1829 || class == '2' || class == '<')
1830 C_SET_EXP_ORIGINAL_CODE (result, code);
1833 int flag = TREE_CONSTANT (result);
1834 /* We used to use NOP_EXPR rather than NON_LVALUE_EXPR
1835 so that convert_for_assignment wouldn't strip it.
1836 That way, we got warnings for things like p = (1 - 1).
1837 But it turns out we should not get those warnings. */
1838 result = build1 (NON_LVALUE_EXPR, TREE_TYPE (result), result);
1839 C_SET_EXP_ORIGINAL_CODE (result, code);
1840 TREE_CONSTANT (result) = flag;
1846 /* Build a binary-operation expression without default conversions.
1847 CODE is the kind of expression to build.
1848 This function differs from `build' in several ways:
1849 the data type of the result is computed and recorded in it,
1850 warnings are generated if arg data types are invalid,
1851 special handling for addition and subtraction of pointers is known,
1852 and some optimization is done (operations on narrow ints
1853 are done in the narrower type when that gives the same result).
1854 Constant folding is also done before the result is returned.
1856 Note that the operands will never have enumeral types, or function
1857 or array types, because either they will have the default conversions
1858 performed or they have both just been converted to some other type in which
1859 the arithmetic is to be done. */
1862 build_binary_op (code, orig_op0, orig_op1, convert_p)
1863 enum tree_code code;
1864 tree orig_op0, orig_op1;
1868 enum tree_code code0, code1;
1871 /* Expression code to give to the expression when it is built.
1872 Normally this is CODE, which is what the caller asked for,
1873 but in some special cases we change it. */
1874 enum tree_code resultcode = code;
1876 /* Data type in which the computation is to be performed.
1877 In the simplest cases this is the common type of the arguments. */
1878 tree result_type = NULL;
1880 /* Nonzero means operands have already been type-converted
1881 in whatever way is necessary.
1882 Zero means they need to be converted to RESULT_TYPE. */
1885 /* Nonzero means create the expression with this type, rather than
1887 tree build_type = 0;
1889 /* Nonzero means after finally constructing the expression
1890 convert it to this type. */
1891 tree final_type = 0;
1893 /* Nonzero if this is an operation like MIN or MAX which can
1894 safely be computed in short if both args are promoted shorts.
1895 Also implies COMMON.
1896 -1 indicates a bitwise operation; this makes a difference
1897 in the exact conditions for when it is safe to do the operation
1898 in a narrower mode. */
1901 /* Nonzero if this is a comparison operation;
1902 if both args are promoted shorts, compare the original shorts.
1903 Also implies COMMON. */
1904 int short_compare = 0;
1906 /* Nonzero if this is a right-shift operation, which can be computed on the
1907 original short and then promoted if the operand is a promoted short. */
1908 int short_shift = 0;
1910 /* Nonzero means set RESULT_TYPE to the common type of the args. */
1915 op0 = default_conversion (orig_op0);
1916 op1 = default_conversion (orig_op1);
1924 type0 = TREE_TYPE (op0);
1925 type1 = TREE_TYPE (op1);
1927 /* The expression codes of the data types of the arguments tell us
1928 whether the arguments are integers, floating, pointers, etc. */
1929 code0 = TREE_CODE (type0);
1930 code1 = TREE_CODE (type1);
1932 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
1933 STRIP_TYPE_NOPS (op0);
1934 STRIP_TYPE_NOPS (op1);
1936 /* If an error was already reported for one of the arguments,
1937 avoid reporting another error. */
1939 if (code0 == ERROR_MARK || code1 == ERROR_MARK)
1940 return error_mark_node;
1945 /* Handle the pointer + int case. */
1946 if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
1947 return pointer_int_sum (PLUS_EXPR, op0, op1);
1948 else if (code1 == POINTER_TYPE && code0 == INTEGER_TYPE)
1949 return pointer_int_sum (PLUS_EXPR, op1, op0);
1955 /* Subtraction of two similar pointers.
1956 We must subtract them as integers, then divide by object size. */
1957 if (code0 == POINTER_TYPE && code1 == POINTER_TYPE
1958 && comp_target_types (type0, type1))
1959 return pointer_diff (op0, op1);
1960 /* Handle pointer minus int. Just like pointer plus int. */
1961 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
1962 return pointer_int_sum (MINUS_EXPR, op0, op1);
1971 case TRUNC_DIV_EXPR:
1973 case FLOOR_DIV_EXPR:
1974 case ROUND_DIV_EXPR:
1975 case EXACT_DIV_EXPR:
1976 /* Floating point division by zero is a legitimate way to obtain
1977 infinities and NaNs. */
1978 if (warn_div_by_zero && skip_evaluation == 0 && integer_zerop (op1))
1979 warning ("division by zero");
1981 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
1982 || code0 == COMPLEX_TYPE)
1983 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
1984 || code1 == COMPLEX_TYPE))
1986 if (!(code0 == INTEGER_TYPE && code1 == INTEGER_TYPE))
1987 resultcode = RDIV_EXPR;
1989 /* Although it would be tempting to shorten always here, that
1990 loses on some targets, since the modulo instruction is
1991 undefined if the quotient can't be represented in the
1992 computation mode. We shorten only if unsigned or if
1993 dividing by something we know != -1. */
1994 shorten = (TREE_UNSIGNED (TREE_TYPE (orig_op0))
1995 || (TREE_CODE (op1) == INTEGER_CST
1996 && ! integer_all_onesp (op1)));
2002 case BIT_ANDTC_EXPR:
2005 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
2007 /* If one operand is a constant, and the other is a short type
2008 that has been converted to an int,
2009 really do the work in the short type and then convert the
2010 result to int. If we are lucky, the constant will be 0 or 1
2011 in the short type, making the entire operation go away. */
2012 if (TREE_CODE (op0) == INTEGER_CST
2013 && TREE_CODE (op1) == NOP_EXPR
2014 && TYPE_PRECISION (type1) > TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op1, 0)))
2015 && TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op1, 0))))
2017 final_type = result_type;
2018 op1 = TREE_OPERAND (op1, 0);
2019 result_type = TREE_TYPE (op1);
2021 if (TREE_CODE (op1) == INTEGER_CST
2022 && TREE_CODE (op0) == NOP_EXPR
2023 && TYPE_PRECISION (type0) > TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op0, 0)))
2024 && TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0, 0))))
2026 final_type = result_type;
2027 op0 = TREE_OPERAND (op0, 0);
2028 result_type = TREE_TYPE (op0);
2032 case TRUNC_MOD_EXPR:
2033 case FLOOR_MOD_EXPR:
2034 if (warn_div_by_zero && skip_evaluation == 0 && integer_zerop (op1))
2035 warning ("division by zero");
2037 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
2039 /* Although it would be tempting to shorten always here, that loses
2040 on some targets, since the modulo instruction is undefined if the
2041 quotient can't be represented in the computation mode. We shorten
2042 only if unsigned or if dividing by something we know != -1. */
2043 shorten = (TREE_UNSIGNED (TREE_TYPE (orig_op0))
2044 || (TREE_CODE (op1) == INTEGER_CST
2045 && ! integer_all_onesp (op1)));
2050 case TRUTH_ANDIF_EXPR:
2051 case TRUTH_ORIF_EXPR:
2052 case TRUTH_AND_EXPR:
2054 case TRUTH_XOR_EXPR:
2055 if ((code0 == INTEGER_TYPE || code0 == POINTER_TYPE
2056 || code0 == REAL_TYPE || code0 == COMPLEX_TYPE)
2057 && (code1 == INTEGER_TYPE || code1 == POINTER_TYPE
2058 || code1 == REAL_TYPE || code1 == COMPLEX_TYPE))
2060 /* Result of these operations is always an int,
2061 but that does not mean the operands should be
2062 converted to ints! */
2063 result_type = integer_type_node;
2064 op0 = truthvalue_conversion (op0);
2065 op1 = truthvalue_conversion (op1);
2070 /* Shift operations: result has same type as first operand;
2071 always convert second operand to int.
2072 Also set SHORT_SHIFT if shifting rightward. */
2075 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
2077 if (TREE_CODE (op1) == INTEGER_CST && skip_evaluation == 0)
2079 if (tree_int_cst_sgn (op1) < 0)
2080 warning ("right shift count is negative");
2083 if (! integer_zerop (op1))
2086 if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
2087 warning ("right shift count >= width of type");
2091 /* Use the type of the value to be shifted.
2092 This is what most traditional C compilers do. */
2093 result_type = type0;
2094 /* Unless traditional, convert the shift-count to an integer,
2095 regardless of size of value being shifted. */
2096 if (! flag_traditional)
2098 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
2099 op1 = convert (integer_type_node, op1);
2100 /* Avoid converting op1 to result_type later. */
2107 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
2109 if (TREE_CODE (op1) == INTEGER_CST && skip_evaluation == 0)
2111 if (tree_int_cst_sgn (op1) < 0)
2112 warning ("left shift count is negative");
2114 else if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
2115 warning ("left shift count >= width of type");
2118 /* Use the type of the value to be shifted.
2119 This is what most traditional C compilers do. */
2120 result_type = type0;
2121 /* Unless traditional, convert the shift-count to an integer,
2122 regardless of size of value being shifted. */
2123 if (! flag_traditional)
2125 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
2126 op1 = convert (integer_type_node, op1);
2127 /* Avoid converting op1 to result_type later. */
2135 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
2137 if (TREE_CODE (op1) == INTEGER_CST && skip_evaluation == 0)
2139 if (tree_int_cst_sgn (op1) < 0)
2140 warning ("shift count is negative");
2141 else if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
2142 warning ("shift count >= width of type");
2145 /* Use the type of the value to be shifted.
2146 This is what most traditional C compilers do. */
2147 result_type = type0;
2148 /* Unless traditional, convert the shift-count to an integer,
2149 regardless of size of value being shifted. */
2150 if (! flag_traditional)
2152 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
2153 op1 = convert (integer_type_node, op1);
2154 /* Avoid converting op1 to result_type later. */
2162 if (warn_float_equal && (code0 == REAL_TYPE || code1 == REAL_TYPE))
2163 warning ("comparing floating point with == or != is unsafe");
2164 /* Result of comparison is always int,
2165 but don't convert the args to int! */
2166 build_type = integer_type_node;
2167 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
2168 || code0 == COMPLEX_TYPE)
2169 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
2170 || code1 == COMPLEX_TYPE))
2172 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
2174 tree tt0 = TREE_TYPE (type0);
2175 tree tt1 = TREE_TYPE (type1);
2176 /* Anything compares with void *. void * compares with anything.
2177 Otherwise, the targets must be compatible
2178 and both must be object or both incomplete. */
2179 if (comp_target_types (type0, type1))
2180 result_type = common_type (type0, type1);
2181 else if (VOID_TYPE_P (tt0))
2183 /* op0 != orig_op0 detects the case of something
2184 whose value is 0 but which isn't a valid null ptr const. */
2185 if (pedantic && (!integer_zerop (op0) || op0 != orig_op0)
2186 && TREE_CODE (tt1) == FUNCTION_TYPE)
2187 pedwarn ("ISO C forbids comparison of `void *' with function pointer");
2189 else if (VOID_TYPE_P (tt1))
2191 if (pedantic && (!integer_zerop (op1) || op1 != orig_op1)
2192 && TREE_CODE (tt0) == FUNCTION_TYPE)
2193 pedwarn ("ISO C forbids comparison of `void *' with function pointer");
2196 pedwarn ("comparison of distinct pointer types lacks a cast");
2198 if (result_type == NULL_TREE)
2199 result_type = ptr_type_node;
2201 else if (code0 == POINTER_TYPE && TREE_CODE (op1) == INTEGER_CST
2202 && integer_zerop (op1))
2203 result_type = type0;
2204 else if (code1 == POINTER_TYPE && TREE_CODE (op0) == INTEGER_CST
2205 && integer_zerop (op0))
2206 result_type = type1;
2207 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
2209 result_type = type0;
2210 if (! flag_traditional)
2211 pedwarn ("comparison between pointer and integer");
2213 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
2215 result_type = type1;
2216 if (! flag_traditional)
2217 pedwarn ("comparison between pointer and integer");
2223 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE)
2224 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE))
2226 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
2228 if (comp_target_types (type0, type1))
2230 result_type = common_type (type0, type1);
2232 && TREE_CODE (TREE_TYPE (type0)) == FUNCTION_TYPE)
2233 pedwarn ("ISO C forbids ordered comparisons of pointers to functions");
2237 result_type = ptr_type_node;
2238 pedwarn ("comparison of distinct pointer types lacks a cast");
2247 build_type = integer_type_node;
2248 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE)
2249 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE))
2251 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
2253 if (comp_target_types (type0, type1))
2255 result_type = common_type (type0, type1);
2256 if (!COMPLETE_TYPE_P (TREE_TYPE (type0))
2257 != !COMPLETE_TYPE_P (TREE_TYPE (type1)))
2258 pedwarn ("comparison of complete and incomplete pointers");
2260 && TREE_CODE (TREE_TYPE (type0)) == FUNCTION_TYPE)
2261 pedwarn ("ISO C forbids ordered comparisons of pointers to functions");
2265 result_type = ptr_type_node;
2266 pedwarn ("comparison of distinct pointer types lacks a cast");
2269 else if (code0 == POINTER_TYPE && TREE_CODE (op1) == INTEGER_CST
2270 && integer_zerop (op1))
2272 result_type = type0;
2273 if (pedantic || extra_warnings)
2274 pedwarn ("ordered comparison of pointer with integer zero");
2276 else if (code1 == POINTER_TYPE && TREE_CODE (op0) == INTEGER_CST
2277 && integer_zerop (op0))
2279 result_type = type1;
2281 pedwarn ("ordered comparison of pointer with integer zero");
2283 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
2285 result_type = type0;
2286 if (! flag_traditional)
2287 pedwarn ("comparison between pointer and integer");
2289 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
2291 result_type = type1;
2292 if (! flag_traditional)
2293 pedwarn ("comparison between pointer and integer");
2297 case UNORDERED_EXPR:
2304 build_type = integer_type_node;
2305 if (code0 != REAL_TYPE || code1 != REAL_TYPE)
2307 error ("unordered comparison on non-floating point argument");
2308 return error_mark_node;
2317 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE || code0 == COMPLEX_TYPE)
2319 (code1 == INTEGER_TYPE || code1 == REAL_TYPE || code1 == COMPLEX_TYPE))
2321 int none_complex = (code0 != COMPLEX_TYPE && code1 != COMPLEX_TYPE);
2323 if (shorten || common || short_compare)
2324 result_type = common_type (type0, type1);
2326 /* For certain operations (which identify themselves by shorten != 0)
2327 if both args were extended from the same smaller type,
2328 do the arithmetic in that type and then extend.
2330 shorten !=0 and !=1 indicates a bitwise operation.
2331 For them, this optimization is safe only if
2332 both args are zero-extended or both are sign-extended.
2333 Otherwise, we might change the result.
2334 Eg, (short)-1 | (unsigned short)-1 is (int)-1
2335 but calculated in (unsigned short) it would be (unsigned short)-1. */
2337 if (shorten && none_complex)
2339 int unsigned0, unsigned1;
2340 tree arg0 = get_narrower (op0, &unsigned0);
2341 tree arg1 = get_narrower (op1, &unsigned1);
2342 /* UNS is 1 if the operation to be done is an unsigned one. */
2343 int uns = TREE_UNSIGNED (result_type);
2346 final_type = result_type;
2348 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
2349 but it *requires* conversion to FINAL_TYPE. */
2351 if ((TYPE_PRECISION (TREE_TYPE (op0))
2352 == TYPE_PRECISION (TREE_TYPE (arg0)))
2353 && TREE_TYPE (op0) != final_type)
2354 unsigned0 = TREE_UNSIGNED (TREE_TYPE (op0));
2355 if ((TYPE_PRECISION (TREE_TYPE (op1))
2356 == TYPE_PRECISION (TREE_TYPE (arg1)))
2357 && TREE_TYPE (op1) != final_type)
2358 unsigned1 = TREE_UNSIGNED (TREE_TYPE (op1));
2360 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
2362 /* For bitwise operations, signedness of nominal type
2363 does not matter. Consider only how operands were extended. */
2367 /* Note that in all three cases below we refrain from optimizing
2368 an unsigned operation on sign-extended args.
2369 That would not be valid. */
2371 /* Both args variable: if both extended in same way
2372 from same width, do it in that width.
2373 Do it unsigned if args were zero-extended. */
2374 if ((TYPE_PRECISION (TREE_TYPE (arg0))
2375 < TYPE_PRECISION (result_type))
2376 && (TYPE_PRECISION (TREE_TYPE (arg1))
2377 == TYPE_PRECISION (TREE_TYPE (arg0)))
2378 && unsigned0 == unsigned1
2379 && (unsigned0 || !uns))
2381 = signed_or_unsigned_type (unsigned0,
2382 common_type (TREE_TYPE (arg0), TREE_TYPE (arg1)));
2383 else if (TREE_CODE (arg0) == INTEGER_CST
2384 && (unsigned1 || !uns)
2385 && (TYPE_PRECISION (TREE_TYPE (arg1))
2386 < TYPE_PRECISION (result_type))
2387 && (type = signed_or_unsigned_type (unsigned1,
2389 int_fits_type_p (arg0, type)))
2391 else if (TREE_CODE (arg1) == INTEGER_CST
2392 && (unsigned0 || !uns)
2393 && (TYPE_PRECISION (TREE_TYPE (arg0))
2394 < TYPE_PRECISION (result_type))
2395 && (type = signed_or_unsigned_type (unsigned0,
2397 int_fits_type_p (arg1, type)))
2401 /* Shifts can be shortened if shifting right. */
2406 tree arg0 = get_narrower (op0, &unsigned_arg);
2408 final_type = result_type;
2410 if (arg0 == op0 && final_type == TREE_TYPE (op0))
2411 unsigned_arg = TREE_UNSIGNED (TREE_TYPE (op0));
2413 if (TYPE_PRECISION (TREE_TYPE (arg0)) < TYPE_PRECISION (result_type)
2414 /* We can shorten only if the shift count is less than the
2415 number of bits in the smaller type size. */
2416 && compare_tree_int (op1, TYPE_PRECISION (TREE_TYPE (arg0))) < 0
2417 /* We cannot drop an unsigned shift after sign-extension. */
2418 && (!TREE_UNSIGNED (final_type) || unsigned_arg))
2420 /* Do an unsigned shift if the operand was zero-extended. */
2422 = signed_or_unsigned_type (unsigned_arg, TREE_TYPE (arg0));
2423 /* Convert value-to-be-shifted to that type. */
2424 if (TREE_TYPE (op0) != result_type)
2425 op0 = convert (result_type, op0);
2430 /* Comparison operations are shortened too but differently.
2431 They identify themselves by setting short_compare = 1. */
2435 /* Don't write &op0, etc., because that would prevent op0
2436 from being kept in a register.
2437 Instead, make copies of the our local variables and
2438 pass the copies by reference, then copy them back afterward. */
2439 tree xop0 = op0, xop1 = op1, xresult_type = result_type;
2440 enum tree_code xresultcode = resultcode;
2442 = shorten_compare (&xop0, &xop1, &xresult_type, &xresultcode);
2447 op0 = xop0, op1 = xop1;
2449 resultcode = xresultcode;
2451 if ((warn_sign_compare < 0 ? extra_warnings : warn_sign_compare != 0)
2452 && skip_evaluation == 0)
2454 int op0_signed = ! TREE_UNSIGNED (TREE_TYPE (orig_op0));
2455 int op1_signed = ! TREE_UNSIGNED (TREE_TYPE (orig_op1));
2456 int unsignedp0, unsignedp1;
2457 tree primop0 = get_narrower (op0, &unsignedp0);
2458 tree primop1 = get_narrower (op1, &unsignedp1);
2462 STRIP_TYPE_NOPS (xop0);
2463 STRIP_TYPE_NOPS (xop1);
2465 /* Give warnings for comparisons between signed and unsigned
2466 quantities that may fail.
2468 Do the checking based on the original operand trees, so that
2469 casts will be considered, but default promotions won't be.
2471 Do not warn if the comparison is being done in a signed type,
2472 since the signed type will only be chosen if it can represent
2473 all the values of the unsigned type. */
2474 if (! TREE_UNSIGNED (result_type))
2476 /* Do not warn if both operands are the same signedness. */
2477 else if (op0_signed == op1_signed)
2484 sop = xop0, uop = xop1;
2486 sop = xop1, uop = xop0;
2488 /* Do not warn if the signed quantity is an
2489 unsuffixed integer literal (or some static
2490 constant expression involving such literals or a
2491 conditional expression involving such literals)
2492 and it is non-negative. */
2493 if (tree_expr_nonnegative_p (sop))
2495 /* Do not warn if the comparison is an equality operation,
2496 the unsigned quantity is an integral constant, and it
2497 would fit in the result if the result were signed. */
2498 else if (TREE_CODE (uop) == INTEGER_CST
2499 && (resultcode == EQ_EXPR || resultcode == NE_EXPR)
2500 && int_fits_type_p (uop, signed_type (result_type)))
2502 /* Do not warn if the unsigned quantity is an enumeration
2503 constant and its maximum value would fit in the result
2504 if the result were signed. */
2505 else if (TREE_CODE (uop) == INTEGER_CST
2506 && TREE_CODE (TREE_TYPE (uop)) == ENUMERAL_TYPE
2507 && int_fits_type_p (TYPE_MAX_VALUE (TREE_TYPE(uop)),
2508 signed_type (result_type)))
2511 warning ("comparison between signed and unsigned");
2514 /* Warn if two unsigned values are being compared in a size
2515 larger than their original size, and one (and only one) is the
2516 result of a `~' operator. This comparison will always fail.
2518 Also warn if one operand is a constant, and the constant
2519 does not have all bits set that are set in the ~ operand
2520 when it is extended. */
2522 if ((TREE_CODE (primop0) == BIT_NOT_EXPR)
2523 != (TREE_CODE (primop1) == BIT_NOT_EXPR))
2525 if (TREE_CODE (primop0) == BIT_NOT_EXPR)
2526 primop0 = get_narrower (TREE_OPERAND (primop0, 0),
2529 primop1 = get_narrower (TREE_OPERAND (primop1, 0),
2532 if (host_integerp (primop0, 0) || host_integerp (primop1, 0))
2535 HOST_WIDE_INT constant, mask;
2536 int unsignedp, bits;
2538 if (host_integerp (primop0, 0))
2541 unsignedp = unsignedp1;
2542 constant = tree_low_cst (primop0, 0);
2547 unsignedp = unsignedp0;
2548 constant = tree_low_cst (primop1, 0);
2551 bits = TYPE_PRECISION (TREE_TYPE (primop));
2552 if (bits < TYPE_PRECISION (result_type)
2553 && bits < HOST_BITS_PER_WIDE_INT && unsignedp)
2555 mask = (~ (HOST_WIDE_INT) 0) << bits;
2556 if ((mask & constant) != mask)
2557 warning ("comparison of promoted ~unsigned with constant");
2560 else if (unsignedp0 && unsignedp1
2561 && (TYPE_PRECISION (TREE_TYPE (primop0))
2562 < TYPE_PRECISION (result_type))
2563 && (TYPE_PRECISION (TREE_TYPE (primop1))
2564 < TYPE_PRECISION (result_type)))
2565 warning ("comparison of promoted ~unsigned with unsigned");
2571 /* At this point, RESULT_TYPE must be nonzero to avoid an error message.
2572 If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
2573 Then the expression will be built.
2574 It will be given type FINAL_TYPE if that is nonzero;
2575 otherwise, it will be given type RESULT_TYPE. */
2579 binary_op_error (code);
2580 return error_mark_node;
2585 if (TREE_TYPE (op0) != result_type)
2586 op0 = convert (result_type, op0);
2587 if (TREE_TYPE (op1) != result_type)
2588 op1 = convert (result_type, op1);
2591 if (build_type == NULL_TREE)
2592 build_type = result_type;
2595 tree result = build (resultcode, build_type, op0, op1);
2598 folded = fold (result);
2599 if (folded == result)
2600 TREE_CONSTANT (folded) = TREE_CONSTANT (op0) & TREE_CONSTANT (op1);
2601 if (final_type != 0)
2602 return convert (final_type, folded);
2607 /* Return a tree for the sum or difference (RESULTCODE says which)
2608 of pointer PTROP and integer INTOP. */
2611 pointer_int_sum (resultcode, ptrop, intop)
2612 enum tree_code resultcode;
2620 /* The result is a pointer of the same type that is being added. */
2622 tree result_type = TREE_TYPE (ptrop);
2624 if (TREE_CODE (TREE_TYPE (result_type)) == VOID_TYPE)
2626 if (pedantic || warn_pointer_arith)
2627 pedwarn ("pointer of type `void *' used in arithmetic");
2628 size_exp = integer_one_node;
2630 else if (TREE_CODE (TREE_TYPE (result_type)) == FUNCTION_TYPE)
2632 if (pedantic || warn_pointer_arith)
2633 pedwarn ("pointer to a function used in arithmetic");
2634 size_exp = integer_one_node;
2637 size_exp = c_size_in_bytes (TREE_TYPE (result_type));
2639 /* If what we are about to multiply by the size of the elements
2640 contains a constant term, apply distributive law
2641 and multiply that constant term separately.
2642 This helps produce common subexpressions. */
2644 if ((TREE_CODE (intop) == PLUS_EXPR || TREE_CODE (intop) == MINUS_EXPR)
2645 && ! TREE_CONSTANT (intop)
2646 && TREE_CONSTANT (TREE_OPERAND (intop, 1))
2647 && TREE_CONSTANT (size_exp)
2648 /* If the constant comes from pointer subtraction,
2649 skip this optimization--it would cause an error. */
2650 && TREE_CODE (TREE_TYPE (TREE_OPERAND (intop, 0))) == INTEGER_TYPE
2651 /* If the constant is unsigned, and smaller than the pointer size,
2652 then we must skip this optimization. This is because it could cause
2653 an overflow error if the constant is negative but INTOP is not. */
2654 && (! TREE_UNSIGNED (TREE_TYPE (intop))
2655 || (TYPE_PRECISION (TREE_TYPE (intop))
2656 == TYPE_PRECISION (TREE_TYPE (ptrop)))))
2658 enum tree_code subcode = resultcode;
2659 tree int_type = TREE_TYPE (intop);
2660 if (TREE_CODE (intop) == MINUS_EXPR)
2661 subcode = (subcode == PLUS_EXPR ? MINUS_EXPR : PLUS_EXPR);
2662 /* Convert both subexpression types to the type of intop,
2663 because weird cases involving pointer arithmetic
2664 can result in a sum or difference with different type args. */
2665 ptrop = build_binary_op (subcode, ptrop,
2666 convert (int_type, TREE_OPERAND (intop, 1)), 1);
2667 intop = convert (int_type, TREE_OPERAND (intop, 0));
2670 /* Convert the integer argument to a type the same size as sizetype
2671 so the multiply won't overflow spuriously. */
2673 if (TYPE_PRECISION (TREE_TYPE (intop)) != TYPE_PRECISION (sizetype)
2674 || TREE_UNSIGNED (TREE_TYPE (intop)) != TREE_UNSIGNED (sizetype))
2675 intop = convert (type_for_size (TYPE_PRECISION (sizetype),
2676 TREE_UNSIGNED (sizetype)), intop);
2678 /* Replace the integer argument with a suitable product by the object size.
2679 Do this multiplication as signed, then convert to the appropriate
2680 pointer type (actually unsigned integral). */
2682 intop = convert (result_type,
2683 build_binary_op (MULT_EXPR, intop,
2684 convert (TREE_TYPE (intop), size_exp), 1));
2686 /* Create the sum or difference. */
2688 result = build (resultcode, result_type, ptrop, intop);
2690 folded = fold (result);
2691 if (folded == result)
2692 TREE_CONSTANT (folded) = TREE_CONSTANT (ptrop) & TREE_CONSTANT (intop);
2696 /* Return a tree for the difference of pointers OP0 and OP1.
2697 The resulting tree has type int. */
2700 pointer_diff (op0, op1)
2703 tree result, folded;
2704 tree restype = ptrdiff_type_node;
2706 tree target_type = TREE_TYPE (TREE_TYPE (op0));
2707 tree con0, con1, lit0, lit1;
2708 tree orig_op1 = op1;
2710 if (pedantic || warn_pointer_arith)
2712 if (TREE_CODE (target_type) == VOID_TYPE)
2713 pedwarn ("pointer of type `void *' used in subtraction");
2714 if (TREE_CODE (target_type) == FUNCTION_TYPE)
2715 pedwarn ("pointer to a function used in subtraction");
2718 /* If the conversion to ptrdiff_type does anything like widening or
2719 converting a partial to an integral mode, we get a convert_expression
2720 that is in the way to do any simplifications.
2721 (fold-const.c doesn't know that the extra bits won't be needed.
2722 split_tree uses STRIP_SIGN_NOPS, which leaves conversions to a
2723 different mode in place.)
2724 So first try to find a common term here 'by hand'; we want to cover
2725 at least the cases that occur in legal static initializers. */
2726 con0 = TREE_CODE (op0) == NOP_EXPR ? TREE_OPERAND (op0, 0) : op0;
2727 con1 = TREE_CODE (op1) == NOP_EXPR ? TREE_OPERAND (op1, 0) : op1;
2729 if (TREE_CODE (con0) == PLUS_EXPR)
2731 lit0 = TREE_OPERAND (con0, 1);
2732 con0 = TREE_OPERAND (con0, 0);
2735 lit0 = integer_zero_node;
2737 if (TREE_CODE (con1) == PLUS_EXPR)
2739 lit1 = TREE_OPERAND (con1, 1);
2740 con1 = TREE_OPERAND (con1, 0);
2743 lit1 = integer_zero_node;
2745 if (operand_equal_p (con0, con1, 0))
2752 /* First do the subtraction as integers;
2753 then drop through to build the divide operator.
2754 Do not do default conversions on the minus operator
2755 in case restype is a short type. */
2757 op0 = build_binary_op (MINUS_EXPR, convert (restype, op0),
2758 convert (restype, op1), 0);
2759 /* This generates an error if op1 is pointer to incomplete type. */
2760 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (TREE_TYPE (orig_op1))))
2761 error ("arithmetic on pointer to an incomplete type");
2763 /* This generates an error if op0 is pointer to incomplete type. */
2764 op1 = c_size_in_bytes (target_type);
2766 /* Divide by the size, in easiest possible way. */
2768 result = build (EXACT_DIV_EXPR, restype, op0, convert (restype, op1));
2770 folded = fold (result);
2771 if (folded == result)
2772 TREE_CONSTANT (folded) = TREE_CONSTANT (op0) & TREE_CONSTANT (op1);
2776 /* Construct and perhaps optimize a tree representation
2777 for a unary operation. CODE, a tree_code, specifies the operation
2778 and XARG is the operand. NOCONVERT nonzero suppresses
2779 the default promotions (such as from short to int). */
2782 build_unary_op (code, xarg, noconvert)
2783 enum tree_code code;
2787 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
2790 enum tree_code typecode = TREE_CODE (TREE_TYPE (arg));
2793 if (typecode == ERROR_MARK)
2794 return error_mark_node;
2795 if (typecode == ENUMERAL_TYPE || typecode == BOOLEAN_TYPE)
2796 typecode = INTEGER_TYPE;
2801 /* This is used for unary plus, because a CONVERT_EXPR
2802 is enough to prevent anybody from looking inside for
2803 associativity, but won't generate any code. */
2804 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2805 || typecode == COMPLEX_TYPE))
2807 error ("wrong type argument to unary plus");
2808 return error_mark_node;
2810 else if (!noconvert)
2811 arg = default_conversion (arg);
2815 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2816 || typecode == COMPLEX_TYPE))
2818 error ("wrong type argument to unary minus");
2819 return error_mark_node;
2821 else if (!noconvert)
2822 arg = default_conversion (arg);
2826 if (typecode == COMPLEX_TYPE)
2830 pedwarn ("ISO C does not support `~' for complex conjugation");
2832 arg = default_conversion (arg);
2834 else if (typecode != INTEGER_TYPE)
2836 error ("wrong type argument to bit-complement");
2837 return error_mark_node;
2839 else if (!noconvert)
2840 arg = default_conversion (arg);
2844 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2845 || typecode == COMPLEX_TYPE))
2847 error ("wrong type argument to abs");
2848 return error_mark_node;
2850 else if (!noconvert)
2851 arg = default_conversion (arg);
2855 /* Conjugating a real value is a no-op, but allow it anyway. */
2856 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2857 || typecode == COMPLEX_TYPE))
2859 error ("wrong type argument to conjugation");
2860 return error_mark_node;
2862 else if (!noconvert)
2863 arg = default_conversion (arg);
2866 case TRUTH_NOT_EXPR:
2867 if (typecode != INTEGER_TYPE
2868 && typecode != REAL_TYPE && typecode != POINTER_TYPE
2869 && typecode != COMPLEX_TYPE
2870 /* These will convert to a pointer. */
2871 && typecode != ARRAY_TYPE && typecode != FUNCTION_TYPE)
2873 error ("wrong type argument to unary exclamation mark");
2874 return error_mark_node;
2876 arg = truthvalue_conversion (arg);
2877 return invert_truthvalue (arg);
2883 if (TREE_CODE (arg) == COMPLEX_CST)
2884 return TREE_REALPART (arg);
2885 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
2886 return fold (build1 (REALPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg));
2891 if (TREE_CODE (arg) == COMPLEX_CST)
2892 return TREE_IMAGPART (arg);
2893 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
2894 return fold (build1 (IMAGPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg));
2896 return convert (TREE_TYPE (arg), integer_zero_node);
2898 case PREINCREMENT_EXPR:
2899 case POSTINCREMENT_EXPR:
2900 case PREDECREMENT_EXPR:
2901 case POSTDECREMENT_EXPR:
2902 /* Handle complex lvalues (when permitted)
2903 by reduction to simpler cases. */
2905 val = unary_complex_lvalue (code, arg);
2909 /* Increment or decrement the real part of the value,
2910 and don't change the imaginary part. */
2911 if (typecode == COMPLEX_TYPE)
2916 pedwarn ("ISO C does not support `++' and `--' on complex types");
2918 arg = stabilize_reference (arg);
2919 real = build_unary_op (REALPART_EXPR, arg, 1);
2920 imag = build_unary_op (IMAGPART_EXPR, arg, 1);
2921 return build (COMPLEX_EXPR, TREE_TYPE (arg),
2922 build_unary_op (code, real, 1), imag);
2925 /* Report invalid types. */
2927 if (typecode != POINTER_TYPE
2928 && typecode != INTEGER_TYPE && typecode != REAL_TYPE)
2930 error ("wrong type argument to %s",
2931 code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR
2932 ? "increment" : "decrement");
2933 return error_mark_node;
2938 tree result_type = TREE_TYPE (arg);
2940 arg = get_unwidened (arg, 0);
2941 argtype = TREE_TYPE (arg);
2943 /* Compute the increment. */
2945 if (typecode == POINTER_TYPE)
2947 /* If pointer target is an undefined struct,
2948 we just cannot know how to do the arithmetic. */
2949 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (result_type)))
2950 error ("%s of pointer to unknown structure",
2951 code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR
2952 ? "increment" : "decrement");
2953 else if ((pedantic || warn_pointer_arith)
2954 && (TREE_CODE (TREE_TYPE (result_type)) == FUNCTION_TYPE
2955 || TREE_CODE (TREE_TYPE (result_type)) == VOID_TYPE))
2956 pedwarn ("wrong type argument to %s",
2957 code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR
2958 ? "increment" : "decrement");
2959 inc = c_size_in_bytes (TREE_TYPE (result_type));
2962 inc = integer_one_node;
2964 inc = convert (argtype, inc);
2966 /* Handle incrementing a cast-expression. */
2969 switch (TREE_CODE (arg))
2974 case FIX_TRUNC_EXPR:
2975 case FIX_FLOOR_EXPR:
2976 case FIX_ROUND_EXPR:
2978 pedantic_lvalue_warning (CONVERT_EXPR);
2979 /* If the real type has the same machine representation
2980 as the type it is cast to, we can make better output
2981 by adding directly to the inside of the cast. */
2982 if ((TREE_CODE (TREE_TYPE (arg))
2983 == TREE_CODE (TREE_TYPE (TREE_OPERAND (arg, 0))))
2984 && (TYPE_MODE (TREE_TYPE (arg))
2985 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (arg, 0)))))
2986 arg = TREE_OPERAND (arg, 0);
2989 tree incremented, modify, value;
2990 if (TREE_CODE (TREE_TYPE (arg)) == BOOLEAN_TYPE)
2991 value = boolean_increment (code, arg);
2994 arg = stabilize_reference (arg);
2995 if (code == PREINCREMENT_EXPR || code == PREDECREMENT_EXPR)
2998 value = save_expr (arg);
2999 incremented = build (((code == PREINCREMENT_EXPR
3000 || code == POSTINCREMENT_EXPR)
3001 ? PLUS_EXPR : MINUS_EXPR),
3002 argtype, value, inc);
3003 TREE_SIDE_EFFECTS (incremented) = 1;
3004 modify = build_modify_expr (arg, NOP_EXPR, incremented);
3005 value = build (COMPOUND_EXPR, TREE_TYPE (arg), modify, value);
3007 TREE_USED (value) = 1;
3017 /* Complain about anything else that is not a true lvalue. */
3018 if (!lvalue_or_else (arg, ((code == PREINCREMENT_EXPR
3019 || code == POSTINCREMENT_EXPR)
3020 ? "invalid lvalue in increment"
3021 : "invalid lvalue in decrement")))
3022 return error_mark_node;
3024 /* Report a read-only lvalue. */
3025 if (TREE_READONLY (arg))
3026 readonly_warning (arg,
3027 ((code == PREINCREMENT_EXPR
3028 || code == POSTINCREMENT_EXPR)
3029 ? "increment" : "decrement"));
3031 if (TREE_CODE (TREE_TYPE (arg)) == BOOLEAN_TYPE)
3032 val = boolean_increment (code, arg);
3034 val = build (code, TREE_TYPE (arg), arg, inc);
3035 TREE_SIDE_EFFECTS (val) = 1;
3036 val = convert (result_type, val);
3037 if (TREE_CODE (val) != code)
3038 TREE_NO_UNUSED_WARNING (val) = 1;
3043 /* Note that this operation never does default_conversion
3044 regardless of NOCONVERT. */
3046 /* Let &* cancel out to simplify resulting code. */
3047 if (TREE_CODE (arg) == INDIRECT_REF)
3049 /* Don't let this be an lvalue. */
3050 if (lvalue_p (TREE_OPERAND (arg, 0)))
3051 return non_lvalue (TREE_OPERAND (arg, 0));
3052 return TREE_OPERAND (arg, 0);
3055 /* For &x[y], return x+y */
3056 if (TREE_CODE (arg) == ARRAY_REF)
3058 if (mark_addressable (TREE_OPERAND (arg, 0)) == 0)
3059 return error_mark_node;
3060 return build_binary_op (PLUS_EXPR, TREE_OPERAND (arg, 0),
3061 TREE_OPERAND (arg, 1), 1);
3064 /* Handle complex lvalues (when permitted)
3065 by reduction to simpler cases. */
3066 val = unary_complex_lvalue (code, arg);
3070 #if 0 /* Turned off because inconsistent;
3071 float f; *&(int)f = 3.4 stores in int format
3072 whereas (int)f = 3.4 stores in float format. */
3073 /* Address of a cast is just a cast of the address
3074 of the operand of the cast. */
3075 switch (TREE_CODE (arg))
3080 case FIX_TRUNC_EXPR:
3081 case FIX_FLOOR_EXPR:
3082 case FIX_ROUND_EXPR:
3085 pedwarn ("ISO C forbids the address of a cast expression");
3086 return convert (build_pointer_type (TREE_TYPE (arg)),
3087 build_unary_op (ADDR_EXPR, TREE_OPERAND (arg, 0),
3092 /* Allow the address of a constructor if all the elements
3094 if (TREE_CODE (arg) == CONSTRUCTOR && TREE_CONSTANT (arg))
3096 /* Anything not already handled and not a true memory reference
3098 else if (typecode != FUNCTION_TYPE
3099 && !lvalue_or_else (arg, "invalid lvalue in unary `&'"))
3100 return error_mark_node;
3102 /* Ordinary case; arg is a COMPONENT_REF or a decl. */
3103 argtype = TREE_TYPE (arg);
3105 /* If the lvalue is const or volatile, merge that into the type
3106 to which the address will point. Note that you can't get a
3107 restricted pointer by taking the address of something, so we
3108 only have to deal with `const' and `volatile' here. */
3109 if ((DECL_P (arg) || TREE_CODE_CLASS (TREE_CODE (arg)) == 'r')
3110 && (TREE_READONLY (arg) || TREE_THIS_VOLATILE (arg)))
3111 argtype = c_build_type_variant (argtype,
3112 TREE_READONLY (arg),
3113 TREE_THIS_VOLATILE (arg));
3115 argtype = build_pointer_type (argtype);
3117 if (mark_addressable (arg) == 0)
3118 return error_mark_node;
3123 if (TREE_CODE (arg) == COMPONENT_REF)
3125 tree field = TREE_OPERAND (arg, 1);
3127 addr = build_unary_op (ADDR_EXPR, TREE_OPERAND (arg, 0), 0);
3129 if (DECL_C_BIT_FIELD (field))
3131 error ("attempt to take address of bit-field structure member `%s'",
3132 IDENTIFIER_POINTER (DECL_NAME (field)));
3133 return error_mark_node;
3136 addr = fold (build (PLUS_EXPR, argtype,
3137 convert (argtype, addr),
3138 convert (argtype, byte_position (field))));
3141 addr = build1 (code, argtype, arg);
3143 /* Address of a static or external variable or
3144 file-scope function counts as a constant. */
3146 && ! (TREE_CODE (arg) == FUNCTION_DECL
3147 && DECL_CONTEXT (arg) != 0))
3148 TREE_CONSTANT (addr) = 1;
3157 argtype = TREE_TYPE (arg);
3158 return fold (build1 (code, argtype, arg));
3162 /* If CONVERSIONS is a conversion expression or a nested sequence of such,
3163 convert ARG with the same conversions in the same order
3164 and return the result. */
3167 convert_sequence (conversions, arg)
3171 switch (TREE_CODE (conversions))
3176 case FIX_TRUNC_EXPR:
3177 case FIX_FLOOR_EXPR:
3178 case FIX_ROUND_EXPR:
3180 return convert (TREE_TYPE (conversions),
3181 convert_sequence (TREE_OPERAND (conversions, 0),
3190 /* Return nonzero if REF is an lvalue valid for this language.
3191 Lvalues can be assigned, unless their type has TYPE_READONLY.
3192 Lvalues can have their address taken, unless they have DECL_REGISTER. */
3198 enum tree_code code = TREE_CODE (ref);
3205 return lvalue_p (TREE_OPERAND (ref, 0));
3216 return (TREE_CODE (TREE_TYPE (ref)) != FUNCTION_TYPE
3217 && TREE_CODE (TREE_TYPE (ref)) != METHOD_TYPE);
3221 return TREE_CODE (TREE_TYPE (ref)) == ARRAY_TYPE;
3228 /* Return nonzero if REF is an lvalue valid for this language;
3229 otherwise, print an error message and return zero. */
3232 lvalue_or_else (ref, msgid)
3236 int win = lvalue_p (ref);
3239 error ("%s", msgid);
3244 /* Apply unary lvalue-demanding operator CODE to the expression ARG
3245 for certain kinds of expressions which are not really lvalues
3246 but which we can accept as lvalues.
3248 If ARG is not a kind of expression we can handle, return zero. */
3251 unary_complex_lvalue (code, arg)
3252 enum tree_code code;
3255 /* Handle (a, b) used as an "lvalue". */
3256 if (TREE_CODE (arg) == COMPOUND_EXPR)
3258 tree real_result = build_unary_op (code, TREE_OPERAND (arg, 1), 0);
3260 /* If this returns a function type, it isn't really being used as
3261 an lvalue, so don't issue a warning about it. */
3262 if (TREE_CODE (TREE_TYPE (arg)) != FUNCTION_TYPE)
3263 pedantic_lvalue_warning (COMPOUND_EXPR);
3265 return build (COMPOUND_EXPR, TREE_TYPE (real_result),
3266 TREE_OPERAND (arg, 0), real_result);
3269 /* Handle (a ? b : c) used as an "lvalue". */
3270 if (TREE_CODE (arg) == COND_EXPR)
3272 pedantic_lvalue_warning (COND_EXPR);
3273 if (TREE_CODE (TREE_TYPE (arg)) != FUNCTION_TYPE)
3274 pedantic_lvalue_warning (COMPOUND_EXPR);
3276 return (build_conditional_expr
3277 (TREE_OPERAND (arg, 0),
3278 build_unary_op (code, TREE_OPERAND (arg, 1), 0),
3279 build_unary_op (code, TREE_OPERAND (arg, 2), 0)));
3285 /* If pedantic, warn about improper lvalue. CODE is either COND_EXPR
3286 COMPOUND_EXPR, or CONVERT_EXPR (for casts). */
3289 pedantic_lvalue_warning (code)
3290 enum tree_code code;
3296 pedwarn ("ISO C forbids use of conditional expressions as lvalues");
3299 pedwarn ("ISO C forbids use of compound expressions as lvalues");
3302 pedwarn ("ISO C forbids use of cast expressions as lvalues");
3307 /* Warn about storing in something that is `const'. */
3310 readonly_warning (arg, msgid)
3314 if (TREE_CODE (arg) == COMPONENT_REF)
3316 if (TYPE_READONLY (TREE_TYPE (TREE_OPERAND (arg, 0))))
3317 readonly_warning (TREE_OPERAND (arg, 0), msgid);
3319 pedwarn ("%s of read-only member `%s'", _(msgid),
3320 IDENTIFIER_POINTER (DECL_NAME (TREE_OPERAND (arg, 1))));
3322 else if (TREE_CODE (arg) == VAR_DECL)
3323 pedwarn ("%s of read-only variable `%s'", _(msgid),
3324 IDENTIFIER_POINTER (DECL_NAME (arg)));
3326 pedwarn ("%s of read-only location", _(msgid));
3329 /* Mark EXP saying that we need to be able to take the
3330 address of it; it should not be allocated in a register.
3331 Value is 1 if successful. */
3334 mark_addressable (exp)
3339 switch (TREE_CODE (x))
3342 if (DECL_C_BIT_FIELD (TREE_OPERAND (x, 1)))
3344 error ("cannot take address of bitfield `%s'",
3345 IDENTIFIER_POINTER (DECL_NAME (TREE_OPERAND (x, 1))));
3349 /* ... fall through ... */
3355 x = TREE_OPERAND (x, 0);
3359 TREE_ADDRESSABLE (x) = 1;
3366 if (DECL_REGISTER (x) && !TREE_ADDRESSABLE (x)
3367 && DECL_NONLOCAL (x))
3369 if (TREE_PUBLIC (x))
3371 error ("global register variable `%s' used in nested function",
3372 IDENTIFIER_POINTER (DECL_NAME (x)));
3375 pedwarn ("register variable `%s' used in nested function",
3376 IDENTIFIER_POINTER (DECL_NAME (x)));
3378 else if (DECL_REGISTER (x) && !TREE_ADDRESSABLE (x))
3380 if (TREE_PUBLIC (x))
3382 error ("address of global register variable `%s' requested",
3383 IDENTIFIER_POINTER (DECL_NAME (x)));
3387 /* If we are making this addressable due to its having
3388 volatile components, give a different error message. Also
3389 handle the case of an unnamed parameter by not trying
3390 to give the name. */
3392 else if (C_TYPE_FIELDS_VOLATILE (TREE_TYPE (x)))
3394 error ("cannot put object with volatile field into register");
3398 pedwarn ("address of register variable `%s' requested",
3399 IDENTIFIER_POINTER (DECL_NAME (x)));
3401 put_var_into_stack (x);
3405 TREE_ADDRESSABLE (x) = 1;
3406 #if 0 /* poplevel deals with this now. */
3407 if (DECL_CONTEXT (x) == 0)
3408 TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (x)) = 1;
3416 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
3419 build_conditional_expr (ifexp, op1, op2)
3420 tree ifexp, op1, op2;
3424 enum tree_code code1;
3425 enum tree_code code2;
3426 tree result_type = NULL;
3427 tree orig_op1 = op1, orig_op2 = op2;
3429 ifexp = truthvalue_conversion (default_conversion (ifexp));
3431 #if 0 /* Produces wrong result if within sizeof. */
3432 /* Don't promote the operands separately if they promote
3433 the same way. Return the unpromoted type and let the combined
3434 value get promoted if necessary. */
3436 if (TREE_TYPE (op1) == TREE_TYPE (op2)
3437 && TREE_CODE (TREE_TYPE (op1)) != ARRAY_TYPE
3438 && TREE_CODE (TREE_TYPE (op1)) != ENUMERAL_TYPE
3439 && TREE_CODE (TREE_TYPE (op1)) != FUNCTION_TYPE)
3441 if (TREE_CODE (ifexp) == INTEGER_CST)
3442 return pedantic_non_lvalue (integer_zerop (ifexp) ? op2 : op1);
3444 return fold (build (COND_EXPR, TREE_TYPE (op1), ifexp, op1, op2));
3448 /* Promote both alternatives. */
3450 if (TREE_CODE (TREE_TYPE (op1)) != VOID_TYPE)
3451 op1 = default_conversion (op1);
3452 if (TREE_CODE (TREE_TYPE (op2)) != VOID_TYPE)
3453 op2 = default_conversion (op2);
3455 if (TREE_CODE (ifexp) == ERROR_MARK
3456 || TREE_CODE (TREE_TYPE (op1)) == ERROR_MARK
3457 || TREE_CODE (TREE_TYPE (op2)) == ERROR_MARK)
3458 return error_mark_node;
3460 type1 = TREE_TYPE (op1);
3461 code1 = TREE_CODE (type1);
3462 type2 = TREE_TYPE (op2);
3463 code2 = TREE_CODE (type2);
3465 /* Quickly detect the usual case where op1 and op2 have the same type
3467 if (TYPE_MAIN_VARIANT (type1) == TYPE_MAIN_VARIANT (type2))
3470 result_type = type1;
3472 result_type = TYPE_MAIN_VARIANT (type1);
3474 else if ((code1 == INTEGER_TYPE || code1 == REAL_TYPE
3475 || code1 == COMPLEX_TYPE)
3476 && (code2 == INTEGER_TYPE || code2 == REAL_TYPE
3477 || code2 == COMPLEX_TYPE))
3479 result_type = common_type (type1, type2);
3481 /* If -Wsign-compare, warn here if type1 and type2 have
3482 different signedness. We'll promote the signed to unsigned
3483 and later code won't know it used to be different.
3484 Do this check on the original types, so that explicit casts
3485 will be considered, but default promotions won't. */
3486 if ((warn_sign_compare < 0 ? extra_warnings : warn_sign_compare)
3487 && !skip_evaluation)
3489 int unsigned_op1 = TREE_UNSIGNED (TREE_TYPE (orig_op1));
3490 int unsigned_op2 = TREE_UNSIGNED (TREE_TYPE (orig_op2));
3492 if (unsigned_op1 ^ unsigned_op2)
3494 /* Do not warn if the result type is signed, since the
3495 signed type will only be chosen if it can represent
3496 all the values of the unsigned type. */
3497 if (! TREE_UNSIGNED (result_type))
3499 /* Do not warn if the signed quantity is an unsuffixed
3500 integer literal (or some static constant expression
3501 involving such literals) and it is non-negative. */
3502 else if ((unsigned_op2 && tree_expr_nonnegative_p (op1))
3503 || (unsigned_op1 && tree_expr_nonnegative_p (op2)))
3506 warning ("signed and unsigned type in conditional expression");
3510 else if (code1 == VOID_TYPE || code2 == VOID_TYPE)
3512 if (pedantic && (code1 != VOID_TYPE || code2 != VOID_TYPE))
3513 pedwarn ("ISO C forbids conditional expr with only one void side");
3514 result_type = void_type_node;
3516 else if (code1 == POINTER_TYPE && code2 == POINTER_TYPE)
3518 if (comp_target_types (type1, type2))
3519 result_type = common_type (type1, type2);
3520 else if (integer_zerop (op1) && TREE_TYPE (type1) == void_type_node
3521 && TREE_CODE (orig_op1) != NOP_EXPR)
3522 result_type = qualify_type (type2, type1);
3523 else if (integer_zerop (op2) && TREE_TYPE (type2) == void_type_node
3524 && TREE_CODE (orig_op2) != NOP_EXPR)
3525 result_type = qualify_type (type1, type2);
3526 else if (VOID_TYPE_P (TREE_TYPE (type1)))
3528 if (pedantic && TREE_CODE (TREE_TYPE (type2)) == FUNCTION_TYPE)
3529 pedwarn ("ISO C forbids conditional expr between `void *' and function pointer");
3530 result_type = build_pointer_type (qualify_type (TREE_TYPE (type1),
3531 TREE_TYPE (type2)));
3533 else if (VOID_TYPE_P (TREE_TYPE (type2)))
3535 if (pedantic && TREE_CODE (TREE_TYPE (type1)) == FUNCTION_TYPE)
3536 pedwarn ("ISO C forbids conditional expr between `void *' and function pointer");
3537 result_type = build_pointer_type (qualify_type (TREE_TYPE (type2),
3538 TREE_TYPE (type1)));
3542 pedwarn ("pointer type mismatch in conditional expression");
3543 result_type = build_pointer_type (void_type_node);
3546 else if (code1 == POINTER_TYPE && code2 == INTEGER_TYPE)
3548 if (! integer_zerop (op2))
3549 pedwarn ("pointer/integer type mismatch in conditional expression");
3552 op2 = null_pointer_node;
3554 result_type = type1;
3556 else if (code2 == POINTER_TYPE && code1 == INTEGER_TYPE)
3558 if (!integer_zerop (op1))
3559 pedwarn ("pointer/integer type mismatch in conditional expression");
3562 op1 = null_pointer_node;
3564 result_type = type2;
3569 if (flag_cond_mismatch)
3570 result_type = void_type_node;
3573 error ("type mismatch in conditional expression");
3574 return error_mark_node;
3578 /* Merge const and volatile flags of the incoming types. */
3580 = build_type_variant (result_type,
3581 TREE_READONLY (op1) || TREE_READONLY (op2),
3582 TREE_THIS_VOLATILE (op1) || TREE_THIS_VOLATILE (op2));
3584 if (result_type != TREE_TYPE (op1))
3585 op1 = convert_and_check (result_type, op1);
3586 if (result_type != TREE_TYPE (op2))
3587 op2 = convert_and_check (result_type, op2);
3589 if (TREE_CODE (ifexp) == INTEGER_CST)
3590 return pedantic_non_lvalue (integer_zerop (ifexp) ? op2 : op1);
3592 return fold (build (COND_EXPR, result_type, ifexp, op1, op2));
3595 /* Given a list of expressions, return a compound expression
3596 that performs them all and returns the value of the last of them. */
3599 build_compound_expr (list)
3602 return internal_build_compound_expr (list, TRUE);
3606 internal_build_compound_expr (list, first_p)
3612 if (TREE_CHAIN (list) == 0)
3614 /* Convert arrays to pointers when there really is a comma operator. */
3615 if (!first_p && TREE_CODE (TREE_TYPE (TREE_VALUE (list))) == ARRAY_TYPE)
3616 TREE_VALUE (list) = default_conversion (TREE_VALUE (list));
3618 #if 0 /* If something inside inhibited lvalueness, we should not override. */
3619 /* Consider (x, y+0), which is not an lvalue since y+0 is not. */
3621 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
3622 if (TREE_CODE (list) == NON_LVALUE_EXPR)
3623 list = TREE_OPERAND (list, 0);
3626 /* Don't let (0, 0) be null pointer constant. */
3627 if (!first_p && integer_zerop (TREE_VALUE (list)))
3628 return non_lvalue (TREE_VALUE (list));
3629 return TREE_VALUE (list);
3632 rest = internal_build_compound_expr (TREE_CHAIN (list), FALSE);
3634 if (! TREE_SIDE_EFFECTS (TREE_VALUE (list)))
3636 /* The left-hand operand of a comma expression is like an expression
3637 statement: with -W or -Wunused, we should warn if it doesn't have
3638 any side-effects, unless it was explicitly cast to (void). */
3639 if ((extra_warnings || warn_unused_value)
3640 && ! (TREE_CODE (TREE_VALUE (list)) == CONVERT_EXPR
3641 && VOID_TYPE_P (TREE_TYPE (TREE_VALUE (list)))))
3642 warning ("left-hand operand of comma expression has no effect");
3644 /* When pedantic, a compound expression can be neither an lvalue
3645 nor an integer constant expression. */
3650 /* With -Wunused, we should also warn if the left-hand operand does have
3651 side-effects, but computes a value which is not used. For example, in
3652 `foo() + bar(), baz()' the result of the `+' operator is not used,
3653 so we should issue a warning. */
3654 else if (warn_unused_value)
3655 warn_if_unused_value (TREE_VALUE (list));
3657 return build (COMPOUND_EXPR, TREE_TYPE (rest), TREE_VALUE (list), rest);
3660 /* Build an expression representing a cast to type TYPE of expression EXPR. */
3663 build_c_cast (type, expr)
3669 if (type == error_mark_node || expr == error_mark_node)
3670 return error_mark_node;
3671 type = TYPE_MAIN_VARIANT (type);
3674 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
3675 if (TREE_CODE (value) == NON_LVALUE_EXPR)
3676 value = TREE_OPERAND (value, 0);
3679 if (TREE_CODE (type) == ARRAY_TYPE)
3681 error ("cast specifies array type");
3682 return error_mark_node;
3685 if (TREE_CODE (type) == FUNCTION_TYPE)
3687 error ("cast specifies function type");
3688 return error_mark_node;
3691 if (type == TYPE_MAIN_VARIANT (TREE_TYPE (value)))
3695 if (TREE_CODE (type) == RECORD_TYPE
3696 || TREE_CODE (type) == UNION_TYPE)
3697 pedwarn ("ISO C forbids casting nonscalar to the same type");
3700 else if (TREE_CODE (type) == UNION_TYPE)
3703 if (TREE_CODE (TREE_TYPE (value)) == ARRAY_TYPE
3704 || TREE_CODE (TREE_TYPE (value)) == FUNCTION_TYPE)
3705 value = default_conversion (value);
3707 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
3708 if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (field)),
3709 TYPE_MAIN_VARIANT (TREE_TYPE (value))))
3718 pedwarn ("ISO C forbids casts to union type");
3719 if (TYPE_NAME (type) != 0)
3721 if (TREE_CODE (TYPE_NAME (type)) == IDENTIFIER_NODE)
3722 name = IDENTIFIER_POINTER (TYPE_NAME (type));
3724 name = IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type)));
3728 t = digest_init (type, build (CONSTRUCTOR, type, NULL_TREE,
3729 build_tree_list (field, value)),
3731 TREE_CONSTANT (t) = TREE_CONSTANT (value);
3734 error ("cast to union type from type not present in union");
3735 return error_mark_node;
3741 /* If casting to void, avoid the error that would come
3742 from default_conversion in the case of a non-lvalue array. */
3743 if (type == void_type_node)
3744 return build1 (CONVERT_EXPR, type, value);
3746 /* Convert functions and arrays to pointers,
3747 but don't convert any other types. */
3748 if (TREE_CODE (TREE_TYPE (value)) == FUNCTION_TYPE
3749 || TREE_CODE (TREE_TYPE (value)) == ARRAY_TYPE)
3750 value = default_conversion (value);
3751 otype = TREE_TYPE (value);
3753 /* Optionally warn about potentially worrisome casts. */
3756 && TREE_CODE (type) == POINTER_TYPE
3757 && TREE_CODE (otype) == POINTER_TYPE)
3759 tree in_type = type;
3760 tree in_otype = otype;
3763 /* Check that the qualifiers on IN_TYPE are a superset of
3764 the qualifiers of IN_OTYPE. The outermost level of
3765 POINTER_TYPE nodes is uninteresting and we stop as soon
3766 as we hit a non-POINTER_TYPE node on either type. */
3769 in_otype = TREE_TYPE (in_otype);
3770 in_type = TREE_TYPE (in_type);
3771 warn |= (TYPE_QUALS (in_otype) & ~TYPE_QUALS (in_type));
3773 while (TREE_CODE (in_type) == POINTER_TYPE
3774 && TREE_CODE (in_otype) == POINTER_TYPE);
3777 /* There are qualifiers present in IN_OTYPE that are not
3778 present in IN_TYPE. */
3779 warning ("cast discards qualifiers from pointer target type");
3782 /* Warn about possible alignment problems. */
3783 if (STRICT_ALIGNMENT && warn_cast_align
3784 && TREE_CODE (type) == POINTER_TYPE
3785 && TREE_CODE (otype) == POINTER_TYPE
3786 && TREE_CODE (TREE_TYPE (otype)) != VOID_TYPE
3787 && TREE_CODE (TREE_TYPE (otype)) != FUNCTION_TYPE
3788 /* Don't warn about opaque types, where the actual alignment
3789 restriction is unknown. */
3790 && !((TREE_CODE (TREE_TYPE (otype)) == UNION_TYPE
3791 || TREE_CODE (TREE_TYPE (otype)) == RECORD_TYPE)
3792 && TYPE_MODE (TREE_TYPE (otype)) == VOIDmode)
3793 && TYPE_ALIGN (TREE_TYPE (type)) > TYPE_ALIGN (TREE_TYPE (otype)))
3794 warning ("cast increases required alignment of target type");
3796 if (TREE_CODE (type) == INTEGER_TYPE
3797 && TREE_CODE (otype) == POINTER_TYPE
3798 && TYPE_PRECISION (type) != TYPE_PRECISION (otype)
3799 && !TREE_CONSTANT (value))
3800 warning ("cast from pointer to integer of different size");
3802 if (warn_bad_function_cast
3803 && TREE_CODE (value) == CALL_EXPR
3804 && TREE_CODE (type) != TREE_CODE (otype))
3805 warning ("cast does not match function type");
3807 if (TREE_CODE (type) == POINTER_TYPE
3808 && TREE_CODE (otype) == INTEGER_TYPE
3809 && TYPE_PRECISION (type) != TYPE_PRECISION (otype)
3810 /* Don't warn about converting any constant. */
3811 && !TREE_CONSTANT (value))
3812 warning ("cast to pointer from integer of different size");
3815 value = convert (type, value);
3817 /* Ignore any integer overflow caused by the cast. */
3818 if (TREE_CODE (value) == INTEGER_CST)
3820 TREE_OVERFLOW (value) = TREE_OVERFLOW (ovalue);
3821 TREE_CONSTANT_OVERFLOW (value) = TREE_CONSTANT_OVERFLOW (ovalue);
3825 /* Pedantically, don't ley (void *) (FOO *) 0 be a null pointer constant. */
3826 if (pedantic && TREE_CODE (value) == INTEGER_CST
3827 && TREE_CODE (expr) == INTEGER_CST
3828 && TREE_CODE (TREE_TYPE (expr)) != INTEGER_TYPE)
3829 value = non_lvalue (value);
3831 /* If pedantic, don't let a cast be an lvalue. */
3832 if (value == expr && pedantic)
3833 value = non_lvalue (value);
3838 /* Interpret a cast of expression EXPR to type TYPE. */
3840 c_cast_expr (type, expr)
3843 int saved_wsp = warn_strict_prototypes;
3845 /* This avoids warnings about unprototyped casts on
3846 integers. E.g. "#define SIG_DFL (void(*)())0". */
3847 if (TREE_CODE (expr) == INTEGER_CST)
3848 warn_strict_prototypes = 0;
3849 type = groktypename (type);
3850 warn_strict_prototypes = saved_wsp;
3852 return build_c_cast (type, expr);
3856 /* Build an assignment expression of lvalue LHS from value RHS.
3857 MODIFYCODE is the code for a binary operator that we use
3858 to combine the old value of LHS with RHS to get the new value.
3859 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment. */
3862 build_modify_expr (lhs, modifycode, rhs)
3864 enum tree_code modifycode;
3868 tree lhstype = TREE_TYPE (lhs);
3869 tree olhstype = lhstype;
3871 /* Types that aren't fully specified cannot be used in assignments. */
3872 lhs = require_complete_type (lhs);
3874 /* Avoid duplicate error messages from operands that had errors. */
3875 if (TREE_CODE (lhs) == ERROR_MARK || TREE_CODE (rhs) == ERROR_MARK)
3876 return error_mark_node;
3878 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
3879 /* Do not use STRIP_NOPS here. We do not want an enumerator
3880 whose value is 0 to count as a null pointer constant. */
3881 if (TREE_CODE (rhs) == NON_LVALUE_EXPR)
3882 rhs = TREE_OPERAND (rhs, 0);
3886 /* Handle control structure constructs used as "lvalues". */
3888 switch (TREE_CODE (lhs))
3890 /* Handle (a, b) used as an "lvalue". */
3892 pedantic_lvalue_warning (COMPOUND_EXPR);
3893 newrhs = build_modify_expr (TREE_OPERAND (lhs, 1), modifycode, rhs);
3894 if (TREE_CODE (newrhs) == ERROR_MARK)
3895 return error_mark_node;
3896 return build (COMPOUND_EXPR, lhstype,
3897 TREE_OPERAND (lhs, 0), newrhs);
3899 /* Handle (a ? b : c) used as an "lvalue". */
3901 pedantic_lvalue_warning (COND_EXPR);
3902 rhs = save_expr (rhs);
3904 /* Produce (a ? (b = rhs) : (c = rhs))
3905 except that the RHS goes through a save-expr
3906 so the code to compute it is only emitted once. */
3908 = build_conditional_expr (TREE_OPERAND (lhs, 0),
3909 build_modify_expr (TREE_OPERAND (lhs, 1),
3911 build_modify_expr (TREE_OPERAND (lhs, 2),
3913 if (TREE_CODE (cond) == ERROR_MARK)
3915 /* Make sure the code to compute the rhs comes out
3916 before the split. */
3917 return build (COMPOUND_EXPR, TREE_TYPE (lhs),
3918 /* But cast it to void to avoid an "unused" error. */
3919 convert (void_type_node, rhs), cond);
3925 /* If a binary op has been requested, combine the old LHS value with the RHS
3926 producing the value we should actually store into the LHS. */
3928 if (modifycode != NOP_EXPR)
3930 lhs = stabilize_reference (lhs);
3931 newrhs = build_binary_op (modifycode, lhs, rhs, 1);
3934 /* Handle a cast used as an "lvalue".
3935 We have already performed any binary operator using the value as cast.
3936 Now convert the result to the cast type of the lhs,
3937 and then true type of the lhs and store it there;
3938 then convert result back to the cast type to be the value
3939 of the assignment. */
3941 switch (TREE_CODE (lhs))
3946 case FIX_TRUNC_EXPR:
3947 case FIX_FLOOR_EXPR:
3948 case FIX_ROUND_EXPR:
3950 if (TREE_CODE (TREE_TYPE (newrhs)) == ARRAY_TYPE
3951 || TREE_CODE (TREE_TYPE (newrhs)) == FUNCTION_TYPE)
3952 newrhs = default_conversion (newrhs);
3954 tree inner_lhs = TREE_OPERAND (lhs, 0);
3956 result = build_modify_expr (inner_lhs, NOP_EXPR,
3957 convert (TREE_TYPE (inner_lhs),
3958 convert (lhstype, newrhs)));
3959 if (TREE_CODE (result) == ERROR_MARK)
3961 pedantic_lvalue_warning (CONVERT_EXPR);
3962 return convert (TREE_TYPE (lhs), result);
3969 /* Now we have handled acceptable kinds of LHS that are not truly lvalues.
3970 Reject anything strange now. */
3972 if (!lvalue_or_else (lhs, "invalid lvalue in assignment"))
3973 return error_mark_node;
3975 /* Warn about storing in something that is `const'. */
3977 if (TREE_READONLY (lhs) || TYPE_READONLY (lhstype)
3978 || ((TREE_CODE (lhstype) == RECORD_TYPE
3979 || TREE_CODE (lhstype) == UNION_TYPE)
3980 && C_TYPE_FIELDS_READONLY (lhstype)))
3981 readonly_warning (lhs, "assignment");
3983 /* If storing into a structure or union member,
3984 it has probably been given type `int'.
3985 Compute the type that would go with
3986 the actual amount of storage the member occupies. */
3988 if (TREE_CODE (lhs) == COMPONENT_REF
3989 && (TREE_CODE (lhstype) == INTEGER_TYPE
3990 || TREE_CODE (lhstype) == BOOLEAN_TYPE
3991 || TREE_CODE (lhstype) == REAL_TYPE
3992 || TREE_CODE (lhstype) == ENUMERAL_TYPE))
3993 lhstype = TREE_TYPE (get_unwidened (lhs, 0));
3995 /* If storing in a field that is in actuality a short or narrower than one,
3996 we must store in the field in its actual type. */
3998 if (lhstype != TREE_TYPE (lhs))
4000 lhs = copy_node (lhs);
4001 TREE_TYPE (lhs) = lhstype;
4004 /* Convert new value to destination type. */
4006 newrhs = convert_for_assignment (lhstype, newrhs, _("assignment"),
4007 NULL_TREE, NULL_TREE, 0);
4008 if (TREE_CODE (newrhs) == ERROR_MARK)
4009 return error_mark_node;
4013 result = build (MODIFY_EXPR, lhstype, lhs, newrhs);
4014 TREE_SIDE_EFFECTS (result) = 1;
4016 /* If we got the LHS in a different type for storing in,
4017 convert the result back to the nominal type of LHS
4018 so that the value we return always has the same type
4019 as the LHS argument. */
4021 if (olhstype == TREE_TYPE (result))
4023 return convert_for_assignment (olhstype, result, _("assignment"),
4024 NULL_TREE, NULL_TREE, 0);
4027 /* Convert value RHS to type TYPE as preparation for an assignment
4028 to an lvalue of type TYPE.
4029 The real work of conversion is done by `convert'.
4030 The purpose of this function is to generate error messages
4031 for assignments that are not allowed in C.
4032 ERRTYPE is a string to use in error messages:
4033 "assignment", "return", etc. If it is null, this is parameter passing
4034 for a function call (and different error messages are output).
4036 FUNNAME is the name of the function being called,
4037 as an IDENTIFIER_NODE, or null.
4038 PARMNUM is the number of the argument, for printing in error messages. */
4041 convert_for_assignment (type, rhs, errtype, fundecl, funname, parmnum)
4043 const char *errtype;
4044 tree fundecl, funname;
4047 enum tree_code codel = TREE_CODE (type);
4049 enum tree_code coder;
4051 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
4052 /* Do not use STRIP_NOPS here. We do not want an enumerator
4053 whose value is 0 to count as a null pointer constant. */
4054 if (TREE_CODE (rhs) == NON_LVALUE_EXPR)
4055 rhs = TREE_OPERAND (rhs, 0);
4057 if (TREE_CODE (TREE_TYPE (rhs)) == ARRAY_TYPE
4058 || TREE_CODE (TREE_TYPE (rhs)) == FUNCTION_TYPE)
4059 rhs = default_conversion (rhs);
4060 else if (optimize && TREE_CODE (rhs) == VAR_DECL)
4061 rhs = decl_constant_value_for_broken_optimization (rhs);
4063 rhstype = TREE_TYPE (rhs);
4064 coder = TREE_CODE (rhstype);
4066 if (coder == ERROR_MARK)
4067 return error_mark_node;
4069 if (TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (rhstype))
4071 overflow_warning (rhs);
4072 /* Check for Objective-C protocols. This will issue a warning if
4073 there are protocol violations. No need to use the return value. */
4074 maybe_objc_comptypes (type, rhstype, 0);
4078 if (coder == VOID_TYPE)
4080 error ("void value not ignored as it ought to be");
4081 return error_mark_node;
4083 /* A type converts to a reference to it.
4084 This code doesn't fully support references, it's just for the
4085 special case of va_start and va_copy. */
4086 if (codel == REFERENCE_TYPE
4087 && comptypes (TREE_TYPE (type), TREE_TYPE (rhs)) == 1)
4089 if (mark_addressable (rhs) == 0)
4090 return error_mark_node;
4091 rhs = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (rhs)), rhs);
4093 /* We already know that these two types are compatible, but they
4094 may not be exactly identical. In fact, `TREE_TYPE (type)' is
4095 likely to be __builtin_va_list and `TREE_TYPE (rhs)' is
4096 likely to be va_list, a typedef to __builtin_va_list, which
4097 is different enough that it will cause problems later. */
4098 if (TREE_TYPE (TREE_TYPE (rhs)) != TREE_TYPE (type))
4099 rhs = build1 (NOP_EXPR, build_pointer_type (TREE_TYPE (type)), rhs);
4101 rhs = build1 (NOP_EXPR, type, rhs);
4104 /* Arithmetic types all interconvert, and enum is treated like int. */
4105 else if ((codel == INTEGER_TYPE || codel == REAL_TYPE
4106 || codel == ENUMERAL_TYPE || codel == COMPLEX_TYPE
4107 || codel == BOOLEAN_TYPE)
4108 && (coder == INTEGER_TYPE || coder == REAL_TYPE
4109 || coder == ENUMERAL_TYPE || coder == COMPLEX_TYPE
4110 || coder == BOOLEAN_TYPE))
4111 return convert_and_check (type, rhs);
4113 /* Conversion to a transparent union from its member types.
4114 This applies only to function arguments. */
4115 else if (codel == UNION_TYPE && TYPE_TRANSPARENT_UNION (type) && ! errtype)
4118 tree marginal_memb_type = 0;
4120 for (memb_types = TYPE_FIELDS (type); memb_types;
4121 memb_types = TREE_CHAIN (memb_types))
4123 tree memb_type = TREE_TYPE (memb_types);
4125 if (comptypes (TYPE_MAIN_VARIANT (memb_type),
4126 TYPE_MAIN_VARIANT (rhstype)))
4129 if (TREE_CODE (memb_type) != POINTER_TYPE)
4132 if (coder == POINTER_TYPE)
4134 tree ttl = TREE_TYPE (memb_type);
4135 tree ttr = TREE_TYPE (rhstype);
4137 /* Any non-function converts to a [const][volatile] void *
4138 and vice versa; otherwise, targets must be the same.
4139 Meanwhile, the lhs target must have all the qualifiers of
4141 if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
4142 || comp_target_types (memb_type, rhstype))
4144 /* If this type won't generate any warnings, use it. */
4145 if (TYPE_QUALS (ttl) == TYPE_QUALS (ttr)
4146 || ((TREE_CODE (ttr) == FUNCTION_TYPE
4147 && TREE_CODE (ttl) == FUNCTION_TYPE)
4148 ? ((TYPE_QUALS (ttl) | TYPE_QUALS (ttr))
4149 == TYPE_QUALS (ttr))
4150 : ((TYPE_QUALS (ttl) | TYPE_QUALS (ttr))
4151 == TYPE_QUALS (ttl))))
4154 /* Keep looking for a better type, but remember this one. */
4155 if (! marginal_memb_type)
4156 marginal_memb_type = memb_type;
4160 /* Can convert integer zero to any pointer type. */
4161 if (integer_zerop (rhs)
4162 || (TREE_CODE (rhs) == NOP_EXPR
4163 && integer_zerop (TREE_OPERAND (rhs, 0))))
4165 rhs = null_pointer_node;
4170 if (memb_types || marginal_memb_type)
4174 /* We have only a marginally acceptable member type;
4175 it needs a warning. */
4176 tree ttl = TREE_TYPE (marginal_memb_type);
4177 tree ttr = TREE_TYPE (rhstype);
4179 /* Const and volatile mean something different for function
4180 types, so the usual warnings are not appropriate. */
4181 if (TREE_CODE (ttr) == FUNCTION_TYPE
4182 && TREE_CODE (ttl) == FUNCTION_TYPE)
4184 /* Because const and volatile on functions are
4185 restrictions that say the function will not do
4186 certain things, it is okay to use a const or volatile
4187 function where an ordinary one is wanted, but not
4189 if (TYPE_QUALS (ttl) & ~TYPE_QUALS (ttr))
4190 warn_for_assignment ("%s makes qualified function pointer from unqualified",
4191 errtype, funname, parmnum);
4193 else if (TYPE_QUALS (ttr) & ~TYPE_QUALS (ttl))
4194 warn_for_assignment ("%s discards qualifiers from pointer target type",
4199 if (pedantic && ! DECL_IN_SYSTEM_HEADER (fundecl))
4200 pedwarn ("ISO C prohibits argument conversion to union type");
4202 return build1 (NOP_EXPR, type, rhs);
4206 /* Conversions among pointers */
4207 else if ((codel == POINTER_TYPE || codel == REFERENCE_TYPE)
4208 && (coder == POINTER_TYPE || coder == REFERENCE_TYPE))
4210 tree ttl = TREE_TYPE (type);
4211 tree ttr = TREE_TYPE (rhstype);
4213 /* Any non-function converts to a [const][volatile] void *
4214 and vice versa; otherwise, targets must be the same.
4215 Meanwhile, the lhs target must have all the qualifiers of the rhs. */
4216 if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
4217 || comp_target_types (type, rhstype)
4218 || (unsigned_type (TYPE_MAIN_VARIANT (ttl))
4219 == unsigned_type (TYPE_MAIN_VARIANT (ttr))))
4222 && ((VOID_TYPE_P (ttl) && TREE_CODE (ttr) == FUNCTION_TYPE)
4225 /* Check TREE_CODE to catch cases like (void *) (char *) 0
4226 which are not ANSI null ptr constants. */
4227 && (!integer_zerop (rhs) || TREE_CODE (rhs) == NOP_EXPR)
4228 && TREE_CODE (ttl) == FUNCTION_TYPE)))
4229 warn_for_assignment ("ISO C forbids %s between function pointer and `void *'",
4230 errtype, funname, parmnum);
4231 /* Const and volatile mean something different for function types,
4232 so the usual warnings are not appropriate. */
4233 else if (TREE_CODE (ttr) != FUNCTION_TYPE
4234 && TREE_CODE (ttl) != FUNCTION_TYPE)
4236 if (TYPE_QUALS (ttr) & ~TYPE_QUALS (ttl))
4237 warn_for_assignment ("%s discards qualifiers from pointer target type",
4238 errtype, funname, parmnum);
4239 /* If this is not a case of ignoring a mismatch in signedness,
4241 else if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
4242 || comp_target_types (type, rhstype))
4244 /* If there is a mismatch, do warn. */
4246 warn_for_assignment ("pointer targets in %s differ in signedness",
4247 errtype, funname, parmnum);
4249 else if (TREE_CODE (ttl) == FUNCTION_TYPE
4250 && TREE_CODE (ttr) == FUNCTION_TYPE)
4252 /* Because const and volatile on functions are restrictions
4253 that say the function will not do certain things,
4254 it is okay to use a const or volatile function
4255 where an ordinary one is wanted, but not vice-versa. */
4256 if (TYPE_QUALS (ttl) & ~TYPE_QUALS (ttr))
4257 warn_for_assignment ("%s makes qualified function pointer from unqualified",
4258 errtype, funname, parmnum);
4262 warn_for_assignment ("%s from incompatible pointer type",
4263 errtype, funname, parmnum);
4264 return convert (type, rhs);
4266 else if (codel == POINTER_TYPE && coder == INTEGER_TYPE)
4268 /* An explicit constant 0 can convert to a pointer,
4269 or one that results from arithmetic, even including
4270 a cast to integer type. */
4271 if (! (TREE_CODE (rhs) == INTEGER_CST && integer_zerop (rhs))
4273 ! (TREE_CODE (rhs) == NOP_EXPR
4274 && TREE_CODE (TREE_TYPE (rhs)) == INTEGER_TYPE
4275 && TREE_CODE (TREE_OPERAND (rhs, 0)) == INTEGER_CST
4276 && integer_zerop (TREE_OPERAND (rhs, 0))))
4278 warn_for_assignment ("%s makes pointer from integer without a cast",
4279 errtype, funname, parmnum);
4280 return convert (type, rhs);
4282 return null_pointer_node;
4284 else if (codel == INTEGER_TYPE && coder == POINTER_TYPE)
4286 warn_for_assignment ("%s makes integer from pointer without a cast",
4287 errtype, funname, parmnum);
4288 return convert (type, rhs);
4290 else if (codel == BOOLEAN_TYPE && coder == POINTER_TYPE)
4291 return convert (type, rhs);
4297 tree selector = maybe_building_objc_message_expr ();
4299 if (selector && parmnum > 2)
4300 error ("incompatible type for argument %d of `%s'",
4301 parmnum - 2, IDENTIFIER_POINTER (selector));
4303 error ("incompatible type for argument %d of `%s'",
4304 parmnum, IDENTIFIER_POINTER (funname));
4307 error ("incompatible type for argument %d of indirect function call",
4311 error ("incompatible types in %s", errtype);
4313 return error_mark_node;
4316 /* Print a warning using MSGID.
4317 It gets OPNAME as its one parameter.
4318 If OPNAME is null, it is replaced by "passing arg ARGNUM of `FUNCTION'".
4319 FUNCTION and ARGNUM are handled specially if we are building an
4320 Objective-C selector. */
4323 warn_for_assignment (msgid, opname, function, argnum)
4331 tree selector = maybe_building_objc_message_expr ();
4334 if (selector && argnum > 2)
4336 function = selector;
4341 /* Function name is known; supply it. */
4342 const char *const argstring = _("passing arg %d of `%s'");
4343 new_opname = (char *) alloca (IDENTIFIER_LENGTH (function)
4344 + strlen (argstring) + 1 + 25
4346 sprintf (new_opname, argstring, argnum,
4347 IDENTIFIER_POINTER (function));
4351 /* Function name unknown (call through ptr); just give arg number.*/
4352 const char *const argnofun = _("passing arg %d of pointer to function");
4353 new_opname = (char *) alloca (strlen (argnofun) + 1 + 25 /*%d*/ + 1);
4354 sprintf (new_opname, argnofun, argnum);
4356 opname = new_opname;
4358 pedwarn (msgid, opname);
4361 /* If VALUE is a compound expr all of whose expressions are constant, then
4362 return its value. Otherwise, return error_mark_node.
4364 This is for handling COMPOUND_EXPRs as initializer elements
4365 which is allowed with a warning when -pedantic is specified. */
4368 valid_compound_expr_initializer (value, endtype)
4372 if (TREE_CODE (value) == COMPOUND_EXPR)
4374 if (valid_compound_expr_initializer (TREE_OPERAND (value, 0), endtype)
4376 return error_mark_node;
4377 return valid_compound_expr_initializer (TREE_OPERAND (value, 1),
4380 else if (! TREE_CONSTANT (value)
4381 && ! initializer_constant_valid_p (value, endtype))
4382 return error_mark_node;
4387 /* Perform appropriate conversions on the initial value of a variable,
4388 store it in the declaration DECL,
4389 and print any error messages that are appropriate.
4390 If the init is invalid, store an ERROR_MARK. */
4393 store_init_value (decl, init)
4398 /* If variable's type was invalidly declared, just ignore it. */
4400 type = TREE_TYPE (decl);
4401 if (TREE_CODE (type) == ERROR_MARK)
4404 /* Digest the specified initializer into an expression. */
4406 value = digest_init (type, init, TREE_STATIC (decl),
4407 TREE_STATIC (decl) || (pedantic && !flag_isoc99));
4409 /* Store the expression if valid; else report error. */
4412 /* Note that this is the only place we can detect the error
4413 in a case such as struct foo bar = (struct foo) { x, y };
4414 where there is one initial value which is a constructor expression. */
4415 if (value == error_mark_node)
4417 else if (TREE_STATIC (decl) && ! TREE_CONSTANT (value))
4419 error ("initializer for static variable is not constant");
4420 value = error_mark_node;
4422 else if (TREE_STATIC (decl)
4423 && initializer_constant_valid_p (value, TREE_TYPE (value)) == 0)
4425 error ("initializer for static variable uses complicated arithmetic");
4426 value = error_mark_node;
4430 if (pedantic && TREE_CODE (value) == CONSTRUCTOR)
4432 if (! TREE_CONSTANT (value))
4433 pedwarn ("aggregate initializer is not constant");
4434 else if (! TREE_STATIC (value))
4435 pedwarn ("aggregate initializer uses complicated arithmetic");
4440 if (warn_traditional && !in_system_header
4441 && AGGREGATE_TYPE_P (TREE_TYPE (decl)) && ! TREE_STATIC (decl))
4442 warning ("traditional C rejects automatic aggregate initialization");
4444 DECL_INITIAL (decl) = value;
4446 /* ANSI wants warnings about out-of-range constant initializers. */
4447 STRIP_TYPE_NOPS (value);
4448 constant_expression_warning (value);
4451 /* Methods for storing and printing names for error messages. */
4453 /* Implement a spelling stack that allows components of a name to be pushed
4454 and popped. Each element on the stack is this structure. */
4466 #define SPELLING_STRING 1
4467 #define SPELLING_MEMBER 2
4468 #define SPELLING_BOUNDS 3
4470 static struct spelling *spelling; /* Next stack element (unused). */
4471 static struct spelling *spelling_base; /* Spelling stack base. */
4472 static int spelling_size; /* Size of the spelling stack. */
4474 /* Macros to save and restore the spelling stack around push_... functions.
4475 Alternative to SAVE_SPELLING_STACK. */
4477 #define SPELLING_DEPTH() (spelling - spelling_base)
4478 #define RESTORE_SPELLING_DEPTH(DEPTH) (spelling = spelling_base + (DEPTH))
4480 /* Save and restore the spelling stack around arbitrary C code. */
4482 #define SAVE_SPELLING_DEPTH(code) \
4484 int __depth = SPELLING_DEPTH (); \
4486 RESTORE_SPELLING_DEPTH (__depth); \
4489 /* Push an element on the spelling stack with type KIND and assign VALUE
4492 #define PUSH_SPELLING(KIND, VALUE, MEMBER) \
4494 int depth = SPELLING_DEPTH (); \
4496 if (depth >= spelling_size) \
4498 spelling_size += 10; \
4499 if (spelling_base == 0) \
4501 = (struct spelling *) xmalloc (spelling_size * sizeof (struct spelling)); \
4504 = (struct spelling *) xrealloc (spelling_base, \
4505 spelling_size * sizeof (struct spelling)); \
4506 RESTORE_SPELLING_DEPTH (depth); \
4509 spelling->kind = (KIND); \
4510 spelling->MEMBER = (VALUE); \
4514 /* Push STRING on the stack. Printed literally. */
4517 push_string (string)
4520 PUSH_SPELLING (SPELLING_STRING, string, u.s);
4523 /* Push a member name on the stack. Printed as '.' STRING. */
4526 push_member_name (decl)
4530 const char *const string
4531 = DECL_NAME (decl) ? IDENTIFIER_POINTER (DECL_NAME (decl)) : "<anonymous>";
4532 PUSH_SPELLING (SPELLING_MEMBER, string, u.s);
4535 /* Push an array bounds on the stack. Printed as [BOUNDS]. */
4538 push_array_bounds (bounds)
4541 PUSH_SPELLING (SPELLING_BOUNDS, bounds, u.i);
4544 /* Compute the maximum size in bytes of the printed spelling. */
4552 for (p = spelling_base; p < spelling; p++)
4554 if (p->kind == SPELLING_BOUNDS)
4557 size += strlen (p->u.s) + 1;
4563 /* Print the spelling to BUFFER and return it. */
4566 print_spelling (buffer)
4572 for (p = spelling_base; p < spelling; p++)
4573 if (p->kind == SPELLING_BOUNDS)
4575 sprintf (d, "[%d]", p->u.i);
4581 if (p->kind == SPELLING_MEMBER)
4583 for (s = p->u.s; (*d = *s++); d++)
4590 /* Issue an error message for a bad initializer component.
4591 MSGID identifies the message.
4592 The component name is taken from the spelling stack. */
4600 error ("%s", msgid);
4601 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4603 error ("(near initialization for `%s')", ofwhat);
4606 /* Issue a pedantic warning for a bad initializer component.
4607 MSGID identifies the message.
4608 The component name is taken from the spelling stack. */
4611 pedwarn_init (msgid)
4616 pedwarn ("%s", msgid);
4617 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4619 pedwarn ("(near initialization for `%s')", ofwhat);
4622 /* Issue a warning for a bad initializer component.
4623 MSGID identifies the message.
4624 The component name is taken from the spelling stack. */
4627 warning_init (msgid)
4632 warning ("%s", msgid);
4633 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4635 warning ("(near initialization for `%s')", ofwhat);
4638 /* Digest the parser output INIT as an initializer for type TYPE.
4639 Return a C expression of type TYPE to represent the initial value.
4641 The arguments REQUIRE_CONSTANT and CONSTRUCTOR_CONSTANT request errors
4642 if non-constant initializers or elements are seen. CONSTRUCTOR_CONSTANT
4643 applies only to elements of constructors. */
4646 digest_init (type, init, require_constant, constructor_constant)
4648 int require_constant, constructor_constant;
4650 enum tree_code code = TREE_CODE (type);
4651 tree inside_init = init;
4653 if (type == error_mark_node
4654 || init == error_mark_node
4655 || TREE_TYPE (init) == error_mark_node)
4656 return error_mark_node;
4658 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
4659 /* Do not use STRIP_NOPS here. We do not want an enumerator
4660 whose value is 0 to count as a null pointer constant. */
4661 if (TREE_CODE (init) == NON_LVALUE_EXPR)
4662 inside_init = TREE_OPERAND (init, 0);
4664 inside_init = fold (inside_init);
4666 /* Initialization of an array of chars from a string constant
4667 optionally enclosed in braces. */
4669 if (code == ARRAY_TYPE)
4671 tree typ1 = TYPE_MAIN_VARIANT (TREE_TYPE (type));
4672 if ((typ1 == char_type_node
4673 || typ1 == signed_char_type_node
4674 || typ1 == unsigned_char_type_node
4675 || typ1 == unsigned_wchar_type_node
4676 || typ1 == signed_wchar_type_node)
4677 && ((inside_init && TREE_CODE (inside_init) == STRING_CST)))
4679 if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
4680 TYPE_MAIN_VARIANT (type)))
4683 if ((TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (inside_init)))
4685 && TYPE_PRECISION (typ1) == TYPE_PRECISION (char_type_node))
4687 error_init ("char-array initialized from wide string");
4688 return error_mark_node;
4690 if ((TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (inside_init)))
4692 && TYPE_PRECISION (typ1) != TYPE_PRECISION (char_type_node))
4694 error_init ("int-array initialized from non-wide string");
4695 return error_mark_node;
4698 TREE_TYPE (inside_init) = type;
4699 if (TYPE_DOMAIN (type) != 0
4700 && TYPE_SIZE (type) != 0
4701 && TREE_CODE (TYPE_SIZE (type)) == INTEGER_CST
4702 /* Subtract 1 (or sizeof (wchar_t))
4703 because it's ok to ignore the terminating null char
4704 that is counted in the length of the constant. */
4705 && 0 > compare_tree_int (TYPE_SIZE_UNIT (type),
4706 TREE_STRING_LENGTH (inside_init)
4707 - ((TYPE_PRECISION (typ1)
4708 != TYPE_PRECISION (char_type_node))
4709 ? (TYPE_PRECISION (wchar_type_node)
4712 pedwarn_init ("initializer-string for array of chars is too long");
4718 /* Any type can be initialized
4719 from an expression of the same type, optionally with braces. */
4721 if (inside_init && TREE_TYPE (inside_init) != 0
4722 && (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
4723 TYPE_MAIN_VARIANT (type))
4724 || (code == ARRAY_TYPE
4725 && comptypes (TREE_TYPE (inside_init), type))
4726 || (code == POINTER_TYPE
4727 && (TREE_CODE (TREE_TYPE (inside_init)) == ARRAY_TYPE
4728 || TREE_CODE (TREE_TYPE (inside_init)) == FUNCTION_TYPE)
4729 && comptypes (TREE_TYPE (TREE_TYPE (inside_init)),
4730 TREE_TYPE (type)))))
4732 if (code == POINTER_TYPE
4733 && (TREE_CODE (TREE_TYPE (inside_init)) == ARRAY_TYPE
4734 || TREE_CODE (TREE_TYPE (inside_init)) == FUNCTION_TYPE))
4735 inside_init = default_conversion (inside_init);
4736 else if (code == ARRAY_TYPE && TREE_CODE (inside_init) != STRING_CST
4737 && TREE_CODE (inside_init) != CONSTRUCTOR)
4739 error_init ("array initialized from non-constant array expression");
4740 return error_mark_node;
4743 if (optimize && TREE_CODE (inside_init) == VAR_DECL)
4744 inside_init = decl_constant_value_for_broken_optimization (inside_init);
4746 /* Compound expressions can only occur here if -pedantic or
4747 -pedantic-errors is specified. In the later case, we always want
4748 an error. In the former case, we simply want a warning. */
4749 if (require_constant && pedantic
4750 && TREE_CODE (inside_init) == COMPOUND_EXPR)
4753 = valid_compound_expr_initializer (inside_init,
4754 TREE_TYPE (inside_init));
4755 if (inside_init == error_mark_node)
4756 error_init ("initializer element is not constant");
4758 pedwarn_init ("initializer element is not constant");
4759 if (flag_pedantic_errors)
4760 inside_init = error_mark_node;
4762 else if (require_constant
4763 && (!TREE_CONSTANT (inside_init)
4764 /* This test catches things like `7 / 0' which
4765 result in an expression for which TREE_CONSTANT
4766 is true, but which is not actually something
4767 that is a legal constant. We really should not
4768 be using this function, because it is a part of
4769 the back-end. Instead, the expression should
4770 already have been turned into ERROR_MARK_NODE. */
4771 || !initializer_constant_valid_p (inside_init,
4772 TREE_TYPE (inside_init))))
4774 error_init ("initializer element is not constant");
4775 inside_init = error_mark_node;
4781 /* Handle scalar types, including conversions. */
4783 if (code == INTEGER_TYPE || code == REAL_TYPE || code == POINTER_TYPE
4784 || code == ENUMERAL_TYPE || code == BOOLEAN_TYPE || code == COMPLEX_TYPE)
4786 /* Note that convert_for_assignment calls default_conversion
4787 for arrays and functions. We must not call it in the
4788 case where inside_init is a null pointer constant. */
4790 = convert_for_assignment (type, init, _("initialization"),
4791 NULL_TREE, NULL_TREE, 0);
4793 if (require_constant && ! TREE_CONSTANT (inside_init))
4795 error_init ("initializer element is not constant");
4796 inside_init = error_mark_node;
4798 else if (require_constant
4799 && initializer_constant_valid_p (inside_init, TREE_TYPE (inside_init)) == 0)
4801 error_init ("initializer element is not computable at load time");
4802 inside_init = error_mark_node;
4808 /* Come here only for records and arrays. */
4810 if (COMPLETE_TYPE_P (type) && TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST)
4812 error_init ("variable-sized object may not be initialized");
4813 return error_mark_node;
4816 /* Traditionally, you can write struct foo x = 0;
4817 and it initializes the first element of x to 0. */
4818 if (flag_traditional)
4820 tree top = 0, prev = 0, otype = type;
4821 while (TREE_CODE (type) == RECORD_TYPE
4822 || TREE_CODE (type) == ARRAY_TYPE
4823 || TREE_CODE (type) == QUAL_UNION_TYPE
4824 || TREE_CODE (type) == UNION_TYPE)
4826 tree temp = build (CONSTRUCTOR, type, NULL_TREE, NULL_TREE);
4830 TREE_OPERAND (prev, 1) = build_tree_list (NULL_TREE, temp);
4832 if (TREE_CODE (type) == ARRAY_TYPE)
4833 type = TREE_TYPE (type);
4834 else if (TYPE_FIELDS (type))
4835 type = TREE_TYPE (TYPE_FIELDS (type));
4838 error_init ("invalid initializer");
4839 return error_mark_node;
4845 TREE_OPERAND (prev, 1)
4846 = build_tree_list (NULL_TREE,
4847 digest_init (type, init, require_constant,
4848 constructor_constant));
4852 return error_mark_node;
4854 error_init ("invalid initializer");
4855 return error_mark_node;
4858 /* Handle initializers that use braces. */
4860 /* Type of object we are accumulating a constructor for.
4861 This type is always a RECORD_TYPE, UNION_TYPE or ARRAY_TYPE. */
4862 static tree constructor_type;
4864 /* For a RECORD_TYPE or UNION_TYPE, this is the chain of fields
4866 static tree constructor_fields;
4868 /* For an ARRAY_TYPE, this is the specified index
4869 at which to store the next element we get. */
4870 static tree constructor_index;
4872 /* For an ARRAY_TYPE, this is the maximum index. */
4873 static tree constructor_max_index;
4875 /* For a RECORD_TYPE, this is the first field not yet written out. */
4876 static tree constructor_unfilled_fields;
4878 /* For an ARRAY_TYPE, this is the index of the first element
4879 not yet written out. */
4880 static tree constructor_unfilled_index;
4882 /* In a RECORD_TYPE, the byte index of the next consecutive field.
4883 This is so we can generate gaps between fields, when appropriate. */
4884 static tree constructor_bit_index;
4886 /* If we are saving up the elements rather than allocating them,
4887 this is the list of elements so far (in reverse order,
4888 most recent first). */
4889 static tree constructor_elements;
4891 /* 1 if constructor should be incrementally stored into a constructor chain,
4892 0 if all the elements should be kept in AVL tree. */
4893 static int constructor_incremental;
4895 /* 1 if so far this constructor's elements are all compile-time constants. */
4896 static int constructor_constant;
4898 /* 1 if so far this constructor's elements are all valid address constants. */
4899 static int constructor_simple;
4901 /* 1 if this constructor is erroneous so far. */
4902 static int constructor_erroneous;
4904 /* 1 if have called defer_addressed_constants. */
4905 static int constructor_subconstants_deferred;
4907 /* Structure for managing pending initializer elements, organized as an
4912 struct init_node *left, *right;
4913 struct init_node *parent;
4919 /* Tree of pending elements at this constructor level.
4920 These are elements encountered out of order
4921 which belong at places we haven't reached yet in actually
4923 Will never hold tree nodes across GC runs. */
4924 static struct init_node *constructor_pending_elts;
4926 /* The SPELLING_DEPTH of this constructor. */
4927 static int constructor_depth;
4929 /* 0 if implicitly pushing constructor levels is allowed. */
4930 int constructor_no_implicit = 0; /* 0 for C; 1 for some other languages. */
4932 static int require_constant_value;
4933 static int require_constant_elements;
4935 /* DECL node for which an initializer is being read.
4936 0 means we are reading a constructor expression
4937 such as (struct foo) {...}. */
4938 static tree constructor_decl;
4940 /* start_init saves the ASMSPEC arg here for really_start_incremental_init. */
4941 static const char *constructor_asmspec;
4943 /* Nonzero if this is an initializer for a top-level decl. */
4944 static int constructor_top_level;
4946 /* Nonzero if there were any member designators in this initializer. */
4947 static int constructor_designated;
4949 /* Nesting depth of designator list. */
4950 static int designator_depth;
4952 /* Nonzero if there were diagnosed errors in this designator list. */
4953 static int designator_errorneous;
4956 /* This stack has a level for each implicit or explicit level of
4957 structuring in the initializer, including the outermost one. It
4958 saves the values of most of the variables above. */
4960 struct constructor_range_stack;
4962 struct constructor_stack
4964 struct constructor_stack *next;
4969 tree unfilled_index;
4970 tree unfilled_fields;
4973 struct init_node *pending_elts;
4976 /* If nonzero, this value should replace the entire
4977 constructor at this level. */
4978 tree replacement_value;
4979 struct constructor_range_stack *range_stack;
4989 struct constructor_stack *constructor_stack;
4991 /* This stack represents designators from some range designator up to
4992 the last designator in the list. */
4994 struct constructor_range_stack
4996 struct constructor_range_stack *next, *prev;
4997 struct constructor_stack *stack;
5004 struct constructor_range_stack *constructor_range_stack;
5006 /* This stack records separate initializers that are nested.
5007 Nested initializers can't happen in ANSI C, but GNU C allows them
5008 in cases like { ... (struct foo) { ... } ... }. */
5010 struct initializer_stack
5012 struct initializer_stack *next;
5014 const char *asmspec;
5015 struct constructor_stack *constructor_stack;
5016 struct constructor_range_stack *constructor_range_stack;
5018 struct spelling *spelling;
5019 struct spelling *spelling_base;
5022 char require_constant_value;
5023 char require_constant_elements;
5027 struct initializer_stack *initializer_stack;
5029 /* Prepare to parse and output the initializer for variable DECL. */
5032 start_init (decl, asmspec_tree, top_level)
5038 struct initializer_stack *p
5039 = (struct initializer_stack *) xmalloc (sizeof (struct initializer_stack));
5040 const char *asmspec = 0;
5043 asmspec = TREE_STRING_POINTER (asmspec_tree);
5045 p->decl = constructor_decl;
5046 p->asmspec = constructor_asmspec;
5047 p->require_constant_value = require_constant_value;
5048 p->require_constant_elements = require_constant_elements;
5049 p->constructor_stack = constructor_stack;
5050 p->constructor_range_stack = constructor_range_stack;
5051 p->elements = constructor_elements;
5052 p->spelling = spelling;
5053 p->spelling_base = spelling_base;
5054 p->spelling_size = spelling_size;
5055 p->deferred = constructor_subconstants_deferred;
5056 p->top_level = constructor_top_level;
5057 p->next = initializer_stack;
5058 initializer_stack = p;
5060 constructor_decl = decl;
5061 constructor_asmspec = asmspec;
5062 constructor_subconstants_deferred = 0;
5063 constructor_designated = 0;
5064 constructor_top_level = top_level;
5068 require_constant_value = TREE_STATIC (decl);
5069 require_constant_elements
5070 = ((TREE_STATIC (decl) || (pedantic && !flag_isoc99))
5071 /* For a scalar, you can always use any value to initialize,
5072 even within braces. */
5073 && (TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE
5074 || TREE_CODE (TREE_TYPE (decl)) == RECORD_TYPE
5075 || TREE_CODE (TREE_TYPE (decl)) == UNION_TYPE
5076 || TREE_CODE (TREE_TYPE (decl)) == QUAL_UNION_TYPE));
5077 locus = IDENTIFIER_POINTER (DECL_NAME (decl));
5081 require_constant_value = 0;
5082 require_constant_elements = 0;
5083 locus = "(anonymous)";
5086 constructor_stack = 0;
5087 constructor_range_stack = 0;
5089 missing_braces_mentioned = 0;
5093 RESTORE_SPELLING_DEPTH (0);
5096 push_string (locus);
5102 struct initializer_stack *p = initializer_stack;
5104 /* Output subconstants (string constants, usually)
5105 that were referenced within this initializer and saved up.
5106 Must do this if and only if we called defer_addressed_constants. */
5107 if (constructor_subconstants_deferred)
5108 output_deferred_addressed_constants ();
5110 /* Free the whole constructor stack of this initializer. */
5111 while (constructor_stack)
5113 struct constructor_stack *q = constructor_stack;
5114 constructor_stack = q->next;
5118 if (constructor_range_stack)
5121 /* Pop back to the data of the outer initializer (if any). */
5122 constructor_decl = p->decl;
5123 constructor_asmspec = p->asmspec;
5124 require_constant_value = p->require_constant_value;
5125 require_constant_elements = p->require_constant_elements;
5126 constructor_stack = p->constructor_stack;
5127 constructor_range_stack = p->constructor_range_stack;
5128 constructor_elements = p->elements;
5129 spelling = p->spelling;
5130 spelling_base = p->spelling_base;
5131 spelling_size = p->spelling_size;
5132 constructor_subconstants_deferred = p->deferred;
5133 constructor_top_level = p->top_level;
5134 initializer_stack = p->next;
5138 /* Call here when we see the initializer is surrounded by braces.
5139 This is instead of a call to push_init_level;
5140 it is matched by a call to pop_init_level.
5142 TYPE is the type to initialize, for a constructor expression.
5143 For an initializer for a decl, TYPE is zero. */
5146 really_start_incremental_init (type)
5149 struct constructor_stack *p
5150 = (struct constructor_stack *) xmalloc (sizeof (struct constructor_stack));
5153 type = TREE_TYPE (constructor_decl);
5155 p->type = constructor_type;
5156 p->fields = constructor_fields;
5157 p->index = constructor_index;
5158 p->max_index = constructor_max_index;
5159 p->unfilled_index = constructor_unfilled_index;
5160 p->unfilled_fields = constructor_unfilled_fields;
5161 p->bit_index = constructor_bit_index;
5162 p->elements = constructor_elements;
5163 p->constant = constructor_constant;
5164 p->simple = constructor_simple;
5165 p->erroneous = constructor_erroneous;
5166 p->pending_elts = constructor_pending_elts;
5167 p->depth = constructor_depth;
5168 p->replacement_value = 0;
5172 p->incremental = constructor_incremental;
5173 p->designated = constructor_designated;
5175 constructor_stack = p;
5177 constructor_constant = 1;
5178 constructor_simple = 1;
5179 constructor_depth = SPELLING_DEPTH ();
5180 constructor_elements = 0;
5181 constructor_pending_elts = 0;
5182 constructor_type = type;
5183 constructor_incremental = 1;
5184 constructor_designated = 0;
5185 designator_depth = 0;
5186 designator_errorneous = 0;
5188 if (TREE_CODE (constructor_type) == RECORD_TYPE
5189 || TREE_CODE (constructor_type) == UNION_TYPE)
5191 constructor_fields = TYPE_FIELDS (constructor_type);
5192 /* Skip any nameless bit fields at the beginning. */
5193 while (constructor_fields != 0 && DECL_C_BIT_FIELD (constructor_fields)
5194 && DECL_NAME (constructor_fields) == 0)
5195 constructor_fields = TREE_CHAIN (constructor_fields);
5197 constructor_unfilled_fields = constructor_fields;
5198 constructor_bit_index = bitsize_zero_node;
5200 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5202 if (TYPE_DOMAIN (constructor_type))
5204 constructor_max_index
5205 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type));
5207 /* Detect non-empty initializations of zero-length arrays. */
5208 if (constructor_max_index == NULL_TREE
5209 && TYPE_SIZE (constructor_type))
5210 constructor_max_index = build_int_2 (-1, -1);
5213 = convert (bitsizetype,
5214 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
5217 constructor_index = bitsize_zero_node;
5219 constructor_unfilled_index = constructor_index;
5223 /* Handle the case of int x = {5}; */
5224 constructor_fields = constructor_type;
5225 constructor_unfilled_fields = constructor_type;
5229 /* Push down into a subobject, for initialization.
5230 If this is for an explicit set of braces, IMPLICIT is 0.
5231 If it is because the next element belongs at a lower level,
5232 IMPLICIT is 1 (or 2 if the push is because of designator list). */
5235 push_init_level (implicit)
5238 struct constructor_stack *p;
5239 tree value = NULL_TREE;
5241 /* If we've exhausted any levels that didn't have braces,
5243 while (constructor_stack->implicit)
5245 if ((TREE_CODE (constructor_type) == RECORD_TYPE
5246 || TREE_CODE (constructor_type) == UNION_TYPE)
5247 && constructor_fields == 0)
5248 process_init_element (pop_init_level (1));
5249 else if (TREE_CODE (constructor_type) == ARRAY_TYPE
5250 && tree_int_cst_lt (constructor_max_index, constructor_index))
5251 process_init_element (pop_init_level (1));
5256 /* Unless this is an explicit brace, we need to preserve previous
5260 if ((TREE_CODE (constructor_type) == RECORD_TYPE
5261 || TREE_CODE (constructor_type) == UNION_TYPE)
5262 && constructor_fields)
5263 value = find_init_member (constructor_fields);
5264 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5265 value = find_init_member (constructor_index);
5268 p = (struct constructor_stack *) xmalloc (sizeof (struct constructor_stack));
5269 p->type = constructor_type;
5270 p->fields = constructor_fields;
5271 p->index = constructor_index;
5272 p->max_index = constructor_max_index;
5273 p->unfilled_index = constructor_unfilled_index;
5274 p->unfilled_fields = constructor_unfilled_fields;
5275 p->bit_index = constructor_bit_index;
5276 p->elements = constructor_elements;
5277 p->constant = constructor_constant;
5278 p->simple = constructor_simple;
5279 p->erroneous = constructor_erroneous;
5280 p->pending_elts = constructor_pending_elts;
5281 p->depth = constructor_depth;
5282 p->replacement_value = 0;
5283 p->implicit = implicit;
5285 p->incremental = constructor_incremental;
5286 p->designated = constructor_designated;
5287 p->next = constructor_stack;
5289 constructor_stack = p;
5291 constructor_constant = 1;
5292 constructor_simple = 1;
5293 constructor_depth = SPELLING_DEPTH ();
5294 constructor_elements = 0;
5295 constructor_incremental = 1;
5296 constructor_designated = 0;
5297 constructor_pending_elts = 0;
5300 p->range_stack = constructor_range_stack;
5301 constructor_range_stack = 0;
5302 designator_depth = 0;
5303 designator_errorneous = 0;
5306 /* Don't die if an entire brace-pair level is superfluous
5307 in the containing level. */
5308 if (constructor_type == 0)
5310 else if (TREE_CODE (constructor_type) == RECORD_TYPE
5311 || TREE_CODE (constructor_type) == UNION_TYPE)
5313 /* Don't die if there are extra init elts at the end. */
5314 if (constructor_fields == 0)
5315 constructor_type = 0;
5318 constructor_type = TREE_TYPE (constructor_fields);
5319 push_member_name (constructor_fields);
5320 constructor_depth++;
5323 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5325 constructor_type = TREE_TYPE (constructor_type);
5326 push_array_bounds (tree_low_cst (constructor_index, 0));
5327 constructor_depth++;
5330 if (constructor_type == 0)
5332 error_init ("extra brace group at end of initializer");
5333 constructor_fields = 0;
5334 constructor_unfilled_fields = 0;
5338 if (value && TREE_CODE (value) == CONSTRUCTOR)
5340 constructor_constant = TREE_CONSTANT (value);
5341 constructor_simple = TREE_STATIC (value);
5342 constructor_elements = TREE_OPERAND (value, 1);
5343 if (constructor_elements
5344 && (TREE_CODE (constructor_type) == RECORD_TYPE
5345 || TREE_CODE (constructor_type) == ARRAY_TYPE))
5346 set_nonincremental_init ();
5349 if (implicit == 1 && warn_missing_braces && !missing_braces_mentioned)
5351 missing_braces_mentioned = 1;
5352 warning_init ("missing braces around initializer");
5355 if (TREE_CODE (constructor_type) == RECORD_TYPE
5356 || TREE_CODE (constructor_type) == UNION_TYPE)
5358 constructor_fields = TYPE_FIELDS (constructor_type);
5359 /* Skip any nameless bit fields at the beginning. */
5360 while (constructor_fields != 0 && DECL_C_BIT_FIELD (constructor_fields)
5361 && DECL_NAME (constructor_fields) == 0)
5362 constructor_fields = TREE_CHAIN (constructor_fields);
5364 constructor_unfilled_fields = constructor_fields;
5365 constructor_bit_index = bitsize_zero_node;
5367 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5369 if (TYPE_DOMAIN (constructor_type))
5371 constructor_max_index
5372 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type));
5374 /* Detect non-empty initializations of zero-length arrays. */
5375 if (constructor_max_index == NULL_TREE
5376 && TYPE_SIZE (constructor_type))
5377 constructor_max_index = build_int_2 (-1, -1);
5380 = convert (bitsizetype,
5381 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
5384 constructor_index = bitsize_zero_node;
5386 constructor_unfilled_index = constructor_index;
5387 if (value && TREE_CODE (value) == STRING_CST)
5389 /* We need to split the char/wchar array into individual
5390 characters, so that we don't have to special case it
5392 set_nonincremental_init_from_string (value);
5397 warning_init ("braces around scalar initializer");
5398 constructor_fields = constructor_type;
5399 constructor_unfilled_fields = constructor_type;
5403 /* At the end of an implicit or explicit brace level,
5404 finish up that level of constructor.
5405 If we were outputting the elements as they are read, return 0
5406 from inner levels (process_init_element ignores that),
5407 but return error_mark_node from the outermost level
5408 (that's what we want to put in DECL_INITIAL).
5409 Otherwise, return a CONSTRUCTOR expression. */
5412 pop_init_level (implicit)
5415 struct constructor_stack *p;
5416 HOST_WIDE_INT size = 0;
5417 tree constructor = 0;
5421 /* When we come to an explicit close brace,
5422 pop any inner levels that didn't have explicit braces. */
5423 while (constructor_stack->implicit)
5424 process_init_element (pop_init_level (1));
5426 if (constructor_range_stack)
5430 p = constructor_stack;
5432 if (constructor_type != 0)
5433 size = int_size_in_bytes (constructor_type);
5435 /* Error for initializing a flexible array member, or a zero-length
5436 array member in an inappropriate context. */
5437 if (constructor_type && constructor_fields
5438 && TREE_CODE (constructor_type) == ARRAY_TYPE
5439 && TYPE_DOMAIN (constructor_type)
5440 && ! TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type)))
5442 /* Silently discard empty initializations. The parser will
5443 already have pedwarned for empty brackets. */
5444 if (integer_zerop (constructor_unfilled_index))
5445 constructor_type = NULL_TREE;
5446 else if (! TYPE_SIZE (constructor_type))
5448 if (constructor_depth > 2)
5449 error_init ("initialization of flexible array member in a nested context");
5451 pedwarn_init ("initialization of a flexible array member");
5453 /* We have already issued an error message for the existance
5454 of a flexible array member not at the end of the structure.
5455 Discard the initializer so that we do not abort later. */
5456 if (TREE_CHAIN (constructor_fields) != NULL_TREE)
5457 constructor_type = NULL_TREE;
5460 /* Zero-length arrays are no longer special, so we should no longer
5465 /* Warn when some struct elements are implicitly initialized to zero. */
5468 && TREE_CODE (constructor_type) == RECORD_TYPE
5469 && constructor_unfilled_fields)
5471 /* Do not warn for flexible array members or zero-length arrays. */
5472 while (constructor_unfilled_fields
5473 && (! DECL_SIZE (constructor_unfilled_fields)
5474 || integer_zerop (DECL_SIZE (constructor_unfilled_fields))))
5475 constructor_unfilled_fields = TREE_CHAIN (constructor_unfilled_fields);
5477 /* Do not warn if this level of the initializer uses member
5478 designators; it is likely to be deliberate. */
5479 if (constructor_unfilled_fields && !constructor_designated)
5481 push_member_name (constructor_unfilled_fields);
5482 warning_init ("missing initializer");
5483 RESTORE_SPELLING_DEPTH (constructor_depth);
5487 /* Now output all pending elements. */
5488 constructor_incremental = 1;
5489 output_pending_init_elements (1);
5491 /* Pad out the end of the structure. */
5492 if (p->replacement_value)
5493 /* If this closes a superfluous brace pair,
5494 just pass out the element between them. */
5495 constructor = p->replacement_value;
5496 else if (constructor_type == 0)
5498 else if (TREE_CODE (constructor_type) != RECORD_TYPE
5499 && TREE_CODE (constructor_type) != UNION_TYPE
5500 && TREE_CODE (constructor_type) != ARRAY_TYPE)
5502 /* A nonincremental scalar initializer--just return
5503 the element, after verifying there is just one. */
5504 if (constructor_elements == 0)
5506 if (!constructor_erroneous)
5507 error_init ("empty scalar initializer");
5508 constructor = error_mark_node;
5510 else if (TREE_CHAIN (constructor_elements) != 0)
5512 error_init ("extra elements in scalar initializer");
5513 constructor = TREE_VALUE (constructor_elements);
5516 constructor = TREE_VALUE (constructor_elements);
5520 if (constructor_erroneous)
5521 constructor = error_mark_node;
5524 constructor = build (CONSTRUCTOR, constructor_type, NULL_TREE,
5525 nreverse (constructor_elements));
5526 if (constructor_constant)
5527 TREE_CONSTANT (constructor) = 1;
5528 if (constructor_constant && constructor_simple)
5529 TREE_STATIC (constructor) = 1;
5533 constructor_type = p->type;
5534 constructor_fields = p->fields;
5535 constructor_index = p->index;
5536 constructor_max_index = p->max_index;
5537 constructor_unfilled_index = p->unfilled_index;
5538 constructor_unfilled_fields = p->unfilled_fields;
5539 constructor_bit_index = p->bit_index;
5540 constructor_elements = p->elements;
5541 constructor_constant = p->constant;
5542 constructor_simple = p->simple;
5543 constructor_erroneous = p->erroneous;
5544 constructor_incremental = p->incremental;
5545 constructor_designated = p->designated;
5546 constructor_pending_elts = p->pending_elts;
5547 constructor_depth = p->depth;
5549 constructor_range_stack = p->range_stack;
5550 RESTORE_SPELLING_DEPTH (constructor_depth);
5552 constructor_stack = p->next;
5555 if (constructor == 0)
5557 if (constructor_stack == 0)
5558 return error_mark_node;
5564 /* Common handling for both array range and field name designators.
5565 ARRAY argument is non-zero for array ranges. Returns zero for success. */
5568 set_designator (array)
5572 enum tree_code subcode;
5574 /* Don't die if an entire brace-pair level is superfluous
5575 in the containing level. */
5576 if (constructor_type == 0)
5579 /* If there were errors in this designator list already, bail out silently. */
5580 if (designator_errorneous)
5583 if (!designator_depth)
5585 if (constructor_range_stack)
5588 /* Designator list starts at the level of closest explicit
5590 while (constructor_stack->implicit)
5591 process_init_element (pop_init_level (1));
5592 constructor_designated = 1;
5596 if (constructor_no_implicit)
5598 error_init ("initialization designators may not nest");
5602 if (TREE_CODE (constructor_type) == RECORD_TYPE
5603 || TREE_CODE (constructor_type) == UNION_TYPE)
5605 subtype = TREE_TYPE (constructor_fields);
5606 if (subtype != error_mark_node)
5607 subtype = TYPE_MAIN_VARIANT (subtype);
5609 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5611 subtype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
5616 subcode = TREE_CODE (subtype);
5617 if (array && subcode != ARRAY_TYPE)
5619 error_init ("array index in non-array initializer");
5622 else if (!array && subcode != RECORD_TYPE && subcode != UNION_TYPE)
5624 error_init ("field name not in record or union initializer");
5628 constructor_designated = 1;
5629 push_init_level (2);
5633 /* If there are range designators in designator list, push a new designator
5634 to constructor_range_stack. RANGE_END is end of such stack range or
5635 NULL_TREE if there is no range designator at this level. */
5638 push_range_stack (range_end)
5641 struct constructor_range_stack *p;
5643 p = (struct constructor_range_stack *)
5644 ggc_alloc (sizeof (struct constructor_range_stack));
5645 p->prev = constructor_range_stack;
5647 p->fields = constructor_fields;
5648 p->range_start = constructor_index;
5649 p->index = constructor_index;
5650 p->stack = constructor_stack;
5651 p->range_end = range_end;
5652 if (constructor_range_stack)
5653 constructor_range_stack->next = p;
5654 constructor_range_stack = p;
5657 /* Within an array initializer, specify the next index to be initialized.
5658 FIRST is that index. If LAST is nonzero, then initialize a range
5659 of indices, running from FIRST through LAST. */
5662 set_init_index (first, last)
5665 if (set_designator (1))
5668 designator_errorneous = 1;
5670 while ((TREE_CODE (first) == NOP_EXPR
5671 || TREE_CODE (first) == CONVERT_EXPR
5672 || TREE_CODE (first) == NON_LVALUE_EXPR)
5673 && (TYPE_MODE (TREE_TYPE (first))
5674 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (first, 0)))))
5675 first = TREE_OPERAND (first, 0);
5678 while ((TREE_CODE (last) == NOP_EXPR
5679 || TREE_CODE (last) == CONVERT_EXPR
5680 || TREE_CODE (last) == NON_LVALUE_EXPR)
5681 && (TYPE_MODE (TREE_TYPE (last))
5682 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (last, 0)))))
5683 last = TREE_OPERAND (last, 0);
5685 if (TREE_CODE (first) != INTEGER_CST)
5686 error_init ("nonconstant array index in initializer");
5687 else if (last != 0 && TREE_CODE (last) != INTEGER_CST)
5688 error_init ("nonconstant array index in initializer");
5689 else if (TREE_CODE (constructor_type) != ARRAY_TYPE)
5690 error_init ("array index in non-array initializer");
5691 else if (constructor_max_index
5692 && tree_int_cst_lt (constructor_max_index, first))
5693 error_init ("array index in initializer exceeds array bounds");
5696 constructor_index = convert (bitsizetype, first);
5700 if (tree_int_cst_equal (first, last))
5702 else if (tree_int_cst_lt (last, first))
5704 error_init ("empty index range in initializer");
5709 last = convert (bitsizetype, last);
5710 if (constructor_max_index != 0
5711 && tree_int_cst_lt (constructor_max_index, last))
5713 error_init ("array index range in initializer exceeds array bounds");
5720 designator_errorneous = 0;
5721 if (constructor_range_stack || last)
5722 push_range_stack (last);
5726 /* Within a struct initializer, specify the next field to be initialized. */
5729 set_init_label (fieldname)
5734 if (set_designator (0))
5737 designator_errorneous = 1;
5739 if (TREE_CODE (constructor_type) != RECORD_TYPE
5740 && TREE_CODE (constructor_type) != UNION_TYPE)
5742 error_init ("field name not in record or union initializer");
5746 for (tail = TYPE_FIELDS (constructor_type); tail;
5747 tail = TREE_CHAIN (tail))
5749 if (DECL_NAME (tail) == fieldname)
5754 error ("unknown field `%s' specified in initializer",
5755 IDENTIFIER_POINTER (fieldname));
5758 constructor_fields = tail;
5760 designator_errorneous = 0;
5761 if (constructor_range_stack)
5762 push_range_stack (NULL_TREE);
5766 /* Add a new initializer to the tree of pending initializers. PURPOSE
5767 indentifies the initializer, either array index or field in a structure.
5768 VALUE is the value of that index or field. */
5771 add_pending_init (purpose, value)
5772 tree purpose, value;
5774 struct init_node *p, **q, *r;
5776 q = &constructor_pending_elts;
5779 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5784 if (tree_int_cst_lt (purpose, p->purpose))
5786 else if (tree_int_cst_lt (p->purpose, purpose))
5790 if (TREE_SIDE_EFFECTS (p->value))
5791 warning_init ("initialized field with side-effects overwritten");
5801 bitpos = bit_position (purpose);
5805 if (tree_int_cst_lt (bitpos, bit_position (p->purpose)))
5807 else if (p->purpose != purpose)
5811 if (TREE_SIDE_EFFECTS (p->value))
5812 warning_init ("initialized field with side-effects overwritten");
5819 r = (struct init_node *) ggc_alloc (sizeof (struct init_node));
5820 r->purpose = purpose;
5831 struct init_node *s;
5835 if (p->balance == 0)
5837 else if (p->balance < 0)
5844 p->left->parent = p;
5861 constructor_pending_elts = r;
5866 struct init_node *t = r->right;
5870 r->right->parent = r;
5875 p->left->parent = p;
5878 p->balance = t->balance < 0;
5879 r->balance = -(t->balance > 0);
5894 constructor_pending_elts = t;
5900 /* p->balance == +1; growth of left side balances the node. */
5905 else /* r == p->right */
5907 if (p->balance == 0)
5908 /* Growth propagation from right side. */
5910 else if (p->balance > 0)
5917 p->right->parent = p;
5934 constructor_pending_elts = r;
5936 else /* r->balance == -1 */
5939 struct init_node *t = r->left;
5943 r->left->parent = r;
5948 p->right->parent = p;
5951 r->balance = (t->balance < 0);
5952 p->balance = -(t->balance > 0);
5967 constructor_pending_elts = t;
5973 /* p->balance == -1; growth of right side balances the node. */
5984 /* Build AVL tree from a sorted chain. */
5987 set_nonincremental_init ()
5991 if (TREE_CODE (constructor_type) != RECORD_TYPE
5992 && TREE_CODE (constructor_type) != ARRAY_TYPE)
5995 for (chain = constructor_elements; chain; chain = TREE_CHAIN (chain))
5996 add_pending_init (TREE_PURPOSE (chain), TREE_VALUE (chain));
5997 constructor_elements = 0;
5998 if (TREE_CODE (constructor_type) == RECORD_TYPE)
6000 constructor_unfilled_fields = TYPE_FIELDS (constructor_type);
6001 /* Skip any nameless bit fields at the beginning. */
6002 while (constructor_unfilled_fields != 0
6003 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
6004 && DECL_NAME (constructor_unfilled_fields) == 0)
6005 constructor_unfilled_fields = TREE_CHAIN (constructor_unfilled_fields);
6008 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6010 if (TYPE_DOMAIN (constructor_type))
6011 constructor_unfilled_index
6012 = convert (bitsizetype,
6013 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
6015 constructor_unfilled_index = bitsize_zero_node;
6017 constructor_incremental = 0;
6020 /* Build AVL tree from a string constant. */
6023 set_nonincremental_init_from_string (str)
6026 tree value, purpose, type;
6027 HOST_WIDE_INT val[2];
6028 const char *p, *end;
6029 int byte, wchar_bytes, charwidth, bitpos;
6031 if (TREE_CODE (constructor_type) != ARRAY_TYPE)
6034 if (TYPE_PRECISION (TREE_TYPE (TREE_TYPE (str)))
6035 == TYPE_PRECISION (char_type_node))
6037 else if (TYPE_PRECISION (TREE_TYPE (TREE_TYPE (str)))
6038 == TYPE_PRECISION (wchar_type_node))
6039 wchar_bytes = TYPE_PRECISION (wchar_type_node) / BITS_PER_UNIT;
6043 charwidth = TYPE_PRECISION (char_type_node);
6044 type = TREE_TYPE (constructor_type);
6045 p = TREE_STRING_POINTER (str);
6046 end = p + TREE_STRING_LENGTH (str);
6048 for (purpose = bitsize_zero_node;
6049 p < end && !tree_int_cst_lt (constructor_max_index, purpose);
6050 purpose = size_binop (PLUS_EXPR, purpose, bitsize_one_node))
6052 if (wchar_bytes == 1)
6054 val[1] = (unsigned char) *p++;
6061 for (byte = 0; byte < wchar_bytes; byte++)
6063 if (BYTES_BIG_ENDIAN)
6064 bitpos = (wchar_bytes - byte - 1) * charwidth;
6066 bitpos = byte * charwidth;
6067 val[bitpos < HOST_BITS_PER_WIDE_INT]
6068 |= ((unsigned HOST_WIDE_INT) ((unsigned char) *p++))
6069 << (bitpos % HOST_BITS_PER_WIDE_INT);
6073 if (!TREE_UNSIGNED (type))
6075 bitpos = ((wchar_bytes - 1) * charwidth) + HOST_BITS_PER_CHAR;
6076 if (bitpos < HOST_BITS_PER_WIDE_INT)
6078 if (val[1] & (((HOST_WIDE_INT) 1) << (bitpos - 1)))
6080 val[1] |= ((HOST_WIDE_INT) -1) << bitpos;
6084 else if (bitpos == HOST_BITS_PER_WIDE_INT)
6089 else if (val[0] & (((HOST_WIDE_INT) 1)
6090 << (bitpos - 1 - HOST_BITS_PER_WIDE_INT)))
6091 val[0] |= ((HOST_WIDE_INT) -1)
6092 << (bitpos - HOST_BITS_PER_WIDE_INT);
6095 value = build_int_2 (val[1], val[0]);
6096 TREE_TYPE (value) = type;
6097 add_pending_init (purpose, value);
6100 constructor_incremental = 0;
6103 /* Return value of FIELD in pending initializer or zero if the field was
6104 not initialized yet. */
6107 find_init_member (field)
6110 struct init_node *p;
6112 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6114 if (constructor_incremental
6115 && tree_int_cst_lt (field, constructor_unfilled_index))
6116 set_nonincremental_init ();
6118 p = constructor_pending_elts;
6121 if (tree_int_cst_lt (field, p->purpose))
6123 else if (tree_int_cst_lt (p->purpose, field))
6129 else if (TREE_CODE (constructor_type) == RECORD_TYPE)
6131 tree bitpos = bit_position (field);
6133 if (constructor_incremental
6134 && (!constructor_unfilled_fields
6135 || tree_int_cst_lt (bitpos,
6136 bit_position (constructor_unfilled_fields))))
6137 set_nonincremental_init ();
6139 p = constructor_pending_elts;
6142 if (field == p->purpose)
6144 else if (tree_int_cst_lt (bitpos, bit_position (p->purpose)))
6150 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6152 if (constructor_elements
6153 && TREE_PURPOSE (constructor_elements) == field)
6154 return TREE_VALUE (constructor_elements);
6159 /* "Output" the next constructor element.
6160 At top level, really output it to assembler code now.
6161 Otherwise, collect it in a list from which we will make a CONSTRUCTOR.
6162 TYPE is the data type that the containing data type wants here.
6163 FIELD is the field (a FIELD_DECL) or the index that this element fills.
6165 PENDING if non-nil means output pending elements that belong
6166 right after this element. (PENDING is normally 1;
6167 it is 0 while outputting pending elements, to avoid recursion.) */
6170 output_init_element (value, type, field, pending)
6171 tree value, type, field;
6174 if (TREE_CODE (TREE_TYPE (value)) == FUNCTION_TYPE
6175 || (TREE_CODE (TREE_TYPE (value)) == ARRAY_TYPE
6176 && !(TREE_CODE (value) == STRING_CST
6177 && TREE_CODE (type) == ARRAY_TYPE
6178 && TREE_CODE (TREE_TYPE (type)) == INTEGER_TYPE)
6179 && !comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (value)),
6180 TYPE_MAIN_VARIANT (type))))
6181 value = default_conversion (value);
6183 if (value == error_mark_node)
6184 constructor_erroneous = 1;
6185 else if (!TREE_CONSTANT (value))
6186 constructor_constant = 0;
6187 else if (initializer_constant_valid_p (value, TREE_TYPE (value)) == 0
6188 || ((TREE_CODE (constructor_type) == RECORD_TYPE
6189 || TREE_CODE (constructor_type) == UNION_TYPE)
6190 && DECL_C_BIT_FIELD (field)
6191 && TREE_CODE (value) != INTEGER_CST))
6192 constructor_simple = 0;
6194 if (require_constant_value && ! TREE_CONSTANT (value))
6196 error_init ("initializer element is not constant");
6197 value = error_mark_node;
6199 else if (require_constant_elements
6200 && initializer_constant_valid_p (value, TREE_TYPE (value)) == 0)
6201 pedwarn ("initializer element is not computable at load time");
6203 /* If this field is empty (and not at the end of structure),
6204 don't do anything other than checking the initializer. */
6206 && (TREE_TYPE (field) == error_mark_node
6207 || (COMPLETE_TYPE_P (TREE_TYPE (field))
6208 && integer_zerop (TYPE_SIZE (TREE_TYPE (field)))
6209 && (TREE_CODE (constructor_type) == ARRAY_TYPE
6210 || TREE_CHAIN (field)))))
6213 if (value == error_mark_node)
6215 constructor_erroneous = 1;
6219 /* If this element doesn't come next in sequence,
6220 put it on constructor_pending_elts. */
6221 if (TREE_CODE (constructor_type) == ARRAY_TYPE
6222 && (!constructor_incremental
6223 || !tree_int_cst_equal (field, constructor_unfilled_index)))
6225 if (constructor_incremental
6226 && tree_int_cst_lt (field, constructor_unfilled_index))
6227 set_nonincremental_init ();
6229 add_pending_init (field,
6230 digest_init (type, value, require_constant_value,
6231 require_constant_elements));
6234 else if (TREE_CODE (constructor_type) == RECORD_TYPE
6235 && (!constructor_incremental
6236 || field != constructor_unfilled_fields))
6238 /* We do this for records but not for unions. In a union,
6239 no matter which field is specified, it can be initialized
6240 right away since it starts at the beginning of the union. */
6241 if (constructor_incremental)
6243 if (!constructor_unfilled_fields)
6244 set_nonincremental_init ();
6247 tree bitpos, unfillpos;
6249 bitpos = bit_position (field);
6250 unfillpos = bit_position (constructor_unfilled_fields);
6252 if (tree_int_cst_lt (bitpos, unfillpos))
6253 set_nonincremental_init ();
6257 add_pending_init (field,
6258 digest_init (type, value, require_constant_value,
6259 require_constant_elements));
6262 else if (TREE_CODE (constructor_type) == UNION_TYPE
6263 && constructor_elements)
6265 if (TREE_SIDE_EFFECTS (TREE_VALUE (constructor_elements)))
6266 warning_init ("initialized field with side-effects overwritten");
6268 /* We can have just one union field set. */
6269 constructor_elements = 0;
6272 /* Otherwise, output this element either to
6273 constructor_elements or to the assembler file. */
6275 if (field && TREE_CODE (field) == INTEGER_CST)
6276 field = copy_node (field);
6277 constructor_elements
6278 = tree_cons (field, digest_init (type, value,
6279 require_constant_value,
6280 require_constant_elements),
6281 constructor_elements);
6283 /* Advance the variable that indicates sequential elements output. */
6284 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6285 constructor_unfilled_index
6286 = size_binop (PLUS_EXPR, constructor_unfilled_index,
6288 else if (TREE_CODE (constructor_type) == RECORD_TYPE)
6290 constructor_unfilled_fields
6291 = TREE_CHAIN (constructor_unfilled_fields);
6293 /* Skip any nameless bit fields. */
6294 while (constructor_unfilled_fields != 0
6295 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
6296 && DECL_NAME (constructor_unfilled_fields) == 0)
6297 constructor_unfilled_fields =
6298 TREE_CHAIN (constructor_unfilled_fields);
6300 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6301 constructor_unfilled_fields = 0;
6303 /* Now output any pending elements which have become next. */
6305 output_pending_init_elements (0);
6308 /* Output any pending elements which have become next.
6309 As we output elements, constructor_unfilled_{fields,index}
6310 advances, which may cause other elements to become next;
6311 if so, they too are output.
6313 If ALL is 0, we return when there are
6314 no more pending elements to output now.
6316 If ALL is 1, we output space as necessary so that
6317 we can output all the pending elements. */
6320 output_pending_init_elements (all)
6323 struct init_node *elt = constructor_pending_elts;
6328 /* Look thru the whole pending tree.
6329 If we find an element that should be output now,
6330 output it. Otherwise, set NEXT to the element
6331 that comes first among those still pending. */
6336 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6338 if (tree_int_cst_equal (elt->purpose,
6339 constructor_unfilled_index))
6340 output_init_element (elt->value,
6341 TREE_TYPE (constructor_type),
6342 constructor_unfilled_index, 0);
6343 else if (tree_int_cst_lt (constructor_unfilled_index,
6346 /* Advance to the next smaller node. */
6351 /* We have reached the smallest node bigger than the
6352 current unfilled index. Fill the space first. */
6353 next = elt->purpose;
6359 /* Advance to the next bigger node. */
6364 /* We have reached the biggest node in a subtree. Find
6365 the parent of it, which is the next bigger node. */
6366 while (elt->parent && elt->parent->right == elt)
6369 if (elt && tree_int_cst_lt (constructor_unfilled_index,
6372 next = elt->purpose;
6378 else if (TREE_CODE (constructor_type) == RECORD_TYPE
6379 || TREE_CODE (constructor_type) == UNION_TYPE)
6381 tree ctor_unfilled_bitpos, elt_bitpos;
6383 /* If the current record is complete we are done. */
6384 if (constructor_unfilled_fields == 0)
6387 ctor_unfilled_bitpos = bit_position (constructor_unfilled_fields);
6388 elt_bitpos = bit_position (elt->purpose);
6389 /* We can't compare fields here because there might be empty
6390 fields in between. */
6391 if (tree_int_cst_equal (elt_bitpos, ctor_unfilled_bitpos))
6393 constructor_unfilled_fields = elt->purpose;
6394 output_init_element (elt->value, TREE_TYPE (elt->purpose),
6397 else if (tree_int_cst_lt (ctor_unfilled_bitpos, elt_bitpos))
6399 /* Advance to the next smaller node. */
6404 /* We have reached the smallest node bigger than the
6405 current unfilled field. Fill the space first. */
6406 next = elt->purpose;
6412 /* Advance to the next bigger node. */
6417 /* We have reached the biggest node in a subtree. Find
6418 the parent of it, which is the next bigger node. */
6419 while (elt->parent && elt->parent->right == elt)
6423 && (tree_int_cst_lt (ctor_unfilled_bitpos,
6424 bit_position (elt->purpose))))
6426 next = elt->purpose;
6434 /* Ordinarily return, but not if we want to output all
6435 and there are elements left. */
6436 if (! (all && next != 0))
6439 /* If it's not incremental, just skip over the gap, so that after
6440 jumping to retry we will output the next successive element. */
6441 if (TREE_CODE (constructor_type) == RECORD_TYPE
6442 || TREE_CODE (constructor_type) == UNION_TYPE)
6443 constructor_unfilled_fields = next;
6444 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6445 constructor_unfilled_index = next;
6447 /* ELT now points to the node in the pending tree with the next
6448 initializer to output. */
6452 /* Add one non-braced element to the current constructor level.
6453 This adjusts the current position within the constructor's type.
6454 This may also start or terminate implicit levels
6455 to handle a partly-braced initializer.
6457 Once this has found the correct level for the new element,
6458 it calls output_init_element. */
6461 process_init_element (value)
6464 tree orig_value = value;
6465 int string_flag = value != 0 && TREE_CODE (value) == STRING_CST;
6467 designator_depth = 0;
6468 designator_errorneous = 0;
6470 /* Handle superfluous braces around string cst as in
6471 char x[] = {"foo"}; */
6474 && TREE_CODE (constructor_type) == ARRAY_TYPE
6475 && TREE_CODE (TREE_TYPE (constructor_type)) == INTEGER_TYPE
6476 && integer_zerop (constructor_unfilled_index))
6478 if (constructor_stack->replacement_value)
6479 error_init ("excess elements in char array initializer");
6480 constructor_stack->replacement_value = value;
6484 if (constructor_stack->replacement_value != 0)
6486 error_init ("excess elements in struct initializer");
6490 /* Ignore elements of a brace group if it is entirely superfluous
6491 and has already been diagnosed. */
6492 if (constructor_type == 0)
6495 /* If we've exhausted any levels that didn't have braces,
6497 while (constructor_stack->implicit)
6499 if ((TREE_CODE (constructor_type) == RECORD_TYPE
6500 || TREE_CODE (constructor_type) == UNION_TYPE)
6501 && constructor_fields == 0)
6502 process_init_element (pop_init_level (1));
6503 else if (TREE_CODE (constructor_type) == ARRAY_TYPE
6504 && (constructor_max_index == 0
6505 || tree_int_cst_lt (constructor_max_index,
6506 constructor_index)))
6507 process_init_element (pop_init_level (1));
6512 /* In the case of [LO ... HI] = VALUE, only evaluate VALUE once. */
6513 if (constructor_range_stack)
6514 value = save_expr (value);
6518 if (TREE_CODE (constructor_type) == RECORD_TYPE)
6521 enum tree_code fieldcode;
6523 if (constructor_fields == 0)
6525 pedwarn_init ("excess elements in struct initializer");
6529 fieldtype = TREE_TYPE (constructor_fields);
6530 if (fieldtype != error_mark_node)
6531 fieldtype = TYPE_MAIN_VARIANT (fieldtype);
6532 fieldcode = TREE_CODE (fieldtype);
6534 /* Accept a string constant to initialize a subarray. */
6536 && fieldcode == ARRAY_TYPE
6537 && TREE_CODE (TREE_TYPE (fieldtype)) == INTEGER_TYPE
6540 /* Otherwise, if we have come to a subaggregate,
6541 and we don't have an element of its type, push into it. */
6542 else if (value != 0 && !constructor_no_implicit
6543 && value != error_mark_node
6544 && TYPE_MAIN_VARIANT (TREE_TYPE (value)) != fieldtype
6545 && (fieldcode == RECORD_TYPE || fieldcode == ARRAY_TYPE
6546 || fieldcode == UNION_TYPE))
6548 push_init_level (1);
6554 push_member_name (constructor_fields);
6555 output_init_element (value, fieldtype, constructor_fields, 1);
6556 RESTORE_SPELLING_DEPTH (constructor_depth);
6559 /* Do the bookkeeping for an element that was
6560 directly output as a constructor. */
6562 /* For a record, keep track of end position of last field. */
6563 if (DECL_SIZE (constructor_fields))
6564 constructor_bit_index
6565 = size_binop (PLUS_EXPR,
6566 bit_position (constructor_fields),
6567 DECL_SIZE (constructor_fields));
6569 constructor_unfilled_fields = TREE_CHAIN (constructor_fields);
6570 /* Skip any nameless bit fields. */
6571 while (constructor_unfilled_fields != 0
6572 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
6573 && DECL_NAME (constructor_unfilled_fields) == 0)
6574 constructor_unfilled_fields =
6575 TREE_CHAIN (constructor_unfilled_fields);
6578 constructor_fields = TREE_CHAIN (constructor_fields);
6579 /* Skip any nameless bit fields at the beginning. */
6580 while (constructor_fields != 0
6581 && DECL_C_BIT_FIELD (constructor_fields)
6582 && DECL_NAME (constructor_fields) == 0)
6583 constructor_fields = TREE_CHAIN (constructor_fields);
6585 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6588 enum tree_code fieldcode;
6590 if (constructor_fields == 0)
6592 pedwarn_init ("excess elements in union initializer");
6596 fieldtype = TREE_TYPE (constructor_fields);
6597 if (fieldtype != error_mark_node)
6598 fieldtype = TYPE_MAIN_VARIANT (fieldtype);
6599 fieldcode = TREE_CODE (fieldtype);
6601 /* Warn that traditional C rejects initialization of unions.
6602 We skip the warning if the value is zero. This is done
6603 under the assumption that the zero initializer in user
6604 code appears conditioned on e.g. __STDC__ to avoid
6605 "missing initializer" warnings and relies on default
6606 initialization to zero in the traditional C case.
6607 We also skip the warning if the initializer is designated,
6608 again on the assumption that this must be conditional on
6609 __STDC__ anyway (and we've already complained about the
6610 member-designator already). */
6611 if (warn_traditional && !in_system_header && !constructor_designated
6612 && !(value && (integer_zerop (value) || real_zerop (value))))
6613 warning ("traditional C rejects initialization of unions");
6615 /* Accept a string constant to initialize a subarray. */
6617 && fieldcode == ARRAY_TYPE
6618 && TREE_CODE (TREE_TYPE (fieldtype)) == INTEGER_TYPE
6621 /* Otherwise, if we have come to a subaggregate,
6622 and we don't have an element of its type, push into it. */
6623 else if (value != 0 && !constructor_no_implicit
6624 && value != error_mark_node
6625 && TYPE_MAIN_VARIANT (TREE_TYPE (value)) != fieldtype
6626 && (fieldcode == RECORD_TYPE || fieldcode == ARRAY_TYPE
6627 || fieldcode == UNION_TYPE))
6629 push_init_level (1);
6635 push_member_name (constructor_fields);
6636 output_init_element (value, fieldtype, constructor_fields, 1);
6637 RESTORE_SPELLING_DEPTH (constructor_depth);
6640 /* Do the bookkeeping for an element that was
6641 directly output as a constructor. */
6643 constructor_bit_index = DECL_SIZE (constructor_fields);
6644 constructor_unfilled_fields = TREE_CHAIN (constructor_fields);
6647 constructor_fields = 0;
6649 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6651 tree elttype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
6652 enum tree_code eltcode = TREE_CODE (elttype);
6654 /* Accept a string constant to initialize a subarray. */
6656 && eltcode == ARRAY_TYPE
6657 && TREE_CODE (TREE_TYPE (elttype)) == INTEGER_TYPE
6660 /* Otherwise, if we have come to a subaggregate,
6661 and we don't have an element of its type, push into it. */
6662 else if (value != 0 && !constructor_no_implicit
6663 && value != error_mark_node
6664 && TYPE_MAIN_VARIANT (TREE_TYPE (value)) != elttype
6665 && (eltcode == RECORD_TYPE || eltcode == ARRAY_TYPE
6666 || eltcode == UNION_TYPE))
6668 push_init_level (1);
6672 if (constructor_max_index != 0
6673 && (tree_int_cst_lt (constructor_max_index, constructor_index)
6674 || integer_all_onesp (constructor_max_index)))
6676 pedwarn_init ("excess elements in array initializer");
6680 /* Now output the actual element. */
6683 push_array_bounds (tree_low_cst (constructor_index, 0));
6684 output_init_element (value, elttype, constructor_index, 1);
6685 RESTORE_SPELLING_DEPTH (constructor_depth);
6689 = size_binop (PLUS_EXPR, constructor_index, bitsize_one_node);
6692 /* If we are doing the bookkeeping for an element that was
6693 directly output as a constructor, we must update
6694 constructor_unfilled_index. */
6695 constructor_unfilled_index = constructor_index;
6698 /* Handle the sole element allowed in a braced initializer
6699 for a scalar variable. */
6700 else if (constructor_fields == 0)
6702 pedwarn_init ("excess elements in scalar initializer");
6708 output_init_element (value, constructor_type, NULL_TREE, 1);
6709 constructor_fields = 0;
6712 /* Handle range initializers either at this level or anywhere higher
6713 in the designator stack. */
6714 if (constructor_range_stack)
6716 struct constructor_range_stack *p, *range_stack;
6719 range_stack = constructor_range_stack;
6720 constructor_range_stack = 0;
6721 while (constructor_stack != range_stack->stack)
6723 if (!constructor_stack->implicit)
6725 process_init_element (pop_init_level (1));
6727 for (p = range_stack;
6728 !p->range_end || tree_int_cst_equal (p->index, p->range_end);
6731 if (!constructor_stack->implicit)
6733 process_init_element (pop_init_level (1));
6736 p->index = size_binop (PLUS_EXPR, p->index, bitsize_one_node);
6737 if (tree_int_cst_equal (p->index, p->range_end) && !p->prev)
6742 constructor_index = p->index;
6743 constructor_fields = p->fields;
6744 if (finish && p->range_end && p->index == p->range_start)
6752 push_init_level (2);
6753 p->stack = constructor_stack;
6754 if (p->range_end && tree_int_cst_equal (p->index, p->range_end))
6755 p->index = p->range_start;
6759 constructor_range_stack = range_stack;
6766 constructor_range_stack = 0;
6769 /* Build a simple asm-statement, from one string literal. */
6771 simple_asm_stmt (expr)
6776 if (TREE_CODE (expr) == ADDR_EXPR)
6777 expr = TREE_OPERAND (expr, 0);
6779 if (TREE_CODE (expr) == STRING_CST)
6783 if (TREE_CHAIN (expr))
6784 expr = combine_strings (expr);
6785 stmt = add_stmt (build_stmt (ASM_STMT, NULL_TREE, expr,
6786 NULL_TREE, NULL_TREE,
6788 ASM_INPUT_P (stmt) = 1;
6792 error ("argument of `asm' is not a constant string");
6796 /* Build an asm-statement, whose components are a CV_QUALIFIER, a
6797 STRING, some OUTPUTS, some INPUTS, and some CLOBBERS. */
6800 build_asm_stmt (cv_qualifier, string, outputs, inputs, clobbers)
6809 if (TREE_CHAIN (string))
6810 string = combine_strings (string);
6811 if (TREE_CODE (string) != STRING_CST)
6813 error ("asm template is not a string constant");
6817 if (cv_qualifier != NULL_TREE
6818 && cv_qualifier != ridpointers[(int) RID_VOLATILE])
6820 warning ("%s qualifier ignored on asm",
6821 IDENTIFIER_POINTER (cv_qualifier));
6822 cv_qualifier = NULL_TREE;
6825 /* We can remove output conversions that change the type,
6826 but not the mode. */
6827 for (tail = outputs; tail; tail = TREE_CHAIN (tail))
6829 tree output = TREE_VALUE (tail);
6831 STRIP_NOPS (output);
6832 TREE_VALUE (tail) = output;
6834 /* Allow conversions as LHS here. build_modify_expr as called below
6835 will do the right thing with them. */
6836 while (TREE_CODE (output) == NOP_EXPR
6837 || TREE_CODE (output) == CONVERT_EXPR
6838 || TREE_CODE (output) == FLOAT_EXPR
6839 || TREE_CODE (output) == FIX_TRUNC_EXPR
6840 || TREE_CODE (output) == FIX_FLOOR_EXPR
6841 || TREE_CODE (output) == FIX_ROUND_EXPR
6842 || TREE_CODE (output) == FIX_CEIL_EXPR)
6843 output = TREE_OPERAND (output, 0);
6845 lvalue_or_else (TREE_VALUE (tail), "invalid lvalue in asm statement");
6848 /* Remove output conversions that change the type but not the mode. */
6849 for (tail = outputs; tail; tail = TREE_CHAIN (tail))
6851 tree output = TREE_VALUE (tail);
6852 STRIP_NOPS (output);
6853 TREE_VALUE (tail) = output;
6856 /* Perform default conversions on array and function inputs.
6857 Don't do this for other types as it would screw up operands
6858 expected to be in memory. */
6859 for (tail = inputs; tail; tail = TREE_CHAIN (tail))
6860 if (TREE_CODE (TREE_TYPE (TREE_VALUE (tail))) == ARRAY_TYPE
6861 || TREE_CODE (TREE_TYPE (TREE_VALUE (tail))) == FUNCTION_TYPE)
6862 TREE_VALUE (tail) = default_conversion (TREE_VALUE (tail));
6864 return add_stmt (build_stmt (ASM_STMT, cv_qualifier, string,
6865 outputs, inputs, clobbers));
6868 /* Expand an ASM statement with operands, handling output operands
6869 that are not variables or INDIRECT_REFS by transforming such
6870 cases into cases that expand_asm_operands can handle.
6872 Arguments are same as for expand_asm_operands. */
6875 c_expand_asm_operands (string, outputs, inputs, clobbers, vol, filename, line)
6876 tree string, outputs, inputs, clobbers;
6878 const char *filename;
6881 int noutputs = list_length (outputs);
6883 /* o[I] is the place that output number I should be written. */
6884 tree *o = (tree *) alloca (noutputs * sizeof (tree));
6887 /* Record the contents of OUTPUTS before it is modified. */
6888 for (i = 0, tail = outputs; tail; tail = TREE_CHAIN (tail), i++)
6889 o[i] = TREE_VALUE (tail);
6891 /* Generate the ASM_OPERANDS insn; store into the TREE_VALUEs of
6892 OUTPUTS some trees for where the values were actually stored. */
6893 expand_asm_operands (string, outputs, inputs, clobbers, vol, filename, line);
6895 /* Copy all the intermediate outputs into the specified outputs. */
6896 for (i = 0, tail = outputs; tail; tail = TREE_CHAIN (tail), i++)
6898 if (o[i] != TREE_VALUE (tail))
6900 expand_expr (build_modify_expr (o[i], NOP_EXPR, TREE_VALUE (tail)),
6901 NULL_RTX, VOIDmode, EXPAND_NORMAL);
6904 /* Restore the original value so that it's correct the next
6905 time we expand this function. */
6906 TREE_VALUE (tail) = o[i];
6908 /* Detect modification of read-only values.
6909 (Otherwise done by build_modify_expr.) */
6912 tree type = TREE_TYPE (o[i]);
6913 if (TREE_READONLY (o[i])
6914 || TYPE_READONLY (type)
6915 || ((TREE_CODE (type) == RECORD_TYPE
6916 || TREE_CODE (type) == UNION_TYPE)
6917 && C_TYPE_FIELDS_READONLY (type)))
6918 readonly_warning (o[i], "modification by `asm'");
6922 /* Those MODIFY_EXPRs could do autoincrements. */
6926 /* Expand a C `return' statement.
6927 RETVAL is the expression for what to return,
6928 or a null pointer for `return;' with no value. */
6931 c_expand_return (retval)
6934 tree valtype = TREE_TYPE (TREE_TYPE (current_function_decl));
6936 if (TREE_THIS_VOLATILE (current_function_decl))
6937 warning ("function declared `noreturn' has a `return' statement");
6941 current_function_returns_null = 1;
6942 if ((warn_return_type || flag_isoc99)
6943 && valtype != 0 && TREE_CODE (valtype) != VOID_TYPE)
6944 pedwarn_c99 ("`return' with no value, in function returning non-void");
6946 else if (valtype == 0 || TREE_CODE (valtype) == VOID_TYPE)
6948 current_function_returns_null = 1;
6949 if (pedantic || TREE_CODE (TREE_TYPE (retval)) != VOID_TYPE)
6950 pedwarn ("`return' with a value, in function returning void");
6954 tree t = convert_for_assignment (valtype, retval, _("return"),
6955 NULL_TREE, NULL_TREE, 0);
6956 tree res = DECL_RESULT (current_function_decl);
6959 if (t == error_mark_node)
6962 inner = t = convert (TREE_TYPE (res), t);
6964 /* Strip any conversions, additions, and subtractions, and see if
6965 we are returning the address of a local variable. Warn if so. */
6968 switch (TREE_CODE (inner))
6970 case NOP_EXPR: case NON_LVALUE_EXPR: case CONVERT_EXPR:
6972 inner = TREE_OPERAND (inner, 0);
6976 /* If the second operand of the MINUS_EXPR has a pointer
6977 type (or is converted from it), this may be valid, so
6978 don't give a warning. */
6980 tree op1 = TREE_OPERAND (inner, 1);
6982 while (! POINTER_TYPE_P (TREE_TYPE (op1))
6983 && (TREE_CODE (op1) == NOP_EXPR
6984 || TREE_CODE (op1) == NON_LVALUE_EXPR
6985 || TREE_CODE (op1) == CONVERT_EXPR))
6986 op1 = TREE_OPERAND (op1, 0);
6988 if (POINTER_TYPE_P (TREE_TYPE (op1)))
6991 inner = TREE_OPERAND (inner, 0);
6996 inner = TREE_OPERAND (inner, 0);
6998 while (TREE_CODE_CLASS (TREE_CODE (inner)) == 'r')
6999 inner = TREE_OPERAND (inner, 0);
7001 if (TREE_CODE (inner) == VAR_DECL
7002 && ! DECL_EXTERNAL (inner)
7003 && ! TREE_STATIC (inner)
7004 && DECL_CONTEXT (inner) == current_function_decl)
7005 warning ("function returns address of local variable");
7015 retval = build (MODIFY_EXPR, TREE_TYPE (res), res, t);
7016 current_function_returns_value = 1;
7019 return add_stmt (build_return_stmt (retval));
7023 /* The SWITCH_STMT being built. */
7025 /* A splay-tree mapping the low element of a case range to the high
7026 element, or NULL_TREE if there is no high element. Used to
7027 determine whether or not a new case label duplicates an old case
7028 label. We need a tree, rather than simply a hash table, because
7029 of the GNU case range extension. */
7031 /* The next node on the stack. */
7032 struct c_switch *next;
7035 /* A stack of the currently active switch statements. The innermost
7036 switch statement is on the top of the stack. There is no need to
7037 mark the stack for garbage collection because it is only active
7038 during the processing of the body of a function, and we never
7039 collect at that point. */
7041 static struct c_switch *switch_stack;
7043 /* Start a C switch statement, testing expression EXP. Return the new
7050 enum tree_code code;
7052 struct c_switch *cs;
7054 if (exp != error_mark_node)
7056 code = TREE_CODE (TREE_TYPE (exp));
7057 type = TREE_TYPE (exp);
7059 if (! INTEGRAL_TYPE_P (type)
7060 && code != ERROR_MARK)
7062 error ("switch quantity not an integer");
7063 exp = integer_zero_node;
7068 type = TYPE_MAIN_VARIANT (TREE_TYPE (exp));
7070 if (warn_traditional && !in_system_header
7071 && (type == long_integer_type_node
7072 || type == long_unsigned_type_node))
7073 warning ("`long' switch expression not converted to `int' in ISO C");
7075 exp = default_conversion (exp);
7076 type = TREE_TYPE (exp);
7077 index = get_unwidened (exp, NULL_TREE);
7078 /* We can't strip a conversion from a signed type to an
7079 unsigned, because if we did, int_fits_type_p would do the
7080 wrong thing when checking case values for being in range,
7081 and it's too hard to do the right thing. */
7082 if (TREE_UNSIGNED (TREE_TYPE (exp))
7083 == TREE_UNSIGNED (TREE_TYPE (index)))
7088 /* Add this new SWITCH_STMT to the stack. */
7089 cs = (struct c_switch *) xmalloc (sizeof (*cs));
7090 cs->switch_stmt = build_stmt (SWITCH_STMT, exp, NULL_TREE, NULL_TREE);
7091 cs->cases = splay_tree_new (case_compare, NULL, NULL);
7092 cs->next = switch_stack;
7095 return add_stmt (switch_stack->switch_stmt);
7098 /* Process a case label. */
7101 do_case (low_value, high_value)
7105 tree label = NULL_TREE;
7109 label = c_add_case_label (switch_stack->cases,
7110 SWITCH_COND (switch_stack->switch_stmt),
7111 low_value, high_value);
7112 if (label == error_mark_node)
7116 error ("case label not within a switch statement");
7118 error ("`default' label not within a switch statement");
7123 /* Finish the switch statement. */
7128 struct c_switch *cs = switch_stack;
7130 RECHAIN_STMTS (cs->switch_stmt, SWITCH_BODY (cs->switch_stmt));
7132 /* Pop the stack. */
7133 switch_stack = switch_stack->next;
7134 splay_tree_delete (cs->cases);