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, 59 Temple Place - Suite 330, Boston, MA
23 /* This file is part of the C front end.
24 It contains routines to build C expressions given their operands,
25 including computing the types of the result, C-specific error checks,
26 and some optimization. */
30 #include "coretypes.h"
34 #include "langhooks.h"
44 #include "tree-iterator.h"
45 #include "tree-gimple.h"
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 (0, 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);
1263 /* Perform the default conversion of arrays and functions to pointers.
1264 Return the result of converting EXP. For any other expression, just
1265 return EXP after removing NOPs. */
1268 default_function_array_conversion (tree exp)
1271 tree type = TREE_TYPE (exp);
1272 enum tree_code code = TREE_CODE (type);
1275 /* Strip NON_LVALUE_EXPRs and no-op conversions, since we aren't using as
1278 Do not use STRIP_NOPS here! It will remove conversions from pointer
1279 to integer and cause infinite recursion. */
1281 while (TREE_CODE (exp) == NON_LVALUE_EXPR
1282 || (TREE_CODE (exp) == NOP_EXPR
1283 && TREE_TYPE (TREE_OPERAND (exp, 0)) == TREE_TYPE (exp)))
1285 if (TREE_CODE (exp) == NON_LVALUE_EXPR)
1287 exp = TREE_OPERAND (exp, 0);
1290 if (TREE_NO_WARNING (orig_exp))
1291 TREE_NO_WARNING (exp) = 1;
1293 if (code == FUNCTION_TYPE)
1295 return build_unary_op (ADDR_EXPR, exp, 0);
1297 if (code == ARRAY_TYPE)
1300 tree restype = TREE_TYPE (type);
1306 if (REFERENCE_CLASS_P (exp) || DECL_P (exp))
1308 constp = TREE_READONLY (exp);
1309 volatilep = TREE_THIS_VOLATILE (exp);
1312 if (TYPE_QUALS (type) || constp || volatilep)
1314 = c_build_qualified_type (restype,
1316 | (constp * TYPE_QUAL_CONST)
1317 | (volatilep * TYPE_QUAL_VOLATILE));
1319 if (TREE_CODE (exp) == INDIRECT_REF)
1320 return convert (build_pointer_type (restype),
1321 TREE_OPERAND (exp, 0));
1323 if (TREE_CODE (exp) == COMPOUND_EXPR)
1325 tree op1 = default_conversion (TREE_OPERAND (exp, 1));
1326 return build2 (COMPOUND_EXPR, TREE_TYPE (op1),
1327 TREE_OPERAND (exp, 0), op1);
1330 lvalue_array_p = !not_lvalue && lvalue_p (exp);
1331 if (!flag_isoc99 && !lvalue_array_p)
1333 /* Before C99, non-lvalue arrays do not decay to pointers.
1334 Normally, using such an array would be invalid; but it can
1335 be used correctly inside sizeof or as a statement expression.
1336 Thus, do not give an error here; an error will result later. */
1340 ptrtype = build_pointer_type (restype);
1342 if (TREE_CODE (exp) == VAR_DECL)
1344 /* We are making an ADDR_EXPR of ptrtype. This is a valid
1345 ADDR_EXPR because it's the best way of representing what
1346 happens in C when we take the address of an array and place
1347 it in a pointer to the element type. */
1348 adr = build1 (ADDR_EXPR, ptrtype, exp);
1349 if (!c_mark_addressable (exp))
1350 return error_mark_node;
1351 TREE_SIDE_EFFECTS (adr) = 0; /* Default would be, same as EXP. */
1354 /* This way is better for a COMPONENT_REF since it can
1355 simplify the offset for a component. */
1356 adr = build_unary_op (ADDR_EXPR, exp, 1);
1357 return convert (ptrtype, adr);
1363 /* EXP is an expression of integer type. Apply the integer promotions
1364 to it and return the promoted value. */
1367 perform_integral_promotions (tree exp)
1369 tree type = TREE_TYPE (exp);
1370 enum tree_code code = TREE_CODE (type);
1372 gcc_assert (INTEGRAL_TYPE_P (type));
1374 /* Normally convert enums to int,
1375 but convert wide enums to something wider. */
1376 if (code == ENUMERAL_TYPE)
1378 type = c_common_type_for_size (MAX (TYPE_PRECISION (type),
1379 TYPE_PRECISION (integer_type_node)),
1380 ((TYPE_PRECISION (type)
1381 >= TYPE_PRECISION (integer_type_node))
1382 && TYPE_UNSIGNED (type)));
1384 return convert (type, exp);
1387 /* ??? This should no longer be needed now bit-fields have their
1389 if (TREE_CODE (exp) == COMPONENT_REF
1390 && DECL_C_BIT_FIELD (TREE_OPERAND (exp, 1))
1391 /* If it's thinner than an int, promote it like a
1392 c_promoting_integer_type_p, otherwise leave it alone. */
1393 && 0 > compare_tree_int (DECL_SIZE (TREE_OPERAND (exp, 1)),
1394 TYPE_PRECISION (integer_type_node)))
1395 return convert (integer_type_node, exp);
1397 if (c_promoting_integer_type_p (type))
1399 /* Preserve unsignedness if not really getting any wider. */
1400 if (TYPE_UNSIGNED (type)
1401 && TYPE_PRECISION (type) == TYPE_PRECISION (integer_type_node))
1402 return convert (unsigned_type_node, exp);
1404 return convert (integer_type_node, exp);
1411 /* Perform default promotions for C data used in expressions.
1412 Enumeral types or short or char are converted to int.
1413 In addition, manifest constants symbols are replaced by their values. */
1416 default_conversion (tree exp)
1419 tree type = TREE_TYPE (exp);
1420 enum tree_code code = TREE_CODE (type);
1422 /* Functions and arrays have been converted during parsing. */
1423 gcc_assert (code != FUNCTION_TYPE);
1424 if (code == ARRAY_TYPE)
1427 /* Constants can be used directly unless they're not loadable. */
1428 if (TREE_CODE (exp) == CONST_DECL)
1429 exp = DECL_INITIAL (exp);
1431 /* Replace a nonvolatile const static variable with its value unless
1432 it is an array, in which case we must be sure that taking the
1433 address of the array produces consistent results. */
1434 else if (optimize && TREE_CODE (exp) == VAR_DECL && code != ARRAY_TYPE)
1436 exp = decl_constant_value_for_broken_optimization (exp);
1437 type = TREE_TYPE (exp);
1440 /* Strip no-op conversions. */
1442 STRIP_TYPE_NOPS (exp);
1444 if (TREE_NO_WARNING (orig_exp))
1445 TREE_NO_WARNING (exp) = 1;
1447 if (INTEGRAL_TYPE_P (type))
1448 return perform_integral_promotions (exp);
1450 if (code == VOID_TYPE)
1452 error ("void value not ignored as it ought to be");
1453 return error_mark_node;
1458 /* Look up COMPONENT in a structure or union DECL.
1460 If the component name is not found, returns NULL_TREE. Otherwise,
1461 the return value is a TREE_LIST, with each TREE_VALUE a FIELD_DECL
1462 stepping down the chain to the component, which is in the last
1463 TREE_VALUE of the list. Normally the list is of length one, but if
1464 the component is embedded within (nested) anonymous structures or
1465 unions, the list steps down the chain to the component. */
1468 lookup_field (tree decl, tree component)
1470 tree type = TREE_TYPE (decl);
1473 /* If TYPE_LANG_SPECIFIC is set, then it is a sorted array of pointers
1474 to the field elements. Use a binary search on this array to quickly
1475 find the element. Otherwise, do a linear search. TYPE_LANG_SPECIFIC
1476 will always be set for structures which have many elements. */
1478 if (TYPE_LANG_SPECIFIC (type) && TYPE_LANG_SPECIFIC (type)->s)
1481 tree *field_array = &TYPE_LANG_SPECIFIC (type)->s->elts[0];
1483 field = TYPE_FIELDS (type);
1485 top = TYPE_LANG_SPECIFIC (type)->s->len;
1486 while (top - bot > 1)
1488 half = (top - bot + 1) >> 1;
1489 field = field_array[bot+half];
1491 if (DECL_NAME (field) == NULL_TREE)
1493 /* Step through all anon unions in linear fashion. */
1494 while (DECL_NAME (field_array[bot]) == NULL_TREE)
1496 field = field_array[bot++];
1497 if (TREE_CODE (TREE_TYPE (field)) == RECORD_TYPE
1498 || TREE_CODE (TREE_TYPE (field)) == UNION_TYPE)
1500 tree anon = lookup_field (field, component);
1503 return tree_cons (NULL_TREE, field, anon);
1507 /* Entire record is only anon unions. */
1511 /* Restart the binary search, with new lower bound. */
1515 if (DECL_NAME (field) == component)
1517 if (DECL_NAME (field) < component)
1523 if (DECL_NAME (field_array[bot]) == component)
1524 field = field_array[bot];
1525 else if (DECL_NAME (field) != component)
1530 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
1532 if (DECL_NAME (field) == NULL_TREE
1533 && (TREE_CODE (TREE_TYPE (field)) == RECORD_TYPE
1534 || TREE_CODE (TREE_TYPE (field)) == UNION_TYPE))
1536 tree anon = lookup_field (field, component);
1539 return tree_cons (NULL_TREE, field, anon);
1542 if (DECL_NAME (field) == component)
1546 if (field == NULL_TREE)
1550 return tree_cons (NULL_TREE, field, NULL_TREE);
1553 /* Make an expression to refer to the COMPONENT field of
1554 structure or union value DATUM. COMPONENT is an IDENTIFIER_NODE. */
1557 build_component_ref (tree datum, tree component)
1559 tree type = TREE_TYPE (datum);
1560 enum tree_code code = TREE_CODE (type);
1564 if (!objc_is_public (datum, component))
1565 return error_mark_node;
1567 /* See if there is a field or component with name COMPONENT. */
1569 if (code == RECORD_TYPE || code == UNION_TYPE)
1571 if (!COMPLETE_TYPE_P (type))
1573 c_incomplete_type_error (NULL_TREE, type);
1574 return error_mark_node;
1577 field = lookup_field (datum, component);
1581 error ("%qT has no member named %qE", type, component);
1582 return error_mark_node;
1585 /* Chain the COMPONENT_REFs if necessary down to the FIELD.
1586 This might be better solved in future the way the C++ front
1587 end does it - by giving the anonymous entities each a
1588 separate name and type, and then have build_component_ref
1589 recursively call itself. We can't do that here. */
1592 tree subdatum = TREE_VALUE (field);
1594 if (TREE_TYPE (subdatum) == error_mark_node)
1595 return error_mark_node;
1597 ref = build3 (COMPONENT_REF, TREE_TYPE (subdatum), datum, subdatum,
1599 if (TREE_READONLY (datum) || TREE_READONLY (subdatum))
1600 TREE_READONLY (ref) = 1;
1601 if (TREE_THIS_VOLATILE (datum) || TREE_THIS_VOLATILE (subdatum))
1602 TREE_THIS_VOLATILE (ref) = 1;
1604 if (TREE_DEPRECATED (subdatum))
1605 warn_deprecated_use (subdatum);
1609 field = TREE_CHAIN (field);
1615 else if (code != ERROR_MARK)
1616 error ("request for member %qE in something not a structure or union",
1619 return error_mark_node;
1622 /* Given an expression PTR for a pointer, return an expression
1623 for the value pointed to.
1624 ERRORSTRING is the name of the operator to appear in error messages. */
1627 build_indirect_ref (tree ptr, const char *errorstring)
1629 tree pointer = default_conversion (ptr);
1630 tree type = TREE_TYPE (pointer);
1632 if (TREE_CODE (type) == POINTER_TYPE)
1634 if (TREE_CODE (pointer) == ADDR_EXPR
1635 && (TREE_TYPE (TREE_OPERAND (pointer, 0))
1636 == TREE_TYPE (type)))
1637 return TREE_OPERAND (pointer, 0);
1640 tree t = TREE_TYPE (type);
1643 ref = build1 (INDIRECT_REF, t, pointer);
1645 if (!COMPLETE_OR_VOID_TYPE_P (t) && TREE_CODE (t) != ARRAY_TYPE)
1647 error ("dereferencing pointer to incomplete type");
1648 return error_mark_node;
1650 if (VOID_TYPE_P (t) && skip_evaluation == 0)
1651 warning (0, "dereferencing %<void *%> pointer");
1653 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
1654 so that we get the proper error message if the result is used
1655 to assign to. Also, &* is supposed to be a no-op.
1656 And ANSI C seems to specify that the type of the result
1657 should be the const type. */
1658 /* A de-reference of a pointer to const is not a const. It is valid
1659 to change it via some other pointer. */
1660 TREE_READONLY (ref) = TYPE_READONLY (t);
1661 TREE_SIDE_EFFECTS (ref)
1662 = TYPE_VOLATILE (t) || TREE_SIDE_EFFECTS (pointer);
1663 TREE_THIS_VOLATILE (ref) = TYPE_VOLATILE (t);
1667 else if (TREE_CODE (pointer) != ERROR_MARK)
1668 error ("invalid type argument of %qs", errorstring);
1669 return error_mark_node;
1672 /* This handles expressions of the form "a[i]", which denotes
1675 This is logically equivalent in C to *(a+i), but we may do it differently.
1676 If A is a variable or a member, we generate a primitive ARRAY_REF.
1677 This avoids forcing the array out of registers, and can work on
1678 arrays that are not lvalues (for example, members of structures returned
1682 build_array_ref (tree array, tree index)
1684 bool swapped = false;
1685 if (TREE_TYPE (array) == error_mark_node
1686 || TREE_TYPE (index) == error_mark_node)
1687 return error_mark_node;
1689 if (TREE_CODE (TREE_TYPE (array)) != ARRAY_TYPE
1690 && TREE_CODE (TREE_TYPE (array)) != POINTER_TYPE)
1693 if (TREE_CODE (TREE_TYPE (index)) != ARRAY_TYPE
1694 && TREE_CODE (TREE_TYPE (index)) != POINTER_TYPE)
1696 error ("subscripted value is neither array nor pointer");
1697 return error_mark_node;
1705 if (!INTEGRAL_TYPE_P (TREE_TYPE (index)))
1707 error ("array subscript is not an integer");
1708 return error_mark_node;
1711 if (TREE_CODE (TREE_TYPE (TREE_TYPE (array))) == FUNCTION_TYPE)
1713 error ("subscripted value is pointer to function");
1714 return error_mark_node;
1717 /* Subscripting with type char is likely to lose on a machine where
1718 chars are signed. So warn on any machine, but optionally. Don't
1719 warn for unsigned char since that type is safe. Don't warn for
1720 signed char because anyone who uses that must have done so
1721 deliberately. ??? Existing practice has also been to warn only
1722 when the char index is syntactically the index, not for
1724 if (warn_char_subscripts && !swapped
1725 && TYPE_MAIN_VARIANT (TREE_TYPE (index)) == char_type_node)
1726 warning (0, "array subscript has type %<char%>");
1728 /* Apply default promotions *after* noticing character types. */
1729 index = default_conversion (index);
1731 gcc_assert (TREE_CODE (TREE_TYPE (index)) == INTEGER_TYPE);
1733 if (TREE_CODE (TREE_TYPE (array)) == ARRAY_TYPE)
1737 /* An array that is indexed by a non-constant
1738 cannot be stored in a register; we must be able to do
1739 address arithmetic on its address.
1740 Likewise an array of elements of variable size. */
1741 if (TREE_CODE (index) != INTEGER_CST
1742 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array)))
1743 && TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array)))) != INTEGER_CST))
1745 if (!c_mark_addressable (array))
1746 return error_mark_node;
1748 /* An array that is indexed by a constant value which is not within
1749 the array bounds cannot be stored in a register either; because we
1750 would get a crash in store_bit_field/extract_bit_field when trying
1751 to access a non-existent part of the register. */
1752 if (TREE_CODE (index) == INTEGER_CST
1753 && TYPE_DOMAIN (TREE_TYPE (array))
1754 && !int_fits_type_p (index, TYPE_DOMAIN (TREE_TYPE (array))))
1756 if (!c_mark_addressable (array))
1757 return error_mark_node;
1763 while (TREE_CODE (foo) == COMPONENT_REF)
1764 foo = TREE_OPERAND (foo, 0);
1765 if (TREE_CODE (foo) == VAR_DECL && C_DECL_REGISTER (foo))
1766 pedwarn ("ISO C forbids subscripting %<register%> array");
1767 else if (!flag_isoc99 && !lvalue_p (foo))
1768 pedwarn ("ISO C90 forbids subscripting non-lvalue array");
1771 type = TREE_TYPE (TREE_TYPE (array));
1772 if (TREE_CODE (type) != ARRAY_TYPE)
1773 type = TYPE_MAIN_VARIANT (type);
1774 rval = build4 (ARRAY_REF, type, array, index, NULL_TREE, NULL_TREE);
1775 /* Array ref is const/volatile if the array elements are
1776 or if the array is. */
1777 TREE_READONLY (rval)
1778 |= (TYPE_READONLY (TREE_TYPE (TREE_TYPE (array)))
1779 | TREE_READONLY (array));
1780 TREE_SIDE_EFFECTS (rval)
1781 |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array)))
1782 | TREE_SIDE_EFFECTS (array));
1783 TREE_THIS_VOLATILE (rval)
1784 |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array)))
1785 /* This was added by rms on 16 Nov 91.
1786 It fixes vol struct foo *a; a->elts[1]
1787 in an inline function.
1788 Hope it doesn't break something else. */
1789 | TREE_THIS_VOLATILE (array));
1790 return require_complete_type (fold (rval));
1794 tree ar = default_conversion (array);
1796 if (ar == error_mark_node)
1799 gcc_assert (TREE_CODE (TREE_TYPE (ar)) == POINTER_TYPE);
1800 gcc_assert (TREE_CODE (TREE_TYPE (TREE_TYPE (ar))) != FUNCTION_TYPE);
1802 return build_indirect_ref (build_binary_op (PLUS_EXPR, ar, index, 0),
1807 /* Build an external reference to identifier ID. FUN indicates
1808 whether this will be used for a function call. LOC is the source
1809 location of the identifier. */
1811 build_external_ref (tree id, int fun, location_t loc)
1814 tree decl = lookup_name (id);
1816 /* In Objective-C, an instance variable (ivar) may be preferred to
1817 whatever lookup_name() found. */
1818 decl = objc_lookup_ivar (decl, id);
1820 if (decl && decl != error_mark_node)
1823 /* Implicit function declaration. */
1824 ref = implicitly_declare (id);
1825 else if (decl == error_mark_node)
1826 /* Don't complain about something that's already been
1827 complained about. */
1828 return error_mark_node;
1831 undeclared_variable (id, loc);
1832 return error_mark_node;
1835 if (TREE_TYPE (ref) == error_mark_node)
1836 return error_mark_node;
1838 if (TREE_DEPRECATED (ref))
1839 warn_deprecated_use (ref);
1841 if (!skip_evaluation)
1842 assemble_external (ref);
1843 TREE_USED (ref) = 1;
1845 if (TREE_CODE (ref) == FUNCTION_DECL && !in_alignof)
1847 if (!in_sizeof && !in_typeof)
1848 C_DECL_USED (ref) = 1;
1849 else if (DECL_INITIAL (ref) == 0
1850 && DECL_EXTERNAL (ref)
1851 && !TREE_PUBLIC (ref))
1852 record_maybe_used_decl (ref);
1855 if (TREE_CODE (ref) == CONST_DECL)
1857 ref = DECL_INITIAL (ref);
1858 TREE_CONSTANT (ref) = 1;
1859 TREE_INVARIANT (ref) = 1;
1861 else if (current_function_decl != 0
1862 && !DECL_FILE_SCOPE_P (current_function_decl)
1863 && (TREE_CODE (ref) == VAR_DECL
1864 || TREE_CODE (ref) == PARM_DECL
1865 || TREE_CODE (ref) == FUNCTION_DECL))
1867 tree context = decl_function_context (ref);
1869 if (context != 0 && context != current_function_decl)
1870 DECL_NONLOCAL (ref) = 1;
1876 /* Record details of decls possibly used inside sizeof or typeof. */
1877 struct maybe_used_decl
1881 /* The level seen at (in_sizeof + in_typeof). */
1883 /* The next one at this level or above, or NULL. */
1884 struct maybe_used_decl *next;
1887 static struct maybe_used_decl *maybe_used_decls;
1889 /* Record that DECL, an undefined static function reference seen
1890 inside sizeof or typeof, might be used if the operand of sizeof is
1891 a VLA type or the operand of typeof is a variably modified
1895 record_maybe_used_decl (tree decl)
1897 struct maybe_used_decl *t = XOBNEW (&parser_obstack, struct maybe_used_decl);
1899 t->level = in_sizeof + in_typeof;
1900 t->next = maybe_used_decls;
1901 maybe_used_decls = t;
1904 /* Pop the stack of decls possibly used inside sizeof or typeof. If
1905 USED is false, just discard them. If it is true, mark them used
1906 (if no longer inside sizeof or typeof) or move them to the next
1907 level up (if still inside sizeof or typeof). */
1910 pop_maybe_used (bool used)
1912 struct maybe_used_decl *p = maybe_used_decls;
1913 int cur_level = in_sizeof + in_typeof;
1914 while (p && p->level > cur_level)
1919 C_DECL_USED (p->decl) = 1;
1921 p->level = cur_level;
1925 if (!used || cur_level == 0)
1926 maybe_used_decls = p;
1929 /* Return the result of sizeof applied to EXPR. */
1932 c_expr_sizeof_expr (struct c_expr expr)
1935 if (expr.value == error_mark_node)
1937 ret.value = error_mark_node;
1938 ret.original_code = ERROR_MARK;
1939 pop_maybe_used (false);
1943 ret.value = c_sizeof (TREE_TYPE (expr.value));
1944 ret.original_code = ERROR_MARK;
1945 pop_maybe_used (C_TYPE_VARIABLE_SIZE (TREE_TYPE (expr.value)));
1950 /* Return the result of sizeof applied to T, a structure for the type
1951 name passed to sizeof (rather than the type itself). */
1954 c_expr_sizeof_type (struct c_type_name *t)
1958 type = groktypename (t);
1959 ret.value = c_sizeof (type);
1960 ret.original_code = ERROR_MARK;
1961 pop_maybe_used (C_TYPE_VARIABLE_SIZE (type));
1965 /* Build a function call to function FUNCTION with parameters PARAMS.
1966 PARAMS is a list--a chain of TREE_LIST nodes--in which the
1967 TREE_VALUE of each node is a parameter-expression.
1968 FUNCTION's data type may be a function type or a pointer-to-function. */
1971 build_function_call (tree function, tree params)
1973 tree fntype, fundecl = 0;
1974 tree coerced_params;
1975 tree name = NULL_TREE, result;
1978 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
1979 STRIP_TYPE_NOPS (function);
1981 /* Convert anything with function type to a pointer-to-function. */
1982 if (TREE_CODE (function) == FUNCTION_DECL)
1984 /* Implement type-directed function overloading for builtins.
1985 resolve_overloaded_builtin and targetm.resolve_overloaded_builtin
1986 handle all the type checking. The result is a complete expression
1987 that implements this function call. */
1988 tem = resolve_overloaded_builtin (function, params);
1992 name = DECL_NAME (function);
1994 function = default_function_array_conversion (function);
1996 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
1997 expressions, like those used for ObjC messenger dispatches. */
1998 function = objc_rewrite_function_call (function, params);
2000 fntype = TREE_TYPE (function);
2002 if (TREE_CODE (fntype) == ERROR_MARK)
2003 return error_mark_node;
2005 if (!(TREE_CODE (fntype) == POINTER_TYPE
2006 && TREE_CODE (TREE_TYPE (fntype)) == FUNCTION_TYPE))
2008 error ("called object %qE is not a function", function);
2009 return error_mark_node;
2012 if (fundecl && TREE_THIS_VOLATILE (fundecl))
2013 current_function_returns_abnormally = 1;
2015 /* fntype now gets the type of function pointed to. */
2016 fntype = TREE_TYPE (fntype);
2018 /* Check that the function is called through a compatible prototype.
2019 If it is not, replace the call by a trap, wrapped up in a compound
2020 expression if necessary. This has the nice side-effect to prevent
2021 the tree-inliner from generating invalid assignment trees which may
2022 blow up in the RTL expander later. */
2023 if (TREE_CODE (function) == NOP_EXPR
2024 && TREE_CODE (tem = TREE_OPERAND (function, 0)) == ADDR_EXPR
2025 && TREE_CODE (tem = TREE_OPERAND (tem, 0)) == FUNCTION_DECL
2026 && !comptypes (fntype, TREE_TYPE (tem)))
2028 tree return_type = TREE_TYPE (fntype);
2029 tree trap = build_function_call (built_in_decls[BUILT_IN_TRAP],
2032 /* This situation leads to run-time undefined behavior. We can't,
2033 therefore, simply error unless we can prove that all possible
2034 executions of the program must execute the code. */
2035 warning (0, "function called through a non-compatible type");
2037 /* We can, however, treat "undefined" any way we please.
2038 Call abort to encourage the user to fix the program. */
2039 inform ("if this code is reached, the program will abort");
2041 if (VOID_TYPE_P (return_type))
2047 if (AGGREGATE_TYPE_P (return_type))
2048 rhs = build_compound_literal (return_type,
2049 build_constructor (return_type,
2052 rhs = fold (build1 (NOP_EXPR, return_type, integer_zero_node));
2054 return build2 (COMPOUND_EXPR, return_type, trap, rhs);
2058 /* Convert the parameters to the types declared in the
2059 function prototype, or apply default promotions. */
2062 = convert_arguments (TYPE_ARG_TYPES (fntype), params, function, fundecl);
2064 if (coerced_params == error_mark_node)
2065 return error_mark_node;
2067 /* Check that the arguments to the function are valid. */
2069 check_function_arguments (TYPE_ATTRIBUTES (fntype), coerced_params);
2071 result = build3 (CALL_EXPR, TREE_TYPE (fntype),
2072 function, coerced_params, NULL_TREE);
2073 TREE_SIDE_EFFECTS (result) = 1;
2075 if (require_constant_value)
2077 result = fold_initializer (result);
2079 if (TREE_CONSTANT (result)
2080 && (name == NULL_TREE
2081 || strncmp (IDENTIFIER_POINTER (name), "__builtin_", 10) != 0))
2082 pedwarn_init ("initializer element is not constant");
2085 result = fold (result);
2087 if (VOID_TYPE_P (TREE_TYPE (result)))
2089 return require_complete_type (result);
2092 /* Convert the argument expressions in the list VALUES
2093 to the types in the list TYPELIST. The result is a list of converted
2094 argument expressions, unless there are too few arguments in which
2095 case it is error_mark_node.
2097 If TYPELIST is exhausted, or when an element has NULL as its type,
2098 perform the default conversions.
2100 PARMLIST is the chain of parm decls for the function being called.
2101 It may be 0, if that info is not available.
2102 It is used only for generating error messages.
2104 FUNCTION is a tree for the called function. It is used only for
2105 error messages, where it is formatted with %qE.
2107 This is also where warnings about wrong number of args are generated.
2109 Both VALUES and the returned value are chains of TREE_LIST nodes
2110 with the elements of the list in the TREE_VALUE slots of those nodes. */
2113 convert_arguments (tree typelist, tree values, tree function, tree fundecl)
2115 tree typetail, valtail;
2120 /* Change pointer to function to the function itself for
2122 if (TREE_CODE (function) == ADDR_EXPR
2123 && TREE_CODE (TREE_OPERAND (function, 0)) == FUNCTION_DECL)
2124 function = TREE_OPERAND (function, 0);
2126 /* Handle an ObjC selector specially for diagnostics. */
2127 selector = objc_message_selector ();
2129 /* Scan the given expressions and types, producing individual
2130 converted arguments and pushing them on RESULT in reverse order. */
2132 for (valtail = values, typetail = typelist, parmnum = 0;
2134 valtail = TREE_CHAIN (valtail), parmnum++)
2136 tree type = typetail ? TREE_VALUE (typetail) : 0;
2137 tree val = TREE_VALUE (valtail);
2138 tree rname = function;
2139 int argnum = parmnum + 1;
2140 const char *invalid_func_diag;
2142 if (type == void_type_node)
2144 error ("too many arguments to function %qE", function);
2148 if (selector && argnum > 2)
2154 STRIP_TYPE_NOPS (val);
2156 val = require_complete_type (val);
2160 /* Formal parm type is specified by a function prototype. */
2163 if (type == error_mark_node || !COMPLETE_TYPE_P (type))
2165 error ("type of formal parameter %d is incomplete", parmnum + 1);
2170 /* Optionally warn about conversions that
2171 differ from the default conversions. */
2172 if (warn_conversion || warn_traditional)
2174 unsigned int formal_prec = TYPE_PRECISION (type);
2176 if (INTEGRAL_TYPE_P (type)
2177 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
2178 warning (0, "passing argument %d of %qE as integer "
2179 "rather than floating due to prototype",
2181 if (INTEGRAL_TYPE_P (type)
2182 && TREE_CODE (TREE_TYPE (val)) == COMPLEX_TYPE)
2183 warning (0, "passing argument %d of %qE as integer "
2184 "rather than complex due to prototype",
2186 else if (TREE_CODE (type) == COMPLEX_TYPE
2187 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
2188 warning (0, "passing argument %d of %qE as complex "
2189 "rather than floating due to prototype",
2191 else if (TREE_CODE (type) == REAL_TYPE
2192 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
2193 warning (0, "passing argument %d of %qE as floating "
2194 "rather than integer due to prototype",
2196 else if (TREE_CODE (type) == COMPLEX_TYPE
2197 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
2198 warning (0, "passing argument %d of %qE as complex "
2199 "rather than integer due to prototype",
2201 else if (TREE_CODE (type) == REAL_TYPE
2202 && TREE_CODE (TREE_TYPE (val)) == COMPLEX_TYPE)
2203 warning (0, "passing argument %d of %qE as floating "
2204 "rather than complex due to prototype",
2206 /* ??? At some point, messages should be written about
2207 conversions between complex types, but that's too messy
2209 else if (TREE_CODE (type) == REAL_TYPE
2210 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
2212 /* Warn if any argument is passed as `float',
2213 since without a prototype it would be `double'. */
2214 if (formal_prec == TYPE_PRECISION (float_type_node))
2215 warning (0, "passing argument %d of %qE as %<float%> "
2216 "rather than %<double%> due to prototype",
2219 /* Detect integer changing in width or signedness.
2220 These warnings are only activated with
2221 -Wconversion, not with -Wtraditional. */
2222 else if (warn_conversion && INTEGRAL_TYPE_P (type)
2223 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
2225 tree would_have_been = default_conversion (val);
2226 tree type1 = TREE_TYPE (would_have_been);
2228 if (TREE_CODE (type) == ENUMERAL_TYPE
2229 && (TYPE_MAIN_VARIANT (type)
2230 == TYPE_MAIN_VARIANT (TREE_TYPE (val))))
2231 /* No warning if function asks for enum
2232 and the actual arg is that enum type. */
2234 else if (formal_prec != TYPE_PRECISION (type1))
2235 warning (0, "passing argument %d of %qE with different "
2236 "width due to prototype", argnum, rname);
2237 else if (TYPE_UNSIGNED (type) == TYPE_UNSIGNED (type1))
2239 /* Don't complain if the formal parameter type
2240 is an enum, because we can't tell now whether
2241 the value was an enum--even the same enum. */
2242 else if (TREE_CODE (type) == ENUMERAL_TYPE)
2244 else if (TREE_CODE (val) == INTEGER_CST
2245 && int_fits_type_p (val, type))
2246 /* Change in signedness doesn't matter
2247 if a constant value is unaffected. */
2249 /* If the value is extended from a narrower
2250 unsigned type, it doesn't matter whether we
2251 pass it as signed or unsigned; the value
2252 certainly is the same either way. */
2253 else if (TYPE_PRECISION (TREE_TYPE (val)) < TYPE_PRECISION (type)
2254 && TYPE_UNSIGNED (TREE_TYPE (val)))
2256 else if (TYPE_UNSIGNED (type))
2257 warning (0, "passing argument %d of %qE as unsigned "
2258 "due to prototype", argnum, rname);
2260 warning (0, "passing argument %d of %qE as signed "
2261 "due to prototype", argnum, rname);
2265 parmval = convert_for_assignment (type, val, ic_argpass,
2269 if (targetm.calls.promote_prototypes (fundecl ? TREE_TYPE (fundecl) : 0)
2270 && INTEGRAL_TYPE_P (type)
2271 && (TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node)))
2272 parmval = default_conversion (parmval);
2274 result = tree_cons (NULL_TREE, parmval, result);
2276 else if (TREE_CODE (TREE_TYPE (val)) == REAL_TYPE
2277 && (TYPE_PRECISION (TREE_TYPE (val))
2278 < TYPE_PRECISION (double_type_node)))
2279 /* Convert `float' to `double'. */
2280 result = tree_cons (NULL_TREE, convert (double_type_node, val), result);
2281 else if ((invalid_func_diag =
2282 targetm.calls.invalid_arg_for_unprototyped_fn (typelist, fundecl, val)))
2284 error (invalid_func_diag);
2285 return error_mark_node;
2288 /* Convert `short' and `char' to full-size `int'. */
2289 result = tree_cons (NULL_TREE, default_conversion (val), result);
2292 typetail = TREE_CHAIN (typetail);
2295 if (typetail != 0 && TREE_VALUE (typetail) != void_type_node)
2297 error ("too few arguments to function %qE", function);
2298 return error_mark_node;
2301 return nreverse (result);
2304 /* This is the entry point used by the parser to build unary operators
2305 in the input. CODE, a tree_code, specifies the unary operator, and
2306 ARG is the operand. For unary plus, the C parser currently uses
2307 CONVERT_EXPR for code. */
2310 parser_build_unary_op (enum tree_code code, struct c_expr arg)
2312 struct c_expr result;
2314 result.original_code = ERROR_MARK;
2315 result.value = build_unary_op (code, arg.value, 0);
2316 overflow_warning (result.value);
2320 /* This is the entry point used by the parser to build binary operators
2321 in the input. CODE, a tree_code, specifies the binary operator, and
2322 ARG1 and ARG2 are the operands. In addition to constructing the
2323 expression, we check for operands that were written with other binary
2324 operators in a way that is likely to confuse the user. */
2327 parser_build_binary_op (enum tree_code code, struct c_expr arg1,
2330 struct c_expr result;
2332 enum tree_code code1 = arg1.original_code;
2333 enum tree_code code2 = arg2.original_code;
2335 result.value = build_binary_op (code, arg1.value, arg2.value, 1);
2336 result.original_code = code;
2338 if (TREE_CODE (result.value) == ERROR_MARK)
2341 /* Check for cases such as x+y<<z which users are likely
2343 if (warn_parentheses)
2345 if (code == LSHIFT_EXPR || code == RSHIFT_EXPR)
2347 if (code1 == PLUS_EXPR || code1 == MINUS_EXPR
2348 || code2 == PLUS_EXPR || code2 == MINUS_EXPR)
2349 warning (0, "suggest parentheses around + or - inside shift");
2352 if (code == TRUTH_ORIF_EXPR)
2354 if (code1 == TRUTH_ANDIF_EXPR
2355 || code2 == TRUTH_ANDIF_EXPR)
2356 warning (0, "suggest parentheses around && within ||");
2359 if (code == BIT_IOR_EXPR)
2361 if (code1 == BIT_AND_EXPR || code1 == BIT_XOR_EXPR
2362 || code1 == PLUS_EXPR || code1 == MINUS_EXPR
2363 || code2 == BIT_AND_EXPR || code2 == BIT_XOR_EXPR
2364 || code2 == PLUS_EXPR || code2 == MINUS_EXPR)
2365 warning (0, "suggest parentheses around arithmetic in operand of |");
2366 /* Check cases like x|y==z */
2367 if (TREE_CODE_CLASS (code1) == tcc_comparison
2368 || TREE_CODE_CLASS (code2) == tcc_comparison)
2369 warning (0, "suggest parentheses around comparison in operand of |");
2372 if (code == BIT_XOR_EXPR)
2374 if (code1 == BIT_AND_EXPR
2375 || code1 == PLUS_EXPR || code1 == MINUS_EXPR
2376 || code2 == BIT_AND_EXPR
2377 || code2 == PLUS_EXPR || code2 == MINUS_EXPR)
2378 warning (0, "suggest parentheses around arithmetic in operand of ^");
2379 /* Check cases like x^y==z */
2380 if (TREE_CODE_CLASS (code1) == tcc_comparison
2381 || TREE_CODE_CLASS (code2) == tcc_comparison)
2382 warning (0, "suggest parentheses around comparison in operand of ^");
2385 if (code == BIT_AND_EXPR)
2387 if (code1 == PLUS_EXPR || code1 == MINUS_EXPR
2388 || code2 == PLUS_EXPR || code2 == MINUS_EXPR)
2389 warning (0, "suggest parentheses around + or - in operand of &");
2390 /* Check cases like x&y==z */
2391 if (TREE_CODE_CLASS (code1) == tcc_comparison
2392 || TREE_CODE_CLASS (code2) == tcc_comparison)
2393 warning (0, "suggest parentheses around comparison in operand of &");
2395 /* Similarly, check for cases like 1<=i<=10 that are probably errors. */
2396 if (TREE_CODE_CLASS (code) == tcc_comparison
2397 && (TREE_CODE_CLASS (code1) == tcc_comparison
2398 || TREE_CODE_CLASS (code2) == tcc_comparison))
2399 warning (0, "comparisons like X<=Y<=Z do not have their mathematical meaning");
2403 unsigned_conversion_warning (result.value, arg1.value);
2404 unsigned_conversion_warning (result.value, arg2.value);
2405 overflow_warning (result.value);
2410 /* Return a tree for the difference of pointers OP0 and OP1.
2411 The resulting tree has type int. */
2414 pointer_diff (tree op0, tree op1)
2416 tree restype = ptrdiff_type_node;
2418 tree target_type = TREE_TYPE (TREE_TYPE (op0));
2419 tree con0, con1, lit0, lit1;
2420 tree orig_op1 = op1;
2422 if (pedantic || warn_pointer_arith)
2424 if (TREE_CODE (target_type) == VOID_TYPE)
2425 pedwarn ("pointer of type %<void *%> used in subtraction");
2426 if (TREE_CODE (target_type) == FUNCTION_TYPE)
2427 pedwarn ("pointer to a function used in subtraction");
2430 /* If the conversion to ptrdiff_type does anything like widening or
2431 converting a partial to an integral mode, we get a convert_expression
2432 that is in the way to do any simplifications.
2433 (fold-const.c doesn't know that the extra bits won't be needed.
2434 split_tree uses STRIP_SIGN_NOPS, which leaves conversions to a
2435 different mode in place.)
2436 So first try to find a common term here 'by hand'; we want to cover
2437 at least the cases that occur in legal static initializers. */
2438 con0 = TREE_CODE (op0) == NOP_EXPR ? TREE_OPERAND (op0, 0) : op0;
2439 con1 = TREE_CODE (op1) == NOP_EXPR ? TREE_OPERAND (op1, 0) : op1;
2441 if (TREE_CODE (con0) == PLUS_EXPR)
2443 lit0 = TREE_OPERAND (con0, 1);
2444 con0 = TREE_OPERAND (con0, 0);
2447 lit0 = integer_zero_node;
2449 if (TREE_CODE (con1) == PLUS_EXPR)
2451 lit1 = TREE_OPERAND (con1, 1);
2452 con1 = TREE_OPERAND (con1, 0);
2455 lit1 = integer_zero_node;
2457 if (operand_equal_p (con0, con1, 0))
2464 /* First do the subtraction as integers;
2465 then drop through to build the divide operator.
2466 Do not do default conversions on the minus operator
2467 in case restype is a short type. */
2469 op0 = build_binary_op (MINUS_EXPR, convert (restype, op0),
2470 convert (restype, op1), 0);
2471 /* This generates an error if op1 is pointer to incomplete type. */
2472 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (TREE_TYPE (orig_op1))))
2473 error ("arithmetic on pointer to an incomplete type");
2475 /* This generates an error if op0 is pointer to incomplete type. */
2476 op1 = c_size_in_bytes (target_type);
2478 /* Divide by the size, in easiest possible way. */
2479 return fold (build2 (EXACT_DIV_EXPR, restype, op0, convert (restype, op1)));
2482 /* Construct and perhaps optimize a tree representation
2483 for a unary operation. CODE, a tree_code, specifies the operation
2484 and XARG is the operand.
2485 For any CODE other than ADDR_EXPR, FLAG nonzero suppresses
2486 the default promotions (such as from short to int).
2487 For ADDR_EXPR, the default promotions are not applied; FLAG nonzero
2488 allows non-lvalues; this is only used to handle conversion of non-lvalue
2489 arrays to pointers in C99. */
2492 build_unary_op (enum tree_code code, tree xarg, int flag)
2494 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
2497 enum tree_code typecode = TREE_CODE (TREE_TYPE (arg));
2499 int noconvert = flag;
2501 if (typecode == ERROR_MARK)
2502 return error_mark_node;
2503 if (typecode == ENUMERAL_TYPE || typecode == BOOLEAN_TYPE)
2504 typecode = INTEGER_TYPE;
2509 /* This is used for unary plus, because a CONVERT_EXPR
2510 is enough to prevent anybody from looking inside for
2511 associativity, but won't generate any code. */
2512 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2513 || typecode == COMPLEX_TYPE
2514 || typecode == VECTOR_TYPE))
2516 error ("wrong type argument to unary plus");
2517 return error_mark_node;
2519 else if (!noconvert)
2520 arg = default_conversion (arg);
2521 arg = non_lvalue (arg);
2525 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2526 || typecode == COMPLEX_TYPE
2527 || typecode == VECTOR_TYPE))
2529 error ("wrong type argument to unary minus");
2530 return error_mark_node;
2532 else if (!noconvert)
2533 arg = default_conversion (arg);
2537 if (typecode == INTEGER_TYPE || typecode == VECTOR_TYPE)
2540 arg = default_conversion (arg);
2542 else if (typecode == COMPLEX_TYPE)
2546 pedwarn ("ISO C does not support %<~%> for complex conjugation");
2548 arg = default_conversion (arg);
2552 error ("wrong type argument to bit-complement");
2553 return error_mark_node;
2558 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE))
2560 error ("wrong type argument to abs");
2561 return error_mark_node;
2563 else if (!noconvert)
2564 arg = default_conversion (arg);
2568 /* Conjugating a real value is a no-op, but allow it anyway. */
2569 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2570 || typecode == COMPLEX_TYPE))
2572 error ("wrong type argument to conjugation");
2573 return error_mark_node;
2575 else if (!noconvert)
2576 arg = default_conversion (arg);
2579 case TRUTH_NOT_EXPR:
2580 if (typecode != INTEGER_TYPE
2581 && typecode != REAL_TYPE && typecode != POINTER_TYPE
2582 && typecode != COMPLEX_TYPE)
2584 error ("wrong type argument to unary exclamation mark");
2585 return error_mark_node;
2587 arg = c_objc_common_truthvalue_conversion (arg);
2588 return invert_truthvalue (arg);
2594 if (TREE_CODE (arg) == COMPLEX_CST)
2595 return TREE_REALPART (arg);
2596 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
2597 return fold (build1 (REALPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg));
2602 if (TREE_CODE (arg) == COMPLEX_CST)
2603 return TREE_IMAGPART (arg);
2604 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
2605 return fold (build1 (IMAGPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg));
2607 return convert (TREE_TYPE (arg), integer_zero_node);
2609 case PREINCREMENT_EXPR:
2610 case POSTINCREMENT_EXPR:
2611 case PREDECREMENT_EXPR:
2612 case POSTDECREMENT_EXPR:
2614 /* Increment or decrement the real part of the value,
2615 and don't change the imaginary part. */
2616 if (typecode == COMPLEX_TYPE)
2621 pedwarn ("ISO C does not support %<++%> and %<--%>"
2622 " on complex types");
2624 arg = stabilize_reference (arg);
2625 real = build_unary_op (REALPART_EXPR, arg, 1);
2626 imag = build_unary_op (IMAGPART_EXPR, arg, 1);
2627 return build2 (COMPLEX_EXPR, TREE_TYPE (arg),
2628 build_unary_op (code, real, 1), imag);
2631 /* Report invalid types. */
2633 if (typecode != POINTER_TYPE
2634 && typecode != INTEGER_TYPE && typecode != REAL_TYPE)
2636 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
2637 error ("wrong type argument to increment");
2639 error ("wrong type argument to decrement");
2641 return error_mark_node;
2646 tree result_type = TREE_TYPE (arg);
2648 arg = get_unwidened (arg, 0);
2649 argtype = TREE_TYPE (arg);
2651 /* Compute the increment. */
2653 if (typecode == POINTER_TYPE)
2655 /* If pointer target is an undefined struct,
2656 we just cannot know how to do the arithmetic. */
2657 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (result_type)))
2659 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
2660 error ("increment of pointer to unknown structure");
2662 error ("decrement of pointer to unknown structure");
2664 else if ((pedantic || warn_pointer_arith)
2665 && (TREE_CODE (TREE_TYPE (result_type)) == FUNCTION_TYPE
2666 || TREE_CODE (TREE_TYPE (result_type)) == VOID_TYPE))
2668 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
2669 pedwarn ("wrong type argument to increment");
2671 pedwarn ("wrong type argument to decrement");
2674 inc = c_size_in_bytes (TREE_TYPE (result_type));
2677 inc = integer_one_node;
2679 inc = convert (argtype, inc);
2681 /* Complain about anything else that is not a true lvalue. */
2682 if (!lvalue_or_else (arg, ((code == PREINCREMENT_EXPR
2683 || code == POSTINCREMENT_EXPR)
2686 return error_mark_node;
2688 /* Report a read-only lvalue. */
2689 if (TREE_READONLY (arg))
2690 readonly_error (arg,
2691 ((code == PREINCREMENT_EXPR
2692 || code == POSTINCREMENT_EXPR)
2693 ? lv_increment : lv_decrement));
2695 if (TREE_CODE (TREE_TYPE (arg)) == BOOLEAN_TYPE)
2696 val = boolean_increment (code, arg);
2698 val = build2 (code, TREE_TYPE (arg), arg, inc);
2699 TREE_SIDE_EFFECTS (val) = 1;
2700 val = convert (result_type, val);
2701 if (TREE_CODE (val) != code)
2702 TREE_NO_WARNING (val) = 1;
2707 /* Note that this operation never does default_conversion. */
2709 /* Let &* cancel out to simplify resulting code. */
2710 if (TREE_CODE (arg) == INDIRECT_REF)
2712 /* Don't let this be an lvalue. */
2713 if (lvalue_p (TREE_OPERAND (arg, 0)))
2714 return non_lvalue (TREE_OPERAND (arg, 0));
2715 return TREE_OPERAND (arg, 0);
2718 /* For &x[y], return x+y */
2719 if (TREE_CODE (arg) == ARRAY_REF)
2721 if (!c_mark_addressable (TREE_OPERAND (arg, 0)))
2722 return error_mark_node;
2723 return build_binary_op (PLUS_EXPR,
2724 default_function_array_conversion
2725 (TREE_OPERAND (arg, 0)),
2726 TREE_OPERAND (arg, 1), 1);
2729 /* Anything not already handled and not a true memory reference
2730 or a non-lvalue array is an error. */
2731 else if (typecode != FUNCTION_TYPE && !flag
2732 && !lvalue_or_else (arg, lv_addressof))
2733 return error_mark_node;
2735 /* Ordinary case; arg is a COMPONENT_REF or a decl. */
2736 argtype = TREE_TYPE (arg);
2738 /* If the lvalue is const or volatile, merge that into the type
2739 to which the address will point. Note that you can't get a
2740 restricted pointer by taking the address of something, so we
2741 only have to deal with `const' and `volatile' here. */
2742 if ((DECL_P (arg) || REFERENCE_CLASS_P (arg))
2743 && (TREE_READONLY (arg) || TREE_THIS_VOLATILE (arg)))
2744 argtype = c_build_type_variant (argtype,
2745 TREE_READONLY (arg),
2746 TREE_THIS_VOLATILE (arg));
2748 if (!c_mark_addressable (arg))
2749 return error_mark_node;
2751 gcc_assert (TREE_CODE (arg) != COMPONENT_REF
2752 || !DECL_C_BIT_FIELD (TREE_OPERAND (arg, 1)));
2754 argtype = build_pointer_type (argtype);
2756 /* ??? Cope with user tricks that amount to offsetof. Delete this
2757 when we have proper support for integer constant expressions. */
2758 val = get_base_address (arg);
2759 if (val && TREE_CODE (val) == INDIRECT_REF
2760 && integer_zerop (TREE_OPERAND (val, 0)))
2761 return fold_convert (argtype, fold_offsetof (arg));
2763 val = build1 (ADDR_EXPR, argtype, arg);
2765 if (TREE_CODE (arg) == COMPOUND_LITERAL_EXPR)
2766 TREE_INVARIANT (val) = TREE_CONSTANT (val) = 1;
2775 argtype = TREE_TYPE (arg);
2776 val = build1 (code, argtype, arg);
2777 return require_constant_value ? fold_initializer (val) : fold (val);
2780 /* Return nonzero if REF is an lvalue valid for this language.
2781 Lvalues can be assigned, unless their type has TYPE_READONLY.
2782 Lvalues can have their address taken, unless they have C_DECL_REGISTER. */
2787 enum tree_code code = TREE_CODE (ref);
2794 return lvalue_p (TREE_OPERAND (ref, 0));
2796 case COMPOUND_LITERAL_EXPR:
2806 return (TREE_CODE (TREE_TYPE (ref)) != FUNCTION_TYPE
2807 && TREE_CODE (TREE_TYPE (ref)) != METHOD_TYPE);
2810 return TREE_CODE (TREE_TYPE (ref)) == ARRAY_TYPE;
2817 /* Give an error for storing in something that is 'const'. */
2820 readonly_error (tree arg, enum lvalue_use use)
2822 gcc_assert (use == lv_assign || use == lv_increment || use == lv_decrement);
2823 /* Using this macro rather than (for example) arrays of messages
2824 ensures that all the format strings are checked at compile
2826 #define READONLY_MSG(A, I, D) (use == lv_assign \
2828 : (use == lv_increment ? (I) : (D)))
2829 if (TREE_CODE (arg) == COMPONENT_REF)
2831 if (TYPE_READONLY (TREE_TYPE (TREE_OPERAND (arg, 0))))
2832 readonly_error (TREE_OPERAND (arg, 0), use);
2834 error (READONLY_MSG (G_("assignment of read-only member %qD"),
2835 G_("increment of read-only member %qD"),
2836 G_("decrement of read-only member %qD")),
2837 TREE_OPERAND (arg, 1));
2839 else if (TREE_CODE (arg) == VAR_DECL)
2840 error (READONLY_MSG (G_("assignment of read-only variable %qD"),
2841 G_("increment of read-only variable %qD"),
2842 G_("decrement of read-only variable %qD")),
2845 error (READONLY_MSG (G_("assignment of read-only location"),
2846 G_("increment of read-only location"),
2847 G_("decrement of read-only location")));
2851 /* Return nonzero if REF is an lvalue valid for this language;
2852 otherwise, print an error message and return zero. USE says
2853 how the lvalue is being used and so selects the error message. */
2856 lvalue_or_else (tree ref, enum lvalue_use use)
2858 int win = lvalue_p (ref);
2866 /* Mark EXP saying that we need to be able to take the
2867 address of it; it should not be allocated in a register.
2868 Returns true if successful. */
2871 c_mark_addressable (tree exp)
2876 switch (TREE_CODE (x))
2879 if (DECL_C_BIT_FIELD (TREE_OPERAND (x, 1)))
2882 ("cannot take address of bit-field %qD", TREE_OPERAND (x, 1));
2886 /* ... fall through ... */
2892 x = TREE_OPERAND (x, 0);
2895 case COMPOUND_LITERAL_EXPR:
2897 TREE_ADDRESSABLE (x) = 1;
2904 if (C_DECL_REGISTER (x)
2905 && DECL_NONLOCAL (x))
2907 if (TREE_PUBLIC (x) || TREE_STATIC (x) || DECL_EXTERNAL (x))
2910 ("global register variable %qD used in nested function", x);
2913 pedwarn ("register variable %qD used in nested function", x);
2915 else if (C_DECL_REGISTER (x))
2917 if (TREE_PUBLIC (x) || TREE_STATIC (x) || DECL_EXTERNAL (x))
2918 error ("address of global register variable %qD requested", x);
2920 error ("address of register variable %qD requested", x);
2926 TREE_ADDRESSABLE (x) = 1;
2933 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
2936 build_conditional_expr (tree ifexp, tree op1, tree op2)
2940 enum tree_code code1;
2941 enum tree_code code2;
2942 tree result_type = NULL;
2943 tree orig_op1 = op1, orig_op2 = op2;
2945 /* Promote both alternatives. */
2947 if (TREE_CODE (TREE_TYPE (op1)) != VOID_TYPE)
2948 op1 = default_conversion (op1);
2949 if (TREE_CODE (TREE_TYPE (op2)) != VOID_TYPE)
2950 op2 = default_conversion (op2);
2952 if (TREE_CODE (ifexp) == ERROR_MARK
2953 || TREE_CODE (TREE_TYPE (op1)) == ERROR_MARK
2954 || TREE_CODE (TREE_TYPE (op2)) == ERROR_MARK)
2955 return error_mark_node;
2957 type1 = TREE_TYPE (op1);
2958 code1 = TREE_CODE (type1);
2959 type2 = TREE_TYPE (op2);
2960 code2 = TREE_CODE (type2);
2962 /* C90 does not permit non-lvalue arrays in conditional expressions.
2963 In C99 they will be pointers by now. */
2964 if (code1 == ARRAY_TYPE || code2 == ARRAY_TYPE)
2966 error ("non-lvalue array in conditional expression");
2967 return error_mark_node;
2970 /* Quickly detect the usual case where op1 and op2 have the same type
2972 if (TYPE_MAIN_VARIANT (type1) == TYPE_MAIN_VARIANT (type2))
2975 result_type = type1;
2977 result_type = TYPE_MAIN_VARIANT (type1);
2979 else if ((code1 == INTEGER_TYPE || code1 == REAL_TYPE
2980 || code1 == COMPLEX_TYPE)
2981 && (code2 == INTEGER_TYPE || code2 == REAL_TYPE
2982 || code2 == COMPLEX_TYPE))
2984 result_type = c_common_type (type1, type2);
2986 /* If -Wsign-compare, warn here if type1 and type2 have
2987 different signedness. We'll promote the signed to unsigned
2988 and later code won't know it used to be different.
2989 Do this check on the original types, so that explicit casts
2990 will be considered, but default promotions won't. */
2991 if (warn_sign_compare && !skip_evaluation)
2993 int unsigned_op1 = TYPE_UNSIGNED (TREE_TYPE (orig_op1));
2994 int unsigned_op2 = TYPE_UNSIGNED (TREE_TYPE (orig_op2));
2996 if (unsigned_op1 ^ unsigned_op2)
2998 /* Do not warn if the result type is signed, since the
2999 signed type will only be chosen if it can represent
3000 all the values of the unsigned type. */
3001 if (!TYPE_UNSIGNED (result_type))
3003 /* Do not warn if the signed quantity is an unsuffixed
3004 integer literal (or some static constant expression
3005 involving such literals) and it is non-negative. */
3006 else if ((unsigned_op2 && tree_expr_nonnegative_p (op1))
3007 || (unsigned_op1 && tree_expr_nonnegative_p (op2)))
3010 warning (0, "signed and unsigned type in conditional expression");
3014 else if (code1 == VOID_TYPE || code2 == VOID_TYPE)
3016 if (pedantic && (code1 != VOID_TYPE || code2 != VOID_TYPE))
3017 pedwarn ("ISO C forbids conditional expr with only one void side");
3018 result_type = void_type_node;
3020 else if (code1 == POINTER_TYPE && code2 == POINTER_TYPE)
3022 if (comp_target_types (type1, type2))
3023 result_type = common_pointer_type (type1, type2);
3024 else if (integer_zerop (op1) && TREE_TYPE (type1) == void_type_node
3025 && TREE_CODE (orig_op1) != NOP_EXPR)
3026 result_type = qualify_type (type2, type1);
3027 else if (integer_zerop (op2) && TREE_TYPE (type2) == void_type_node
3028 && TREE_CODE (orig_op2) != NOP_EXPR)
3029 result_type = qualify_type (type1, type2);
3030 else if (VOID_TYPE_P (TREE_TYPE (type1)))
3032 if (pedantic && TREE_CODE (TREE_TYPE (type2)) == FUNCTION_TYPE)
3033 pedwarn ("ISO C forbids conditional expr between "
3034 "%<void *%> and function pointer");
3035 result_type = build_pointer_type (qualify_type (TREE_TYPE (type1),
3036 TREE_TYPE (type2)));
3038 else if (VOID_TYPE_P (TREE_TYPE (type2)))
3040 if (pedantic && TREE_CODE (TREE_TYPE (type1)) == FUNCTION_TYPE)
3041 pedwarn ("ISO C forbids conditional expr between "
3042 "%<void *%> and function pointer");
3043 result_type = build_pointer_type (qualify_type (TREE_TYPE (type2),
3044 TREE_TYPE (type1)));
3048 pedwarn ("pointer type mismatch in conditional expression");
3049 result_type = build_pointer_type (void_type_node);
3052 else if (code1 == POINTER_TYPE && code2 == INTEGER_TYPE)
3054 if (!integer_zerop (op2))
3055 pedwarn ("pointer/integer type mismatch in conditional expression");
3058 op2 = null_pointer_node;
3060 result_type = type1;
3062 else if (code2 == POINTER_TYPE && code1 == INTEGER_TYPE)
3064 if (!integer_zerop (op1))
3065 pedwarn ("pointer/integer type mismatch in conditional expression");
3068 op1 = null_pointer_node;
3070 result_type = type2;
3075 if (flag_cond_mismatch)
3076 result_type = void_type_node;
3079 error ("type mismatch in conditional expression");
3080 return error_mark_node;
3084 /* Merge const and volatile flags of the incoming types. */
3086 = build_type_variant (result_type,
3087 TREE_READONLY (op1) || TREE_READONLY (op2),
3088 TREE_THIS_VOLATILE (op1) || TREE_THIS_VOLATILE (op2));
3090 if (result_type != TREE_TYPE (op1))
3091 op1 = convert_and_check (result_type, op1);
3092 if (result_type != TREE_TYPE (op2))
3093 op2 = convert_and_check (result_type, op2);
3095 return fold_build3 (COND_EXPR, result_type, ifexp, op1, op2);
3098 /* Return a compound expression that performs two expressions and
3099 returns the value of the second of them. */
3102 build_compound_expr (tree expr1, tree expr2)
3104 if (!TREE_SIDE_EFFECTS (expr1))
3106 /* The left-hand operand of a comma expression is like an expression
3107 statement: with -Wextra or -Wunused, we should warn if it doesn't have
3108 any side-effects, unless it was explicitly cast to (void). */
3109 if (warn_unused_value)
3111 if (VOID_TYPE_P (TREE_TYPE (expr1))
3112 && TREE_CODE (expr1) == CONVERT_EXPR)
3114 else if (VOID_TYPE_P (TREE_TYPE (expr1))
3115 && TREE_CODE (expr1) == COMPOUND_EXPR
3116 && TREE_CODE (TREE_OPERAND (expr1, 1)) == CONVERT_EXPR)
3117 ; /* (void) a, (void) b, c */
3119 warning (0, "left-hand operand of comma expression has no effect");
3123 /* With -Wunused, we should also warn if the left-hand operand does have
3124 side-effects, but computes a value which is not used. For example, in
3125 `foo() + bar(), baz()' the result of the `+' operator is not used,
3126 so we should issue a warning. */
3127 else if (warn_unused_value)
3128 warn_if_unused_value (expr1, input_location);
3130 return build2 (COMPOUND_EXPR, TREE_TYPE (expr2), expr1, expr2);
3133 /* Build an expression representing a cast to type TYPE of expression EXPR. */
3136 build_c_cast (tree type, tree expr)
3140 if (type == error_mark_node || expr == error_mark_node)
3141 return error_mark_node;
3143 /* The ObjC front-end uses TYPE_MAIN_VARIANT to tie together types differing
3144 only in <protocol> qualifications. But when constructing cast expressions,
3145 the protocols do matter and must be kept around. */
3146 if (objc_is_object_ptr (type) && objc_is_object_ptr (TREE_TYPE (expr)))
3147 return build1 (NOP_EXPR, type, expr);
3149 type = TYPE_MAIN_VARIANT (type);
3151 if (TREE_CODE (type) == ARRAY_TYPE)
3153 error ("cast specifies array type");
3154 return error_mark_node;
3157 if (TREE_CODE (type) == FUNCTION_TYPE)
3159 error ("cast specifies function type");
3160 return error_mark_node;
3163 if (type == TYPE_MAIN_VARIANT (TREE_TYPE (value)))
3167 if (TREE_CODE (type) == RECORD_TYPE
3168 || TREE_CODE (type) == UNION_TYPE)
3169 pedwarn ("ISO C forbids casting nonscalar to the same type");
3172 else if (TREE_CODE (type) == UNION_TYPE)
3176 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
3177 if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (field)),
3178 TYPE_MAIN_VARIANT (TREE_TYPE (value))))
3186 pedwarn ("ISO C forbids casts to union type");
3187 t = digest_init (type,
3188 build_constructor (type,
3189 build_tree_list (field, value)),
3191 TREE_CONSTANT (t) = TREE_CONSTANT (value);
3192 TREE_INVARIANT (t) = TREE_INVARIANT (value);
3195 error ("cast to union type from type not present in union");
3196 return error_mark_node;
3202 if (type == void_type_node)
3203 return build1 (CONVERT_EXPR, type, value);
3205 otype = TREE_TYPE (value);
3207 /* Optionally warn about potentially worrisome casts. */
3210 && TREE_CODE (type) == POINTER_TYPE
3211 && TREE_CODE (otype) == POINTER_TYPE)
3213 tree in_type = type;
3214 tree in_otype = otype;
3218 /* Check that the qualifiers on IN_TYPE are a superset of
3219 the qualifiers of IN_OTYPE. The outermost level of
3220 POINTER_TYPE nodes is uninteresting and we stop as soon
3221 as we hit a non-POINTER_TYPE node on either type. */
3224 in_otype = TREE_TYPE (in_otype);
3225 in_type = TREE_TYPE (in_type);
3227 /* GNU C allows cv-qualified function types. 'const'
3228 means the function is very pure, 'volatile' means it
3229 can't return. We need to warn when such qualifiers
3230 are added, not when they're taken away. */
3231 if (TREE_CODE (in_otype) == FUNCTION_TYPE
3232 && TREE_CODE (in_type) == FUNCTION_TYPE)
3233 added |= (TYPE_QUALS (in_type) & ~TYPE_QUALS (in_otype));
3235 discarded |= (TYPE_QUALS (in_otype) & ~TYPE_QUALS (in_type));
3237 while (TREE_CODE (in_type) == POINTER_TYPE
3238 && TREE_CODE (in_otype) == POINTER_TYPE);
3241 warning (0, "cast adds new qualifiers to function type");
3244 /* There are qualifiers present in IN_OTYPE that are not
3245 present in IN_TYPE. */
3246 warning (0, "cast discards qualifiers from pointer target type");
3249 /* Warn about possible alignment problems. */
3250 if (STRICT_ALIGNMENT && warn_cast_align
3251 && TREE_CODE (type) == POINTER_TYPE
3252 && TREE_CODE (otype) == POINTER_TYPE
3253 && TREE_CODE (TREE_TYPE (otype)) != VOID_TYPE
3254 && TREE_CODE (TREE_TYPE (otype)) != FUNCTION_TYPE
3255 /* Don't warn about opaque types, where the actual alignment
3256 restriction is unknown. */
3257 && !((TREE_CODE (TREE_TYPE (otype)) == UNION_TYPE
3258 || TREE_CODE (TREE_TYPE (otype)) == RECORD_TYPE)
3259 && TYPE_MODE (TREE_TYPE (otype)) == VOIDmode)
3260 && TYPE_ALIGN (TREE_TYPE (type)) > TYPE_ALIGN (TREE_TYPE (otype)))
3261 warning (0, "cast increases required alignment of target type");
3263 if (warn_pointer_to_int_cast
3264 && TREE_CODE (type) == INTEGER_TYPE
3265 && TREE_CODE (otype) == POINTER_TYPE
3266 && TYPE_PRECISION (type) != TYPE_PRECISION (otype)
3267 && !TREE_CONSTANT (value))
3268 warning (0, "cast from pointer to integer of different size");
3270 if (warn_bad_function_cast
3271 && TREE_CODE (value) == CALL_EXPR
3272 && TREE_CODE (type) != TREE_CODE (otype))
3273 warning (0, "cast from function call of type %qT to non-matching "
3274 "type %qT", otype, type);
3276 if (warn_int_to_pointer_cast
3277 && TREE_CODE (type) == POINTER_TYPE
3278 && TREE_CODE (otype) == INTEGER_TYPE
3279 && TYPE_PRECISION (type) != TYPE_PRECISION (otype)
3280 /* Don't warn about converting any constant. */
3281 && !TREE_CONSTANT (value))
3282 warning (0, "cast to pointer from integer of different size");
3284 if (flag_strict_aliasing && warn_strict_aliasing
3285 && TREE_CODE (type) == POINTER_TYPE
3286 && TREE_CODE (otype) == POINTER_TYPE
3287 && TREE_CODE (expr) == ADDR_EXPR
3288 && (DECL_P (TREE_OPERAND (expr, 0))
3289 || TREE_CODE (TREE_OPERAND (expr, 0)) == COMPONENT_REF)
3290 && !VOID_TYPE_P (TREE_TYPE (type)))
3292 /* Casting the address of an object to non void pointer. Warn
3293 if the cast breaks type based aliasing. */
3294 if (!COMPLETE_TYPE_P (TREE_TYPE (type)))
3295 warning (0, "type-punning to incomplete type might break strict-aliasing rules");
3298 HOST_WIDE_INT set1 = get_alias_set (TREE_TYPE (TREE_OPERAND (expr, 0)));
3299 HOST_WIDE_INT set2 = get_alias_set (TREE_TYPE (type));
3301 if (!alias_sets_conflict_p (set1, set2))
3302 warning (0, "dereferencing type-punned pointer will break strict-aliasing rules");
3303 else if (warn_strict_aliasing > 1
3304 && !alias_sets_might_conflict_p (set1, set2))
3305 warning (0, "dereferencing type-punned pointer might break strict-aliasing rules");
3309 /* If pedantic, warn for conversions between function and object
3310 pointer types, except for converting a null pointer constant
3311 to function pointer type. */
3313 && TREE_CODE (type) == POINTER_TYPE
3314 && TREE_CODE (otype) == POINTER_TYPE
3315 && TREE_CODE (TREE_TYPE (otype)) == FUNCTION_TYPE
3316 && TREE_CODE (TREE_TYPE (type)) != FUNCTION_TYPE)
3317 pedwarn ("ISO C forbids conversion of function pointer to object pointer type");
3320 && TREE_CODE (type) == POINTER_TYPE
3321 && TREE_CODE (otype) == POINTER_TYPE
3322 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE
3323 && TREE_CODE (TREE_TYPE (otype)) != FUNCTION_TYPE
3324 && !(integer_zerop (value) && TREE_TYPE (otype) == void_type_node
3325 && TREE_CODE (expr) != NOP_EXPR))
3326 pedwarn ("ISO C forbids conversion of object pointer to function pointer type");
3329 value = convert (type, value);
3331 /* Ignore any integer overflow caused by the cast. */
3332 if (TREE_CODE (value) == INTEGER_CST)
3334 /* If OVALUE had overflow set, then so will VALUE, so it
3335 is safe to overwrite. */
3336 if (CONSTANT_CLASS_P (ovalue))
3338 TREE_OVERFLOW (value) = TREE_OVERFLOW (ovalue);
3339 /* Similarly, constant_overflow cannot have become cleared. */
3340 TREE_CONSTANT_OVERFLOW (value) = TREE_CONSTANT_OVERFLOW (ovalue);
3343 TREE_OVERFLOW (value) = 0;
3347 /* Don't let a cast be an lvalue. */
3349 value = non_lvalue (value);
3354 /* Interpret a cast of expression EXPR to type TYPE. */
3356 c_cast_expr (struct c_type_name *type_name, tree expr)
3359 int saved_wsp = warn_strict_prototypes;
3361 /* This avoids warnings about unprototyped casts on
3362 integers. E.g. "#define SIG_DFL (void(*)())0". */
3363 if (TREE_CODE (expr) == INTEGER_CST)
3364 warn_strict_prototypes = 0;
3365 type = groktypename (type_name);
3366 warn_strict_prototypes = saved_wsp;
3368 return build_c_cast (type, expr);
3372 /* Build an assignment expression of lvalue LHS from value RHS.
3373 MODIFYCODE is the code for a binary operator that we use
3374 to combine the old value of LHS with RHS to get the new value.
3375 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment. */
3378 build_modify_expr (tree lhs, enum tree_code modifycode, tree rhs)
3382 tree lhstype = TREE_TYPE (lhs);
3383 tree olhstype = lhstype;
3385 /* Types that aren't fully specified cannot be used in assignments. */
3386 lhs = require_complete_type (lhs);
3388 /* Avoid duplicate error messages from operands that had errors. */
3389 if (TREE_CODE (lhs) == ERROR_MARK || TREE_CODE (rhs) == ERROR_MARK)
3390 return error_mark_node;
3392 STRIP_TYPE_NOPS (rhs);
3396 /* If a binary op has been requested, combine the old LHS value with the RHS
3397 producing the value we should actually store into the LHS. */
3399 if (modifycode != NOP_EXPR)
3401 lhs = stabilize_reference (lhs);
3402 newrhs = build_binary_op (modifycode, lhs, rhs, 1);
3405 if (!lvalue_or_else (lhs, lv_assign))
3406 return error_mark_node;
3408 /* Give an error for storing in something that is 'const'. */
3410 if (TREE_READONLY (lhs) || TYPE_READONLY (lhstype)
3411 || ((TREE_CODE (lhstype) == RECORD_TYPE
3412 || TREE_CODE (lhstype) == UNION_TYPE)
3413 && C_TYPE_FIELDS_READONLY (lhstype)))
3414 readonly_error (lhs, lv_assign);
3416 /* If storing into a structure or union member,
3417 it has probably been given type `int'.
3418 Compute the type that would go with
3419 the actual amount of storage the member occupies. */
3421 if (TREE_CODE (lhs) == COMPONENT_REF
3422 && (TREE_CODE (lhstype) == INTEGER_TYPE
3423 || TREE_CODE (lhstype) == BOOLEAN_TYPE
3424 || TREE_CODE (lhstype) == REAL_TYPE
3425 || TREE_CODE (lhstype) == ENUMERAL_TYPE))
3426 lhstype = TREE_TYPE (get_unwidened (lhs, 0));
3428 /* If storing in a field that is in actuality a short or narrower than one,
3429 we must store in the field in its actual type. */
3431 if (lhstype != TREE_TYPE (lhs))
3433 lhs = copy_node (lhs);
3434 TREE_TYPE (lhs) = lhstype;
3437 /* Convert new value to destination type. */
3439 newrhs = convert_for_assignment (lhstype, newrhs, ic_assign,
3440 NULL_TREE, NULL_TREE, 0);
3441 if (TREE_CODE (newrhs) == ERROR_MARK)
3442 return error_mark_node;
3444 /* Emit ObjC write barrier, if necessary. */
3445 if (c_dialect_objc () && flag_objc_gc)
3447 result = objc_generate_write_barrier (lhs, modifycode, newrhs);
3452 /* Scan operands. */
3454 result = build2 (MODIFY_EXPR, lhstype, lhs, newrhs);
3455 TREE_SIDE_EFFECTS (result) = 1;
3457 /* If we got the LHS in a different type for storing in,
3458 convert the result back to the nominal type of LHS
3459 so that the value we return always has the same type
3460 as the LHS argument. */
3462 if (olhstype == TREE_TYPE (result))
3464 return convert_for_assignment (olhstype, result, ic_assign,
3465 NULL_TREE, NULL_TREE, 0);
3468 /* Convert value RHS to type TYPE as preparation for an assignment
3469 to an lvalue of type TYPE.
3470 The real work of conversion is done by `convert'.
3471 The purpose of this function is to generate error messages
3472 for assignments that are not allowed in C.
3473 ERRTYPE says whether it is argument passing, assignment,
3474 initialization or return.
3476 FUNCTION is a tree for the function being called.
3477 PARMNUM is the number of the argument, for printing in error messages. */
3480 convert_for_assignment (tree type, tree rhs, enum impl_conv errtype,
3481 tree fundecl, tree function, int parmnum)
3483 enum tree_code codel = TREE_CODE (type);
3485 enum tree_code coder;
3486 tree rname = NULL_TREE;
3487 bool objc_ok = false;
3489 if (errtype == ic_argpass || errtype == ic_argpass_nonproto)
3492 /* Change pointer to function to the function itself for
3494 if (TREE_CODE (function) == ADDR_EXPR
3495 && TREE_CODE (TREE_OPERAND (function, 0)) == FUNCTION_DECL)
3496 function = TREE_OPERAND (function, 0);
3498 /* Handle an ObjC selector specially for diagnostics. */
3499 selector = objc_message_selector ();
3501 if (selector && parmnum > 2)
3508 /* This macro is used to emit diagnostics to ensure that all format
3509 strings are complete sentences, visible to gettext and checked at
3511 #define WARN_FOR_ASSIGNMENT(AR, AS, IN, RE) \
3516 pedwarn (AR, parmnum, rname); \
3518 case ic_argpass_nonproto: \
3519 warning (0, AR, parmnum, rname); \
3531 gcc_unreachable (); \
3535 STRIP_TYPE_NOPS (rhs);
3537 if (optimize && TREE_CODE (rhs) == VAR_DECL
3538 && TREE_CODE (TREE_TYPE (rhs)) != ARRAY_TYPE)
3539 rhs = decl_constant_value_for_broken_optimization (rhs);
3541 rhstype = TREE_TYPE (rhs);
3542 coder = TREE_CODE (rhstype);
3544 if (coder == ERROR_MARK)
3545 return error_mark_node;
3547 if (c_dialect_objc ())
3570 objc_ok = objc_compare_types (type, rhstype, parmno, rname);
3573 if (TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (rhstype))
3575 overflow_warning (rhs);
3579 if (coder == VOID_TYPE)
3581 /* Except for passing an argument to an unprototyped function,
3582 this is a constraint violation. When passing an argument to
3583 an unprototyped function, it is compile-time undefined;
3584 making it a constraint in that case was rejected in
3586 error ("void value not ignored as it ought to be");
3587 return error_mark_node;
3589 /* A type converts to a reference to it.
3590 This code doesn't fully support references, it's just for the
3591 special case of va_start and va_copy. */
3592 if (codel == REFERENCE_TYPE
3593 && comptypes (TREE_TYPE (type), TREE_TYPE (rhs)) == 1)
3595 if (!lvalue_p (rhs))
3597 error ("cannot pass rvalue to reference parameter");
3598 return error_mark_node;
3600 if (!c_mark_addressable (rhs))
3601 return error_mark_node;
3602 rhs = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (rhs)), rhs);
3604 /* We already know that these two types are compatible, but they
3605 may not be exactly identical. In fact, `TREE_TYPE (type)' is
3606 likely to be __builtin_va_list and `TREE_TYPE (rhs)' is
3607 likely to be va_list, a typedef to __builtin_va_list, which
3608 is different enough that it will cause problems later. */
3609 if (TREE_TYPE (TREE_TYPE (rhs)) != TREE_TYPE (type))
3610 rhs = build1 (NOP_EXPR, build_pointer_type (TREE_TYPE (type)), rhs);
3612 rhs = build1 (NOP_EXPR, type, rhs);
3615 /* Some types can interconvert without explicit casts. */
3616 else if (codel == VECTOR_TYPE && coder == VECTOR_TYPE
3617 && vector_types_convertible_p (type, TREE_TYPE (rhs)))
3618 return convert (type, rhs);
3619 /* Arithmetic types all interconvert, and enum is treated like int. */
3620 else if ((codel == INTEGER_TYPE || codel == REAL_TYPE
3621 || codel == ENUMERAL_TYPE || codel == COMPLEX_TYPE
3622 || codel == BOOLEAN_TYPE)
3623 && (coder == INTEGER_TYPE || coder == REAL_TYPE
3624 || coder == ENUMERAL_TYPE || coder == COMPLEX_TYPE
3625 || coder == BOOLEAN_TYPE))
3626 return convert_and_check (type, rhs);
3628 /* Conversion to a transparent union from its member types.
3629 This applies only to function arguments. */
3630 else if (codel == UNION_TYPE && TYPE_TRANSPARENT_UNION (type)
3631 && (errtype == ic_argpass || errtype == ic_argpass_nonproto))
3634 tree marginal_memb_type = 0;
3636 for (memb_types = TYPE_FIELDS (type); memb_types;
3637 memb_types = TREE_CHAIN (memb_types))
3639 tree memb_type = TREE_TYPE (memb_types);
3641 if (comptypes (TYPE_MAIN_VARIANT (memb_type),
3642 TYPE_MAIN_VARIANT (rhstype)))
3645 if (TREE_CODE (memb_type) != POINTER_TYPE)
3648 if (coder == POINTER_TYPE)
3650 tree ttl = TREE_TYPE (memb_type);
3651 tree ttr = TREE_TYPE (rhstype);
3653 /* Any non-function converts to a [const][volatile] void *
3654 and vice versa; otherwise, targets must be the same.
3655 Meanwhile, the lhs target must have all the qualifiers of
3657 if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
3658 || comp_target_types (memb_type, rhstype))
3660 /* If this type won't generate any warnings, use it. */
3661 if (TYPE_QUALS (ttl) == TYPE_QUALS (ttr)
3662 || ((TREE_CODE (ttr) == FUNCTION_TYPE
3663 && TREE_CODE (ttl) == FUNCTION_TYPE)
3664 ? ((TYPE_QUALS (ttl) | TYPE_QUALS (ttr))
3665 == TYPE_QUALS (ttr))
3666 : ((TYPE_QUALS (ttl) | TYPE_QUALS (ttr))
3667 == TYPE_QUALS (ttl))))
3670 /* Keep looking for a better type, but remember this one. */
3671 if (!marginal_memb_type)
3672 marginal_memb_type = memb_type;
3676 /* Can convert integer zero to any pointer type. */
3677 if (integer_zerop (rhs)
3678 || (TREE_CODE (rhs) == NOP_EXPR
3679 && integer_zerop (TREE_OPERAND (rhs, 0))))
3681 rhs = null_pointer_node;
3686 if (memb_types || marginal_memb_type)
3690 /* We have only a marginally acceptable member type;
3691 it needs a warning. */
3692 tree ttl = TREE_TYPE (marginal_memb_type);
3693 tree ttr = TREE_TYPE (rhstype);
3695 /* Const and volatile mean something different for function
3696 types, so the usual warnings are not appropriate. */
3697 if (TREE_CODE (ttr) == FUNCTION_TYPE
3698 && TREE_CODE (ttl) == FUNCTION_TYPE)
3700 /* Because const and volatile on functions are
3701 restrictions that say the function will not do
3702 certain things, it is okay to use a const or volatile
3703 function where an ordinary one is wanted, but not
3705 if (TYPE_QUALS (ttl) & ~TYPE_QUALS (ttr))
3706 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE "
3707 "makes qualified function "
3708 "pointer from unqualified"),
3709 G_("assignment makes qualified "
3710 "function pointer from "
3712 G_("initialization makes qualified "
3713 "function pointer from "
3715 G_("return makes qualified function "
3716 "pointer from unqualified"));
3718 else if (TYPE_QUALS (ttr) & ~TYPE_QUALS (ttl))
3719 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE discards "
3720 "qualifiers from pointer target type"),
3721 G_("assignment discards qualifiers "
3722 "from pointer target type"),
3723 G_("initialization discards qualifiers "
3724 "from pointer target type"),
3725 G_("return discards qualifiers from "
3726 "pointer target type"));
3729 if (pedantic && !DECL_IN_SYSTEM_HEADER (fundecl))
3730 pedwarn ("ISO C prohibits argument conversion to union type");
3732 return build1 (NOP_EXPR, type, rhs);
3736 /* Conversions among pointers */
3737 else if ((codel == POINTER_TYPE || codel == REFERENCE_TYPE)
3738 && (coder == codel))
3740 tree ttl = TREE_TYPE (type);
3741 tree ttr = TREE_TYPE (rhstype);
3744 bool is_opaque_pointer;
3745 int target_cmp = 0; /* Cache comp_target_types () result. */
3747 if (TREE_CODE (mvl) != ARRAY_TYPE)
3748 mvl = TYPE_MAIN_VARIANT (mvl);
3749 if (TREE_CODE (mvr) != ARRAY_TYPE)
3750 mvr = TYPE_MAIN_VARIANT (mvr);
3751 /* Opaque pointers are treated like void pointers. */
3752 is_opaque_pointer = (targetm.vector_opaque_p (type)
3753 || targetm.vector_opaque_p (rhstype))
3754 && TREE_CODE (ttl) == VECTOR_TYPE
3755 && TREE_CODE (ttr) == VECTOR_TYPE;
3757 /* C++ does not allow the implicit conversion void* -> T*. However,
3758 for the purpose of reducing the number of false positives, we
3759 tolerate the special case of
3763 where NULL is typically defined in C to be '(void *) 0'. */
3764 if (VOID_TYPE_P (ttr) && rhs != null_pointer_node && !VOID_TYPE_P (ttl))
3765 warning (OPT_Wc___compat, "request for implicit conversion from "
3766 "%qT to %qT not permitted in C++", rhstype, type);
3768 /* Any non-function converts to a [const][volatile] void *
3769 and vice versa; otherwise, targets must be the same.
3770 Meanwhile, the lhs target must have all the qualifiers of the rhs. */
3771 if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
3772 || (target_cmp = comp_target_types (type, rhstype))
3773 || is_opaque_pointer
3774 || (c_common_unsigned_type (mvl)
3775 == c_common_unsigned_type (mvr)))
3778 && ((VOID_TYPE_P (ttl) && TREE_CODE (ttr) == FUNCTION_TYPE)
3781 /* Check TREE_CODE to catch cases like (void *) (char *) 0
3782 which are not ANSI null ptr constants. */
3783 && (!integer_zerop (rhs) || TREE_CODE (rhs) == NOP_EXPR)
3784 && TREE_CODE (ttl) == FUNCTION_TYPE)))
3785 WARN_FOR_ASSIGNMENT (G_("ISO C forbids passing argument %d of "
3786 "%qE between function pointer "
3788 G_("ISO C forbids assignment between "
3789 "function pointer and %<void *%>"),
3790 G_("ISO C forbids initialization between "
3791 "function pointer and %<void *%>"),
3792 G_("ISO C forbids return between function "
3793 "pointer and %<void *%>"));
3794 /* Const and volatile mean something different for function types,
3795 so the usual warnings are not appropriate. */
3796 else if (TREE_CODE (ttr) != FUNCTION_TYPE
3797 && TREE_CODE (ttl) != FUNCTION_TYPE)
3799 if (TYPE_QUALS (ttr) & ~TYPE_QUALS (ttl))
3801 /* Types differing only by the presence of the 'volatile'
3802 qualifier are acceptable if the 'volatile' has been added
3803 in by the Objective-C EH machinery. */
3804 if (!objc_type_quals_match (ttl, ttr))
3805 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE discards "
3806 "qualifiers from pointer target type"),
3807 G_("assignment discards qualifiers "
3808 "from pointer target type"),
3809 G_("initialization discards qualifiers "
3810 "from pointer target type"),
3811 G_("return discards qualifiers from "
3812 "pointer target type"));
3814 /* If this is not a case of ignoring a mismatch in signedness,
3816 else if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
3819 /* If there is a mismatch, do warn. */
3820 else if (warn_pointer_sign)
3821 WARN_FOR_ASSIGNMENT (G_("pointer targets in passing argument "
3822 "%d of %qE differ in signedness"),
3823 G_("pointer targets in assignment "
3824 "differ in signedness"),
3825 G_("pointer targets in initialization "
3826 "differ in signedness"),
3827 G_("pointer targets in return differ "
3830 else if (TREE_CODE (ttl) == FUNCTION_TYPE
3831 && TREE_CODE (ttr) == FUNCTION_TYPE)
3833 /* Because const and volatile on functions are restrictions
3834 that say the function will not do certain things,
3835 it is okay to use a const or volatile function
3836 where an ordinary one is wanted, but not vice-versa. */
3837 if (TYPE_QUALS (ttl) & ~TYPE_QUALS (ttr))
3838 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE makes "
3839 "qualified function pointer "
3840 "from unqualified"),
3841 G_("assignment makes qualified function "
3842 "pointer from unqualified"),
3843 G_("initialization makes qualified "
3844 "function pointer from unqualified"),
3845 G_("return makes qualified function "
3846 "pointer from unqualified"));
3850 /* Avoid warning about the volatile ObjC EH puts on decls. */
3852 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE from "
3853 "incompatible pointer type"),
3854 G_("assignment from incompatible pointer type"),
3855 G_("initialization from incompatible "
3857 G_("return from incompatible pointer type"));
3859 return convert (type, rhs);
3861 else if (codel == POINTER_TYPE && coder == ARRAY_TYPE)
3863 /* ??? This should not be an error when inlining calls to
3864 unprototyped functions. */
3865 error ("invalid use of non-lvalue array");
3866 return error_mark_node;
3868 else if (codel == POINTER_TYPE && coder == INTEGER_TYPE)
3870 /* An explicit constant 0 can convert to a pointer,
3871 or one that results from arithmetic, even including
3872 a cast to integer type. */
3873 if (!(TREE_CODE (rhs) == INTEGER_CST && integer_zerop (rhs))
3875 !(TREE_CODE (rhs) == NOP_EXPR
3876 && TREE_CODE (TREE_TYPE (rhs)) == INTEGER_TYPE
3877 && TREE_CODE (TREE_OPERAND (rhs, 0)) == INTEGER_CST
3878 && integer_zerop (TREE_OPERAND (rhs, 0))))
3879 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE makes "
3880 "pointer from integer without a cast"),
3881 G_("assignment makes pointer from integer "
3883 G_("initialization makes pointer from "
3884 "integer without a cast"),
3885 G_("return makes pointer from integer "
3888 return convert (type, rhs);
3890 else if (codel == INTEGER_TYPE && coder == POINTER_TYPE)
3892 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE makes integer "
3893 "from pointer without a cast"),
3894 G_("assignment makes integer from pointer "
3896 G_("initialization makes integer from pointer "
3898 G_("return makes integer from pointer "
3900 return convert (type, rhs);
3902 else if (codel == BOOLEAN_TYPE && coder == POINTER_TYPE)
3903 return convert (type, rhs);
3908 case ic_argpass_nonproto:
3909 /* ??? This should not be an error when inlining calls to
3910 unprototyped functions. */
3911 error ("incompatible type for argument %d of %qE", parmnum, rname);
3914 error ("incompatible types in assignment");
3917 error ("incompatible types in initialization");
3920 error ("incompatible types in return");
3926 return error_mark_node;
3929 /* Convert VALUE for assignment into inlined parameter PARM. ARGNUM
3930 is used for error and waring reporting and indicates which argument
3931 is being processed. */
3934 c_convert_parm_for_inlining (tree parm, tree value, tree fn, int argnum)
3938 /* If FN was prototyped, the value has been converted already
3939 in convert_arguments. */
3940 if (!value || TYPE_ARG_TYPES (TREE_TYPE (fn)))
3943 type = TREE_TYPE (parm);
3944 ret = convert_for_assignment (type, value,
3945 ic_argpass_nonproto, fn,
3947 if (targetm.calls.promote_prototypes (TREE_TYPE (fn))
3948 && INTEGRAL_TYPE_P (type)
3949 && (TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node)))
3950 ret = default_conversion (ret);
3954 /* If VALUE is a compound expr all of whose expressions are constant, then
3955 return its value. Otherwise, return error_mark_node.
3957 This is for handling COMPOUND_EXPRs as initializer elements
3958 which is allowed with a warning when -pedantic is specified. */
3961 valid_compound_expr_initializer (tree value, tree endtype)
3963 if (TREE_CODE (value) == COMPOUND_EXPR)
3965 if (valid_compound_expr_initializer (TREE_OPERAND (value, 0), endtype)
3967 return error_mark_node;
3968 return valid_compound_expr_initializer (TREE_OPERAND (value, 1),
3971 else if (!initializer_constant_valid_p (value, endtype))
3972 return error_mark_node;
3977 /* Perform appropriate conversions on the initial value of a variable,
3978 store it in the declaration DECL,
3979 and print any error messages that are appropriate.
3980 If the init is invalid, store an ERROR_MARK. */
3983 store_init_value (tree decl, tree init)
3987 /* If variable's type was invalidly declared, just ignore it. */
3989 type = TREE_TYPE (decl);
3990 if (TREE_CODE (type) == ERROR_MARK)
3993 /* Digest the specified initializer into an expression. */
3995 value = digest_init (type, init, true, TREE_STATIC (decl));
3997 /* Store the expression if valid; else report error. */
3999 if (warn_traditional && !in_system_header
4000 && AGGREGATE_TYPE_P (TREE_TYPE (decl)) && !TREE_STATIC (decl))
4001 warning (0, "traditional C rejects automatic aggregate initialization");
4003 DECL_INITIAL (decl) = value;
4005 /* ANSI wants warnings about out-of-range constant initializers. */
4006 STRIP_TYPE_NOPS (value);
4007 constant_expression_warning (value);
4009 /* Check if we need to set array size from compound literal size. */
4010 if (TREE_CODE (type) == ARRAY_TYPE
4011 && TYPE_DOMAIN (type) == 0
4012 && value != error_mark_node)
4014 tree inside_init = init;
4016 STRIP_TYPE_NOPS (inside_init);
4017 inside_init = fold (inside_init);
4019 if (TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
4021 tree decl = COMPOUND_LITERAL_EXPR_DECL (inside_init);
4023 if (TYPE_DOMAIN (TREE_TYPE (decl)))
4025 /* For int foo[] = (int [3]){1}; we need to set array size
4026 now since later on array initializer will be just the
4027 brace enclosed list of the compound literal. */
4028 TYPE_DOMAIN (type) = TYPE_DOMAIN (TREE_TYPE (decl));
4030 layout_decl (decl, 0);
4036 /* Methods for storing and printing names for error messages. */
4038 /* Implement a spelling stack that allows components of a name to be pushed
4039 and popped. Each element on the stack is this structure. */
4051 #define SPELLING_STRING 1
4052 #define SPELLING_MEMBER 2
4053 #define SPELLING_BOUNDS 3
4055 static struct spelling *spelling; /* Next stack element (unused). */
4056 static struct spelling *spelling_base; /* Spelling stack base. */
4057 static int spelling_size; /* Size of the spelling stack. */
4059 /* Macros to save and restore the spelling stack around push_... functions.
4060 Alternative to SAVE_SPELLING_STACK. */
4062 #define SPELLING_DEPTH() (spelling - spelling_base)
4063 #define RESTORE_SPELLING_DEPTH(DEPTH) (spelling = spelling_base + (DEPTH))
4065 /* Push an element on the spelling stack with type KIND and assign VALUE
4068 #define PUSH_SPELLING(KIND, VALUE, MEMBER) \
4070 int depth = SPELLING_DEPTH (); \
4072 if (depth >= spelling_size) \
4074 spelling_size += 10; \
4075 spelling_base = XRESIZEVEC (struct spelling, spelling_base, \
4077 RESTORE_SPELLING_DEPTH (depth); \
4080 spelling->kind = (KIND); \
4081 spelling->MEMBER = (VALUE); \
4085 /* Push STRING on the stack. Printed literally. */
4088 push_string (const char *string)
4090 PUSH_SPELLING (SPELLING_STRING, string, u.s);
4093 /* Push a member name on the stack. Printed as '.' STRING. */
4096 push_member_name (tree decl)
4098 const char *const string
4099 = DECL_NAME (decl) ? IDENTIFIER_POINTER (DECL_NAME (decl)) : "<anonymous>";
4100 PUSH_SPELLING (SPELLING_MEMBER, string, u.s);
4103 /* Push an array bounds on the stack. Printed as [BOUNDS]. */
4106 push_array_bounds (int bounds)
4108 PUSH_SPELLING (SPELLING_BOUNDS, bounds, u.i);
4111 /* Compute the maximum size in bytes of the printed spelling. */
4114 spelling_length (void)
4119 for (p = spelling_base; p < spelling; p++)
4121 if (p->kind == SPELLING_BOUNDS)
4124 size += strlen (p->u.s) + 1;
4130 /* Print the spelling to BUFFER and return it. */
4133 print_spelling (char *buffer)
4138 for (p = spelling_base; p < spelling; p++)
4139 if (p->kind == SPELLING_BOUNDS)
4141 sprintf (d, "[%d]", p->u.i);
4147 if (p->kind == SPELLING_MEMBER)
4149 for (s = p->u.s; (*d = *s++); d++)
4156 /* Issue an error message for a bad initializer component.
4157 MSGID identifies the message.
4158 The component name is taken from the spelling stack. */
4161 error_init (const char *msgid)
4165 error ("%s", _(msgid));
4166 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4168 error ("(near initialization for %qs)", ofwhat);
4171 /* Issue a pedantic warning for a bad initializer component.
4172 MSGID identifies the message.
4173 The component name is taken from the spelling stack. */
4176 pedwarn_init (const char *msgid)
4180 pedwarn ("%s", _(msgid));
4181 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4183 pedwarn ("(near initialization for %qs)", ofwhat);
4186 /* Issue a warning for a bad initializer component.
4187 MSGID identifies the message.
4188 The component name is taken from the spelling stack. */
4191 warning_init (const char *msgid)
4195 warning (0, "%s", _(msgid));
4196 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4198 warning (0, "(near initialization for %qs)", ofwhat);
4201 /* If TYPE is an array type and EXPR is a parenthesized string
4202 constant, warn if pedantic that EXPR is being used to initialize an
4203 object of type TYPE. */
4206 maybe_warn_string_init (tree type, struct c_expr expr)
4209 && TREE_CODE (type) == ARRAY_TYPE
4210 && TREE_CODE (expr.value) == STRING_CST
4211 && expr.original_code != STRING_CST)
4212 pedwarn_init ("array initialized from parenthesized string constant");
4215 /* Digest the parser output INIT as an initializer for type TYPE.
4216 Return a C expression of type TYPE to represent the initial value.
4218 If INIT is a string constant, STRICT_STRING is true if it is
4219 unparenthesized or we should not warn here for it being parenthesized.
4220 For other types of INIT, STRICT_STRING is not used.
4222 REQUIRE_CONSTANT requests an error if non-constant initializers or
4223 elements are seen. */
4226 digest_init (tree type, tree init, bool strict_string, int require_constant)
4228 enum tree_code code = TREE_CODE (type);
4229 tree inside_init = init;
4231 if (type == error_mark_node
4232 || init == error_mark_node
4233 || TREE_TYPE (init) == error_mark_node)
4234 return error_mark_node;
4236 STRIP_TYPE_NOPS (inside_init);
4238 inside_init = fold (inside_init);
4240 /* Initialization of an array of chars from a string constant
4241 optionally enclosed in braces. */
4243 if (code == ARRAY_TYPE && inside_init
4244 && TREE_CODE (inside_init) == STRING_CST)
4246 tree typ1 = TYPE_MAIN_VARIANT (TREE_TYPE (type));
4247 /* Note that an array could be both an array of character type
4248 and an array of wchar_t if wchar_t is signed char or unsigned
4250 bool char_array = (typ1 == char_type_node
4251 || typ1 == signed_char_type_node
4252 || typ1 == unsigned_char_type_node);
4253 bool wchar_array = !!comptypes (typ1, wchar_type_node);
4254 if (char_array || wchar_array)
4258 expr.value = inside_init;
4259 expr.original_code = (strict_string ? STRING_CST : ERROR_MARK);
4260 maybe_warn_string_init (type, expr);
4263 = (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (inside_init)))
4266 if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
4267 TYPE_MAIN_VARIANT (type)))
4270 if (!wchar_array && !char_string)
4272 error_init ("char-array initialized from wide string");
4273 return error_mark_node;
4275 if (char_string && !char_array)
4277 error_init ("wchar_t-array initialized from non-wide string");
4278 return error_mark_node;
4281 TREE_TYPE (inside_init) = type;
4282 if (TYPE_DOMAIN (type) != 0
4283 && TYPE_SIZE (type) != 0
4284 && TREE_CODE (TYPE_SIZE (type)) == INTEGER_CST
4285 /* Subtract 1 (or sizeof (wchar_t))
4286 because it's ok to ignore the terminating null char
4287 that is counted in the length of the constant. */
4288 && 0 > compare_tree_int (TYPE_SIZE_UNIT (type),
4289 TREE_STRING_LENGTH (inside_init)
4290 - ((TYPE_PRECISION (typ1)
4291 != TYPE_PRECISION (char_type_node))
4292 ? (TYPE_PRECISION (wchar_type_node)
4295 pedwarn_init ("initializer-string for array of chars is too long");
4299 else if (INTEGRAL_TYPE_P (typ1))
4301 error_init ("array of inappropriate type initialized "
4302 "from string constant");
4303 return error_mark_node;
4307 /* Build a VECTOR_CST from a *constant* vector constructor. If the
4308 vector constructor is not constant (e.g. {1,2,3,foo()}) then punt
4309 below and handle as a constructor. */
4310 if (code == VECTOR_TYPE
4311 && TREE_CODE (TREE_TYPE (inside_init)) == VECTOR_TYPE
4312 && vector_types_convertible_p (TREE_TYPE (inside_init), type)
4313 && TREE_CONSTANT (inside_init))
4315 if (TREE_CODE (inside_init) == VECTOR_CST
4316 && comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
4317 TYPE_MAIN_VARIANT (type)))
4320 if (TREE_CODE (inside_init) == CONSTRUCTOR)
4324 /* Iterate through elements and check if all constructor
4325 elements are *_CSTs. */
4326 for (link = CONSTRUCTOR_ELTS (inside_init);
4328 link = TREE_CHAIN (link))
4329 if (! CONSTANT_CLASS_P (TREE_VALUE (link)))
4333 return build_vector (type, CONSTRUCTOR_ELTS (inside_init));
4337 /* Any type can be initialized
4338 from an expression of the same type, optionally with braces. */
4340 if (inside_init && TREE_TYPE (inside_init) != 0
4341 && (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
4342 TYPE_MAIN_VARIANT (type))
4343 || (code == ARRAY_TYPE
4344 && comptypes (TREE_TYPE (inside_init), type))
4345 || (code == VECTOR_TYPE
4346 && comptypes (TREE_TYPE (inside_init), type))
4347 || (code == POINTER_TYPE
4348 && TREE_CODE (TREE_TYPE (inside_init)) == ARRAY_TYPE
4349 && comptypes (TREE_TYPE (TREE_TYPE (inside_init)),
4350 TREE_TYPE (type)))))
4352 if (code == POINTER_TYPE)
4354 if (TREE_CODE (inside_init) == STRING_CST
4355 || TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
4356 inside_init = default_function_array_conversion (inside_init);
4358 if (TREE_CODE (TREE_TYPE (inside_init)) == ARRAY_TYPE)
4360 error_init ("invalid use of non-lvalue array");
4361 return error_mark_node;
4365 if (code == VECTOR_TYPE)
4366 /* Although the types are compatible, we may require a
4368 inside_init = convert (type, inside_init);
4370 if (require_constant && !flag_isoc99
4371 && TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
4373 /* As an extension, allow initializing objects with static storage
4374 duration with compound literals (which are then treated just as
4375 the brace enclosed list they contain). */
4376 tree decl = COMPOUND_LITERAL_EXPR_DECL (inside_init);
4377 inside_init = DECL_INITIAL (decl);
4380 if (code == ARRAY_TYPE && TREE_CODE (inside_init) != STRING_CST
4381 && TREE_CODE (inside_init) != CONSTRUCTOR)
4383 error_init ("array initialized from non-constant array expression");
4384 return error_mark_node;
4387 if (optimize && TREE_CODE (inside_init) == VAR_DECL)
4388 inside_init = decl_constant_value_for_broken_optimization (inside_init);
4390 /* Compound expressions can only occur here if -pedantic or
4391 -pedantic-errors is specified. In the later case, we always want
4392 an error. In the former case, we simply want a warning. */
4393 if (require_constant && pedantic
4394 && TREE_CODE (inside_init) == COMPOUND_EXPR)
4397 = valid_compound_expr_initializer (inside_init,
4398 TREE_TYPE (inside_init));
4399 if (inside_init == error_mark_node)
4400 error_init ("initializer element is not constant");
4402 pedwarn_init ("initializer element is not constant");
4403 if (flag_pedantic_errors)
4404 inside_init = error_mark_node;
4406 else if (require_constant
4407 && !initializer_constant_valid_p (inside_init,
4408 TREE_TYPE (inside_init)))
4410 error_init ("initializer element is not constant");
4411 inside_init = error_mark_node;
4417 /* Handle scalar types, including conversions. */
4419 if (code == INTEGER_TYPE || code == REAL_TYPE || code == POINTER_TYPE
4420 || code == ENUMERAL_TYPE || code == BOOLEAN_TYPE || code == COMPLEX_TYPE
4421 || code == VECTOR_TYPE)
4423 if (TREE_CODE (init) == STRING_CST
4424 || TREE_CODE (init) == COMPOUND_LITERAL_EXPR)
4425 init = default_function_array_conversion (init);
4427 = convert_for_assignment (type, init, ic_init,
4428 NULL_TREE, NULL_TREE, 0);
4430 /* Check to see if we have already given an error message. */
4431 if (inside_init == error_mark_node)
4433 else if (require_constant && !TREE_CONSTANT (inside_init))
4435 error_init ("initializer element is not constant");
4436 inside_init = error_mark_node;
4438 else if (require_constant
4439 && !initializer_constant_valid_p (inside_init,
4440 TREE_TYPE (inside_init)))
4442 error_init ("initializer element is not computable at load time");
4443 inside_init = error_mark_node;
4449 /* Come here only for records and arrays. */
4451 if (COMPLETE_TYPE_P (type) && TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST)
4453 error_init ("variable-sized object may not be initialized");
4454 return error_mark_node;
4457 error_init ("invalid initializer");
4458 return error_mark_node;
4461 /* Handle initializers that use braces. */
4463 /* Type of object we are accumulating a constructor for.
4464 This type is always a RECORD_TYPE, UNION_TYPE or ARRAY_TYPE. */
4465 static tree constructor_type;
4467 /* For a RECORD_TYPE or UNION_TYPE, this is the chain of fields
4469 static tree constructor_fields;
4471 /* For an ARRAY_TYPE, this is the specified index
4472 at which to store the next element we get. */
4473 static tree constructor_index;
4475 /* For an ARRAY_TYPE, this is the maximum index. */
4476 static tree constructor_max_index;
4478 /* For a RECORD_TYPE, this is the first field not yet written out. */
4479 static tree constructor_unfilled_fields;
4481 /* For an ARRAY_TYPE, this is the index of the first element
4482 not yet written out. */
4483 static tree constructor_unfilled_index;
4485 /* In a RECORD_TYPE, the byte index of the next consecutive field.
4486 This is so we can generate gaps between fields, when appropriate. */
4487 static tree constructor_bit_index;
4489 /* If we are saving up the elements rather than allocating them,
4490 this is the list of elements so far (in reverse order,
4491 most recent first). */
4492 static tree constructor_elements;
4494 /* 1 if constructor should be incrementally stored into a constructor chain,
4495 0 if all the elements should be kept in AVL tree. */
4496 static int constructor_incremental;
4498 /* 1 if so far this constructor's elements are all compile-time constants. */
4499 static int constructor_constant;
4501 /* 1 if so far this constructor's elements are all valid address constants. */
4502 static int constructor_simple;
4504 /* 1 if this constructor is erroneous so far. */
4505 static int constructor_erroneous;
4507 /* Structure for managing pending initializer elements, organized as an
4512 struct init_node *left, *right;
4513 struct init_node *parent;
4519 /* Tree of pending elements at this constructor level.
4520 These are elements encountered out of order
4521 which belong at places we haven't reached yet in actually
4523 Will never hold tree nodes across GC runs. */
4524 static struct init_node *constructor_pending_elts;
4526 /* The SPELLING_DEPTH of this constructor. */
4527 static int constructor_depth;
4529 /* DECL node for which an initializer is being read.
4530 0 means we are reading a constructor expression
4531 such as (struct foo) {...}. */
4532 static tree constructor_decl;
4534 /* Nonzero if this is an initializer for a top-level decl. */
4535 static int constructor_top_level;
4537 /* Nonzero if there were any member designators in this initializer. */
4538 static int constructor_designated;
4540 /* Nesting depth of designator list. */
4541 static int designator_depth;
4543 /* Nonzero if there were diagnosed errors in this designator list. */
4544 static int designator_errorneous;
4547 /* This stack has a level for each implicit or explicit level of
4548 structuring in the initializer, including the outermost one. It
4549 saves the values of most of the variables above. */
4551 struct constructor_range_stack;
4553 struct constructor_stack
4555 struct constructor_stack *next;
4560 tree unfilled_index;
4561 tree unfilled_fields;
4564 struct init_node *pending_elts;
4567 /* If value nonzero, this value should replace the entire
4568 constructor at this level. */
4569 struct c_expr replacement_value;
4570 struct constructor_range_stack *range_stack;
4580 static struct constructor_stack *constructor_stack;
4582 /* This stack represents designators from some range designator up to
4583 the last designator in the list. */
4585 struct constructor_range_stack
4587 struct constructor_range_stack *next, *prev;
4588 struct constructor_stack *stack;
4595 static struct constructor_range_stack *constructor_range_stack;
4597 /* This stack records separate initializers that are nested.
4598 Nested initializers can't happen in ANSI C, but GNU C allows them
4599 in cases like { ... (struct foo) { ... } ... }. */
4601 struct initializer_stack
4603 struct initializer_stack *next;
4605 struct constructor_stack *constructor_stack;
4606 struct constructor_range_stack *constructor_range_stack;
4608 struct spelling *spelling;
4609 struct spelling *spelling_base;
4612 char require_constant_value;
4613 char require_constant_elements;
4616 static struct initializer_stack *initializer_stack;
4618 /* Prepare to parse and output the initializer for variable DECL. */
4621 start_init (tree decl, tree asmspec_tree ATTRIBUTE_UNUSED, int top_level)
4624 struct initializer_stack *p = xmalloc (sizeof (struct initializer_stack));
4626 p->decl = constructor_decl;
4627 p->require_constant_value = require_constant_value;
4628 p->require_constant_elements = require_constant_elements;
4629 p->constructor_stack = constructor_stack;
4630 p->constructor_range_stack = constructor_range_stack;
4631 p->elements = constructor_elements;
4632 p->spelling = spelling;
4633 p->spelling_base = spelling_base;
4634 p->spelling_size = spelling_size;
4635 p->top_level = constructor_top_level;
4636 p->next = initializer_stack;
4637 initializer_stack = p;
4639 constructor_decl = decl;
4640 constructor_designated = 0;
4641 constructor_top_level = top_level;
4643 if (decl != 0 && decl != error_mark_node)
4645 require_constant_value = TREE_STATIC (decl);
4646 require_constant_elements
4647 = ((TREE_STATIC (decl) || (pedantic && !flag_isoc99))
4648 /* For a scalar, you can always use any value to initialize,
4649 even within braces. */
4650 && (TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE
4651 || TREE_CODE (TREE_TYPE (decl)) == RECORD_TYPE
4652 || TREE_CODE (TREE_TYPE (decl)) == UNION_TYPE
4653 || TREE_CODE (TREE_TYPE (decl)) == QUAL_UNION_TYPE));
4654 locus = IDENTIFIER_POINTER (DECL_NAME (decl));
4658 require_constant_value = 0;
4659 require_constant_elements = 0;
4660 locus = "(anonymous)";
4663 constructor_stack = 0;
4664 constructor_range_stack = 0;
4666 missing_braces_mentioned = 0;
4670 RESTORE_SPELLING_DEPTH (0);
4673 push_string (locus);
4679 struct initializer_stack *p = initializer_stack;
4681 /* Free the whole constructor stack of this initializer. */
4682 while (constructor_stack)
4684 struct constructor_stack *q = constructor_stack;
4685 constructor_stack = q->next;
4689 gcc_assert (!constructor_range_stack);
4691 /* Pop back to the data of the outer initializer (if any). */
4692 free (spelling_base);
4694 constructor_decl = p->decl;
4695 require_constant_value = p->require_constant_value;
4696 require_constant_elements = p->require_constant_elements;
4697 constructor_stack = p->constructor_stack;
4698 constructor_range_stack = p->constructor_range_stack;
4699 constructor_elements = p->elements;
4700 spelling = p->spelling;
4701 spelling_base = p->spelling_base;
4702 spelling_size = p->spelling_size;
4703 constructor_top_level = p->top_level;
4704 initializer_stack = p->next;
4708 /* Call here when we see the initializer is surrounded by braces.
4709 This is instead of a call to push_init_level;
4710 it is matched by a call to pop_init_level.
4712 TYPE is the type to initialize, for a constructor expression.
4713 For an initializer for a decl, TYPE is zero. */
4716 really_start_incremental_init (tree type)
4718 struct constructor_stack *p = XNEW (struct constructor_stack);
4721 type = TREE_TYPE (constructor_decl);
4723 if (targetm.vector_opaque_p (type))
4724 error ("opaque vector types cannot be initialized");
4726 p->type = constructor_type;
4727 p->fields = constructor_fields;
4728 p->index = constructor_index;
4729 p->max_index = constructor_max_index;
4730 p->unfilled_index = constructor_unfilled_index;
4731 p->unfilled_fields = constructor_unfilled_fields;
4732 p->bit_index = constructor_bit_index;
4733 p->elements = constructor_elements;
4734 p->constant = constructor_constant;
4735 p->simple = constructor_simple;
4736 p->erroneous = constructor_erroneous;
4737 p->pending_elts = constructor_pending_elts;
4738 p->depth = constructor_depth;
4739 p->replacement_value.value = 0;
4740 p->replacement_value.original_code = ERROR_MARK;
4744 p->incremental = constructor_incremental;
4745 p->designated = constructor_designated;
4747 constructor_stack = p;
4749 constructor_constant = 1;
4750 constructor_simple = 1;
4751 constructor_depth = SPELLING_DEPTH ();
4752 constructor_elements = 0;
4753 constructor_pending_elts = 0;
4754 constructor_type = type;
4755 constructor_incremental = 1;
4756 constructor_designated = 0;
4757 designator_depth = 0;
4758 designator_errorneous = 0;
4760 if (TREE_CODE (constructor_type) == RECORD_TYPE
4761 || TREE_CODE (constructor_type) == UNION_TYPE)
4763 constructor_fields = TYPE_FIELDS (constructor_type);
4764 /* Skip any nameless bit fields at the beginning. */
4765 while (constructor_fields != 0 && DECL_C_BIT_FIELD (constructor_fields)
4766 && DECL_NAME (constructor_fields) == 0)
4767 constructor_fields = TREE_CHAIN (constructor_fields);
4769 constructor_unfilled_fields = constructor_fields;
4770 constructor_bit_index = bitsize_zero_node;
4772 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
4774 if (TYPE_DOMAIN (constructor_type))
4776 constructor_max_index
4777 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type));
4779 /* Detect non-empty initializations of zero-length arrays. */
4780 if (constructor_max_index == NULL_TREE
4781 && TYPE_SIZE (constructor_type))
4782 constructor_max_index = build_int_cst (NULL_TREE, -1);
4784 /* constructor_max_index needs to be an INTEGER_CST. Attempts
4785 to initialize VLAs will cause a proper error; avoid tree
4786 checking errors as well by setting a safe value. */
4787 if (constructor_max_index
4788 && TREE_CODE (constructor_max_index) != INTEGER_CST)
4789 constructor_max_index = build_int_cst (NULL_TREE, -1);
4792 = convert (bitsizetype,
4793 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
4797 constructor_index = bitsize_zero_node;
4798 constructor_max_index = NULL_TREE;
4801 constructor_unfilled_index = constructor_index;
4803 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
4805 /* Vectors are like simple fixed-size arrays. */
4806 constructor_max_index =
4807 build_int_cst (NULL_TREE, TYPE_VECTOR_SUBPARTS (constructor_type) - 1);
4808 constructor_index = convert (bitsizetype, bitsize_zero_node);
4809 constructor_unfilled_index = constructor_index;
4813 /* Handle the case of int x = {5}; */
4814 constructor_fields = constructor_type;
4815 constructor_unfilled_fields = constructor_type;
4819 /* Push down into a subobject, for initialization.
4820 If this is for an explicit set of braces, IMPLICIT is 0.
4821 If it is because the next element belongs at a lower level,
4822 IMPLICIT is 1 (or 2 if the push is because of designator list). */
4825 push_init_level (int implicit)
4827 struct constructor_stack *p;
4828 tree value = NULL_TREE;
4830 /* If we've exhausted any levels that didn't have braces,
4831 pop them now. If implicit == 1, this will have been done in
4832 process_init_element; do not repeat it here because in the case
4833 of excess initializers for an empty aggregate this leads to an
4834 infinite cycle of popping a level and immediately recreating
4838 while (constructor_stack->implicit)
4840 if ((TREE_CODE (constructor_type) == RECORD_TYPE
4841 || TREE_CODE (constructor_type) == UNION_TYPE)
4842 && constructor_fields == 0)
4843 process_init_element (pop_init_level (1));
4844 else if (TREE_CODE (constructor_type) == ARRAY_TYPE
4845 && constructor_max_index
4846 && tree_int_cst_lt (constructor_max_index,
4848 process_init_element (pop_init_level (1));
4854 /* Unless this is an explicit brace, we need to preserve previous
4858 if ((TREE_CODE (constructor_type) == RECORD_TYPE
4859 || TREE_CODE (constructor_type) == UNION_TYPE)
4860 && constructor_fields)
4861 value = find_init_member (constructor_fields);
4862 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
4863 value = find_init_member (constructor_index);
4866 p = XNEW (struct constructor_stack);
4867 p->type = constructor_type;
4868 p->fields = constructor_fields;
4869 p->index = constructor_index;
4870 p->max_index = constructor_max_index;
4871 p->unfilled_index = constructor_unfilled_index;
4872 p->unfilled_fields = constructor_unfilled_fields;
4873 p->bit_index = constructor_bit_index;
4874 p->elements = constructor_elements;
4875 p->constant = constructor_constant;
4876 p->simple = constructor_simple;
4877 p->erroneous = constructor_erroneous;
4878 p->pending_elts = constructor_pending_elts;
4879 p->depth = constructor_depth;
4880 p->replacement_value.value = 0;
4881 p->replacement_value.original_code = ERROR_MARK;
4882 p->implicit = implicit;
4884 p->incremental = constructor_incremental;
4885 p->designated = constructor_designated;
4886 p->next = constructor_stack;
4888 constructor_stack = p;
4890 constructor_constant = 1;
4891 constructor_simple = 1;
4892 constructor_depth = SPELLING_DEPTH ();
4893 constructor_elements = 0;
4894 constructor_incremental = 1;
4895 constructor_designated = 0;
4896 constructor_pending_elts = 0;
4899 p->range_stack = constructor_range_stack;
4900 constructor_range_stack = 0;
4901 designator_depth = 0;
4902 designator_errorneous = 0;
4905 /* Don't die if an entire brace-pair level is superfluous
4906 in the containing level. */
4907 if (constructor_type == 0)
4909 else if (TREE_CODE (constructor_type) == RECORD_TYPE
4910 || TREE_CODE (constructor_type) == UNION_TYPE)
4912 /* Don't die if there are extra init elts at the end. */
4913 if (constructor_fields == 0)
4914 constructor_type = 0;
4917 constructor_type = TREE_TYPE (constructor_fields);
4918 push_member_name (constructor_fields);
4919 constructor_depth++;
4922 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
4924 constructor_type = TREE_TYPE (constructor_type);
4925 push_array_bounds (tree_low_cst (constructor_index, 0));
4926 constructor_depth++;
4929 if (constructor_type == 0)
4931 error_init ("extra brace group at end of initializer");
4932 constructor_fields = 0;
4933 constructor_unfilled_fields = 0;
4937 if (value && TREE_CODE (value) == CONSTRUCTOR)
4939 constructor_constant = TREE_CONSTANT (value);
4940 constructor_simple = TREE_STATIC (value);
4941 constructor_elements = CONSTRUCTOR_ELTS (value);
4942 if (constructor_elements
4943 && (TREE_CODE (constructor_type) == RECORD_TYPE
4944 || TREE_CODE (constructor_type) == ARRAY_TYPE))
4945 set_nonincremental_init ();
4948 if (implicit == 1 && warn_missing_braces && !missing_braces_mentioned)
4950 missing_braces_mentioned = 1;
4951 warning_init ("missing braces around initializer");
4954 if (TREE_CODE (constructor_type) == RECORD_TYPE
4955 || TREE_CODE (constructor_type) == UNION_TYPE)
4957 constructor_fields = TYPE_FIELDS (constructor_type);
4958 /* Skip any nameless bit fields at the beginning. */
4959 while (constructor_fields != 0 && DECL_C_BIT_FIELD (constructor_fields)
4960 && DECL_NAME (constructor_fields) == 0)
4961 constructor_fields = TREE_CHAIN (constructor_fields);
4963 constructor_unfilled_fields = constructor_fields;
4964 constructor_bit_index = bitsize_zero_node;
4966 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
4968 /* Vectors are like simple fixed-size arrays. */
4969 constructor_max_index =
4970 build_int_cst (NULL_TREE, TYPE_VECTOR_SUBPARTS (constructor_type) - 1);
4971 constructor_index = convert (bitsizetype, integer_zero_node);
4972 constructor_unfilled_index = constructor_index;
4974 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
4976 if (TYPE_DOMAIN (constructor_type))
4978 constructor_max_index
4979 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type));
4981 /* Detect non-empty initializations of zero-length arrays. */
4982 if (constructor_max_index == NULL_TREE
4983 && TYPE_SIZE (constructor_type))
4984 constructor_max_index = build_int_cst (NULL_TREE, -1);
4986 /* constructor_max_index needs to be an INTEGER_CST. Attempts
4987 to initialize VLAs will cause a proper error; avoid tree
4988 checking errors as well by setting a safe value. */
4989 if (constructor_max_index
4990 && TREE_CODE (constructor_max_index) != INTEGER_CST)
4991 constructor_max_index = build_int_cst (NULL_TREE, -1);
4994 = convert (bitsizetype,
4995 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
4998 constructor_index = bitsize_zero_node;
5000 constructor_unfilled_index = constructor_index;
5001 if (value && TREE_CODE (value) == STRING_CST)
5003 /* We need to split the char/wchar array into individual
5004 characters, so that we don't have to special case it
5006 set_nonincremental_init_from_string (value);
5011 if (constructor_type != error_mark_node)
5012 warning_init ("braces around scalar initializer");
5013 constructor_fields = constructor_type;
5014 constructor_unfilled_fields = constructor_type;
5018 /* At the end of an implicit or explicit brace level,
5019 finish up that level of constructor. If a single expression
5020 with redundant braces initialized that level, return the
5021 c_expr structure for that expression. Otherwise, the original_code
5022 element is set to ERROR_MARK.
5023 If we were outputting the elements as they are read, return 0 as the value
5024 from inner levels (process_init_element ignores that),
5025 but return error_mark_node as the value from the outermost level
5026 (that's what we want to put in DECL_INITIAL).
5027 Otherwise, return a CONSTRUCTOR expression as the value. */
5030 pop_init_level (int implicit)
5032 struct constructor_stack *p;
5035 ret.original_code = ERROR_MARK;
5039 /* When we come to an explicit close brace,
5040 pop any inner levels that didn't have explicit braces. */
5041 while (constructor_stack->implicit)
5042 process_init_element (pop_init_level (1));
5044 gcc_assert (!constructor_range_stack);
5047 /* Now output all pending elements. */
5048 constructor_incremental = 1;
5049 output_pending_init_elements (1);
5051 p = constructor_stack;
5053 /* Error for initializing a flexible array member, or a zero-length
5054 array member in an inappropriate context. */
5055 if (constructor_type && constructor_fields
5056 && TREE_CODE (constructor_type) == ARRAY_TYPE
5057 && TYPE_DOMAIN (constructor_type)
5058 && !TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type)))
5060 /* Silently discard empty initializations. The parser will
5061 already have pedwarned for empty brackets. */
5062 if (integer_zerop (constructor_unfilled_index))
5063 constructor_type = NULL_TREE;
5066 gcc_assert (!TYPE_SIZE (constructor_type));
5068 if (constructor_depth > 2)
5069 error_init ("initialization of flexible array member in a nested context");
5071 pedwarn_init ("initialization of a flexible array member");
5073 /* We have already issued an error message for the existence
5074 of a flexible array member not at the end of the structure.
5075 Discard the initializer so that we do not die later. */
5076 if (TREE_CHAIN (constructor_fields) != NULL_TREE)
5077 constructor_type = NULL_TREE;
5081 /* Warn when some struct elements are implicitly initialized to zero. */
5082 if (warn_missing_field_initializers
5084 && TREE_CODE (constructor_type) == RECORD_TYPE
5085 && constructor_unfilled_fields)
5087 /* Do not warn for flexible array members or zero-length arrays. */
5088 while (constructor_unfilled_fields
5089 && (!DECL_SIZE (constructor_unfilled_fields)
5090 || integer_zerop (DECL_SIZE (constructor_unfilled_fields))))
5091 constructor_unfilled_fields = TREE_CHAIN (constructor_unfilled_fields);
5093 /* Do not warn if this level of the initializer uses member
5094 designators; it is likely to be deliberate. */
5095 if (constructor_unfilled_fields && !constructor_designated)
5097 push_member_name (constructor_unfilled_fields);
5098 warning_init ("missing initializer");
5099 RESTORE_SPELLING_DEPTH (constructor_depth);
5103 /* Pad out the end of the structure. */
5104 if (p->replacement_value.value)
5105 /* If this closes a superfluous brace pair,
5106 just pass out the element between them. */
5107 ret = p->replacement_value;
5108 else if (constructor_type == 0)
5110 else if (TREE_CODE (constructor_type) != RECORD_TYPE
5111 && TREE_CODE (constructor_type) != UNION_TYPE
5112 && TREE_CODE (constructor_type) != ARRAY_TYPE
5113 && TREE_CODE (constructor_type) != VECTOR_TYPE)
5115 /* A nonincremental scalar initializer--just return
5116 the element, after verifying there is just one. */
5117 if (constructor_elements == 0)
5119 if (!constructor_erroneous)
5120 error_init ("empty scalar initializer");
5121 ret.value = error_mark_node;
5123 else if (TREE_CHAIN (constructor_elements) != 0)
5125 error_init ("extra elements in scalar initializer");
5126 ret.value = TREE_VALUE (constructor_elements);
5129 ret.value = TREE_VALUE (constructor_elements);
5133 if (constructor_erroneous)
5134 ret.value = error_mark_node;
5137 ret.value = build_constructor (constructor_type,
5138 nreverse (constructor_elements));
5139 if (constructor_constant)
5140 TREE_CONSTANT (ret.value) = TREE_INVARIANT (ret.value) = 1;
5141 if (constructor_constant && constructor_simple)
5142 TREE_STATIC (ret.value) = 1;
5146 constructor_type = p->type;
5147 constructor_fields = p->fields;
5148 constructor_index = p->index;
5149 constructor_max_index = p->max_index;
5150 constructor_unfilled_index = p->unfilled_index;
5151 constructor_unfilled_fields = p->unfilled_fields;
5152 constructor_bit_index = p->bit_index;
5153 constructor_elements = p->elements;
5154 constructor_constant = p->constant;
5155 constructor_simple = p->simple;
5156 constructor_erroneous = p->erroneous;
5157 constructor_incremental = p->incremental;
5158 constructor_designated = p->designated;
5159 constructor_pending_elts = p->pending_elts;
5160 constructor_depth = p->depth;
5162 constructor_range_stack = p->range_stack;
5163 RESTORE_SPELLING_DEPTH (constructor_depth);
5165 constructor_stack = p->next;
5170 if (constructor_stack == 0)
5172 ret.value = error_mark_node;
5180 /* Common handling for both array range and field name designators.
5181 ARRAY argument is nonzero for array ranges. Returns zero for success. */
5184 set_designator (int array)
5187 enum tree_code subcode;
5189 /* Don't die if an entire brace-pair level is superfluous
5190 in the containing level. */
5191 if (constructor_type == 0)
5194 /* If there were errors in this designator list already, bail out
5196 if (designator_errorneous)
5199 if (!designator_depth)
5201 gcc_assert (!constructor_range_stack);
5203 /* Designator list starts at the level of closest explicit
5205 while (constructor_stack->implicit)
5206 process_init_element (pop_init_level (1));
5207 constructor_designated = 1;
5211 switch (TREE_CODE (constructor_type))
5215 subtype = TREE_TYPE (constructor_fields);
5216 if (subtype != error_mark_node)
5217 subtype = TYPE_MAIN_VARIANT (subtype);
5220 subtype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
5226 subcode = TREE_CODE (subtype);
5227 if (array && subcode != ARRAY_TYPE)
5229 error_init ("array index in non-array initializer");
5232 else if (!array && subcode != RECORD_TYPE && subcode != UNION_TYPE)
5234 error_init ("field name not in record or union initializer");
5238 constructor_designated = 1;
5239 push_init_level (2);
5243 /* If there are range designators in designator list, push a new designator
5244 to constructor_range_stack. RANGE_END is end of such stack range or
5245 NULL_TREE if there is no range designator at this level. */
5248 push_range_stack (tree range_end)
5250 struct constructor_range_stack *p;
5252 p = GGC_NEW (struct constructor_range_stack);
5253 p->prev = constructor_range_stack;
5255 p->fields = constructor_fields;
5256 p->range_start = constructor_index;
5257 p->index = constructor_index;
5258 p->stack = constructor_stack;
5259 p->range_end = range_end;
5260 if (constructor_range_stack)
5261 constructor_range_stack->next = p;
5262 constructor_range_stack = p;
5265 /* Within an array initializer, specify the next index to be initialized.
5266 FIRST is that index. If LAST is nonzero, then initialize a range
5267 of indices, running from FIRST through LAST. */
5270 set_init_index (tree first, tree last)
5272 if (set_designator (1))
5275 designator_errorneous = 1;
5277 if (!INTEGRAL_TYPE_P (TREE_TYPE (first))
5278 || (last && !INTEGRAL_TYPE_P (TREE_TYPE (last))))
5280 error_init ("array index in initializer not of integer type");
5284 if (TREE_CODE (first) != INTEGER_CST)
5285 error_init ("nonconstant array index in initializer");
5286 else if (last != 0 && TREE_CODE (last) != INTEGER_CST)
5287 error_init ("nonconstant array index in initializer");
5288 else if (TREE_CODE (constructor_type) != ARRAY_TYPE)
5289 error_init ("array index in non-array initializer");
5290 else if (tree_int_cst_sgn (first) == -1)
5291 error_init ("array index in initializer exceeds array bounds");
5292 else if (constructor_max_index
5293 && tree_int_cst_lt (constructor_max_index, first))
5294 error_init ("array index in initializer exceeds array bounds");
5297 constructor_index = convert (bitsizetype, first);
5301 if (tree_int_cst_equal (first, last))
5303 else if (tree_int_cst_lt (last, first))
5305 error_init ("empty index range in initializer");
5310 last = convert (bitsizetype, last);
5311 if (constructor_max_index != 0
5312 && tree_int_cst_lt (constructor_max_index, last))
5314 error_init ("array index range in initializer exceeds array bounds");
5321 designator_errorneous = 0;
5322 if (constructor_range_stack || last)
5323 push_range_stack (last);
5327 /* Within a struct initializer, specify the next field to be initialized. */
5330 set_init_label (tree fieldname)
5334 if (set_designator (0))
5337 designator_errorneous = 1;
5339 if (TREE_CODE (constructor_type) != RECORD_TYPE
5340 && TREE_CODE (constructor_type) != UNION_TYPE)
5342 error_init ("field name not in record or union initializer");
5346 for (tail = TYPE_FIELDS (constructor_type); tail;
5347 tail = TREE_CHAIN (tail))
5349 if (DECL_NAME (tail) == fieldname)
5354 error ("unknown field %qE specified in initializer", fieldname);
5357 constructor_fields = tail;
5359 designator_errorneous = 0;
5360 if (constructor_range_stack)
5361 push_range_stack (NULL_TREE);
5365 /* Add a new initializer to the tree of pending initializers. PURPOSE
5366 identifies the initializer, either array index or field in a structure.
5367 VALUE is the value of that index or field. */
5370 add_pending_init (tree purpose, tree value)
5372 struct init_node *p, **q, *r;
5374 q = &constructor_pending_elts;
5377 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5382 if (tree_int_cst_lt (purpose, p->purpose))
5384 else if (tree_int_cst_lt (p->purpose, purpose))
5388 if (TREE_SIDE_EFFECTS (p->value))
5389 warning_init ("initialized field with side-effects overwritten");
5399 bitpos = bit_position (purpose);
5403 if (tree_int_cst_lt (bitpos, bit_position (p->purpose)))
5405 else if (p->purpose != purpose)
5409 if (TREE_SIDE_EFFECTS (p->value))
5410 warning_init ("initialized field with side-effects overwritten");
5417 r = GGC_NEW (struct init_node);
5418 r->purpose = purpose;
5429 struct init_node *s;
5433 if (p->balance == 0)
5435 else if (p->balance < 0)
5442 p->left->parent = p;
5459 constructor_pending_elts = r;
5464 struct init_node *t = r->right;
5468 r->right->parent = r;
5473 p->left->parent = p;
5476 p->balance = t->balance < 0;
5477 r->balance = -(t->balance > 0);
5492 constructor_pending_elts = t;
5498 /* p->balance == +1; growth of left side balances the node. */
5503 else /* r == p->right */
5505 if (p->balance == 0)
5506 /* Growth propagation from right side. */
5508 else if (p->balance > 0)
5515 p->right->parent = p;
5532 constructor_pending_elts = r;
5534 else /* r->balance == -1 */
5537 struct init_node *t = r->left;
5541 r->left->parent = r;
5546 p->right->parent = p;
5549 r->balance = (t->balance < 0);
5550 p->balance = -(t->balance > 0);
5565 constructor_pending_elts = t;
5571 /* p->balance == -1; growth of right side balances the node. */
5582 /* Build AVL tree from a sorted chain. */
5585 set_nonincremental_init (void)
5589 if (TREE_CODE (constructor_type) != RECORD_TYPE
5590 && TREE_CODE (constructor_type) != ARRAY_TYPE)
5593 for (chain = constructor_elements; chain; chain = TREE_CHAIN (chain))
5594 add_pending_init (TREE_PURPOSE (chain), TREE_VALUE (chain));
5595 constructor_elements = 0;
5596 if (TREE_CODE (constructor_type) == RECORD_TYPE)
5598 constructor_unfilled_fields = TYPE_FIELDS (constructor_type);
5599 /* Skip any nameless bit fields at the beginning. */
5600 while (constructor_unfilled_fields != 0
5601 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
5602 && DECL_NAME (constructor_unfilled_fields) == 0)
5603 constructor_unfilled_fields = TREE_CHAIN (constructor_unfilled_fields);
5606 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5608 if (TYPE_DOMAIN (constructor_type))
5609 constructor_unfilled_index
5610 = convert (bitsizetype,
5611 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
5613 constructor_unfilled_index = bitsize_zero_node;
5615 constructor_incremental = 0;
5618 /* Build AVL tree from a string constant. */
5621 set_nonincremental_init_from_string (tree str)
5623 tree value, purpose, type;
5624 HOST_WIDE_INT val[2];
5625 const char *p, *end;
5626 int byte, wchar_bytes, charwidth, bitpos;
5628 gcc_assert (TREE_CODE (constructor_type) == ARRAY_TYPE);
5630 if (TYPE_PRECISION (TREE_TYPE (TREE_TYPE (str)))
5631 == TYPE_PRECISION (char_type_node))
5635 gcc_assert (TYPE_PRECISION (TREE_TYPE (TREE_TYPE (str)))
5636 == TYPE_PRECISION (wchar_type_node));
5637 wchar_bytes = TYPE_PRECISION (wchar_type_node) / BITS_PER_UNIT;
5639 charwidth = TYPE_PRECISION (char_type_node);
5640 type = TREE_TYPE (constructor_type);
5641 p = TREE_STRING_POINTER (str);
5642 end = p + TREE_STRING_LENGTH (str);
5644 for (purpose = bitsize_zero_node;
5645 p < end && !tree_int_cst_lt (constructor_max_index, purpose);
5646 purpose = size_binop (PLUS_EXPR, purpose, bitsize_one_node))
5648 if (wchar_bytes == 1)
5650 val[1] = (unsigned char) *p++;
5657 for (byte = 0; byte < wchar_bytes; byte++)
5659 if (BYTES_BIG_ENDIAN)
5660 bitpos = (wchar_bytes - byte - 1) * charwidth;
5662 bitpos = byte * charwidth;
5663 val[bitpos < HOST_BITS_PER_WIDE_INT]
5664 |= ((unsigned HOST_WIDE_INT) ((unsigned char) *p++))
5665 << (bitpos % HOST_BITS_PER_WIDE_INT);
5669 if (!TYPE_UNSIGNED (type))
5671 bitpos = ((wchar_bytes - 1) * charwidth) + HOST_BITS_PER_CHAR;
5672 if (bitpos < HOST_BITS_PER_WIDE_INT)
5674 if (val[1] & (((HOST_WIDE_INT) 1) << (bitpos - 1)))
5676 val[1] |= ((HOST_WIDE_INT) -1) << bitpos;
5680 else if (bitpos == HOST_BITS_PER_WIDE_INT)
5685 else if (val[0] & (((HOST_WIDE_INT) 1)
5686 << (bitpos - 1 - HOST_BITS_PER_WIDE_INT)))
5687 val[0] |= ((HOST_WIDE_INT) -1)
5688 << (bitpos - HOST_BITS_PER_WIDE_INT);
5691 value = build_int_cst_wide (type, val[1], val[0]);
5692 add_pending_init (purpose, value);
5695 constructor_incremental = 0;
5698 /* Return value of FIELD in pending initializer or zero if the field was
5699 not initialized yet. */
5702 find_init_member (tree field)
5704 struct init_node *p;
5706 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5708 if (constructor_incremental
5709 && tree_int_cst_lt (field, constructor_unfilled_index))
5710 set_nonincremental_init ();
5712 p = constructor_pending_elts;
5715 if (tree_int_cst_lt (field, p->purpose))
5717 else if (tree_int_cst_lt (p->purpose, field))
5723 else if (TREE_CODE (constructor_type) == RECORD_TYPE)
5725 tree bitpos = bit_position (field);
5727 if (constructor_incremental
5728 && (!constructor_unfilled_fields
5729 || tree_int_cst_lt (bitpos,
5730 bit_position (constructor_unfilled_fields))))
5731 set_nonincremental_init ();
5733 p = constructor_pending_elts;
5736 if (field == p->purpose)
5738 else if (tree_int_cst_lt (bitpos, bit_position (p->purpose)))
5744 else if (TREE_CODE (constructor_type) == UNION_TYPE)
5746 if (constructor_elements
5747 && TREE_PURPOSE (constructor_elements) == field)
5748 return TREE_VALUE (constructor_elements);
5753 /* "Output" the next constructor element.
5754 At top level, really output it to assembler code now.
5755 Otherwise, collect it in a list from which we will make a CONSTRUCTOR.
5756 TYPE is the data type that the containing data type wants here.
5757 FIELD is the field (a FIELD_DECL) or the index that this element fills.
5758 If VALUE is a string constant, STRICT_STRING is true if it is
5759 unparenthesized or we should not warn here for it being parenthesized.
5760 For other types of VALUE, STRICT_STRING is not used.
5762 PENDING if non-nil means output pending elements that belong
5763 right after this element. (PENDING is normally 1;
5764 it is 0 while outputting pending elements, to avoid recursion.) */
5767 output_init_element (tree value, bool strict_string, tree type, tree field,
5770 if (type == error_mark_node || value == error_mark_node)
5772 constructor_erroneous = 1;
5775 if (TREE_CODE (TREE_TYPE (value)) == ARRAY_TYPE
5776 && (TREE_CODE (value) == STRING_CST
5777 || TREE_CODE (value) == COMPOUND_LITERAL_EXPR)
5778 && !(TREE_CODE (value) == STRING_CST
5779 && TREE_CODE (type) == ARRAY_TYPE
5780 && INTEGRAL_TYPE_P (TREE_TYPE (type)))
5781 && !comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (value)),
5782 TYPE_MAIN_VARIANT (type)))
5783 value = default_function_array_conversion (value);
5785 if (TREE_CODE (value) == COMPOUND_LITERAL_EXPR
5786 && require_constant_value && !flag_isoc99 && pending)
5788 /* As an extension, allow initializing objects with static storage
5789 duration with compound literals (which are then treated just as
5790 the brace enclosed list they contain). */
5791 tree decl = COMPOUND_LITERAL_EXPR_DECL (value);
5792 value = DECL_INITIAL (decl);
5795 if (value == error_mark_node)
5796 constructor_erroneous = 1;
5797 else if (!TREE_CONSTANT (value))
5798 constructor_constant = 0;
5799 else if (!initializer_constant_valid_p (value, TREE_TYPE (value))
5800 || ((TREE_CODE (constructor_type) == RECORD_TYPE
5801 || TREE_CODE (constructor_type) == UNION_TYPE)
5802 && DECL_C_BIT_FIELD (field)
5803 && TREE_CODE (value) != INTEGER_CST))
5804 constructor_simple = 0;
5806 if (!initializer_constant_valid_p (value, TREE_TYPE (value)))
5808 if (require_constant_value)
5810 error_init ("initializer element is not constant");
5811 value = error_mark_node;
5813 else if (require_constant_elements)
5814 pedwarn ("initializer element is not computable at load time");
5817 /* If this field is empty (and not at the end of structure),
5818 don't do anything other than checking the initializer. */
5820 && (TREE_TYPE (field) == error_mark_node
5821 || (COMPLETE_TYPE_P (TREE_TYPE (field))
5822 && integer_zerop (TYPE_SIZE (TREE_TYPE (field)))
5823 && (TREE_CODE (constructor_type) == ARRAY_TYPE
5824 || TREE_CHAIN (field)))))
5827 value = digest_init (type, value, strict_string, require_constant_value);
5828 if (value == error_mark_node)
5830 constructor_erroneous = 1;
5834 /* If this element doesn't come next in sequence,
5835 put it on constructor_pending_elts. */
5836 if (TREE_CODE (constructor_type) == ARRAY_TYPE
5837 && (!constructor_incremental
5838 || !tree_int_cst_equal (field, constructor_unfilled_index)))
5840 if (constructor_incremental
5841 && tree_int_cst_lt (field, constructor_unfilled_index))
5842 set_nonincremental_init ();
5844 add_pending_init (field, value);
5847 else if (TREE_CODE (constructor_type) == RECORD_TYPE
5848 && (!constructor_incremental
5849 || field != constructor_unfilled_fields))
5851 /* We do this for records but not for unions. In a union,
5852 no matter which field is specified, it can be initialized
5853 right away since it starts at the beginning of the union. */
5854 if (constructor_incremental)
5856 if (!constructor_unfilled_fields)
5857 set_nonincremental_init ();
5860 tree bitpos, unfillpos;
5862 bitpos = bit_position (field);
5863 unfillpos = bit_position (constructor_unfilled_fields);
5865 if (tree_int_cst_lt (bitpos, unfillpos))
5866 set_nonincremental_init ();
5870 add_pending_init (field, value);
5873 else if (TREE_CODE (constructor_type) == UNION_TYPE
5874 && constructor_elements)
5876 if (TREE_SIDE_EFFECTS (TREE_VALUE (constructor_elements)))
5877 warning_init ("initialized field with side-effects overwritten");
5879 /* We can have just one union field set. */
5880 constructor_elements = 0;
5883 /* Otherwise, output this element either to
5884 constructor_elements or to the assembler file. */
5886 if (field && TREE_CODE (field) == INTEGER_CST)
5887 field = copy_node (field);
5888 constructor_elements
5889 = tree_cons (field, value, constructor_elements);
5891 /* Advance the variable that indicates sequential elements output. */
5892 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5893 constructor_unfilled_index
5894 = size_binop (PLUS_EXPR, constructor_unfilled_index,
5896 else if (TREE_CODE (constructor_type) == RECORD_TYPE)
5898 constructor_unfilled_fields
5899 = TREE_CHAIN (constructor_unfilled_fields);
5901 /* Skip any nameless bit fields. */
5902 while (constructor_unfilled_fields != 0
5903 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
5904 && DECL_NAME (constructor_unfilled_fields) == 0)
5905 constructor_unfilled_fields =
5906 TREE_CHAIN (constructor_unfilled_fields);
5908 else if (TREE_CODE (constructor_type) == UNION_TYPE)
5909 constructor_unfilled_fields = 0;
5911 /* Now output any pending elements which have become next. */
5913 output_pending_init_elements (0);
5916 /* Output any pending elements which have become next.
5917 As we output elements, constructor_unfilled_{fields,index}
5918 advances, which may cause other elements to become next;
5919 if so, they too are output.
5921 If ALL is 0, we return when there are
5922 no more pending elements to output now.
5924 If ALL is 1, we output space as necessary so that
5925 we can output all the pending elements. */
5928 output_pending_init_elements (int all)
5930 struct init_node *elt = constructor_pending_elts;
5935 /* Look through the whole pending tree.
5936 If we find an element that should be output now,
5937 output it. Otherwise, set NEXT to the element
5938 that comes first among those still pending. */
5943 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5945 if (tree_int_cst_equal (elt->purpose,
5946 constructor_unfilled_index))
5947 output_init_element (elt->value, true,
5948 TREE_TYPE (constructor_type),
5949 constructor_unfilled_index, 0);
5950 else if (tree_int_cst_lt (constructor_unfilled_index,
5953 /* Advance to the next smaller node. */
5958 /* We have reached the smallest node bigger than the
5959 current unfilled index. Fill the space first. */
5960 next = elt->purpose;
5966 /* Advance to the next bigger node. */
5971 /* We have reached the biggest node in a subtree. Find
5972 the parent of it, which is the next bigger node. */
5973 while (elt->parent && elt->parent->right == elt)
5976 if (elt && tree_int_cst_lt (constructor_unfilled_index,
5979 next = elt->purpose;
5985 else if (TREE_CODE (constructor_type) == RECORD_TYPE
5986 || TREE_CODE (constructor_type) == UNION_TYPE)
5988 tree ctor_unfilled_bitpos, elt_bitpos;
5990 /* If the current record is complete we are done. */
5991 if (constructor_unfilled_fields == 0)
5994 ctor_unfilled_bitpos = bit_position (constructor_unfilled_fields);
5995 elt_bitpos = bit_position (elt->purpose);
5996 /* We can't compare fields here because there might be empty
5997 fields in between. */
5998 if (tree_int_cst_equal (elt_bitpos, ctor_unfilled_bitpos))
6000 constructor_unfilled_fields = elt->purpose;
6001 output_init_element (elt->value, true, TREE_TYPE (elt->purpose),
6004 else if (tree_int_cst_lt (ctor_unfilled_bitpos, elt_bitpos))
6006 /* Advance to the next smaller node. */
6011 /* We have reached the smallest node bigger than the
6012 current unfilled field. Fill the space first. */
6013 next = elt->purpose;
6019 /* Advance to the next bigger node. */
6024 /* We have reached the biggest node in a subtree. Find
6025 the parent of it, which is the next bigger node. */
6026 while (elt->parent && elt->parent->right == elt)
6030 && (tree_int_cst_lt (ctor_unfilled_bitpos,
6031 bit_position (elt->purpose))))
6033 next = elt->purpose;
6041 /* Ordinarily return, but not if we want to output all
6042 and there are elements left. */
6043 if (!(all && next != 0))
6046 /* If it's not incremental, just skip over the gap, so that after
6047 jumping to retry we will output the next successive element. */
6048 if (TREE_CODE (constructor_type) == RECORD_TYPE
6049 || TREE_CODE (constructor_type) == UNION_TYPE)
6050 constructor_unfilled_fields = next;
6051 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6052 constructor_unfilled_index = next;
6054 /* ELT now points to the node in the pending tree with the next
6055 initializer to output. */
6059 /* Add one non-braced element to the current constructor level.
6060 This adjusts the current position within the constructor's type.
6061 This may also start or terminate implicit levels
6062 to handle a partly-braced initializer.
6064 Once this has found the correct level for the new element,
6065 it calls output_init_element. */
6068 process_init_element (struct c_expr value)
6070 tree orig_value = value.value;
6071 int string_flag = orig_value != 0 && TREE_CODE (orig_value) == STRING_CST;
6072 bool strict_string = value.original_code == STRING_CST;
6074 designator_depth = 0;
6075 designator_errorneous = 0;
6077 /* Handle superfluous braces around string cst as in
6078 char x[] = {"foo"}; */
6081 && TREE_CODE (constructor_type) == ARRAY_TYPE
6082 && INTEGRAL_TYPE_P (TREE_TYPE (constructor_type))
6083 && integer_zerop (constructor_unfilled_index))
6085 if (constructor_stack->replacement_value.value)
6086 error_init ("excess elements in char array initializer");
6087 constructor_stack->replacement_value = value;
6091 if (constructor_stack->replacement_value.value != 0)
6093 error_init ("excess elements in struct initializer");
6097 /* Ignore elements of a brace group if it is entirely superfluous
6098 and has already been diagnosed. */
6099 if (constructor_type == 0)
6102 /* If we've exhausted any levels that didn't have braces,
6104 while (constructor_stack->implicit)
6106 if ((TREE_CODE (constructor_type) == RECORD_TYPE
6107 || TREE_CODE (constructor_type) == UNION_TYPE)
6108 && constructor_fields == 0)
6109 process_init_element (pop_init_level (1));
6110 else if (TREE_CODE (constructor_type) == ARRAY_TYPE
6111 && (constructor_max_index == 0
6112 || tree_int_cst_lt (constructor_max_index,
6113 constructor_index)))
6114 process_init_element (pop_init_level (1));
6119 /* In the case of [LO ... HI] = VALUE, only evaluate VALUE once. */
6120 if (constructor_range_stack)
6122 /* If value is a compound literal and we'll be just using its
6123 content, don't put it into a SAVE_EXPR. */
6124 if (TREE_CODE (value.value) != COMPOUND_LITERAL_EXPR
6125 || !require_constant_value
6127 value.value = save_expr (value.value);
6132 if (TREE_CODE (constructor_type) == RECORD_TYPE)
6135 enum tree_code fieldcode;
6137 if (constructor_fields == 0)
6139 pedwarn_init ("excess elements in struct initializer");
6143 fieldtype = TREE_TYPE (constructor_fields);
6144 if (fieldtype != error_mark_node)
6145 fieldtype = TYPE_MAIN_VARIANT (fieldtype);
6146 fieldcode = TREE_CODE (fieldtype);
6148 /* Error for non-static initialization of a flexible array member. */
6149 if (fieldcode == ARRAY_TYPE
6150 && !require_constant_value
6151 && TYPE_SIZE (fieldtype) == NULL_TREE
6152 && TREE_CHAIN (constructor_fields) == NULL_TREE)
6154 error_init ("non-static initialization of a flexible array member");
6158 /* Accept a string constant to initialize a subarray. */
6159 if (value.value != 0
6160 && fieldcode == ARRAY_TYPE
6161 && INTEGRAL_TYPE_P (TREE_TYPE (fieldtype))
6163 value.value = orig_value;
6164 /* Otherwise, if we have come to a subaggregate,
6165 and we don't have an element of its type, push into it. */
6166 else if (value.value != 0
6167 && value.value != error_mark_node
6168 && TYPE_MAIN_VARIANT (TREE_TYPE (value.value)) != fieldtype
6169 && (fieldcode == RECORD_TYPE || fieldcode == ARRAY_TYPE
6170 || fieldcode == UNION_TYPE))
6172 push_init_level (1);
6178 push_member_name (constructor_fields);
6179 output_init_element (value.value, strict_string,
6180 fieldtype, constructor_fields, 1);
6181 RESTORE_SPELLING_DEPTH (constructor_depth);
6184 /* Do the bookkeeping for an element that was
6185 directly output as a constructor. */
6187 /* For a record, keep track of end position of last field. */
6188 if (DECL_SIZE (constructor_fields))
6189 constructor_bit_index
6190 = size_binop (PLUS_EXPR,
6191 bit_position (constructor_fields),
6192 DECL_SIZE (constructor_fields));
6194 /* If the current field was the first one not yet written out,
6195 it isn't now, so update. */
6196 if (constructor_unfilled_fields == constructor_fields)
6198 constructor_unfilled_fields = TREE_CHAIN (constructor_fields);
6199 /* Skip any nameless bit fields. */
6200 while (constructor_unfilled_fields != 0
6201 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
6202 && DECL_NAME (constructor_unfilled_fields) == 0)
6203 constructor_unfilled_fields =
6204 TREE_CHAIN (constructor_unfilled_fields);
6208 constructor_fields = TREE_CHAIN (constructor_fields);
6209 /* Skip any nameless bit fields at the beginning. */
6210 while (constructor_fields != 0
6211 && DECL_C_BIT_FIELD (constructor_fields)
6212 && DECL_NAME (constructor_fields) == 0)
6213 constructor_fields = TREE_CHAIN (constructor_fields);
6215 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6218 enum tree_code fieldcode;
6220 if (constructor_fields == 0)
6222 pedwarn_init ("excess elements in union initializer");
6226 fieldtype = TREE_TYPE (constructor_fields);
6227 if (fieldtype != error_mark_node)
6228 fieldtype = TYPE_MAIN_VARIANT (fieldtype);
6229 fieldcode = TREE_CODE (fieldtype);
6231 /* Warn that traditional C rejects initialization of unions.
6232 We skip the warning if the value is zero. This is done
6233 under the assumption that the zero initializer in user
6234 code appears conditioned on e.g. __STDC__ to avoid
6235 "missing initializer" warnings and relies on default
6236 initialization to zero in the traditional C case.
6237 We also skip the warning if the initializer is designated,
6238 again on the assumption that this must be conditional on
6239 __STDC__ anyway (and we've already complained about the
6240 member-designator already). */
6241 if (warn_traditional && !in_system_header && !constructor_designated
6242 && !(value.value && (integer_zerop (value.value)
6243 || real_zerop (value.value))))
6244 warning (0, "traditional C rejects initialization of unions");
6246 /* Accept a string constant to initialize a subarray. */
6247 if (value.value != 0
6248 && fieldcode == ARRAY_TYPE
6249 && INTEGRAL_TYPE_P (TREE_TYPE (fieldtype))
6251 value.value = orig_value;
6252 /* Otherwise, if we have come to a subaggregate,
6253 and we don't have an element of its type, push into it. */
6254 else if (value.value != 0
6255 && value.value != error_mark_node
6256 && TYPE_MAIN_VARIANT (TREE_TYPE (value.value)) != fieldtype
6257 && (fieldcode == RECORD_TYPE || fieldcode == ARRAY_TYPE
6258 || fieldcode == UNION_TYPE))
6260 push_init_level (1);
6266 push_member_name (constructor_fields);
6267 output_init_element (value.value, strict_string,
6268 fieldtype, constructor_fields, 1);
6269 RESTORE_SPELLING_DEPTH (constructor_depth);
6272 /* Do the bookkeeping for an element that was
6273 directly output as a constructor. */
6275 constructor_bit_index = DECL_SIZE (constructor_fields);
6276 constructor_unfilled_fields = TREE_CHAIN (constructor_fields);
6279 constructor_fields = 0;
6281 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6283 tree elttype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
6284 enum tree_code eltcode = TREE_CODE (elttype);
6286 /* Accept a string constant to initialize a subarray. */
6287 if (value.value != 0
6288 && eltcode == ARRAY_TYPE
6289 && INTEGRAL_TYPE_P (TREE_TYPE (elttype))
6291 value.value = orig_value;
6292 /* Otherwise, if we have come to a subaggregate,
6293 and we don't have an element of its type, push into it. */
6294 else if (value.value != 0
6295 && value.value != error_mark_node
6296 && TYPE_MAIN_VARIANT (TREE_TYPE (value.value)) != elttype
6297 && (eltcode == RECORD_TYPE || eltcode == ARRAY_TYPE
6298 || eltcode == UNION_TYPE))
6300 push_init_level (1);
6304 if (constructor_max_index != 0
6305 && (tree_int_cst_lt (constructor_max_index, constructor_index)
6306 || integer_all_onesp (constructor_max_index)))
6308 pedwarn_init ("excess elements in array initializer");
6312 /* Now output the actual element. */
6315 push_array_bounds (tree_low_cst (constructor_index, 0));
6316 output_init_element (value.value, strict_string,
6317 elttype, constructor_index, 1);
6318 RESTORE_SPELLING_DEPTH (constructor_depth);
6322 = size_binop (PLUS_EXPR, constructor_index, bitsize_one_node);
6325 /* If we are doing the bookkeeping for an element that was
6326 directly output as a constructor, we must update
6327 constructor_unfilled_index. */
6328 constructor_unfilled_index = constructor_index;
6330 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
6332 tree elttype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
6334 /* Do a basic check of initializer size. Note that vectors
6335 always have a fixed size derived from their type. */
6336 if (tree_int_cst_lt (constructor_max_index, constructor_index))
6338 pedwarn_init ("excess elements in vector initializer");
6342 /* Now output the actual element. */
6344 output_init_element (value.value, strict_string,
6345 elttype, constructor_index, 1);
6348 = size_binop (PLUS_EXPR, constructor_index, bitsize_one_node);
6351 /* If we are doing the bookkeeping for an element that was
6352 directly output as a constructor, we must update
6353 constructor_unfilled_index. */
6354 constructor_unfilled_index = constructor_index;
6357 /* Handle the sole element allowed in a braced initializer
6358 for a scalar variable. */
6359 else if (constructor_type != error_mark_node
6360 && constructor_fields == 0)
6362 pedwarn_init ("excess elements in scalar initializer");
6368 output_init_element (value.value, strict_string,
6369 constructor_type, NULL_TREE, 1);
6370 constructor_fields = 0;
6373 /* Handle range initializers either at this level or anywhere higher
6374 in the designator stack. */
6375 if (constructor_range_stack)
6377 struct constructor_range_stack *p, *range_stack;
6380 range_stack = constructor_range_stack;
6381 constructor_range_stack = 0;
6382 while (constructor_stack != range_stack->stack)
6384 gcc_assert (constructor_stack->implicit);
6385 process_init_element (pop_init_level (1));
6387 for (p = range_stack;
6388 !p->range_end || tree_int_cst_equal (p->index, p->range_end);
6391 gcc_assert (constructor_stack->implicit);
6392 process_init_element (pop_init_level (1));
6395 p->index = size_binop (PLUS_EXPR, p->index, bitsize_one_node);
6396 if (tree_int_cst_equal (p->index, p->range_end) && !p->prev)
6401 constructor_index = p->index;
6402 constructor_fields = p->fields;
6403 if (finish && p->range_end && p->index == p->range_start)
6411 push_init_level (2);
6412 p->stack = constructor_stack;
6413 if (p->range_end && tree_int_cst_equal (p->index, p->range_end))
6414 p->index = p->range_start;
6418 constructor_range_stack = range_stack;
6425 constructor_range_stack = 0;
6428 /* Build a complete asm-statement, whose components are a CV_QUALIFIER
6429 (guaranteed to be 'volatile' or null) and ARGS (represented using
6430 an ASM_EXPR node). */
6432 build_asm_stmt (tree cv_qualifier, tree args)
6434 if (!ASM_VOLATILE_P (args) && cv_qualifier)
6435 ASM_VOLATILE_P (args) = 1;
6436 return add_stmt (args);
6439 /* Build an asm-expr, whose components are a STRING, some OUTPUTS,
6440 some INPUTS, and some CLOBBERS. The latter three may be NULL.
6441 SIMPLE indicates whether there was anything at all after the
6442 string in the asm expression -- asm("blah") and asm("blah" : )
6443 are subtly different. We use a ASM_EXPR node to represent this. */
6445 build_asm_expr (tree string, tree outputs, tree inputs, tree clobbers,
6451 const char *constraint;
6452 const char **oconstraints;
6453 bool allows_mem, allows_reg, is_inout;
6454 int ninputs, noutputs;
6456 ninputs = list_length (inputs);
6457 noutputs = list_length (outputs);
6458 oconstraints = (const char **) alloca (noutputs * sizeof (const char *));
6460 string = resolve_asm_operand_names (string, outputs, inputs);
6462 /* Remove output conversions that change the type but not the mode. */
6463 for (i = 0, tail = outputs; tail; ++i, tail = TREE_CHAIN (tail))
6465 tree output = TREE_VALUE (tail);
6467 /* ??? Really, this should not be here. Users should be using a
6468 proper lvalue, dammit. But there's a long history of using casts
6469 in the output operands. In cases like longlong.h, this becomes a
6470 primitive form of typechecking -- if the cast can be removed, then
6471 the output operand had a type of the proper width; otherwise we'll
6472 get an error. Gross, but ... */
6473 STRIP_NOPS (output);
6475 if (!lvalue_or_else (output, lv_asm))
6476 output = error_mark_node;
6478 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
6479 oconstraints[i] = constraint;
6481 if (parse_output_constraint (&constraint, i, ninputs, noutputs,
6482 &allows_mem, &allows_reg, &is_inout))
6484 /* If the operand is going to end up in memory,
6485 mark it addressable. */
6486 if (!allows_reg && !c_mark_addressable (output))
6487 output = error_mark_node;
6490 output = error_mark_node;
6492 TREE_VALUE (tail) = output;
6495 for (i = 0, tail = inputs; tail; ++i, tail = TREE_CHAIN (tail))
6499 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
6500 input = TREE_VALUE (tail);
6502 if (parse_input_constraint (&constraint, i, ninputs, noutputs, 0,
6503 oconstraints, &allows_mem, &allows_reg))
6505 /* If the operand is going to end up in memory,
6506 mark it addressable. */
6507 if (!allows_reg && allows_mem)
6509 /* Strip the nops as we allow this case. FIXME, this really
6510 should be rejected or made deprecated. */
6512 if (!c_mark_addressable (input))
6513 input = error_mark_node;
6517 input = error_mark_node;
6519 TREE_VALUE (tail) = input;
6522 args = build_stmt (ASM_EXPR, string, outputs, inputs, clobbers);
6524 /* Simple asm statements are treated as volatile. */
6527 ASM_VOLATILE_P (args) = 1;
6528 ASM_INPUT_P (args) = 1;
6534 /* Generate a goto statement to LABEL. */
6537 c_finish_goto_label (tree label)
6539 tree decl = lookup_label (label);
6543 if (C_DECL_UNJUMPABLE_STMT_EXPR (decl))
6545 error ("jump into statement expression");
6549 if (C_DECL_UNJUMPABLE_VM (decl))
6551 error ("jump into scope of identifier with variably modified type");
6555 if (!C_DECL_UNDEFINABLE_STMT_EXPR (decl))
6557 /* No jump from outside this statement expression context, so
6558 record that there is a jump from within this context. */
6559 struct c_label_list *nlist;
6560 nlist = XOBNEW (&parser_obstack, struct c_label_list);
6561 nlist->next = label_context_stack_se->labels_used;
6562 nlist->label = decl;
6563 label_context_stack_se->labels_used = nlist;
6566 if (!C_DECL_UNDEFINABLE_VM (decl))
6568 /* No jump from outside this context context of identifiers with
6569 variably modified type, so record that there is a jump from
6570 within this context. */
6571 struct c_label_list *nlist;
6572 nlist = XOBNEW (&parser_obstack, struct c_label_list);
6573 nlist->next = label_context_stack_vm->labels_used;
6574 nlist->label = decl;
6575 label_context_stack_vm->labels_used = nlist;
6578 TREE_USED (decl) = 1;
6579 return add_stmt (build1 (GOTO_EXPR, void_type_node, decl));
6582 /* Generate a computed goto statement to EXPR. */
6585 c_finish_goto_ptr (tree expr)
6588 pedwarn ("ISO C forbids %<goto *expr;%>");
6589 expr = convert (ptr_type_node, expr);
6590 return add_stmt (build1 (GOTO_EXPR, void_type_node, expr));
6593 /* Generate a C `return' statement. RETVAL is the expression for what
6594 to return, or a null pointer for `return;' with no value. */
6597 c_finish_return (tree retval)
6599 tree valtype = TREE_TYPE (TREE_TYPE (current_function_decl));
6601 if (TREE_THIS_VOLATILE (current_function_decl))
6602 warning (0, "function declared %<noreturn%> has a %<return%> statement");
6606 current_function_returns_null = 1;
6607 if ((warn_return_type || flag_isoc99)
6608 && valtype != 0 && TREE_CODE (valtype) != VOID_TYPE)
6609 pedwarn_c99 ("%<return%> with no value, in "
6610 "function returning non-void");
6612 else if (valtype == 0 || TREE_CODE (valtype) == VOID_TYPE)
6614 current_function_returns_null = 1;
6615 if (pedantic || TREE_CODE (TREE_TYPE (retval)) != VOID_TYPE)
6616 pedwarn ("%<return%> with a value, in function returning void");
6620 tree t = convert_for_assignment (valtype, retval, ic_return,
6621 NULL_TREE, NULL_TREE, 0);
6622 tree res = DECL_RESULT (current_function_decl);
6625 current_function_returns_value = 1;
6626 if (t == error_mark_node)
6629 inner = t = convert (TREE_TYPE (res), t);
6631 /* Strip any conversions, additions, and subtractions, and see if
6632 we are returning the address of a local variable. Warn if so. */
6635 switch (TREE_CODE (inner))
6637 case NOP_EXPR: case NON_LVALUE_EXPR: case CONVERT_EXPR:
6639 inner = TREE_OPERAND (inner, 0);
6643 /* If the second operand of the MINUS_EXPR has a pointer
6644 type (or is converted from it), this may be valid, so
6645 don't give a warning. */
6647 tree op1 = TREE_OPERAND (inner, 1);
6649 while (!POINTER_TYPE_P (TREE_TYPE (op1))
6650 && (TREE_CODE (op1) == NOP_EXPR
6651 || TREE_CODE (op1) == NON_LVALUE_EXPR
6652 || TREE_CODE (op1) == CONVERT_EXPR))
6653 op1 = TREE_OPERAND (op1, 0);
6655 if (POINTER_TYPE_P (TREE_TYPE (op1)))
6658 inner = TREE_OPERAND (inner, 0);
6663 inner = TREE_OPERAND (inner, 0);
6665 while (REFERENCE_CLASS_P (inner)
6666 && TREE_CODE (inner) != INDIRECT_REF)
6667 inner = TREE_OPERAND (inner, 0);
6670 && !DECL_EXTERNAL (inner)
6671 && !TREE_STATIC (inner)
6672 && DECL_CONTEXT (inner) == current_function_decl)
6673 warning (0, "function returns address of local variable");
6683 retval = build2 (MODIFY_EXPR, TREE_TYPE (res), res, t);
6686 return add_stmt (build_stmt (RETURN_EXPR, retval));
6690 /* The SWITCH_EXPR being built. */
6693 /* The original type of the testing expression, i.e. before the
6694 default conversion is applied. */
6697 /* A splay-tree mapping the low element of a case range to the high
6698 element, or NULL_TREE if there is no high element. Used to
6699 determine whether or not a new case label duplicates an old case
6700 label. We need a tree, rather than simply a hash table, because
6701 of the GNU case range extension. */
6704 /* Number of nested statement expressions within this switch
6705 statement; if nonzero, case and default labels may not
6707 unsigned int blocked_stmt_expr;
6709 /* Scope of outermost declarations of identifiers with variably
6710 modified type within this switch statement; if nonzero, case and
6711 default labels may not appear. */
6712 unsigned int blocked_vm;
6714 /* The next node on the stack. */
6715 struct c_switch *next;
6718 /* A stack of the currently active switch statements. The innermost
6719 switch statement is on the top of the stack. There is no need to
6720 mark the stack for garbage collection because it is only active
6721 during the processing of the body of a function, and we never
6722 collect at that point. */
6724 struct c_switch *c_switch_stack;
6726 /* Start a C switch statement, testing expression EXP. Return the new
6730 c_start_case (tree exp)
6732 enum tree_code code;
6733 tree type, orig_type = error_mark_node;
6734 struct c_switch *cs;
6736 if (exp != error_mark_node)
6738 code = TREE_CODE (TREE_TYPE (exp));
6739 orig_type = TREE_TYPE (exp);
6741 if (!INTEGRAL_TYPE_P (orig_type)
6742 && code != ERROR_MARK)
6744 error ("switch quantity not an integer");
6745 exp = integer_zero_node;
6746 orig_type = error_mark_node;
6750 type = TYPE_MAIN_VARIANT (TREE_TYPE (exp));
6752 if (warn_traditional && !in_system_header
6753 && (type == long_integer_type_node
6754 || type == long_unsigned_type_node))
6755 warning (0, "%<long%> switch expression not converted to "
6756 "%<int%> in ISO C");
6758 exp = default_conversion (exp);
6759 type = TREE_TYPE (exp);
6763 /* Add this new SWITCH_EXPR to the stack. */
6764 cs = XNEW (struct c_switch);
6765 cs->switch_expr = build3 (SWITCH_EXPR, orig_type, exp, NULL_TREE, NULL_TREE);
6766 cs->orig_type = orig_type;
6767 cs->cases = splay_tree_new (case_compare, NULL, NULL);
6768 cs->blocked_stmt_expr = 0;
6770 cs->next = c_switch_stack;
6771 c_switch_stack = cs;
6773 return add_stmt (cs->switch_expr);
6776 /* Process a case label. */
6779 do_case (tree low_value, tree high_value)
6781 tree label = NULL_TREE;
6783 if (c_switch_stack && !c_switch_stack->blocked_stmt_expr
6784 && !c_switch_stack->blocked_vm)
6786 label = c_add_case_label (c_switch_stack->cases,
6787 SWITCH_COND (c_switch_stack->switch_expr),
6788 c_switch_stack->orig_type,
6789 low_value, high_value);
6790 if (label == error_mark_node)
6793 else if (c_switch_stack && c_switch_stack->blocked_stmt_expr)
6796 error ("case label in statement expression not containing "
6797 "enclosing switch statement");
6799 error ("%<default%> label in statement expression not containing "
6800 "enclosing switch statement");
6802 else if (c_switch_stack && c_switch_stack->blocked_vm)
6805 error ("case label in scope of identifier with variably modified "
6806 "type not containing enclosing switch statement");
6808 error ("%<default%> label in scope of identifier with variably "
6809 "modified type not containing enclosing switch statement");
6812 error ("case label not within a switch statement");
6814 error ("%<default%> label not within a switch statement");
6819 /* Finish the switch statement. */
6822 c_finish_case (tree body)
6824 struct c_switch *cs = c_switch_stack;
6825 location_t switch_location;
6827 SWITCH_BODY (cs->switch_expr) = body;
6829 /* We must not be within a statement expression nested in the switch
6830 at this point; we might, however, be within the scope of an
6831 identifier with variably modified type nested in the switch. */
6832 gcc_assert (!cs->blocked_stmt_expr);
6834 /* Emit warnings as needed. */
6835 if (EXPR_HAS_LOCATION (cs->switch_expr))
6836 switch_location = EXPR_LOCATION (cs->switch_expr);
6838 switch_location = input_location;
6839 c_do_switch_warnings (cs->cases, switch_location,
6840 TREE_TYPE (cs->switch_expr),
6841 SWITCH_COND (cs->switch_expr));
6843 /* Pop the stack. */
6844 c_switch_stack = cs->next;
6845 splay_tree_delete (cs->cases);
6849 /* Emit an if statement. IF_LOCUS is the location of the 'if'. COND,
6850 THEN_BLOCK and ELSE_BLOCK are expressions to be used; ELSE_BLOCK
6851 may be null. NESTED_IF is true if THEN_BLOCK contains another IF
6852 statement, and was not surrounded with parenthesis. */
6855 c_finish_if_stmt (location_t if_locus, tree cond, tree then_block,
6856 tree else_block, bool nested_if)
6860 /* Diagnose an ambiguous else if if-then-else is nested inside if-then. */
6861 if (warn_parentheses && nested_if && else_block == NULL)
6863 tree inner_if = then_block;
6865 /* We know from the grammar productions that there is an IF nested
6866 within THEN_BLOCK. Due to labels and c99 conditional declarations,
6867 it might not be exactly THEN_BLOCK, but should be the last
6868 non-container statement within. */
6870 switch (TREE_CODE (inner_if))
6875 inner_if = BIND_EXPR_BODY (inner_if);
6877 case STATEMENT_LIST:
6878 inner_if = expr_last (then_block);
6880 case TRY_FINALLY_EXPR:
6881 case TRY_CATCH_EXPR:
6882 inner_if = TREE_OPERAND (inner_if, 0);
6889 if (COND_EXPR_ELSE (inner_if))
6890 warning (0, "%Hsuggest explicit braces to avoid ambiguous %<else%>",
6894 /* Diagnose ";" via the special empty statement node that we create. */
6897 if (TREE_CODE (then_block) == NOP_EXPR && !TREE_TYPE (then_block))
6900 warning (0, "%Hempty body in an if-statement",
6901 EXPR_LOCUS (then_block));
6902 then_block = alloc_stmt_list ();
6905 && TREE_CODE (else_block) == NOP_EXPR
6906 && !TREE_TYPE (else_block))
6908 warning (0, "%Hempty body in an else-statement",
6909 EXPR_LOCUS (else_block));
6910 else_block = alloc_stmt_list ();
6914 stmt = build3 (COND_EXPR, void_type_node, cond, then_block, else_block);
6915 SET_EXPR_LOCATION (stmt, if_locus);
6919 /* Emit a general-purpose loop construct. START_LOCUS is the location of
6920 the beginning of the loop. COND is the loop condition. COND_IS_FIRST
6921 is false for DO loops. INCR is the FOR increment expression. BODY is
6922 the statement controlled by the loop. BLAB is the break label. CLAB is
6923 the continue label. Everything is allowed to be NULL. */
6926 c_finish_loop (location_t start_locus, tree cond, tree incr, tree body,
6927 tree blab, tree clab, bool cond_is_first)
6929 tree entry = NULL, exit = NULL, t;
6931 /* If the condition is zero don't generate a loop construct. */
6932 if (cond && integer_zerop (cond))
6936 t = build_and_jump (&blab);
6937 SET_EXPR_LOCATION (t, start_locus);
6943 tree top = build1 (LABEL_EXPR, void_type_node, NULL_TREE);
6945 /* If we have an exit condition, then we build an IF with gotos either
6946 out of the loop, or to the top of it. If there's no exit condition,
6947 then we just build a jump back to the top. */
6948 exit = build_and_jump (&LABEL_EXPR_LABEL (top));
6950 if (cond && !integer_nonzerop (cond))
6952 /* Canonicalize the loop condition to the end. This means
6953 generating a branch to the loop condition. Reuse the
6954 continue label, if possible. */
6959 entry = build1 (LABEL_EXPR, void_type_node, NULL_TREE);
6960 t = build_and_jump (&LABEL_EXPR_LABEL (entry));
6963 t = build1 (GOTO_EXPR, void_type_node, clab);
6964 SET_EXPR_LOCATION (t, start_locus);
6968 t = build_and_jump (&blab);
6969 exit = build3 (COND_EXPR, void_type_node, cond, exit, t);
6972 SET_EXPR_LOCATION (exit, start_locus);
6974 SET_EXPR_LOCATION (exit, input_location);
6983 add_stmt (build1 (LABEL_EXPR, void_type_node, clab));
6991 add_stmt (build1 (LABEL_EXPR, void_type_node, blab));
6995 c_finish_bc_stmt (tree *label_p, bool is_break)
6998 tree label = *label_p;
7000 /* In switch statements break is sometimes stylistically used after
7001 a return statement. This can lead to spurious warnings about
7002 control reaching the end of a non-void function when it is
7003 inlined. Note that we are calling block_may_fallthru with
7004 language specific tree nodes; this works because
7005 block_may_fallthru returns true when given something it does not
7007 skip = !block_may_fallthru (cur_stmt_list);
7012 *label_p = label = create_artificial_label ();
7014 else if (TREE_CODE (label) != LABEL_DECL)
7017 error ("break statement not within loop or switch");
7019 error ("continue statement not within a loop");
7026 return add_stmt (build1 (GOTO_EXPR, void_type_node, label));
7029 /* A helper routine for c_process_expr_stmt and c_finish_stmt_expr. */
7032 emit_side_effect_warnings (tree expr)
7034 if (expr == error_mark_node)
7036 else if (!TREE_SIDE_EFFECTS (expr))
7038 if (!VOID_TYPE_P (TREE_TYPE (expr)) && !TREE_NO_WARNING (expr))
7039 warning (0, "%Hstatement with no effect",
7040 EXPR_HAS_LOCATION (expr) ? EXPR_LOCUS (expr) : &input_location);
7042 else if (warn_unused_value)
7043 warn_if_unused_value (expr, input_location);
7046 /* Process an expression as if it were a complete statement. Emit
7047 diagnostics, but do not call ADD_STMT. */
7050 c_process_expr_stmt (tree expr)
7055 if (warn_sequence_point)
7056 verify_sequence_points (expr);
7058 if (TREE_TYPE (expr) != error_mark_node
7059 && !COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (expr))
7060 && TREE_CODE (TREE_TYPE (expr)) != ARRAY_TYPE)
7061 error ("expression statement has incomplete type");
7063 /* If we're not processing a statement expression, warn about unused values.
7064 Warnings for statement expressions will be emitted later, once we figure
7065 out which is the result. */
7066 if (!STATEMENT_LIST_STMT_EXPR (cur_stmt_list)
7067 && (extra_warnings || warn_unused_value))
7068 emit_side_effect_warnings (expr);
7070 /* If the expression is not of a type to which we cannot assign a line
7071 number, wrap the thing in a no-op NOP_EXPR. */
7072 if (DECL_P (expr) || CONSTANT_CLASS_P (expr))
7073 expr = build1 (NOP_EXPR, TREE_TYPE (expr), expr);
7076 SET_EXPR_LOCATION (expr, input_location);
7081 /* Emit an expression as a statement. */
7084 c_finish_expr_stmt (tree expr)
7087 return add_stmt (c_process_expr_stmt (expr));
7092 /* Do the opposite and emit a statement as an expression. To begin,
7093 create a new binding level and return it. */
7096 c_begin_stmt_expr (void)
7099 struct c_label_context_se *nstack;
7100 struct c_label_list *glist;
7102 /* We must force a BLOCK for this level so that, if it is not expanded
7103 later, there is a way to turn off the entire subtree of blocks that
7104 are contained in it. */
7106 ret = c_begin_compound_stmt (true);
7109 c_switch_stack->blocked_stmt_expr++;
7110 gcc_assert (c_switch_stack->blocked_stmt_expr != 0);
7112 for (glist = label_context_stack_se->labels_used;
7114 glist = glist->next)
7116 C_DECL_UNDEFINABLE_STMT_EXPR (glist->label) = 1;
7118 nstack = XOBNEW (&parser_obstack, struct c_label_context_se);
7119 nstack->labels_def = NULL;
7120 nstack->labels_used = NULL;
7121 nstack->next = label_context_stack_se;
7122 label_context_stack_se = nstack;
7124 /* Mark the current statement list as belonging to a statement list. */
7125 STATEMENT_LIST_STMT_EXPR (ret) = 1;
7131 c_finish_stmt_expr (tree body)
7133 tree last, type, tmp, val;
7135 struct c_label_list *dlist, *glist, *glist_prev = NULL;
7137 body = c_end_compound_stmt (body, true);
7140 gcc_assert (c_switch_stack->blocked_stmt_expr != 0);
7141 c_switch_stack->blocked_stmt_expr--;
7143 /* It is no longer possible to jump to labels defined within this
7144 statement expression. */
7145 for (dlist = label_context_stack_se->labels_def;
7147 dlist = dlist->next)
7149 C_DECL_UNJUMPABLE_STMT_EXPR (dlist->label) = 1;
7151 /* It is again possible to define labels with a goto just outside
7152 this statement expression. */
7153 for (glist = label_context_stack_se->next->labels_used;
7155 glist = glist->next)
7157 C_DECL_UNDEFINABLE_STMT_EXPR (glist->label) = 0;
7160 if (glist_prev != NULL)
7161 glist_prev->next = label_context_stack_se->labels_used;
7163 label_context_stack_se->next->labels_used
7164 = label_context_stack_se->labels_used;
7165 label_context_stack_se = label_context_stack_se->next;
7167 /* Locate the last statement in BODY. See c_end_compound_stmt
7168 about always returning a BIND_EXPR. */
7169 last_p = &BIND_EXPR_BODY (body);
7170 last = BIND_EXPR_BODY (body);
7173 if (TREE_CODE (last) == STATEMENT_LIST)
7175 tree_stmt_iterator i;
7177 /* This can happen with degenerate cases like ({ }). No value. */
7178 if (!TREE_SIDE_EFFECTS (last))
7181 /* If we're supposed to generate side effects warnings, process
7182 all of the statements except the last. */
7183 if (extra_warnings || warn_unused_value)
7185 for (i = tsi_start (last); !tsi_one_before_end_p (i); tsi_next (&i))
7186 emit_side_effect_warnings (tsi_stmt (i));
7189 i = tsi_last (last);
7190 last_p = tsi_stmt_ptr (i);
7194 /* If the end of the list is exception related, then the list was split
7195 by a call to push_cleanup. Continue searching. */
7196 if (TREE_CODE (last) == TRY_FINALLY_EXPR
7197 || TREE_CODE (last) == TRY_CATCH_EXPR)
7199 last_p = &TREE_OPERAND (last, 0);
7201 goto continue_searching;
7204 /* In the case that the BIND_EXPR is not necessary, return the
7205 expression out from inside it. */
7206 if (last == error_mark_node
7207 || (last == BIND_EXPR_BODY (body)
7208 && BIND_EXPR_VARS (body) == NULL))
7211 /* Extract the type of said expression. */
7212 type = TREE_TYPE (last);
7214 /* If we're not returning a value at all, then the BIND_EXPR that
7215 we already have is a fine expression to return. */
7216 if (!type || VOID_TYPE_P (type))
7219 /* Now that we've located the expression containing the value, it seems
7220 silly to make voidify_wrapper_expr repeat the process. Create a
7221 temporary of the appropriate type and stick it in a TARGET_EXPR. */
7222 tmp = create_tmp_var_raw (type, NULL);
7224 /* Unwrap a no-op NOP_EXPR as added by c_finish_expr_stmt. This avoids
7225 tree_expr_nonnegative_p giving up immediately. */
7227 if (TREE_CODE (val) == NOP_EXPR
7228 && TREE_TYPE (val) == TREE_TYPE (TREE_OPERAND (val, 0)))
7229 val = TREE_OPERAND (val, 0);
7231 *last_p = build2 (MODIFY_EXPR, void_type_node, tmp, val);
7232 SET_EXPR_LOCUS (*last_p, EXPR_LOCUS (last));
7234 return build4 (TARGET_EXPR, type, tmp, body, NULL_TREE, NULL_TREE);
7237 /* Begin the scope of an identifier of variably modified type, scope
7238 number SCOPE. Jumping from outside this scope to inside it is not
7242 c_begin_vm_scope (unsigned int scope)
7244 struct c_label_context_vm *nstack;
7245 struct c_label_list *glist;
7247 gcc_assert (scope > 0);
7248 if (c_switch_stack && !c_switch_stack->blocked_vm)
7249 c_switch_stack->blocked_vm = scope;
7250 for (glist = label_context_stack_vm->labels_used;
7252 glist = glist->next)
7254 C_DECL_UNDEFINABLE_VM (glist->label) = 1;
7256 nstack = XOBNEW (&parser_obstack, struct c_label_context_vm);
7257 nstack->labels_def = NULL;
7258 nstack->labels_used = NULL;
7259 nstack->scope = scope;
7260 nstack->next = label_context_stack_vm;
7261 label_context_stack_vm = nstack;
7264 /* End a scope which may contain identifiers of variably modified
7265 type, scope number SCOPE. */
7268 c_end_vm_scope (unsigned int scope)
7270 if (label_context_stack_vm == NULL)
7272 if (c_switch_stack && c_switch_stack->blocked_vm == scope)
7273 c_switch_stack->blocked_vm = 0;
7274 /* We may have a number of nested scopes of identifiers with
7275 variably modified type, all at this depth. Pop each in turn. */
7276 while (label_context_stack_vm->scope == scope)
7278 struct c_label_list *dlist, *glist, *glist_prev = NULL;
7280 /* It is no longer possible to jump to labels defined within this
7282 for (dlist = label_context_stack_vm->labels_def;
7284 dlist = dlist->next)
7286 C_DECL_UNJUMPABLE_VM (dlist->label) = 1;
7288 /* It is again possible to define labels with a goto just outside
7290 for (glist = label_context_stack_vm->next->labels_used;
7292 glist = glist->next)
7294 C_DECL_UNDEFINABLE_VM (glist->label) = 0;
7297 if (glist_prev != NULL)
7298 glist_prev->next = label_context_stack_vm->labels_used;
7300 label_context_stack_vm->next->labels_used
7301 = label_context_stack_vm->labels_used;
7302 label_context_stack_vm = label_context_stack_vm->next;
7306 /* Begin and end compound statements. This is as simple as pushing
7307 and popping new statement lists from the tree. */
7310 c_begin_compound_stmt (bool do_scope)
7312 tree stmt = push_stmt_list ();
7319 c_end_compound_stmt (tree stmt, bool do_scope)
7325 if (c_dialect_objc ())
7326 objc_clear_super_receiver ();
7327 block = pop_scope ();
7330 stmt = pop_stmt_list (stmt);
7331 stmt = c_build_bind_expr (block, stmt);
7333 /* If this compound statement is nested immediately inside a statement
7334 expression, then force a BIND_EXPR to be created. Otherwise we'll
7335 do the wrong thing for ({ { 1; } }) or ({ 1; { } }). In particular,
7336 STATEMENT_LISTs merge, and thus we can lose track of what statement
7339 && STATEMENT_LIST_STMT_EXPR (cur_stmt_list)
7340 && TREE_CODE (stmt) != BIND_EXPR)
7342 stmt = build3 (BIND_EXPR, void_type_node, NULL, stmt, NULL);
7343 TREE_SIDE_EFFECTS (stmt) = 1;
7349 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
7350 when the current scope is exited. EH_ONLY is true when this is not
7351 meant to apply to normal control flow transfer. */
7354 push_cleanup (tree ARG_UNUSED (decl), tree cleanup, bool eh_only)
7356 enum tree_code code;
7360 code = eh_only ? TRY_CATCH_EXPR : TRY_FINALLY_EXPR;
7361 stmt = build_stmt (code, NULL, cleanup);
7363 stmt_expr = STATEMENT_LIST_STMT_EXPR (cur_stmt_list);
7364 list = push_stmt_list ();
7365 TREE_OPERAND (stmt, 0) = list;
7366 STATEMENT_LIST_STMT_EXPR (list) = stmt_expr;
7369 /* Build a binary-operation expression without default conversions.
7370 CODE is the kind of expression to build.
7371 This function differs from `build' in several ways:
7372 the data type of the result is computed and recorded in it,
7373 warnings are generated if arg data types are invalid,
7374 special handling for addition and subtraction of pointers is known,
7375 and some optimization is done (operations on narrow ints
7376 are done in the narrower type when that gives the same result).
7377 Constant folding is also done before the result is returned.
7379 Note that the operands will never have enumeral types, or function
7380 or array types, because either they will have the default conversions
7381 performed or they have both just been converted to some other type in which
7382 the arithmetic is to be done. */
7385 build_binary_op (enum tree_code code, tree orig_op0, tree orig_op1,
7389 enum tree_code code0, code1;
7392 /* Expression code to give to the expression when it is built.
7393 Normally this is CODE, which is what the caller asked for,
7394 but in some special cases we change it. */
7395 enum tree_code resultcode = code;
7397 /* Data type in which the computation is to be performed.
7398 In the simplest cases this is the common type of the arguments. */
7399 tree result_type = NULL;
7401 /* Nonzero means operands have already been type-converted
7402 in whatever way is necessary.
7403 Zero means they need to be converted to RESULT_TYPE. */
7406 /* Nonzero means create the expression with this type, rather than
7408 tree build_type = 0;
7410 /* Nonzero means after finally constructing the expression
7411 convert it to this type. */
7412 tree final_type = 0;
7414 /* Nonzero if this is an operation like MIN or MAX which can
7415 safely be computed in short if both args are promoted shorts.
7416 Also implies COMMON.
7417 -1 indicates a bitwise operation; this makes a difference
7418 in the exact conditions for when it is safe to do the operation
7419 in a narrower mode. */
7422 /* Nonzero if this is a comparison operation;
7423 if both args are promoted shorts, compare the original shorts.
7424 Also implies COMMON. */
7425 int short_compare = 0;
7427 /* Nonzero if this is a right-shift operation, which can be computed on the
7428 original short and then promoted if the operand is a promoted short. */
7429 int short_shift = 0;
7431 /* Nonzero means set RESULT_TYPE to the common type of the args. */
7434 /* True means types are compatible as far as ObjC is concerned. */
7439 op0 = default_conversion (orig_op0);
7440 op1 = default_conversion (orig_op1);
7448 type0 = TREE_TYPE (op0);
7449 type1 = TREE_TYPE (op1);
7451 /* The expression codes of the data types of the arguments tell us
7452 whether the arguments are integers, floating, pointers, etc. */
7453 code0 = TREE_CODE (type0);
7454 code1 = TREE_CODE (type1);
7456 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
7457 STRIP_TYPE_NOPS (op0);
7458 STRIP_TYPE_NOPS (op1);
7460 /* If an error was already reported for one of the arguments,
7461 avoid reporting another error. */
7463 if (code0 == ERROR_MARK || code1 == ERROR_MARK)
7464 return error_mark_node;
7466 objc_ok = objc_compare_types (type0, type1, -3, NULL_TREE);
7471 /* Handle the pointer + int case. */
7472 if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
7473 return pointer_int_sum (PLUS_EXPR, op0, op1);
7474 else if (code1 == POINTER_TYPE && code0 == INTEGER_TYPE)
7475 return pointer_int_sum (PLUS_EXPR, op1, op0);
7481 /* Subtraction of two similar pointers.
7482 We must subtract them as integers, then divide by object size. */
7483 if (code0 == POINTER_TYPE && code1 == POINTER_TYPE
7484 && comp_target_types (type0, type1))
7485 return pointer_diff (op0, op1);
7486 /* Handle pointer minus int. Just like pointer plus int. */
7487 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
7488 return pointer_int_sum (MINUS_EXPR, op0, op1);
7497 case TRUNC_DIV_EXPR:
7499 case FLOOR_DIV_EXPR:
7500 case ROUND_DIV_EXPR:
7501 case EXACT_DIV_EXPR:
7502 /* Floating point division by zero is a legitimate way to obtain
7503 infinities and NaNs. */
7504 if (skip_evaluation == 0 && integer_zerop (op1))
7505 warning (OPT_Wdiv_by_zero, "division by zero");
7507 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
7508 || code0 == COMPLEX_TYPE || code0 == VECTOR_TYPE)
7509 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
7510 || code1 == COMPLEX_TYPE || code1 == VECTOR_TYPE))
7512 enum tree_code tcode0 = code0, tcode1 = code1;
7514 if (code0 == COMPLEX_TYPE || code0 == VECTOR_TYPE)
7515 tcode0 = TREE_CODE (TREE_TYPE (TREE_TYPE (op0)));
7516 if (code1 == COMPLEX_TYPE || code1 == VECTOR_TYPE)
7517 tcode1 = TREE_CODE (TREE_TYPE (TREE_TYPE (op1)));
7519 if (!(tcode0 == INTEGER_TYPE && tcode1 == INTEGER_TYPE))
7520 resultcode = RDIV_EXPR;
7522 /* Although it would be tempting to shorten always here, that
7523 loses on some targets, since the modulo instruction is
7524 undefined if the quotient can't be represented in the
7525 computation mode. We shorten only if unsigned or if
7526 dividing by something we know != -1. */
7527 shorten = (TYPE_UNSIGNED (TREE_TYPE (orig_op0))
7528 || (TREE_CODE (op1) == INTEGER_CST
7529 && !integer_all_onesp (op1)));
7537 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
7539 else if (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE)
7543 case TRUNC_MOD_EXPR:
7544 case FLOOR_MOD_EXPR:
7545 if (skip_evaluation == 0 && integer_zerop (op1))
7546 warning (OPT_Wdiv_by_zero, "division by zero");
7548 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
7550 /* Although it would be tempting to shorten always here, that loses
7551 on some targets, since the modulo instruction is undefined if the
7552 quotient can't be represented in the computation mode. We shorten
7553 only if unsigned or if dividing by something we know != -1. */
7554 shorten = (TYPE_UNSIGNED (TREE_TYPE (orig_op0))
7555 || (TREE_CODE (op1) == INTEGER_CST
7556 && !integer_all_onesp (op1)));
7561 case TRUTH_ANDIF_EXPR:
7562 case TRUTH_ORIF_EXPR:
7563 case TRUTH_AND_EXPR:
7565 case TRUTH_XOR_EXPR:
7566 if ((code0 == INTEGER_TYPE || code0 == POINTER_TYPE
7567 || code0 == REAL_TYPE || code0 == COMPLEX_TYPE)
7568 && (code1 == INTEGER_TYPE || code1 == POINTER_TYPE
7569 || code1 == REAL_TYPE || code1 == COMPLEX_TYPE))
7571 /* Result of these operations is always an int,
7572 but that does not mean the operands should be
7573 converted to ints! */
7574 result_type = integer_type_node;
7575 op0 = c_common_truthvalue_conversion (op0);
7576 op1 = c_common_truthvalue_conversion (op1);
7581 /* Shift operations: result has same type as first operand;
7582 always convert second operand to int.
7583 Also set SHORT_SHIFT if shifting rightward. */
7586 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
7588 if (TREE_CODE (op1) == INTEGER_CST && skip_evaluation == 0)
7590 if (tree_int_cst_sgn (op1) < 0)
7591 warning (0, "right shift count is negative");
7594 if (!integer_zerop (op1))
7597 if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
7598 warning (0, "right shift count >= width of type");
7602 /* Use the type of the value to be shifted. */
7603 result_type = type0;
7604 /* Convert the shift-count to an integer, regardless of size
7605 of value being shifted. */
7606 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
7607 op1 = convert (integer_type_node, op1);
7608 /* Avoid converting op1 to result_type later. */
7614 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
7616 if (TREE_CODE (op1) == INTEGER_CST && skip_evaluation == 0)
7618 if (tree_int_cst_sgn (op1) < 0)
7619 warning (0, "left shift count is negative");
7621 else if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
7622 warning (0, "left shift count >= width of type");
7625 /* Use the type of the value to be shifted. */
7626 result_type = type0;
7627 /* Convert the shift-count to an integer, regardless of size
7628 of value being shifted. */
7629 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
7630 op1 = convert (integer_type_node, op1);
7631 /* Avoid converting op1 to result_type later. */
7638 if (code0 == REAL_TYPE || code1 == REAL_TYPE)
7639 warning (OPT_Wfloat_equal,
7640 "comparing floating point with == or != is unsafe");
7641 /* Result of comparison is always int,
7642 but don't convert the args to int! */
7643 build_type = integer_type_node;
7644 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
7645 || code0 == COMPLEX_TYPE)
7646 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
7647 || code1 == COMPLEX_TYPE))
7649 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
7651 tree tt0 = TREE_TYPE (type0);
7652 tree tt1 = TREE_TYPE (type1);
7653 /* Anything compares with void *. void * compares with anything.
7654 Otherwise, the targets must be compatible
7655 and both must be object or both incomplete. */
7656 if (comp_target_types (type0, type1))
7657 result_type = common_pointer_type (type0, type1);
7658 else if (VOID_TYPE_P (tt0))
7660 /* op0 != orig_op0 detects the case of something
7661 whose value is 0 but which isn't a valid null ptr const. */
7662 if (pedantic && (!integer_zerop (op0) || op0 != orig_op0)
7663 && TREE_CODE (tt1) == FUNCTION_TYPE)
7664 pedwarn ("ISO C forbids comparison of %<void *%>"
7665 " with function pointer");
7667 else if (VOID_TYPE_P (tt1))
7669 if (pedantic && (!integer_zerop (op1) || op1 != orig_op1)
7670 && TREE_CODE (tt0) == FUNCTION_TYPE)
7671 pedwarn ("ISO C forbids comparison of %<void *%>"
7672 " with function pointer");
7675 /* Avoid warning about the volatile ObjC EH puts on decls. */
7677 pedwarn ("comparison of distinct pointer types lacks a cast");
7679 if (result_type == NULL_TREE)
7680 result_type = ptr_type_node;
7682 else if (code0 == POINTER_TYPE && TREE_CODE (op1) == INTEGER_CST
7683 && integer_zerop (op1))
7684 result_type = type0;
7685 else if (code1 == POINTER_TYPE && TREE_CODE (op0) == INTEGER_CST
7686 && integer_zerop (op0))
7687 result_type = type1;
7688 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
7690 result_type = type0;
7691 pedwarn ("comparison between pointer and integer");
7693 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
7695 result_type = type1;
7696 pedwarn ("comparison between pointer and integer");
7704 build_type = integer_type_node;
7705 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE)
7706 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE))
7708 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
7710 if (comp_target_types (type0, type1))
7712 result_type = common_pointer_type (type0, type1);
7713 if (!COMPLETE_TYPE_P (TREE_TYPE (type0))
7714 != !COMPLETE_TYPE_P (TREE_TYPE (type1)))
7715 pedwarn ("comparison of complete and incomplete pointers");
7717 && TREE_CODE (TREE_TYPE (type0)) == FUNCTION_TYPE)
7718 pedwarn ("ISO C forbids ordered comparisons of pointers to functions");
7722 result_type = ptr_type_node;
7723 pedwarn ("comparison of distinct pointer types lacks a cast");
7726 else if (code0 == POINTER_TYPE && TREE_CODE (op1) == INTEGER_CST
7727 && integer_zerop (op1))
7729 result_type = type0;
7730 if (pedantic || extra_warnings)
7731 pedwarn ("ordered comparison of pointer with integer zero");
7733 else if (code1 == POINTER_TYPE && TREE_CODE (op0) == INTEGER_CST
7734 && integer_zerop (op0))
7736 result_type = type1;
7738 pedwarn ("ordered comparison of pointer with integer zero");
7740 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
7742 result_type = type0;
7743 pedwarn ("comparison between pointer and integer");
7745 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
7747 result_type = type1;
7748 pedwarn ("comparison between pointer and integer");
7756 if (code0 == ERROR_MARK || code1 == ERROR_MARK)
7757 return error_mark_node;
7759 if (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE
7760 && (!tree_int_cst_equal (TYPE_SIZE (type0), TYPE_SIZE (type1))
7761 || !same_scalar_type_ignoring_signedness (TREE_TYPE (type0),
7762 TREE_TYPE (type1))))
7764 binary_op_error (code);
7765 return error_mark_node;
7768 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE || code0 == COMPLEX_TYPE
7769 || code0 == VECTOR_TYPE)
7771 (code1 == INTEGER_TYPE || code1 == REAL_TYPE || code1 == COMPLEX_TYPE
7772 || code1 == VECTOR_TYPE))
7774 int none_complex = (code0 != COMPLEX_TYPE && code1 != COMPLEX_TYPE);
7776 if (shorten || common || short_compare)
7777 result_type = c_common_type (type0, type1);
7779 /* For certain operations (which identify themselves by shorten != 0)
7780 if both args were extended from the same smaller type,
7781 do the arithmetic in that type and then extend.
7783 shorten !=0 and !=1 indicates a bitwise operation.
7784 For them, this optimization is safe only if
7785 both args are zero-extended or both are sign-extended.
7786 Otherwise, we might change the result.
7787 Eg, (short)-1 | (unsigned short)-1 is (int)-1
7788 but calculated in (unsigned short) it would be (unsigned short)-1. */
7790 if (shorten && none_complex)
7792 int unsigned0, unsigned1;
7793 tree arg0 = get_narrower (op0, &unsigned0);
7794 tree arg1 = get_narrower (op1, &unsigned1);
7795 /* UNS is 1 if the operation to be done is an unsigned one. */
7796 int uns = TYPE_UNSIGNED (result_type);
7799 final_type = result_type;
7801 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
7802 but it *requires* conversion to FINAL_TYPE. */
7804 if ((TYPE_PRECISION (TREE_TYPE (op0))
7805 == TYPE_PRECISION (TREE_TYPE (arg0)))
7806 && TREE_TYPE (op0) != final_type)
7807 unsigned0 = TYPE_UNSIGNED (TREE_TYPE (op0));
7808 if ((TYPE_PRECISION (TREE_TYPE (op1))
7809 == TYPE_PRECISION (TREE_TYPE (arg1)))
7810 && TREE_TYPE (op1) != final_type)
7811 unsigned1 = TYPE_UNSIGNED (TREE_TYPE (op1));
7813 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
7815 /* For bitwise operations, signedness of nominal type
7816 does not matter. Consider only how operands were extended. */
7820 /* Note that in all three cases below we refrain from optimizing
7821 an unsigned operation on sign-extended args.
7822 That would not be valid. */
7824 /* Both args variable: if both extended in same way
7825 from same width, do it in that width.
7826 Do it unsigned if args were zero-extended. */
7827 if ((TYPE_PRECISION (TREE_TYPE (arg0))
7828 < TYPE_PRECISION (result_type))
7829 && (TYPE_PRECISION (TREE_TYPE (arg1))
7830 == TYPE_PRECISION (TREE_TYPE (arg0)))
7831 && unsigned0 == unsigned1
7832 && (unsigned0 || !uns))
7834 = c_common_signed_or_unsigned_type
7835 (unsigned0, c_common_type (TREE_TYPE (arg0), TREE_TYPE (arg1)));
7836 else if (TREE_CODE (arg0) == INTEGER_CST
7837 && (unsigned1 || !uns)
7838 && (TYPE_PRECISION (TREE_TYPE (arg1))
7839 < TYPE_PRECISION (result_type))
7841 = c_common_signed_or_unsigned_type (unsigned1,
7843 int_fits_type_p (arg0, type)))
7845 else if (TREE_CODE (arg1) == INTEGER_CST
7846 && (unsigned0 || !uns)
7847 && (TYPE_PRECISION (TREE_TYPE (arg0))
7848 < TYPE_PRECISION (result_type))
7850 = c_common_signed_or_unsigned_type (unsigned0,
7852 int_fits_type_p (arg1, type)))
7856 /* Shifts can be shortened if shifting right. */
7861 tree arg0 = get_narrower (op0, &unsigned_arg);
7863 final_type = result_type;
7865 if (arg0 == op0 && final_type == TREE_TYPE (op0))
7866 unsigned_arg = TYPE_UNSIGNED (TREE_TYPE (op0));
7868 if (TYPE_PRECISION (TREE_TYPE (arg0)) < TYPE_PRECISION (result_type)
7869 /* We can shorten only if the shift count is less than the
7870 number of bits in the smaller type size. */
7871 && compare_tree_int (op1, TYPE_PRECISION (TREE_TYPE (arg0))) < 0
7872 /* We cannot drop an unsigned shift after sign-extension. */
7873 && (!TYPE_UNSIGNED (final_type) || unsigned_arg))
7875 /* Do an unsigned shift if the operand was zero-extended. */
7877 = c_common_signed_or_unsigned_type (unsigned_arg,
7879 /* Convert value-to-be-shifted to that type. */
7880 if (TREE_TYPE (op0) != result_type)
7881 op0 = convert (result_type, op0);
7886 /* Comparison operations are shortened too but differently.
7887 They identify themselves by setting short_compare = 1. */
7891 /* Don't write &op0, etc., because that would prevent op0
7892 from being kept in a register.
7893 Instead, make copies of the our local variables and
7894 pass the copies by reference, then copy them back afterward. */
7895 tree xop0 = op0, xop1 = op1, xresult_type = result_type;
7896 enum tree_code xresultcode = resultcode;
7898 = shorten_compare (&xop0, &xop1, &xresult_type, &xresultcode);
7903 op0 = xop0, op1 = xop1;
7905 resultcode = xresultcode;
7907 if (warn_sign_compare && skip_evaluation == 0)
7909 int op0_signed = !TYPE_UNSIGNED (TREE_TYPE (orig_op0));
7910 int op1_signed = !TYPE_UNSIGNED (TREE_TYPE (orig_op1));
7911 int unsignedp0, unsignedp1;
7912 tree primop0 = get_narrower (op0, &unsignedp0);
7913 tree primop1 = get_narrower (op1, &unsignedp1);
7917 STRIP_TYPE_NOPS (xop0);
7918 STRIP_TYPE_NOPS (xop1);
7920 /* Give warnings for comparisons between signed and unsigned
7921 quantities that may fail.
7923 Do the checking based on the original operand trees, so that
7924 casts will be considered, but default promotions won't be.
7926 Do not warn if the comparison is being done in a signed type,
7927 since the signed type will only be chosen if it can represent
7928 all the values of the unsigned type. */
7929 if (!TYPE_UNSIGNED (result_type))
7931 /* Do not warn if both operands are the same signedness. */
7932 else if (op0_signed == op1_signed)
7939 sop = xop0, uop = xop1;
7941 sop = xop1, uop = xop0;
7943 /* Do not warn if the signed quantity is an
7944 unsuffixed integer literal (or some static
7945 constant expression involving such literals or a
7946 conditional expression involving such literals)
7947 and it is non-negative. */
7948 if (tree_expr_nonnegative_p (sop))
7950 /* Do not warn if the comparison is an equality operation,
7951 the unsigned quantity is an integral constant, and it
7952 would fit in the result if the result were signed. */
7953 else if (TREE_CODE (uop) == INTEGER_CST
7954 && (resultcode == EQ_EXPR || resultcode == NE_EXPR)
7956 (uop, c_common_signed_type (result_type)))
7958 /* Do not warn if the unsigned quantity is an enumeration
7959 constant and its maximum value would fit in the result
7960 if the result were signed. */
7961 else if (TREE_CODE (uop) == INTEGER_CST
7962 && TREE_CODE (TREE_TYPE (uop)) == ENUMERAL_TYPE
7964 (TYPE_MAX_VALUE (TREE_TYPE (uop)),
7965 c_common_signed_type (result_type)))
7968 warning (0, "comparison between signed and unsigned");
7971 /* Warn if two unsigned values are being compared in a size
7972 larger than their original size, and one (and only one) is the
7973 result of a `~' operator. This comparison will always fail.
7975 Also warn if one operand is a constant, and the constant
7976 does not have all bits set that are set in the ~ operand
7977 when it is extended. */
7979 if ((TREE_CODE (primop0) == BIT_NOT_EXPR)
7980 != (TREE_CODE (primop1) == BIT_NOT_EXPR))
7982 if (TREE_CODE (primop0) == BIT_NOT_EXPR)
7983 primop0 = get_narrower (TREE_OPERAND (primop0, 0),
7986 primop1 = get_narrower (TREE_OPERAND (primop1, 0),
7989 if (host_integerp (primop0, 0) || host_integerp (primop1, 0))
7992 HOST_WIDE_INT constant, mask;
7993 int unsignedp, bits;
7995 if (host_integerp (primop0, 0))
7998 unsignedp = unsignedp1;
7999 constant = tree_low_cst (primop0, 0);
8004 unsignedp = unsignedp0;
8005 constant = tree_low_cst (primop1, 0);
8008 bits = TYPE_PRECISION (TREE_TYPE (primop));
8009 if (bits < TYPE_PRECISION (result_type)
8010 && bits < HOST_BITS_PER_WIDE_INT && unsignedp)
8012 mask = (~(HOST_WIDE_INT) 0) << bits;
8013 if ((mask & constant) != mask)
8014 warning (0, "comparison of promoted ~unsigned with constant");
8017 else if (unsignedp0 && unsignedp1
8018 && (TYPE_PRECISION (TREE_TYPE (primop0))
8019 < TYPE_PRECISION (result_type))
8020 && (TYPE_PRECISION (TREE_TYPE (primop1))
8021 < TYPE_PRECISION (result_type)))
8022 warning (0, "comparison of promoted ~unsigned with unsigned");
8028 /* At this point, RESULT_TYPE must be nonzero to avoid an error message.
8029 If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
8030 Then the expression will be built.
8031 It will be given type FINAL_TYPE if that is nonzero;
8032 otherwise, it will be given type RESULT_TYPE. */
8036 binary_op_error (code);
8037 return error_mark_node;
8042 if (TREE_TYPE (op0) != result_type)
8043 op0 = convert (result_type, op0);
8044 if (TREE_TYPE (op1) != result_type)
8045 op1 = convert (result_type, op1);
8047 /* This can happen if one operand has a vector type, and the other
8048 has a different type. */
8049 if (TREE_CODE (op0) == ERROR_MARK || TREE_CODE (op1) == ERROR_MARK)
8050 return error_mark_node;
8053 if (build_type == NULL_TREE)
8054 build_type = result_type;
8057 tree result = build2 (resultcode, build_type, op0, op1);
8059 /* Treat expressions in initializers specially as they can't trap. */
8060 result = require_constant_value ? fold_initializer (result)
8063 if (final_type != 0)
8064 result = convert (final_type, result);
8070 /* Convert EXPR to be a truth-value, validating its type for this
8074 c_objc_common_truthvalue_conversion (tree expr)
8076 switch (TREE_CODE (TREE_TYPE (expr)))
8079 error ("used array that cannot be converted to pointer where scalar is required");
8080 return error_mark_node;
8083 error ("used struct type value where scalar is required");
8084 return error_mark_node;
8087 error ("used union type value where scalar is required");
8088 return error_mark_node;
8097 /* ??? Should we also give an error for void and vectors rather than
8098 leaving those to give errors later? */
8099 return c_common_truthvalue_conversion (expr);