1 /* Build expressions with type checking for C compiler.
2 Copyright (C) 1987, 1988, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004, 2005 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, 51 Franklin Street, Fifth Floor, 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"
46 #include "tree-flow.h"
48 /* Possible cases of implicit bad conversions. Used to select
49 diagnostic messages in convert_for_assignment. */
58 /* The level of nesting inside "__alignof__". */
61 /* The level of nesting inside "sizeof". */
64 /* The level of nesting inside "typeof". */
67 struct c_label_context_se *label_context_stack_se;
68 struct c_label_context_vm *label_context_stack_vm;
70 /* Nonzero if we've already printed a "missing braces around initializer"
71 message within this initializer. */
72 static int missing_braces_mentioned;
74 static int require_constant_value;
75 static int require_constant_elements;
77 static tree qualify_type (tree, tree);
78 static int tagged_types_tu_compatible_p (tree, tree);
79 static int comp_target_types (tree, tree);
80 static int function_types_compatible_p (tree, tree);
81 static int type_lists_compatible_p (tree, tree);
82 static tree decl_constant_value_for_broken_optimization (tree);
83 static tree lookup_field (tree, tree);
84 static tree convert_arguments (tree, tree, tree, tree);
85 static tree pointer_diff (tree, tree);
86 static tree convert_for_assignment (tree, tree, enum impl_conv, tree, tree,
88 static tree valid_compound_expr_initializer (tree, tree);
89 static void push_string (const char *);
90 static void push_member_name (tree);
91 static void push_array_bounds (int);
92 static int spelling_length (void);
93 static char *print_spelling (char *);
94 static void warning_init (const char *);
95 static tree digest_init (tree, tree, bool, int);
96 static void output_init_element (tree, bool, tree, tree, int);
97 static void output_pending_init_elements (int);
98 static int set_designator (int);
99 static void push_range_stack (tree);
100 static void add_pending_init (tree, tree);
101 static void set_nonincremental_init (void);
102 static void set_nonincremental_init_from_string (tree);
103 static tree find_init_member (tree);
104 static void readonly_error (tree, enum lvalue_use);
105 static int lvalue_or_else (tree, enum lvalue_use);
106 static int lvalue_p (tree);
107 static void record_maybe_used_decl (tree);
109 /* Do `exp = require_complete_type (exp);' to make sure exp
110 does not have an incomplete type. (That includes void types.) */
113 require_complete_type (tree value)
115 tree type = TREE_TYPE (value);
117 if (value == error_mark_node || type == error_mark_node)
118 return error_mark_node;
120 /* First, detect a valid value with a complete type. */
121 if (COMPLETE_TYPE_P (type))
124 c_incomplete_type_error (value, type);
125 return error_mark_node;
128 /* Print an error message for invalid use of an incomplete type.
129 VALUE is the expression that was used (or 0 if that isn't known)
130 and TYPE is the type that was invalid. */
133 c_incomplete_type_error (tree value, tree type)
135 const char *type_code_string;
137 /* Avoid duplicate error message. */
138 if (TREE_CODE (type) == ERROR_MARK)
141 if (value != 0 && (TREE_CODE (value) == VAR_DECL
142 || TREE_CODE (value) == PARM_DECL))
143 error ("%qD has an incomplete type", value);
147 /* We must print an error message. Be clever about what it says. */
149 switch (TREE_CODE (type))
152 type_code_string = "struct";
156 type_code_string = "union";
160 type_code_string = "enum";
164 error ("invalid use of void expression");
168 if (TYPE_DOMAIN (type))
170 if (TYPE_MAX_VALUE (TYPE_DOMAIN (type)) == NULL)
172 error ("invalid use of flexible array member");
175 type = TREE_TYPE (type);
178 error ("invalid use of array with unspecified bounds");
185 if (TREE_CODE (TYPE_NAME (type)) == IDENTIFIER_NODE)
186 error ("invalid use of undefined type %<%s %E%>",
187 type_code_string, TYPE_NAME (type));
189 /* If this type has a typedef-name, the TYPE_NAME is a TYPE_DECL. */
190 error ("invalid use of incomplete typedef %qD", TYPE_NAME (type));
194 /* Given a type, apply default promotions wrt unnamed function
195 arguments and return the new type. */
198 c_type_promotes_to (tree type)
200 if (TYPE_MAIN_VARIANT (type) == float_type_node)
201 return double_type_node;
203 if (c_promoting_integer_type_p (type))
205 /* Preserve unsignedness if not really getting any wider. */
206 if (TYPE_UNSIGNED (type)
207 && (TYPE_PRECISION (type) == TYPE_PRECISION (integer_type_node)))
208 return unsigned_type_node;
209 return integer_type_node;
215 /* Return a variant of TYPE which has all the type qualifiers of LIKE
216 as well as those of TYPE. */
219 qualify_type (tree type, tree like)
221 return c_build_qualified_type (type,
222 TYPE_QUALS (type) | TYPE_QUALS (like));
225 /* Return the composite type of two compatible types.
227 We assume that comptypes has already been done and returned
228 nonzero; if that isn't so, this may crash. In particular, we
229 assume that qualifiers match. */
232 composite_type (tree t1, tree t2)
234 enum tree_code code1;
235 enum tree_code code2;
238 /* Save time if the two types are the same. */
240 if (t1 == t2) return t1;
242 /* If one type is nonsense, use the other. */
243 if (t1 == error_mark_node)
245 if (t2 == error_mark_node)
248 code1 = TREE_CODE (t1);
249 code2 = TREE_CODE (t2);
251 /* Merge the attributes. */
252 attributes = targetm.merge_type_attributes (t1, t2);
254 /* If one is an enumerated type and the other is the compatible
255 integer type, the composite type might be either of the two
256 (DR#013 question 3). For consistency, use the enumerated type as
257 the composite type. */
259 if (code1 == ENUMERAL_TYPE && code2 == INTEGER_TYPE)
261 if (code2 == ENUMERAL_TYPE && code1 == INTEGER_TYPE)
264 gcc_assert (code1 == code2);
269 /* For two pointers, do this recursively on the target type. */
271 tree pointed_to_1 = TREE_TYPE (t1);
272 tree pointed_to_2 = TREE_TYPE (t2);
273 tree target = composite_type (pointed_to_1, pointed_to_2);
274 t1 = build_pointer_type (target);
275 t1 = build_type_attribute_variant (t1, attributes);
276 return qualify_type (t1, t2);
281 tree elt = composite_type (TREE_TYPE (t1), TREE_TYPE (t2));
285 /* We should not have any type quals on arrays at all. */
286 gcc_assert (!TYPE_QUALS (t1) && !TYPE_QUALS (t2));
288 /* Save space: see if the result is identical to one of the args. */
289 if (elt == TREE_TYPE (t1) && TYPE_DOMAIN (t1))
290 return build_type_attribute_variant (t1, attributes);
291 if (elt == TREE_TYPE (t2) && TYPE_DOMAIN (t2))
292 return build_type_attribute_variant (t2, attributes);
294 if (elt == TREE_TYPE (t1) && !TYPE_DOMAIN (t2) && !TYPE_DOMAIN (t1))
295 return build_type_attribute_variant (t1, attributes);
296 if (elt == TREE_TYPE (t2) && !TYPE_DOMAIN (t2) && !TYPE_DOMAIN (t1))
297 return build_type_attribute_variant (t2, attributes);
299 /* Merge the element types, and have a size if either arg has
300 one. We may have qualifiers on the element types. To set
301 up TYPE_MAIN_VARIANT correctly, we need to form the
302 composite of the unqualified types and add the qualifiers
304 quals = TYPE_QUALS (strip_array_types (elt));
305 unqual_elt = c_build_qualified_type (elt, TYPE_UNQUALIFIED);
306 t1 = build_array_type (unqual_elt,
307 TYPE_DOMAIN (TYPE_DOMAIN (t1) ? t1 : t2));
308 t1 = c_build_qualified_type (t1, quals);
309 return build_type_attribute_variant (t1, attributes);
313 /* Function types: prefer the one that specified arg types.
314 If both do, merge the arg types. Also merge the return types. */
316 tree valtype = composite_type (TREE_TYPE (t1), TREE_TYPE (t2));
317 tree p1 = TYPE_ARG_TYPES (t1);
318 tree p2 = TYPE_ARG_TYPES (t2);
323 /* Save space: see if the result is identical to one of the args. */
324 if (valtype == TREE_TYPE (t1) && !TYPE_ARG_TYPES (t2))
325 return build_type_attribute_variant (t1, attributes);
326 if (valtype == TREE_TYPE (t2) && !TYPE_ARG_TYPES (t1))
327 return build_type_attribute_variant (t2, attributes);
329 /* Simple way if one arg fails to specify argument types. */
330 if (TYPE_ARG_TYPES (t1) == 0)
332 t1 = build_function_type (valtype, TYPE_ARG_TYPES (t2));
333 t1 = build_type_attribute_variant (t1, attributes);
334 return qualify_type (t1, t2);
336 if (TYPE_ARG_TYPES (t2) == 0)
338 t1 = build_function_type (valtype, TYPE_ARG_TYPES (t1));
339 t1 = build_type_attribute_variant (t1, attributes);
340 return qualify_type (t1, t2);
343 /* If both args specify argument types, we must merge the two
344 lists, argument by argument. */
345 /* Tell global_bindings_p to return false so that variable_size
346 doesn't die on VLAs in parameter types. */
347 c_override_global_bindings_to_false = true;
349 len = list_length (p1);
352 for (i = 0; i < len; i++)
353 newargs = tree_cons (NULL_TREE, NULL_TREE, newargs);
358 p1 = TREE_CHAIN (p1), p2 = TREE_CHAIN (p2), n = TREE_CHAIN (n))
360 /* A null type means arg type is not specified.
361 Take whatever the other function type has. */
362 if (TREE_VALUE (p1) == 0)
364 TREE_VALUE (n) = TREE_VALUE (p2);
367 if (TREE_VALUE (p2) == 0)
369 TREE_VALUE (n) = TREE_VALUE (p1);
373 /* Given wait (union {union wait *u; int *i} *)
374 and wait (union wait *),
375 prefer union wait * as type of parm. */
376 if (TREE_CODE (TREE_VALUE (p1)) == UNION_TYPE
377 && TREE_VALUE (p1) != TREE_VALUE (p2))
380 tree mv2 = TREE_VALUE (p2);
381 if (mv2 && mv2 != error_mark_node
382 && TREE_CODE (mv2) != ARRAY_TYPE)
383 mv2 = TYPE_MAIN_VARIANT (mv2);
384 for (memb = TYPE_FIELDS (TREE_VALUE (p1));
385 memb; memb = TREE_CHAIN (memb))
387 tree mv3 = TREE_TYPE (memb);
388 if (mv3 && mv3 != error_mark_node
389 && TREE_CODE (mv3) != ARRAY_TYPE)
390 mv3 = TYPE_MAIN_VARIANT (mv3);
391 if (comptypes (mv3, mv2))
393 TREE_VALUE (n) = composite_type (TREE_TYPE (memb),
396 pedwarn ("function types not truly compatible in ISO C");
401 if (TREE_CODE (TREE_VALUE (p2)) == UNION_TYPE
402 && TREE_VALUE (p2) != TREE_VALUE (p1))
405 tree mv1 = TREE_VALUE (p1);
406 if (mv1 && mv1 != error_mark_node
407 && TREE_CODE (mv1) != ARRAY_TYPE)
408 mv1 = TYPE_MAIN_VARIANT (mv1);
409 for (memb = TYPE_FIELDS (TREE_VALUE (p2));
410 memb; memb = TREE_CHAIN (memb))
412 tree mv3 = TREE_TYPE (memb);
413 if (mv3 && mv3 != error_mark_node
414 && TREE_CODE (mv3) != ARRAY_TYPE)
415 mv3 = TYPE_MAIN_VARIANT (mv3);
416 if (comptypes (mv3, mv1))
418 TREE_VALUE (n) = composite_type (TREE_TYPE (memb),
421 pedwarn ("function types not truly compatible in ISO C");
426 TREE_VALUE (n) = composite_type (TREE_VALUE (p1), TREE_VALUE (p2));
430 c_override_global_bindings_to_false = false;
431 t1 = build_function_type (valtype, newargs);
432 t1 = qualify_type (t1, t2);
433 /* ... falls through ... */
437 return build_type_attribute_variant (t1, attributes);
442 /* Return the type of a conditional expression between pointers to
443 possibly differently qualified versions of compatible types.
445 We assume that comp_target_types has already been done and returned
446 nonzero; if that isn't so, this may crash. */
449 common_pointer_type (tree t1, tree t2)
452 tree pointed_to_1, mv1;
453 tree pointed_to_2, mv2;
456 /* Save time if the two types are the same. */
458 if (t1 == t2) return t1;
460 /* If one type is nonsense, use the other. */
461 if (t1 == error_mark_node)
463 if (t2 == error_mark_node)
466 gcc_assert (TREE_CODE (t1) == POINTER_TYPE
467 && TREE_CODE (t2) == POINTER_TYPE);
469 /* Merge the attributes. */
470 attributes = targetm.merge_type_attributes (t1, t2);
472 /* Find the composite type of the target types, and combine the
473 qualifiers of the two types' targets. Do not lose qualifiers on
474 array element types by taking the TYPE_MAIN_VARIANT. */
475 mv1 = pointed_to_1 = TREE_TYPE (t1);
476 mv2 = pointed_to_2 = TREE_TYPE (t2);
477 if (TREE_CODE (mv1) != ARRAY_TYPE)
478 mv1 = TYPE_MAIN_VARIANT (pointed_to_1);
479 if (TREE_CODE (mv2) != ARRAY_TYPE)
480 mv2 = TYPE_MAIN_VARIANT (pointed_to_2);
481 target = composite_type (mv1, mv2);
482 t1 = build_pointer_type (c_build_qualified_type
484 TYPE_QUALS (pointed_to_1) |
485 TYPE_QUALS (pointed_to_2)));
486 return build_type_attribute_variant (t1, attributes);
489 /* Return the common type for two arithmetic types under the usual
490 arithmetic conversions. The default conversions have already been
491 applied, and enumerated types converted to their compatible integer
492 types. The resulting type is unqualified and has no attributes.
494 This is the type for the result of most arithmetic operations
495 if the operands have the given two types. */
498 c_common_type (tree t1, tree t2)
500 enum tree_code code1;
501 enum tree_code code2;
503 /* If one type is nonsense, use the other. */
504 if (t1 == error_mark_node)
506 if (t2 == error_mark_node)
509 if (TYPE_QUALS (t1) != TYPE_UNQUALIFIED)
510 t1 = TYPE_MAIN_VARIANT (t1);
512 if (TYPE_QUALS (t2) != TYPE_UNQUALIFIED)
513 t2 = TYPE_MAIN_VARIANT (t2);
515 if (TYPE_ATTRIBUTES (t1) != NULL_TREE)
516 t1 = build_type_attribute_variant (t1, NULL_TREE);
518 if (TYPE_ATTRIBUTES (t2) != NULL_TREE)
519 t2 = build_type_attribute_variant (t2, NULL_TREE);
521 /* Save time if the two types are the same. */
523 if (t1 == t2) return t1;
525 code1 = TREE_CODE (t1);
526 code2 = TREE_CODE (t2);
528 gcc_assert (code1 == VECTOR_TYPE || code1 == COMPLEX_TYPE
529 || code1 == REAL_TYPE || code1 == INTEGER_TYPE);
530 gcc_assert (code2 == VECTOR_TYPE || code2 == COMPLEX_TYPE
531 || code2 == REAL_TYPE || code2 == INTEGER_TYPE);
533 /* If one type is a vector type, return that type. (How the usual
534 arithmetic conversions apply to the vector types extension is not
535 precisely specified.) */
536 if (code1 == VECTOR_TYPE)
539 if (code2 == VECTOR_TYPE)
542 /* If one type is complex, form the common type of the non-complex
543 components, then make that complex. Use T1 or T2 if it is the
545 if (code1 == COMPLEX_TYPE || code2 == COMPLEX_TYPE)
547 tree subtype1 = code1 == COMPLEX_TYPE ? TREE_TYPE (t1) : t1;
548 tree subtype2 = code2 == COMPLEX_TYPE ? TREE_TYPE (t2) : t2;
549 tree subtype = c_common_type (subtype1, subtype2);
551 if (code1 == COMPLEX_TYPE && TREE_TYPE (t1) == subtype)
553 else if (code2 == COMPLEX_TYPE && TREE_TYPE (t2) == subtype)
556 return build_complex_type (subtype);
559 /* If only one is real, use it as the result. */
561 if (code1 == REAL_TYPE && code2 != REAL_TYPE)
564 if (code2 == REAL_TYPE && code1 != REAL_TYPE)
567 /* Both real or both integers; use the one with greater precision. */
569 if (TYPE_PRECISION (t1) > TYPE_PRECISION (t2))
571 else if (TYPE_PRECISION (t2) > TYPE_PRECISION (t1))
574 /* Same precision. Prefer long longs to longs to ints when the
575 same precision, following the C99 rules on integer type rank
576 (which are equivalent to the C90 rules for C90 types). */
578 if (TYPE_MAIN_VARIANT (t1) == long_long_unsigned_type_node
579 || TYPE_MAIN_VARIANT (t2) == long_long_unsigned_type_node)
580 return long_long_unsigned_type_node;
582 if (TYPE_MAIN_VARIANT (t1) == long_long_integer_type_node
583 || TYPE_MAIN_VARIANT (t2) == long_long_integer_type_node)
585 if (TYPE_UNSIGNED (t1) || TYPE_UNSIGNED (t2))
586 return long_long_unsigned_type_node;
588 return long_long_integer_type_node;
591 if (TYPE_MAIN_VARIANT (t1) == long_unsigned_type_node
592 || TYPE_MAIN_VARIANT (t2) == long_unsigned_type_node)
593 return long_unsigned_type_node;
595 if (TYPE_MAIN_VARIANT (t1) == long_integer_type_node
596 || TYPE_MAIN_VARIANT (t2) == long_integer_type_node)
598 /* But preserve unsignedness from the other type,
599 since long cannot hold all the values of an unsigned int. */
600 if (TYPE_UNSIGNED (t1) || TYPE_UNSIGNED (t2))
601 return long_unsigned_type_node;
603 return long_integer_type_node;
606 /* Likewise, prefer long double to double even if same size. */
607 if (TYPE_MAIN_VARIANT (t1) == long_double_type_node
608 || TYPE_MAIN_VARIANT (t2) == long_double_type_node)
609 return long_double_type_node;
611 /* Otherwise prefer the unsigned one. */
613 if (TYPE_UNSIGNED (t1))
619 /* Wrapper around c_common_type that is used by c-common.c. ENUMERAL_TYPEs
620 are allowed here and are converted to their compatible integer types.
621 BOOLEAN_TYPEs are allowed here and return either boolean_type_node or
622 preferably a non-Boolean type as the common type. */
624 common_type (tree t1, tree t2)
626 if (TREE_CODE (t1) == ENUMERAL_TYPE)
627 t1 = c_common_type_for_size (TYPE_PRECISION (t1), 1);
628 if (TREE_CODE (t2) == ENUMERAL_TYPE)
629 t2 = c_common_type_for_size (TYPE_PRECISION (t2), 1);
631 /* If both types are BOOLEAN_TYPE, then return boolean_type_node. */
632 if (TREE_CODE (t1) == BOOLEAN_TYPE
633 && TREE_CODE (t2) == BOOLEAN_TYPE)
634 return boolean_type_node;
636 /* If either type is BOOLEAN_TYPE, then return the other. */
637 if (TREE_CODE (t1) == BOOLEAN_TYPE)
639 if (TREE_CODE (t2) == BOOLEAN_TYPE)
642 return c_common_type (t1, t2);
645 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
646 or various other operations. Return 2 if they are compatible
647 but a warning may be needed if you use them together. */
650 comptypes (tree type1, tree type2)
656 /* Suppress errors caused by previously reported errors. */
658 if (t1 == t2 || !t1 || !t2
659 || TREE_CODE (t1) == ERROR_MARK || TREE_CODE (t2) == ERROR_MARK)
662 /* If either type is the internal version of sizetype, return the
664 if (TREE_CODE (t1) == INTEGER_TYPE && TYPE_IS_SIZETYPE (t1)
665 && TYPE_ORIG_SIZE_TYPE (t1))
666 t1 = TYPE_ORIG_SIZE_TYPE (t1);
668 if (TREE_CODE (t2) == INTEGER_TYPE && TYPE_IS_SIZETYPE (t2)
669 && TYPE_ORIG_SIZE_TYPE (t2))
670 t2 = TYPE_ORIG_SIZE_TYPE (t2);
673 /* Enumerated types are compatible with integer types, but this is
674 not transitive: two enumerated types in the same translation unit
675 are compatible with each other only if they are the same type. */
677 if (TREE_CODE (t1) == ENUMERAL_TYPE && TREE_CODE (t2) != ENUMERAL_TYPE)
678 t1 = c_common_type_for_size (TYPE_PRECISION (t1), TYPE_UNSIGNED (t1));
679 else if (TREE_CODE (t2) == ENUMERAL_TYPE && TREE_CODE (t1) != ENUMERAL_TYPE)
680 t2 = c_common_type_for_size (TYPE_PRECISION (t2), TYPE_UNSIGNED (t2));
685 /* Different classes of types can't be compatible. */
687 if (TREE_CODE (t1) != TREE_CODE (t2))
690 /* Qualifiers must match. C99 6.7.3p9 */
692 if (TYPE_QUALS (t1) != TYPE_QUALS (t2))
695 /* Allow for two different type nodes which have essentially the same
696 definition. Note that we already checked for equality of the type
697 qualifiers (just above). */
699 if (TREE_CODE (t1) != ARRAY_TYPE
700 && TYPE_MAIN_VARIANT (t1) == TYPE_MAIN_VARIANT (t2))
703 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
704 if (!(attrval = targetm.comp_type_attributes (t1, t2)))
707 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
710 switch (TREE_CODE (t1))
713 /* Do not remove mode or aliasing information. */
714 if (TYPE_MODE (t1) != TYPE_MODE (t2)
715 || TYPE_REF_CAN_ALIAS_ALL (t1) != TYPE_REF_CAN_ALIAS_ALL (t2))
717 val = (TREE_TYPE (t1) == TREE_TYPE (t2)
718 ? 1 : comptypes (TREE_TYPE (t1), TREE_TYPE (t2)));
722 val = function_types_compatible_p (t1, t2);
727 tree d1 = TYPE_DOMAIN (t1);
728 tree d2 = TYPE_DOMAIN (t2);
729 bool d1_variable, d2_variable;
730 bool d1_zero, d2_zero;
733 /* Target types must match incl. qualifiers. */
734 if (TREE_TYPE (t1) != TREE_TYPE (t2)
735 && 0 == (val = comptypes (TREE_TYPE (t1), TREE_TYPE (t2))))
738 /* Sizes must match unless one is missing or variable. */
739 if (d1 == 0 || d2 == 0 || d1 == d2)
742 d1_zero = !TYPE_MAX_VALUE (d1);
743 d2_zero = !TYPE_MAX_VALUE (d2);
745 d1_variable = (!d1_zero
746 && (TREE_CODE (TYPE_MIN_VALUE (d1)) != INTEGER_CST
747 || TREE_CODE (TYPE_MAX_VALUE (d1)) != INTEGER_CST));
748 d2_variable = (!d2_zero
749 && (TREE_CODE (TYPE_MIN_VALUE (d2)) != INTEGER_CST
750 || TREE_CODE (TYPE_MAX_VALUE (d2)) != INTEGER_CST));
752 if (d1_variable || d2_variable)
754 if (d1_zero && d2_zero)
756 if (d1_zero || d2_zero
757 || !tree_int_cst_equal (TYPE_MIN_VALUE (d1), TYPE_MIN_VALUE (d2))
758 || !tree_int_cst_equal (TYPE_MAX_VALUE (d1), TYPE_MAX_VALUE (d2)))
767 if (val != 1 && !same_translation_unit_p (t1, t2))
768 val = tagged_types_tu_compatible_p (t1, t2);
772 val = TYPE_VECTOR_SUBPARTS (t1) == TYPE_VECTOR_SUBPARTS (t2)
773 && comptypes (TREE_TYPE (t1), TREE_TYPE (t2));
779 return attrval == 2 && val == 1 ? 2 : val;
782 /* Return 1 if TTL and TTR are pointers to types that are equivalent,
783 ignoring their qualifiers. */
786 comp_target_types (tree ttl, tree ttr)
791 /* Do not lose qualifiers on element types of array types that are
792 pointer targets by taking their TYPE_MAIN_VARIANT. */
793 mvl = TREE_TYPE (ttl);
794 mvr = TREE_TYPE (ttr);
795 if (TREE_CODE (mvl) != ARRAY_TYPE)
796 mvl = TYPE_MAIN_VARIANT (mvl);
797 if (TREE_CODE (mvr) != ARRAY_TYPE)
798 mvr = TYPE_MAIN_VARIANT (mvr);
799 val = comptypes (mvl, mvr);
801 if (val == 2 && pedantic)
802 pedwarn ("types are not quite compatible");
806 /* Subroutines of `comptypes'. */
808 /* Determine whether two trees derive from the same translation unit.
809 If the CONTEXT chain ends in a null, that tree's context is still
810 being parsed, so if two trees have context chains ending in null,
811 they're in the same translation unit. */
813 same_translation_unit_p (tree t1, tree t2)
815 while (t1 && TREE_CODE (t1) != TRANSLATION_UNIT_DECL)
816 switch (TREE_CODE_CLASS (TREE_CODE (t1)))
818 case tcc_declaration:
819 t1 = DECL_CONTEXT (t1); break;
821 t1 = TYPE_CONTEXT (t1); break;
822 case tcc_exceptional:
823 t1 = BLOCK_SUPERCONTEXT (t1); break; /* assume block */
824 default: gcc_unreachable ();
827 while (t2 && TREE_CODE (t2) != TRANSLATION_UNIT_DECL)
828 switch (TREE_CODE_CLASS (TREE_CODE (t2)))
830 case tcc_declaration:
831 t2 = DECL_CONTEXT (t2); break;
833 t2 = TYPE_CONTEXT (t2); break;
834 case tcc_exceptional:
835 t2 = BLOCK_SUPERCONTEXT (t2); break; /* assume block */
836 default: gcc_unreachable ();
842 /* The C standard says that two structures in different translation
843 units are compatible with each other only if the types of their
844 fields are compatible (among other things). So, consider two copies
845 of this structure: */
847 struct tagged_tu_seen {
848 const struct tagged_tu_seen * next;
853 /* Can they be compatible with each other? We choose to break the
854 recursion by allowing those types to be compatible. */
856 static const struct tagged_tu_seen * tagged_tu_seen_base;
858 /* Return 1 if two 'struct', 'union', or 'enum' types T1 and T2 are
859 compatible. If the two types are not the same (which has been
860 checked earlier), this can only happen when multiple translation
861 units are being compiled. See C99 6.2.7 paragraph 1 for the exact
865 tagged_types_tu_compatible_p (tree t1, tree t2)
868 bool needs_warning = false;
870 /* We have to verify that the tags of the types are the same. This
871 is harder than it looks because this may be a typedef, so we have
872 to go look at the original type. It may even be a typedef of a
874 In the case of compiler-created builtin structs the TYPE_DECL
875 may be a dummy, with no DECL_ORIGINAL_TYPE. Don't fault. */
876 while (TYPE_NAME (t1)
877 && TREE_CODE (TYPE_NAME (t1)) == TYPE_DECL
878 && DECL_ORIGINAL_TYPE (TYPE_NAME (t1)))
879 t1 = DECL_ORIGINAL_TYPE (TYPE_NAME (t1));
881 while (TYPE_NAME (t2)
882 && TREE_CODE (TYPE_NAME (t2)) == TYPE_DECL
883 && DECL_ORIGINAL_TYPE (TYPE_NAME (t2)))
884 t2 = DECL_ORIGINAL_TYPE (TYPE_NAME (t2));
886 /* C90 didn't have the requirement that the two tags be the same. */
887 if (flag_isoc99 && TYPE_NAME (t1) != TYPE_NAME (t2))
890 /* C90 didn't say what happened if one or both of the types were
891 incomplete; we choose to follow C99 rules here, which is that they
893 if (TYPE_SIZE (t1) == NULL
894 || TYPE_SIZE (t2) == NULL)
898 const struct tagged_tu_seen * tts_i;
899 for (tts_i = tagged_tu_seen_base; tts_i != NULL; tts_i = tts_i->next)
900 if (tts_i->t1 == t1 && tts_i->t2 == t2)
904 switch (TREE_CODE (t1))
909 /* Speed up the case where the type values are in the same order. */
910 tree tv1 = TYPE_VALUES (t1);
911 tree tv2 = TYPE_VALUES (t2);
916 for (;tv1 && tv2; tv1 = TREE_CHAIN (tv1), tv2 = TREE_CHAIN (tv2))
918 if (TREE_PURPOSE (tv1) != TREE_PURPOSE (tv2))
920 if (simple_cst_equal (TREE_VALUE (tv1), TREE_VALUE (tv2)) != 1)
924 if (tv1 == NULL_TREE && tv2 == NULL_TREE)
926 if (tv1 == NULL_TREE || tv2 == NULL_TREE)
929 if (list_length (TYPE_VALUES (t1)) != list_length (TYPE_VALUES (t2)))
932 for (s1 = TYPE_VALUES (t1); s1; s1 = TREE_CHAIN (s1))
934 s2 = purpose_member (TREE_PURPOSE (s1), TYPE_VALUES (t2));
936 || simple_cst_equal (TREE_VALUE (s1), TREE_VALUE (s2)) != 1)
944 if (list_length (TYPE_FIELDS (t1)) != list_length (TYPE_FIELDS (t2)))
947 for (s1 = TYPE_FIELDS (t1); s1; s1 = TREE_CHAIN (s1))
950 struct tagged_tu_seen tts;
952 tts.next = tagged_tu_seen_base;
955 tagged_tu_seen_base = &tts;
957 if (DECL_NAME (s1) != NULL)
958 for (s2 = TYPE_FIELDS (t2); s2; s2 = TREE_CHAIN (s2))
959 if (DECL_NAME (s1) == DECL_NAME (s2))
962 result = comptypes (TREE_TYPE (s1), TREE_TYPE (s2));
966 needs_warning = true;
968 if (TREE_CODE (s1) == FIELD_DECL
969 && simple_cst_equal (DECL_FIELD_BIT_OFFSET (s1),
970 DECL_FIELD_BIT_OFFSET (s2)) != 1)
976 tagged_tu_seen_base = tts.next;
980 return needs_warning ? 2 : 1;
985 struct tagged_tu_seen tts;
987 tts.next = tagged_tu_seen_base;
990 tagged_tu_seen_base = &tts;
992 for (s1 = TYPE_FIELDS (t1), s2 = TYPE_FIELDS (t2);
994 s1 = TREE_CHAIN (s1), s2 = TREE_CHAIN (s2))
997 if (TREE_CODE (s1) != TREE_CODE (s2)
998 || DECL_NAME (s1) != DECL_NAME (s2))
1000 result = comptypes (TREE_TYPE (s1), TREE_TYPE (s2));
1004 needs_warning = true;
1006 if (TREE_CODE (s1) == FIELD_DECL
1007 && simple_cst_equal (DECL_FIELD_BIT_OFFSET (s1),
1008 DECL_FIELD_BIT_OFFSET (s2)) != 1)
1011 tagged_tu_seen_base = tts.next;
1014 return needs_warning ? 2 : 1;
1022 /* Return 1 if two function types F1 and F2 are compatible.
1023 If either type specifies no argument types,
1024 the other must specify a fixed number of self-promoting arg types.
1025 Otherwise, if one type specifies only the number of arguments,
1026 the other must specify that number of self-promoting arg types.
1027 Otherwise, the argument types must match. */
1030 function_types_compatible_p (tree f1, tree f2)
1033 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1038 ret1 = TREE_TYPE (f1);
1039 ret2 = TREE_TYPE (f2);
1041 /* 'volatile' qualifiers on a function's return type used to mean
1042 the function is noreturn. */
1043 if (TYPE_VOLATILE (ret1) != TYPE_VOLATILE (ret2))
1044 pedwarn ("function return types not compatible due to %<volatile%>");
1045 if (TYPE_VOLATILE (ret1))
1046 ret1 = build_qualified_type (TYPE_MAIN_VARIANT (ret1),
1047 TYPE_QUALS (ret1) & ~TYPE_QUAL_VOLATILE);
1048 if (TYPE_VOLATILE (ret2))
1049 ret2 = build_qualified_type (TYPE_MAIN_VARIANT (ret2),
1050 TYPE_QUALS (ret2) & ~TYPE_QUAL_VOLATILE);
1051 val = comptypes (ret1, ret2);
1055 args1 = TYPE_ARG_TYPES (f1);
1056 args2 = TYPE_ARG_TYPES (f2);
1058 /* An unspecified parmlist matches any specified parmlist
1059 whose argument types don't need default promotions. */
1063 if (!self_promoting_args_p (args2))
1065 /* If one of these types comes from a non-prototype fn definition,
1066 compare that with the other type's arglist.
1067 If they don't match, ask for a warning (but no error). */
1068 if (TYPE_ACTUAL_ARG_TYPES (f1)
1069 && 1 != type_lists_compatible_p (args2, TYPE_ACTUAL_ARG_TYPES (f1)))
1075 if (!self_promoting_args_p (args1))
1077 if (TYPE_ACTUAL_ARG_TYPES (f2)
1078 && 1 != type_lists_compatible_p (args1, TYPE_ACTUAL_ARG_TYPES (f2)))
1083 /* Both types have argument lists: compare them and propagate results. */
1084 val1 = type_lists_compatible_p (args1, args2);
1085 return val1 != 1 ? val1 : val;
1088 /* Check two lists of types for compatibility,
1089 returning 0 for incompatible, 1 for compatible,
1090 or 2 for compatible with warning. */
1093 type_lists_compatible_p (tree args1, tree args2)
1095 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1101 tree a1, mv1, a2, mv2;
1102 if (args1 == 0 && args2 == 0)
1104 /* If one list is shorter than the other,
1105 they fail to match. */
1106 if (args1 == 0 || args2 == 0)
1108 mv1 = a1 = TREE_VALUE (args1);
1109 mv2 = a2 = TREE_VALUE (args2);
1110 if (mv1 && mv1 != error_mark_node && TREE_CODE (mv1) != ARRAY_TYPE)
1111 mv1 = TYPE_MAIN_VARIANT (mv1);
1112 if (mv2 && mv2 != error_mark_node && TREE_CODE (mv2) != ARRAY_TYPE)
1113 mv2 = TYPE_MAIN_VARIANT (mv2);
1114 /* A null pointer instead of a type
1115 means there is supposed to be an argument
1116 but nothing is specified about what type it has.
1117 So match anything that self-promotes. */
1120 if (c_type_promotes_to (a2) != a2)
1125 if (c_type_promotes_to (a1) != a1)
1128 /* If one of the lists has an error marker, ignore this arg. */
1129 else if (TREE_CODE (a1) == ERROR_MARK
1130 || TREE_CODE (a2) == ERROR_MARK)
1132 else if (!(newval = comptypes (mv1, mv2)))
1134 /* Allow wait (union {union wait *u; int *i} *)
1135 and wait (union wait *) to be compatible. */
1136 if (TREE_CODE (a1) == UNION_TYPE
1137 && (TYPE_NAME (a1) == 0
1138 || TYPE_TRANSPARENT_UNION (a1))
1139 && TREE_CODE (TYPE_SIZE (a1)) == INTEGER_CST
1140 && tree_int_cst_equal (TYPE_SIZE (a1),
1144 for (memb = TYPE_FIELDS (a1);
1145 memb; memb = TREE_CHAIN (memb))
1147 tree mv3 = TREE_TYPE (memb);
1148 if (mv3 && mv3 != error_mark_node
1149 && TREE_CODE (mv3) != ARRAY_TYPE)
1150 mv3 = TYPE_MAIN_VARIANT (mv3);
1151 if (comptypes (mv3, mv2))
1157 else if (TREE_CODE (a2) == UNION_TYPE
1158 && (TYPE_NAME (a2) == 0
1159 || TYPE_TRANSPARENT_UNION (a2))
1160 && TREE_CODE (TYPE_SIZE (a2)) == INTEGER_CST
1161 && tree_int_cst_equal (TYPE_SIZE (a2),
1165 for (memb = TYPE_FIELDS (a2);
1166 memb; memb = TREE_CHAIN (memb))
1168 tree mv3 = TREE_TYPE (memb);
1169 if (mv3 && mv3 != error_mark_node
1170 && TREE_CODE (mv3) != ARRAY_TYPE)
1171 mv3 = TYPE_MAIN_VARIANT (mv3);
1172 if (comptypes (mv3, mv1))
1182 /* comptypes said ok, but record if it said to warn. */
1186 args1 = TREE_CHAIN (args1);
1187 args2 = TREE_CHAIN (args2);
1191 /* Compute the size to increment a pointer by. */
1194 c_size_in_bytes (tree type)
1196 enum tree_code code = TREE_CODE (type);
1198 if (code == FUNCTION_TYPE || code == VOID_TYPE || code == ERROR_MARK)
1199 return size_one_node;
1201 if (!COMPLETE_OR_VOID_TYPE_P (type))
1203 error ("arithmetic on pointer to an incomplete type");
1204 return size_one_node;
1207 /* Convert in case a char is more than one unit. */
1208 return size_binop (CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type),
1209 size_int (TYPE_PRECISION (char_type_node)
1213 /* Return either DECL or its known constant value (if it has one). */
1216 decl_constant_value (tree decl)
1218 if (/* Don't change a variable array bound or initial value to a constant
1219 in a place where a variable is invalid. Note that DECL_INITIAL
1220 isn't valid for a PARM_DECL. */
1221 current_function_decl != 0
1222 && TREE_CODE (decl) != PARM_DECL
1223 && !TREE_THIS_VOLATILE (decl)
1224 && TREE_READONLY (decl)
1225 && DECL_INITIAL (decl) != 0
1226 && TREE_CODE (DECL_INITIAL (decl)) != ERROR_MARK
1227 /* This is invalid if initial value is not constant.
1228 If it has either a function call, a memory reference,
1229 or a variable, then re-evaluating it could give different results. */
1230 && TREE_CONSTANT (DECL_INITIAL (decl))
1231 /* Check for cases where this is sub-optimal, even though valid. */
1232 && TREE_CODE (DECL_INITIAL (decl)) != CONSTRUCTOR)
1233 return DECL_INITIAL (decl);
1237 /* Return either DECL or its known constant value (if it has one), but
1238 return DECL if pedantic or DECL has mode BLKmode. This is for
1239 bug-compatibility with the old behavior of decl_constant_value
1240 (before GCC 3.0); every use of this function is a bug and it should
1241 be removed before GCC 3.1. It is not appropriate to use pedantic
1242 in a way that affects optimization, and BLKmode is probably not the
1243 right test for avoiding misoptimizations either. */
1246 decl_constant_value_for_broken_optimization (tree decl)
1250 if (pedantic || DECL_MODE (decl) == BLKmode)
1253 ret = decl_constant_value (decl);
1254 /* Avoid unwanted tree sharing between the initializer and current
1255 function's body where the tree can be modified e.g. by the
1257 if (ret != decl && TREE_STATIC (decl))
1258 ret = unshare_expr (ret);
1262 /* Convert the array expression EXP to a pointer. */
1264 array_to_pointer_conversion (tree exp)
1266 tree orig_exp = exp;
1267 tree type = TREE_TYPE (exp);
1269 tree restype = TREE_TYPE (type);
1272 gcc_assert (TREE_CODE (type) == ARRAY_TYPE);
1274 STRIP_TYPE_NOPS (exp);
1276 if (TREE_NO_WARNING (orig_exp))
1277 TREE_NO_WARNING (exp) = 1;
1279 ptrtype = build_pointer_type (restype);
1281 if (TREE_CODE (exp) == INDIRECT_REF)
1282 return convert (ptrtype, TREE_OPERAND (exp, 0));
1284 if (TREE_CODE (exp) == VAR_DECL)
1286 /* We are making an ADDR_EXPR of ptrtype. This is a valid
1287 ADDR_EXPR because it's the best way of representing what
1288 happens in C when we take the address of an array and place
1289 it in a pointer to the element type. */
1290 adr = build1 (ADDR_EXPR, ptrtype, exp);
1291 if (!c_mark_addressable (exp))
1292 return error_mark_node;
1293 TREE_SIDE_EFFECTS (adr) = 0; /* Default would be, same as EXP. */
1297 /* This way is better for a COMPONENT_REF since it can
1298 simplify the offset for a component. */
1299 adr = build_unary_op (ADDR_EXPR, exp, 1);
1300 return convert (ptrtype, adr);
1303 /* Convert the function expression EXP to a pointer. */
1305 function_to_pointer_conversion (tree exp)
1307 tree orig_exp = exp;
1309 gcc_assert (TREE_CODE (TREE_TYPE (exp)) == FUNCTION_TYPE);
1311 STRIP_TYPE_NOPS (exp);
1313 if (TREE_NO_WARNING (orig_exp))
1314 TREE_NO_WARNING (exp) = 1;
1316 return build_unary_op (ADDR_EXPR, exp, 0);
1319 /* Perform the default conversion of arrays and functions to pointers.
1320 Return the result of converting EXP. For any other expression, just
1321 return EXP after removing NOPs. */
1324 default_function_array_conversion (struct c_expr exp)
1326 tree orig_exp = exp.value;
1327 tree type = TREE_TYPE (exp.value);
1328 enum tree_code code = TREE_CODE (type);
1334 bool not_lvalue = false;
1335 bool lvalue_array_p;
1337 while ((TREE_CODE (exp.value) == NON_LVALUE_EXPR
1338 || TREE_CODE (exp.value) == NOP_EXPR)
1339 && TREE_TYPE (TREE_OPERAND (exp.value, 0)) == type)
1341 if (TREE_CODE (exp.value) == NON_LVALUE_EXPR)
1343 exp.value = TREE_OPERAND (exp.value, 0);
1346 if (TREE_NO_WARNING (orig_exp))
1347 TREE_NO_WARNING (exp.value) = 1;
1349 lvalue_array_p = !not_lvalue && lvalue_p (exp.value);
1350 if (!flag_isoc99 && !lvalue_array_p)
1352 /* Before C99, non-lvalue arrays do not decay to pointers.
1353 Normally, using such an array would be invalid; but it can
1354 be used correctly inside sizeof or as a statement expression.
1355 Thus, do not give an error here; an error will result later. */
1359 exp.value = array_to_pointer_conversion (exp.value);
1363 exp.value = function_to_pointer_conversion (exp.value);
1366 STRIP_TYPE_NOPS (exp.value);
1367 if (TREE_NO_WARNING (orig_exp))
1368 TREE_NO_WARNING (exp.value) = 1;
1376 /* EXP is an expression of integer type. Apply the integer promotions
1377 to it and return the promoted value. */
1380 perform_integral_promotions (tree exp)
1382 tree type = TREE_TYPE (exp);
1383 enum tree_code code = TREE_CODE (type);
1385 gcc_assert (INTEGRAL_TYPE_P (type));
1387 /* Normally convert enums to int,
1388 but convert wide enums to something wider. */
1389 if (code == ENUMERAL_TYPE)
1391 type = c_common_type_for_size (MAX (TYPE_PRECISION (type),
1392 TYPE_PRECISION (integer_type_node)),
1393 ((TYPE_PRECISION (type)
1394 >= TYPE_PRECISION (integer_type_node))
1395 && TYPE_UNSIGNED (type)));
1397 return convert (type, exp);
1400 /* ??? This should no longer be needed now bit-fields have their
1402 if (TREE_CODE (exp) == COMPONENT_REF
1403 && DECL_C_BIT_FIELD (TREE_OPERAND (exp, 1))
1404 /* If it's thinner than an int, promote it like a
1405 c_promoting_integer_type_p, otherwise leave it alone. */
1406 && 0 > compare_tree_int (DECL_SIZE (TREE_OPERAND (exp, 1)),
1407 TYPE_PRECISION (integer_type_node)))
1408 return convert (integer_type_node, exp);
1410 if (c_promoting_integer_type_p (type))
1412 /* Preserve unsignedness if not really getting any wider. */
1413 if (TYPE_UNSIGNED (type)
1414 && TYPE_PRECISION (type) == TYPE_PRECISION (integer_type_node))
1415 return convert (unsigned_type_node, exp);
1417 return convert (integer_type_node, exp);
1424 /* Perform default promotions for C data used in expressions.
1425 Enumeral types or short or char are converted to int.
1426 In addition, manifest constants symbols are replaced by their values. */
1429 default_conversion (tree exp)
1432 tree type = TREE_TYPE (exp);
1433 enum tree_code code = TREE_CODE (type);
1435 /* Functions and arrays have been converted during parsing. */
1436 gcc_assert (code != FUNCTION_TYPE);
1437 if (code == ARRAY_TYPE)
1440 /* Constants can be used directly unless they're not loadable. */
1441 if (TREE_CODE (exp) == CONST_DECL)
1442 exp = DECL_INITIAL (exp);
1444 /* Replace a nonvolatile const static variable with its value unless
1445 it is an array, in which case we must be sure that taking the
1446 address of the array produces consistent results. */
1447 else if (optimize && TREE_CODE (exp) == VAR_DECL && code != ARRAY_TYPE)
1449 exp = decl_constant_value_for_broken_optimization (exp);
1450 type = TREE_TYPE (exp);
1453 /* Strip no-op conversions. */
1455 STRIP_TYPE_NOPS (exp);
1457 if (TREE_NO_WARNING (orig_exp))
1458 TREE_NO_WARNING (exp) = 1;
1460 if (INTEGRAL_TYPE_P (type))
1461 return perform_integral_promotions (exp);
1463 if (code == VOID_TYPE)
1465 error ("void value not ignored as it ought to be");
1466 return error_mark_node;
1471 /* Look up COMPONENT in a structure or union DECL.
1473 If the component name is not found, returns NULL_TREE. Otherwise,
1474 the return value is a TREE_LIST, with each TREE_VALUE a FIELD_DECL
1475 stepping down the chain to the component, which is in the last
1476 TREE_VALUE of the list. Normally the list is of length one, but if
1477 the component is embedded within (nested) anonymous structures or
1478 unions, the list steps down the chain to the component. */
1481 lookup_field (tree decl, tree component)
1483 tree type = TREE_TYPE (decl);
1486 /* If TYPE_LANG_SPECIFIC is set, then it is a sorted array of pointers
1487 to the field elements. Use a binary search on this array to quickly
1488 find the element. Otherwise, do a linear search. TYPE_LANG_SPECIFIC
1489 will always be set for structures which have many elements. */
1491 if (TYPE_LANG_SPECIFIC (type) && TYPE_LANG_SPECIFIC (type)->s)
1494 tree *field_array = &TYPE_LANG_SPECIFIC (type)->s->elts[0];
1496 field = TYPE_FIELDS (type);
1498 top = TYPE_LANG_SPECIFIC (type)->s->len;
1499 while (top - bot > 1)
1501 half = (top - bot + 1) >> 1;
1502 field = field_array[bot+half];
1504 if (DECL_NAME (field) == NULL_TREE)
1506 /* Step through all anon unions in linear fashion. */
1507 while (DECL_NAME (field_array[bot]) == NULL_TREE)
1509 field = field_array[bot++];
1510 if (TREE_CODE (TREE_TYPE (field)) == RECORD_TYPE
1511 || TREE_CODE (TREE_TYPE (field)) == UNION_TYPE)
1513 tree anon = lookup_field (field, component);
1516 return tree_cons (NULL_TREE, field, anon);
1520 /* Entire record is only anon unions. */
1524 /* Restart the binary search, with new lower bound. */
1528 if (DECL_NAME (field) == component)
1530 if (DECL_NAME (field) < component)
1536 if (DECL_NAME (field_array[bot]) == component)
1537 field = field_array[bot];
1538 else if (DECL_NAME (field) != component)
1543 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
1545 if (DECL_NAME (field) == NULL_TREE
1546 && (TREE_CODE (TREE_TYPE (field)) == RECORD_TYPE
1547 || TREE_CODE (TREE_TYPE (field)) == UNION_TYPE))
1549 tree anon = lookup_field (field, component);
1552 return tree_cons (NULL_TREE, field, anon);
1555 if (DECL_NAME (field) == component)
1559 if (field == NULL_TREE)
1563 return tree_cons (NULL_TREE, field, NULL_TREE);
1566 /* Make an expression to refer to the COMPONENT field of
1567 structure or union value DATUM. COMPONENT is an IDENTIFIER_NODE. */
1570 build_component_ref (tree datum, tree component)
1572 tree type = TREE_TYPE (datum);
1573 enum tree_code code = TREE_CODE (type);
1577 if (!objc_is_public (datum, component))
1578 return error_mark_node;
1580 /* See if there is a field or component with name COMPONENT. */
1582 if (code == RECORD_TYPE || code == UNION_TYPE)
1584 if (!COMPLETE_TYPE_P (type))
1586 c_incomplete_type_error (NULL_TREE, type);
1587 return error_mark_node;
1590 field = lookup_field (datum, component);
1594 error ("%qT has no member named %qE", type, component);
1595 return error_mark_node;
1598 /* Chain the COMPONENT_REFs if necessary down to the FIELD.
1599 This might be better solved in future the way the C++ front
1600 end does it - by giving the anonymous entities each a
1601 separate name and type, and then have build_component_ref
1602 recursively call itself. We can't do that here. */
1605 tree subdatum = TREE_VALUE (field);
1607 if (TREE_TYPE (subdatum) == error_mark_node)
1608 return error_mark_node;
1610 ref = build3 (COMPONENT_REF, TREE_TYPE (subdatum), datum, subdatum,
1612 if (TREE_READONLY (datum) || TREE_READONLY (subdatum))
1613 TREE_READONLY (ref) = 1;
1614 if (TREE_THIS_VOLATILE (datum) || TREE_THIS_VOLATILE (subdatum))
1615 TREE_THIS_VOLATILE (ref) = 1;
1617 if (TREE_DEPRECATED (subdatum))
1618 warn_deprecated_use (subdatum);
1622 field = TREE_CHAIN (field);
1628 else if (code != ERROR_MARK)
1629 error ("request for member %qE in something not a structure or union",
1632 return error_mark_node;
1635 /* Given an expression PTR for a pointer, return an expression
1636 for the value pointed to.
1637 ERRORSTRING is the name of the operator to appear in error messages. */
1640 build_indirect_ref (tree ptr, const char *errorstring)
1642 tree pointer = default_conversion (ptr);
1643 tree type = TREE_TYPE (pointer);
1645 if (TREE_CODE (type) == POINTER_TYPE)
1647 if (TREE_CODE (pointer) == ADDR_EXPR
1648 && (TREE_TYPE (TREE_OPERAND (pointer, 0))
1649 == TREE_TYPE (type)))
1650 return TREE_OPERAND (pointer, 0);
1653 tree t = TREE_TYPE (type);
1656 ref = build1 (INDIRECT_REF, t, pointer);
1658 if (!COMPLETE_OR_VOID_TYPE_P (t) && TREE_CODE (t) != ARRAY_TYPE)
1660 error ("dereferencing pointer to incomplete type");
1661 return error_mark_node;
1663 if (VOID_TYPE_P (t) && skip_evaluation == 0)
1664 warning (0, "dereferencing %<void *%> pointer");
1666 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
1667 so that we get the proper error message if the result is used
1668 to assign to. Also, &* is supposed to be a no-op.
1669 And ANSI C seems to specify that the type of the result
1670 should be the const type. */
1671 /* A de-reference of a pointer to const is not a const. It is valid
1672 to change it via some other pointer. */
1673 TREE_READONLY (ref) = TYPE_READONLY (t);
1674 TREE_SIDE_EFFECTS (ref)
1675 = TYPE_VOLATILE (t) || TREE_SIDE_EFFECTS (pointer);
1676 TREE_THIS_VOLATILE (ref) = TYPE_VOLATILE (t);
1680 else if (TREE_CODE (pointer) != ERROR_MARK)
1681 error ("invalid type argument of %qs", errorstring);
1682 return error_mark_node;
1685 /* This handles expressions of the form "a[i]", which denotes
1688 This is logically equivalent in C to *(a+i), but we may do it differently.
1689 If A is a variable or a member, we generate a primitive ARRAY_REF.
1690 This avoids forcing the array out of registers, and can work on
1691 arrays that are not lvalues (for example, members of structures returned
1695 build_array_ref (tree array, tree index)
1697 bool swapped = false;
1698 if (TREE_TYPE (array) == error_mark_node
1699 || TREE_TYPE (index) == error_mark_node)
1700 return error_mark_node;
1702 if (TREE_CODE (TREE_TYPE (array)) != ARRAY_TYPE
1703 && TREE_CODE (TREE_TYPE (array)) != POINTER_TYPE)
1706 if (TREE_CODE (TREE_TYPE (index)) != ARRAY_TYPE
1707 && TREE_CODE (TREE_TYPE (index)) != POINTER_TYPE)
1709 error ("subscripted value is neither array nor pointer");
1710 return error_mark_node;
1718 if (!INTEGRAL_TYPE_P (TREE_TYPE (index)))
1720 error ("array subscript is not an integer");
1721 return error_mark_node;
1724 if (TREE_CODE (TREE_TYPE (TREE_TYPE (array))) == FUNCTION_TYPE)
1726 error ("subscripted value is pointer to function");
1727 return error_mark_node;
1730 /* Subscripting with type char is likely to lose on a machine where
1731 chars are signed. So warn on any machine, but optionally. Don't
1732 warn for unsigned char since that type is safe. Don't warn for
1733 signed char because anyone who uses that must have done so
1734 deliberately. ??? Existing practice has also been to warn only
1735 when the char index is syntactically the index, not for
1738 && TYPE_MAIN_VARIANT (TREE_TYPE (index)) == char_type_node)
1739 warning (OPT_Wchar_subscripts, "array subscript has type %<char%>");
1741 /* Apply default promotions *after* noticing character types. */
1742 index = default_conversion (index);
1744 gcc_assert (TREE_CODE (TREE_TYPE (index)) == INTEGER_TYPE);
1746 if (TREE_CODE (TREE_TYPE (array)) == ARRAY_TYPE)
1750 /* An array that is indexed by a non-constant
1751 cannot be stored in a register; we must be able to do
1752 address arithmetic on its address.
1753 Likewise an array of elements of variable size. */
1754 if (TREE_CODE (index) != INTEGER_CST
1755 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array)))
1756 && TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array)))) != INTEGER_CST))
1758 if (!c_mark_addressable (array))
1759 return error_mark_node;
1761 /* An array that is indexed by a constant value which is not within
1762 the array bounds cannot be stored in a register either; because we
1763 would get a crash in store_bit_field/extract_bit_field when trying
1764 to access a non-existent part of the register. */
1765 if (TREE_CODE (index) == INTEGER_CST
1766 && TYPE_DOMAIN (TREE_TYPE (array))
1767 && !int_fits_type_p (index, TYPE_DOMAIN (TREE_TYPE (array))))
1769 if (!c_mark_addressable (array))
1770 return error_mark_node;
1776 while (TREE_CODE (foo) == COMPONENT_REF)
1777 foo = TREE_OPERAND (foo, 0);
1778 if (TREE_CODE (foo) == VAR_DECL && C_DECL_REGISTER (foo))
1779 pedwarn ("ISO C forbids subscripting %<register%> array");
1780 else if (!flag_isoc99 && !lvalue_p (foo))
1781 pedwarn ("ISO C90 forbids subscripting non-lvalue array");
1784 type = TREE_TYPE (TREE_TYPE (array));
1785 if (TREE_CODE (type) != ARRAY_TYPE)
1786 type = TYPE_MAIN_VARIANT (type);
1787 rval = build4 (ARRAY_REF, type, array, index, NULL_TREE, NULL_TREE);
1788 /* Array ref is const/volatile if the array elements are
1789 or if the array is. */
1790 TREE_READONLY (rval)
1791 |= (TYPE_READONLY (TREE_TYPE (TREE_TYPE (array)))
1792 | TREE_READONLY (array));
1793 TREE_SIDE_EFFECTS (rval)
1794 |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array)))
1795 | TREE_SIDE_EFFECTS (array));
1796 TREE_THIS_VOLATILE (rval)
1797 |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array)))
1798 /* This was added by rms on 16 Nov 91.
1799 It fixes vol struct foo *a; a->elts[1]
1800 in an inline function.
1801 Hope it doesn't break something else. */
1802 | TREE_THIS_VOLATILE (array));
1803 return require_complete_type (fold (rval));
1807 tree ar = default_conversion (array);
1809 if (ar == error_mark_node)
1812 gcc_assert (TREE_CODE (TREE_TYPE (ar)) == POINTER_TYPE);
1813 gcc_assert (TREE_CODE (TREE_TYPE (TREE_TYPE (ar))) != FUNCTION_TYPE);
1815 return build_indirect_ref (build_binary_op (PLUS_EXPR, ar, index, 0),
1820 /* Build an external reference to identifier ID. FUN indicates
1821 whether this will be used for a function call. LOC is the source
1822 location of the identifier. */
1824 build_external_ref (tree id, int fun, location_t loc)
1827 tree decl = lookup_name (id);
1829 /* In Objective-C, an instance variable (ivar) may be preferred to
1830 whatever lookup_name() found. */
1831 decl = objc_lookup_ivar (decl, id);
1833 if (decl && decl != error_mark_node)
1836 /* Implicit function declaration. */
1837 ref = implicitly_declare (id);
1838 else if (decl == error_mark_node)
1839 /* Don't complain about something that's already been
1840 complained about. */
1841 return error_mark_node;
1844 undeclared_variable (id, loc);
1845 return error_mark_node;
1848 if (TREE_TYPE (ref) == error_mark_node)
1849 return error_mark_node;
1851 if (TREE_DEPRECATED (ref))
1852 warn_deprecated_use (ref);
1854 if (!skip_evaluation)
1855 assemble_external (ref);
1856 TREE_USED (ref) = 1;
1858 if (TREE_CODE (ref) == FUNCTION_DECL && !in_alignof)
1860 if (!in_sizeof && !in_typeof)
1861 C_DECL_USED (ref) = 1;
1862 else if (DECL_INITIAL (ref) == 0
1863 && DECL_EXTERNAL (ref)
1864 && !TREE_PUBLIC (ref))
1865 record_maybe_used_decl (ref);
1868 if (TREE_CODE (ref) == CONST_DECL)
1870 ref = DECL_INITIAL (ref);
1871 TREE_CONSTANT (ref) = 1;
1872 TREE_INVARIANT (ref) = 1;
1874 else if (current_function_decl != 0
1875 && !DECL_FILE_SCOPE_P (current_function_decl)
1876 && (TREE_CODE (ref) == VAR_DECL
1877 || TREE_CODE (ref) == PARM_DECL
1878 || TREE_CODE (ref) == FUNCTION_DECL))
1880 tree context = decl_function_context (ref);
1882 if (context != 0 && context != current_function_decl)
1883 DECL_NONLOCAL (ref) = 1;
1889 /* Record details of decls possibly used inside sizeof or typeof. */
1890 struct maybe_used_decl
1894 /* The level seen at (in_sizeof + in_typeof). */
1896 /* The next one at this level or above, or NULL. */
1897 struct maybe_used_decl *next;
1900 static struct maybe_used_decl *maybe_used_decls;
1902 /* Record that DECL, an undefined static function reference seen
1903 inside sizeof or typeof, might be used if the operand of sizeof is
1904 a VLA type or the operand of typeof is a variably modified
1908 record_maybe_used_decl (tree decl)
1910 struct maybe_used_decl *t = XOBNEW (&parser_obstack, struct maybe_used_decl);
1912 t->level = in_sizeof + in_typeof;
1913 t->next = maybe_used_decls;
1914 maybe_used_decls = t;
1917 /* Pop the stack of decls possibly used inside sizeof or typeof. If
1918 USED is false, just discard them. If it is true, mark them used
1919 (if no longer inside sizeof or typeof) or move them to the next
1920 level up (if still inside sizeof or typeof). */
1923 pop_maybe_used (bool used)
1925 struct maybe_used_decl *p = maybe_used_decls;
1926 int cur_level = in_sizeof + in_typeof;
1927 while (p && p->level > cur_level)
1932 C_DECL_USED (p->decl) = 1;
1934 p->level = cur_level;
1938 if (!used || cur_level == 0)
1939 maybe_used_decls = p;
1942 /* Return the result of sizeof applied to EXPR. */
1945 c_expr_sizeof_expr (struct c_expr expr)
1948 if (expr.value == error_mark_node)
1950 ret.value = error_mark_node;
1951 ret.original_code = ERROR_MARK;
1952 pop_maybe_used (false);
1956 ret.value = c_sizeof (TREE_TYPE (expr.value));
1957 ret.original_code = ERROR_MARK;
1958 pop_maybe_used (C_TYPE_VARIABLE_SIZE (TREE_TYPE (expr.value)));
1963 /* Return the result of sizeof applied to T, a structure for the type
1964 name passed to sizeof (rather than the type itself). */
1967 c_expr_sizeof_type (struct c_type_name *t)
1971 type = groktypename (t);
1972 ret.value = c_sizeof (type);
1973 ret.original_code = ERROR_MARK;
1974 pop_maybe_used (C_TYPE_VARIABLE_SIZE (type));
1978 /* Build a function call to function FUNCTION with parameters PARAMS.
1979 PARAMS is a list--a chain of TREE_LIST nodes--in which the
1980 TREE_VALUE of each node is a parameter-expression.
1981 FUNCTION's data type may be a function type or a pointer-to-function. */
1984 build_function_call (tree function, tree params)
1986 tree fntype, fundecl = 0;
1987 tree coerced_params;
1988 tree name = NULL_TREE, result;
1991 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
1992 STRIP_TYPE_NOPS (function);
1994 /* Convert anything with function type to a pointer-to-function. */
1995 if (TREE_CODE (function) == FUNCTION_DECL)
1997 /* Implement type-directed function overloading for builtins.
1998 resolve_overloaded_builtin and targetm.resolve_overloaded_builtin
1999 handle all the type checking. The result is a complete expression
2000 that implements this function call. */
2001 tem = resolve_overloaded_builtin (function, params);
2005 name = DECL_NAME (function);
2008 if (TREE_CODE (TREE_TYPE (function)) == FUNCTION_TYPE)
2009 function = function_to_pointer_conversion (function);
2011 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
2012 expressions, like those used for ObjC messenger dispatches. */
2013 function = objc_rewrite_function_call (function, params);
2015 fntype = TREE_TYPE (function);
2017 if (TREE_CODE (fntype) == ERROR_MARK)
2018 return error_mark_node;
2020 if (!(TREE_CODE (fntype) == POINTER_TYPE
2021 && TREE_CODE (TREE_TYPE (fntype)) == FUNCTION_TYPE))
2023 error ("called object %qE is not a function", function);
2024 return error_mark_node;
2027 if (fundecl && TREE_THIS_VOLATILE (fundecl))
2028 current_function_returns_abnormally = 1;
2030 /* fntype now gets the type of function pointed to. */
2031 fntype = TREE_TYPE (fntype);
2033 /* Check that the function is called through a compatible prototype.
2034 If it is not, replace the call by a trap, wrapped up in a compound
2035 expression if necessary. This has the nice side-effect to prevent
2036 the tree-inliner from generating invalid assignment trees which may
2037 blow up in the RTL expander later. */
2038 if (TREE_CODE (function) == NOP_EXPR
2039 && TREE_CODE (tem = TREE_OPERAND (function, 0)) == ADDR_EXPR
2040 && TREE_CODE (tem = TREE_OPERAND (tem, 0)) == FUNCTION_DECL
2041 && !comptypes (fntype, TREE_TYPE (tem)))
2043 tree return_type = TREE_TYPE (fntype);
2044 tree trap = build_function_call (built_in_decls[BUILT_IN_TRAP],
2047 /* This situation leads to run-time undefined behavior. We can't,
2048 therefore, simply error unless we can prove that all possible
2049 executions of the program must execute the code. */
2050 warning (0, "function called through a non-compatible type");
2052 /* We can, however, treat "undefined" any way we please.
2053 Call abort to encourage the user to fix the program. */
2054 inform ("if this code is reached, the program will abort");
2056 if (VOID_TYPE_P (return_type))
2062 if (AGGREGATE_TYPE_P (return_type))
2063 rhs = build_compound_literal (return_type,
2064 build_constructor (return_type, 0));
2066 rhs = fold_build1 (NOP_EXPR, return_type, integer_zero_node);
2068 return build2 (COMPOUND_EXPR, return_type, trap, rhs);
2072 /* Convert the parameters to the types declared in the
2073 function prototype, or apply default promotions. */
2076 = convert_arguments (TYPE_ARG_TYPES (fntype), params, function, fundecl);
2078 if (coerced_params == error_mark_node)
2079 return error_mark_node;
2081 /* Check that the arguments to the function are valid. */
2083 check_function_arguments (TYPE_ATTRIBUTES (fntype), coerced_params,
2084 TYPE_ARG_TYPES (fntype));
2086 result = build3 (CALL_EXPR, TREE_TYPE (fntype),
2087 function, coerced_params, NULL_TREE);
2088 TREE_SIDE_EFFECTS (result) = 1;
2090 if (require_constant_value)
2092 result = fold_initializer (result);
2094 if (TREE_CONSTANT (result)
2095 && (name == NULL_TREE
2096 || strncmp (IDENTIFIER_POINTER (name), "__builtin_", 10) != 0))
2097 pedwarn_init ("initializer element is not constant");
2100 result = fold (result);
2102 if (VOID_TYPE_P (TREE_TYPE (result)))
2104 return require_complete_type (result);
2107 /* Convert the argument expressions in the list VALUES
2108 to the types in the list TYPELIST. The result is a list of converted
2109 argument expressions, unless there are too few arguments in which
2110 case it is error_mark_node.
2112 If TYPELIST is exhausted, or when an element has NULL as its type,
2113 perform the default conversions.
2115 PARMLIST is the chain of parm decls for the function being called.
2116 It may be 0, if that info is not available.
2117 It is used only for generating error messages.
2119 FUNCTION is a tree for the called function. It is used only for
2120 error messages, where it is formatted with %qE.
2122 This is also where warnings about wrong number of args are generated.
2124 Both VALUES and the returned value are chains of TREE_LIST nodes
2125 with the elements of the list in the TREE_VALUE slots of those nodes. */
2128 convert_arguments (tree typelist, tree values, tree function, tree fundecl)
2130 tree typetail, valtail;
2135 /* Change pointer to function to the function itself for
2137 if (TREE_CODE (function) == ADDR_EXPR
2138 && TREE_CODE (TREE_OPERAND (function, 0)) == FUNCTION_DECL)
2139 function = TREE_OPERAND (function, 0);
2141 /* Handle an ObjC selector specially for diagnostics. */
2142 selector = objc_message_selector ();
2144 /* Scan the given expressions and types, producing individual
2145 converted arguments and pushing them on RESULT in reverse order. */
2147 for (valtail = values, typetail = typelist, parmnum = 0;
2149 valtail = TREE_CHAIN (valtail), parmnum++)
2151 tree type = typetail ? TREE_VALUE (typetail) : 0;
2152 tree val = TREE_VALUE (valtail);
2153 tree rname = function;
2154 int argnum = parmnum + 1;
2155 const char *invalid_func_diag;
2157 if (type == void_type_node)
2159 error ("too many arguments to function %qE", function);
2163 if (selector && argnum > 2)
2169 STRIP_TYPE_NOPS (val);
2171 val = require_complete_type (val);
2175 /* Formal parm type is specified by a function prototype. */
2178 if (type == error_mark_node || !COMPLETE_TYPE_P (type))
2180 error ("type of formal parameter %d is incomplete", parmnum + 1);
2185 /* Optionally warn about conversions that
2186 differ from the default conversions. */
2187 if (warn_conversion || warn_traditional)
2189 unsigned int formal_prec = TYPE_PRECISION (type);
2191 if (INTEGRAL_TYPE_P (type)
2192 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
2193 warning (0, "passing argument %d of %qE as integer "
2194 "rather than floating due to prototype",
2196 if (INTEGRAL_TYPE_P (type)
2197 && TREE_CODE (TREE_TYPE (val)) == COMPLEX_TYPE)
2198 warning (0, "passing argument %d of %qE as integer "
2199 "rather than complex due to prototype",
2201 else if (TREE_CODE (type) == COMPLEX_TYPE
2202 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
2203 warning (0, "passing argument %d of %qE as complex "
2204 "rather than floating due to prototype",
2206 else if (TREE_CODE (type) == REAL_TYPE
2207 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
2208 warning (0, "passing argument %d of %qE as floating "
2209 "rather than integer due to prototype",
2211 else if (TREE_CODE (type) == COMPLEX_TYPE
2212 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
2213 warning (0, "passing argument %d of %qE as complex "
2214 "rather than integer due to prototype",
2216 else if (TREE_CODE (type) == REAL_TYPE
2217 && TREE_CODE (TREE_TYPE (val)) == COMPLEX_TYPE)
2218 warning (0, "passing argument %d of %qE as floating "
2219 "rather than complex due to prototype",
2221 /* ??? At some point, messages should be written about
2222 conversions between complex types, but that's too messy
2224 else if (TREE_CODE (type) == REAL_TYPE
2225 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
2227 /* Warn if any argument is passed as `float',
2228 since without a prototype it would be `double'. */
2229 if (formal_prec == TYPE_PRECISION (float_type_node))
2230 warning (0, "passing argument %d of %qE as %<float%> "
2231 "rather than %<double%> due to prototype",
2234 /* Detect integer changing in width or signedness.
2235 These warnings are only activated with
2236 -Wconversion, not with -Wtraditional. */
2237 else if (warn_conversion && INTEGRAL_TYPE_P (type)
2238 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
2240 tree would_have_been = default_conversion (val);
2241 tree type1 = TREE_TYPE (would_have_been);
2243 if (TREE_CODE (type) == ENUMERAL_TYPE
2244 && (TYPE_MAIN_VARIANT (type)
2245 == TYPE_MAIN_VARIANT (TREE_TYPE (val))))
2246 /* No warning if function asks for enum
2247 and the actual arg is that enum type. */
2249 else if (formal_prec != TYPE_PRECISION (type1))
2250 warning (OPT_Wconversion, "passing argument %d of %qE "
2251 "with different width due to prototype",
2253 else if (TYPE_UNSIGNED (type) == TYPE_UNSIGNED (type1))
2255 /* Don't complain if the formal parameter type
2256 is an enum, because we can't tell now whether
2257 the value was an enum--even the same enum. */
2258 else if (TREE_CODE (type) == ENUMERAL_TYPE)
2260 else if (TREE_CODE (val) == INTEGER_CST
2261 && int_fits_type_p (val, type))
2262 /* Change in signedness doesn't matter
2263 if a constant value is unaffected. */
2265 /* If the value is extended from a narrower
2266 unsigned type, it doesn't matter whether we
2267 pass it as signed or unsigned; the value
2268 certainly is the same either way. */
2269 else if (TYPE_PRECISION (TREE_TYPE (val)) < TYPE_PRECISION (type)
2270 && TYPE_UNSIGNED (TREE_TYPE (val)))
2272 else if (TYPE_UNSIGNED (type))
2273 warning (OPT_Wconversion, "passing argument %d of %qE "
2274 "as unsigned due to prototype",
2277 warning (OPT_Wconversion, "passing argument %d of %qE "
2278 "as signed due to prototype", argnum, rname);
2282 parmval = convert_for_assignment (type, val, ic_argpass,
2286 if (targetm.calls.promote_prototypes (fundecl ? TREE_TYPE (fundecl) : 0)
2287 && INTEGRAL_TYPE_P (type)
2288 && (TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node)))
2289 parmval = default_conversion (parmval);
2291 result = tree_cons (NULL_TREE, parmval, result);
2293 else if (TREE_CODE (TREE_TYPE (val)) == REAL_TYPE
2294 && (TYPE_PRECISION (TREE_TYPE (val))
2295 < TYPE_PRECISION (double_type_node)))
2296 /* Convert `float' to `double'. */
2297 result = tree_cons (NULL_TREE, convert (double_type_node, val), result);
2298 else if ((invalid_func_diag =
2299 targetm.calls.invalid_arg_for_unprototyped_fn (typelist, fundecl, val)))
2301 error (invalid_func_diag);
2302 return error_mark_node;
2305 /* Convert `short' and `char' to full-size `int'. */
2306 result = tree_cons (NULL_TREE, default_conversion (val), result);
2309 typetail = TREE_CHAIN (typetail);
2312 if (typetail != 0 && TREE_VALUE (typetail) != void_type_node)
2314 error ("too few arguments to function %qE", function);
2315 return error_mark_node;
2318 return nreverse (result);
2321 /* This is the entry point used by the parser to build unary operators
2322 in the input. CODE, a tree_code, specifies the unary operator, and
2323 ARG is the operand. For unary plus, the C parser currently uses
2324 CONVERT_EXPR for code. */
2327 parser_build_unary_op (enum tree_code code, struct c_expr arg)
2329 struct c_expr result;
2331 result.original_code = ERROR_MARK;
2332 result.value = build_unary_op (code, arg.value, 0);
2333 overflow_warning (result.value);
2337 /* This is the entry point used by the parser to build binary operators
2338 in the input. CODE, a tree_code, specifies the binary operator, and
2339 ARG1 and ARG2 are the operands. In addition to constructing the
2340 expression, we check for operands that were written with other binary
2341 operators in a way that is likely to confuse the user. */
2344 parser_build_binary_op (enum tree_code code, struct c_expr arg1,
2347 struct c_expr result;
2349 enum tree_code code1 = arg1.original_code;
2350 enum tree_code code2 = arg2.original_code;
2352 result.value = build_binary_op (code, arg1.value, arg2.value, 1);
2353 result.original_code = code;
2355 if (TREE_CODE (result.value) == ERROR_MARK)
2358 /* Check for cases such as x+y<<z which users are likely
2360 if (warn_parentheses)
2362 if (code == LSHIFT_EXPR || code == RSHIFT_EXPR)
2364 if (code1 == PLUS_EXPR || code1 == MINUS_EXPR
2365 || code2 == PLUS_EXPR || code2 == MINUS_EXPR)
2366 warning (0, "suggest parentheses around + or - inside shift");
2369 if (code == TRUTH_ORIF_EXPR)
2371 if (code1 == TRUTH_ANDIF_EXPR
2372 || code2 == TRUTH_ANDIF_EXPR)
2373 warning (0, "suggest parentheses around && within ||");
2376 if (code == BIT_IOR_EXPR)
2378 if (code1 == BIT_AND_EXPR || code1 == BIT_XOR_EXPR
2379 || code1 == PLUS_EXPR || code1 == MINUS_EXPR
2380 || code2 == BIT_AND_EXPR || code2 == BIT_XOR_EXPR
2381 || code2 == PLUS_EXPR || code2 == MINUS_EXPR)
2382 warning (0, "suggest parentheses around arithmetic in operand of |");
2383 /* Check cases like x|y==z */
2384 if (TREE_CODE_CLASS (code1) == tcc_comparison
2385 || TREE_CODE_CLASS (code2) == tcc_comparison)
2386 warning (0, "suggest parentheses around comparison in operand of |");
2389 if (code == BIT_XOR_EXPR)
2391 if (code1 == BIT_AND_EXPR
2392 || code1 == PLUS_EXPR || code1 == MINUS_EXPR
2393 || code2 == BIT_AND_EXPR
2394 || code2 == PLUS_EXPR || code2 == MINUS_EXPR)
2395 warning (0, "suggest parentheses around arithmetic in operand of ^");
2396 /* Check cases like x^y==z */
2397 if (TREE_CODE_CLASS (code1) == tcc_comparison
2398 || TREE_CODE_CLASS (code2) == tcc_comparison)
2399 warning (0, "suggest parentheses around comparison in operand of ^");
2402 if (code == BIT_AND_EXPR)
2404 if (code1 == PLUS_EXPR || code1 == MINUS_EXPR
2405 || code2 == PLUS_EXPR || code2 == MINUS_EXPR)
2406 warning (0, "suggest parentheses around + or - in operand of &");
2407 /* Check cases like x&y==z */
2408 if (TREE_CODE_CLASS (code1) == tcc_comparison
2409 || TREE_CODE_CLASS (code2) == tcc_comparison)
2410 warning (0, "suggest parentheses around comparison in operand of &");
2412 /* Similarly, check for cases like 1<=i<=10 that are probably errors. */
2413 if (TREE_CODE_CLASS (code) == tcc_comparison
2414 && (TREE_CODE_CLASS (code1) == tcc_comparison
2415 || TREE_CODE_CLASS (code2) == tcc_comparison))
2416 warning (0, "comparisons like X<=Y<=Z do not have their mathematical meaning");
2420 unsigned_conversion_warning (result.value, arg1.value);
2421 unsigned_conversion_warning (result.value, arg2.value);
2422 overflow_warning (result.value);
2427 /* Return a tree for the difference of pointers OP0 and OP1.
2428 The resulting tree has type int. */
2431 pointer_diff (tree op0, tree op1)
2433 tree restype = ptrdiff_type_node;
2435 tree target_type = TREE_TYPE (TREE_TYPE (op0));
2436 tree con0, con1, lit0, lit1;
2437 tree orig_op1 = op1;
2439 if (pedantic || warn_pointer_arith)
2441 if (TREE_CODE (target_type) == VOID_TYPE)
2442 pedwarn ("pointer of type %<void *%> used in subtraction");
2443 if (TREE_CODE (target_type) == FUNCTION_TYPE)
2444 pedwarn ("pointer to a function used in subtraction");
2447 /* If the conversion to ptrdiff_type does anything like widening or
2448 converting a partial to an integral mode, we get a convert_expression
2449 that is in the way to do any simplifications.
2450 (fold-const.c doesn't know that the extra bits won't be needed.
2451 split_tree uses STRIP_SIGN_NOPS, which leaves conversions to a
2452 different mode in place.)
2453 So first try to find a common term here 'by hand'; we want to cover
2454 at least the cases that occur in legal static initializers. */
2455 con0 = TREE_CODE (op0) == NOP_EXPR ? TREE_OPERAND (op0, 0) : op0;
2456 con1 = TREE_CODE (op1) == NOP_EXPR ? TREE_OPERAND (op1, 0) : op1;
2458 if (TREE_CODE (con0) == PLUS_EXPR)
2460 lit0 = TREE_OPERAND (con0, 1);
2461 con0 = TREE_OPERAND (con0, 0);
2464 lit0 = integer_zero_node;
2466 if (TREE_CODE (con1) == PLUS_EXPR)
2468 lit1 = TREE_OPERAND (con1, 1);
2469 con1 = TREE_OPERAND (con1, 0);
2472 lit1 = integer_zero_node;
2474 if (operand_equal_p (con0, con1, 0))
2481 /* First do the subtraction as integers;
2482 then drop through to build the divide operator.
2483 Do not do default conversions on the minus operator
2484 in case restype is a short type. */
2486 op0 = build_binary_op (MINUS_EXPR, convert (restype, op0),
2487 convert (restype, op1), 0);
2488 /* This generates an error if op1 is pointer to incomplete type. */
2489 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (TREE_TYPE (orig_op1))))
2490 error ("arithmetic on pointer to an incomplete type");
2492 /* This generates an error if op0 is pointer to incomplete type. */
2493 op1 = c_size_in_bytes (target_type);
2495 /* Divide by the size, in easiest possible way. */
2496 return fold_build2 (EXACT_DIV_EXPR, restype, op0, convert (restype, op1));
2499 /* Construct and perhaps optimize a tree representation
2500 for a unary operation. CODE, a tree_code, specifies the operation
2501 and XARG is the operand.
2502 For any CODE other than ADDR_EXPR, FLAG nonzero suppresses
2503 the default promotions (such as from short to int).
2504 For ADDR_EXPR, the default promotions are not applied; FLAG nonzero
2505 allows non-lvalues; this is only used to handle conversion of non-lvalue
2506 arrays to pointers in C99. */
2509 build_unary_op (enum tree_code code, tree xarg, int flag)
2511 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
2514 enum tree_code typecode = TREE_CODE (TREE_TYPE (arg));
2516 int noconvert = flag;
2517 const char *invalid_op_diag;
2519 if (typecode == ERROR_MARK)
2520 return error_mark_node;
2521 if (typecode == ENUMERAL_TYPE || typecode == BOOLEAN_TYPE)
2522 typecode = INTEGER_TYPE;
2524 if ((invalid_op_diag
2525 = targetm.invalid_unary_op (code, TREE_TYPE (xarg))))
2527 error (invalid_op_diag);
2528 return error_mark_node;
2534 /* This is used for unary plus, because a CONVERT_EXPR
2535 is enough to prevent anybody from looking inside for
2536 associativity, but won't generate any code. */
2537 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2538 || typecode == COMPLEX_TYPE
2539 || typecode == VECTOR_TYPE))
2541 error ("wrong type argument to unary plus");
2542 return error_mark_node;
2544 else if (!noconvert)
2545 arg = default_conversion (arg);
2546 arg = non_lvalue (arg);
2550 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2551 || typecode == COMPLEX_TYPE
2552 || typecode == VECTOR_TYPE))
2554 error ("wrong type argument to unary minus");
2555 return error_mark_node;
2557 else if (!noconvert)
2558 arg = default_conversion (arg);
2562 if (typecode == INTEGER_TYPE || typecode == VECTOR_TYPE)
2565 arg = default_conversion (arg);
2567 else if (typecode == COMPLEX_TYPE)
2571 pedwarn ("ISO C does not support %<~%> for complex conjugation");
2573 arg = default_conversion (arg);
2577 error ("wrong type argument to bit-complement");
2578 return error_mark_node;
2583 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE))
2585 error ("wrong type argument to abs");
2586 return error_mark_node;
2588 else if (!noconvert)
2589 arg = default_conversion (arg);
2593 /* Conjugating a real value is a no-op, but allow it anyway. */
2594 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2595 || typecode == COMPLEX_TYPE))
2597 error ("wrong type argument to conjugation");
2598 return error_mark_node;
2600 else if (!noconvert)
2601 arg = default_conversion (arg);
2604 case TRUTH_NOT_EXPR:
2605 if (typecode != INTEGER_TYPE
2606 && typecode != REAL_TYPE && typecode != POINTER_TYPE
2607 && typecode != COMPLEX_TYPE)
2609 error ("wrong type argument to unary exclamation mark");
2610 return error_mark_node;
2612 arg = c_objc_common_truthvalue_conversion (arg);
2613 return invert_truthvalue (arg);
2619 if (TREE_CODE (arg) == COMPLEX_CST)
2620 return TREE_REALPART (arg);
2621 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
2622 return fold_build1 (REALPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg);
2627 if (TREE_CODE (arg) == COMPLEX_CST)
2628 return TREE_IMAGPART (arg);
2629 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
2630 return fold_build1 (IMAGPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg);
2632 return convert (TREE_TYPE (arg), integer_zero_node);
2634 case PREINCREMENT_EXPR:
2635 case POSTINCREMENT_EXPR:
2636 case PREDECREMENT_EXPR:
2637 case POSTDECREMENT_EXPR:
2639 /* Increment or decrement the real part of the value,
2640 and don't change the imaginary part. */
2641 if (typecode == COMPLEX_TYPE)
2646 pedwarn ("ISO C does not support %<++%> and %<--%>"
2647 " on complex types");
2649 arg = stabilize_reference (arg);
2650 real = build_unary_op (REALPART_EXPR, arg, 1);
2651 imag = build_unary_op (IMAGPART_EXPR, arg, 1);
2652 return build2 (COMPLEX_EXPR, TREE_TYPE (arg),
2653 build_unary_op (code, real, 1), imag);
2656 /* Report invalid types. */
2658 if (typecode != POINTER_TYPE
2659 && typecode != INTEGER_TYPE && typecode != REAL_TYPE)
2661 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
2662 error ("wrong type argument to increment");
2664 error ("wrong type argument to decrement");
2666 return error_mark_node;
2671 tree result_type = TREE_TYPE (arg);
2673 arg = get_unwidened (arg, 0);
2674 argtype = TREE_TYPE (arg);
2676 /* Compute the increment. */
2678 if (typecode == POINTER_TYPE)
2680 /* If pointer target is an undefined struct,
2681 we just cannot know how to do the arithmetic. */
2682 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (result_type)))
2684 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
2685 error ("increment of pointer to unknown structure");
2687 error ("decrement of pointer to unknown structure");
2689 else if ((pedantic || warn_pointer_arith)
2690 && (TREE_CODE (TREE_TYPE (result_type)) == FUNCTION_TYPE
2691 || TREE_CODE (TREE_TYPE (result_type)) == VOID_TYPE))
2693 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
2694 pedwarn ("wrong type argument to increment");
2696 pedwarn ("wrong type argument to decrement");
2699 inc = c_size_in_bytes (TREE_TYPE (result_type));
2702 inc = integer_one_node;
2704 inc = convert (argtype, inc);
2706 /* Complain about anything else that is not a true lvalue. */
2707 if (!lvalue_or_else (arg, ((code == PREINCREMENT_EXPR
2708 || code == POSTINCREMENT_EXPR)
2711 return error_mark_node;
2713 /* Report a read-only lvalue. */
2714 if (TREE_READONLY (arg))
2715 readonly_error (arg,
2716 ((code == PREINCREMENT_EXPR
2717 || code == POSTINCREMENT_EXPR)
2718 ? lv_increment : lv_decrement));
2720 if (TREE_CODE (TREE_TYPE (arg)) == BOOLEAN_TYPE)
2721 val = boolean_increment (code, arg);
2723 val = build2 (code, TREE_TYPE (arg), arg, inc);
2724 TREE_SIDE_EFFECTS (val) = 1;
2725 val = convert (result_type, val);
2726 if (TREE_CODE (val) != code)
2727 TREE_NO_WARNING (val) = 1;
2732 /* Note that this operation never does default_conversion. */
2734 /* Let &* cancel out to simplify resulting code. */
2735 if (TREE_CODE (arg) == INDIRECT_REF)
2737 /* Don't let this be an lvalue. */
2738 if (lvalue_p (TREE_OPERAND (arg, 0)))
2739 return non_lvalue (TREE_OPERAND (arg, 0));
2740 return TREE_OPERAND (arg, 0);
2743 /* For &x[y], return x+y */
2744 if (TREE_CODE (arg) == ARRAY_REF)
2746 tree op0 = TREE_OPERAND (arg, 0);
2747 if (!c_mark_addressable (op0))
2748 return error_mark_node;
2749 return build_binary_op (PLUS_EXPR,
2750 (TREE_CODE (TREE_TYPE (op0)) == ARRAY_TYPE
2751 ? array_to_pointer_conversion (op0)
2753 TREE_OPERAND (arg, 1), 1);
2756 /* Anything not already handled and not a true memory reference
2757 or a non-lvalue array is an error. */
2758 else if (typecode != FUNCTION_TYPE && !flag
2759 && !lvalue_or_else (arg, lv_addressof))
2760 return error_mark_node;
2762 /* Ordinary case; arg is a COMPONENT_REF or a decl. */
2763 argtype = TREE_TYPE (arg);
2765 /* If the lvalue is const or volatile, merge that into the type
2766 to which the address will point. Note that you can't get a
2767 restricted pointer by taking the address of something, so we
2768 only have to deal with `const' and `volatile' here. */
2769 if ((DECL_P (arg) || REFERENCE_CLASS_P (arg))
2770 && (TREE_READONLY (arg) || TREE_THIS_VOLATILE (arg)))
2771 argtype = c_build_type_variant (argtype,
2772 TREE_READONLY (arg),
2773 TREE_THIS_VOLATILE (arg));
2775 if (!c_mark_addressable (arg))
2776 return error_mark_node;
2778 gcc_assert (TREE_CODE (arg) != COMPONENT_REF
2779 || !DECL_C_BIT_FIELD (TREE_OPERAND (arg, 1)));
2781 argtype = build_pointer_type (argtype);
2783 /* ??? Cope with user tricks that amount to offsetof. Delete this
2784 when we have proper support for integer constant expressions. */
2785 val = get_base_address (arg);
2786 if (val && TREE_CODE (val) == INDIRECT_REF
2787 && integer_zerop (TREE_OPERAND (val, 0)))
2788 return fold_convert (argtype, fold_offsetof (arg));
2790 val = build1 (ADDR_EXPR, argtype, arg);
2799 argtype = TREE_TYPE (arg);
2800 val = build1 (code, argtype, arg);
2801 return require_constant_value ? fold_initializer (val) : fold (val);
2804 /* Return nonzero if REF is an lvalue valid for this language.
2805 Lvalues can be assigned, unless their type has TYPE_READONLY.
2806 Lvalues can have their address taken, unless they have C_DECL_REGISTER. */
2811 enum tree_code code = TREE_CODE (ref);
2818 return lvalue_p (TREE_OPERAND (ref, 0));
2820 case COMPOUND_LITERAL_EXPR:
2830 return (TREE_CODE (TREE_TYPE (ref)) != FUNCTION_TYPE
2831 && TREE_CODE (TREE_TYPE (ref)) != METHOD_TYPE);
2834 return TREE_CODE (TREE_TYPE (ref)) == ARRAY_TYPE;
2841 /* Give an error for storing in something that is 'const'. */
2844 readonly_error (tree arg, enum lvalue_use use)
2846 gcc_assert (use == lv_assign || use == lv_increment || use == lv_decrement);
2847 /* Using this macro rather than (for example) arrays of messages
2848 ensures that all the format strings are checked at compile
2850 #define READONLY_MSG(A, I, D) (use == lv_assign \
2852 : (use == lv_increment ? (I) : (D)))
2853 if (TREE_CODE (arg) == COMPONENT_REF)
2855 if (TYPE_READONLY (TREE_TYPE (TREE_OPERAND (arg, 0))))
2856 readonly_error (TREE_OPERAND (arg, 0), use);
2858 error (READONLY_MSG (G_("assignment of read-only member %qD"),
2859 G_("increment of read-only member %qD"),
2860 G_("decrement of read-only member %qD")),
2861 TREE_OPERAND (arg, 1));
2863 else if (TREE_CODE (arg) == VAR_DECL)
2864 error (READONLY_MSG (G_("assignment of read-only variable %qD"),
2865 G_("increment of read-only variable %qD"),
2866 G_("decrement of read-only variable %qD")),
2869 error (READONLY_MSG (G_("assignment of read-only location"),
2870 G_("increment of read-only location"),
2871 G_("decrement of read-only location")));
2875 /* Return nonzero if REF is an lvalue valid for this language;
2876 otherwise, print an error message and return zero. USE says
2877 how the lvalue is being used and so selects the error message. */
2880 lvalue_or_else (tree ref, enum lvalue_use use)
2882 int win = lvalue_p (ref);
2890 /* Mark EXP saying that we need to be able to take the
2891 address of it; it should not be allocated in a register.
2892 Returns true if successful. */
2895 c_mark_addressable (tree exp)
2900 switch (TREE_CODE (x))
2903 if (DECL_C_BIT_FIELD (TREE_OPERAND (x, 1)))
2906 ("cannot take address of bit-field %qD", TREE_OPERAND (x, 1));
2910 /* ... fall through ... */
2916 x = TREE_OPERAND (x, 0);
2919 case COMPOUND_LITERAL_EXPR:
2921 TREE_ADDRESSABLE (x) = 1;
2928 if (C_DECL_REGISTER (x)
2929 && DECL_NONLOCAL (x))
2931 if (TREE_PUBLIC (x) || TREE_STATIC (x) || DECL_EXTERNAL (x))
2934 ("global register variable %qD used in nested function", x);
2937 pedwarn ("register variable %qD used in nested function", x);
2939 else if (C_DECL_REGISTER (x))
2941 if (TREE_PUBLIC (x) || TREE_STATIC (x) || DECL_EXTERNAL (x))
2942 error ("address of global register variable %qD requested", x);
2944 error ("address of register variable %qD requested", x);
2950 TREE_ADDRESSABLE (x) = 1;
2957 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
2960 build_conditional_expr (tree ifexp, tree op1, tree op2)
2964 enum tree_code code1;
2965 enum tree_code code2;
2966 tree result_type = NULL;
2967 tree orig_op1 = op1, orig_op2 = op2;
2969 /* Promote both alternatives. */
2971 if (TREE_CODE (TREE_TYPE (op1)) != VOID_TYPE)
2972 op1 = default_conversion (op1);
2973 if (TREE_CODE (TREE_TYPE (op2)) != VOID_TYPE)
2974 op2 = default_conversion (op2);
2976 if (TREE_CODE (ifexp) == ERROR_MARK
2977 || TREE_CODE (TREE_TYPE (op1)) == ERROR_MARK
2978 || TREE_CODE (TREE_TYPE (op2)) == ERROR_MARK)
2979 return error_mark_node;
2981 type1 = TREE_TYPE (op1);
2982 code1 = TREE_CODE (type1);
2983 type2 = TREE_TYPE (op2);
2984 code2 = TREE_CODE (type2);
2986 /* C90 does not permit non-lvalue arrays in conditional expressions.
2987 In C99 they will be pointers by now. */
2988 if (code1 == ARRAY_TYPE || code2 == ARRAY_TYPE)
2990 error ("non-lvalue array in conditional expression");
2991 return error_mark_node;
2994 /* Quickly detect the usual case where op1 and op2 have the same type
2996 if (TYPE_MAIN_VARIANT (type1) == TYPE_MAIN_VARIANT (type2))
2999 result_type = type1;
3001 result_type = TYPE_MAIN_VARIANT (type1);
3003 else if ((code1 == INTEGER_TYPE || code1 == REAL_TYPE
3004 || code1 == COMPLEX_TYPE)
3005 && (code2 == INTEGER_TYPE || code2 == REAL_TYPE
3006 || code2 == COMPLEX_TYPE))
3008 result_type = c_common_type (type1, type2);
3010 /* If -Wsign-compare, warn here if type1 and type2 have
3011 different signedness. We'll promote the signed to unsigned
3012 and later code won't know it used to be different.
3013 Do this check on the original types, so that explicit casts
3014 will be considered, but default promotions won't. */
3015 if (warn_sign_compare && !skip_evaluation)
3017 int unsigned_op1 = TYPE_UNSIGNED (TREE_TYPE (orig_op1));
3018 int unsigned_op2 = TYPE_UNSIGNED (TREE_TYPE (orig_op2));
3020 if (unsigned_op1 ^ unsigned_op2)
3022 /* Do not warn if the result type is signed, since the
3023 signed type will only be chosen if it can represent
3024 all the values of the unsigned type. */
3025 if (!TYPE_UNSIGNED (result_type))
3027 /* Do not warn if the signed quantity is an unsuffixed
3028 integer literal (or some static constant expression
3029 involving such literals) and it is non-negative. */
3030 else if ((unsigned_op2 && tree_expr_nonnegative_p (op1))
3031 || (unsigned_op1 && tree_expr_nonnegative_p (op2)))
3034 warning (0, "signed and unsigned type in conditional expression");
3038 else if (code1 == VOID_TYPE || code2 == VOID_TYPE)
3040 if (pedantic && (code1 != VOID_TYPE || code2 != VOID_TYPE))
3041 pedwarn ("ISO C forbids conditional expr with only one void side");
3042 result_type = void_type_node;
3044 else if (code1 == POINTER_TYPE && code2 == POINTER_TYPE)
3046 if (comp_target_types (type1, type2))
3047 result_type = common_pointer_type (type1, type2);
3048 else if (integer_zerop (op1) && TREE_TYPE (type1) == void_type_node
3049 && TREE_CODE (orig_op1) != NOP_EXPR)
3050 result_type = qualify_type (type2, type1);
3051 else if (integer_zerop (op2) && TREE_TYPE (type2) == void_type_node
3052 && TREE_CODE (orig_op2) != NOP_EXPR)
3053 result_type = qualify_type (type1, type2);
3054 else if (VOID_TYPE_P (TREE_TYPE (type1)))
3056 if (pedantic && TREE_CODE (TREE_TYPE (type2)) == FUNCTION_TYPE)
3057 pedwarn ("ISO C forbids conditional expr between "
3058 "%<void *%> and function pointer");
3059 result_type = build_pointer_type (qualify_type (TREE_TYPE (type1),
3060 TREE_TYPE (type2)));
3062 else if (VOID_TYPE_P (TREE_TYPE (type2)))
3064 if (pedantic && TREE_CODE (TREE_TYPE (type1)) == FUNCTION_TYPE)
3065 pedwarn ("ISO C forbids conditional expr between "
3066 "%<void *%> and function pointer");
3067 result_type = build_pointer_type (qualify_type (TREE_TYPE (type2),
3068 TREE_TYPE (type1)));
3072 pedwarn ("pointer type mismatch in conditional expression");
3073 result_type = build_pointer_type (void_type_node);
3076 else if (code1 == POINTER_TYPE && code2 == INTEGER_TYPE)
3078 if (!integer_zerop (op2))
3079 pedwarn ("pointer/integer type mismatch in conditional expression");
3082 op2 = null_pointer_node;
3084 result_type = type1;
3086 else if (code2 == POINTER_TYPE && code1 == INTEGER_TYPE)
3088 if (!integer_zerop (op1))
3089 pedwarn ("pointer/integer type mismatch in conditional expression");
3092 op1 = null_pointer_node;
3094 result_type = type2;
3099 if (flag_cond_mismatch)
3100 result_type = void_type_node;
3103 error ("type mismatch in conditional expression");
3104 return error_mark_node;
3108 /* Merge const and volatile flags of the incoming types. */
3110 = build_type_variant (result_type,
3111 TREE_READONLY (op1) || TREE_READONLY (op2),
3112 TREE_THIS_VOLATILE (op1) || TREE_THIS_VOLATILE (op2));
3114 if (result_type != TREE_TYPE (op1))
3115 op1 = convert_and_check (result_type, op1);
3116 if (result_type != TREE_TYPE (op2))
3117 op2 = convert_and_check (result_type, op2);
3119 return fold_build3 (COND_EXPR, result_type, ifexp, op1, op2);
3122 /* Return a compound expression that performs two expressions and
3123 returns the value of the second of them. */
3126 build_compound_expr (tree expr1, tree expr2)
3128 if (!TREE_SIDE_EFFECTS (expr1))
3130 /* The left-hand operand of a comma expression is like an expression
3131 statement: with -Wextra or -Wunused, we should warn if it doesn't have
3132 any side-effects, unless it was explicitly cast to (void). */
3133 if (warn_unused_value)
3135 if (VOID_TYPE_P (TREE_TYPE (expr1))
3136 && TREE_CODE (expr1) == CONVERT_EXPR)
3138 else if (VOID_TYPE_P (TREE_TYPE (expr1))
3139 && TREE_CODE (expr1) == COMPOUND_EXPR
3140 && TREE_CODE (TREE_OPERAND (expr1, 1)) == CONVERT_EXPR)
3141 ; /* (void) a, (void) b, c */
3143 warning (0, "left-hand operand of comma expression has no effect");
3147 /* With -Wunused, we should also warn if the left-hand operand does have
3148 side-effects, but computes a value which is not used. For example, in
3149 `foo() + bar(), baz()' the result of the `+' operator is not used,
3150 so we should issue a warning. */
3151 else if (warn_unused_value)
3152 warn_if_unused_value (expr1, input_location);
3154 return build2 (COMPOUND_EXPR, TREE_TYPE (expr2), expr1, expr2);
3157 /* Build an expression representing a cast to type TYPE of expression EXPR. */
3160 build_c_cast (tree type, tree expr)
3164 if (type == error_mark_node || expr == error_mark_node)
3165 return error_mark_node;
3167 /* The ObjC front-end uses TYPE_MAIN_VARIANT to tie together types differing
3168 only in <protocol> qualifications. But when constructing cast expressions,
3169 the protocols do matter and must be kept around. */
3170 if (objc_is_object_ptr (type) && objc_is_object_ptr (TREE_TYPE (expr)))
3171 return build1 (NOP_EXPR, type, expr);
3173 type = TYPE_MAIN_VARIANT (type);
3175 if (TREE_CODE (type) == ARRAY_TYPE)
3177 error ("cast specifies array type");
3178 return error_mark_node;
3181 if (TREE_CODE (type) == FUNCTION_TYPE)
3183 error ("cast specifies function type");
3184 return error_mark_node;
3187 if (type == TYPE_MAIN_VARIANT (TREE_TYPE (value)))
3191 if (TREE_CODE (type) == RECORD_TYPE
3192 || TREE_CODE (type) == UNION_TYPE)
3193 pedwarn ("ISO C forbids casting nonscalar to the same type");
3196 else if (TREE_CODE (type) == UNION_TYPE)
3200 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
3201 if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (field)),
3202 TYPE_MAIN_VARIANT (TREE_TYPE (value))))
3210 pedwarn ("ISO C forbids casts to union type");
3211 t = digest_init (type,
3212 build_constructor_single (type, field, value),
3214 TREE_CONSTANT (t) = TREE_CONSTANT (value);
3215 TREE_INVARIANT (t) = TREE_INVARIANT (value);
3218 error ("cast to union type from type not present in union");
3219 return error_mark_node;
3225 if (type == void_type_node)
3226 return build1 (CONVERT_EXPR, type, value);
3228 otype = TREE_TYPE (value);
3230 /* Optionally warn about potentially worrisome casts. */
3233 && TREE_CODE (type) == POINTER_TYPE
3234 && TREE_CODE (otype) == POINTER_TYPE)
3236 tree in_type = type;
3237 tree in_otype = otype;
3241 /* Check that the qualifiers on IN_TYPE are a superset of
3242 the qualifiers of IN_OTYPE. The outermost level of
3243 POINTER_TYPE nodes is uninteresting and we stop as soon
3244 as we hit a non-POINTER_TYPE node on either type. */
3247 in_otype = TREE_TYPE (in_otype);
3248 in_type = TREE_TYPE (in_type);
3250 /* GNU C allows cv-qualified function types. 'const'
3251 means the function is very pure, 'volatile' means it
3252 can't return. We need to warn when such qualifiers
3253 are added, not when they're taken away. */
3254 if (TREE_CODE (in_otype) == FUNCTION_TYPE
3255 && TREE_CODE (in_type) == FUNCTION_TYPE)
3256 added |= (TYPE_QUALS (in_type) & ~TYPE_QUALS (in_otype));
3258 discarded |= (TYPE_QUALS (in_otype) & ~TYPE_QUALS (in_type));
3260 while (TREE_CODE (in_type) == POINTER_TYPE
3261 && TREE_CODE (in_otype) == POINTER_TYPE);
3264 warning (0, "cast adds new qualifiers to function type");
3267 /* There are qualifiers present in IN_OTYPE that are not
3268 present in IN_TYPE. */
3269 warning (0, "cast discards qualifiers from pointer target type");
3272 /* Warn about possible alignment problems. */
3273 if (STRICT_ALIGNMENT
3274 && TREE_CODE (type) == POINTER_TYPE
3275 && TREE_CODE (otype) == POINTER_TYPE
3276 && TREE_CODE (TREE_TYPE (otype)) != VOID_TYPE
3277 && TREE_CODE (TREE_TYPE (otype)) != FUNCTION_TYPE
3278 /* Don't warn about opaque types, where the actual alignment
3279 restriction is unknown. */
3280 && !((TREE_CODE (TREE_TYPE (otype)) == UNION_TYPE
3281 || TREE_CODE (TREE_TYPE (otype)) == RECORD_TYPE)
3282 && TYPE_MODE (TREE_TYPE (otype)) == VOIDmode)
3283 && TYPE_ALIGN (TREE_TYPE (type)) > TYPE_ALIGN (TREE_TYPE (otype)))
3284 warning (OPT_Wcast_align,
3285 "cast increases required alignment of target type");
3287 if (TREE_CODE (type) == INTEGER_TYPE
3288 && TREE_CODE (otype) == POINTER_TYPE
3289 && TYPE_PRECISION (type) != TYPE_PRECISION (otype)
3290 && !TREE_CONSTANT (value))
3291 warning (OPT_Wpointer_to_int_cast,
3292 "cast from pointer to integer of different size");
3294 if (TREE_CODE (value) == CALL_EXPR
3295 && TREE_CODE (type) != TREE_CODE (otype))
3296 warning (OPT_Wbad_function_cast, "cast from function call of type %qT "
3297 "to non-matching type %qT", otype, type);
3299 if (TREE_CODE (type) == POINTER_TYPE
3300 && TREE_CODE (otype) == INTEGER_TYPE
3301 && TYPE_PRECISION (type) != TYPE_PRECISION (otype)
3302 /* Don't warn about converting any constant. */
3303 && !TREE_CONSTANT (value))
3304 warning (OPT_Wint_to_pointer_cast, "cast to pointer from integer "
3305 "of different size");
3307 if (flag_strict_aliasing && warn_strict_aliasing
3308 && TREE_CODE (type) == POINTER_TYPE
3309 && TREE_CODE (otype) == POINTER_TYPE
3310 && TREE_CODE (expr) == ADDR_EXPR
3311 && (DECL_P (TREE_OPERAND (expr, 0))
3312 || TREE_CODE (TREE_OPERAND (expr, 0)) == COMPONENT_REF)
3313 && !VOID_TYPE_P (TREE_TYPE (type)))
3315 /* Casting the address of an object to non void pointer. Warn
3316 if the cast breaks type based aliasing. */
3317 if (!COMPLETE_TYPE_P (TREE_TYPE (type)))
3318 warning (OPT_Wstrict_aliasing, "type-punning to incomplete type "
3319 "might break strict-aliasing rules");
3322 HOST_WIDE_INT set1 = get_alias_set (TREE_TYPE (TREE_OPERAND (expr, 0)));
3323 HOST_WIDE_INT set2 = get_alias_set (TREE_TYPE (type));
3325 if (!alias_sets_conflict_p (set1, set2))
3326 warning (OPT_Wstrict_aliasing, "dereferencing type-punned "
3327 "pointer will break strict-aliasing rules");
3328 else if (warn_strict_aliasing > 1
3329 && !alias_sets_might_conflict_p (set1, set2))
3330 warning (OPT_Wstrict_aliasing, "dereferencing type-punned "
3331 "pointer might break strict-aliasing rules");
3335 /* If pedantic, warn for conversions between function and object
3336 pointer types, except for converting a null pointer constant
3337 to function pointer type. */
3339 && TREE_CODE (type) == POINTER_TYPE
3340 && TREE_CODE (otype) == POINTER_TYPE
3341 && TREE_CODE (TREE_TYPE (otype)) == FUNCTION_TYPE
3342 && TREE_CODE (TREE_TYPE (type)) != FUNCTION_TYPE)
3343 pedwarn ("ISO C forbids conversion of function pointer to object pointer type");
3346 && TREE_CODE (type) == POINTER_TYPE
3347 && TREE_CODE (otype) == POINTER_TYPE
3348 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE
3349 && TREE_CODE (TREE_TYPE (otype)) != FUNCTION_TYPE
3350 && !(integer_zerop (value) && TREE_TYPE (otype) == void_type_node
3351 && TREE_CODE (expr) != NOP_EXPR))
3352 pedwarn ("ISO C forbids conversion of object pointer to function pointer type");
3355 value = convert (type, value);
3357 /* Ignore any integer overflow caused by the cast. */
3358 if (TREE_CODE (value) == INTEGER_CST)
3360 /* If OVALUE had overflow set, then so will VALUE, so it
3361 is safe to overwrite. */
3362 if (CONSTANT_CLASS_P (ovalue))
3364 TREE_OVERFLOW (value) = TREE_OVERFLOW (ovalue);
3365 /* Similarly, constant_overflow cannot have become cleared. */
3366 TREE_CONSTANT_OVERFLOW (value) = TREE_CONSTANT_OVERFLOW (ovalue);
3369 TREE_OVERFLOW (value) = 0;
3373 /* Don't let a cast be an lvalue. */
3375 value = non_lvalue (value);
3380 /* Interpret a cast of expression EXPR to type TYPE. */
3382 c_cast_expr (struct c_type_name *type_name, tree expr)
3385 int saved_wsp = warn_strict_prototypes;
3387 /* This avoids warnings about unprototyped casts on
3388 integers. E.g. "#define SIG_DFL (void(*)())0". */
3389 if (TREE_CODE (expr) == INTEGER_CST)
3390 warn_strict_prototypes = 0;
3391 type = groktypename (type_name);
3392 warn_strict_prototypes = saved_wsp;
3394 return build_c_cast (type, expr);
3398 /* Build an assignment expression of lvalue LHS from value RHS.
3399 MODIFYCODE is the code for a binary operator that we use
3400 to combine the old value of LHS with RHS to get the new value.
3401 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment. */
3404 build_modify_expr (tree lhs, enum tree_code modifycode, tree rhs)
3408 tree lhstype = TREE_TYPE (lhs);
3409 tree olhstype = lhstype;
3411 /* Types that aren't fully specified cannot be used in assignments. */
3412 lhs = require_complete_type (lhs);
3414 /* Avoid duplicate error messages from operands that had errors. */
3415 if (TREE_CODE (lhs) == ERROR_MARK || TREE_CODE (rhs) == ERROR_MARK)
3416 return error_mark_node;
3418 STRIP_TYPE_NOPS (rhs);
3422 /* If a binary op has been requested, combine the old LHS value with the RHS
3423 producing the value we should actually store into the LHS. */
3425 if (modifycode != NOP_EXPR)
3427 lhs = stabilize_reference (lhs);
3428 newrhs = build_binary_op (modifycode, lhs, rhs, 1);
3431 if (!lvalue_or_else (lhs, lv_assign))
3432 return error_mark_node;
3434 /* Give an error for storing in something that is 'const'. */
3436 if (TREE_READONLY (lhs) || TYPE_READONLY (lhstype)
3437 || ((TREE_CODE (lhstype) == RECORD_TYPE
3438 || TREE_CODE (lhstype) == UNION_TYPE)
3439 && C_TYPE_FIELDS_READONLY (lhstype)))
3440 readonly_error (lhs, lv_assign);
3442 /* If storing into a structure or union member,
3443 it has probably been given type `int'.
3444 Compute the type that would go with
3445 the actual amount of storage the member occupies. */
3447 if (TREE_CODE (lhs) == COMPONENT_REF
3448 && (TREE_CODE (lhstype) == INTEGER_TYPE
3449 || TREE_CODE (lhstype) == BOOLEAN_TYPE
3450 || TREE_CODE (lhstype) == REAL_TYPE
3451 || TREE_CODE (lhstype) == ENUMERAL_TYPE))
3452 lhstype = TREE_TYPE (get_unwidened (lhs, 0));
3454 /* If storing in a field that is in actuality a short or narrower than one,
3455 we must store in the field in its actual type. */
3457 if (lhstype != TREE_TYPE (lhs))
3459 lhs = copy_node (lhs);
3460 TREE_TYPE (lhs) = lhstype;
3463 /* Convert new value to destination type. */
3465 newrhs = convert_for_assignment (lhstype, newrhs, ic_assign,
3466 NULL_TREE, NULL_TREE, 0);
3467 if (TREE_CODE (newrhs) == ERROR_MARK)
3468 return error_mark_node;
3470 /* Emit ObjC write barrier, if necessary. */
3471 if (c_dialect_objc () && flag_objc_gc)
3473 result = objc_generate_write_barrier (lhs, modifycode, newrhs);
3478 /* Scan operands. */
3480 result = build2 (MODIFY_EXPR, lhstype, lhs, newrhs);
3481 TREE_SIDE_EFFECTS (result) = 1;
3483 /* If we got the LHS in a different type for storing in,
3484 convert the result back to the nominal type of LHS
3485 so that the value we return always has the same type
3486 as the LHS argument. */
3488 if (olhstype == TREE_TYPE (result))
3490 return convert_for_assignment (olhstype, result, ic_assign,
3491 NULL_TREE, NULL_TREE, 0);
3494 /* Convert value RHS to type TYPE as preparation for an assignment
3495 to an lvalue of type TYPE.
3496 The real work of conversion is done by `convert'.
3497 The purpose of this function is to generate error messages
3498 for assignments that are not allowed in C.
3499 ERRTYPE says whether it is argument passing, assignment,
3500 initialization or return.
3502 FUNCTION is a tree for the function being called.
3503 PARMNUM is the number of the argument, for printing in error messages. */
3506 convert_for_assignment (tree type, tree rhs, enum impl_conv errtype,
3507 tree fundecl, tree function, int parmnum)
3509 enum tree_code codel = TREE_CODE (type);
3511 enum tree_code coder;
3512 tree rname = NULL_TREE;
3513 bool objc_ok = false;
3515 if (errtype == ic_argpass || errtype == ic_argpass_nonproto)
3518 /* Change pointer to function to the function itself for
3520 if (TREE_CODE (function) == ADDR_EXPR
3521 && TREE_CODE (TREE_OPERAND (function, 0)) == FUNCTION_DECL)
3522 function = TREE_OPERAND (function, 0);
3524 /* Handle an ObjC selector specially for diagnostics. */
3525 selector = objc_message_selector ();
3527 if (selector && parmnum > 2)
3534 /* This macro is used to emit diagnostics to ensure that all format
3535 strings are complete sentences, visible to gettext and checked at
3537 #define WARN_FOR_ASSIGNMENT(AR, AS, IN, RE) \
3542 pedwarn (AR, parmnum, rname); \
3544 case ic_argpass_nonproto: \
3545 warning (0, AR, parmnum, rname); \
3557 gcc_unreachable (); \
3561 STRIP_TYPE_NOPS (rhs);
3563 if (optimize && TREE_CODE (rhs) == VAR_DECL
3564 && TREE_CODE (TREE_TYPE (rhs)) != ARRAY_TYPE)
3565 rhs = decl_constant_value_for_broken_optimization (rhs);
3567 rhstype = TREE_TYPE (rhs);
3568 coder = TREE_CODE (rhstype);
3570 if (coder == ERROR_MARK)
3571 return error_mark_node;
3573 if (c_dialect_objc ())
3596 objc_ok = objc_compare_types (type, rhstype, parmno, rname);
3599 if (TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (rhstype))
3601 overflow_warning (rhs);
3605 if (coder == VOID_TYPE)
3607 /* Except for passing an argument to an unprototyped function,
3608 this is a constraint violation. When passing an argument to
3609 an unprototyped function, it is compile-time undefined;
3610 making it a constraint in that case was rejected in
3612 error ("void value not ignored as it ought to be");
3613 return error_mark_node;
3615 /* A type converts to a reference to it.
3616 This code doesn't fully support references, it's just for the
3617 special case of va_start and va_copy. */
3618 if (codel == REFERENCE_TYPE
3619 && comptypes (TREE_TYPE (type), TREE_TYPE (rhs)) == 1)
3621 if (!lvalue_p (rhs))
3623 error ("cannot pass rvalue to reference parameter");
3624 return error_mark_node;
3626 if (!c_mark_addressable (rhs))
3627 return error_mark_node;
3628 rhs = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (rhs)), rhs);
3630 /* We already know that these two types are compatible, but they
3631 may not be exactly identical. In fact, `TREE_TYPE (type)' is
3632 likely to be __builtin_va_list and `TREE_TYPE (rhs)' is
3633 likely to be va_list, a typedef to __builtin_va_list, which
3634 is different enough that it will cause problems later. */
3635 if (TREE_TYPE (TREE_TYPE (rhs)) != TREE_TYPE (type))
3636 rhs = build1 (NOP_EXPR, build_pointer_type (TREE_TYPE (type)), rhs);
3638 rhs = build1 (NOP_EXPR, type, rhs);
3641 /* Some types can interconvert without explicit casts. */
3642 else if (codel == VECTOR_TYPE && coder == VECTOR_TYPE
3643 && vector_types_convertible_p (type, TREE_TYPE (rhs)))
3644 return convert (type, rhs);
3645 /* Arithmetic types all interconvert, and enum is treated like int. */
3646 else if ((codel == INTEGER_TYPE || codel == REAL_TYPE
3647 || codel == ENUMERAL_TYPE || codel == COMPLEX_TYPE
3648 || codel == BOOLEAN_TYPE)
3649 && (coder == INTEGER_TYPE || coder == REAL_TYPE
3650 || coder == ENUMERAL_TYPE || coder == COMPLEX_TYPE
3651 || coder == BOOLEAN_TYPE))
3652 return convert_and_check (type, rhs);
3654 /* Conversion to a transparent union from its member types.
3655 This applies only to function arguments. */
3656 else if (codel == UNION_TYPE && TYPE_TRANSPARENT_UNION (type)
3657 && (errtype == ic_argpass || errtype == ic_argpass_nonproto))
3660 tree marginal_memb_type = 0;
3662 for (memb_types = TYPE_FIELDS (type); memb_types;
3663 memb_types = TREE_CHAIN (memb_types))
3665 tree memb_type = TREE_TYPE (memb_types);
3667 if (comptypes (TYPE_MAIN_VARIANT (memb_type),
3668 TYPE_MAIN_VARIANT (rhstype)))
3671 if (TREE_CODE (memb_type) != POINTER_TYPE)
3674 if (coder == POINTER_TYPE)
3676 tree ttl = TREE_TYPE (memb_type);
3677 tree ttr = TREE_TYPE (rhstype);
3679 /* Any non-function converts to a [const][volatile] void *
3680 and vice versa; otherwise, targets must be the same.
3681 Meanwhile, the lhs target must have all the qualifiers of
3683 if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
3684 || comp_target_types (memb_type, rhstype))
3686 /* If this type won't generate any warnings, use it. */
3687 if (TYPE_QUALS (ttl) == TYPE_QUALS (ttr)
3688 || ((TREE_CODE (ttr) == FUNCTION_TYPE
3689 && TREE_CODE (ttl) == FUNCTION_TYPE)
3690 ? ((TYPE_QUALS (ttl) | TYPE_QUALS (ttr))
3691 == TYPE_QUALS (ttr))
3692 : ((TYPE_QUALS (ttl) | TYPE_QUALS (ttr))
3693 == TYPE_QUALS (ttl))))
3696 /* Keep looking for a better type, but remember this one. */
3697 if (!marginal_memb_type)
3698 marginal_memb_type = memb_type;
3702 /* Can convert integer zero to any pointer type. */
3703 if (integer_zerop (rhs)
3704 || (TREE_CODE (rhs) == NOP_EXPR
3705 && integer_zerop (TREE_OPERAND (rhs, 0))))
3707 rhs = null_pointer_node;
3712 if (memb_types || marginal_memb_type)
3716 /* We have only a marginally acceptable member type;
3717 it needs a warning. */
3718 tree ttl = TREE_TYPE (marginal_memb_type);
3719 tree ttr = TREE_TYPE (rhstype);
3721 /* Const and volatile mean something different for function
3722 types, so the usual warnings are not appropriate. */
3723 if (TREE_CODE (ttr) == FUNCTION_TYPE
3724 && TREE_CODE (ttl) == FUNCTION_TYPE)
3726 /* Because const and volatile on functions are
3727 restrictions that say the function will not do
3728 certain things, it is okay to use a const or volatile
3729 function where an ordinary one is wanted, but not
3731 if (TYPE_QUALS (ttl) & ~TYPE_QUALS (ttr))
3732 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE "
3733 "makes qualified function "
3734 "pointer from unqualified"),
3735 G_("assignment makes qualified "
3736 "function pointer from "
3738 G_("initialization makes qualified "
3739 "function pointer from "
3741 G_("return makes qualified function "
3742 "pointer from unqualified"));
3744 else if (TYPE_QUALS (ttr) & ~TYPE_QUALS (ttl))
3745 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE discards "
3746 "qualifiers from pointer target type"),
3747 G_("assignment discards qualifiers "
3748 "from pointer target type"),
3749 G_("initialization discards qualifiers "
3750 "from pointer target type"),
3751 G_("return discards qualifiers from "
3752 "pointer target type"));
3755 if (pedantic && !DECL_IN_SYSTEM_HEADER (fundecl))
3756 pedwarn ("ISO C prohibits argument conversion to union type");
3758 return build1 (NOP_EXPR, type, rhs);
3762 /* Conversions among pointers */
3763 else if ((codel == POINTER_TYPE || codel == REFERENCE_TYPE)
3764 && (coder == codel))
3766 tree ttl = TREE_TYPE (type);
3767 tree ttr = TREE_TYPE (rhstype);
3770 bool is_opaque_pointer;
3771 int target_cmp = 0; /* Cache comp_target_types () result. */
3773 if (TREE_CODE (mvl) != ARRAY_TYPE)
3774 mvl = TYPE_MAIN_VARIANT (mvl);
3775 if (TREE_CODE (mvr) != ARRAY_TYPE)
3776 mvr = TYPE_MAIN_VARIANT (mvr);
3777 /* Opaque pointers are treated like void pointers. */
3778 is_opaque_pointer = (targetm.vector_opaque_p (type)
3779 || targetm.vector_opaque_p (rhstype))
3780 && TREE_CODE (ttl) == VECTOR_TYPE
3781 && TREE_CODE (ttr) == VECTOR_TYPE;
3783 /* C++ does not allow the implicit conversion void* -> T*. However,
3784 for the purpose of reducing the number of false positives, we
3785 tolerate the special case of
3789 where NULL is typically defined in C to be '(void *) 0'. */
3790 if (VOID_TYPE_P (ttr) && rhs != null_pointer_node && !VOID_TYPE_P (ttl))
3791 warning (OPT_Wc___compat, "request for implicit conversion from "
3792 "%qT to %qT not permitted in C++", rhstype, type);
3794 /* Check if the right-hand side has a format attribute but the
3795 left-hand side doesn't. */
3796 if (warn_missing_format_attribute)
3798 tree rattrs = TYPE_ATTRIBUTES (ttr), ra;
3799 for (ra = rattrs; ra; ra = TREE_CHAIN (ra))
3801 if (is_attribute_p ("format", TREE_PURPOSE (ra)))
3806 tree lattrs = TYPE_ATTRIBUTES (ttl), la;
3807 for (la = lattrs; la; la = TREE_CHAIN (la))
3809 if (is_attribute_p ("format", TREE_PURPOSE (la)))
3816 case ic_argpass_nonproto:
3817 warning (OPT_Wmissing_format_attribute,
3818 "argument %d of %qE might be "
3819 "a candidate for a format attribute",
3823 warning (OPT_Wmissing_format_attribute,
3824 "assignment left-hand side might be "
3825 "a candidate for a format attribute");
3828 warning (OPT_Wmissing_format_attribute,
3829 "initialization left-hand side might be "
3830 "a candidate for a format attribute");
3833 warning (OPT_Wmissing_format_attribute,
3834 "return type might be "
3835 "a candidate for a format attribute");
3843 /* Any non-function converts to a [const][volatile] void *
3844 and vice versa; otherwise, targets must be the same.
3845 Meanwhile, the lhs target must have all the qualifiers of the rhs. */
3846 if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
3847 || (target_cmp = comp_target_types (type, rhstype))
3848 || is_opaque_pointer
3849 || (c_common_unsigned_type (mvl)
3850 == c_common_unsigned_type (mvr)))
3853 && ((VOID_TYPE_P (ttl) && TREE_CODE (ttr) == FUNCTION_TYPE)
3856 /* Check TREE_CODE to catch cases like (void *) (char *) 0
3857 which are not ANSI null ptr constants. */
3858 && (!integer_zerop (rhs) || TREE_CODE (rhs) == NOP_EXPR)
3859 && TREE_CODE (ttl) == FUNCTION_TYPE)))
3860 WARN_FOR_ASSIGNMENT (G_("ISO C forbids passing argument %d of "
3861 "%qE between function pointer "
3863 G_("ISO C forbids assignment between "
3864 "function pointer and %<void *%>"),
3865 G_("ISO C forbids initialization between "
3866 "function pointer and %<void *%>"),
3867 G_("ISO C forbids return between function "
3868 "pointer and %<void *%>"));
3869 /* Const and volatile mean something different for function types,
3870 so the usual warnings are not appropriate. */
3871 else if (TREE_CODE (ttr) != FUNCTION_TYPE
3872 && TREE_CODE (ttl) != FUNCTION_TYPE)
3874 if (TYPE_QUALS (ttr) & ~TYPE_QUALS (ttl))
3876 /* Types differing only by the presence of the 'volatile'
3877 qualifier are acceptable if the 'volatile' has been added
3878 in by the Objective-C EH machinery. */
3879 if (!objc_type_quals_match (ttl, ttr))
3880 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE discards "
3881 "qualifiers from pointer target type"),
3882 G_("assignment discards qualifiers "
3883 "from pointer target type"),
3884 G_("initialization discards qualifiers "
3885 "from pointer target type"),
3886 G_("return discards qualifiers from "
3887 "pointer target type"));
3889 /* If this is not a case of ignoring a mismatch in signedness,
3891 else if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
3894 /* If there is a mismatch, do warn. */
3895 else if (warn_pointer_sign)
3896 WARN_FOR_ASSIGNMENT (G_("pointer targets in passing argument "
3897 "%d of %qE differ in signedness"),
3898 G_("pointer targets in assignment "
3899 "differ in signedness"),
3900 G_("pointer targets in initialization "
3901 "differ in signedness"),
3902 G_("pointer targets in return differ "
3905 else if (TREE_CODE (ttl) == FUNCTION_TYPE
3906 && TREE_CODE (ttr) == FUNCTION_TYPE)
3908 /* Because const and volatile on functions are restrictions
3909 that say the function will not do certain things,
3910 it is okay to use a const or volatile function
3911 where an ordinary one is wanted, but not vice-versa. */
3912 if (TYPE_QUALS (ttl) & ~TYPE_QUALS (ttr))
3913 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE makes "
3914 "qualified function pointer "
3915 "from unqualified"),
3916 G_("assignment makes qualified function "
3917 "pointer from unqualified"),
3918 G_("initialization makes qualified "
3919 "function pointer from unqualified"),
3920 G_("return makes qualified function "
3921 "pointer from unqualified"));
3925 /* Avoid warning about the volatile ObjC EH puts on decls. */
3927 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE from "
3928 "incompatible pointer type"),
3929 G_("assignment from incompatible pointer type"),
3930 G_("initialization from incompatible "
3932 G_("return from incompatible pointer type"));
3934 return convert (type, rhs);
3936 else if (codel == POINTER_TYPE && coder == ARRAY_TYPE)
3938 /* ??? This should not be an error when inlining calls to
3939 unprototyped functions. */
3940 error ("invalid use of non-lvalue array");
3941 return error_mark_node;
3943 else if (codel == POINTER_TYPE && coder == INTEGER_TYPE)
3945 /* An explicit constant 0 can convert to a pointer,
3946 or one that results from arithmetic, even including
3947 a cast to integer type. */
3948 if (!(TREE_CODE (rhs) == INTEGER_CST && integer_zerop (rhs))
3950 !(TREE_CODE (rhs) == NOP_EXPR
3951 && TREE_CODE (TREE_TYPE (rhs)) == INTEGER_TYPE
3952 && TREE_CODE (TREE_OPERAND (rhs, 0)) == INTEGER_CST
3953 && integer_zerop (TREE_OPERAND (rhs, 0))))
3954 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE makes "
3955 "pointer from integer without a cast"),
3956 G_("assignment makes pointer from integer "
3958 G_("initialization makes pointer from "
3959 "integer without a cast"),
3960 G_("return makes pointer from integer "
3963 return convert (type, rhs);
3965 else if (codel == INTEGER_TYPE && coder == POINTER_TYPE)
3967 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE makes integer "
3968 "from pointer without a cast"),
3969 G_("assignment makes integer from pointer "
3971 G_("initialization makes integer from pointer "
3973 G_("return makes integer from pointer "
3975 return convert (type, rhs);
3977 else if (codel == BOOLEAN_TYPE && coder == POINTER_TYPE)
3978 return convert (type, rhs);
3983 case ic_argpass_nonproto:
3984 /* ??? This should not be an error when inlining calls to
3985 unprototyped functions. */
3986 error ("incompatible type for argument %d of %qE", parmnum, rname);
3989 error ("incompatible types in assignment");
3992 error ("incompatible types in initialization");
3995 error ("incompatible types in return");
4001 return error_mark_node;
4004 /* Convert VALUE for assignment into inlined parameter PARM. ARGNUM
4005 is used for error and waring reporting and indicates which argument
4006 is being processed. */
4009 c_convert_parm_for_inlining (tree parm, tree value, tree fn, int argnum)
4013 /* If FN was prototyped, the value has been converted already
4014 in convert_arguments. */
4015 if (!value || TYPE_ARG_TYPES (TREE_TYPE (fn)))
4018 type = TREE_TYPE (parm);
4019 ret = convert_for_assignment (type, value,
4020 ic_argpass_nonproto, fn,
4022 if (targetm.calls.promote_prototypes (TREE_TYPE (fn))
4023 && INTEGRAL_TYPE_P (type)
4024 && (TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node)))
4025 ret = default_conversion (ret);
4029 /* If VALUE is a compound expr all of whose expressions are constant, then
4030 return its value. Otherwise, return error_mark_node.
4032 This is for handling COMPOUND_EXPRs as initializer elements
4033 which is allowed with a warning when -pedantic is specified. */
4036 valid_compound_expr_initializer (tree value, tree endtype)
4038 if (TREE_CODE (value) == COMPOUND_EXPR)
4040 if (valid_compound_expr_initializer (TREE_OPERAND (value, 0), endtype)
4042 return error_mark_node;
4043 return valid_compound_expr_initializer (TREE_OPERAND (value, 1),
4046 else if (!initializer_constant_valid_p (value, endtype))
4047 return error_mark_node;
4052 /* Perform appropriate conversions on the initial value of a variable,
4053 store it in the declaration DECL,
4054 and print any error messages that are appropriate.
4055 If the init is invalid, store an ERROR_MARK. */
4058 store_init_value (tree decl, tree init)
4062 /* If variable's type was invalidly declared, just ignore it. */
4064 type = TREE_TYPE (decl);
4065 if (TREE_CODE (type) == ERROR_MARK)
4068 /* Digest the specified initializer into an expression. */
4070 value = digest_init (type, init, true, TREE_STATIC (decl));
4072 /* Store the expression if valid; else report error. */
4074 if (!in_system_header
4075 && AGGREGATE_TYPE_P (TREE_TYPE (decl)) && !TREE_STATIC (decl))
4076 warning (OPT_Wtraditional, "traditional C rejects automatic "
4077 "aggregate initialization");
4079 DECL_INITIAL (decl) = value;
4081 /* ANSI wants warnings about out-of-range constant initializers. */
4082 STRIP_TYPE_NOPS (value);
4083 constant_expression_warning (value);
4085 /* Check if we need to set array size from compound literal size. */
4086 if (TREE_CODE (type) == ARRAY_TYPE
4087 && TYPE_DOMAIN (type) == 0
4088 && value != error_mark_node)
4090 tree inside_init = init;
4092 STRIP_TYPE_NOPS (inside_init);
4093 inside_init = fold (inside_init);
4095 if (TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
4097 tree decl = COMPOUND_LITERAL_EXPR_DECL (inside_init);
4099 if (TYPE_DOMAIN (TREE_TYPE (decl)))
4101 /* For int foo[] = (int [3]){1}; we need to set array size
4102 now since later on array initializer will be just the
4103 brace enclosed list of the compound literal. */
4104 TYPE_DOMAIN (type) = TYPE_DOMAIN (TREE_TYPE (decl));
4106 layout_decl (decl, 0);
4112 /* Methods for storing and printing names for error messages. */
4114 /* Implement a spelling stack that allows components of a name to be pushed
4115 and popped. Each element on the stack is this structure. */
4127 #define SPELLING_STRING 1
4128 #define SPELLING_MEMBER 2
4129 #define SPELLING_BOUNDS 3
4131 static struct spelling *spelling; /* Next stack element (unused). */
4132 static struct spelling *spelling_base; /* Spelling stack base. */
4133 static int spelling_size; /* Size of the spelling stack. */
4135 /* Macros to save and restore the spelling stack around push_... functions.
4136 Alternative to SAVE_SPELLING_STACK. */
4138 #define SPELLING_DEPTH() (spelling - spelling_base)
4139 #define RESTORE_SPELLING_DEPTH(DEPTH) (spelling = spelling_base + (DEPTH))
4141 /* Push an element on the spelling stack with type KIND and assign VALUE
4144 #define PUSH_SPELLING(KIND, VALUE, MEMBER) \
4146 int depth = SPELLING_DEPTH (); \
4148 if (depth >= spelling_size) \
4150 spelling_size += 10; \
4151 spelling_base = XRESIZEVEC (struct spelling, spelling_base, \
4153 RESTORE_SPELLING_DEPTH (depth); \
4156 spelling->kind = (KIND); \
4157 spelling->MEMBER = (VALUE); \
4161 /* Push STRING on the stack. Printed literally. */
4164 push_string (const char *string)
4166 PUSH_SPELLING (SPELLING_STRING, string, u.s);
4169 /* Push a member name on the stack. Printed as '.' STRING. */
4172 push_member_name (tree decl)
4174 const char *const string
4175 = DECL_NAME (decl) ? IDENTIFIER_POINTER (DECL_NAME (decl)) : "<anonymous>";
4176 PUSH_SPELLING (SPELLING_MEMBER, string, u.s);
4179 /* Push an array bounds on the stack. Printed as [BOUNDS]. */
4182 push_array_bounds (int bounds)
4184 PUSH_SPELLING (SPELLING_BOUNDS, bounds, u.i);
4187 /* Compute the maximum size in bytes of the printed spelling. */
4190 spelling_length (void)
4195 for (p = spelling_base; p < spelling; p++)
4197 if (p->kind == SPELLING_BOUNDS)
4200 size += strlen (p->u.s) + 1;
4206 /* Print the spelling to BUFFER and return it. */
4209 print_spelling (char *buffer)
4214 for (p = spelling_base; p < spelling; p++)
4215 if (p->kind == SPELLING_BOUNDS)
4217 sprintf (d, "[%d]", p->u.i);
4223 if (p->kind == SPELLING_MEMBER)
4225 for (s = p->u.s; (*d = *s++); d++)
4232 /* Issue an error message for a bad initializer component.
4233 MSGID identifies the message.
4234 The component name is taken from the spelling stack. */
4237 error_init (const char *msgid)
4241 error ("%s", _(msgid));
4242 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4244 error ("(near initialization for %qs)", ofwhat);
4247 /* Issue a pedantic warning for a bad initializer component.
4248 MSGID identifies the message.
4249 The component name is taken from the spelling stack. */
4252 pedwarn_init (const char *msgid)
4256 pedwarn ("%s", _(msgid));
4257 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4259 pedwarn ("(near initialization for %qs)", ofwhat);
4262 /* Issue a warning for a bad initializer component.
4263 MSGID identifies the message.
4264 The component name is taken from the spelling stack. */
4267 warning_init (const char *msgid)
4271 warning (0, "%s", _(msgid));
4272 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4274 warning (0, "(near initialization for %qs)", ofwhat);
4277 /* If TYPE is an array type and EXPR is a parenthesized string
4278 constant, warn if pedantic that EXPR is being used to initialize an
4279 object of type TYPE. */
4282 maybe_warn_string_init (tree type, struct c_expr expr)
4285 && TREE_CODE (type) == ARRAY_TYPE
4286 && TREE_CODE (expr.value) == STRING_CST
4287 && expr.original_code != STRING_CST)
4288 pedwarn_init ("array initialized from parenthesized string constant");
4291 /* Digest the parser output INIT as an initializer for type TYPE.
4292 Return a C expression of type TYPE to represent the initial value.
4294 If INIT is a string constant, STRICT_STRING is true if it is
4295 unparenthesized or we should not warn here for it being parenthesized.
4296 For other types of INIT, STRICT_STRING is not used.
4298 REQUIRE_CONSTANT requests an error if non-constant initializers or
4299 elements are seen. */
4302 digest_init (tree type, tree init, bool strict_string, int require_constant)
4304 enum tree_code code = TREE_CODE (type);
4305 tree inside_init = init;
4307 if (type == error_mark_node
4308 || init == error_mark_node
4309 || TREE_TYPE (init) == error_mark_node)
4310 return error_mark_node;
4312 STRIP_TYPE_NOPS (inside_init);
4314 inside_init = fold (inside_init);
4316 /* Initialization of an array of chars from a string constant
4317 optionally enclosed in braces. */
4319 if (code == ARRAY_TYPE && inside_init
4320 && TREE_CODE (inside_init) == STRING_CST)
4322 tree typ1 = TYPE_MAIN_VARIANT (TREE_TYPE (type));
4323 /* Note that an array could be both an array of character type
4324 and an array of wchar_t if wchar_t is signed char or unsigned
4326 bool char_array = (typ1 == char_type_node
4327 || typ1 == signed_char_type_node
4328 || typ1 == unsigned_char_type_node);
4329 bool wchar_array = !!comptypes (typ1, wchar_type_node);
4330 if (char_array || wchar_array)
4334 expr.value = inside_init;
4335 expr.original_code = (strict_string ? STRING_CST : ERROR_MARK);
4336 maybe_warn_string_init (type, expr);
4339 = (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (inside_init)))
4342 if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
4343 TYPE_MAIN_VARIANT (type)))
4346 if (!wchar_array && !char_string)
4348 error_init ("char-array initialized from wide string");
4349 return error_mark_node;
4351 if (char_string && !char_array)
4353 error_init ("wchar_t-array initialized from non-wide string");
4354 return error_mark_node;
4357 TREE_TYPE (inside_init) = type;
4358 if (TYPE_DOMAIN (type) != 0
4359 && TYPE_SIZE (type) != 0
4360 && TREE_CODE (TYPE_SIZE (type)) == INTEGER_CST
4361 /* Subtract 1 (or sizeof (wchar_t))
4362 because it's ok to ignore the terminating null char
4363 that is counted in the length of the constant. */
4364 && 0 > compare_tree_int (TYPE_SIZE_UNIT (type),
4365 TREE_STRING_LENGTH (inside_init)
4366 - ((TYPE_PRECISION (typ1)
4367 != TYPE_PRECISION (char_type_node))
4368 ? (TYPE_PRECISION (wchar_type_node)
4371 pedwarn_init ("initializer-string for array of chars is too long");
4375 else if (INTEGRAL_TYPE_P (typ1))
4377 error_init ("array of inappropriate type initialized "
4378 "from string constant");
4379 return error_mark_node;
4383 /* Build a VECTOR_CST from a *constant* vector constructor. If the
4384 vector constructor is not constant (e.g. {1,2,3,foo()}) then punt
4385 below and handle as a constructor. */
4386 if (code == VECTOR_TYPE
4387 && TREE_CODE (TREE_TYPE (inside_init)) == VECTOR_TYPE
4388 && vector_types_convertible_p (TREE_TYPE (inside_init), type)
4389 && TREE_CONSTANT (inside_init))
4391 if (TREE_CODE (inside_init) == VECTOR_CST
4392 && comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
4393 TYPE_MAIN_VARIANT (type)))
4396 if (TREE_CODE (inside_init) == CONSTRUCTOR)
4398 unsigned HOST_WIDE_INT ix;
4400 bool constant_p = true;
4402 /* Iterate through elements and check if all constructor
4403 elements are *_CSTs. */
4404 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (inside_init), ix, value)
4405 if (!CONSTANT_CLASS_P (value))
4412 return build_vector_from_ctor (type,
4413 CONSTRUCTOR_ELTS (inside_init));
4417 /* Any type can be initialized
4418 from an expression of the same type, optionally with braces. */
4420 if (inside_init && TREE_TYPE (inside_init) != 0
4421 && (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
4422 TYPE_MAIN_VARIANT (type))
4423 || (code == ARRAY_TYPE
4424 && comptypes (TREE_TYPE (inside_init), type))
4425 || (code == VECTOR_TYPE
4426 && comptypes (TREE_TYPE (inside_init), type))
4427 || (code == POINTER_TYPE
4428 && TREE_CODE (TREE_TYPE (inside_init)) == ARRAY_TYPE
4429 && comptypes (TREE_TYPE (TREE_TYPE (inside_init)),
4430 TREE_TYPE (type)))))
4432 if (code == POINTER_TYPE)
4434 if (TREE_CODE (TREE_TYPE (inside_init)) == ARRAY_TYPE)
4436 if (TREE_CODE (inside_init) == STRING_CST
4437 || TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
4438 inside_init = array_to_pointer_conversion (inside_init);
4441 error_init ("invalid use of non-lvalue array");
4442 return error_mark_node;
4447 if (code == VECTOR_TYPE)
4448 /* Although the types are compatible, we may require a
4450 inside_init = convert (type, inside_init);
4452 if (require_constant && !flag_isoc99
4453 && TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
4455 /* As an extension, allow initializing objects with static storage
4456 duration with compound literals (which are then treated just as
4457 the brace enclosed list they contain). */
4458 tree decl = COMPOUND_LITERAL_EXPR_DECL (inside_init);
4459 inside_init = DECL_INITIAL (decl);
4462 if (code == ARRAY_TYPE && TREE_CODE (inside_init) != STRING_CST
4463 && TREE_CODE (inside_init) != CONSTRUCTOR)
4465 error_init ("array initialized from non-constant array expression");
4466 return error_mark_node;
4469 if (optimize && TREE_CODE (inside_init) == VAR_DECL)
4470 inside_init = decl_constant_value_for_broken_optimization (inside_init);
4472 /* Compound expressions can only occur here if -pedantic or
4473 -pedantic-errors is specified. In the later case, we always want
4474 an error. In the former case, we simply want a warning. */
4475 if (require_constant && pedantic
4476 && TREE_CODE (inside_init) == COMPOUND_EXPR)
4479 = valid_compound_expr_initializer (inside_init,
4480 TREE_TYPE (inside_init));
4481 if (inside_init == error_mark_node)
4482 error_init ("initializer element is not constant");
4484 pedwarn_init ("initializer element is not constant");
4485 if (flag_pedantic_errors)
4486 inside_init = error_mark_node;
4488 else if (require_constant
4489 && !initializer_constant_valid_p (inside_init,
4490 TREE_TYPE (inside_init)))
4492 error_init ("initializer element is not constant");
4493 inside_init = error_mark_node;
4496 /* Added to enable additional -Wmissing-format-attribute warnings. */
4497 if (TREE_CODE (TREE_TYPE (inside_init)) == POINTER_TYPE)
4498 inside_init = convert_for_assignment (type, inside_init, ic_init, NULL_TREE,
4503 /* Handle scalar types, including conversions. */
4505 if (code == INTEGER_TYPE || code == REAL_TYPE || code == POINTER_TYPE
4506 || code == ENUMERAL_TYPE || code == BOOLEAN_TYPE || code == COMPLEX_TYPE
4507 || code == VECTOR_TYPE)
4509 if (TREE_CODE (TREE_TYPE (init)) == ARRAY_TYPE
4510 && (TREE_CODE (init) == STRING_CST
4511 || TREE_CODE (init) == COMPOUND_LITERAL_EXPR))
4512 init = array_to_pointer_conversion (init);
4514 = convert_for_assignment (type, init, ic_init,
4515 NULL_TREE, NULL_TREE, 0);
4517 /* Check to see if we have already given an error message. */
4518 if (inside_init == error_mark_node)
4520 else if (require_constant && !TREE_CONSTANT (inside_init))
4522 error_init ("initializer element is not constant");
4523 inside_init = error_mark_node;
4525 else if (require_constant
4526 && !initializer_constant_valid_p (inside_init,
4527 TREE_TYPE (inside_init)))
4529 error_init ("initializer element is not computable at load time");
4530 inside_init = error_mark_node;
4536 /* Come here only for records and arrays. */
4538 if (COMPLETE_TYPE_P (type) && TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST)
4540 error_init ("variable-sized object may not be initialized");
4541 return error_mark_node;
4544 error_init ("invalid initializer");
4545 return error_mark_node;
4548 /* Handle initializers that use braces. */
4550 /* Type of object we are accumulating a constructor for.
4551 This type is always a RECORD_TYPE, UNION_TYPE or ARRAY_TYPE. */
4552 static tree constructor_type;
4554 /* For a RECORD_TYPE or UNION_TYPE, this is the chain of fields
4556 static tree constructor_fields;
4558 /* For an ARRAY_TYPE, this is the specified index
4559 at which to store the next element we get. */
4560 static tree constructor_index;
4562 /* For an ARRAY_TYPE, this is the maximum index. */
4563 static tree constructor_max_index;
4565 /* For a RECORD_TYPE, this is the first field not yet written out. */
4566 static tree constructor_unfilled_fields;
4568 /* For an ARRAY_TYPE, this is the index of the first element
4569 not yet written out. */
4570 static tree constructor_unfilled_index;
4572 /* In a RECORD_TYPE, the byte index of the next consecutive field.
4573 This is so we can generate gaps between fields, when appropriate. */
4574 static tree constructor_bit_index;
4576 /* If we are saving up the elements rather than allocating them,
4577 this is the list of elements so far (in reverse order,
4578 most recent first). */
4579 static VEC(constructor_elt,gc) *constructor_elements;
4581 /* 1 if constructor should be incrementally stored into a constructor chain,
4582 0 if all the elements should be kept in AVL tree. */
4583 static int constructor_incremental;
4585 /* 1 if so far this constructor's elements are all compile-time constants. */
4586 static int constructor_constant;
4588 /* 1 if so far this constructor's elements are all valid address constants. */
4589 static int constructor_simple;
4591 /* 1 if this constructor is erroneous so far. */
4592 static int constructor_erroneous;
4594 /* Structure for managing pending initializer elements, organized as an
4599 struct init_node *left, *right;
4600 struct init_node *parent;
4606 /* Tree of pending elements at this constructor level.
4607 These are elements encountered out of order
4608 which belong at places we haven't reached yet in actually
4610 Will never hold tree nodes across GC runs. */
4611 static struct init_node *constructor_pending_elts;
4613 /* The SPELLING_DEPTH of this constructor. */
4614 static int constructor_depth;
4616 /* DECL node for which an initializer is being read.
4617 0 means we are reading a constructor expression
4618 such as (struct foo) {...}. */
4619 static tree constructor_decl;
4621 /* Nonzero if this is an initializer for a top-level decl. */
4622 static int constructor_top_level;
4624 /* Nonzero if there were any member designators in this initializer. */
4625 static int constructor_designated;
4627 /* Nesting depth of designator list. */
4628 static int designator_depth;
4630 /* Nonzero if there were diagnosed errors in this designator list. */
4631 static int designator_errorneous;
4634 /* This stack has a level for each implicit or explicit level of
4635 structuring in the initializer, including the outermost one. It
4636 saves the values of most of the variables above. */
4638 struct constructor_range_stack;
4640 struct constructor_stack
4642 struct constructor_stack *next;
4647 tree unfilled_index;
4648 tree unfilled_fields;
4650 VEC(constructor_elt,gc) *elements;
4651 struct init_node *pending_elts;
4654 /* If value nonzero, this value should replace the entire
4655 constructor at this level. */
4656 struct c_expr replacement_value;
4657 struct constructor_range_stack *range_stack;
4667 static struct constructor_stack *constructor_stack;
4669 /* This stack represents designators from some range designator up to
4670 the last designator in the list. */
4672 struct constructor_range_stack
4674 struct constructor_range_stack *next, *prev;
4675 struct constructor_stack *stack;
4682 static struct constructor_range_stack *constructor_range_stack;
4684 /* This stack records separate initializers that are nested.
4685 Nested initializers can't happen in ANSI C, but GNU C allows them
4686 in cases like { ... (struct foo) { ... } ... }. */
4688 struct initializer_stack
4690 struct initializer_stack *next;
4692 struct constructor_stack *constructor_stack;
4693 struct constructor_range_stack *constructor_range_stack;
4694 VEC(constructor_elt,gc) *elements;
4695 struct spelling *spelling;
4696 struct spelling *spelling_base;
4699 char require_constant_value;
4700 char require_constant_elements;
4703 static struct initializer_stack *initializer_stack;
4705 /* Prepare to parse and output the initializer for variable DECL. */
4708 start_init (tree decl, tree asmspec_tree ATTRIBUTE_UNUSED, int top_level)
4711 struct initializer_stack *p = xmalloc (sizeof (struct initializer_stack));
4713 p->decl = constructor_decl;
4714 p->require_constant_value = require_constant_value;
4715 p->require_constant_elements = require_constant_elements;
4716 p->constructor_stack = constructor_stack;
4717 p->constructor_range_stack = constructor_range_stack;
4718 p->elements = constructor_elements;
4719 p->spelling = spelling;
4720 p->spelling_base = spelling_base;
4721 p->spelling_size = spelling_size;
4722 p->top_level = constructor_top_level;
4723 p->next = initializer_stack;
4724 initializer_stack = p;
4726 constructor_decl = decl;
4727 constructor_designated = 0;
4728 constructor_top_level = top_level;
4730 if (decl != 0 && decl != error_mark_node)
4732 require_constant_value = TREE_STATIC (decl);
4733 require_constant_elements
4734 = ((TREE_STATIC (decl) || (pedantic && !flag_isoc99))
4735 /* For a scalar, you can always use any value to initialize,
4736 even within braces. */
4737 && (TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE
4738 || TREE_CODE (TREE_TYPE (decl)) == RECORD_TYPE
4739 || TREE_CODE (TREE_TYPE (decl)) == UNION_TYPE
4740 || TREE_CODE (TREE_TYPE (decl)) == QUAL_UNION_TYPE));
4741 locus = IDENTIFIER_POINTER (DECL_NAME (decl));
4745 require_constant_value = 0;
4746 require_constant_elements = 0;
4747 locus = "(anonymous)";
4750 constructor_stack = 0;
4751 constructor_range_stack = 0;
4753 missing_braces_mentioned = 0;
4757 RESTORE_SPELLING_DEPTH (0);
4760 push_string (locus);
4766 struct initializer_stack *p = initializer_stack;
4768 /* Free the whole constructor stack of this initializer. */
4769 while (constructor_stack)
4771 struct constructor_stack *q = constructor_stack;
4772 constructor_stack = q->next;
4776 gcc_assert (!constructor_range_stack);
4778 /* Pop back to the data of the outer initializer (if any). */
4779 free (spelling_base);
4781 constructor_decl = p->decl;
4782 require_constant_value = p->require_constant_value;
4783 require_constant_elements = p->require_constant_elements;
4784 constructor_stack = p->constructor_stack;
4785 constructor_range_stack = p->constructor_range_stack;
4786 constructor_elements = p->elements;
4787 spelling = p->spelling;
4788 spelling_base = p->spelling_base;
4789 spelling_size = p->spelling_size;
4790 constructor_top_level = p->top_level;
4791 initializer_stack = p->next;
4795 /* Call here when we see the initializer is surrounded by braces.
4796 This is instead of a call to push_init_level;
4797 it is matched by a call to pop_init_level.
4799 TYPE is the type to initialize, for a constructor expression.
4800 For an initializer for a decl, TYPE is zero. */
4803 really_start_incremental_init (tree type)
4805 struct constructor_stack *p = XNEW (struct constructor_stack);
4808 type = TREE_TYPE (constructor_decl);
4810 if (targetm.vector_opaque_p (type))
4811 error ("opaque vector types cannot be initialized");
4813 p->type = constructor_type;
4814 p->fields = constructor_fields;
4815 p->index = constructor_index;
4816 p->max_index = constructor_max_index;
4817 p->unfilled_index = constructor_unfilled_index;
4818 p->unfilled_fields = constructor_unfilled_fields;
4819 p->bit_index = constructor_bit_index;
4820 p->elements = constructor_elements;
4821 p->constant = constructor_constant;
4822 p->simple = constructor_simple;
4823 p->erroneous = constructor_erroneous;
4824 p->pending_elts = constructor_pending_elts;
4825 p->depth = constructor_depth;
4826 p->replacement_value.value = 0;
4827 p->replacement_value.original_code = ERROR_MARK;
4831 p->incremental = constructor_incremental;
4832 p->designated = constructor_designated;
4834 constructor_stack = p;
4836 constructor_constant = 1;
4837 constructor_simple = 1;
4838 constructor_depth = SPELLING_DEPTH ();
4839 constructor_elements = 0;
4840 constructor_pending_elts = 0;
4841 constructor_type = type;
4842 constructor_incremental = 1;
4843 constructor_designated = 0;
4844 designator_depth = 0;
4845 designator_errorneous = 0;
4847 if (TREE_CODE (constructor_type) == RECORD_TYPE
4848 || TREE_CODE (constructor_type) == UNION_TYPE)
4850 constructor_fields = TYPE_FIELDS (constructor_type);
4851 /* Skip any nameless bit fields at the beginning. */
4852 while (constructor_fields != 0 && DECL_C_BIT_FIELD (constructor_fields)
4853 && DECL_NAME (constructor_fields) == 0)
4854 constructor_fields = TREE_CHAIN (constructor_fields);
4856 constructor_unfilled_fields = constructor_fields;
4857 constructor_bit_index = bitsize_zero_node;
4859 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
4861 if (TYPE_DOMAIN (constructor_type))
4863 constructor_max_index
4864 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type));
4866 /* Detect non-empty initializations of zero-length arrays. */
4867 if (constructor_max_index == NULL_TREE
4868 && TYPE_SIZE (constructor_type))
4869 constructor_max_index = build_int_cst (NULL_TREE, -1);
4871 /* constructor_max_index needs to be an INTEGER_CST. Attempts
4872 to initialize VLAs will cause a proper error; avoid tree
4873 checking errors as well by setting a safe value. */
4874 if (constructor_max_index
4875 && TREE_CODE (constructor_max_index) != INTEGER_CST)
4876 constructor_max_index = build_int_cst (NULL_TREE, -1);
4879 = convert (bitsizetype,
4880 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
4884 constructor_index = bitsize_zero_node;
4885 constructor_max_index = NULL_TREE;
4888 constructor_unfilled_index = constructor_index;
4890 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
4892 /* Vectors are like simple fixed-size arrays. */
4893 constructor_max_index =
4894 build_int_cst (NULL_TREE, TYPE_VECTOR_SUBPARTS (constructor_type) - 1);
4895 constructor_index = convert (bitsizetype, bitsize_zero_node);
4896 constructor_unfilled_index = constructor_index;
4900 /* Handle the case of int x = {5}; */
4901 constructor_fields = constructor_type;
4902 constructor_unfilled_fields = constructor_type;
4906 /* Push down into a subobject, for initialization.
4907 If this is for an explicit set of braces, IMPLICIT is 0.
4908 If it is because the next element belongs at a lower level,
4909 IMPLICIT is 1 (or 2 if the push is because of designator list). */
4912 push_init_level (int implicit)
4914 struct constructor_stack *p;
4915 tree value = NULL_TREE;
4917 /* If we've exhausted any levels that didn't have braces,
4918 pop them now. If implicit == 1, this will have been done in
4919 process_init_element; do not repeat it here because in the case
4920 of excess initializers for an empty aggregate this leads to an
4921 infinite cycle of popping a level and immediately recreating
4925 while (constructor_stack->implicit)
4927 if ((TREE_CODE (constructor_type) == RECORD_TYPE
4928 || TREE_CODE (constructor_type) == UNION_TYPE)
4929 && constructor_fields == 0)
4930 process_init_element (pop_init_level (1));
4931 else if (TREE_CODE (constructor_type) == ARRAY_TYPE
4932 && constructor_max_index
4933 && tree_int_cst_lt (constructor_max_index,
4935 process_init_element (pop_init_level (1));
4941 /* Unless this is an explicit brace, we need to preserve previous
4945 if ((TREE_CODE (constructor_type) == RECORD_TYPE
4946 || TREE_CODE (constructor_type) == UNION_TYPE)
4947 && constructor_fields)
4948 value = find_init_member (constructor_fields);
4949 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
4950 value = find_init_member (constructor_index);
4953 p = XNEW (struct constructor_stack);
4954 p->type = constructor_type;
4955 p->fields = constructor_fields;
4956 p->index = constructor_index;
4957 p->max_index = constructor_max_index;
4958 p->unfilled_index = constructor_unfilled_index;
4959 p->unfilled_fields = constructor_unfilled_fields;
4960 p->bit_index = constructor_bit_index;
4961 p->elements = constructor_elements;
4962 p->constant = constructor_constant;
4963 p->simple = constructor_simple;
4964 p->erroneous = constructor_erroneous;
4965 p->pending_elts = constructor_pending_elts;
4966 p->depth = constructor_depth;
4967 p->replacement_value.value = 0;
4968 p->replacement_value.original_code = ERROR_MARK;
4969 p->implicit = implicit;
4971 p->incremental = constructor_incremental;
4972 p->designated = constructor_designated;
4973 p->next = constructor_stack;
4975 constructor_stack = p;
4977 constructor_constant = 1;
4978 constructor_simple = 1;
4979 constructor_depth = SPELLING_DEPTH ();
4980 constructor_elements = 0;
4981 constructor_incremental = 1;
4982 constructor_designated = 0;
4983 constructor_pending_elts = 0;
4986 p->range_stack = constructor_range_stack;
4987 constructor_range_stack = 0;
4988 designator_depth = 0;
4989 designator_errorneous = 0;
4992 /* Don't die if an entire brace-pair level is superfluous
4993 in the containing level. */
4994 if (constructor_type == 0)
4996 else if (TREE_CODE (constructor_type) == RECORD_TYPE
4997 || TREE_CODE (constructor_type) == UNION_TYPE)
4999 /* Don't die if there are extra init elts at the end. */
5000 if (constructor_fields == 0)
5001 constructor_type = 0;
5004 constructor_type = TREE_TYPE (constructor_fields);
5005 push_member_name (constructor_fields);
5006 constructor_depth++;
5009 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5011 constructor_type = TREE_TYPE (constructor_type);
5012 push_array_bounds (tree_low_cst (constructor_index, 0));
5013 constructor_depth++;
5016 if (constructor_type == 0)
5018 error_init ("extra brace group at end of initializer");
5019 constructor_fields = 0;
5020 constructor_unfilled_fields = 0;
5024 if (value && TREE_CODE (value) == CONSTRUCTOR)
5026 constructor_constant = TREE_CONSTANT (value);
5027 constructor_simple = TREE_STATIC (value);
5028 constructor_elements = CONSTRUCTOR_ELTS (value);
5029 if (!VEC_empty (constructor_elt, constructor_elements)
5030 && (TREE_CODE (constructor_type) == RECORD_TYPE
5031 || TREE_CODE (constructor_type) == ARRAY_TYPE))
5032 set_nonincremental_init ();
5035 if (implicit == 1 && warn_missing_braces && !missing_braces_mentioned)
5037 missing_braces_mentioned = 1;
5038 warning_init ("missing braces around initializer");
5041 if (TREE_CODE (constructor_type) == RECORD_TYPE
5042 || TREE_CODE (constructor_type) == UNION_TYPE)
5044 constructor_fields = TYPE_FIELDS (constructor_type);
5045 /* Skip any nameless bit fields at the beginning. */
5046 while (constructor_fields != 0 && DECL_C_BIT_FIELD (constructor_fields)
5047 && DECL_NAME (constructor_fields) == 0)
5048 constructor_fields = TREE_CHAIN (constructor_fields);
5050 constructor_unfilled_fields = constructor_fields;
5051 constructor_bit_index = bitsize_zero_node;
5053 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
5055 /* Vectors are like simple fixed-size arrays. */
5056 constructor_max_index =
5057 build_int_cst (NULL_TREE, TYPE_VECTOR_SUBPARTS (constructor_type) - 1);
5058 constructor_index = convert (bitsizetype, integer_zero_node);
5059 constructor_unfilled_index = constructor_index;
5061 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5063 if (TYPE_DOMAIN (constructor_type))
5065 constructor_max_index
5066 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type));
5068 /* Detect non-empty initializations of zero-length arrays. */
5069 if (constructor_max_index == NULL_TREE
5070 && TYPE_SIZE (constructor_type))
5071 constructor_max_index = build_int_cst (NULL_TREE, -1);
5073 /* constructor_max_index needs to be an INTEGER_CST. Attempts
5074 to initialize VLAs will cause a proper error; avoid tree
5075 checking errors as well by setting a safe value. */
5076 if (constructor_max_index
5077 && TREE_CODE (constructor_max_index) != INTEGER_CST)
5078 constructor_max_index = build_int_cst (NULL_TREE, -1);
5081 = convert (bitsizetype,
5082 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
5085 constructor_index = bitsize_zero_node;
5087 constructor_unfilled_index = constructor_index;
5088 if (value && TREE_CODE (value) == STRING_CST)
5090 /* We need to split the char/wchar array into individual
5091 characters, so that we don't have to special case it
5093 set_nonincremental_init_from_string (value);
5098 if (constructor_type != error_mark_node)
5099 warning_init ("braces around scalar initializer");
5100 constructor_fields = constructor_type;
5101 constructor_unfilled_fields = constructor_type;
5105 /* At the end of an implicit or explicit brace level,
5106 finish up that level of constructor. If a single expression
5107 with redundant braces initialized that level, return the
5108 c_expr structure for that expression. Otherwise, the original_code
5109 element is set to ERROR_MARK.
5110 If we were outputting the elements as they are read, return 0 as the value
5111 from inner levels (process_init_element ignores that),
5112 but return error_mark_node as the value from the outermost level
5113 (that's what we want to put in DECL_INITIAL).
5114 Otherwise, return a CONSTRUCTOR expression as the value. */
5117 pop_init_level (int implicit)
5119 struct constructor_stack *p;
5122 ret.original_code = ERROR_MARK;
5126 /* When we come to an explicit close brace,
5127 pop any inner levels that didn't have explicit braces. */
5128 while (constructor_stack->implicit)
5129 process_init_element (pop_init_level (1));
5131 gcc_assert (!constructor_range_stack);
5134 /* Now output all pending elements. */
5135 constructor_incremental = 1;
5136 output_pending_init_elements (1);
5138 p = constructor_stack;
5140 /* Error for initializing a flexible array member, or a zero-length
5141 array member in an inappropriate context. */
5142 if (constructor_type && constructor_fields
5143 && TREE_CODE (constructor_type) == ARRAY_TYPE
5144 && TYPE_DOMAIN (constructor_type)
5145 && !TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type)))
5147 /* Silently discard empty initializations. The parser will
5148 already have pedwarned for empty brackets. */
5149 if (integer_zerop (constructor_unfilled_index))
5150 constructor_type = NULL_TREE;
5153 gcc_assert (!TYPE_SIZE (constructor_type));
5155 if (constructor_depth > 2)
5156 error_init ("initialization of flexible array member in a nested context");
5158 pedwarn_init ("initialization of a flexible array member");
5160 /* We have already issued an error message for the existence
5161 of a flexible array member not at the end of the structure.
5162 Discard the initializer so that we do not die later. */
5163 if (TREE_CHAIN (constructor_fields) != NULL_TREE)
5164 constructor_type = NULL_TREE;
5168 /* Warn when some struct elements are implicitly initialized to zero. */
5169 if (warn_missing_field_initializers
5171 && TREE_CODE (constructor_type) == RECORD_TYPE
5172 && constructor_unfilled_fields)
5174 /* Do not warn for flexible array members or zero-length arrays. */
5175 while (constructor_unfilled_fields
5176 && (!DECL_SIZE (constructor_unfilled_fields)
5177 || integer_zerop (DECL_SIZE (constructor_unfilled_fields))))
5178 constructor_unfilled_fields = TREE_CHAIN (constructor_unfilled_fields);
5180 /* Do not warn if this level of the initializer uses member
5181 designators; it is likely to be deliberate. */
5182 if (constructor_unfilled_fields && !constructor_designated)
5184 push_member_name (constructor_unfilled_fields);
5185 warning_init ("missing initializer");
5186 RESTORE_SPELLING_DEPTH (constructor_depth);
5190 /* Pad out the end of the structure. */
5191 if (p->replacement_value.value)
5192 /* If this closes a superfluous brace pair,
5193 just pass out the element between them. */
5194 ret = p->replacement_value;
5195 else if (constructor_type == 0)
5197 else if (TREE_CODE (constructor_type) != RECORD_TYPE
5198 && TREE_CODE (constructor_type) != UNION_TYPE
5199 && TREE_CODE (constructor_type) != ARRAY_TYPE
5200 && TREE_CODE (constructor_type) != VECTOR_TYPE)
5202 /* A nonincremental scalar initializer--just return
5203 the element, after verifying there is just one. */
5204 if (VEC_empty (constructor_elt,constructor_elements))
5206 if (!constructor_erroneous)
5207 error_init ("empty scalar initializer");
5208 ret.value = error_mark_node;
5210 else if (VEC_length (constructor_elt,constructor_elements) != 1)
5212 error_init ("extra elements in scalar initializer");
5213 ret.value = VEC_index (constructor_elt,constructor_elements,0)->value;
5216 ret.value = VEC_index (constructor_elt,constructor_elements,0)->value;
5220 if (constructor_erroneous)
5221 ret.value = error_mark_node;
5224 ret.value = build_constructor (constructor_type,
5225 constructor_elements);
5226 if (constructor_constant)
5227 TREE_CONSTANT (ret.value) = TREE_INVARIANT (ret.value) = 1;
5228 if (constructor_constant && constructor_simple)
5229 TREE_STATIC (ret.value) = 1;
5233 constructor_type = p->type;
5234 constructor_fields = p->fields;
5235 constructor_index = p->index;
5236 constructor_max_index = p->max_index;
5237 constructor_unfilled_index = p->unfilled_index;
5238 constructor_unfilled_fields = p->unfilled_fields;
5239 constructor_bit_index = p->bit_index;
5240 constructor_elements = p->elements;
5241 constructor_constant = p->constant;
5242 constructor_simple = p->simple;
5243 constructor_erroneous = p->erroneous;
5244 constructor_incremental = p->incremental;
5245 constructor_designated = p->designated;
5246 constructor_pending_elts = p->pending_elts;
5247 constructor_depth = p->depth;
5249 constructor_range_stack = p->range_stack;
5250 RESTORE_SPELLING_DEPTH (constructor_depth);
5252 constructor_stack = p->next;
5257 if (constructor_stack == 0)
5259 ret.value = error_mark_node;
5267 /* Common handling for both array range and field name designators.
5268 ARRAY argument is nonzero for array ranges. Returns zero for success. */
5271 set_designator (int array)
5274 enum tree_code subcode;
5276 /* Don't die if an entire brace-pair level is superfluous
5277 in the containing level. */
5278 if (constructor_type == 0)
5281 /* If there were errors in this designator list already, bail out
5283 if (designator_errorneous)
5286 if (!designator_depth)
5288 gcc_assert (!constructor_range_stack);
5290 /* Designator list starts at the level of closest explicit
5292 while (constructor_stack->implicit)
5293 process_init_element (pop_init_level (1));
5294 constructor_designated = 1;
5298 switch (TREE_CODE (constructor_type))
5302 subtype = TREE_TYPE (constructor_fields);
5303 if (subtype != error_mark_node)
5304 subtype = TYPE_MAIN_VARIANT (subtype);
5307 subtype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
5313 subcode = TREE_CODE (subtype);
5314 if (array && subcode != ARRAY_TYPE)
5316 error_init ("array index in non-array initializer");
5319 else if (!array && subcode != RECORD_TYPE && subcode != UNION_TYPE)
5321 error_init ("field name not in record or union initializer");
5325 constructor_designated = 1;
5326 push_init_level (2);
5330 /* If there are range designators in designator list, push a new designator
5331 to constructor_range_stack. RANGE_END is end of such stack range or
5332 NULL_TREE if there is no range designator at this level. */
5335 push_range_stack (tree range_end)
5337 struct constructor_range_stack *p;
5339 p = GGC_NEW (struct constructor_range_stack);
5340 p->prev = constructor_range_stack;
5342 p->fields = constructor_fields;
5343 p->range_start = constructor_index;
5344 p->index = constructor_index;
5345 p->stack = constructor_stack;
5346 p->range_end = range_end;
5347 if (constructor_range_stack)
5348 constructor_range_stack->next = p;
5349 constructor_range_stack = p;
5352 /* Within an array initializer, specify the next index to be initialized.
5353 FIRST is that index. If LAST is nonzero, then initialize a range
5354 of indices, running from FIRST through LAST. */
5357 set_init_index (tree first, tree last)
5359 if (set_designator (1))
5362 designator_errorneous = 1;
5364 if (!INTEGRAL_TYPE_P (TREE_TYPE (first))
5365 || (last && !INTEGRAL_TYPE_P (TREE_TYPE (last))))
5367 error_init ("array index in initializer not of integer type");
5371 if (TREE_CODE (first) != INTEGER_CST)
5372 error_init ("nonconstant array index in initializer");
5373 else if (last != 0 && TREE_CODE (last) != INTEGER_CST)
5374 error_init ("nonconstant array index in initializer");
5375 else if (TREE_CODE (constructor_type) != ARRAY_TYPE)
5376 error_init ("array index in non-array initializer");
5377 else if (tree_int_cst_sgn (first) == -1)
5378 error_init ("array index in initializer exceeds array bounds");
5379 else if (constructor_max_index
5380 && tree_int_cst_lt (constructor_max_index, first))
5381 error_init ("array index in initializer exceeds array bounds");
5384 constructor_index = convert (bitsizetype, first);
5388 if (tree_int_cst_equal (first, last))
5390 else if (tree_int_cst_lt (last, first))
5392 error_init ("empty index range in initializer");
5397 last = convert (bitsizetype, last);
5398 if (constructor_max_index != 0
5399 && tree_int_cst_lt (constructor_max_index, last))
5401 error_init ("array index range in initializer exceeds array bounds");
5408 designator_errorneous = 0;
5409 if (constructor_range_stack || last)
5410 push_range_stack (last);
5414 /* Within a struct initializer, specify the next field to be initialized. */
5417 set_init_label (tree fieldname)
5421 if (set_designator (0))
5424 designator_errorneous = 1;
5426 if (TREE_CODE (constructor_type) != RECORD_TYPE
5427 && TREE_CODE (constructor_type) != UNION_TYPE)
5429 error_init ("field name not in record or union initializer");
5433 for (tail = TYPE_FIELDS (constructor_type); tail;
5434 tail = TREE_CHAIN (tail))
5436 if (DECL_NAME (tail) == fieldname)
5441 error ("unknown field %qE specified in initializer", fieldname);
5444 constructor_fields = tail;
5446 designator_errorneous = 0;
5447 if (constructor_range_stack)
5448 push_range_stack (NULL_TREE);
5452 /* Add a new initializer to the tree of pending initializers. PURPOSE
5453 identifies the initializer, either array index or field in a structure.
5454 VALUE is the value of that index or field. */
5457 add_pending_init (tree purpose, tree value)
5459 struct init_node *p, **q, *r;
5461 q = &constructor_pending_elts;
5464 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5469 if (tree_int_cst_lt (purpose, p->purpose))
5471 else if (tree_int_cst_lt (p->purpose, purpose))
5475 if (TREE_SIDE_EFFECTS (p->value))
5476 warning_init ("initialized field with side-effects overwritten");
5486 bitpos = bit_position (purpose);
5490 if (tree_int_cst_lt (bitpos, bit_position (p->purpose)))
5492 else if (p->purpose != purpose)
5496 if (TREE_SIDE_EFFECTS (p->value))
5497 warning_init ("initialized field with side-effects overwritten");
5504 r = GGC_NEW (struct init_node);
5505 r->purpose = purpose;
5516 struct init_node *s;
5520 if (p->balance == 0)
5522 else if (p->balance < 0)
5529 p->left->parent = p;
5546 constructor_pending_elts = r;
5551 struct init_node *t = r->right;
5555 r->right->parent = r;
5560 p->left->parent = p;
5563 p->balance = t->balance < 0;
5564 r->balance = -(t->balance > 0);
5579 constructor_pending_elts = t;
5585 /* p->balance == +1; growth of left side balances the node. */
5590 else /* r == p->right */
5592 if (p->balance == 0)
5593 /* Growth propagation from right side. */
5595 else if (p->balance > 0)
5602 p->right->parent = p;
5619 constructor_pending_elts = r;
5621 else /* r->balance == -1 */
5624 struct init_node *t = r->left;
5628 r->left->parent = r;
5633 p->right->parent = p;
5636 r->balance = (t->balance < 0);
5637 p->balance = -(t->balance > 0);
5652 constructor_pending_elts = t;
5658 /* p->balance == -1; growth of right side balances the node. */
5669 /* Build AVL tree from a sorted chain. */
5672 set_nonincremental_init (void)
5674 unsigned HOST_WIDE_INT ix;
5677 if (TREE_CODE (constructor_type) != RECORD_TYPE
5678 && TREE_CODE (constructor_type) != ARRAY_TYPE)
5681 FOR_EACH_CONSTRUCTOR_ELT (constructor_elements, ix, index, value)
5682 add_pending_init (index, value);
5683 constructor_elements = 0;
5684 if (TREE_CODE (constructor_type) == RECORD_TYPE)
5686 constructor_unfilled_fields = TYPE_FIELDS (constructor_type);
5687 /* Skip any nameless bit fields at the beginning. */
5688 while (constructor_unfilled_fields != 0
5689 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
5690 && DECL_NAME (constructor_unfilled_fields) == 0)
5691 constructor_unfilled_fields = TREE_CHAIN (constructor_unfilled_fields);
5694 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5696 if (TYPE_DOMAIN (constructor_type))
5697 constructor_unfilled_index
5698 = convert (bitsizetype,
5699 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
5701 constructor_unfilled_index = bitsize_zero_node;
5703 constructor_incremental = 0;
5706 /* Build AVL tree from a string constant. */
5709 set_nonincremental_init_from_string (tree str)
5711 tree value, purpose, type;
5712 HOST_WIDE_INT val[2];
5713 const char *p, *end;
5714 int byte, wchar_bytes, charwidth, bitpos;
5716 gcc_assert (TREE_CODE (constructor_type) == ARRAY_TYPE);
5718 if (TYPE_PRECISION (TREE_TYPE (TREE_TYPE (str)))
5719 == TYPE_PRECISION (char_type_node))
5723 gcc_assert (TYPE_PRECISION (TREE_TYPE (TREE_TYPE (str)))
5724 == TYPE_PRECISION (wchar_type_node));
5725 wchar_bytes = TYPE_PRECISION (wchar_type_node) / BITS_PER_UNIT;
5727 charwidth = TYPE_PRECISION (char_type_node);
5728 type = TREE_TYPE (constructor_type);
5729 p = TREE_STRING_POINTER (str);
5730 end = p + TREE_STRING_LENGTH (str);
5732 for (purpose = bitsize_zero_node;
5733 p < end && !tree_int_cst_lt (constructor_max_index, purpose);
5734 purpose = size_binop (PLUS_EXPR, purpose, bitsize_one_node))
5736 if (wchar_bytes == 1)
5738 val[1] = (unsigned char) *p++;
5745 for (byte = 0; byte < wchar_bytes; byte++)
5747 if (BYTES_BIG_ENDIAN)
5748 bitpos = (wchar_bytes - byte - 1) * charwidth;
5750 bitpos = byte * charwidth;
5751 val[bitpos < HOST_BITS_PER_WIDE_INT]
5752 |= ((unsigned HOST_WIDE_INT) ((unsigned char) *p++))
5753 << (bitpos % HOST_BITS_PER_WIDE_INT);
5757 if (!TYPE_UNSIGNED (type))
5759 bitpos = ((wchar_bytes - 1) * charwidth) + HOST_BITS_PER_CHAR;
5760 if (bitpos < HOST_BITS_PER_WIDE_INT)
5762 if (val[1] & (((HOST_WIDE_INT) 1) << (bitpos - 1)))
5764 val[1] |= ((HOST_WIDE_INT) -1) << bitpos;
5768 else if (bitpos == HOST_BITS_PER_WIDE_INT)
5773 else if (val[0] & (((HOST_WIDE_INT) 1)
5774 << (bitpos - 1 - HOST_BITS_PER_WIDE_INT)))
5775 val[0] |= ((HOST_WIDE_INT) -1)
5776 << (bitpos - HOST_BITS_PER_WIDE_INT);
5779 value = build_int_cst_wide (type, val[1], val[0]);
5780 add_pending_init (purpose, value);
5783 constructor_incremental = 0;
5786 /* Return value of FIELD in pending initializer or zero if the field was
5787 not initialized yet. */
5790 find_init_member (tree field)
5792 struct init_node *p;
5794 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5796 if (constructor_incremental
5797 && tree_int_cst_lt (field, constructor_unfilled_index))
5798 set_nonincremental_init ();
5800 p = constructor_pending_elts;
5803 if (tree_int_cst_lt (field, p->purpose))
5805 else if (tree_int_cst_lt (p->purpose, field))
5811 else if (TREE_CODE (constructor_type) == RECORD_TYPE)
5813 tree bitpos = bit_position (field);
5815 if (constructor_incremental
5816 && (!constructor_unfilled_fields
5817 || tree_int_cst_lt (bitpos,
5818 bit_position (constructor_unfilled_fields))))
5819 set_nonincremental_init ();
5821 p = constructor_pending_elts;
5824 if (field == p->purpose)
5826 else if (tree_int_cst_lt (bitpos, bit_position (p->purpose)))
5832 else if (TREE_CODE (constructor_type) == UNION_TYPE)
5834 if (!VEC_empty (constructor_elt, constructor_elements)
5835 && (VEC_last (constructor_elt, constructor_elements)->index
5837 return VEC_last (constructor_elt, constructor_elements)->value;
5842 /* "Output" the next constructor element.
5843 At top level, really output it to assembler code now.
5844 Otherwise, collect it in a list from which we will make a CONSTRUCTOR.
5845 TYPE is the data type that the containing data type wants here.
5846 FIELD is the field (a FIELD_DECL) or the index that this element fills.
5847 If VALUE is a string constant, STRICT_STRING is true if it is
5848 unparenthesized or we should not warn here for it being parenthesized.
5849 For other types of VALUE, STRICT_STRING is not used.
5851 PENDING if non-nil means output pending elements that belong
5852 right after this element. (PENDING is normally 1;
5853 it is 0 while outputting pending elements, to avoid recursion.) */
5856 output_init_element (tree value, bool strict_string, tree type, tree field,
5859 constructor_elt *celt;
5861 if (type == error_mark_node || value == error_mark_node)
5863 constructor_erroneous = 1;
5866 if (TREE_CODE (TREE_TYPE (value)) == ARRAY_TYPE
5867 && (TREE_CODE (value) == STRING_CST
5868 || TREE_CODE (value) == COMPOUND_LITERAL_EXPR)
5869 && !(TREE_CODE (value) == STRING_CST
5870 && TREE_CODE (type) == ARRAY_TYPE
5871 && INTEGRAL_TYPE_P (TREE_TYPE (type)))
5872 && !comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (value)),
5873 TYPE_MAIN_VARIANT (type)))
5874 value = array_to_pointer_conversion (value);
5876 if (TREE_CODE (value) == COMPOUND_LITERAL_EXPR
5877 && require_constant_value && !flag_isoc99 && pending)
5879 /* As an extension, allow initializing objects with static storage
5880 duration with compound literals (which are then treated just as
5881 the brace enclosed list they contain). */
5882 tree decl = COMPOUND_LITERAL_EXPR_DECL (value);
5883 value = DECL_INITIAL (decl);
5886 if (value == error_mark_node)
5887 constructor_erroneous = 1;
5888 else if (!TREE_CONSTANT (value))
5889 constructor_constant = 0;
5890 else if (!initializer_constant_valid_p (value, TREE_TYPE (value))
5891 || ((TREE_CODE (constructor_type) == RECORD_TYPE
5892 || TREE_CODE (constructor_type) == UNION_TYPE)
5893 && DECL_C_BIT_FIELD (field)
5894 && TREE_CODE (value) != INTEGER_CST))
5895 constructor_simple = 0;
5897 if (!initializer_constant_valid_p (value, TREE_TYPE (value)))
5899 if (require_constant_value)
5901 error_init ("initializer element is not constant");
5902 value = error_mark_node;
5904 else if (require_constant_elements)
5905 pedwarn ("initializer element is not computable at load time");
5908 /* If this field is empty (and not at the end of structure),
5909 don't do anything other than checking the initializer. */
5911 && (TREE_TYPE (field) == error_mark_node
5912 || (COMPLETE_TYPE_P (TREE_TYPE (field))
5913 && integer_zerop (TYPE_SIZE (TREE_TYPE (field)))
5914 && (TREE_CODE (constructor_type) == ARRAY_TYPE
5915 || TREE_CHAIN (field)))))
5918 value = digest_init (type, value, strict_string, require_constant_value);
5919 if (value == error_mark_node)
5921 constructor_erroneous = 1;
5925 /* If this element doesn't come next in sequence,
5926 put it on constructor_pending_elts. */
5927 if (TREE_CODE (constructor_type) == ARRAY_TYPE
5928 && (!constructor_incremental
5929 || !tree_int_cst_equal (field, constructor_unfilled_index)))
5931 if (constructor_incremental
5932 && tree_int_cst_lt (field, constructor_unfilled_index))
5933 set_nonincremental_init ();
5935 add_pending_init (field, value);
5938 else if (TREE_CODE (constructor_type) == RECORD_TYPE
5939 && (!constructor_incremental
5940 || field != constructor_unfilled_fields))
5942 /* We do this for records but not for unions. In a union,
5943 no matter which field is specified, it can be initialized
5944 right away since it starts at the beginning of the union. */
5945 if (constructor_incremental)
5947 if (!constructor_unfilled_fields)
5948 set_nonincremental_init ();
5951 tree bitpos, unfillpos;
5953 bitpos = bit_position (field);
5954 unfillpos = bit_position (constructor_unfilled_fields);
5956 if (tree_int_cst_lt (bitpos, unfillpos))
5957 set_nonincremental_init ();
5961 add_pending_init (field, value);
5964 else if (TREE_CODE (constructor_type) == UNION_TYPE
5965 && !VEC_empty (constructor_elt, constructor_elements))
5967 if (TREE_SIDE_EFFECTS (VEC_last (constructor_elt,
5968 constructor_elements)->value))
5969 warning_init ("initialized field with side-effects overwritten");
5971 /* We can have just one union field set. */
5972 constructor_elements = 0;
5975 /* Otherwise, output this element either to
5976 constructor_elements or to the assembler file. */
5978 if (field && TREE_CODE (field) == INTEGER_CST)
5979 field = copy_node (field);
5980 celt = VEC_safe_push (constructor_elt, gc, constructor_elements, NULL);
5981 celt->index = field;
5982 celt->value = value;
5984 /* Advance the variable that indicates sequential elements output. */
5985 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5986 constructor_unfilled_index
5987 = size_binop (PLUS_EXPR, constructor_unfilled_index,
5989 else if (TREE_CODE (constructor_type) == RECORD_TYPE)
5991 constructor_unfilled_fields
5992 = TREE_CHAIN (constructor_unfilled_fields);
5994 /* Skip any nameless bit fields. */
5995 while (constructor_unfilled_fields != 0
5996 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
5997 && DECL_NAME (constructor_unfilled_fields) == 0)
5998 constructor_unfilled_fields =
5999 TREE_CHAIN (constructor_unfilled_fields);
6001 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6002 constructor_unfilled_fields = 0;
6004 /* Now output any pending elements which have become next. */
6006 output_pending_init_elements (0);
6009 /* Output any pending elements which have become next.
6010 As we output elements, constructor_unfilled_{fields,index}
6011 advances, which may cause other elements to become next;
6012 if so, they too are output.
6014 If ALL is 0, we return when there are
6015 no more pending elements to output now.
6017 If ALL is 1, we output space as necessary so that
6018 we can output all the pending elements. */
6021 output_pending_init_elements (int all)
6023 struct init_node *elt = constructor_pending_elts;
6028 /* Look through the whole pending tree.
6029 If we find an element that should be output now,
6030 output it. Otherwise, set NEXT to the element
6031 that comes first among those still pending. */
6036 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6038 if (tree_int_cst_equal (elt->purpose,
6039 constructor_unfilled_index))
6040 output_init_element (elt->value, true,
6041 TREE_TYPE (constructor_type),
6042 constructor_unfilled_index, 0);
6043 else if (tree_int_cst_lt (constructor_unfilled_index,
6046 /* Advance to the next smaller node. */
6051 /* We have reached the smallest node bigger than the
6052 current unfilled index. Fill the space first. */
6053 next = elt->purpose;
6059 /* Advance to the next bigger node. */
6064 /* We have reached the biggest node in a subtree. Find
6065 the parent of it, which is the next bigger node. */
6066 while (elt->parent && elt->parent->right == elt)
6069 if (elt && tree_int_cst_lt (constructor_unfilled_index,
6072 next = elt->purpose;
6078 else if (TREE_CODE (constructor_type) == RECORD_TYPE
6079 || TREE_CODE (constructor_type) == UNION_TYPE)
6081 tree ctor_unfilled_bitpos, elt_bitpos;
6083 /* If the current record is complete we are done. */
6084 if (constructor_unfilled_fields == 0)
6087 ctor_unfilled_bitpos = bit_position (constructor_unfilled_fields);
6088 elt_bitpos = bit_position (elt->purpose);
6089 /* We can't compare fields here because there might be empty
6090 fields in between. */
6091 if (tree_int_cst_equal (elt_bitpos, ctor_unfilled_bitpos))
6093 constructor_unfilled_fields = elt->purpose;
6094 output_init_element (elt->value, true, TREE_TYPE (elt->purpose),
6097 else if (tree_int_cst_lt (ctor_unfilled_bitpos, elt_bitpos))
6099 /* Advance to the next smaller node. */
6104 /* We have reached the smallest node bigger than the
6105 current unfilled field. Fill the space first. */
6106 next = elt->purpose;
6112 /* Advance to the next bigger node. */
6117 /* We have reached the biggest node in a subtree. Find
6118 the parent of it, which is the next bigger node. */
6119 while (elt->parent && elt->parent->right == elt)
6123 && (tree_int_cst_lt (ctor_unfilled_bitpos,
6124 bit_position (elt->purpose))))
6126 next = elt->purpose;
6134 /* Ordinarily return, but not if we want to output all
6135 and there are elements left. */
6136 if (!(all && next != 0))
6139 /* If it's not incremental, just skip over the gap, so that after
6140 jumping to retry we will output the next successive element. */
6141 if (TREE_CODE (constructor_type) == RECORD_TYPE
6142 || TREE_CODE (constructor_type) == UNION_TYPE)
6143 constructor_unfilled_fields = next;
6144 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6145 constructor_unfilled_index = next;
6147 /* ELT now points to the node in the pending tree with the next
6148 initializer to output. */
6152 /* Add one non-braced element to the current constructor level.
6153 This adjusts the current position within the constructor's type.
6154 This may also start or terminate implicit levels
6155 to handle a partly-braced initializer.
6157 Once this has found the correct level for the new element,
6158 it calls output_init_element. */
6161 process_init_element (struct c_expr value)
6163 tree orig_value = value.value;
6164 int string_flag = orig_value != 0 && TREE_CODE (orig_value) == STRING_CST;
6165 bool strict_string = value.original_code == STRING_CST;
6167 designator_depth = 0;
6168 designator_errorneous = 0;
6170 /* Handle superfluous braces around string cst as in
6171 char x[] = {"foo"}; */
6174 && TREE_CODE (constructor_type) == ARRAY_TYPE
6175 && INTEGRAL_TYPE_P (TREE_TYPE (constructor_type))
6176 && integer_zerop (constructor_unfilled_index))
6178 if (constructor_stack->replacement_value.value)
6179 error_init ("excess elements in char array initializer");
6180 constructor_stack->replacement_value = value;
6184 if (constructor_stack->replacement_value.value != 0)
6186 error_init ("excess elements in struct initializer");
6190 /* Ignore elements of a brace group if it is entirely superfluous
6191 and has already been diagnosed. */
6192 if (constructor_type == 0)
6195 /* If we've exhausted any levels that didn't have braces,
6197 while (constructor_stack->implicit)
6199 if ((TREE_CODE (constructor_type) == RECORD_TYPE
6200 || TREE_CODE (constructor_type) == UNION_TYPE)
6201 && constructor_fields == 0)
6202 process_init_element (pop_init_level (1));
6203 else if (TREE_CODE (constructor_type) == ARRAY_TYPE
6204 && (constructor_max_index == 0
6205 || tree_int_cst_lt (constructor_max_index,
6206 constructor_index)))
6207 process_init_element (pop_init_level (1));
6212 /* In the case of [LO ... HI] = VALUE, only evaluate VALUE once. */
6213 if (constructor_range_stack)
6215 /* If value is a compound literal and we'll be just using its
6216 content, don't put it into a SAVE_EXPR. */
6217 if (TREE_CODE (value.value) != COMPOUND_LITERAL_EXPR
6218 || !require_constant_value
6220 value.value = save_expr (value.value);
6225 if (TREE_CODE (constructor_type) == RECORD_TYPE)
6228 enum tree_code fieldcode;
6230 if (constructor_fields == 0)
6232 pedwarn_init ("excess elements in struct initializer");
6236 fieldtype = TREE_TYPE (constructor_fields);
6237 if (fieldtype != error_mark_node)
6238 fieldtype = TYPE_MAIN_VARIANT (fieldtype);
6239 fieldcode = TREE_CODE (fieldtype);
6241 /* Error for non-static initialization of a flexible array member. */
6242 if (fieldcode == ARRAY_TYPE
6243 && !require_constant_value
6244 && TYPE_SIZE (fieldtype) == NULL_TREE
6245 && TREE_CHAIN (constructor_fields) == NULL_TREE)
6247 error_init ("non-static initialization of a flexible array member");
6251 /* Accept a string constant to initialize a subarray. */
6252 if (value.value != 0
6253 && fieldcode == ARRAY_TYPE
6254 && INTEGRAL_TYPE_P (TREE_TYPE (fieldtype))
6256 value.value = orig_value;
6257 /* Otherwise, if we have come to a subaggregate,
6258 and we don't have an element of its type, push into it. */
6259 else if (value.value != 0
6260 && value.value != error_mark_node
6261 && TYPE_MAIN_VARIANT (TREE_TYPE (value.value)) != fieldtype
6262 && (fieldcode == RECORD_TYPE || fieldcode == ARRAY_TYPE
6263 || fieldcode == UNION_TYPE))
6265 push_init_level (1);
6271 push_member_name (constructor_fields);
6272 output_init_element (value.value, strict_string,
6273 fieldtype, constructor_fields, 1);
6274 RESTORE_SPELLING_DEPTH (constructor_depth);
6277 /* Do the bookkeeping for an element that was
6278 directly output as a constructor. */
6280 /* For a record, keep track of end position of last field. */
6281 if (DECL_SIZE (constructor_fields))
6282 constructor_bit_index
6283 = size_binop (PLUS_EXPR,
6284 bit_position (constructor_fields),
6285 DECL_SIZE (constructor_fields));
6287 /* If the current field was the first one not yet written out,
6288 it isn't now, so update. */
6289 if (constructor_unfilled_fields == constructor_fields)
6291 constructor_unfilled_fields = TREE_CHAIN (constructor_fields);
6292 /* Skip any nameless bit fields. */
6293 while (constructor_unfilled_fields != 0
6294 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
6295 && DECL_NAME (constructor_unfilled_fields) == 0)
6296 constructor_unfilled_fields =
6297 TREE_CHAIN (constructor_unfilled_fields);
6301 constructor_fields = TREE_CHAIN (constructor_fields);
6302 /* Skip any nameless bit fields at the beginning. */
6303 while (constructor_fields != 0
6304 && DECL_C_BIT_FIELD (constructor_fields)
6305 && DECL_NAME (constructor_fields) == 0)
6306 constructor_fields = TREE_CHAIN (constructor_fields);
6308 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6311 enum tree_code fieldcode;
6313 if (constructor_fields == 0)
6315 pedwarn_init ("excess elements in union initializer");
6319 fieldtype = TREE_TYPE (constructor_fields);
6320 if (fieldtype != error_mark_node)
6321 fieldtype = TYPE_MAIN_VARIANT (fieldtype);
6322 fieldcode = TREE_CODE (fieldtype);
6324 /* Warn that traditional C rejects initialization of unions.
6325 We skip the warning if the value is zero. This is done
6326 under the assumption that the zero initializer in user
6327 code appears conditioned on e.g. __STDC__ to avoid
6328 "missing initializer" warnings and relies on default
6329 initialization to zero in the traditional C case.
6330 We also skip the warning if the initializer is designated,
6331 again on the assumption that this must be conditional on
6332 __STDC__ anyway (and we've already complained about the
6333 member-designator already). */
6334 if (!in_system_header && !constructor_designated
6335 && !(value.value && (integer_zerop (value.value)
6336 || real_zerop (value.value))))
6337 warning (OPT_Wtraditional, "traditional C rejects initialization "
6340 /* Accept a string constant to initialize a subarray. */
6341 if (value.value != 0
6342 && fieldcode == ARRAY_TYPE
6343 && INTEGRAL_TYPE_P (TREE_TYPE (fieldtype))
6345 value.value = orig_value;
6346 /* Otherwise, if we have come to a subaggregate,
6347 and we don't have an element of its type, push into it. */
6348 else if (value.value != 0
6349 && value.value != error_mark_node
6350 && TYPE_MAIN_VARIANT (TREE_TYPE (value.value)) != fieldtype
6351 && (fieldcode == RECORD_TYPE || fieldcode == ARRAY_TYPE
6352 || fieldcode == UNION_TYPE))
6354 push_init_level (1);
6360 push_member_name (constructor_fields);
6361 output_init_element (value.value, strict_string,
6362 fieldtype, constructor_fields, 1);
6363 RESTORE_SPELLING_DEPTH (constructor_depth);
6366 /* Do the bookkeeping for an element that was
6367 directly output as a constructor. */
6369 constructor_bit_index = DECL_SIZE (constructor_fields);
6370 constructor_unfilled_fields = TREE_CHAIN (constructor_fields);
6373 constructor_fields = 0;
6375 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6377 tree elttype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
6378 enum tree_code eltcode = TREE_CODE (elttype);
6380 /* Accept a string constant to initialize a subarray. */
6381 if (value.value != 0
6382 && eltcode == ARRAY_TYPE
6383 && INTEGRAL_TYPE_P (TREE_TYPE (elttype))
6385 value.value = orig_value;
6386 /* Otherwise, if we have come to a subaggregate,
6387 and we don't have an element of its type, push into it. */
6388 else if (value.value != 0
6389 && value.value != error_mark_node
6390 && TYPE_MAIN_VARIANT (TREE_TYPE (value.value)) != elttype
6391 && (eltcode == RECORD_TYPE || eltcode == ARRAY_TYPE
6392 || eltcode == UNION_TYPE))
6394 push_init_level (1);
6398 if (constructor_max_index != 0
6399 && (tree_int_cst_lt (constructor_max_index, constructor_index)
6400 || integer_all_onesp (constructor_max_index)))
6402 pedwarn_init ("excess elements in array initializer");
6406 /* Now output the actual element. */
6409 push_array_bounds (tree_low_cst (constructor_index, 0));
6410 output_init_element (value.value, strict_string,
6411 elttype, constructor_index, 1);
6412 RESTORE_SPELLING_DEPTH (constructor_depth);
6416 = size_binop (PLUS_EXPR, constructor_index, bitsize_one_node);
6419 /* If we are doing the bookkeeping for an element that was
6420 directly output as a constructor, we must update
6421 constructor_unfilled_index. */
6422 constructor_unfilled_index = constructor_index;
6424 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
6426 tree elttype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
6428 /* Do a basic check of initializer size. Note that vectors
6429 always have a fixed size derived from their type. */
6430 if (tree_int_cst_lt (constructor_max_index, constructor_index))
6432 pedwarn_init ("excess elements in vector initializer");
6436 /* Now output the actual element. */
6438 output_init_element (value.value, strict_string,
6439 elttype, constructor_index, 1);
6442 = size_binop (PLUS_EXPR, constructor_index, bitsize_one_node);
6445 /* If we are doing the bookkeeping for an element that was
6446 directly output as a constructor, we must update
6447 constructor_unfilled_index. */
6448 constructor_unfilled_index = constructor_index;
6451 /* Handle the sole element allowed in a braced initializer
6452 for a scalar variable. */
6453 else if (constructor_type != error_mark_node
6454 && constructor_fields == 0)
6456 pedwarn_init ("excess elements in scalar initializer");
6462 output_init_element (value.value, strict_string,
6463 constructor_type, NULL_TREE, 1);
6464 constructor_fields = 0;
6467 /* Handle range initializers either at this level or anywhere higher
6468 in the designator stack. */
6469 if (constructor_range_stack)
6471 struct constructor_range_stack *p, *range_stack;
6474 range_stack = constructor_range_stack;
6475 constructor_range_stack = 0;
6476 while (constructor_stack != range_stack->stack)
6478 gcc_assert (constructor_stack->implicit);
6479 process_init_element (pop_init_level (1));
6481 for (p = range_stack;
6482 !p->range_end || tree_int_cst_equal (p->index, p->range_end);
6485 gcc_assert (constructor_stack->implicit);
6486 process_init_element (pop_init_level (1));
6489 p->index = size_binop (PLUS_EXPR, p->index, bitsize_one_node);
6490 if (tree_int_cst_equal (p->index, p->range_end) && !p->prev)
6495 constructor_index = p->index;
6496 constructor_fields = p->fields;
6497 if (finish && p->range_end && p->index == p->range_start)
6505 push_init_level (2);
6506 p->stack = constructor_stack;
6507 if (p->range_end && tree_int_cst_equal (p->index, p->range_end))
6508 p->index = p->range_start;
6512 constructor_range_stack = range_stack;
6519 constructor_range_stack = 0;
6522 /* Build a complete asm-statement, whose components are a CV_QUALIFIER
6523 (guaranteed to be 'volatile' or null) and ARGS (represented using
6524 an ASM_EXPR node). */
6526 build_asm_stmt (tree cv_qualifier, tree args)
6528 if (!ASM_VOLATILE_P (args) && cv_qualifier)
6529 ASM_VOLATILE_P (args) = 1;
6530 return add_stmt (args);
6533 /* Build an asm-expr, whose components are a STRING, some OUTPUTS,
6534 some INPUTS, and some CLOBBERS. The latter three may be NULL.
6535 SIMPLE indicates whether there was anything at all after the
6536 string in the asm expression -- asm("blah") and asm("blah" : )
6537 are subtly different. We use a ASM_EXPR node to represent this. */
6539 build_asm_expr (tree string, tree outputs, tree inputs, tree clobbers,
6545 const char *constraint;
6546 const char **oconstraints;
6547 bool allows_mem, allows_reg, is_inout;
6548 int ninputs, noutputs;
6550 ninputs = list_length (inputs);
6551 noutputs = list_length (outputs);
6552 oconstraints = (const char **) alloca (noutputs * sizeof (const char *));
6554 string = resolve_asm_operand_names (string, outputs, inputs);
6556 /* Remove output conversions that change the type but not the mode. */
6557 for (i = 0, tail = outputs; tail; ++i, tail = TREE_CHAIN (tail))
6559 tree output = TREE_VALUE (tail);
6561 /* ??? Really, this should not be here. Users should be using a
6562 proper lvalue, dammit. But there's a long history of using casts
6563 in the output operands. In cases like longlong.h, this becomes a
6564 primitive form of typechecking -- if the cast can be removed, then
6565 the output operand had a type of the proper width; otherwise we'll
6566 get an error. Gross, but ... */
6567 STRIP_NOPS (output);
6569 if (!lvalue_or_else (output, lv_asm))
6570 output = error_mark_node;
6572 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
6573 oconstraints[i] = constraint;
6575 if (parse_output_constraint (&constraint, i, ninputs, noutputs,
6576 &allows_mem, &allows_reg, &is_inout))
6578 /* If the operand is going to end up in memory,
6579 mark it addressable. */
6580 if (!allows_reg && !c_mark_addressable (output))
6581 output = error_mark_node;
6584 output = error_mark_node;
6586 TREE_VALUE (tail) = output;
6589 for (i = 0, tail = inputs; tail; ++i, tail = TREE_CHAIN (tail))
6593 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
6594 input = TREE_VALUE (tail);
6596 if (parse_input_constraint (&constraint, i, ninputs, noutputs, 0,
6597 oconstraints, &allows_mem, &allows_reg))
6599 /* If the operand is going to end up in memory,
6600 mark it addressable. */
6601 if (!allows_reg && allows_mem)
6603 /* Strip the nops as we allow this case. FIXME, this really
6604 should be rejected or made deprecated. */
6606 if (!c_mark_addressable (input))
6607 input = error_mark_node;
6611 input = error_mark_node;
6613 TREE_VALUE (tail) = input;
6616 args = build_stmt (ASM_EXPR, string, outputs, inputs, clobbers);
6618 /* Simple asm statements are treated as volatile. */
6621 ASM_VOLATILE_P (args) = 1;
6622 ASM_INPUT_P (args) = 1;
6628 /* Generate a goto statement to LABEL. */
6631 c_finish_goto_label (tree label)
6633 tree decl = lookup_label (label);
6637 if (C_DECL_UNJUMPABLE_STMT_EXPR (decl))
6639 error ("jump into statement expression");
6643 if (C_DECL_UNJUMPABLE_VM (decl))
6645 error ("jump into scope of identifier with variably modified type");
6649 if (!C_DECL_UNDEFINABLE_STMT_EXPR (decl))
6651 /* No jump from outside this statement expression context, so
6652 record that there is a jump from within this context. */
6653 struct c_label_list *nlist;
6654 nlist = XOBNEW (&parser_obstack, struct c_label_list);
6655 nlist->next = label_context_stack_se->labels_used;
6656 nlist->label = decl;
6657 label_context_stack_se->labels_used = nlist;
6660 if (!C_DECL_UNDEFINABLE_VM (decl))
6662 /* No jump from outside this context context of identifiers with
6663 variably modified type, so record that there is a jump from
6664 within this context. */
6665 struct c_label_list *nlist;
6666 nlist = XOBNEW (&parser_obstack, struct c_label_list);
6667 nlist->next = label_context_stack_vm->labels_used;
6668 nlist->label = decl;
6669 label_context_stack_vm->labels_used = nlist;
6672 TREE_USED (decl) = 1;
6673 return add_stmt (build1 (GOTO_EXPR, void_type_node, decl));
6676 /* Generate a computed goto statement to EXPR. */
6679 c_finish_goto_ptr (tree expr)
6682 pedwarn ("ISO C forbids %<goto *expr;%>");
6683 expr = convert (ptr_type_node, expr);
6684 return add_stmt (build1 (GOTO_EXPR, void_type_node, expr));
6687 /* Generate a C `return' statement. RETVAL is the expression for what
6688 to return, or a null pointer for `return;' with no value. */
6691 c_finish_return (tree retval)
6693 tree valtype = TREE_TYPE (TREE_TYPE (current_function_decl));
6695 if (TREE_THIS_VOLATILE (current_function_decl))
6696 warning (0, "function declared %<noreturn%> has a %<return%> statement");
6700 current_function_returns_null = 1;
6701 if ((warn_return_type || flag_isoc99)
6702 && valtype != 0 && TREE_CODE (valtype) != VOID_TYPE)
6703 pedwarn_c99 ("%<return%> with no value, in "
6704 "function returning non-void");
6706 else if (valtype == 0 || TREE_CODE (valtype) == VOID_TYPE)
6708 current_function_returns_null = 1;
6709 if (pedantic || TREE_CODE (TREE_TYPE (retval)) != VOID_TYPE)
6710 pedwarn ("%<return%> with a value, in function returning void");
6714 tree t = convert_for_assignment (valtype, retval, ic_return,
6715 NULL_TREE, NULL_TREE, 0);
6716 tree res = DECL_RESULT (current_function_decl);
6719 current_function_returns_value = 1;
6720 if (t == error_mark_node)
6723 inner = t = convert (TREE_TYPE (res), t);
6725 /* Strip any conversions, additions, and subtractions, and see if
6726 we are returning the address of a local variable. Warn if so. */
6729 switch (TREE_CODE (inner))
6731 case NOP_EXPR: case NON_LVALUE_EXPR: case CONVERT_EXPR:
6733 inner = TREE_OPERAND (inner, 0);
6737 /* If the second operand of the MINUS_EXPR has a pointer
6738 type (or is converted from it), this may be valid, so
6739 don't give a warning. */
6741 tree op1 = TREE_OPERAND (inner, 1);
6743 while (!POINTER_TYPE_P (TREE_TYPE (op1))
6744 && (TREE_CODE (op1) == NOP_EXPR
6745 || TREE_CODE (op1) == NON_LVALUE_EXPR
6746 || TREE_CODE (op1) == CONVERT_EXPR))
6747 op1 = TREE_OPERAND (op1, 0);
6749 if (POINTER_TYPE_P (TREE_TYPE (op1)))
6752 inner = TREE_OPERAND (inner, 0);
6757 inner = TREE_OPERAND (inner, 0);
6759 while (REFERENCE_CLASS_P (inner)
6760 && TREE_CODE (inner) != INDIRECT_REF)
6761 inner = TREE_OPERAND (inner, 0);
6764 && !DECL_EXTERNAL (inner)
6765 && !TREE_STATIC (inner)
6766 && DECL_CONTEXT (inner) == current_function_decl)
6767 warning (0, "function returns address of local variable");
6777 retval = build2 (MODIFY_EXPR, TREE_TYPE (res), res, t);
6780 return add_stmt (build_stmt (RETURN_EXPR, retval));
6784 /* The SWITCH_EXPR being built. */
6787 /* The original type of the testing expression, i.e. before the
6788 default conversion is applied. */
6791 /* A splay-tree mapping the low element of a case range to the high
6792 element, or NULL_TREE if there is no high element. Used to
6793 determine whether or not a new case label duplicates an old case
6794 label. We need a tree, rather than simply a hash table, because
6795 of the GNU case range extension. */
6798 /* Number of nested statement expressions within this switch
6799 statement; if nonzero, case and default labels may not
6801 unsigned int blocked_stmt_expr;
6803 /* Scope of outermost declarations of identifiers with variably
6804 modified type within this switch statement; if nonzero, case and
6805 default labels may not appear. */
6806 unsigned int blocked_vm;
6808 /* The next node on the stack. */
6809 struct c_switch *next;
6812 /* A stack of the currently active switch statements. The innermost
6813 switch statement is on the top of the stack. There is no need to
6814 mark the stack for garbage collection because it is only active
6815 during the processing of the body of a function, and we never
6816 collect at that point. */
6818 struct c_switch *c_switch_stack;
6820 /* Start a C switch statement, testing expression EXP. Return the new
6824 c_start_case (tree exp)
6826 enum tree_code code;
6827 tree type, orig_type = error_mark_node;
6828 struct c_switch *cs;
6830 if (exp != error_mark_node)
6832 code = TREE_CODE (TREE_TYPE (exp));
6833 orig_type = TREE_TYPE (exp);
6835 if (!INTEGRAL_TYPE_P (orig_type)
6836 && code != ERROR_MARK)
6838 error ("switch quantity not an integer");
6839 exp = integer_zero_node;
6840 orig_type = error_mark_node;
6844 type = TYPE_MAIN_VARIANT (TREE_TYPE (exp));
6846 if (!in_system_header
6847 && (type == long_integer_type_node
6848 || type == long_unsigned_type_node))
6849 warning (OPT_Wtraditional, "%<long%> switch expression not "
6850 "converted to %<int%> in ISO C");
6852 exp = default_conversion (exp);
6853 type = TREE_TYPE (exp);
6857 /* Add this new SWITCH_EXPR to the stack. */
6858 cs = XNEW (struct c_switch);
6859 cs->switch_expr = build3 (SWITCH_EXPR, orig_type, exp, NULL_TREE, NULL_TREE);
6860 cs->orig_type = orig_type;
6861 cs->cases = splay_tree_new (case_compare, NULL, NULL);
6862 cs->blocked_stmt_expr = 0;
6864 cs->next = c_switch_stack;
6865 c_switch_stack = cs;
6867 return add_stmt (cs->switch_expr);
6870 /* Process a case label. */
6873 do_case (tree low_value, tree high_value)
6875 tree label = NULL_TREE;
6877 if (c_switch_stack && !c_switch_stack->blocked_stmt_expr
6878 && !c_switch_stack->blocked_vm)
6880 label = c_add_case_label (c_switch_stack->cases,
6881 SWITCH_COND (c_switch_stack->switch_expr),
6882 c_switch_stack->orig_type,
6883 low_value, high_value);
6884 if (label == error_mark_node)
6887 else if (c_switch_stack && c_switch_stack->blocked_stmt_expr)
6890 error ("case label in statement expression not containing "
6891 "enclosing switch statement");
6893 error ("%<default%> label in statement expression not containing "
6894 "enclosing switch statement");
6896 else if (c_switch_stack && c_switch_stack->blocked_vm)
6899 error ("case label in scope of identifier with variably modified "
6900 "type not containing enclosing switch statement");
6902 error ("%<default%> label in scope of identifier with variably "
6903 "modified type not containing enclosing switch statement");
6906 error ("case label not within a switch statement");
6908 error ("%<default%> label not within a switch statement");
6913 /* Finish the switch statement. */
6916 c_finish_case (tree body)
6918 struct c_switch *cs = c_switch_stack;
6919 location_t switch_location;
6921 SWITCH_BODY (cs->switch_expr) = body;
6923 /* We must not be within a statement expression nested in the switch
6924 at this point; we might, however, be within the scope of an
6925 identifier with variably modified type nested in the switch. */
6926 gcc_assert (!cs->blocked_stmt_expr);
6928 /* Emit warnings as needed. */
6929 if (EXPR_HAS_LOCATION (cs->switch_expr))
6930 switch_location = EXPR_LOCATION (cs->switch_expr);
6932 switch_location = input_location;
6933 c_do_switch_warnings (cs->cases, switch_location,
6934 TREE_TYPE (cs->switch_expr),
6935 SWITCH_COND (cs->switch_expr));
6937 /* Pop the stack. */
6938 c_switch_stack = cs->next;
6939 splay_tree_delete (cs->cases);
6943 /* Emit an if statement. IF_LOCUS is the location of the 'if'. COND,
6944 THEN_BLOCK and ELSE_BLOCK are expressions to be used; ELSE_BLOCK
6945 may be null. NESTED_IF is true if THEN_BLOCK contains another IF
6946 statement, and was not surrounded with parenthesis. */
6949 c_finish_if_stmt (location_t if_locus, tree cond, tree then_block,
6950 tree else_block, bool nested_if)
6954 /* Diagnose an ambiguous else if if-then-else is nested inside if-then. */
6955 if (warn_parentheses && nested_if && else_block == NULL)
6957 tree inner_if = then_block;
6959 /* We know from the grammar productions that there is an IF nested
6960 within THEN_BLOCK. Due to labels and c99 conditional declarations,
6961 it might not be exactly THEN_BLOCK, but should be the last
6962 non-container statement within. */
6964 switch (TREE_CODE (inner_if))
6969 inner_if = BIND_EXPR_BODY (inner_if);
6971 case STATEMENT_LIST:
6972 inner_if = expr_last (then_block);
6974 case TRY_FINALLY_EXPR:
6975 case TRY_CATCH_EXPR:
6976 inner_if = TREE_OPERAND (inner_if, 0);
6983 if (COND_EXPR_ELSE (inner_if))
6984 warning (0, "%Hsuggest explicit braces to avoid ambiguous %<else%>",
6988 /* Diagnose ";" via the special empty statement node that we create. */
6991 if (TREE_CODE (then_block) == NOP_EXPR && !TREE_TYPE (then_block))
6994 warning (0, "%Hempty body in an if-statement",
6995 EXPR_LOCUS (then_block));
6996 then_block = alloc_stmt_list ();
6999 && TREE_CODE (else_block) == NOP_EXPR
7000 && !TREE_TYPE (else_block))
7002 warning (0, "%Hempty body in an else-statement",
7003 EXPR_LOCUS (else_block));
7004 else_block = alloc_stmt_list ();
7008 stmt = build3 (COND_EXPR, void_type_node, cond, then_block, else_block);
7009 SET_EXPR_LOCATION (stmt, if_locus);
7013 /* Emit a general-purpose loop construct. START_LOCUS is the location of
7014 the beginning of the loop. COND is the loop condition. COND_IS_FIRST
7015 is false for DO loops. INCR is the FOR increment expression. BODY is
7016 the statement controlled by the loop. BLAB is the break label. CLAB is
7017 the continue label. Everything is allowed to be NULL. */
7020 c_finish_loop (location_t start_locus, tree cond, tree incr, tree body,
7021 tree blab, tree clab, bool cond_is_first)
7023 tree entry = NULL, exit = NULL, t;
7025 /* If the condition is zero don't generate a loop construct. */
7026 if (cond && integer_zerop (cond))
7030 t = build_and_jump (&blab);
7031 SET_EXPR_LOCATION (t, start_locus);
7037 tree top = build1 (LABEL_EXPR, void_type_node, NULL_TREE);
7039 /* If we have an exit condition, then we build an IF with gotos either
7040 out of the loop, or to the top of it. If there's no exit condition,
7041 then we just build a jump back to the top. */
7042 exit = build_and_jump (&LABEL_EXPR_LABEL (top));
7044 if (cond && !integer_nonzerop (cond))
7046 /* Canonicalize the loop condition to the end. This means
7047 generating a branch to the loop condition. Reuse the
7048 continue label, if possible. */
7053 entry = build1 (LABEL_EXPR, void_type_node, NULL_TREE);
7054 t = build_and_jump (&LABEL_EXPR_LABEL (entry));
7057 t = build1 (GOTO_EXPR, void_type_node, clab);
7058 SET_EXPR_LOCATION (t, start_locus);
7062 t = build_and_jump (&blab);
7063 exit = build3 (COND_EXPR, void_type_node, cond, exit, t);
7066 SET_EXPR_LOCATION (exit, start_locus);
7068 SET_EXPR_LOCATION (exit, input_location);
7077 add_stmt (build1 (LABEL_EXPR, void_type_node, clab));
7085 add_stmt (build1 (LABEL_EXPR, void_type_node, blab));
7089 c_finish_bc_stmt (tree *label_p, bool is_break)
7092 tree label = *label_p;
7094 /* In switch statements break is sometimes stylistically used after
7095 a return statement. This can lead to spurious warnings about
7096 control reaching the end of a non-void function when it is
7097 inlined. Note that we are calling block_may_fallthru with
7098 language specific tree nodes; this works because
7099 block_may_fallthru returns true when given something it does not
7101 skip = !block_may_fallthru (cur_stmt_list);
7106 *label_p = label = create_artificial_label ();
7108 else if (TREE_CODE (label) != LABEL_DECL)
7111 error ("break statement not within loop or switch");
7113 error ("continue statement not within a loop");
7120 return add_stmt (build1 (GOTO_EXPR, void_type_node, label));
7123 /* A helper routine for c_process_expr_stmt and c_finish_stmt_expr. */
7126 emit_side_effect_warnings (tree expr)
7128 if (expr == error_mark_node)
7130 else if (!TREE_SIDE_EFFECTS (expr))
7132 if (!VOID_TYPE_P (TREE_TYPE (expr)) && !TREE_NO_WARNING (expr))
7133 warning (0, "%Hstatement with no effect",
7134 EXPR_HAS_LOCATION (expr) ? EXPR_LOCUS (expr) : &input_location);
7136 else if (warn_unused_value)
7137 warn_if_unused_value (expr, input_location);
7140 /* Process an expression as if it were a complete statement. Emit
7141 diagnostics, but do not call ADD_STMT. */
7144 c_process_expr_stmt (tree expr)
7149 if (warn_sequence_point)
7150 verify_sequence_points (expr);
7152 if (TREE_TYPE (expr) != error_mark_node
7153 && !COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (expr))
7154 && TREE_CODE (TREE_TYPE (expr)) != ARRAY_TYPE)
7155 error ("expression statement has incomplete type");
7157 /* If we're not processing a statement expression, warn about unused values.
7158 Warnings for statement expressions will be emitted later, once we figure
7159 out which is the result. */
7160 if (!STATEMENT_LIST_STMT_EXPR (cur_stmt_list)
7161 && (extra_warnings || warn_unused_value))
7162 emit_side_effect_warnings (expr);
7164 /* If the expression is not of a type to which we cannot assign a line
7165 number, wrap the thing in a no-op NOP_EXPR. */
7166 if (DECL_P (expr) || CONSTANT_CLASS_P (expr))
7167 expr = build1 (NOP_EXPR, TREE_TYPE (expr), expr);
7170 SET_EXPR_LOCATION (expr, input_location);
7175 /* Emit an expression as a statement. */
7178 c_finish_expr_stmt (tree expr)
7181 return add_stmt (c_process_expr_stmt (expr));
7186 /* Do the opposite and emit a statement as an expression. To begin,
7187 create a new binding level and return it. */
7190 c_begin_stmt_expr (void)
7193 struct c_label_context_se *nstack;
7194 struct c_label_list *glist;
7196 /* We must force a BLOCK for this level so that, if it is not expanded
7197 later, there is a way to turn off the entire subtree of blocks that
7198 are contained in it. */
7200 ret = c_begin_compound_stmt (true);
7203 c_switch_stack->blocked_stmt_expr++;
7204 gcc_assert (c_switch_stack->blocked_stmt_expr != 0);
7206 for (glist = label_context_stack_se->labels_used;
7208 glist = glist->next)
7210 C_DECL_UNDEFINABLE_STMT_EXPR (glist->label) = 1;
7212 nstack = XOBNEW (&parser_obstack, struct c_label_context_se);
7213 nstack->labels_def = NULL;
7214 nstack->labels_used = NULL;
7215 nstack->next = label_context_stack_se;
7216 label_context_stack_se = nstack;
7218 /* Mark the current statement list as belonging to a statement list. */
7219 STATEMENT_LIST_STMT_EXPR (ret) = 1;
7225 c_finish_stmt_expr (tree body)
7227 tree last, type, tmp, val;
7229 struct c_label_list *dlist, *glist, *glist_prev = NULL;
7231 body = c_end_compound_stmt (body, true);
7234 gcc_assert (c_switch_stack->blocked_stmt_expr != 0);
7235 c_switch_stack->blocked_stmt_expr--;
7237 /* It is no longer possible to jump to labels defined within this
7238 statement expression. */
7239 for (dlist = label_context_stack_se->labels_def;
7241 dlist = dlist->next)
7243 C_DECL_UNJUMPABLE_STMT_EXPR (dlist->label) = 1;
7245 /* It is again possible to define labels with a goto just outside
7246 this statement expression. */
7247 for (glist = label_context_stack_se->next->labels_used;
7249 glist = glist->next)
7251 C_DECL_UNDEFINABLE_STMT_EXPR (glist->label) = 0;
7254 if (glist_prev != NULL)
7255 glist_prev->next = label_context_stack_se->labels_used;
7257 label_context_stack_se->next->labels_used
7258 = label_context_stack_se->labels_used;
7259 label_context_stack_se = label_context_stack_se->next;
7261 /* Locate the last statement in BODY. See c_end_compound_stmt
7262 about always returning a BIND_EXPR. */
7263 last_p = &BIND_EXPR_BODY (body);
7264 last = BIND_EXPR_BODY (body);
7267 if (TREE_CODE (last) == STATEMENT_LIST)
7269 tree_stmt_iterator i;
7271 /* This can happen with degenerate cases like ({ }). No value. */
7272 if (!TREE_SIDE_EFFECTS (last))
7275 /* If we're supposed to generate side effects warnings, process
7276 all of the statements except the last. */
7277 if (extra_warnings || warn_unused_value)
7279 for (i = tsi_start (last); !tsi_one_before_end_p (i); tsi_next (&i))
7280 emit_side_effect_warnings (tsi_stmt (i));
7283 i = tsi_last (last);
7284 last_p = tsi_stmt_ptr (i);
7288 /* If the end of the list is exception related, then the list was split
7289 by a call to push_cleanup. Continue searching. */
7290 if (TREE_CODE (last) == TRY_FINALLY_EXPR
7291 || TREE_CODE (last) == TRY_CATCH_EXPR)
7293 last_p = &TREE_OPERAND (last, 0);
7295 goto continue_searching;
7298 /* In the case that the BIND_EXPR is not necessary, return the
7299 expression out from inside it. */
7300 if (last == error_mark_node
7301 || (last == BIND_EXPR_BODY (body)
7302 && BIND_EXPR_VARS (body) == NULL))
7305 /* Extract the type of said expression. */
7306 type = TREE_TYPE (last);
7308 /* If we're not returning a value at all, then the BIND_EXPR that
7309 we already have is a fine expression to return. */
7310 if (!type || VOID_TYPE_P (type))
7313 /* Now that we've located the expression containing the value, it seems
7314 silly to make voidify_wrapper_expr repeat the process. Create a
7315 temporary of the appropriate type and stick it in a TARGET_EXPR. */
7316 tmp = create_tmp_var_raw (type, NULL);
7318 /* Unwrap a no-op NOP_EXPR as added by c_finish_expr_stmt. This avoids
7319 tree_expr_nonnegative_p giving up immediately. */
7321 if (TREE_CODE (val) == NOP_EXPR
7322 && TREE_TYPE (val) == TREE_TYPE (TREE_OPERAND (val, 0)))
7323 val = TREE_OPERAND (val, 0);
7325 *last_p = build2 (MODIFY_EXPR, void_type_node, tmp, val);
7326 SET_EXPR_LOCUS (*last_p, EXPR_LOCUS (last));
7328 return build4 (TARGET_EXPR, type, tmp, body, NULL_TREE, NULL_TREE);
7331 /* Begin the scope of an identifier of variably modified type, scope
7332 number SCOPE. Jumping from outside this scope to inside it is not
7336 c_begin_vm_scope (unsigned int scope)
7338 struct c_label_context_vm *nstack;
7339 struct c_label_list *glist;
7341 gcc_assert (scope > 0);
7342 if (c_switch_stack && !c_switch_stack->blocked_vm)
7343 c_switch_stack->blocked_vm = scope;
7344 for (glist = label_context_stack_vm->labels_used;
7346 glist = glist->next)
7348 C_DECL_UNDEFINABLE_VM (glist->label) = 1;
7350 nstack = XOBNEW (&parser_obstack, struct c_label_context_vm);
7351 nstack->labels_def = NULL;
7352 nstack->labels_used = NULL;
7353 nstack->scope = scope;
7354 nstack->next = label_context_stack_vm;
7355 label_context_stack_vm = nstack;
7358 /* End a scope which may contain identifiers of variably modified
7359 type, scope number SCOPE. */
7362 c_end_vm_scope (unsigned int scope)
7364 if (label_context_stack_vm == NULL)
7366 if (c_switch_stack && c_switch_stack->blocked_vm == scope)
7367 c_switch_stack->blocked_vm = 0;
7368 /* We may have a number of nested scopes of identifiers with
7369 variably modified type, all at this depth. Pop each in turn. */
7370 while (label_context_stack_vm->scope == scope)
7372 struct c_label_list *dlist, *glist, *glist_prev = NULL;
7374 /* It is no longer possible to jump to labels defined within this
7376 for (dlist = label_context_stack_vm->labels_def;
7378 dlist = dlist->next)
7380 C_DECL_UNJUMPABLE_VM (dlist->label) = 1;
7382 /* It is again possible to define labels with a goto just outside
7384 for (glist = label_context_stack_vm->next->labels_used;
7386 glist = glist->next)
7388 C_DECL_UNDEFINABLE_VM (glist->label) = 0;
7391 if (glist_prev != NULL)
7392 glist_prev->next = label_context_stack_vm->labels_used;
7394 label_context_stack_vm->next->labels_used
7395 = label_context_stack_vm->labels_used;
7396 label_context_stack_vm = label_context_stack_vm->next;
7400 /* Begin and end compound statements. This is as simple as pushing
7401 and popping new statement lists from the tree. */
7404 c_begin_compound_stmt (bool do_scope)
7406 tree stmt = push_stmt_list ();
7413 c_end_compound_stmt (tree stmt, bool do_scope)
7419 if (c_dialect_objc ())
7420 objc_clear_super_receiver ();
7421 block = pop_scope ();
7424 stmt = pop_stmt_list (stmt);
7425 stmt = c_build_bind_expr (block, stmt);
7427 /* If this compound statement is nested immediately inside a statement
7428 expression, then force a BIND_EXPR to be created. Otherwise we'll
7429 do the wrong thing for ({ { 1; } }) or ({ 1; { } }). In particular,
7430 STATEMENT_LISTs merge, and thus we can lose track of what statement
7433 && STATEMENT_LIST_STMT_EXPR (cur_stmt_list)
7434 && TREE_CODE (stmt) != BIND_EXPR)
7436 stmt = build3 (BIND_EXPR, void_type_node, NULL, stmt, NULL);
7437 TREE_SIDE_EFFECTS (stmt) = 1;
7443 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
7444 when the current scope is exited. EH_ONLY is true when this is not
7445 meant to apply to normal control flow transfer. */
7448 push_cleanup (tree ARG_UNUSED (decl), tree cleanup, bool eh_only)
7450 enum tree_code code;
7454 code = eh_only ? TRY_CATCH_EXPR : TRY_FINALLY_EXPR;
7455 stmt = build_stmt (code, NULL, cleanup);
7457 stmt_expr = STATEMENT_LIST_STMT_EXPR (cur_stmt_list);
7458 list = push_stmt_list ();
7459 TREE_OPERAND (stmt, 0) = list;
7460 STATEMENT_LIST_STMT_EXPR (list) = stmt_expr;
7463 /* Build a binary-operation expression without default conversions.
7464 CODE is the kind of expression to build.
7465 This function differs from `build' in several ways:
7466 the data type of the result is computed and recorded in it,
7467 warnings are generated if arg data types are invalid,
7468 special handling for addition and subtraction of pointers is known,
7469 and some optimization is done (operations on narrow ints
7470 are done in the narrower type when that gives the same result).
7471 Constant folding is also done before the result is returned.
7473 Note that the operands will never have enumeral types, or function
7474 or array types, because either they will have the default conversions
7475 performed or they have both just been converted to some other type in which
7476 the arithmetic is to be done. */
7479 build_binary_op (enum tree_code code, tree orig_op0, tree orig_op1,
7483 enum tree_code code0, code1;
7485 const char *invalid_op_diag;
7487 /* Expression code to give to the expression when it is built.
7488 Normally this is CODE, which is what the caller asked for,
7489 but in some special cases we change it. */
7490 enum tree_code resultcode = code;
7492 /* Data type in which the computation is to be performed.
7493 In the simplest cases this is the common type of the arguments. */
7494 tree result_type = NULL;
7496 /* Nonzero means operands have already been type-converted
7497 in whatever way is necessary.
7498 Zero means they need to be converted to RESULT_TYPE. */
7501 /* Nonzero means create the expression with this type, rather than
7503 tree build_type = 0;
7505 /* Nonzero means after finally constructing the expression
7506 convert it to this type. */
7507 tree final_type = 0;
7509 /* Nonzero if this is an operation like MIN or MAX which can
7510 safely be computed in short if both args are promoted shorts.
7511 Also implies COMMON.
7512 -1 indicates a bitwise operation; this makes a difference
7513 in the exact conditions for when it is safe to do the operation
7514 in a narrower mode. */
7517 /* Nonzero if this is a comparison operation;
7518 if both args are promoted shorts, compare the original shorts.
7519 Also implies COMMON. */
7520 int short_compare = 0;
7522 /* Nonzero if this is a right-shift operation, which can be computed on the
7523 original short and then promoted if the operand is a promoted short. */
7524 int short_shift = 0;
7526 /* Nonzero means set RESULT_TYPE to the common type of the args. */
7529 /* True means types are compatible as far as ObjC is concerned. */
7534 op0 = default_conversion (orig_op0);
7535 op1 = default_conversion (orig_op1);
7543 type0 = TREE_TYPE (op0);
7544 type1 = TREE_TYPE (op1);
7546 /* The expression codes of the data types of the arguments tell us
7547 whether the arguments are integers, floating, pointers, etc. */
7548 code0 = TREE_CODE (type0);
7549 code1 = TREE_CODE (type1);
7551 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
7552 STRIP_TYPE_NOPS (op0);
7553 STRIP_TYPE_NOPS (op1);
7555 /* If an error was already reported for one of the arguments,
7556 avoid reporting another error. */
7558 if (code0 == ERROR_MARK || code1 == ERROR_MARK)
7559 return error_mark_node;
7561 if ((invalid_op_diag
7562 = targetm.invalid_binary_op (code, type0, type1)))
7564 error (invalid_op_diag);
7565 return error_mark_node;
7568 objc_ok = objc_compare_types (type0, type1, -3, NULL_TREE);
7573 /* Handle the pointer + int case. */
7574 if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
7575 return pointer_int_sum (PLUS_EXPR, op0, op1);
7576 else if (code1 == POINTER_TYPE && code0 == INTEGER_TYPE)
7577 return pointer_int_sum (PLUS_EXPR, op1, op0);
7583 /* Subtraction of two similar pointers.
7584 We must subtract them as integers, then divide by object size. */
7585 if (code0 == POINTER_TYPE && code1 == POINTER_TYPE
7586 && comp_target_types (type0, type1))
7587 return pointer_diff (op0, op1);
7588 /* Handle pointer minus int. Just like pointer plus int. */
7589 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
7590 return pointer_int_sum (MINUS_EXPR, op0, op1);
7599 case TRUNC_DIV_EXPR:
7601 case FLOOR_DIV_EXPR:
7602 case ROUND_DIV_EXPR:
7603 case EXACT_DIV_EXPR:
7604 /* Floating point division by zero is a legitimate way to obtain
7605 infinities and NaNs. */
7606 if (skip_evaluation == 0 && integer_zerop (op1))
7607 warning (OPT_Wdiv_by_zero, "division by zero");
7609 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
7610 || code0 == COMPLEX_TYPE || code0 == VECTOR_TYPE)
7611 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
7612 || code1 == COMPLEX_TYPE || code1 == VECTOR_TYPE))
7614 enum tree_code tcode0 = code0, tcode1 = code1;
7616 if (code0 == COMPLEX_TYPE || code0 == VECTOR_TYPE)
7617 tcode0 = TREE_CODE (TREE_TYPE (TREE_TYPE (op0)));
7618 if (code1 == COMPLEX_TYPE || code1 == VECTOR_TYPE)
7619 tcode1 = TREE_CODE (TREE_TYPE (TREE_TYPE (op1)));
7621 if (!(tcode0 == INTEGER_TYPE && tcode1 == INTEGER_TYPE))
7622 resultcode = RDIV_EXPR;
7624 /* Although it would be tempting to shorten always here, that
7625 loses on some targets, since the modulo instruction is
7626 undefined if the quotient can't be represented in the
7627 computation mode. We shorten only if unsigned or if
7628 dividing by something we know != -1. */
7629 shorten = (TYPE_UNSIGNED (TREE_TYPE (orig_op0))
7630 || (TREE_CODE (op1) == INTEGER_CST
7631 && !integer_all_onesp (op1)));
7639 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
7641 else if (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE)
7645 case TRUNC_MOD_EXPR:
7646 case FLOOR_MOD_EXPR:
7647 if (skip_evaluation == 0 && integer_zerop (op1))
7648 warning (OPT_Wdiv_by_zero, "division by zero");
7650 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
7652 /* Although it would be tempting to shorten always here, that loses
7653 on some targets, since the modulo instruction is undefined if the
7654 quotient can't be represented in the computation mode. We shorten
7655 only if unsigned or if dividing by something we know != -1. */
7656 shorten = (TYPE_UNSIGNED (TREE_TYPE (orig_op0))
7657 || (TREE_CODE (op1) == INTEGER_CST
7658 && !integer_all_onesp (op1)));
7663 case TRUTH_ANDIF_EXPR:
7664 case TRUTH_ORIF_EXPR:
7665 case TRUTH_AND_EXPR:
7667 case TRUTH_XOR_EXPR:
7668 if ((code0 == INTEGER_TYPE || code0 == POINTER_TYPE
7669 || code0 == REAL_TYPE || code0 == COMPLEX_TYPE)
7670 && (code1 == INTEGER_TYPE || code1 == POINTER_TYPE
7671 || code1 == REAL_TYPE || code1 == COMPLEX_TYPE))
7673 /* Result of these operations is always an int,
7674 but that does not mean the operands should be
7675 converted to ints! */
7676 result_type = integer_type_node;
7677 op0 = c_common_truthvalue_conversion (op0);
7678 op1 = c_common_truthvalue_conversion (op1);
7683 /* Shift operations: result has same type as first operand;
7684 always convert second operand to int.
7685 Also set SHORT_SHIFT if shifting rightward. */
7688 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
7690 if (TREE_CODE (op1) == INTEGER_CST && skip_evaluation == 0)
7692 if (tree_int_cst_sgn (op1) < 0)
7693 warning (0, "right shift count is negative");
7696 if (!integer_zerop (op1))
7699 if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
7700 warning (0, "right shift count >= width of type");
7704 /* Use the type of the value to be shifted. */
7705 result_type = type0;
7706 /* Convert the shift-count to an integer, regardless of size
7707 of value being shifted. */
7708 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
7709 op1 = convert (integer_type_node, op1);
7710 /* Avoid converting op1 to result_type later. */
7716 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
7718 if (TREE_CODE (op1) == INTEGER_CST && skip_evaluation == 0)
7720 if (tree_int_cst_sgn (op1) < 0)
7721 warning (0, "left shift count is negative");
7723 else if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
7724 warning (0, "left shift count >= width of type");
7727 /* Use the type of the value to be shifted. */
7728 result_type = type0;
7729 /* Convert the shift-count to an integer, regardless of size
7730 of value being shifted. */
7731 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
7732 op1 = convert (integer_type_node, op1);
7733 /* Avoid converting op1 to result_type later. */
7740 if (code0 == REAL_TYPE || code1 == REAL_TYPE)
7741 warning (OPT_Wfloat_equal,
7742 "comparing floating point with == or != is unsafe");
7743 /* Result of comparison is always int,
7744 but don't convert the args to int! */
7745 build_type = integer_type_node;
7746 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
7747 || code0 == COMPLEX_TYPE)
7748 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
7749 || code1 == COMPLEX_TYPE))
7751 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
7753 tree tt0 = TREE_TYPE (type0);
7754 tree tt1 = TREE_TYPE (type1);
7755 /* Anything compares with void *. void * compares with anything.
7756 Otherwise, the targets must be compatible
7757 and both must be object or both incomplete. */
7758 if (comp_target_types (type0, type1))
7759 result_type = common_pointer_type (type0, type1);
7760 else if (VOID_TYPE_P (tt0))
7762 /* op0 != orig_op0 detects the case of something
7763 whose value is 0 but which isn't a valid null ptr const. */
7764 if (pedantic && (!integer_zerop (op0) || op0 != orig_op0)
7765 && TREE_CODE (tt1) == FUNCTION_TYPE)
7766 pedwarn ("ISO C forbids comparison of %<void *%>"
7767 " with function pointer");
7769 else if (VOID_TYPE_P (tt1))
7771 if (pedantic && (!integer_zerop (op1) || op1 != orig_op1)
7772 && TREE_CODE (tt0) == FUNCTION_TYPE)
7773 pedwarn ("ISO C forbids comparison of %<void *%>"
7774 " with function pointer");
7777 /* Avoid warning about the volatile ObjC EH puts on decls. */
7779 pedwarn ("comparison of distinct pointer types lacks a cast");
7781 if (result_type == NULL_TREE)
7782 result_type = ptr_type_node;
7784 else if (code0 == POINTER_TYPE && TREE_CODE (op1) == INTEGER_CST
7785 && integer_zerop (op1))
7786 result_type = type0;
7787 else if (code1 == POINTER_TYPE && TREE_CODE (op0) == INTEGER_CST
7788 && integer_zerop (op0))
7789 result_type = type1;
7790 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
7792 result_type = type0;
7793 pedwarn ("comparison between pointer and integer");
7795 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
7797 result_type = type1;
7798 pedwarn ("comparison between pointer and integer");
7806 build_type = integer_type_node;
7807 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE)
7808 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE))
7810 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
7812 if (comp_target_types (type0, type1))
7814 result_type = common_pointer_type (type0, type1);
7815 if (!COMPLETE_TYPE_P (TREE_TYPE (type0))
7816 != !COMPLETE_TYPE_P (TREE_TYPE (type1)))
7817 pedwarn ("comparison of complete and incomplete pointers");
7819 && TREE_CODE (TREE_TYPE (type0)) == FUNCTION_TYPE)
7820 pedwarn ("ISO C forbids ordered comparisons of pointers to functions");
7824 result_type = ptr_type_node;
7825 pedwarn ("comparison of distinct pointer types lacks a cast");
7828 else if (code0 == POINTER_TYPE && TREE_CODE (op1) == INTEGER_CST
7829 && integer_zerop (op1))
7831 result_type = type0;
7832 if (pedantic || extra_warnings)
7833 pedwarn ("ordered comparison of pointer with integer zero");
7835 else if (code1 == POINTER_TYPE && TREE_CODE (op0) == INTEGER_CST
7836 && integer_zerop (op0))
7838 result_type = type1;
7840 pedwarn ("ordered comparison of pointer with integer zero");
7842 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
7844 result_type = type0;
7845 pedwarn ("comparison between pointer and integer");
7847 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
7849 result_type = type1;
7850 pedwarn ("comparison between pointer and integer");
7858 if (code0 == ERROR_MARK || code1 == ERROR_MARK)
7859 return error_mark_node;
7861 if (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE
7862 && (!tree_int_cst_equal (TYPE_SIZE (type0), TYPE_SIZE (type1))
7863 || !same_scalar_type_ignoring_signedness (TREE_TYPE (type0),
7864 TREE_TYPE (type1))))
7866 binary_op_error (code);
7867 return error_mark_node;
7870 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE || code0 == COMPLEX_TYPE
7871 || code0 == VECTOR_TYPE)
7873 (code1 == INTEGER_TYPE || code1 == REAL_TYPE || code1 == COMPLEX_TYPE
7874 || code1 == VECTOR_TYPE))
7876 int none_complex = (code0 != COMPLEX_TYPE && code1 != COMPLEX_TYPE);
7878 if (shorten || common || short_compare)
7879 result_type = c_common_type (type0, type1);
7881 /* For certain operations (which identify themselves by shorten != 0)
7882 if both args were extended from the same smaller type,
7883 do the arithmetic in that type and then extend.
7885 shorten !=0 and !=1 indicates a bitwise operation.
7886 For them, this optimization is safe only if
7887 both args are zero-extended or both are sign-extended.
7888 Otherwise, we might change the result.
7889 Eg, (short)-1 | (unsigned short)-1 is (int)-1
7890 but calculated in (unsigned short) it would be (unsigned short)-1. */
7892 if (shorten && none_complex)
7894 int unsigned0, unsigned1;
7895 tree arg0 = get_narrower (op0, &unsigned0);
7896 tree arg1 = get_narrower (op1, &unsigned1);
7897 /* UNS is 1 if the operation to be done is an unsigned one. */
7898 int uns = TYPE_UNSIGNED (result_type);
7901 final_type = result_type;
7903 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
7904 but it *requires* conversion to FINAL_TYPE. */
7906 if ((TYPE_PRECISION (TREE_TYPE (op0))
7907 == TYPE_PRECISION (TREE_TYPE (arg0)))
7908 && TREE_TYPE (op0) != final_type)
7909 unsigned0 = TYPE_UNSIGNED (TREE_TYPE (op0));
7910 if ((TYPE_PRECISION (TREE_TYPE (op1))
7911 == TYPE_PRECISION (TREE_TYPE (arg1)))
7912 && TREE_TYPE (op1) != final_type)
7913 unsigned1 = TYPE_UNSIGNED (TREE_TYPE (op1));
7915 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
7917 /* For bitwise operations, signedness of nominal type
7918 does not matter. Consider only how operands were extended. */
7922 /* Note that in all three cases below we refrain from optimizing
7923 an unsigned operation on sign-extended args.
7924 That would not be valid. */
7926 /* Both args variable: if both extended in same way
7927 from same width, do it in that width.
7928 Do it unsigned if args were zero-extended. */
7929 if ((TYPE_PRECISION (TREE_TYPE (arg0))
7930 < TYPE_PRECISION (result_type))
7931 && (TYPE_PRECISION (TREE_TYPE (arg1))
7932 == TYPE_PRECISION (TREE_TYPE (arg0)))
7933 && unsigned0 == unsigned1
7934 && (unsigned0 || !uns))
7936 = c_common_signed_or_unsigned_type
7937 (unsigned0, c_common_type (TREE_TYPE (arg0), TREE_TYPE (arg1)));
7938 else if (TREE_CODE (arg0) == INTEGER_CST
7939 && (unsigned1 || !uns)
7940 && (TYPE_PRECISION (TREE_TYPE (arg1))
7941 < TYPE_PRECISION (result_type))
7943 = c_common_signed_or_unsigned_type (unsigned1,
7945 int_fits_type_p (arg0, type)))
7947 else if (TREE_CODE (arg1) == INTEGER_CST
7948 && (unsigned0 || !uns)
7949 && (TYPE_PRECISION (TREE_TYPE (arg0))
7950 < TYPE_PRECISION (result_type))
7952 = c_common_signed_or_unsigned_type (unsigned0,
7954 int_fits_type_p (arg1, type)))
7958 /* Shifts can be shortened if shifting right. */
7963 tree arg0 = get_narrower (op0, &unsigned_arg);
7965 final_type = result_type;
7967 if (arg0 == op0 && final_type == TREE_TYPE (op0))
7968 unsigned_arg = TYPE_UNSIGNED (TREE_TYPE (op0));
7970 if (TYPE_PRECISION (TREE_TYPE (arg0)) < TYPE_PRECISION (result_type)
7971 /* We can shorten only if the shift count is less than the
7972 number of bits in the smaller type size. */
7973 && compare_tree_int (op1, TYPE_PRECISION (TREE_TYPE (arg0))) < 0
7974 /* We cannot drop an unsigned shift after sign-extension. */
7975 && (!TYPE_UNSIGNED (final_type) || unsigned_arg))
7977 /* Do an unsigned shift if the operand was zero-extended. */
7979 = c_common_signed_or_unsigned_type (unsigned_arg,
7981 /* Convert value-to-be-shifted to that type. */
7982 if (TREE_TYPE (op0) != result_type)
7983 op0 = convert (result_type, op0);
7988 /* Comparison operations are shortened too but differently.
7989 They identify themselves by setting short_compare = 1. */
7993 /* Don't write &op0, etc., because that would prevent op0
7994 from being kept in a register.
7995 Instead, make copies of the our local variables and
7996 pass the copies by reference, then copy them back afterward. */
7997 tree xop0 = op0, xop1 = op1, xresult_type = result_type;
7998 enum tree_code xresultcode = resultcode;
8000 = shorten_compare (&xop0, &xop1, &xresult_type, &xresultcode);
8005 op0 = xop0, op1 = xop1;
8007 resultcode = xresultcode;
8009 if (warn_sign_compare && skip_evaluation == 0)
8011 int op0_signed = !TYPE_UNSIGNED (TREE_TYPE (orig_op0));
8012 int op1_signed = !TYPE_UNSIGNED (TREE_TYPE (orig_op1));
8013 int unsignedp0, unsignedp1;
8014 tree primop0 = get_narrower (op0, &unsignedp0);
8015 tree primop1 = get_narrower (op1, &unsignedp1);
8019 STRIP_TYPE_NOPS (xop0);
8020 STRIP_TYPE_NOPS (xop1);
8022 /* Give warnings for comparisons between signed and unsigned
8023 quantities that may fail.
8025 Do the checking based on the original operand trees, so that
8026 casts will be considered, but default promotions won't be.
8028 Do not warn if the comparison is being done in a signed type,
8029 since the signed type will only be chosen if it can represent
8030 all the values of the unsigned type. */
8031 if (!TYPE_UNSIGNED (result_type))
8033 /* Do not warn if both operands are the same signedness. */
8034 else if (op0_signed == op1_signed)
8041 sop = xop0, uop = xop1;
8043 sop = xop1, uop = xop0;
8045 /* Do not warn if the signed quantity is an
8046 unsuffixed integer literal (or some static
8047 constant expression involving such literals or a
8048 conditional expression involving such literals)
8049 and it is non-negative. */
8050 if (tree_expr_nonnegative_p (sop))
8052 /* Do not warn if the comparison is an equality operation,
8053 the unsigned quantity is an integral constant, and it
8054 would fit in the result if the result were signed. */
8055 else if (TREE_CODE (uop) == INTEGER_CST
8056 && (resultcode == EQ_EXPR || resultcode == NE_EXPR)
8058 (uop, c_common_signed_type (result_type)))
8060 /* Do not warn if the unsigned quantity is an enumeration
8061 constant and its maximum value would fit in the result
8062 if the result were signed. */
8063 else if (TREE_CODE (uop) == INTEGER_CST
8064 && TREE_CODE (TREE_TYPE (uop)) == ENUMERAL_TYPE
8066 (TYPE_MAX_VALUE (TREE_TYPE (uop)),
8067 c_common_signed_type (result_type)))
8070 warning (0, "comparison between signed and unsigned");
8073 /* Warn if two unsigned values are being compared in a size
8074 larger than their original size, and one (and only one) is the
8075 result of a `~' operator. This comparison will always fail.
8077 Also warn if one operand is a constant, and the constant
8078 does not have all bits set that are set in the ~ operand
8079 when it is extended. */
8081 if ((TREE_CODE (primop0) == BIT_NOT_EXPR)
8082 != (TREE_CODE (primop1) == BIT_NOT_EXPR))
8084 if (TREE_CODE (primop0) == BIT_NOT_EXPR)
8085 primop0 = get_narrower (TREE_OPERAND (primop0, 0),
8088 primop1 = get_narrower (TREE_OPERAND (primop1, 0),
8091 if (host_integerp (primop0, 0) || host_integerp (primop1, 0))
8094 HOST_WIDE_INT constant, mask;
8095 int unsignedp, bits;
8097 if (host_integerp (primop0, 0))
8100 unsignedp = unsignedp1;
8101 constant = tree_low_cst (primop0, 0);
8106 unsignedp = unsignedp0;
8107 constant = tree_low_cst (primop1, 0);
8110 bits = TYPE_PRECISION (TREE_TYPE (primop));
8111 if (bits < TYPE_PRECISION (result_type)
8112 && bits < HOST_BITS_PER_WIDE_INT && unsignedp)
8114 mask = (~(HOST_WIDE_INT) 0) << bits;
8115 if ((mask & constant) != mask)
8116 warning (0, "comparison of promoted ~unsigned with constant");
8119 else if (unsignedp0 && unsignedp1
8120 && (TYPE_PRECISION (TREE_TYPE (primop0))
8121 < TYPE_PRECISION (result_type))
8122 && (TYPE_PRECISION (TREE_TYPE (primop1))
8123 < TYPE_PRECISION (result_type)))
8124 warning (0, "comparison of promoted ~unsigned with unsigned");
8130 /* At this point, RESULT_TYPE must be nonzero to avoid an error message.
8131 If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
8132 Then the expression will be built.
8133 It will be given type FINAL_TYPE if that is nonzero;
8134 otherwise, it will be given type RESULT_TYPE. */
8138 binary_op_error (code);
8139 return error_mark_node;
8144 if (TREE_TYPE (op0) != result_type)
8145 op0 = convert (result_type, op0);
8146 if (TREE_TYPE (op1) != result_type)
8147 op1 = convert (result_type, op1);
8149 /* This can happen if one operand has a vector type, and the other
8150 has a different type. */
8151 if (TREE_CODE (op0) == ERROR_MARK || TREE_CODE (op1) == ERROR_MARK)
8152 return error_mark_node;
8155 if (build_type == NULL_TREE)
8156 build_type = result_type;
8159 tree result = build2 (resultcode, build_type, op0, op1);
8161 /* Treat expressions in initializers specially as they can't trap. */
8162 result = require_constant_value ? fold_initializer (result)
8165 if (final_type != 0)
8166 result = convert (final_type, result);
8172 /* Convert EXPR to be a truth-value, validating its type for this
8176 c_objc_common_truthvalue_conversion (tree expr)
8178 switch (TREE_CODE (TREE_TYPE (expr)))
8181 error ("used array that cannot be converted to pointer where scalar is required");
8182 return error_mark_node;
8185 error ("used struct type value where scalar is required");
8186 return error_mark_node;
8189 error ("used union type value where scalar is required");
8190 return error_mark_node;
8199 /* ??? Should we also give an error for void and vectors rather than
8200 leaving those to give errors later? */
8201 return c_common_truthvalue_conversion (expr);
8205 /* Convert EXPR to a contained DECL, updating *TC, *TI and *SE as
8209 c_expr_to_decl (tree expr, bool *tc ATTRIBUTE_UNUSED,
8210 bool *ti ATTRIBUTE_UNUSED, bool *se)
8212 if (TREE_CODE (expr) == COMPOUND_LITERAL_EXPR)
8214 tree decl = COMPOUND_LITERAL_EXPR_DECL (expr);
8215 /* Executing a compound literal inside a function reinitializes
8217 if (!TREE_STATIC (decl))