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, 2003, 2004 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. */
30 #include "coretypes.h"
34 #include "langhooks.h"
44 #include "tree-iterator.h"
45 #include "tree-gimple.h"
48 /* Nonzero if we've already printed a "missing braces around initializer"
49 message within this initializer. */
50 static int missing_braces_mentioned;
52 static int require_constant_value;
53 static int require_constant_elements;
55 static tree qualify_type (tree, tree);
56 static int tagged_types_tu_compatible_p (tree, tree);
57 static int comp_target_types (tree, tree, int);
58 static int function_types_compatible_p (tree, tree);
59 static int type_lists_compatible_p (tree, tree);
60 static tree decl_constant_value_for_broken_optimization (tree);
61 static tree default_function_array_conversion (tree);
62 static tree lookup_field (tree, tree);
63 static tree convert_arguments (tree, tree, tree, tree);
64 static tree pointer_diff (tree, tree);
65 static tree internal_build_compound_expr (tree, int);
66 static tree convert_for_assignment (tree, tree, const char *, tree, tree,
68 static void warn_for_assignment (const char *, const char *, tree, int);
69 static tree valid_compound_expr_initializer (tree, tree);
70 static void push_string (const char *);
71 static void push_member_name (tree);
72 static void push_array_bounds (int);
73 static int spelling_length (void);
74 static char *print_spelling (char *);
75 static void warning_init (const char *);
76 static tree digest_init (tree, tree, int);
77 static void output_init_element (tree, tree, tree, int);
78 static void output_pending_init_elements (int);
79 static int set_designator (int);
80 static void push_range_stack (tree);
81 static void add_pending_init (tree, tree);
82 static void set_nonincremental_init (void);
83 static void set_nonincremental_init_from_string (tree);
84 static tree find_init_member (tree);
85 static int lvalue_or_else (tree, const char *);
87 /* Do `exp = require_complete_type (exp);' to make sure exp
88 does not have an incomplete type. (That includes void types.) */
91 require_complete_type (tree 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 (tree value, tree type)
113 const char *type_code_string;
115 /* Avoid duplicate error message. */
116 if (TREE_CODE (type) == ERROR_MARK)
119 if (value != 0 && (TREE_CODE (value) == VAR_DECL
120 || TREE_CODE (value) == PARM_DECL))
121 error ("`%s' has an incomplete type",
122 IDENTIFIER_POINTER (DECL_NAME (value)));
126 /* We must print an error message. Be clever about what it says. */
128 switch (TREE_CODE (type))
131 type_code_string = "struct";
135 type_code_string = "union";
139 type_code_string = "enum";
143 error ("invalid use of void expression");
147 if (TYPE_DOMAIN (type))
149 if (TYPE_MAX_VALUE (TYPE_DOMAIN (type)) == NULL)
151 error ("invalid use of flexible array member");
154 type = TREE_TYPE (type);
157 error ("invalid use of array with unspecified bounds");
164 if (TREE_CODE (TYPE_NAME (type)) == IDENTIFIER_NODE)
165 error ("invalid use of undefined type `%s %s'",
166 type_code_string, IDENTIFIER_POINTER (TYPE_NAME (type)));
168 /* If this type has a typedef-name, the TYPE_NAME is a TYPE_DECL. */
169 error ("invalid use of incomplete typedef `%s'",
170 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type))));
174 /* Given a type, apply default promotions wrt unnamed function
175 arguments and return the new type. */
178 c_type_promotes_to (tree type)
180 if (TYPE_MAIN_VARIANT (type) == float_type_node)
181 return double_type_node;
183 if (c_promoting_integer_type_p (type))
185 /* Preserve unsignedness if not really getting any wider. */
186 if (TYPE_UNSIGNED (type)
187 && (TYPE_PRECISION (type) == TYPE_PRECISION (integer_type_node)))
188 return unsigned_type_node;
189 return integer_type_node;
195 /* Return a variant of TYPE which has all the type qualifiers of LIKE
196 as well as those of TYPE. */
199 qualify_type (tree type, tree like)
201 return c_build_qualified_type (type,
202 TYPE_QUALS (type) | TYPE_QUALS (like));
205 /* Return the composite type of two compatible types.
207 We assume that comptypes has already been done and returned
208 nonzero; if that isn't so, this may crash. In particular, we
209 assume that qualifiers match. */
212 composite_type (tree t1, tree t2)
214 enum tree_code code1;
215 enum tree_code code2;
218 /* Save time if the two types are the same. */
220 if (t1 == t2) return t1;
222 /* If one type is nonsense, use the other. */
223 if (t1 == error_mark_node)
225 if (t2 == error_mark_node)
228 code1 = TREE_CODE (t1);
229 code2 = TREE_CODE (t2);
231 /* Merge the attributes. */
232 attributes = targetm.merge_type_attributes (t1, t2);
234 /* If one is an enumerated type and the other is the compatible
235 integer type, the composite type might be either of the two
236 (DR#013 question 3). For consistency, use the enumerated type as
237 the composite type. */
239 if (code1 == ENUMERAL_TYPE && code2 == INTEGER_TYPE)
241 if (code2 == ENUMERAL_TYPE && code1 == INTEGER_TYPE)
250 /* For two pointers, do this recursively on the target type. */
252 tree pointed_to_1 = TREE_TYPE (t1);
253 tree pointed_to_2 = TREE_TYPE (t2);
254 tree target = composite_type (pointed_to_1, pointed_to_2);
255 t1 = build_pointer_type (target);
256 t1 = build_type_attribute_variant (t1, attributes);
257 return qualify_type (t1, t2);
262 tree elt = composite_type (TREE_TYPE (t1), TREE_TYPE (t2));
264 /* We should not have any type quals on arrays at all. */
265 if (TYPE_QUALS (t1) || TYPE_QUALS (t2))
268 /* Save space: see if the result is identical to one of the args. */
269 if (elt == TREE_TYPE (t1) && TYPE_DOMAIN (t1))
270 return build_type_attribute_variant (t1, attributes);
271 if (elt == TREE_TYPE (t2) && TYPE_DOMAIN (t2))
272 return build_type_attribute_variant (t2, attributes);
274 if (elt == TREE_TYPE (t1) && !TYPE_DOMAIN (t2) && !TYPE_DOMAIN (t1))
275 return build_type_attribute_variant (t1, attributes);
276 if (elt == TREE_TYPE (t2) && !TYPE_DOMAIN (t2) && !TYPE_DOMAIN (t1))
277 return build_type_attribute_variant (t2, attributes);
279 /* Merge the element types, and have a size if either arg has one. */
280 t1 = build_array_type (elt, TYPE_DOMAIN (TYPE_DOMAIN (t1) ? t1 : t2));
281 return build_type_attribute_variant (t1, attributes);
285 /* Function types: prefer the one that specified arg types.
286 If both do, merge the arg types. Also merge the return types. */
288 tree valtype = composite_type (TREE_TYPE (t1), TREE_TYPE (t2));
289 tree p1 = TYPE_ARG_TYPES (t1);
290 tree p2 = TYPE_ARG_TYPES (t2);
295 /* Save space: see if the result is identical to one of the args. */
296 if (valtype == TREE_TYPE (t1) && ! TYPE_ARG_TYPES (t2))
297 return build_type_attribute_variant (t1, attributes);
298 if (valtype == TREE_TYPE (t2) && ! TYPE_ARG_TYPES (t1))
299 return build_type_attribute_variant (t2, attributes);
301 /* Simple way if one arg fails to specify argument types. */
302 if (TYPE_ARG_TYPES (t1) == 0)
304 t1 = build_function_type (valtype, TYPE_ARG_TYPES (t2));
305 t1 = build_type_attribute_variant (t1, attributes);
306 return qualify_type (t1, t2);
308 if (TYPE_ARG_TYPES (t2) == 0)
310 t1 = build_function_type (valtype, TYPE_ARG_TYPES (t1));
311 t1 = build_type_attribute_variant (t1, attributes);
312 return qualify_type (t1, t2);
315 /* If both args specify argument types, we must merge the two
316 lists, argument by argument. */
317 /* Tell global_bindings_p to return false so that variable_size
318 doesn't abort on VLAs in parameter types. */
319 c_override_global_bindings_to_false = true;
321 len = list_length (p1);
324 for (i = 0; i < len; i++)
325 newargs = tree_cons (NULL_TREE, NULL_TREE, newargs);
330 p1 = TREE_CHAIN (p1), p2 = TREE_CHAIN (p2), n = TREE_CHAIN (n))
332 /* A null type means arg type is not specified.
333 Take whatever the other function type has. */
334 if (TREE_VALUE (p1) == 0)
336 TREE_VALUE (n) = TREE_VALUE (p2);
339 if (TREE_VALUE (p2) == 0)
341 TREE_VALUE (n) = TREE_VALUE (p1);
345 /* Given wait (union {union wait *u; int *i} *)
346 and wait (union wait *),
347 prefer union wait * as type of parm. */
348 if (TREE_CODE (TREE_VALUE (p1)) == UNION_TYPE
349 && TREE_VALUE (p1) != TREE_VALUE (p2))
352 for (memb = TYPE_FIELDS (TREE_VALUE (p1));
353 memb; memb = TREE_CHAIN (memb))
354 if (comptypes (TREE_TYPE (memb), TREE_VALUE (p2)))
356 TREE_VALUE (n) = TREE_VALUE (p2);
358 pedwarn ("function types not truly compatible in ISO C");
362 if (TREE_CODE (TREE_VALUE (p2)) == UNION_TYPE
363 && TREE_VALUE (p2) != TREE_VALUE (p1))
366 for (memb = TYPE_FIELDS (TREE_VALUE (p2));
367 memb; memb = TREE_CHAIN (memb))
368 if (comptypes (TREE_TYPE (memb), TREE_VALUE (p1)))
370 TREE_VALUE (n) = TREE_VALUE (p1);
372 pedwarn ("function types not truly compatible in ISO C");
376 TREE_VALUE (n) = composite_type (TREE_VALUE (p1), TREE_VALUE (p2));
380 c_override_global_bindings_to_false = false;
381 t1 = build_function_type (valtype, newargs);
382 t1 = qualify_type (t1, t2);
383 /* ... falls through ... */
387 return build_type_attribute_variant (t1, attributes);
392 /* Return the type of a conditional expression between pointers to
393 possibly differently qualified versions of compatible types.
395 We assume that comp_target_types has already been done and returned
396 nonzero; if that isn't so, this may crash. */
399 common_pointer_type (tree t1, tree t2)
406 /* Save time if the two types are the same. */
408 if (t1 == t2) return t1;
410 /* If one type is nonsense, use the other. */
411 if (t1 == error_mark_node)
413 if (t2 == error_mark_node)
416 if (TREE_CODE (t1) != POINTER_TYPE || TREE_CODE (t2) != POINTER_TYPE)
419 /* Merge the attributes. */
420 attributes = targetm.merge_type_attributes (t1, t2);
422 /* Find the composite type of the target types, and combine the
423 qualifiers of the two types' targets. */
424 pointed_to_1 = TREE_TYPE (t1);
425 pointed_to_2 = TREE_TYPE (t2);
426 target = composite_type (TYPE_MAIN_VARIANT (pointed_to_1),
427 TYPE_MAIN_VARIANT (pointed_to_2));
428 t1 = build_pointer_type (c_build_qualified_type
430 TYPE_QUALS (pointed_to_1) |
431 TYPE_QUALS (pointed_to_2)));
432 return build_type_attribute_variant (t1, attributes);
435 /* Return the common type for two arithmetic types under the usual
436 arithmetic conversions. The default conversions have already been
437 applied, and enumerated types converted to their compatible integer
438 types. The resulting type is unqualified and has no attributes.
440 This is the type for the result of most arithmetic operations
441 if the operands have the given two types. */
444 common_type (tree t1, tree t2)
446 enum tree_code code1;
447 enum tree_code code2;
449 /* If one type is nonsense, use the other. */
450 if (t1 == error_mark_node)
452 if (t2 == error_mark_node)
455 if (TYPE_QUALS (t1) != TYPE_UNQUALIFIED)
456 t1 = TYPE_MAIN_VARIANT (t1);
458 if (TYPE_QUALS (t2) != TYPE_UNQUALIFIED)
459 t2 = TYPE_MAIN_VARIANT (t2);
461 if (TYPE_ATTRIBUTES (t1) != NULL_TREE)
462 t1 = build_type_attribute_variant (t1, NULL_TREE);
464 if (TYPE_ATTRIBUTES (t2) != NULL_TREE)
465 t2 = build_type_attribute_variant (t2, NULL_TREE);
467 /* Save time if the two types are the same. */
469 if (t1 == t2) return t1;
471 code1 = TREE_CODE (t1);
472 code2 = TREE_CODE (t2);
474 if (code1 != VECTOR_TYPE && code1 != COMPLEX_TYPE
475 && code1 != REAL_TYPE && code1 != INTEGER_TYPE)
478 if (code2 != VECTOR_TYPE && code2 != COMPLEX_TYPE
479 && code2 != REAL_TYPE && code2 != INTEGER_TYPE)
482 /* If one type is a vector type, return that type. (How the usual
483 arithmetic conversions apply to the vector types extension is not
484 precisely specified.) */
485 if (code1 == VECTOR_TYPE)
488 if (code2 == VECTOR_TYPE)
491 /* If one type is complex, form the common type of the non-complex
492 components, then make that complex. Use T1 or T2 if it is the
494 if (code1 == COMPLEX_TYPE || code2 == COMPLEX_TYPE)
496 tree subtype1 = code1 == COMPLEX_TYPE ? TREE_TYPE (t1) : t1;
497 tree subtype2 = code2 == COMPLEX_TYPE ? TREE_TYPE (t2) : t2;
498 tree subtype = common_type (subtype1, subtype2);
500 if (code1 == COMPLEX_TYPE && TREE_TYPE (t1) == subtype)
502 else if (code2 == COMPLEX_TYPE && TREE_TYPE (t2) == subtype)
505 return build_complex_type (subtype);
508 /* If only one is real, use it as the result. */
510 if (code1 == REAL_TYPE && code2 != REAL_TYPE)
513 if (code2 == REAL_TYPE && code1 != REAL_TYPE)
516 /* Both real or both integers; use the one with greater precision. */
518 if (TYPE_PRECISION (t1) > TYPE_PRECISION (t2))
520 else if (TYPE_PRECISION (t2) > TYPE_PRECISION (t1))
523 /* Same precision. Prefer long longs to longs to ints when the
524 same precision, following the C99 rules on integer type rank
525 (which are equivalent to the C90 rules for C90 types). */
527 if (TYPE_MAIN_VARIANT (t1) == long_long_unsigned_type_node
528 || TYPE_MAIN_VARIANT (t2) == long_long_unsigned_type_node)
529 return long_long_unsigned_type_node;
531 if (TYPE_MAIN_VARIANT (t1) == long_long_integer_type_node
532 || TYPE_MAIN_VARIANT (t2) == long_long_integer_type_node)
534 if (TYPE_UNSIGNED (t1) || TYPE_UNSIGNED (t2))
535 return long_long_unsigned_type_node;
537 return long_long_integer_type_node;
540 if (TYPE_MAIN_VARIANT (t1) == long_unsigned_type_node
541 || TYPE_MAIN_VARIANT (t2) == long_unsigned_type_node)
542 return long_unsigned_type_node;
544 if (TYPE_MAIN_VARIANT (t1) == long_integer_type_node
545 || TYPE_MAIN_VARIANT (t2) == long_integer_type_node)
547 /* But preserve unsignedness from the other type,
548 since long cannot hold all the values of an unsigned int. */
549 if (TYPE_UNSIGNED (t1) || TYPE_UNSIGNED (t2))
550 return long_unsigned_type_node;
552 return long_integer_type_node;
555 /* Likewise, prefer long double to double even if same size. */
556 if (TYPE_MAIN_VARIANT (t1) == long_double_type_node
557 || TYPE_MAIN_VARIANT (t2) == long_double_type_node)
558 return long_double_type_node;
560 /* Otherwise prefer the unsigned one. */
562 if (TYPE_UNSIGNED (t1))
568 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
569 or various other operations. Return 2 if they are compatible
570 but a warning may be needed if you use them together. */
573 comptypes (tree type1, tree type2)
579 /* Suppress errors caused by previously reported errors. */
581 if (t1 == t2 || !t1 || !t2
582 || TREE_CODE (t1) == ERROR_MARK || TREE_CODE (t2) == ERROR_MARK)
585 /* If either type is the internal version of sizetype, return the
587 if (TREE_CODE (t1) == INTEGER_TYPE && TYPE_IS_SIZETYPE (t1)
588 && TYPE_ORIG_SIZE_TYPE (t1))
589 t1 = TYPE_ORIG_SIZE_TYPE (t1);
591 if (TREE_CODE (t2) == INTEGER_TYPE && TYPE_IS_SIZETYPE (t2)
592 && TYPE_ORIG_SIZE_TYPE (t2))
593 t2 = TYPE_ORIG_SIZE_TYPE (t2);
596 /* Enumerated types are compatible with integer types, but this is
597 not transitive: two enumerated types in the same translation unit
598 are compatible with each other only if they are the same type. */
600 if (TREE_CODE (t1) == ENUMERAL_TYPE && TREE_CODE (t2) != ENUMERAL_TYPE)
601 t1 = c_common_type_for_size (TYPE_PRECISION (t1), TYPE_UNSIGNED (t1));
602 else if (TREE_CODE (t2) == ENUMERAL_TYPE && TREE_CODE (t1) != ENUMERAL_TYPE)
603 t2 = c_common_type_for_size (TYPE_PRECISION (t2), TYPE_UNSIGNED (t2));
608 /* Different classes of types can't be compatible. */
610 if (TREE_CODE (t1) != TREE_CODE (t2))
613 /* Qualifiers must match. C99 6.7.3p9 */
615 if (TYPE_QUALS (t1) != TYPE_QUALS (t2))
618 /* Allow for two different type nodes which have essentially the same
619 definition. Note that we already checked for equality of the type
620 qualifiers (just above). */
622 if (TYPE_MAIN_VARIANT (t1) == TYPE_MAIN_VARIANT (t2))
625 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
626 if (! (attrval = targetm.comp_type_attributes (t1, t2)))
629 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
632 switch (TREE_CODE (t1))
635 /* We must give ObjC the first crack at comparing pointers, since
636 protocol qualifiers may be involved. */
637 if (c_dialect_objc () && (val = objc_comptypes (t1, t2, 0)) >= 0)
639 val = (TREE_TYPE (t1) == TREE_TYPE (t2)
640 ? 1 : comptypes (TREE_TYPE (t1), TREE_TYPE (t2)));
644 val = function_types_compatible_p (t1, t2);
649 tree d1 = TYPE_DOMAIN (t1);
650 tree d2 = TYPE_DOMAIN (t2);
651 bool d1_variable, d2_variable;
652 bool d1_zero, d2_zero;
655 /* Target types must match incl. qualifiers. */
656 if (TREE_TYPE (t1) != TREE_TYPE (t2)
657 && 0 == (val = comptypes (TREE_TYPE (t1), TREE_TYPE (t2))))
660 /* Sizes must match unless one is missing or variable. */
661 if (d1 == 0 || d2 == 0 || d1 == d2)
664 d1_zero = ! TYPE_MAX_VALUE (d1);
665 d2_zero = ! TYPE_MAX_VALUE (d2);
667 d1_variable = (! d1_zero
668 && (TREE_CODE (TYPE_MIN_VALUE (d1)) != INTEGER_CST
669 || TREE_CODE (TYPE_MAX_VALUE (d1)) != INTEGER_CST));
670 d2_variable = (! d2_zero
671 && (TREE_CODE (TYPE_MIN_VALUE (d2)) != INTEGER_CST
672 || TREE_CODE (TYPE_MAX_VALUE (d2)) != INTEGER_CST));
674 if (d1_variable || d2_variable)
676 if (d1_zero && d2_zero)
678 if (d1_zero || d2_zero
679 || ! tree_int_cst_equal (TYPE_MIN_VALUE (d1), TYPE_MIN_VALUE (d2))
680 || ! tree_int_cst_equal (TYPE_MAX_VALUE (d1), TYPE_MAX_VALUE (d2)))
687 /* We are dealing with two distinct structs. In assorted Objective-C
688 corner cases, however, these can still be deemed equivalent. */
689 if (c_dialect_objc () && objc_comptypes (t1, t2, 0) == 1)
694 if (val != 1 && !same_translation_unit_p (t1, t2))
695 val = tagged_types_tu_compatible_p (t1, t2);
699 val = TYPE_VECTOR_SUBPARTS (t1) == TYPE_VECTOR_SUBPARTS (t2)
700 && comptypes (TREE_TYPE (t1), TREE_TYPE (t2));
706 return attrval == 2 && val == 1 ? 2 : val;
709 /* Return 1 if TTL and TTR are pointers to types that are equivalent,
710 ignoring their qualifiers. REFLEXIVE is only used by ObjC - set it
711 to 1 or 0 depending if the check of the pointer types is meant to
712 be reflexive or not (typically, assignments are not reflexive,
713 while comparisons are reflexive).
717 comp_target_types (tree ttl, tree ttr, int reflexive)
721 /* Give objc_comptypes a crack at letting these types through. */
722 if ((val = objc_comptypes (ttl, ttr, reflexive)) >= 0)
725 val = comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (ttl)),
726 TYPE_MAIN_VARIANT (TREE_TYPE (ttr)));
728 if (val == 2 && pedantic)
729 pedwarn ("types are not quite compatible");
733 /* Subroutines of `comptypes'. */
735 /* Determine whether two trees derive from the same translation unit.
736 If the CONTEXT chain ends in a null, that tree's context is still
737 being parsed, so if two trees have context chains ending in null,
738 they're in the same translation unit. */
740 same_translation_unit_p (tree t1, tree t2)
742 while (t1 && TREE_CODE (t1) != TRANSLATION_UNIT_DECL)
743 switch (TREE_CODE_CLASS (TREE_CODE (t1)))
745 case 'd': t1 = DECL_CONTEXT (t1); break;
746 case 't': t1 = TYPE_CONTEXT (t1); break;
747 case 'x': t1 = BLOCK_SUPERCONTEXT (t1); break; /* assume block */
751 while (t2 && TREE_CODE (t2) != TRANSLATION_UNIT_DECL)
752 switch (TREE_CODE_CLASS (TREE_CODE (t2)))
754 case 'd': t2 = DECL_CONTEXT (t2); break;
755 case 't': t2 = TYPE_CONTEXT (t2); break;
756 case 'x': t2 = BLOCK_SUPERCONTEXT (t2); break; /* assume block */
763 /* The C standard says that two structures in different translation
764 units are compatible with each other only if the types of their
765 fields are compatible (among other things). So, consider two copies
766 of this structure: */
768 struct tagged_tu_seen {
769 const struct tagged_tu_seen * next;
774 /* Can they be compatible with each other? We choose to break the
775 recursion by allowing those types to be compatible. */
777 static const struct tagged_tu_seen * tagged_tu_seen_base;
779 /* Return 1 if two 'struct', 'union', or 'enum' types T1 and T2 are
780 compatible. If the two types are not the same (which has been
781 checked earlier), this can only happen when multiple translation
782 units are being compiled. See C99 6.2.7 paragraph 1 for the exact
786 tagged_types_tu_compatible_p (tree t1, tree t2)
789 bool needs_warning = false;
791 /* We have to verify that the tags of the types are the same. This
792 is harder than it looks because this may be a typedef, so we have
793 to go look at the original type. It may even be a typedef of a
795 In the case of compiler-created builtin structs the TYPE_DECL
796 may be a dummy, with no DECL_ORIGINAL_TYPE. Don't fault. */
797 while (TYPE_NAME (t1)
798 && TREE_CODE (TYPE_NAME (t1)) == TYPE_DECL
799 && DECL_ORIGINAL_TYPE (TYPE_NAME (t1)))
800 t1 = DECL_ORIGINAL_TYPE (TYPE_NAME (t1));
802 while (TYPE_NAME (t2)
803 && TREE_CODE (TYPE_NAME (t2)) == TYPE_DECL
804 && DECL_ORIGINAL_TYPE (TYPE_NAME (t2)))
805 t2 = DECL_ORIGINAL_TYPE (TYPE_NAME (t2));
807 /* C90 didn't have the requirement that the two tags be the same. */
808 if (flag_isoc99 && TYPE_NAME (t1) != TYPE_NAME (t2))
811 /* C90 didn't say what happened if one or both of the types were
812 incomplete; we choose to follow C99 rules here, which is that they
814 if (TYPE_SIZE (t1) == NULL
815 || TYPE_SIZE (t2) == NULL)
819 const struct tagged_tu_seen * tts_i;
820 for (tts_i = tagged_tu_seen_base; tts_i != NULL; tts_i = tts_i->next)
821 if (tts_i->t1 == t1 && tts_i->t2 == t2)
825 switch (TREE_CODE (t1))
830 /* Speed up the case where the type values are in the same order. */
831 tree tv1 = TYPE_VALUES (t1);
832 tree tv2 = TYPE_VALUES (t2);
837 for (;tv1 && tv2; tv1 = TREE_CHAIN (tv1), tv2 = TREE_CHAIN (tv2))
839 if (TREE_PURPOSE (tv1) != TREE_PURPOSE (tv2))
841 if (simple_cst_equal (TREE_VALUE (tv1), TREE_VALUE (tv2)) != 1)
845 if (tv1 == NULL_TREE && tv2 == NULL_TREE)
847 if (tv1 == NULL_TREE || tv2 == NULL_TREE)
850 if (list_length (TYPE_VALUES (t1)) != list_length (TYPE_VALUES (t2)))
853 for (s1 = TYPE_VALUES (t1); s1; s1 = TREE_CHAIN (s1))
855 s2 = purpose_member (TREE_PURPOSE (s1), TYPE_VALUES (t2));
857 || simple_cst_equal (TREE_VALUE (s1), TREE_VALUE (s2)) != 1)
865 if (list_length (TYPE_FIELDS (t1)) != list_length (TYPE_FIELDS (t2)))
868 for (s1 = TYPE_FIELDS (t1); s1; s1 = TREE_CHAIN (s1))
871 struct tagged_tu_seen tts;
873 tts.next = tagged_tu_seen_base;
876 tagged_tu_seen_base = &tts;
878 if (DECL_NAME (s1) != NULL)
879 for (s2 = TYPE_FIELDS (t2); s2; s2 = TREE_CHAIN (s2))
880 if (DECL_NAME (s1) == DECL_NAME (s2))
883 result = comptypes (TREE_TYPE (s1), TREE_TYPE (s2));
887 needs_warning = true;
889 if (TREE_CODE (s1) == FIELD_DECL
890 && simple_cst_equal (DECL_FIELD_BIT_OFFSET (s1),
891 DECL_FIELD_BIT_OFFSET (s2)) != 1)
897 tagged_tu_seen_base = tts.next;
901 return needs_warning ? 2 : 1;
906 struct tagged_tu_seen tts;
908 tts.next = tagged_tu_seen_base;
911 tagged_tu_seen_base = &tts;
913 for (s1 = TYPE_FIELDS (t1), s2 = TYPE_FIELDS (t2);
915 s1 = TREE_CHAIN (s1), s2 = TREE_CHAIN (s2))
918 if (TREE_CODE (s1) != TREE_CODE (s2)
919 || DECL_NAME (s1) != DECL_NAME (s2))
921 result = comptypes (TREE_TYPE (s1), TREE_TYPE (s2));
925 needs_warning = true;
927 if (TREE_CODE (s1) == FIELD_DECL
928 && simple_cst_equal (DECL_FIELD_BIT_OFFSET (s1),
929 DECL_FIELD_BIT_OFFSET (s2)) != 1)
932 tagged_tu_seen_base = tts.next;
935 return needs_warning ? 2 : 1;
943 /* Return 1 if two function types F1 and F2 are compatible.
944 If either type specifies no argument types,
945 the other must specify a fixed number of self-promoting arg types.
946 Otherwise, if one type specifies only the number of arguments,
947 the other must specify that number of self-promoting arg types.
948 Otherwise, the argument types must match. */
951 function_types_compatible_p (tree f1, tree f2)
954 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
959 ret1 = TREE_TYPE (f1);
960 ret2 = TREE_TYPE (f2);
962 /* 'volatile' qualifiers on a function's return type mean the function
964 if (pedantic && TYPE_VOLATILE (ret1) != TYPE_VOLATILE (ret2))
965 pedwarn ("function return types not compatible due to `volatile'");
966 if (TYPE_VOLATILE (ret1))
967 ret1 = build_qualified_type (TYPE_MAIN_VARIANT (ret1),
968 TYPE_QUALS (ret1) & ~TYPE_QUAL_VOLATILE);
969 if (TYPE_VOLATILE (ret2))
970 ret2 = build_qualified_type (TYPE_MAIN_VARIANT (ret2),
971 TYPE_QUALS (ret2) & ~TYPE_QUAL_VOLATILE);
972 val = comptypes (ret1, ret2);
976 args1 = TYPE_ARG_TYPES (f1);
977 args2 = TYPE_ARG_TYPES (f2);
979 /* An unspecified parmlist matches any specified parmlist
980 whose argument types don't need default promotions. */
984 if (!self_promoting_args_p (args2))
986 /* If one of these types comes from a non-prototype fn definition,
987 compare that with the other type's arglist.
988 If they don't match, ask for a warning (but no error). */
989 if (TYPE_ACTUAL_ARG_TYPES (f1)
990 && 1 != type_lists_compatible_p (args2, TYPE_ACTUAL_ARG_TYPES (f1)))
996 if (!self_promoting_args_p (args1))
998 if (TYPE_ACTUAL_ARG_TYPES (f2)
999 && 1 != type_lists_compatible_p (args1, TYPE_ACTUAL_ARG_TYPES (f2)))
1004 /* Both types have argument lists: compare them and propagate results. */
1005 val1 = type_lists_compatible_p (args1, args2);
1006 return val1 != 1 ? val1 : val;
1009 /* Check two lists of types for compatibility,
1010 returning 0 for incompatible, 1 for compatible,
1011 or 2 for compatible with warning. */
1014 type_lists_compatible_p (tree args1, tree args2)
1016 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1022 if (args1 == 0 && args2 == 0)
1024 /* If one list is shorter than the other,
1025 they fail to match. */
1026 if (args1 == 0 || args2 == 0)
1028 /* A null pointer instead of a type
1029 means there is supposed to be an argument
1030 but nothing is specified about what type it has.
1031 So match anything that self-promotes. */
1032 if (TREE_VALUE (args1) == 0)
1034 if (c_type_promotes_to (TREE_VALUE (args2)) != TREE_VALUE (args2))
1037 else if (TREE_VALUE (args2) == 0)
1039 if (c_type_promotes_to (TREE_VALUE (args1)) != TREE_VALUE (args1))
1042 /* If one of the lists has an error marker, ignore this arg. */
1043 else if (TREE_CODE (TREE_VALUE (args1)) == ERROR_MARK
1044 || TREE_CODE (TREE_VALUE (args2)) == ERROR_MARK)
1046 else if (! (newval = comptypes (TYPE_MAIN_VARIANT (TREE_VALUE (args1)),
1047 TYPE_MAIN_VARIANT (TREE_VALUE (args2)))))
1049 /* Allow wait (union {union wait *u; int *i} *)
1050 and wait (union wait *) to be compatible. */
1051 if (TREE_CODE (TREE_VALUE (args1)) == UNION_TYPE
1052 && (TYPE_NAME (TREE_VALUE (args1)) == 0
1053 || TYPE_TRANSPARENT_UNION (TREE_VALUE (args1)))
1054 && TREE_CODE (TYPE_SIZE (TREE_VALUE (args1))) == INTEGER_CST
1055 && tree_int_cst_equal (TYPE_SIZE (TREE_VALUE (args1)),
1056 TYPE_SIZE (TREE_VALUE (args2))))
1059 for (memb = TYPE_FIELDS (TREE_VALUE (args1));
1060 memb; memb = TREE_CHAIN (memb))
1061 if (comptypes (TREE_TYPE (memb), TREE_VALUE (args2)))
1066 else if (TREE_CODE (TREE_VALUE (args2)) == UNION_TYPE
1067 && (TYPE_NAME (TREE_VALUE (args2)) == 0
1068 || TYPE_TRANSPARENT_UNION (TREE_VALUE (args2)))
1069 && TREE_CODE (TYPE_SIZE (TREE_VALUE (args2))) == INTEGER_CST
1070 && tree_int_cst_equal (TYPE_SIZE (TREE_VALUE (args2)),
1071 TYPE_SIZE (TREE_VALUE (args1))))
1074 for (memb = TYPE_FIELDS (TREE_VALUE (args2));
1075 memb; memb = TREE_CHAIN (memb))
1076 if (comptypes (TREE_TYPE (memb), TREE_VALUE (args1)))
1085 /* comptypes said ok, but record if it said to warn. */
1089 args1 = TREE_CHAIN (args1);
1090 args2 = TREE_CHAIN (args2);
1094 /* Compute the size to increment a pointer by. */
1097 c_size_in_bytes (tree type)
1099 enum tree_code code = TREE_CODE (type);
1101 if (code == FUNCTION_TYPE || code == VOID_TYPE || code == ERROR_MARK)
1102 return size_one_node;
1104 if (!COMPLETE_OR_VOID_TYPE_P (type))
1106 error ("arithmetic on pointer to an incomplete type");
1107 return size_one_node;
1110 /* Convert in case a char is more than one unit. */
1111 return size_binop (CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type),
1112 size_int (TYPE_PRECISION (char_type_node)
1116 /* Return either DECL or its known constant value (if it has one). */
1119 decl_constant_value (tree decl)
1121 if (/* Don't change a variable array bound or initial value to a constant
1122 in a place where a variable is invalid. Note that DECL_INITIAL
1123 isn't valid for a PARM_DECL. */
1124 current_function_decl != 0
1125 && TREE_CODE (decl) != PARM_DECL
1126 && ! TREE_THIS_VOLATILE (decl)
1127 && TREE_READONLY (decl)
1128 && DECL_INITIAL (decl) != 0
1129 && TREE_CODE (DECL_INITIAL (decl)) != ERROR_MARK
1130 /* This is invalid if initial value is not constant.
1131 If it has either a function call, a memory reference,
1132 or a variable, then re-evaluating it could give different results. */
1133 && TREE_CONSTANT (DECL_INITIAL (decl))
1134 /* Check for cases where this is sub-optimal, even though valid. */
1135 && TREE_CODE (DECL_INITIAL (decl)) != CONSTRUCTOR)
1136 return DECL_INITIAL (decl);
1140 /* Return either DECL or its known constant value (if it has one), but
1141 return DECL if pedantic or DECL has mode BLKmode. This is for
1142 bug-compatibility with the old behavior of decl_constant_value
1143 (before GCC 3.0); every use of this function is a bug and it should
1144 be removed before GCC 3.1. It is not appropriate to use pedantic
1145 in a way that affects optimization, and BLKmode is probably not the
1146 right test for avoiding misoptimizations either. */
1149 decl_constant_value_for_broken_optimization (tree decl)
1151 if (pedantic || DECL_MODE (decl) == BLKmode)
1154 return decl_constant_value (decl);
1158 /* Perform the default conversion of arrays and functions to pointers.
1159 Return the result of converting EXP. For any other expression, just
1163 default_function_array_conversion (tree exp)
1166 tree type = TREE_TYPE (exp);
1167 enum tree_code code = TREE_CODE (type);
1170 /* Strip NON_LVALUE_EXPRs and no-op conversions, since we aren't using as
1173 Do not use STRIP_NOPS here! It will remove conversions from pointer
1174 to integer and cause infinite recursion. */
1176 while (TREE_CODE (exp) == NON_LVALUE_EXPR
1177 || (TREE_CODE (exp) == NOP_EXPR
1178 && TREE_TYPE (TREE_OPERAND (exp, 0)) == TREE_TYPE (exp)))
1180 if (TREE_CODE (exp) == NON_LVALUE_EXPR)
1182 exp = TREE_OPERAND (exp, 0);
1185 /* Preserve the original expression code. */
1186 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (exp))))
1187 C_SET_EXP_ORIGINAL_CODE (exp, C_EXP_ORIGINAL_CODE (orig_exp));
1189 if (code == FUNCTION_TYPE)
1191 return build_unary_op (ADDR_EXPR, exp, 0);
1193 if (code == ARRAY_TYPE)
1196 tree restype = TREE_TYPE (type);
1202 if (TREE_CODE_CLASS (TREE_CODE (exp)) == 'r' || DECL_P (exp))
1204 constp = TREE_READONLY (exp);
1205 volatilep = TREE_THIS_VOLATILE (exp);
1208 if (TYPE_QUALS (type) || constp || volatilep)
1210 = c_build_qualified_type (restype,
1212 | (constp * TYPE_QUAL_CONST)
1213 | (volatilep * TYPE_QUAL_VOLATILE));
1215 if (TREE_CODE (exp) == INDIRECT_REF)
1216 return convert (build_pointer_type (restype),
1217 TREE_OPERAND (exp, 0));
1219 if (TREE_CODE (exp) == COMPOUND_EXPR)
1221 tree op1 = default_conversion (TREE_OPERAND (exp, 1));
1222 return build (COMPOUND_EXPR, TREE_TYPE (op1),
1223 TREE_OPERAND (exp, 0), op1);
1226 lvalue_array_p = !not_lvalue && lvalue_p (exp);
1227 if (!flag_isoc99 && !lvalue_array_p)
1229 /* Before C99, non-lvalue arrays do not decay to pointers.
1230 Normally, using such an array would be invalid; but it can
1231 be used correctly inside sizeof or as a statement expression.
1232 Thus, do not give an error here; an error will result later. */
1236 ptrtype = build_pointer_type (restype);
1238 if (TREE_CODE (exp) == VAR_DECL)
1240 /* We are making an ADDR_EXPR of ptrtype. This is a valid
1241 ADDR_EXPR because it's the best way of representing what
1242 happens in C when we take the address of an array and place
1243 it in a pointer to the element type. */
1244 adr = build1 (ADDR_EXPR, ptrtype, exp);
1245 if (!c_mark_addressable (exp))
1246 return error_mark_node;
1247 TREE_SIDE_EFFECTS (adr) = 0; /* Default would be, same as EXP. */
1250 /* This way is better for a COMPONENT_REF since it can
1251 simplify the offset for a component. */
1252 adr = build_unary_op (ADDR_EXPR, exp, 1);
1253 return convert (ptrtype, adr);
1258 /* Perform default promotions for C data used in expressions.
1259 Arrays and functions are converted to pointers;
1260 enumeral types or short or char, to int.
1261 In addition, manifest constants symbols are replaced by their values. */
1264 default_conversion (tree exp)
1267 tree type = TREE_TYPE (exp);
1268 enum tree_code code = TREE_CODE (type);
1270 if (code == FUNCTION_TYPE || code == ARRAY_TYPE)
1271 return default_function_array_conversion (exp);
1273 /* Constants can be used directly unless they're not loadable. */
1274 if (TREE_CODE (exp) == CONST_DECL)
1275 exp = DECL_INITIAL (exp);
1277 /* Replace a nonvolatile const static variable with its value unless
1278 it is an array, in which case we must be sure that taking the
1279 address of the array produces consistent results. */
1280 else if (optimize && TREE_CODE (exp) == VAR_DECL && code != ARRAY_TYPE)
1282 exp = decl_constant_value_for_broken_optimization (exp);
1283 type = TREE_TYPE (exp);
1286 /* Strip NON_LVALUE_EXPRs and no-op conversions, since we aren't using as
1289 Do not use STRIP_NOPS here! It will remove conversions from pointer
1290 to integer and cause infinite recursion. */
1292 while (TREE_CODE (exp) == NON_LVALUE_EXPR
1293 || (TREE_CODE (exp) == NOP_EXPR
1294 && TREE_TYPE (TREE_OPERAND (exp, 0)) == TREE_TYPE (exp)))
1295 exp = TREE_OPERAND (exp, 0);
1297 /* Preserve the original expression code. */
1298 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (exp))))
1299 C_SET_EXP_ORIGINAL_CODE (exp, C_EXP_ORIGINAL_CODE (orig_exp));
1301 /* Normally convert enums to int,
1302 but convert wide enums to something wider. */
1303 if (code == ENUMERAL_TYPE)
1305 type = c_common_type_for_size (MAX (TYPE_PRECISION (type),
1306 TYPE_PRECISION (integer_type_node)),
1307 ((TYPE_PRECISION (type)
1308 >= TYPE_PRECISION (integer_type_node))
1309 && TYPE_UNSIGNED (type)));
1311 return convert (type, exp);
1314 if (TREE_CODE (exp) == COMPONENT_REF
1315 && DECL_C_BIT_FIELD (TREE_OPERAND (exp, 1))
1316 /* If it's thinner than an int, promote it like a
1317 c_promoting_integer_type_p, otherwise leave it alone. */
1318 && 0 > compare_tree_int (DECL_SIZE (TREE_OPERAND (exp, 1)),
1319 TYPE_PRECISION (integer_type_node)))
1320 return convert (integer_type_node, exp);
1322 if (c_promoting_integer_type_p (type))
1324 /* Preserve unsignedness if not really getting any wider. */
1325 if (TYPE_UNSIGNED (type)
1326 && TYPE_PRECISION (type) == TYPE_PRECISION (integer_type_node))
1327 return convert (unsigned_type_node, exp);
1329 return convert (integer_type_node, exp);
1332 if (code == VOID_TYPE)
1334 error ("void value not ignored as it ought to be");
1335 return error_mark_node;
1340 /* Look up COMPONENT in a structure or union DECL.
1342 If the component name is not found, returns NULL_TREE. Otherwise,
1343 the return value is a TREE_LIST, with each TREE_VALUE a FIELD_DECL
1344 stepping down the chain to the component, which is in the last
1345 TREE_VALUE of the list. Normally the list is of length one, but if
1346 the component is embedded within (nested) anonymous structures or
1347 unions, the list steps down the chain to the component. */
1350 lookup_field (tree decl, tree component)
1352 tree type = TREE_TYPE (decl);
1355 /* If TYPE_LANG_SPECIFIC is set, then it is a sorted array of pointers
1356 to the field elements. Use a binary search on this array to quickly
1357 find the element. Otherwise, do a linear search. TYPE_LANG_SPECIFIC
1358 will always be set for structures which have many elements. */
1360 if (TYPE_LANG_SPECIFIC (type))
1363 tree *field_array = &TYPE_LANG_SPECIFIC (type)->s->elts[0];
1365 field = TYPE_FIELDS (type);
1367 top = TYPE_LANG_SPECIFIC (type)->s->len;
1368 while (top - bot > 1)
1370 half = (top - bot + 1) >> 1;
1371 field = field_array[bot+half];
1373 if (DECL_NAME (field) == NULL_TREE)
1375 /* Step through all anon unions in linear fashion. */
1376 while (DECL_NAME (field_array[bot]) == NULL_TREE)
1378 field = field_array[bot++];
1379 if (TREE_CODE (TREE_TYPE (field)) == RECORD_TYPE
1380 || TREE_CODE (TREE_TYPE (field)) == UNION_TYPE)
1382 tree anon = lookup_field (field, component);
1385 return tree_cons (NULL_TREE, field, anon);
1389 /* Entire record is only anon unions. */
1393 /* Restart the binary search, with new lower bound. */
1397 if (DECL_NAME (field) == component)
1399 if (DECL_NAME (field) < component)
1405 if (DECL_NAME (field_array[bot]) == component)
1406 field = field_array[bot];
1407 else if (DECL_NAME (field) != component)
1412 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
1414 if (DECL_NAME (field) == NULL_TREE
1415 && (TREE_CODE (TREE_TYPE (field)) == RECORD_TYPE
1416 || TREE_CODE (TREE_TYPE (field)) == UNION_TYPE))
1418 tree anon = lookup_field (field, component);
1421 return tree_cons (NULL_TREE, field, anon);
1424 if (DECL_NAME (field) == component)
1428 if (field == NULL_TREE)
1432 return tree_cons (NULL_TREE, field, NULL_TREE);
1435 /* Make an expression to refer to the COMPONENT field of
1436 structure or union value DATUM. COMPONENT is an IDENTIFIER_NODE. */
1439 build_component_ref (tree datum, tree component)
1441 tree type = TREE_TYPE (datum);
1442 enum tree_code code = TREE_CODE (type);
1446 if (!objc_is_public (datum, component))
1447 return error_mark_node;
1449 /* If DATUM is a COMPOUND_EXPR, move our reference inside it.
1450 Ensure that the arguments are not lvalues; otherwise,
1451 if the component is an array, it would wrongly decay to a pointer in
1453 We cannot do this with a COND_EXPR, because in a conditional expression
1454 the default promotions are applied to both sides, and this would yield
1455 the wrong type of the result; for example, if the components have
1457 switch (TREE_CODE (datum))
1461 tree value = build_component_ref (TREE_OPERAND (datum, 1), component);
1462 return build (COMPOUND_EXPR, TREE_TYPE (value),
1463 TREE_OPERAND (datum, 0), non_lvalue (value));
1469 /* See if there is a field or component with name COMPONENT. */
1471 if (code == RECORD_TYPE || code == UNION_TYPE)
1473 if (!COMPLETE_TYPE_P (type))
1475 c_incomplete_type_error (NULL_TREE, type);
1476 return error_mark_node;
1479 field = lookup_field (datum, component);
1483 error ("%s has no member named `%s'",
1484 code == RECORD_TYPE ? "structure" : "union",
1485 IDENTIFIER_POINTER (component));
1486 return error_mark_node;
1489 /* Chain the COMPONENT_REFs if necessary down to the FIELD.
1490 This might be better solved in future the way the C++ front
1491 end does it - by giving the anonymous entities each a
1492 separate name and type, and then have build_component_ref
1493 recursively call itself. We can't do that here. */
1496 tree subdatum = TREE_VALUE (field);
1498 if (TREE_TYPE (subdatum) == error_mark_node)
1499 return error_mark_node;
1501 ref = build (COMPONENT_REF, TREE_TYPE (subdatum), datum, subdatum,
1503 if (TREE_READONLY (datum) || TREE_READONLY (subdatum))
1504 TREE_READONLY (ref) = 1;
1505 if (TREE_THIS_VOLATILE (datum) || TREE_THIS_VOLATILE (subdatum))
1506 TREE_THIS_VOLATILE (ref) = 1;
1508 if (TREE_DEPRECATED (subdatum))
1509 warn_deprecated_use (subdatum);
1513 field = TREE_CHAIN (field);
1519 else if (code != ERROR_MARK)
1520 error ("request for member `%s' in something not a structure or union",
1521 IDENTIFIER_POINTER (component));
1523 return error_mark_node;
1526 /* Given an expression PTR for a pointer, return an expression
1527 for the value pointed to.
1528 ERRORSTRING is the name of the operator to appear in error messages. */
1531 build_indirect_ref (tree ptr, const char *errorstring)
1533 tree pointer = default_conversion (ptr);
1534 tree type = TREE_TYPE (pointer);
1536 if (TREE_CODE (type) == POINTER_TYPE)
1538 if (TREE_CODE (pointer) == ADDR_EXPR
1539 && (TREE_TYPE (TREE_OPERAND (pointer, 0))
1540 == TREE_TYPE (type)))
1541 return TREE_OPERAND (pointer, 0);
1544 tree t = TREE_TYPE (type);
1545 tree ref = build1 (INDIRECT_REF, TYPE_MAIN_VARIANT (t), pointer);
1547 if (!COMPLETE_OR_VOID_TYPE_P (t) && TREE_CODE (t) != ARRAY_TYPE)
1549 error ("dereferencing pointer to incomplete type");
1550 return error_mark_node;
1552 if (VOID_TYPE_P (t) && skip_evaluation == 0)
1553 warning ("dereferencing `void *' pointer");
1555 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
1556 so that we get the proper error message if the result is used
1557 to assign to. Also, &* is supposed to be a no-op.
1558 And ANSI C seems to specify that the type of the result
1559 should be the const type. */
1560 /* A de-reference of a pointer to const is not a const. It is valid
1561 to change it via some other pointer. */
1562 TREE_READONLY (ref) = TYPE_READONLY (t);
1563 TREE_SIDE_EFFECTS (ref)
1564 = TYPE_VOLATILE (t) || TREE_SIDE_EFFECTS (pointer);
1565 TREE_THIS_VOLATILE (ref) = TYPE_VOLATILE (t);
1569 else if (TREE_CODE (pointer) != ERROR_MARK)
1570 error ("invalid type argument of `%s'", errorstring);
1571 return error_mark_node;
1574 /* This handles expressions of the form "a[i]", which denotes
1577 This is logically equivalent in C to *(a+i), but we may do it differently.
1578 If A is a variable or a member, we generate a primitive ARRAY_REF.
1579 This avoids forcing the array out of registers, and can work on
1580 arrays that are not lvalues (for example, members of structures returned
1584 build_array_ref (tree array, tree index)
1588 error ("subscript missing in array reference");
1589 return error_mark_node;
1592 if (TREE_TYPE (array) == error_mark_node
1593 || TREE_TYPE (index) == error_mark_node)
1594 return error_mark_node;
1596 if (TREE_CODE (TREE_TYPE (array)) == ARRAY_TYPE)
1600 /* Subscripting with type char is likely to lose
1601 on a machine where chars are signed.
1602 So warn on any machine, but optionally.
1603 Don't warn for unsigned char since that type is safe.
1604 Don't warn for signed char because anyone who uses that
1605 must have done so deliberately. */
1606 if (warn_char_subscripts
1607 && TYPE_MAIN_VARIANT (TREE_TYPE (index)) == char_type_node)
1608 warning ("array subscript has type `char'");
1610 /* Apply default promotions *after* noticing character types. */
1611 index = default_conversion (index);
1613 /* Require integer *after* promotion, for sake of enums. */
1614 if (TREE_CODE (TREE_TYPE (index)) != INTEGER_TYPE)
1616 error ("array subscript is not an integer");
1617 return error_mark_node;
1620 /* An array that is indexed by a non-constant
1621 cannot be stored in a register; we must be able to do
1622 address arithmetic on its address.
1623 Likewise an array of elements of variable size. */
1624 if (TREE_CODE (index) != INTEGER_CST
1625 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array)))
1626 && TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array)))) != INTEGER_CST))
1628 if (!c_mark_addressable (array))
1629 return error_mark_node;
1631 /* An array that is indexed by a constant value which is not within
1632 the array bounds cannot be stored in a register either; because we
1633 would get a crash in store_bit_field/extract_bit_field when trying
1634 to access a non-existent part of the register. */
1635 if (TREE_CODE (index) == INTEGER_CST
1636 && TYPE_DOMAIN (TREE_TYPE (array))
1637 && ! int_fits_type_p (index, TYPE_DOMAIN (TREE_TYPE (array))))
1639 if (!c_mark_addressable (array))
1640 return error_mark_node;
1646 while (TREE_CODE (foo) == COMPONENT_REF)
1647 foo = TREE_OPERAND (foo, 0);
1648 if (TREE_CODE (foo) == VAR_DECL && C_DECL_REGISTER (foo))
1649 pedwarn ("ISO C forbids subscripting `register' array");
1650 else if (! flag_isoc99 && ! lvalue_p (foo))
1651 pedwarn ("ISO C90 forbids subscripting non-lvalue array");
1654 type = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (array)));
1655 rval = build (ARRAY_REF, type, array, index, NULL_TREE, NULL_TREE);
1656 /* Array ref is const/volatile if the array elements are
1657 or if the array is. */
1658 TREE_READONLY (rval)
1659 |= (TYPE_READONLY (TREE_TYPE (TREE_TYPE (array)))
1660 | TREE_READONLY (array));
1661 TREE_SIDE_EFFECTS (rval)
1662 |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array)))
1663 | TREE_SIDE_EFFECTS (array));
1664 TREE_THIS_VOLATILE (rval)
1665 |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array)))
1666 /* This was added by rms on 16 Nov 91.
1667 It fixes vol struct foo *a; a->elts[1]
1668 in an inline function.
1669 Hope it doesn't break something else. */
1670 | TREE_THIS_VOLATILE (array));
1671 return require_complete_type (fold (rval));
1675 tree ar = default_conversion (array);
1676 tree ind = default_conversion (index);
1678 /* Do the same warning check as above, but only on the part that's
1679 syntactically the index and only if it is also semantically
1681 if (warn_char_subscripts
1682 && TREE_CODE (TREE_TYPE (index)) == INTEGER_TYPE
1683 && TYPE_MAIN_VARIANT (TREE_TYPE (index)) == char_type_node)
1684 warning ("subscript has type `char'");
1686 /* Put the integer in IND to simplify error checking. */
1687 if (TREE_CODE (TREE_TYPE (ar)) == INTEGER_TYPE)
1694 if (ar == error_mark_node)
1697 if (TREE_CODE (TREE_TYPE (ar)) != POINTER_TYPE
1698 || TREE_CODE (TREE_TYPE (TREE_TYPE (ar))) == FUNCTION_TYPE)
1700 error ("subscripted value is neither array nor pointer");
1701 return error_mark_node;
1703 if (TREE_CODE (TREE_TYPE (ind)) != INTEGER_TYPE)
1705 error ("array subscript is not an integer");
1706 return error_mark_node;
1709 return build_indirect_ref (build_binary_op (PLUS_EXPR, ar, ind, 0),
1714 /* Build an external reference to identifier ID. FUN indicates
1715 whether this will be used for a function call. */
1717 build_external_ref (tree id, int fun)
1720 tree decl = lookup_name (id);
1721 tree objc_ivar = lookup_objc_ivar (id);
1723 if (decl && decl != error_mark_node)
1725 /* Properly declared variable or function reference. */
1728 else if (decl != objc_ivar && !DECL_FILE_SCOPE_P (decl))
1730 warning ("local declaration of `%s' hides instance variable",
1731 IDENTIFIER_POINTER (id));
1740 /* Implicit function declaration. */
1741 ref = implicitly_declare (id);
1742 else if (decl == error_mark_node)
1743 /* Don't complain about something that's already been
1744 complained about. */
1745 return error_mark_node;
1748 undeclared_variable (id);
1749 return error_mark_node;
1752 if (TREE_TYPE (ref) == error_mark_node)
1753 return error_mark_node;
1755 if (TREE_DEPRECATED (ref))
1756 warn_deprecated_use (ref);
1758 if (!skip_evaluation)
1759 assemble_external (ref);
1760 TREE_USED (ref) = 1;
1762 if (TREE_CODE (ref) == CONST_DECL)
1764 ref = DECL_INITIAL (ref);
1765 TREE_CONSTANT (ref) = 1;
1766 TREE_INVARIANT (ref) = 1;
1768 else if (current_function_decl != 0
1769 && !DECL_FILE_SCOPE_P (current_function_decl)
1770 && (TREE_CODE (ref) == VAR_DECL
1771 || TREE_CODE (ref) == PARM_DECL
1772 || TREE_CODE (ref) == FUNCTION_DECL))
1774 tree context = decl_function_context (ref);
1776 if (context != 0 && context != current_function_decl)
1777 DECL_NONLOCAL (ref) = 1;
1783 /* Build a function call to function FUNCTION with parameters PARAMS.
1784 PARAMS is a list--a chain of TREE_LIST nodes--in which the
1785 TREE_VALUE of each node is a parameter-expression.
1786 FUNCTION's data type may be a function type or a pointer-to-function. */
1789 build_function_call (tree function, tree params)
1791 tree fntype, fundecl = 0;
1792 tree coerced_params;
1793 tree name = NULL_TREE, result;
1796 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
1797 STRIP_TYPE_NOPS (function);
1799 /* Convert anything with function type to a pointer-to-function. */
1800 if (TREE_CODE (function) == FUNCTION_DECL)
1802 name = DECL_NAME (function);
1804 /* Differs from default_conversion by not setting TREE_ADDRESSABLE
1805 (because calling an inline function does not mean the function
1806 needs to be separately compiled). */
1807 fntype = build_type_variant (TREE_TYPE (function),
1808 TREE_READONLY (function),
1809 TREE_THIS_VOLATILE (function));
1811 function = build1 (ADDR_EXPR, build_pointer_type (fntype), function);
1814 function = default_conversion (function);
1816 fntype = TREE_TYPE (function);
1818 if (TREE_CODE (fntype) == ERROR_MARK)
1819 return error_mark_node;
1821 if (!(TREE_CODE (fntype) == POINTER_TYPE
1822 && TREE_CODE (TREE_TYPE (fntype)) == FUNCTION_TYPE))
1824 error ("called object is not a function");
1825 return error_mark_node;
1828 if (fundecl && TREE_THIS_VOLATILE (fundecl))
1829 current_function_returns_abnormally = 1;
1831 /* fntype now gets the type of function pointed to. */
1832 fntype = TREE_TYPE (fntype);
1834 /* Check that the function is called through a compatible prototype.
1835 If it is not, replace the call by a trap, wrapped up in a compound
1836 expression if necessary. This has the nice side-effect to prevent
1837 the tree-inliner from generating invalid assignment trees which may
1838 blow up in the RTL expander later.
1840 ??? This doesn't work for Objective-C because objc_comptypes
1841 refuses to compare function prototypes, yet the compiler appears
1842 to build calls that are flagged as invalid by C's comptypes. */
1843 if (! c_dialect_objc ()
1844 && TREE_CODE (function) == NOP_EXPR
1845 && TREE_CODE (tem = TREE_OPERAND (function, 0)) == ADDR_EXPR
1846 && TREE_CODE (tem = TREE_OPERAND (tem, 0)) == FUNCTION_DECL
1847 && ! comptypes (fntype, TREE_TYPE (tem)))
1849 tree return_type = TREE_TYPE (fntype);
1850 tree trap = build_function_call (built_in_decls[BUILT_IN_TRAP],
1853 /* This situation leads to run-time undefined behavior. We can't,
1854 therefore, simply error unless we can prove that all possible
1855 executions of the program must execute the code. */
1856 warning ("function called through a non-compatible type");
1858 /* We can, however, treat "undefined" any way we please.
1859 Call abort to encourage the user to fix the program. */
1860 inform ("if this code is reached, the program will abort");
1862 if (VOID_TYPE_P (return_type))
1868 if (AGGREGATE_TYPE_P (return_type))
1869 rhs = build_compound_literal (return_type,
1870 build_constructor (return_type,
1873 rhs = fold (build1 (NOP_EXPR, return_type, integer_zero_node));
1875 return build (COMPOUND_EXPR, return_type, trap, rhs);
1879 /* Convert the parameters to the types declared in the
1880 function prototype, or apply default promotions. */
1883 = convert_arguments (TYPE_ARG_TYPES (fntype), params, name, fundecl);
1885 /* Check that the arguments to the function are valid. */
1887 check_function_arguments (TYPE_ATTRIBUTES (fntype), coerced_params);
1889 result = build (CALL_EXPR, TREE_TYPE (fntype),
1890 function, coerced_params, NULL_TREE);
1891 TREE_SIDE_EFFECTS (result) = 1;
1893 if (require_constant_value)
1895 result = fold_initializer (result);
1897 if (TREE_CONSTANT (result)
1898 && (name == NULL_TREE
1899 || strncmp (IDENTIFIER_POINTER (name), "__builtin_", 10) != 0))
1900 pedwarn_init ("initializer element is not constant");
1903 result = fold (result);
1905 if (VOID_TYPE_P (TREE_TYPE (result)))
1907 return require_complete_type (result);
1910 /* Convert the argument expressions in the list VALUES
1911 to the types in the list TYPELIST. The result is a list of converted
1912 argument expressions.
1914 If TYPELIST is exhausted, or when an element has NULL as its type,
1915 perform the default conversions.
1917 PARMLIST is the chain of parm decls for the function being called.
1918 It may be 0, if that info is not available.
1919 It is used only for generating error messages.
1921 NAME is an IDENTIFIER_NODE or 0. It is used only for error messages.
1923 This is also where warnings about wrong number of args are generated.
1925 Both VALUES and the returned value are chains of TREE_LIST nodes
1926 with the elements of the list in the TREE_VALUE slots of those nodes. */
1929 convert_arguments (tree typelist, tree values, tree name, tree fundecl)
1931 tree typetail, valtail;
1935 /* Scan the given expressions and types, producing individual
1936 converted arguments and pushing them on RESULT in reverse order. */
1938 for (valtail = values, typetail = typelist, parmnum = 0;
1940 valtail = TREE_CHAIN (valtail), parmnum++)
1942 tree type = typetail ? TREE_VALUE (typetail) : 0;
1943 tree val = TREE_VALUE (valtail);
1945 if (type == void_type_node)
1948 error ("too many arguments to function `%s'",
1949 IDENTIFIER_POINTER (name));
1951 error ("too many arguments to function");
1955 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
1956 /* Do not use STRIP_NOPS here! We do not want an enumerator with value 0
1957 to convert automatically to a pointer. */
1958 if (TREE_CODE (val) == NON_LVALUE_EXPR)
1959 val = TREE_OPERAND (val, 0);
1961 val = default_function_array_conversion (val);
1963 val = require_complete_type (val);
1967 /* Formal parm type is specified by a function prototype. */
1970 if (!COMPLETE_TYPE_P (type))
1972 error ("type of formal parameter %d is incomplete", parmnum + 1);
1977 /* Optionally warn about conversions that
1978 differ from the default conversions. */
1979 if (warn_conversion || warn_traditional)
1981 int formal_prec = TYPE_PRECISION (type);
1983 if (INTEGRAL_TYPE_P (type)
1984 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
1985 warn_for_assignment ("%s as integer rather than floating due to prototype", (char *) 0, name, parmnum + 1);
1986 if (INTEGRAL_TYPE_P (type)
1987 && TREE_CODE (TREE_TYPE (val)) == COMPLEX_TYPE)
1988 warn_for_assignment ("%s as integer rather than complex due to prototype", (char *) 0, name, parmnum + 1);
1989 else if (TREE_CODE (type) == COMPLEX_TYPE
1990 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
1991 warn_for_assignment ("%s as complex rather than floating due to prototype", (char *) 0, name, parmnum + 1);
1992 else if (TREE_CODE (type) == REAL_TYPE
1993 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
1994 warn_for_assignment ("%s as floating rather than integer due to prototype", (char *) 0, name, parmnum + 1);
1995 else if (TREE_CODE (type) == COMPLEX_TYPE
1996 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
1997 warn_for_assignment ("%s as complex rather than integer due to prototype", (char *) 0, name, parmnum + 1);
1998 else if (TREE_CODE (type) == REAL_TYPE
1999 && TREE_CODE (TREE_TYPE (val)) == COMPLEX_TYPE)
2000 warn_for_assignment ("%s as floating rather than complex due to prototype", (char *) 0, name, parmnum + 1);
2001 /* ??? At some point, messages should be written about
2002 conversions between complex types, but that's too messy
2004 else if (TREE_CODE (type) == REAL_TYPE
2005 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
2007 /* Warn if any argument is passed as `float',
2008 since without a prototype it would be `double'. */
2009 if (formal_prec == TYPE_PRECISION (float_type_node))
2010 warn_for_assignment ("%s as `float' rather than `double' due to prototype", (char *) 0, name, parmnum + 1);
2012 /* Detect integer changing in width or signedness.
2013 These warnings are only activated with
2014 -Wconversion, not with -Wtraditional. */
2015 else if (warn_conversion && INTEGRAL_TYPE_P (type)
2016 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
2018 tree would_have_been = default_conversion (val);
2019 tree type1 = TREE_TYPE (would_have_been);
2021 if (TREE_CODE (type) == ENUMERAL_TYPE
2022 && (TYPE_MAIN_VARIANT (type)
2023 == TYPE_MAIN_VARIANT (TREE_TYPE (val))))
2024 /* No warning if function asks for enum
2025 and the actual arg is that enum type. */
2027 else if (formal_prec != TYPE_PRECISION (type1))
2028 warn_for_assignment ("%s with different width due to prototype", (char *) 0, name, parmnum + 1);
2029 else if (TYPE_UNSIGNED (type) == TYPE_UNSIGNED (type1))
2031 /* Don't complain if the formal parameter type
2032 is an enum, because we can't tell now whether
2033 the value was an enum--even the same enum. */
2034 else if (TREE_CODE (type) == ENUMERAL_TYPE)
2036 else if (TREE_CODE (val) == INTEGER_CST
2037 && int_fits_type_p (val, type))
2038 /* Change in signedness doesn't matter
2039 if a constant value is unaffected. */
2041 /* Likewise for a constant in a NOP_EXPR. */
2042 else if (TREE_CODE (val) == NOP_EXPR
2043 && TREE_CODE (TREE_OPERAND (val, 0)) == INTEGER_CST
2044 && int_fits_type_p (TREE_OPERAND (val, 0), type))
2046 /* If the value is extended from a narrower
2047 unsigned type, it doesn't matter whether we
2048 pass it as signed or unsigned; the value
2049 certainly is the same either way. */
2050 else if (TYPE_PRECISION (TREE_TYPE (val)) < TYPE_PRECISION (type)
2051 && TYPE_UNSIGNED (TREE_TYPE (val)))
2053 else if (TYPE_UNSIGNED (type))
2054 warn_for_assignment ("%s as unsigned due to prototype", (char *) 0, name, parmnum + 1);
2056 warn_for_assignment ("%s as signed due to prototype", (char *) 0, name, parmnum + 1);
2060 parmval = convert_for_assignment (type, val,
2061 (char *) 0, /* arg passing */
2062 fundecl, name, parmnum + 1);
2064 if (targetm.calls.promote_prototypes (fundecl ? TREE_TYPE (fundecl) : 0)
2065 && INTEGRAL_TYPE_P (type)
2066 && (TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node)))
2067 parmval = default_conversion (parmval);
2069 result = tree_cons (NULL_TREE, parmval, result);
2071 else if (TREE_CODE (TREE_TYPE (val)) == REAL_TYPE
2072 && (TYPE_PRECISION (TREE_TYPE (val))
2073 < TYPE_PRECISION (double_type_node)))
2074 /* Convert `float' to `double'. */
2075 result = tree_cons (NULL_TREE, convert (double_type_node, val), result);
2077 /* Convert `short' and `char' to full-size `int'. */
2078 result = tree_cons (NULL_TREE, default_conversion (val), result);
2081 typetail = TREE_CHAIN (typetail);
2084 if (typetail != 0 && TREE_VALUE (typetail) != void_type_node)
2087 error ("too few arguments to function `%s'",
2088 IDENTIFIER_POINTER (name));
2090 error ("too few arguments to function");
2093 return nreverse (result);
2096 /* This is the entry point used by the parser
2097 for binary operators in the input.
2098 In addition to constructing the expression,
2099 we check for operands that were written with other binary operators
2100 in a way that is likely to confuse the user. */
2103 parser_build_binary_op (enum tree_code code, tree arg1, tree arg2)
2105 tree result = build_binary_op (code, arg1, arg2, 1);
2108 char class1 = TREE_CODE_CLASS (TREE_CODE (arg1));
2109 char class2 = TREE_CODE_CLASS (TREE_CODE (arg2));
2110 enum tree_code code1 = ERROR_MARK;
2111 enum tree_code code2 = ERROR_MARK;
2113 if (TREE_CODE (result) == ERROR_MARK)
2114 return error_mark_node;
2116 if (IS_EXPR_CODE_CLASS (class1))
2117 code1 = C_EXP_ORIGINAL_CODE (arg1);
2118 if (IS_EXPR_CODE_CLASS (class2))
2119 code2 = C_EXP_ORIGINAL_CODE (arg2);
2121 /* Check for cases such as x+y<<z which users are likely
2122 to misinterpret. If parens are used, C_EXP_ORIGINAL_CODE
2123 is cleared to prevent these warnings. */
2124 if (warn_parentheses)
2126 if (code == LSHIFT_EXPR || code == RSHIFT_EXPR)
2128 if (code1 == PLUS_EXPR || code1 == MINUS_EXPR
2129 || code2 == PLUS_EXPR || code2 == MINUS_EXPR)
2130 warning ("suggest parentheses around + or - inside shift");
2133 if (code == TRUTH_ORIF_EXPR)
2135 if (code1 == TRUTH_ANDIF_EXPR
2136 || code2 == TRUTH_ANDIF_EXPR)
2137 warning ("suggest parentheses around && within ||");
2140 if (code == BIT_IOR_EXPR)
2142 if (code1 == BIT_AND_EXPR || code1 == BIT_XOR_EXPR
2143 || code1 == PLUS_EXPR || code1 == MINUS_EXPR
2144 || code2 == BIT_AND_EXPR || code2 == BIT_XOR_EXPR
2145 || code2 == PLUS_EXPR || code2 == MINUS_EXPR)
2146 warning ("suggest parentheses around arithmetic in operand of |");
2147 /* Check cases like x|y==z */
2148 if (TREE_CODE_CLASS (code1) == '<' || TREE_CODE_CLASS (code2) == '<')
2149 warning ("suggest parentheses around comparison in operand of |");
2152 if (code == BIT_XOR_EXPR)
2154 if (code1 == BIT_AND_EXPR
2155 || code1 == PLUS_EXPR || code1 == MINUS_EXPR
2156 || code2 == BIT_AND_EXPR
2157 || code2 == PLUS_EXPR || code2 == MINUS_EXPR)
2158 warning ("suggest parentheses around arithmetic in operand of ^");
2159 /* Check cases like x^y==z */
2160 if (TREE_CODE_CLASS (code1) == '<' || TREE_CODE_CLASS (code2) == '<')
2161 warning ("suggest parentheses around comparison in operand of ^");
2164 if (code == BIT_AND_EXPR)
2166 if (code1 == PLUS_EXPR || code1 == MINUS_EXPR
2167 || code2 == PLUS_EXPR || code2 == MINUS_EXPR)
2168 warning ("suggest parentheses around + or - in operand of &");
2169 /* Check cases like x&y==z */
2170 if (TREE_CODE_CLASS (code1) == '<' || TREE_CODE_CLASS (code2) == '<')
2171 warning ("suggest parentheses around comparison in operand of &");
2175 /* Similarly, check for cases like 1<=i<=10 that are probably errors. */
2176 if (TREE_CODE_CLASS (code) == '<' && extra_warnings
2177 && (TREE_CODE_CLASS (code1) == '<' || TREE_CODE_CLASS (code2) == '<'))
2178 warning ("comparisons like X<=Y<=Z do not have their mathematical meaning");
2180 unsigned_conversion_warning (result, arg1);
2181 unsigned_conversion_warning (result, arg2);
2182 overflow_warning (result);
2184 class = TREE_CODE_CLASS (TREE_CODE (result));
2186 /* Record the code that was specified in the source,
2187 for the sake of warnings about confusing nesting. */
2188 if (IS_EXPR_CODE_CLASS (class))
2189 C_SET_EXP_ORIGINAL_CODE (result, code);
2192 /* We used to use NOP_EXPR rather than NON_LVALUE_EXPR
2193 so that convert_for_assignment wouldn't strip it.
2194 That way, we got warnings for things like p = (1 - 1).
2195 But it turns out we should not get those warnings. */
2196 result = build1 (NON_LVALUE_EXPR, TREE_TYPE (result), result);
2197 C_SET_EXP_ORIGINAL_CODE (result, code);
2203 /* Return a tree for the difference of pointers OP0 and OP1.
2204 The resulting tree has type int. */
2207 pointer_diff (tree op0, tree op1)
2209 tree restype = ptrdiff_type_node;
2211 tree target_type = TREE_TYPE (TREE_TYPE (op0));
2212 tree con0, con1, lit0, lit1;
2213 tree orig_op1 = op1;
2215 if (pedantic || warn_pointer_arith)
2217 if (TREE_CODE (target_type) == VOID_TYPE)
2218 pedwarn ("pointer of type `void *' used in subtraction");
2219 if (TREE_CODE (target_type) == FUNCTION_TYPE)
2220 pedwarn ("pointer to a function used in subtraction");
2223 /* If the conversion to ptrdiff_type does anything like widening or
2224 converting a partial to an integral mode, we get a convert_expression
2225 that is in the way to do any simplifications.
2226 (fold-const.c doesn't know that the extra bits won't be needed.
2227 split_tree uses STRIP_SIGN_NOPS, which leaves conversions to a
2228 different mode in place.)
2229 So first try to find a common term here 'by hand'; we want to cover
2230 at least the cases that occur in legal static initializers. */
2231 con0 = TREE_CODE (op0) == NOP_EXPR ? TREE_OPERAND (op0, 0) : op0;
2232 con1 = TREE_CODE (op1) == NOP_EXPR ? TREE_OPERAND (op1, 0) : op1;
2234 if (TREE_CODE (con0) == PLUS_EXPR)
2236 lit0 = TREE_OPERAND (con0, 1);
2237 con0 = TREE_OPERAND (con0, 0);
2240 lit0 = integer_zero_node;
2242 if (TREE_CODE (con1) == PLUS_EXPR)
2244 lit1 = TREE_OPERAND (con1, 1);
2245 con1 = TREE_OPERAND (con1, 0);
2248 lit1 = integer_zero_node;
2250 if (operand_equal_p (con0, con1, 0))
2257 /* First do the subtraction as integers;
2258 then drop through to build the divide operator.
2259 Do not do default conversions on the minus operator
2260 in case restype is a short type. */
2262 op0 = build_binary_op (MINUS_EXPR, convert (restype, op0),
2263 convert (restype, op1), 0);
2264 /* This generates an error if op1 is pointer to incomplete type. */
2265 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (TREE_TYPE (orig_op1))))
2266 error ("arithmetic on pointer to an incomplete type");
2268 /* This generates an error if op0 is pointer to incomplete type. */
2269 op1 = c_size_in_bytes (target_type);
2271 /* Divide by the size, in easiest possible way. */
2272 return fold (build (EXACT_DIV_EXPR, restype, op0, convert (restype, op1)));
2275 /* Construct and perhaps optimize a tree representation
2276 for a unary operation. CODE, a tree_code, specifies the operation
2277 and XARG is the operand.
2278 For any CODE other than ADDR_EXPR, FLAG nonzero suppresses
2279 the default promotions (such as from short to int).
2280 For ADDR_EXPR, the default promotions are not applied; FLAG nonzero
2281 allows non-lvalues; this is only used to handle conversion of non-lvalue
2282 arrays to pointers in C99. */
2285 build_unary_op (enum tree_code code, tree xarg, int flag)
2287 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
2290 enum tree_code typecode = TREE_CODE (TREE_TYPE (arg));
2292 int noconvert = flag;
2294 if (typecode == ERROR_MARK)
2295 return error_mark_node;
2296 if (typecode == ENUMERAL_TYPE || typecode == BOOLEAN_TYPE)
2297 typecode = INTEGER_TYPE;
2302 /* This is used for unary plus, because a CONVERT_EXPR
2303 is enough to prevent anybody from looking inside for
2304 associativity, but won't generate any code. */
2305 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2306 || typecode == COMPLEX_TYPE))
2308 error ("wrong type argument to unary plus");
2309 return error_mark_node;
2311 else if (!noconvert)
2312 arg = default_conversion (arg);
2313 arg = non_lvalue (arg);
2317 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2318 || typecode == COMPLEX_TYPE
2319 || typecode == VECTOR_TYPE))
2321 error ("wrong type argument to unary minus");
2322 return error_mark_node;
2324 else if (!noconvert)
2325 arg = default_conversion (arg);
2329 if (typecode == INTEGER_TYPE || typecode == VECTOR_TYPE)
2332 arg = default_conversion (arg);
2334 else if (typecode == COMPLEX_TYPE)
2338 pedwarn ("ISO C does not support `~' for complex conjugation");
2340 arg = default_conversion (arg);
2344 error ("wrong type argument to bit-complement");
2345 return error_mark_node;
2350 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE))
2352 error ("wrong type argument to abs");
2353 return error_mark_node;
2355 else if (!noconvert)
2356 arg = default_conversion (arg);
2360 /* Conjugating a real value is a no-op, but allow it anyway. */
2361 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2362 || typecode == COMPLEX_TYPE))
2364 error ("wrong type argument to conjugation");
2365 return error_mark_node;
2367 else if (!noconvert)
2368 arg = default_conversion (arg);
2371 case TRUTH_NOT_EXPR:
2372 if (typecode != INTEGER_TYPE
2373 && typecode != REAL_TYPE && typecode != POINTER_TYPE
2374 && typecode != COMPLEX_TYPE
2375 /* These will convert to a pointer. */
2376 && typecode != ARRAY_TYPE && typecode != FUNCTION_TYPE)
2378 error ("wrong type argument to unary exclamation mark");
2379 return error_mark_node;
2381 arg = lang_hooks.truthvalue_conversion (arg);
2382 return invert_truthvalue (arg);
2388 if (TREE_CODE (arg) == COMPLEX_CST)
2389 return TREE_REALPART (arg);
2390 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
2391 return fold (build1 (REALPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg));
2396 if (TREE_CODE (arg) == COMPLEX_CST)
2397 return TREE_IMAGPART (arg);
2398 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
2399 return fold (build1 (IMAGPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg));
2401 return convert (TREE_TYPE (arg), integer_zero_node);
2403 case PREINCREMENT_EXPR:
2404 case POSTINCREMENT_EXPR:
2405 case PREDECREMENT_EXPR:
2406 case POSTDECREMENT_EXPR:
2408 /* Increment or decrement the real part of the value,
2409 and don't change the imaginary part. */
2410 if (typecode == COMPLEX_TYPE)
2415 pedwarn ("ISO C does not support `++' and `--' on complex types");
2417 arg = stabilize_reference (arg);
2418 real = build_unary_op (REALPART_EXPR, arg, 1);
2419 imag = build_unary_op (IMAGPART_EXPR, arg, 1);
2420 return build (COMPLEX_EXPR, TREE_TYPE (arg),
2421 build_unary_op (code, real, 1), imag);
2424 /* Report invalid types. */
2426 if (typecode != POINTER_TYPE
2427 && typecode != INTEGER_TYPE && typecode != REAL_TYPE)
2429 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
2430 error ("wrong type argument to increment");
2432 error ("wrong type argument to decrement");
2434 return error_mark_node;
2439 tree result_type = TREE_TYPE (arg);
2441 arg = get_unwidened (arg, 0);
2442 argtype = TREE_TYPE (arg);
2444 /* Compute the increment. */
2446 if (typecode == POINTER_TYPE)
2448 /* If pointer target is an undefined struct,
2449 we just cannot know how to do the arithmetic. */
2450 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (result_type)))
2452 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
2453 error ("increment of pointer to unknown structure");
2455 error ("decrement of pointer to unknown structure");
2457 else if ((pedantic || warn_pointer_arith)
2458 && (TREE_CODE (TREE_TYPE (result_type)) == FUNCTION_TYPE
2459 || TREE_CODE (TREE_TYPE (result_type)) == VOID_TYPE))
2461 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
2462 pedwarn ("wrong type argument to increment");
2464 pedwarn ("wrong type argument to decrement");
2467 inc = c_size_in_bytes (TREE_TYPE (result_type));
2470 inc = integer_one_node;
2472 inc = convert (argtype, inc);
2474 /* Complain about anything else that is not a true lvalue. */
2475 if (!lvalue_or_else (arg, ((code == PREINCREMENT_EXPR
2476 || code == POSTINCREMENT_EXPR)
2477 ? "invalid lvalue in increment"
2478 : "invalid lvalue in decrement")))
2479 return error_mark_node;
2481 /* Report a read-only lvalue. */
2482 if (TREE_READONLY (arg))
2483 readonly_error (arg,
2484 ((code == PREINCREMENT_EXPR
2485 || code == POSTINCREMENT_EXPR)
2486 ? "increment" : "decrement"));
2488 if (TREE_CODE (TREE_TYPE (arg)) == BOOLEAN_TYPE)
2489 val = boolean_increment (code, arg);
2491 val = build (code, TREE_TYPE (arg), arg, inc);
2492 TREE_SIDE_EFFECTS (val) = 1;
2493 val = convert (result_type, val);
2494 if (TREE_CODE (val) != code)
2495 TREE_NO_WARNING (val) = 1;
2500 /* Note that this operation never does default_conversion. */
2502 /* Let &* cancel out to simplify resulting code. */
2503 if (TREE_CODE (arg) == INDIRECT_REF)
2505 /* Don't let this be an lvalue. */
2506 if (lvalue_p (TREE_OPERAND (arg, 0)))
2507 return non_lvalue (TREE_OPERAND (arg, 0));
2508 return TREE_OPERAND (arg, 0);
2511 /* For &x[y], return x+y */
2512 if (TREE_CODE (arg) == ARRAY_REF)
2514 if (!c_mark_addressable (TREE_OPERAND (arg, 0)))
2515 return error_mark_node;
2516 return build_binary_op (PLUS_EXPR, TREE_OPERAND (arg, 0),
2517 TREE_OPERAND (arg, 1), 1);
2520 /* Anything not already handled and not a true memory reference
2521 or a non-lvalue array is an error. */
2522 else if (typecode != FUNCTION_TYPE && !flag
2523 && !lvalue_or_else (arg, "invalid lvalue in unary `&'"))
2524 return error_mark_node;
2526 /* Ordinary case; arg is a COMPONENT_REF or a decl. */
2527 argtype = TREE_TYPE (arg);
2529 /* If the lvalue is const or volatile, merge that into the type
2530 to which the address will point. Note that you can't get a
2531 restricted pointer by taking the address of something, so we
2532 only have to deal with `const' and `volatile' here. */
2533 if ((DECL_P (arg) || TREE_CODE_CLASS (TREE_CODE (arg)) == 'r')
2534 && (TREE_READONLY (arg) || TREE_THIS_VOLATILE (arg)))
2535 argtype = c_build_type_variant (argtype,
2536 TREE_READONLY (arg),
2537 TREE_THIS_VOLATILE (arg));
2539 argtype = build_pointer_type (argtype);
2541 if (!c_mark_addressable (arg))
2542 return error_mark_node;
2547 if (TREE_CODE (arg) == COMPONENT_REF)
2549 tree field = TREE_OPERAND (arg, 1);
2551 addr = build_unary_op (ADDR_EXPR, TREE_OPERAND (arg, 0), flag);
2553 if (DECL_C_BIT_FIELD (field))
2555 error ("attempt to take address of bit-field structure member `%s'",
2556 IDENTIFIER_POINTER (DECL_NAME (field)));
2557 return error_mark_node;
2560 addr = fold (build (PLUS_EXPR, argtype,
2561 convert (argtype, addr),
2562 convert (argtype, byte_position (field))));
2565 addr = build1 (code, argtype, arg);
2567 if (TREE_CODE (arg) == COMPOUND_LITERAL_EXPR)
2568 TREE_INVARIANT (addr) = TREE_CONSTANT (addr) = 1;
2578 argtype = TREE_TYPE (arg);
2579 val = build1 (code, argtype, arg);
2580 return require_constant_value ? fold_initializer (val) : fold (val);
2583 /* Return nonzero if REF is an lvalue valid for this language.
2584 Lvalues can be assigned, unless their type has TYPE_READONLY.
2585 Lvalues can have their address taken, unless they have C_DECL_REGISTER. */
2590 enum tree_code code = TREE_CODE (ref);
2597 return lvalue_p (TREE_OPERAND (ref, 0));
2599 case COMPOUND_LITERAL_EXPR:
2609 return (TREE_CODE (TREE_TYPE (ref)) != FUNCTION_TYPE
2610 && TREE_CODE (TREE_TYPE (ref)) != METHOD_TYPE);
2613 return TREE_CODE (TREE_TYPE (ref)) == ARRAY_TYPE;
2620 /* Return nonzero if REF is an lvalue valid for this language;
2621 otherwise, print an error message and return zero. */
2624 lvalue_or_else (tree ref, const char *msgid)
2626 int win = lvalue_p (ref);
2629 error ("%s", msgid);
2635 /* Warn about storing in something that is `const'. */
2638 readonly_error (tree arg, const char *msgid)
2640 if (TREE_CODE (arg) == COMPONENT_REF)
2642 if (TYPE_READONLY (TREE_TYPE (TREE_OPERAND (arg, 0))))
2643 readonly_error (TREE_OPERAND (arg, 0), msgid);
2645 error ("%s of read-only member `%s'", _(msgid),
2646 IDENTIFIER_POINTER (DECL_NAME (TREE_OPERAND (arg, 1))));
2648 else if (TREE_CODE (arg) == VAR_DECL)
2649 error ("%s of read-only variable `%s'", _(msgid),
2650 IDENTIFIER_POINTER (DECL_NAME (arg)));
2652 error ("%s of read-only location", _(msgid));
2655 /* Mark EXP saying that we need to be able to take the
2656 address of it; it should not be allocated in a register.
2657 Returns true if successful. */
2660 c_mark_addressable (tree exp)
2665 switch (TREE_CODE (x))
2668 if (DECL_C_BIT_FIELD (TREE_OPERAND (x, 1)))
2670 error ("cannot take address of bit-field `%s'",
2671 IDENTIFIER_POINTER (DECL_NAME (TREE_OPERAND (x, 1))));
2675 /* ... fall through ... */
2681 x = TREE_OPERAND (x, 0);
2684 case COMPOUND_LITERAL_EXPR:
2686 TREE_ADDRESSABLE (x) = 1;
2693 if (C_DECL_REGISTER (x)
2694 && DECL_NONLOCAL (x))
2696 if (TREE_PUBLIC (x) || TREE_STATIC (x) || DECL_EXTERNAL (x))
2698 error ("global register variable `%s' used in nested function",
2699 IDENTIFIER_POINTER (DECL_NAME (x)));
2702 pedwarn ("register variable `%s' used in nested function",
2703 IDENTIFIER_POINTER (DECL_NAME (x)));
2705 else if (C_DECL_REGISTER (x))
2707 if (TREE_PUBLIC (x) || TREE_STATIC (x) || DECL_EXTERNAL (x))
2709 error ("address of global register variable `%s' requested",
2710 IDENTIFIER_POINTER (DECL_NAME (x)));
2714 pedwarn ("address of register variable `%s' requested",
2715 IDENTIFIER_POINTER (DECL_NAME (x)));
2720 TREE_ADDRESSABLE (x) = 1;
2727 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
2730 build_conditional_expr (tree ifexp, tree op1, tree op2)
2734 enum tree_code code1;
2735 enum tree_code code2;
2736 tree result_type = NULL;
2737 tree orig_op1 = op1, orig_op2 = op2;
2739 ifexp = lang_hooks.truthvalue_conversion (default_conversion (ifexp));
2741 /* Promote both alternatives. */
2743 if (TREE_CODE (TREE_TYPE (op1)) != VOID_TYPE)
2744 op1 = default_conversion (op1);
2745 if (TREE_CODE (TREE_TYPE (op2)) != VOID_TYPE)
2746 op2 = default_conversion (op2);
2748 if (TREE_CODE (ifexp) == ERROR_MARK
2749 || TREE_CODE (TREE_TYPE (op1)) == ERROR_MARK
2750 || TREE_CODE (TREE_TYPE (op2)) == ERROR_MARK)
2751 return error_mark_node;
2753 type1 = TREE_TYPE (op1);
2754 code1 = TREE_CODE (type1);
2755 type2 = TREE_TYPE (op2);
2756 code2 = TREE_CODE (type2);
2758 /* C90 does not permit non-lvalue arrays in conditional expressions.
2759 In C99 they will be pointers by now. */
2760 if (code1 == ARRAY_TYPE || code2 == ARRAY_TYPE)
2762 error ("non-lvalue array in conditional expression");
2763 return error_mark_node;
2766 /* Quickly detect the usual case where op1 and op2 have the same type
2768 if (TYPE_MAIN_VARIANT (type1) == TYPE_MAIN_VARIANT (type2))
2771 result_type = type1;
2773 result_type = TYPE_MAIN_VARIANT (type1);
2775 else if ((code1 == INTEGER_TYPE || code1 == REAL_TYPE
2776 || code1 == COMPLEX_TYPE)
2777 && (code2 == INTEGER_TYPE || code2 == REAL_TYPE
2778 || code2 == COMPLEX_TYPE))
2780 result_type = common_type (type1, type2);
2782 /* If -Wsign-compare, warn here if type1 and type2 have
2783 different signedness. We'll promote the signed to unsigned
2784 and later code won't know it used to be different.
2785 Do this check on the original types, so that explicit casts
2786 will be considered, but default promotions won't. */
2787 if (warn_sign_compare && !skip_evaluation)
2789 int unsigned_op1 = TYPE_UNSIGNED (TREE_TYPE (orig_op1));
2790 int unsigned_op2 = TYPE_UNSIGNED (TREE_TYPE (orig_op2));
2792 if (unsigned_op1 ^ unsigned_op2)
2794 /* Do not warn if the result type is signed, since the
2795 signed type will only be chosen if it can represent
2796 all the values of the unsigned type. */
2797 if (! TYPE_UNSIGNED (result_type))
2799 /* Do not warn if the signed quantity is an unsuffixed
2800 integer literal (or some static constant expression
2801 involving such literals) and it is non-negative. */
2802 else if ((unsigned_op2 && tree_expr_nonnegative_p (op1))
2803 || (unsigned_op1 && tree_expr_nonnegative_p (op2)))
2806 warning ("signed and unsigned type in conditional expression");
2810 else if (code1 == VOID_TYPE || code2 == VOID_TYPE)
2812 if (pedantic && (code1 != VOID_TYPE || code2 != VOID_TYPE))
2813 pedwarn ("ISO C forbids conditional expr with only one void side");
2814 result_type = void_type_node;
2816 else if (code1 == POINTER_TYPE && code2 == POINTER_TYPE)
2818 if (comp_target_types (type1, type2, 1))
2819 result_type = common_pointer_type (type1, type2);
2820 else if (integer_zerop (op1) && TREE_TYPE (type1) == void_type_node
2821 && TREE_CODE (orig_op1) != NOP_EXPR)
2822 result_type = qualify_type (type2, type1);
2823 else if (integer_zerop (op2) && TREE_TYPE (type2) == void_type_node
2824 && TREE_CODE (orig_op2) != NOP_EXPR)
2825 result_type = qualify_type (type1, type2);
2826 else if (VOID_TYPE_P (TREE_TYPE (type1)))
2828 if (pedantic && TREE_CODE (TREE_TYPE (type2)) == FUNCTION_TYPE)
2829 pedwarn ("ISO C forbids conditional expr between `void *' and function pointer");
2830 result_type = build_pointer_type (qualify_type (TREE_TYPE (type1),
2831 TREE_TYPE (type2)));
2833 else if (VOID_TYPE_P (TREE_TYPE (type2)))
2835 if (pedantic && TREE_CODE (TREE_TYPE (type1)) == FUNCTION_TYPE)
2836 pedwarn ("ISO C forbids conditional expr between `void *' and function pointer");
2837 result_type = build_pointer_type (qualify_type (TREE_TYPE (type2),
2838 TREE_TYPE (type1)));
2842 pedwarn ("pointer type mismatch in conditional expression");
2843 result_type = build_pointer_type (void_type_node);
2846 else if (code1 == POINTER_TYPE && code2 == INTEGER_TYPE)
2848 if (! integer_zerop (op2))
2849 pedwarn ("pointer/integer type mismatch in conditional expression");
2852 op2 = null_pointer_node;
2854 result_type = type1;
2856 else if (code2 == POINTER_TYPE && code1 == INTEGER_TYPE)
2858 if (!integer_zerop (op1))
2859 pedwarn ("pointer/integer type mismatch in conditional expression");
2862 op1 = null_pointer_node;
2864 result_type = type2;
2869 if (flag_cond_mismatch)
2870 result_type = void_type_node;
2873 error ("type mismatch in conditional expression");
2874 return error_mark_node;
2878 /* Merge const and volatile flags of the incoming types. */
2880 = build_type_variant (result_type,
2881 TREE_READONLY (op1) || TREE_READONLY (op2),
2882 TREE_THIS_VOLATILE (op1) || TREE_THIS_VOLATILE (op2));
2884 if (result_type != TREE_TYPE (op1))
2885 op1 = convert_and_check (result_type, op1);
2886 if (result_type != TREE_TYPE (op2))
2887 op2 = convert_and_check (result_type, op2);
2889 if (TREE_CODE (ifexp) == INTEGER_CST)
2890 return non_lvalue (integer_zerop (ifexp) ? op2 : op1);
2892 return fold (build (COND_EXPR, result_type, ifexp, op1, op2));
2895 /* Given a list of expressions, return a compound expression
2896 that performs them all and returns the value of the last of them. */
2899 build_compound_expr (tree list)
2901 return internal_build_compound_expr (list, TRUE);
2905 internal_build_compound_expr (tree list, int first_p)
2909 if (TREE_CHAIN (list) == 0)
2911 /* Convert arrays and functions to pointers when there
2912 really is a comma operator. */
2915 = default_function_array_conversion (TREE_VALUE (list));
2917 /* Don't let (0, 0) be null pointer constant. */
2918 if (!first_p && integer_zerop (TREE_VALUE (list)))
2919 return non_lvalue (TREE_VALUE (list));
2920 return TREE_VALUE (list);
2923 rest = internal_build_compound_expr (TREE_CHAIN (list), FALSE);
2925 if (! TREE_SIDE_EFFECTS (TREE_VALUE (list)))
2927 /* The left-hand operand of a comma expression is like an expression
2928 statement: with -Wextra or -Wunused, we should warn if it doesn't have
2929 any side-effects, unless it was explicitly cast to (void). */
2930 if (warn_unused_value
2931 && ! (TREE_CODE (TREE_VALUE (list)) == CONVERT_EXPR
2932 && VOID_TYPE_P (TREE_TYPE (TREE_VALUE (list)))))
2933 warning ("left-hand operand of comma expression has no effect");
2936 /* With -Wunused, we should also warn if the left-hand operand does have
2937 side-effects, but computes a value which is not used. For example, in
2938 `foo() + bar(), baz()' the result of the `+' operator is not used,
2939 so we should issue a warning. */
2940 else if (warn_unused_value)
2941 warn_if_unused_value (TREE_VALUE (list), input_location);
2943 return build (COMPOUND_EXPR, TREE_TYPE (rest), TREE_VALUE (list), rest);
2946 /* Build an expression representing a cast to type TYPE of expression EXPR. */
2949 build_c_cast (tree type, tree expr)
2953 if (type == error_mark_node || expr == error_mark_node)
2954 return error_mark_node;
2956 /* The ObjC front-end uses TYPE_MAIN_VARIANT to tie together types differing
2957 only in <protocol> qualifications. But when constructing cast expressions,
2958 the protocols do matter and must be kept around. */
2959 if (!c_dialect_objc () || !objc_is_object_ptr (type))
2960 type = TYPE_MAIN_VARIANT (type);
2962 if (TREE_CODE (type) == ARRAY_TYPE)
2964 error ("cast specifies array type");
2965 return error_mark_node;
2968 if (TREE_CODE (type) == FUNCTION_TYPE)
2970 error ("cast specifies function type");
2971 return error_mark_node;
2974 if (type == TYPE_MAIN_VARIANT (TREE_TYPE (value)))
2978 if (TREE_CODE (type) == RECORD_TYPE
2979 || TREE_CODE (type) == UNION_TYPE)
2980 pedwarn ("ISO C forbids casting nonscalar to the same type");
2983 else if (TREE_CODE (type) == UNION_TYPE)
2986 value = default_function_array_conversion (value);
2988 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
2989 if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (field)),
2990 TYPE_MAIN_VARIANT (TREE_TYPE (value))))
2998 pedwarn ("ISO C forbids casts to union type");
2999 t = digest_init (type,
3000 build_constructor (type,
3001 build_tree_list (field, value)),
3003 TREE_CONSTANT (t) = TREE_CONSTANT (value);
3004 TREE_INVARIANT (t) = TREE_INVARIANT (value);
3007 error ("cast to union type from type not present in union");
3008 return error_mark_node;
3014 /* If casting to void, avoid the error that would come
3015 from default_conversion in the case of a non-lvalue array. */
3016 if (type == void_type_node)
3017 return build1 (CONVERT_EXPR, type, value);
3019 /* Convert functions and arrays to pointers,
3020 but don't convert any other types. */
3021 value = default_function_array_conversion (value);
3022 otype = TREE_TYPE (value);
3024 /* Optionally warn about potentially worrisome casts. */
3027 && TREE_CODE (type) == POINTER_TYPE
3028 && TREE_CODE (otype) == POINTER_TYPE)
3030 tree in_type = type;
3031 tree in_otype = otype;
3035 /* Check that the qualifiers on IN_TYPE are a superset of
3036 the qualifiers of IN_OTYPE. The outermost level of
3037 POINTER_TYPE nodes is uninteresting and we stop as soon
3038 as we hit a non-POINTER_TYPE node on either type. */
3041 in_otype = TREE_TYPE (in_otype);
3042 in_type = TREE_TYPE (in_type);
3044 /* GNU C allows cv-qualified function types. 'const'
3045 means the function is very pure, 'volatile' means it
3046 can't return. We need to warn when such qualifiers
3047 are added, not when they're taken away. */
3048 if (TREE_CODE (in_otype) == FUNCTION_TYPE
3049 && TREE_CODE (in_type) == FUNCTION_TYPE)
3050 added |= (TYPE_QUALS (in_type) & ~TYPE_QUALS (in_otype));
3052 discarded |= (TYPE_QUALS (in_otype) & ~TYPE_QUALS (in_type));
3054 while (TREE_CODE (in_type) == POINTER_TYPE
3055 && TREE_CODE (in_otype) == POINTER_TYPE);
3058 warning ("cast adds new qualifiers to function type");
3061 /* There are qualifiers present in IN_OTYPE that are not
3062 present in IN_TYPE. */
3063 warning ("cast discards qualifiers from pointer target type");
3066 /* Warn about possible alignment problems. */
3067 if (STRICT_ALIGNMENT && warn_cast_align
3068 && TREE_CODE (type) == POINTER_TYPE
3069 && TREE_CODE (otype) == POINTER_TYPE
3070 && TREE_CODE (TREE_TYPE (otype)) != VOID_TYPE
3071 && TREE_CODE (TREE_TYPE (otype)) != FUNCTION_TYPE
3072 /* Don't warn about opaque types, where the actual alignment
3073 restriction is unknown. */
3074 && !((TREE_CODE (TREE_TYPE (otype)) == UNION_TYPE
3075 || TREE_CODE (TREE_TYPE (otype)) == RECORD_TYPE)
3076 && TYPE_MODE (TREE_TYPE (otype)) == VOIDmode)
3077 && TYPE_ALIGN (TREE_TYPE (type)) > TYPE_ALIGN (TREE_TYPE (otype)))
3078 warning ("cast increases required alignment of target type");
3080 if (TREE_CODE (type) == INTEGER_TYPE
3081 && TREE_CODE (otype) == POINTER_TYPE
3082 && TYPE_PRECISION (type) != TYPE_PRECISION (otype)
3083 && !TREE_CONSTANT (value))
3084 warning ("cast from pointer to integer of different size");
3086 if (warn_bad_function_cast
3087 && TREE_CODE (value) == CALL_EXPR
3088 && TREE_CODE (type) != TREE_CODE (otype))
3089 warning ("cast does not match function type");
3091 if (TREE_CODE (type) == POINTER_TYPE
3092 && TREE_CODE (otype) == INTEGER_TYPE
3093 && TYPE_PRECISION (type) != TYPE_PRECISION (otype)
3094 /* Don't warn about converting any constant. */
3095 && !TREE_CONSTANT (value))
3096 warning ("cast to pointer from integer of different size");
3098 if (TREE_CODE (type) == POINTER_TYPE
3099 && TREE_CODE (otype) == POINTER_TYPE
3100 && TREE_CODE (expr) == ADDR_EXPR
3101 && DECL_P (TREE_OPERAND (expr, 0))
3102 && flag_strict_aliasing && warn_strict_aliasing
3103 && !VOID_TYPE_P (TREE_TYPE (type)))
3105 /* Casting the address of a decl to non void pointer. Warn
3106 if the cast breaks type based aliasing. */
3107 if (!COMPLETE_TYPE_P (TREE_TYPE (type)))
3108 warning ("type-punning to incomplete type might break strict-aliasing rules");
3111 HOST_WIDE_INT set1 = get_alias_set (TREE_TYPE (TREE_OPERAND (expr, 0)));
3112 HOST_WIDE_INT set2 = get_alias_set (TREE_TYPE (type));
3114 if (!alias_sets_conflict_p (set1, set2))
3115 warning ("dereferencing type-punned pointer will break strict-aliasing rules");
3116 else if (warn_strict_aliasing > 1
3117 && !alias_sets_might_conflict_p (set1, set2))
3118 warning ("dereferencing type-punned pointer might break strict-aliasing rules");
3122 /* If pedantic, warn for conversions between function and object
3123 pointer types, except for converting a null pointer constant
3124 to function pointer type. */
3126 && TREE_CODE (type) == POINTER_TYPE
3127 && TREE_CODE (otype) == POINTER_TYPE
3128 && TREE_CODE (TREE_TYPE (otype)) == FUNCTION_TYPE
3129 && TREE_CODE (TREE_TYPE (type)) != FUNCTION_TYPE)
3130 pedwarn ("ISO C forbids conversion of function pointer to object pointer type");
3133 && TREE_CODE (type) == POINTER_TYPE
3134 && TREE_CODE (otype) == POINTER_TYPE
3135 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE
3136 && TREE_CODE (TREE_TYPE (otype)) != FUNCTION_TYPE
3137 && !(integer_zerop (value) && TREE_TYPE (otype) == void_type_node
3138 && TREE_CODE (expr) != NOP_EXPR))
3139 pedwarn ("ISO C forbids conversion of object pointer to function pointer type");
3142 /* Replace a nonvolatile const static variable with its value. */
3143 if (optimize && TREE_CODE (value) == VAR_DECL)
3144 value = decl_constant_value (value);
3145 value = convert (type, value);
3147 /* Ignore any integer overflow caused by the cast. */
3148 if (TREE_CODE (value) == INTEGER_CST)
3150 TREE_OVERFLOW (value) = TREE_OVERFLOW (ovalue);
3152 if (TREE_CODE_CLASS (TREE_CODE (ovalue)) == 'c')
3153 TREE_CONSTANT_OVERFLOW (value) = TREE_CONSTANT_OVERFLOW (ovalue);
3157 /* Don't let (void *) (FOO *) 0 be a null pointer constant. */
3158 if (TREE_CODE (value) == INTEGER_CST
3159 && TREE_CODE (expr) == INTEGER_CST
3160 && TREE_CODE (TREE_TYPE (expr)) != INTEGER_TYPE)
3161 value = non_lvalue (value);
3163 /* Don't let a cast be an lvalue. */
3165 value = non_lvalue (value);
3170 /* Interpret a cast of expression EXPR to type TYPE. */
3172 c_cast_expr (tree type, tree expr)
3174 int saved_wsp = warn_strict_prototypes;
3176 /* This avoids warnings about unprototyped casts on
3177 integers. E.g. "#define SIG_DFL (void(*)())0". */
3178 if (TREE_CODE (expr) == INTEGER_CST)
3179 warn_strict_prototypes = 0;
3180 type = groktypename (type);
3181 warn_strict_prototypes = saved_wsp;
3183 return build_c_cast (type, expr);
3187 /* Build an assignment expression of lvalue LHS from value RHS.
3188 MODIFYCODE is the code for a binary operator that we use
3189 to combine the old value of LHS with RHS to get the new value.
3190 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment. */
3193 build_modify_expr (tree lhs, enum tree_code modifycode, tree rhs)
3197 tree lhstype = TREE_TYPE (lhs);
3198 tree olhstype = lhstype;
3200 /* Types that aren't fully specified cannot be used in assignments. */
3201 lhs = require_complete_type (lhs);
3203 /* Avoid duplicate error messages from operands that had errors. */
3204 if (TREE_CODE (lhs) == ERROR_MARK || TREE_CODE (rhs) == ERROR_MARK)
3205 return error_mark_node;
3207 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
3208 /* Do not use STRIP_NOPS here. We do not want an enumerator
3209 whose value is 0 to count as a null pointer constant. */
3210 if (TREE_CODE (rhs) == NON_LVALUE_EXPR)
3211 rhs = TREE_OPERAND (rhs, 0);
3215 /* If a binary op has been requested, combine the old LHS value with the RHS
3216 producing the value we should actually store into the LHS. */
3218 if (modifycode != NOP_EXPR)
3220 lhs = stabilize_reference (lhs);
3221 newrhs = build_binary_op (modifycode, lhs, rhs, 1);
3224 if (!lvalue_or_else (lhs, "invalid lvalue in assignment"))
3225 return error_mark_node;
3227 /* Warn about storing in something that is `const'. */
3229 if (TREE_READONLY (lhs) || TYPE_READONLY (lhstype)
3230 || ((TREE_CODE (lhstype) == RECORD_TYPE
3231 || TREE_CODE (lhstype) == UNION_TYPE)
3232 && C_TYPE_FIELDS_READONLY (lhstype)))
3233 readonly_error (lhs, "assignment");
3235 /* If storing into a structure or union member,
3236 it has probably been given type `int'.
3237 Compute the type that would go with
3238 the actual amount of storage the member occupies. */
3240 if (TREE_CODE (lhs) == COMPONENT_REF
3241 && (TREE_CODE (lhstype) == INTEGER_TYPE
3242 || TREE_CODE (lhstype) == BOOLEAN_TYPE
3243 || TREE_CODE (lhstype) == REAL_TYPE
3244 || TREE_CODE (lhstype) == ENUMERAL_TYPE))
3245 lhstype = TREE_TYPE (get_unwidened (lhs, 0));
3247 /* If storing in a field that is in actuality a short or narrower than one,
3248 we must store in the field in its actual type. */
3250 if (lhstype != TREE_TYPE (lhs))
3252 lhs = copy_node (lhs);
3253 TREE_TYPE (lhs) = lhstype;
3256 /* Convert new value to destination type. */
3258 newrhs = convert_for_assignment (lhstype, newrhs, _("assignment"),
3259 NULL_TREE, NULL_TREE, 0);
3260 if (TREE_CODE (newrhs) == ERROR_MARK)
3261 return error_mark_node;
3265 result = build (MODIFY_EXPR, lhstype, lhs, newrhs);
3266 TREE_SIDE_EFFECTS (result) = 1;
3268 /* If we got the LHS in a different type for storing in,
3269 convert the result back to the nominal type of LHS
3270 so that the value we return always has the same type
3271 as the LHS argument. */
3273 if (olhstype == TREE_TYPE (result))
3275 return convert_for_assignment (olhstype, result, _("assignment"),
3276 NULL_TREE, NULL_TREE, 0);
3279 /* Convert value RHS to type TYPE as preparation for an assignment
3280 to an lvalue of type TYPE.
3281 The real work of conversion is done by `convert'.
3282 The purpose of this function is to generate error messages
3283 for assignments that are not allowed in C.
3284 ERRTYPE is a string to use in error messages:
3285 "assignment", "return", etc. If it is null, this is parameter passing
3286 for a function call (and different error messages are output).
3288 FUNNAME is the name of the function being called,
3289 as an IDENTIFIER_NODE, or null.
3290 PARMNUM is the number of the argument, for printing in error messages. */
3293 convert_for_assignment (tree type, tree rhs, const char *errtype,
3294 tree fundecl, tree funname, int parmnum)
3296 enum tree_code codel = TREE_CODE (type);
3298 enum tree_code coder;
3300 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
3301 /* Do not use STRIP_NOPS here. We do not want an enumerator
3302 whose value is 0 to count as a null pointer constant. */
3303 if (TREE_CODE (rhs) == NON_LVALUE_EXPR)
3304 rhs = TREE_OPERAND (rhs, 0);
3306 if (TREE_CODE (TREE_TYPE (rhs)) == ARRAY_TYPE
3307 || TREE_CODE (TREE_TYPE (rhs)) == FUNCTION_TYPE)
3308 rhs = default_conversion (rhs);
3309 else if (optimize && TREE_CODE (rhs) == VAR_DECL)
3310 rhs = decl_constant_value_for_broken_optimization (rhs);
3312 rhstype = TREE_TYPE (rhs);
3313 coder = TREE_CODE (rhstype);
3315 if (coder == ERROR_MARK)
3316 return error_mark_node;
3318 if (TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (rhstype))
3320 overflow_warning (rhs);
3321 /* Check for Objective-C protocols. This will automatically
3322 issue a warning if there are protocol violations. No need to
3323 use the return value. */
3324 if (c_dialect_objc ())
3325 objc_comptypes (type, rhstype, 0);
3329 if (coder == VOID_TYPE)
3331 error ("void value not ignored as it ought to be");
3332 return error_mark_node;
3334 /* A type converts to a reference to it.
3335 This code doesn't fully support references, it's just for the
3336 special case of va_start and va_copy. */
3337 if (codel == REFERENCE_TYPE
3338 && comptypes (TREE_TYPE (type), TREE_TYPE (rhs)) == 1)
3340 if (!lvalue_p (rhs))
3342 error ("cannot pass rvalue to reference parameter");
3343 return error_mark_node;
3345 if (!c_mark_addressable (rhs))
3346 return error_mark_node;
3347 rhs = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (rhs)), rhs);
3349 /* We already know that these two types are compatible, but they
3350 may not be exactly identical. In fact, `TREE_TYPE (type)' is
3351 likely to be __builtin_va_list and `TREE_TYPE (rhs)' is
3352 likely to be va_list, a typedef to __builtin_va_list, which
3353 is different enough that it will cause problems later. */
3354 if (TREE_TYPE (TREE_TYPE (rhs)) != TREE_TYPE (type))
3355 rhs = build1 (NOP_EXPR, build_pointer_type (TREE_TYPE (type)), rhs);
3357 rhs = build1 (NOP_EXPR, type, rhs);
3360 /* Some types can interconvert without explicit casts. */
3361 else if (codel == VECTOR_TYPE
3362 && vector_types_convertible_p (type, TREE_TYPE (rhs)))
3363 return convert (type, rhs);
3364 /* Arithmetic types all interconvert, and enum is treated like int. */
3365 else if ((codel == INTEGER_TYPE || codel == REAL_TYPE
3366 || codel == ENUMERAL_TYPE || codel == COMPLEX_TYPE
3367 || codel == BOOLEAN_TYPE)
3368 && (coder == INTEGER_TYPE || coder == REAL_TYPE
3369 || coder == ENUMERAL_TYPE || coder == COMPLEX_TYPE
3370 || coder == BOOLEAN_TYPE))
3371 return convert_and_check (type, rhs);
3373 /* Conversion to a transparent union from its member types.
3374 This applies only to function arguments. */
3375 else if (codel == UNION_TYPE && TYPE_TRANSPARENT_UNION (type) && ! errtype)
3378 tree marginal_memb_type = 0;
3380 for (memb_types = TYPE_FIELDS (type); memb_types;
3381 memb_types = TREE_CHAIN (memb_types))
3383 tree memb_type = TREE_TYPE (memb_types);
3385 if (comptypes (TYPE_MAIN_VARIANT (memb_type),
3386 TYPE_MAIN_VARIANT (rhstype)))
3389 if (TREE_CODE (memb_type) != POINTER_TYPE)
3392 if (coder == POINTER_TYPE)
3394 tree ttl = TREE_TYPE (memb_type);
3395 tree ttr = TREE_TYPE (rhstype);
3397 /* Any non-function converts to a [const][volatile] void *
3398 and vice versa; otherwise, targets must be the same.
3399 Meanwhile, the lhs target must have all the qualifiers of
3401 if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
3402 || comp_target_types (memb_type, rhstype, 0))
3404 /* If this type won't generate any warnings, use it. */
3405 if (TYPE_QUALS (ttl) == TYPE_QUALS (ttr)
3406 || ((TREE_CODE (ttr) == FUNCTION_TYPE
3407 && TREE_CODE (ttl) == FUNCTION_TYPE)
3408 ? ((TYPE_QUALS (ttl) | TYPE_QUALS (ttr))
3409 == TYPE_QUALS (ttr))
3410 : ((TYPE_QUALS (ttl) | TYPE_QUALS (ttr))
3411 == TYPE_QUALS (ttl))))
3414 /* Keep looking for a better type, but remember this one. */
3415 if (! marginal_memb_type)
3416 marginal_memb_type = memb_type;
3420 /* Can convert integer zero to any pointer type. */
3421 if (integer_zerop (rhs)
3422 || (TREE_CODE (rhs) == NOP_EXPR
3423 && integer_zerop (TREE_OPERAND (rhs, 0))))
3425 rhs = null_pointer_node;
3430 if (memb_types || marginal_memb_type)
3434 /* We have only a marginally acceptable member type;
3435 it needs a warning. */
3436 tree ttl = TREE_TYPE (marginal_memb_type);
3437 tree ttr = TREE_TYPE (rhstype);
3439 /* Const and volatile mean something different for function
3440 types, so the usual warnings are not appropriate. */
3441 if (TREE_CODE (ttr) == FUNCTION_TYPE
3442 && TREE_CODE (ttl) == FUNCTION_TYPE)
3444 /* Because const and volatile on functions are
3445 restrictions that say the function will not do
3446 certain things, it is okay to use a const or volatile
3447 function where an ordinary one is wanted, but not
3449 if (TYPE_QUALS (ttl) & ~TYPE_QUALS (ttr))
3450 warn_for_assignment ("%s makes qualified function pointer from unqualified",
3451 errtype, funname, parmnum);
3453 else if (TYPE_QUALS (ttr) & ~TYPE_QUALS (ttl))
3454 warn_for_assignment ("%s discards qualifiers from pointer target type",
3459 if (pedantic && ! DECL_IN_SYSTEM_HEADER (fundecl))
3460 pedwarn ("ISO C prohibits argument conversion to union type");
3462 return build1 (NOP_EXPR, type, rhs);
3466 /* Conversions among pointers */
3467 else if ((codel == POINTER_TYPE || codel == REFERENCE_TYPE)
3468 && (coder == codel))
3470 tree ttl = TREE_TYPE (type);
3471 tree ttr = TREE_TYPE (rhstype);
3472 bool is_opaque_pointer;
3473 int target_cmp = 0; /* Cache comp_target_types () result. */
3475 /* Opaque pointers are treated like void pointers. */
3476 is_opaque_pointer = (targetm.vector_opaque_p (type)
3477 || targetm.vector_opaque_p (rhstype))
3478 && TREE_CODE (ttl) == VECTOR_TYPE
3479 && TREE_CODE (ttr) == VECTOR_TYPE;
3481 /* Any non-function converts to a [const][volatile] void *
3482 and vice versa; otherwise, targets must be the same.
3483 Meanwhile, the lhs target must have all the qualifiers of the rhs. */
3484 if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
3485 || (target_cmp = comp_target_types (type, rhstype, 0))
3486 || is_opaque_pointer
3487 || (c_common_unsigned_type (TYPE_MAIN_VARIANT (ttl))
3488 == c_common_unsigned_type (TYPE_MAIN_VARIANT (ttr))))
3491 && ((VOID_TYPE_P (ttl) && TREE_CODE (ttr) == FUNCTION_TYPE)
3494 /* Check TREE_CODE to catch cases like (void *) (char *) 0
3495 which are not ANSI null ptr constants. */
3496 && (!integer_zerop (rhs) || TREE_CODE (rhs) == NOP_EXPR)
3497 && TREE_CODE (ttl) == FUNCTION_TYPE)))
3498 warn_for_assignment ("ISO C forbids %s between function pointer and `void *'",
3499 errtype, funname, parmnum);
3500 /* Const and volatile mean something different for function types,
3501 so the usual warnings are not appropriate. */
3502 else if (TREE_CODE (ttr) != FUNCTION_TYPE
3503 && TREE_CODE (ttl) != FUNCTION_TYPE)
3505 if (TYPE_QUALS (ttr) & ~TYPE_QUALS (ttl))
3506 warn_for_assignment ("%s discards qualifiers from pointer target type",
3507 errtype, funname, parmnum);
3508 /* If this is not a case of ignoring a mismatch in signedness,
3510 else if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
3513 /* If there is a mismatch, do warn. */
3515 warn_for_assignment ("pointer targets in %s differ in signedness",
3516 errtype, funname, parmnum);
3518 else if (TREE_CODE (ttl) == FUNCTION_TYPE
3519 && TREE_CODE (ttr) == FUNCTION_TYPE)
3521 /* Because const and volatile on functions are restrictions
3522 that say the function will not do certain things,
3523 it is okay to use a const or volatile function
3524 where an ordinary one is wanted, but not vice-versa. */
3525 if (TYPE_QUALS (ttl) & ~TYPE_QUALS (ttr))
3526 warn_for_assignment ("%s makes qualified function pointer from unqualified",
3527 errtype, funname, parmnum);
3531 warn_for_assignment ("%s from incompatible pointer type",
3532 errtype, funname, parmnum);
3533 return convert (type, rhs);
3535 else if (codel == POINTER_TYPE && coder == ARRAY_TYPE)
3537 error ("invalid use of non-lvalue array");
3538 return error_mark_node;
3540 else if (codel == POINTER_TYPE && coder == INTEGER_TYPE)
3542 /* An explicit constant 0 can convert to a pointer,
3543 or one that results from arithmetic, even including
3544 a cast to integer type. */
3545 if (! (TREE_CODE (rhs) == INTEGER_CST && integer_zerop (rhs))
3547 ! (TREE_CODE (rhs) == NOP_EXPR
3548 && TREE_CODE (TREE_TYPE (rhs)) == INTEGER_TYPE
3549 && TREE_CODE (TREE_OPERAND (rhs, 0)) == INTEGER_CST
3550 && integer_zerop (TREE_OPERAND (rhs, 0))))
3551 warn_for_assignment ("%s makes pointer from integer without a cast",
3552 errtype, funname, parmnum);
3554 return convert (type, rhs);
3556 else if (codel == INTEGER_TYPE && coder == POINTER_TYPE)
3558 warn_for_assignment ("%s makes integer from pointer without a cast",
3559 errtype, funname, parmnum);
3560 return convert (type, rhs);
3562 else if (codel == BOOLEAN_TYPE && coder == POINTER_TYPE)
3563 return convert (type, rhs);
3569 tree selector = objc_message_selector ();
3571 if (selector && parmnum > 2)
3572 error ("incompatible type for argument %d of `%s'",
3573 parmnum - 2, IDENTIFIER_POINTER (selector));
3575 error ("incompatible type for argument %d of `%s'",
3576 parmnum, IDENTIFIER_POINTER (funname));
3579 error ("incompatible type for argument %d of indirect function call",
3583 error ("incompatible types in %s", errtype);
3585 return error_mark_node;
3588 /* Convert VALUE for assignment into inlined parameter PARM. ARGNUM
3589 is used for error and waring reporting and indicates which argument
3590 is being processed. */
3593 c_convert_parm_for_inlining (tree parm, tree value, tree fn, int argnum)
3597 /* If FN was prototyped, the value has been converted already
3598 in convert_arguments. */
3599 if (! value || TYPE_ARG_TYPES (TREE_TYPE (fn)))
3602 type = TREE_TYPE (parm);
3603 ret = convert_for_assignment (type, value,
3604 (char *) 0 /* arg passing */, fn,
3605 DECL_NAME (fn), argnum);
3606 if (targetm.calls.promote_prototypes (TREE_TYPE (fn))
3607 && INTEGRAL_TYPE_P (type)
3608 && (TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node)))
3609 ret = default_conversion (ret);
3613 /* Print a warning using MSGID.
3614 It gets OPNAME as its one parameter.
3615 if OPNAME is null and ARGNUM is 0, it is replaced by "passing arg of `FUNCTION'".
3616 Otherwise if OPNAME is null, it is replaced by "passing arg ARGNUM of `FUNCTION'".
3617 FUNCTION and ARGNUM are handled specially if we are building an
3618 Objective-C selector. */
3621 warn_for_assignment (const char *msgid, const char *opname, tree function,
3626 tree selector = objc_message_selector ();
3629 if (selector && argnum > 2)
3631 function = selector;
3638 /* Function name is known; supply it. */
3639 const char *const argstring = _("passing arg of `%s'");
3640 new_opname = alloca (IDENTIFIER_LENGTH (function)
3641 + strlen (argstring) + 1 + 1);
3642 sprintf (new_opname, argstring,
3643 IDENTIFIER_POINTER (function));
3647 /* Function name unknown (call through ptr). */
3648 const char *const argnofun = _("passing arg of pointer to function");
3649 new_opname = alloca (strlen (argnofun) + 1 + 1);
3650 sprintf (new_opname, argnofun);
3655 /* Function name is known; supply it. */
3656 const char *const argstring = _("passing arg %d of `%s'");
3657 new_opname = alloca (IDENTIFIER_LENGTH (function)
3658 + strlen (argstring) + 1 + 25 /*%d*/ + 1);
3659 sprintf (new_opname, argstring, argnum,
3660 IDENTIFIER_POINTER (function));
3664 /* Function name unknown (call through ptr); just give arg number. */
3665 const char *const argnofun = _("passing arg %d of pointer to function");
3666 new_opname = alloca (strlen (argnofun) + 1 + 25 /*%d*/ + 1);
3667 sprintf (new_opname, argnofun, argnum);
3669 opname = new_opname;
3671 pedwarn (msgid, opname);
3674 /* If VALUE is a compound expr all of whose expressions are constant, then
3675 return its value. Otherwise, return error_mark_node.
3677 This is for handling COMPOUND_EXPRs as initializer elements
3678 which is allowed with a warning when -pedantic is specified. */
3681 valid_compound_expr_initializer (tree value, tree endtype)
3683 if (TREE_CODE (value) == COMPOUND_EXPR)
3685 if (valid_compound_expr_initializer (TREE_OPERAND (value, 0), endtype)
3687 return error_mark_node;
3688 return valid_compound_expr_initializer (TREE_OPERAND (value, 1),
3691 else if (! TREE_CONSTANT (value)
3692 && ! initializer_constant_valid_p (value, endtype))
3693 return error_mark_node;
3698 /* Perform appropriate conversions on the initial value of a variable,
3699 store it in the declaration DECL,
3700 and print any error messages that are appropriate.
3701 If the init is invalid, store an ERROR_MARK. */
3704 store_init_value (tree decl, tree init)
3708 /* If variable's type was invalidly declared, just ignore it. */
3710 type = TREE_TYPE (decl);
3711 if (TREE_CODE (type) == ERROR_MARK)
3714 /* Digest the specified initializer into an expression. */
3716 value = digest_init (type, init, TREE_STATIC (decl));
3718 /* Store the expression if valid; else report error. */
3720 if (warn_traditional && !in_system_header
3721 && AGGREGATE_TYPE_P (TREE_TYPE (decl)) && ! TREE_STATIC (decl))
3722 warning ("traditional C rejects automatic aggregate initialization");
3724 DECL_INITIAL (decl) = value;
3726 /* ANSI wants warnings about out-of-range constant initializers. */
3727 STRIP_TYPE_NOPS (value);
3728 constant_expression_warning (value);
3730 /* Check if we need to set array size from compound literal size. */
3731 if (TREE_CODE (type) == ARRAY_TYPE
3732 && TYPE_DOMAIN (type) == 0
3733 && value != error_mark_node)
3735 tree inside_init = init;
3737 if (TREE_CODE (init) == NON_LVALUE_EXPR)
3738 inside_init = TREE_OPERAND (init, 0);
3739 inside_init = fold (inside_init);
3741 if (TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
3743 tree decl = COMPOUND_LITERAL_EXPR_DECL (inside_init);
3745 if (TYPE_DOMAIN (TREE_TYPE (decl)))
3747 /* For int foo[] = (int [3]){1}; we need to set array size
3748 now since later on array initializer will be just the
3749 brace enclosed list of the compound literal. */
3750 TYPE_DOMAIN (type) = TYPE_DOMAIN (TREE_TYPE (decl));
3752 layout_decl (decl, 0);
3758 /* Methods for storing and printing names for error messages. */
3760 /* Implement a spelling stack that allows components of a name to be pushed
3761 and popped. Each element on the stack is this structure. */
3773 #define SPELLING_STRING 1
3774 #define SPELLING_MEMBER 2
3775 #define SPELLING_BOUNDS 3
3777 static struct spelling *spelling; /* Next stack element (unused). */
3778 static struct spelling *spelling_base; /* Spelling stack base. */
3779 static int spelling_size; /* Size of the spelling stack. */
3781 /* Macros to save and restore the spelling stack around push_... functions.
3782 Alternative to SAVE_SPELLING_STACK. */
3784 #define SPELLING_DEPTH() (spelling - spelling_base)
3785 #define RESTORE_SPELLING_DEPTH(DEPTH) (spelling = spelling_base + (DEPTH))
3787 /* Push an element on the spelling stack with type KIND and assign VALUE
3790 #define PUSH_SPELLING(KIND, VALUE, MEMBER) \
3792 int depth = SPELLING_DEPTH (); \
3794 if (depth >= spelling_size) \
3796 spelling_size += 10; \
3797 if (spelling_base == 0) \
3798 spelling_base = xmalloc (spelling_size * sizeof (struct spelling)); \
3800 spelling_base = xrealloc (spelling_base, \
3801 spelling_size * sizeof (struct spelling)); \
3802 RESTORE_SPELLING_DEPTH (depth); \
3805 spelling->kind = (KIND); \
3806 spelling->MEMBER = (VALUE); \
3810 /* Push STRING on the stack. Printed literally. */
3813 push_string (const char *string)
3815 PUSH_SPELLING (SPELLING_STRING, string, u.s);
3818 /* Push a member name on the stack. Printed as '.' STRING. */
3821 push_member_name (tree decl)
3823 const char *const string
3824 = DECL_NAME (decl) ? IDENTIFIER_POINTER (DECL_NAME (decl)) : "<anonymous>";
3825 PUSH_SPELLING (SPELLING_MEMBER, string, u.s);
3828 /* Push an array bounds on the stack. Printed as [BOUNDS]. */
3831 push_array_bounds (int bounds)
3833 PUSH_SPELLING (SPELLING_BOUNDS, bounds, u.i);
3836 /* Compute the maximum size in bytes of the printed spelling. */
3839 spelling_length (void)
3844 for (p = spelling_base; p < spelling; p++)
3846 if (p->kind == SPELLING_BOUNDS)
3849 size += strlen (p->u.s) + 1;
3855 /* Print the spelling to BUFFER and return it. */
3858 print_spelling (char *buffer)
3863 for (p = spelling_base; p < spelling; p++)
3864 if (p->kind == SPELLING_BOUNDS)
3866 sprintf (d, "[%d]", p->u.i);
3872 if (p->kind == SPELLING_MEMBER)
3874 for (s = p->u.s; (*d = *s++); d++)
3881 /* Issue an error message for a bad initializer component.
3882 MSGID identifies the message.
3883 The component name is taken from the spelling stack. */
3886 error_init (const char *msgid)
3890 error ("%s", _(msgid));
3891 ofwhat = print_spelling (alloca (spelling_length () + 1));
3893 error ("(near initialization for `%s')", ofwhat);
3896 /* Issue a pedantic warning for a bad initializer component.
3897 MSGID identifies the message.
3898 The component name is taken from the spelling stack. */
3901 pedwarn_init (const char *msgid)
3905 pedwarn ("%s", _(msgid));
3906 ofwhat = print_spelling (alloca (spelling_length () + 1));
3908 pedwarn ("(near initialization for `%s')", ofwhat);
3911 /* Issue a warning for a bad initializer component.
3912 MSGID identifies the message.
3913 The component name is taken from the spelling stack. */
3916 warning_init (const char *msgid)
3920 warning ("%s", _(msgid));
3921 ofwhat = print_spelling (alloca (spelling_length () + 1));
3923 warning ("(near initialization for `%s')", ofwhat);
3926 /* Digest the parser output INIT as an initializer for type TYPE.
3927 Return a C expression of type TYPE to represent the initial value.
3929 REQUIRE_CONSTANT requests an error if non-constant initializers or
3930 elements are seen. */
3933 digest_init (tree type, tree init, int require_constant)
3935 enum tree_code code = TREE_CODE (type);
3936 tree inside_init = init;
3938 if (type == error_mark_node
3939 || init == error_mark_node
3940 || TREE_TYPE (init) == error_mark_node)
3941 return error_mark_node;
3943 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
3944 /* Do not use STRIP_NOPS here. We do not want an enumerator
3945 whose value is 0 to count as a null pointer constant. */
3946 if (TREE_CODE (init) == NON_LVALUE_EXPR)
3947 inside_init = TREE_OPERAND (init, 0);
3949 inside_init = fold (inside_init);
3951 /* Initialization of an array of chars from a string constant
3952 optionally enclosed in braces. */
3954 if (code == ARRAY_TYPE)
3956 tree typ1 = TYPE_MAIN_VARIANT (TREE_TYPE (type));
3957 if ((typ1 == char_type_node
3958 || typ1 == signed_char_type_node
3959 || typ1 == unsigned_char_type_node
3960 || typ1 == unsigned_wchar_type_node
3961 || typ1 == signed_wchar_type_node)
3962 && ((inside_init && TREE_CODE (inside_init) == STRING_CST)))
3964 if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
3965 TYPE_MAIN_VARIANT (type)))
3968 if ((TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (inside_init)))
3970 && TYPE_PRECISION (typ1) == TYPE_PRECISION (char_type_node))
3972 error_init ("char-array initialized from wide string");
3973 return error_mark_node;
3975 if ((TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (inside_init)))
3977 && TYPE_PRECISION (typ1) != TYPE_PRECISION (char_type_node))
3979 error_init ("int-array initialized from non-wide string");
3980 return error_mark_node;
3983 TREE_TYPE (inside_init) = type;
3984 if (TYPE_DOMAIN (type) != 0
3985 && TYPE_SIZE (type) != 0
3986 && TREE_CODE (TYPE_SIZE (type)) == INTEGER_CST
3987 /* Subtract 1 (or sizeof (wchar_t))
3988 because it's ok to ignore the terminating null char
3989 that is counted in the length of the constant. */
3990 && 0 > compare_tree_int (TYPE_SIZE_UNIT (type),
3991 TREE_STRING_LENGTH (inside_init)
3992 - ((TYPE_PRECISION (typ1)
3993 != TYPE_PRECISION (char_type_node))
3994 ? (TYPE_PRECISION (wchar_type_node)
3997 pedwarn_init ("initializer-string for array of chars is too long");
4003 /* Build a VECTOR_CST from a *constant* vector constructor. If the
4004 vector constructor is not constant (e.g. {1,2,3,foo()}) then punt
4005 below and handle as a constructor. */
4006 if (code == VECTOR_TYPE
4007 && vector_types_convertible_p (TREE_TYPE (inside_init), type)
4008 && TREE_CONSTANT (inside_init))
4010 if (TREE_CODE (inside_init) == VECTOR_CST
4011 && comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
4012 TYPE_MAIN_VARIANT (type)))
4015 return build_vector (type, CONSTRUCTOR_ELTS (inside_init));
4018 /* Any type can be initialized
4019 from an expression of the same type, optionally with braces. */
4021 if (inside_init && TREE_TYPE (inside_init) != 0
4022 && (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
4023 TYPE_MAIN_VARIANT (type))
4024 || (code == ARRAY_TYPE
4025 && comptypes (TREE_TYPE (inside_init), type))
4026 || (code == VECTOR_TYPE
4027 && comptypes (TREE_TYPE (inside_init), type))
4028 || (code == POINTER_TYPE
4029 && TREE_CODE (TREE_TYPE (inside_init)) == ARRAY_TYPE
4030 && comptypes (TREE_TYPE (TREE_TYPE (inside_init)),
4032 || (code == POINTER_TYPE
4033 && TREE_CODE (TREE_TYPE (inside_init)) == FUNCTION_TYPE
4034 && comptypes (TREE_TYPE (inside_init),
4035 TREE_TYPE (type)))))
4037 if (code == POINTER_TYPE)
4039 inside_init = default_function_array_conversion (inside_init);
4041 if (TREE_CODE (TREE_TYPE (inside_init)) == ARRAY_TYPE)
4043 error_init ("invalid use of non-lvalue array");
4044 return error_mark_node;
4048 if (code == VECTOR_TYPE)
4049 /* Although the types are compatible, we may require a
4051 inside_init = convert (type, inside_init);
4053 if (require_constant && !flag_isoc99
4054 && TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
4056 /* As an extension, allow initializing objects with static storage
4057 duration with compound literals (which are then treated just as
4058 the brace enclosed list they contain). */
4059 tree decl = COMPOUND_LITERAL_EXPR_DECL (inside_init);
4060 inside_init = DECL_INITIAL (decl);
4063 if (code == ARRAY_TYPE && TREE_CODE (inside_init) != STRING_CST
4064 && TREE_CODE (inside_init) != CONSTRUCTOR)
4066 error_init ("array initialized from non-constant array expression");
4067 return error_mark_node;
4070 if (optimize && TREE_CODE (inside_init) == VAR_DECL)
4071 inside_init = decl_constant_value_for_broken_optimization (inside_init);
4073 /* Compound expressions can only occur here if -pedantic or
4074 -pedantic-errors is specified. In the later case, we always want
4075 an error. In the former case, we simply want a warning. */
4076 if (require_constant && pedantic
4077 && TREE_CODE (inside_init) == COMPOUND_EXPR)
4080 = valid_compound_expr_initializer (inside_init,
4081 TREE_TYPE (inside_init));
4082 if (inside_init == error_mark_node)
4083 error_init ("initializer element is not constant");
4085 pedwarn_init ("initializer element is not constant");
4086 if (flag_pedantic_errors)
4087 inside_init = error_mark_node;
4089 else if (require_constant
4090 && (!TREE_CONSTANT (inside_init)
4091 /* This test catches things like `7 / 0' which
4092 result in an expression for which TREE_CONSTANT
4093 is true, but which is not actually something
4094 that is a legal constant. We really should not
4095 be using this function, because it is a part of
4096 the back-end. Instead, the expression should
4097 already have been turned into ERROR_MARK_NODE. */
4098 || !initializer_constant_valid_p (inside_init,
4099 TREE_TYPE (inside_init))))
4101 error_init ("initializer element is not constant");
4102 inside_init = error_mark_node;
4108 /* Handle scalar types, including conversions. */
4110 if (code == INTEGER_TYPE || code == REAL_TYPE || code == POINTER_TYPE
4111 || code == ENUMERAL_TYPE || code == BOOLEAN_TYPE || code == COMPLEX_TYPE
4112 || code == VECTOR_TYPE)
4114 /* Note that convert_for_assignment calls default_conversion
4115 for arrays and functions. We must not call it in the
4116 case where inside_init is a null pointer constant. */
4118 = convert_for_assignment (type, init, _("initialization"),
4119 NULL_TREE, NULL_TREE, 0);
4121 if (require_constant && ! TREE_CONSTANT (inside_init))
4123 error_init ("initializer element is not constant");
4124 inside_init = error_mark_node;
4126 else if (require_constant
4127 && initializer_constant_valid_p (inside_init, TREE_TYPE (inside_init)) == 0)
4129 error_init ("initializer element is not computable at load time");
4130 inside_init = error_mark_node;
4136 /* Come here only for records and arrays. */
4138 if (COMPLETE_TYPE_P (type) && TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST)
4140 error_init ("variable-sized object may not be initialized");
4141 return error_mark_node;
4144 error_init ("invalid initializer");
4145 return error_mark_node;
4148 /* Handle initializers that use braces. */
4150 /* Type of object we are accumulating a constructor for.
4151 This type is always a RECORD_TYPE, UNION_TYPE or ARRAY_TYPE. */
4152 static tree constructor_type;
4154 /* For a RECORD_TYPE or UNION_TYPE, this is the chain of fields
4156 static tree constructor_fields;
4158 /* For an ARRAY_TYPE, this is the specified index
4159 at which to store the next element we get. */
4160 static tree constructor_index;
4162 /* For an ARRAY_TYPE, this is the maximum index. */
4163 static tree constructor_max_index;
4165 /* For a RECORD_TYPE, this is the first field not yet written out. */
4166 static tree constructor_unfilled_fields;
4168 /* For an ARRAY_TYPE, this is the index of the first element
4169 not yet written out. */
4170 static tree constructor_unfilled_index;
4172 /* In a RECORD_TYPE, the byte index of the next consecutive field.
4173 This is so we can generate gaps between fields, when appropriate. */
4174 static tree constructor_bit_index;
4176 /* If we are saving up the elements rather than allocating them,
4177 this is the list of elements so far (in reverse order,
4178 most recent first). */
4179 static tree constructor_elements;
4181 /* 1 if constructor should be incrementally stored into a constructor chain,
4182 0 if all the elements should be kept in AVL tree. */
4183 static int constructor_incremental;
4185 /* 1 if so far this constructor's elements are all compile-time constants. */
4186 static int constructor_constant;
4188 /* 1 if so far this constructor's elements are all valid address constants. */
4189 static int constructor_simple;
4191 /* 1 if this constructor is erroneous so far. */
4192 static int constructor_erroneous;
4194 /* Structure for managing pending initializer elements, organized as an
4199 struct init_node *left, *right;
4200 struct init_node *parent;
4206 /* Tree of pending elements at this constructor level.
4207 These are elements encountered out of order
4208 which belong at places we haven't reached yet in actually
4210 Will never hold tree nodes across GC runs. */
4211 static struct init_node *constructor_pending_elts;
4213 /* The SPELLING_DEPTH of this constructor. */
4214 static int constructor_depth;
4216 /* 0 if implicitly pushing constructor levels is allowed. */
4217 int constructor_no_implicit = 0; /* 0 for C; 1 for some other languages. */
4219 /* DECL node for which an initializer is being read.
4220 0 means we are reading a constructor expression
4221 such as (struct foo) {...}. */
4222 static tree constructor_decl;
4224 /* start_init saves the ASMSPEC arg here for really_start_incremental_init. */
4225 static const char *constructor_asmspec;
4227 /* Nonzero if this is an initializer for a top-level decl. */
4228 static int constructor_top_level;
4230 /* Nonzero if there were any member designators in this initializer. */
4231 static int constructor_designated;
4233 /* Nesting depth of designator list. */
4234 static int designator_depth;
4236 /* Nonzero if there were diagnosed errors in this designator list. */
4237 static int designator_errorneous;
4240 /* This stack has a level for each implicit or explicit level of
4241 structuring in the initializer, including the outermost one. It
4242 saves the values of most of the variables above. */
4244 struct constructor_range_stack;
4246 struct constructor_stack
4248 struct constructor_stack *next;
4253 tree unfilled_index;
4254 tree unfilled_fields;
4257 struct init_node *pending_elts;
4260 /* If nonzero, this value should replace the entire
4261 constructor at this level. */
4262 tree replacement_value;
4263 struct constructor_range_stack *range_stack;
4273 struct constructor_stack *constructor_stack;
4275 /* This stack represents designators from some range designator up to
4276 the last designator in the list. */
4278 struct constructor_range_stack
4280 struct constructor_range_stack *next, *prev;
4281 struct constructor_stack *stack;
4288 struct constructor_range_stack *constructor_range_stack;
4290 /* This stack records separate initializers that are nested.
4291 Nested initializers can't happen in ANSI C, but GNU C allows them
4292 in cases like { ... (struct foo) { ... } ... }. */
4294 struct initializer_stack
4296 struct initializer_stack *next;
4298 const char *asmspec;
4299 struct constructor_stack *constructor_stack;
4300 struct constructor_range_stack *constructor_range_stack;
4302 struct spelling *spelling;
4303 struct spelling *spelling_base;
4306 char require_constant_value;
4307 char require_constant_elements;
4310 struct initializer_stack *initializer_stack;
4312 /* Prepare to parse and output the initializer for variable DECL. */
4315 start_init (tree decl, tree asmspec_tree, int top_level)
4318 struct initializer_stack *p = xmalloc (sizeof (struct initializer_stack));
4319 const char *asmspec = 0;
4322 asmspec = TREE_STRING_POINTER (asmspec_tree);
4324 p->decl = constructor_decl;
4325 p->asmspec = constructor_asmspec;
4326 p->require_constant_value = require_constant_value;
4327 p->require_constant_elements = require_constant_elements;
4328 p->constructor_stack = constructor_stack;
4329 p->constructor_range_stack = constructor_range_stack;
4330 p->elements = constructor_elements;
4331 p->spelling = spelling;
4332 p->spelling_base = spelling_base;
4333 p->spelling_size = spelling_size;
4334 p->top_level = constructor_top_level;
4335 p->next = initializer_stack;
4336 initializer_stack = p;
4338 constructor_decl = decl;
4339 constructor_asmspec = asmspec;
4340 constructor_designated = 0;
4341 constructor_top_level = top_level;
4345 require_constant_value = TREE_STATIC (decl);
4346 require_constant_elements
4347 = ((TREE_STATIC (decl) || (pedantic && !flag_isoc99))
4348 /* For a scalar, you can always use any value to initialize,
4349 even within braces. */
4350 && (TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE
4351 || TREE_CODE (TREE_TYPE (decl)) == RECORD_TYPE
4352 || TREE_CODE (TREE_TYPE (decl)) == UNION_TYPE
4353 || TREE_CODE (TREE_TYPE (decl)) == QUAL_UNION_TYPE));
4354 locus = IDENTIFIER_POINTER (DECL_NAME (decl));
4358 require_constant_value = 0;
4359 require_constant_elements = 0;
4360 locus = "(anonymous)";
4363 constructor_stack = 0;
4364 constructor_range_stack = 0;
4366 missing_braces_mentioned = 0;
4370 RESTORE_SPELLING_DEPTH (0);
4373 push_string (locus);
4379 struct initializer_stack *p = initializer_stack;
4381 /* Free the whole constructor stack of this initializer. */
4382 while (constructor_stack)
4384 struct constructor_stack *q = constructor_stack;
4385 constructor_stack = q->next;
4389 if (constructor_range_stack)
4392 /* Pop back to the data of the outer initializer (if any). */
4393 free (spelling_base);
4395 constructor_decl = p->decl;
4396 constructor_asmspec = p->asmspec;
4397 require_constant_value = p->require_constant_value;
4398 require_constant_elements = p->require_constant_elements;
4399 constructor_stack = p->constructor_stack;
4400 constructor_range_stack = p->constructor_range_stack;
4401 constructor_elements = p->elements;
4402 spelling = p->spelling;
4403 spelling_base = p->spelling_base;
4404 spelling_size = p->spelling_size;
4405 constructor_top_level = p->top_level;
4406 initializer_stack = p->next;
4410 /* Call here when we see the initializer is surrounded by braces.
4411 This is instead of a call to push_init_level;
4412 it is matched by a call to pop_init_level.
4414 TYPE is the type to initialize, for a constructor expression.
4415 For an initializer for a decl, TYPE is zero. */
4418 really_start_incremental_init (tree type)
4420 struct constructor_stack *p = xmalloc (sizeof (struct constructor_stack));
4423 type = TREE_TYPE (constructor_decl);
4425 if (targetm.vector_opaque_p (type))
4426 error ("opaque vector types cannot be initialized");
4428 p->type = constructor_type;
4429 p->fields = constructor_fields;
4430 p->index = constructor_index;
4431 p->max_index = constructor_max_index;
4432 p->unfilled_index = constructor_unfilled_index;
4433 p->unfilled_fields = constructor_unfilled_fields;
4434 p->bit_index = constructor_bit_index;
4435 p->elements = constructor_elements;
4436 p->constant = constructor_constant;
4437 p->simple = constructor_simple;
4438 p->erroneous = constructor_erroneous;
4439 p->pending_elts = constructor_pending_elts;
4440 p->depth = constructor_depth;
4441 p->replacement_value = 0;
4445 p->incremental = constructor_incremental;
4446 p->designated = constructor_designated;
4448 constructor_stack = p;
4450 constructor_constant = 1;
4451 constructor_simple = 1;
4452 constructor_depth = SPELLING_DEPTH ();
4453 constructor_elements = 0;
4454 constructor_pending_elts = 0;
4455 constructor_type = type;
4456 constructor_incremental = 1;
4457 constructor_designated = 0;
4458 designator_depth = 0;
4459 designator_errorneous = 0;
4461 if (TREE_CODE (constructor_type) == RECORD_TYPE
4462 || TREE_CODE (constructor_type) == UNION_TYPE)
4464 constructor_fields = TYPE_FIELDS (constructor_type);
4465 /* Skip any nameless bit fields at the beginning. */
4466 while (constructor_fields != 0 && DECL_C_BIT_FIELD (constructor_fields)
4467 && DECL_NAME (constructor_fields) == 0)
4468 constructor_fields = TREE_CHAIN (constructor_fields);
4470 constructor_unfilled_fields = constructor_fields;
4471 constructor_bit_index = bitsize_zero_node;
4473 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
4475 if (TYPE_DOMAIN (constructor_type))
4477 constructor_max_index
4478 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type));
4480 /* Detect non-empty initializations of zero-length arrays. */
4481 if (constructor_max_index == NULL_TREE
4482 && TYPE_SIZE (constructor_type))
4483 constructor_max_index = build_int_2 (-1, -1);
4485 /* constructor_max_index needs to be an INTEGER_CST. Attempts
4486 to initialize VLAs will cause a proper error; avoid tree
4487 checking errors as well by setting a safe value. */
4488 if (constructor_max_index
4489 && TREE_CODE (constructor_max_index) != INTEGER_CST)
4490 constructor_max_index = build_int_2 (-1, -1);
4493 = convert (bitsizetype,
4494 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
4497 constructor_index = bitsize_zero_node;
4499 constructor_unfilled_index = constructor_index;
4501 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
4503 /* Vectors are like simple fixed-size arrays. */
4504 constructor_max_index =
4505 build_int_2 (TYPE_VECTOR_SUBPARTS (constructor_type) - 1, 0);
4506 constructor_index = convert (bitsizetype, bitsize_zero_node);
4507 constructor_unfilled_index = constructor_index;
4511 /* Handle the case of int x = {5}; */
4512 constructor_fields = constructor_type;
4513 constructor_unfilled_fields = constructor_type;
4517 /* Push down into a subobject, for initialization.
4518 If this is for an explicit set of braces, IMPLICIT is 0.
4519 If it is because the next element belongs at a lower level,
4520 IMPLICIT is 1 (or 2 if the push is because of designator list). */
4523 push_init_level (int implicit)
4525 struct constructor_stack *p;
4526 tree value = NULL_TREE;
4528 /* If we've exhausted any levels that didn't have braces,
4530 while (constructor_stack->implicit)
4532 if ((TREE_CODE (constructor_type) == RECORD_TYPE
4533 || TREE_CODE (constructor_type) == UNION_TYPE)
4534 && constructor_fields == 0)
4535 process_init_element (pop_init_level (1));
4536 else if (TREE_CODE (constructor_type) == ARRAY_TYPE
4537 && constructor_max_index
4538 && tree_int_cst_lt (constructor_max_index, constructor_index))
4539 process_init_element (pop_init_level (1));
4544 /* Unless this is an explicit brace, we need to preserve previous
4548 if ((TREE_CODE (constructor_type) == RECORD_TYPE
4549 || TREE_CODE (constructor_type) == UNION_TYPE)
4550 && constructor_fields)
4551 value = find_init_member (constructor_fields);
4552 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
4553 value = find_init_member (constructor_index);
4556 p = xmalloc (sizeof (struct constructor_stack));
4557 p->type = constructor_type;
4558 p->fields = constructor_fields;
4559 p->index = constructor_index;
4560 p->max_index = constructor_max_index;
4561 p->unfilled_index = constructor_unfilled_index;
4562 p->unfilled_fields = constructor_unfilled_fields;
4563 p->bit_index = constructor_bit_index;
4564 p->elements = constructor_elements;
4565 p->constant = constructor_constant;
4566 p->simple = constructor_simple;
4567 p->erroneous = constructor_erroneous;
4568 p->pending_elts = constructor_pending_elts;
4569 p->depth = constructor_depth;
4570 p->replacement_value = 0;
4571 p->implicit = implicit;
4573 p->incremental = constructor_incremental;
4574 p->designated = constructor_designated;
4575 p->next = constructor_stack;
4577 constructor_stack = p;
4579 constructor_constant = 1;
4580 constructor_simple = 1;
4581 constructor_depth = SPELLING_DEPTH ();
4582 constructor_elements = 0;
4583 constructor_incremental = 1;
4584 constructor_designated = 0;
4585 constructor_pending_elts = 0;
4588 p->range_stack = constructor_range_stack;
4589 constructor_range_stack = 0;
4590 designator_depth = 0;
4591 designator_errorneous = 0;
4594 /* Don't die if an entire brace-pair level is superfluous
4595 in the containing level. */
4596 if (constructor_type == 0)
4598 else if (TREE_CODE (constructor_type) == RECORD_TYPE
4599 || TREE_CODE (constructor_type) == UNION_TYPE)
4601 /* Don't die if there are extra init elts at the end. */
4602 if (constructor_fields == 0)
4603 constructor_type = 0;
4606 constructor_type = TREE_TYPE (constructor_fields);
4607 push_member_name (constructor_fields);
4608 constructor_depth++;
4611 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
4613 constructor_type = TREE_TYPE (constructor_type);
4614 push_array_bounds (tree_low_cst (constructor_index, 0));
4615 constructor_depth++;
4618 if (constructor_type == 0)
4620 error_init ("extra brace group at end of initializer");
4621 constructor_fields = 0;
4622 constructor_unfilled_fields = 0;
4626 if (value && TREE_CODE (value) == CONSTRUCTOR)
4628 constructor_constant = TREE_CONSTANT (value);
4629 constructor_simple = TREE_STATIC (value);
4630 constructor_elements = CONSTRUCTOR_ELTS (value);
4631 if (constructor_elements
4632 && (TREE_CODE (constructor_type) == RECORD_TYPE
4633 || TREE_CODE (constructor_type) == ARRAY_TYPE))
4634 set_nonincremental_init ();
4637 if (implicit == 1 && warn_missing_braces && !missing_braces_mentioned)
4639 missing_braces_mentioned = 1;
4640 warning_init ("missing braces around initializer");
4643 if (TREE_CODE (constructor_type) == RECORD_TYPE
4644 || TREE_CODE (constructor_type) == UNION_TYPE)
4646 constructor_fields = TYPE_FIELDS (constructor_type);
4647 /* Skip any nameless bit fields at the beginning. */
4648 while (constructor_fields != 0 && DECL_C_BIT_FIELD (constructor_fields)
4649 && DECL_NAME (constructor_fields) == 0)
4650 constructor_fields = TREE_CHAIN (constructor_fields);
4652 constructor_unfilled_fields = constructor_fields;
4653 constructor_bit_index = bitsize_zero_node;
4655 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
4657 /* Vectors are like simple fixed-size arrays. */
4658 constructor_max_index =
4659 build_int_2 (TYPE_VECTOR_SUBPARTS (constructor_type) - 1, 0);
4660 constructor_index = convert (bitsizetype, integer_zero_node);
4661 constructor_unfilled_index = constructor_index;
4663 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
4665 if (TYPE_DOMAIN (constructor_type))
4667 constructor_max_index
4668 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type));
4670 /* Detect non-empty initializations of zero-length arrays. */
4671 if (constructor_max_index == NULL_TREE
4672 && TYPE_SIZE (constructor_type))
4673 constructor_max_index = build_int_2 (-1, -1);
4675 /* constructor_max_index needs to be an INTEGER_CST. Attempts
4676 to initialize VLAs will cause a proper error; avoid tree
4677 checking errors as well by setting a safe value. */
4678 if (constructor_max_index
4679 && TREE_CODE (constructor_max_index) != INTEGER_CST)
4680 constructor_max_index = build_int_2 (-1, -1);
4683 = convert (bitsizetype,
4684 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
4687 constructor_index = bitsize_zero_node;
4689 constructor_unfilled_index = constructor_index;
4690 if (value && TREE_CODE (value) == STRING_CST)
4692 /* We need to split the char/wchar array into individual
4693 characters, so that we don't have to special case it
4695 set_nonincremental_init_from_string (value);
4700 warning_init ("braces around scalar initializer");
4701 constructor_fields = constructor_type;
4702 constructor_unfilled_fields = constructor_type;
4706 /* At the end of an implicit or explicit brace level,
4707 finish up that level of constructor.
4708 If we were outputting the elements as they are read, return 0
4709 from inner levels (process_init_element ignores that),
4710 but return error_mark_node from the outermost level
4711 (that's what we want to put in DECL_INITIAL).
4712 Otherwise, return a CONSTRUCTOR expression. */
4715 pop_init_level (int implicit)
4717 struct constructor_stack *p;
4718 tree constructor = 0;
4722 /* When we come to an explicit close brace,
4723 pop any inner levels that didn't have explicit braces. */
4724 while (constructor_stack->implicit)
4725 process_init_element (pop_init_level (1));
4727 if (constructor_range_stack)
4731 /* Now output all pending elements. */
4732 constructor_incremental = 1;
4733 output_pending_init_elements (1);
4735 p = constructor_stack;
4737 /* Error for initializing a flexible array member, or a zero-length
4738 array member in an inappropriate context. */
4739 if (constructor_type && constructor_fields
4740 && TREE_CODE (constructor_type) == ARRAY_TYPE
4741 && TYPE_DOMAIN (constructor_type)
4742 && ! TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type)))
4744 /* Silently discard empty initializations. The parser will
4745 already have pedwarned for empty brackets. */
4746 if (integer_zerop (constructor_unfilled_index))
4747 constructor_type = NULL_TREE;
4748 else if (! TYPE_SIZE (constructor_type))
4750 if (constructor_depth > 2)
4751 error_init ("initialization of flexible array member in a nested context");
4753 pedwarn_init ("initialization of a flexible array member");
4755 /* We have already issued an error message for the existence
4756 of a flexible array member not at the end of the structure.
4757 Discard the initializer so that we do not abort later. */
4758 if (TREE_CHAIN (constructor_fields) != NULL_TREE)
4759 constructor_type = NULL_TREE;
4762 /* Zero-length arrays are no longer special, so we should no longer
4767 /* Warn when some struct elements are implicitly initialized to zero. */
4770 && TREE_CODE (constructor_type) == RECORD_TYPE
4771 && constructor_unfilled_fields)
4773 /* Do not warn for flexible array members or zero-length arrays. */
4774 while (constructor_unfilled_fields
4775 && (! DECL_SIZE (constructor_unfilled_fields)
4776 || integer_zerop (DECL_SIZE (constructor_unfilled_fields))))
4777 constructor_unfilled_fields = TREE_CHAIN (constructor_unfilled_fields);
4779 /* Do not warn if this level of the initializer uses member
4780 designators; it is likely to be deliberate. */
4781 if (constructor_unfilled_fields && !constructor_designated)
4783 push_member_name (constructor_unfilled_fields);
4784 warning_init ("missing initializer");
4785 RESTORE_SPELLING_DEPTH (constructor_depth);
4789 /* Pad out the end of the structure. */
4790 if (p->replacement_value)
4791 /* If this closes a superfluous brace pair,
4792 just pass out the element between them. */
4793 constructor = p->replacement_value;
4794 else if (constructor_type == 0)
4796 else if (TREE_CODE (constructor_type) != RECORD_TYPE
4797 && TREE_CODE (constructor_type) != UNION_TYPE
4798 && TREE_CODE (constructor_type) != ARRAY_TYPE
4799 && TREE_CODE (constructor_type) != VECTOR_TYPE)
4801 /* A nonincremental scalar initializer--just return
4802 the element, after verifying there is just one. */
4803 if (constructor_elements == 0)
4805 if (!constructor_erroneous)
4806 error_init ("empty scalar initializer");
4807 constructor = error_mark_node;
4809 else if (TREE_CHAIN (constructor_elements) != 0)
4811 error_init ("extra elements in scalar initializer");
4812 constructor = TREE_VALUE (constructor_elements);
4815 constructor = TREE_VALUE (constructor_elements);
4819 if (constructor_erroneous)
4820 constructor = error_mark_node;
4823 constructor = build_constructor (constructor_type,
4824 nreverse (constructor_elements));
4825 if (constructor_constant)
4826 TREE_CONSTANT (constructor) = TREE_INVARIANT (constructor) = 1;
4827 if (constructor_constant && constructor_simple)
4828 TREE_STATIC (constructor) = 1;
4832 constructor_type = p->type;
4833 constructor_fields = p->fields;
4834 constructor_index = p->index;
4835 constructor_max_index = p->max_index;
4836 constructor_unfilled_index = p->unfilled_index;
4837 constructor_unfilled_fields = p->unfilled_fields;
4838 constructor_bit_index = p->bit_index;
4839 constructor_elements = p->elements;
4840 constructor_constant = p->constant;
4841 constructor_simple = p->simple;
4842 constructor_erroneous = p->erroneous;
4843 constructor_incremental = p->incremental;
4844 constructor_designated = p->designated;
4845 constructor_pending_elts = p->pending_elts;
4846 constructor_depth = p->depth;
4848 constructor_range_stack = p->range_stack;
4849 RESTORE_SPELLING_DEPTH (constructor_depth);
4851 constructor_stack = p->next;
4854 if (constructor == 0)
4856 if (constructor_stack == 0)
4857 return error_mark_node;
4863 /* Common handling for both array range and field name designators.
4864 ARRAY argument is nonzero for array ranges. Returns zero for success. */
4867 set_designator (int array)
4870 enum tree_code subcode;
4872 /* Don't die if an entire brace-pair level is superfluous
4873 in the containing level. */
4874 if (constructor_type == 0)
4877 /* If there were errors in this designator list already, bail out silently. */
4878 if (designator_errorneous)
4881 if (!designator_depth)
4883 if (constructor_range_stack)
4886 /* Designator list starts at the level of closest explicit
4888 while (constructor_stack->implicit)
4889 process_init_element (pop_init_level (1));
4890 constructor_designated = 1;
4894 if (constructor_no_implicit)
4896 error_init ("initialization designators may not nest");
4900 if (TREE_CODE (constructor_type) == RECORD_TYPE
4901 || TREE_CODE (constructor_type) == UNION_TYPE)
4903 subtype = TREE_TYPE (constructor_fields);
4904 if (subtype != error_mark_node)
4905 subtype = TYPE_MAIN_VARIANT (subtype);
4907 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
4909 subtype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
4914 subcode = TREE_CODE (subtype);
4915 if (array && subcode != ARRAY_TYPE)
4917 error_init ("array index in non-array initializer");
4920 else if (!array && subcode != RECORD_TYPE && subcode != UNION_TYPE)
4922 error_init ("field name not in record or union initializer");
4926 constructor_designated = 1;
4927 push_init_level (2);
4931 /* If there are range designators in designator list, push a new designator
4932 to constructor_range_stack. RANGE_END is end of such stack range or
4933 NULL_TREE if there is no range designator at this level. */
4936 push_range_stack (tree range_end)
4938 struct constructor_range_stack *p;
4940 p = ggc_alloc (sizeof (struct constructor_range_stack));
4941 p->prev = constructor_range_stack;
4943 p->fields = constructor_fields;
4944 p->range_start = constructor_index;
4945 p->index = constructor_index;
4946 p->stack = constructor_stack;
4947 p->range_end = range_end;
4948 if (constructor_range_stack)
4949 constructor_range_stack->next = p;
4950 constructor_range_stack = p;
4953 /* Within an array initializer, specify the next index to be initialized.
4954 FIRST is that index. If LAST is nonzero, then initialize a range
4955 of indices, running from FIRST through LAST. */
4958 set_init_index (tree first, tree last)
4960 if (set_designator (1))
4963 designator_errorneous = 1;
4965 while ((TREE_CODE (first) == NOP_EXPR
4966 || TREE_CODE (first) == CONVERT_EXPR
4967 || TREE_CODE (first) == NON_LVALUE_EXPR)
4968 && (TYPE_MODE (TREE_TYPE (first))
4969 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (first, 0)))))
4970 first = TREE_OPERAND (first, 0);
4973 while ((TREE_CODE (last) == NOP_EXPR
4974 || TREE_CODE (last) == CONVERT_EXPR
4975 || TREE_CODE (last) == NON_LVALUE_EXPR)
4976 && (TYPE_MODE (TREE_TYPE (last))
4977 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (last, 0)))))
4978 last = TREE_OPERAND (last, 0);
4980 if (TREE_CODE (first) != INTEGER_CST)
4981 error_init ("nonconstant array index in initializer");
4982 else if (last != 0 && TREE_CODE (last) != INTEGER_CST)
4983 error_init ("nonconstant array index in initializer");
4984 else if (TREE_CODE (constructor_type) != ARRAY_TYPE)
4985 error_init ("array index in non-array initializer");
4986 else if (tree_int_cst_sgn (first) == -1)
4987 error_init ("array index in initializer exceeds array bounds");
4988 else if (constructor_max_index
4989 && tree_int_cst_lt (constructor_max_index, first))
4990 error_init ("array index in initializer exceeds array bounds");
4993 constructor_index = convert (bitsizetype, first);
4997 if (tree_int_cst_equal (first, last))
4999 else if (tree_int_cst_lt (last, first))
5001 error_init ("empty index range in initializer");
5006 last = convert (bitsizetype, last);
5007 if (constructor_max_index != 0
5008 && tree_int_cst_lt (constructor_max_index, last))
5010 error_init ("array index range in initializer exceeds array bounds");
5017 designator_errorneous = 0;
5018 if (constructor_range_stack || last)
5019 push_range_stack (last);
5023 /* Within a struct initializer, specify the next field to be initialized. */
5026 set_init_label (tree fieldname)
5030 if (set_designator (0))
5033 designator_errorneous = 1;
5035 if (TREE_CODE (constructor_type) != RECORD_TYPE
5036 && TREE_CODE (constructor_type) != UNION_TYPE)
5038 error_init ("field name not in record or union initializer");
5042 for (tail = TYPE_FIELDS (constructor_type); tail;
5043 tail = TREE_CHAIN (tail))
5045 if (DECL_NAME (tail) == fieldname)
5050 error ("unknown field `%s' specified in initializer",
5051 IDENTIFIER_POINTER (fieldname));
5054 constructor_fields = tail;
5056 designator_errorneous = 0;
5057 if (constructor_range_stack)
5058 push_range_stack (NULL_TREE);
5062 /* Add a new initializer to the tree of pending initializers. PURPOSE
5063 identifies the initializer, either array index or field in a structure.
5064 VALUE is the value of that index or field. */
5067 add_pending_init (tree purpose, tree value)
5069 struct init_node *p, **q, *r;
5071 q = &constructor_pending_elts;
5074 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5079 if (tree_int_cst_lt (purpose, p->purpose))
5081 else if (tree_int_cst_lt (p->purpose, purpose))
5085 if (TREE_SIDE_EFFECTS (p->value))
5086 warning_init ("initialized field with side-effects overwritten");
5096 bitpos = bit_position (purpose);
5100 if (tree_int_cst_lt (bitpos, bit_position (p->purpose)))
5102 else if (p->purpose != purpose)
5106 if (TREE_SIDE_EFFECTS (p->value))
5107 warning_init ("initialized field with side-effects overwritten");
5114 r = ggc_alloc (sizeof (struct init_node));
5115 r->purpose = purpose;
5126 struct init_node *s;
5130 if (p->balance == 0)
5132 else if (p->balance < 0)
5139 p->left->parent = p;
5156 constructor_pending_elts = r;
5161 struct init_node *t = r->right;
5165 r->right->parent = r;
5170 p->left->parent = p;
5173 p->balance = t->balance < 0;
5174 r->balance = -(t->balance > 0);
5189 constructor_pending_elts = t;
5195 /* p->balance == +1; growth of left side balances the node. */
5200 else /* r == p->right */
5202 if (p->balance == 0)
5203 /* Growth propagation from right side. */
5205 else if (p->balance > 0)
5212 p->right->parent = p;
5229 constructor_pending_elts = r;
5231 else /* r->balance == -1 */
5234 struct init_node *t = r->left;
5238 r->left->parent = r;
5243 p->right->parent = p;
5246 r->balance = (t->balance < 0);
5247 p->balance = -(t->balance > 0);
5262 constructor_pending_elts = t;
5268 /* p->balance == -1; growth of right side balances the node. */
5279 /* Build AVL tree from a sorted chain. */
5282 set_nonincremental_init (void)
5286 if (TREE_CODE (constructor_type) != RECORD_TYPE
5287 && TREE_CODE (constructor_type) != ARRAY_TYPE)
5290 for (chain = constructor_elements; chain; chain = TREE_CHAIN (chain))
5291 add_pending_init (TREE_PURPOSE (chain), TREE_VALUE (chain));
5292 constructor_elements = 0;
5293 if (TREE_CODE (constructor_type) == RECORD_TYPE)
5295 constructor_unfilled_fields = TYPE_FIELDS (constructor_type);
5296 /* Skip any nameless bit fields at the beginning. */
5297 while (constructor_unfilled_fields != 0
5298 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
5299 && DECL_NAME (constructor_unfilled_fields) == 0)
5300 constructor_unfilled_fields = TREE_CHAIN (constructor_unfilled_fields);
5303 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5305 if (TYPE_DOMAIN (constructor_type))
5306 constructor_unfilled_index
5307 = convert (bitsizetype,
5308 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
5310 constructor_unfilled_index = bitsize_zero_node;
5312 constructor_incremental = 0;
5315 /* Build AVL tree from a string constant. */
5318 set_nonincremental_init_from_string (tree str)
5320 tree value, purpose, type;
5321 HOST_WIDE_INT val[2];
5322 const char *p, *end;
5323 int byte, wchar_bytes, charwidth, bitpos;
5325 if (TREE_CODE (constructor_type) != ARRAY_TYPE)
5328 if (TYPE_PRECISION (TREE_TYPE (TREE_TYPE (str)))
5329 == TYPE_PRECISION (char_type_node))
5331 else if (TYPE_PRECISION (TREE_TYPE (TREE_TYPE (str)))
5332 == TYPE_PRECISION (wchar_type_node))
5333 wchar_bytes = TYPE_PRECISION (wchar_type_node) / BITS_PER_UNIT;
5337 charwidth = TYPE_PRECISION (char_type_node);
5338 type = TREE_TYPE (constructor_type);
5339 p = TREE_STRING_POINTER (str);
5340 end = p + TREE_STRING_LENGTH (str);
5342 for (purpose = bitsize_zero_node;
5343 p < end && !tree_int_cst_lt (constructor_max_index, purpose);
5344 purpose = size_binop (PLUS_EXPR, purpose, bitsize_one_node))
5346 if (wchar_bytes == 1)
5348 val[1] = (unsigned char) *p++;
5355 for (byte = 0; byte < wchar_bytes; byte++)
5357 if (BYTES_BIG_ENDIAN)
5358 bitpos = (wchar_bytes - byte - 1) * charwidth;
5360 bitpos = byte * charwidth;
5361 val[bitpos < HOST_BITS_PER_WIDE_INT]
5362 |= ((unsigned HOST_WIDE_INT) ((unsigned char) *p++))
5363 << (bitpos % HOST_BITS_PER_WIDE_INT);
5367 if (!TYPE_UNSIGNED (type))
5369 bitpos = ((wchar_bytes - 1) * charwidth) + HOST_BITS_PER_CHAR;
5370 if (bitpos < HOST_BITS_PER_WIDE_INT)
5372 if (val[1] & (((HOST_WIDE_INT) 1) << (bitpos - 1)))
5374 val[1] |= ((HOST_WIDE_INT) -1) << bitpos;
5378 else if (bitpos == HOST_BITS_PER_WIDE_INT)
5383 else if (val[0] & (((HOST_WIDE_INT) 1)
5384 << (bitpos - 1 - HOST_BITS_PER_WIDE_INT)))
5385 val[0] |= ((HOST_WIDE_INT) -1)
5386 << (bitpos - HOST_BITS_PER_WIDE_INT);
5389 value = build_int_2 (val[1], val[0]);
5390 TREE_TYPE (value) = type;
5391 add_pending_init (purpose, value);
5394 constructor_incremental = 0;
5397 /* Return value of FIELD in pending initializer or zero if the field was
5398 not initialized yet. */
5401 find_init_member (tree field)
5403 struct init_node *p;
5405 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5407 if (constructor_incremental
5408 && tree_int_cst_lt (field, constructor_unfilled_index))
5409 set_nonincremental_init ();
5411 p = constructor_pending_elts;
5414 if (tree_int_cst_lt (field, p->purpose))
5416 else if (tree_int_cst_lt (p->purpose, field))
5422 else if (TREE_CODE (constructor_type) == RECORD_TYPE)
5424 tree bitpos = bit_position (field);
5426 if (constructor_incremental
5427 && (!constructor_unfilled_fields
5428 || tree_int_cst_lt (bitpos,
5429 bit_position (constructor_unfilled_fields))))
5430 set_nonincremental_init ();
5432 p = constructor_pending_elts;
5435 if (field == p->purpose)
5437 else if (tree_int_cst_lt (bitpos, bit_position (p->purpose)))
5443 else if (TREE_CODE (constructor_type) == UNION_TYPE)
5445 if (constructor_elements
5446 && TREE_PURPOSE (constructor_elements) == field)
5447 return TREE_VALUE (constructor_elements);
5452 /* "Output" the next constructor element.
5453 At top level, really output it to assembler code now.
5454 Otherwise, collect it in a list from which we will make a CONSTRUCTOR.
5455 TYPE is the data type that the containing data type wants here.
5456 FIELD is the field (a FIELD_DECL) or the index that this element fills.
5458 PENDING if non-nil means output pending elements that belong
5459 right after this element. (PENDING is normally 1;
5460 it is 0 while outputting pending elements, to avoid recursion.) */
5463 output_init_element (tree value, tree type, tree field, int pending)
5465 if (type == error_mark_node)
5467 constructor_erroneous = 1;
5470 if (TREE_CODE (TREE_TYPE (value)) == FUNCTION_TYPE
5471 || (TREE_CODE (TREE_TYPE (value)) == ARRAY_TYPE
5472 && !(TREE_CODE (value) == STRING_CST
5473 && TREE_CODE (type) == ARRAY_TYPE
5474 && TREE_CODE (TREE_TYPE (type)) == INTEGER_TYPE)
5475 && !comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (value)),
5476 TYPE_MAIN_VARIANT (type))))
5477 value = default_conversion (value);
5479 if (TREE_CODE (value) == COMPOUND_LITERAL_EXPR
5480 && require_constant_value && !flag_isoc99 && pending)
5482 /* As an extension, allow initializing objects with static storage
5483 duration with compound literals (which are then treated just as
5484 the brace enclosed list they contain). */
5485 tree decl = COMPOUND_LITERAL_EXPR_DECL (value);
5486 value = DECL_INITIAL (decl);
5489 if (value == error_mark_node)
5490 constructor_erroneous = 1;
5491 else if (!TREE_CONSTANT (value))
5492 constructor_constant = 0;
5493 else if (initializer_constant_valid_p (value, TREE_TYPE (value)) == 0
5494 || ((TREE_CODE (constructor_type) == RECORD_TYPE
5495 || TREE_CODE (constructor_type) == UNION_TYPE)
5496 && DECL_C_BIT_FIELD (field)
5497 && TREE_CODE (value) != INTEGER_CST))
5498 constructor_simple = 0;
5500 if (require_constant_value && ! TREE_CONSTANT (value))
5502 error_init ("initializer element is not constant");
5503 value = error_mark_node;
5505 else if (require_constant_elements
5506 && initializer_constant_valid_p (value, TREE_TYPE (value)) == 0)
5507 pedwarn ("initializer element is not computable at load time");
5509 /* If this field is empty (and not at the end of structure),
5510 don't do anything other than checking the initializer. */
5512 && (TREE_TYPE (field) == error_mark_node
5513 || (COMPLETE_TYPE_P (TREE_TYPE (field))
5514 && integer_zerop (TYPE_SIZE (TREE_TYPE (field)))
5515 && (TREE_CODE (constructor_type) == ARRAY_TYPE
5516 || TREE_CHAIN (field)))))
5519 value = digest_init (type, value, require_constant_value);
5520 if (value == error_mark_node)
5522 constructor_erroneous = 1;
5526 /* If this element doesn't come next in sequence,
5527 put it on constructor_pending_elts. */
5528 if (TREE_CODE (constructor_type) == ARRAY_TYPE
5529 && (!constructor_incremental
5530 || !tree_int_cst_equal (field, constructor_unfilled_index)))
5532 if (constructor_incremental
5533 && tree_int_cst_lt (field, constructor_unfilled_index))
5534 set_nonincremental_init ();
5536 add_pending_init (field, value);
5539 else if (TREE_CODE (constructor_type) == RECORD_TYPE
5540 && (!constructor_incremental
5541 || field != constructor_unfilled_fields))
5543 /* We do this for records but not for unions. In a union,
5544 no matter which field is specified, it can be initialized
5545 right away since it starts at the beginning of the union. */
5546 if (constructor_incremental)
5548 if (!constructor_unfilled_fields)
5549 set_nonincremental_init ();
5552 tree bitpos, unfillpos;
5554 bitpos = bit_position (field);
5555 unfillpos = bit_position (constructor_unfilled_fields);
5557 if (tree_int_cst_lt (bitpos, unfillpos))
5558 set_nonincremental_init ();
5562 add_pending_init (field, value);
5565 else if (TREE_CODE (constructor_type) == UNION_TYPE
5566 && constructor_elements)
5568 if (TREE_SIDE_EFFECTS (TREE_VALUE (constructor_elements)))
5569 warning_init ("initialized field with side-effects overwritten");
5571 /* We can have just one union field set. */
5572 constructor_elements = 0;
5575 /* Otherwise, output this element either to
5576 constructor_elements or to the assembler file. */
5578 if (field && TREE_CODE (field) == INTEGER_CST)
5579 field = copy_node (field);
5580 constructor_elements
5581 = tree_cons (field, value, constructor_elements);
5583 /* Advance the variable that indicates sequential elements output. */
5584 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5585 constructor_unfilled_index
5586 = size_binop (PLUS_EXPR, constructor_unfilled_index,
5588 else if (TREE_CODE (constructor_type) == RECORD_TYPE)
5590 constructor_unfilled_fields
5591 = TREE_CHAIN (constructor_unfilled_fields);
5593 /* Skip any nameless bit fields. */
5594 while (constructor_unfilled_fields != 0
5595 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
5596 && DECL_NAME (constructor_unfilled_fields) == 0)
5597 constructor_unfilled_fields =
5598 TREE_CHAIN (constructor_unfilled_fields);
5600 else if (TREE_CODE (constructor_type) == UNION_TYPE)
5601 constructor_unfilled_fields = 0;
5603 /* Now output any pending elements which have become next. */
5605 output_pending_init_elements (0);
5608 /* Output any pending elements which have become next.
5609 As we output elements, constructor_unfilled_{fields,index}
5610 advances, which may cause other elements to become next;
5611 if so, they too are output.
5613 If ALL is 0, we return when there are
5614 no more pending elements to output now.
5616 If ALL is 1, we output space as necessary so that
5617 we can output all the pending elements. */
5620 output_pending_init_elements (int all)
5622 struct init_node *elt = constructor_pending_elts;
5627 /* Look through the whole pending tree.
5628 If we find an element that should be output now,
5629 output it. Otherwise, set NEXT to the element
5630 that comes first among those still pending. */
5635 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5637 if (tree_int_cst_equal (elt->purpose,
5638 constructor_unfilled_index))
5639 output_init_element (elt->value,
5640 TREE_TYPE (constructor_type),
5641 constructor_unfilled_index, 0);
5642 else if (tree_int_cst_lt (constructor_unfilled_index,
5645 /* Advance to the next smaller node. */
5650 /* We have reached the smallest node bigger than the
5651 current unfilled index. Fill the space first. */
5652 next = elt->purpose;
5658 /* Advance to the next bigger node. */
5663 /* We have reached the biggest node in a subtree. Find
5664 the parent of it, which is the next bigger node. */
5665 while (elt->parent && elt->parent->right == elt)
5668 if (elt && tree_int_cst_lt (constructor_unfilled_index,
5671 next = elt->purpose;
5677 else if (TREE_CODE (constructor_type) == RECORD_TYPE
5678 || TREE_CODE (constructor_type) == UNION_TYPE)
5680 tree ctor_unfilled_bitpos, elt_bitpos;
5682 /* If the current record is complete we are done. */
5683 if (constructor_unfilled_fields == 0)
5686 ctor_unfilled_bitpos = bit_position (constructor_unfilled_fields);
5687 elt_bitpos = bit_position (elt->purpose);
5688 /* We can't compare fields here because there might be empty
5689 fields in between. */
5690 if (tree_int_cst_equal (elt_bitpos, ctor_unfilled_bitpos))
5692 constructor_unfilled_fields = elt->purpose;
5693 output_init_element (elt->value, TREE_TYPE (elt->purpose),
5696 else if (tree_int_cst_lt (ctor_unfilled_bitpos, elt_bitpos))
5698 /* Advance to the next smaller node. */
5703 /* We have reached the smallest node bigger than the
5704 current unfilled field. Fill the space first. */
5705 next = elt->purpose;
5711 /* Advance to the next bigger node. */
5716 /* We have reached the biggest node in a subtree. Find
5717 the parent of it, which is the next bigger node. */
5718 while (elt->parent && elt->parent->right == elt)
5722 && (tree_int_cst_lt (ctor_unfilled_bitpos,
5723 bit_position (elt->purpose))))
5725 next = elt->purpose;
5733 /* Ordinarily return, but not if we want to output all
5734 and there are elements left. */
5735 if (! (all && next != 0))
5738 /* If it's not incremental, just skip over the gap, so that after
5739 jumping to retry we will output the next successive element. */
5740 if (TREE_CODE (constructor_type) == RECORD_TYPE
5741 || TREE_CODE (constructor_type) == UNION_TYPE)
5742 constructor_unfilled_fields = next;
5743 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5744 constructor_unfilled_index = next;
5746 /* ELT now points to the node in the pending tree with the next
5747 initializer to output. */
5751 /* Add one non-braced element to the current constructor level.
5752 This adjusts the current position within the constructor's type.
5753 This may also start or terminate implicit levels
5754 to handle a partly-braced initializer.
5756 Once this has found the correct level for the new element,
5757 it calls output_init_element. */
5760 process_init_element (tree value)
5762 tree orig_value = value;
5763 int string_flag = value != 0 && TREE_CODE (value) == STRING_CST;
5765 designator_depth = 0;
5766 designator_errorneous = 0;
5768 /* Handle superfluous braces around string cst as in
5769 char x[] = {"foo"}; */
5772 && TREE_CODE (constructor_type) == ARRAY_TYPE
5773 && TREE_CODE (TREE_TYPE (constructor_type)) == INTEGER_TYPE
5774 && integer_zerop (constructor_unfilled_index))
5776 if (constructor_stack->replacement_value)
5777 error_init ("excess elements in char array initializer");
5778 constructor_stack->replacement_value = value;
5782 if (constructor_stack->replacement_value != 0)
5784 error_init ("excess elements in struct initializer");
5788 /* Ignore elements of a brace group if it is entirely superfluous
5789 and has already been diagnosed. */
5790 if (constructor_type == 0)
5793 /* If we've exhausted any levels that didn't have braces,
5795 while (constructor_stack->implicit)
5797 if ((TREE_CODE (constructor_type) == RECORD_TYPE
5798 || TREE_CODE (constructor_type) == UNION_TYPE)
5799 && constructor_fields == 0)
5800 process_init_element (pop_init_level (1));
5801 else if (TREE_CODE (constructor_type) == ARRAY_TYPE
5802 && (constructor_max_index == 0
5803 || tree_int_cst_lt (constructor_max_index,
5804 constructor_index)))
5805 process_init_element (pop_init_level (1));
5810 /* In the case of [LO ... HI] = VALUE, only evaluate VALUE once. */
5811 if (constructor_range_stack)
5813 /* If value is a compound literal and we'll be just using its
5814 content, don't put it into a SAVE_EXPR. */
5815 if (TREE_CODE (value) != COMPOUND_LITERAL_EXPR
5816 || !require_constant_value
5818 value = save_expr (value);
5823 if (TREE_CODE (constructor_type) == RECORD_TYPE)
5826 enum tree_code fieldcode;
5828 if (constructor_fields == 0)
5830 pedwarn_init ("excess elements in struct initializer");
5834 fieldtype = TREE_TYPE (constructor_fields);
5835 if (fieldtype != error_mark_node)
5836 fieldtype = TYPE_MAIN_VARIANT (fieldtype);
5837 fieldcode = TREE_CODE (fieldtype);
5839 /* Error for non-static initialization of a flexible array member. */
5840 if (fieldcode == ARRAY_TYPE
5841 && !require_constant_value
5842 && TYPE_SIZE (fieldtype) == NULL_TREE
5843 && TREE_CHAIN (constructor_fields) == NULL_TREE)
5845 error_init ("non-static initialization of a flexible array member");
5849 /* Accept a string constant to initialize a subarray. */
5851 && fieldcode == ARRAY_TYPE
5852 && TREE_CODE (TREE_TYPE (fieldtype)) == INTEGER_TYPE
5855 /* Otherwise, if we have come to a subaggregate,
5856 and we don't have an element of its type, push into it. */
5857 else if (value != 0 && !constructor_no_implicit
5858 && value != error_mark_node
5859 && TYPE_MAIN_VARIANT (TREE_TYPE (value)) != fieldtype
5860 && (fieldcode == RECORD_TYPE || fieldcode == ARRAY_TYPE
5861 || fieldcode == UNION_TYPE))
5863 push_init_level (1);
5869 push_member_name (constructor_fields);
5870 output_init_element (value, fieldtype, constructor_fields, 1);
5871 RESTORE_SPELLING_DEPTH (constructor_depth);
5874 /* Do the bookkeeping for an element that was
5875 directly output as a constructor. */
5877 /* For a record, keep track of end position of last field. */
5878 if (DECL_SIZE (constructor_fields))
5879 constructor_bit_index
5880 = size_binop (PLUS_EXPR,
5881 bit_position (constructor_fields),
5882 DECL_SIZE (constructor_fields));
5884 /* If the current field was the first one not yet written out,
5885 it isn't now, so update. */
5886 if (constructor_unfilled_fields == constructor_fields)
5888 constructor_unfilled_fields = TREE_CHAIN (constructor_fields);
5889 /* Skip any nameless bit fields. */
5890 while (constructor_unfilled_fields != 0
5891 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
5892 && DECL_NAME (constructor_unfilled_fields) == 0)
5893 constructor_unfilled_fields =
5894 TREE_CHAIN (constructor_unfilled_fields);
5898 constructor_fields = TREE_CHAIN (constructor_fields);
5899 /* Skip any nameless bit fields at the beginning. */
5900 while (constructor_fields != 0
5901 && DECL_C_BIT_FIELD (constructor_fields)
5902 && DECL_NAME (constructor_fields) == 0)
5903 constructor_fields = TREE_CHAIN (constructor_fields);
5905 else if (TREE_CODE (constructor_type) == UNION_TYPE)
5908 enum tree_code fieldcode;
5910 if (constructor_fields == 0)
5912 pedwarn_init ("excess elements in union initializer");
5916 fieldtype = TREE_TYPE (constructor_fields);
5917 if (fieldtype != error_mark_node)
5918 fieldtype = TYPE_MAIN_VARIANT (fieldtype);
5919 fieldcode = TREE_CODE (fieldtype);
5921 /* Warn that traditional C rejects initialization of unions.
5922 We skip the warning if the value is zero. This is done
5923 under the assumption that the zero initializer in user
5924 code appears conditioned on e.g. __STDC__ to avoid
5925 "missing initializer" warnings and relies on default
5926 initialization to zero in the traditional C case.
5927 We also skip the warning if the initializer is designated,
5928 again on the assumption that this must be conditional on
5929 __STDC__ anyway (and we've already complained about the
5930 member-designator already). */
5931 if (warn_traditional && !in_system_header && !constructor_designated
5932 && !(value && (integer_zerop (value) || real_zerop (value))))
5933 warning ("traditional C rejects initialization of unions");
5935 /* Accept a string constant to initialize a subarray. */
5937 && fieldcode == ARRAY_TYPE
5938 && TREE_CODE (TREE_TYPE (fieldtype)) == INTEGER_TYPE
5941 /* Otherwise, if we have come to a subaggregate,
5942 and we don't have an element of its type, push into it. */
5943 else if (value != 0 && !constructor_no_implicit
5944 && value != error_mark_node
5945 && TYPE_MAIN_VARIANT (TREE_TYPE (value)) != fieldtype
5946 && (fieldcode == RECORD_TYPE || fieldcode == ARRAY_TYPE
5947 || fieldcode == UNION_TYPE))
5949 push_init_level (1);
5955 push_member_name (constructor_fields);
5956 output_init_element (value, fieldtype, constructor_fields, 1);
5957 RESTORE_SPELLING_DEPTH (constructor_depth);
5960 /* Do the bookkeeping for an element that was
5961 directly output as a constructor. */
5963 constructor_bit_index = DECL_SIZE (constructor_fields);
5964 constructor_unfilled_fields = TREE_CHAIN (constructor_fields);
5967 constructor_fields = 0;
5969 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5971 tree elttype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
5972 enum tree_code eltcode = TREE_CODE (elttype);
5974 /* Accept a string constant to initialize a subarray. */
5976 && eltcode == ARRAY_TYPE
5977 && TREE_CODE (TREE_TYPE (elttype)) == INTEGER_TYPE
5980 /* Otherwise, if we have come to a subaggregate,
5981 and we don't have an element of its type, push into it. */
5982 else if (value != 0 && !constructor_no_implicit
5983 && value != error_mark_node
5984 && TYPE_MAIN_VARIANT (TREE_TYPE (value)) != elttype
5985 && (eltcode == RECORD_TYPE || eltcode == ARRAY_TYPE
5986 || eltcode == UNION_TYPE))
5988 push_init_level (1);
5992 if (constructor_max_index != 0
5993 && (tree_int_cst_lt (constructor_max_index, constructor_index)
5994 || integer_all_onesp (constructor_max_index)))
5996 pedwarn_init ("excess elements in array initializer");
6000 /* Now output the actual element. */
6003 push_array_bounds (tree_low_cst (constructor_index, 0));
6004 output_init_element (value, elttype, constructor_index, 1);
6005 RESTORE_SPELLING_DEPTH (constructor_depth);
6009 = size_binop (PLUS_EXPR, constructor_index, bitsize_one_node);
6012 /* If we are doing the bookkeeping for an element that was
6013 directly output as a constructor, we must update
6014 constructor_unfilled_index. */
6015 constructor_unfilled_index = constructor_index;
6017 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
6019 tree elttype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
6021 /* Do a basic check of initializer size. Note that vectors
6022 always have a fixed size derived from their type. */
6023 if (tree_int_cst_lt (constructor_max_index, constructor_index))
6025 pedwarn_init ("excess elements in vector initializer");
6029 /* Now output the actual element. */
6031 output_init_element (value, elttype, constructor_index, 1);
6034 = size_binop (PLUS_EXPR, constructor_index, bitsize_one_node);
6037 /* If we are doing the bookkeeping for an element that was
6038 directly output as a constructor, we must update
6039 constructor_unfilled_index. */
6040 constructor_unfilled_index = constructor_index;
6043 /* Handle the sole element allowed in a braced initializer
6044 for a scalar variable. */
6045 else if (constructor_fields == 0)
6047 pedwarn_init ("excess elements in scalar initializer");
6053 output_init_element (value, constructor_type, NULL_TREE, 1);
6054 constructor_fields = 0;
6057 /* Handle range initializers either at this level or anywhere higher
6058 in the designator stack. */
6059 if (constructor_range_stack)
6061 struct constructor_range_stack *p, *range_stack;
6064 range_stack = constructor_range_stack;
6065 constructor_range_stack = 0;
6066 while (constructor_stack != range_stack->stack)
6068 if (!constructor_stack->implicit)
6070 process_init_element (pop_init_level (1));
6072 for (p = range_stack;
6073 !p->range_end || tree_int_cst_equal (p->index, p->range_end);
6076 if (!constructor_stack->implicit)
6078 process_init_element (pop_init_level (1));
6081 p->index = size_binop (PLUS_EXPR, p->index, bitsize_one_node);
6082 if (tree_int_cst_equal (p->index, p->range_end) && !p->prev)
6087 constructor_index = p->index;
6088 constructor_fields = p->fields;
6089 if (finish && p->range_end && p->index == p->range_start)
6097 push_init_level (2);
6098 p->stack = constructor_stack;
6099 if (p->range_end && tree_int_cst_equal (p->index, p->range_end))
6100 p->index = p->range_start;
6104 constructor_range_stack = range_stack;
6111 constructor_range_stack = 0;
6114 /* Build a complete asm-statement, whose components are a CV_QUALIFIER
6115 (guaranteed to be 'volatile' or null) and ARGS (represented using
6116 an ASM_EXPR node). */
6118 build_asm_stmt (tree cv_qualifier, tree args)
6120 if (!ASM_VOLATILE_P (args) && cv_qualifier)
6121 ASM_VOLATILE_P (args) = 1;
6122 return add_stmt (args);
6125 /* Build an asm-expr, whose components are a STRING, some OUTPUTS,
6126 some INPUTS, and some CLOBBERS. The latter three may be NULL.
6127 SIMPLE indicates whether there was anything at all after the
6128 string in the asm expression -- asm("blah") and asm("blah" : )
6129 are subtly different. We use a ASM_EXPR node to represent this. */
6131 build_asm_expr (tree string, tree outputs, tree inputs, tree clobbers,
6137 const char *constraint;
6138 bool allows_mem, allows_reg, is_inout;
6142 ninputs = list_length (inputs);
6143 noutputs = list_length (outputs);
6145 /* Remove output conversions that change the type but not the mode. */
6146 for (i = 0, tail = outputs; tail; ++i, tail = TREE_CHAIN (tail))
6148 tree output = TREE_VALUE (tail);
6149 STRIP_NOPS (output);
6150 TREE_VALUE (tail) = output;
6151 lvalue_or_else (output, "invalid lvalue in asm statement");
6153 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
6155 if (!parse_output_constraint (&constraint, i, ninputs, noutputs,
6156 &allows_mem, &allows_reg, &is_inout))
6158 /* By marking this operand as erroneous, we will not try
6159 to process this operand again in expand_asm_operands. */
6160 TREE_VALUE (tail) = error_mark_node;
6164 /* If the operand is a DECL that is going to end up in
6165 memory, assume it is addressable. This is a bit more
6166 conservative than it would ideally be; the exact test is
6167 buried deep in expand_asm_operands and depends on the
6168 DECL_RTL for the OPERAND -- which we don't have at this
6170 if (!allows_reg && DECL_P (output))
6171 c_mark_addressable (output);
6174 /* Perform default conversions on array and function inputs.
6175 Don't do this for other types as it would screw up operands
6176 expected to be in memory. */
6177 for (tail = inputs; tail; tail = TREE_CHAIN (tail))
6178 TREE_VALUE (tail) = default_function_array_conversion (TREE_VALUE (tail));
6180 args = build_stmt (ASM_EXPR, string, outputs, inputs, clobbers);
6182 /* Simple asm statements are treated as volatile. */
6185 ASM_VOLATILE_P (args) = 1;
6186 ASM_INPUT_P (args) = 1;
6191 /* Expand an ASM statement with operands, handling output operands
6192 that are not variables or INDIRECT_REFS by transforming such
6193 cases into cases that expand_asm_operands can handle.
6195 Arguments are same as for expand_asm_operands. */
6198 c_expand_asm_operands (tree string, tree outputs, tree inputs,
6199 tree clobbers, int vol, location_t locus)
6201 int noutputs = list_length (outputs);
6203 /* o[I] is the place that output number I should be written. */
6204 tree *o = alloca (noutputs * sizeof (tree));
6207 /* Record the contents of OUTPUTS before it is modified. */
6208 for (i = 0, tail = outputs; tail; tail = TREE_CHAIN (tail), i++)
6210 o[i] = TREE_VALUE (tail);
6211 if (o[i] == error_mark_node)
6215 /* Generate the ASM_OPERANDS insn; store into the TREE_VALUEs of
6216 OUTPUTS some trees for where the values were actually stored. */
6217 expand_asm_operands (string, outputs, inputs, clobbers, vol, locus);
6219 /* Copy all the intermediate outputs into the specified outputs. */
6220 for (i = 0, tail = outputs; tail; tail = TREE_CHAIN (tail), i++)
6222 if (o[i] != TREE_VALUE (tail))
6224 expand_expr (build_modify_expr (o[i], NOP_EXPR, TREE_VALUE (tail)),
6225 NULL_RTX, VOIDmode, EXPAND_NORMAL);
6228 /* Restore the original value so that it's correct the next
6229 time we expand this function. */
6230 TREE_VALUE (tail) = o[i];
6232 /* Detect modification of read-only values.
6233 (Otherwise done by build_modify_expr.) */
6236 tree type = TREE_TYPE (o[i]);
6237 if (TREE_READONLY (o[i])
6238 || TYPE_READONLY (type)
6239 || ((TREE_CODE (type) == RECORD_TYPE
6240 || TREE_CODE (type) == UNION_TYPE)
6241 && C_TYPE_FIELDS_READONLY (type)))
6242 readonly_error (o[i], "modification by `asm'");
6246 /* Those MODIFY_EXPRs could do autoincrements. */
6250 /* Generate a goto statement to LABEL. */
6253 c_finish_goto_label (tree label)
6255 tree decl = lookup_label (label);
6259 TREE_USED (decl) = 1;
6260 return add_stmt (build (GOTO_EXPR, void_type_node, decl));
6263 /* Generate a computed goto statement to EXPR. */
6266 c_finish_goto_ptr (tree expr)
6269 pedwarn ("ISO C forbids `goto *expr;'");
6270 expr = convert (ptr_type_node, expr);
6271 return add_stmt (build (GOTO_EXPR, void_type_node, expr));
6274 /* Generate a C `return' statement. RETVAL is the expression for what
6275 to return, or a null pointer for `return;' with no value. */
6278 c_finish_return (tree retval)
6280 tree valtype = TREE_TYPE (TREE_TYPE (current_function_decl));
6282 if (TREE_THIS_VOLATILE (current_function_decl))
6283 warning ("function declared `noreturn' has a `return' statement");
6287 current_function_returns_null = 1;
6288 if ((warn_return_type || flag_isoc99)
6289 && valtype != 0 && TREE_CODE (valtype) != VOID_TYPE)
6290 pedwarn_c99 ("`return' with no value, in function returning non-void");
6292 else if (valtype == 0 || TREE_CODE (valtype) == VOID_TYPE)
6294 current_function_returns_null = 1;
6295 if (pedantic || TREE_CODE (TREE_TYPE (retval)) != VOID_TYPE)
6296 pedwarn ("`return' with a value, in function returning void");
6300 tree t = convert_for_assignment (valtype, retval, _("return"),
6301 NULL_TREE, NULL_TREE, 0);
6302 tree res = DECL_RESULT (current_function_decl);
6305 current_function_returns_value = 1;
6306 if (t == error_mark_node)
6309 inner = t = convert (TREE_TYPE (res), t);
6311 /* Strip any conversions, additions, and subtractions, and see if
6312 we are returning the address of a local variable. Warn if so. */
6315 switch (TREE_CODE (inner))
6317 case NOP_EXPR: case NON_LVALUE_EXPR: case CONVERT_EXPR:
6319 inner = TREE_OPERAND (inner, 0);
6323 /* If the second operand of the MINUS_EXPR has a pointer
6324 type (or is converted from it), this may be valid, so
6325 don't give a warning. */
6327 tree op1 = TREE_OPERAND (inner, 1);
6329 while (! POINTER_TYPE_P (TREE_TYPE (op1))
6330 && (TREE_CODE (op1) == NOP_EXPR
6331 || TREE_CODE (op1) == NON_LVALUE_EXPR
6332 || TREE_CODE (op1) == CONVERT_EXPR))
6333 op1 = TREE_OPERAND (op1, 0);
6335 if (POINTER_TYPE_P (TREE_TYPE (op1)))
6338 inner = TREE_OPERAND (inner, 0);
6343 inner = TREE_OPERAND (inner, 0);
6345 while (TREE_CODE_CLASS (TREE_CODE (inner)) == 'r')
6346 inner = TREE_OPERAND (inner, 0);
6349 && ! DECL_EXTERNAL (inner)
6350 && ! TREE_STATIC (inner)
6351 && DECL_CONTEXT (inner) == current_function_decl)
6352 warning ("function returns address of local variable");
6362 retval = build (MODIFY_EXPR, TREE_TYPE (res), res, t);
6365 return add_stmt (build_stmt (RETURN_EXPR, retval));
6369 /* The SWITCH_STMT being built. */
6371 /* A splay-tree mapping the low element of a case range to the high
6372 element, or NULL_TREE if there is no high element. Used to
6373 determine whether or not a new case label duplicates an old case
6374 label. We need a tree, rather than simply a hash table, because
6375 of the GNU case range extension. */
6377 /* The next node on the stack. */
6378 struct c_switch *next;
6381 /* A stack of the currently active switch statements. The innermost
6382 switch statement is on the top of the stack. There is no need to
6383 mark the stack for garbage collection because it is only active
6384 during the processing of the body of a function, and we never
6385 collect at that point. */
6387 struct c_switch *c_switch_stack;
6389 /* Start a C switch statement, testing expression EXP. Return the new
6393 c_start_case (tree exp)
6395 enum tree_code code;
6396 tree type, orig_type = error_mark_node;
6397 struct c_switch *cs;
6399 if (exp != error_mark_node)
6401 code = TREE_CODE (TREE_TYPE (exp));
6402 orig_type = TREE_TYPE (exp);
6404 if (! INTEGRAL_TYPE_P (orig_type)
6405 && code != ERROR_MARK)
6407 error ("switch quantity not an integer");
6408 exp = integer_zero_node;
6412 type = TYPE_MAIN_VARIANT (TREE_TYPE (exp));
6414 if (warn_traditional && !in_system_header
6415 && (type == long_integer_type_node
6416 || type == long_unsigned_type_node))
6417 warning ("`long' switch expression not converted to `int' in ISO C");
6419 exp = default_conversion (exp);
6420 type = TREE_TYPE (exp);
6424 /* Add this new SWITCH_STMT to the stack. */
6425 cs = xmalloc (sizeof (*cs));
6426 cs->switch_stmt = build_stmt (SWITCH_STMT, exp, NULL_TREE, orig_type);
6427 cs->cases = splay_tree_new (case_compare, NULL, NULL);
6428 cs->next = c_switch_stack;
6429 c_switch_stack = cs;
6431 return add_stmt (cs->switch_stmt);
6434 /* Process a case label. */
6437 do_case (tree low_value, tree high_value)
6439 tree label = NULL_TREE;
6443 label = c_add_case_label (c_switch_stack->cases,
6444 SWITCH_COND (c_switch_stack->switch_stmt),
6445 low_value, high_value);
6446 if (label == error_mark_node)
6450 error ("case label not within a switch statement");
6452 error ("`default' label not within a switch statement");
6457 /* Finish the switch statement. */
6460 c_finish_case (tree body)
6462 struct c_switch *cs = c_switch_stack;
6464 SWITCH_BODY (cs->switch_stmt) = body;
6466 /* Emit warnings as needed. */
6467 c_do_switch_warnings (cs->cases, cs->switch_stmt);
6469 /* Pop the stack. */
6470 c_switch_stack = cs->next;
6471 splay_tree_delete (cs->cases);
6475 /* Emit an if statement. IF_LOCUS is the location of the 'if'. COND,
6476 THEN_BLOCK and ELSE_BLOCK are expressions to be used; ELSE_BLOCK
6477 may be null. NESTED_IF is true if THEN_BLOCK contains another IF
6478 statement, and was not surrounded with parenthesis. */
6481 c_finish_if_stmt (location_t if_locus, tree cond, tree then_block,
6482 tree else_block, bool nested_if)
6486 /* Diagnose an ambiguous else if if-then-else is nested inside if-then. */
6487 if (warn_parentheses && nested_if && else_block == NULL)
6489 tree inner_if = then_block;
6491 /* We know from the grammar productions that there is an IF nested
6492 within THEN_BLOCK. Due to labels and c99 conditional declarations,
6493 it might not be exactly THEN_BLOCK, but should be the last
6494 non-container statement within. */
6496 switch (TREE_CODE (inner_if))
6501 inner_if = BIND_EXPR_BODY (inner_if);
6503 case STATEMENT_LIST:
6504 inner_if = expr_last (then_block);
6506 case TRY_FINALLY_EXPR:
6507 case TRY_CATCH_EXPR:
6508 inner_if = TREE_OPERAND (inner_if, 0);
6515 if (COND_EXPR_ELSE (inner_if))
6516 warning ("%Hsuggest explicit braces to avoid ambiguous `else'",
6520 /* Diagnose ";" via the special empty statement node that we create. */
6523 if (TREE_CODE (then_block) == NOP_EXPR && !TREE_TYPE (then_block))
6526 warning ("%Hempty body in an if-statement",
6527 EXPR_LOCUS (then_block));
6528 then_block = alloc_stmt_list ();
6531 && TREE_CODE (else_block) == NOP_EXPR
6532 && !TREE_TYPE (else_block))
6534 warning ("%Hempty body in an else-statement",
6535 EXPR_LOCUS (else_block));
6536 else_block = alloc_stmt_list ();
6540 stmt = build3 (COND_EXPR, NULL_TREE, cond, then_block, else_block);
6541 SET_EXPR_LOCATION (stmt, if_locus);
6545 /* Emit a general-purpose loop construct. START_LOCUS is the location of
6546 the beginning of the loop. COND is the loop condition. COND_IS_FIRST
6547 is false for DO loops. INCR is the FOR increment expression. BODY is
6548 the statement controlled by the loop. BLAB is the break label. CLAB is
6549 the continue label. Everything is allowed to be NULL. */
6552 c_finish_loop (location_t start_locus, tree cond, tree incr, tree body,
6553 tree blab, tree clab, bool cond_is_first)
6555 tree entry = NULL, exit = NULL, t;
6557 /* Detect do { ... } while (0) and don't generate loop construct. */
6558 if (cond && !cond_is_first && integer_zerop (cond))
6560 if (cond_is_first || cond)
6562 tree top = build1 (LABEL_EXPR, void_type_node, NULL_TREE);
6564 /* If we have an exit condition, then we build an IF with gotos either
6565 out of the loop, or to the top of it. If there's no exit condition,
6566 then we just build a jump back to the top. */
6567 exit = build_and_jump (&LABEL_EXPR_LABEL (top));
6571 /* Canonicalize the loop condition to the end. This means
6572 generating a branch to the loop condition. Reuse the
6573 continue label, if possible. */
6578 entry = build1 (LABEL_EXPR, void_type_node, NULL_TREE);
6579 t = build_and_jump (&LABEL_EXPR_LABEL (entry));
6582 t = build1 (GOTO_EXPR, void_type_node, clab);
6583 SET_EXPR_LOCATION (t, start_locus);
6587 t = build_and_jump (&blab);
6588 exit = build (COND_EXPR, void_type_node, cond, exit, t);
6591 SET_EXPR_LOCATION (exit, start_locus);
6593 SET_EXPR_LOCATION (exit, input_location);
6602 add_stmt (build1 (LABEL_EXPR, void_type_node, clab));
6610 add_stmt (build1 (LABEL_EXPR, void_type_node, blab));
6614 c_finish_bc_stmt (tree *label_p, bool is_break)
6616 tree label = *label_p;
6619 *label_p = label = create_artificial_label ();
6620 else if (TREE_CODE (label) != LABEL_DECL)
6623 error ("break statement not within loop or switch");
6625 error ("continue statement not within a loop");
6629 return add_stmt (build (GOTO_EXPR, void_type_node, label));
6632 /* A helper routine for c_process_expr_stmt and c_finish_stmt_expr. */
6635 emit_side_effect_warnings (tree expr)
6637 if (expr == error_mark_node)
6639 else if (!TREE_SIDE_EFFECTS (expr))
6641 if (!VOID_TYPE_P (TREE_TYPE (expr)) && !TREE_NO_WARNING (expr))
6642 warning ("%Hstatement with no effect",
6643 EXPR_LOCUS (expr) ? EXPR_LOCUS (expr) : &input_location);
6645 else if (warn_unused_value)
6646 warn_if_unused_value (expr, input_location);
6649 /* Process an expression as if it were a complete statement. Emit
6650 diagnostics, but do not call ADD_STMT. */
6653 c_process_expr_stmt (tree expr)
6658 /* Do default conversion if safe and possibly important,
6659 in case within ({...}). */
6660 if ((TREE_CODE (TREE_TYPE (expr)) == ARRAY_TYPE
6661 && (flag_isoc99 || lvalue_p (expr)))
6662 || TREE_CODE (TREE_TYPE (expr)) == FUNCTION_TYPE)
6663 expr = default_conversion (expr);
6665 if (warn_sequence_point)
6666 verify_sequence_points (expr);
6668 if (TREE_TYPE (expr) != error_mark_node
6669 && !COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (expr))
6670 && TREE_CODE (TREE_TYPE (expr)) != ARRAY_TYPE)
6671 error ("expression statement has incomplete type");
6673 /* If we're not processing a statement expression, warn about unused values.
6674 Warnings for statement expressions will be emitted later, once we figure
6675 out which is the result. */
6676 if (!STATEMENT_LIST_STMT_EXPR (cur_stmt_list)
6677 && (extra_warnings || warn_unused_value))
6678 emit_side_effect_warnings (expr);
6680 /* If the expression is not of a type to which we cannot assign a line
6681 number, wrap the thing in a no-op NOP_EXPR. */
6682 if (DECL_P (expr) || TREE_CODE_CLASS (TREE_CODE (expr)) == 'c')
6683 expr = build1 (NOP_EXPR, TREE_TYPE (expr), expr);
6686 SET_EXPR_LOCATION (expr, input_location);
6691 /* Emit an expression as a statement. */
6694 c_finish_expr_stmt (tree expr)
6697 return add_stmt (c_process_expr_stmt (expr));
6702 /* Do the opposite and emit a statement as an expression. To begin,
6703 create a new binding level and return it. */
6706 c_begin_stmt_expr (void)
6710 /* We must force a BLOCK for this level so that, if it is not expanded
6711 later, there is a way to turn off the entire subtree of blocks that
6712 are contained in it. */
6714 ret = c_begin_compound_stmt (true);
6716 /* Mark the current statement list as belonging to a statement list. */
6717 STATEMENT_LIST_STMT_EXPR (ret) = 1;
6723 c_finish_stmt_expr (tree body)
6725 tree last, type, tmp, val;
6728 body = c_end_compound_stmt (body, true);
6730 /* Locate the last statement in BODY. See c_end_compound_stmt
6731 about always returning a BIND_EXPR. */
6732 last_p = &BIND_EXPR_BODY (body);
6733 last = BIND_EXPR_BODY (body);
6736 if (TREE_CODE (last) == STATEMENT_LIST)
6738 tree_stmt_iterator i;
6740 /* This can happen with degenerate cases like ({ }). No value. */
6741 if (!TREE_SIDE_EFFECTS (last))
6744 /* If we're supposed to generate side effects warnings, process
6745 all of the statements except the last. */
6746 if (extra_warnings || warn_unused_value)
6748 for (i = tsi_start (last); !tsi_one_before_end_p (i); tsi_next (&i))
6749 emit_side_effect_warnings (tsi_stmt (i));
6752 i = tsi_last (last);
6753 last_p = tsi_stmt_ptr (i);
6757 /* If the end of the list is exception related, then the list was split
6758 by a call to push_cleanup. Continue searching. */
6759 if (TREE_CODE (last) == TRY_FINALLY_EXPR
6760 || TREE_CODE (last) == TRY_CATCH_EXPR)
6762 last_p = &TREE_OPERAND (last, 0);
6764 goto continue_searching;
6767 /* In the case that the BIND_EXPR is not necessary, return the
6768 expression out from inside it. */
6769 if (last == error_mark_node
6770 || (last == BIND_EXPR_BODY (body)
6771 && BIND_EXPR_VARS (body) == NULL))
6774 /* Extract the type of said expression. */
6775 type = TREE_TYPE (last);
6777 /* If we're not returning a value at all, then the BIND_EXPR that
6778 we already have is a fine expression to return. */
6779 if (!type || VOID_TYPE_P (type))
6782 /* Now that we've located the expression containing the value, it seems
6783 silly to make voidify_wrapper_expr repeat the process. Create a
6784 temporary of the appropriate type and stick it in a TARGET_EXPR. */
6785 tmp = create_tmp_var_raw (type, NULL);
6787 /* Unwrap a no-op NOP_EXPR as added by c_finish_expr_stmt. This avoids
6788 tree_expr_nonnegative_p giving up immediately. */
6790 if (TREE_CODE (val) == NOP_EXPR
6791 && TREE_TYPE (val) == TREE_TYPE (TREE_OPERAND (val, 0)))
6792 val = TREE_OPERAND (val, 0);
6794 *last_p = build (MODIFY_EXPR, void_type_node, tmp, val);
6795 SET_EXPR_LOCUS (*last_p, EXPR_LOCUS (last));
6797 return build (TARGET_EXPR, type, tmp, body, NULL_TREE, NULL_TREE);
6800 /* Begin and end compound statements. This is as simple as pushing
6801 and popping new statement lists from the tree. */
6804 c_begin_compound_stmt (bool do_scope)
6806 tree stmt = push_stmt_list ();
6813 c_end_compound_stmt (tree stmt, bool do_scope)
6819 if (c_dialect_objc ())
6820 objc_clear_super_receiver ();
6821 block = pop_scope ();
6824 stmt = pop_stmt_list (stmt);
6825 stmt = c_build_bind_expr (block, stmt);
6827 /* If this compound statement is nested immediately inside a statement
6828 expression, then force a BIND_EXPR to be created. Otherwise we'll
6829 do the wrong thing for ({ { 1; } }) or ({ 1; { } }). In particular,
6830 STATEMENT_LISTs merge, and thus we can lose track of what statement
6833 && STATEMENT_LIST_STMT_EXPR (cur_stmt_list)
6834 && TREE_CODE (stmt) != BIND_EXPR)
6836 stmt = build (BIND_EXPR, void_type_node, NULL, stmt, NULL);
6837 TREE_SIDE_EFFECTS (stmt) = 1;
6843 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
6844 when the current scope is exited. EH_ONLY is true when this is not
6845 meant to apply to normal control flow transfer. */
6848 push_cleanup (tree decl ATTRIBUTE_UNUSED, tree cleanup, bool eh_only)
6850 enum tree_code code;
6854 code = eh_only ? TRY_CATCH_EXPR : TRY_FINALLY_EXPR;
6855 stmt = build_stmt (code, NULL, cleanup);
6857 stmt_expr = STATEMENT_LIST_STMT_EXPR (cur_stmt_list);
6858 list = push_stmt_list ();
6859 TREE_OPERAND (stmt, 0) = list;
6860 STATEMENT_LIST_STMT_EXPR (list) = stmt_expr;
6863 /* Build a binary-operation expression without default conversions.
6864 CODE is the kind of expression to build.
6865 This function differs from `build' in several ways:
6866 the data type of the result is computed and recorded in it,
6867 warnings are generated if arg data types are invalid,
6868 special handling for addition and subtraction of pointers is known,
6869 and some optimization is done (operations on narrow ints
6870 are done in the narrower type when that gives the same result).
6871 Constant folding is also done before the result is returned.
6873 Note that the operands will never have enumeral types, or function
6874 or array types, because either they will have the default conversions
6875 performed or they have both just been converted to some other type in which
6876 the arithmetic is to be done. */
6879 build_binary_op (enum tree_code code, tree orig_op0, tree orig_op1,
6883 enum tree_code code0, code1;
6886 /* Expression code to give to the expression when it is built.
6887 Normally this is CODE, which is what the caller asked for,
6888 but in some special cases we change it. */
6889 enum tree_code resultcode = code;
6891 /* Data type in which the computation is to be performed.
6892 In the simplest cases this is the common type of the arguments. */
6893 tree result_type = NULL;
6895 /* Nonzero means operands have already been type-converted
6896 in whatever way is necessary.
6897 Zero means they need to be converted to RESULT_TYPE. */
6900 /* Nonzero means create the expression with this type, rather than
6902 tree build_type = 0;
6904 /* Nonzero means after finally constructing the expression
6905 convert it to this type. */
6906 tree final_type = 0;
6908 /* Nonzero if this is an operation like MIN or MAX which can
6909 safely be computed in short if both args are promoted shorts.
6910 Also implies COMMON.
6911 -1 indicates a bitwise operation; this makes a difference
6912 in the exact conditions for when it is safe to do the operation
6913 in a narrower mode. */
6916 /* Nonzero if this is a comparison operation;
6917 if both args are promoted shorts, compare the original shorts.
6918 Also implies COMMON. */
6919 int short_compare = 0;
6921 /* Nonzero if this is a right-shift operation, which can be computed on the
6922 original short and then promoted if the operand is a promoted short. */
6923 int short_shift = 0;
6925 /* Nonzero means set RESULT_TYPE to the common type of the args. */
6930 op0 = default_conversion (orig_op0);
6931 op1 = default_conversion (orig_op1);
6939 type0 = TREE_TYPE (op0);
6940 type1 = TREE_TYPE (op1);
6942 /* The expression codes of the data types of the arguments tell us
6943 whether the arguments are integers, floating, pointers, etc. */
6944 code0 = TREE_CODE (type0);
6945 code1 = TREE_CODE (type1);
6947 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
6948 STRIP_TYPE_NOPS (op0);
6949 STRIP_TYPE_NOPS (op1);
6951 /* If an error was already reported for one of the arguments,
6952 avoid reporting another error. */
6954 if (code0 == ERROR_MARK || code1 == ERROR_MARK)
6955 return error_mark_node;
6960 /* Handle the pointer + int case. */
6961 if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
6962 return pointer_int_sum (PLUS_EXPR, op0, op1);
6963 else if (code1 == POINTER_TYPE && code0 == INTEGER_TYPE)
6964 return pointer_int_sum (PLUS_EXPR, op1, op0);
6970 /* Subtraction of two similar pointers.
6971 We must subtract them as integers, then divide by object size. */
6972 if (code0 == POINTER_TYPE && code1 == POINTER_TYPE
6973 && comp_target_types (type0, type1, 1))
6974 return pointer_diff (op0, op1);
6975 /* Handle pointer minus int. Just like pointer plus int. */
6976 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
6977 return pointer_int_sum (MINUS_EXPR, op0, op1);
6986 case TRUNC_DIV_EXPR:
6988 case FLOOR_DIV_EXPR:
6989 case ROUND_DIV_EXPR:
6990 case EXACT_DIV_EXPR:
6991 /* Floating point division by zero is a legitimate way to obtain
6992 infinities and NaNs. */
6993 if (warn_div_by_zero && skip_evaluation == 0 && integer_zerop (op1))
6994 warning ("division by zero");
6996 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
6997 || code0 == COMPLEX_TYPE || code0 == VECTOR_TYPE)
6998 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
6999 || code1 == COMPLEX_TYPE || code1 == VECTOR_TYPE))
7001 if (!(code0 == INTEGER_TYPE && code1 == INTEGER_TYPE))
7002 resultcode = RDIV_EXPR;
7004 /* Although it would be tempting to shorten always here, that
7005 loses on some targets, since the modulo instruction is
7006 undefined if the quotient can't be represented in the
7007 computation mode. We shorten only if unsigned or if
7008 dividing by something we know != -1. */
7009 shorten = (TYPE_UNSIGNED (TREE_TYPE (orig_op0))
7010 || (TREE_CODE (op1) == INTEGER_CST
7011 && ! integer_all_onesp (op1)));
7019 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
7021 else if (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE)
7025 case TRUNC_MOD_EXPR:
7026 case FLOOR_MOD_EXPR:
7027 if (warn_div_by_zero && skip_evaluation == 0 && integer_zerop (op1))
7028 warning ("division by zero");
7030 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
7032 /* Although it would be tempting to shorten always here, that loses
7033 on some targets, since the modulo instruction is undefined if the
7034 quotient can't be represented in the computation mode. We shorten
7035 only if unsigned or if dividing by something we know != -1. */
7036 shorten = (TYPE_UNSIGNED (TREE_TYPE (orig_op0))
7037 || (TREE_CODE (op1) == INTEGER_CST
7038 && ! integer_all_onesp (op1)));
7043 case TRUTH_ANDIF_EXPR:
7044 case TRUTH_ORIF_EXPR:
7045 case TRUTH_AND_EXPR:
7047 case TRUTH_XOR_EXPR:
7048 if ((code0 == INTEGER_TYPE || code0 == POINTER_TYPE
7049 || code0 == REAL_TYPE || code0 == COMPLEX_TYPE)
7050 && (code1 == INTEGER_TYPE || code1 == POINTER_TYPE
7051 || code1 == REAL_TYPE || code1 == COMPLEX_TYPE))
7053 /* Result of these operations is always an int,
7054 but that does not mean the operands should be
7055 converted to ints! */
7056 result_type = integer_type_node;
7057 op0 = lang_hooks.truthvalue_conversion (op0);
7058 op1 = lang_hooks.truthvalue_conversion (op1);
7063 /* Shift operations: result has same type as first operand;
7064 always convert second operand to int.
7065 Also set SHORT_SHIFT if shifting rightward. */
7068 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
7070 if (TREE_CODE (op1) == INTEGER_CST && skip_evaluation == 0)
7072 if (tree_int_cst_sgn (op1) < 0)
7073 warning ("right shift count is negative");
7076 if (! integer_zerop (op1))
7079 if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
7080 warning ("right shift count >= width of type");
7084 /* Use the type of the value to be shifted. */
7085 result_type = type0;
7086 /* Convert the shift-count to an integer, regardless of size
7087 of value being shifted. */
7088 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
7089 op1 = convert (integer_type_node, op1);
7090 /* Avoid converting op1 to result_type later. */
7096 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
7098 if (TREE_CODE (op1) == INTEGER_CST && skip_evaluation == 0)
7100 if (tree_int_cst_sgn (op1) < 0)
7101 warning ("left shift count is negative");
7103 else if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
7104 warning ("left shift count >= width of type");
7107 /* Use the type of the value to be shifted. */
7108 result_type = type0;
7109 /* Convert the shift-count to an integer, regardless of size
7110 of value being shifted. */
7111 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
7112 op1 = convert (integer_type_node, op1);
7113 /* Avoid converting op1 to result_type later. */
7120 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
7122 if (TREE_CODE (op1) == INTEGER_CST && skip_evaluation == 0)
7124 if (tree_int_cst_sgn (op1) < 0)
7125 warning ("shift count is negative");
7126 else if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
7127 warning ("shift count >= width of type");
7130 /* Use the type of the value to be shifted. */
7131 result_type = type0;
7132 /* Convert the shift-count to an integer, regardless of size
7133 of value being shifted. */
7134 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
7135 op1 = convert (integer_type_node, op1);
7136 /* Avoid converting op1 to result_type later. */
7143 if (warn_float_equal && (code0 == REAL_TYPE || code1 == REAL_TYPE))
7144 warning ("comparing floating point with == or != is unsafe");
7145 /* Result of comparison is always int,
7146 but don't convert the args to int! */
7147 build_type = integer_type_node;
7148 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
7149 || code0 == COMPLEX_TYPE)
7150 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
7151 || code1 == COMPLEX_TYPE))
7153 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
7155 tree tt0 = TREE_TYPE (type0);
7156 tree tt1 = TREE_TYPE (type1);
7157 /* Anything compares with void *. void * compares with anything.
7158 Otherwise, the targets must be compatible
7159 and both must be object or both incomplete. */
7160 if (comp_target_types (type0, type1, 1))
7161 result_type = common_pointer_type (type0, type1);
7162 else if (VOID_TYPE_P (tt0))
7164 /* op0 != orig_op0 detects the case of something
7165 whose value is 0 but which isn't a valid null ptr const. */
7166 if (pedantic && (!integer_zerop (op0) || op0 != orig_op0)
7167 && TREE_CODE (tt1) == FUNCTION_TYPE)
7168 pedwarn ("ISO C forbids comparison of `void *' with function pointer");
7170 else if (VOID_TYPE_P (tt1))
7172 if (pedantic && (!integer_zerop (op1) || op1 != orig_op1)
7173 && TREE_CODE (tt0) == FUNCTION_TYPE)
7174 pedwarn ("ISO C forbids comparison of `void *' with function pointer");
7177 pedwarn ("comparison of distinct pointer types lacks a cast");
7179 if (result_type == NULL_TREE)
7180 result_type = ptr_type_node;
7182 else if (code0 == POINTER_TYPE && TREE_CODE (op1) == INTEGER_CST
7183 && integer_zerop (op1))
7184 result_type = type0;
7185 else if (code1 == POINTER_TYPE && TREE_CODE (op0) == INTEGER_CST
7186 && integer_zerop (op0))
7187 result_type = type1;
7188 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
7190 result_type = type0;
7191 pedwarn ("comparison between pointer and integer");
7193 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
7195 result_type = type1;
7196 pedwarn ("comparison between pointer and integer");
7202 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE)
7203 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE))
7205 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
7207 if (comp_target_types (type0, type1, 1))
7209 result_type = common_pointer_type (type0, type1);
7211 && TREE_CODE (TREE_TYPE (type0)) == FUNCTION_TYPE)
7212 pedwarn ("ISO C forbids ordered comparisons of pointers to functions");
7216 result_type = ptr_type_node;
7217 pedwarn ("comparison of distinct pointer types lacks a cast");
7226 build_type = integer_type_node;
7227 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE)
7228 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE))
7230 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
7232 if (comp_target_types (type0, type1, 1))
7234 result_type = common_pointer_type (type0, type1);
7235 if (!COMPLETE_TYPE_P (TREE_TYPE (type0))
7236 != !COMPLETE_TYPE_P (TREE_TYPE (type1)))
7237 pedwarn ("comparison of complete and incomplete pointers");
7239 && TREE_CODE (TREE_TYPE (type0)) == FUNCTION_TYPE)
7240 pedwarn ("ISO C forbids ordered comparisons of pointers to functions");
7244 result_type = ptr_type_node;
7245 pedwarn ("comparison of distinct pointer types lacks a cast");
7248 else if (code0 == POINTER_TYPE && TREE_CODE (op1) == INTEGER_CST
7249 && integer_zerop (op1))
7251 result_type = type0;
7252 if (pedantic || extra_warnings)
7253 pedwarn ("ordered comparison of pointer with integer zero");
7255 else if (code1 == POINTER_TYPE && TREE_CODE (op0) == INTEGER_CST
7256 && integer_zerop (op0))
7258 result_type = type1;
7260 pedwarn ("ordered comparison of pointer with integer zero");
7262 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
7264 result_type = type0;
7265 pedwarn ("comparison between pointer and integer");
7267 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
7269 result_type = type1;
7270 pedwarn ("comparison between pointer and integer");
7274 case UNORDERED_EXPR:
7282 build_type = integer_type_node;
7283 if (code0 != REAL_TYPE || code1 != REAL_TYPE)
7285 error ("unordered comparison on non-floating point argument");
7286 return error_mark_node;
7295 if (code0 == ERROR_MARK || code1 == ERROR_MARK)
7296 return error_mark_node;
7298 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE || code0 == COMPLEX_TYPE
7299 || code0 == VECTOR_TYPE)
7301 (code1 == INTEGER_TYPE || code1 == REAL_TYPE || code1 == COMPLEX_TYPE
7302 || code1 == VECTOR_TYPE))
7304 int none_complex = (code0 != COMPLEX_TYPE && code1 != COMPLEX_TYPE);
7306 if (shorten || common || short_compare)
7307 result_type = common_type (type0, type1);
7309 /* For certain operations (which identify themselves by shorten != 0)
7310 if both args were extended from the same smaller type,
7311 do the arithmetic in that type and then extend.
7313 shorten !=0 and !=1 indicates a bitwise operation.
7314 For them, this optimization is safe only if
7315 both args are zero-extended or both are sign-extended.
7316 Otherwise, we might change the result.
7317 Eg, (short)-1 | (unsigned short)-1 is (int)-1
7318 but calculated in (unsigned short) it would be (unsigned short)-1. */
7320 if (shorten && none_complex)
7322 int unsigned0, unsigned1;
7323 tree arg0 = get_narrower (op0, &unsigned0);
7324 tree arg1 = get_narrower (op1, &unsigned1);
7325 /* UNS is 1 if the operation to be done is an unsigned one. */
7326 int uns = TYPE_UNSIGNED (result_type);
7329 final_type = result_type;
7331 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
7332 but it *requires* conversion to FINAL_TYPE. */
7334 if ((TYPE_PRECISION (TREE_TYPE (op0))
7335 == TYPE_PRECISION (TREE_TYPE (arg0)))
7336 && TREE_TYPE (op0) != final_type)
7337 unsigned0 = TYPE_UNSIGNED (TREE_TYPE (op0));
7338 if ((TYPE_PRECISION (TREE_TYPE (op1))
7339 == TYPE_PRECISION (TREE_TYPE (arg1)))
7340 && TREE_TYPE (op1) != final_type)
7341 unsigned1 = TYPE_UNSIGNED (TREE_TYPE (op1));
7343 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
7345 /* For bitwise operations, signedness of nominal type
7346 does not matter. Consider only how operands were extended. */
7350 /* Note that in all three cases below we refrain from optimizing
7351 an unsigned operation on sign-extended args.
7352 That would not be valid. */
7354 /* Both args variable: if both extended in same way
7355 from same width, do it in that width.
7356 Do it unsigned if args were zero-extended. */
7357 if ((TYPE_PRECISION (TREE_TYPE (arg0))
7358 < TYPE_PRECISION (result_type))
7359 && (TYPE_PRECISION (TREE_TYPE (arg1))
7360 == TYPE_PRECISION (TREE_TYPE (arg0)))
7361 && unsigned0 == unsigned1
7362 && (unsigned0 || !uns))
7364 = c_common_signed_or_unsigned_type
7365 (unsigned0, common_type (TREE_TYPE (arg0), TREE_TYPE (arg1)));
7366 else if (TREE_CODE (arg0) == INTEGER_CST
7367 && (unsigned1 || !uns)
7368 && (TYPE_PRECISION (TREE_TYPE (arg1))
7369 < TYPE_PRECISION (result_type))
7371 = c_common_signed_or_unsigned_type (unsigned1,
7373 int_fits_type_p (arg0, type)))
7375 else if (TREE_CODE (arg1) == INTEGER_CST
7376 && (unsigned0 || !uns)
7377 && (TYPE_PRECISION (TREE_TYPE (arg0))
7378 < TYPE_PRECISION (result_type))
7380 = c_common_signed_or_unsigned_type (unsigned0,
7382 int_fits_type_p (arg1, type)))
7386 /* Shifts can be shortened if shifting right. */
7391 tree arg0 = get_narrower (op0, &unsigned_arg);
7393 final_type = result_type;
7395 if (arg0 == op0 && final_type == TREE_TYPE (op0))
7396 unsigned_arg = TYPE_UNSIGNED (TREE_TYPE (op0));
7398 if (TYPE_PRECISION (TREE_TYPE (arg0)) < TYPE_PRECISION (result_type)
7399 /* We can shorten only if the shift count is less than the
7400 number of bits in the smaller type size. */
7401 && compare_tree_int (op1, TYPE_PRECISION (TREE_TYPE (arg0))) < 0
7402 /* We cannot drop an unsigned shift after sign-extension. */
7403 && (!TYPE_UNSIGNED (final_type) || unsigned_arg))
7405 /* Do an unsigned shift if the operand was zero-extended. */
7407 = c_common_signed_or_unsigned_type (unsigned_arg,
7409 /* Convert value-to-be-shifted to that type. */
7410 if (TREE_TYPE (op0) != result_type)
7411 op0 = convert (result_type, op0);
7416 /* Comparison operations are shortened too but differently.
7417 They identify themselves by setting short_compare = 1. */
7421 /* Don't write &op0, etc., because that would prevent op0
7422 from being kept in a register.
7423 Instead, make copies of the our local variables and
7424 pass the copies by reference, then copy them back afterward. */
7425 tree xop0 = op0, xop1 = op1, xresult_type = result_type;
7426 enum tree_code xresultcode = resultcode;
7428 = shorten_compare (&xop0, &xop1, &xresult_type, &xresultcode);
7433 op0 = xop0, op1 = xop1;
7435 resultcode = xresultcode;
7437 if (warn_sign_compare && skip_evaluation == 0)
7439 int op0_signed = ! TYPE_UNSIGNED (TREE_TYPE (orig_op0));
7440 int op1_signed = ! TYPE_UNSIGNED (TREE_TYPE (orig_op1));
7441 int unsignedp0, unsignedp1;
7442 tree primop0 = get_narrower (op0, &unsignedp0);
7443 tree primop1 = get_narrower (op1, &unsignedp1);
7447 STRIP_TYPE_NOPS (xop0);
7448 STRIP_TYPE_NOPS (xop1);
7450 /* Give warnings for comparisons between signed and unsigned
7451 quantities that may fail.
7453 Do the checking based on the original operand trees, so that
7454 casts will be considered, but default promotions won't be.
7456 Do not warn if the comparison is being done in a signed type,
7457 since the signed type will only be chosen if it can represent
7458 all the values of the unsigned type. */
7459 if (! TYPE_UNSIGNED (result_type))
7461 /* Do not warn if both operands are the same signedness. */
7462 else if (op0_signed == op1_signed)
7469 sop = xop0, uop = xop1;
7471 sop = xop1, uop = xop0;
7473 /* Do not warn if the signed quantity is an
7474 unsuffixed integer literal (or some static
7475 constant expression involving such literals or a
7476 conditional expression involving such literals)
7477 and it is non-negative. */
7478 if (tree_expr_nonnegative_p (sop))
7480 /* Do not warn if the comparison is an equality operation,
7481 the unsigned quantity is an integral constant, and it
7482 would fit in the result if the result were signed. */
7483 else if (TREE_CODE (uop) == INTEGER_CST
7484 && (resultcode == EQ_EXPR || resultcode == NE_EXPR)
7486 (uop, c_common_signed_type (result_type)))
7488 /* Do not warn if the unsigned quantity is an enumeration
7489 constant and its maximum value would fit in the result
7490 if the result were signed. */
7491 else if (TREE_CODE (uop) == INTEGER_CST
7492 && TREE_CODE (TREE_TYPE (uop)) == ENUMERAL_TYPE
7494 (TYPE_MAX_VALUE (TREE_TYPE(uop)),
7495 c_common_signed_type (result_type)))
7498 warning ("comparison between signed and unsigned");
7501 /* Warn if two unsigned values are being compared in a size
7502 larger than their original size, and one (and only one) is the
7503 result of a `~' operator. This comparison will always fail.
7505 Also warn if one operand is a constant, and the constant
7506 does not have all bits set that are set in the ~ operand
7507 when it is extended. */
7509 if ((TREE_CODE (primop0) == BIT_NOT_EXPR)
7510 != (TREE_CODE (primop1) == BIT_NOT_EXPR))
7512 if (TREE_CODE (primop0) == BIT_NOT_EXPR)
7513 primop0 = get_narrower (TREE_OPERAND (primop0, 0),
7516 primop1 = get_narrower (TREE_OPERAND (primop1, 0),
7519 if (host_integerp (primop0, 0) || host_integerp (primop1, 0))
7522 HOST_WIDE_INT constant, mask;
7523 int unsignedp, bits;
7525 if (host_integerp (primop0, 0))
7528 unsignedp = unsignedp1;
7529 constant = tree_low_cst (primop0, 0);
7534 unsignedp = unsignedp0;
7535 constant = tree_low_cst (primop1, 0);
7538 bits = TYPE_PRECISION (TREE_TYPE (primop));
7539 if (bits < TYPE_PRECISION (result_type)
7540 && bits < HOST_BITS_PER_WIDE_INT && unsignedp)
7542 mask = (~ (HOST_WIDE_INT) 0) << bits;
7543 if ((mask & constant) != mask)
7544 warning ("comparison of promoted ~unsigned with constant");
7547 else if (unsignedp0 && unsignedp1
7548 && (TYPE_PRECISION (TREE_TYPE (primop0))
7549 < TYPE_PRECISION (result_type))
7550 && (TYPE_PRECISION (TREE_TYPE (primop1))
7551 < TYPE_PRECISION (result_type)))
7552 warning ("comparison of promoted ~unsigned with unsigned");
7558 /* At this point, RESULT_TYPE must be nonzero to avoid an error message.
7559 If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
7560 Then the expression will be built.
7561 It will be given type FINAL_TYPE if that is nonzero;
7562 otherwise, it will be given type RESULT_TYPE. */
7566 binary_op_error (code);
7567 return error_mark_node;
7572 if (TREE_TYPE (op0) != result_type)
7573 op0 = convert (result_type, op0);
7574 if (TREE_TYPE (op1) != result_type)
7575 op1 = convert (result_type, op1);
7578 if (build_type == NULL_TREE)
7579 build_type = result_type;
7582 tree result = build (resultcode, build_type, op0, op1);
7584 /* Treat expressions in initializers specially as they can't trap. */
7585 result = require_constant_value ? fold_initializer (result)
7588 if (final_type != 0)
7589 result = convert (final_type, result);
7594 /* Build the result of __builtin_offsetof. TYPE is the first argument to
7595 offsetof, i.e. a type. LIST is a tree_list that encodes component and
7596 array references; PURPOSE is set for the former and VALUE is set for
7600 build_offsetof (tree type, tree list)
7604 /* Build "*(type *)0". */
7605 t = convert (build_pointer_type (type), null_pointer_node);
7606 t = build_indirect_ref (t, "");
7608 /* Build COMPONENT and ARRAY_REF expressions as needed. */
7609 for (list = nreverse (list); list ; list = TREE_CHAIN (list))
7610 if (TREE_PURPOSE (list))
7611 t = build_component_ref (t, TREE_PURPOSE (list));
7613 t = build_array_ref (t, TREE_VALUE (list));
7615 /* Finalize the offsetof expression. For now all we need to do is take
7616 the address of the expression we created, and cast that to an integer
7617 type; this mirrors the traditional macro implementation of offsetof. */
7618 t = build_unary_op (ADDR_EXPR, t, 0);
7619 return convert (size_type_node, t);