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 c_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 c_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 /* Given a type, apply default promotions wrt unnamed function
177 arguments and return the new type. */
180 c_type_promotes_to (type)
183 if (TYPE_MAIN_VARIANT (type) == float_type_node)
184 return double_type_node;
186 if (c_promoting_integer_type_p (type))
188 /* Preserve unsignedness if not really getting any wider. */
189 if (TREE_UNSIGNED (type)
190 && (TYPE_PRECISION (type) == TYPE_PRECISION (integer_type_node)))
191 return unsigned_type_node;
192 return integer_type_node;
198 /* Return a variant of TYPE which has all the type qualifiers of LIKE
199 as well as those of TYPE. */
202 qualify_type (type, like)
205 return c_build_qualified_type (type,
206 TYPE_QUALS (type) | TYPE_QUALS (like));
209 /* Return the common type of two types.
210 We assume that comptypes has already been done and returned 1;
211 if that isn't so, this may crash. In particular, we assume that qualifiers
214 This is the type for the result of most arithmetic operations
215 if the operands have the given two types. */
221 enum tree_code code1;
222 enum tree_code code2;
225 /* Save time if the two types are the same. */
227 if (t1 == t2) return t1;
229 /* If one type is nonsense, use the other. */
230 if (t1 == error_mark_node)
232 if (t2 == error_mark_node)
235 /* Merge the attributes. */
236 attributes = (*targetm.merge_type_attributes) (t1, t2);
238 /* Treat an enum type as the unsigned integer type of the same width. */
240 if (TREE_CODE (t1) == ENUMERAL_TYPE)
241 t1 = c_common_type_for_size (TYPE_PRECISION (t1), 1);
242 if (TREE_CODE (t2) == ENUMERAL_TYPE)
243 t2 = c_common_type_for_size (TYPE_PRECISION (t2), 1);
245 code1 = TREE_CODE (t1);
246 code2 = TREE_CODE (t2);
248 /* If one type is complex, form the common type of the non-complex
249 components, then make that complex. Use T1 or T2 if it is the
251 if (code1 == COMPLEX_TYPE || code2 == COMPLEX_TYPE)
253 tree subtype1 = code1 == COMPLEX_TYPE ? TREE_TYPE (t1) : t1;
254 tree subtype2 = code2 == COMPLEX_TYPE ? TREE_TYPE (t2) : t2;
255 tree subtype = common_type (subtype1, subtype2);
257 if (code1 == COMPLEX_TYPE && TREE_TYPE (t1) == subtype)
258 return build_type_attribute_variant (t1, attributes);
259 else if (code2 == COMPLEX_TYPE && TREE_TYPE (t2) == subtype)
260 return build_type_attribute_variant (t2, attributes);
262 return build_type_attribute_variant (build_complex_type (subtype),
270 /* If only one is real, use it as the result. */
272 if (code1 == REAL_TYPE && code2 != REAL_TYPE)
273 return build_type_attribute_variant (t1, attributes);
275 if (code2 == REAL_TYPE && code1 != REAL_TYPE)
276 return build_type_attribute_variant (t2, attributes);
278 /* Both real or both integers; use the one with greater precision. */
280 if (TYPE_PRECISION (t1) > TYPE_PRECISION (t2))
281 return build_type_attribute_variant (t1, attributes);
282 else if (TYPE_PRECISION (t2) > TYPE_PRECISION (t1))
283 return build_type_attribute_variant (t2, attributes);
285 /* Same precision. Prefer longs to ints even when same size. */
287 if (TYPE_MAIN_VARIANT (t1) == long_unsigned_type_node
288 || TYPE_MAIN_VARIANT (t2) == long_unsigned_type_node)
289 return build_type_attribute_variant (long_unsigned_type_node,
292 if (TYPE_MAIN_VARIANT (t1) == long_integer_type_node
293 || TYPE_MAIN_VARIANT (t2) == long_integer_type_node)
295 /* But preserve unsignedness from the other type,
296 since long cannot hold all the values of an unsigned int. */
297 if (TREE_UNSIGNED (t1) || TREE_UNSIGNED (t2))
298 t1 = long_unsigned_type_node;
300 t1 = long_integer_type_node;
301 return build_type_attribute_variant (t1, attributes);
304 /* Likewise, prefer long double to double even if same size. */
305 if (TYPE_MAIN_VARIANT (t1) == long_double_type_node
306 || TYPE_MAIN_VARIANT (t2) == long_double_type_node)
307 return build_type_attribute_variant (long_double_type_node,
310 /* Otherwise prefer the unsigned one. */
312 if (TREE_UNSIGNED (t1))
313 return build_type_attribute_variant (t1, attributes);
315 return build_type_attribute_variant (t2, attributes);
318 /* For two pointers, do this recursively on the target type,
319 and combine the qualifiers of the two types' targets. */
320 /* This code was turned off; I don't know why.
321 But ANSI C specifies doing this with the qualifiers.
322 So I turned it on again. */
324 tree pointed_to_1 = TREE_TYPE (t1);
325 tree pointed_to_2 = TREE_TYPE (t2);
326 tree target = common_type (TYPE_MAIN_VARIANT (pointed_to_1),
327 TYPE_MAIN_VARIANT (pointed_to_2));
328 t1 = build_pointer_type (c_build_qualified_type
330 TYPE_QUALS (pointed_to_1) |
331 TYPE_QUALS (pointed_to_2)));
332 return build_type_attribute_variant (t1, attributes);
335 t1 = build_pointer_type (common_type (TREE_TYPE (t1), TREE_TYPE (t2)));
336 return build_type_attribute_variant (t1, attributes);
341 tree elt = common_type (TREE_TYPE (t1), TREE_TYPE (t2));
342 /* Save space: see if the result is identical to one of the args. */
343 if (elt == TREE_TYPE (t1) && TYPE_DOMAIN (t1))
344 return build_type_attribute_variant (t1, attributes);
345 if (elt == TREE_TYPE (t2) && TYPE_DOMAIN (t2))
346 return build_type_attribute_variant (t2, attributes);
347 /* Merge the element types, and have a size if either arg has one. */
348 t1 = build_array_type (elt, TYPE_DOMAIN (TYPE_DOMAIN (t1) ? t1 : t2));
349 return build_type_attribute_variant (t1, attributes);
353 /* Function types: prefer the one that specified arg types.
354 If both do, merge the arg types. Also merge the return types. */
356 tree valtype = common_type (TREE_TYPE (t1), TREE_TYPE (t2));
357 tree p1 = TYPE_ARG_TYPES (t1);
358 tree p2 = TYPE_ARG_TYPES (t2);
363 /* Save space: see if the result is identical to one of the args. */
364 if (valtype == TREE_TYPE (t1) && ! TYPE_ARG_TYPES (t2))
365 return build_type_attribute_variant (t1, attributes);
366 if (valtype == TREE_TYPE (t2) && ! TYPE_ARG_TYPES (t1))
367 return build_type_attribute_variant (t2, attributes);
369 /* Simple way if one arg fails to specify argument types. */
370 if (TYPE_ARG_TYPES (t1) == 0)
372 t1 = build_function_type (valtype, TYPE_ARG_TYPES (t2));
373 return build_type_attribute_variant (t1, attributes);
375 if (TYPE_ARG_TYPES (t2) == 0)
377 t1 = build_function_type (valtype, TYPE_ARG_TYPES (t1));
378 return build_type_attribute_variant (t1, attributes);
381 /* If both args specify argument types, we must merge the two
382 lists, argument by argument. */
385 declare_parm_level (1);
387 len = list_length (p1);
390 for (i = 0; i < len; i++)
391 newargs = tree_cons (NULL_TREE, NULL_TREE, newargs);
396 p1 = TREE_CHAIN (p1), p2 = TREE_CHAIN (p2), n = TREE_CHAIN (n))
398 /* A null type means arg type is not specified.
399 Take whatever the other function type has. */
400 if (TREE_VALUE (p1) == 0)
402 TREE_VALUE (n) = TREE_VALUE (p2);
405 if (TREE_VALUE (p2) == 0)
407 TREE_VALUE (n) = TREE_VALUE (p1);
411 /* Given wait (union {union wait *u; int *i} *)
412 and wait (union wait *),
413 prefer union wait * as type of parm. */
414 if (TREE_CODE (TREE_VALUE (p1)) == UNION_TYPE
415 && TREE_VALUE (p1) != TREE_VALUE (p2))
418 for (memb = TYPE_FIELDS (TREE_VALUE (p1));
419 memb; memb = TREE_CHAIN (memb))
420 if (comptypes (TREE_TYPE (memb), TREE_VALUE (p2)))
422 TREE_VALUE (n) = TREE_VALUE (p2);
424 pedwarn ("function types not truly compatible in ISO C");
428 if (TREE_CODE (TREE_VALUE (p2)) == UNION_TYPE
429 && TREE_VALUE (p2) != TREE_VALUE (p1))
432 for (memb = TYPE_FIELDS (TREE_VALUE (p2));
433 memb; memb = TREE_CHAIN (memb))
434 if (comptypes (TREE_TYPE (memb), TREE_VALUE (p1)))
436 TREE_VALUE (n) = TREE_VALUE (p1);
438 pedwarn ("function types not truly compatible in ISO C");
442 TREE_VALUE (n) = common_type (TREE_VALUE (p1), TREE_VALUE (p2));
448 t1 = build_function_type (valtype, newargs);
449 /* ... falls through ... */
453 return build_type_attribute_variant (t1, attributes);
458 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
459 or various other operations. Return 2 if they are compatible
460 but a warning may be needed if you use them together. */
463 comptypes (type1, type2)
470 /* Suppress errors caused by previously reported errors. */
472 if (t1 == t2 || !t1 || !t2
473 || TREE_CODE (t1) == ERROR_MARK || TREE_CODE (t2) == ERROR_MARK)
476 /* If either type is the internal version of sizetype, return the
478 if (TREE_CODE (t1) == INTEGER_TYPE && TYPE_IS_SIZETYPE (t1)
479 && TYPE_DOMAIN (t1) != 0)
480 t1 = TYPE_DOMAIN (t1);
482 if (TREE_CODE (t2) == INTEGER_TYPE && TYPE_IS_SIZETYPE (t2)
483 && TYPE_DOMAIN (t2) != 0)
484 t2 = TYPE_DOMAIN (t2);
486 /* Treat an enum type as the integer type of the same width and
489 if (TREE_CODE (t1) == ENUMERAL_TYPE)
490 t1 = c_common_type_for_size (TYPE_PRECISION (t1), TREE_UNSIGNED (t1));
491 if (TREE_CODE (t2) == ENUMERAL_TYPE)
492 t2 = c_common_type_for_size (TYPE_PRECISION (t2), TREE_UNSIGNED (t2));
497 /* Different classes of types can't be compatible. */
499 if (TREE_CODE (t1) != TREE_CODE (t2)) return 0;
501 /* Qualifiers must match. */
503 if (TYPE_QUALS (t1) != TYPE_QUALS (t2))
506 /* Allow for two different type nodes which have essentially the same
507 definition. Note that we already checked for equality of the type
508 qualifiers (just above). */
510 if (TYPE_MAIN_VARIANT (t1) == TYPE_MAIN_VARIANT (t2))
513 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
514 if (! (attrval = (*targetm.comp_type_attributes) (t1, t2)))
517 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
520 switch (TREE_CODE (t1))
523 val = (TREE_TYPE (t1) == TREE_TYPE (t2)
524 ? 1 : comptypes (TREE_TYPE (t1), TREE_TYPE (t2)));
528 val = function_types_compatible_p (t1, t2);
533 tree d1 = TYPE_DOMAIN (t1);
534 tree d2 = TYPE_DOMAIN (t2);
535 bool d1_variable, d2_variable;
536 bool d1_zero, d2_zero;
539 /* Target types must match incl. qualifiers. */
540 if (TREE_TYPE (t1) != TREE_TYPE (t2)
541 && 0 == (val = comptypes (TREE_TYPE (t1), TREE_TYPE (t2))))
544 /* Sizes must match unless one is missing or variable. */
545 if (d1 == 0 || d2 == 0 || d1 == d2)
548 d1_zero = ! TYPE_MAX_VALUE (d1);
549 d2_zero = ! TYPE_MAX_VALUE (d2);
551 d1_variable = (! d1_zero
552 && (TREE_CODE (TYPE_MIN_VALUE (d1)) != INTEGER_CST
553 || TREE_CODE (TYPE_MAX_VALUE (d1)) != INTEGER_CST));
554 d2_variable = (! d2_zero
555 && (TREE_CODE (TYPE_MIN_VALUE (d2)) != INTEGER_CST
556 || TREE_CODE (TYPE_MAX_VALUE (d2)) != INTEGER_CST));
558 if (d1_variable || d2_variable)
560 if (d1_zero && d2_zero)
562 if (d1_zero || d2_zero
563 || ! tree_int_cst_equal (TYPE_MIN_VALUE (d1), TYPE_MIN_VALUE (d2))
564 || ! tree_int_cst_equal (TYPE_MAX_VALUE (d1), TYPE_MAX_VALUE (d2)))
571 if (flag_objc && objc_comptypes (t1, t2, 0) == 1)
578 return attrval == 2 && val == 1 ? 2 : val;
581 /* Return 1 if TTL and TTR are pointers to types that are equivalent,
582 ignoring their qualifiers. */
585 comp_target_types (ttl, ttr)
590 /* Give maybe_objc_comptypes a crack at letting these types through. */
591 if ((val = objc_comptypes (ttl, ttr, 1)) >= 0)
594 val = comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (ttl)),
595 TYPE_MAIN_VARIANT (TREE_TYPE (ttr)));
597 if (val == 2 && pedantic)
598 pedwarn ("types are not quite compatible");
602 /* Subroutines of `comptypes'. */
604 /* Return 1 if two function types F1 and F2 are compatible.
605 If either type specifies no argument types,
606 the other must specify a fixed number of self-promoting arg types.
607 Otherwise, if one type specifies only the number of arguments,
608 the other must specify that number of self-promoting arg types.
609 Otherwise, the argument types must match. */
612 function_types_compatible_p (f1, f2)
616 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
620 if (!(TREE_TYPE (f1) == TREE_TYPE (f2)
621 || (val = comptypes (TREE_TYPE (f1), TREE_TYPE (f2)))))
624 args1 = TYPE_ARG_TYPES (f1);
625 args2 = TYPE_ARG_TYPES (f2);
627 /* An unspecified parmlist matches any specified parmlist
628 whose argument types don't need default promotions. */
632 if (!self_promoting_args_p (args2))
634 /* If one of these types comes from a non-prototype fn definition,
635 compare that with the other type's arglist.
636 If they don't match, ask for a warning (but no error). */
637 if (TYPE_ACTUAL_ARG_TYPES (f1)
638 && 1 != type_lists_compatible_p (args2, TYPE_ACTUAL_ARG_TYPES (f1)))
644 if (!self_promoting_args_p (args1))
646 if (TYPE_ACTUAL_ARG_TYPES (f2)
647 && 1 != type_lists_compatible_p (args1, TYPE_ACTUAL_ARG_TYPES (f2)))
652 /* Both types have argument lists: compare them and propagate results. */
653 val1 = type_lists_compatible_p (args1, args2);
654 return val1 != 1 ? val1 : val;
657 /* Check two lists of types for compatibility,
658 returning 0 for incompatible, 1 for compatible,
659 or 2 for compatible with warning. */
662 type_lists_compatible_p (args1, args2)
665 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
671 if (args1 == 0 && args2 == 0)
673 /* If one list is shorter than the other,
674 they fail to match. */
675 if (args1 == 0 || args2 == 0)
677 /* A null pointer instead of a type
678 means there is supposed to be an argument
679 but nothing is specified about what type it has.
680 So match anything that self-promotes. */
681 if (TREE_VALUE (args1) == 0)
683 if (c_type_promotes_to (TREE_VALUE (args2)) != TREE_VALUE (args2))
686 else if (TREE_VALUE (args2) == 0)
688 if (c_type_promotes_to (TREE_VALUE (args1)) != TREE_VALUE (args1))
691 else if (! (newval = comptypes (TYPE_MAIN_VARIANT (TREE_VALUE (args1)),
692 TYPE_MAIN_VARIANT (TREE_VALUE (args2)))))
694 /* Allow wait (union {union wait *u; int *i} *)
695 and wait (union wait *) to be compatible. */
696 if (TREE_CODE (TREE_VALUE (args1)) == UNION_TYPE
697 && (TYPE_NAME (TREE_VALUE (args1)) == 0
698 || TYPE_TRANSPARENT_UNION (TREE_VALUE (args1)))
699 && TREE_CODE (TYPE_SIZE (TREE_VALUE (args1))) == INTEGER_CST
700 && tree_int_cst_equal (TYPE_SIZE (TREE_VALUE (args1)),
701 TYPE_SIZE (TREE_VALUE (args2))))
704 for (memb = TYPE_FIELDS (TREE_VALUE (args1));
705 memb; memb = TREE_CHAIN (memb))
706 if (comptypes (TREE_TYPE (memb), TREE_VALUE (args2)))
711 else if (TREE_CODE (TREE_VALUE (args2)) == UNION_TYPE
712 && (TYPE_NAME (TREE_VALUE (args2)) == 0
713 || TYPE_TRANSPARENT_UNION (TREE_VALUE (args2)))
714 && TREE_CODE (TYPE_SIZE (TREE_VALUE (args2))) == INTEGER_CST
715 && tree_int_cst_equal (TYPE_SIZE (TREE_VALUE (args2)),
716 TYPE_SIZE (TREE_VALUE (args1))))
719 for (memb = TYPE_FIELDS (TREE_VALUE (args2));
720 memb; memb = TREE_CHAIN (memb))
721 if (comptypes (TREE_TYPE (memb), TREE_VALUE (args1)))
730 /* comptypes said ok, but record if it said to warn. */
734 args1 = TREE_CHAIN (args1);
735 args2 = TREE_CHAIN (args2);
739 /* Compute the size to increment a pointer by. */
742 c_size_in_bytes (type)
745 enum tree_code code = TREE_CODE (type);
747 if (code == FUNCTION_TYPE || code == VOID_TYPE || code == ERROR_MARK)
748 return size_one_node;
750 if (!COMPLETE_OR_VOID_TYPE_P (type))
752 error ("arithmetic on pointer to an incomplete type");
753 return size_one_node;
756 /* Convert in case a char is more than one unit. */
757 return size_binop (CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type),
758 size_int (TYPE_PRECISION (char_type_node)
762 /* Return either DECL or its known constant value (if it has one). */
765 decl_constant_value (decl)
768 if (/* Don't change a variable array bound or initial value to a constant
769 in a place where a variable is invalid. */
770 current_function_decl != 0
771 && ! TREE_THIS_VOLATILE (decl)
772 && TREE_READONLY (decl)
773 && DECL_INITIAL (decl) != 0
774 && TREE_CODE (DECL_INITIAL (decl)) != ERROR_MARK
775 /* This is invalid if initial value is not constant.
776 If it has either a function call, a memory reference,
777 or a variable, then re-evaluating it could give different results. */
778 && TREE_CONSTANT (DECL_INITIAL (decl))
779 /* Check for cases where this is sub-optimal, even though valid. */
780 && TREE_CODE (DECL_INITIAL (decl)) != CONSTRUCTOR)
781 return DECL_INITIAL (decl);
785 /* Return either DECL or its known constant value (if it has one), but
786 return DECL if pedantic or DECL has mode BLKmode. This is for
787 bug-compatibility with the old behavior of decl_constant_value
788 (before GCC 3.0); every use of this function is a bug and it should
789 be removed before GCC 3.1. It is not appropriate to use pedantic
790 in a way that affects optimization, and BLKmode is probably not the
791 right test for avoiding misoptimizations either. */
794 decl_constant_value_for_broken_optimization (decl)
797 if (pedantic || DECL_MODE (decl) == BLKmode)
800 return decl_constant_value (decl);
804 /* Perform the default conversion of arrays and functions to pointers.
805 Return the result of converting EXP. For any other expression, just
809 default_function_array_conversion (exp)
813 tree type = TREE_TYPE (exp);
814 enum tree_code code = TREE_CODE (type);
817 /* Strip NON_LVALUE_EXPRs and no-op conversions, since we aren't using as
820 Do not use STRIP_NOPS here! It will remove conversions from pointer
821 to integer and cause infinite recursion. */
823 while (TREE_CODE (exp) == NON_LVALUE_EXPR
824 || (TREE_CODE (exp) == NOP_EXPR
825 && TREE_TYPE (TREE_OPERAND (exp, 0)) == TREE_TYPE (exp)))
827 if (TREE_CODE (exp) == NON_LVALUE_EXPR)
829 exp = TREE_OPERAND (exp, 0);
832 /* Preserve the original expression code. */
833 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (exp))))
834 C_SET_EXP_ORIGINAL_CODE (exp, C_EXP_ORIGINAL_CODE (orig_exp));
836 if (code == FUNCTION_TYPE)
838 return build_unary_op (ADDR_EXPR, exp, 0);
840 if (code == ARRAY_TYPE)
843 tree restype = TREE_TYPE (type);
849 if (TREE_CODE_CLASS (TREE_CODE (exp)) == 'r' || DECL_P (exp))
851 constp = TREE_READONLY (exp);
852 volatilep = TREE_THIS_VOLATILE (exp);
855 if (TYPE_QUALS (type) || constp || volatilep)
857 = c_build_qualified_type (restype,
859 | (constp * TYPE_QUAL_CONST)
860 | (volatilep * TYPE_QUAL_VOLATILE));
862 if (TREE_CODE (exp) == INDIRECT_REF)
863 return convert (TYPE_POINTER_TO (restype),
864 TREE_OPERAND (exp, 0));
866 if (TREE_CODE (exp) == COMPOUND_EXPR)
868 tree op1 = default_conversion (TREE_OPERAND (exp, 1));
869 return build (COMPOUND_EXPR, TREE_TYPE (op1),
870 TREE_OPERAND (exp, 0), op1);
873 lvalue_array_p = !not_lvalue && lvalue_p (exp);
874 if (!flag_isoc99 && !lvalue_array_p)
876 /* Before C99, non-lvalue arrays do not decay to pointers.
877 Normally, using such an array would be invalid; but it can
878 be used correctly inside sizeof or as a statement expression.
879 Thus, do not give an error here; an error will result later. */
883 ptrtype = build_pointer_type (restype);
885 if (TREE_CODE (exp) == VAR_DECL)
887 /* ??? This is not really quite correct
888 in that the type of the operand of ADDR_EXPR
889 is not the target type of the type of the ADDR_EXPR itself.
890 Question is, can this lossage be avoided? */
891 adr = build1 (ADDR_EXPR, ptrtype, exp);
892 if (!c_mark_addressable (exp))
893 return error_mark_node;
894 TREE_CONSTANT (adr) = staticp (exp);
895 TREE_SIDE_EFFECTS (adr) = 0; /* Default would be, same as EXP. */
898 /* This way is better for a COMPONENT_REF since it can
899 simplify the offset for a component. */
900 adr = build_unary_op (ADDR_EXPR, exp, 1);
901 return convert (ptrtype, adr);
906 /* Perform default promotions for C data used in expressions.
907 Arrays and functions are converted to pointers;
908 enumeral types or short or char, to int.
909 In addition, manifest constants symbols are replaced by their values. */
912 default_conversion (exp)
916 tree type = TREE_TYPE (exp);
917 enum tree_code code = TREE_CODE (type);
919 if (code == FUNCTION_TYPE || code == ARRAY_TYPE)
920 return default_function_array_conversion (exp);
922 /* Constants can be used directly unless they're not loadable. */
923 if (TREE_CODE (exp) == CONST_DECL)
924 exp = DECL_INITIAL (exp);
926 /* Replace a nonvolatile const static variable with its value unless
927 it is an array, in which case we must be sure that taking the
928 address of the array produces consistent results. */
929 else if (optimize && TREE_CODE (exp) == VAR_DECL && code != ARRAY_TYPE)
931 exp = decl_constant_value_for_broken_optimization (exp);
932 type = TREE_TYPE (exp);
935 /* Strip NON_LVALUE_EXPRs and no-op conversions, since we aren't using as
938 Do not use STRIP_NOPS here! It will remove conversions from pointer
939 to integer and cause infinite recursion. */
941 while (TREE_CODE (exp) == NON_LVALUE_EXPR
942 || (TREE_CODE (exp) == NOP_EXPR
943 && TREE_TYPE (TREE_OPERAND (exp, 0)) == TREE_TYPE (exp)))
944 exp = TREE_OPERAND (exp, 0);
946 /* Preserve the original expression code. */
947 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (exp))))
948 C_SET_EXP_ORIGINAL_CODE (exp, C_EXP_ORIGINAL_CODE (orig_exp));
950 /* Normally convert enums to int,
951 but convert wide enums to something wider. */
952 if (code == ENUMERAL_TYPE)
954 type = c_common_type_for_size (MAX (TYPE_PRECISION (type),
955 TYPE_PRECISION (integer_type_node)),
956 ((TYPE_PRECISION (type)
957 >= TYPE_PRECISION (integer_type_node))
958 && TREE_UNSIGNED (type)));
960 return convert (type, exp);
963 if (TREE_CODE (exp) == COMPONENT_REF
964 && DECL_C_BIT_FIELD (TREE_OPERAND (exp, 1))
965 /* If it's thinner than an int, promote it like a
966 c_promoting_integer_type_p, otherwise leave it alone. */
967 && 0 > compare_tree_int (DECL_SIZE (TREE_OPERAND (exp, 1)),
968 TYPE_PRECISION (integer_type_node)))
969 return convert (integer_type_node, exp);
971 if (c_promoting_integer_type_p (type))
973 /* Preserve unsignedness if not really getting any wider. */
974 if (TREE_UNSIGNED (type)
975 && TYPE_PRECISION (type) == TYPE_PRECISION (integer_type_node))
976 return convert (unsigned_type_node, exp);
978 return convert (integer_type_node, exp);
981 if (code == VOID_TYPE)
983 error ("void value not ignored as it ought to be");
984 return error_mark_node;
989 /* Look up COMPONENT in a structure or union DECL.
991 If the component name is not found, returns NULL_TREE. Otherwise,
992 the return value is a TREE_LIST, with each TREE_VALUE a FIELD_DECL
993 stepping down the chain to the component, which is in the last
994 TREE_VALUE of the list. Normally the list is of length one, but if
995 the component is embedded within (nested) anonymous structures or
996 unions, the list steps down the chain to the component. */
999 lookup_field (decl, component)
1000 tree decl, component;
1002 tree type = TREE_TYPE (decl);
1005 /* If TYPE_LANG_SPECIFIC is set, then it is a sorted array of pointers
1006 to the field elements. Use a binary search on this array to quickly
1007 find the element. Otherwise, do a linear search. TYPE_LANG_SPECIFIC
1008 will always be set for structures which have many elements. */
1010 if (TYPE_LANG_SPECIFIC (type))
1013 tree *field_array = &TYPE_LANG_SPECIFIC (type)->elts[0];
1015 field = TYPE_FIELDS (type);
1017 top = TYPE_LANG_SPECIFIC (type)->len;
1018 while (top - bot > 1)
1020 half = (top - bot + 1) >> 1;
1021 field = field_array[bot+half];
1023 if (DECL_NAME (field) == NULL_TREE)
1025 /* Step through all anon unions in linear fashion. */
1026 while (DECL_NAME (field_array[bot]) == NULL_TREE)
1028 field = field_array[bot++];
1029 if (TREE_CODE (TREE_TYPE (field)) == RECORD_TYPE
1030 || TREE_CODE (TREE_TYPE (field)) == UNION_TYPE)
1032 tree anon = lookup_field (field, component);
1035 return tree_cons (NULL_TREE, field, anon);
1039 /* Entire record is only anon unions. */
1043 /* Restart the binary search, with new lower bound. */
1047 if (DECL_NAME (field) == component)
1049 if (DECL_NAME (field) < component)
1055 if (DECL_NAME (field_array[bot]) == component)
1056 field = field_array[bot];
1057 else if (DECL_NAME (field) != component)
1062 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
1064 if (DECL_NAME (field) == NULL_TREE
1065 && (TREE_CODE (TREE_TYPE (field)) == RECORD_TYPE
1066 || TREE_CODE (TREE_TYPE (field)) == UNION_TYPE))
1068 tree anon = lookup_field (field, component);
1071 return tree_cons (NULL_TREE, field, anon);
1074 if (DECL_NAME (field) == component)
1078 if (field == NULL_TREE)
1082 return tree_cons (NULL_TREE, field, NULL_TREE);
1085 /* Make an expression to refer to the COMPONENT field of
1086 structure or union value DATUM. COMPONENT is an IDENTIFIER_NODE. */
1089 build_component_ref (datum, component)
1090 tree datum, component;
1092 tree type = TREE_TYPE (datum);
1093 enum tree_code code = TREE_CODE (type);
1097 /* If DATUM is a COMPOUND_EXPR, move our reference inside it.
1098 If pedantic ensure that the arguments are not lvalues; otherwise,
1099 if the component is an array, it would wrongly decay to a pointer in
1101 We cannot do this with a COND_EXPR, because in a conditional expression
1102 the default promotions are applied to both sides, and this would yield
1103 the wrong type of the result; for example, if the components have
1105 switch (TREE_CODE (datum))
1109 tree value = build_component_ref (TREE_OPERAND (datum, 1), component);
1110 return build (COMPOUND_EXPR, TREE_TYPE (value),
1111 TREE_OPERAND (datum, 0), pedantic_non_lvalue (value));
1117 /* See if there is a field or component with name COMPONENT. */
1119 if (code == RECORD_TYPE || code == UNION_TYPE)
1121 if (!COMPLETE_TYPE_P (type))
1123 c_incomplete_type_error (NULL_TREE, type);
1124 return error_mark_node;
1127 field = lookup_field (datum, component);
1131 error ("%s has no member named `%s'",
1132 code == RECORD_TYPE ? "structure" : "union",
1133 IDENTIFIER_POINTER (component));
1134 return error_mark_node;
1137 /* Chain the COMPONENT_REFs if necessary down to the FIELD.
1138 This might be better solved in future the way the C++ front
1139 end does it - by giving the anonymous entities each a
1140 separate name and type, and then have build_component_ref
1141 recursively call itself. We can't do that here. */
1142 for (; field; field = TREE_CHAIN (field))
1144 tree subdatum = TREE_VALUE (field);
1146 if (TREE_TYPE (subdatum) == error_mark_node)
1147 return error_mark_node;
1149 ref = build (COMPONENT_REF, TREE_TYPE (subdatum), datum, subdatum);
1150 if (TREE_READONLY (datum) || TREE_READONLY (subdatum))
1151 TREE_READONLY (ref) = 1;
1152 if (TREE_THIS_VOLATILE (datum) || TREE_THIS_VOLATILE (subdatum))
1153 TREE_THIS_VOLATILE (ref) = 1;
1155 if (TREE_DEPRECATED (subdatum))
1156 warn_deprecated_use (subdatum);
1163 else if (code != ERROR_MARK)
1164 error ("request for member `%s' in something not a structure or union",
1165 IDENTIFIER_POINTER (component));
1167 return error_mark_node;
1170 /* Given an expression PTR for a pointer, return an expression
1171 for the value pointed to.
1172 ERRORSTRING is the name of the operator to appear in error messages. */
1175 build_indirect_ref (ptr, errorstring)
1177 const char *errorstring;
1179 tree pointer = default_conversion (ptr);
1180 tree type = TREE_TYPE (pointer);
1182 if (TREE_CODE (type) == POINTER_TYPE)
1184 if (TREE_CODE (pointer) == ADDR_EXPR
1186 && (TREE_TYPE (TREE_OPERAND (pointer, 0))
1187 == TREE_TYPE (type)))
1188 return TREE_OPERAND (pointer, 0);
1191 tree t = TREE_TYPE (type);
1192 tree ref = build1 (INDIRECT_REF, TYPE_MAIN_VARIANT (t), pointer);
1194 if (!COMPLETE_OR_VOID_TYPE_P (t) && TREE_CODE (t) != ARRAY_TYPE)
1196 error ("dereferencing pointer to incomplete type");
1197 return error_mark_node;
1199 if (VOID_TYPE_P (t) && skip_evaluation == 0)
1200 warning ("dereferencing `void *' pointer");
1202 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
1203 so that we get the proper error message if the result is used
1204 to assign to. Also, &* is supposed to be a no-op.
1205 And ANSI C seems to specify that the type of the result
1206 should be the const type. */
1207 /* A de-reference of a pointer to const is not a const. It is valid
1208 to change it via some other pointer. */
1209 TREE_READONLY (ref) = TYPE_READONLY (t);
1210 TREE_SIDE_EFFECTS (ref)
1211 = TYPE_VOLATILE (t) || TREE_SIDE_EFFECTS (pointer) || flag_volatile;
1212 TREE_THIS_VOLATILE (ref) = TYPE_VOLATILE (t);
1216 else if (TREE_CODE (pointer) != ERROR_MARK)
1217 error ("invalid type argument of `%s'", errorstring);
1218 return error_mark_node;
1221 /* This handles expressions of the form "a[i]", which denotes
1224 This is logically equivalent in C to *(a+i), but we may do it differently.
1225 If A is a variable or a member, we generate a primitive ARRAY_REF.
1226 This avoids forcing the array out of registers, and can work on
1227 arrays that are not lvalues (for example, members of structures returned
1231 build_array_ref (array, index)
1236 error ("subscript missing in array reference");
1237 return error_mark_node;
1240 if (TREE_TYPE (array) == error_mark_node
1241 || TREE_TYPE (index) == error_mark_node)
1242 return error_mark_node;
1244 if (TREE_CODE (TREE_TYPE (array)) == ARRAY_TYPE
1245 && TREE_CODE (array) != INDIRECT_REF)
1249 /* Subscripting with type char is likely to lose
1250 on a machine where chars are signed.
1251 So warn on any machine, but optionally.
1252 Don't warn for unsigned char since that type is safe.
1253 Don't warn for signed char because anyone who uses that
1254 must have done so deliberately. */
1255 if (warn_char_subscripts
1256 && TYPE_MAIN_VARIANT (TREE_TYPE (index)) == char_type_node)
1257 warning ("array subscript has type `char'");
1259 /* Apply default promotions *after* noticing character types. */
1260 index = default_conversion (index);
1262 /* Require integer *after* promotion, for sake of enums. */
1263 if (TREE_CODE (TREE_TYPE (index)) != INTEGER_TYPE)
1265 error ("array subscript is not an integer");
1266 return error_mark_node;
1269 /* An array that is indexed by a non-constant
1270 cannot be stored in a register; we must be able to do
1271 address arithmetic on its address.
1272 Likewise an array of elements of variable size. */
1273 if (TREE_CODE (index) != INTEGER_CST
1274 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array)))
1275 && TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array)))) != INTEGER_CST))
1277 if (!c_mark_addressable (array))
1278 return error_mark_node;
1280 /* An array that is indexed by a constant value which is not within
1281 the array bounds cannot be stored in a register either; because we
1282 would get a crash in store_bit_field/extract_bit_field when trying
1283 to access a non-existent part of the register. */
1284 if (TREE_CODE (index) == INTEGER_CST
1285 && TYPE_VALUES (TREE_TYPE (array))
1286 && ! int_fits_type_p (index, TYPE_VALUES (TREE_TYPE (array))))
1288 if (!c_mark_addressable (array))
1289 return error_mark_node;
1295 while (TREE_CODE (foo) == COMPONENT_REF)
1296 foo = TREE_OPERAND (foo, 0);
1297 if (TREE_CODE (foo) == VAR_DECL && DECL_REGISTER (foo))
1298 pedwarn ("ISO C forbids subscripting `register' array");
1299 else if (! flag_isoc99 && ! lvalue_p (foo))
1300 pedwarn ("ISO C90 forbids subscripting non-lvalue array");
1303 type = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (array)));
1304 rval = build (ARRAY_REF, type, array, index);
1305 /* Array ref is const/volatile if the array elements are
1306 or if the array is. */
1307 TREE_READONLY (rval)
1308 |= (TYPE_READONLY (TREE_TYPE (TREE_TYPE (array)))
1309 | TREE_READONLY (array));
1310 TREE_SIDE_EFFECTS (rval)
1311 |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array)))
1312 | TREE_SIDE_EFFECTS (array));
1313 TREE_THIS_VOLATILE (rval)
1314 |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array)))
1315 /* This was added by rms on 16 Nov 91.
1316 It fixes vol struct foo *a; a->elts[1]
1317 in an inline function.
1318 Hope it doesn't break something else. */
1319 | TREE_THIS_VOLATILE (array));
1320 return require_complete_type (fold (rval));
1324 tree ar = default_conversion (array);
1325 tree ind = default_conversion (index);
1327 /* Do the same warning check as above, but only on the part that's
1328 syntactically the index and only if it is also semantically
1330 if (warn_char_subscripts
1331 && TREE_CODE (TREE_TYPE (index)) == INTEGER_TYPE
1332 && TYPE_MAIN_VARIANT (TREE_TYPE (index)) == char_type_node)
1333 warning ("subscript has type `char'");
1335 /* Put the integer in IND to simplify error checking. */
1336 if (TREE_CODE (TREE_TYPE (ar)) == INTEGER_TYPE)
1343 if (ar == error_mark_node)
1346 if (TREE_CODE (TREE_TYPE (ar)) != POINTER_TYPE
1347 || TREE_CODE (TREE_TYPE (TREE_TYPE (ar))) == FUNCTION_TYPE)
1349 error ("subscripted value is neither array nor pointer");
1350 return error_mark_node;
1352 if (TREE_CODE (TREE_TYPE (ind)) != INTEGER_TYPE)
1354 error ("array subscript is not an integer");
1355 return error_mark_node;
1358 return build_indirect_ref (build_binary_op (PLUS_EXPR, ar, ind, 0),
1363 /* Build an external reference to identifier ID. FUN indicates
1364 whether this will be used for a function call. */
1366 build_external_ref (id, fun)
1371 tree decl = lookup_name (id);
1372 tree objc_ivar = lookup_objc_ivar (id);
1374 if (decl && TREE_DEPRECATED (decl))
1375 warn_deprecated_use (decl);
1377 if (!decl || decl == error_mark_node || C_DECL_ANTICIPATED (decl))
1383 if (!decl || decl == error_mark_node)
1384 /* Ordinary implicit function declaration. */
1385 ref = implicitly_declare (id);
1388 /* Implicit declaration of built-in function. Don't
1389 change the built-in declaration, but don't let this
1390 go by silently, either. */
1391 implicit_decl_warning (id);
1393 /* only issue this warning once */
1394 C_DECL_ANTICIPATED (decl) = 0;
1400 /* Reference to undeclared variable, including reference to
1401 builtin outside of function-call context. */
1402 if (current_function_decl == 0)
1403 error ("`%s' undeclared here (not in a function)",
1404 IDENTIFIER_POINTER (id));
1407 if (IDENTIFIER_GLOBAL_VALUE (id) != error_mark_node
1408 || IDENTIFIER_ERROR_LOCUS (id) != current_function_decl)
1410 error ("`%s' undeclared (first use in this function)",
1411 IDENTIFIER_POINTER (id));
1413 if (! undeclared_variable_notice)
1415 error ("(Each undeclared identifier is reported only once");
1416 error ("for each function it appears in.)");
1417 undeclared_variable_notice = 1;
1420 IDENTIFIER_GLOBAL_VALUE (id) = error_mark_node;
1421 IDENTIFIER_ERROR_LOCUS (id) = current_function_decl;
1423 return error_mark_node;
1428 /* Properly declared variable or function reference. */
1431 else if (decl != objc_ivar && IDENTIFIER_LOCAL_VALUE (id))
1433 warning ("local declaration of `%s' hides instance variable",
1434 IDENTIFIER_POINTER (id));
1441 if (TREE_TYPE (ref) == error_mark_node)
1442 return error_mark_node;
1444 assemble_external (ref);
1445 TREE_USED (ref) = 1;
1447 if (TREE_CODE (ref) == CONST_DECL)
1449 ref = DECL_INITIAL (ref);
1450 TREE_CONSTANT (ref) = 1;
1456 /* Build a function call to function FUNCTION with parameters PARAMS.
1457 PARAMS is a list--a chain of TREE_LIST nodes--in which the
1458 TREE_VALUE of each node is a parameter-expression.
1459 FUNCTION's data type may be a function type or a pointer-to-function. */
1462 build_function_call (function, params)
1463 tree function, params;
1465 tree fntype, fundecl = 0;
1466 tree coerced_params;
1467 tree name = NULL_TREE, assembler_name = NULL_TREE, result;
1469 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
1470 STRIP_TYPE_NOPS (function);
1472 /* Convert anything with function type to a pointer-to-function. */
1473 if (TREE_CODE (function) == FUNCTION_DECL)
1475 name = DECL_NAME (function);
1476 assembler_name = DECL_ASSEMBLER_NAME (function);
1478 /* Differs from default_conversion by not setting TREE_ADDRESSABLE
1479 (because calling an inline function does not mean the function
1480 needs to be separately compiled). */
1481 fntype = build_type_variant (TREE_TYPE (function),
1482 TREE_READONLY (function),
1483 TREE_THIS_VOLATILE (function));
1485 function = build1 (ADDR_EXPR, build_pointer_type (fntype), function);
1488 function = default_conversion (function);
1490 fntype = TREE_TYPE (function);
1492 if (TREE_CODE (fntype) == ERROR_MARK)
1493 return error_mark_node;
1495 if (!(TREE_CODE (fntype) == POINTER_TYPE
1496 && TREE_CODE (TREE_TYPE (fntype)) == FUNCTION_TYPE))
1498 error ("called object is not a function");
1499 return error_mark_node;
1502 if (fundecl && TREE_THIS_VOLATILE (fundecl))
1503 current_function_returns_abnormally = 1;
1505 /* fntype now gets the type of function pointed to. */
1506 fntype = TREE_TYPE (fntype);
1508 /* Convert the parameters to the types declared in the
1509 function prototype, or apply default promotions. */
1512 = convert_arguments (TYPE_ARG_TYPES (fntype), params, name, fundecl);
1514 /* Check that the arguments to the function are valid. */
1516 check_function_arguments (TYPE_ATTRIBUTES (fntype), coerced_params);
1518 /* Recognize certain built-in functions so we can make tree-codes
1519 other than CALL_EXPR. We do this when it enables fold-const.c
1520 to do something useful. */
1522 if (TREE_CODE (function) == ADDR_EXPR
1523 && TREE_CODE (TREE_OPERAND (function, 0)) == FUNCTION_DECL
1524 && DECL_BUILT_IN (TREE_OPERAND (function, 0)))
1526 result = expand_tree_builtin (TREE_OPERAND (function, 0),
1527 params, coerced_params);
1532 result = build (CALL_EXPR, TREE_TYPE (fntype),
1533 function, coerced_params, NULL_TREE);
1534 TREE_SIDE_EFFECTS (result) = 1;
1535 result = fold (result);
1537 if (VOID_TYPE_P (TREE_TYPE (result)))
1539 return require_complete_type (result);
1542 /* Convert the argument expressions in the list VALUES
1543 to the types in the list TYPELIST. The result is a list of converted
1544 argument expressions.
1546 If TYPELIST is exhausted, or when an element has NULL as its type,
1547 perform the default conversions.
1549 PARMLIST is the chain of parm decls for the function being called.
1550 It may be 0, if that info is not available.
1551 It is used only for generating error messages.
1553 NAME is an IDENTIFIER_NODE or 0. It is used only for error messages.
1555 This is also where warnings about wrong number of args are generated.
1557 Both VALUES and the returned value are chains of TREE_LIST nodes
1558 with the elements of the list in the TREE_VALUE slots of those nodes. */
1561 convert_arguments (typelist, values, name, fundecl)
1562 tree typelist, values, name, fundecl;
1564 tree typetail, valtail;
1568 /* Scan the given expressions and types, producing individual
1569 converted arguments and pushing them on RESULT in reverse order. */
1571 for (valtail = values, typetail = typelist, parmnum = 0;
1573 valtail = TREE_CHAIN (valtail), parmnum++)
1575 tree type = typetail ? TREE_VALUE (typetail) : 0;
1576 tree val = TREE_VALUE (valtail);
1578 if (type == void_type_node)
1581 error ("too many arguments to function `%s'",
1582 IDENTIFIER_POINTER (name));
1584 error ("too many arguments to function");
1588 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
1589 /* Do not use STRIP_NOPS here! We do not want an enumerator with value 0
1590 to convert automatically to a pointer. */
1591 if (TREE_CODE (val) == NON_LVALUE_EXPR)
1592 val = TREE_OPERAND (val, 0);
1594 val = default_function_array_conversion (val);
1596 val = require_complete_type (val);
1600 /* Formal parm type is specified by a function prototype. */
1603 if (!COMPLETE_TYPE_P (type))
1605 error ("type of formal parameter %d is incomplete", parmnum + 1);
1610 /* Optionally warn about conversions that
1611 differ from the default conversions. */
1612 if (warn_conversion || warn_traditional)
1614 int formal_prec = TYPE_PRECISION (type);
1616 if (INTEGRAL_TYPE_P (type)
1617 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
1618 warn_for_assignment ("%s as integer rather than floating due to prototype", (char *) 0, name, parmnum + 1);
1619 if (INTEGRAL_TYPE_P (type)
1620 && TREE_CODE (TREE_TYPE (val)) == COMPLEX_TYPE)
1621 warn_for_assignment ("%s as integer rather than complex due to prototype", (char *) 0, name, parmnum + 1);
1622 else if (TREE_CODE (type) == COMPLEX_TYPE
1623 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
1624 warn_for_assignment ("%s as complex rather than floating due to prototype", (char *) 0, name, parmnum + 1);
1625 else if (TREE_CODE (type) == REAL_TYPE
1626 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
1627 warn_for_assignment ("%s as floating rather than integer due to prototype", (char *) 0, name, parmnum + 1);
1628 else if (TREE_CODE (type) == COMPLEX_TYPE
1629 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
1630 warn_for_assignment ("%s as complex rather than integer due to prototype", (char *) 0, name, parmnum + 1);
1631 else if (TREE_CODE (type) == REAL_TYPE
1632 && TREE_CODE (TREE_TYPE (val)) == COMPLEX_TYPE)
1633 warn_for_assignment ("%s as floating rather than complex due to prototype", (char *) 0, name, parmnum + 1);
1634 /* ??? At some point, messages should be written about
1635 conversions between complex types, but that's too messy
1637 else if (TREE_CODE (type) == REAL_TYPE
1638 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
1640 /* Warn if any argument is passed as `float',
1641 since without a prototype it would be `double'. */
1642 if (formal_prec == TYPE_PRECISION (float_type_node))
1643 warn_for_assignment ("%s as `float' rather than `double' due to prototype", (char *) 0, name, parmnum + 1);
1645 /* Detect integer changing in width or signedness.
1646 These warnings are only activated with
1647 -Wconversion, not with -Wtraditional. */
1648 else if (warn_conversion && INTEGRAL_TYPE_P (type)
1649 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
1651 tree would_have_been = default_conversion (val);
1652 tree type1 = TREE_TYPE (would_have_been);
1654 if (TREE_CODE (type) == ENUMERAL_TYPE
1655 && (TYPE_MAIN_VARIANT (type)
1656 == TYPE_MAIN_VARIANT (TREE_TYPE (val))))
1657 /* No warning if function asks for enum
1658 and the actual arg is that enum type. */
1660 else if (formal_prec != TYPE_PRECISION (type1))
1661 warn_for_assignment ("%s with different width due to prototype", (char *) 0, name, parmnum + 1);
1662 else if (TREE_UNSIGNED (type) == TREE_UNSIGNED (type1))
1664 /* Don't complain if the formal parameter type
1665 is an enum, because we can't tell now whether
1666 the value was an enum--even the same enum. */
1667 else if (TREE_CODE (type) == ENUMERAL_TYPE)
1669 else if (TREE_CODE (val) == INTEGER_CST
1670 && int_fits_type_p (val, type))
1671 /* Change in signedness doesn't matter
1672 if a constant value is unaffected. */
1674 /* Likewise for a constant in a NOP_EXPR. */
1675 else if (TREE_CODE (val) == NOP_EXPR
1676 && TREE_CODE (TREE_OPERAND (val, 0)) == INTEGER_CST
1677 && int_fits_type_p (TREE_OPERAND (val, 0), type))
1679 #if 0 /* We never get such tree structure here. */
1680 else if (TREE_CODE (TREE_TYPE (val)) == ENUMERAL_TYPE
1681 && int_fits_type_p (TYPE_MIN_VALUE (TREE_TYPE (val)), type)
1682 && int_fits_type_p (TYPE_MAX_VALUE (TREE_TYPE (val)), type))
1683 /* Change in signedness doesn't matter
1684 if an enum value is unaffected. */
1687 /* If the value is extended from a narrower
1688 unsigned type, it doesn't matter whether we
1689 pass it as signed or unsigned; the value
1690 certainly is the same either way. */
1691 else if (TYPE_PRECISION (TREE_TYPE (val)) < TYPE_PRECISION (type)
1692 && TREE_UNSIGNED (TREE_TYPE (val)))
1694 else if (TREE_UNSIGNED (type))
1695 warn_for_assignment ("%s as unsigned due to prototype", (char *) 0, name, parmnum + 1);
1697 warn_for_assignment ("%s as signed due to prototype", (char *) 0, name, parmnum + 1);
1701 parmval = convert_for_assignment (type, val,
1702 (char *) 0, /* arg passing */
1703 fundecl, name, parmnum + 1);
1705 if (PROMOTE_PROTOTYPES
1706 && INTEGRAL_TYPE_P (type)
1707 && (TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node)))
1708 parmval = default_conversion (parmval);
1710 result = tree_cons (NULL_TREE, parmval, result);
1712 else if (TREE_CODE (TREE_TYPE (val)) == REAL_TYPE
1713 && (TYPE_PRECISION (TREE_TYPE (val))
1714 < TYPE_PRECISION (double_type_node)))
1715 /* Convert `float' to `double'. */
1716 result = tree_cons (NULL_TREE, convert (double_type_node, val), result);
1718 /* Convert `short' and `char' to full-size `int'. */
1719 result = tree_cons (NULL_TREE, default_conversion (val), result);
1722 typetail = TREE_CHAIN (typetail);
1725 if (typetail != 0 && TREE_VALUE (typetail) != void_type_node)
1728 error ("too few arguments to function `%s'",
1729 IDENTIFIER_POINTER (name));
1731 error ("too few arguments to function");
1734 return nreverse (result);
1737 /* This is the entry point used by the parser
1738 for binary operators in the input.
1739 In addition to constructing the expression,
1740 we check for operands that were written with other binary operators
1741 in a way that is likely to confuse the user. */
1744 parser_build_binary_op (code, arg1, arg2)
1745 enum tree_code code;
1748 tree result = build_binary_op (code, arg1, arg2, 1);
1751 char class1 = TREE_CODE_CLASS (TREE_CODE (arg1));
1752 char class2 = TREE_CODE_CLASS (TREE_CODE (arg2));
1753 enum tree_code code1 = ERROR_MARK;
1754 enum tree_code code2 = ERROR_MARK;
1756 if (TREE_CODE (result) == ERROR_MARK)
1757 return error_mark_node;
1759 if (IS_EXPR_CODE_CLASS (class1))
1760 code1 = C_EXP_ORIGINAL_CODE (arg1);
1761 if (IS_EXPR_CODE_CLASS (class2))
1762 code2 = C_EXP_ORIGINAL_CODE (arg2);
1764 /* Check for cases such as x+y<<z which users are likely
1765 to misinterpret. If parens are used, C_EXP_ORIGINAL_CODE
1766 is cleared to prevent these warnings. */
1767 if (warn_parentheses)
1769 if (code == LSHIFT_EXPR || code == RSHIFT_EXPR)
1771 if (code1 == PLUS_EXPR || code1 == MINUS_EXPR
1772 || code2 == PLUS_EXPR || code2 == MINUS_EXPR)
1773 warning ("suggest parentheses around + or - inside shift");
1776 if (code == TRUTH_ORIF_EXPR)
1778 if (code1 == TRUTH_ANDIF_EXPR
1779 || code2 == TRUTH_ANDIF_EXPR)
1780 warning ("suggest parentheses around && within ||");
1783 if (code == BIT_IOR_EXPR)
1785 if (code1 == BIT_AND_EXPR || code1 == BIT_XOR_EXPR
1786 || code1 == PLUS_EXPR || code1 == MINUS_EXPR
1787 || code2 == BIT_AND_EXPR || code2 == BIT_XOR_EXPR
1788 || code2 == PLUS_EXPR || code2 == MINUS_EXPR)
1789 warning ("suggest parentheses around arithmetic in operand of |");
1790 /* Check cases like x|y==z */
1791 if (TREE_CODE_CLASS (code1) == '<' || TREE_CODE_CLASS (code2) == '<')
1792 warning ("suggest parentheses around comparison in operand of |");
1795 if (code == BIT_XOR_EXPR)
1797 if (code1 == BIT_AND_EXPR
1798 || code1 == PLUS_EXPR || code1 == MINUS_EXPR
1799 || code2 == BIT_AND_EXPR
1800 || code2 == PLUS_EXPR || code2 == MINUS_EXPR)
1801 warning ("suggest parentheses around arithmetic in operand of ^");
1802 /* Check cases like x^y==z */
1803 if (TREE_CODE_CLASS (code1) == '<' || TREE_CODE_CLASS (code2) == '<')
1804 warning ("suggest parentheses around comparison in operand of ^");
1807 if (code == BIT_AND_EXPR)
1809 if (code1 == PLUS_EXPR || code1 == MINUS_EXPR
1810 || code2 == PLUS_EXPR || code2 == MINUS_EXPR)
1811 warning ("suggest parentheses around + or - in operand of &");
1812 /* Check cases like x&y==z */
1813 if (TREE_CODE_CLASS (code1) == '<' || TREE_CODE_CLASS (code2) == '<')
1814 warning ("suggest parentheses around comparison in operand of &");
1818 /* Similarly, check for cases like 1<=i<=10 that are probably errors. */
1819 if (TREE_CODE_CLASS (code) == '<' && extra_warnings
1820 && (TREE_CODE_CLASS (code1) == '<' || TREE_CODE_CLASS (code2) == '<'))
1821 warning ("comparisons like X<=Y<=Z do not have their mathematical meaning");
1823 unsigned_conversion_warning (result, arg1);
1824 unsigned_conversion_warning (result, arg2);
1825 overflow_warning (result);
1827 class = TREE_CODE_CLASS (TREE_CODE (result));
1829 /* Record the code that was specified in the source,
1830 for the sake of warnings about confusing nesting. */
1831 if (IS_EXPR_CODE_CLASS (class))
1832 C_SET_EXP_ORIGINAL_CODE (result, code);
1835 int flag = TREE_CONSTANT (result);
1836 /* We used to use NOP_EXPR rather than NON_LVALUE_EXPR
1837 so that convert_for_assignment wouldn't strip it.
1838 That way, we got warnings for things like p = (1 - 1).
1839 But it turns out we should not get those warnings. */
1840 result = build1 (NON_LVALUE_EXPR, TREE_TYPE (result), result);
1841 C_SET_EXP_ORIGINAL_CODE (result, code);
1842 TREE_CONSTANT (result) = flag;
1848 /* Build a binary-operation expression without default conversions.
1849 CODE is the kind of expression to build.
1850 This function differs from `build' in several ways:
1851 the data type of the result is computed and recorded in it,
1852 warnings are generated if arg data types are invalid,
1853 special handling for addition and subtraction of pointers is known,
1854 and some optimization is done (operations on narrow ints
1855 are done in the narrower type when that gives the same result).
1856 Constant folding is also done before the result is returned.
1858 Note that the operands will never have enumeral types, or function
1859 or array types, because either they will have the default conversions
1860 performed or they have both just been converted to some other type in which
1861 the arithmetic is to be done. */
1864 build_binary_op (code, orig_op0, orig_op1, convert_p)
1865 enum tree_code code;
1866 tree orig_op0, orig_op1;
1870 enum tree_code code0, code1;
1873 /* Expression code to give to the expression when it is built.
1874 Normally this is CODE, which is what the caller asked for,
1875 but in some special cases we change it. */
1876 enum tree_code resultcode = code;
1878 /* Data type in which the computation is to be performed.
1879 In the simplest cases this is the common type of the arguments. */
1880 tree result_type = NULL;
1882 /* Nonzero means operands have already been type-converted
1883 in whatever way is necessary.
1884 Zero means they need to be converted to RESULT_TYPE. */
1887 /* Nonzero means create the expression with this type, rather than
1889 tree build_type = 0;
1891 /* Nonzero means after finally constructing the expression
1892 convert it to this type. */
1893 tree final_type = 0;
1895 /* Nonzero if this is an operation like MIN or MAX which can
1896 safely be computed in short if both args are promoted shorts.
1897 Also implies COMMON.
1898 -1 indicates a bitwise operation; this makes a difference
1899 in the exact conditions for when it is safe to do the operation
1900 in a narrower mode. */
1903 /* Nonzero if this is a comparison operation;
1904 if both args are promoted shorts, compare the original shorts.
1905 Also implies COMMON. */
1906 int short_compare = 0;
1908 /* Nonzero if this is a right-shift operation, which can be computed on the
1909 original short and then promoted if the operand is a promoted short. */
1910 int short_shift = 0;
1912 /* Nonzero means set RESULT_TYPE to the common type of the args. */
1917 op0 = default_conversion (orig_op0);
1918 op1 = default_conversion (orig_op1);
1926 type0 = TREE_TYPE (op0);
1927 type1 = TREE_TYPE (op1);
1929 /* The expression codes of the data types of the arguments tell us
1930 whether the arguments are integers, floating, pointers, etc. */
1931 code0 = TREE_CODE (type0);
1932 code1 = TREE_CODE (type1);
1934 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
1935 STRIP_TYPE_NOPS (op0);
1936 STRIP_TYPE_NOPS (op1);
1938 /* If an error was already reported for one of the arguments,
1939 avoid reporting another error. */
1941 if (code0 == ERROR_MARK || code1 == ERROR_MARK)
1942 return error_mark_node;
1947 /* Handle the pointer + int case. */
1948 if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
1949 return pointer_int_sum (PLUS_EXPR, op0, op1);
1950 else if (code1 == POINTER_TYPE && code0 == INTEGER_TYPE)
1951 return pointer_int_sum (PLUS_EXPR, op1, op0);
1957 /* Subtraction of two similar pointers.
1958 We must subtract them as integers, then divide by object size. */
1959 if (code0 == POINTER_TYPE && code1 == POINTER_TYPE
1960 && comp_target_types (type0, type1))
1961 return pointer_diff (op0, op1);
1962 /* Handle pointer minus int. Just like pointer plus int. */
1963 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
1964 return pointer_int_sum (MINUS_EXPR, op0, op1);
1973 case TRUNC_DIV_EXPR:
1975 case FLOOR_DIV_EXPR:
1976 case ROUND_DIV_EXPR:
1977 case EXACT_DIV_EXPR:
1978 /* Floating point division by zero is a legitimate way to obtain
1979 infinities and NaNs. */
1980 if (warn_div_by_zero && skip_evaluation == 0 && integer_zerop (op1))
1981 warning ("division by zero");
1983 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
1984 || code0 == COMPLEX_TYPE || code0 == VECTOR_TYPE)
1985 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
1986 || code1 == COMPLEX_TYPE || code1 == VECTOR_TYPE))
1988 if (!(code0 == INTEGER_TYPE && code1 == INTEGER_TYPE))
1989 resultcode = RDIV_EXPR;
1991 /* Although it would be tempting to shorten always here, that
1992 loses on some targets, since the modulo instruction is
1993 undefined if the quotient can't be represented in the
1994 computation mode. We shorten only if unsigned or if
1995 dividing by something we know != -1. */
1996 shorten = (TREE_UNSIGNED (TREE_TYPE (orig_op0))
1997 || (TREE_CODE (op1) == INTEGER_CST
1998 && ! integer_all_onesp (op1)));
2004 case BIT_ANDTC_EXPR:
2007 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
2009 else if (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE)
2013 case TRUNC_MOD_EXPR:
2014 case FLOOR_MOD_EXPR:
2015 if (warn_div_by_zero && skip_evaluation == 0 && integer_zerop (op1))
2016 warning ("division by zero");
2018 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
2020 /* Although it would be tempting to shorten always here, that loses
2021 on some targets, since the modulo instruction is undefined if the
2022 quotient can't be represented in the computation mode. We shorten
2023 only if unsigned or if dividing by something we know != -1. */
2024 shorten = (TREE_UNSIGNED (TREE_TYPE (orig_op0))
2025 || (TREE_CODE (op1) == INTEGER_CST
2026 && ! integer_all_onesp (op1)));
2031 case TRUTH_ANDIF_EXPR:
2032 case TRUTH_ORIF_EXPR:
2033 case TRUTH_AND_EXPR:
2035 case TRUTH_XOR_EXPR:
2036 if ((code0 == INTEGER_TYPE || code0 == POINTER_TYPE
2037 || code0 == REAL_TYPE || code0 == COMPLEX_TYPE)
2038 && (code1 == INTEGER_TYPE || code1 == POINTER_TYPE
2039 || code1 == REAL_TYPE || code1 == COMPLEX_TYPE))
2041 /* Result of these operations is always an int,
2042 but that does not mean the operands should be
2043 converted to ints! */
2044 result_type = integer_type_node;
2045 op0 = c_common_truthvalue_conversion (op0);
2046 op1 = c_common_truthvalue_conversion (op1);
2051 /* Shift operations: result has same type as first operand;
2052 always convert second operand to int.
2053 Also set SHORT_SHIFT if shifting rightward. */
2056 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
2058 if (TREE_CODE (op1) == INTEGER_CST && skip_evaluation == 0)
2060 if (tree_int_cst_sgn (op1) < 0)
2061 warning ("right shift count is negative");
2064 if (! integer_zerop (op1))
2067 if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
2068 warning ("right shift count >= width of type");
2072 /* Use the type of the value to be shifted. */
2073 result_type = type0;
2074 /* Convert the shift-count to an integer, regardless of size
2075 of value being shifted. */
2076 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
2077 op1 = convert (integer_type_node, op1);
2078 /* Avoid converting op1 to result_type later. */
2084 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
2086 if (TREE_CODE (op1) == INTEGER_CST && skip_evaluation == 0)
2088 if (tree_int_cst_sgn (op1) < 0)
2089 warning ("left shift count is negative");
2091 else if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
2092 warning ("left shift count >= width of type");
2095 /* Use the type of the value to be shifted. */
2096 result_type = type0;
2097 /* Convert the shift-count to an integer, regardless of size
2098 of value being shifted. */
2099 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
2100 op1 = convert (integer_type_node, op1);
2101 /* Avoid converting op1 to result_type later. */
2108 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
2110 if (TREE_CODE (op1) == INTEGER_CST && skip_evaluation == 0)
2112 if (tree_int_cst_sgn (op1) < 0)
2113 warning ("shift count is negative");
2114 else if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
2115 warning ("shift count >= width of type");
2118 /* Use the type of the value to be shifted. */
2119 result_type = type0;
2120 /* Convert the shift-count to an integer, regardless of size
2121 of value being shifted. */
2122 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
2123 op1 = convert (integer_type_node, op1);
2124 /* Avoid converting op1 to result_type later. */
2131 if (warn_float_equal && (code0 == REAL_TYPE || code1 == REAL_TYPE))
2132 warning ("comparing floating point with == or != is unsafe");
2133 /* Result of comparison is always int,
2134 but don't convert the args to int! */
2135 build_type = integer_type_node;
2136 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
2137 || code0 == COMPLEX_TYPE
2138 || code0 == VECTOR_TYPE)
2139 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
2140 || code1 == COMPLEX_TYPE
2141 || code1 == VECTOR_TYPE))
2143 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
2145 tree tt0 = TREE_TYPE (type0);
2146 tree tt1 = TREE_TYPE (type1);
2147 /* Anything compares with void *. void * compares with anything.
2148 Otherwise, the targets must be compatible
2149 and both must be object or both incomplete. */
2150 if (comp_target_types (type0, type1))
2151 result_type = common_type (type0, type1);
2152 else if (VOID_TYPE_P (tt0))
2154 /* op0 != orig_op0 detects the case of something
2155 whose value is 0 but which isn't a valid null ptr const. */
2156 if (pedantic && (!integer_zerop (op0) || op0 != orig_op0)
2157 && TREE_CODE (tt1) == FUNCTION_TYPE)
2158 pedwarn ("ISO C forbids comparison of `void *' with function pointer");
2160 else if (VOID_TYPE_P (tt1))
2162 if (pedantic && (!integer_zerop (op1) || op1 != orig_op1)
2163 && TREE_CODE (tt0) == FUNCTION_TYPE)
2164 pedwarn ("ISO C forbids comparison of `void *' with function pointer");
2167 pedwarn ("comparison of distinct pointer types lacks a cast");
2169 if (result_type == NULL_TREE)
2170 result_type = ptr_type_node;
2172 else if (code0 == POINTER_TYPE && TREE_CODE (op1) == INTEGER_CST
2173 && integer_zerop (op1))
2174 result_type = type0;
2175 else if (code1 == POINTER_TYPE && TREE_CODE (op0) == INTEGER_CST
2176 && integer_zerop (op0))
2177 result_type = type1;
2178 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
2180 result_type = type0;
2181 pedwarn ("comparison between pointer and integer");
2183 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
2185 result_type = type1;
2186 pedwarn ("comparison between pointer and integer");
2192 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE)
2193 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE))
2195 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
2197 if (comp_target_types (type0, type1))
2199 result_type = common_type (type0, type1);
2201 && TREE_CODE (TREE_TYPE (type0)) == FUNCTION_TYPE)
2202 pedwarn ("ISO C forbids ordered comparisons of pointers to functions");
2206 result_type = ptr_type_node;
2207 pedwarn ("comparison of distinct pointer types lacks a cast");
2216 build_type = integer_type_node;
2217 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE)
2218 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE))
2220 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
2222 if (comp_target_types (type0, type1))
2224 result_type = common_type (type0, type1);
2225 if (!COMPLETE_TYPE_P (TREE_TYPE (type0))
2226 != !COMPLETE_TYPE_P (TREE_TYPE (type1)))
2227 pedwarn ("comparison of complete and incomplete pointers");
2229 && TREE_CODE (TREE_TYPE (type0)) == FUNCTION_TYPE)
2230 pedwarn ("ISO C forbids ordered comparisons of pointers to functions");
2234 result_type = ptr_type_node;
2235 pedwarn ("comparison of distinct pointer types lacks a cast");
2238 else if (code0 == POINTER_TYPE && TREE_CODE (op1) == INTEGER_CST
2239 && integer_zerop (op1))
2241 result_type = type0;
2242 if (pedantic || extra_warnings)
2243 pedwarn ("ordered comparison of pointer with integer zero");
2245 else if (code1 == POINTER_TYPE && TREE_CODE (op0) == INTEGER_CST
2246 && integer_zerop (op0))
2248 result_type = type1;
2250 pedwarn ("ordered comparison of pointer with integer zero");
2252 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
2254 result_type = type0;
2255 pedwarn ("comparison between pointer and integer");
2257 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
2259 result_type = type1;
2260 pedwarn ("comparison between pointer and integer");
2264 case UNORDERED_EXPR:
2271 build_type = integer_type_node;
2272 if (code0 != REAL_TYPE || code1 != REAL_TYPE)
2274 error ("unordered comparison on non-floating point argument");
2275 return error_mark_node;
2284 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE || code0 == COMPLEX_TYPE
2285 || code0 == VECTOR_TYPE)
2287 (code1 == INTEGER_TYPE || code1 == REAL_TYPE || code1 == COMPLEX_TYPE
2288 || code1 == VECTOR_TYPE))
2290 int none_complex = (code0 != COMPLEX_TYPE && code1 != COMPLEX_TYPE);
2292 if (shorten || common || short_compare)
2293 result_type = common_type (type0, type1);
2295 /* For certain operations (which identify themselves by shorten != 0)
2296 if both args were extended from the same smaller type,
2297 do the arithmetic in that type and then extend.
2299 shorten !=0 and !=1 indicates a bitwise operation.
2300 For them, this optimization is safe only if
2301 both args are zero-extended or both are sign-extended.
2302 Otherwise, we might change the result.
2303 Eg, (short)-1 | (unsigned short)-1 is (int)-1
2304 but calculated in (unsigned short) it would be (unsigned short)-1. */
2306 if (shorten && none_complex)
2308 int unsigned0, unsigned1;
2309 tree arg0 = get_narrower (op0, &unsigned0);
2310 tree arg1 = get_narrower (op1, &unsigned1);
2311 /* UNS is 1 if the operation to be done is an unsigned one. */
2312 int uns = TREE_UNSIGNED (result_type);
2315 final_type = result_type;
2317 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
2318 but it *requires* conversion to FINAL_TYPE. */
2320 if ((TYPE_PRECISION (TREE_TYPE (op0))
2321 == TYPE_PRECISION (TREE_TYPE (arg0)))
2322 && TREE_TYPE (op0) != final_type)
2323 unsigned0 = TREE_UNSIGNED (TREE_TYPE (op0));
2324 if ((TYPE_PRECISION (TREE_TYPE (op1))
2325 == TYPE_PRECISION (TREE_TYPE (arg1)))
2326 && TREE_TYPE (op1) != final_type)
2327 unsigned1 = TREE_UNSIGNED (TREE_TYPE (op1));
2329 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
2331 /* For bitwise operations, signedness of nominal type
2332 does not matter. Consider only how operands were extended. */
2336 /* Note that in all three cases below we refrain from optimizing
2337 an unsigned operation on sign-extended args.
2338 That would not be valid. */
2340 /* Both args variable: if both extended in same way
2341 from same width, do it in that width.
2342 Do it unsigned if args were zero-extended. */
2343 if ((TYPE_PRECISION (TREE_TYPE (arg0))
2344 < TYPE_PRECISION (result_type))
2345 && (TYPE_PRECISION (TREE_TYPE (arg1))
2346 == TYPE_PRECISION (TREE_TYPE (arg0)))
2347 && unsigned0 == unsigned1
2348 && (unsigned0 || !uns))
2350 = c_common_signed_or_unsigned_type
2351 (unsigned0, common_type (TREE_TYPE (arg0), TREE_TYPE (arg1)));
2352 else if (TREE_CODE (arg0) == INTEGER_CST
2353 && (unsigned1 || !uns)
2354 && (TYPE_PRECISION (TREE_TYPE (arg1))
2355 < TYPE_PRECISION (result_type))
2357 = c_common_signed_or_unsigned_type (unsigned1,
2359 int_fits_type_p (arg0, type)))
2361 else if (TREE_CODE (arg1) == INTEGER_CST
2362 && (unsigned0 || !uns)
2363 && (TYPE_PRECISION (TREE_TYPE (arg0))
2364 < TYPE_PRECISION (result_type))
2366 = c_common_signed_or_unsigned_type (unsigned0,
2368 int_fits_type_p (arg1, type)))
2372 /* Shifts can be shortened if shifting right. */
2377 tree arg0 = get_narrower (op0, &unsigned_arg);
2379 final_type = result_type;
2381 if (arg0 == op0 && final_type == TREE_TYPE (op0))
2382 unsigned_arg = TREE_UNSIGNED (TREE_TYPE (op0));
2384 if (TYPE_PRECISION (TREE_TYPE (arg0)) < TYPE_PRECISION (result_type)
2385 /* We can shorten only if the shift count is less than the
2386 number of bits in the smaller type size. */
2387 && compare_tree_int (op1, TYPE_PRECISION (TREE_TYPE (arg0))) < 0
2388 /* We cannot drop an unsigned shift after sign-extension. */
2389 && (!TREE_UNSIGNED (final_type) || unsigned_arg))
2391 /* Do an unsigned shift if the operand was zero-extended. */
2393 = c_common_signed_or_unsigned_type (unsigned_arg,
2395 /* Convert value-to-be-shifted to that type. */
2396 if (TREE_TYPE (op0) != result_type)
2397 op0 = convert (result_type, op0);
2402 /* Comparison operations are shortened too but differently.
2403 They identify themselves by setting short_compare = 1. */
2407 /* Don't write &op0, etc., because that would prevent op0
2408 from being kept in a register.
2409 Instead, make copies of the our local variables and
2410 pass the copies by reference, then copy them back afterward. */
2411 tree xop0 = op0, xop1 = op1, xresult_type = result_type;
2412 enum tree_code xresultcode = resultcode;
2414 = shorten_compare (&xop0, &xop1, &xresult_type, &xresultcode);
2419 op0 = xop0, op1 = xop1;
2421 resultcode = xresultcode;
2423 if ((warn_sign_compare < 0 ? extra_warnings : warn_sign_compare != 0)
2424 && skip_evaluation == 0)
2426 int op0_signed = ! TREE_UNSIGNED (TREE_TYPE (orig_op0));
2427 int op1_signed = ! TREE_UNSIGNED (TREE_TYPE (orig_op1));
2428 int unsignedp0, unsignedp1;
2429 tree primop0 = get_narrower (op0, &unsignedp0);
2430 tree primop1 = get_narrower (op1, &unsignedp1);
2434 STRIP_TYPE_NOPS (xop0);
2435 STRIP_TYPE_NOPS (xop1);
2437 /* Give warnings for comparisons between signed and unsigned
2438 quantities that may fail.
2440 Do the checking based on the original operand trees, so that
2441 casts will be considered, but default promotions won't be.
2443 Do not warn if the comparison is being done in a signed type,
2444 since the signed type will only be chosen if it can represent
2445 all the values of the unsigned type. */
2446 if (! TREE_UNSIGNED (result_type))
2448 /* Do not warn if both operands are the same signedness. */
2449 else if (op0_signed == op1_signed)
2456 sop = xop0, uop = xop1;
2458 sop = xop1, uop = xop0;
2460 /* Do not warn if the signed quantity is an
2461 unsuffixed integer literal (or some static
2462 constant expression involving such literals or a
2463 conditional expression involving such literals)
2464 and it is non-negative. */
2465 if (tree_expr_nonnegative_p (sop))
2467 /* Do not warn if the comparison is an equality operation,
2468 the unsigned quantity is an integral constant, and it
2469 would fit in the result if the result were signed. */
2470 else if (TREE_CODE (uop) == INTEGER_CST
2471 && (resultcode == EQ_EXPR || resultcode == NE_EXPR)
2473 (uop, c_common_signed_type (result_type)))
2475 /* Do not warn if the unsigned quantity is an enumeration
2476 constant and its maximum value would fit in the result
2477 if the result were signed. */
2478 else if (TREE_CODE (uop) == INTEGER_CST
2479 && TREE_CODE (TREE_TYPE (uop)) == ENUMERAL_TYPE
2481 (TYPE_MAX_VALUE (TREE_TYPE(uop)),
2482 c_common_signed_type (result_type)))
2485 warning ("comparison between signed and unsigned");
2488 /* Warn if two unsigned values are being compared in a size
2489 larger than their original size, and one (and only one) is the
2490 result of a `~' operator. This comparison will always fail.
2492 Also warn if one operand is a constant, and the constant
2493 does not have all bits set that are set in the ~ operand
2494 when it is extended. */
2496 if ((TREE_CODE (primop0) == BIT_NOT_EXPR)
2497 != (TREE_CODE (primop1) == BIT_NOT_EXPR))
2499 if (TREE_CODE (primop0) == BIT_NOT_EXPR)
2500 primop0 = get_narrower (TREE_OPERAND (primop0, 0),
2503 primop1 = get_narrower (TREE_OPERAND (primop1, 0),
2506 if (host_integerp (primop0, 0) || host_integerp (primop1, 0))
2509 HOST_WIDE_INT constant, mask;
2510 int unsignedp, bits;
2512 if (host_integerp (primop0, 0))
2515 unsignedp = unsignedp1;
2516 constant = tree_low_cst (primop0, 0);
2521 unsignedp = unsignedp0;
2522 constant = tree_low_cst (primop1, 0);
2525 bits = TYPE_PRECISION (TREE_TYPE (primop));
2526 if (bits < TYPE_PRECISION (result_type)
2527 && bits < HOST_BITS_PER_WIDE_INT && unsignedp)
2529 mask = (~ (HOST_WIDE_INT) 0) << bits;
2530 if ((mask & constant) != mask)
2531 warning ("comparison of promoted ~unsigned with constant");
2534 else if (unsignedp0 && unsignedp1
2535 && (TYPE_PRECISION (TREE_TYPE (primop0))
2536 < TYPE_PRECISION (result_type))
2537 && (TYPE_PRECISION (TREE_TYPE (primop1))
2538 < TYPE_PRECISION (result_type)))
2539 warning ("comparison of promoted ~unsigned with unsigned");
2545 /* At this point, RESULT_TYPE must be nonzero to avoid an error message.
2546 If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
2547 Then the expression will be built.
2548 It will be given type FINAL_TYPE if that is nonzero;
2549 otherwise, it will be given type RESULT_TYPE. */
2553 binary_op_error (code);
2554 return error_mark_node;
2559 if (TREE_TYPE (op0) != result_type)
2560 op0 = convert (result_type, op0);
2561 if (TREE_TYPE (op1) != result_type)
2562 op1 = convert (result_type, op1);
2565 if (build_type == NULL_TREE)
2566 build_type = result_type;
2569 tree result = build (resultcode, build_type, op0, op1);
2572 folded = fold (result);
2573 if (folded == result)
2574 TREE_CONSTANT (folded) = TREE_CONSTANT (op0) & TREE_CONSTANT (op1);
2575 if (final_type != 0)
2576 return convert (final_type, folded);
2581 /* Return a tree for the difference of pointers OP0 and OP1.
2582 The resulting tree has type int. */
2585 pointer_diff (op0, op1)
2588 tree result, folded;
2589 tree restype = ptrdiff_type_node;
2591 tree target_type = TREE_TYPE (TREE_TYPE (op0));
2592 tree con0, con1, lit0, lit1;
2593 tree orig_op1 = op1;
2595 if (pedantic || warn_pointer_arith)
2597 if (TREE_CODE (target_type) == VOID_TYPE)
2598 pedwarn ("pointer of type `void *' used in subtraction");
2599 if (TREE_CODE (target_type) == FUNCTION_TYPE)
2600 pedwarn ("pointer to a function used in subtraction");
2603 /* If the conversion to ptrdiff_type does anything like widening or
2604 converting a partial to an integral mode, we get a convert_expression
2605 that is in the way to do any simplifications.
2606 (fold-const.c doesn't know that the extra bits won't be needed.
2607 split_tree uses STRIP_SIGN_NOPS, which leaves conversions to a
2608 different mode in place.)
2609 So first try to find a common term here 'by hand'; we want to cover
2610 at least the cases that occur in legal static initializers. */
2611 con0 = TREE_CODE (op0) == NOP_EXPR ? TREE_OPERAND (op0, 0) : op0;
2612 con1 = TREE_CODE (op1) == NOP_EXPR ? TREE_OPERAND (op1, 0) : op1;
2614 if (TREE_CODE (con0) == PLUS_EXPR)
2616 lit0 = TREE_OPERAND (con0, 1);
2617 con0 = TREE_OPERAND (con0, 0);
2620 lit0 = integer_zero_node;
2622 if (TREE_CODE (con1) == PLUS_EXPR)
2624 lit1 = TREE_OPERAND (con1, 1);
2625 con1 = TREE_OPERAND (con1, 0);
2628 lit1 = integer_zero_node;
2630 if (operand_equal_p (con0, con1, 0))
2637 /* First do the subtraction as integers;
2638 then drop through to build the divide operator.
2639 Do not do default conversions on the minus operator
2640 in case restype is a short type. */
2642 op0 = build_binary_op (MINUS_EXPR, convert (restype, op0),
2643 convert (restype, op1), 0);
2644 /* This generates an error if op1 is pointer to incomplete type. */
2645 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (TREE_TYPE (orig_op1))))
2646 error ("arithmetic on pointer to an incomplete type");
2648 /* This generates an error if op0 is pointer to incomplete type. */
2649 op1 = c_size_in_bytes (target_type);
2651 /* Divide by the size, in easiest possible way. */
2653 result = build (EXACT_DIV_EXPR, restype, op0, convert (restype, op1));
2655 folded = fold (result);
2656 if (folded == result)
2657 TREE_CONSTANT (folded) = TREE_CONSTANT (op0) & TREE_CONSTANT (op1);
2661 /* Construct and perhaps optimize a tree representation
2662 for a unary operation. CODE, a tree_code, specifies the operation
2663 and XARG is the operand.
2664 For any CODE other than ADDR_EXPR, FLAG nonzero suppresses
2665 the default promotions (such as from short to int).
2666 For ADDR_EXPR, the default promotions are not applied; FLAG nonzero
2667 allows non-lvalues; this is only used to handle conversion of non-lvalue
2668 arrays to pointers in C99. */
2671 build_unary_op (code, xarg, flag)
2672 enum tree_code code;
2676 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
2679 enum tree_code typecode = TREE_CODE (TREE_TYPE (arg));
2681 int noconvert = flag;
2683 if (typecode == ERROR_MARK)
2684 return error_mark_node;
2685 if (typecode == ENUMERAL_TYPE || typecode == BOOLEAN_TYPE)
2686 typecode = INTEGER_TYPE;
2691 /* This is used for unary plus, because a CONVERT_EXPR
2692 is enough to prevent anybody from looking inside for
2693 associativity, but won't generate any code. */
2694 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2695 || typecode == COMPLEX_TYPE))
2697 error ("wrong type argument to unary plus");
2698 return error_mark_node;
2700 else if (!noconvert)
2701 arg = default_conversion (arg);
2702 arg = non_lvalue (arg);
2706 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2707 || typecode == COMPLEX_TYPE
2708 || typecode == VECTOR_TYPE))
2710 error ("wrong type argument to unary minus");
2711 return error_mark_node;
2713 else if (!noconvert)
2714 arg = default_conversion (arg);
2718 if (typecode == INTEGER_TYPE || typecode == VECTOR_TYPE)
2721 arg = default_conversion (arg);
2723 else if (typecode == COMPLEX_TYPE)
2727 pedwarn ("ISO C does not support `~' for complex conjugation");
2729 arg = default_conversion (arg);
2733 error ("wrong type argument to bit-complement");
2734 return error_mark_node;
2739 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2740 || typecode == COMPLEX_TYPE))
2742 error ("wrong type argument to abs");
2743 return error_mark_node;
2745 else if (!noconvert)
2746 arg = default_conversion (arg);
2750 /* Conjugating a real value is a no-op, but allow it anyway. */
2751 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2752 || typecode == COMPLEX_TYPE))
2754 error ("wrong type argument to conjugation");
2755 return error_mark_node;
2757 else if (!noconvert)
2758 arg = default_conversion (arg);
2761 case TRUTH_NOT_EXPR:
2762 if (typecode != INTEGER_TYPE
2763 && typecode != REAL_TYPE && typecode != POINTER_TYPE
2764 && typecode != COMPLEX_TYPE
2765 /* These will convert to a pointer. */
2766 && typecode != ARRAY_TYPE && typecode != FUNCTION_TYPE)
2768 error ("wrong type argument to unary exclamation mark");
2769 return error_mark_node;
2771 arg = c_common_truthvalue_conversion (arg);
2772 return invert_truthvalue (arg);
2778 if (TREE_CODE (arg) == COMPLEX_CST)
2779 return TREE_REALPART (arg);
2780 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
2781 return fold (build1 (REALPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg));
2786 if (TREE_CODE (arg) == COMPLEX_CST)
2787 return TREE_IMAGPART (arg);
2788 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
2789 return fold (build1 (IMAGPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg));
2791 return convert (TREE_TYPE (arg), integer_zero_node);
2793 case PREINCREMENT_EXPR:
2794 case POSTINCREMENT_EXPR:
2795 case PREDECREMENT_EXPR:
2796 case POSTDECREMENT_EXPR:
2797 /* Handle complex lvalues (when permitted)
2798 by reduction to simpler cases. */
2800 val = unary_complex_lvalue (code, arg, 0);
2804 /* Increment or decrement the real part of the value,
2805 and don't change the imaginary part. */
2806 if (typecode == COMPLEX_TYPE)
2811 pedwarn ("ISO C does not support `++' and `--' on complex types");
2813 arg = stabilize_reference (arg);
2814 real = build_unary_op (REALPART_EXPR, arg, 1);
2815 imag = build_unary_op (IMAGPART_EXPR, arg, 1);
2816 return build (COMPLEX_EXPR, TREE_TYPE (arg),
2817 build_unary_op (code, real, 1), imag);
2820 /* Report invalid types. */
2822 if (typecode != POINTER_TYPE
2823 && typecode != INTEGER_TYPE && typecode != REAL_TYPE)
2825 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
2826 error ("wrong type argument to increment");
2828 error ("wrong type argument to decrement");
2830 return error_mark_node;
2835 tree result_type = TREE_TYPE (arg);
2837 arg = get_unwidened (arg, 0);
2838 argtype = TREE_TYPE (arg);
2840 /* Compute the increment. */
2842 if (typecode == POINTER_TYPE)
2844 /* If pointer target is an undefined struct,
2845 we just cannot know how to do the arithmetic. */
2846 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (result_type)))
2848 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
2849 error ("increment of pointer to unknown structure");
2851 error ("decrement of pointer to unknown structure");
2853 else if ((pedantic || warn_pointer_arith)
2854 && (TREE_CODE (TREE_TYPE (result_type)) == FUNCTION_TYPE
2855 || TREE_CODE (TREE_TYPE (result_type)) == VOID_TYPE))
2857 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
2858 pedwarn ("wrong type argument to increment");
2860 pedwarn ("wrong type argument to decrement");
2863 inc = c_size_in_bytes (TREE_TYPE (result_type));
2866 inc = integer_one_node;
2868 inc = convert (argtype, inc);
2870 /* Handle incrementing a cast-expression. */
2873 switch (TREE_CODE (arg))
2878 case FIX_TRUNC_EXPR:
2879 case FIX_FLOOR_EXPR:
2880 case FIX_ROUND_EXPR:
2882 pedantic_lvalue_warning (CONVERT_EXPR);
2883 /* If the real type has the same machine representation
2884 as the type it is cast to, we can make better output
2885 by adding directly to the inside of the cast. */
2886 if ((TREE_CODE (TREE_TYPE (arg))
2887 == TREE_CODE (TREE_TYPE (TREE_OPERAND (arg, 0))))
2888 && (TYPE_MODE (TREE_TYPE (arg))
2889 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (arg, 0)))))
2890 arg = TREE_OPERAND (arg, 0);
2893 tree incremented, modify, value;
2894 if (TREE_CODE (TREE_TYPE (arg)) == BOOLEAN_TYPE)
2895 value = boolean_increment (code, arg);
2898 arg = stabilize_reference (arg);
2899 if (code == PREINCREMENT_EXPR || code == PREDECREMENT_EXPR)
2902 value = save_expr (arg);
2903 incremented = build (((code == PREINCREMENT_EXPR
2904 || code == POSTINCREMENT_EXPR)
2905 ? PLUS_EXPR : MINUS_EXPR),
2906 argtype, value, inc);
2907 TREE_SIDE_EFFECTS (incremented) = 1;
2908 modify = build_modify_expr (arg, NOP_EXPR, incremented);
2909 value = build (COMPOUND_EXPR, TREE_TYPE (arg), modify, value);
2911 TREE_USED (value) = 1;
2921 /* Complain about anything else that is not a true lvalue. */
2922 if (!lvalue_or_else (arg, ((code == PREINCREMENT_EXPR
2923 || code == POSTINCREMENT_EXPR)
2924 ? "invalid lvalue in increment"
2925 : "invalid lvalue in decrement")))
2926 return error_mark_node;
2928 /* Report a read-only lvalue. */
2929 if (TREE_READONLY (arg))
2930 readonly_warning (arg,
2931 ((code == PREINCREMENT_EXPR
2932 || code == POSTINCREMENT_EXPR)
2933 ? "increment" : "decrement"));
2935 if (TREE_CODE (TREE_TYPE (arg)) == BOOLEAN_TYPE)
2936 val = boolean_increment (code, arg);
2938 val = build (code, TREE_TYPE (arg), arg, inc);
2939 TREE_SIDE_EFFECTS (val) = 1;
2940 val = convert (result_type, val);
2941 if (TREE_CODE (val) != code)
2942 TREE_NO_UNUSED_WARNING (val) = 1;
2947 /* Note that this operation never does default_conversion. */
2949 /* Let &* cancel out to simplify resulting code. */
2950 if (TREE_CODE (arg) == INDIRECT_REF)
2952 /* Don't let this be an lvalue. */
2953 if (lvalue_p (TREE_OPERAND (arg, 0)))
2954 return non_lvalue (TREE_OPERAND (arg, 0));
2955 return TREE_OPERAND (arg, 0);
2958 /* For &x[y], return x+y */
2959 if (TREE_CODE (arg) == ARRAY_REF)
2961 if (!c_mark_addressable (TREE_OPERAND (arg, 0)))
2962 return error_mark_node;
2963 return build_binary_op (PLUS_EXPR, TREE_OPERAND (arg, 0),
2964 TREE_OPERAND (arg, 1), 1);
2967 /* Handle complex lvalues (when permitted)
2968 by reduction to simpler cases. */
2969 val = unary_complex_lvalue (code, arg, flag);
2973 #if 0 /* Turned off because inconsistent;
2974 float f; *&(int)f = 3.4 stores in int format
2975 whereas (int)f = 3.4 stores in float format. */
2976 /* Address of a cast is just a cast of the address
2977 of the operand of the cast. */
2978 switch (TREE_CODE (arg))
2983 case FIX_TRUNC_EXPR:
2984 case FIX_FLOOR_EXPR:
2985 case FIX_ROUND_EXPR:
2988 pedwarn ("ISO C forbids the address of a cast expression");
2989 return convert (build_pointer_type (TREE_TYPE (arg)),
2990 build_unary_op (ADDR_EXPR, TREE_OPERAND (arg, 0),
2995 /* Anything not already handled and not a true memory reference
2996 or a non-lvalue array is an error. */
2997 else if (typecode != FUNCTION_TYPE && !flag
2998 && !lvalue_or_else (arg, "invalid lvalue in unary `&'"))
2999 return error_mark_node;
3001 /* Ordinary case; arg is a COMPONENT_REF or a decl. */
3002 argtype = TREE_TYPE (arg);
3004 /* If the lvalue is const or volatile, merge that into the type
3005 to which the address will point. Note that you can't get a
3006 restricted pointer by taking the address of something, so we
3007 only have to deal with `const' and `volatile' here. */
3008 if ((DECL_P (arg) || TREE_CODE_CLASS (TREE_CODE (arg)) == 'r')
3009 && (TREE_READONLY (arg) || TREE_THIS_VOLATILE (arg)))
3010 argtype = c_build_type_variant (argtype,
3011 TREE_READONLY (arg),
3012 TREE_THIS_VOLATILE (arg));
3014 argtype = build_pointer_type (argtype);
3016 if (!c_mark_addressable (arg))
3017 return error_mark_node;
3022 if (TREE_CODE (arg) == COMPONENT_REF)
3024 tree field = TREE_OPERAND (arg, 1);
3026 addr = build_unary_op (ADDR_EXPR, TREE_OPERAND (arg, 0), flag);
3028 if (DECL_C_BIT_FIELD (field))
3030 error ("attempt to take address of bit-field structure member `%s'",
3031 IDENTIFIER_POINTER (DECL_NAME (field)));
3032 return error_mark_node;
3035 addr = fold (build (PLUS_EXPR, argtype,
3036 convert (argtype, addr),
3037 convert (argtype, byte_position (field))));
3040 addr = build1 (code, argtype, arg);
3042 /* Address of a static or external variable or
3043 file-scope function counts as a constant. */
3045 && ! (TREE_CODE (arg) == FUNCTION_DECL
3046 && DECL_CONTEXT (arg) != 0))
3047 TREE_CONSTANT (addr) = 1;
3056 argtype = TREE_TYPE (arg);
3057 return fold (build1 (code, argtype, arg));
3061 /* If CONVERSIONS is a conversion expression or a nested sequence of such,
3062 convert ARG with the same conversions in the same order
3063 and return the result. */
3066 convert_sequence (conversions, arg)
3070 switch (TREE_CODE (conversions))
3075 case FIX_TRUNC_EXPR:
3076 case FIX_FLOOR_EXPR:
3077 case FIX_ROUND_EXPR:
3079 return convert (TREE_TYPE (conversions),
3080 convert_sequence (TREE_OPERAND (conversions, 0),
3089 /* Return nonzero if REF is an lvalue valid for this language.
3090 Lvalues can be assigned, unless their type has TYPE_READONLY.
3091 Lvalues can have their address taken, unless they have DECL_REGISTER. */
3097 enum tree_code code = TREE_CODE (ref);
3104 return lvalue_p (TREE_OPERAND (ref, 0));
3106 case COMPOUND_LITERAL_EXPR:
3116 return (TREE_CODE (TREE_TYPE (ref)) != FUNCTION_TYPE
3117 && TREE_CODE (TREE_TYPE (ref)) != METHOD_TYPE);
3121 return TREE_CODE (TREE_TYPE (ref)) == ARRAY_TYPE;
3128 /* Return nonzero if REF is an lvalue valid for this language;
3129 otherwise, print an error message and return zero. */
3132 lvalue_or_else (ref, msgid)
3136 int win = lvalue_p (ref);
3139 error ("%s", msgid);
3144 /* Apply unary lvalue-demanding operator CODE to the expression ARG
3145 for certain kinds of expressions which are not really lvalues
3146 but which we can accept as lvalues. If FLAG is nonzero, then
3147 non-lvalues are OK since we may be converting a non-lvalue array to
3150 If ARG is not a kind of expression we can handle, return zero. */
3153 unary_complex_lvalue (code, arg, flag)
3154 enum tree_code code;
3158 /* Handle (a, b) used as an "lvalue". */
3159 if (TREE_CODE (arg) == COMPOUND_EXPR)
3161 tree real_result = build_unary_op (code, TREE_OPERAND (arg, 1), 0);
3163 /* If this returns a function type, it isn't really being used as
3164 an lvalue, so don't issue a warning about it. */
3165 if (TREE_CODE (TREE_TYPE (arg)) != FUNCTION_TYPE && !flag)
3166 pedantic_lvalue_warning (COMPOUND_EXPR);
3168 return build (COMPOUND_EXPR, TREE_TYPE (real_result),
3169 TREE_OPERAND (arg, 0), real_result);
3172 /* Handle (a ? b : c) used as an "lvalue". */
3173 if (TREE_CODE (arg) == COND_EXPR)
3176 pedantic_lvalue_warning (COND_EXPR);
3177 if (TREE_CODE (TREE_TYPE (arg)) != FUNCTION_TYPE && !flag)
3178 pedantic_lvalue_warning (COMPOUND_EXPR);
3180 return (build_conditional_expr
3181 (TREE_OPERAND (arg, 0),
3182 build_unary_op (code, TREE_OPERAND (arg, 1), flag),
3183 build_unary_op (code, TREE_OPERAND (arg, 2), flag)));
3189 /* If pedantic, warn about improper lvalue. CODE is either COND_EXPR
3190 COMPOUND_EXPR, or CONVERT_EXPR (for casts). */
3193 pedantic_lvalue_warning (code)
3194 enum tree_code code;
3200 pedwarn ("ISO C forbids use of conditional expressions as lvalues");
3203 pedwarn ("ISO C forbids use of compound expressions as lvalues");
3206 pedwarn ("ISO C forbids use of cast expressions as lvalues");
3211 /* Warn about storing in something that is `const'. */
3214 readonly_warning (arg, msgid)
3218 if (TREE_CODE (arg) == COMPONENT_REF)
3220 if (TYPE_READONLY (TREE_TYPE (TREE_OPERAND (arg, 0))))
3221 readonly_warning (TREE_OPERAND (arg, 0), msgid);
3223 pedwarn ("%s of read-only member `%s'", _(msgid),
3224 IDENTIFIER_POINTER (DECL_NAME (TREE_OPERAND (arg, 1))));
3226 else if (TREE_CODE (arg) == VAR_DECL)
3227 pedwarn ("%s of read-only variable `%s'", _(msgid),
3228 IDENTIFIER_POINTER (DECL_NAME (arg)));
3230 pedwarn ("%s of read-only location", _(msgid));
3233 /* Mark EXP saying that we need to be able to take the
3234 address of it; it should not be allocated in a register.
3235 Returns true if successful. */
3238 c_mark_addressable (exp)
3244 switch (TREE_CODE (x))
3247 if (DECL_C_BIT_FIELD (TREE_OPERAND (x, 1)))
3249 error ("cannot take address of bit-field `%s'",
3250 IDENTIFIER_POINTER (DECL_NAME (TREE_OPERAND (x, 1))));
3254 /* ... fall through ... */
3260 x = TREE_OPERAND (x, 0);
3263 case COMPOUND_LITERAL_EXPR:
3265 TREE_ADDRESSABLE (x) = 1;
3272 if (DECL_REGISTER (x) && !TREE_ADDRESSABLE (x)
3273 && DECL_NONLOCAL (x))
3275 if (TREE_PUBLIC (x))
3277 error ("global register variable `%s' used in nested function",
3278 IDENTIFIER_POINTER (DECL_NAME (x)));
3281 pedwarn ("register variable `%s' used in nested function",
3282 IDENTIFIER_POINTER (DECL_NAME (x)));
3284 else if (DECL_REGISTER (x) && !TREE_ADDRESSABLE (x))
3286 if (TREE_PUBLIC (x))
3288 error ("address of global register variable `%s' requested",
3289 IDENTIFIER_POINTER (DECL_NAME (x)));
3293 /* If we are making this addressable due to its having
3294 volatile components, give a different error message. Also
3295 handle the case of an unnamed parameter by not trying
3296 to give the name. */
3298 else if (C_TYPE_FIELDS_VOLATILE (TREE_TYPE (x)))
3300 error ("cannot put object with volatile field into register");
3304 pedwarn ("address of register variable `%s' requested",
3305 IDENTIFIER_POINTER (DECL_NAME (x)));
3307 put_var_into_stack (x);
3311 TREE_ADDRESSABLE (x) = 1;
3312 #if 0 /* poplevel deals with this now. */
3313 if (DECL_CONTEXT (x) == 0)
3314 TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (x)) = 1;
3322 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
3325 build_conditional_expr (ifexp, op1, op2)
3326 tree ifexp, op1, op2;
3330 enum tree_code code1;
3331 enum tree_code code2;
3332 tree result_type = NULL;
3333 tree orig_op1 = op1, orig_op2 = op2;
3335 ifexp = c_common_truthvalue_conversion (default_conversion (ifexp));
3337 #if 0 /* Produces wrong result if within sizeof. */
3338 /* Don't promote the operands separately if they promote
3339 the same way. Return the unpromoted type and let the combined
3340 value get promoted if necessary. */
3342 if (TREE_TYPE (op1) == TREE_TYPE (op2)
3343 && TREE_CODE (TREE_TYPE (op1)) != ARRAY_TYPE
3344 && TREE_CODE (TREE_TYPE (op1)) != ENUMERAL_TYPE
3345 && TREE_CODE (TREE_TYPE (op1)) != FUNCTION_TYPE)
3347 if (TREE_CODE (ifexp) == INTEGER_CST)
3348 return pedantic_non_lvalue (integer_zerop (ifexp) ? op2 : op1);
3350 return fold (build (COND_EXPR, TREE_TYPE (op1), ifexp, op1, op2));
3354 /* Promote both alternatives. */
3356 if (TREE_CODE (TREE_TYPE (op1)) != VOID_TYPE)
3357 op1 = default_conversion (op1);
3358 if (TREE_CODE (TREE_TYPE (op2)) != VOID_TYPE)
3359 op2 = default_conversion (op2);
3361 if (TREE_CODE (ifexp) == ERROR_MARK
3362 || TREE_CODE (TREE_TYPE (op1)) == ERROR_MARK
3363 || TREE_CODE (TREE_TYPE (op2)) == ERROR_MARK)
3364 return error_mark_node;
3366 type1 = TREE_TYPE (op1);
3367 code1 = TREE_CODE (type1);
3368 type2 = TREE_TYPE (op2);
3369 code2 = TREE_CODE (type2);
3371 /* Quickly detect the usual case where op1 and op2 have the same type
3373 if (TYPE_MAIN_VARIANT (type1) == TYPE_MAIN_VARIANT (type2))
3376 result_type = type1;
3378 result_type = TYPE_MAIN_VARIANT (type1);
3380 else if ((code1 == INTEGER_TYPE || code1 == REAL_TYPE
3381 || code1 == COMPLEX_TYPE)
3382 && (code2 == INTEGER_TYPE || code2 == REAL_TYPE
3383 || code2 == COMPLEX_TYPE))
3385 result_type = common_type (type1, type2);
3387 /* If -Wsign-compare, warn here if type1 and type2 have
3388 different signedness. We'll promote the signed to unsigned
3389 and later code won't know it used to be different.
3390 Do this check on the original types, so that explicit casts
3391 will be considered, but default promotions won't. */
3392 if ((warn_sign_compare < 0 ? extra_warnings : warn_sign_compare)
3393 && !skip_evaluation)
3395 int unsigned_op1 = TREE_UNSIGNED (TREE_TYPE (orig_op1));
3396 int unsigned_op2 = TREE_UNSIGNED (TREE_TYPE (orig_op2));
3398 if (unsigned_op1 ^ unsigned_op2)
3400 /* Do not warn if the result type is signed, since the
3401 signed type will only be chosen if it can represent
3402 all the values of the unsigned type. */
3403 if (! TREE_UNSIGNED (result_type))
3405 /* Do not warn if the signed quantity is an unsuffixed
3406 integer literal (or some static constant expression
3407 involving such literals) and it is non-negative. */
3408 else if ((unsigned_op2 && tree_expr_nonnegative_p (op1))
3409 || (unsigned_op1 && tree_expr_nonnegative_p (op2)))
3412 warning ("signed and unsigned type in conditional expression");
3416 else if (code1 == VOID_TYPE || code2 == VOID_TYPE)
3418 if (pedantic && (code1 != VOID_TYPE || code2 != VOID_TYPE))
3419 pedwarn ("ISO C forbids conditional expr with only one void side");
3420 result_type = void_type_node;
3422 else if (code1 == POINTER_TYPE && code2 == POINTER_TYPE)
3424 if (comp_target_types (type1, type2))
3425 result_type = common_type (type1, type2);
3426 else if (integer_zerop (op1) && TREE_TYPE (type1) == void_type_node
3427 && TREE_CODE (orig_op1) != NOP_EXPR)
3428 result_type = qualify_type (type2, type1);
3429 else if (integer_zerop (op2) && TREE_TYPE (type2) == void_type_node
3430 && TREE_CODE (orig_op2) != NOP_EXPR)
3431 result_type = qualify_type (type1, type2);
3432 else if (VOID_TYPE_P (TREE_TYPE (type1)))
3434 if (pedantic && TREE_CODE (TREE_TYPE (type2)) == FUNCTION_TYPE)
3435 pedwarn ("ISO C forbids conditional expr between `void *' and function pointer");
3436 result_type = build_pointer_type (qualify_type (TREE_TYPE (type1),
3437 TREE_TYPE (type2)));
3439 else if (VOID_TYPE_P (TREE_TYPE (type2)))
3441 if (pedantic && TREE_CODE (TREE_TYPE (type1)) == FUNCTION_TYPE)
3442 pedwarn ("ISO C forbids conditional expr between `void *' and function pointer");
3443 result_type = build_pointer_type (qualify_type (TREE_TYPE (type2),
3444 TREE_TYPE (type1)));
3448 pedwarn ("pointer type mismatch in conditional expression");
3449 result_type = build_pointer_type (void_type_node);
3452 else if (code1 == POINTER_TYPE && code2 == INTEGER_TYPE)
3454 if (! integer_zerop (op2))
3455 pedwarn ("pointer/integer type mismatch in conditional expression");
3458 op2 = null_pointer_node;
3460 result_type = type1;
3462 else if (code2 == POINTER_TYPE && code1 == INTEGER_TYPE)
3464 if (!integer_zerop (op1))
3465 pedwarn ("pointer/integer type mismatch in conditional expression");
3468 op1 = null_pointer_node;
3470 result_type = type2;
3475 if (flag_cond_mismatch)
3476 result_type = void_type_node;
3479 error ("type mismatch in conditional expression");
3480 return error_mark_node;
3484 /* Merge const and volatile flags of the incoming types. */
3486 = build_type_variant (result_type,
3487 TREE_READONLY (op1) || TREE_READONLY (op2),
3488 TREE_THIS_VOLATILE (op1) || TREE_THIS_VOLATILE (op2));
3490 if (result_type != TREE_TYPE (op1))
3491 op1 = convert_and_check (result_type, op1);
3492 if (result_type != TREE_TYPE (op2))
3493 op2 = convert_and_check (result_type, op2);
3495 if (TREE_CODE (ifexp) == INTEGER_CST)
3496 return pedantic_non_lvalue (integer_zerop (ifexp) ? op2 : op1);
3498 return fold (build (COND_EXPR, result_type, ifexp, op1, op2));
3501 /* Given a list of expressions, return a compound expression
3502 that performs them all and returns the value of the last of them. */
3505 build_compound_expr (list)
3508 return internal_build_compound_expr (list, TRUE);
3512 internal_build_compound_expr (list, first_p)
3518 if (TREE_CHAIN (list) == 0)
3520 /* Convert arrays and functions to pointers when there
3521 really is a comma operator. */
3524 = default_function_array_conversion (TREE_VALUE (list));
3526 #if 0 /* If something inside inhibited lvalueness, we should not override. */
3527 /* Consider (x, y+0), which is not an lvalue since y+0 is not. */
3529 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
3530 if (TREE_CODE (list) == NON_LVALUE_EXPR)
3531 list = TREE_OPERAND (list, 0);
3534 /* Don't let (0, 0) be null pointer constant. */
3535 if (!first_p && integer_zerop (TREE_VALUE (list)))
3536 return non_lvalue (TREE_VALUE (list));
3537 return TREE_VALUE (list);
3540 rest = internal_build_compound_expr (TREE_CHAIN (list), FALSE);
3542 if (! TREE_SIDE_EFFECTS (TREE_VALUE (list)))
3544 /* The left-hand operand of a comma expression is like an expression
3545 statement: with -W or -Wunused, we should warn if it doesn't have
3546 any side-effects, unless it was explicitly cast to (void). */
3547 if ((extra_warnings || warn_unused_value)
3548 && ! (TREE_CODE (TREE_VALUE (list)) == CONVERT_EXPR
3549 && VOID_TYPE_P (TREE_TYPE (TREE_VALUE (list)))))
3550 warning ("left-hand operand of comma expression has no effect");
3552 /* When pedantic, a compound expression can be neither an lvalue
3553 nor an integer constant expression. */
3558 /* With -Wunused, we should also warn if the left-hand operand does have
3559 side-effects, but computes a value which is not used. For example, in
3560 `foo() + bar(), baz()' the result of the `+' operator is not used,
3561 so we should issue a warning. */
3562 else if (warn_unused_value)
3563 warn_if_unused_value (TREE_VALUE (list));
3565 return build (COMPOUND_EXPR, TREE_TYPE (rest), TREE_VALUE (list), rest);
3568 /* Build an expression representing a cast to type TYPE of expression EXPR. */
3571 build_c_cast (type, expr)
3577 if (type == error_mark_node || expr == error_mark_node)
3578 return error_mark_node;
3579 type = TYPE_MAIN_VARIANT (type);
3582 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
3583 if (TREE_CODE (value) == NON_LVALUE_EXPR)
3584 value = TREE_OPERAND (value, 0);
3587 if (TREE_CODE (type) == ARRAY_TYPE)
3589 error ("cast specifies array type");
3590 return error_mark_node;
3593 if (TREE_CODE (type) == FUNCTION_TYPE)
3595 error ("cast specifies function type");
3596 return error_mark_node;
3599 if (type == TYPE_MAIN_VARIANT (TREE_TYPE (value)))
3603 if (TREE_CODE (type) == RECORD_TYPE
3604 || TREE_CODE (type) == UNION_TYPE)
3605 pedwarn ("ISO C forbids casting nonscalar to the same type");
3608 else if (TREE_CODE (type) == UNION_TYPE)
3611 value = default_function_array_conversion (value);
3613 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
3614 if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (field)),
3615 TYPE_MAIN_VARIANT (TREE_TYPE (value))))
3624 pedwarn ("ISO C forbids casts to union type");
3625 if (TYPE_NAME (type) != 0)
3627 if (TREE_CODE (TYPE_NAME (type)) == IDENTIFIER_NODE)
3628 name = IDENTIFIER_POINTER (TYPE_NAME (type));
3630 name = IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type)));
3634 t = digest_init (type, build (CONSTRUCTOR, type, NULL_TREE,
3635 build_tree_list (field, value)), 0);
3636 TREE_CONSTANT (t) = TREE_CONSTANT (value);
3639 error ("cast to union type from type not present in union");
3640 return error_mark_node;
3646 /* If casting to void, avoid the error that would come
3647 from default_conversion in the case of a non-lvalue array. */
3648 if (type == void_type_node)
3649 return build1 (CONVERT_EXPR, type, value);
3651 /* Convert functions and arrays to pointers,
3652 but don't convert any other types. */
3653 value = default_function_array_conversion (value);
3654 otype = TREE_TYPE (value);
3656 /* Optionally warn about potentially worrisome casts. */
3659 && TREE_CODE (type) == POINTER_TYPE
3660 && TREE_CODE (otype) == POINTER_TYPE)
3662 tree in_type = type;
3663 tree in_otype = otype;
3667 /* Check that the qualifiers on IN_TYPE are a superset of
3668 the qualifiers of IN_OTYPE. The outermost level of
3669 POINTER_TYPE nodes is uninteresting and we stop as soon
3670 as we hit a non-POINTER_TYPE node on either type. */
3673 in_otype = TREE_TYPE (in_otype);
3674 in_type = TREE_TYPE (in_type);
3676 /* GNU C allows cv-qualified function types. 'const'
3677 means the function is very pure, 'volatile' means it
3678 can't return. We need to warn when such qualifiers
3679 are added, not when they're taken away. */
3680 if (TREE_CODE (in_otype) == FUNCTION_TYPE
3681 && TREE_CODE (in_type) == FUNCTION_TYPE)
3682 added |= (TYPE_QUALS (in_type) & ~TYPE_QUALS (in_otype));
3684 discarded |= (TYPE_QUALS (in_otype) & ~TYPE_QUALS (in_type));
3686 while (TREE_CODE (in_type) == POINTER_TYPE
3687 && TREE_CODE (in_otype) == POINTER_TYPE);
3690 warning ("cast adds new qualifiers to function type");
3693 /* There are qualifiers present in IN_OTYPE that are not
3694 present in IN_TYPE. */
3695 warning ("cast discards qualifiers from pointer target type");
3698 /* Warn about possible alignment problems. */
3699 if (STRICT_ALIGNMENT && warn_cast_align
3700 && TREE_CODE (type) == POINTER_TYPE
3701 && TREE_CODE (otype) == POINTER_TYPE
3702 && TREE_CODE (TREE_TYPE (otype)) != VOID_TYPE
3703 && TREE_CODE (TREE_TYPE (otype)) != FUNCTION_TYPE
3704 /* Don't warn about opaque types, where the actual alignment
3705 restriction is unknown. */
3706 && !((TREE_CODE (TREE_TYPE (otype)) == UNION_TYPE
3707 || TREE_CODE (TREE_TYPE (otype)) == RECORD_TYPE)
3708 && TYPE_MODE (TREE_TYPE (otype)) == VOIDmode)
3709 && TYPE_ALIGN (TREE_TYPE (type)) > TYPE_ALIGN (TREE_TYPE (otype)))
3710 warning ("cast increases required alignment of target type");
3712 if (TREE_CODE (type) == INTEGER_TYPE
3713 && TREE_CODE (otype) == POINTER_TYPE
3714 && TYPE_PRECISION (type) != TYPE_PRECISION (otype)
3715 && !TREE_CONSTANT (value))
3716 warning ("cast from pointer to integer of different size");
3718 if (warn_bad_function_cast
3719 && TREE_CODE (value) == CALL_EXPR
3720 && TREE_CODE (type) != TREE_CODE (otype))
3721 warning ("cast does not match function type");
3723 if (TREE_CODE (type) == POINTER_TYPE
3724 && TREE_CODE (otype) == INTEGER_TYPE
3725 && TYPE_PRECISION (type) != TYPE_PRECISION (otype)
3726 /* Don't warn about converting any constant. */
3727 && !TREE_CONSTANT (value))
3728 warning ("cast to pointer from integer of different size");
3731 value = convert (type, value);
3733 /* Ignore any integer overflow caused by the cast. */
3734 if (TREE_CODE (value) == INTEGER_CST)
3736 TREE_OVERFLOW (value) = TREE_OVERFLOW (ovalue);
3737 TREE_CONSTANT_OVERFLOW (value) = TREE_CONSTANT_OVERFLOW (ovalue);
3741 /* Pedantically, don't let (void *) (FOO *) 0 be a null pointer constant. */
3742 if (pedantic && TREE_CODE (value) == INTEGER_CST
3743 && TREE_CODE (expr) == INTEGER_CST
3744 && TREE_CODE (TREE_TYPE (expr)) != INTEGER_TYPE)
3745 value = non_lvalue (value);
3747 /* If pedantic, don't let a cast be an lvalue. */
3748 if (value == expr && pedantic)
3749 value = non_lvalue (value);
3754 /* Interpret a cast of expression EXPR to type TYPE. */
3756 c_cast_expr (type, expr)
3759 int saved_wsp = warn_strict_prototypes;
3761 /* This avoids warnings about unprototyped casts on
3762 integers. E.g. "#define SIG_DFL (void(*)())0". */
3763 if (TREE_CODE (expr) == INTEGER_CST)
3764 warn_strict_prototypes = 0;
3765 type = groktypename (type);
3766 warn_strict_prototypes = saved_wsp;
3768 return build_c_cast (type, expr);
3772 /* Build an assignment expression of lvalue LHS from value RHS.
3773 MODIFYCODE is the code for a binary operator that we use
3774 to combine the old value of LHS with RHS to get the new value.
3775 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment. */
3778 build_modify_expr (lhs, modifycode, rhs)
3780 enum tree_code modifycode;
3784 tree lhstype = TREE_TYPE (lhs);
3785 tree olhstype = lhstype;
3787 /* Types that aren't fully specified cannot be used in assignments. */
3788 lhs = require_complete_type (lhs);
3790 /* Avoid duplicate error messages from operands that had errors. */
3791 if (TREE_CODE (lhs) == ERROR_MARK || TREE_CODE (rhs) == ERROR_MARK)
3792 return error_mark_node;
3794 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
3795 /* Do not use STRIP_NOPS here. We do not want an enumerator
3796 whose value is 0 to count as a null pointer constant. */
3797 if (TREE_CODE (rhs) == NON_LVALUE_EXPR)
3798 rhs = TREE_OPERAND (rhs, 0);
3802 /* Handle control structure constructs used as "lvalues". */
3804 switch (TREE_CODE (lhs))
3806 /* Handle (a, b) used as an "lvalue". */
3808 pedantic_lvalue_warning (COMPOUND_EXPR);
3809 newrhs = build_modify_expr (TREE_OPERAND (lhs, 1), modifycode, rhs);
3810 if (TREE_CODE (newrhs) == ERROR_MARK)
3811 return error_mark_node;
3812 return build (COMPOUND_EXPR, lhstype,
3813 TREE_OPERAND (lhs, 0), newrhs);
3815 /* Handle (a ? b : c) used as an "lvalue". */
3817 pedantic_lvalue_warning (COND_EXPR);
3818 rhs = save_expr (rhs);
3820 /* Produce (a ? (b = rhs) : (c = rhs))
3821 except that the RHS goes through a save-expr
3822 so the code to compute it is only emitted once. */
3824 = build_conditional_expr (TREE_OPERAND (lhs, 0),
3825 build_modify_expr (TREE_OPERAND (lhs, 1),
3827 build_modify_expr (TREE_OPERAND (lhs, 2),
3829 if (TREE_CODE (cond) == ERROR_MARK)
3831 /* Make sure the code to compute the rhs comes out
3832 before the split. */
3833 return build (COMPOUND_EXPR, TREE_TYPE (lhs),
3834 /* But cast it to void to avoid an "unused" error. */
3835 convert (void_type_node, rhs), cond);
3841 /* If a binary op has been requested, combine the old LHS value with the RHS
3842 producing the value we should actually store into the LHS. */
3844 if (modifycode != NOP_EXPR)
3846 lhs = stabilize_reference (lhs);
3847 newrhs = build_binary_op (modifycode, lhs, rhs, 1);
3850 /* Handle a cast used as an "lvalue".
3851 We have already performed any binary operator using the value as cast.
3852 Now convert the result to the cast type of the lhs,
3853 and then true type of the lhs and store it there;
3854 then convert result back to the cast type to be the value
3855 of the assignment. */
3857 switch (TREE_CODE (lhs))
3862 case FIX_TRUNC_EXPR:
3863 case FIX_FLOOR_EXPR:
3864 case FIX_ROUND_EXPR:
3866 newrhs = default_function_array_conversion (newrhs);
3868 tree inner_lhs = TREE_OPERAND (lhs, 0);
3870 result = build_modify_expr (inner_lhs, NOP_EXPR,
3871 convert (TREE_TYPE (inner_lhs),
3872 convert (lhstype, newrhs)));
3873 if (TREE_CODE (result) == ERROR_MARK)
3875 pedantic_lvalue_warning (CONVERT_EXPR);
3876 return convert (TREE_TYPE (lhs), result);
3883 /* Now we have handled acceptable kinds of LHS that are not truly lvalues.
3884 Reject anything strange now. */
3886 if (!lvalue_or_else (lhs, "invalid lvalue in assignment"))
3887 return error_mark_node;
3889 /* Warn about storing in something that is `const'. */
3891 if (TREE_READONLY (lhs) || TYPE_READONLY (lhstype)
3892 || ((TREE_CODE (lhstype) == RECORD_TYPE
3893 || TREE_CODE (lhstype) == UNION_TYPE)
3894 && C_TYPE_FIELDS_READONLY (lhstype)))
3895 readonly_warning (lhs, "assignment");
3897 /* If storing into a structure or union member,
3898 it has probably been given type `int'.
3899 Compute the type that would go with
3900 the actual amount of storage the member occupies. */
3902 if (TREE_CODE (lhs) == COMPONENT_REF
3903 && (TREE_CODE (lhstype) == INTEGER_TYPE
3904 || TREE_CODE (lhstype) == BOOLEAN_TYPE
3905 || TREE_CODE (lhstype) == REAL_TYPE
3906 || TREE_CODE (lhstype) == ENUMERAL_TYPE))
3907 lhstype = TREE_TYPE (get_unwidened (lhs, 0));
3909 /* If storing in a field that is in actuality a short or narrower than one,
3910 we must store in the field in its actual type. */
3912 if (lhstype != TREE_TYPE (lhs))
3914 lhs = copy_node (lhs);
3915 TREE_TYPE (lhs) = lhstype;
3918 /* Convert new value to destination type. */
3920 newrhs = convert_for_assignment (lhstype, newrhs, _("assignment"),
3921 NULL_TREE, NULL_TREE, 0);
3922 if (TREE_CODE (newrhs) == ERROR_MARK)
3923 return error_mark_node;
3927 result = build (MODIFY_EXPR, lhstype, lhs, newrhs);
3928 TREE_SIDE_EFFECTS (result) = 1;
3930 /* If we got the LHS in a different type for storing in,
3931 convert the result back to the nominal type of LHS
3932 so that the value we return always has the same type
3933 as the LHS argument. */
3935 if (olhstype == TREE_TYPE (result))
3937 return convert_for_assignment (olhstype, result, _("assignment"),
3938 NULL_TREE, NULL_TREE, 0);
3941 /* Convert value RHS to type TYPE as preparation for an assignment
3942 to an lvalue of type TYPE.
3943 The real work of conversion is done by `convert'.
3944 The purpose of this function is to generate error messages
3945 for assignments that are not allowed in C.
3946 ERRTYPE is a string to use in error messages:
3947 "assignment", "return", etc. If it is null, this is parameter passing
3948 for a function call (and different error messages are output).
3950 FUNNAME is the name of the function being called,
3951 as an IDENTIFIER_NODE, or null.
3952 PARMNUM is the number of the argument, for printing in error messages. */
3955 convert_for_assignment (type, rhs, errtype, fundecl, funname, parmnum)
3957 const char *errtype;
3958 tree fundecl, funname;
3961 enum tree_code codel = TREE_CODE (type);
3963 enum tree_code coder;
3965 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
3966 /* Do not use STRIP_NOPS here. We do not want an enumerator
3967 whose value is 0 to count as a null pointer constant. */
3968 if (TREE_CODE (rhs) == NON_LVALUE_EXPR)
3969 rhs = TREE_OPERAND (rhs, 0);
3971 if (TREE_CODE (TREE_TYPE (rhs)) == ARRAY_TYPE
3972 || TREE_CODE (TREE_TYPE (rhs)) == FUNCTION_TYPE)
3973 rhs = default_conversion (rhs);
3974 else if (optimize && TREE_CODE (rhs) == VAR_DECL)
3975 rhs = decl_constant_value_for_broken_optimization (rhs);
3977 rhstype = TREE_TYPE (rhs);
3978 coder = TREE_CODE (rhstype);
3980 if (coder == ERROR_MARK)
3981 return error_mark_node;
3983 if (TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (rhstype))
3985 overflow_warning (rhs);
3986 /* Check for Objective-C protocols. This will issue a warning if
3987 there are protocol violations. No need to use the return value. */
3989 objc_comptypes (type, rhstype, 0);
3993 if (coder == VOID_TYPE)
3995 error ("void value not ignored as it ought to be");
3996 return error_mark_node;
3998 /* A type converts to a reference to it.
3999 This code doesn't fully support references, it's just for the
4000 special case of va_start and va_copy. */
4001 if (codel == REFERENCE_TYPE
4002 && comptypes (TREE_TYPE (type), TREE_TYPE (rhs)) == 1)
4004 if (!lvalue_p (rhs))
4006 error ("cannot pass rvalue to reference parameter");
4007 return error_mark_node;
4009 if (!c_mark_addressable (rhs))
4010 return error_mark_node;
4011 rhs = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (rhs)), rhs);
4013 /* We already know that these two types are compatible, but they
4014 may not be exactly identical. In fact, `TREE_TYPE (type)' is
4015 likely to be __builtin_va_list and `TREE_TYPE (rhs)' is
4016 likely to be va_list, a typedef to __builtin_va_list, which
4017 is different enough that it will cause problems later. */
4018 if (TREE_TYPE (TREE_TYPE (rhs)) != TREE_TYPE (type))
4019 rhs = build1 (NOP_EXPR, build_pointer_type (TREE_TYPE (type)), rhs);
4021 rhs = build1 (NOP_EXPR, type, rhs);
4024 /* Arithmetic types all interconvert, and enum is treated like int. */
4025 else if ((codel == INTEGER_TYPE || codel == REAL_TYPE
4026 || codel == ENUMERAL_TYPE || codel == COMPLEX_TYPE
4027 || codel == BOOLEAN_TYPE)
4028 && (coder == INTEGER_TYPE || coder == REAL_TYPE
4029 || coder == ENUMERAL_TYPE || coder == COMPLEX_TYPE
4030 || coder == BOOLEAN_TYPE))
4031 return convert_and_check (type, rhs);
4033 /* Conversion to a transparent union from its member types.
4034 This applies only to function arguments. */
4035 else if (codel == UNION_TYPE && TYPE_TRANSPARENT_UNION (type) && ! errtype)
4038 tree marginal_memb_type = 0;
4040 for (memb_types = TYPE_FIELDS (type); memb_types;
4041 memb_types = TREE_CHAIN (memb_types))
4043 tree memb_type = TREE_TYPE (memb_types);
4045 if (comptypes (TYPE_MAIN_VARIANT (memb_type),
4046 TYPE_MAIN_VARIANT (rhstype)))
4049 if (TREE_CODE (memb_type) != POINTER_TYPE)
4052 if (coder == POINTER_TYPE)
4054 tree ttl = TREE_TYPE (memb_type);
4055 tree ttr = TREE_TYPE (rhstype);
4057 /* Any non-function converts to a [const][volatile] void *
4058 and vice versa; otherwise, targets must be the same.
4059 Meanwhile, the lhs target must have all the qualifiers of
4061 if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
4062 || comp_target_types (memb_type, rhstype))
4064 /* If this type won't generate any warnings, use it. */
4065 if (TYPE_QUALS (ttl) == TYPE_QUALS (ttr)
4066 || ((TREE_CODE (ttr) == FUNCTION_TYPE
4067 && TREE_CODE (ttl) == FUNCTION_TYPE)
4068 ? ((TYPE_QUALS (ttl) | TYPE_QUALS (ttr))
4069 == TYPE_QUALS (ttr))
4070 : ((TYPE_QUALS (ttl) | TYPE_QUALS (ttr))
4071 == TYPE_QUALS (ttl))))
4074 /* Keep looking for a better type, but remember this one. */
4075 if (! marginal_memb_type)
4076 marginal_memb_type = memb_type;
4080 /* Can convert integer zero to any pointer type. */
4081 if (integer_zerop (rhs)
4082 || (TREE_CODE (rhs) == NOP_EXPR
4083 && integer_zerop (TREE_OPERAND (rhs, 0))))
4085 rhs = null_pointer_node;
4090 if (memb_types || marginal_memb_type)
4094 /* We have only a marginally acceptable member type;
4095 it needs a warning. */
4096 tree ttl = TREE_TYPE (marginal_memb_type);
4097 tree ttr = TREE_TYPE (rhstype);
4099 /* Const and volatile mean something different for function
4100 types, so the usual warnings are not appropriate. */
4101 if (TREE_CODE (ttr) == FUNCTION_TYPE
4102 && TREE_CODE (ttl) == FUNCTION_TYPE)
4104 /* Because const and volatile on functions are
4105 restrictions that say the function will not do
4106 certain things, it is okay to use a const or volatile
4107 function where an ordinary one is wanted, but not
4109 if (TYPE_QUALS (ttl) & ~TYPE_QUALS (ttr))
4110 warn_for_assignment ("%s makes qualified function pointer from unqualified",
4111 errtype, funname, parmnum);
4113 else if (TYPE_QUALS (ttr) & ~TYPE_QUALS (ttl))
4114 warn_for_assignment ("%s discards qualifiers from pointer target type",
4119 if (pedantic && ! DECL_IN_SYSTEM_HEADER (fundecl))
4120 pedwarn ("ISO C prohibits argument conversion to union type");
4122 return build1 (NOP_EXPR, type, rhs);
4126 /* Conversions among pointers */
4127 else if ((codel == POINTER_TYPE || codel == REFERENCE_TYPE)
4128 && (coder == codel))
4130 tree ttl = TREE_TYPE (type);
4131 tree ttr = TREE_TYPE (rhstype);
4133 /* Any non-function converts to a [const][volatile] void *
4134 and vice versa; otherwise, targets must be the same.
4135 Meanwhile, the lhs target must have all the qualifiers of the rhs. */
4136 if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
4137 || comp_target_types (type, rhstype)
4138 || (c_common_unsigned_type (TYPE_MAIN_VARIANT (ttl))
4139 == c_common_unsigned_type (TYPE_MAIN_VARIANT (ttr))))
4142 && ((VOID_TYPE_P (ttl) && TREE_CODE (ttr) == FUNCTION_TYPE)
4145 /* Check TREE_CODE to catch cases like (void *) (char *) 0
4146 which are not ANSI null ptr constants. */
4147 && (!integer_zerop (rhs) || TREE_CODE (rhs) == NOP_EXPR)
4148 && TREE_CODE (ttl) == FUNCTION_TYPE)))
4149 warn_for_assignment ("ISO C forbids %s between function pointer and `void *'",
4150 errtype, funname, parmnum);
4151 /* Const and volatile mean something different for function types,
4152 so the usual warnings are not appropriate. */
4153 else if (TREE_CODE (ttr) != FUNCTION_TYPE
4154 && TREE_CODE (ttl) != FUNCTION_TYPE)
4156 if (TYPE_QUALS (ttr) & ~TYPE_QUALS (ttl))
4157 warn_for_assignment ("%s discards qualifiers from pointer target type",
4158 errtype, funname, parmnum);
4159 /* If this is not a case of ignoring a mismatch in signedness,
4161 else if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
4162 || comp_target_types (type, rhstype))
4164 /* If there is a mismatch, do warn. */
4166 warn_for_assignment ("pointer targets in %s differ in signedness",
4167 errtype, funname, parmnum);
4169 else if (TREE_CODE (ttl) == FUNCTION_TYPE
4170 && TREE_CODE (ttr) == FUNCTION_TYPE)
4172 /* Because const and volatile on functions are restrictions
4173 that say the function will not do certain things,
4174 it is okay to use a const or volatile function
4175 where an ordinary one is wanted, but not vice-versa. */
4176 if (TYPE_QUALS (ttl) & ~TYPE_QUALS (ttr))
4177 warn_for_assignment ("%s makes qualified function pointer from unqualified",
4178 errtype, funname, parmnum);
4182 warn_for_assignment ("%s from incompatible pointer type",
4183 errtype, funname, parmnum);
4184 return convert (type, rhs);
4186 else if (codel == POINTER_TYPE && coder == INTEGER_TYPE)
4188 /* An explicit constant 0 can convert to a pointer,
4189 or one that results from arithmetic, even including
4190 a cast to integer type. */
4191 if (! (TREE_CODE (rhs) == INTEGER_CST && integer_zerop (rhs))
4193 ! (TREE_CODE (rhs) == NOP_EXPR
4194 && TREE_CODE (TREE_TYPE (rhs)) == INTEGER_TYPE
4195 && TREE_CODE (TREE_OPERAND (rhs, 0)) == INTEGER_CST
4196 && integer_zerop (TREE_OPERAND (rhs, 0))))
4198 warn_for_assignment ("%s makes pointer from integer without a cast",
4199 errtype, funname, parmnum);
4200 return convert (type, rhs);
4202 return null_pointer_node;
4204 else if (codel == INTEGER_TYPE && coder == POINTER_TYPE)
4206 warn_for_assignment ("%s makes integer from pointer without a cast",
4207 errtype, funname, parmnum);
4208 return convert (type, rhs);
4210 else if (codel == BOOLEAN_TYPE && coder == POINTER_TYPE)
4211 return convert (type, rhs);
4217 tree selector = objc_message_selector ();
4219 if (selector && parmnum > 2)
4220 error ("incompatible type for argument %d of `%s'",
4221 parmnum - 2, IDENTIFIER_POINTER (selector));
4223 error ("incompatible type for argument %d of `%s'",
4224 parmnum, IDENTIFIER_POINTER (funname));
4227 error ("incompatible type for argument %d of indirect function call",
4231 error ("incompatible types in %s", errtype);
4233 return error_mark_node;
4236 /* Convert VALUE for assignment into inlined parameter PARM. */
4239 c_convert_parm_for_inlining (parm, value, fn)
4240 tree parm, value, fn;
4244 /* If FN was prototyped, the value has been converted already
4245 in convert_arguments. */
4246 if (! value || TYPE_ARG_TYPES (TREE_TYPE (fn)))
4249 type = TREE_TYPE (parm);
4250 ret = convert_for_assignment (type, value,
4251 (char *) 0 /* arg passing */, fn,
4253 if (PROMOTE_PROTOTYPES
4254 && INTEGRAL_TYPE_P (type)
4255 && (TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node)))
4256 ret = default_conversion (ret);
4260 /* Print a warning using MSGID.
4261 It gets OPNAME as its one parameter.
4262 If OPNAME is null, it is replaced by "passing arg ARGNUM of `FUNCTION'".
4263 FUNCTION and ARGNUM are handled specially if we are building an
4264 Objective-C selector. */
4267 warn_for_assignment (msgid, opname, function, argnum)
4275 tree selector = objc_message_selector ();
4278 if (selector && argnum > 2)
4280 function = selector;
4285 /* Function name is known; supply it. */
4286 const char *const argstring = _("passing arg %d of `%s'");
4287 new_opname = (char *) alloca (IDENTIFIER_LENGTH (function)
4288 + strlen (argstring) + 1 + 25
4290 sprintf (new_opname, argstring, argnum,
4291 IDENTIFIER_POINTER (function));
4295 /* Function name unknown (call through ptr); just give arg number. */
4296 const char *const argnofun = _("passing arg %d of pointer to function");
4297 new_opname = (char *) alloca (strlen (argnofun) + 1 + 25 /*%d*/ + 1);
4298 sprintf (new_opname, argnofun, argnum);
4300 opname = new_opname;
4302 pedwarn (msgid, opname);
4305 /* If VALUE is a compound expr all of whose expressions are constant, then
4306 return its value. Otherwise, return error_mark_node.
4308 This is for handling COMPOUND_EXPRs as initializer elements
4309 which is allowed with a warning when -pedantic is specified. */
4312 valid_compound_expr_initializer (value, endtype)
4316 if (TREE_CODE (value) == COMPOUND_EXPR)
4318 if (valid_compound_expr_initializer (TREE_OPERAND (value, 0), endtype)
4320 return error_mark_node;
4321 return valid_compound_expr_initializer (TREE_OPERAND (value, 1),
4324 else if (! TREE_CONSTANT (value)
4325 && ! initializer_constant_valid_p (value, endtype))
4326 return error_mark_node;
4331 /* Perform appropriate conversions on the initial value of a variable,
4332 store it in the declaration DECL,
4333 and print any error messages that are appropriate.
4334 If the init is invalid, store an ERROR_MARK. */
4337 store_init_value (decl, init)
4342 /* If variable's type was invalidly declared, just ignore it. */
4344 type = TREE_TYPE (decl);
4345 if (TREE_CODE (type) == ERROR_MARK)
4348 /* Digest the specified initializer into an expression. */
4350 value = digest_init (type, init, TREE_STATIC (decl));
4352 /* Store the expression if valid; else report error. */
4355 /* Note that this is the only place we can detect the error
4356 in a case such as struct foo bar = (struct foo) { x, y };
4357 where there is one initial value which is a constructor expression. */
4358 if (value == error_mark_node)
4360 else if (TREE_STATIC (decl) && ! TREE_CONSTANT (value))
4362 error ("initializer for static variable is not constant");
4363 value = error_mark_node;
4365 else if (TREE_STATIC (decl)
4366 && initializer_constant_valid_p (value, TREE_TYPE (value)) == 0)
4368 error ("initializer for static variable uses complicated arithmetic");
4369 value = error_mark_node;
4373 if (pedantic && TREE_CODE (value) == CONSTRUCTOR)
4375 if (! TREE_CONSTANT (value))
4376 pedwarn ("aggregate initializer is not constant");
4377 else if (! TREE_STATIC (value))
4378 pedwarn ("aggregate initializer uses complicated arithmetic");
4383 if (warn_traditional && !in_system_header
4384 && AGGREGATE_TYPE_P (TREE_TYPE (decl)) && ! TREE_STATIC (decl))
4385 warning ("traditional C rejects automatic aggregate initialization");
4387 DECL_INITIAL (decl) = value;
4389 /* ANSI wants warnings about out-of-range constant initializers. */
4390 STRIP_TYPE_NOPS (value);
4391 constant_expression_warning (value);
4393 /* Check if we need to set array size from compound literal size. */
4394 if (TREE_CODE (type) == ARRAY_TYPE
4395 && TYPE_DOMAIN (type) == 0
4396 && value != error_mark_node)
4398 tree inside_init = init;
4400 if (TREE_CODE (init) == NON_LVALUE_EXPR)
4401 inside_init = TREE_OPERAND (init, 0);
4402 inside_init = fold (inside_init);
4404 if (TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
4406 tree decl = COMPOUND_LITERAL_EXPR_DECL (inside_init);
4408 if (TYPE_DOMAIN (TREE_TYPE (decl)))
4410 /* For int foo[] = (int [3]){1}; we need to set array size
4411 now since later on array initializer will be just the
4412 brace enclosed list of the compound literal. */
4413 TYPE_DOMAIN (type) = TYPE_DOMAIN (TREE_TYPE (decl));
4415 layout_decl (decl, 0);
4421 /* Methods for storing and printing names for error messages. */
4423 /* Implement a spelling stack that allows components of a name to be pushed
4424 and popped. Each element on the stack is this structure. */
4436 #define SPELLING_STRING 1
4437 #define SPELLING_MEMBER 2
4438 #define SPELLING_BOUNDS 3
4440 static struct spelling *spelling; /* Next stack element (unused). */
4441 static struct spelling *spelling_base; /* Spelling stack base. */
4442 static int spelling_size; /* Size of the spelling stack. */
4444 /* Macros to save and restore the spelling stack around push_... functions.
4445 Alternative to SAVE_SPELLING_STACK. */
4447 #define SPELLING_DEPTH() (spelling - spelling_base)
4448 #define RESTORE_SPELLING_DEPTH(DEPTH) (spelling = spelling_base + (DEPTH))
4450 /* Push an element on the spelling stack with type KIND and assign VALUE
4453 #define PUSH_SPELLING(KIND, VALUE, MEMBER) \
4455 int depth = SPELLING_DEPTH (); \
4457 if (depth >= spelling_size) \
4459 spelling_size += 10; \
4460 if (spelling_base == 0) \
4462 = (struct spelling *) xmalloc (spelling_size * sizeof (struct spelling)); \
4465 = (struct spelling *) xrealloc (spelling_base, \
4466 spelling_size * sizeof (struct spelling)); \
4467 RESTORE_SPELLING_DEPTH (depth); \
4470 spelling->kind = (KIND); \
4471 spelling->MEMBER = (VALUE); \
4475 /* Push STRING on the stack. Printed literally. */
4478 push_string (string)
4481 PUSH_SPELLING (SPELLING_STRING, string, u.s);
4484 /* Push a member name on the stack. Printed as '.' STRING. */
4487 push_member_name (decl)
4491 const char *const string
4492 = DECL_NAME (decl) ? IDENTIFIER_POINTER (DECL_NAME (decl)) : "<anonymous>";
4493 PUSH_SPELLING (SPELLING_MEMBER, string, u.s);
4496 /* Push an array bounds on the stack. Printed as [BOUNDS]. */
4499 push_array_bounds (bounds)
4502 PUSH_SPELLING (SPELLING_BOUNDS, bounds, u.i);
4505 /* Compute the maximum size in bytes of the printed spelling. */
4513 for (p = spelling_base; p < spelling; p++)
4515 if (p->kind == SPELLING_BOUNDS)
4518 size += strlen (p->u.s) + 1;
4524 /* Print the spelling to BUFFER and return it. */
4527 print_spelling (buffer)
4533 for (p = spelling_base; p < spelling; p++)
4534 if (p->kind == SPELLING_BOUNDS)
4536 sprintf (d, "[%d]", p->u.i);
4542 if (p->kind == SPELLING_MEMBER)
4544 for (s = p->u.s; (*d = *s++); d++)
4551 /* Issue an error message for a bad initializer component.
4552 MSGID identifies the message.
4553 The component name is taken from the spelling stack. */
4561 error ("%s", _(msgid));
4562 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4564 error ("(near initialization for `%s')", ofwhat);
4567 /* Issue a pedantic warning for a bad initializer component.
4568 MSGID identifies the message.
4569 The component name is taken from the spelling stack. */
4572 pedwarn_init (msgid)
4577 pedwarn ("%s", _(msgid));
4578 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4580 pedwarn ("(near initialization for `%s')", ofwhat);
4583 /* Issue a warning for a bad initializer component.
4584 MSGID identifies the message.
4585 The component name is taken from the spelling stack. */
4588 warning_init (msgid)
4593 warning ("%s", _(msgid));
4594 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4596 warning ("(near initialization for `%s')", ofwhat);
4599 /* Digest the parser output INIT as an initializer for type TYPE.
4600 Return a C expression of type TYPE to represent the initial value.
4602 REQUIRE_CONSTANT requests an error if non-constant initializers or
4603 elements are seen. */
4606 digest_init (type, init, require_constant)
4608 int require_constant;
4610 enum tree_code code = TREE_CODE (type);
4611 tree inside_init = init;
4613 if (type == error_mark_node
4614 || init == error_mark_node
4615 || TREE_TYPE (init) == error_mark_node)
4616 return error_mark_node;
4618 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
4619 /* Do not use STRIP_NOPS here. We do not want an enumerator
4620 whose value is 0 to count as a null pointer constant. */
4621 if (TREE_CODE (init) == NON_LVALUE_EXPR)
4622 inside_init = TREE_OPERAND (init, 0);
4624 inside_init = fold (inside_init);
4626 /* Initialization of an array of chars from a string constant
4627 optionally enclosed in braces. */
4629 if (code == ARRAY_TYPE)
4631 tree typ1 = TYPE_MAIN_VARIANT (TREE_TYPE (type));
4632 if ((typ1 == char_type_node
4633 || typ1 == signed_char_type_node
4634 || typ1 == unsigned_char_type_node
4635 || typ1 == unsigned_wchar_type_node
4636 || typ1 == signed_wchar_type_node)
4637 && ((inside_init && TREE_CODE (inside_init) == STRING_CST)))
4639 if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
4640 TYPE_MAIN_VARIANT (type)))
4643 if ((TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (inside_init)))
4645 && TYPE_PRECISION (typ1) == TYPE_PRECISION (char_type_node))
4647 error_init ("char-array initialized from wide string");
4648 return error_mark_node;
4650 if ((TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (inside_init)))
4652 && TYPE_PRECISION (typ1) != TYPE_PRECISION (char_type_node))
4654 error_init ("int-array initialized from non-wide string");
4655 return error_mark_node;
4658 TREE_TYPE (inside_init) = type;
4659 if (TYPE_DOMAIN (type) != 0
4660 && TYPE_SIZE (type) != 0
4661 && TREE_CODE (TYPE_SIZE (type)) == INTEGER_CST
4662 /* Subtract 1 (or sizeof (wchar_t))
4663 because it's ok to ignore the terminating null char
4664 that is counted in the length of the constant. */
4665 && 0 > compare_tree_int (TYPE_SIZE_UNIT (type),
4666 TREE_STRING_LENGTH (inside_init)
4667 - ((TYPE_PRECISION (typ1)
4668 != TYPE_PRECISION (char_type_node))
4669 ? (TYPE_PRECISION (wchar_type_node)
4672 pedwarn_init ("initializer-string for array of chars is too long");
4678 /* Any type can be initialized
4679 from an expression of the same type, optionally with braces. */
4681 if (inside_init && TREE_TYPE (inside_init) != 0
4682 && (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
4683 TYPE_MAIN_VARIANT (type))
4684 || (code == ARRAY_TYPE
4685 && comptypes (TREE_TYPE (inside_init), type))
4686 || (code == VECTOR_TYPE
4687 && comptypes (TREE_TYPE (inside_init), type))
4688 || (code == POINTER_TYPE
4689 && (TREE_CODE (TREE_TYPE (inside_init)) == ARRAY_TYPE
4690 || TREE_CODE (TREE_TYPE (inside_init)) == FUNCTION_TYPE)
4691 && comptypes (TREE_TYPE (TREE_TYPE (inside_init)),
4692 TREE_TYPE (type)))))
4694 if (code == POINTER_TYPE)
4695 inside_init = default_function_array_conversion (inside_init);
4697 if (require_constant && !flag_isoc99
4698 && TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
4700 /* As an extension, allow initializing objects with static storage
4701 duration with compound literals (which are then treated just as
4702 the brace enclosed list they contain). */
4703 tree decl = COMPOUND_LITERAL_EXPR_DECL (inside_init);
4704 inside_init = DECL_INITIAL (decl);
4707 if (code == ARRAY_TYPE && TREE_CODE (inside_init) != STRING_CST
4708 && TREE_CODE (inside_init) != CONSTRUCTOR)
4710 error_init ("array initialized from non-constant array expression");
4711 return error_mark_node;
4714 if (optimize && TREE_CODE (inside_init) == VAR_DECL)
4715 inside_init = decl_constant_value_for_broken_optimization (inside_init);
4717 /* Compound expressions can only occur here if -pedantic or
4718 -pedantic-errors is specified. In the later case, we always want
4719 an error. In the former case, we simply want a warning. */
4720 if (require_constant && pedantic
4721 && TREE_CODE (inside_init) == COMPOUND_EXPR)
4724 = valid_compound_expr_initializer (inside_init,
4725 TREE_TYPE (inside_init));
4726 if (inside_init == error_mark_node)
4727 error_init ("initializer element is not constant");
4729 pedwarn_init ("initializer element is not constant");
4730 if (flag_pedantic_errors)
4731 inside_init = error_mark_node;
4733 else if (require_constant
4734 && (!TREE_CONSTANT (inside_init)
4735 /* This test catches things like `7 / 0' which
4736 result in an expression for which TREE_CONSTANT
4737 is true, but which is not actually something
4738 that is a legal constant. We really should not
4739 be using this function, because it is a part of
4740 the back-end. Instead, the expression should
4741 already have been turned into ERROR_MARK_NODE. */
4742 || !initializer_constant_valid_p (inside_init,
4743 TREE_TYPE (inside_init))))
4745 error_init ("initializer element is not constant");
4746 inside_init = error_mark_node;
4752 /* Handle scalar types, including conversions. */
4754 if (code == INTEGER_TYPE || code == REAL_TYPE || code == POINTER_TYPE
4755 || code == ENUMERAL_TYPE || code == BOOLEAN_TYPE || code == COMPLEX_TYPE)
4757 /* Note that convert_for_assignment calls default_conversion
4758 for arrays and functions. We must not call it in the
4759 case where inside_init is a null pointer constant. */
4761 = convert_for_assignment (type, init, _("initialization"),
4762 NULL_TREE, NULL_TREE, 0);
4764 if (require_constant && ! TREE_CONSTANT (inside_init))
4766 error_init ("initializer element is not constant");
4767 inside_init = error_mark_node;
4769 else if (require_constant
4770 && initializer_constant_valid_p (inside_init, TREE_TYPE (inside_init)) == 0)
4772 error_init ("initializer element is not computable at load time");
4773 inside_init = error_mark_node;
4779 /* Come here only for records and arrays. */
4781 if (COMPLETE_TYPE_P (type) && TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST)
4783 error_init ("variable-sized object may not be initialized");
4784 return error_mark_node;
4787 error_init ("invalid initializer");
4788 return error_mark_node;
4791 /* Handle initializers that use braces. */
4793 /* Type of object we are accumulating a constructor for.
4794 This type is always a RECORD_TYPE, UNION_TYPE or ARRAY_TYPE. */
4795 static tree constructor_type;
4797 /* For a RECORD_TYPE or UNION_TYPE, this is the chain of fields
4799 static tree constructor_fields;
4801 /* For an ARRAY_TYPE, this is the specified index
4802 at which to store the next element we get. */
4803 static tree constructor_index;
4805 /* For an ARRAY_TYPE, this is the maximum index. */
4806 static tree constructor_max_index;
4808 /* For a RECORD_TYPE, this is the first field not yet written out. */
4809 static tree constructor_unfilled_fields;
4811 /* For an ARRAY_TYPE, this is the index of the first element
4812 not yet written out. */
4813 static tree constructor_unfilled_index;
4815 /* In a RECORD_TYPE, the byte index of the next consecutive field.
4816 This is so we can generate gaps between fields, when appropriate. */
4817 static tree constructor_bit_index;
4819 /* If we are saving up the elements rather than allocating them,
4820 this is the list of elements so far (in reverse order,
4821 most recent first). */
4822 static tree constructor_elements;
4824 /* 1 if constructor should be incrementally stored into a constructor chain,
4825 0 if all the elements should be kept in AVL tree. */
4826 static int constructor_incremental;
4828 /* 1 if so far this constructor's elements are all compile-time constants. */
4829 static int constructor_constant;
4831 /* 1 if so far this constructor's elements are all valid address constants. */
4832 static int constructor_simple;
4834 /* 1 if this constructor is erroneous so far. */
4835 static int constructor_erroneous;
4837 /* 1 if have called defer_addressed_constants. */
4838 static int constructor_subconstants_deferred;
4840 /* Structure for managing pending initializer elements, organized as an
4845 struct init_node *left, *right;
4846 struct init_node *parent;
4852 /* Tree of pending elements at this constructor level.
4853 These are elements encountered out of order
4854 which belong at places we haven't reached yet in actually
4856 Will never hold tree nodes across GC runs. */
4857 static struct init_node *constructor_pending_elts;
4859 /* The SPELLING_DEPTH of this constructor. */
4860 static int constructor_depth;
4862 /* 0 if implicitly pushing constructor levels is allowed. */
4863 int constructor_no_implicit = 0; /* 0 for C; 1 for some other languages. */
4865 static int require_constant_value;
4866 static int require_constant_elements;
4868 /* DECL node for which an initializer is being read.
4869 0 means we are reading a constructor expression
4870 such as (struct foo) {...}. */
4871 static tree constructor_decl;
4873 /* start_init saves the ASMSPEC arg here for really_start_incremental_init. */
4874 static const char *constructor_asmspec;
4876 /* Nonzero if this is an initializer for a top-level decl. */
4877 static int constructor_top_level;
4879 /* Nonzero if there were any member designators in this initializer. */
4880 static int constructor_designated;
4882 /* Nesting depth of designator list. */
4883 static int designator_depth;
4885 /* Nonzero if there were diagnosed errors in this designator list. */
4886 static int designator_errorneous;
4889 /* This stack has a level for each implicit or explicit level of
4890 structuring in the initializer, including the outermost one. It
4891 saves the values of most of the variables above. */
4893 struct constructor_range_stack;
4895 struct constructor_stack
4897 struct constructor_stack *next;
4902 tree unfilled_index;
4903 tree unfilled_fields;
4906 struct init_node *pending_elts;
4909 /* If nonzero, this value should replace the entire
4910 constructor at this level. */
4911 tree replacement_value;
4912 struct constructor_range_stack *range_stack;
4922 struct constructor_stack *constructor_stack;
4924 /* This stack represents designators from some range designator up to
4925 the last designator in the list. */
4927 struct constructor_range_stack
4929 struct constructor_range_stack *next, *prev;
4930 struct constructor_stack *stack;
4937 struct constructor_range_stack *constructor_range_stack;
4939 /* This stack records separate initializers that are nested.
4940 Nested initializers can't happen in ANSI C, but GNU C allows them
4941 in cases like { ... (struct foo) { ... } ... }. */
4943 struct initializer_stack
4945 struct initializer_stack *next;
4947 const char *asmspec;
4948 struct constructor_stack *constructor_stack;
4949 struct constructor_range_stack *constructor_range_stack;
4951 struct spelling *spelling;
4952 struct spelling *spelling_base;
4955 char require_constant_value;
4956 char require_constant_elements;
4960 struct initializer_stack *initializer_stack;
4962 /* Prepare to parse and output the initializer for variable DECL. */
4965 start_init (decl, asmspec_tree, top_level)
4971 struct initializer_stack *p
4972 = (struct initializer_stack *) xmalloc (sizeof (struct initializer_stack));
4973 const char *asmspec = 0;
4976 asmspec = TREE_STRING_POINTER (asmspec_tree);
4978 p->decl = constructor_decl;
4979 p->asmspec = constructor_asmspec;
4980 p->require_constant_value = require_constant_value;
4981 p->require_constant_elements = require_constant_elements;
4982 p->constructor_stack = constructor_stack;
4983 p->constructor_range_stack = constructor_range_stack;
4984 p->elements = constructor_elements;
4985 p->spelling = spelling;
4986 p->spelling_base = spelling_base;
4987 p->spelling_size = spelling_size;
4988 p->deferred = constructor_subconstants_deferred;
4989 p->top_level = constructor_top_level;
4990 p->next = initializer_stack;
4991 initializer_stack = p;
4993 constructor_decl = decl;
4994 constructor_asmspec = asmspec;
4995 constructor_subconstants_deferred = 0;
4996 constructor_designated = 0;
4997 constructor_top_level = top_level;
5001 require_constant_value = TREE_STATIC (decl);
5002 require_constant_elements
5003 = ((TREE_STATIC (decl) || (pedantic && !flag_isoc99))
5004 /* For a scalar, you can always use any value to initialize,
5005 even within braces. */
5006 && (TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE
5007 || TREE_CODE (TREE_TYPE (decl)) == RECORD_TYPE
5008 || TREE_CODE (TREE_TYPE (decl)) == UNION_TYPE
5009 || TREE_CODE (TREE_TYPE (decl)) == QUAL_UNION_TYPE));
5010 locus = IDENTIFIER_POINTER (DECL_NAME (decl));
5014 require_constant_value = 0;
5015 require_constant_elements = 0;
5016 locus = "(anonymous)";
5019 constructor_stack = 0;
5020 constructor_range_stack = 0;
5022 missing_braces_mentioned = 0;
5026 RESTORE_SPELLING_DEPTH (0);
5029 push_string (locus);
5035 struct initializer_stack *p = initializer_stack;
5037 /* Output subconstants (string constants, usually)
5038 that were referenced within this initializer and saved up.
5039 Must do this if and only if we called defer_addressed_constants. */
5040 if (constructor_subconstants_deferred)
5041 output_deferred_addressed_constants ();
5043 /* Free the whole constructor stack of this initializer. */
5044 while (constructor_stack)
5046 struct constructor_stack *q = constructor_stack;
5047 constructor_stack = q->next;
5051 if (constructor_range_stack)
5054 /* Pop back to the data of the outer initializer (if any). */
5055 constructor_decl = p->decl;
5056 constructor_asmspec = p->asmspec;
5057 require_constant_value = p->require_constant_value;
5058 require_constant_elements = p->require_constant_elements;
5059 constructor_stack = p->constructor_stack;
5060 constructor_range_stack = p->constructor_range_stack;
5061 constructor_elements = p->elements;
5062 spelling = p->spelling;
5063 spelling_base = p->spelling_base;
5064 spelling_size = p->spelling_size;
5065 constructor_subconstants_deferred = p->deferred;
5066 constructor_top_level = p->top_level;
5067 initializer_stack = p->next;
5071 /* Call here when we see the initializer is surrounded by braces.
5072 This is instead of a call to push_init_level;
5073 it is matched by a call to pop_init_level.
5075 TYPE is the type to initialize, for a constructor expression.
5076 For an initializer for a decl, TYPE is zero. */
5079 really_start_incremental_init (type)
5082 struct constructor_stack *p
5083 = (struct constructor_stack *) xmalloc (sizeof (struct constructor_stack));
5086 type = TREE_TYPE (constructor_decl);
5088 p->type = constructor_type;
5089 p->fields = constructor_fields;
5090 p->index = constructor_index;
5091 p->max_index = constructor_max_index;
5092 p->unfilled_index = constructor_unfilled_index;
5093 p->unfilled_fields = constructor_unfilled_fields;
5094 p->bit_index = constructor_bit_index;
5095 p->elements = constructor_elements;
5096 p->constant = constructor_constant;
5097 p->simple = constructor_simple;
5098 p->erroneous = constructor_erroneous;
5099 p->pending_elts = constructor_pending_elts;
5100 p->depth = constructor_depth;
5101 p->replacement_value = 0;
5105 p->incremental = constructor_incremental;
5106 p->designated = constructor_designated;
5108 constructor_stack = p;
5110 constructor_constant = 1;
5111 constructor_simple = 1;
5112 constructor_depth = SPELLING_DEPTH ();
5113 constructor_elements = 0;
5114 constructor_pending_elts = 0;
5115 constructor_type = type;
5116 constructor_incremental = 1;
5117 constructor_designated = 0;
5118 designator_depth = 0;
5119 designator_errorneous = 0;
5121 if (TREE_CODE (constructor_type) == RECORD_TYPE
5122 || TREE_CODE (constructor_type) == UNION_TYPE)
5124 constructor_fields = TYPE_FIELDS (constructor_type);
5125 /* Skip any nameless bit fields at the beginning. */
5126 while (constructor_fields != 0 && DECL_C_BIT_FIELD (constructor_fields)
5127 && DECL_NAME (constructor_fields) == 0)
5128 constructor_fields = TREE_CHAIN (constructor_fields);
5130 constructor_unfilled_fields = constructor_fields;
5131 constructor_bit_index = bitsize_zero_node;
5133 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5135 if (TYPE_DOMAIN (constructor_type))
5137 constructor_max_index
5138 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type));
5140 /* Detect non-empty initializations of zero-length arrays. */
5141 if (constructor_max_index == NULL_TREE
5142 && TYPE_SIZE (constructor_type))
5143 constructor_max_index = build_int_2 (-1, -1);
5145 /* constructor_max_index needs to be an INTEGER_CST. Attempts
5146 to initialize VLAs will cause an proper error; avoid tree
5147 checking errors as well by setting a safe value. */
5148 if (constructor_max_index
5149 && TREE_CODE (constructor_max_index) != INTEGER_CST)
5150 constructor_max_index = build_int_2 (-1, -1);
5153 = convert (bitsizetype,
5154 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
5157 constructor_index = bitsize_zero_node;
5159 constructor_unfilled_index = constructor_index;
5161 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
5163 /* Vectors are like simple fixed-size arrays. */
5164 constructor_max_index =
5165 build_int_2 (TYPE_VECTOR_SUBPARTS (constructor_type) - 1, 0);
5166 constructor_index = convert (bitsizetype, bitsize_zero_node);
5167 constructor_unfilled_index = constructor_index;
5171 /* Handle the case of int x = {5}; */
5172 constructor_fields = constructor_type;
5173 constructor_unfilled_fields = constructor_type;
5177 /* Push down into a subobject, for initialization.
5178 If this is for an explicit set of braces, IMPLICIT is 0.
5179 If it is because the next element belongs at a lower level,
5180 IMPLICIT is 1 (or 2 if the push is because of designator list). */
5183 push_init_level (implicit)
5186 struct constructor_stack *p;
5187 tree value = NULL_TREE;
5189 /* If we've exhausted any levels that didn't have braces,
5191 while (constructor_stack->implicit)
5193 if ((TREE_CODE (constructor_type) == RECORD_TYPE
5194 || TREE_CODE (constructor_type) == UNION_TYPE)
5195 && constructor_fields == 0)
5196 process_init_element (pop_init_level (1));
5197 else if (TREE_CODE (constructor_type) == ARRAY_TYPE
5198 && tree_int_cst_lt (constructor_max_index, constructor_index))
5199 process_init_element (pop_init_level (1));
5204 /* Unless this is an explicit brace, we need to preserve previous
5208 if ((TREE_CODE (constructor_type) == RECORD_TYPE
5209 || TREE_CODE (constructor_type) == UNION_TYPE)
5210 && constructor_fields)
5211 value = find_init_member (constructor_fields);
5212 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5213 value = find_init_member (constructor_index);
5216 p = (struct constructor_stack *) xmalloc (sizeof (struct constructor_stack));
5217 p->type = constructor_type;
5218 p->fields = constructor_fields;
5219 p->index = constructor_index;
5220 p->max_index = constructor_max_index;
5221 p->unfilled_index = constructor_unfilled_index;
5222 p->unfilled_fields = constructor_unfilled_fields;
5223 p->bit_index = constructor_bit_index;
5224 p->elements = constructor_elements;
5225 p->constant = constructor_constant;
5226 p->simple = constructor_simple;
5227 p->erroneous = constructor_erroneous;
5228 p->pending_elts = constructor_pending_elts;
5229 p->depth = constructor_depth;
5230 p->replacement_value = 0;
5231 p->implicit = implicit;
5233 p->incremental = constructor_incremental;
5234 p->designated = constructor_designated;
5235 p->next = constructor_stack;
5237 constructor_stack = p;
5239 constructor_constant = 1;
5240 constructor_simple = 1;
5241 constructor_depth = SPELLING_DEPTH ();
5242 constructor_elements = 0;
5243 constructor_incremental = 1;
5244 constructor_designated = 0;
5245 constructor_pending_elts = 0;
5248 p->range_stack = constructor_range_stack;
5249 constructor_range_stack = 0;
5250 designator_depth = 0;
5251 designator_errorneous = 0;
5254 /* Don't die if an entire brace-pair level is superfluous
5255 in the containing level. */
5256 if (constructor_type == 0)
5258 else if (TREE_CODE (constructor_type) == RECORD_TYPE
5259 || TREE_CODE (constructor_type) == UNION_TYPE)
5261 /* Don't die if there are extra init elts at the end. */
5262 if (constructor_fields == 0)
5263 constructor_type = 0;
5266 constructor_type = TREE_TYPE (constructor_fields);
5267 push_member_name (constructor_fields);
5268 constructor_depth++;
5271 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5273 constructor_type = TREE_TYPE (constructor_type);
5274 push_array_bounds (tree_low_cst (constructor_index, 0));
5275 constructor_depth++;
5278 if (constructor_type == 0)
5280 error_init ("extra brace group at end of initializer");
5281 constructor_fields = 0;
5282 constructor_unfilled_fields = 0;
5286 if (value && TREE_CODE (value) == CONSTRUCTOR)
5288 constructor_constant = TREE_CONSTANT (value);
5289 constructor_simple = TREE_STATIC (value);
5290 constructor_elements = TREE_OPERAND (value, 1);
5291 if (constructor_elements
5292 && (TREE_CODE (constructor_type) == RECORD_TYPE
5293 || TREE_CODE (constructor_type) == ARRAY_TYPE))
5294 set_nonincremental_init ();
5297 if (implicit == 1 && warn_missing_braces && !missing_braces_mentioned)
5299 missing_braces_mentioned = 1;
5300 warning_init ("missing braces around initializer");
5303 if (TREE_CODE (constructor_type) == RECORD_TYPE
5304 || TREE_CODE (constructor_type) == UNION_TYPE)
5306 constructor_fields = TYPE_FIELDS (constructor_type);
5307 /* Skip any nameless bit fields at the beginning. */
5308 while (constructor_fields != 0 && DECL_C_BIT_FIELD (constructor_fields)
5309 && DECL_NAME (constructor_fields) == 0)
5310 constructor_fields = TREE_CHAIN (constructor_fields);
5312 constructor_unfilled_fields = constructor_fields;
5313 constructor_bit_index = bitsize_zero_node;
5315 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
5317 /* Vectors are like simple fixed-size arrays. */
5318 constructor_max_index =
5319 build_int_2 (TYPE_VECTOR_SUBPARTS (constructor_type) - 1, 0);
5320 constructor_index = convert (bitsizetype, integer_zero_node);
5321 constructor_unfilled_index = constructor_index;
5323 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5325 if (TYPE_DOMAIN (constructor_type))
5327 constructor_max_index
5328 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type));
5330 /* Detect non-empty initializations of zero-length arrays. */
5331 if (constructor_max_index == NULL_TREE
5332 && TYPE_SIZE (constructor_type))
5333 constructor_max_index = build_int_2 (-1, -1);
5335 /* constructor_max_index needs to be an INTEGER_CST. Attempts
5336 to initialize VLAs will cause an proper error; avoid tree
5337 checking errors as well by setting a safe value. */
5338 if (constructor_max_index
5339 && TREE_CODE (constructor_max_index) != INTEGER_CST)
5340 constructor_max_index = build_int_2 (-1, -1);
5343 = convert (bitsizetype,
5344 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
5347 constructor_index = bitsize_zero_node;
5349 constructor_unfilled_index = constructor_index;
5350 if (value && TREE_CODE (value) == STRING_CST)
5352 /* We need to split the char/wchar array into individual
5353 characters, so that we don't have to special case it
5355 set_nonincremental_init_from_string (value);
5360 warning_init ("braces around scalar initializer");
5361 constructor_fields = constructor_type;
5362 constructor_unfilled_fields = constructor_type;
5366 /* At the end of an implicit or explicit brace level,
5367 finish up that level of constructor.
5368 If we were outputting the elements as they are read, return 0
5369 from inner levels (process_init_element ignores that),
5370 but return error_mark_node from the outermost level
5371 (that's what we want to put in DECL_INITIAL).
5372 Otherwise, return a CONSTRUCTOR expression. */
5375 pop_init_level (implicit)
5378 struct constructor_stack *p;
5379 tree constructor = 0;
5383 /* When we come to an explicit close brace,
5384 pop any inner levels that didn't have explicit braces. */
5385 while (constructor_stack->implicit)
5386 process_init_element (pop_init_level (1));
5388 if (constructor_range_stack)
5392 p = constructor_stack;
5394 /* Error for initializing a flexible array member, or a zero-length
5395 array member in an inappropriate context. */
5396 if (constructor_type && constructor_fields
5397 && TREE_CODE (constructor_type) == ARRAY_TYPE
5398 && TYPE_DOMAIN (constructor_type)
5399 && ! TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type)))
5401 /* Silently discard empty initializations. The parser will
5402 already have pedwarned for empty brackets. */
5403 if (integer_zerop (constructor_unfilled_index))
5404 constructor_type = NULL_TREE;
5405 else if (! TYPE_SIZE (constructor_type))
5407 if (constructor_depth > 2)
5408 error_init ("initialization of flexible array member in a nested context");
5410 pedwarn_init ("initialization of a flexible array member");
5412 /* We have already issued an error message for the existence
5413 of a flexible array member not at the end of the structure.
5414 Discard the initializer so that we do not abort later. */
5415 if (TREE_CHAIN (constructor_fields) != NULL_TREE)
5416 constructor_type = NULL_TREE;
5419 /* Zero-length arrays are no longer special, so we should no longer
5424 /* Warn when some struct elements are implicitly initialized to zero. */
5427 && TREE_CODE (constructor_type) == RECORD_TYPE
5428 && constructor_unfilled_fields)
5430 /* Do not warn for flexible array members or zero-length arrays. */
5431 while (constructor_unfilled_fields
5432 && (! DECL_SIZE (constructor_unfilled_fields)
5433 || integer_zerop (DECL_SIZE (constructor_unfilled_fields))))
5434 constructor_unfilled_fields = TREE_CHAIN (constructor_unfilled_fields);
5436 /* Do not warn if this level of the initializer uses member
5437 designators; it is likely to be deliberate. */
5438 if (constructor_unfilled_fields && !constructor_designated)
5440 push_member_name (constructor_unfilled_fields);
5441 warning_init ("missing initializer");
5442 RESTORE_SPELLING_DEPTH (constructor_depth);
5446 /* Now output all pending elements. */
5447 constructor_incremental = 1;
5448 output_pending_init_elements (1);
5450 /* Pad out the end of the structure. */
5451 if (p->replacement_value)
5452 /* If this closes a superfluous brace pair,
5453 just pass out the element between them. */
5454 constructor = p->replacement_value;
5455 else if (constructor_type == 0)
5457 else if (TREE_CODE (constructor_type) != RECORD_TYPE
5458 && TREE_CODE (constructor_type) != UNION_TYPE
5459 && TREE_CODE (constructor_type) != ARRAY_TYPE
5460 && TREE_CODE (constructor_type) != VECTOR_TYPE)
5462 /* A nonincremental scalar initializer--just return
5463 the element, after verifying there is just one. */
5464 if (constructor_elements == 0)
5466 if (!constructor_erroneous)
5467 error_init ("empty scalar initializer");
5468 constructor = error_mark_node;
5470 else if (TREE_CHAIN (constructor_elements) != 0)
5472 error_init ("extra elements in scalar initializer");
5473 constructor = TREE_VALUE (constructor_elements);
5476 constructor = TREE_VALUE (constructor_elements);
5480 if (constructor_erroneous)
5481 constructor = error_mark_node;
5484 constructor = build (CONSTRUCTOR, constructor_type, NULL_TREE,
5485 nreverse (constructor_elements));
5486 if (constructor_constant)
5487 TREE_CONSTANT (constructor) = 1;
5488 if (constructor_constant && constructor_simple)
5489 TREE_STATIC (constructor) = 1;
5493 constructor_type = p->type;
5494 constructor_fields = p->fields;
5495 constructor_index = p->index;
5496 constructor_max_index = p->max_index;
5497 constructor_unfilled_index = p->unfilled_index;
5498 constructor_unfilled_fields = p->unfilled_fields;
5499 constructor_bit_index = p->bit_index;
5500 constructor_elements = p->elements;
5501 constructor_constant = p->constant;
5502 constructor_simple = p->simple;
5503 constructor_erroneous = p->erroneous;
5504 constructor_incremental = p->incremental;
5505 constructor_designated = p->designated;
5506 constructor_pending_elts = p->pending_elts;
5507 constructor_depth = p->depth;
5509 constructor_range_stack = p->range_stack;
5510 RESTORE_SPELLING_DEPTH (constructor_depth);
5512 constructor_stack = p->next;
5515 if (constructor == 0)
5517 if (constructor_stack == 0)
5518 return error_mark_node;
5524 /* Common handling for both array range and field name designators.
5525 ARRAY argument is non-zero for array ranges. Returns zero for success. */
5528 set_designator (array)
5532 enum tree_code subcode;
5534 /* Don't die if an entire brace-pair level is superfluous
5535 in the containing level. */
5536 if (constructor_type == 0)
5539 /* If there were errors in this designator list already, bail out silently. */
5540 if (designator_errorneous)
5543 if (!designator_depth)
5545 if (constructor_range_stack)
5548 /* Designator list starts at the level of closest explicit
5550 while (constructor_stack->implicit)
5551 process_init_element (pop_init_level (1));
5552 constructor_designated = 1;
5556 if (constructor_no_implicit)
5558 error_init ("initialization designators may not nest");
5562 if (TREE_CODE (constructor_type) == RECORD_TYPE
5563 || TREE_CODE (constructor_type) == UNION_TYPE)
5565 subtype = TREE_TYPE (constructor_fields);
5566 if (subtype != error_mark_node)
5567 subtype = TYPE_MAIN_VARIANT (subtype);
5569 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5571 subtype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
5576 subcode = TREE_CODE (subtype);
5577 if (array && subcode != ARRAY_TYPE)
5579 error_init ("array index in non-array initializer");
5582 else if (!array && subcode != RECORD_TYPE && subcode != UNION_TYPE)
5584 error_init ("field name not in record or union initializer");
5588 constructor_designated = 1;
5589 push_init_level (2);
5593 /* If there are range designators in designator list, push a new designator
5594 to constructor_range_stack. RANGE_END is end of such stack range or
5595 NULL_TREE if there is no range designator at this level. */
5598 push_range_stack (range_end)
5601 struct constructor_range_stack *p;
5603 p = (struct constructor_range_stack *)
5604 ggc_alloc (sizeof (struct constructor_range_stack));
5605 p->prev = constructor_range_stack;
5607 p->fields = constructor_fields;
5608 p->range_start = constructor_index;
5609 p->index = constructor_index;
5610 p->stack = constructor_stack;
5611 p->range_end = range_end;
5612 if (constructor_range_stack)
5613 constructor_range_stack->next = p;
5614 constructor_range_stack = p;
5617 /* Within an array initializer, specify the next index to be initialized.
5618 FIRST is that index. If LAST is nonzero, then initialize a range
5619 of indices, running from FIRST through LAST. */
5622 set_init_index (first, last)
5625 if (set_designator (1))
5628 designator_errorneous = 1;
5630 while ((TREE_CODE (first) == NOP_EXPR
5631 || TREE_CODE (first) == CONVERT_EXPR
5632 || TREE_CODE (first) == NON_LVALUE_EXPR)
5633 && (TYPE_MODE (TREE_TYPE (first))
5634 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (first, 0)))))
5635 first = TREE_OPERAND (first, 0);
5638 while ((TREE_CODE (last) == NOP_EXPR
5639 || TREE_CODE (last) == CONVERT_EXPR
5640 || TREE_CODE (last) == NON_LVALUE_EXPR)
5641 && (TYPE_MODE (TREE_TYPE (last))
5642 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (last, 0)))))
5643 last = TREE_OPERAND (last, 0);
5645 if (TREE_CODE (first) != INTEGER_CST)
5646 error_init ("nonconstant array index in initializer");
5647 else if (last != 0 && TREE_CODE (last) != INTEGER_CST)
5648 error_init ("nonconstant array index in initializer");
5649 else if (TREE_CODE (constructor_type) != ARRAY_TYPE)
5650 error_init ("array index in non-array initializer");
5651 else if (constructor_max_index
5652 && tree_int_cst_lt (constructor_max_index, first))
5653 error_init ("array index in initializer exceeds array bounds");
5656 constructor_index = convert (bitsizetype, first);
5660 if (tree_int_cst_equal (first, last))
5662 else if (tree_int_cst_lt (last, first))
5664 error_init ("empty index range in initializer");
5669 last = convert (bitsizetype, last);
5670 if (constructor_max_index != 0
5671 && tree_int_cst_lt (constructor_max_index, last))
5673 error_init ("array index range in initializer exceeds array bounds");
5680 designator_errorneous = 0;
5681 if (constructor_range_stack || last)
5682 push_range_stack (last);
5686 /* Within a struct initializer, specify the next field to be initialized. */
5689 set_init_label (fieldname)
5694 if (set_designator (0))
5697 designator_errorneous = 1;
5699 if (TREE_CODE (constructor_type) != RECORD_TYPE
5700 && TREE_CODE (constructor_type) != UNION_TYPE)
5702 error_init ("field name not in record or union initializer");
5706 for (tail = TYPE_FIELDS (constructor_type); tail;
5707 tail = TREE_CHAIN (tail))
5709 if (DECL_NAME (tail) == fieldname)
5714 error ("unknown field `%s' specified in initializer",
5715 IDENTIFIER_POINTER (fieldname));
5718 constructor_fields = tail;
5720 designator_errorneous = 0;
5721 if (constructor_range_stack)
5722 push_range_stack (NULL_TREE);
5726 /* Add a new initializer to the tree of pending initializers. PURPOSE
5727 identifies the initializer, either array index or field in a structure.
5728 VALUE is the value of that index or field. */
5731 add_pending_init (purpose, value)
5732 tree purpose, value;
5734 struct init_node *p, **q, *r;
5736 q = &constructor_pending_elts;
5739 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5744 if (tree_int_cst_lt (purpose, p->purpose))
5746 else if (tree_int_cst_lt (p->purpose, purpose))
5750 if (TREE_SIDE_EFFECTS (p->value))
5751 warning_init ("initialized field with side-effects overwritten");
5761 bitpos = bit_position (purpose);
5765 if (tree_int_cst_lt (bitpos, bit_position (p->purpose)))
5767 else if (p->purpose != purpose)
5771 if (TREE_SIDE_EFFECTS (p->value))
5772 warning_init ("initialized field with side-effects overwritten");
5779 r = (struct init_node *) ggc_alloc (sizeof (struct init_node));
5780 r->purpose = purpose;
5791 struct init_node *s;
5795 if (p->balance == 0)
5797 else if (p->balance < 0)
5804 p->left->parent = p;
5821 constructor_pending_elts = r;
5826 struct init_node *t = r->right;
5830 r->right->parent = r;
5835 p->left->parent = p;
5838 p->balance = t->balance < 0;
5839 r->balance = -(t->balance > 0);
5854 constructor_pending_elts = t;
5860 /* p->balance == +1; growth of left side balances the node. */
5865 else /* r == p->right */
5867 if (p->balance == 0)
5868 /* Growth propagation from right side. */
5870 else if (p->balance > 0)
5877 p->right->parent = p;
5894 constructor_pending_elts = r;
5896 else /* r->balance == -1 */
5899 struct init_node *t = r->left;
5903 r->left->parent = r;
5908 p->right->parent = p;
5911 r->balance = (t->balance < 0);
5912 p->balance = -(t->balance > 0);
5927 constructor_pending_elts = t;
5933 /* p->balance == -1; growth of right side balances the node. */
5944 /* Build AVL tree from a sorted chain. */
5947 set_nonincremental_init ()
5951 if (TREE_CODE (constructor_type) != RECORD_TYPE
5952 && TREE_CODE (constructor_type) != ARRAY_TYPE)
5955 for (chain = constructor_elements; chain; chain = TREE_CHAIN (chain))
5956 add_pending_init (TREE_PURPOSE (chain), TREE_VALUE (chain));
5957 constructor_elements = 0;
5958 if (TREE_CODE (constructor_type) == RECORD_TYPE)
5960 constructor_unfilled_fields = TYPE_FIELDS (constructor_type);
5961 /* Skip any nameless bit fields at the beginning. */
5962 while (constructor_unfilled_fields != 0
5963 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
5964 && DECL_NAME (constructor_unfilled_fields) == 0)
5965 constructor_unfilled_fields = TREE_CHAIN (constructor_unfilled_fields);
5968 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5970 if (TYPE_DOMAIN (constructor_type))
5971 constructor_unfilled_index
5972 = convert (bitsizetype,
5973 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
5975 constructor_unfilled_index = bitsize_zero_node;
5977 constructor_incremental = 0;
5980 /* Build AVL tree from a string constant. */
5983 set_nonincremental_init_from_string (str)
5986 tree value, purpose, type;
5987 HOST_WIDE_INT val[2];
5988 const char *p, *end;
5989 int byte, wchar_bytes, charwidth, bitpos;
5991 if (TREE_CODE (constructor_type) != ARRAY_TYPE)
5994 if (TYPE_PRECISION (TREE_TYPE (TREE_TYPE (str)))
5995 == TYPE_PRECISION (char_type_node))
5997 else if (TYPE_PRECISION (TREE_TYPE (TREE_TYPE (str)))
5998 == TYPE_PRECISION (wchar_type_node))
5999 wchar_bytes = TYPE_PRECISION (wchar_type_node) / BITS_PER_UNIT;
6003 charwidth = TYPE_PRECISION (char_type_node);
6004 type = TREE_TYPE (constructor_type);
6005 p = TREE_STRING_POINTER (str);
6006 end = p + TREE_STRING_LENGTH (str);
6008 for (purpose = bitsize_zero_node;
6009 p < end && !tree_int_cst_lt (constructor_max_index, purpose);
6010 purpose = size_binop (PLUS_EXPR, purpose, bitsize_one_node))
6012 if (wchar_bytes == 1)
6014 val[1] = (unsigned char) *p++;
6021 for (byte = 0; byte < wchar_bytes; byte++)
6023 if (BYTES_BIG_ENDIAN)
6024 bitpos = (wchar_bytes - byte - 1) * charwidth;
6026 bitpos = byte * charwidth;
6027 val[bitpos < HOST_BITS_PER_WIDE_INT]
6028 |= ((unsigned HOST_WIDE_INT) ((unsigned char) *p++))
6029 << (bitpos % HOST_BITS_PER_WIDE_INT);
6033 if (!TREE_UNSIGNED (type))
6035 bitpos = ((wchar_bytes - 1) * charwidth) + HOST_BITS_PER_CHAR;
6036 if (bitpos < HOST_BITS_PER_WIDE_INT)
6038 if (val[1] & (((HOST_WIDE_INT) 1) << (bitpos - 1)))
6040 val[1] |= ((HOST_WIDE_INT) -1) << bitpos;
6044 else if (bitpos == HOST_BITS_PER_WIDE_INT)
6049 else if (val[0] & (((HOST_WIDE_INT) 1)
6050 << (bitpos - 1 - HOST_BITS_PER_WIDE_INT)))
6051 val[0] |= ((HOST_WIDE_INT) -1)
6052 << (bitpos - HOST_BITS_PER_WIDE_INT);
6055 value = build_int_2 (val[1], val[0]);
6056 TREE_TYPE (value) = type;
6057 add_pending_init (purpose, value);
6060 constructor_incremental = 0;
6063 /* Return value of FIELD in pending initializer or zero if the field was
6064 not initialized yet. */
6067 find_init_member (field)
6070 struct init_node *p;
6072 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6074 if (constructor_incremental
6075 && tree_int_cst_lt (field, constructor_unfilled_index))
6076 set_nonincremental_init ();
6078 p = constructor_pending_elts;
6081 if (tree_int_cst_lt (field, p->purpose))
6083 else if (tree_int_cst_lt (p->purpose, field))
6089 else if (TREE_CODE (constructor_type) == RECORD_TYPE)
6091 tree bitpos = bit_position (field);
6093 if (constructor_incremental
6094 && (!constructor_unfilled_fields
6095 || tree_int_cst_lt (bitpos,
6096 bit_position (constructor_unfilled_fields))))
6097 set_nonincremental_init ();
6099 p = constructor_pending_elts;
6102 if (field == p->purpose)
6104 else if (tree_int_cst_lt (bitpos, bit_position (p->purpose)))
6110 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6112 if (constructor_elements
6113 && TREE_PURPOSE (constructor_elements) == field)
6114 return TREE_VALUE (constructor_elements);
6119 /* "Output" the next constructor element.
6120 At top level, really output it to assembler code now.
6121 Otherwise, collect it in a list from which we will make a CONSTRUCTOR.
6122 TYPE is the data type that the containing data type wants here.
6123 FIELD is the field (a FIELD_DECL) or the index that this element fills.
6125 PENDING if non-nil means output pending elements that belong
6126 right after this element. (PENDING is normally 1;
6127 it is 0 while outputting pending elements, to avoid recursion.) */
6130 output_init_element (value, type, field, pending)
6131 tree value, type, field;
6134 if (TREE_CODE (TREE_TYPE (value)) == FUNCTION_TYPE
6135 || (TREE_CODE (TREE_TYPE (value)) == ARRAY_TYPE
6136 && !(TREE_CODE (value) == STRING_CST
6137 && TREE_CODE (type) == ARRAY_TYPE
6138 && TREE_CODE (TREE_TYPE (type)) == INTEGER_TYPE)
6139 && !comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (value)),
6140 TYPE_MAIN_VARIANT (type))))
6141 value = default_conversion (value);
6143 if (TREE_CODE (value) == COMPOUND_LITERAL_EXPR
6144 && require_constant_value && !flag_isoc99 && pending)
6146 /* As an extension, allow initializing objects with static storage
6147 duration with compound literals (which are then treated just as
6148 the brace enclosed list they contain). */
6149 tree decl = COMPOUND_LITERAL_EXPR_DECL (value);
6150 value = DECL_INITIAL (decl);
6153 if (value == error_mark_node)
6154 constructor_erroneous = 1;
6155 else if (!TREE_CONSTANT (value))
6156 constructor_constant = 0;
6157 else if (initializer_constant_valid_p (value, TREE_TYPE (value)) == 0
6158 || ((TREE_CODE (constructor_type) == RECORD_TYPE
6159 || TREE_CODE (constructor_type) == UNION_TYPE)
6160 && DECL_C_BIT_FIELD (field)
6161 && TREE_CODE (value) != INTEGER_CST))
6162 constructor_simple = 0;
6164 if (require_constant_value && ! TREE_CONSTANT (value))
6166 error_init ("initializer element is not constant");
6167 value = error_mark_node;
6169 else if (require_constant_elements
6170 && initializer_constant_valid_p (value, TREE_TYPE (value)) == 0)
6171 pedwarn ("initializer element is not computable at load time");
6173 /* If this field is empty (and not at the end of structure),
6174 don't do anything other than checking the initializer. */
6176 && (TREE_TYPE (field) == error_mark_node
6177 || (COMPLETE_TYPE_P (TREE_TYPE (field))
6178 && integer_zerop (TYPE_SIZE (TREE_TYPE (field)))
6179 && (TREE_CODE (constructor_type) == ARRAY_TYPE
6180 || TREE_CHAIN (field)))))
6183 value = digest_init (type, value, require_constant_value);
6184 if (value == error_mark_node)
6186 constructor_erroneous = 1;
6190 /* If this element doesn't come next in sequence,
6191 put it on constructor_pending_elts. */
6192 if (TREE_CODE (constructor_type) == ARRAY_TYPE
6193 && (!constructor_incremental
6194 || !tree_int_cst_equal (field, constructor_unfilled_index)))
6196 if (constructor_incremental
6197 && tree_int_cst_lt (field, constructor_unfilled_index))
6198 set_nonincremental_init ();
6200 add_pending_init (field, value);
6203 else if (TREE_CODE (constructor_type) == RECORD_TYPE
6204 && (!constructor_incremental
6205 || field != constructor_unfilled_fields))
6207 /* We do this for records but not for unions. In a union,
6208 no matter which field is specified, it can be initialized
6209 right away since it starts at the beginning of the union. */
6210 if (constructor_incremental)
6212 if (!constructor_unfilled_fields)
6213 set_nonincremental_init ();
6216 tree bitpos, unfillpos;
6218 bitpos = bit_position (field);
6219 unfillpos = bit_position (constructor_unfilled_fields);
6221 if (tree_int_cst_lt (bitpos, unfillpos))
6222 set_nonincremental_init ();
6226 add_pending_init (field, value);
6229 else if (TREE_CODE (constructor_type) == UNION_TYPE
6230 && constructor_elements)
6232 if (TREE_SIDE_EFFECTS (TREE_VALUE (constructor_elements)))
6233 warning_init ("initialized field with side-effects overwritten");
6235 /* We can have just one union field set. */
6236 constructor_elements = 0;
6239 /* Otherwise, output this element either to
6240 constructor_elements or to the assembler file. */
6242 if (field && TREE_CODE (field) == INTEGER_CST)
6243 field = copy_node (field);
6244 constructor_elements
6245 = tree_cons (field, value, constructor_elements);
6247 /* Advance the variable that indicates sequential elements output. */
6248 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6249 constructor_unfilled_index
6250 = size_binop (PLUS_EXPR, constructor_unfilled_index,
6252 else if (TREE_CODE (constructor_type) == RECORD_TYPE)
6254 constructor_unfilled_fields
6255 = TREE_CHAIN (constructor_unfilled_fields);
6257 /* Skip any nameless bit fields. */
6258 while (constructor_unfilled_fields != 0
6259 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
6260 && DECL_NAME (constructor_unfilled_fields) == 0)
6261 constructor_unfilled_fields =
6262 TREE_CHAIN (constructor_unfilled_fields);
6264 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6265 constructor_unfilled_fields = 0;
6267 /* Now output any pending elements which have become next. */
6269 output_pending_init_elements (0);
6272 /* Output any pending elements which have become next.
6273 As we output elements, constructor_unfilled_{fields,index}
6274 advances, which may cause other elements to become next;
6275 if so, they too are output.
6277 If ALL is 0, we return when there are
6278 no more pending elements to output now.
6280 If ALL is 1, we output space as necessary so that
6281 we can output all the pending elements. */
6284 output_pending_init_elements (all)
6287 struct init_node *elt = constructor_pending_elts;
6292 /* Look thru the whole pending tree.
6293 If we find an element that should be output now,
6294 output it. Otherwise, set NEXT to the element
6295 that comes first among those still pending. */
6300 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6302 if (tree_int_cst_equal (elt->purpose,
6303 constructor_unfilled_index))
6304 output_init_element (elt->value,
6305 TREE_TYPE (constructor_type),
6306 constructor_unfilled_index, 0);
6307 else if (tree_int_cst_lt (constructor_unfilled_index,
6310 /* Advance to the next smaller node. */
6315 /* We have reached the smallest node bigger than the
6316 current unfilled index. Fill the space first. */
6317 next = elt->purpose;
6323 /* Advance to the next bigger node. */
6328 /* We have reached the biggest node in a subtree. Find
6329 the parent of it, which is the next bigger node. */
6330 while (elt->parent && elt->parent->right == elt)
6333 if (elt && tree_int_cst_lt (constructor_unfilled_index,
6336 next = elt->purpose;
6342 else if (TREE_CODE (constructor_type) == RECORD_TYPE
6343 || TREE_CODE (constructor_type) == UNION_TYPE)
6345 tree ctor_unfilled_bitpos, elt_bitpos;
6347 /* If the current record is complete we are done. */
6348 if (constructor_unfilled_fields == 0)
6351 ctor_unfilled_bitpos = bit_position (constructor_unfilled_fields);
6352 elt_bitpos = bit_position (elt->purpose);
6353 /* We can't compare fields here because there might be empty
6354 fields in between. */
6355 if (tree_int_cst_equal (elt_bitpos, ctor_unfilled_bitpos))
6357 constructor_unfilled_fields = elt->purpose;
6358 output_init_element (elt->value, TREE_TYPE (elt->purpose),
6361 else if (tree_int_cst_lt (ctor_unfilled_bitpos, elt_bitpos))
6363 /* Advance to the next smaller node. */
6368 /* We have reached the smallest node bigger than the
6369 current unfilled field. Fill the space first. */
6370 next = elt->purpose;
6376 /* Advance to the next bigger node. */
6381 /* We have reached the biggest node in a subtree. Find
6382 the parent of it, which is the next bigger node. */
6383 while (elt->parent && elt->parent->right == elt)
6387 && (tree_int_cst_lt (ctor_unfilled_bitpos,
6388 bit_position (elt->purpose))))
6390 next = elt->purpose;
6398 /* Ordinarily return, but not if we want to output all
6399 and there are elements left. */
6400 if (! (all && next != 0))
6403 /* If it's not incremental, just skip over the gap, so that after
6404 jumping to retry we will output the next successive element. */
6405 if (TREE_CODE (constructor_type) == RECORD_TYPE
6406 || TREE_CODE (constructor_type) == UNION_TYPE)
6407 constructor_unfilled_fields = next;
6408 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6409 constructor_unfilled_index = next;
6411 /* ELT now points to the node in the pending tree with the next
6412 initializer to output. */
6416 /* Add one non-braced element to the current constructor level.
6417 This adjusts the current position within the constructor's type.
6418 This may also start or terminate implicit levels
6419 to handle a partly-braced initializer.
6421 Once this has found the correct level for the new element,
6422 it calls output_init_element. */
6425 process_init_element (value)
6428 tree orig_value = value;
6429 int string_flag = value != 0 && TREE_CODE (value) == STRING_CST;
6431 designator_depth = 0;
6432 designator_errorneous = 0;
6434 /* Handle superfluous braces around string cst as in
6435 char x[] = {"foo"}; */
6438 && TREE_CODE (constructor_type) == ARRAY_TYPE
6439 && TREE_CODE (TREE_TYPE (constructor_type)) == INTEGER_TYPE
6440 && integer_zerop (constructor_unfilled_index))
6442 if (constructor_stack->replacement_value)
6443 error_init ("excess elements in char array initializer");
6444 constructor_stack->replacement_value = value;
6448 if (constructor_stack->replacement_value != 0)
6450 error_init ("excess elements in struct initializer");
6454 /* Ignore elements of a brace group if it is entirely superfluous
6455 and has already been diagnosed. */
6456 if (constructor_type == 0)
6459 /* If we've exhausted any levels that didn't have braces,
6461 while (constructor_stack->implicit)
6463 if ((TREE_CODE (constructor_type) == RECORD_TYPE
6464 || TREE_CODE (constructor_type) == UNION_TYPE)
6465 && constructor_fields == 0)
6466 process_init_element (pop_init_level (1));
6467 else if (TREE_CODE (constructor_type) == ARRAY_TYPE
6468 && (constructor_max_index == 0
6469 || tree_int_cst_lt (constructor_max_index,
6470 constructor_index)))
6471 process_init_element (pop_init_level (1));
6476 /* In the case of [LO ... HI] = VALUE, only evaluate VALUE once. */
6477 if (constructor_range_stack)
6479 /* If value is a compound literal and we'll be just using its
6480 content, don't put it into a SAVE_EXPR. */
6481 if (TREE_CODE (value) != COMPOUND_LITERAL_EXPR
6482 || !require_constant_value
6484 value = save_expr (value);
6489 if (TREE_CODE (constructor_type) == RECORD_TYPE)
6492 enum tree_code fieldcode;
6494 if (constructor_fields == 0)
6496 pedwarn_init ("excess elements in struct initializer");
6500 fieldtype = TREE_TYPE (constructor_fields);
6501 if (fieldtype != error_mark_node)
6502 fieldtype = TYPE_MAIN_VARIANT (fieldtype);
6503 fieldcode = TREE_CODE (fieldtype);
6505 /* Error for non-static initialization of a flexible array member. */
6506 if (fieldcode == ARRAY_TYPE
6507 && !require_constant_value
6508 && TYPE_SIZE (fieldtype) == NULL_TREE
6509 && TREE_CHAIN (constructor_fields) == NULL_TREE)
6511 error_init ("non-static initialization of a flexible array member");
6515 /* Accept a string constant to initialize a subarray. */
6517 && fieldcode == ARRAY_TYPE
6518 && TREE_CODE (TREE_TYPE (fieldtype)) == INTEGER_TYPE
6521 /* Otherwise, if we have come to a subaggregate,
6522 and we don't have an element of its type, push into it. */
6523 else if (value != 0 && !constructor_no_implicit
6524 && value != error_mark_node
6525 && TYPE_MAIN_VARIANT (TREE_TYPE (value)) != fieldtype
6526 && (fieldcode == RECORD_TYPE || fieldcode == ARRAY_TYPE
6527 || fieldcode == UNION_TYPE))
6529 push_init_level (1);
6535 push_member_name (constructor_fields);
6536 output_init_element (value, fieldtype, constructor_fields, 1);
6537 RESTORE_SPELLING_DEPTH (constructor_depth);
6540 /* Do the bookkeeping for an element that was
6541 directly output as a constructor. */
6543 /* For a record, keep track of end position of last field. */
6544 if (DECL_SIZE (constructor_fields))
6545 constructor_bit_index
6546 = size_binop (PLUS_EXPR,
6547 bit_position (constructor_fields),
6548 DECL_SIZE (constructor_fields));
6550 constructor_unfilled_fields = TREE_CHAIN (constructor_fields);
6551 /* Skip any nameless bit fields. */
6552 while (constructor_unfilled_fields != 0
6553 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
6554 && DECL_NAME (constructor_unfilled_fields) == 0)
6555 constructor_unfilled_fields =
6556 TREE_CHAIN (constructor_unfilled_fields);
6559 constructor_fields = TREE_CHAIN (constructor_fields);
6560 /* Skip any nameless bit fields at the beginning. */
6561 while (constructor_fields != 0
6562 && DECL_C_BIT_FIELD (constructor_fields)
6563 && DECL_NAME (constructor_fields) == 0)
6564 constructor_fields = TREE_CHAIN (constructor_fields);
6566 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6569 enum tree_code fieldcode;
6571 if (constructor_fields == 0)
6573 pedwarn_init ("excess elements in union initializer");
6577 fieldtype = TREE_TYPE (constructor_fields);
6578 if (fieldtype != error_mark_node)
6579 fieldtype = TYPE_MAIN_VARIANT (fieldtype);
6580 fieldcode = TREE_CODE (fieldtype);
6582 /* Warn that traditional C rejects initialization of unions.
6583 We skip the warning if the value is zero. This is done
6584 under the assumption that the zero initializer in user
6585 code appears conditioned on e.g. __STDC__ to avoid
6586 "missing initializer" warnings and relies on default
6587 initialization to zero in the traditional C case.
6588 We also skip the warning if the initializer is designated,
6589 again on the assumption that this must be conditional on
6590 __STDC__ anyway (and we've already complained about the
6591 member-designator already). */
6592 if (warn_traditional && !in_system_header && !constructor_designated
6593 && !(value && (integer_zerop (value) || real_zerop (value))))
6594 warning ("traditional C rejects initialization of unions");
6596 /* Accept a string constant to initialize a subarray. */
6598 && fieldcode == ARRAY_TYPE
6599 && TREE_CODE (TREE_TYPE (fieldtype)) == INTEGER_TYPE
6602 /* Otherwise, if we have come to a subaggregate,
6603 and we don't have an element of its type, push into it. */
6604 else if (value != 0 && !constructor_no_implicit
6605 && value != error_mark_node
6606 && TYPE_MAIN_VARIANT (TREE_TYPE (value)) != fieldtype
6607 && (fieldcode == RECORD_TYPE || fieldcode == ARRAY_TYPE
6608 || fieldcode == UNION_TYPE))
6610 push_init_level (1);
6616 push_member_name (constructor_fields);
6617 output_init_element (value, fieldtype, constructor_fields, 1);
6618 RESTORE_SPELLING_DEPTH (constructor_depth);
6621 /* Do the bookkeeping for an element that was
6622 directly output as a constructor. */
6624 constructor_bit_index = DECL_SIZE (constructor_fields);
6625 constructor_unfilled_fields = TREE_CHAIN (constructor_fields);
6628 constructor_fields = 0;
6630 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6632 tree elttype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
6633 enum tree_code eltcode = TREE_CODE (elttype);
6635 /* Accept a string constant to initialize a subarray. */
6637 && eltcode == ARRAY_TYPE
6638 && TREE_CODE (TREE_TYPE (elttype)) == INTEGER_TYPE
6641 /* Otherwise, if we have come to a subaggregate,
6642 and we don't have an element of its type, push into it. */
6643 else if (value != 0 && !constructor_no_implicit
6644 && value != error_mark_node
6645 && TYPE_MAIN_VARIANT (TREE_TYPE (value)) != elttype
6646 && (eltcode == RECORD_TYPE || eltcode == ARRAY_TYPE
6647 || eltcode == UNION_TYPE))
6649 push_init_level (1);
6653 if (constructor_max_index != 0
6654 && (tree_int_cst_lt (constructor_max_index, constructor_index)
6655 || integer_all_onesp (constructor_max_index)))
6657 pedwarn_init ("excess elements in array initializer");
6661 /* Now output the actual element. */
6664 push_array_bounds (tree_low_cst (constructor_index, 0));
6665 output_init_element (value, elttype, constructor_index, 1);
6666 RESTORE_SPELLING_DEPTH (constructor_depth);
6670 = size_binop (PLUS_EXPR, constructor_index, bitsize_one_node);
6673 /* If we are doing the bookkeeping for an element that was
6674 directly output as a constructor, we must update
6675 constructor_unfilled_index. */
6676 constructor_unfilled_index = constructor_index;
6678 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
6680 tree elttype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
6682 /* Do a basic check of initializer size. Note that vectors
6683 always have a fixed size derived from their type. */
6684 if (tree_int_cst_lt (constructor_max_index, constructor_index))
6686 pedwarn_init ("excess elements in vector initializer");
6690 /* Now output the actual element. */
6692 output_init_element (value, elttype, constructor_index, 1);
6695 = size_binop (PLUS_EXPR, constructor_index, bitsize_one_node);
6698 /* If we are doing the bookkeeping for an element that was
6699 directly output as a constructor, we must update
6700 constructor_unfilled_index. */
6701 constructor_unfilled_index = constructor_index;
6704 /* Handle the sole element allowed in a braced initializer
6705 for a scalar variable. */
6706 else if (constructor_fields == 0)
6708 pedwarn_init ("excess elements in scalar initializer");
6714 output_init_element (value, constructor_type, NULL_TREE, 1);
6715 constructor_fields = 0;
6718 /* Handle range initializers either at this level or anywhere higher
6719 in the designator stack. */
6720 if (constructor_range_stack)
6722 struct constructor_range_stack *p, *range_stack;
6725 range_stack = constructor_range_stack;
6726 constructor_range_stack = 0;
6727 while (constructor_stack != range_stack->stack)
6729 if (!constructor_stack->implicit)
6731 process_init_element (pop_init_level (1));
6733 for (p = range_stack;
6734 !p->range_end || tree_int_cst_equal (p->index, p->range_end);
6737 if (!constructor_stack->implicit)
6739 process_init_element (pop_init_level (1));
6742 p->index = size_binop (PLUS_EXPR, p->index, bitsize_one_node);
6743 if (tree_int_cst_equal (p->index, p->range_end) && !p->prev)
6748 constructor_index = p->index;
6749 constructor_fields = p->fields;
6750 if (finish && p->range_end && p->index == p->range_start)
6758 push_init_level (2);
6759 p->stack = constructor_stack;
6760 if (p->range_end && tree_int_cst_equal (p->index, p->range_end))
6761 p->index = p->range_start;
6765 constructor_range_stack = range_stack;
6772 constructor_range_stack = 0;
6775 /* Build a simple asm-statement, from one string literal. */
6777 simple_asm_stmt (expr)
6782 if (TREE_CODE (expr) == ADDR_EXPR)
6783 expr = TREE_OPERAND (expr, 0);
6785 if (TREE_CODE (expr) == STRING_CST)
6789 stmt = add_stmt (build_stmt (ASM_STMT, NULL_TREE, expr,
6790 NULL_TREE, NULL_TREE,
6792 ASM_INPUT_P (stmt) = 1;
6796 error ("argument of `asm' is not a constant string");
6800 /* Build an asm-statement, whose components are a CV_QUALIFIER, a
6801 STRING, some OUTPUTS, some INPUTS, and some CLOBBERS. */
6804 build_asm_stmt (cv_qualifier, string, outputs, inputs, clobbers)
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);