1 /* Build expressions with type checking for C compiler.
2 Copyright (C) 1987, 1988, 1991, 1992, 1993, 1994, 1995, 1996, 1997,
3 1998, 1999, 2000, 2001, 2002 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
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 default_function_array_conversion PARAMS ((tree));
59 static tree lookup_field PARAMS ((tree, tree));
60 static tree convert_arguments PARAMS ((tree, tree, tree, tree));
61 static tree pointer_diff PARAMS ((tree, tree));
62 static tree unary_complex_lvalue PARAMS ((enum tree_code, tree, int));
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));
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 (value == error_mark_node || type == error_mark_node)
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 if (TYPE_MAX_VALUE (TYPE_DOMAIN (type)) == NULL)
153 error ("invalid use of flexible array member");
156 type = TREE_TYPE (type);
159 error ("invalid use of array with unspecified bounds");
166 if (TREE_CODE (TYPE_NAME (type)) == IDENTIFIER_NODE)
167 error ("invalid use of undefined type `%s %s'",
168 type_code_string, IDENTIFIER_POINTER (TYPE_NAME (type)));
170 /* If this type has a typedef-name, the TYPE_NAME is a TYPE_DECL. */
171 error ("invalid use of incomplete typedef `%s'",
172 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type))));
176 /* Return a variant of TYPE which has all the type qualifiers of LIKE
177 as well as those of TYPE. */
180 qualify_type (type, like)
183 return c_build_qualified_type (type,
184 TYPE_QUALS (type) | TYPE_QUALS (like));
187 /* Return the common type of two types.
188 We assume that comptypes has already been done and returned 1;
189 if that isn't so, this may crash. In particular, we assume that qualifiers
192 This is the type for the result of most arithmetic operations
193 if the operands have the given two types. */
199 enum tree_code code1;
200 enum tree_code code2;
203 /* Save time if the two types are the same. */
205 if (t1 == t2) return t1;
207 /* If one type is nonsense, use the other. */
208 if (t1 == error_mark_node)
210 if (t2 == error_mark_node)
213 /* Merge the attributes. */
214 attributes = (*targetm.merge_type_attributes) (t1, t2);
216 /* Treat an enum type as the unsigned integer type of the same width. */
218 if (TREE_CODE (t1) == ENUMERAL_TYPE)
219 t1 = type_for_size (TYPE_PRECISION (t1), 1);
220 if (TREE_CODE (t2) == ENUMERAL_TYPE)
221 t2 = type_for_size (TYPE_PRECISION (t2), 1);
223 code1 = TREE_CODE (t1);
224 code2 = TREE_CODE (t2);
226 /* If one type is complex, form the common type of the non-complex
227 components, then make that complex. Use T1 or T2 if it is the
229 if (code1 == COMPLEX_TYPE || code2 == COMPLEX_TYPE)
231 tree subtype1 = code1 == COMPLEX_TYPE ? TREE_TYPE (t1) : t1;
232 tree subtype2 = code2 == COMPLEX_TYPE ? TREE_TYPE (t2) : t2;
233 tree subtype = common_type (subtype1, subtype2);
235 if (code1 == COMPLEX_TYPE && TREE_TYPE (t1) == subtype)
236 return build_type_attribute_variant (t1, attributes);
237 else if (code2 == COMPLEX_TYPE && TREE_TYPE (t2) == subtype)
238 return build_type_attribute_variant (t2, attributes);
240 return build_type_attribute_variant (build_complex_type (subtype),
248 /* If only one is real, use it as the result. */
250 if (code1 == REAL_TYPE && code2 != REAL_TYPE)
251 return build_type_attribute_variant (t1, attributes);
253 if (code2 == REAL_TYPE && code1 != REAL_TYPE)
254 return build_type_attribute_variant (t2, attributes);
256 /* Both real or both integers; use the one with greater precision. */
258 if (TYPE_PRECISION (t1) > TYPE_PRECISION (t2))
259 return build_type_attribute_variant (t1, attributes);
260 else if (TYPE_PRECISION (t2) > TYPE_PRECISION (t1))
261 return build_type_attribute_variant (t2, attributes);
263 /* Same precision. Prefer longs to ints even when same size. */
265 if (TYPE_MAIN_VARIANT (t1) == long_unsigned_type_node
266 || TYPE_MAIN_VARIANT (t2) == long_unsigned_type_node)
267 return build_type_attribute_variant (long_unsigned_type_node,
270 if (TYPE_MAIN_VARIANT (t1) == long_integer_type_node
271 || TYPE_MAIN_VARIANT (t2) == long_integer_type_node)
273 /* But preserve unsignedness from the other type,
274 since long cannot hold all the values of an unsigned int. */
275 if (TREE_UNSIGNED (t1) || TREE_UNSIGNED (t2))
276 t1 = long_unsigned_type_node;
278 t1 = long_integer_type_node;
279 return build_type_attribute_variant (t1, attributes);
282 /* Likewise, prefer long double to double even if same size. */
283 if (TYPE_MAIN_VARIANT (t1) == long_double_type_node
284 || TYPE_MAIN_VARIANT (t2) == long_double_type_node)
285 return build_type_attribute_variant (long_double_type_node,
288 /* Otherwise prefer the unsigned one. */
290 if (TREE_UNSIGNED (t1))
291 return build_type_attribute_variant (t1, attributes);
293 return build_type_attribute_variant (t2, attributes);
296 /* For two pointers, do this recursively on the target type,
297 and combine the qualifiers of the two types' targets. */
298 /* This code was turned off; I don't know why.
299 But ANSI C specifies doing this with the qualifiers.
300 So I turned it on again. */
302 tree pointed_to_1 = TREE_TYPE (t1);
303 tree pointed_to_2 = TREE_TYPE (t2);
304 tree target = common_type (TYPE_MAIN_VARIANT (pointed_to_1),
305 TYPE_MAIN_VARIANT (pointed_to_2));
306 t1 = build_pointer_type (c_build_qualified_type
308 TYPE_QUALS (pointed_to_1) |
309 TYPE_QUALS (pointed_to_2)));
310 return build_type_attribute_variant (t1, attributes);
313 t1 = build_pointer_type (common_type (TREE_TYPE (t1), TREE_TYPE (t2)));
314 return build_type_attribute_variant (t1, attributes);
319 tree elt = common_type (TREE_TYPE (t1), TREE_TYPE (t2));
320 /* Save space: see if the result is identical to one of the args. */
321 if (elt == TREE_TYPE (t1) && TYPE_DOMAIN (t1))
322 return build_type_attribute_variant (t1, attributes);
323 if (elt == TREE_TYPE (t2) && TYPE_DOMAIN (t2))
324 return build_type_attribute_variant (t2, attributes);
325 /* Merge the element types, and have a size if either arg has one. */
326 t1 = build_array_type (elt, TYPE_DOMAIN (TYPE_DOMAIN (t1) ? t1 : t2));
327 return build_type_attribute_variant (t1, attributes);
331 /* Function types: prefer the one that specified arg types.
332 If both do, merge the arg types. Also merge the return types. */
334 tree valtype = common_type (TREE_TYPE (t1), TREE_TYPE (t2));
335 tree p1 = TYPE_ARG_TYPES (t1);
336 tree p2 = TYPE_ARG_TYPES (t2);
341 /* Save space: see if the result is identical to one of the args. */
342 if (valtype == TREE_TYPE (t1) && ! TYPE_ARG_TYPES (t2))
343 return build_type_attribute_variant (t1, attributes);
344 if (valtype == TREE_TYPE (t2) && ! TYPE_ARG_TYPES (t1))
345 return build_type_attribute_variant (t2, attributes);
347 /* Simple way if one arg fails to specify argument types. */
348 if (TYPE_ARG_TYPES (t1) == 0)
350 t1 = build_function_type (valtype, TYPE_ARG_TYPES (t2));
351 return build_type_attribute_variant (t1, attributes);
353 if (TYPE_ARG_TYPES (t2) == 0)
355 t1 = build_function_type (valtype, TYPE_ARG_TYPES (t1));
356 return build_type_attribute_variant (t1, attributes);
359 /* If both args specify argument types, we must merge the two
360 lists, argument by argument. */
363 declare_parm_level (1);
365 len = list_length (p1);
368 for (i = 0; i < len; i++)
369 newargs = tree_cons (NULL_TREE, NULL_TREE, newargs);
374 p1 = TREE_CHAIN (p1), p2 = TREE_CHAIN (p2), n = TREE_CHAIN (n))
376 /* A null type means arg type is not specified.
377 Take whatever the other function type has. */
378 if (TREE_VALUE (p1) == 0)
380 TREE_VALUE (n) = TREE_VALUE (p2);
383 if (TREE_VALUE (p2) == 0)
385 TREE_VALUE (n) = TREE_VALUE (p1);
389 /* Given wait (union {union wait *u; int *i} *)
390 and wait (union wait *),
391 prefer union wait * as type of parm. */
392 if (TREE_CODE (TREE_VALUE (p1)) == UNION_TYPE
393 && TREE_VALUE (p1) != TREE_VALUE (p2))
396 for (memb = TYPE_FIELDS (TREE_VALUE (p1));
397 memb; memb = TREE_CHAIN (memb))
398 if (comptypes (TREE_TYPE (memb), TREE_VALUE (p2)))
400 TREE_VALUE (n) = TREE_VALUE (p2);
402 pedwarn ("function types not truly compatible in ISO C");
406 if (TREE_CODE (TREE_VALUE (p2)) == UNION_TYPE
407 && TREE_VALUE (p2) != TREE_VALUE (p1))
410 for (memb = TYPE_FIELDS (TREE_VALUE (p2));
411 memb; memb = TREE_CHAIN (memb))
412 if (comptypes (TREE_TYPE (memb), TREE_VALUE (p1)))
414 TREE_VALUE (n) = TREE_VALUE (p1);
416 pedwarn ("function types not truly compatible in ISO C");
420 TREE_VALUE (n) = common_type (TREE_VALUE (p1), TREE_VALUE (p2));
426 t1 = build_function_type (valtype, newargs);
427 /* ... falls through ... */
431 return build_type_attribute_variant (t1, attributes);
436 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
437 or various other operations. Return 2 if they are compatible
438 but a warning may be needed if you use them together. */
441 comptypes (type1, type2)
448 /* Suppress errors caused by previously reported errors. */
450 if (t1 == t2 || !t1 || !t2
451 || TREE_CODE (t1) == ERROR_MARK || TREE_CODE (t2) == ERROR_MARK)
454 /* If either type is the internal version of sizetype, return the
456 if (TREE_CODE (t1) == INTEGER_TYPE && TYPE_IS_SIZETYPE (t1)
457 && TYPE_DOMAIN (t1) != 0)
458 t1 = TYPE_DOMAIN (t1);
460 if (TREE_CODE (t2) == INTEGER_TYPE && TYPE_IS_SIZETYPE (t2)
461 && TYPE_DOMAIN (t2) != 0)
462 t2 = TYPE_DOMAIN (t2);
464 /* Treat an enum type as the integer type of the same width and
467 if (TREE_CODE (t1) == ENUMERAL_TYPE)
468 t1 = type_for_size (TYPE_PRECISION (t1), TREE_UNSIGNED (t1));
469 if (TREE_CODE (t2) == ENUMERAL_TYPE)
470 t2 = type_for_size (TYPE_PRECISION (t2), TREE_UNSIGNED (t2));
475 /* Different classes of types can't be compatible. */
477 if (TREE_CODE (t1) != TREE_CODE (t2)) return 0;
479 /* Qualifiers must match. */
481 if (TYPE_QUALS (t1) != TYPE_QUALS (t2))
484 /* Allow for two different type nodes which have essentially the same
485 definition. Note that we already checked for equality of the type
486 qualifiers (just above). */
488 if (TYPE_MAIN_VARIANT (t1) == TYPE_MAIN_VARIANT (t2))
491 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
492 if (! (attrval = (*targetm.comp_type_attributes) (t1, t2)))
495 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
498 switch (TREE_CODE (t1))
501 val = (TREE_TYPE (t1) == TREE_TYPE (t2)
502 ? 1 : comptypes (TREE_TYPE (t1), TREE_TYPE (t2)));
506 val = function_types_compatible_p (t1, t2);
511 tree d1 = TYPE_DOMAIN (t1);
512 tree d2 = TYPE_DOMAIN (t2);
513 bool d1_variable, d2_variable;
514 bool d1_zero, d2_zero;
517 /* Target types must match incl. qualifiers. */
518 if (TREE_TYPE (t1) != TREE_TYPE (t2)
519 && 0 == (val = comptypes (TREE_TYPE (t1), TREE_TYPE (t2))))
522 /* Sizes must match unless one is missing or variable. */
523 if (d1 == 0 || d2 == 0 || d1 == d2)
526 d1_zero = ! TYPE_MAX_VALUE (d1);
527 d2_zero = ! TYPE_MAX_VALUE (d2);
529 d1_variable = (! d1_zero
530 && (TREE_CODE (TYPE_MIN_VALUE (d1)) != INTEGER_CST
531 || TREE_CODE (TYPE_MAX_VALUE (d1)) != INTEGER_CST));
532 d2_variable = (! d2_zero
533 && (TREE_CODE (TYPE_MIN_VALUE (d2)) != INTEGER_CST
534 || TREE_CODE (TYPE_MAX_VALUE (d2)) != INTEGER_CST));
536 if (d1_variable || d2_variable)
538 if (d1_zero && d2_zero)
540 if (d1_zero || d2_zero
541 || ! tree_int_cst_equal (TYPE_MIN_VALUE (d1), TYPE_MIN_VALUE (d2))
542 || ! tree_int_cst_equal (TYPE_MAX_VALUE (d1), TYPE_MAX_VALUE (d2)))
549 if (maybe_objc_comptypes (t1, t2, 0) == 1)
556 return attrval == 2 && val == 1 ? 2 : val;
559 /* Return 1 if TTL and TTR are pointers to types that are equivalent,
560 ignoring their qualifiers. */
563 comp_target_types (ttl, ttr)
568 /* Give maybe_objc_comptypes a crack at letting these types through. */
569 if ((val = maybe_objc_comptypes (ttl, ttr, 1)) >= 0)
572 val = comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (ttl)),
573 TYPE_MAIN_VARIANT (TREE_TYPE (ttr)));
575 if (val == 2 && pedantic)
576 pedwarn ("types are not quite compatible");
580 /* Subroutines of `comptypes'. */
582 /* Return 1 if two function types F1 and F2 are compatible.
583 If either type specifies no argument types,
584 the other must specify a fixed number of self-promoting arg types.
585 Otherwise, if one type specifies only the number of arguments,
586 the other must specify that number of self-promoting arg types.
587 Otherwise, the argument types must match. */
590 function_types_compatible_p (f1, f2)
594 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
598 if (!(TREE_TYPE (f1) == TREE_TYPE (f2)
599 || (val = comptypes (TREE_TYPE (f1), TREE_TYPE (f2)))))
602 args1 = TYPE_ARG_TYPES (f1);
603 args2 = TYPE_ARG_TYPES (f2);
605 /* An unspecified parmlist matches any specified parmlist
606 whose argument types don't need default promotions. */
610 if (!self_promoting_args_p (args2))
612 /* If one of these types comes from a non-prototype fn definition,
613 compare that with the other type's arglist.
614 If they don't match, ask for a warning (but no error). */
615 if (TYPE_ACTUAL_ARG_TYPES (f1)
616 && 1 != type_lists_compatible_p (args2, TYPE_ACTUAL_ARG_TYPES (f1)))
622 if (!self_promoting_args_p (args1))
624 if (TYPE_ACTUAL_ARG_TYPES (f2)
625 && 1 != type_lists_compatible_p (args1, TYPE_ACTUAL_ARG_TYPES (f2)))
630 /* Both types have argument lists: compare them and propagate results. */
631 val1 = type_lists_compatible_p (args1, args2);
632 return val1 != 1 ? val1 : val;
635 /* Check two lists of types for compatibility,
636 returning 0 for incompatible, 1 for compatible,
637 or 2 for compatible with warning. */
640 type_lists_compatible_p (args1, args2)
643 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
649 if (args1 == 0 && args2 == 0)
651 /* If one list is shorter than the other,
652 they fail to match. */
653 if (args1 == 0 || args2 == 0)
655 /* A null pointer instead of a type
656 means there is supposed to be an argument
657 but nothing is specified about what type it has.
658 So match anything that self-promotes. */
659 if (TREE_VALUE (args1) == 0)
661 if (simple_type_promotes_to (TREE_VALUE (args2)) != NULL_TREE)
664 else if (TREE_VALUE (args2) == 0)
666 if (simple_type_promotes_to (TREE_VALUE (args1)) != NULL_TREE)
669 else if (! (newval = comptypes (TYPE_MAIN_VARIANT (TREE_VALUE (args1)),
670 TYPE_MAIN_VARIANT (TREE_VALUE (args2)))))
672 /* Allow wait (union {union wait *u; int *i} *)
673 and wait (union wait *) to be compatible. */
674 if (TREE_CODE (TREE_VALUE (args1)) == UNION_TYPE
675 && (TYPE_NAME (TREE_VALUE (args1)) == 0
676 || TYPE_TRANSPARENT_UNION (TREE_VALUE (args1)))
677 && TREE_CODE (TYPE_SIZE (TREE_VALUE (args1))) == INTEGER_CST
678 && tree_int_cst_equal (TYPE_SIZE (TREE_VALUE (args1)),
679 TYPE_SIZE (TREE_VALUE (args2))))
682 for (memb = TYPE_FIELDS (TREE_VALUE (args1));
683 memb; memb = TREE_CHAIN (memb))
684 if (comptypes (TREE_TYPE (memb), TREE_VALUE (args2)))
689 else if (TREE_CODE (TREE_VALUE (args2)) == UNION_TYPE
690 && (TYPE_NAME (TREE_VALUE (args2)) == 0
691 || TYPE_TRANSPARENT_UNION (TREE_VALUE (args2)))
692 && TREE_CODE (TYPE_SIZE (TREE_VALUE (args2))) == INTEGER_CST
693 && tree_int_cst_equal (TYPE_SIZE (TREE_VALUE (args2)),
694 TYPE_SIZE (TREE_VALUE (args1))))
697 for (memb = TYPE_FIELDS (TREE_VALUE (args2));
698 memb; memb = TREE_CHAIN (memb))
699 if (comptypes (TREE_TYPE (memb), TREE_VALUE (args1)))
708 /* comptypes said ok, but record if it said to warn. */
712 args1 = TREE_CHAIN (args1);
713 args2 = TREE_CHAIN (args2);
717 /* Compute the value of the `sizeof' operator. */
723 enum tree_code code = TREE_CODE (type);
726 if (code == FUNCTION_TYPE)
728 if (pedantic || warn_pointer_arith)
729 pedwarn ("sizeof applied to a function type");
730 size = size_one_node;
732 else if (code == VOID_TYPE)
734 if (pedantic || warn_pointer_arith)
735 pedwarn ("sizeof applied to a void type");
736 size = size_one_node;
738 else if (code == ERROR_MARK)
739 size = size_one_node;
740 else if (!COMPLETE_TYPE_P (type))
742 error ("sizeof applied to an incomplete type");
743 size = size_zero_node;
746 /* Convert in case a char is more than one unit. */
747 size = size_binop (CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type),
748 size_int (TYPE_PRECISION (char_type_node)
751 /* SIZE will have an integer type with TYPE_IS_SIZETYPE set.
752 TYPE_IS_SIZETYPE means that certain things (like overflow) will
753 never happen. However, this node should really have type
754 `size_t', which is just a typedef for an ordinary integer type. */
755 return fold (build1 (NOP_EXPR, c_size_type_node, size));
759 c_sizeof_nowarn (type)
762 enum tree_code code = TREE_CODE (type);
765 if (code == FUNCTION_TYPE || code == VOID_TYPE || code == ERROR_MARK)
766 size = size_one_node;
767 else if (!COMPLETE_TYPE_P (type))
768 size = size_zero_node;
770 /* Convert in case a char is more than one unit. */
771 size = size_binop (CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type),
772 size_int (TYPE_PRECISION (char_type_node)
775 /* SIZE will have an integer type with TYPE_IS_SIZETYPE set.
776 TYPE_IS_SIZETYPE means that certain things (like overflow) will
777 never happen. However, this node should really have type
778 `size_t', which is just a typedef for an ordinary integer type. */
779 return fold (build1 (NOP_EXPR, c_size_type_node, size));
782 /* Compute the size to increment a pointer by. */
785 c_size_in_bytes (type)
788 enum tree_code code = TREE_CODE (type);
790 if (code == FUNCTION_TYPE || code == VOID_TYPE || code == ERROR_MARK)
791 return size_one_node;
793 if (!COMPLETE_OR_VOID_TYPE_P (type))
795 error ("arithmetic on pointer to an incomplete type");
796 return size_one_node;
799 /* Convert in case a char is more than one unit. */
800 return size_binop (CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type),
801 size_int (TYPE_PRECISION (char_type_node)
805 /* Return either DECL or its known constant value (if it has one). */
808 decl_constant_value (decl)
811 if (/* Don't change a variable array bound or initial value to a constant
812 in a place where a variable is invalid. */
813 current_function_decl != 0
814 && ! TREE_THIS_VOLATILE (decl)
815 && TREE_READONLY (decl)
816 && DECL_INITIAL (decl) != 0
817 && TREE_CODE (DECL_INITIAL (decl)) != ERROR_MARK
818 /* This is invalid if initial value is not constant.
819 If it has either a function call, a memory reference,
820 or a variable, then re-evaluating it could give different results. */
821 && TREE_CONSTANT (DECL_INITIAL (decl))
822 /* Check for cases where this is sub-optimal, even though valid. */
823 && TREE_CODE (DECL_INITIAL (decl)) != CONSTRUCTOR)
824 return DECL_INITIAL (decl);
828 /* Return either DECL or its known constant value (if it has one), but
829 return DECL if pedantic or DECL has mode BLKmode. This is for
830 bug-compatibility with the old behavior of decl_constant_value
831 (before GCC 3.0); every use of this function is a bug and it should
832 be removed before GCC 3.1. It is not appropriate to use pedantic
833 in a way that affects optimization, and BLKmode is probably not the
834 right test for avoiding misoptimizations either. */
837 decl_constant_value_for_broken_optimization (decl)
840 if (pedantic || DECL_MODE (decl) == BLKmode)
843 return decl_constant_value (decl);
847 /* Perform the default conversion of arrays and functions to pointers.
848 Return the result of converting EXP. For any other expression, just
852 default_function_array_conversion (exp)
856 tree type = TREE_TYPE (exp);
857 enum tree_code code = TREE_CODE (type);
860 /* Strip NON_LVALUE_EXPRs and no-op conversions, since we aren't using as
863 Do not use STRIP_NOPS here! It will remove conversions from pointer
864 to integer and cause infinite recursion. */
866 while (TREE_CODE (exp) == NON_LVALUE_EXPR
867 || (TREE_CODE (exp) == NOP_EXPR
868 && TREE_TYPE (TREE_OPERAND (exp, 0)) == TREE_TYPE (exp)))
870 if (TREE_CODE (exp) == NON_LVALUE_EXPR)
872 exp = TREE_OPERAND (exp, 0);
875 /* Preserve the original expression code. */
876 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (exp))))
877 C_SET_EXP_ORIGINAL_CODE (exp, C_EXP_ORIGINAL_CODE (orig_exp));
879 if (code == FUNCTION_TYPE)
881 return build_unary_op (ADDR_EXPR, exp, 0);
883 if (code == ARRAY_TYPE)
886 tree restype = TREE_TYPE (type);
892 if (TREE_CODE_CLASS (TREE_CODE (exp)) == 'r' || DECL_P (exp))
894 constp = TREE_READONLY (exp);
895 volatilep = TREE_THIS_VOLATILE (exp);
898 if (TYPE_QUALS (type) || constp || volatilep)
900 = c_build_qualified_type (restype,
902 | (constp * TYPE_QUAL_CONST)
903 | (volatilep * TYPE_QUAL_VOLATILE));
905 if (TREE_CODE (exp) == INDIRECT_REF)
906 return convert (TYPE_POINTER_TO (restype),
907 TREE_OPERAND (exp, 0));
909 if (TREE_CODE (exp) == COMPOUND_EXPR)
911 tree op1 = default_conversion (TREE_OPERAND (exp, 1));
912 return build (COMPOUND_EXPR, TREE_TYPE (op1),
913 TREE_OPERAND (exp, 0), op1);
916 lvalue_array_p = !not_lvalue && lvalue_p (exp);
917 if (!flag_isoc99 && !lvalue_array_p)
919 /* Before C99, non-lvalue arrays do not decay to pointers.
920 Normally, using such an array would be invalid; but it can
921 be used correctly inside sizeof or as a statement expression.
922 Thus, do not give an error here; an error will result later. */
926 ptrtype = build_pointer_type (restype);
928 if (TREE_CODE (exp) == VAR_DECL)
930 /* ??? This is not really quite correct
931 in that the type of the operand of ADDR_EXPR
932 is not the target type of the type of the ADDR_EXPR itself.
933 Question is, can this lossage be avoided? */
934 adr = build1 (ADDR_EXPR, ptrtype, exp);
935 if (mark_addressable (exp) == 0)
936 return error_mark_node;
937 TREE_CONSTANT (adr) = staticp (exp);
938 TREE_SIDE_EFFECTS (adr) = 0; /* Default would be, same as EXP. */
941 /* This way is better for a COMPONENT_REF since it can
942 simplify the offset for a component. */
943 adr = build_unary_op (ADDR_EXPR, exp, 1);
944 return convert (ptrtype, adr);
949 /* Perform default promotions for C data used in expressions.
950 Arrays and functions are converted to pointers;
951 enumeral types or short or char, to int.
952 In addition, manifest constants symbols are replaced by their values. */
955 default_conversion (exp)
959 tree type = TREE_TYPE (exp);
960 enum tree_code code = TREE_CODE (type);
962 if (code == FUNCTION_TYPE || code == ARRAY_TYPE)
963 return default_function_array_conversion (exp);
965 /* Constants can be used directly unless they're not loadable. */
966 if (TREE_CODE (exp) == CONST_DECL)
967 exp = DECL_INITIAL (exp);
969 /* Replace a nonvolatile const static variable with its value unless
970 it is an array, in which case we must be sure that taking the
971 address of the array produces consistent results. */
972 else if (optimize && TREE_CODE (exp) == VAR_DECL && code != ARRAY_TYPE)
974 exp = decl_constant_value_for_broken_optimization (exp);
975 type = TREE_TYPE (exp);
978 /* Strip NON_LVALUE_EXPRs and no-op conversions, since we aren't using as
981 Do not use STRIP_NOPS here! It will remove conversions from pointer
982 to integer and cause infinite recursion. */
984 while (TREE_CODE (exp) == NON_LVALUE_EXPR
985 || (TREE_CODE (exp) == NOP_EXPR
986 && TREE_TYPE (TREE_OPERAND (exp, 0)) == TREE_TYPE (exp)))
987 exp = TREE_OPERAND (exp, 0);
989 /* Preserve the original expression code. */
990 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (exp))))
991 C_SET_EXP_ORIGINAL_CODE (exp, C_EXP_ORIGINAL_CODE (orig_exp));
993 /* Normally convert enums to int,
994 but convert wide enums to something wider. */
995 if (code == ENUMERAL_TYPE)
997 type = type_for_size (MAX (TYPE_PRECISION (type),
998 TYPE_PRECISION (integer_type_node)),
999 ((TYPE_PRECISION (type)
1000 >= TYPE_PRECISION (integer_type_node))
1001 && TREE_UNSIGNED (type)));
1003 return convert (type, exp);
1006 if (TREE_CODE (exp) == COMPONENT_REF
1007 && DECL_C_BIT_FIELD (TREE_OPERAND (exp, 1))
1008 /* If it's thinner than an int, promote it like a
1009 c_promoting_integer_type_p, otherwise leave it alone. */
1010 && 0 > compare_tree_int (DECL_SIZE (TREE_OPERAND (exp, 1)),
1011 TYPE_PRECISION (integer_type_node)))
1012 return convert (integer_type_node, exp);
1014 if (c_promoting_integer_type_p (type))
1016 /* Preserve unsignedness if not really getting any wider. */
1017 if (TREE_UNSIGNED (type)
1018 && TYPE_PRECISION (type) == TYPE_PRECISION (integer_type_node))
1019 return convert (unsigned_type_node, exp);
1021 return convert (integer_type_node, exp);
1024 if (code == VOID_TYPE)
1026 error ("void value not ignored as it ought to be");
1027 return error_mark_node;
1032 /* Look up COMPONENT in a structure or union DECL.
1034 If the component name is not found, returns NULL_TREE. Otherwise,
1035 the return value is a TREE_LIST, with each TREE_VALUE a FIELD_DECL
1036 stepping down the chain to the component, which is in the last
1037 TREE_VALUE of the list. Normally the list is of length one, but if
1038 the component is embedded within (nested) anonymous structures or
1039 unions, the list steps down the chain to the component. */
1042 lookup_field (decl, component)
1043 tree decl, component;
1045 tree type = TREE_TYPE (decl);
1048 /* If TYPE_LANG_SPECIFIC is set, then it is a sorted array of pointers
1049 to the field elements. Use a binary search on this array to quickly
1050 find the element. Otherwise, do a linear search. TYPE_LANG_SPECIFIC
1051 will always be set for structures which have many elements. */
1053 if (TYPE_LANG_SPECIFIC (type))
1056 tree *field_array = &TYPE_LANG_SPECIFIC (type)->elts[0];
1058 field = TYPE_FIELDS (type);
1060 top = TYPE_LANG_SPECIFIC (type)->len;
1061 while (top - bot > 1)
1063 half = (top - bot + 1) >> 1;
1064 field = field_array[bot+half];
1066 if (DECL_NAME (field) == NULL_TREE)
1068 /* Step through all anon unions in linear fashion. */
1069 while (DECL_NAME (field_array[bot]) == NULL_TREE)
1071 field = field_array[bot++];
1072 if (TREE_CODE (TREE_TYPE (field)) == RECORD_TYPE
1073 || TREE_CODE (TREE_TYPE (field)) == UNION_TYPE)
1075 tree anon = lookup_field (field, component);
1078 return tree_cons (NULL_TREE, field, anon);
1082 /* Entire record is only anon unions. */
1086 /* Restart the binary search, with new lower bound. */
1090 if (DECL_NAME (field) == component)
1092 if (DECL_NAME (field) < component)
1098 if (DECL_NAME (field_array[bot]) == component)
1099 field = field_array[bot];
1100 else if (DECL_NAME (field) != component)
1105 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
1107 if (DECL_NAME (field) == NULL_TREE
1108 && (TREE_CODE (TREE_TYPE (field)) == RECORD_TYPE
1109 || TREE_CODE (TREE_TYPE (field)) == UNION_TYPE))
1111 tree anon = lookup_field (field, component);
1114 return tree_cons (NULL_TREE, field, anon);
1117 if (DECL_NAME (field) == component)
1121 if (field == NULL_TREE)
1125 return tree_cons (NULL_TREE, field, NULL_TREE);
1128 /* Make an expression to refer to the COMPONENT field of
1129 structure or union value DATUM. COMPONENT is an IDENTIFIER_NODE. */
1132 build_component_ref (datum, component)
1133 tree datum, component;
1135 tree type = TREE_TYPE (datum);
1136 enum tree_code code = TREE_CODE (type);
1140 /* If DATUM is a COMPOUND_EXPR, move our reference inside it.
1141 If pedantic ensure that the arguments are not lvalues; otherwise,
1142 if the component is an array, it would wrongly decay to a pointer in
1144 We cannot do this with a COND_EXPR, because in a conditional expression
1145 the default promotions are applied to both sides, and this would yield
1146 the wrong type of the result; for example, if the components have
1148 switch (TREE_CODE (datum))
1152 tree value = build_component_ref (TREE_OPERAND (datum, 1), component);
1153 return build (COMPOUND_EXPR, TREE_TYPE (value),
1154 TREE_OPERAND (datum, 0), pedantic_non_lvalue (value));
1160 /* See if there is a field or component with name COMPONENT. */
1162 if (code == RECORD_TYPE || code == UNION_TYPE)
1164 if (!COMPLETE_TYPE_P (type))
1166 incomplete_type_error (NULL_TREE, type);
1167 return error_mark_node;
1170 field = lookup_field (datum, component);
1174 error ("%s has no member named `%s'",
1175 code == RECORD_TYPE ? "structure" : "union",
1176 IDENTIFIER_POINTER (component));
1177 return error_mark_node;
1180 /* Chain the COMPONENT_REFs if necessary down to the FIELD.
1181 This might be better solved in future the way the C++ front
1182 end does it - by giving the anonymous entities each a
1183 separate name and type, and then have build_component_ref
1184 recursively call itself. We can't do that here. */
1185 for (; field; field = TREE_CHAIN (field))
1187 tree subdatum = TREE_VALUE (field);
1189 if (TREE_TYPE (subdatum) == error_mark_node)
1190 return error_mark_node;
1192 ref = build (COMPONENT_REF, TREE_TYPE (subdatum), datum, subdatum);
1193 if (TREE_READONLY (datum) || TREE_READONLY (subdatum))
1194 TREE_READONLY (ref) = 1;
1195 if (TREE_THIS_VOLATILE (datum) || TREE_THIS_VOLATILE (subdatum))
1196 TREE_THIS_VOLATILE (ref) = 1;
1198 if (TREE_DEPRECATED (subdatum))
1199 warn_deprecated_use (subdatum);
1206 else if (code != ERROR_MARK)
1207 error ("request for member `%s' in something not a structure or union",
1208 IDENTIFIER_POINTER (component));
1210 return error_mark_node;
1213 /* Given an expression PTR for a pointer, return an expression
1214 for the value pointed to.
1215 ERRORSTRING is the name of the operator to appear in error messages. */
1218 build_indirect_ref (ptr, errorstring)
1220 const char *errorstring;
1222 tree pointer = default_conversion (ptr);
1223 tree type = TREE_TYPE (pointer);
1225 if (TREE_CODE (type) == POINTER_TYPE)
1227 if (TREE_CODE (pointer) == ADDR_EXPR
1229 && (TREE_TYPE (TREE_OPERAND (pointer, 0))
1230 == TREE_TYPE (type)))
1231 return TREE_OPERAND (pointer, 0);
1234 tree t = TREE_TYPE (type);
1235 tree ref = build1 (INDIRECT_REF, TYPE_MAIN_VARIANT (t), pointer);
1237 if (!COMPLETE_OR_VOID_TYPE_P (t) && TREE_CODE (t) != ARRAY_TYPE)
1239 error ("dereferencing pointer to incomplete type");
1240 return error_mark_node;
1242 if (VOID_TYPE_P (t) && skip_evaluation == 0)
1243 warning ("dereferencing `void *' pointer");
1245 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
1246 so that we get the proper error message if the result is used
1247 to assign to. Also, &* is supposed to be a no-op.
1248 And ANSI C seems to specify that the type of the result
1249 should be the const type. */
1250 /* A de-reference of a pointer to const is not a const. It is valid
1251 to change it via some other pointer. */
1252 TREE_READONLY (ref) = TYPE_READONLY (t);
1253 TREE_SIDE_EFFECTS (ref)
1254 = TYPE_VOLATILE (t) || TREE_SIDE_EFFECTS (pointer) || flag_volatile;
1255 TREE_THIS_VOLATILE (ref) = TYPE_VOLATILE (t);
1259 else if (TREE_CODE (pointer) != ERROR_MARK)
1260 error ("invalid type argument of `%s'", errorstring);
1261 return error_mark_node;
1264 /* This handles expressions of the form "a[i]", which denotes
1267 This is logically equivalent in C to *(a+i), but we may do it differently.
1268 If A is a variable or a member, we generate a primitive ARRAY_REF.
1269 This avoids forcing the array out of registers, and can work on
1270 arrays that are not lvalues (for example, members of structures returned
1274 build_array_ref (array, index)
1279 error ("subscript missing in array reference");
1280 return error_mark_node;
1283 if (TREE_TYPE (array) == error_mark_node
1284 || TREE_TYPE (index) == error_mark_node)
1285 return error_mark_node;
1287 if (TREE_CODE (TREE_TYPE (array)) == ARRAY_TYPE
1288 && TREE_CODE (array) != INDIRECT_REF)
1292 /* Subscripting with type char is likely to lose
1293 on a machine where chars are signed.
1294 So warn on any machine, but optionally.
1295 Don't warn for unsigned char since that type is safe.
1296 Don't warn for signed char because anyone who uses that
1297 must have done so deliberately. */
1298 if (warn_char_subscripts
1299 && TYPE_MAIN_VARIANT (TREE_TYPE (index)) == char_type_node)
1300 warning ("array subscript has type `char'");
1302 /* Apply default promotions *after* noticing character types. */
1303 index = default_conversion (index);
1305 /* Require integer *after* promotion, for sake of enums. */
1306 if (TREE_CODE (TREE_TYPE (index)) != INTEGER_TYPE)
1308 error ("array subscript is not an integer");
1309 return error_mark_node;
1312 /* An array that is indexed by a non-constant
1313 cannot be stored in a register; we must be able to do
1314 address arithmetic on its address.
1315 Likewise an array of elements of variable size. */
1316 if (TREE_CODE (index) != INTEGER_CST
1317 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array)))
1318 && TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array)))) != INTEGER_CST))
1320 if (mark_addressable (array) == 0)
1321 return error_mark_node;
1323 /* An array that is indexed by a constant value which is not within
1324 the array bounds cannot be stored in a register either; because we
1325 would get a crash in store_bit_field/extract_bit_field when trying
1326 to access a non-existent part of the register. */
1327 if (TREE_CODE (index) == INTEGER_CST
1328 && TYPE_VALUES (TREE_TYPE (array))
1329 && ! int_fits_type_p (index, TYPE_VALUES (TREE_TYPE (array))))
1331 if (mark_addressable (array) == 0)
1332 return error_mark_node;
1338 while (TREE_CODE (foo) == COMPONENT_REF)
1339 foo = TREE_OPERAND (foo, 0);
1340 if (TREE_CODE (foo) == VAR_DECL && DECL_REGISTER (foo))
1341 pedwarn ("ISO C forbids subscripting `register' array");
1342 else if (! flag_isoc99 && ! lvalue_p (foo))
1343 pedwarn ("ISO C89 forbids subscripting non-lvalue array");
1346 type = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (array)));
1347 rval = build (ARRAY_REF, type, array, index);
1348 /* Array ref is const/volatile if the array elements are
1349 or if the array is. */
1350 TREE_READONLY (rval)
1351 |= (TYPE_READONLY (TREE_TYPE (TREE_TYPE (array)))
1352 | TREE_READONLY (array));
1353 TREE_SIDE_EFFECTS (rval)
1354 |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array)))
1355 | TREE_SIDE_EFFECTS (array));
1356 TREE_THIS_VOLATILE (rval)
1357 |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array)))
1358 /* This was added by rms on 16 Nov 91.
1359 It fixes vol struct foo *a; a->elts[1]
1360 in an inline function.
1361 Hope it doesn't break something else. */
1362 | TREE_THIS_VOLATILE (array));
1363 return require_complete_type (fold (rval));
1367 tree ar = default_conversion (array);
1368 tree ind = default_conversion (index);
1370 /* Do the same warning check as above, but only on the part that's
1371 syntactically the index and only if it is also semantically
1373 if (warn_char_subscripts
1374 && TREE_CODE (TREE_TYPE (index)) == INTEGER_TYPE
1375 && TYPE_MAIN_VARIANT (TREE_TYPE (index)) == char_type_node)
1376 warning ("subscript has type `char'");
1378 /* Put the integer in IND to simplify error checking. */
1379 if (TREE_CODE (TREE_TYPE (ar)) == INTEGER_TYPE)
1386 if (ar == error_mark_node)
1389 if (TREE_CODE (TREE_TYPE (ar)) != POINTER_TYPE
1390 || TREE_CODE (TREE_TYPE (TREE_TYPE (ar))) == FUNCTION_TYPE)
1392 error ("subscripted value is neither array nor pointer");
1393 return error_mark_node;
1395 if (TREE_CODE (TREE_TYPE (ind)) != INTEGER_TYPE)
1397 error ("array subscript is not an integer");
1398 return error_mark_node;
1401 return build_indirect_ref (build_binary_op (PLUS_EXPR, ar, ind, 0),
1406 /* Build an external reference to identifier ID. FUN indicates
1407 whether this will be used for a function call. */
1409 build_external_ref (id, fun)
1414 tree decl = lookup_name (id);
1415 tree objc_ivar = lookup_objc_ivar (id);
1417 if (decl && TREE_DEPRECATED (decl))
1418 warn_deprecated_use (decl);
1420 if (!decl || decl == error_mark_node || C_DECL_ANTICIPATED (decl))
1426 if (!decl || decl == error_mark_node)
1427 /* Ordinary implicit function declaration. */
1428 ref = implicitly_declare (id);
1431 /* Implicit declaration of built-in function. Don't
1432 change the built-in declaration, but don't let this
1433 go by silently, either. */
1434 implicit_decl_warning (id);
1436 /* only issue this warning once */
1437 C_DECL_ANTICIPATED (decl) = 0;
1443 /* Reference to undeclared variable, including reference to
1444 builtin outside of function-call context. */
1445 if (current_function_decl == 0)
1446 error ("`%s' undeclared here (not in a function)",
1447 IDENTIFIER_POINTER (id));
1450 if (IDENTIFIER_GLOBAL_VALUE (id) != error_mark_node
1451 || IDENTIFIER_ERROR_LOCUS (id) != current_function_decl)
1453 error ("`%s' undeclared (first use in this function)",
1454 IDENTIFIER_POINTER (id));
1456 if (! undeclared_variable_notice)
1458 error ("(Each undeclared identifier is reported only once");
1459 error ("for each function it appears in.)");
1460 undeclared_variable_notice = 1;
1463 IDENTIFIER_GLOBAL_VALUE (id) = error_mark_node;
1464 IDENTIFIER_ERROR_LOCUS (id) = current_function_decl;
1466 return error_mark_node;
1471 /* Properly declared variable or function reference. */
1474 else if (decl != objc_ivar && IDENTIFIER_LOCAL_VALUE (id))
1476 warning ("local declaration of `%s' hides instance variable",
1477 IDENTIFIER_POINTER (id));
1484 if (TREE_TYPE (ref) == error_mark_node)
1485 return error_mark_node;
1487 assemble_external (ref);
1488 TREE_USED (ref) = 1;
1490 if (TREE_CODE (ref) == CONST_DECL)
1492 ref = DECL_INITIAL (ref);
1493 TREE_CONSTANT (ref) = 1;
1499 /* Build a function call to function FUNCTION with parameters PARAMS.
1500 PARAMS is a list--a chain of TREE_LIST nodes--in which the
1501 TREE_VALUE of each node is a parameter-expression.
1502 FUNCTION's data type may be a function type or a pointer-to-function. */
1505 build_function_call (function, params)
1506 tree function, params;
1508 tree fntype, fundecl = 0;
1509 tree coerced_params;
1510 tree name = NULL_TREE, assembler_name = NULL_TREE, result;
1512 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
1513 STRIP_TYPE_NOPS (function);
1515 /* Convert anything with function type to a pointer-to-function. */
1516 if (TREE_CODE (function) == FUNCTION_DECL)
1518 name = DECL_NAME (function);
1519 assembler_name = DECL_ASSEMBLER_NAME (function);
1521 /* Differs from default_conversion by not setting TREE_ADDRESSABLE
1522 (because calling an inline function does not mean the function
1523 needs to be separately compiled). */
1524 fntype = build_type_variant (TREE_TYPE (function),
1525 TREE_READONLY (function),
1526 TREE_THIS_VOLATILE (function));
1528 function = build1 (ADDR_EXPR, build_pointer_type (fntype), function);
1531 function = default_conversion (function);
1533 fntype = TREE_TYPE (function);
1535 if (TREE_CODE (fntype) == ERROR_MARK)
1536 return error_mark_node;
1538 if (!(TREE_CODE (fntype) == POINTER_TYPE
1539 && TREE_CODE (TREE_TYPE (fntype)) == FUNCTION_TYPE))
1541 error ("called object is not a function");
1542 return error_mark_node;
1545 if (fundecl && TREE_THIS_VOLATILE (fundecl))
1546 current_function_returns_abnormally = 1;
1548 /* fntype now gets the type of function pointed to. */
1549 fntype = TREE_TYPE (fntype);
1551 /* Convert the parameters to the types declared in the
1552 function prototype, or apply default promotions. */
1555 = convert_arguments (TYPE_ARG_TYPES (fntype), params, name, fundecl);
1557 /* Check for errors in format strings. */
1560 check_function_format (NULL, TYPE_ATTRIBUTES (fntype), coerced_params);
1562 /* Recognize certain built-in functions so we can make tree-codes
1563 other than CALL_EXPR. We do this when it enables fold-const.c
1564 to do something useful. */
1566 if (TREE_CODE (function) == ADDR_EXPR
1567 && TREE_CODE (TREE_OPERAND (function, 0)) == FUNCTION_DECL
1568 && DECL_BUILT_IN (TREE_OPERAND (function, 0)))
1570 result = expand_tree_builtin (TREE_OPERAND (function, 0),
1571 params, coerced_params);
1576 result = build (CALL_EXPR, TREE_TYPE (fntype),
1577 function, coerced_params, NULL_TREE);
1578 TREE_SIDE_EFFECTS (result) = 1;
1579 result = fold (result);
1581 if (VOID_TYPE_P (TREE_TYPE (result)))
1583 return require_complete_type (result);
1586 /* Convert the argument expressions in the list VALUES
1587 to the types in the list TYPELIST. The result is a list of converted
1588 argument expressions.
1590 If TYPELIST is exhausted, or when an element has NULL as its type,
1591 perform the default conversions.
1593 PARMLIST is the chain of parm decls for the function being called.
1594 It may be 0, if that info is not available.
1595 It is used only for generating error messages.
1597 NAME is an IDENTIFIER_NODE or 0. It is used only for error messages.
1599 This is also where warnings about wrong number of args are generated.
1601 Both VALUES and the returned value are chains of TREE_LIST nodes
1602 with the elements of the list in the TREE_VALUE slots of those nodes. */
1605 convert_arguments (typelist, values, name, fundecl)
1606 tree typelist, values, name, fundecl;
1608 tree typetail, valtail;
1612 /* Scan the given expressions and types, producing individual
1613 converted arguments and pushing them on RESULT in reverse order. */
1615 for (valtail = values, typetail = typelist, parmnum = 0;
1617 valtail = TREE_CHAIN (valtail), parmnum++)
1619 tree type = typetail ? TREE_VALUE (typetail) : 0;
1620 tree val = TREE_VALUE (valtail);
1622 if (type == void_type_node)
1625 error ("too many arguments to function `%s'",
1626 IDENTIFIER_POINTER (name));
1628 error ("too many arguments to function");
1632 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
1633 /* Do not use STRIP_NOPS here! We do not want an enumerator with value 0
1634 to convert automatically to a pointer. */
1635 if (TREE_CODE (val) == NON_LVALUE_EXPR)
1636 val = TREE_OPERAND (val, 0);
1638 val = default_function_array_conversion (val);
1640 val = require_complete_type (val);
1644 /* Formal parm type is specified by a function prototype. */
1647 if (!COMPLETE_TYPE_P (type))
1649 error ("type of formal parameter %d is incomplete", parmnum + 1);
1654 /* Optionally warn about conversions that
1655 differ from the default conversions. */
1656 if (warn_conversion || warn_traditional)
1658 int formal_prec = TYPE_PRECISION (type);
1660 if (INTEGRAL_TYPE_P (type)
1661 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
1662 warn_for_assignment ("%s as integer rather than floating due to prototype", (char *) 0, name, parmnum + 1);
1663 if (INTEGRAL_TYPE_P (type)
1664 && TREE_CODE (TREE_TYPE (val)) == COMPLEX_TYPE)
1665 warn_for_assignment ("%s as integer rather than complex due to prototype", (char *) 0, name, parmnum + 1);
1666 else if (TREE_CODE (type) == COMPLEX_TYPE
1667 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
1668 warn_for_assignment ("%s as complex rather than floating due to prototype", (char *) 0, name, parmnum + 1);
1669 else if (TREE_CODE (type) == REAL_TYPE
1670 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
1671 warn_for_assignment ("%s as floating rather than integer due to prototype", (char *) 0, name, parmnum + 1);
1672 else if (TREE_CODE (type) == COMPLEX_TYPE
1673 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
1674 warn_for_assignment ("%s as complex rather than integer due to prototype", (char *) 0, name, parmnum + 1);
1675 else if (TREE_CODE (type) == REAL_TYPE
1676 && TREE_CODE (TREE_TYPE (val)) == COMPLEX_TYPE)
1677 warn_for_assignment ("%s as floating rather than complex due to prototype", (char *) 0, name, parmnum + 1);
1678 /* ??? At some point, messages should be written about
1679 conversions between complex types, but that's too messy
1681 else if (TREE_CODE (type) == REAL_TYPE
1682 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
1684 /* Warn if any argument is passed as `float',
1685 since without a prototype it would be `double'. */
1686 if (formal_prec == TYPE_PRECISION (float_type_node))
1687 warn_for_assignment ("%s as `float' rather than `double' due to prototype", (char *) 0, name, parmnum + 1);
1689 /* Detect integer changing in width or signedness.
1690 These warnings are only activated with
1691 -Wconversion, not with -Wtraditional. */
1692 else if (warn_conversion && INTEGRAL_TYPE_P (type)
1693 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
1695 tree would_have_been = default_conversion (val);
1696 tree type1 = TREE_TYPE (would_have_been);
1698 if (TREE_CODE (type) == ENUMERAL_TYPE
1699 && (TYPE_MAIN_VARIANT (type)
1700 == TYPE_MAIN_VARIANT (TREE_TYPE (val))))
1701 /* No warning if function asks for enum
1702 and the actual arg is that enum type. */
1704 else if (formal_prec != TYPE_PRECISION (type1))
1705 warn_for_assignment ("%s with different width due to prototype", (char *) 0, name, parmnum + 1);
1706 else if (TREE_UNSIGNED (type) == TREE_UNSIGNED (type1))
1708 /* Don't complain if the formal parameter type
1709 is an enum, because we can't tell now whether
1710 the value was an enum--even the same enum. */
1711 else if (TREE_CODE (type) == ENUMERAL_TYPE)
1713 else if (TREE_CODE (val) == INTEGER_CST
1714 && int_fits_type_p (val, type))
1715 /* Change in signedness doesn't matter
1716 if a constant value is unaffected. */
1718 /* Likewise for a constant in a NOP_EXPR. */
1719 else if (TREE_CODE (val) == NOP_EXPR
1720 && TREE_CODE (TREE_OPERAND (val, 0)) == INTEGER_CST
1721 && int_fits_type_p (TREE_OPERAND (val, 0), type))
1723 #if 0 /* We never get such tree structure here. */
1724 else if (TREE_CODE (TREE_TYPE (val)) == ENUMERAL_TYPE
1725 && int_fits_type_p (TYPE_MIN_VALUE (TREE_TYPE (val)), type)
1726 && int_fits_type_p (TYPE_MAX_VALUE (TREE_TYPE (val)), type))
1727 /* Change in signedness doesn't matter
1728 if an enum value is unaffected. */
1731 /* If the value is extended from a narrower
1732 unsigned type, it doesn't matter whether we
1733 pass it as signed or unsigned; the value
1734 certainly is the same either way. */
1735 else if (TYPE_PRECISION (TREE_TYPE (val)) < TYPE_PRECISION (type)
1736 && TREE_UNSIGNED (TREE_TYPE (val)))
1738 else if (TREE_UNSIGNED (type))
1739 warn_for_assignment ("%s as unsigned due to prototype", (char *) 0, name, parmnum + 1);
1741 warn_for_assignment ("%s as signed due to prototype", (char *) 0, name, parmnum + 1);
1745 parmval = convert_for_assignment (type, val,
1746 (char *) 0, /* arg passing */
1747 fundecl, name, parmnum + 1);
1749 if (PROMOTE_PROTOTYPES
1750 && INTEGRAL_TYPE_P (type)
1751 && (TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node)))
1752 parmval = default_conversion (parmval);
1754 result = tree_cons (NULL_TREE, parmval, result);
1756 else if (TREE_CODE (TREE_TYPE (val)) == REAL_TYPE
1757 && (TYPE_PRECISION (TREE_TYPE (val))
1758 < TYPE_PRECISION (double_type_node)))
1759 /* Convert `float' to `double'. */
1760 result = tree_cons (NULL_TREE, convert (double_type_node, val), result);
1762 /* Convert `short' and `char' to full-size `int'. */
1763 result = tree_cons (NULL_TREE, default_conversion (val), result);
1766 typetail = TREE_CHAIN (typetail);
1769 if (typetail != 0 && TREE_VALUE (typetail) != void_type_node)
1772 error ("too few arguments to function `%s'",
1773 IDENTIFIER_POINTER (name));
1775 error ("too few arguments to function");
1778 return nreverse (result);
1781 /* This is the entry point used by the parser
1782 for binary operators in the input.
1783 In addition to constructing the expression,
1784 we check for operands that were written with other binary operators
1785 in a way that is likely to confuse the user. */
1788 parser_build_binary_op (code, arg1, arg2)
1789 enum tree_code code;
1792 tree result = build_binary_op (code, arg1, arg2, 1);
1795 char class1 = TREE_CODE_CLASS (TREE_CODE (arg1));
1796 char class2 = TREE_CODE_CLASS (TREE_CODE (arg2));
1797 enum tree_code code1 = ERROR_MARK;
1798 enum tree_code code2 = ERROR_MARK;
1800 if (TREE_CODE (result) == ERROR_MARK)
1801 return error_mark_node;
1803 if (IS_EXPR_CODE_CLASS (class1))
1804 code1 = C_EXP_ORIGINAL_CODE (arg1);
1805 if (IS_EXPR_CODE_CLASS (class2))
1806 code2 = C_EXP_ORIGINAL_CODE (arg2);
1808 /* Check for cases such as x+y<<z which users are likely
1809 to misinterpret. If parens are used, C_EXP_ORIGINAL_CODE
1810 is cleared to prevent these warnings. */
1811 if (warn_parentheses)
1813 if (code == LSHIFT_EXPR || code == RSHIFT_EXPR)
1815 if (code1 == PLUS_EXPR || code1 == MINUS_EXPR
1816 || code2 == PLUS_EXPR || code2 == MINUS_EXPR)
1817 warning ("suggest parentheses around + or - inside shift");
1820 if (code == TRUTH_ORIF_EXPR)
1822 if (code1 == TRUTH_ANDIF_EXPR
1823 || code2 == TRUTH_ANDIF_EXPR)
1824 warning ("suggest parentheses around && within ||");
1827 if (code == BIT_IOR_EXPR)
1829 if (code1 == BIT_AND_EXPR || code1 == BIT_XOR_EXPR
1830 || code1 == PLUS_EXPR || code1 == MINUS_EXPR
1831 || code2 == BIT_AND_EXPR || code2 == BIT_XOR_EXPR
1832 || code2 == PLUS_EXPR || code2 == MINUS_EXPR)
1833 warning ("suggest parentheses around arithmetic in operand of |");
1834 /* Check cases like x|y==z */
1835 if (TREE_CODE_CLASS (code1) == '<' || TREE_CODE_CLASS (code2) == '<')
1836 warning ("suggest parentheses around comparison in operand of |");
1839 if (code == BIT_XOR_EXPR)
1841 if (code1 == BIT_AND_EXPR
1842 || code1 == PLUS_EXPR || code1 == MINUS_EXPR
1843 || code2 == BIT_AND_EXPR
1844 || code2 == PLUS_EXPR || code2 == MINUS_EXPR)
1845 warning ("suggest parentheses around arithmetic in operand of ^");
1846 /* Check cases like x^y==z */
1847 if (TREE_CODE_CLASS (code1) == '<' || TREE_CODE_CLASS (code2) == '<')
1848 warning ("suggest parentheses around comparison in operand of ^");
1851 if (code == BIT_AND_EXPR)
1853 if (code1 == PLUS_EXPR || code1 == MINUS_EXPR
1854 || code2 == PLUS_EXPR || code2 == MINUS_EXPR)
1855 warning ("suggest parentheses around + or - in operand of &");
1856 /* Check cases like x&y==z */
1857 if (TREE_CODE_CLASS (code1) == '<' || TREE_CODE_CLASS (code2) == '<')
1858 warning ("suggest parentheses around comparison in operand of &");
1862 /* Similarly, check for cases like 1<=i<=10 that are probably errors. */
1863 if (TREE_CODE_CLASS (code) == '<' && extra_warnings
1864 && (TREE_CODE_CLASS (code1) == '<' || TREE_CODE_CLASS (code2) == '<'))
1865 warning ("comparisons like X<=Y<=Z do not have their mathematical meaning");
1867 unsigned_conversion_warning (result, arg1);
1868 unsigned_conversion_warning (result, arg2);
1869 overflow_warning (result);
1871 class = TREE_CODE_CLASS (TREE_CODE (result));
1873 /* Record the code that was specified in the source,
1874 for the sake of warnings about confusing nesting. */
1875 if (IS_EXPR_CODE_CLASS (class))
1876 C_SET_EXP_ORIGINAL_CODE (result, code);
1879 int flag = TREE_CONSTANT (result);
1880 /* We used to use NOP_EXPR rather than NON_LVALUE_EXPR
1881 so that convert_for_assignment wouldn't strip it.
1882 That way, we got warnings for things like p = (1 - 1).
1883 But it turns out we should not get those warnings. */
1884 result = build1 (NON_LVALUE_EXPR, TREE_TYPE (result), result);
1885 C_SET_EXP_ORIGINAL_CODE (result, code);
1886 TREE_CONSTANT (result) = flag;
1892 /* Build a binary-operation expression without default conversions.
1893 CODE is the kind of expression to build.
1894 This function differs from `build' in several ways:
1895 the data type of the result is computed and recorded in it,
1896 warnings are generated if arg data types are invalid,
1897 special handling for addition and subtraction of pointers is known,
1898 and some optimization is done (operations on narrow ints
1899 are done in the narrower type when that gives the same result).
1900 Constant folding is also done before the result is returned.
1902 Note that the operands will never have enumeral types, or function
1903 or array types, because either they will have the default conversions
1904 performed or they have both just been converted to some other type in which
1905 the arithmetic is to be done. */
1908 build_binary_op (code, orig_op0, orig_op1, convert_p)
1909 enum tree_code code;
1910 tree orig_op0, orig_op1;
1914 enum tree_code code0, code1;
1917 /* Expression code to give to the expression when it is built.
1918 Normally this is CODE, which is what the caller asked for,
1919 but in some special cases we change it. */
1920 enum tree_code resultcode = code;
1922 /* Data type in which the computation is to be performed.
1923 In the simplest cases this is the common type of the arguments. */
1924 tree result_type = NULL;
1926 /* Nonzero means operands have already been type-converted
1927 in whatever way is necessary.
1928 Zero means they need to be converted to RESULT_TYPE. */
1931 /* Nonzero means create the expression with this type, rather than
1933 tree build_type = 0;
1935 /* Nonzero means after finally constructing the expression
1936 convert it to this type. */
1937 tree final_type = 0;
1939 /* Nonzero if this is an operation like MIN or MAX which can
1940 safely be computed in short if both args are promoted shorts.
1941 Also implies COMMON.
1942 -1 indicates a bitwise operation; this makes a difference
1943 in the exact conditions for when it is safe to do the operation
1944 in a narrower mode. */
1947 /* Nonzero if this is a comparison operation;
1948 if both args are promoted shorts, compare the original shorts.
1949 Also implies COMMON. */
1950 int short_compare = 0;
1952 /* Nonzero if this is a right-shift operation, which can be computed on the
1953 original short and then promoted if the operand is a promoted short. */
1954 int short_shift = 0;
1956 /* Nonzero means set RESULT_TYPE to the common type of the args. */
1961 op0 = default_conversion (orig_op0);
1962 op1 = default_conversion (orig_op1);
1970 type0 = TREE_TYPE (op0);
1971 type1 = TREE_TYPE (op1);
1973 /* The expression codes of the data types of the arguments tell us
1974 whether the arguments are integers, floating, pointers, etc. */
1975 code0 = TREE_CODE (type0);
1976 code1 = TREE_CODE (type1);
1978 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
1979 STRIP_TYPE_NOPS (op0);
1980 STRIP_TYPE_NOPS (op1);
1982 /* If an error was already reported for one of the arguments,
1983 avoid reporting another error. */
1985 if (code0 == ERROR_MARK || code1 == ERROR_MARK)
1986 return error_mark_node;
1991 /* Handle the pointer + int case. */
1992 if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
1993 return pointer_int_sum (PLUS_EXPR, op0, op1);
1994 else if (code1 == POINTER_TYPE && code0 == INTEGER_TYPE)
1995 return pointer_int_sum (PLUS_EXPR, op1, op0);
2001 /* Subtraction of two similar pointers.
2002 We must subtract them as integers, then divide by object size. */
2003 if (code0 == POINTER_TYPE && code1 == POINTER_TYPE
2004 && comp_target_types (type0, type1))
2005 return pointer_diff (op0, op1);
2006 /* Handle pointer minus int. Just like pointer plus int. */
2007 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
2008 return pointer_int_sum (MINUS_EXPR, op0, op1);
2017 case TRUNC_DIV_EXPR:
2019 case FLOOR_DIV_EXPR:
2020 case ROUND_DIV_EXPR:
2021 case EXACT_DIV_EXPR:
2022 /* Floating point division by zero is a legitimate way to obtain
2023 infinities and NaNs. */
2024 if (warn_div_by_zero && skip_evaluation == 0 && integer_zerop (op1))
2025 warning ("division by zero");
2027 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
2028 || code0 == COMPLEX_TYPE)
2029 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
2030 || code1 == COMPLEX_TYPE))
2032 if (!(code0 == INTEGER_TYPE && code1 == INTEGER_TYPE))
2033 resultcode = RDIV_EXPR;
2035 /* Although it would be tempting to shorten always here, that
2036 loses on some targets, since the modulo instruction is
2037 undefined if the quotient can't be represented in the
2038 computation mode. We shorten only if unsigned or if
2039 dividing by something we know != -1. */
2040 shorten = (TREE_UNSIGNED (TREE_TYPE (orig_op0))
2041 || (TREE_CODE (op1) == INTEGER_CST
2042 && ! integer_all_onesp (op1)));
2048 case BIT_ANDTC_EXPR:
2051 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
2055 case TRUNC_MOD_EXPR:
2056 case FLOOR_MOD_EXPR:
2057 if (warn_div_by_zero && skip_evaluation == 0 && integer_zerop (op1))
2058 warning ("division by zero");
2060 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
2062 /* Although it would be tempting to shorten always here, that loses
2063 on some targets, since the modulo instruction is undefined if the
2064 quotient can't be represented in the computation mode. We shorten
2065 only if unsigned or if dividing by something we know != -1. */
2066 shorten = (TREE_UNSIGNED (TREE_TYPE (orig_op0))
2067 || (TREE_CODE (op1) == INTEGER_CST
2068 && ! integer_all_onesp (op1)));
2073 case TRUTH_ANDIF_EXPR:
2074 case TRUTH_ORIF_EXPR:
2075 case TRUTH_AND_EXPR:
2077 case TRUTH_XOR_EXPR:
2078 if ((code0 == INTEGER_TYPE || code0 == POINTER_TYPE
2079 || code0 == REAL_TYPE || code0 == COMPLEX_TYPE)
2080 && (code1 == INTEGER_TYPE || code1 == POINTER_TYPE
2081 || code1 == REAL_TYPE || code1 == COMPLEX_TYPE))
2083 /* Result of these operations is always an int,
2084 but that does not mean the operands should be
2085 converted to ints! */
2086 result_type = integer_type_node;
2087 op0 = truthvalue_conversion (op0);
2088 op1 = truthvalue_conversion (op1);
2093 /* Shift operations: result has same type as first operand;
2094 always convert second operand to int.
2095 Also set SHORT_SHIFT if shifting rightward. */
2098 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
2100 if (TREE_CODE (op1) == INTEGER_CST && skip_evaluation == 0)
2102 if (tree_int_cst_sgn (op1) < 0)
2103 warning ("right shift count is negative");
2106 if (! integer_zerop (op1))
2109 if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
2110 warning ("right shift count >= width of type");
2114 /* Use the type of the value to be shifted. */
2115 result_type = type0;
2116 /* Convert the shift-count to an integer, regardless of size
2117 of value being shifted. */
2118 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
2119 op1 = convert (integer_type_node, op1);
2120 /* Avoid converting op1 to result_type later. */
2126 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
2128 if (TREE_CODE (op1) == INTEGER_CST && skip_evaluation == 0)
2130 if (tree_int_cst_sgn (op1) < 0)
2131 warning ("left shift count is negative");
2133 else if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
2134 warning ("left shift count >= width of type");
2137 /* Use the type of the value to be shifted. */
2138 result_type = type0;
2139 /* Convert the shift-count to an integer, regardless of size
2140 of value being shifted. */
2141 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
2142 op1 = convert (integer_type_node, op1);
2143 /* Avoid converting op1 to result_type later. */
2150 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
2152 if (TREE_CODE (op1) == INTEGER_CST && skip_evaluation == 0)
2154 if (tree_int_cst_sgn (op1) < 0)
2155 warning ("shift count is negative");
2156 else if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
2157 warning ("shift count >= width of type");
2160 /* Use the type of the value to be shifted. */
2161 result_type = type0;
2162 /* Convert the shift-count to an integer, regardless of size
2163 of value being shifted. */
2164 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
2165 op1 = convert (integer_type_node, op1);
2166 /* Avoid converting op1 to result_type later. */
2173 if (warn_float_equal && (code0 == REAL_TYPE || code1 == REAL_TYPE))
2174 warning ("comparing floating point with == or != is unsafe");
2175 /* Result of comparison is always int,
2176 but don't convert the args to int! */
2177 build_type = integer_type_node;
2178 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
2179 || code0 == COMPLEX_TYPE)
2180 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
2181 || code1 == COMPLEX_TYPE))
2183 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
2185 tree tt0 = TREE_TYPE (type0);
2186 tree tt1 = TREE_TYPE (type1);
2187 /* Anything compares with void *. void * compares with anything.
2188 Otherwise, the targets must be compatible
2189 and both must be object or both incomplete. */
2190 if (comp_target_types (type0, type1))
2191 result_type = common_type (type0, type1);
2192 else if (VOID_TYPE_P (tt0))
2194 /* op0 != orig_op0 detects the case of something
2195 whose value is 0 but which isn't a valid null ptr const. */
2196 if (pedantic && (!integer_zerop (op0) || op0 != orig_op0)
2197 && TREE_CODE (tt1) == FUNCTION_TYPE)
2198 pedwarn ("ISO C forbids comparison of `void *' with function pointer");
2200 else if (VOID_TYPE_P (tt1))
2202 if (pedantic && (!integer_zerop (op1) || op1 != orig_op1)
2203 && TREE_CODE (tt0) == FUNCTION_TYPE)
2204 pedwarn ("ISO C forbids comparison of `void *' with function pointer");
2207 pedwarn ("comparison of distinct pointer types lacks a cast");
2209 if (result_type == NULL_TREE)
2210 result_type = ptr_type_node;
2212 else if (code0 == POINTER_TYPE && TREE_CODE (op1) == INTEGER_CST
2213 && integer_zerop (op1))
2214 result_type = type0;
2215 else if (code1 == POINTER_TYPE && TREE_CODE (op0) == INTEGER_CST
2216 && integer_zerop (op0))
2217 result_type = type1;
2218 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
2220 result_type = type0;
2221 pedwarn ("comparison between pointer and integer");
2223 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
2225 result_type = type1;
2226 pedwarn ("comparison between pointer and integer");
2232 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE)
2233 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE))
2235 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
2237 if (comp_target_types (type0, type1))
2239 result_type = common_type (type0, type1);
2241 && TREE_CODE (TREE_TYPE (type0)) == FUNCTION_TYPE)
2242 pedwarn ("ISO C forbids ordered comparisons of pointers to functions");
2246 result_type = ptr_type_node;
2247 pedwarn ("comparison of distinct pointer types lacks a cast");
2256 build_type = integer_type_node;
2257 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE)
2258 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE))
2260 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
2262 if (comp_target_types (type0, type1))
2264 result_type = common_type (type0, type1);
2265 if (!COMPLETE_TYPE_P (TREE_TYPE (type0))
2266 != !COMPLETE_TYPE_P (TREE_TYPE (type1)))
2267 pedwarn ("comparison of complete and incomplete pointers");
2269 && TREE_CODE (TREE_TYPE (type0)) == FUNCTION_TYPE)
2270 pedwarn ("ISO C forbids ordered comparisons of pointers to functions");
2274 result_type = ptr_type_node;
2275 pedwarn ("comparison of distinct pointer types lacks a cast");
2278 else if (code0 == POINTER_TYPE && TREE_CODE (op1) == INTEGER_CST
2279 && integer_zerop (op1))
2281 result_type = type0;
2282 if (pedantic || extra_warnings)
2283 pedwarn ("ordered comparison of pointer with integer zero");
2285 else if (code1 == POINTER_TYPE && TREE_CODE (op0) == INTEGER_CST
2286 && integer_zerop (op0))
2288 result_type = type1;
2290 pedwarn ("ordered comparison of pointer with integer zero");
2292 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
2294 result_type = type0;
2295 pedwarn ("comparison between pointer and integer");
2297 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
2299 result_type = type1;
2300 pedwarn ("comparison between pointer and integer");
2304 case UNORDERED_EXPR:
2311 build_type = integer_type_node;
2312 if (code0 != REAL_TYPE || code1 != REAL_TYPE)
2314 error ("unordered comparison on non-floating point argument");
2315 return error_mark_node;
2324 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE || code0 == COMPLEX_TYPE)
2326 (code1 == INTEGER_TYPE || code1 == REAL_TYPE || code1 == COMPLEX_TYPE))
2328 int none_complex = (code0 != COMPLEX_TYPE && code1 != COMPLEX_TYPE);
2330 if (shorten || common || short_compare)
2331 result_type = common_type (type0, type1);
2333 /* For certain operations (which identify themselves by shorten != 0)
2334 if both args were extended from the same smaller type,
2335 do the arithmetic in that type and then extend.
2337 shorten !=0 and !=1 indicates a bitwise operation.
2338 For them, this optimization is safe only if
2339 both args are zero-extended or both are sign-extended.
2340 Otherwise, we might change the result.
2341 Eg, (short)-1 | (unsigned short)-1 is (int)-1
2342 but calculated in (unsigned short) it would be (unsigned short)-1. */
2344 if (shorten && none_complex)
2346 int unsigned0, unsigned1;
2347 tree arg0 = get_narrower (op0, &unsigned0);
2348 tree arg1 = get_narrower (op1, &unsigned1);
2349 /* UNS is 1 if the operation to be done is an unsigned one. */
2350 int uns = TREE_UNSIGNED (result_type);
2353 final_type = result_type;
2355 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
2356 but it *requires* conversion to FINAL_TYPE. */
2358 if ((TYPE_PRECISION (TREE_TYPE (op0))
2359 == TYPE_PRECISION (TREE_TYPE (arg0)))
2360 && TREE_TYPE (op0) != final_type)
2361 unsigned0 = TREE_UNSIGNED (TREE_TYPE (op0));
2362 if ((TYPE_PRECISION (TREE_TYPE (op1))
2363 == TYPE_PRECISION (TREE_TYPE (arg1)))
2364 && TREE_TYPE (op1) != final_type)
2365 unsigned1 = TREE_UNSIGNED (TREE_TYPE (op1));
2367 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
2369 /* For bitwise operations, signedness of nominal type
2370 does not matter. Consider only how operands were extended. */
2374 /* Note that in all three cases below we refrain from optimizing
2375 an unsigned operation on sign-extended args.
2376 That would not be valid. */
2378 /* Both args variable: if both extended in same way
2379 from same width, do it in that width.
2380 Do it unsigned if args were zero-extended. */
2381 if ((TYPE_PRECISION (TREE_TYPE (arg0))
2382 < TYPE_PRECISION (result_type))
2383 && (TYPE_PRECISION (TREE_TYPE (arg1))
2384 == TYPE_PRECISION (TREE_TYPE (arg0)))
2385 && unsigned0 == unsigned1
2386 && (unsigned0 || !uns))
2388 = signed_or_unsigned_type (unsigned0,
2389 common_type (TREE_TYPE (arg0), TREE_TYPE (arg1)));
2390 else if (TREE_CODE (arg0) == INTEGER_CST
2391 && (unsigned1 || !uns)
2392 && (TYPE_PRECISION (TREE_TYPE (arg1))
2393 < TYPE_PRECISION (result_type))
2394 && (type = signed_or_unsigned_type (unsigned1,
2396 int_fits_type_p (arg0, type)))
2398 else if (TREE_CODE (arg1) == INTEGER_CST
2399 && (unsigned0 || !uns)
2400 && (TYPE_PRECISION (TREE_TYPE (arg0))
2401 < TYPE_PRECISION (result_type))
2402 && (type = signed_or_unsigned_type (unsigned0,
2404 int_fits_type_p (arg1, type)))
2408 /* Shifts can be shortened if shifting right. */
2413 tree arg0 = get_narrower (op0, &unsigned_arg);
2415 final_type = result_type;
2417 if (arg0 == op0 && final_type == TREE_TYPE (op0))
2418 unsigned_arg = TREE_UNSIGNED (TREE_TYPE (op0));
2420 if (TYPE_PRECISION (TREE_TYPE (arg0)) < TYPE_PRECISION (result_type)
2421 /* We can shorten only if the shift count is less than the
2422 number of bits in the smaller type size. */
2423 && compare_tree_int (op1, TYPE_PRECISION (TREE_TYPE (arg0))) < 0
2424 /* We cannot drop an unsigned shift after sign-extension. */
2425 && (!TREE_UNSIGNED (final_type) || unsigned_arg))
2427 /* Do an unsigned shift if the operand was zero-extended. */
2429 = signed_or_unsigned_type (unsigned_arg, TREE_TYPE (arg0));
2430 /* Convert value-to-be-shifted to that type. */
2431 if (TREE_TYPE (op0) != result_type)
2432 op0 = convert (result_type, op0);
2437 /* Comparison operations are shortened too but differently.
2438 They identify themselves by setting short_compare = 1. */
2442 /* Don't write &op0, etc., because that would prevent op0
2443 from being kept in a register.
2444 Instead, make copies of the our local variables and
2445 pass the copies by reference, then copy them back afterward. */
2446 tree xop0 = op0, xop1 = op1, xresult_type = result_type;
2447 enum tree_code xresultcode = resultcode;
2449 = shorten_compare (&xop0, &xop1, &xresult_type, &xresultcode);
2454 op0 = xop0, op1 = xop1;
2456 resultcode = xresultcode;
2458 if ((warn_sign_compare < 0 ? extra_warnings : warn_sign_compare != 0)
2459 && skip_evaluation == 0)
2461 int op0_signed = ! TREE_UNSIGNED (TREE_TYPE (orig_op0));
2462 int op1_signed = ! TREE_UNSIGNED (TREE_TYPE (orig_op1));
2463 int unsignedp0, unsignedp1;
2464 tree primop0 = get_narrower (op0, &unsignedp0);
2465 tree primop1 = get_narrower (op1, &unsignedp1);
2469 STRIP_TYPE_NOPS (xop0);
2470 STRIP_TYPE_NOPS (xop1);
2472 /* Give warnings for comparisons between signed and unsigned
2473 quantities that may fail.
2475 Do the checking based on the original operand trees, so that
2476 casts will be considered, but default promotions won't be.
2478 Do not warn if the comparison is being done in a signed type,
2479 since the signed type will only be chosen if it can represent
2480 all the values of the unsigned type. */
2481 if (! TREE_UNSIGNED (result_type))
2483 /* Do not warn if both operands are the same signedness. */
2484 else if (op0_signed == op1_signed)
2491 sop = xop0, uop = xop1;
2493 sop = xop1, uop = xop0;
2495 /* Do not warn if the signed quantity is an
2496 unsuffixed integer literal (or some static
2497 constant expression involving such literals or a
2498 conditional expression involving such literals)
2499 and it is non-negative. */
2500 if (tree_expr_nonnegative_p (sop))
2502 /* Do not warn if the comparison is an equality operation,
2503 the unsigned quantity is an integral constant, and it
2504 would fit in the result if the result were signed. */
2505 else if (TREE_CODE (uop) == INTEGER_CST
2506 && (resultcode == EQ_EXPR || resultcode == NE_EXPR)
2507 && int_fits_type_p (uop, signed_type (result_type)))
2509 /* Do not warn if the unsigned quantity is an enumeration
2510 constant and its maximum value would fit in the result
2511 if the result were signed. */
2512 else if (TREE_CODE (uop) == INTEGER_CST
2513 && TREE_CODE (TREE_TYPE (uop)) == ENUMERAL_TYPE
2514 && int_fits_type_p (TYPE_MAX_VALUE (TREE_TYPE(uop)),
2515 signed_type (result_type)))
2518 warning ("comparison between signed and unsigned");
2521 /* Warn if two unsigned values are being compared in a size
2522 larger than their original size, and one (and only one) is the
2523 result of a `~' operator. This comparison will always fail.
2525 Also warn if one operand is a constant, and the constant
2526 does not have all bits set that are set in the ~ operand
2527 when it is extended. */
2529 if ((TREE_CODE (primop0) == BIT_NOT_EXPR)
2530 != (TREE_CODE (primop1) == BIT_NOT_EXPR))
2532 if (TREE_CODE (primop0) == BIT_NOT_EXPR)
2533 primop0 = get_narrower (TREE_OPERAND (primop0, 0),
2536 primop1 = get_narrower (TREE_OPERAND (primop1, 0),
2539 if (host_integerp (primop0, 0) || host_integerp (primop1, 0))
2542 HOST_WIDE_INT constant, mask;
2543 int unsignedp, bits;
2545 if (host_integerp (primop0, 0))
2548 unsignedp = unsignedp1;
2549 constant = tree_low_cst (primop0, 0);
2554 unsignedp = unsignedp0;
2555 constant = tree_low_cst (primop1, 0);
2558 bits = TYPE_PRECISION (TREE_TYPE (primop));
2559 if (bits < TYPE_PRECISION (result_type)
2560 && bits < HOST_BITS_PER_WIDE_INT && unsignedp)
2562 mask = (~ (HOST_WIDE_INT) 0) << bits;
2563 if ((mask & constant) != mask)
2564 warning ("comparison of promoted ~unsigned with constant");
2567 else if (unsignedp0 && unsignedp1
2568 && (TYPE_PRECISION (TREE_TYPE (primop0))
2569 < TYPE_PRECISION (result_type))
2570 && (TYPE_PRECISION (TREE_TYPE (primop1))
2571 < TYPE_PRECISION (result_type)))
2572 warning ("comparison of promoted ~unsigned with unsigned");
2578 /* At this point, RESULT_TYPE must be nonzero to avoid an error message.
2579 If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
2580 Then the expression will be built.
2581 It will be given type FINAL_TYPE if that is nonzero;
2582 otherwise, it will be given type RESULT_TYPE. */
2586 binary_op_error (code);
2587 return error_mark_node;
2592 if (TREE_TYPE (op0) != result_type)
2593 op0 = convert (result_type, op0);
2594 if (TREE_TYPE (op1) != result_type)
2595 op1 = convert (result_type, op1);
2598 if (build_type == NULL_TREE)
2599 build_type = result_type;
2602 tree result = build (resultcode, build_type, op0, op1);
2605 folded = fold (result);
2606 if (folded == result)
2607 TREE_CONSTANT (folded) = TREE_CONSTANT (op0) & TREE_CONSTANT (op1);
2608 if (final_type != 0)
2609 return convert (final_type, folded);
2614 /* Return a tree for the difference of pointers OP0 and OP1.
2615 The resulting tree has type int. */
2618 pointer_diff (op0, op1)
2621 tree result, folded;
2622 tree restype = ptrdiff_type_node;
2624 tree target_type = TREE_TYPE (TREE_TYPE (op0));
2625 tree con0, con1, lit0, lit1;
2626 tree orig_op1 = op1;
2628 if (pedantic || warn_pointer_arith)
2630 if (TREE_CODE (target_type) == VOID_TYPE)
2631 pedwarn ("pointer of type `void *' used in subtraction");
2632 if (TREE_CODE (target_type) == FUNCTION_TYPE)
2633 pedwarn ("pointer to a function used in subtraction");
2636 /* If the conversion to ptrdiff_type does anything like widening or
2637 converting a partial to an integral mode, we get a convert_expression
2638 that is in the way to do any simplifications.
2639 (fold-const.c doesn't know that the extra bits won't be needed.
2640 split_tree uses STRIP_SIGN_NOPS, which leaves conversions to a
2641 different mode in place.)
2642 So first try to find a common term here 'by hand'; we want to cover
2643 at least the cases that occur in legal static initializers. */
2644 con0 = TREE_CODE (op0) == NOP_EXPR ? TREE_OPERAND (op0, 0) : op0;
2645 con1 = TREE_CODE (op1) == NOP_EXPR ? TREE_OPERAND (op1, 0) : op1;
2647 if (TREE_CODE (con0) == PLUS_EXPR)
2649 lit0 = TREE_OPERAND (con0, 1);
2650 con0 = TREE_OPERAND (con0, 0);
2653 lit0 = integer_zero_node;
2655 if (TREE_CODE (con1) == PLUS_EXPR)
2657 lit1 = TREE_OPERAND (con1, 1);
2658 con1 = TREE_OPERAND (con1, 0);
2661 lit1 = integer_zero_node;
2663 if (operand_equal_p (con0, con1, 0))
2670 /* First do the subtraction as integers;
2671 then drop through to build the divide operator.
2672 Do not do default conversions on the minus operator
2673 in case restype is a short type. */
2675 op0 = build_binary_op (MINUS_EXPR, convert (restype, op0),
2676 convert (restype, op1), 0);
2677 /* This generates an error if op1 is pointer to incomplete type. */
2678 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (TREE_TYPE (orig_op1))))
2679 error ("arithmetic on pointer to an incomplete type");
2681 /* This generates an error if op0 is pointer to incomplete type. */
2682 op1 = c_size_in_bytes (target_type);
2684 /* Divide by the size, in easiest possible way. */
2686 result = build (EXACT_DIV_EXPR, restype, op0, convert (restype, op1));
2688 folded = fold (result);
2689 if (folded == result)
2690 TREE_CONSTANT (folded) = TREE_CONSTANT (op0) & TREE_CONSTANT (op1);
2694 /* Construct and perhaps optimize a tree representation
2695 for a unary operation. CODE, a tree_code, specifies the operation
2696 and XARG is the operand.
2697 For any CODE other than ADDR_EXPR, FLAG nonzero suppresses
2698 the default promotions (such as from short to int).
2699 For ADDR_EXPR, the default promotions are not applied; FLAG nonzero
2700 allows non-lvalues; this is only used to handle conversion of non-lvalue
2701 arrays to pointers in C99. */
2704 build_unary_op (code, xarg, flag)
2705 enum tree_code code;
2709 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
2712 enum tree_code typecode = TREE_CODE (TREE_TYPE (arg));
2714 int noconvert = flag;
2716 if (typecode == ERROR_MARK)
2717 return error_mark_node;
2718 if (typecode == ENUMERAL_TYPE || typecode == BOOLEAN_TYPE)
2719 typecode = INTEGER_TYPE;
2724 /* This is used for unary plus, because a CONVERT_EXPR
2725 is enough to prevent anybody from looking inside for
2726 associativity, but won't generate any code. */
2727 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2728 || typecode == COMPLEX_TYPE))
2730 error ("wrong type argument to unary plus");
2731 return error_mark_node;
2733 else if (!noconvert)
2734 arg = default_conversion (arg);
2738 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2739 || typecode == COMPLEX_TYPE))
2741 error ("wrong type argument to unary minus");
2742 return error_mark_node;
2744 else if (!noconvert)
2745 arg = default_conversion (arg);
2749 if (typecode == COMPLEX_TYPE)
2753 pedwarn ("ISO C does not support `~' for complex conjugation");
2755 arg = default_conversion (arg);
2757 else if (typecode != INTEGER_TYPE)
2759 error ("wrong type argument to bit-complement");
2760 return error_mark_node;
2762 else if (!noconvert)
2763 arg = default_conversion (arg);
2767 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2768 || typecode == COMPLEX_TYPE))
2770 error ("wrong type argument to abs");
2771 return error_mark_node;
2773 else if (!noconvert)
2774 arg = default_conversion (arg);
2778 /* Conjugating a real value is a no-op, but allow it anyway. */
2779 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2780 || typecode == COMPLEX_TYPE))
2782 error ("wrong type argument to conjugation");
2783 return error_mark_node;
2785 else if (!noconvert)
2786 arg = default_conversion (arg);
2789 case TRUTH_NOT_EXPR:
2790 if (typecode != INTEGER_TYPE
2791 && typecode != REAL_TYPE && typecode != POINTER_TYPE
2792 && typecode != COMPLEX_TYPE
2793 /* These will convert to a pointer. */
2794 && typecode != ARRAY_TYPE && typecode != FUNCTION_TYPE)
2796 error ("wrong type argument to unary exclamation mark");
2797 return error_mark_node;
2799 arg = truthvalue_conversion (arg);
2800 return invert_truthvalue (arg);
2806 if (TREE_CODE (arg) == COMPLEX_CST)
2807 return TREE_REALPART (arg);
2808 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
2809 return fold (build1 (REALPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg));
2814 if (TREE_CODE (arg) == COMPLEX_CST)
2815 return TREE_IMAGPART (arg);
2816 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
2817 return fold (build1 (IMAGPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg));
2819 return convert (TREE_TYPE (arg), integer_zero_node);
2821 case PREINCREMENT_EXPR:
2822 case POSTINCREMENT_EXPR:
2823 case PREDECREMENT_EXPR:
2824 case POSTDECREMENT_EXPR:
2825 /* Handle complex lvalues (when permitted)
2826 by reduction to simpler cases. */
2828 val = unary_complex_lvalue (code, arg, 0);
2832 /* Increment or decrement the real part of the value,
2833 and don't change the imaginary part. */
2834 if (typecode == COMPLEX_TYPE)
2839 pedwarn ("ISO C does not support `++' and `--' on complex types");
2841 arg = stabilize_reference (arg);
2842 real = build_unary_op (REALPART_EXPR, arg, 1);
2843 imag = build_unary_op (IMAGPART_EXPR, arg, 1);
2844 return build (COMPLEX_EXPR, TREE_TYPE (arg),
2845 build_unary_op (code, real, 1), imag);
2848 /* Report invalid types. */
2850 if (typecode != POINTER_TYPE
2851 && typecode != INTEGER_TYPE && typecode != REAL_TYPE)
2853 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
2854 error ("wrong type argument to increment");
2856 error ("wrong type argument to decrement");
2858 return error_mark_node;
2863 tree result_type = TREE_TYPE (arg);
2865 arg = get_unwidened (arg, 0);
2866 argtype = TREE_TYPE (arg);
2868 /* Compute the increment. */
2870 if (typecode == POINTER_TYPE)
2872 /* If pointer target is an undefined struct,
2873 we just cannot know how to do the arithmetic. */
2874 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (result_type)))
2876 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
2877 error ("increment of pointer to unknown structure");
2879 error ("decrement of pointer to unknown structure");
2881 else if ((pedantic || warn_pointer_arith)
2882 && (TREE_CODE (TREE_TYPE (result_type)) == FUNCTION_TYPE
2883 || TREE_CODE (TREE_TYPE (result_type)) == VOID_TYPE))
2885 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
2886 pedwarn ("wrong type argument to increment");
2888 pedwarn ("wrong type argument to decrement");
2891 inc = c_size_in_bytes (TREE_TYPE (result_type));
2894 inc = integer_one_node;
2896 inc = convert (argtype, inc);
2898 /* Handle incrementing a cast-expression. */
2901 switch (TREE_CODE (arg))
2906 case FIX_TRUNC_EXPR:
2907 case FIX_FLOOR_EXPR:
2908 case FIX_ROUND_EXPR:
2910 pedantic_lvalue_warning (CONVERT_EXPR);
2911 /* If the real type has the same machine representation
2912 as the type it is cast to, we can make better output
2913 by adding directly to the inside of the cast. */
2914 if ((TREE_CODE (TREE_TYPE (arg))
2915 == TREE_CODE (TREE_TYPE (TREE_OPERAND (arg, 0))))
2916 && (TYPE_MODE (TREE_TYPE (arg))
2917 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (arg, 0)))))
2918 arg = TREE_OPERAND (arg, 0);
2921 tree incremented, modify, value;
2922 if (TREE_CODE (TREE_TYPE (arg)) == BOOLEAN_TYPE)
2923 value = boolean_increment (code, arg);
2926 arg = stabilize_reference (arg);
2927 if (code == PREINCREMENT_EXPR || code == PREDECREMENT_EXPR)
2930 value = save_expr (arg);
2931 incremented = build (((code == PREINCREMENT_EXPR
2932 || code == POSTINCREMENT_EXPR)
2933 ? PLUS_EXPR : MINUS_EXPR),
2934 argtype, value, inc);
2935 TREE_SIDE_EFFECTS (incremented) = 1;
2936 modify = build_modify_expr (arg, NOP_EXPR, incremented);
2937 value = build (COMPOUND_EXPR, TREE_TYPE (arg), modify, value);
2939 TREE_USED (value) = 1;
2949 /* Complain about anything else that is not a true lvalue. */
2950 if (!lvalue_or_else (arg, ((code == PREINCREMENT_EXPR
2951 || code == POSTINCREMENT_EXPR)
2952 ? "invalid lvalue in increment"
2953 : "invalid lvalue in decrement")))
2954 return error_mark_node;
2956 /* Report a read-only lvalue. */
2957 if (TREE_READONLY (arg))
2958 readonly_warning (arg,
2959 ((code == PREINCREMENT_EXPR
2960 || code == POSTINCREMENT_EXPR)
2961 ? "increment" : "decrement"));
2963 if (TREE_CODE (TREE_TYPE (arg)) == BOOLEAN_TYPE)
2964 val = boolean_increment (code, arg);
2966 val = build (code, TREE_TYPE (arg), arg, inc);
2967 TREE_SIDE_EFFECTS (val) = 1;
2968 val = convert (result_type, val);
2969 if (TREE_CODE (val) != code)
2970 TREE_NO_UNUSED_WARNING (val) = 1;
2975 /* Note that this operation never does default_conversion. */
2977 /* Let &* cancel out to simplify resulting code. */
2978 if (TREE_CODE (arg) == INDIRECT_REF)
2980 /* Don't let this be an lvalue. */
2981 if (lvalue_p (TREE_OPERAND (arg, 0)))
2982 return non_lvalue (TREE_OPERAND (arg, 0));
2983 return TREE_OPERAND (arg, 0);
2986 /* For &x[y], return x+y */
2987 if (TREE_CODE (arg) == ARRAY_REF)
2989 if (mark_addressable (TREE_OPERAND (arg, 0)) == 0)
2990 return error_mark_node;
2991 return build_binary_op (PLUS_EXPR, TREE_OPERAND (arg, 0),
2992 TREE_OPERAND (arg, 1), 1);
2995 /* Handle complex lvalues (when permitted)
2996 by reduction to simpler cases. */
2997 val = unary_complex_lvalue (code, arg, flag);
3001 #if 0 /* Turned off because inconsistent;
3002 float f; *&(int)f = 3.4 stores in int format
3003 whereas (int)f = 3.4 stores in float format. */
3004 /* Address of a cast is just a cast of the address
3005 of the operand of the cast. */
3006 switch (TREE_CODE (arg))
3011 case FIX_TRUNC_EXPR:
3012 case FIX_FLOOR_EXPR:
3013 case FIX_ROUND_EXPR:
3016 pedwarn ("ISO C forbids the address of a cast expression");
3017 return convert (build_pointer_type (TREE_TYPE (arg)),
3018 build_unary_op (ADDR_EXPR, TREE_OPERAND (arg, 0),
3023 /* Anything not already handled and not a true memory reference
3024 or a non-lvalue array is an error. */
3025 else if (typecode != FUNCTION_TYPE && !flag
3026 && !lvalue_or_else (arg, "invalid lvalue in unary `&'"))
3027 return error_mark_node;
3029 /* Ordinary case; arg is a COMPONENT_REF or a decl. */
3030 argtype = TREE_TYPE (arg);
3032 /* If the lvalue is const or volatile, merge that into the type
3033 to which the address will point. Note that you can't get a
3034 restricted pointer by taking the address of something, so we
3035 only have to deal with `const' and `volatile' here. */
3036 if ((DECL_P (arg) || TREE_CODE_CLASS (TREE_CODE (arg)) == 'r')
3037 && (TREE_READONLY (arg) || TREE_THIS_VOLATILE (arg)))
3038 argtype = c_build_type_variant (argtype,
3039 TREE_READONLY (arg),
3040 TREE_THIS_VOLATILE (arg));
3042 argtype = build_pointer_type (argtype);
3044 if (mark_addressable (arg) == 0)
3045 return error_mark_node;
3050 if (TREE_CODE (arg) == COMPONENT_REF)
3052 tree field = TREE_OPERAND (arg, 1);
3054 addr = build_unary_op (ADDR_EXPR, TREE_OPERAND (arg, 0), flag);
3056 if (DECL_C_BIT_FIELD (field))
3058 error ("attempt to take address of bit-field structure member `%s'",
3059 IDENTIFIER_POINTER (DECL_NAME (field)));
3060 return error_mark_node;
3063 addr = fold (build (PLUS_EXPR, argtype,
3064 convert (argtype, addr),
3065 convert (argtype, byte_position (field))));
3068 addr = build1 (code, argtype, arg);
3070 /* Address of a static or external variable or
3071 file-scope function counts as a constant. */
3073 && ! (TREE_CODE (arg) == FUNCTION_DECL
3074 && DECL_CONTEXT (arg) != 0))
3075 TREE_CONSTANT (addr) = 1;
3084 argtype = TREE_TYPE (arg);
3085 return fold (build1 (code, argtype, arg));
3089 /* If CONVERSIONS is a conversion expression or a nested sequence of such,
3090 convert ARG with the same conversions in the same order
3091 and return the result. */
3094 convert_sequence (conversions, arg)
3098 switch (TREE_CODE (conversions))
3103 case FIX_TRUNC_EXPR:
3104 case FIX_FLOOR_EXPR:
3105 case FIX_ROUND_EXPR:
3107 return convert (TREE_TYPE (conversions),
3108 convert_sequence (TREE_OPERAND (conversions, 0),
3117 /* Return nonzero if REF is an lvalue valid for this language.
3118 Lvalues can be assigned, unless their type has TYPE_READONLY.
3119 Lvalues can have their address taken, unless they have DECL_REGISTER. */
3125 enum tree_code code = TREE_CODE (ref);
3132 return lvalue_p (TREE_OPERAND (ref, 0));
3134 case COMPOUND_LITERAL_EXPR:
3144 return (TREE_CODE (TREE_TYPE (ref)) != FUNCTION_TYPE
3145 && TREE_CODE (TREE_TYPE (ref)) != METHOD_TYPE);
3149 return TREE_CODE (TREE_TYPE (ref)) == ARRAY_TYPE;
3156 /* Return nonzero if REF is an lvalue valid for this language;
3157 otherwise, print an error message and return zero. */
3160 lvalue_or_else (ref, msgid)
3164 int win = lvalue_p (ref);
3167 error ("%s", msgid);
3172 /* Apply unary lvalue-demanding operator CODE to the expression ARG
3173 for certain kinds of expressions which are not really lvalues
3174 but which we can accept as lvalues. If FLAG is nonzero, then
3175 non-lvalues are OK since we may be converting a non-lvalue array to
3178 If ARG is not a kind of expression we can handle, return zero. */
3181 unary_complex_lvalue (code, arg, flag)
3182 enum tree_code code;
3186 /* Handle (a, b) used as an "lvalue". */
3187 if (TREE_CODE (arg) == COMPOUND_EXPR)
3189 tree real_result = build_unary_op (code, TREE_OPERAND (arg, 1), 0);
3191 /* If this returns a function type, it isn't really being used as
3192 an lvalue, so don't issue a warning about it. */
3193 if (TREE_CODE (TREE_TYPE (arg)) != FUNCTION_TYPE && !flag)
3194 pedantic_lvalue_warning (COMPOUND_EXPR);
3196 return build (COMPOUND_EXPR, TREE_TYPE (real_result),
3197 TREE_OPERAND (arg, 0), real_result);
3200 /* Handle (a ? b : c) used as an "lvalue". */
3201 if (TREE_CODE (arg) == COND_EXPR)
3204 pedantic_lvalue_warning (COND_EXPR);
3205 if (TREE_CODE (TREE_TYPE (arg)) != FUNCTION_TYPE && !flag)
3206 pedantic_lvalue_warning (COMPOUND_EXPR);
3208 return (build_conditional_expr
3209 (TREE_OPERAND (arg, 0),
3210 build_unary_op (code, TREE_OPERAND (arg, 1), flag),
3211 build_unary_op (code, TREE_OPERAND (arg, 2), flag)));
3217 /* If pedantic, warn about improper lvalue. CODE is either COND_EXPR
3218 COMPOUND_EXPR, or CONVERT_EXPR (for casts). */
3221 pedantic_lvalue_warning (code)
3222 enum tree_code code;
3228 pedwarn ("ISO C forbids use of conditional expressions as lvalues");
3231 pedwarn ("ISO C forbids use of compound expressions as lvalues");
3234 pedwarn ("ISO C forbids use of cast expressions as lvalues");
3239 /* Warn about storing in something that is `const'. */
3242 readonly_warning (arg, msgid)
3246 if (TREE_CODE (arg) == COMPONENT_REF)
3248 if (TYPE_READONLY (TREE_TYPE (TREE_OPERAND (arg, 0))))
3249 readonly_warning (TREE_OPERAND (arg, 0), msgid);
3251 pedwarn ("%s of read-only member `%s'", _(msgid),
3252 IDENTIFIER_POINTER (DECL_NAME (TREE_OPERAND (arg, 1))));
3254 else if (TREE_CODE (arg) == VAR_DECL)
3255 pedwarn ("%s of read-only variable `%s'", _(msgid),
3256 IDENTIFIER_POINTER (DECL_NAME (arg)));
3258 pedwarn ("%s of read-only location", _(msgid));
3261 /* Mark EXP saying that we need to be able to take the
3262 address of it; it should not be allocated in a register.
3263 Value is 1 if successful. */
3266 mark_addressable (exp)
3271 switch (TREE_CODE (x))
3274 if (DECL_C_BIT_FIELD (TREE_OPERAND (x, 1)))
3276 error ("cannot take address of bit-field `%s'",
3277 IDENTIFIER_POINTER (DECL_NAME (TREE_OPERAND (x, 1))));
3281 /* ... fall through ... */
3287 x = TREE_OPERAND (x, 0);
3290 case COMPOUND_LITERAL_EXPR:
3292 TREE_ADDRESSABLE (x) = 1;
3299 if (DECL_REGISTER (x) && !TREE_ADDRESSABLE (x)
3300 && DECL_NONLOCAL (x))
3302 if (TREE_PUBLIC (x))
3304 error ("global register variable `%s' used in nested function",
3305 IDENTIFIER_POINTER (DECL_NAME (x)));
3308 pedwarn ("register variable `%s' used in nested function",
3309 IDENTIFIER_POINTER (DECL_NAME (x)));
3311 else if (DECL_REGISTER (x) && !TREE_ADDRESSABLE (x))
3313 if (TREE_PUBLIC (x))
3315 error ("address of global register variable `%s' requested",
3316 IDENTIFIER_POINTER (DECL_NAME (x)));
3320 /* If we are making this addressable due to its having
3321 volatile components, give a different error message. Also
3322 handle the case of an unnamed parameter by not trying
3323 to give the name. */
3325 else if (C_TYPE_FIELDS_VOLATILE (TREE_TYPE (x)))
3327 error ("cannot put object with volatile field into register");
3331 pedwarn ("address of register variable `%s' requested",
3332 IDENTIFIER_POINTER (DECL_NAME (x)));
3334 put_var_into_stack (x);
3338 TREE_ADDRESSABLE (x) = 1;
3339 #if 0 /* poplevel deals with this now. */
3340 if (DECL_CONTEXT (x) == 0)
3341 TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (x)) = 1;
3349 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
3352 build_conditional_expr (ifexp, op1, op2)
3353 tree ifexp, op1, op2;
3357 enum tree_code code1;
3358 enum tree_code code2;
3359 tree result_type = NULL;
3360 tree orig_op1 = op1, orig_op2 = op2;
3362 ifexp = truthvalue_conversion (default_conversion (ifexp));
3364 #if 0 /* Produces wrong result if within sizeof. */
3365 /* Don't promote the operands separately if they promote
3366 the same way. Return the unpromoted type and let the combined
3367 value get promoted if necessary. */
3369 if (TREE_TYPE (op1) == TREE_TYPE (op2)
3370 && TREE_CODE (TREE_TYPE (op1)) != ARRAY_TYPE
3371 && TREE_CODE (TREE_TYPE (op1)) != ENUMERAL_TYPE
3372 && TREE_CODE (TREE_TYPE (op1)) != FUNCTION_TYPE)
3374 if (TREE_CODE (ifexp) == INTEGER_CST)
3375 return pedantic_non_lvalue (integer_zerop (ifexp) ? op2 : op1);
3377 return fold (build (COND_EXPR, TREE_TYPE (op1), ifexp, op1, op2));
3381 /* Promote both alternatives. */
3383 if (TREE_CODE (TREE_TYPE (op1)) != VOID_TYPE)
3384 op1 = default_conversion (op1);
3385 if (TREE_CODE (TREE_TYPE (op2)) != VOID_TYPE)
3386 op2 = default_conversion (op2);
3388 if (TREE_CODE (ifexp) == ERROR_MARK
3389 || TREE_CODE (TREE_TYPE (op1)) == ERROR_MARK
3390 || TREE_CODE (TREE_TYPE (op2)) == ERROR_MARK)
3391 return error_mark_node;
3393 type1 = TREE_TYPE (op1);
3394 code1 = TREE_CODE (type1);
3395 type2 = TREE_TYPE (op2);
3396 code2 = TREE_CODE (type2);
3398 /* Quickly detect the usual case where op1 and op2 have the same type
3400 if (TYPE_MAIN_VARIANT (type1) == TYPE_MAIN_VARIANT (type2))
3403 result_type = type1;
3405 result_type = TYPE_MAIN_VARIANT (type1);
3407 else if ((code1 == INTEGER_TYPE || code1 == REAL_TYPE
3408 || code1 == COMPLEX_TYPE)
3409 && (code2 == INTEGER_TYPE || code2 == REAL_TYPE
3410 || code2 == COMPLEX_TYPE))
3412 result_type = common_type (type1, type2);
3414 /* If -Wsign-compare, warn here if type1 and type2 have
3415 different signedness. We'll promote the signed to unsigned
3416 and later code won't know it used to be different.
3417 Do this check on the original types, so that explicit casts
3418 will be considered, but default promotions won't. */
3419 if ((warn_sign_compare < 0 ? extra_warnings : warn_sign_compare)
3420 && !skip_evaluation)
3422 int unsigned_op1 = TREE_UNSIGNED (TREE_TYPE (orig_op1));
3423 int unsigned_op2 = TREE_UNSIGNED (TREE_TYPE (orig_op2));
3425 if (unsigned_op1 ^ unsigned_op2)
3427 /* Do not warn if the result type is signed, since the
3428 signed type will only be chosen if it can represent
3429 all the values of the unsigned type. */
3430 if (! TREE_UNSIGNED (result_type))
3432 /* Do not warn if the signed quantity is an unsuffixed
3433 integer literal (or some static constant expression
3434 involving such literals) and it is non-negative. */
3435 else if ((unsigned_op2 && tree_expr_nonnegative_p (op1))
3436 || (unsigned_op1 && tree_expr_nonnegative_p (op2)))
3439 warning ("signed and unsigned type in conditional expression");
3443 else if (code1 == VOID_TYPE || code2 == VOID_TYPE)
3445 if (pedantic && (code1 != VOID_TYPE || code2 != VOID_TYPE))
3446 pedwarn ("ISO C forbids conditional expr with only one void side");
3447 result_type = void_type_node;
3449 else if (code1 == POINTER_TYPE && code2 == POINTER_TYPE)
3451 if (comp_target_types (type1, type2))
3452 result_type = common_type (type1, type2);
3453 else if (integer_zerop (op1) && TREE_TYPE (type1) == void_type_node
3454 && TREE_CODE (orig_op1) != NOP_EXPR)
3455 result_type = qualify_type (type2, type1);
3456 else if (integer_zerop (op2) && TREE_TYPE (type2) == void_type_node
3457 && TREE_CODE (orig_op2) != NOP_EXPR)
3458 result_type = qualify_type (type1, type2);
3459 else if (VOID_TYPE_P (TREE_TYPE (type1)))
3461 if (pedantic && TREE_CODE (TREE_TYPE (type2)) == FUNCTION_TYPE)
3462 pedwarn ("ISO C forbids conditional expr between `void *' and function pointer");
3463 result_type = build_pointer_type (qualify_type (TREE_TYPE (type1),
3464 TREE_TYPE (type2)));
3466 else if (VOID_TYPE_P (TREE_TYPE (type2)))
3468 if (pedantic && TREE_CODE (TREE_TYPE (type1)) == FUNCTION_TYPE)
3469 pedwarn ("ISO C forbids conditional expr between `void *' and function pointer");
3470 result_type = build_pointer_type (qualify_type (TREE_TYPE (type2),
3471 TREE_TYPE (type1)));
3475 pedwarn ("pointer type mismatch in conditional expression");
3476 result_type = build_pointer_type (void_type_node);
3479 else if (code1 == POINTER_TYPE && code2 == INTEGER_TYPE)
3481 if (! integer_zerop (op2))
3482 pedwarn ("pointer/integer type mismatch in conditional expression");
3485 op2 = null_pointer_node;
3487 result_type = type1;
3489 else if (code2 == POINTER_TYPE && code1 == INTEGER_TYPE)
3491 if (!integer_zerop (op1))
3492 pedwarn ("pointer/integer type mismatch in conditional expression");
3495 op1 = null_pointer_node;
3497 result_type = type2;
3502 if (flag_cond_mismatch)
3503 result_type = void_type_node;
3506 error ("type mismatch in conditional expression");
3507 return error_mark_node;
3511 /* Merge const and volatile flags of the incoming types. */
3513 = build_type_variant (result_type,
3514 TREE_READONLY (op1) || TREE_READONLY (op2),
3515 TREE_THIS_VOLATILE (op1) || TREE_THIS_VOLATILE (op2));
3517 if (result_type != TREE_TYPE (op1))
3518 op1 = convert_and_check (result_type, op1);
3519 if (result_type != TREE_TYPE (op2))
3520 op2 = convert_and_check (result_type, op2);
3522 if (TREE_CODE (ifexp) == INTEGER_CST)
3523 return pedantic_non_lvalue (integer_zerop (ifexp) ? op2 : op1);
3525 return fold (build (COND_EXPR, result_type, ifexp, op1, op2));
3528 /* Given a list of expressions, return a compound expression
3529 that performs them all and returns the value of the last of them. */
3532 build_compound_expr (list)
3535 return internal_build_compound_expr (list, TRUE);
3539 internal_build_compound_expr (list, first_p)
3545 if (TREE_CHAIN (list) == 0)
3547 /* Convert arrays and functions to pointers when there
3548 really is a comma operator. */
3551 = default_function_array_conversion (TREE_VALUE (list));
3553 #if 0 /* If something inside inhibited lvalueness, we should not override. */
3554 /* Consider (x, y+0), which is not an lvalue since y+0 is not. */
3556 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
3557 if (TREE_CODE (list) == NON_LVALUE_EXPR)
3558 list = TREE_OPERAND (list, 0);
3561 /* Don't let (0, 0) be null pointer constant. */
3562 if (!first_p && integer_zerop (TREE_VALUE (list)))
3563 return non_lvalue (TREE_VALUE (list));
3564 return TREE_VALUE (list);
3567 rest = internal_build_compound_expr (TREE_CHAIN (list), FALSE);
3569 if (! TREE_SIDE_EFFECTS (TREE_VALUE (list)))
3571 /* The left-hand operand of a comma expression is like an expression
3572 statement: with -W or -Wunused, we should warn if it doesn't have
3573 any side-effects, unless it was explicitly cast to (void). */
3574 if ((extra_warnings || warn_unused_value)
3575 && ! (TREE_CODE (TREE_VALUE (list)) == CONVERT_EXPR
3576 && VOID_TYPE_P (TREE_TYPE (TREE_VALUE (list)))))
3577 warning ("left-hand operand of comma expression has no effect");
3579 /* When pedantic, a compound expression can be neither an lvalue
3580 nor an integer constant expression. */
3585 /* With -Wunused, we should also warn if the left-hand operand does have
3586 side-effects, but computes a value which is not used. For example, in
3587 `foo() + bar(), baz()' the result of the `+' operator is not used,
3588 so we should issue a warning. */
3589 else if (warn_unused_value)
3590 warn_if_unused_value (TREE_VALUE (list));
3592 return build (COMPOUND_EXPR, TREE_TYPE (rest), TREE_VALUE (list), rest);
3595 /* Build an expression representing a cast to type TYPE of expression EXPR. */
3598 build_c_cast (type, expr)
3604 if (type == error_mark_node || expr == error_mark_node)
3605 return error_mark_node;
3606 type = TYPE_MAIN_VARIANT (type);
3609 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
3610 if (TREE_CODE (value) == NON_LVALUE_EXPR)
3611 value = TREE_OPERAND (value, 0);
3614 if (TREE_CODE (type) == ARRAY_TYPE)
3616 error ("cast specifies array type");
3617 return error_mark_node;
3620 if (TREE_CODE (type) == FUNCTION_TYPE)
3622 error ("cast specifies function type");
3623 return error_mark_node;
3626 if (type == TYPE_MAIN_VARIANT (TREE_TYPE (value)))
3630 if (TREE_CODE (type) == RECORD_TYPE
3631 || TREE_CODE (type) == UNION_TYPE)
3632 pedwarn ("ISO C forbids casting nonscalar to the same type");
3635 else if (TREE_CODE (type) == UNION_TYPE)
3638 value = default_function_array_conversion (value);
3640 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
3641 if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (field)),
3642 TYPE_MAIN_VARIANT (TREE_TYPE (value))))
3651 pedwarn ("ISO C forbids casts to union type");
3652 if (TYPE_NAME (type) != 0)
3654 if (TREE_CODE (TYPE_NAME (type)) == IDENTIFIER_NODE)
3655 name = IDENTIFIER_POINTER (TYPE_NAME (type));
3657 name = IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type)));
3661 t = digest_init (type, build (CONSTRUCTOR, type, NULL_TREE,
3662 build_tree_list (field, value)), 0);
3663 TREE_CONSTANT (t) = TREE_CONSTANT (value);
3666 error ("cast to union type from type not present in union");
3667 return error_mark_node;
3673 /* If casting to void, avoid the error that would come
3674 from default_conversion in the case of a non-lvalue array. */
3675 if (type == void_type_node)
3676 return build1 (CONVERT_EXPR, type, value);
3678 /* Convert functions and arrays to pointers,
3679 but don't convert any other types. */
3680 value = default_function_array_conversion (value);
3681 otype = TREE_TYPE (value);
3683 /* Optionally warn about potentially worrisome casts. */
3686 && TREE_CODE (type) == POINTER_TYPE
3687 && TREE_CODE (otype) == POINTER_TYPE)
3689 tree in_type = type;
3690 tree in_otype = otype;
3694 /* Check that the qualifiers on IN_TYPE are a superset of
3695 the qualifiers of IN_OTYPE. The outermost level of
3696 POINTER_TYPE nodes is uninteresting and we stop as soon
3697 as we hit a non-POINTER_TYPE node on either type. */
3700 in_otype = TREE_TYPE (in_otype);
3701 in_type = TREE_TYPE (in_type);
3703 /* GNU C allows cv-qualified function types. 'const'
3704 means the function is very pure, 'volatile' means it
3705 can't return. We need to warn when such qualifiers
3706 are added, not when they're taken away. */
3707 if (TREE_CODE (in_otype) == FUNCTION_TYPE
3708 && TREE_CODE (in_type) == FUNCTION_TYPE)
3709 added |= (TYPE_QUALS (in_type) & ~TYPE_QUALS (in_otype));
3711 discarded |= (TYPE_QUALS (in_otype) & ~TYPE_QUALS (in_type));
3713 while (TREE_CODE (in_type) == POINTER_TYPE
3714 && TREE_CODE (in_otype) == POINTER_TYPE);
3717 warning ("cast adds new qualifiers to function type");
3720 /* There are qualifiers present in IN_OTYPE that are not
3721 present in IN_TYPE. */
3722 warning ("cast discards qualifiers from pointer target type");
3725 /* Warn about possible alignment problems. */
3726 if (STRICT_ALIGNMENT && warn_cast_align
3727 && TREE_CODE (type) == POINTER_TYPE
3728 && TREE_CODE (otype) == POINTER_TYPE
3729 && TREE_CODE (TREE_TYPE (otype)) != VOID_TYPE
3730 && TREE_CODE (TREE_TYPE (otype)) != FUNCTION_TYPE
3731 /* Don't warn about opaque types, where the actual alignment
3732 restriction is unknown. */
3733 && !((TREE_CODE (TREE_TYPE (otype)) == UNION_TYPE
3734 || TREE_CODE (TREE_TYPE (otype)) == RECORD_TYPE)
3735 && TYPE_MODE (TREE_TYPE (otype)) == VOIDmode)
3736 && TYPE_ALIGN (TREE_TYPE (type)) > TYPE_ALIGN (TREE_TYPE (otype)))
3737 warning ("cast increases required alignment of target type");
3739 if (TREE_CODE (type) == INTEGER_TYPE
3740 && TREE_CODE (otype) == POINTER_TYPE
3741 && TYPE_PRECISION (type) != TYPE_PRECISION (otype)
3742 && !TREE_CONSTANT (value))
3743 warning ("cast from pointer to integer of different size");
3745 if (warn_bad_function_cast
3746 && TREE_CODE (value) == CALL_EXPR
3747 && TREE_CODE (type) != TREE_CODE (otype))
3748 warning ("cast does not match function type");
3750 if (TREE_CODE (type) == POINTER_TYPE
3751 && TREE_CODE (otype) == INTEGER_TYPE
3752 && TYPE_PRECISION (type) != TYPE_PRECISION (otype)
3753 /* Don't warn about converting any constant. */
3754 && !TREE_CONSTANT (value))
3755 warning ("cast to pointer from integer of different size");
3758 value = convert (type, value);
3760 /* Ignore any integer overflow caused by the cast. */
3761 if (TREE_CODE (value) == INTEGER_CST)
3763 TREE_OVERFLOW (value) = TREE_OVERFLOW (ovalue);
3764 TREE_CONSTANT_OVERFLOW (value) = TREE_CONSTANT_OVERFLOW (ovalue);
3768 /* Pedantically, don't let (void *) (FOO *) 0 be a null pointer constant. */
3769 if (pedantic && TREE_CODE (value) == INTEGER_CST
3770 && TREE_CODE (expr) == INTEGER_CST
3771 && TREE_CODE (TREE_TYPE (expr)) != INTEGER_TYPE)
3772 value = non_lvalue (value);
3774 /* If pedantic, don't let a cast be an lvalue. */
3775 if (value == expr && pedantic)
3776 value = non_lvalue (value);
3781 /* Interpret a cast of expression EXPR to type TYPE. */
3783 c_cast_expr (type, expr)
3786 int saved_wsp = warn_strict_prototypes;
3788 /* This avoids warnings about unprototyped casts on
3789 integers. E.g. "#define SIG_DFL (void(*)())0". */
3790 if (TREE_CODE (expr) == INTEGER_CST)
3791 warn_strict_prototypes = 0;
3792 type = groktypename (type);
3793 warn_strict_prototypes = saved_wsp;
3795 return build_c_cast (type, expr);
3799 /* Build an assignment expression of lvalue LHS from value RHS.
3800 MODIFYCODE is the code for a binary operator that we use
3801 to combine the old value of LHS with RHS to get the new value.
3802 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment. */
3805 build_modify_expr (lhs, modifycode, rhs)
3807 enum tree_code modifycode;
3811 tree lhstype = TREE_TYPE (lhs);
3812 tree olhstype = lhstype;
3814 /* Types that aren't fully specified cannot be used in assignments. */
3815 lhs = require_complete_type (lhs);
3817 /* Avoid duplicate error messages from operands that had errors. */
3818 if (TREE_CODE (lhs) == ERROR_MARK || TREE_CODE (rhs) == ERROR_MARK)
3819 return error_mark_node;
3821 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
3822 /* Do not use STRIP_NOPS here. We do not want an enumerator
3823 whose value is 0 to count as a null pointer constant. */
3824 if (TREE_CODE (rhs) == NON_LVALUE_EXPR)
3825 rhs = TREE_OPERAND (rhs, 0);
3829 /* Handle control structure constructs used as "lvalues". */
3831 switch (TREE_CODE (lhs))
3833 /* Handle (a, b) used as an "lvalue". */
3835 pedantic_lvalue_warning (COMPOUND_EXPR);
3836 newrhs = build_modify_expr (TREE_OPERAND (lhs, 1), modifycode, rhs);
3837 if (TREE_CODE (newrhs) == ERROR_MARK)
3838 return error_mark_node;
3839 return build (COMPOUND_EXPR, lhstype,
3840 TREE_OPERAND (lhs, 0), newrhs);
3842 /* Handle (a ? b : c) used as an "lvalue". */
3844 pedantic_lvalue_warning (COND_EXPR);
3845 rhs = save_expr (rhs);
3847 /* Produce (a ? (b = rhs) : (c = rhs))
3848 except that the RHS goes through a save-expr
3849 so the code to compute it is only emitted once. */
3851 = build_conditional_expr (TREE_OPERAND (lhs, 0),
3852 build_modify_expr (TREE_OPERAND (lhs, 1),
3854 build_modify_expr (TREE_OPERAND (lhs, 2),
3856 if (TREE_CODE (cond) == ERROR_MARK)
3858 /* Make sure the code to compute the rhs comes out
3859 before the split. */
3860 return build (COMPOUND_EXPR, TREE_TYPE (lhs),
3861 /* But cast it to void to avoid an "unused" error. */
3862 convert (void_type_node, rhs), cond);
3868 /* If a binary op has been requested, combine the old LHS value with the RHS
3869 producing the value we should actually store into the LHS. */
3871 if (modifycode != NOP_EXPR)
3873 lhs = stabilize_reference (lhs);
3874 newrhs = build_binary_op (modifycode, lhs, rhs, 1);
3877 /* Handle a cast used as an "lvalue".
3878 We have already performed any binary operator using the value as cast.
3879 Now convert the result to the cast type of the lhs,
3880 and then true type of the lhs and store it there;
3881 then convert result back to the cast type to be the value
3882 of the assignment. */
3884 switch (TREE_CODE (lhs))
3889 case FIX_TRUNC_EXPR:
3890 case FIX_FLOOR_EXPR:
3891 case FIX_ROUND_EXPR:
3893 newrhs = default_function_array_conversion (newrhs);
3895 tree inner_lhs = TREE_OPERAND (lhs, 0);
3897 result = build_modify_expr (inner_lhs, NOP_EXPR,
3898 convert (TREE_TYPE (inner_lhs),
3899 convert (lhstype, newrhs)));
3900 if (TREE_CODE (result) == ERROR_MARK)
3902 pedantic_lvalue_warning (CONVERT_EXPR);
3903 return convert (TREE_TYPE (lhs), result);
3910 /* Now we have handled acceptable kinds of LHS that are not truly lvalues.
3911 Reject anything strange now. */
3913 if (!lvalue_or_else (lhs, "invalid lvalue in assignment"))
3914 return error_mark_node;
3916 /* Warn about storing in something that is `const'. */
3918 if (TREE_READONLY (lhs) || TYPE_READONLY (lhstype)
3919 || ((TREE_CODE (lhstype) == RECORD_TYPE
3920 || TREE_CODE (lhstype) == UNION_TYPE)
3921 && C_TYPE_FIELDS_READONLY (lhstype)))
3922 readonly_warning (lhs, "assignment");
3924 /* If storing into a structure or union member,
3925 it has probably been given type `int'.
3926 Compute the type that would go with
3927 the actual amount of storage the member occupies. */
3929 if (TREE_CODE (lhs) == COMPONENT_REF
3930 && (TREE_CODE (lhstype) == INTEGER_TYPE
3931 || TREE_CODE (lhstype) == BOOLEAN_TYPE
3932 || TREE_CODE (lhstype) == REAL_TYPE
3933 || TREE_CODE (lhstype) == ENUMERAL_TYPE))
3934 lhstype = TREE_TYPE (get_unwidened (lhs, 0));
3936 /* If storing in a field that is in actuality a short or narrower than one,
3937 we must store in the field in its actual type. */
3939 if (lhstype != TREE_TYPE (lhs))
3941 lhs = copy_node (lhs);
3942 TREE_TYPE (lhs) = lhstype;
3945 /* Convert new value to destination type. */
3947 newrhs = convert_for_assignment (lhstype, newrhs, _("assignment"),
3948 NULL_TREE, NULL_TREE, 0);
3949 if (TREE_CODE (newrhs) == ERROR_MARK)
3950 return error_mark_node;
3954 result = build (MODIFY_EXPR, lhstype, lhs, newrhs);
3955 TREE_SIDE_EFFECTS (result) = 1;
3957 /* If we got the LHS in a different type for storing in,
3958 convert the result back to the nominal type of LHS
3959 so that the value we return always has the same type
3960 as the LHS argument. */
3962 if (olhstype == TREE_TYPE (result))
3964 return convert_for_assignment (olhstype, result, _("assignment"),
3965 NULL_TREE, NULL_TREE, 0);
3968 /* Convert value RHS to type TYPE as preparation for an assignment
3969 to an lvalue of type TYPE.
3970 The real work of conversion is done by `convert'.
3971 The purpose of this function is to generate error messages
3972 for assignments that are not allowed in C.
3973 ERRTYPE is a string to use in error messages:
3974 "assignment", "return", etc. If it is null, this is parameter passing
3975 for a function call (and different error messages are output).
3977 FUNNAME is the name of the function being called,
3978 as an IDENTIFIER_NODE, or null.
3979 PARMNUM is the number of the argument, for printing in error messages. */
3982 convert_for_assignment (type, rhs, errtype, fundecl, funname, parmnum)
3984 const char *errtype;
3985 tree fundecl, funname;
3988 enum tree_code codel = TREE_CODE (type);
3990 enum tree_code coder;
3992 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
3993 /* Do not use STRIP_NOPS here. We do not want an enumerator
3994 whose value is 0 to count as a null pointer constant. */
3995 if (TREE_CODE (rhs) == NON_LVALUE_EXPR)
3996 rhs = TREE_OPERAND (rhs, 0);
3998 if (TREE_CODE (TREE_TYPE (rhs)) == ARRAY_TYPE
3999 || TREE_CODE (TREE_TYPE (rhs)) == FUNCTION_TYPE)
4000 rhs = default_conversion (rhs);
4001 else if (optimize && TREE_CODE (rhs) == VAR_DECL)
4002 rhs = decl_constant_value_for_broken_optimization (rhs);
4004 rhstype = TREE_TYPE (rhs);
4005 coder = TREE_CODE (rhstype);
4007 if (coder == ERROR_MARK)
4008 return error_mark_node;
4010 if (TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (rhstype))
4012 overflow_warning (rhs);
4013 /* Check for Objective-C protocols. This will issue a warning if
4014 there are protocol violations. No need to use the return value. */
4015 maybe_objc_comptypes (type, rhstype, 0);
4019 if (coder == VOID_TYPE)
4021 error ("void value not ignored as it ought to be");
4022 return error_mark_node;
4024 /* A type converts to a reference to it.
4025 This code doesn't fully support references, it's just for the
4026 special case of va_start and va_copy. */
4027 if (codel == REFERENCE_TYPE
4028 && comptypes (TREE_TYPE (type), TREE_TYPE (rhs)) == 1)
4030 if (mark_addressable (rhs) == 0)
4031 return error_mark_node;
4032 rhs = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (rhs)), rhs);
4034 /* We already know that these two types are compatible, but they
4035 may not be exactly identical. In fact, `TREE_TYPE (type)' is
4036 likely to be __builtin_va_list and `TREE_TYPE (rhs)' is
4037 likely to be va_list, a typedef to __builtin_va_list, which
4038 is different enough that it will cause problems later. */
4039 if (TREE_TYPE (TREE_TYPE (rhs)) != TREE_TYPE (type))
4040 rhs = build1 (NOP_EXPR, build_pointer_type (TREE_TYPE (type)), rhs);
4042 rhs = build1 (NOP_EXPR, type, rhs);
4045 /* Arithmetic types all interconvert, and enum is treated like int. */
4046 else if ((codel == INTEGER_TYPE || codel == REAL_TYPE
4047 || codel == ENUMERAL_TYPE || codel == COMPLEX_TYPE
4048 || codel == BOOLEAN_TYPE)
4049 && (coder == INTEGER_TYPE || coder == REAL_TYPE
4050 || coder == ENUMERAL_TYPE || coder == COMPLEX_TYPE
4051 || coder == BOOLEAN_TYPE))
4052 return convert_and_check (type, rhs);
4054 /* Conversion to a transparent union from its member types.
4055 This applies only to function arguments. */
4056 else if (codel == UNION_TYPE && TYPE_TRANSPARENT_UNION (type) && ! errtype)
4059 tree marginal_memb_type = 0;
4061 for (memb_types = TYPE_FIELDS (type); memb_types;
4062 memb_types = TREE_CHAIN (memb_types))
4064 tree memb_type = TREE_TYPE (memb_types);
4066 if (comptypes (TYPE_MAIN_VARIANT (memb_type),
4067 TYPE_MAIN_VARIANT (rhstype)))
4070 if (TREE_CODE (memb_type) != POINTER_TYPE)
4073 if (coder == POINTER_TYPE)
4075 tree ttl = TREE_TYPE (memb_type);
4076 tree ttr = TREE_TYPE (rhstype);
4078 /* Any non-function converts to a [const][volatile] void *
4079 and vice versa; otherwise, targets must be the same.
4080 Meanwhile, the lhs target must have all the qualifiers of
4082 if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
4083 || comp_target_types (memb_type, rhstype))
4085 /* If this type won't generate any warnings, use it. */
4086 if (TYPE_QUALS (ttl) == TYPE_QUALS (ttr)
4087 || ((TREE_CODE (ttr) == FUNCTION_TYPE
4088 && TREE_CODE (ttl) == FUNCTION_TYPE)
4089 ? ((TYPE_QUALS (ttl) | TYPE_QUALS (ttr))
4090 == TYPE_QUALS (ttr))
4091 : ((TYPE_QUALS (ttl) | TYPE_QUALS (ttr))
4092 == TYPE_QUALS (ttl))))
4095 /* Keep looking for a better type, but remember this one. */
4096 if (! marginal_memb_type)
4097 marginal_memb_type = memb_type;
4101 /* Can convert integer zero to any pointer type. */
4102 if (integer_zerop (rhs)
4103 || (TREE_CODE (rhs) == NOP_EXPR
4104 && integer_zerop (TREE_OPERAND (rhs, 0))))
4106 rhs = null_pointer_node;
4111 if (memb_types || marginal_memb_type)
4115 /* We have only a marginally acceptable member type;
4116 it needs a warning. */
4117 tree ttl = TREE_TYPE (marginal_memb_type);
4118 tree ttr = TREE_TYPE (rhstype);
4120 /* Const and volatile mean something different for function
4121 types, so the usual warnings are not appropriate. */
4122 if (TREE_CODE (ttr) == FUNCTION_TYPE
4123 && TREE_CODE (ttl) == FUNCTION_TYPE)
4125 /* Because const and volatile on functions are
4126 restrictions that say the function will not do
4127 certain things, it is okay to use a const or volatile
4128 function where an ordinary one is wanted, but not
4130 if (TYPE_QUALS (ttl) & ~TYPE_QUALS (ttr))
4131 warn_for_assignment ("%s makes qualified function pointer from unqualified",
4132 errtype, funname, parmnum);
4134 else if (TYPE_QUALS (ttr) & ~TYPE_QUALS (ttl))
4135 warn_for_assignment ("%s discards qualifiers from pointer target type",
4140 if (pedantic && ! DECL_IN_SYSTEM_HEADER (fundecl))
4141 pedwarn ("ISO C prohibits argument conversion to union type");
4143 return build1 (NOP_EXPR, type, rhs);
4147 /* Conversions among pointers */
4148 else if ((codel == POINTER_TYPE || codel == REFERENCE_TYPE)
4149 && (coder == POINTER_TYPE || coder == REFERENCE_TYPE))
4151 tree ttl = TREE_TYPE (type);
4152 tree ttr = TREE_TYPE (rhstype);
4154 /* Any non-function converts to a [const][volatile] void *
4155 and vice versa; otherwise, targets must be the same.
4156 Meanwhile, the lhs target must have all the qualifiers of the rhs. */
4157 if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
4158 || comp_target_types (type, rhstype)
4159 || (unsigned_type (TYPE_MAIN_VARIANT (ttl))
4160 == unsigned_type (TYPE_MAIN_VARIANT (ttr))))
4163 && ((VOID_TYPE_P (ttl) && TREE_CODE (ttr) == FUNCTION_TYPE)
4166 /* Check TREE_CODE to catch cases like (void *) (char *) 0
4167 which are not ANSI null ptr constants. */
4168 && (!integer_zerop (rhs) || TREE_CODE (rhs) == NOP_EXPR)
4169 && TREE_CODE (ttl) == FUNCTION_TYPE)))
4170 warn_for_assignment ("ISO C forbids %s between function pointer and `void *'",
4171 errtype, funname, parmnum);
4172 /* Const and volatile mean something different for function types,
4173 so the usual warnings are not appropriate. */
4174 else if (TREE_CODE (ttr) != FUNCTION_TYPE
4175 && TREE_CODE (ttl) != FUNCTION_TYPE)
4177 if (TYPE_QUALS (ttr) & ~TYPE_QUALS (ttl))
4178 warn_for_assignment ("%s discards qualifiers from pointer target type",
4179 errtype, funname, parmnum);
4180 /* If this is not a case of ignoring a mismatch in signedness,
4182 else if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
4183 || comp_target_types (type, rhstype))
4185 /* If there is a mismatch, do warn. */
4187 warn_for_assignment ("pointer targets in %s differ in signedness",
4188 errtype, funname, parmnum);
4190 else if (TREE_CODE (ttl) == FUNCTION_TYPE
4191 && TREE_CODE (ttr) == FUNCTION_TYPE)
4193 /* Because const and volatile on functions are restrictions
4194 that say the function will not do certain things,
4195 it is okay to use a const or volatile function
4196 where an ordinary one is wanted, but not vice-versa. */
4197 if (TYPE_QUALS (ttl) & ~TYPE_QUALS (ttr))
4198 warn_for_assignment ("%s makes qualified function pointer from unqualified",
4199 errtype, funname, parmnum);
4203 warn_for_assignment ("%s from incompatible pointer type",
4204 errtype, funname, parmnum);
4205 return convert (type, rhs);
4207 else if (codel == POINTER_TYPE && coder == INTEGER_TYPE)
4209 /* An explicit constant 0 can convert to a pointer,
4210 or one that results from arithmetic, even including
4211 a cast to integer type. */
4212 if (! (TREE_CODE (rhs) == INTEGER_CST && integer_zerop (rhs))
4214 ! (TREE_CODE (rhs) == NOP_EXPR
4215 && TREE_CODE (TREE_TYPE (rhs)) == INTEGER_TYPE
4216 && TREE_CODE (TREE_OPERAND (rhs, 0)) == INTEGER_CST
4217 && integer_zerop (TREE_OPERAND (rhs, 0))))
4219 warn_for_assignment ("%s makes pointer from integer without a cast",
4220 errtype, funname, parmnum);
4221 return convert (type, rhs);
4223 return null_pointer_node;
4225 else if (codel == INTEGER_TYPE && coder == POINTER_TYPE)
4227 warn_for_assignment ("%s makes integer from pointer without a cast",
4228 errtype, funname, parmnum);
4229 return convert (type, rhs);
4231 else if (codel == BOOLEAN_TYPE && coder == POINTER_TYPE)
4232 return convert (type, rhs);
4238 tree selector = maybe_building_objc_message_expr ();
4240 if (selector && parmnum > 2)
4241 error ("incompatible type for argument %d of `%s'",
4242 parmnum - 2, IDENTIFIER_POINTER (selector));
4244 error ("incompatible type for argument %d of `%s'",
4245 parmnum, IDENTIFIER_POINTER (funname));
4248 error ("incompatible type for argument %d of indirect function call",
4252 error ("incompatible types in %s", errtype);
4254 return error_mark_node;
4257 /* Print a warning using MSGID.
4258 It gets OPNAME as its one parameter.
4259 If OPNAME is null, it is replaced by "passing arg ARGNUM of `FUNCTION'".
4260 FUNCTION and ARGNUM are handled specially if we are building an
4261 Objective-C selector. */
4264 warn_for_assignment (msgid, opname, function, argnum)
4272 tree selector = maybe_building_objc_message_expr ();
4275 if (selector && argnum > 2)
4277 function = selector;
4282 /* Function name is known; supply it. */
4283 const char *const argstring = _("passing arg %d of `%s'");
4284 new_opname = (char *) alloca (IDENTIFIER_LENGTH (function)
4285 + strlen (argstring) + 1 + 25
4287 sprintf (new_opname, argstring, argnum,
4288 IDENTIFIER_POINTER (function));
4292 /* Function name unknown (call through ptr); just give arg number. */
4293 const char *const argnofun = _("passing arg %d of pointer to function");
4294 new_opname = (char *) alloca (strlen (argnofun) + 1 + 25 /*%d*/ + 1);
4295 sprintf (new_opname, argnofun, argnum);
4297 opname = new_opname;
4299 pedwarn (msgid, opname);
4302 /* If VALUE is a compound expr all of whose expressions are constant, then
4303 return its value. Otherwise, return error_mark_node.
4305 This is for handling COMPOUND_EXPRs as initializer elements
4306 which is allowed with a warning when -pedantic is specified. */
4309 valid_compound_expr_initializer (value, endtype)
4313 if (TREE_CODE (value) == COMPOUND_EXPR)
4315 if (valid_compound_expr_initializer (TREE_OPERAND (value, 0), endtype)
4317 return error_mark_node;
4318 return valid_compound_expr_initializer (TREE_OPERAND (value, 1),
4321 else if (! TREE_CONSTANT (value)
4322 && ! initializer_constant_valid_p (value, endtype))
4323 return error_mark_node;
4328 /* Perform appropriate conversions on the initial value of a variable,
4329 store it in the declaration DECL,
4330 and print any error messages that are appropriate.
4331 If the init is invalid, store an ERROR_MARK. */
4334 store_init_value (decl, init)
4339 /* If variable's type was invalidly declared, just ignore it. */
4341 type = TREE_TYPE (decl);
4342 if (TREE_CODE (type) == ERROR_MARK)
4345 /* Digest the specified initializer into an expression. */
4347 value = digest_init (type, init, TREE_STATIC (decl));
4349 /* Store the expression if valid; else report error. */
4352 /* Note that this is the only place we can detect the error
4353 in a case such as struct foo bar = (struct foo) { x, y };
4354 where there is one initial value which is a constructor expression. */
4355 if (value == error_mark_node)
4357 else if (TREE_STATIC (decl) && ! TREE_CONSTANT (value))
4359 error ("initializer for static variable is not constant");
4360 value = error_mark_node;
4362 else if (TREE_STATIC (decl)
4363 && initializer_constant_valid_p (value, TREE_TYPE (value)) == 0)
4365 error ("initializer for static variable uses complicated arithmetic");
4366 value = error_mark_node;
4370 if (pedantic && TREE_CODE (value) == CONSTRUCTOR)
4372 if (! TREE_CONSTANT (value))
4373 pedwarn ("aggregate initializer is not constant");
4374 else if (! TREE_STATIC (value))
4375 pedwarn ("aggregate initializer uses complicated arithmetic");
4380 if (warn_traditional && !in_system_header
4381 && AGGREGATE_TYPE_P (TREE_TYPE (decl)) && ! TREE_STATIC (decl))
4382 warning ("traditional C rejects automatic aggregate initialization");
4384 DECL_INITIAL (decl) = value;
4386 /* ANSI wants warnings about out-of-range constant initializers. */
4387 STRIP_TYPE_NOPS (value);
4388 constant_expression_warning (value);
4390 /* Check if we need to set array size from compound literal size. */
4391 if (TREE_CODE (type) == ARRAY_TYPE
4392 && TYPE_DOMAIN (type) == 0
4393 && value != error_mark_node)
4395 tree inside_init = init;
4397 if (TREE_CODE (init) == NON_LVALUE_EXPR)
4398 inside_init = TREE_OPERAND (init, 0);
4399 inside_init = fold (inside_init);
4401 if (TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
4403 tree decl = COMPOUND_LITERAL_EXPR_DECL (inside_init);
4405 if (TYPE_DOMAIN (TREE_TYPE (decl)))
4407 /* For int foo[] = (int [3]){1}; we need to set array size
4408 now since later on array initializer will be just the
4409 brace enclosed list of the compound literal. */
4410 TYPE_DOMAIN (type) = TYPE_DOMAIN (TREE_TYPE (decl));
4412 layout_decl (decl, 0);
4418 /* Methods for storing and printing names for error messages. */
4420 /* Implement a spelling stack that allows components of a name to be pushed
4421 and popped. Each element on the stack is this structure. */
4433 #define SPELLING_STRING 1
4434 #define SPELLING_MEMBER 2
4435 #define SPELLING_BOUNDS 3
4437 static struct spelling *spelling; /* Next stack element (unused). */
4438 static struct spelling *spelling_base; /* Spelling stack base. */
4439 static int spelling_size; /* Size of the spelling stack. */
4441 /* Macros to save and restore the spelling stack around push_... functions.
4442 Alternative to SAVE_SPELLING_STACK. */
4444 #define SPELLING_DEPTH() (spelling - spelling_base)
4445 #define RESTORE_SPELLING_DEPTH(DEPTH) (spelling = spelling_base + (DEPTH))
4447 /* Save and restore the spelling stack around arbitrary C code. */
4449 #define SAVE_SPELLING_DEPTH(code) \
4451 int __depth = SPELLING_DEPTH (); \
4453 RESTORE_SPELLING_DEPTH (__depth); \
4456 /* Push an element on the spelling stack with type KIND and assign VALUE
4459 #define PUSH_SPELLING(KIND, VALUE, MEMBER) \
4461 int depth = SPELLING_DEPTH (); \
4463 if (depth >= spelling_size) \
4465 spelling_size += 10; \
4466 if (spelling_base == 0) \
4468 = (struct spelling *) xmalloc (spelling_size * sizeof (struct spelling)); \
4471 = (struct spelling *) xrealloc (spelling_base, \
4472 spelling_size * sizeof (struct spelling)); \
4473 RESTORE_SPELLING_DEPTH (depth); \
4476 spelling->kind = (KIND); \
4477 spelling->MEMBER = (VALUE); \
4481 /* Push STRING on the stack. Printed literally. */
4484 push_string (string)
4487 PUSH_SPELLING (SPELLING_STRING, string, u.s);
4490 /* Push a member name on the stack. Printed as '.' STRING. */
4493 push_member_name (decl)
4497 const char *const string
4498 = DECL_NAME (decl) ? IDENTIFIER_POINTER (DECL_NAME (decl)) : "<anonymous>";
4499 PUSH_SPELLING (SPELLING_MEMBER, string, u.s);
4502 /* Push an array bounds on the stack. Printed as [BOUNDS]. */
4505 push_array_bounds (bounds)
4508 PUSH_SPELLING (SPELLING_BOUNDS, bounds, u.i);
4511 /* Compute the maximum size in bytes of the printed spelling. */
4519 for (p = spelling_base; p < spelling; p++)
4521 if (p->kind == SPELLING_BOUNDS)
4524 size += strlen (p->u.s) + 1;
4530 /* Print the spelling to BUFFER and return it. */
4533 print_spelling (buffer)
4539 for (p = spelling_base; p < spelling; p++)
4540 if (p->kind == SPELLING_BOUNDS)
4542 sprintf (d, "[%d]", p->u.i);
4548 if (p->kind == SPELLING_MEMBER)
4550 for (s = p->u.s; (*d = *s++); d++)
4557 /* Issue an error message for a bad initializer component.
4558 MSGID identifies the message.
4559 The component name is taken from the spelling stack. */
4567 error ("%s", _(msgid));
4568 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4570 error ("(near initialization for `%s')", ofwhat);
4573 /* Issue a pedantic warning for a bad initializer component.
4574 MSGID identifies the message.
4575 The component name is taken from the spelling stack. */
4578 pedwarn_init (msgid)
4583 pedwarn ("%s", _(msgid));
4584 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4586 pedwarn ("(near initialization for `%s')", ofwhat);
4589 /* Issue a warning for a bad initializer component.
4590 MSGID identifies the message.
4591 The component name is taken from the spelling stack. */
4594 warning_init (msgid)
4599 warning ("%s", _(msgid));
4600 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4602 warning ("(near initialization for `%s')", ofwhat);
4605 /* Digest the parser output INIT as an initializer for type TYPE.
4606 Return a C expression of type TYPE to represent the initial value.
4608 REQUIRE_CONSTANT requests an error if non-constant initializers or
4609 elements are seen. */
4612 digest_init (type, init, require_constant)
4614 int require_constant;
4616 enum tree_code code = TREE_CODE (type);
4617 tree inside_init = init;
4619 if (type == error_mark_node
4620 || init == error_mark_node
4621 || TREE_TYPE (init) == error_mark_node)
4622 return error_mark_node;
4624 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
4625 /* Do not use STRIP_NOPS here. We do not want an enumerator
4626 whose value is 0 to count as a null pointer constant. */
4627 if (TREE_CODE (init) == NON_LVALUE_EXPR)
4628 inside_init = TREE_OPERAND (init, 0);
4630 inside_init = fold (inside_init);
4632 /* Initialization of an array of chars from a string constant
4633 optionally enclosed in braces. */
4635 if (code == ARRAY_TYPE)
4637 tree typ1 = TYPE_MAIN_VARIANT (TREE_TYPE (type));
4638 if ((typ1 == char_type_node
4639 || typ1 == signed_char_type_node
4640 || typ1 == unsigned_char_type_node
4641 || typ1 == unsigned_wchar_type_node
4642 || typ1 == signed_wchar_type_node)
4643 && ((inside_init && TREE_CODE (inside_init) == STRING_CST)))
4645 if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
4646 TYPE_MAIN_VARIANT (type)))
4649 if ((TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (inside_init)))
4651 && TYPE_PRECISION (typ1) == TYPE_PRECISION (char_type_node))
4653 error_init ("char-array initialized from wide string");
4654 return error_mark_node;
4656 if ((TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (inside_init)))
4658 && TYPE_PRECISION (typ1) != TYPE_PRECISION (char_type_node))
4660 error_init ("int-array initialized from non-wide string");
4661 return error_mark_node;
4664 TREE_TYPE (inside_init) = type;
4665 if (TYPE_DOMAIN (type) != 0
4666 && TYPE_SIZE (type) != 0
4667 && TREE_CODE (TYPE_SIZE (type)) == INTEGER_CST
4668 /* Subtract 1 (or sizeof (wchar_t))
4669 because it's ok to ignore the terminating null char
4670 that is counted in the length of the constant. */
4671 && 0 > compare_tree_int (TYPE_SIZE_UNIT (type),
4672 TREE_STRING_LENGTH (inside_init)
4673 - ((TYPE_PRECISION (typ1)
4674 != TYPE_PRECISION (char_type_node))
4675 ? (TYPE_PRECISION (wchar_type_node)
4678 pedwarn_init ("initializer-string for array of chars is too long");
4684 /* Any type can be initialized
4685 from an expression of the same type, optionally with braces. */
4687 if (inside_init && TREE_TYPE (inside_init) != 0
4688 && (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
4689 TYPE_MAIN_VARIANT (type))
4690 || (code == ARRAY_TYPE
4691 && comptypes (TREE_TYPE (inside_init), type))
4692 || (code == VECTOR_TYPE
4693 && comptypes (TREE_TYPE (inside_init), type))
4694 || (code == POINTER_TYPE
4695 && (TREE_CODE (TREE_TYPE (inside_init)) == ARRAY_TYPE
4696 || TREE_CODE (TREE_TYPE (inside_init)) == FUNCTION_TYPE)
4697 && comptypes (TREE_TYPE (TREE_TYPE (inside_init)),
4698 TREE_TYPE (type)))))
4700 if (code == POINTER_TYPE)
4701 inside_init = default_function_array_conversion (inside_init);
4703 if (require_constant && !flag_isoc99
4704 && TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
4706 /* As an extension, allow initializing objects with static storage
4707 duration with compound literals (which are then treated just as
4708 the brace enclosed list they contain). */
4709 tree decl = COMPOUND_LITERAL_EXPR_DECL (inside_init);
4710 inside_init = DECL_INITIAL (decl);
4713 if (code == ARRAY_TYPE && TREE_CODE (inside_init) != STRING_CST
4714 && TREE_CODE (inside_init) != CONSTRUCTOR)
4716 error_init ("array initialized from non-constant array expression");
4717 return error_mark_node;
4720 if (optimize && TREE_CODE (inside_init) == VAR_DECL)
4721 inside_init = decl_constant_value_for_broken_optimization (inside_init);
4723 /* Compound expressions can only occur here if -pedantic or
4724 -pedantic-errors is specified. In the later case, we always want
4725 an error. In the former case, we simply want a warning. */
4726 if (require_constant && pedantic
4727 && TREE_CODE (inside_init) == COMPOUND_EXPR)
4730 = valid_compound_expr_initializer (inside_init,
4731 TREE_TYPE (inside_init));
4732 if (inside_init == error_mark_node)
4733 error_init ("initializer element is not constant");
4735 pedwarn_init ("initializer element is not constant");
4736 if (flag_pedantic_errors)
4737 inside_init = error_mark_node;
4739 else if (require_constant
4740 && (!TREE_CONSTANT (inside_init)
4741 /* This test catches things like `7 / 0' which
4742 result in an expression for which TREE_CONSTANT
4743 is true, but which is not actually something
4744 that is a legal constant. We really should not
4745 be using this function, because it is a part of
4746 the back-end. Instead, the expression should
4747 already have been turned into ERROR_MARK_NODE. */
4748 || !initializer_constant_valid_p (inside_init,
4749 TREE_TYPE (inside_init))))
4751 error_init ("initializer element is not constant");
4752 inside_init = error_mark_node;
4758 /* Handle scalar types, including conversions. */
4760 if (code == INTEGER_TYPE || code == REAL_TYPE || code == POINTER_TYPE
4761 || code == ENUMERAL_TYPE || code == BOOLEAN_TYPE || code == COMPLEX_TYPE)
4763 /* Note that convert_for_assignment calls default_conversion
4764 for arrays and functions. We must not call it in the
4765 case where inside_init is a null pointer constant. */
4767 = convert_for_assignment (type, init, _("initialization"),
4768 NULL_TREE, NULL_TREE, 0);
4770 if (require_constant && ! TREE_CONSTANT (inside_init))
4772 error_init ("initializer element is not constant");
4773 inside_init = error_mark_node;
4775 else if (require_constant
4776 && initializer_constant_valid_p (inside_init, TREE_TYPE (inside_init)) == 0)
4778 error_init ("initializer element is not computable at load time");
4779 inside_init = error_mark_node;
4785 /* Come here only for records and arrays. */
4787 if (COMPLETE_TYPE_P (type) && TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST)
4789 error_init ("variable-sized object may not be initialized");
4790 return error_mark_node;
4793 error_init ("invalid initializer");
4794 return error_mark_node;
4797 /* Handle initializers that use braces. */
4799 /* Type of object we are accumulating a constructor for.
4800 This type is always a RECORD_TYPE, UNION_TYPE or ARRAY_TYPE. */
4801 static tree constructor_type;
4803 /* For a RECORD_TYPE or UNION_TYPE, this is the chain of fields
4805 static tree constructor_fields;
4807 /* For an ARRAY_TYPE, this is the specified index
4808 at which to store the next element we get. */
4809 static tree constructor_index;
4811 /* For an ARRAY_TYPE, this is the maximum index. */
4812 static tree constructor_max_index;
4814 /* For a RECORD_TYPE, this is the first field not yet written out. */
4815 static tree constructor_unfilled_fields;
4817 /* For an ARRAY_TYPE, this is the index of the first element
4818 not yet written out. */
4819 static tree constructor_unfilled_index;
4821 /* In a RECORD_TYPE, the byte index of the next consecutive field.
4822 This is so we can generate gaps between fields, when appropriate. */
4823 static tree constructor_bit_index;
4825 /* If we are saving up the elements rather than allocating them,
4826 this is the list of elements so far (in reverse order,
4827 most recent first). */
4828 static tree constructor_elements;
4830 /* 1 if constructor should be incrementally stored into a constructor chain,
4831 0 if all the elements should be kept in AVL tree. */
4832 static int constructor_incremental;
4834 /* 1 if so far this constructor's elements are all compile-time constants. */
4835 static int constructor_constant;
4837 /* 1 if so far this constructor's elements are all valid address constants. */
4838 static int constructor_simple;
4840 /* 1 if this constructor is erroneous so far. */
4841 static int constructor_erroneous;
4843 /* 1 if have called defer_addressed_constants. */
4844 static int constructor_subconstants_deferred;
4846 /* Structure for managing pending initializer elements, organized as an
4851 struct init_node *left, *right;
4852 struct init_node *parent;
4858 /* Tree of pending elements at this constructor level.
4859 These are elements encountered out of order
4860 which belong at places we haven't reached yet in actually
4862 Will never hold tree nodes across GC runs. */
4863 static struct init_node *constructor_pending_elts;
4865 /* The SPELLING_DEPTH of this constructor. */
4866 static int constructor_depth;
4868 /* 0 if implicitly pushing constructor levels is allowed. */
4869 int constructor_no_implicit = 0; /* 0 for C; 1 for some other languages. */
4871 static int require_constant_value;
4872 static int require_constant_elements;
4874 /* DECL node for which an initializer is being read.
4875 0 means we are reading a constructor expression
4876 such as (struct foo) {...}. */
4877 static tree constructor_decl;
4879 /* start_init saves the ASMSPEC arg here for really_start_incremental_init. */
4880 static const char *constructor_asmspec;
4882 /* Nonzero if this is an initializer for a top-level decl. */
4883 static int constructor_top_level;
4885 /* Nonzero if there were any member designators in this initializer. */
4886 static int constructor_designated;
4888 /* Nesting depth of designator list. */
4889 static int designator_depth;
4891 /* Nonzero if there were diagnosed errors in this designator list. */
4892 static int designator_errorneous;
4895 /* This stack has a level for each implicit or explicit level of
4896 structuring in the initializer, including the outermost one. It
4897 saves the values of most of the variables above. */
4899 struct constructor_range_stack;
4901 struct constructor_stack
4903 struct constructor_stack *next;
4908 tree unfilled_index;
4909 tree unfilled_fields;
4912 struct init_node *pending_elts;
4915 /* If nonzero, this value should replace the entire
4916 constructor at this level. */
4917 tree replacement_value;
4918 struct constructor_range_stack *range_stack;
4928 struct constructor_stack *constructor_stack;
4930 /* This stack represents designators from some range designator up to
4931 the last designator in the list. */
4933 struct constructor_range_stack
4935 struct constructor_range_stack *next, *prev;
4936 struct constructor_stack *stack;
4943 struct constructor_range_stack *constructor_range_stack;
4945 /* This stack records separate initializers that are nested.
4946 Nested initializers can't happen in ANSI C, but GNU C allows them
4947 in cases like { ... (struct foo) { ... } ... }. */
4949 struct initializer_stack
4951 struct initializer_stack *next;
4953 const char *asmspec;
4954 struct constructor_stack *constructor_stack;
4955 struct constructor_range_stack *constructor_range_stack;
4957 struct spelling *spelling;
4958 struct spelling *spelling_base;
4961 char require_constant_value;
4962 char require_constant_elements;
4966 struct initializer_stack *initializer_stack;
4968 /* Prepare to parse and output the initializer for variable DECL. */
4971 start_init (decl, asmspec_tree, top_level)
4977 struct initializer_stack *p
4978 = (struct initializer_stack *) xmalloc (sizeof (struct initializer_stack));
4979 const char *asmspec = 0;
4982 asmspec = TREE_STRING_POINTER (asmspec_tree);
4984 p->decl = constructor_decl;
4985 p->asmspec = constructor_asmspec;
4986 p->require_constant_value = require_constant_value;
4987 p->require_constant_elements = require_constant_elements;
4988 p->constructor_stack = constructor_stack;
4989 p->constructor_range_stack = constructor_range_stack;
4990 p->elements = constructor_elements;
4991 p->spelling = spelling;
4992 p->spelling_base = spelling_base;
4993 p->spelling_size = spelling_size;
4994 p->deferred = constructor_subconstants_deferred;
4995 p->top_level = constructor_top_level;
4996 p->next = initializer_stack;
4997 initializer_stack = p;
4999 constructor_decl = decl;
5000 constructor_asmspec = asmspec;
5001 constructor_subconstants_deferred = 0;
5002 constructor_designated = 0;
5003 constructor_top_level = top_level;
5007 require_constant_value = TREE_STATIC (decl);
5008 require_constant_elements
5009 = ((TREE_STATIC (decl) || (pedantic && !flag_isoc99))
5010 /* For a scalar, you can always use any value to initialize,
5011 even within braces. */
5012 && (TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE
5013 || TREE_CODE (TREE_TYPE (decl)) == RECORD_TYPE
5014 || TREE_CODE (TREE_TYPE (decl)) == UNION_TYPE
5015 || TREE_CODE (TREE_TYPE (decl)) == QUAL_UNION_TYPE));
5016 locus = IDENTIFIER_POINTER (DECL_NAME (decl));
5020 require_constant_value = 0;
5021 require_constant_elements = 0;
5022 locus = "(anonymous)";
5025 constructor_stack = 0;
5026 constructor_range_stack = 0;
5028 missing_braces_mentioned = 0;
5032 RESTORE_SPELLING_DEPTH (0);
5035 push_string (locus);
5041 struct initializer_stack *p = initializer_stack;
5043 /* Output subconstants (string constants, usually)
5044 that were referenced within this initializer and saved up.
5045 Must do this if and only if we called defer_addressed_constants. */
5046 if (constructor_subconstants_deferred)
5047 output_deferred_addressed_constants ();
5049 /* Free the whole constructor stack of this initializer. */
5050 while (constructor_stack)
5052 struct constructor_stack *q = constructor_stack;
5053 constructor_stack = q->next;
5057 if (constructor_range_stack)
5060 /* Pop back to the data of the outer initializer (if any). */
5061 constructor_decl = p->decl;
5062 constructor_asmspec = p->asmspec;
5063 require_constant_value = p->require_constant_value;
5064 require_constant_elements = p->require_constant_elements;
5065 constructor_stack = p->constructor_stack;
5066 constructor_range_stack = p->constructor_range_stack;
5067 constructor_elements = p->elements;
5068 spelling = p->spelling;
5069 spelling_base = p->spelling_base;
5070 spelling_size = p->spelling_size;
5071 constructor_subconstants_deferred = p->deferred;
5072 constructor_top_level = p->top_level;
5073 initializer_stack = p->next;
5077 /* Call here when we see the initializer is surrounded by braces.
5078 This is instead of a call to push_init_level;
5079 it is matched by a call to pop_init_level.
5081 TYPE is the type to initialize, for a constructor expression.
5082 For an initializer for a decl, TYPE is zero. */
5085 really_start_incremental_init (type)
5088 struct constructor_stack *p
5089 = (struct constructor_stack *) xmalloc (sizeof (struct constructor_stack));
5092 type = TREE_TYPE (constructor_decl);
5094 p->type = constructor_type;
5095 p->fields = constructor_fields;
5096 p->index = constructor_index;
5097 p->max_index = constructor_max_index;
5098 p->unfilled_index = constructor_unfilled_index;
5099 p->unfilled_fields = constructor_unfilled_fields;
5100 p->bit_index = constructor_bit_index;
5101 p->elements = constructor_elements;
5102 p->constant = constructor_constant;
5103 p->simple = constructor_simple;
5104 p->erroneous = constructor_erroneous;
5105 p->pending_elts = constructor_pending_elts;
5106 p->depth = constructor_depth;
5107 p->replacement_value = 0;
5111 p->incremental = constructor_incremental;
5112 p->designated = constructor_designated;
5114 constructor_stack = p;
5116 constructor_constant = 1;
5117 constructor_simple = 1;
5118 constructor_depth = SPELLING_DEPTH ();
5119 constructor_elements = 0;
5120 constructor_pending_elts = 0;
5121 constructor_type = type;
5122 constructor_incremental = 1;
5123 constructor_designated = 0;
5124 designator_depth = 0;
5125 designator_errorneous = 0;
5127 if (TREE_CODE (constructor_type) == RECORD_TYPE
5128 || TREE_CODE (constructor_type) == UNION_TYPE)
5130 constructor_fields = TYPE_FIELDS (constructor_type);
5131 /* Skip any nameless bit fields at the beginning. */
5132 while (constructor_fields != 0 && DECL_C_BIT_FIELD (constructor_fields)
5133 && DECL_NAME (constructor_fields) == 0)
5134 constructor_fields = TREE_CHAIN (constructor_fields);
5136 constructor_unfilled_fields = constructor_fields;
5137 constructor_bit_index = bitsize_zero_node;
5139 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5141 if (TYPE_DOMAIN (constructor_type))
5143 constructor_max_index
5144 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type));
5146 /* Detect non-empty initializations of zero-length arrays. */
5147 if (constructor_max_index == NULL_TREE
5148 && TYPE_SIZE (constructor_type))
5149 constructor_max_index = build_int_2 (-1, -1);
5151 /* constructor_max_index needs to be an INTEGER_CST. Attempts
5152 to initialize VLAs will cause an proper error; avoid tree
5153 checking errors as well by setting a safe value. */
5154 if (constructor_max_index
5155 && TREE_CODE (constructor_max_index) != INTEGER_CST)
5156 constructor_max_index = build_int_2 (-1, -1);
5159 = convert (bitsizetype,
5160 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
5163 constructor_index = bitsize_zero_node;
5165 constructor_unfilled_index = constructor_index;
5167 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
5169 /* Vectors are like simple fixed-size arrays. */
5170 constructor_max_index =
5171 build_int_2 (TYPE_VECTOR_SUBPARTS (constructor_type) - 1, 0);
5172 constructor_index = convert (bitsizetype, bitsize_zero_node);
5173 constructor_unfilled_index = constructor_index;
5177 /* Handle the case of int x = {5}; */
5178 constructor_fields = constructor_type;
5179 constructor_unfilled_fields = constructor_type;
5183 /* Push down into a subobject, for initialization.
5184 If this is for an explicit set of braces, IMPLICIT is 0.
5185 If it is because the next element belongs at a lower level,
5186 IMPLICIT is 1 (or 2 if the push is because of designator list). */
5189 push_init_level (implicit)
5192 struct constructor_stack *p;
5193 tree value = NULL_TREE;
5195 /* If we've exhausted any levels that didn't have braces,
5197 while (constructor_stack->implicit)
5199 if ((TREE_CODE (constructor_type) == RECORD_TYPE
5200 || TREE_CODE (constructor_type) == UNION_TYPE)
5201 && constructor_fields == 0)
5202 process_init_element (pop_init_level (1));
5203 else if (TREE_CODE (constructor_type) == ARRAY_TYPE
5204 && tree_int_cst_lt (constructor_max_index, constructor_index))
5205 process_init_element (pop_init_level (1));
5210 /* Unless this is an explicit brace, we need to preserve previous
5214 if ((TREE_CODE (constructor_type) == RECORD_TYPE
5215 || TREE_CODE (constructor_type) == UNION_TYPE)
5216 && constructor_fields)
5217 value = find_init_member (constructor_fields);
5218 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5219 value = find_init_member (constructor_index);
5222 p = (struct constructor_stack *) xmalloc (sizeof (struct constructor_stack));
5223 p->type = constructor_type;
5224 p->fields = constructor_fields;
5225 p->index = constructor_index;
5226 p->max_index = constructor_max_index;
5227 p->unfilled_index = constructor_unfilled_index;
5228 p->unfilled_fields = constructor_unfilled_fields;
5229 p->bit_index = constructor_bit_index;
5230 p->elements = constructor_elements;
5231 p->constant = constructor_constant;
5232 p->simple = constructor_simple;
5233 p->erroneous = constructor_erroneous;
5234 p->pending_elts = constructor_pending_elts;
5235 p->depth = constructor_depth;
5236 p->replacement_value = 0;
5237 p->implicit = implicit;
5239 p->incremental = constructor_incremental;
5240 p->designated = constructor_designated;
5241 p->next = constructor_stack;
5243 constructor_stack = p;
5245 constructor_constant = 1;
5246 constructor_simple = 1;
5247 constructor_depth = SPELLING_DEPTH ();
5248 constructor_elements = 0;
5249 constructor_incremental = 1;
5250 constructor_designated = 0;
5251 constructor_pending_elts = 0;
5254 p->range_stack = constructor_range_stack;
5255 constructor_range_stack = 0;
5256 designator_depth = 0;
5257 designator_errorneous = 0;
5260 /* Don't die if an entire brace-pair level is superfluous
5261 in the containing level. */
5262 if (constructor_type == 0)
5264 else if (TREE_CODE (constructor_type) == RECORD_TYPE
5265 || TREE_CODE (constructor_type) == UNION_TYPE)
5267 /* Don't die if there are extra init elts at the end. */
5268 if (constructor_fields == 0)
5269 constructor_type = 0;
5272 constructor_type = TREE_TYPE (constructor_fields);
5273 push_member_name (constructor_fields);
5274 constructor_depth++;
5277 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5279 constructor_type = TREE_TYPE (constructor_type);
5280 push_array_bounds (tree_low_cst (constructor_index, 0));
5281 constructor_depth++;
5284 if (constructor_type == 0)
5286 error_init ("extra brace group at end of initializer");
5287 constructor_fields = 0;
5288 constructor_unfilled_fields = 0;
5292 if (value && TREE_CODE (value) == CONSTRUCTOR)
5294 constructor_constant = TREE_CONSTANT (value);
5295 constructor_simple = TREE_STATIC (value);
5296 constructor_elements = TREE_OPERAND (value, 1);
5297 if (constructor_elements
5298 && (TREE_CODE (constructor_type) == RECORD_TYPE
5299 || TREE_CODE (constructor_type) == ARRAY_TYPE))
5300 set_nonincremental_init ();
5303 if (implicit == 1 && warn_missing_braces && !missing_braces_mentioned)
5305 missing_braces_mentioned = 1;
5306 warning_init ("missing braces around initializer");
5309 if (TREE_CODE (constructor_type) == RECORD_TYPE
5310 || TREE_CODE (constructor_type) == UNION_TYPE)
5312 constructor_fields = TYPE_FIELDS (constructor_type);
5313 /* Skip any nameless bit fields at the beginning. */
5314 while (constructor_fields != 0 && DECL_C_BIT_FIELD (constructor_fields)
5315 && DECL_NAME (constructor_fields) == 0)
5316 constructor_fields = TREE_CHAIN (constructor_fields);
5318 constructor_unfilled_fields = constructor_fields;
5319 constructor_bit_index = bitsize_zero_node;
5321 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
5323 /* Vectors are like simple fixed-size arrays. */
5324 constructor_max_index =
5325 build_int_2 (TYPE_VECTOR_SUBPARTS (constructor_type) - 1, 0);
5326 constructor_index = convert (bitsizetype, integer_zero_node);
5327 constructor_unfilled_index = constructor_index;
5329 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5331 if (TYPE_DOMAIN (constructor_type))
5333 constructor_max_index
5334 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type));
5336 /* Detect non-empty initializations of zero-length arrays. */
5337 if (constructor_max_index == NULL_TREE
5338 && TYPE_SIZE (constructor_type))
5339 constructor_max_index = build_int_2 (-1, -1);
5341 /* constructor_max_index needs to be an INTEGER_CST. Attempts
5342 to initialize VLAs will cause an proper error; avoid tree
5343 checking errors as well by setting a safe value. */
5344 if (constructor_max_index
5345 && TREE_CODE (constructor_max_index) != INTEGER_CST)
5346 constructor_max_index = build_int_2 (-1, -1);
5349 = convert (bitsizetype,
5350 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
5353 constructor_index = bitsize_zero_node;
5355 constructor_unfilled_index = constructor_index;
5356 if (value && TREE_CODE (value) == STRING_CST)
5358 /* We need to split the char/wchar array into individual
5359 characters, so that we don't have to special case it
5361 set_nonincremental_init_from_string (value);
5366 warning_init ("braces around scalar initializer");
5367 constructor_fields = constructor_type;
5368 constructor_unfilled_fields = constructor_type;
5372 /* At the end of an implicit or explicit brace level,
5373 finish up that level of constructor.
5374 If we were outputting the elements as they are read, return 0
5375 from inner levels (process_init_element ignores that),
5376 but return error_mark_node from the outermost level
5377 (that's what we want to put in DECL_INITIAL).
5378 Otherwise, return a CONSTRUCTOR expression. */
5381 pop_init_level (implicit)
5384 struct constructor_stack *p;
5385 tree constructor = 0;
5389 /* When we come to an explicit close brace,
5390 pop any inner levels that didn't have explicit braces. */
5391 while (constructor_stack->implicit)
5392 process_init_element (pop_init_level (1));
5394 if (constructor_range_stack)
5398 p = constructor_stack;
5400 /* Error for initializing a flexible array member, or a zero-length
5401 array member in an inappropriate context. */
5402 if (constructor_type && constructor_fields
5403 && TREE_CODE (constructor_type) == ARRAY_TYPE
5404 && TYPE_DOMAIN (constructor_type)
5405 && ! TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type)))
5407 /* Silently discard empty initializations. The parser will
5408 already have pedwarned for empty brackets. */
5409 if (integer_zerop (constructor_unfilled_index))
5410 constructor_type = NULL_TREE;
5411 else if (! TYPE_SIZE (constructor_type))
5413 if (constructor_depth > 2)
5414 error_init ("initialization of flexible array member in a nested context");
5416 pedwarn_init ("initialization of a flexible array member");
5418 /* We have already issued an error message for the existence
5419 of a flexible array member not at the end of the structure.
5420 Discard the initializer so that we do not abort later. */
5421 if (TREE_CHAIN (constructor_fields) != NULL_TREE)
5422 constructor_type = NULL_TREE;
5425 /* Zero-length arrays are no longer special, so we should no longer
5430 /* Warn when some struct elements are implicitly initialized to zero. */
5433 && TREE_CODE (constructor_type) == RECORD_TYPE
5434 && constructor_unfilled_fields)
5436 /* Do not warn for flexible array members or zero-length arrays. */
5437 while (constructor_unfilled_fields
5438 && (! DECL_SIZE (constructor_unfilled_fields)
5439 || integer_zerop (DECL_SIZE (constructor_unfilled_fields))))
5440 constructor_unfilled_fields = TREE_CHAIN (constructor_unfilled_fields);
5442 /* Do not warn if this level of the initializer uses member
5443 designators; it is likely to be deliberate. */
5444 if (constructor_unfilled_fields && !constructor_designated)
5446 push_member_name (constructor_unfilled_fields);
5447 warning_init ("missing initializer");
5448 RESTORE_SPELLING_DEPTH (constructor_depth);
5452 /* Now output all pending elements. */
5453 constructor_incremental = 1;
5454 output_pending_init_elements (1);
5456 /* Pad out the end of the structure. */
5457 if (p->replacement_value)
5458 /* If this closes a superfluous brace pair,
5459 just pass out the element between them. */
5460 constructor = p->replacement_value;
5461 else if (constructor_type == 0)
5463 else if (TREE_CODE (constructor_type) != RECORD_TYPE
5464 && TREE_CODE (constructor_type) != UNION_TYPE
5465 && TREE_CODE (constructor_type) != ARRAY_TYPE
5466 && TREE_CODE (constructor_type) != VECTOR_TYPE)
5468 /* A nonincremental scalar initializer--just return
5469 the element, after verifying there is just one. */
5470 if (constructor_elements == 0)
5472 if (!constructor_erroneous)
5473 error_init ("empty scalar initializer");
5474 constructor = error_mark_node;
5476 else if (TREE_CHAIN (constructor_elements) != 0)
5478 error_init ("extra elements in scalar initializer");
5479 constructor = TREE_VALUE (constructor_elements);
5482 constructor = TREE_VALUE (constructor_elements);
5486 if (constructor_erroneous)
5487 constructor = error_mark_node;
5490 constructor = build (CONSTRUCTOR, constructor_type, NULL_TREE,
5491 nreverse (constructor_elements));
5492 if (constructor_constant)
5493 TREE_CONSTANT (constructor) = 1;
5494 if (constructor_constant && constructor_simple)
5495 TREE_STATIC (constructor) = 1;
5499 constructor_type = p->type;
5500 constructor_fields = p->fields;
5501 constructor_index = p->index;
5502 constructor_max_index = p->max_index;
5503 constructor_unfilled_index = p->unfilled_index;
5504 constructor_unfilled_fields = p->unfilled_fields;
5505 constructor_bit_index = p->bit_index;
5506 constructor_elements = p->elements;
5507 constructor_constant = p->constant;
5508 constructor_simple = p->simple;
5509 constructor_erroneous = p->erroneous;
5510 constructor_incremental = p->incremental;
5511 constructor_designated = p->designated;
5512 constructor_pending_elts = p->pending_elts;
5513 constructor_depth = p->depth;
5515 constructor_range_stack = p->range_stack;
5516 RESTORE_SPELLING_DEPTH (constructor_depth);
5518 constructor_stack = p->next;
5521 if (constructor == 0)
5523 if (constructor_stack == 0)
5524 return error_mark_node;
5530 /* Common handling for both array range and field name designators.
5531 ARRAY argument is non-zero for array ranges. Returns zero for success. */
5534 set_designator (array)
5538 enum tree_code subcode;
5540 /* Don't die if an entire brace-pair level is superfluous
5541 in the containing level. */
5542 if (constructor_type == 0)
5545 /* If there were errors in this designator list already, bail out silently. */
5546 if (designator_errorneous)
5549 if (!designator_depth)
5551 if (constructor_range_stack)
5554 /* Designator list starts at the level of closest explicit
5556 while (constructor_stack->implicit)
5557 process_init_element (pop_init_level (1));
5558 constructor_designated = 1;
5562 if (constructor_no_implicit)
5564 error_init ("initialization designators may not nest");
5568 if (TREE_CODE (constructor_type) == RECORD_TYPE
5569 || TREE_CODE (constructor_type) == UNION_TYPE)
5571 subtype = TREE_TYPE (constructor_fields);
5572 if (subtype != error_mark_node)
5573 subtype = TYPE_MAIN_VARIANT (subtype);
5575 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5577 subtype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
5582 subcode = TREE_CODE (subtype);
5583 if (array && subcode != ARRAY_TYPE)
5585 error_init ("array index in non-array initializer");
5588 else if (!array && subcode != RECORD_TYPE && subcode != UNION_TYPE)
5590 error_init ("field name not in record or union initializer");
5594 constructor_designated = 1;
5595 push_init_level (2);
5599 /* If there are range designators in designator list, push a new designator
5600 to constructor_range_stack. RANGE_END is end of such stack range or
5601 NULL_TREE if there is no range designator at this level. */
5604 push_range_stack (range_end)
5607 struct constructor_range_stack *p;
5609 p = (struct constructor_range_stack *)
5610 ggc_alloc (sizeof (struct constructor_range_stack));
5611 p->prev = constructor_range_stack;
5613 p->fields = constructor_fields;
5614 p->range_start = constructor_index;
5615 p->index = constructor_index;
5616 p->stack = constructor_stack;
5617 p->range_end = range_end;
5618 if (constructor_range_stack)
5619 constructor_range_stack->next = p;
5620 constructor_range_stack = p;
5623 /* Within an array initializer, specify the next index to be initialized.
5624 FIRST is that index. If LAST is nonzero, then initialize a range
5625 of indices, running from FIRST through LAST. */
5628 set_init_index (first, last)
5631 if (set_designator (1))
5634 designator_errorneous = 1;
5636 while ((TREE_CODE (first) == NOP_EXPR
5637 || TREE_CODE (first) == CONVERT_EXPR
5638 || TREE_CODE (first) == NON_LVALUE_EXPR)
5639 && (TYPE_MODE (TREE_TYPE (first))
5640 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (first, 0)))))
5641 first = TREE_OPERAND (first, 0);
5644 while ((TREE_CODE (last) == NOP_EXPR
5645 || TREE_CODE (last) == CONVERT_EXPR
5646 || TREE_CODE (last) == NON_LVALUE_EXPR)
5647 && (TYPE_MODE (TREE_TYPE (last))
5648 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (last, 0)))))
5649 last = TREE_OPERAND (last, 0);
5651 if (TREE_CODE (first) != INTEGER_CST)
5652 error_init ("nonconstant array index in initializer");
5653 else if (last != 0 && TREE_CODE (last) != INTEGER_CST)
5654 error_init ("nonconstant array index in initializer");
5655 else if (TREE_CODE (constructor_type) != ARRAY_TYPE)
5656 error_init ("array index in non-array initializer");
5657 else if (constructor_max_index
5658 && tree_int_cst_lt (constructor_max_index, first))
5659 error_init ("array index in initializer exceeds array bounds");
5662 constructor_index = convert (bitsizetype, first);
5666 if (tree_int_cst_equal (first, last))
5668 else if (tree_int_cst_lt (last, first))
5670 error_init ("empty index range in initializer");
5675 last = convert (bitsizetype, last);
5676 if (constructor_max_index != 0
5677 && tree_int_cst_lt (constructor_max_index, last))
5679 error_init ("array index range in initializer exceeds array bounds");
5686 designator_errorneous = 0;
5687 if (constructor_range_stack || last)
5688 push_range_stack (last);
5692 /* Within a struct initializer, specify the next field to be initialized. */
5695 set_init_label (fieldname)
5700 if (set_designator (0))
5703 designator_errorneous = 1;
5705 if (TREE_CODE (constructor_type) != RECORD_TYPE
5706 && TREE_CODE (constructor_type) != UNION_TYPE)
5708 error_init ("field name not in record or union initializer");
5712 for (tail = TYPE_FIELDS (constructor_type); tail;
5713 tail = TREE_CHAIN (tail))
5715 if (DECL_NAME (tail) == fieldname)
5720 error ("unknown field `%s' specified in initializer",
5721 IDENTIFIER_POINTER (fieldname));
5724 constructor_fields = tail;
5726 designator_errorneous = 0;
5727 if (constructor_range_stack)
5728 push_range_stack (NULL_TREE);
5732 /* Add a new initializer to the tree of pending initializers. PURPOSE
5733 identifies the initializer, either array index or field in a structure.
5734 VALUE is the value of that index or field. */
5737 add_pending_init (purpose, value)
5738 tree purpose, value;
5740 struct init_node *p, **q, *r;
5742 q = &constructor_pending_elts;
5745 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5750 if (tree_int_cst_lt (purpose, p->purpose))
5752 else if (tree_int_cst_lt (p->purpose, purpose))
5756 if (TREE_SIDE_EFFECTS (p->value))
5757 warning_init ("initialized field with side-effects overwritten");
5767 bitpos = bit_position (purpose);
5771 if (tree_int_cst_lt (bitpos, bit_position (p->purpose)))
5773 else if (p->purpose != purpose)
5777 if (TREE_SIDE_EFFECTS (p->value))
5778 warning_init ("initialized field with side-effects overwritten");
5785 r = (struct init_node *) ggc_alloc (sizeof (struct init_node));
5786 r->purpose = purpose;
5797 struct init_node *s;
5801 if (p->balance == 0)
5803 else if (p->balance < 0)
5810 p->left->parent = p;
5827 constructor_pending_elts = r;
5832 struct init_node *t = r->right;
5836 r->right->parent = r;
5841 p->left->parent = p;
5844 p->balance = t->balance < 0;
5845 r->balance = -(t->balance > 0);
5860 constructor_pending_elts = t;
5866 /* p->balance == +1; growth of left side balances the node. */
5871 else /* r == p->right */
5873 if (p->balance == 0)
5874 /* Growth propagation from right side. */
5876 else if (p->balance > 0)
5883 p->right->parent = p;
5900 constructor_pending_elts = r;
5902 else /* r->balance == -1 */
5905 struct init_node *t = r->left;
5909 r->left->parent = r;
5914 p->right->parent = p;
5917 r->balance = (t->balance < 0);
5918 p->balance = -(t->balance > 0);
5933 constructor_pending_elts = t;
5939 /* p->balance == -1; growth of right side balances the node. */
5950 /* Build AVL tree from a sorted chain. */
5953 set_nonincremental_init ()
5957 if (TREE_CODE (constructor_type) != RECORD_TYPE
5958 && TREE_CODE (constructor_type) != ARRAY_TYPE)
5961 for (chain = constructor_elements; chain; chain = TREE_CHAIN (chain))
5962 add_pending_init (TREE_PURPOSE (chain), TREE_VALUE (chain));
5963 constructor_elements = 0;
5964 if (TREE_CODE (constructor_type) == RECORD_TYPE)
5966 constructor_unfilled_fields = TYPE_FIELDS (constructor_type);
5967 /* Skip any nameless bit fields at the beginning. */
5968 while (constructor_unfilled_fields != 0
5969 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
5970 && DECL_NAME (constructor_unfilled_fields) == 0)
5971 constructor_unfilled_fields = TREE_CHAIN (constructor_unfilled_fields);
5974 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5976 if (TYPE_DOMAIN (constructor_type))
5977 constructor_unfilled_index
5978 = convert (bitsizetype,
5979 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
5981 constructor_unfilled_index = bitsize_zero_node;
5983 constructor_incremental = 0;
5986 /* Build AVL tree from a string constant. */
5989 set_nonincremental_init_from_string (str)
5992 tree value, purpose, type;
5993 HOST_WIDE_INT val[2];
5994 const char *p, *end;
5995 int byte, wchar_bytes, charwidth, bitpos;
5997 if (TREE_CODE (constructor_type) != ARRAY_TYPE)
6000 if (TYPE_PRECISION (TREE_TYPE (TREE_TYPE (str)))
6001 == TYPE_PRECISION (char_type_node))
6003 else if (TYPE_PRECISION (TREE_TYPE (TREE_TYPE (str)))
6004 == TYPE_PRECISION (wchar_type_node))
6005 wchar_bytes = TYPE_PRECISION (wchar_type_node) / BITS_PER_UNIT;
6009 charwidth = TYPE_PRECISION (char_type_node);
6010 type = TREE_TYPE (constructor_type);
6011 p = TREE_STRING_POINTER (str);
6012 end = p + TREE_STRING_LENGTH (str);
6014 for (purpose = bitsize_zero_node;
6015 p < end && !tree_int_cst_lt (constructor_max_index, purpose);
6016 purpose = size_binop (PLUS_EXPR, purpose, bitsize_one_node))
6018 if (wchar_bytes == 1)
6020 val[1] = (unsigned char) *p++;
6027 for (byte = 0; byte < wchar_bytes; byte++)
6029 if (BYTES_BIG_ENDIAN)
6030 bitpos = (wchar_bytes - byte - 1) * charwidth;
6032 bitpos = byte * charwidth;
6033 val[bitpos < HOST_BITS_PER_WIDE_INT]
6034 |= ((unsigned HOST_WIDE_INT) ((unsigned char) *p++))
6035 << (bitpos % HOST_BITS_PER_WIDE_INT);
6039 if (!TREE_UNSIGNED (type))
6041 bitpos = ((wchar_bytes - 1) * charwidth) + HOST_BITS_PER_CHAR;
6042 if (bitpos < HOST_BITS_PER_WIDE_INT)
6044 if (val[1] & (((HOST_WIDE_INT) 1) << (bitpos - 1)))
6046 val[1] |= ((HOST_WIDE_INT) -1) << bitpos;
6050 else if (bitpos == HOST_BITS_PER_WIDE_INT)
6055 else if (val[0] & (((HOST_WIDE_INT) 1)
6056 << (bitpos - 1 - HOST_BITS_PER_WIDE_INT)))
6057 val[0] |= ((HOST_WIDE_INT) -1)
6058 << (bitpos - HOST_BITS_PER_WIDE_INT);
6061 value = build_int_2 (val[1], val[0]);
6062 TREE_TYPE (value) = type;
6063 add_pending_init (purpose, value);
6066 constructor_incremental = 0;
6069 /* Return value of FIELD in pending initializer or zero if the field was
6070 not initialized yet. */
6073 find_init_member (field)
6076 struct init_node *p;
6078 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6080 if (constructor_incremental
6081 && tree_int_cst_lt (field, constructor_unfilled_index))
6082 set_nonincremental_init ();
6084 p = constructor_pending_elts;
6087 if (tree_int_cst_lt (field, p->purpose))
6089 else if (tree_int_cst_lt (p->purpose, field))
6095 else if (TREE_CODE (constructor_type) == RECORD_TYPE)
6097 tree bitpos = bit_position (field);
6099 if (constructor_incremental
6100 && (!constructor_unfilled_fields
6101 || tree_int_cst_lt (bitpos,
6102 bit_position (constructor_unfilled_fields))))
6103 set_nonincremental_init ();
6105 p = constructor_pending_elts;
6108 if (field == p->purpose)
6110 else if (tree_int_cst_lt (bitpos, bit_position (p->purpose)))
6116 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6118 if (constructor_elements
6119 && TREE_PURPOSE (constructor_elements) == field)
6120 return TREE_VALUE (constructor_elements);
6125 /* "Output" the next constructor element.
6126 At top level, really output it to assembler code now.
6127 Otherwise, collect it in a list from which we will make a CONSTRUCTOR.
6128 TYPE is the data type that the containing data type wants here.
6129 FIELD is the field (a FIELD_DECL) or the index that this element fills.
6131 PENDING if non-nil means output pending elements that belong
6132 right after this element. (PENDING is normally 1;
6133 it is 0 while outputting pending elements, to avoid recursion.) */
6136 output_init_element (value, type, field, pending)
6137 tree value, type, field;
6140 if (TREE_CODE (TREE_TYPE (value)) == FUNCTION_TYPE
6141 || (TREE_CODE (TREE_TYPE (value)) == ARRAY_TYPE
6142 && !(TREE_CODE (value) == STRING_CST
6143 && TREE_CODE (type) == ARRAY_TYPE
6144 && TREE_CODE (TREE_TYPE (type)) == INTEGER_TYPE)
6145 && !comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (value)),
6146 TYPE_MAIN_VARIANT (type))))
6147 value = default_conversion (value);
6149 if (TREE_CODE (value) == COMPOUND_LITERAL_EXPR
6150 && require_constant_value && !flag_isoc99 && pending)
6152 /* As an extension, allow initializing objects with static storage
6153 duration with compound literals (which are then treated just as
6154 the brace enclosed list they contain). */
6155 tree decl = COMPOUND_LITERAL_EXPR_DECL (value);
6156 value = DECL_INITIAL (decl);
6159 if (value == error_mark_node)
6160 constructor_erroneous = 1;
6161 else if (!TREE_CONSTANT (value))
6162 constructor_constant = 0;
6163 else if (initializer_constant_valid_p (value, TREE_TYPE (value)) == 0
6164 || ((TREE_CODE (constructor_type) == RECORD_TYPE
6165 || TREE_CODE (constructor_type) == UNION_TYPE)
6166 && DECL_C_BIT_FIELD (field)
6167 && TREE_CODE (value) != INTEGER_CST))
6168 constructor_simple = 0;
6170 if (require_constant_value && ! TREE_CONSTANT (value))
6172 error_init ("initializer element is not constant");
6173 value = error_mark_node;
6175 else if (require_constant_elements
6176 && initializer_constant_valid_p (value, TREE_TYPE (value)) == 0)
6177 pedwarn ("initializer element is not computable at load time");
6179 /* If this field is empty (and not at the end of structure),
6180 don't do anything other than checking the initializer. */
6182 && (TREE_TYPE (field) == error_mark_node
6183 || (COMPLETE_TYPE_P (TREE_TYPE (field))
6184 && integer_zerop (TYPE_SIZE (TREE_TYPE (field)))
6185 && (TREE_CODE (constructor_type) == ARRAY_TYPE
6186 || TREE_CHAIN (field)))))
6189 value = digest_init (type, value, require_constant_value);
6190 if (value == error_mark_node)
6192 constructor_erroneous = 1;
6196 /* If this element doesn't come next in sequence,
6197 put it on constructor_pending_elts. */
6198 if (TREE_CODE (constructor_type) == ARRAY_TYPE
6199 && (!constructor_incremental
6200 || !tree_int_cst_equal (field, constructor_unfilled_index)))
6202 if (constructor_incremental
6203 && tree_int_cst_lt (field, constructor_unfilled_index))
6204 set_nonincremental_init ();
6206 add_pending_init (field, value);
6209 else if (TREE_CODE (constructor_type) == RECORD_TYPE
6210 && (!constructor_incremental
6211 || field != constructor_unfilled_fields))
6213 /* We do this for records but not for unions. In a union,
6214 no matter which field is specified, it can be initialized
6215 right away since it starts at the beginning of the union. */
6216 if (constructor_incremental)
6218 if (!constructor_unfilled_fields)
6219 set_nonincremental_init ();
6222 tree bitpos, unfillpos;
6224 bitpos = bit_position (field);
6225 unfillpos = bit_position (constructor_unfilled_fields);
6227 if (tree_int_cst_lt (bitpos, unfillpos))
6228 set_nonincremental_init ();
6232 add_pending_init (field, value);
6235 else if (TREE_CODE (constructor_type) == UNION_TYPE
6236 && constructor_elements)
6238 if (TREE_SIDE_EFFECTS (TREE_VALUE (constructor_elements)))
6239 warning_init ("initialized field with side-effects overwritten");
6241 /* We can have just one union field set. */
6242 constructor_elements = 0;
6245 /* Otherwise, output this element either to
6246 constructor_elements or to the assembler file. */
6248 if (field && TREE_CODE (field) == INTEGER_CST)
6249 field = copy_node (field);
6250 constructor_elements
6251 = tree_cons (field, value, constructor_elements);
6253 /* Advance the variable that indicates sequential elements output. */
6254 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6255 constructor_unfilled_index
6256 = size_binop (PLUS_EXPR, constructor_unfilled_index,
6258 else if (TREE_CODE (constructor_type) == RECORD_TYPE)
6260 constructor_unfilled_fields
6261 = TREE_CHAIN (constructor_unfilled_fields);
6263 /* Skip any nameless bit fields. */
6264 while (constructor_unfilled_fields != 0
6265 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
6266 && DECL_NAME (constructor_unfilled_fields) == 0)
6267 constructor_unfilled_fields =
6268 TREE_CHAIN (constructor_unfilled_fields);
6270 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6271 constructor_unfilled_fields = 0;
6273 /* Now output any pending elements which have become next. */
6275 output_pending_init_elements (0);
6278 /* Output any pending elements which have become next.
6279 As we output elements, constructor_unfilled_{fields,index}
6280 advances, which may cause other elements to become next;
6281 if so, they too are output.
6283 If ALL is 0, we return when there are
6284 no more pending elements to output now.
6286 If ALL is 1, we output space as necessary so that
6287 we can output all the pending elements. */
6290 output_pending_init_elements (all)
6293 struct init_node *elt = constructor_pending_elts;
6298 /* Look thru the whole pending tree.
6299 If we find an element that should be output now,
6300 output it. Otherwise, set NEXT to the element
6301 that comes first among those still pending. */
6306 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6308 if (tree_int_cst_equal (elt->purpose,
6309 constructor_unfilled_index))
6310 output_init_element (elt->value,
6311 TREE_TYPE (constructor_type),
6312 constructor_unfilled_index, 0);
6313 else if (tree_int_cst_lt (constructor_unfilled_index,
6316 /* Advance to the next smaller node. */
6321 /* We have reached the smallest node bigger than the
6322 current unfilled index. Fill the space first. */
6323 next = elt->purpose;
6329 /* Advance to the next bigger node. */
6334 /* We have reached the biggest node in a subtree. Find
6335 the parent of it, which is the next bigger node. */
6336 while (elt->parent && elt->parent->right == elt)
6339 if (elt && tree_int_cst_lt (constructor_unfilled_index,
6342 next = elt->purpose;
6348 else if (TREE_CODE (constructor_type) == RECORD_TYPE
6349 || TREE_CODE (constructor_type) == UNION_TYPE)
6351 tree ctor_unfilled_bitpos, elt_bitpos;
6353 /* If the current record is complete we are done. */
6354 if (constructor_unfilled_fields == 0)
6357 ctor_unfilled_bitpos = bit_position (constructor_unfilled_fields);
6358 elt_bitpos = bit_position (elt->purpose);
6359 /* We can't compare fields here because there might be empty
6360 fields in between. */
6361 if (tree_int_cst_equal (elt_bitpos, ctor_unfilled_bitpos))
6363 constructor_unfilled_fields = elt->purpose;
6364 output_init_element (elt->value, TREE_TYPE (elt->purpose),
6367 else if (tree_int_cst_lt (ctor_unfilled_bitpos, elt_bitpos))
6369 /* Advance to the next smaller node. */
6374 /* We have reached the smallest node bigger than the
6375 current unfilled field. Fill the space first. */
6376 next = elt->purpose;
6382 /* Advance to the next bigger node. */
6387 /* We have reached the biggest node in a subtree. Find
6388 the parent of it, which is the next bigger node. */
6389 while (elt->parent && elt->parent->right == elt)
6393 && (tree_int_cst_lt (ctor_unfilled_bitpos,
6394 bit_position (elt->purpose))))
6396 next = elt->purpose;
6404 /* Ordinarily return, but not if we want to output all
6405 and there are elements left. */
6406 if (! (all && next != 0))
6409 /* If it's not incremental, just skip over the gap, so that after
6410 jumping to retry we will output the next successive element. */
6411 if (TREE_CODE (constructor_type) == RECORD_TYPE
6412 || TREE_CODE (constructor_type) == UNION_TYPE)
6413 constructor_unfilled_fields = next;
6414 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6415 constructor_unfilled_index = next;
6417 /* ELT now points to the node in the pending tree with the next
6418 initializer to output. */
6422 /* Add one non-braced element to the current constructor level.
6423 This adjusts the current position within the constructor's type.
6424 This may also start or terminate implicit levels
6425 to handle a partly-braced initializer.
6427 Once this has found the correct level for the new element,
6428 it calls output_init_element. */
6431 process_init_element (value)
6434 tree orig_value = value;
6435 int string_flag = value != 0 && TREE_CODE (value) == STRING_CST;
6437 designator_depth = 0;
6438 designator_errorneous = 0;
6440 /* Handle superfluous braces around string cst as in
6441 char x[] = {"foo"}; */
6444 && TREE_CODE (constructor_type) == ARRAY_TYPE
6445 && TREE_CODE (TREE_TYPE (constructor_type)) == INTEGER_TYPE
6446 && integer_zerop (constructor_unfilled_index))
6448 if (constructor_stack->replacement_value)
6449 error_init ("excess elements in char array initializer");
6450 constructor_stack->replacement_value = value;
6454 if (constructor_stack->replacement_value != 0)
6456 error_init ("excess elements in struct initializer");
6460 /* Ignore elements of a brace group if it is entirely superfluous
6461 and has already been diagnosed. */
6462 if (constructor_type == 0)
6465 /* If we've exhausted any levels that didn't have braces,
6467 while (constructor_stack->implicit)
6469 if ((TREE_CODE (constructor_type) == RECORD_TYPE
6470 || TREE_CODE (constructor_type) == UNION_TYPE)
6471 && constructor_fields == 0)
6472 process_init_element (pop_init_level (1));
6473 else if (TREE_CODE (constructor_type) == ARRAY_TYPE
6474 && (constructor_max_index == 0
6475 || tree_int_cst_lt (constructor_max_index,
6476 constructor_index)))
6477 process_init_element (pop_init_level (1));
6482 /* In the case of [LO ... HI] = VALUE, only evaluate VALUE once. */
6483 if (constructor_range_stack)
6485 /* If value is a compound literal and we'll be just using its
6486 content, don't put it into a SAVE_EXPR. */
6487 if (TREE_CODE (value) != COMPOUND_LITERAL_EXPR
6488 || !require_constant_value
6490 value = save_expr (value);
6495 if (TREE_CODE (constructor_type) == RECORD_TYPE)
6498 enum tree_code fieldcode;
6500 if (constructor_fields == 0)
6502 pedwarn_init ("excess elements in struct initializer");
6506 fieldtype = TREE_TYPE (constructor_fields);
6507 if (fieldtype != error_mark_node)
6508 fieldtype = TYPE_MAIN_VARIANT (fieldtype);
6509 fieldcode = TREE_CODE (fieldtype);
6511 /* Accept a string constant to initialize a subarray. */
6513 && fieldcode == ARRAY_TYPE
6514 && TREE_CODE (TREE_TYPE (fieldtype)) == INTEGER_TYPE
6517 /* Otherwise, if we have come to a subaggregate,
6518 and we don't have an element of its type, push into it. */
6519 else if (value != 0 && !constructor_no_implicit
6520 && value != error_mark_node
6521 && TYPE_MAIN_VARIANT (TREE_TYPE (value)) != fieldtype
6522 && (fieldcode == RECORD_TYPE || fieldcode == ARRAY_TYPE
6523 || fieldcode == UNION_TYPE))
6525 push_init_level (1);
6531 push_member_name (constructor_fields);
6532 output_init_element (value, fieldtype, constructor_fields, 1);
6533 RESTORE_SPELLING_DEPTH (constructor_depth);
6536 /* Do the bookkeeping for an element that was
6537 directly output as a constructor. */
6539 /* For a record, keep track of end position of last field. */
6540 if (DECL_SIZE (constructor_fields))
6541 constructor_bit_index
6542 = size_binop (PLUS_EXPR,
6543 bit_position (constructor_fields),
6544 DECL_SIZE (constructor_fields));
6546 constructor_unfilled_fields = TREE_CHAIN (constructor_fields);
6547 /* Skip any nameless bit fields. */
6548 while (constructor_unfilled_fields != 0
6549 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
6550 && DECL_NAME (constructor_unfilled_fields) == 0)
6551 constructor_unfilled_fields =
6552 TREE_CHAIN (constructor_unfilled_fields);
6555 constructor_fields = TREE_CHAIN (constructor_fields);
6556 /* Skip any nameless bit fields at the beginning. */
6557 while (constructor_fields != 0
6558 && DECL_C_BIT_FIELD (constructor_fields)
6559 && DECL_NAME (constructor_fields) == 0)
6560 constructor_fields = TREE_CHAIN (constructor_fields);
6562 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6565 enum tree_code fieldcode;
6567 if (constructor_fields == 0)
6569 pedwarn_init ("excess elements in union initializer");
6573 fieldtype = TREE_TYPE (constructor_fields);
6574 if (fieldtype != error_mark_node)
6575 fieldtype = TYPE_MAIN_VARIANT (fieldtype);
6576 fieldcode = TREE_CODE (fieldtype);
6578 /* Warn that traditional C rejects initialization of unions.
6579 We skip the warning if the value is zero. This is done
6580 under the assumption that the zero initializer in user
6581 code appears conditioned on e.g. __STDC__ to avoid
6582 "missing initializer" warnings and relies on default
6583 initialization to zero in the traditional C case.
6584 We also skip the warning if the initializer is designated,
6585 again on the assumption that this must be conditional on
6586 __STDC__ anyway (and we've already complained about the
6587 member-designator already). */
6588 if (warn_traditional && !in_system_header && !constructor_designated
6589 && !(value && (integer_zerop (value) || real_zerop (value))))
6590 warning ("traditional C rejects initialization of unions");
6592 /* Accept a string constant to initialize a subarray. */
6594 && fieldcode == ARRAY_TYPE
6595 && TREE_CODE (TREE_TYPE (fieldtype)) == INTEGER_TYPE
6598 /* Otherwise, if we have come to a subaggregate,
6599 and we don't have an element of its type, push into it. */
6600 else if (value != 0 && !constructor_no_implicit
6601 && value != error_mark_node
6602 && TYPE_MAIN_VARIANT (TREE_TYPE (value)) != fieldtype
6603 && (fieldcode == RECORD_TYPE || fieldcode == ARRAY_TYPE
6604 || fieldcode == UNION_TYPE))
6606 push_init_level (1);
6612 push_member_name (constructor_fields);
6613 output_init_element (value, fieldtype, constructor_fields, 1);
6614 RESTORE_SPELLING_DEPTH (constructor_depth);
6617 /* Do the bookkeeping for an element that was
6618 directly output as a constructor. */
6620 constructor_bit_index = DECL_SIZE (constructor_fields);
6621 constructor_unfilled_fields = TREE_CHAIN (constructor_fields);
6624 constructor_fields = 0;
6626 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6628 tree elttype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
6629 enum tree_code eltcode = TREE_CODE (elttype);
6631 /* Accept a string constant to initialize a subarray. */
6633 && eltcode == ARRAY_TYPE
6634 && TREE_CODE (TREE_TYPE (elttype)) == INTEGER_TYPE
6637 /* Otherwise, if we have come to a subaggregate,
6638 and we don't have an element of its type, push into it. */
6639 else if (value != 0 && !constructor_no_implicit
6640 && value != error_mark_node
6641 && TYPE_MAIN_VARIANT (TREE_TYPE (value)) != elttype
6642 && (eltcode == RECORD_TYPE || eltcode == ARRAY_TYPE
6643 || eltcode == UNION_TYPE))
6645 push_init_level (1);
6649 if (constructor_max_index != 0
6650 && (tree_int_cst_lt (constructor_max_index, constructor_index)
6651 || integer_all_onesp (constructor_max_index)))
6653 pedwarn_init ("excess elements in array initializer");
6657 /* Now output the actual element. */
6660 push_array_bounds (tree_low_cst (constructor_index, 0));
6661 output_init_element (value, elttype, constructor_index, 1);
6662 RESTORE_SPELLING_DEPTH (constructor_depth);
6666 = size_binop (PLUS_EXPR, constructor_index, bitsize_one_node);
6669 /* If we are doing the bookkeeping for an element that was
6670 directly output as a constructor, we must update
6671 constructor_unfilled_index. */
6672 constructor_unfilled_index = constructor_index;
6674 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
6676 tree elttype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
6678 /* Do a basic check of initializer size. Note that vectors
6679 always have a fixed size derived from their type. */
6680 if (tree_int_cst_lt (constructor_max_index, constructor_index))
6682 pedwarn_init ("excess elements in vector initializer");
6686 /* Now output the actual element. */
6688 output_init_element (value, elttype, constructor_index, 1);
6691 = size_binop (PLUS_EXPR, constructor_index, bitsize_one_node);
6694 /* If we are doing the bookkeeping for an element that was
6695 directly output as a constructor, we must update
6696 constructor_unfilled_index. */
6697 constructor_unfilled_index = constructor_index;
6700 /* Handle the sole element allowed in a braced initializer
6701 for a scalar variable. */
6702 else if (constructor_fields == 0)
6704 pedwarn_init ("excess elements in scalar initializer");
6710 output_init_element (value, constructor_type, NULL_TREE, 1);
6711 constructor_fields = 0;
6714 /* Handle range initializers either at this level or anywhere higher
6715 in the designator stack. */
6716 if (constructor_range_stack)
6718 struct constructor_range_stack *p, *range_stack;
6721 range_stack = constructor_range_stack;
6722 constructor_range_stack = 0;
6723 while (constructor_stack != range_stack->stack)
6725 if (!constructor_stack->implicit)
6727 process_init_element (pop_init_level (1));
6729 for (p = range_stack;
6730 !p->range_end || tree_int_cst_equal (p->index, p->range_end);
6733 if (!constructor_stack->implicit)
6735 process_init_element (pop_init_level (1));
6738 p->index = size_binop (PLUS_EXPR, p->index, bitsize_one_node);
6739 if (tree_int_cst_equal (p->index, p->range_end) && !p->prev)
6744 constructor_index = p->index;
6745 constructor_fields = p->fields;
6746 if (finish && p->range_end && p->index == p->range_start)
6754 push_init_level (2);
6755 p->stack = constructor_stack;
6756 if (p->range_end && tree_int_cst_equal (p->index, p->range_end))
6757 p->index = p->range_start;
6761 constructor_range_stack = range_stack;
6768 constructor_range_stack = 0;
6771 /* Build a simple asm-statement, from one string literal. */
6773 simple_asm_stmt (expr)
6778 if (TREE_CODE (expr) == ADDR_EXPR)
6779 expr = TREE_OPERAND (expr, 0);
6781 if (TREE_CODE (expr) == STRING_CST)
6785 if (TREE_CHAIN (expr))
6786 expr = combine_strings (expr);
6787 stmt = add_stmt (build_stmt (ASM_STMT, NULL_TREE, expr,
6788 NULL_TREE, NULL_TREE,
6790 ASM_INPUT_P (stmt) = 1;
6794 error ("argument of `asm' is not a constant string");
6798 /* Build an asm-statement, whose components are a CV_QUALIFIER, a
6799 STRING, some OUTPUTS, some INPUTS, and some CLOBBERS. */
6802 build_asm_stmt (cv_qualifier, string, outputs, inputs, clobbers)
6811 if (TREE_CHAIN (string))
6812 string = combine_strings (string);
6813 if (TREE_CODE (string) != STRING_CST)
6815 error ("asm template is not a string constant");
6819 if (cv_qualifier != NULL_TREE
6820 && cv_qualifier != ridpointers[(int) RID_VOLATILE])
6822 warning ("%s qualifier ignored on asm",
6823 IDENTIFIER_POINTER (cv_qualifier));
6824 cv_qualifier = NULL_TREE;
6827 /* We can remove output conversions that change the type,
6828 but not the mode. */
6829 for (tail = outputs; tail; tail = TREE_CHAIN (tail))
6831 tree output = TREE_VALUE (tail);
6833 STRIP_NOPS (output);
6834 TREE_VALUE (tail) = output;
6836 /* Allow conversions as LHS here. build_modify_expr as called below
6837 will do the right thing with them. */
6838 while (TREE_CODE (output) == NOP_EXPR
6839 || TREE_CODE (output) == CONVERT_EXPR
6840 || TREE_CODE (output) == FLOAT_EXPR
6841 || TREE_CODE (output) == FIX_TRUNC_EXPR
6842 || TREE_CODE (output) == FIX_FLOOR_EXPR
6843 || TREE_CODE (output) == FIX_ROUND_EXPR
6844 || TREE_CODE (output) == FIX_CEIL_EXPR)
6845 output = TREE_OPERAND (output, 0);
6847 lvalue_or_else (TREE_VALUE (tail), "invalid lvalue in asm statement");
6850 /* Remove output conversions that change the type but not the mode. */
6851 for (tail = outputs; tail; tail = TREE_CHAIN (tail))
6853 tree output = TREE_VALUE (tail);
6854 STRIP_NOPS (output);
6855 TREE_VALUE (tail) = output;
6858 /* Perform default conversions on array and function inputs.
6859 Don't do this for other types as it would screw up operands
6860 expected to be in memory. */
6861 for (tail = inputs; tail; tail = TREE_CHAIN (tail))
6862 TREE_VALUE (tail) = default_function_array_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 current_function_returns_value = 1;
6960 if (t == error_mark_node)
6963 inner = t = convert (TREE_TYPE (res), t);
6965 /* Strip any conversions, additions, and subtractions, and see if
6966 we are returning the address of a local variable. Warn if so. */
6969 switch (TREE_CODE (inner))
6971 case NOP_EXPR: case NON_LVALUE_EXPR: case CONVERT_EXPR:
6973 inner = TREE_OPERAND (inner, 0);
6977 /* If the second operand of the MINUS_EXPR has a pointer
6978 type (or is converted from it), this may be valid, so
6979 don't give a warning. */
6981 tree op1 = TREE_OPERAND (inner, 1);
6983 while (! POINTER_TYPE_P (TREE_TYPE (op1))
6984 && (TREE_CODE (op1) == NOP_EXPR
6985 || TREE_CODE (op1) == NON_LVALUE_EXPR
6986 || TREE_CODE (op1) == CONVERT_EXPR))
6987 op1 = TREE_OPERAND (op1, 0);
6989 if (POINTER_TYPE_P (TREE_TYPE (op1)))
6992 inner = TREE_OPERAND (inner, 0);
6997 inner = TREE_OPERAND (inner, 0);
6999 while (TREE_CODE_CLASS (TREE_CODE (inner)) == 'r')
7000 inner = TREE_OPERAND (inner, 0);
7002 if (TREE_CODE (inner) == VAR_DECL
7003 && ! DECL_EXTERNAL (inner)
7004 && ! TREE_STATIC (inner)
7005 && DECL_CONTEXT (inner) == current_function_decl)
7006 warning ("function returns address of local variable");
7016 retval = build (MODIFY_EXPR, TREE_TYPE (res), res, t);
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;
7051 tree type, orig_type = error_mark_node;
7052 struct c_switch *cs;
7054 if (exp != error_mark_node)
7056 code = TREE_CODE (TREE_TYPE (exp));
7057 orig_type = TREE_TYPE (exp);
7059 if (! INTEGRAL_TYPE_P (orig_type)
7060 && code != ERROR_MARK)
7062 error ("switch quantity not an integer");
7063 exp = integer_zero_node;
7067 type = TYPE_MAIN_VARIANT (TREE_TYPE (exp));
7069 if (warn_traditional && !in_system_header
7070 && (type == long_integer_type_node
7071 || type == long_unsigned_type_node))
7072 warning ("`long' switch expression not converted to `int' in ISO C");
7074 exp = default_conversion (exp);
7075 type = TREE_TYPE (exp);
7079 /* Add this new SWITCH_STMT to the stack. */
7080 cs = (struct c_switch *) xmalloc (sizeof (*cs));
7081 cs->switch_stmt = build_stmt (SWITCH_STMT, exp, NULL_TREE, orig_type);
7082 cs->cases = splay_tree_new (case_compare, NULL, NULL);
7083 cs->next = switch_stack;
7086 return add_stmt (switch_stack->switch_stmt);
7089 /* Process a case label. */
7092 do_case (low_value, high_value)
7096 tree label = NULL_TREE;
7100 label = c_add_case_label (switch_stack->cases,
7101 SWITCH_COND (switch_stack->switch_stmt),
7102 low_value, high_value);
7103 if (label == error_mark_node)
7107 error ("case label not within a switch statement");
7109 error ("`default' label not within a switch statement");
7114 /* Finish the switch statement. */
7119 struct c_switch *cs = switch_stack;
7121 RECHAIN_STMTS (cs->switch_stmt, SWITCH_BODY (cs->switch_stmt));
7123 /* Pop the stack. */
7124 switch_stack = switch_stack->next;
7125 splay_tree_delete (cs->cases);