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, 2006, 2007, 2008, 2009
4 Free Software Foundation, Inc.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 3, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
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"
46 #include "tree-flow.h"
48 /* Possible cases of implicit bad conversions. Used to select
49 diagnostic messages in convert_for_assignment. */
57 /* The level of nesting inside "__alignof__". */
60 /* The level of nesting inside "sizeof". */
63 /* The level of nesting inside "typeof". */
66 struct c_label_context_se *label_context_stack_se;
67 struct c_label_context_vm *label_context_stack_vm;
69 /* Nonzero if we've already printed a "missing braces around initializer"
70 message within this initializer. */
71 static int missing_braces_mentioned;
73 static int require_constant_value;
74 static int require_constant_elements;
76 static bool null_pointer_constant_p (const_tree);
77 static tree qualify_type (tree, tree);
78 static int tagged_types_tu_compatible_p (const_tree, const_tree);
79 static int comp_target_types (tree, tree);
80 static int function_types_compatible_p (const_tree, const_tree);
81 static int type_lists_compatible_p (const_tree, const_tree);
82 static tree decl_constant_value_for_broken_optimization (tree);
83 static tree lookup_field (tree, tree);
84 static int convert_arguments (int, tree *, 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 int spelling_length (void);
92 static char *print_spelling (char *);
93 static void warning_init (int, const char *);
94 static tree digest_init (tree, tree, bool, int);
95 static void output_init_element (tree, bool, tree, tree, int, bool);
96 static void output_pending_init_elements (int);
97 static int set_designator (int);
98 static void push_range_stack (tree);
99 static void add_pending_init (tree, tree, bool);
100 static void set_nonincremental_init (void);
101 static void set_nonincremental_init_from_string (tree);
102 static tree find_init_member (tree);
103 static void readonly_error (tree, enum lvalue_use);
104 static int lvalue_or_else (const_tree, enum lvalue_use);
105 static int lvalue_p (const_tree);
106 static void record_maybe_used_decl (tree);
107 static int comptypes_internal (const_tree, const_tree);
109 /* Return true if EXP is a null pointer constant, false otherwise. */
112 null_pointer_constant_p (const_tree expr)
114 /* This should really operate on c_expr structures, but they aren't
115 yet available everywhere required. */
116 tree type = TREE_TYPE (expr);
117 return (TREE_CODE (expr) == INTEGER_CST
118 && !TREE_OVERFLOW (expr)
119 && integer_zerop (expr)
120 && (INTEGRAL_TYPE_P (type)
121 || (TREE_CODE (type) == POINTER_TYPE
122 && VOID_TYPE_P (TREE_TYPE (type))
123 && TYPE_QUALS (TREE_TYPE (type)) == TYPE_UNQUALIFIED)));
125 \f/* This is a cache to hold if two types are compatible or not. */
127 struct tagged_tu_seen_cache {
128 const struct tagged_tu_seen_cache * next;
131 /* The return value of tagged_types_tu_compatible_p if we had seen
132 these two types already. */
136 static const struct tagged_tu_seen_cache * tagged_tu_seen_base;
137 static void free_all_tagged_tu_seen_up_to (const struct tagged_tu_seen_cache *);
139 /* Do `exp = require_complete_type (exp);' to make sure exp
140 does not have an incomplete type. (That includes void types.) */
143 require_complete_type (tree value)
145 tree type = TREE_TYPE (value);
147 if (value == error_mark_node || type == error_mark_node)
148 return error_mark_node;
150 /* First, detect a valid value with a complete type. */
151 if (COMPLETE_TYPE_P (type))
154 c_incomplete_type_error (value, type);
155 return error_mark_node;
158 /* Print an error message for invalid use of an incomplete type.
159 VALUE is the expression that was used (or 0 if that isn't known)
160 and TYPE is the type that was invalid. */
163 c_incomplete_type_error (const_tree value, const_tree type)
165 const char *type_code_string;
167 /* Avoid duplicate error message. */
168 if (TREE_CODE (type) == ERROR_MARK)
171 if (value != 0 && (TREE_CODE (value) == VAR_DECL
172 || TREE_CODE (value) == PARM_DECL))
173 error ("%qD has an incomplete type", value);
177 /* We must print an error message. Be clever about what it says. */
179 switch (TREE_CODE (type))
182 type_code_string = "struct";
186 type_code_string = "union";
190 type_code_string = "enum";
194 error ("invalid use of void expression");
198 if (TYPE_DOMAIN (type))
200 if (TYPE_MAX_VALUE (TYPE_DOMAIN (type)) == NULL)
202 error ("invalid use of flexible array member");
205 type = TREE_TYPE (type);
208 error ("invalid use of array with unspecified bounds");
215 if (TREE_CODE (TYPE_NAME (type)) == IDENTIFIER_NODE)
216 error ("invalid use of undefined type %<%s %E%>",
217 type_code_string, TYPE_NAME (type));
219 /* If this type has a typedef-name, the TYPE_NAME is a TYPE_DECL. */
220 error ("invalid use of incomplete typedef %qD", TYPE_NAME (type));
224 /* Given a type, apply default promotions wrt unnamed function
225 arguments and return the new type. */
228 c_type_promotes_to (tree type)
230 if (TYPE_MAIN_VARIANT (type) == float_type_node)
231 return double_type_node;
233 if (c_promoting_integer_type_p (type))
235 /* Preserve unsignedness if not really getting any wider. */
236 if (TYPE_UNSIGNED (type)
237 && (TYPE_PRECISION (type) == TYPE_PRECISION (integer_type_node)))
238 return unsigned_type_node;
239 return integer_type_node;
245 /* Return a variant of TYPE which has all the type qualifiers of LIKE
246 as well as those of TYPE. */
249 qualify_type (tree type, tree like)
251 return c_build_qualified_type (type,
252 TYPE_QUALS (type) | TYPE_QUALS (like));
255 /* Return true iff the given tree T is a variable length array. */
258 c_vla_type_p (const_tree t)
260 if (TREE_CODE (t) == ARRAY_TYPE
261 && C_TYPE_VARIABLE_SIZE (t))
266 /* Return the composite type of two compatible types.
268 We assume that comptypes has already been done and returned
269 nonzero; if that isn't so, this may crash. In particular, we
270 assume that qualifiers match. */
273 composite_type (tree t1, tree t2)
275 enum tree_code code1;
276 enum tree_code code2;
279 /* Save time if the two types are the same. */
281 if (t1 == t2) return t1;
283 /* If one type is nonsense, use the other. */
284 if (t1 == error_mark_node)
286 if (t2 == error_mark_node)
289 code1 = TREE_CODE (t1);
290 code2 = TREE_CODE (t2);
292 /* Merge the attributes. */
293 attributes = targetm.merge_type_attributes (t1, t2);
295 /* If one is an enumerated type and the other is the compatible
296 integer type, the composite type might be either of the two
297 (DR#013 question 3). For consistency, use the enumerated type as
298 the composite type. */
300 if (code1 == ENUMERAL_TYPE && code2 == INTEGER_TYPE)
302 if (code2 == ENUMERAL_TYPE && code1 == INTEGER_TYPE)
305 gcc_assert (code1 == code2);
310 /* For two pointers, do this recursively on the target type. */
312 tree pointed_to_1 = TREE_TYPE (t1);
313 tree pointed_to_2 = TREE_TYPE (t2);
314 tree target = composite_type (pointed_to_1, pointed_to_2);
315 t1 = build_pointer_type (target);
316 t1 = build_type_attribute_variant (t1, attributes);
317 return qualify_type (t1, t2);
322 tree elt = composite_type (TREE_TYPE (t1), TREE_TYPE (t2));
325 tree d1 = TYPE_DOMAIN (t1);
326 tree d2 = TYPE_DOMAIN (t2);
327 bool d1_variable, d2_variable;
328 bool d1_zero, d2_zero;
329 bool t1_complete, t2_complete;
331 /* We should not have any type quals on arrays at all. */
332 gcc_assert (!TYPE_QUALS (t1) && !TYPE_QUALS (t2));
334 t1_complete = COMPLETE_TYPE_P (t1);
335 t2_complete = COMPLETE_TYPE_P (t2);
337 d1_zero = d1 == 0 || !TYPE_MAX_VALUE (d1);
338 d2_zero = d2 == 0 || !TYPE_MAX_VALUE (d2);
340 d1_variable = (!d1_zero
341 && (TREE_CODE (TYPE_MIN_VALUE (d1)) != INTEGER_CST
342 || TREE_CODE (TYPE_MAX_VALUE (d1)) != INTEGER_CST));
343 d2_variable = (!d2_zero
344 && (TREE_CODE (TYPE_MIN_VALUE (d2)) != INTEGER_CST
345 || TREE_CODE (TYPE_MAX_VALUE (d2)) != INTEGER_CST));
346 d1_variable = d1_variable || (d1_zero && c_vla_type_p (t1));
347 d2_variable = d2_variable || (d2_zero && c_vla_type_p (t2));
349 /* Save space: see if the result is identical to one of the args. */
350 if (elt == TREE_TYPE (t1) && TYPE_DOMAIN (t1)
351 && (d2_variable || d2_zero || !d1_variable))
352 return build_type_attribute_variant (t1, attributes);
353 if (elt == TREE_TYPE (t2) && TYPE_DOMAIN (t2)
354 && (d1_variable || d1_zero || !d2_variable))
355 return build_type_attribute_variant (t2, attributes);
357 if (elt == TREE_TYPE (t1) && !TYPE_DOMAIN (t2) && !TYPE_DOMAIN (t1))
358 return build_type_attribute_variant (t1, attributes);
359 if (elt == TREE_TYPE (t2) && !TYPE_DOMAIN (t2) && !TYPE_DOMAIN (t1))
360 return build_type_attribute_variant (t2, attributes);
362 /* Merge the element types, and have a size if either arg has
363 one. We may have qualifiers on the element types. To set
364 up TYPE_MAIN_VARIANT correctly, we need to form the
365 composite of the unqualified types and add the qualifiers
367 quals = TYPE_QUALS (strip_array_types (elt));
368 unqual_elt = c_build_qualified_type (elt, TYPE_UNQUALIFIED);
369 t1 = build_array_type (unqual_elt,
370 TYPE_DOMAIN ((TYPE_DOMAIN (t1)
376 /* Ensure a composite type involving a zero-length array type
377 is a zero-length type not an incomplete type. */
378 if (d1_zero && d2_zero
379 && (t1_complete || t2_complete)
380 && !COMPLETE_TYPE_P (t1))
382 TYPE_SIZE (t1) = bitsize_zero_node;
383 TYPE_SIZE_UNIT (t1) = size_zero_node;
385 t1 = c_build_qualified_type (t1, quals);
386 return build_type_attribute_variant (t1, attributes);
392 if (attributes != NULL)
394 /* Try harder not to create a new aggregate type. */
395 if (attribute_list_equal (TYPE_ATTRIBUTES (t1), attributes))
397 if (attribute_list_equal (TYPE_ATTRIBUTES (t2), attributes))
400 return build_type_attribute_variant (t1, attributes);
403 /* Function types: prefer the one that specified arg types.
404 If both do, merge the arg types. Also merge the return types. */
406 tree valtype = composite_type (TREE_TYPE (t1), TREE_TYPE (t2));
407 tree p1 = TYPE_ARG_TYPES (t1);
408 tree p2 = TYPE_ARG_TYPES (t2);
413 /* Save space: see if the result is identical to one of the args. */
414 if (valtype == TREE_TYPE (t1) && !TYPE_ARG_TYPES (t2))
415 return build_type_attribute_variant (t1, attributes);
416 if (valtype == TREE_TYPE (t2) && !TYPE_ARG_TYPES (t1))
417 return build_type_attribute_variant (t2, attributes);
419 /* Simple way if one arg fails to specify argument types. */
420 if (TYPE_ARG_TYPES (t1) == 0)
422 t1 = build_function_type (valtype, TYPE_ARG_TYPES (t2));
423 t1 = build_type_attribute_variant (t1, attributes);
424 return qualify_type (t1, t2);
426 if (TYPE_ARG_TYPES (t2) == 0)
428 t1 = build_function_type (valtype, TYPE_ARG_TYPES (t1));
429 t1 = build_type_attribute_variant (t1, attributes);
430 return qualify_type (t1, t2);
433 /* If both args specify argument types, we must merge the two
434 lists, argument by argument. */
435 /* Tell global_bindings_p to return false so that variable_size
436 doesn't die on VLAs in parameter types. */
437 c_override_global_bindings_to_false = true;
439 len = list_length (p1);
442 for (i = 0; i < len; i++)
443 newargs = tree_cons (NULL_TREE, NULL_TREE, newargs);
448 p1 = TREE_CHAIN (p1), p2 = TREE_CHAIN (p2), n = TREE_CHAIN (n))
450 /* A null type means arg type is not specified.
451 Take whatever the other function type has. */
452 if (TREE_VALUE (p1) == 0)
454 TREE_VALUE (n) = TREE_VALUE (p2);
457 if (TREE_VALUE (p2) == 0)
459 TREE_VALUE (n) = TREE_VALUE (p1);
463 /* Given wait (union {union wait *u; int *i} *)
464 and wait (union wait *),
465 prefer union wait * as type of parm. */
466 if (TREE_CODE (TREE_VALUE (p1)) == UNION_TYPE
467 && TREE_VALUE (p1) != TREE_VALUE (p2))
470 tree mv2 = TREE_VALUE (p2);
471 if (mv2 && mv2 != error_mark_node
472 && TREE_CODE (mv2) != ARRAY_TYPE)
473 mv2 = TYPE_MAIN_VARIANT (mv2);
474 for (memb = TYPE_FIELDS (TREE_VALUE (p1));
475 memb; memb = TREE_CHAIN (memb))
477 tree mv3 = TREE_TYPE (memb);
478 if (mv3 && mv3 != error_mark_node
479 && TREE_CODE (mv3) != ARRAY_TYPE)
480 mv3 = TYPE_MAIN_VARIANT (mv3);
481 if (comptypes (mv3, mv2))
483 TREE_VALUE (n) = composite_type (TREE_TYPE (memb),
485 pedwarn (input_location, OPT_pedantic,
486 "function types not truly compatible in ISO C");
491 if (TREE_CODE (TREE_VALUE (p2)) == UNION_TYPE
492 && TREE_VALUE (p2) != TREE_VALUE (p1))
495 tree mv1 = TREE_VALUE (p1);
496 if (mv1 && mv1 != error_mark_node
497 && TREE_CODE (mv1) != ARRAY_TYPE)
498 mv1 = TYPE_MAIN_VARIANT (mv1);
499 for (memb = TYPE_FIELDS (TREE_VALUE (p2));
500 memb; memb = TREE_CHAIN (memb))
502 tree mv3 = TREE_TYPE (memb);
503 if (mv3 && mv3 != error_mark_node
504 && TREE_CODE (mv3) != ARRAY_TYPE)
505 mv3 = TYPE_MAIN_VARIANT (mv3);
506 if (comptypes (mv3, mv1))
508 TREE_VALUE (n) = composite_type (TREE_TYPE (memb),
510 pedwarn (input_location, OPT_pedantic,
511 "function types not truly compatible in ISO C");
516 TREE_VALUE (n) = composite_type (TREE_VALUE (p1), TREE_VALUE (p2));
520 c_override_global_bindings_to_false = false;
521 t1 = build_function_type (valtype, newargs);
522 t1 = qualify_type (t1, t2);
523 /* ... falls through ... */
527 return build_type_attribute_variant (t1, attributes);
532 /* Return the type of a conditional expression between pointers to
533 possibly differently qualified versions of compatible types.
535 We assume that comp_target_types has already been done and returned
536 nonzero; if that isn't so, this may crash. */
539 common_pointer_type (tree t1, tree t2)
542 tree pointed_to_1, mv1;
543 tree pointed_to_2, mv2;
545 unsigned target_quals;
547 /* Save time if the two types are the same. */
549 if (t1 == t2) return t1;
551 /* If one type is nonsense, use the other. */
552 if (t1 == error_mark_node)
554 if (t2 == error_mark_node)
557 gcc_assert (TREE_CODE (t1) == POINTER_TYPE
558 && TREE_CODE (t2) == POINTER_TYPE);
560 /* Merge the attributes. */
561 attributes = targetm.merge_type_attributes (t1, t2);
563 /* Find the composite type of the target types, and combine the
564 qualifiers of the two types' targets. Do not lose qualifiers on
565 array element types by taking the TYPE_MAIN_VARIANT. */
566 mv1 = pointed_to_1 = TREE_TYPE (t1);
567 mv2 = pointed_to_2 = TREE_TYPE (t2);
568 if (TREE_CODE (mv1) != ARRAY_TYPE)
569 mv1 = TYPE_MAIN_VARIANT (pointed_to_1);
570 if (TREE_CODE (mv2) != ARRAY_TYPE)
571 mv2 = TYPE_MAIN_VARIANT (pointed_to_2);
572 target = composite_type (mv1, mv2);
574 /* For function types do not merge const qualifiers, but drop them
575 if used inconsistently. The middle-end uses these to mark const
576 and noreturn functions. */
577 if (TREE_CODE (pointed_to_1) == FUNCTION_TYPE)
578 target_quals = TYPE_QUALS (pointed_to_1) & TYPE_QUALS (pointed_to_2);
580 target_quals = TYPE_QUALS (pointed_to_1) | TYPE_QUALS (pointed_to_2);
581 t1 = build_pointer_type (c_build_qualified_type (target, target_quals));
582 return build_type_attribute_variant (t1, attributes);
585 /* Return the common type for two arithmetic types under the usual
586 arithmetic conversions. The default conversions have already been
587 applied, and enumerated types converted to their compatible integer
588 types. The resulting type is unqualified and has no attributes.
590 This is the type for the result of most arithmetic operations
591 if the operands have the given two types. */
594 c_common_type (tree t1, tree t2)
596 enum tree_code code1;
597 enum tree_code code2;
599 /* If one type is nonsense, use the other. */
600 if (t1 == error_mark_node)
602 if (t2 == error_mark_node)
605 if (TYPE_QUALS (t1) != TYPE_UNQUALIFIED)
606 t1 = TYPE_MAIN_VARIANT (t1);
608 if (TYPE_QUALS (t2) != TYPE_UNQUALIFIED)
609 t2 = TYPE_MAIN_VARIANT (t2);
611 if (TYPE_ATTRIBUTES (t1) != NULL_TREE)
612 t1 = build_type_attribute_variant (t1, NULL_TREE);
614 if (TYPE_ATTRIBUTES (t2) != NULL_TREE)
615 t2 = build_type_attribute_variant (t2, NULL_TREE);
617 /* Save time if the two types are the same. */
619 if (t1 == t2) return t1;
621 code1 = TREE_CODE (t1);
622 code2 = TREE_CODE (t2);
624 gcc_assert (code1 == VECTOR_TYPE || code1 == COMPLEX_TYPE
625 || code1 == FIXED_POINT_TYPE || code1 == REAL_TYPE
626 || code1 == INTEGER_TYPE);
627 gcc_assert (code2 == VECTOR_TYPE || code2 == COMPLEX_TYPE
628 || code2 == FIXED_POINT_TYPE || code2 == REAL_TYPE
629 || code2 == INTEGER_TYPE);
631 /* When one operand is a decimal float type, the other operand cannot be
632 a generic float type or a complex type. We also disallow vector types
634 if ((DECIMAL_FLOAT_TYPE_P (t1) || DECIMAL_FLOAT_TYPE_P (t2))
635 && !(DECIMAL_FLOAT_TYPE_P (t1) && DECIMAL_FLOAT_TYPE_P (t2)))
637 if (code1 == VECTOR_TYPE || code2 == VECTOR_TYPE)
639 error ("can%'t mix operands of decimal float and vector types");
640 return error_mark_node;
642 if (code1 == COMPLEX_TYPE || code2 == COMPLEX_TYPE)
644 error ("can%'t mix operands of decimal float and complex types");
645 return error_mark_node;
647 if (code1 == REAL_TYPE && code2 == REAL_TYPE)
649 error ("can%'t mix operands of decimal float and other float types");
650 return error_mark_node;
654 /* If one type is a vector type, return that type. (How the usual
655 arithmetic conversions apply to the vector types extension is not
656 precisely specified.) */
657 if (code1 == VECTOR_TYPE)
660 if (code2 == VECTOR_TYPE)
663 /* If one type is complex, form the common type of the non-complex
664 components, then make that complex. Use T1 or T2 if it is the
666 if (code1 == COMPLEX_TYPE || code2 == COMPLEX_TYPE)
668 tree subtype1 = code1 == COMPLEX_TYPE ? TREE_TYPE (t1) : t1;
669 tree subtype2 = code2 == COMPLEX_TYPE ? TREE_TYPE (t2) : t2;
670 tree subtype = c_common_type (subtype1, subtype2);
672 if (code1 == COMPLEX_TYPE && TREE_TYPE (t1) == subtype)
674 else if (code2 == COMPLEX_TYPE && TREE_TYPE (t2) == subtype)
677 return build_complex_type (subtype);
680 /* If only one is real, use it as the result. */
682 if (code1 == REAL_TYPE && code2 != REAL_TYPE)
685 if (code2 == REAL_TYPE && code1 != REAL_TYPE)
688 /* If both are real and either are decimal floating point types, use
689 the decimal floating point type with the greater precision. */
691 if (code1 == REAL_TYPE && code2 == REAL_TYPE)
693 if (TYPE_MAIN_VARIANT (t1) == dfloat128_type_node
694 || TYPE_MAIN_VARIANT (t2) == dfloat128_type_node)
695 return dfloat128_type_node;
696 else if (TYPE_MAIN_VARIANT (t1) == dfloat64_type_node
697 || TYPE_MAIN_VARIANT (t2) == dfloat64_type_node)
698 return dfloat64_type_node;
699 else if (TYPE_MAIN_VARIANT (t1) == dfloat32_type_node
700 || TYPE_MAIN_VARIANT (t2) == dfloat32_type_node)
701 return dfloat32_type_node;
704 /* Deal with fixed-point types. */
705 if (code1 == FIXED_POINT_TYPE || code2 == FIXED_POINT_TYPE)
707 unsigned int unsignedp = 0, satp = 0;
708 enum machine_mode m1, m2;
709 unsigned int fbit1, ibit1, fbit2, ibit2, max_fbit, max_ibit;
714 /* If one input type is saturating, the result type is saturating. */
715 if (TYPE_SATURATING (t1) || TYPE_SATURATING (t2))
718 /* If both fixed-point types are unsigned, the result type is unsigned.
719 When mixing fixed-point and integer types, follow the sign of the
721 Otherwise, the result type is signed. */
722 if ((TYPE_UNSIGNED (t1) && TYPE_UNSIGNED (t2)
723 && code1 == FIXED_POINT_TYPE && code2 == FIXED_POINT_TYPE)
724 || (code1 == FIXED_POINT_TYPE && code2 != FIXED_POINT_TYPE
725 && TYPE_UNSIGNED (t1))
726 || (code1 != FIXED_POINT_TYPE && code2 == FIXED_POINT_TYPE
727 && TYPE_UNSIGNED (t2)))
730 /* The result type is signed. */
733 /* If the input type is unsigned, we need to convert to the
735 if (code1 == FIXED_POINT_TYPE && TYPE_UNSIGNED (t1))
737 enum mode_class mclass = (enum mode_class) 0;
738 if (GET_MODE_CLASS (m1) == MODE_UFRACT)
740 else if (GET_MODE_CLASS (m1) == MODE_UACCUM)
744 m1 = mode_for_size (GET_MODE_PRECISION (m1), mclass, 0);
746 if (code2 == FIXED_POINT_TYPE && TYPE_UNSIGNED (t2))
748 enum mode_class mclass = (enum mode_class) 0;
749 if (GET_MODE_CLASS (m2) == MODE_UFRACT)
751 else if (GET_MODE_CLASS (m2) == MODE_UACCUM)
755 m2 = mode_for_size (GET_MODE_PRECISION (m2), mclass, 0);
759 if (code1 == FIXED_POINT_TYPE)
761 fbit1 = GET_MODE_FBIT (m1);
762 ibit1 = GET_MODE_IBIT (m1);
767 /* Signed integers need to subtract one sign bit. */
768 ibit1 = TYPE_PRECISION (t1) - (!TYPE_UNSIGNED (t1));
771 if (code2 == FIXED_POINT_TYPE)
773 fbit2 = GET_MODE_FBIT (m2);
774 ibit2 = GET_MODE_IBIT (m2);
779 /* Signed integers need to subtract one sign bit. */
780 ibit2 = TYPE_PRECISION (t2) - (!TYPE_UNSIGNED (t2));
783 max_ibit = ibit1 >= ibit2 ? ibit1 : ibit2;
784 max_fbit = fbit1 >= fbit2 ? fbit1 : fbit2;
785 return c_common_fixed_point_type_for_size (max_ibit, max_fbit, unsignedp,
789 /* Both real or both integers; use the one with greater precision. */
791 if (TYPE_PRECISION (t1) > TYPE_PRECISION (t2))
793 else if (TYPE_PRECISION (t2) > TYPE_PRECISION (t1))
796 /* Same precision. Prefer long longs to longs to ints when the
797 same precision, following the C99 rules on integer type rank
798 (which are equivalent to the C90 rules for C90 types). */
800 if (TYPE_MAIN_VARIANT (t1) == long_long_unsigned_type_node
801 || TYPE_MAIN_VARIANT (t2) == long_long_unsigned_type_node)
802 return long_long_unsigned_type_node;
804 if (TYPE_MAIN_VARIANT (t1) == long_long_integer_type_node
805 || TYPE_MAIN_VARIANT (t2) == long_long_integer_type_node)
807 if (TYPE_UNSIGNED (t1) || TYPE_UNSIGNED (t2))
808 return long_long_unsigned_type_node;
810 return long_long_integer_type_node;
813 if (TYPE_MAIN_VARIANT (t1) == long_unsigned_type_node
814 || TYPE_MAIN_VARIANT (t2) == long_unsigned_type_node)
815 return long_unsigned_type_node;
817 if (TYPE_MAIN_VARIANT (t1) == long_integer_type_node
818 || TYPE_MAIN_VARIANT (t2) == long_integer_type_node)
820 /* But preserve unsignedness from the other type,
821 since long cannot hold all the values of an unsigned int. */
822 if (TYPE_UNSIGNED (t1) || TYPE_UNSIGNED (t2))
823 return long_unsigned_type_node;
825 return long_integer_type_node;
828 /* Likewise, prefer long double to double even if same size. */
829 if (TYPE_MAIN_VARIANT (t1) == long_double_type_node
830 || TYPE_MAIN_VARIANT (t2) == long_double_type_node)
831 return long_double_type_node;
833 /* Otherwise prefer the unsigned one. */
835 if (TYPE_UNSIGNED (t1))
841 /* Wrapper around c_common_type that is used by c-common.c and other
842 front end optimizations that remove promotions. ENUMERAL_TYPEs
843 are allowed here and are converted to their compatible integer types.
844 BOOLEAN_TYPEs are allowed here and return either boolean_type_node or
845 preferably a non-Boolean type as the common type. */
847 common_type (tree t1, tree t2)
849 if (TREE_CODE (t1) == ENUMERAL_TYPE)
850 t1 = c_common_type_for_size (TYPE_PRECISION (t1), 1);
851 if (TREE_CODE (t2) == ENUMERAL_TYPE)
852 t2 = c_common_type_for_size (TYPE_PRECISION (t2), 1);
854 /* If both types are BOOLEAN_TYPE, then return boolean_type_node. */
855 if (TREE_CODE (t1) == BOOLEAN_TYPE
856 && TREE_CODE (t2) == BOOLEAN_TYPE)
857 return boolean_type_node;
859 /* If either type is BOOLEAN_TYPE, then return the other. */
860 if (TREE_CODE (t1) == BOOLEAN_TYPE)
862 if (TREE_CODE (t2) == BOOLEAN_TYPE)
865 return c_common_type (t1, t2);
868 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
869 or various other operations. Return 2 if they are compatible
870 but a warning may be needed if you use them together. */
873 comptypes (tree type1, tree type2)
875 const struct tagged_tu_seen_cache * tagged_tu_seen_base1 = tagged_tu_seen_base;
878 val = comptypes_internal (type1, type2);
879 free_all_tagged_tu_seen_up_to (tagged_tu_seen_base1);
884 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
885 or various other operations. Return 2 if they are compatible
886 but a warning may be needed if you use them together. This
887 differs from comptypes, in that we don't free the seen types. */
890 comptypes_internal (const_tree type1, const_tree type2)
892 const_tree t1 = type1;
893 const_tree t2 = type2;
896 /* Suppress errors caused by previously reported errors. */
898 if (t1 == t2 || !t1 || !t2
899 || TREE_CODE (t1) == ERROR_MARK || TREE_CODE (t2) == ERROR_MARK)
902 /* If either type is the internal version of sizetype, return the
904 if (TREE_CODE (t1) == INTEGER_TYPE && TYPE_IS_SIZETYPE (t1)
905 && TYPE_ORIG_SIZE_TYPE (t1))
906 t1 = TYPE_ORIG_SIZE_TYPE (t1);
908 if (TREE_CODE (t2) == INTEGER_TYPE && TYPE_IS_SIZETYPE (t2)
909 && TYPE_ORIG_SIZE_TYPE (t2))
910 t2 = TYPE_ORIG_SIZE_TYPE (t2);
913 /* Enumerated types are compatible with integer types, but this is
914 not transitive: two enumerated types in the same translation unit
915 are compatible with each other only if they are the same type. */
917 if (TREE_CODE (t1) == ENUMERAL_TYPE && TREE_CODE (t2) != ENUMERAL_TYPE)
918 t1 = c_common_type_for_size (TYPE_PRECISION (t1), TYPE_UNSIGNED (t1));
919 else if (TREE_CODE (t2) == ENUMERAL_TYPE && TREE_CODE (t1) != ENUMERAL_TYPE)
920 t2 = c_common_type_for_size (TYPE_PRECISION (t2), TYPE_UNSIGNED (t2));
925 /* Different classes of types can't be compatible. */
927 if (TREE_CODE (t1) != TREE_CODE (t2))
930 /* Qualifiers must match. C99 6.7.3p9 */
932 if (TYPE_QUALS (t1) != TYPE_QUALS (t2))
935 /* Allow for two different type nodes which have essentially the same
936 definition. Note that we already checked for equality of the type
937 qualifiers (just above). */
939 if (TREE_CODE (t1) != ARRAY_TYPE
940 && TYPE_MAIN_VARIANT (t1) == TYPE_MAIN_VARIANT (t2))
943 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
944 if (!(attrval = targetm.comp_type_attributes (t1, t2)))
947 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
950 switch (TREE_CODE (t1))
953 /* Do not remove mode or aliasing information. */
954 if (TYPE_MODE (t1) != TYPE_MODE (t2)
955 || TYPE_REF_CAN_ALIAS_ALL (t1) != TYPE_REF_CAN_ALIAS_ALL (t2))
957 val = (TREE_TYPE (t1) == TREE_TYPE (t2)
958 ? 1 : comptypes_internal (TREE_TYPE (t1), TREE_TYPE (t2)));
962 val = function_types_compatible_p (t1, t2);
967 tree d1 = TYPE_DOMAIN (t1);
968 tree d2 = TYPE_DOMAIN (t2);
969 bool d1_variable, d2_variable;
970 bool d1_zero, d2_zero;
973 /* Target types must match incl. qualifiers. */
974 if (TREE_TYPE (t1) != TREE_TYPE (t2)
975 && 0 == (val = comptypes_internal (TREE_TYPE (t1), TREE_TYPE (t2))))
978 /* Sizes must match unless one is missing or variable. */
979 if (d1 == 0 || d2 == 0 || d1 == d2)
982 d1_zero = !TYPE_MAX_VALUE (d1);
983 d2_zero = !TYPE_MAX_VALUE (d2);
985 d1_variable = (!d1_zero
986 && (TREE_CODE (TYPE_MIN_VALUE (d1)) != INTEGER_CST
987 || TREE_CODE (TYPE_MAX_VALUE (d1)) != INTEGER_CST));
988 d2_variable = (!d2_zero
989 && (TREE_CODE (TYPE_MIN_VALUE (d2)) != INTEGER_CST
990 || TREE_CODE (TYPE_MAX_VALUE (d2)) != INTEGER_CST));
991 d1_variable = d1_variable || (d1_zero && c_vla_type_p (t1));
992 d2_variable = d2_variable || (d2_zero && c_vla_type_p (t2));
994 if (d1_variable || d2_variable)
996 if (d1_zero && d2_zero)
998 if (d1_zero || d2_zero
999 || !tree_int_cst_equal (TYPE_MIN_VALUE (d1), TYPE_MIN_VALUE (d2))
1000 || !tree_int_cst_equal (TYPE_MAX_VALUE (d1), TYPE_MAX_VALUE (d2)))
1009 if (val != 1 && !same_translation_unit_p (t1, t2))
1011 tree a1 = TYPE_ATTRIBUTES (t1);
1012 tree a2 = TYPE_ATTRIBUTES (t2);
1014 if (! attribute_list_contained (a1, a2)
1015 && ! attribute_list_contained (a2, a1))
1019 return tagged_types_tu_compatible_p (t1, t2);
1020 val = tagged_types_tu_compatible_p (t1, t2);
1025 val = TYPE_VECTOR_SUBPARTS (t1) == TYPE_VECTOR_SUBPARTS (t2)
1026 && comptypes_internal (TREE_TYPE (t1), TREE_TYPE (t2));
1032 return attrval == 2 && val == 1 ? 2 : val;
1035 /* Return 1 if TTL and TTR are pointers to types that are equivalent,
1036 ignoring their qualifiers. */
1039 comp_target_types (tree ttl, tree ttr)
1044 /* Do not lose qualifiers on element types of array types that are
1045 pointer targets by taking their TYPE_MAIN_VARIANT. */
1046 mvl = TREE_TYPE (ttl);
1047 mvr = TREE_TYPE (ttr);
1048 if (TREE_CODE (mvl) != ARRAY_TYPE)
1049 mvl = TYPE_MAIN_VARIANT (mvl);
1050 if (TREE_CODE (mvr) != ARRAY_TYPE)
1051 mvr = TYPE_MAIN_VARIANT (mvr);
1052 val = comptypes (mvl, mvr);
1055 pedwarn (input_location, OPT_pedantic, "types are not quite compatible");
1059 /* Subroutines of `comptypes'. */
1061 /* Determine whether two trees derive from the same translation unit.
1062 If the CONTEXT chain ends in a null, that tree's context is still
1063 being parsed, so if two trees have context chains ending in null,
1064 they're in the same translation unit. */
1066 same_translation_unit_p (const_tree t1, const_tree t2)
1068 while (t1 && TREE_CODE (t1) != TRANSLATION_UNIT_DECL)
1069 switch (TREE_CODE_CLASS (TREE_CODE (t1)))
1071 case tcc_declaration:
1072 t1 = DECL_CONTEXT (t1); break;
1074 t1 = TYPE_CONTEXT (t1); break;
1075 case tcc_exceptional:
1076 t1 = BLOCK_SUPERCONTEXT (t1); break; /* assume block */
1077 default: gcc_unreachable ();
1080 while (t2 && TREE_CODE (t2) != TRANSLATION_UNIT_DECL)
1081 switch (TREE_CODE_CLASS (TREE_CODE (t2)))
1083 case tcc_declaration:
1084 t2 = DECL_CONTEXT (t2); break;
1086 t2 = TYPE_CONTEXT (t2); break;
1087 case tcc_exceptional:
1088 t2 = BLOCK_SUPERCONTEXT (t2); break; /* assume block */
1089 default: gcc_unreachable ();
1095 /* Allocate the seen two types, assuming that they are compatible. */
1097 static struct tagged_tu_seen_cache *
1098 alloc_tagged_tu_seen_cache (const_tree t1, const_tree t2)
1100 struct tagged_tu_seen_cache *tu = XNEW (struct tagged_tu_seen_cache);
1101 tu->next = tagged_tu_seen_base;
1105 tagged_tu_seen_base = tu;
1107 /* The C standard says that two structures in different translation
1108 units are compatible with each other only if the types of their
1109 fields are compatible (among other things). We assume that they
1110 are compatible until proven otherwise when building the cache.
1111 An example where this can occur is:
1116 If we are comparing this against a similar struct in another TU,
1117 and did not assume they were compatible, we end up with an infinite
1123 /* Free the seen types until we get to TU_TIL. */
1126 free_all_tagged_tu_seen_up_to (const struct tagged_tu_seen_cache *tu_til)
1128 const struct tagged_tu_seen_cache *tu = tagged_tu_seen_base;
1129 while (tu != tu_til)
1131 const struct tagged_tu_seen_cache *const tu1
1132 = (const struct tagged_tu_seen_cache *) tu;
1134 free (CONST_CAST (struct tagged_tu_seen_cache *, tu1));
1136 tagged_tu_seen_base = tu_til;
1139 /* Return 1 if two 'struct', 'union', or 'enum' types T1 and T2 are
1140 compatible. If the two types are not the same (which has been
1141 checked earlier), this can only happen when multiple translation
1142 units are being compiled. See C99 6.2.7 paragraph 1 for the exact
1146 tagged_types_tu_compatible_p (const_tree t1, const_tree t2)
1149 bool needs_warning = false;
1151 /* We have to verify that the tags of the types are the same. This
1152 is harder than it looks because this may be a typedef, so we have
1153 to go look at the original type. It may even be a typedef of a
1155 In the case of compiler-created builtin structs the TYPE_DECL
1156 may be a dummy, with no DECL_ORIGINAL_TYPE. Don't fault. */
1157 while (TYPE_NAME (t1)
1158 && TREE_CODE (TYPE_NAME (t1)) == TYPE_DECL
1159 && DECL_ORIGINAL_TYPE (TYPE_NAME (t1)))
1160 t1 = DECL_ORIGINAL_TYPE (TYPE_NAME (t1));
1162 while (TYPE_NAME (t2)
1163 && TREE_CODE (TYPE_NAME (t2)) == TYPE_DECL
1164 && DECL_ORIGINAL_TYPE (TYPE_NAME (t2)))
1165 t2 = DECL_ORIGINAL_TYPE (TYPE_NAME (t2));
1167 /* C90 didn't have the requirement that the two tags be the same. */
1168 if (flag_isoc99 && TYPE_NAME (t1) != TYPE_NAME (t2))
1171 /* C90 didn't say what happened if one or both of the types were
1172 incomplete; we choose to follow C99 rules here, which is that they
1174 if (TYPE_SIZE (t1) == NULL
1175 || TYPE_SIZE (t2) == NULL)
1179 const struct tagged_tu_seen_cache * tts_i;
1180 for (tts_i = tagged_tu_seen_base; tts_i != NULL; tts_i = tts_i->next)
1181 if (tts_i->t1 == t1 && tts_i->t2 == t2)
1185 switch (TREE_CODE (t1))
1189 struct tagged_tu_seen_cache *tu = alloc_tagged_tu_seen_cache (t1, t2);
1190 /* Speed up the case where the type values are in the same order. */
1191 tree tv1 = TYPE_VALUES (t1);
1192 tree tv2 = TYPE_VALUES (t2);
1199 for (;tv1 && tv2; tv1 = TREE_CHAIN (tv1), tv2 = TREE_CHAIN (tv2))
1201 if (TREE_PURPOSE (tv1) != TREE_PURPOSE (tv2))
1203 if (simple_cst_equal (TREE_VALUE (tv1), TREE_VALUE (tv2)) != 1)
1210 if (tv1 == NULL_TREE && tv2 == NULL_TREE)
1214 if (tv1 == NULL_TREE || tv2 == NULL_TREE)
1220 if (list_length (TYPE_VALUES (t1)) != list_length (TYPE_VALUES (t2)))
1226 for (s1 = TYPE_VALUES (t1); s1; s1 = TREE_CHAIN (s1))
1228 s2 = purpose_member (TREE_PURPOSE (s1), TYPE_VALUES (t2));
1230 || simple_cst_equal (TREE_VALUE (s1), TREE_VALUE (s2)) != 1)
1241 struct tagged_tu_seen_cache *tu = alloc_tagged_tu_seen_cache (t1, t2);
1242 if (list_length (TYPE_FIELDS (t1)) != list_length (TYPE_FIELDS (t2)))
1248 /* Speed up the common case where the fields are in the same order. */
1249 for (s1 = TYPE_FIELDS (t1), s2 = TYPE_FIELDS (t2); s1 && s2;
1250 s1 = TREE_CHAIN (s1), s2 = TREE_CHAIN (s2))
1254 if (DECL_NAME (s1) != DECL_NAME (s2))
1256 result = comptypes_internal (TREE_TYPE (s1), TREE_TYPE (s2));
1258 if (result != 1 && !DECL_NAME (s1))
1266 needs_warning = true;
1268 if (TREE_CODE (s1) == FIELD_DECL
1269 && simple_cst_equal (DECL_FIELD_BIT_OFFSET (s1),
1270 DECL_FIELD_BIT_OFFSET (s2)) != 1)
1278 tu->val = needs_warning ? 2 : 1;
1282 for (s1 = TYPE_FIELDS (t1); s1; s1 = TREE_CHAIN (s1))
1286 for (s2 = TYPE_FIELDS (t2); s2; s2 = TREE_CHAIN (s2))
1287 if (DECL_NAME (s1) == DECL_NAME (s2))
1291 result = comptypes_internal (TREE_TYPE (s1), TREE_TYPE (s2));
1293 if (result != 1 && !DECL_NAME (s1))
1301 needs_warning = true;
1303 if (TREE_CODE (s1) == FIELD_DECL
1304 && simple_cst_equal (DECL_FIELD_BIT_OFFSET (s1),
1305 DECL_FIELD_BIT_OFFSET (s2)) != 1)
1317 tu->val = needs_warning ? 2 : 10;
1323 struct tagged_tu_seen_cache *tu = alloc_tagged_tu_seen_cache (t1, t2);
1325 for (s1 = TYPE_FIELDS (t1), s2 = TYPE_FIELDS (t2);
1327 s1 = TREE_CHAIN (s1), s2 = TREE_CHAIN (s2))
1330 if (TREE_CODE (s1) != TREE_CODE (s2)
1331 || DECL_NAME (s1) != DECL_NAME (s2))
1333 result = comptypes_internal (TREE_TYPE (s1), TREE_TYPE (s2));
1337 needs_warning = true;
1339 if (TREE_CODE (s1) == FIELD_DECL
1340 && simple_cst_equal (DECL_FIELD_BIT_OFFSET (s1),
1341 DECL_FIELD_BIT_OFFSET (s2)) != 1)
1347 tu->val = needs_warning ? 2 : 1;
1356 /* Return 1 if two function types F1 and F2 are compatible.
1357 If either type specifies no argument types,
1358 the other must specify a fixed number of self-promoting arg types.
1359 Otherwise, if one type specifies only the number of arguments,
1360 the other must specify that number of self-promoting arg types.
1361 Otherwise, the argument types must match. */
1364 function_types_compatible_p (const_tree f1, const_tree f2)
1367 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1372 ret1 = TREE_TYPE (f1);
1373 ret2 = TREE_TYPE (f2);
1375 /* 'volatile' qualifiers on a function's return type used to mean
1376 the function is noreturn. */
1377 if (TYPE_VOLATILE (ret1) != TYPE_VOLATILE (ret2))
1378 pedwarn (input_location, 0, "function return types not compatible due to %<volatile%>");
1379 if (TYPE_VOLATILE (ret1))
1380 ret1 = build_qualified_type (TYPE_MAIN_VARIANT (ret1),
1381 TYPE_QUALS (ret1) & ~TYPE_QUAL_VOLATILE);
1382 if (TYPE_VOLATILE (ret2))
1383 ret2 = build_qualified_type (TYPE_MAIN_VARIANT (ret2),
1384 TYPE_QUALS (ret2) & ~TYPE_QUAL_VOLATILE);
1385 val = comptypes_internal (ret1, ret2);
1389 args1 = TYPE_ARG_TYPES (f1);
1390 args2 = TYPE_ARG_TYPES (f2);
1392 /* An unspecified parmlist matches any specified parmlist
1393 whose argument types don't need default promotions. */
1397 if (!self_promoting_args_p (args2))
1399 /* If one of these types comes from a non-prototype fn definition,
1400 compare that with the other type's arglist.
1401 If they don't match, ask for a warning (but no error). */
1402 if (TYPE_ACTUAL_ARG_TYPES (f1)
1403 && 1 != type_lists_compatible_p (args2, TYPE_ACTUAL_ARG_TYPES (f1)))
1409 if (!self_promoting_args_p (args1))
1411 if (TYPE_ACTUAL_ARG_TYPES (f2)
1412 && 1 != type_lists_compatible_p (args1, TYPE_ACTUAL_ARG_TYPES (f2)))
1417 /* Both types have argument lists: compare them and propagate results. */
1418 val1 = type_lists_compatible_p (args1, args2);
1419 return val1 != 1 ? val1 : val;
1422 /* Check two lists of types for compatibility,
1423 returning 0 for incompatible, 1 for compatible,
1424 or 2 for compatible with warning. */
1427 type_lists_compatible_p (const_tree args1, const_tree args2)
1429 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1435 tree a1, mv1, a2, mv2;
1436 if (args1 == 0 && args2 == 0)
1438 /* If one list is shorter than the other,
1439 they fail to match. */
1440 if (args1 == 0 || args2 == 0)
1442 mv1 = a1 = TREE_VALUE (args1);
1443 mv2 = a2 = TREE_VALUE (args2);
1444 if (mv1 && mv1 != error_mark_node && TREE_CODE (mv1) != ARRAY_TYPE)
1445 mv1 = TYPE_MAIN_VARIANT (mv1);
1446 if (mv2 && mv2 != error_mark_node && TREE_CODE (mv2) != ARRAY_TYPE)
1447 mv2 = TYPE_MAIN_VARIANT (mv2);
1448 /* A null pointer instead of a type
1449 means there is supposed to be an argument
1450 but nothing is specified about what type it has.
1451 So match anything that self-promotes. */
1454 if (c_type_promotes_to (a2) != a2)
1459 if (c_type_promotes_to (a1) != a1)
1462 /* If one of the lists has an error marker, ignore this arg. */
1463 else if (TREE_CODE (a1) == ERROR_MARK
1464 || TREE_CODE (a2) == ERROR_MARK)
1466 else if (!(newval = comptypes_internal (mv1, mv2)))
1468 /* Allow wait (union {union wait *u; int *i} *)
1469 and wait (union wait *) to be compatible. */
1470 if (TREE_CODE (a1) == UNION_TYPE
1471 && (TYPE_NAME (a1) == 0
1472 || TYPE_TRANSPARENT_UNION (a1))
1473 && TREE_CODE (TYPE_SIZE (a1)) == INTEGER_CST
1474 && tree_int_cst_equal (TYPE_SIZE (a1),
1478 for (memb = TYPE_FIELDS (a1);
1479 memb; memb = TREE_CHAIN (memb))
1481 tree mv3 = TREE_TYPE (memb);
1482 if (mv3 && mv3 != error_mark_node
1483 && TREE_CODE (mv3) != ARRAY_TYPE)
1484 mv3 = TYPE_MAIN_VARIANT (mv3);
1485 if (comptypes_internal (mv3, mv2))
1491 else if (TREE_CODE (a2) == UNION_TYPE
1492 && (TYPE_NAME (a2) == 0
1493 || TYPE_TRANSPARENT_UNION (a2))
1494 && TREE_CODE (TYPE_SIZE (a2)) == INTEGER_CST
1495 && tree_int_cst_equal (TYPE_SIZE (a2),
1499 for (memb = TYPE_FIELDS (a2);
1500 memb; memb = TREE_CHAIN (memb))
1502 tree mv3 = TREE_TYPE (memb);
1503 if (mv3 && mv3 != error_mark_node
1504 && TREE_CODE (mv3) != ARRAY_TYPE)
1505 mv3 = TYPE_MAIN_VARIANT (mv3);
1506 if (comptypes_internal (mv3, mv1))
1516 /* comptypes said ok, but record if it said to warn. */
1520 args1 = TREE_CHAIN (args1);
1521 args2 = TREE_CHAIN (args2);
1525 /* Compute the size to increment a pointer by. */
1528 c_size_in_bytes (const_tree type)
1530 enum tree_code code = TREE_CODE (type);
1532 if (code == FUNCTION_TYPE || code == VOID_TYPE || code == ERROR_MARK)
1533 return size_one_node;
1535 if (!COMPLETE_OR_VOID_TYPE_P (type))
1537 error ("arithmetic on pointer to an incomplete type");
1538 return size_one_node;
1541 /* Convert in case a char is more than one unit. */
1542 return size_binop (CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type),
1543 size_int (TYPE_PRECISION (char_type_node)
1547 /* Return either DECL or its known constant value (if it has one). */
1550 decl_constant_value (tree decl)
1552 if (/* Don't change a variable array bound or initial value to a constant
1553 in a place where a variable is invalid. Note that DECL_INITIAL
1554 isn't valid for a PARM_DECL. */
1555 current_function_decl != 0
1556 && TREE_CODE (decl) != PARM_DECL
1557 && !TREE_THIS_VOLATILE (decl)
1558 && TREE_READONLY (decl)
1559 && DECL_INITIAL (decl) != 0
1560 && TREE_CODE (DECL_INITIAL (decl)) != ERROR_MARK
1561 /* This is invalid if initial value is not constant.
1562 If it has either a function call, a memory reference,
1563 or a variable, then re-evaluating it could give different results. */
1564 && TREE_CONSTANT (DECL_INITIAL (decl))
1565 /* Check for cases where this is sub-optimal, even though valid. */
1566 && TREE_CODE (DECL_INITIAL (decl)) != CONSTRUCTOR)
1567 return DECL_INITIAL (decl);
1571 /* Return either DECL or its known constant value (if it has one), but
1572 return DECL if pedantic or DECL has mode BLKmode. This is for
1573 bug-compatibility with the old behavior of decl_constant_value
1574 (before GCC 3.0); every use of this function is a bug and it should
1575 be removed before GCC 3.1. It is not appropriate to use pedantic
1576 in a way that affects optimization, and BLKmode is probably not the
1577 right test for avoiding misoptimizations either. */
1580 decl_constant_value_for_broken_optimization (tree decl)
1584 if (pedantic || DECL_MODE (decl) == BLKmode)
1587 ret = decl_constant_value (decl);
1588 /* Avoid unwanted tree sharing between the initializer and current
1589 function's body where the tree can be modified e.g. by the
1591 if (ret != decl && TREE_STATIC (decl))
1592 ret = unshare_expr (ret);
1596 /* Convert the array expression EXP to a pointer. */
1598 array_to_pointer_conversion (tree exp)
1600 tree orig_exp = exp;
1601 tree type = TREE_TYPE (exp);
1603 tree restype = TREE_TYPE (type);
1606 gcc_assert (TREE_CODE (type) == ARRAY_TYPE);
1608 STRIP_TYPE_NOPS (exp);
1610 if (TREE_NO_WARNING (orig_exp))
1611 TREE_NO_WARNING (exp) = 1;
1613 ptrtype = build_pointer_type (restype);
1615 if (TREE_CODE (exp) == INDIRECT_REF)
1616 return convert (ptrtype, TREE_OPERAND (exp, 0));
1618 if (TREE_CODE (exp) == VAR_DECL)
1620 /* We are making an ADDR_EXPR of ptrtype. This is a valid
1621 ADDR_EXPR because it's the best way of representing what
1622 happens in C when we take the address of an array and place
1623 it in a pointer to the element type. */
1624 adr = build1 (ADDR_EXPR, ptrtype, exp);
1625 if (!c_mark_addressable (exp))
1626 return error_mark_node;
1627 TREE_SIDE_EFFECTS (adr) = 0; /* Default would be, same as EXP. */
1631 /* This way is better for a COMPONENT_REF since it can
1632 simplify the offset for a component. */
1633 adr = build_unary_op (EXPR_LOCATION (exp), ADDR_EXPR, exp, 1);
1634 return convert (ptrtype, adr);
1637 /* Convert the function expression EXP to a pointer. */
1639 function_to_pointer_conversion (tree exp)
1641 tree orig_exp = exp;
1643 gcc_assert (TREE_CODE (TREE_TYPE (exp)) == FUNCTION_TYPE);
1645 STRIP_TYPE_NOPS (exp);
1647 if (TREE_NO_WARNING (orig_exp))
1648 TREE_NO_WARNING (exp) = 1;
1650 return build_unary_op (EXPR_LOCATION (exp), ADDR_EXPR, exp, 0);
1653 /* Perform the default conversion of arrays and functions to pointers.
1654 Return the result of converting EXP. For any other expression, just
1655 return EXP after removing NOPs. */
1658 default_function_array_conversion (struct c_expr exp)
1660 tree orig_exp = exp.value;
1661 tree type = TREE_TYPE (exp.value);
1662 enum tree_code code = TREE_CODE (type);
1668 bool not_lvalue = false;
1669 bool lvalue_array_p;
1671 while ((TREE_CODE (exp.value) == NON_LVALUE_EXPR
1672 || CONVERT_EXPR_P (exp.value))
1673 && TREE_TYPE (TREE_OPERAND (exp.value, 0)) == type)
1675 if (TREE_CODE (exp.value) == NON_LVALUE_EXPR)
1677 exp.value = TREE_OPERAND (exp.value, 0);
1680 if (TREE_NO_WARNING (orig_exp))
1681 TREE_NO_WARNING (exp.value) = 1;
1683 lvalue_array_p = !not_lvalue && lvalue_p (exp.value);
1684 if (!flag_isoc99 && !lvalue_array_p)
1686 /* Before C99, non-lvalue arrays do not decay to pointers.
1687 Normally, using such an array would be invalid; but it can
1688 be used correctly inside sizeof or as a statement expression.
1689 Thus, do not give an error here; an error will result later. */
1693 exp.value = array_to_pointer_conversion (exp.value);
1697 exp.value = function_to_pointer_conversion (exp.value);
1700 STRIP_TYPE_NOPS (exp.value);
1701 if (TREE_NO_WARNING (orig_exp))
1702 TREE_NO_WARNING (exp.value) = 1;
1710 /* EXP is an expression of integer type. Apply the integer promotions
1711 to it and return the promoted value. */
1714 perform_integral_promotions (tree exp)
1716 tree type = TREE_TYPE (exp);
1717 enum tree_code code = TREE_CODE (type);
1719 gcc_assert (INTEGRAL_TYPE_P (type));
1721 /* Normally convert enums to int,
1722 but convert wide enums to something wider. */
1723 if (code == ENUMERAL_TYPE)
1725 type = c_common_type_for_size (MAX (TYPE_PRECISION (type),
1726 TYPE_PRECISION (integer_type_node)),
1727 ((TYPE_PRECISION (type)
1728 >= TYPE_PRECISION (integer_type_node))
1729 && TYPE_UNSIGNED (type)));
1731 return convert (type, exp);
1734 /* ??? This should no longer be needed now bit-fields have their
1736 if (TREE_CODE (exp) == COMPONENT_REF
1737 && DECL_C_BIT_FIELD (TREE_OPERAND (exp, 1))
1738 /* If it's thinner than an int, promote it like a
1739 c_promoting_integer_type_p, otherwise leave it alone. */
1740 && 0 > compare_tree_int (DECL_SIZE (TREE_OPERAND (exp, 1)),
1741 TYPE_PRECISION (integer_type_node)))
1742 return convert (integer_type_node, exp);
1744 if (c_promoting_integer_type_p (type))
1746 /* Preserve unsignedness if not really getting any wider. */
1747 if (TYPE_UNSIGNED (type)
1748 && TYPE_PRECISION (type) == TYPE_PRECISION (integer_type_node))
1749 return convert (unsigned_type_node, exp);
1751 return convert (integer_type_node, exp);
1758 /* Perform default promotions for C data used in expressions.
1759 Enumeral types or short or char are converted to int.
1760 In addition, manifest constants symbols are replaced by their values. */
1763 default_conversion (tree exp)
1766 tree type = TREE_TYPE (exp);
1767 enum tree_code code = TREE_CODE (type);
1769 /* Functions and arrays have been converted during parsing. */
1770 gcc_assert (code != FUNCTION_TYPE);
1771 if (code == ARRAY_TYPE)
1774 /* Constants can be used directly unless they're not loadable. */
1775 if (TREE_CODE (exp) == CONST_DECL)
1776 exp = DECL_INITIAL (exp);
1778 /* Replace a nonvolatile const static variable with its value unless
1779 it is an array, in which case we must be sure that taking the
1780 address of the array produces consistent results. */
1781 else if (optimize && TREE_CODE (exp) == VAR_DECL && code != ARRAY_TYPE)
1783 exp = decl_constant_value_for_broken_optimization (exp);
1784 type = TREE_TYPE (exp);
1787 /* Strip no-op conversions. */
1789 STRIP_TYPE_NOPS (exp);
1791 if (TREE_NO_WARNING (orig_exp))
1792 TREE_NO_WARNING (exp) = 1;
1794 if (code == VOID_TYPE)
1796 error ("void value not ignored as it ought to be");
1797 return error_mark_node;
1800 exp = require_complete_type (exp);
1801 if (exp == error_mark_node)
1802 return error_mark_node;
1804 if (INTEGRAL_TYPE_P (type))
1805 return perform_integral_promotions (exp);
1810 /* Look up COMPONENT in a structure or union DECL.
1812 If the component name is not found, returns NULL_TREE. Otherwise,
1813 the return value is a TREE_LIST, with each TREE_VALUE a FIELD_DECL
1814 stepping down the chain to the component, which is in the last
1815 TREE_VALUE of the list. Normally the list is of length one, but if
1816 the component is embedded within (nested) anonymous structures or
1817 unions, the list steps down the chain to the component. */
1820 lookup_field (tree decl, tree component)
1822 tree type = TREE_TYPE (decl);
1825 /* If TYPE_LANG_SPECIFIC is set, then it is a sorted array of pointers
1826 to the field elements. Use a binary search on this array to quickly
1827 find the element. Otherwise, do a linear search. TYPE_LANG_SPECIFIC
1828 will always be set for structures which have many elements. */
1830 if (TYPE_LANG_SPECIFIC (type) && TYPE_LANG_SPECIFIC (type)->s)
1833 tree *field_array = &TYPE_LANG_SPECIFIC (type)->s->elts[0];
1835 field = TYPE_FIELDS (type);
1837 top = TYPE_LANG_SPECIFIC (type)->s->len;
1838 while (top - bot > 1)
1840 half = (top - bot + 1) >> 1;
1841 field = field_array[bot+half];
1843 if (DECL_NAME (field) == NULL_TREE)
1845 /* Step through all anon unions in linear fashion. */
1846 while (DECL_NAME (field_array[bot]) == NULL_TREE)
1848 field = field_array[bot++];
1849 if (TREE_CODE (TREE_TYPE (field)) == RECORD_TYPE
1850 || TREE_CODE (TREE_TYPE (field)) == UNION_TYPE)
1852 tree anon = lookup_field (field, component);
1855 return tree_cons (NULL_TREE, field, anon);
1859 /* Entire record is only anon unions. */
1863 /* Restart the binary search, with new lower bound. */
1867 if (DECL_NAME (field) == component)
1869 if (DECL_NAME (field) < component)
1875 if (DECL_NAME (field_array[bot]) == component)
1876 field = field_array[bot];
1877 else if (DECL_NAME (field) != component)
1882 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
1884 if (DECL_NAME (field) == NULL_TREE
1885 && (TREE_CODE (TREE_TYPE (field)) == RECORD_TYPE
1886 || TREE_CODE (TREE_TYPE (field)) == UNION_TYPE))
1888 tree anon = lookup_field (field, component);
1891 return tree_cons (NULL_TREE, field, anon);
1894 if (DECL_NAME (field) == component)
1898 if (field == NULL_TREE)
1902 return tree_cons (NULL_TREE, field, NULL_TREE);
1905 /* Make an expression to refer to the COMPONENT field of
1906 structure or union value DATUM. COMPONENT is an IDENTIFIER_NODE. */
1909 build_component_ref (tree datum, tree component)
1911 tree type = TREE_TYPE (datum);
1912 enum tree_code code = TREE_CODE (type);
1916 if (!objc_is_public (datum, component))
1917 return error_mark_node;
1919 /* See if there is a field or component with name COMPONENT. */
1921 if (code == RECORD_TYPE || code == UNION_TYPE)
1923 if (!COMPLETE_TYPE_P (type))
1925 c_incomplete_type_error (NULL_TREE, type);
1926 return error_mark_node;
1929 field = lookup_field (datum, component);
1933 error ("%qT has no member named %qE", type, component);
1934 return error_mark_node;
1937 /* Chain the COMPONENT_REFs if necessary down to the FIELD.
1938 This might be better solved in future the way the C++ front
1939 end does it - by giving the anonymous entities each a
1940 separate name and type, and then have build_component_ref
1941 recursively call itself. We can't do that here. */
1944 tree subdatum = TREE_VALUE (field);
1948 if (TREE_TYPE (subdatum) == error_mark_node)
1949 return error_mark_node;
1951 quals = TYPE_QUALS (strip_array_types (TREE_TYPE (subdatum)));
1952 quals |= TYPE_QUALS (TREE_TYPE (datum));
1953 subtype = c_build_qualified_type (TREE_TYPE (subdatum), quals);
1955 ref = build3 (COMPONENT_REF, subtype, datum, subdatum,
1957 if (TREE_READONLY (datum) || TREE_READONLY (subdatum))
1958 TREE_READONLY (ref) = 1;
1959 if (TREE_THIS_VOLATILE (datum) || TREE_THIS_VOLATILE (subdatum))
1960 TREE_THIS_VOLATILE (ref) = 1;
1962 if (TREE_DEPRECATED (subdatum))
1963 warn_deprecated_use (subdatum);
1967 field = TREE_CHAIN (field);
1973 else if (code != ERROR_MARK)
1974 error ("request for member %qE in something not a structure or union",
1977 return error_mark_node;
1980 /* Given an expression PTR for a pointer, return an expression
1981 for the value pointed to.
1982 ERRORSTRING is the name of the operator to appear in error messages.
1984 LOC is the location to use for the generated tree. */
1987 build_indirect_ref (location_t loc, tree ptr, const char *errorstring)
1989 tree pointer = default_conversion (ptr);
1990 tree type = TREE_TYPE (pointer);
1993 if (TREE_CODE (type) == POINTER_TYPE)
1995 if (CONVERT_EXPR_P (pointer)
1996 || TREE_CODE (pointer) == VIEW_CONVERT_EXPR)
1998 /* If a warning is issued, mark it to avoid duplicates from
1999 the backend. This only needs to be done at
2000 warn_strict_aliasing > 2. */
2001 if (warn_strict_aliasing > 2)
2002 if (strict_aliasing_warning (TREE_TYPE (TREE_OPERAND (pointer, 0)),
2003 type, TREE_OPERAND (pointer, 0)))
2004 TREE_NO_WARNING (pointer) = 1;
2007 if (TREE_CODE (pointer) == ADDR_EXPR
2008 && (TREE_TYPE (TREE_OPERAND (pointer, 0))
2009 == TREE_TYPE (type)))
2011 ref = TREE_OPERAND (pointer, 0);
2012 protected_set_expr_location (ref, loc);
2017 tree t = TREE_TYPE (type);
2019 ref = build1 (INDIRECT_REF, t, pointer);
2021 if (!COMPLETE_OR_VOID_TYPE_P (t) && TREE_CODE (t) != ARRAY_TYPE)
2023 error_at (loc, "dereferencing pointer to incomplete type");
2024 return error_mark_node;
2026 if (VOID_TYPE_P (t) && skip_evaluation == 0)
2027 warning_at (loc, 0, "dereferencing %<void *%> pointer");
2029 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
2030 so that we get the proper error message if the result is used
2031 to assign to. Also, &* is supposed to be a no-op.
2032 And ANSI C seems to specify that the type of the result
2033 should be the const type. */
2034 /* A de-reference of a pointer to const is not a const. It is valid
2035 to change it via some other pointer. */
2036 TREE_READONLY (ref) = TYPE_READONLY (t);
2037 TREE_SIDE_EFFECTS (ref)
2038 = TYPE_VOLATILE (t) || TREE_SIDE_EFFECTS (pointer);
2039 TREE_THIS_VOLATILE (ref) = TYPE_VOLATILE (t);
2040 protected_set_expr_location (ref, loc);
2044 else if (TREE_CODE (pointer) != ERROR_MARK)
2046 "invalid type argument of %qs (have %qT)", errorstring, type);
2047 return error_mark_node;
2050 /* This handles expressions of the form "a[i]", which denotes
2053 This is logically equivalent in C to *(a+i), but we may do it differently.
2054 If A is a variable or a member, we generate a primitive ARRAY_REF.
2055 This avoids forcing the array out of registers, and can work on
2056 arrays that are not lvalues (for example, members of structures returned
2059 LOC is the location to use for the returned expression. */
2062 build_array_ref (tree array, tree index, location_t loc)
2065 bool swapped = false;
2066 if (TREE_TYPE (array) == error_mark_node
2067 || TREE_TYPE (index) == error_mark_node)
2068 return error_mark_node;
2070 if (TREE_CODE (TREE_TYPE (array)) != ARRAY_TYPE
2071 && TREE_CODE (TREE_TYPE (array)) != POINTER_TYPE)
2074 if (TREE_CODE (TREE_TYPE (index)) != ARRAY_TYPE
2075 && TREE_CODE (TREE_TYPE (index)) != POINTER_TYPE)
2077 error_at (loc, "subscripted value is neither array nor pointer");
2078 return error_mark_node;
2086 if (!INTEGRAL_TYPE_P (TREE_TYPE (index)))
2088 error_at (loc, "array subscript is not an integer");
2089 return error_mark_node;
2092 if (TREE_CODE (TREE_TYPE (TREE_TYPE (array))) == FUNCTION_TYPE)
2094 error_at (loc, "subscripted value is pointer to function");
2095 return error_mark_node;
2098 /* ??? Existing practice has been to warn only when the char
2099 index is syntactically the index, not for char[array]. */
2101 warn_array_subscript_with_type_char (index);
2103 /* Apply default promotions *after* noticing character types. */
2104 index = default_conversion (index);
2106 gcc_assert (TREE_CODE (TREE_TYPE (index)) == INTEGER_TYPE);
2108 if (TREE_CODE (TREE_TYPE (array)) == ARRAY_TYPE)
2112 /* An array that is indexed by a non-constant
2113 cannot be stored in a register; we must be able to do
2114 address arithmetic on its address.
2115 Likewise an array of elements of variable size. */
2116 if (TREE_CODE (index) != INTEGER_CST
2117 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array)))
2118 && TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array)))) != INTEGER_CST))
2120 if (!c_mark_addressable (array))
2121 return error_mark_node;
2123 /* An array that is indexed by a constant value which is not within
2124 the array bounds cannot be stored in a register either; because we
2125 would get a crash in store_bit_field/extract_bit_field when trying
2126 to access a non-existent part of the register. */
2127 if (TREE_CODE (index) == INTEGER_CST
2128 && TYPE_DOMAIN (TREE_TYPE (array))
2129 && !int_fits_type_p (index, TYPE_DOMAIN (TREE_TYPE (array))))
2131 if (!c_mark_addressable (array))
2132 return error_mark_node;
2138 while (TREE_CODE (foo) == COMPONENT_REF)
2139 foo = TREE_OPERAND (foo, 0);
2140 if (TREE_CODE (foo) == VAR_DECL && C_DECL_REGISTER (foo))
2141 pedwarn (loc, OPT_pedantic,
2142 "ISO C forbids subscripting %<register%> array");
2143 else if (!flag_isoc99 && !lvalue_p (foo))
2144 pedwarn (loc, OPT_pedantic,
2145 "ISO C90 forbids subscripting non-lvalue array");
2148 type = TREE_TYPE (TREE_TYPE (array));
2149 rval = build4 (ARRAY_REF, type, array, index, NULL_TREE, NULL_TREE);
2150 /* Array ref is const/volatile if the array elements are
2151 or if the array is. */
2152 TREE_READONLY (rval)
2153 |= (TYPE_READONLY (TREE_TYPE (TREE_TYPE (array)))
2154 | TREE_READONLY (array));
2155 TREE_SIDE_EFFECTS (rval)
2156 |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array)))
2157 | TREE_SIDE_EFFECTS (array));
2158 TREE_THIS_VOLATILE (rval)
2159 |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array)))
2160 /* This was added by rms on 16 Nov 91.
2161 It fixes vol struct foo *a; a->elts[1]
2162 in an inline function.
2163 Hope it doesn't break something else. */
2164 | TREE_THIS_VOLATILE (array));
2165 ret = require_complete_type (fold (rval));
2166 protected_set_expr_location (ret, loc);
2171 tree ar = default_conversion (array);
2173 if (ar == error_mark_node)
2176 gcc_assert (TREE_CODE (TREE_TYPE (ar)) == POINTER_TYPE);
2177 gcc_assert (TREE_CODE (TREE_TYPE (TREE_TYPE (ar))) != FUNCTION_TYPE);
2179 return build_indirect_ref
2180 (loc, build_binary_op (loc, PLUS_EXPR, ar, index, 0),
2185 /* Build an external reference to identifier ID. FUN indicates
2186 whether this will be used for a function call. LOC is the source
2187 location of the identifier. */
2189 build_external_ref (tree id, int fun, location_t loc)
2192 tree decl = lookup_name (id);
2194 /* In Objective-C, an instance variable (ivar) may be preferred to
2195 whatever lookup_name() found. */
2196 decl = objc_lookup_ivar (decl, id);
2198 if (decl && decl != error_mark_node)
2201 /* Implicit function declaration. */
2202 ref = implicitly_declare (id);
2203 else if (decl == error_mark_node)
2204 /* Don't complain about something that's already been
2205 complained about. */
2206 return error_mark_node;
2209 undeclared_variable (id, loc);
2210 return error_mark_node;
2213 if (TREE_TYPE (ref) == error_mark_node)
2214 return error_mark_node;
2216 if (TREE_DEPRECATED (ref))
2217 warn_deprecated_use (ref);
2219 /* Recursive call does not count as usage. */
2220 if (ref != current_function_decl)
2222 TREE_USED (ref) = 1;
2225 if (TREE_CODE (ref) == FUNCTION_DECL && !in_alignof)
2227 if (!in_sizeof && !in_typeof)
2228 C_DECL_USED (ref) = 1;
2229 else if (DECL_INITIAL (ref) == 0
2230 && DECL_EXTERNAL (ref)
2231 && !TREE_PUBLIC (ref))
2232 record_maybe_used_decl (ref);
2235 if (TREE_CODE (ref) == CONST_DECL)
2237 used_types_insert (TREE_TYPE (ref));
2238 ref = DECL_INITIAL (ref);
2239 TREE_CONSTANT (ref) = 1;
2241 else if (current_function_decl != 0
2242 && !DECL_FILE_SCOPE_P (current_function_decl)
2243 && (TREE_CODE (ref) == VAR_DECL
2244 || TREE_CODE (ref) == PARM_DECL
2245 || TREE_CODE (ref) == FUNCTION_DECL))
2247 tree context = decl_function_context (ref);
2249 if (context != 0 && context != current_function_decl)
2250 DECL_NONLOCAL (ref) = 1;
2252 /* C99 6.7.4p3: An inline definition of a function with external
2253 linkage ... shall not contain a reference to an identifier with
2254 internal linkage. */
2255 else if (current_function_decl != 0
2256 && DECL_DECLARED_INLINE_P (current_function_decl)
2257 && DECL_EXTERNAL (current_function_decl)
2258 && VAR_OR_FUNCTION_DECL_P (ref)
2259 && (TREE_CODE (ref) != VAR_DECL || TREE_STATIC (ref))
2260 && ! TREE_PUBLIC (ref)
2261 && DECL_CONTEXT (ref) != current_function_decl)
2262 pedwarn (loc, 0, "%qD is static but used in inline function %qD "
2263 "which is not static", ref, current_function_decl);
2268 /* Record details of decls possibly used inside sizeof or typeof. */
2269 struct maybe_used_decl
2273 /* The level seen at (in_sizeof + in_typeof). */
2275 /* The next one at this level or above, or NULL. */
2276 struct maybe_used_decl *next;
2279 static struct maybe_used_decl *maybe_used_decls;
2281 /* Record that DECL, an undefined static function reference seen
2282 inside sizeof or typeof, might be used if the operand of sizeof is
2283 a VLA type or the operand of typeof is a variably modified
2287 record_maybe_used_decl (tree decl)
2289 struct maybe_used_decl *t = XOBNEW (&parser_obstack, struct maybe_used_decl);
2291 t->level = in_sizeof + in_typeof;
2292 t->next = maybe_used_decls;
2293 maybe_used_decls = t;
2296 /* Pop the stack of decls possibly used inside sizeof or typeof. If
2297 USED is false, just discard them. If it is true, mark them used
2298 (if no longer inside sizeof or typeof) or move them to the next
2299 level up (if still inside sizeof or typeof). */
2302 pop_maybe_used (bool used)
2304 struct maybe_used_decl *p = maybe_used_decls;
2305 int cur_level = in_sizeof + in_typeof;
2306 while (p && p->level > cur_level)
2311 C_DECL_USED (p->decl) = 1;
2313 p->level = cur_level;
2317 if (!used || cur_level == 0)
2318 maybe_used_decls = p;
2321 /* Return the result of sizeof applied to EXPR. */
2324 c_expr_sizeof_expr (struct c_expr expr)
2327 if (expr.value == error_mark_node)
2329 ret.value = error_mark_node;
2330 ret.original_code = ERROR_MARK;
2331 pop_maybe_used (false);
2335 ret.value = c_sizeof (TREE_TYPE (expr.value));
2336 ret.original_code = ERROR_MARK;
2337 if (c_vla_type_p (TREE_TYPE (expr.value)))
2339 /* sizeof is evaluated when given a vla (C99 6.5.3.4p2). */
2340 ret.value = build2 (COMPOUND_EXPR, TREE_TYPE (ret.value), expr.value, ret.value);
2342 pop_maybe_used (C_TYPE_VARIABLE_SIZE (TREE_TYPE (expr.value)));
2347 /* Return the result of sizeof applied to T, a structure for the type
2348 name passed to sizeof (rather than the type itself). */
2351 c_expr_sizeof_type (struct c_type_name *t)
2355 type = groktypename (t);
2356 ret.value = c_sizeof (type);
2357 ret.original_code = ERROR_MARK;
2358 pop_maybe_used (type != error_mark_node
2359 ? C_TYPE_VARIABLE_SIZE (type) : false);
2363 /* Build a function call to function FUNCTION with parameters PARAMS.
2364 PARAMS is a list--a chain of TREE_LIST nodes--in which the
2365 TREE_VALUE of each node is a parameter-expression.
2366 FUNCTION's data type may be a function type or a pointer-to-function. */
2369 build_function_call (tree function, tree params)
2371 tree fntype, fundecl = 0;
2372 tree name = NULL_TREE, result;
2378 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
2379 STRIP_TYPE_NOPS (function);
2381 /* Convert anything with function type to a pointer-to-function. */
2382 if (TREE_CODE (function) == FUNCTION_DECL)
2384 /* Implement type-directed function overloading for builtins.
2385 resolve_overloaded_builtin and targetm.resolve_overloaded_builtin
2386 handle all the type checking. The result is a complete expression
2387 that implements this function call. */
2388 tem = resolve_overloaded_builtin (function, params);
2392 name = DECL_NAME (function);
2395 if (TREE_CODE (TREE_TYPE (function)) == FUNCTION_TYPE)
2396 function = function_to_pointer_conversion (function);
2398 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
2399 expressions, like those used for ObjC messenger dispatches. */
2400 function = objc_rewrite_function_call (function, params);
2402 fntype = TREE_TYPE (function);
2404 if (TREE_CODE (fntype) == ERROR_MARK)
2405 return error_mark_node;
2407 if (!(TREE_CODE (fntype) == POINTER_TYPE
2408 && TREE_CODE (TREE_TYPE (fntype)) == FUNCTION_TYPE))
2410 error ("called object %qE is not a function", function);
2411 return error_mark_node;
2414 if (fundecl && TREE_THIS_VOLATILE (fundecl))
2415 current_function_returns_abnormally = 1;
2417 /* fntype now gets the type of function pointed to. */
2418 fntype = TREE_TYPE (fntype);
2420 /* Convert the parameters to the types declared in the
2421 function prototype, or apply default promotions. */
2423 nargs = list_length (params);
2424 argarray = (tree *) alloca (nargs * sizeof (tree));
2425 nargs = convert_arguments (nargs, argarray, TYPE_ARG_TYPES (fntype),
2426 params, function, fundecl);
2428 return error_mark_node;
2430 /* Check that the function is called through a compatible prototype.
2431 If it is not, replace the call by a trap, wrapped up in a compound
2432 expression if necessary. This has the nice side-effect to prevent
2433 the tree-inliner from generating invalid assignment trees which may
2434 blow up in the RTL expander later. */
2435 if (CONVERT_EXPR_P (function)
2436 && TREE_CODE (tem = TREE_OPERAND (function, 0)) == ADDR_EXPR
2437 && TREE_CODE (tem = TREE_OPERAND (tem, 0)) == FUNCTION_DECL
2438 && !comptypes (fntype, TREE_TYPE (tem)))
2440 tree return_type = TREE_TYPE (fntype);
2441 tree trap = build_function_call (built_in_decls[BUILT_IN_TRAP],
2445 /* This situation leads to run-time undefined behavior. We can't,
2446 therefore, simply error unless we can prove that all possible
2447 executions of the program must execute the code. */
2448 if (warning (0, "function called through a non-compatible type"))
2449 /* We can, however, treat "undefined" any way we please.
2450 Call abort to encourage the user to fix the program. */
2451 inform (input_location, "if this code is reached, the program will abort");
2452 /* Before the abort, allow the function arguments to exit or
2454 for (i = 0; i < nargs; i++)
2455 trap = build2 (COMPOUND_EXPR, void_type_node, argarray[i], trap);
2457 if (VOID_TYPE_P (return_type))
2463 if (AGGREGATE_TYPE_P (return_type))
2464 rhs = build_compound_literal (return_type,
2465 build_constructor (return_type, 0));
2467 rhs = fold_convert (return_type, integer_zero_node);
2469 return build2 (COMPOUND_EXPR, return_type, trap, rhs);
2473 /* Check that arguments to builtin functions match the expectations. */
2475 && DECL_BUILT_IN (fundecl)
2476 && DECL_BUILT_IN_CLASS (fundecl) == BUILT_IN_NORMAL
2477 && !check_builtin_function_arguments (fundecl, nargs, argarray))
2478 return error_mark_node;
2480 /* Check that the arguments to the function are valid. */
2481 check_function_arguments (TYPE_ATTRIBUTES (fntype), nargs, argarray,
2482 TYPE_ARG_TYPES (fntype));
2484 if (require_constant_value)
2486 result = fold_build_call_array_initializer (TREE_TYPE (fntype),
2487 function, nargs, argarray);
2488 if (TREE_CONSTANT (result)
2489 && (name == NULL_TREE
2490 || strncmp (IDENTIFIER_POINTER (name), "__builtin_", 10) != 0))
2491 pedwarn_init (input_location, 0, "initializer element is not constant");
2494 result = fold_build_call_array (TREE_TYPE (fntype),
2495 function, nargs, argarray);
2497 if (VOID_TYPE_P (TREE_TYPE (result)))
2499 return require_complete_type (result);
2502 /* Convert the argument expressions in the list VALUES
2503 to the types in the list TYPELIST. The resulting arguments are
2504 stored in the array ARGARRAY which has size NARGS.
2506 If TYPELIST is exhausted, or when an element has NULL as its type,
2507 perform the default conversions.
2509 PARMLIST is the chain of parm decls for the function being called.
2510 It may be 0, if that info is not available.
2511 It is used only for generating error messages.
2513 FUNCTION is a tree for the called function. It is used only for
2514 error messages, where it is formatted with %qE.
2516 This is also where warnings about wrong number of args are generated.
2518 VALUES is a chain of TREE_LIST nodes with the elements of the list
2519 in the TREE_VALUE slots of those nodes.
2521 Returns the actual number of arguments processed (which may be less
2522 than NARGS in some error situations), or -1 on failure. */
2525 convert_arguments (int nargs, tree *argarray,
2526 tree typelist, tree values, tree function, tree fundecl)
2528 tree typetail, valtail;
2530 const bool type_generic = fundecl
2531 && lookup_attribute ("type generic", TYPE_ATTRIBUTES(TREE_TYPE (fundecl)));
2534 /* Change pointer to function to the function itself for
2536 if (TREE_CODE (function) == ADDR_EXPR
2537 && TREE_CODE (TREE_OPERAND (function, 0)) == FUNCTION_DECL)
2538 function = TREE_OPERAND (function, 0);
2540 /* Handle an ObjC selector specially for diagnostics. */
2541 selector = objc_message_selector ();
2543 /* Scan the given expressions and types, producing individual
2544 converted arguments and storing them in ARGARRAY. */
2546 for (valtail = values, typetail = typelist, parmnum = 0;
2548 valtail = TREE_CHAIN (valtail), parmnum++)
2550 tree type = typetail ? TREE_VALUE (typetail) : 0;
2551 tree val = TREE_VALUE (valtail);
2552 tree rname = function;
2553 int argnum = parmnum + 1;
2554 const char *invalid_func_diag;
2556 if (type == void_type_node)
2558 error ("too many arguments to function %qE", function);
2562 if (selector && argnum > 2)
2568 STRIP_TYPE_NOPS (val);
2570 val = require_complete_type (val);
2574 /* Formal parm type is specified by a function prototype. */
2577 if (type == error_mark_node || !COMPLETE_TYPE_P (type))
2579 error ("type of formal parameter %d is incomplete", parmnum + 1);
2584 /* Optionally warn about conversions that
2585 differ from the default conversions. */
2586 if (warn_traditional_conversion || warn_traditional)
2588 unsigned int formal_prec = TYPE_PRECISION (type);
2590 if (INTEGRAL_TYPE_P (type)
2591 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
2592 warning (0, "passing argument %d of %qE as integer "
2593 "rather than floating due to prototype",
2595 if (INTEGRAL_TYPE_P (type)
2596 && TREE_CODE (TREE_TYPE (val)) == COMPLEX_TYPE)
2597 warning (0, "passing argument %d of %qE as integer "
2598 "rather than complex due to prototype",
2600 else if (TREE_CODE (type) == COMPLEX_TYPE
2601 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
2602 warning (0, "passing argument %d of %qE as complex "
2603 "rather than floating due to prototype",
2605 else if (TREE_CODE (type) == REAL_TYPE
2606 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
2607 warning (0, "passing argument %d of %qE as floating "
2608 "rather than integer due to prototype",
2610 else if (TREE_CODE (type) == COMPLEX_TYPE
2611 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
2612 warning (0, "passing argument %d of %qE as complex "
2613 "rather than integer due to prototype",
2615 else if (TREE_CODE (type) == REAL_TYPE
2616 && TREE_CODE (TREE_TYPE (val)) == COMPLEX_TYPE)
2617 warning (0, "passing argument %d of %qE as floating "
2618 "rather than complex due to prototype",
2620 /* ??? At some point, messages should be written about
2621 conversions between complex types, but that's too messy
2623 else if (TREE_CODE (type) == REAL_TYPE
2624 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
2626 /* Warn if any argument is passed as `float',
2627 since without a prototype it would be `double'. */
2628 if (formal_prec == TYPE_PRECISION (float_type_node)
2629 && type != dfloat32_type_node)
2630 warning (0, "passing argument %d of %qE as %<float%> "
2631 "rather than %<double%> due to prototype",
2634 /* Warn if mismatch between argument and prototype
2635 for decimal float types. Warn of conversions with
2636 binary float types and of precision narrowing due to
2638 else if (type != TREE_TYPE (val)
2639 && (type == dfloat32_type_node
2640 || type == dfloat64_type_node
2641 || type == dfloat128_type_node
2642 || TREE_TYPE (val) == dfloat32_type_node
2643 || TREE_TYPE (val) == dfloat64_type_node
2644 || TREE_TYPE (val) == dfloat128_type_node)
2646 <= TYPE_PRECISION (TREE_TYPE (val))
2647 || (type == dfloat128_type_node
2649 != dfloat64_type_node
2651 != dfloat32_type_node)))
2652 || (type == dfloat64_type_node
2654 != dfloat32_type_node))))
2655 warning (0, "passing argument %d of %qE as %qT "
2656 "rather than %qT due to prototype",
2657 argnum, rname, type, TREE_TYPE (val));
2660 /* Detect integer changing in width or signedness.
2661 These warnings are only activated with
2662 -Wtraditional-conversion, not with -Wtraditional. */
2663 else if (warn_traditional_conversion && INTEGRAL_TYPE_P (type)
2664 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
2666 tree would_have_been = default_conversion (val);
2667 tree type1 = TREE_TYPE (would_have_been);
2669 if (TREE_CODE (type) == ENUMERAL_TYPE
2670 && (TYPE_MAIN_VARIANT (type)
2671 == TYPE_MAIN_VARIANT (TREE_TYPE (val))))
2672 /* No warning if function asks for enum
2673 and the actual arg is that enum type. */
2675 else if (formal_prec != TYPE_PRECISION (type1))
2676 warning (OPT_Wtraditional_conversion, "passing argument %d of %qE "
2677 "with different width due to prototype",
2679 else if (TYPE_UNSIGNED (type) == TYPE_UNSIGNED (type1))
2681 /* Don't complain if the formal parameter type
2682 is an enum, because we can't tell now whether
2683 the value was an enum--even the same enum. */
2684 else if (TREE_CODE (type) == ENUMERAL_TYPE)
2686 else if (TREE_CODE (val) == INTEGER_CST
2687 && int_fits_type_p (val, type))
2688 /* Change in signedness doesn't matter
2689 if a constant value is unaffected. */
2691 /* If the value is extended from a narrower
2692 unsigned type, it doesn't matter whether we
2693 pass it as signed or unsigned; the value
2694 certainly is the same either way. */
2695 else if (TYPE_PRECISION (TREE_TYPE (val)) < TYPE_PRECISION (type)
2696 && TYPE_UNSIGNED (TREE_TYPE (val)))
2698 else if (TYPE_UNSIGNED (type))
2699 warning (OPT_Wtraditional_conversion, "passing argument %d of %qE "
2700 "as unsigned due to prototype",
2703 warning (OPT_Wtraditional_conversion, "passing argument %d of %qE "
2704 "as signed due to prototype", argnum, rname);
2708 parmval = convert_for_assignment (type, val, ic_argpass,
2712 if (targetm.calls.promote_prototypes (fundecl ? TREE_TYPE (fundecl) : 0)
2713 && INTEGRAL_TYPE_P (type)
2714 && (TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node)))
2715 parmval = default_conversion (parmval);
2717 argarray[parmnum] = parmval;
2719 else if (TREE_CODE (TREE_TYPE (val)) == REAL_TYPE
2720 && (TYPE_PRECISION (TREE_TYPE (val))
2721 < TYPE_PRECISION (double_type_node))
2722 && !DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (val))))
2725 argarray[parmnum] = val;
2727 /* Convert `float' to `double'. */
2728 argarray[parmnum] = convert (double_type_node, val);
2730 else if ((invalid_func_diag =
2731 targetm.calls.invalid_arg_for_unprototyped_fn (typelist, fundecl, val)))
2733 error (invalid_func_diag);
2737 /* Convert `short' and `char' to full-size `int'. */
2738 argarray[parmnum] = default_conversion (val);
2741 typetail = TREE_CHAIN (typetail);
2744 gcc_assert (parmnum == nargs);
2746 if (typetail != 0 && TREE_VALUE (typetail) != void_type_node)
2748 error ("too few arguments to function %qE", function);
2755 /* This is the entry point used by the parser to build unary operators
2756 in the input. CODE, a tree_code, specifies the unary operator, and
2757 ARG is the operand. For unary plus, the C parser currently uses
2758 CONVERT_EXPR for code.
2760 LOC is the location to use for the tree generated.
2764 parser_build_unary_op (enum tree_code code, struct c_expr arg, location_t loc)
2766 struct c_expr result;
2768 result.value = build_unary_op (loc, code, arg.value, 0);
2769 result.original_code = code;
2771 if (TREE_OVERFLOW_P (result.value) && !TREE_OVERFLOW_P (arg.value))
2772 overflow_warning (result.value);
2777 /* This is the entry point used by the parser to build binary operators
2778 in the input. CODE, a tree_code, specifies the binary operator, and
2779 ARG1 and ARG2 are the operands. In addition to constructing the
2780 expression, we check for operands that were written with other binary
2781 operators in a way that is likely to confuse the user.
2783 LOCATION is the location of the binary operator. */
2786 parser_build_binary_op (location_t location, enum tree_code code,
2787 struct c_expr arg1, struct c_expr arg2)
2789 struct c_expr result;
2791 enum tree_code code1 = arg1.original_code;
2792 enum tree_code code2 = arg2.original_code;
2794 result.value = build_binary_op (location, code,
2795 arg1.value, arg2.value, 1);
2796 result.original_code = code;
2798 if (TREE_CODE (result.value) == ERROR_MARK)
2801 if (location != UNKNOWN_LOCATION)
2802 protected_set_expr_location (result.value, location);
2804 /* Check for cases such as x+y<<z which users are likely
2806 if (warn_parentheses)
2807 warn_about_parentheses (code, code1, arg1.value, code2, arg2.value);
2809 if (TREE_CODE_CLASS (code1) != tcc_comparison)
2810 warn_logical_operator (code, arg1.value, arg2.value);
2812 /* Warn about comparisons against string literals, with the exception
2813 of testing for equality or inequality of a string literal with NULL. */
2814 if (code == EQ_EXPR || code == NE_EXPR)
2816 if ((code1 == STRING_CST && !integer_zerop (arg2.value))
2817 || (code2 == STRING_CST && !integer_zerop (arg1.value)))
2818 warning (OPT_Waddress, "comparison with string literal results in unspecified behavior");
2820 else if (TREE_CODE_CLASS (code) == tcc_comparison
2821 && (code1 == STRING_CST || code2 == STRING_CST))
2822 warning (OPT_Waddress, "comparison with string literal results in unspecified behavior");
2824 if (TREE_OVERFLOW_P (result.value)
2825 && !TREE_OVERFLOW_P (arg1.value)
2826 && !TREE_OVERFLOW_P (arg2.value))
2827 overflow_warning (result.value);
2832 /* Return a tree for the difference of pointers OP0 and OP1.
2833 The resulting tree has type int. */
2836 pointer_diff (tree op0, tree op1)
2838 tree restype = ptrdiff_type_node;
2840 tree target_type = TREE_TYPE (TREE_TYPE (op0));
2841 tree con0, con1, lit0, lit1;
2842 tree orig_op1 = op1;
2844 if (TREE_CODE (target_type) == VOID_TYPE)
2845 pedwarn (input_location, pedantic ? OPT_pedantic : OPT_Wpointer_arith,
2846 "pointer of type %<void *%> used in subtraction");
2847 if (TREE_CODE (target_type) == FUNCTION_TYPE)
2848 pedwarn (input_location, pedantic ? OPT_pedantic : OPT_Wpointer_arith,
2849 "pointer to a function used in subtraction");
2851 /* If the conversion to ptrdiff_type does anything like widening or
2852 converting a partial to an integral mode, we get a convert_expression
2853 that is in the way to do any simplifications.
2854 (fold-const.c doesn't know that the extra bits won't be needed.
2855 split_tree uses STRIP_SIGN_NOPS, which leaves conversions to a
2856 different mode in place.)
2857 So first try to find a common term here 'by hand'; we want to cover
2858 at least the cases that occur in legal static initializers. */
2859 if (CONVERT_EXPR_P (op0)
2860 && (TYPE_PRECISION (TREE_TYPE (op0))
2861 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op0, 0)))))
2862 con0 = TREE_OPERAND (op0, 0);
2865 if (CONVERT_EXPR_P (op1)
2866 && (TYPE_PRECISION (TREE_TYPE (op1))
2867 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op1, 0)))))
2868 con1 = TREE_OPERAND (op1, 0);
2872 if (TREE_CODE (con0) == PLUS_EXPR)
2874 lit0 = TREE_OPERAND (con0, 1);
2875 con0 = TREE_OPERAND (con0, 0);
2878 lit0 = integer_zero_node;
2880 if (TREE_CODE (con1) == PLUS_EXPR)
2882 lit1 = TREE_OPERAND (con1, 1);
2883 con1 = TREE_OPERAND (con1, 0);
2886 lit1 = integer_zero_node;
2888 if (operand_equal_p (con0, con1, 0))
2895 /* First do the subtraction as integers;
2896 then drop through to build the divide operator.
2897 Do not do default conversions on the minus operator
2898 in case restype is a short type. */
2900 op0 = build_binary_op (input_location,
2901 MINUS_EXPR, convert (restype, op0),
2902 convert (restype, op1), 0);
2903 /* This generates an error if op1 is pointer to incomplete type. */
2904 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (TREE_TYPE (orig_op1))))
2905 error ("arithmetic on pointer to an incomplete type");
2907 /* This generates an error if op0 is pointer to incomplete type. */
2908 op1 = c_size_in_bytes (target_type);
2910 /* Divide by the size, in easiest possible way. */
2911 return fold_build2 (EXACT_DIV_EXPR, restype, op0, convert (restype, op1));
2914 /* Construct and perhaps optimize a tree representation
2915 for a unary operation. CODE, a tree_code, specifies the operation
2916 and XARG is the operand.
2917 For any CODE other than ADDR_EXPR, FLAG nonzero suppresses
2918 the default promotions (such as from short to int).
2919 For ADDR_EXPR, the default promotions are not applied; FLAG nonzero
2920 allows non-lvalues; this is only used to handle conversion of non-lvalue
2921 arrays to pointers in C99.
2923 LOCATION is the location of the operator. */
2926 build_unary_op (location_t location,
2927 enum tree_code code, tree xarg, int flag)
2929 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
2932 enum tree_code typecode;
2934 tree ret = error_mark_node;
2935 int noconvert = flag;
2936 const char *invalid_op_diag;
2938 if (code != ADDR_EXPR)
2939 arg = require_complete_type (arg);
2941 typecode = TREE_CODE (TREE_TYPE (arg));
2942 if (typecode == ERROR_MARK)
2943 return error_mark_node;
2944 if (typecode == ENUMERAL_TYPE || typecode == BOOLEAN_TYPE)
2945 typecode = INTEGER_TYPE;
2947 if ((invalid_op_diag
2948 = targetm.invalid_unary_op (code, TREE_TYPE (xarg))))
2950 error_at (location, invalid_op_diag);
2951 return error_mark_node;
2957 /* This is used for unary plus, because a CONVERT_EXPR
2958 is enough to prevent anybody from looking inside for
2959 associativity, but won't generate any code. */
2960 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2961 || typecode == FIXED_POINT_TYPE || typecode == COMPLEX_TYPE
2962 || typecode == VECTOR_TYPE))
2964 error_at (location, "wrong type argument to unary plus");
2965 return error_mark_node;
2967 else if (!noconvert)
2968 arg = default_conversion (arg);
2969 arg = non_lvalue (arg);
2973 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2974 || typecode == FIXED_POINT_TYPE || typecode == COMPLEX_TYPE
2975 || typecode == VECTOR_TYPE))
2977 error_at (location, "wrong type argument to unary minus");
2978 return error_mark_node;
2980 else if (!noconvert)
2981 arg = default_conversion (arg);
2985 /* ~ works on integer types and non float vectors. */
2986 if (typecode == INTEGER_TYPE
2987 || (typecode == VECTOR_TYPE
2988 && !VECTOR_FLOAT_TYPE_P (TREE_TYPE (arg))))
2991 arg = default_conversion (arg);
2993 else if (typecode == COMPLEX_TYPE)
2996 pedwarn (location, OPT_pedantic,
2997 "ISO C does not support %<~%> for complex conjugation");
2999 arg = default_conversion (arg);
3003 error_at (location, "wrong type argument to bit-complement");
3004 return error_mark_node;
3009 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE))
3011 error_at (location, "wrong type argument to abs");
3012 return error_mark_node;
3014 else if (!noconvert)
3015 arg = default_conversion (arg);
3019 /* Conjugating a real value is a no-op, but allow it anyway. */
3020 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
3021 || typecode == COMPLEX_TYPE))
3023 error_at (location, "wrong type argument to conjugation");
3024 return error_mark_node;
3026 else if (!noconvert)
3027 arg = default_conversion (arg);
3030 case TRUTH_NOT_EXPR:
3031 if (typecode != INTEGER_TYPE && typecode != FIXED_POINT_TYPE
3032 && typecode != REAL_TYPE && typecode != POINTER_TYPE
3033 && typecode != COMPLEX_TYPE)
3036 "wrong type argument to unary exclamation mark");
3037 return error_mark_node;
3039 arg = c_objc_common_truthvalue_conversion (location, arg);
3040 ret = invert_truthvalue (arg);
3041 goto return_build_unary_op;
3044 if (TREE_CODE (arg) == COMPLEX_CST)
3045 ret = TREE_REALPART (arg);
3046 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
3047 ret = fold_build1 (REALPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg);
3050 goto return_build_unary_op;
3053 if (TREE_CODE (arg) == COMPLEX_CST)
3054 ret = TREE_IMAGPART (arg);
3055 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
3056 ret = fold_build1 (IMAGPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg);
3058 ret = omit_one_operand (TREE_TYPE (arg), integer_zero_node, arg);
3059 goto return_build_unary_op;
3061 case PREINCREMENT_EXPR:
3062 case POSTINCREMENT_EXPR:
3063 case PREDECREMENT_EXPR:
3064 case POSTDECREMENT_EXPR:
3066 /* Increment or decrement the real part of the value,
3067 and don't change the imaginary part. */
3068 if (typecode == COMPLEX_TYPE)
3072 pedwarn (location, OPT_pedantic,
3073 "ISO C does not support %<++%> and %<--%> on complex types");
3075 arg = stabilize_reference (arg);
3076 real = build_unary_op (EXPR_LOCATION (arg), REALPART_EXPR, arg, 1);
3077 imag = build_unary_op (EXPR_LOCATION (arg), IMAGPART_EXPR, arg, 1);
3078 real = build_unary_op (EXPR_LOCATION (arg), code, real, 1);
3079 if (real == error_mark_node || imag == error_mark_node)
3080 return error_mark_node;
3081 ret = build2 (COMPLEX_EXPR, TREE_TYPE (arg),
3083 goto return_build_unary_op;
3086 /* Report invalid types. */
3088 if (typecode != POINTER_TYPE && typecode != FIXED_POINT_TYPE
3089 && typecode != INTEGER_TYPE && typecode != REAL_TYPE)
3091 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
3092 error_at (location, "wrong type argument to increment");
3094 error_at (location, "wrong type argument to decrement");
3096 return error_mark_node;
3102 argtype = TREE_TYPE (arg);
3104 /* Compute the increment. */
3106 if (typecode == POINTER_TYPE)
3108 /* If pointer target is an undefined struct,
3109 we just cannot know how to do the arithmetic. */
3110 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (argtype)))
3112 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
3114 "increment of pointer to unknown structure");
3117 "decrement of pointer to unknown structure");
3119 else if (TREE_CODE (TREE_TYPE (argtype)) == FUNCTION_TYPE
3120 || TREE_CODE (TREE_TYPE (argtype)) == VOID_TYPE)
3122 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
3123 pedwarn (location, pedantic ? OPT_pedantic : OPT_Wpointer_arith,
3124 "wrong type argument to increment");
3126 pedwarn (location, pedantic ? OPT_pedantic : OPT_Wpointer_arith,
3127 "wrong type argument to decrement");
3130 inc = c_size_in_bytes (TREE_TYPE (argtype));
3131 inc = fold_convert (sizetype, inc);
3133 else if (FRACT_MODE_P (TYPE_MODE (argtype)))
3135 /* For signed fract types, we invert ++ to -- or
3136 -- to ++, and change inc from 1 to -1, because
3137 it is not possible to represent 1 in signed fract constants.
3138 For unsigned fract types, the result always overflows and
3139 we get an undefined (original) or the maximum value. */
3140 if (code == PREINCREMENT_EXPR)
3141 code = PREDECREMENT_EXPR;
3142 else if (code == PREDECREMENT_EXPR)
3143 code = PREINCREMENT_EXPR;
3144 else if (code == POSTINCREMENT_EXPR)
3145 code = POSTDECREMENT_EXPR;
3146 else /* code == POSTDECREMENT_EXPR */
3147 code = POSTINCREMENT_EXPR;
3149 inc = integer_minus_one_node;
3150 inc = convert (argtype, inc);
3154 inc = integer_one_node;
3155 inc = convert (argtype, inc);
3158 /* Complain about anything else that is not a true lvalue. */
3159 if (!lvalue_or_else (arg, ((code == PREINCREMENT_EXPR
3160 || code == POSTINCREMENT_EXPR)
3163 return error_mark_node;
3165 /* Report a read-only lvalue. */
3166 if (TREE_READONLY (arg))
3168 readonly_error (arg,
3169 ((code == PREINCREMENT_EXPR
3170 || code == POSTINCREMENT_EXPR)
3171 ? lv_increment : lv_decrement));
3172 return error_mark_node;
3175 if (TREE_CODE (TREE_TYPE (arg)) == BOOLEAN_TYPE)
3176 val = boolean_increment (code, arg);
3178 val = build2 (code, TREE_TYPE (arg), arg, inc);
3179 TREE_SIDE_EFFECTS (val) = 1;
3180 if (TREE_CODE (val) != code)
3181 TREE_NO_WARNING (val) = 1;
3183 goto return_build_unary_op;
3187 /* Note that this operation never does default_conversion. */
3189 /* Let &* cancel out to simplify resulting code. */
3190 if (TREE_CODE (arg) == INDIRECT_REF)
3192 /* Don't let this be an lvalue. */
3193 if (lvalue_p (TREE_OPERAND (arg, 0)))
3194 return non_lvalue (TREE_OPERAND (arg, 0));
3195 ret = TREE_OPERAND (arg, 0);
3196 goto return_build_unary_op;
3199 /* For &x[y], return x+y */
3200 if (TREE_CODE (arg) == ARRAY_REF)
3202 tree op0 = TREE_OPERAND (arg, 0);
3203 if (!c_mark_addressable (op0))
3204 return error_mark_node;
3205 return build_binary_op (location, PLUS_EXPR,
3206 (TREE_CODE (TREE_TYPE (op0)) == ARRAY_TYPE
3207 ? array_to_pointer_conversion (op0)
3209 TREE_OPERAND (arg, 1), 1);
3212 /* Anything not already handled and not a true memory reference
3213 or a non-lvalue array is an error. */
3214 else if (typecode != FUNCTION_TYPE && !flag
3215 && !lvalue_or_else (arg, lv_addressof))
3216 return error_mark_node;
3218 /* Ordinary case; arg is a COMPONENT_REF or a decl. */
3219 argtype = TREE_TYPE (arg);
3221 /* If the lvalue is const or volatile, merge that into the type
3222 to which the address will point. Note that you can't get a
3223 restricted pointer by taking the address of something, so we
3224 only have to deal with `const' and `volatile' here. */
3225 if ((DECL_P (arg) || REFERENCE_CLASS_P (arg))
3226 && (TREE_READONLY (arg) || TREE_THIS_VOLATILE (arg)))
3227 argtype = c_build_type_variant (argtype,
3228 TREE_READONLY (arg),
3229 TREE_THIS_VOLATILE (arg));
3231 if (!c_mark_addressable (arg))
3232 return error_mark_node;
3234 gcc_assert (TREE_CODE (arg) != COMPONENT_REF
3235 || !DECL_C_BIT_FIELD (TREE_OPERAND (arg, 1)));
3237 argtype = build_pointer_type (argtype);
3239 /* ??? Cope with user tricks that amount to offsetof. Delete this
3240 when we have proper support for integer constant expressions. */
3241 val = get_base_address (arg);
3242 if (val && TREE_CODE (val) == INDIRECT_REF
3243 && TREE_CONSTANT (TREE_OPERAND (val, 0)))
3245 tree op0 = fold_convert (sizetype, fold_offsetof (arg, val)), op1;
3247 op1 = fold_convert (argtype, TREE_OPERAND (val, 0));
3248 ret = fold_build2 (POINTER_PLUS_EXPR, argtype, op1, op0);
3249 goto return_build_unary_op;
3252 val = build1 (ADDR_EXPR, argtype, arg);
3255 goto return_build_unary_op;
3262 argtype = TREE_TYPE (arg);
3263 ret = require_constant_value ? fold_build1_initializer (code, argtype, arg)
3264 : fold_build1 (code, argtype, arg);
3265 return_build_unary_op:
3266 gcc_assert (ret != error_mark_node);
3267 protected_set_expr_location (ret, location);
3271 /* Return nonzero if REF is an lvalue valid for this language.
3272 Lvalues can be assigned, unless their type has TYPE_READONLY.
3273 Lvalues can have their address taken, unless they have C_DECL_REGISTER. */
3276 lvalue_p (const_tree ref)
3278 const enum tree_code code = TREE_CODE (ref);
3285 return lvalue_p (TREE_OPERAND (ref, 0));
3287 case COMPOUND_LITERAL_EXPR:
3297 return (TREE_CODE (TREE_TYPE (ref)) != FUNCTION_TYPE
3298 && TREE_CODE (TREE_TYPE (ref)) != METHOD_TYPE);
3301 return TREE_CODE (TREE_TYPE (ref)) == ARRAY_TYPE;
3308 /* Give an error for storing in something that is 'const'. */
3311 readonly_error (tree arg, enum lvalue_use use)
3313 gcc_assert (use == lv_assign || use == lv_increment || use == lv_decrement
3315 /* Using this macro rather than (for example) arrays of messages
3316 ensures that all the format strings are checked at compile
3318 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
3319 : (use == lv_increment ? (I) \
3320 : (use == lv_decrement ? (D) : (AS))))
3321 if (TREE_CODE (arg) == COMPONENT_REF)
3323 if (TYPE_READONLY (TREE_TYPE (TREE_OPERAND (arg, 0))))
3324 readonly_error (TREE_OPERAND (arg, 0), use);
3326 error (READONLY_MSG (G_("assignment of read-only member %qD"),
3327 G_("increment of read-only member %qD"),
3328 G_("decrement of read-only member %qD"),
3329 G_("read-only member %qD used as %<asm%> output")),
3330 TREE_OPERAND (arg, 1));
3332 else if (TREE_CODE (arg) == VAR_DECL)
3333 error (READONLY_MSG (G_("assignment of read-only variable %qD"),
3334 G_("increment of read-only variable %qD"),
3335 G_("decrement of read-only variable %qD"),
3336 G_("read-only variable %qD used as %<asm%> output")),
3339 error (READONLY_MSG (G_("assignment of read-only location %qE"),
3340 G_("increment of read-only location %qE"),
3341 G_("decrement of read-only location %qE"),
3342 G_("read-only location %qE used as %<asm%> output")),
3347 /* Return nonzero if REF is an lvalue valid for this language;
3348 otherwise, print an error message and return zero. USE says
3349 how the lvalue is being used and so selects the error message. */
3352 lvalue_or_else (const_tree ref, enum lvalue_use use)
3354 int win = lvalue_p (ref);
3362 /* Mark EXP saying that we need to be able to take the
3363 address of it; it should not be allocated in a register.
3364 Returns true if successful. */
3367 c_mark_addressable (tree exp)
3372 switch (TREE_CODE (x))
3375 if (DECL_C_BIT_FIELD (TREE_OPERAND (x, 1)))
3378 ("cannot take address of bit-field %qD", TREE_OPERAND (x, 1));
3382 /* ... fall through ... */
3388 x = TREE_OPERAND (x, 0);
3391 case COMPOUND_LITERAL_EXPR:
3393 TREE_ADDRESSABLE (x) = 1;
3400 if (C_DECL_REGISTER (x)
3401 && DECL_NONLOCAL (x))
3403 if (TREE_PUBLIC (x) || TREE_STATIC (x) || DECL_EXTERNAL (x))
3406 ("global register variable %qD used in nested function", x);
3409 pedwarn (input_location, 0, "register variable %qD used in nested function", x);
3411 else if (C_DECL_REGISTER (x))
3413 if (TREE_PUBLIC (x) || TREE_STATIC (x) || DECL_EXTERNAL (x))
3414 error ("address of global register variable %qD requested", x);
3416 error ("address of register variable %qD requested", x);
3422 TREE_ADDRESSABLE (x) = 1;
3429 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
3432 build_conditional_expr (tree ifexp, tree op1, tree op2)
3436 enum tree_code code1;
3437 enum tree_code code2;
3438 tree result_type = NULL;
3439 tree orig_op1 = op1, orig_op2 = op2;
3442 /* Promote both alternatives. */
3444 if (TREE_CODE (TREE_TYPE (op1)) != VOID_TYPE)
3445 op1 = default_conversion (op1);
3446 if (TREE_CODE (TREE_TYPE (op2)) != VOID_TYPE)
3447 op2 = default_conversion (op2);
3449 if (TREE_CODE (ifexp) == ERROR_MARK
3450 || TREE_CODE (TREE_TYPE (op1)) == ERROR_MARK
3451 || TREE_CODE (TREE_TYPE (op2)) == ERROR_MARK)
3452 return error_mark_node;
3454 type1 = TREE_TYPE (op1);
3455 code1 = TREE_CODE (type1);
3456 type2 = TREE_TYPE (op2);
3457 code2 = TREE_CODE (type2);
3459 /* C90 does not permit non-lvalue arrays in conditional expressions.
3460 In C99 they will be pointers by now. */
3461 if (code1 == ARRAY_TYPE || code2 == ARRAY_TYPE)
3463 error ("non-lvalue array in conditional expression");
3464 return error_mark_node;
3467 objc_ok = objc_compare_types (type1, type2, -3, NULL_TREE);
3469 /* Quickly detect the usual case where op1 and op2 have the same type
3471 if (TYPE_MAIN_VARIANT (type1) == TYPE_MAIN_VARIANT (type2))
3474 result_type = type1;
3476 result_type = TYPE_MAIN_VARIANT (type1);
3478 else if ((code1 == INTEGER_TYPE || code1 == REAL_TYPE
3479 || code1 == COMPLEX_TYPE)
3480 && (code2 == INTEGER_TYPE || code2 == REAL_TYPE
3481 || code2 == COMPLEX_TYPE))
3483 result_type = c_common_type (type1, type2);
3485 /* If -Wsign-compare, warn here if type1 and type2 have
3486 different signedness. We'll promote the signed to unsigned
3487 and later code won't know it used to be different.
3488 Do this check on the original types, so that explicit casts
3489 will be considered, but default promotions won't. */
3490 if (warn_sign_compare && !skip_evaluation)
3492 int unsigned_op1 = TYPE_UNSIGNED (TREE_TYPE (orig_op1));
3493 int unsigned_op2 = TYPE_UNSIGNED (TREE_TYPE (orig_op2));
3495 if (unsigned_op1 ^ unsigned_op2)
3499 /* Do not warn if the result type is signed, since the
3500 signed type will only be chosen if it can represent
3501 all the values of the unsigned type. */
3502 if (!TYPE_UNSIGNED (result_type))
3504 /* Do not warn if the signed quantity is an unsuffixed
3505 integer literal (or some static constant expression
3506 involving such literals) and it is non-negative. */
3507 else if ((unsigned_op2
3508 && tree_expr_nonnegative_warnv_p (op1, &ovf))
3510 && tree_expr_nonnegative_warnv_p (op2, &ovf)))
3513 warning (OPT_Wsign_compare, "signed and unsigned type in conditional expression");
3517 else if (code1 == VOID_TYPE || code2 == VOID_TYPE)
3519 if (code1 != VOID_TYPE || code2 != VOID_TYPE)
3520 pedwarn (input_location, OPT_pedantic,
3521 "ISO C forbids conditional expr with only one void side");
3522 result_type = void_type_node;
3524 else if (code1 == POINTER_TYPE && code2 == POINTER_TYPE)
3526 if (comp_target_types (type1, type2))
3527 result_type = common_pointer_type (type1, type2);
3528 else if (null_pointer_constant_p (orig_op1))
3529 result_type = qualify_type (type2, type1);
3530 else if (null_pointer_constant_p (orig_op2))
3531 result_type = qualify_type (type1, type2);
3532 else if (VOID_TYPE_P (TREE_TYPE (type1)))
3534 if (TREE_CODE (TREE_TYPE (type2)) == FUNCTION_TYPE)
3535 pedwarn (input_location, OPT_pedantic,
3536 "ISO C forbids conditional expr between "
3537 "%<void *%> and function pointer");
3538 result_type = build_pointer_type (qualify_type (TREE_TYPE (type1),
3539 TREE_TYPE (type2)));
3541 else if (VOID_TYPE_P (TREE_TYPE (type2)))
3543 if (TREE_CODE (TREE_TYPE (type1)) == FUNCTION_TYPE)
3544 pedwarn (input_location, OPT_pedantic,
3545 "ISO C forbids conditional expr between "
3546 "%<void *%> and function pointer");
3547 result_type = build_pointer_type (qualify_type (TREE_TYPE (type2),
3548 TREE_TYPE (type1)));
3553 pedwarn (input_location, 0,
3554 "pointer type mismatch in conditional expression");
3555 result_type = build_pointer_type (void_type_node);
3558 else if (code1 == POINTER_TYPE && code2 == INTEGER_TYPE)
3560 if (!null_pointer_constant_p (orig_op2))
3561 pedwarn (input_location, 0,
3562 "pointer/integer type mismatch in conditional expression");
3565 op2 = null_pointer_node;
3567 result_type = type1;
3569 else if (code2 == POINTER_TYPE && code1 == INTEGER_TYPE)
3571 if (!null_pointer_constant_p (orig_op1))
3572 pedwarn (input_location, 0,
3573 "pointer/integer type mismatch in conditional expression");
3576 op1 = null_pointer_node;
3578 result_type = type2;
3583 if (flag_cond_mismatch)
3584 result_type = void_type_node;
3587 error ("type mismatch in conditional expression");
3588 return error_mark_node;
3592 /* Merge const and volatile flags of the incoming types. */
3594 = build_type_variant (result_type,
3595 TREE_READONLY (op1) || TREE_READONLY (op2),
3596 TREE_THIS_VOLATILE (op1) || TREE_THIS_VOLATILE (op2));
3598 if (result_type != TREE_TYPE (op1))
3599 op1 = convert_and_check (result_type, op1);
3600 if (result_type != TREE_TYPE (op2))
3601 op2 = convert_and_check (result_type, op2);
3603 return fold_build3 (COND_EXPR, result_type, ifexp, op1, op2);
3606 /* Return a compound expression that performs two expressions and
3607 returns the value of the second of them. */
3610 build_compound_expr (tree expr1, tree expr2)
3612 if (!TREE_SIDE_EFFECTS (expr1))
3614 /* The left-hand operand of a comma expression is like an expression
3615 statement: with -Wunused, we should warn if it doesn't have
3616 any side-effects, unless it was explicitly cast to (void). */
3617 if (warn_unused_value)
3619 if (VOID_TYPE_P (TREE_TYPE (expr1))
3620 && CONVERT_EXPR_P (expr1))
3622 else if (VOID_TYPE_P (TREE_TYPE (expr1))
3623 && TREE_CODE (expr1) == COMPOUND_EXPR
3624 && CONVERT_EXPR_P (TREE_OPERAND (expr1, 1)))
3625 ; /* (void) a, (void) b, c */
3627 warning (OPT_Wunused_value,
3628 "left-hand operand of comma expression has no effect");
3632 /* With -Wunused, we should also warn if the left-hand operand does have
3633 side-effects, but computes a value which is not used. For example, in
3634 `foo() + bar(), baz()' the result of the `+' operator is not used,
3635 so we should issue a warning. */
3636 else if (warn_unused_value)
3637 warn_if_unused_value (expr1, input_location);
3639 if (expr2 == error_mark_node)
3640 return error_mark_node;
3642 return build2 (COMPOUND_EXPR, TREE_TYPE (expr2), expr1, expr2);
3645 /* Build an expression representing a cast to type TYPE of expression EXPR. */
3648 build_c_cast (tree type, tree expr)
3652 if (type == error_mark_node || expr == error_mark_node)
3653 return error_mark_node;
3655 /* The ObjC front-end uses TYPE_MAIN_VARIANT to tie together types differing
3656 only in <protocol> qualifications. But when constructing cast expressions,
3657 the protocols do matter and must be kept around. */
3658 if (objc_is_object_ptr (type) && objc_is_object_ptr (TREE_TYPE (expr)))
3659 return build1 (NOP_EXPR, type, expr);
3661 type = TYPE_MAIN_VARIANT (type);
3663 if (TREE_CODE (type) == ARRAY_TYPE)
3665 error ("cast specifies array type");
3666 return error_mark_node;
3669 if (TREE_CODE (type) == FUNCTION_TYPE)
3671 error ("cast specifies function type");
3672 return error_mark_node;
3675 if (!VOID_TYPE_P (type))
3677 value = require_complete_type (value);
3678 if (value == error_mark_node)
3679 return error_mark_node;
3682 if (type == TYPE_MAIN_VARIANT (TREE_TYPE (value)))
3684 if (TREE_CODE (type) == RECORD_TYPE
3685 || TREE_CODE (type) == UNION_TYPE)
3686 pedwarn (input_location, OPT_pedantic,
3687 "ISO C forbids casting nonscalar to the same type");
3689 else if (TREE_CODE (type) == UNION_TYPE)
3693 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
3694 if (TREE_TYPE (field) != error_mark_node
3695 && comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (field)),
3696 TYPE_MAIN_VARIANT (TREE_TYPE (value))))
3703 pedwarn (input_location, OPT_pedantic,
3704 "ISO C forbids casts to union type");
3705 t = digest_init (type,
3706 build_constructor_single (type, field, value),
3708 TREE_CONSTANT (t) = TREE_CONSTANT (value);
3711 error ("cast to union type from type not present in union");
3712 return error_mark_node;
3718 if (type == void_type_node)
3719 return build1 (CONVERT_EXPR, type, value);
3721 otype = TREE_TYPE (value);
3723 /* Optionally warn about potentially worrisome casts. */
3726 && TREE_CODE (type) == POINTER_TYPE
3727 && TREE_CODE (otype) == POINTER_TYPE)
3729 tree in_type = type;
3730 tree in_otype = otype;
3734 /* Check that the qualifiers on IN_TYPE are a superset of
3735 the qualifiers of IN_OTYPE. The outermost level of
3736 POINTER_TYPE nodes is uninteresting and we stop as soon
3737 as we hit a non-POINTER_TYPE node on either type. */
3740 in_otype = TREE_TYPE (in_otype);
3741 in_type = TREE_TYPE (in_type);
3743 /* GNU C allows cv-qualified function types. 'const'
3744 means the function is very pure, 'volatile' means it
3745 can't return. We need to warn when such qualifiers
3746 are added, not when they're taken away. */
3747 if (TREE_CODE (in_otype) == FUNCTION_TYPE
3748 && TREE_CODE (in_type) == FUNCTION_TYPE)
3749 added |= (TYPE_QUALS (in_type) & ~TYPE_QUALS (in_otype));
3751 discarded |= (TYPE_QUALS (in_otype) & ~TYPE_QUALS (in_type));
3753 while (TREE_CODE (in_type) == POINTER_TYPE
3754 && TREE_CODE (in_otype) == POINTER_TYPE);
3757 warning (OPT_Wcast_qual, "cast adds new qualifiers to function type");
3760 /* There are qualifiers present in IN_OTYPE that are not
3761 present in IN_TYPE. */
3762 warning (OPT_Wcast_qual, "cast discards qualifiers from pointer target type");
3765 /* Warn about possible alignment problems. */
3766 if (STRICT_ALIGNMENT
3767 && TREE_CODE (type) == POINTER_TYPE
3768 && TREE_CODE (otype) == POINTER_TYPE
3769 && TREE_CODE (TREE_TYPE (otype)) != VOID_TYPE
3770 && TREE_CODE (TREE_TYPE (otype)) != FUNCTION_TYPE
3771 /* Don't warn about opaque types, where the actual alignment
3772 restriction is unknown. */
3773 && !((TREE_CODE (TREE_TYPE (otype)) == UNION_TYPE
3774 || TREE_CODE (TREE_TYPE (otype)) == RECORD_TYPE)
3775 && TYPE_MODE (TREE_TYPE (otype)) == VOIDmode)
3776 && TYPE_ALIGN (TREE_TYPE (type)) > TYPE_ALIGN (TREE_TYPE (otype)))
3777 warning (OPT_Wcast_align,
3778 "cast increases required alignment of target type");
3780 if (TREE_CODE (type) == INTEGER_TYPE
3781 && TREE_CODE (otype) == POINTER_TYPE
3782 && TYPE_PRECISION (type) != TYPE_PRECISION (otype))
3783 /* Unlike conversion of integers to pointers, where the
3784 warning is disabled for converting constants because
3785 of cases such as SIG_*, warn about converting constant
3786 pointers to integers. In some cases it may cause unwanted
3787 sign extension, and a warning is appropriate. */
3788 warning (OPT_Wpointer_to_int_cast,
3789 "cast from pointer to integer of different size");
3791 if (TREE_CODE (value) == CALL_EXPR
3792 && TREE_CODE (type) != TREE_CODE (otype))
3793 warning (OPT_Wbad_function_cast, "cast from function call of type %qT "
3794 "to non-matching type %qT", otype, type);
3796 if (TREE_CODE (type) == POINTER_TYPE
3797 && TREE_CODE (otype) == INTEGER_TYPE
3798 && TYPE_PRECISION (type) != TYPE_PRECISION (otype)
3799 /* Don't warn about converting any constant. */
3800 && !TREE_CONSTANT (value))
3801 warning (OPT_Wint_to_pointer_cast, "cast to pointer from integer "
3802 "of different size");
3804 if (warn_strict_aliasing <= 2)
3805 strict_aliasing_warning (otype, type, expr);
3807 /* If pedantic, warn for conversions between function and object
3808 pointer types, except for converting a null pointer constant
3809 to function pointer type. */
3811 && TREE_CODE (type) == POINTER_TYPE
3812 && TREE_CODE (otype) == POINTER_TYPE
3813 && TREE_CODE (TREE_TYPE (otype)) == FUNCTION_TYPE
3814 && TREE_CODE (TREE_TYPE (type)) != FUNCTION_TYPE)
3815 pedwarn (input_location, OPT_pedantic, "ISO C forbids "
3816 "conversion of function pointer to object pointer type");
3819 && TREE_CODE (type) == POINTER_TYPE
3820 && TREE_CODE (otype) == POINTER_TYPE
3821 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE
3822 && TREE_CODE (TREE_TYPE (otype)) != FUNCTION_TYPE
3823 && !null_pointer_constant_p (value))
3824 pedwarn (input_location, OPT_pedantic, "ISO C forbids "
3825 "conversion of object pointer to function pointer type");
3828 value = convert (type, value);
3830 /* Ignore any integer overflow caused by the cast. */
3831 if (TREE_CODE (value) == INTEGER_CST)
3833 if (CONSTANT_CLASS_P (ovalue) && TREE_OVERFLOW (ovalue))
3835 if (!TREE_OVERFLOW (value))
3837 /* Avoid clobbering a shared constant. */
3838 value = copy_node (value);
3839 TREE_OVERFLOW (value) = TREE_OVERFLOW (ovalue);
3842 else if (TREE_OVERFLOW (value))
3843 /* Reset VALUE's overflow flags, ensuring constant sharing. */
3844 value = build_int_cst_wide (TREE_TYPE (value),
3845 TREE_INT_CST_LOW (value),
3846 TREE_INT_CST_HIGH (value));
3850 /* Don't let a cast be an lvalue. */
3852 value = non_lvalue (value);
3857 /* Interpret a cast of expression EXPR to type TYPE. */
3859 c_cast_expr (struct c_type_name *type_name, tree expr)
3862 int saved_wsp = warn_strict_prototypes;
3864 /* This avoids warnings about unprototyped casts on
3865 integers. E.g. "#define SIG_DFL (void(*)())0". */
3866 if (TREE_CODE (expr) == INTEGER_CST)
3867 warn_strict_prototypes = 0;
3868 type = groktypename (type_name);
3869 warn_strict_prototypes = saved_wsp;
3871 return build_c_cast (type, expr);
3874 /* Build an assignment expression of lvalue LHS from value RHS.
3875 MODIFYCODE is the code for a binary operator that we use
3876 to combine the old value of LHS with RHS to get the new value.
3877 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
3879 LOCATION is the location of the MODIFYCODE operator. */
3882 build_modify_expr (location_t location,
3883 tree lhs, enum tree_code modifycode, tree rhs)
3887 tree lhstype = TREE_TYPE (lhs);
3888 tree olhstype = lhstype;
3890 /* Types that aren't fully specified cannot be used in assignments. */
3891 lhs = require_complete_type (lhs);
3893 /* Avoid duplicate error messages from operands that had errors. */
3894 if (TREE_CODE (lhs) == ERROR_MARK || TREE_CODE (rhs) == ERROR_MARK)
3895 return error_mark_node;
3897 if (!lvalue_or_else (lhs, lv_assign))
3898 return error_mark_node;
3900 STRIP_TYPE_NOPS (rhs);
3904 /* If a binary op has been requested, combine the old LHS value with the RHS
3905 producing the value we should actually store into the LHS. */
3907 if (modifycode != NOP_EXPR)
3909 lhs = stabilize_reference (lhs);
3910 newrhs = build_binary_op (location,
3911 modifycode, lhs, rhs, 1);
3914 /* Give an error for storing in something that is 'const'. */
3916 if (TREE_READONLY (lhs) || TYPE_READONLY (lhstype)
3917 || ((TREE_CODE (lhstype) == RECORD_TYPE
3918 || TREE_CODE (lhstype) == UNION_TYPE)
3919 && C_TYPE_FIELDS_READONLY (lhstype)))
3921 readonly_error (lhs, lv_assign);
3922 return error_mark_node;
3925 /* If storing into a structure or union member,
3926 it has probably been given type `int'.
3927 Compute the type that would go with
3928 the actual amount of storage the member occupies. */
3930 if (TREE_CODE (lhs) == COMPONENT_REF
3931 && (TREE_CODE (lhstype) == INTEGER_TYPE
3932 || TREE_CODE (lhstype) == BOOLEAN_TYPE
3933 || TREE_CODE (lhstype) == REAL_TYPE
3934 || TREE_CODE (lhstype) == ENUMERAL_TYPE))
3935 lhstype = TREE_TYPE (get_unwidened (lhs, 0));
3937 /* If storing in a field that is in actuality a short or narrower than one,
3938 we must store in the field in its actual type. */
3940 if (lhstype != TREE_TYPE (lhs))
3942 lhs = copy_node (lhs);
3943 TREE_TYPE (lhs) = lhstype;
3946 /* Convert new value to destination type. */
3948 newrhs = convert_for_assignment (lhstype, newrhs, ic_assign,
3949 NULL_TREE, NULL_TREE, 0);
3950 if (TREE_CODE (newrhs) == ERROR_MARK)
3951 return error_mark_node;
3953 /* Emit ObjC write barrier, if necessary. */
3954 if (c_dialect_objc () && flag_objc_gc)
3956 result = objc_generate_write_barrier (lhs, modifycode, newrhs);
3959 protected_set_expr_location (result, location);
3964 /* Scan operands. */
3966 result = build2 (MODIFY_EXPR, lhstype, lhs, newrhs);
3967 TREE_SIDE_EFFECTS (result) = 1;
3968 protected_set_expr_location (result, location);
3970 /* If we got the LHS in a different type for storing in,
3971 convert the result back to the nominal type of LHS
3972 so that the value we return always has the same type
3973 as the LHS argument. */
3975 if (olhstype == TREE_TYPE (result))
3978 result = convert_for_assignment (olhstype, result, ic_assign,
3979 NULL_TREE, NULL_TREE, 0);
3980 protected_set_expr_location (result, location);
3984 /* Convert value RHS to type TYPE as preparation for an assignment
3985 to an lvalue of type TYPE.
3986 The real work of conversion is done by `convert'.
3987 The purpose of this function is to generate error messages
3988 for assignments that are not allowed in C.
3989 ERRTYPE says whether it is argument passing, assignment,
3990 initialization or return.
3992 FUNCTION is a tree for the function being called.
3993 PARMNUM is the number of the argument, for printing in error messages. */
3996 convert_for_assignment (tree type, tree rhs, enum impl_conv errtype,
3997 tree fundecl, tree function, int parmnum)
3999 enum tree_code codel = TREE_CODE (type);
4001 enum tree_code coder;
4002 tree rname = NULL_TREE;
4003 bool objc_ok = false;
4005 if (errtype == ic_argpass)
4008 /* Change pointer to function to the function itself for
4010 if (TREE_CODE (function) == ADDR_EXPR
4011 && TREE_CODE (TREE_OPERAND (function, 0)) == FUNCTION_DECL)
4012 function = TREE_OPERAND (function, 0);
4014 /* Handle an ObjC selector specially for diagnostics. */
4015 selector = objc_message_selector ();
4017 if (selector && parmnum > 2)
4024 /* This macro is used to emit diagnostics to ensure that all format
4025 strings are complete sentences, visible to gettext and checked at
4027 #define WARN_FOR_ASSIGNMENT(LOCATION, OPT, AR, AS, IN, RE) \
4032 if (pedwarn (LOCATION, OPT, AR, parmnum, rname)) \
4033 inform ((fundecl && !DECL_IS_BUILTIN (fundecl)) \
4034 ? DECL_SOURCE_LOCATION (fundecl) : LOCATION, \
4035 "expected %qT but argument is of type %qT", \
4039 pedwarn (LOCATION, OPT, AS); \
4042 pedwarn (LOCATION, OPT, IN); \
4045 pedwarn (LOCATION, OPT, RE); \
4048 gcc_unreachable (); \
4052 STRIP_TYPE_NOPS (rhs);
4054 if (optimize && TREE_CODE (rhs) == VAR_DECL
4055 && TREE_CODE (TREE_TYPE (rhs)) != ARRAY_TYPE)
4056 rhs = decl_constant_value_for_broken_optimization (rhs);
4058 rhstype = TREE_TYPE (rhs);
4059 coder = TREE_CODE (rhstype);
4061 if (coder == ERROR_MARK)
4062 return error_mark_node;
4064 if (c_dialect_objc ())
4087 objc_ok = objc_compare_types (type, rhstype, parmno, rname);
4090 if (TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (rhstype))
4093 if (coder == VOID_TYPE)
4095 /* Except for passing an argument to an unprototyped function,
4096 this is a constraint violation. When passing an argument to
4097 an unprototyped function, it is compile-time undefined;
4098 making it a constraint in that case was rejected in
4100 error ("void value not ignored as it ought to be");
4101 return error_mark_node;
4103 rhs = require_complete_type (rhs);
4104 if (rhs == error_mark_node)
4105 return error_mark_node;
4106 /* A type converts to a reference to it.
4107 This code doesn't fully support references, it's just for the
4108 special case of va_start and va_copy. */
4109 if (codel == REFERENCE_TYPE
4110 && comptypes (TREE_TYPE (type), TREE_TYPE (rhs)) == 1)
4112 if (!lvalue_p (rhs))
4114 error ("cannot pass rvalue to reference parameter");
4115 return error_mark_node;
4117 if (!c_mark_addressable (rhs))
4118 return error_mark_node;
4119 rhs = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (rhs)), rhs);
4121 /* We already know that these two types are compatible, but they
4122 may not be exactly identical. In fact, `TREE_TYPE (type)' is
4123 likely to be __builtin_va_list and `TREE_TYPE (rhs)' is
4124 likely to be va_list, a typedef to __builtin_va_list, which
4125 is different enough that it will cause problems later. */
4126 if (TREE_TYPE (TREE_TYPE (rhs)) != TREE_TYPE (type))
4127 rhs = build1 (NOP_EXPR, build_pointer_type (TREE_TYPE (type)), rhs);
4129 rhs = build1 (NOP_EXPR, type, rhs);
4132 /* Some types can interconvert without explicit casts. */
4133 else if (codel == VECTOR_TYPE && coder == VECTOR_TYPE
4134 && vector_types_convertible_p (type, TREE_TYPE (rhs), true))
4135 return convert (type, rhs);
4136 /* Arithmetic types all interconvert, and enum is treated like int. */
4137 else if ((codel == INTEGER_TYPE || codel == REAL_TYPE
4138 || codel == FIXED_POINT_TYPE
4139 || codel == ENUMERAL_TYPE || codel == COMPLEX_TYPE
4140 || codel == BOOLEAN_TYPE)
4141 && (coder == INTEGER_TYPE || coder == REAL_TYPE
4142 || coder == FIXED_POINT_TYPE
4143 || coder == ENUMERAL_TYPE || coder == COMPLEX_TYPE
4144 || coder == BOOLEAN_TYPE))
4145 return convert_and_check (type, rhs);
4147 /* Aggregates in different TUs might need conversion. */
4148 if ((codel == RECORD_TYPE || codel == UNION_TYPE)
4150 && comptypes (type, rhstype))
4151 return convert_and_check (type, rhs);
4153 /* Conversion to a transparent union from its member types.
4154 This applies only to function arguments. */
4155 if (codel == UNION_TYPE && TYPE_TRANSPARENT_UNION (type)
4156 && errtype == ic_argpass)
4158 tree memb, marginal_memb = NULL_TREE;
4160 for (memb = TYPE_FIELDS (type); memb ; memb = TREE_CHAIN (memb))
4162 tree memb_type = TREE_TYPE (memb);
4164 if (comptypes (TYPE_MAIN_VARIANT (memb_type),
4165 TYPE_MAIN_VARIANT (rhstype)))
4168 if (TREE_CODE (memb_type) != POINTER_TYPE)
4171 if (coder == POINTER_TYPE)
4173 tree ttl = TREE_TYPE (memb_type);
4174 tree ttr = TREE_TYPE (rhstype);
4176 /* Any non-function converts to a [const][volatile] void *
4177 and vice versa; otherwise, targets must be the same.
4178 Meanwhile, the lhs target must have all the qualifiers of
4180 if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
4181 || comp_target_types (memb_type, rhstype))
4183 /* If this type won't generate any warnings, use it. */
4184 if (TYPE_QUALS (ttl) == TYPE_QUALS (ttr)
4185 || ((TREE_CODE (ttr) == FUNCTION_TYPE
4186 && TREE_CODE (ttl) == FUNCTION_TYPE)
4187 ? ((TYPE_QUALS (ttl) | TYPE_QUALS (ttr))
4188 == TYPE_QUALS (ttr))
4189 : ((TYPE_QUALS (ttl) | TYPE_QUALS (ttr))
4190 == TYPE_QUALS (ttl))))
4193 /* Keep looking for a better type, but remember this one. */
4195 marginal_memb = memb;
4199 /* Can convert integer zero to any pointer type. */
4200 if (null_pointer_constant_p (rhs))
4202 rhs = null_pointer_node;
4207 if (memb || marginal_memb)
4211 /* We have only a marginally acceptable member type;
4212 it needs a warning. */
4213 tree ttl = TREE_TYPE (TREE_TYPE (marginal_memb));
4214 tree ttr = TREE_TYPE (rhstype);
4216 /* Const and volatile mean something different for function
4217 types, so the usual warnings are not appropriate. */
4218 if (TREE_CODE (ttr) == FUNCTION_TYPE
4219 && TREE_CODE (ttl) == FUNCTION_TYPE)
4221 /* Because const and volatile on functions are
4222 restrictions that say the function will not do
4223 certain things, it is okay to use a const or volatile
4224 function where an ordinary one is wanted, but not
4226 if (TYPE_QUALS (ttl) & ~TYPE_QUALS (ttr))
4227 WARN_FOR_ASSIGNMENT (input_location, 0,
4228 G_("passing argument %d of %qE "
4229 "makes qualified function "
4230 "pointer from unqualified"),
4231 G_("assignment makes qualified "
4232 "function pointer from "
4234 G_("initialization makes qualified "
4235 "function pointer from "
4237 G_("return makes qualified function "
4238 "pointer from unqualified"));
4240 else if (TYPE_QUALS (ttr) & ~TYPE_QUALS (ttl))
4241 WARN_FOR_ASSIGNMENT (input_location, 0,
4242 G_("passing argument %d of %qE discards "
4243 "qualifiers from pointer target type"),
4244 G_("assignment discards qualifiers "
4245 "from pointer target type"),
4246 G_("initialization discards qualifiers "
4247 "from pointer target type"),
4248 G_("return discards qualifiers from "
4249 "pointer target type"));
4251 memb = marginal_memb;
4254 if (!fundecl || !DECL_IN_SYSTEM_HEADER (fundecl))
4255 pedwarn (input_location, OPT_pedantic,
4256 "ISO C prohibits argument conversion to union type");
4258 rhs = fold_convert (TREE_TYPE (memb), rhs);
4259 return build_constructor_single (type, memb, rhs);
4263 /* Conversions among pointers */
4264 else if ((codel == POINTER_TYPE || codel == REFERENCE_TYPE)
4265 && (coder == codel))
4267 tree ttl = TREE_TYPE (type);
4268 tree ttr = TREE_TYPE (rhstype);
4271 bool is_opaque_pointer;
4272 int target_cmp = 0; /* Cache comp_target_types () result. */
4274 if (TREE_CODE (mvl) != ARRAY_TYPE)
4275 mvl = TYPE_MAIN_VARIANT (mvl);
4276 if (TREE_CODE (mvr) != ARRAY_TYPE)
4277 mvr = TYPE_MAIN_VARIANT (mvr);
4278 /* Opaque pointers are treated like void pointers. */
4279 is_opaque_pointer = vector_targets_convertible_p (ttl, ttr);
4281 /* C++ does not allow the implicit conversion void* -> T*. However,
4282 for the purpose of reducing the number of false positives, we
4283 tolerate the special case of
4287 where NULL is typically defined in C to be '(void *) 0'. */
4288 if (VOID_TYPE_P (ttr) && rhs != null_pointer_node && !VOID_TYPE_P (ttl))
4289 warning (OPT_Wc___compat, "request for implicit conversion from "
4290 "%qT to %qT not permitted in C++", rhstype, type);
4292 /* Check if the right-hand side has a format attribute but the
4293 left-hand side doesn't. */
4294 if (warn_missing_format_attribute
4295 && check_missing_format_attribute (type, rhstype))
4300 warning (OPT_Wmissing_format_attribute,
4301 "argument %d of %qE might be "
4302 "a candidate for a format attribute",
4306 warning (OPT_Wmissing_format_attribute,
4307 "assignment left-hand side might be "
4308 "a candidate for a format attribute");
4311 warning (OPT_Wmissing_format_attribute,
4312 "initialization left-hand side might be "
4313 "a candidate for a format attribute");
4316 warning (OPT_Wmissing_format_attribute,
4317 "return type might be "
4318 "a candidate for a format attribute");
4325 /* Any non-function converts to a [const][volatile] void *
4326 and vice versa; otherwise, targets must be the same.
4327 Meanwhile, the lhs target must have all the qualifiers of the rhs. */
4328 if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
4329 || (target_cmp = comp_target_types (type, rhstype))
4330 || is_opaque_pointer
4331 || (c_common_unsigned_type (mvl)
4332 == c_common_unsigned_type (mvr)))
4335 && ((VOID_TYPE_P (ttl) && TREE_CODE (ttr) == FUNCTION_TYPE)
4338 && !null_pointer_constant_p (rhs)
4339 && TREE_CODE (ttl) == FUNCTION_TYPE)))
4340 WARN_FOR_ASSIGNMENT (input_location, OPT_pedantic,
4341 G_("ISO C forbids passing argument %d of "
4342 "%qE between function pointer "
4344 G_("ISO C forbids assignment between "
4345 "function pointer and %<void *%>"),
4346 G_("ISO C forbids initialization between "
4347 "function pointer and %<void *%>"),
4348 G_("ISO C forbids return between function "
4349 "pointer and %<void *%>"));
4350 /* Const and volatile mean something different for function types,
4351 so the usual warnings are not appropriate. */
4352 else if (TREE_CODE (ttr) != FUNCTION_TYPE
4353 && TREE_CODE (ttl) != FUNCTION_TYPE)
4355 if (TYPE_QUALS (ttr) & ~TYPE_QUALS (ttl))
4357 /* Types differing only by the presence of the 'volatile'
4358 qualifier are acceptable if the 'volatile' has been added
4359 in by the Objective-C EH machinery. */
4360 if (!objc_type_quals_match (ttl, ttr))
4361 WARN_FOR_ASSIGNMENT (input_location, 0,
4362 G_("passing argument %d of %qE discards "
4363 "qualifiers from pointer target type"),
4364 G_("assignment discards qualifiers "
4365 "from pointer target type"),
4366 G_("initialization discards qualifiers "
4367 "from pointer target type"),
4368 G_("return discards qualifiers from "
4369 "pointer target type"));
4371 /* If this is not a case of ignoring a mismatch in signedness,
4373 else if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
4376 /* If there is a mismatch, do warn. */
4377 else if (warn_pointer_sign)
4378 WARN_FOR_ASSIGNMENT (input_location, OPT_Wpointer_sign,
4379 G_("pointer targets in passing argument "
4380 "%d of %qE differ in signedness"),
4381 G_("pointer targets in assignment "
4382 "differ in signedness"),
4383 G_("pointer targets in initialization "
4384 "differ in signedness"),
4385 G_("pointer targets in return differ "
4388 else if (TREE_CODE (ttl) == FUNCTION_TYPE
4389 && TREE_CODE (ttr) == FUNCTION_TYPE)
4391 /* Because const and volatile on functions are restrictions
4392 that say the function will not do certain things,
4393 it is okay to use a const or volatile function
4394 where an ordinary one is wanted, but not vice-versa. */
4395 if (TYPE_QUALS (ttl) & ~TYPE_QUALS (ttr))
4396 WARN_FOR_ASSIGNMENT (input_location, 0,
4397 G_("passing argument %d of %qE makes "
4398 "qualified function pointer "
4399 "from unqualified"),
4400 G_("assignment makes qualified function "
4401 "pointer from unqualified"),
4402 G_("initialization makes qualified "
4403 "function pointer from unqualified"),
4404 G_("return makes qualified function "
4405 "pointer from unqualified"));
4409 /* Avoid warning about the volatile ObjC EH puts on decls. */
4411 WARN_FOR_ASSIGNMENT (input_location, 0,
4412 G_("passing argument %d of %qE from "
4413 "incompatible pointer type"),
4414 G_("assignment from incompatible pointer type"),
4415 G_("initialization from incompatible "
4417 G_("return from incompatible pointer type"));
4419 return convert (type, rhs);
4421 else if (codel == POINTER_TYPE && coder == ARRAY_TYPE)
4423 /* ??? This should not be an error when inlining calls to
4424 unprototyped functions. */
4425 error ("invalid use of non-lvalue array");
4426 return error_mark_node;
4428 else if (codel == POINTER_TYPE && coder == INTEGER_TYPE)
4430 /* An explicit constant 0 can convert to a pointer,
4431 or one that results from arithmetic, even including
4432 a cast to integer type. */
4433 if (!null_pointer_constant_p (rhs))
4434 WARN_FOR_ASSIGNMENT (input_location, 0,
4435 G_("passing argument %d of %qE makes "
4436 "pointer from integer without a cast"),
4437 G_("assignment makes pointer from integer "
4439 G_("initialization makes pointer from "
4440 "integer without a cast"),
4441 G_("return makes pointer from integer "
4444 return convert (type, rhs);
4446 else if (codel == INTEGER_TYPE && coder == POINTER_TYPE)
4448 WARN_FOR_ASSIGNMENT (input_location, 0,
4449 G_("passing argument %d of %qE makes integer "
4450 "from pointer without a cast"),
4451 G_("assignment makes integer from pointer "
4453 G_("initialization makes integer from pointer "
4455 G_("return makes integer from pointer "
4457 return convert (type, rhs);
4459 else if (codel == BOOLEAN_TYPE && coder == POINTER_TYPE)
4460 return convert (type, rhs);
4465 error ("incompatible type for argument %d of %qE", parmnum, rname);
4466 inform ((fundecl && !DECL_IS_BUILTIN (fundecl))
4467 ? DECL_SOURCE_LOCATION (fundecl) : input_location,
4468 "expected %qT but argument is of type %qT", type, rhstype);
4471 error ("incompatible types when assigning to type %qT from type %qT",
4475 error ("incompatible types when initializing type %qT using type %qT",
4479 error ("incompatible types when returning type %qT but %qT was expected",
4486 return error_mark_node;
4489 /* If VALUE is a compound expr all of whose expressions are constant, then
4490 return its value. Otherwise, return error_mark_node.
4492 This is for handling COMPOUND_EXPRs as initializer elements
4493 which is allowed with a warning when -pedantic is specified. */
4496 valid_compound_expr_initializer (tree value, tree endtype)
4498 if (TREE_CODE (value) == COMPOUND_EXPR)
4500 if (valid_compound_expr_initializer (TREE_OPERAND (value, 0), endtype)
4502 return error_mark_node;
4503 return valid_compound_expr_initializer (TREE_OPERAND (value, 1),
4506 else if (!initializer_constant_valid_p (value, endtype))
4507 return error_mark_node;
4512 /* Perform appropriate conversions on the initial value of a variable,
4513 store it in the declaration DECL,
4514 and print any error messages that are appropriate.
4515 If the init is invalid, store an ERROR_MARK. */
4518 store_init_value (tree decl, tree init)
4522 /* If variable's type was invalidly declared, just ignore it. */
4524 type = TREE_TYPE (decl);
4525 if (TREE_CODE (type) == ERROR_MARK)
4528 /* Digest the specified initializer into an expression. */
4530 value = digest_init (type, init, true, TREE_STATIC (decl));
4532 /* Store the expression if valid; else report error. */
4534 if (!in_system_header
4535 && AGGREGATE_TYPE_P (TREE_TYPE (decl)) && !TREE_STATIC (decl))
4536 warning (OPT_Wtraditional, "traditional C rejects automatic "
4537 "aggregate initialization");
4539 DECL_INITIAL (decl) = value;
4541 /* ANSI wants warnings about out-of-range constant initializers. */
4542 STRIP_TYPE_NOPS (value);
4543 if (TREE_STATIC (decl))
4544 constant_expression_warning (value);
4546 /* Check if we need to set array size from compound literal size. */
4547 if (TREE_CODE (type) == ARRAY_TYPE
4548 && TYPE_DOMAIN (type) == 0
4549 && value != error_mark_node)
4551 tree inside_init = init;
4553 STRIP_TYPE_NOPS (inside_init);
4554 inside_init = fold (inside_init);
4556 if (TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
4558 tree cldecl = COMPOUND_LITERAL_EXPR_DECL (inside_init);
4560 if (TYPE_DOMAIN (TREE_TYPE (cldecl)))
4562 /* For int foo[] = (int [3]){1}; we need to set array size
4563 now since later on array initializer will be just the
4564 brace enclosed list of the compound literal. */
4565 type = build_distinct_type_copy (TYPE_MAIN_VARIANT (type));
4566 TREE_TYPE (decl) = type;
4567 TYPE_DOMAIN (type) = TYPE_DOMAIN (TREE_TYPE (cldecl));
4569 layout_decl (cldecl, 0);
4575 /* Methods for storing and printing names for error messages. */
4577 /* Implement a spelling stack that allows components of a name to be pushed
4578 and popped. Each element on the stack is this structure. */
4585 unsigned HOST_WIDE_INT i;
4590 #define SPELLING_STRING 1
4591 #define SPELLING_MEMBER 2
4592 #define SPELLING_BOUNDS 3
4594 static struct spelling *spelling; /* Next stack element (unused). */
4595 static struct spelling *spelling_base; /* Spelling stack base. */
4596 static int spelling_size; /* Size of the spelling stack. */
4598 /* Macros to save and restore the spelling stack around push_... functions.
4599 Alternative to SAVE_SPELLING_STACK. */
4601 #define SPELLING_DEPTH() (spelling - spelling_base)
4602 #define RESTORE_SPELLING_DEPTH(DEPTH) (spelling = spelling_base + (DEPTH))
4604 /* Push an element on the spelling stack with type KIND and assign VALUE
4607 #define PUSH_SPELLING(KIND, VALUE, MEMBER) \
4609 int depth = SPELLING_DEPTH (); \
4611 if (depth >= spelling_size) \
4613 spelling_size += 10; \
4614 spelling_base = XRESIZEVEC (struct spelling, spelling_base, \
4616 RESTORE_SPELLING_DEPTH (depth); \
4619 spelling->kind = (KIND); \
4620 spelling->MEMBER = (VALUE); \
4624 /* Push STRING on the stack. Printed literally. */
4627 push_string (const char *string)
4629 PUSH_SPELLING (SPELLING_STRING, string, u.s);
4632 /* Push a member name on the stack. Printed as '.' STRING. */
4635 push_member_name (tree decl)
4637 const char *const string
4638 = DECL_NAME (decl) ? IDENTIFIER_POINTER (DECL_NAME (decl)) : "<anonymous>";
4639 PUSH_SPELLING (SPELLING_MEMBER, string, u.s);
4642 /* Push an array bounds on the stack. Printed as [BOUNDS]. */
4645 push_array_bounds (unsigned HOST_WIDE_INT bounds)
4647 PUSH_SPELLING (SPELLING_BOUNDS, bounds, u.i);
4650 /* Compute the maximum size in bytes of the printed spelling. */
4653 spelling_length (void)
4658 for (p = spelling_base; p < spelling; p++)
4660 if (p->kind == SPELLING_BOUNDS)
4663 size += strlen (p->u.s) + 1;
4669 /* Print the spelling to BUFFER and return it. */
4672 print_spelling (char *buffer)
4677 for (p = spelling_base; p < spelling; p++)
4678 if (p->kind == SPELLING_BOUNDS)
4680 sprintf (d, "[" HOST_WIDE_INT_PRINT_UNSIGNED "]", p->u.i);
4686 if (p->kind == SPELLING_MEMBER)
4688 for (s = p->u.s; (*d = *s++); d++)
4695 /* Issue an error message for a bad initializer component.
4696 MSGID identifies the message.
4697 The component name is taken from the spelling stack. */
4700 error_init (const char *msgid)
4704 error ("%s", _(msgid));
4705 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4707 error ("(near initialization for %qs)", ofwhat);
4710 /* Issue a pedantic warning for a bad initializer component. OPT is
4711 the option OPT_* (from options.h) controlling this warning or 0 if
4712 it is unconditionally given. MSGID identifies the message. The
4713 component name is taken from the spelling stack. */
4716 pedwarn_init (location_t location, int opt, const char *msgid)
4720 pedwarn (location, opt, "%s", _(msgid));
4721 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4723 pedwarn (location, opt, "(near initialization for %qs)", ofwhat);
4726 /* Issue a warning for a bad initializer component.
4728 OPT is the OPT_W* value corresponding to the warning option that
4729 controls this warning. MSGID identifies the message. The
4730 component name is taken from the spelling stack. */
4733 warning_init (int opt, const char *msgid)
4737 warning (opt, "%s", _(msgid));
4738 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4740 warning (opt, "(near initialization for %qs)", ofwhat);
4743 /* If TYPE is an array type and EXPR is a parenthesized string
4744 constant, warn if pedantic that EXPR is being used to initialize an
4745 object of type TYPE. */
4748 maybe_warn_string_init (tree type, struct c_expr expr)
4751 && TREE_CODE (type) == ARRAY_TYPE
4752 && TREE_CODE (expr.value) == STRING_CST
4753 && expr.original_code != STRING_CST)
4754 pedwarn_init (input_location, OPT_pedantic,
4755 "array initialized from parenthesized string constant");
4758 /* Digest the parser output INIT as an initializer for type TYPE.
4759 Return a C expression of type TYPE to represent the initial value.
4761 If INIT is a string constant, STRICT_STRING is true if it is
4762 unparenthesized or we should not warn here for it being parenthesized.
4763 For other types of INIT, STRICT_STRING is not used.
4765 REQUIRE_CONSTANT requests an error if non-constant initializers or
4766 elements are seen. */
4769 digest_init (tree type, tree init, bool strict_string, int require_constant)
4771 enum tree_code code = TREE_CODE (type);
4772 tree inside_init = init;
4774 if (type == error_mark_node
4776 || init == error_mark_node
4777 || TREE_TYPE (init) == error_mark_node)
4778 return error_mark_node;
4780 STRIP_TYPE_NOPS (inside_init);
4782 inside_init = fold (inside_init);
4784 /* Initialization of an array of chars from a string constant
4785 optionally enclosed in braces. */
4787 if (code == ARRAY_TYPE && inside_init
4788 && TREE_CODE (inside_init) == STRING_CST)
4790 tree typ1 = TYPE_MAIN_VARIANT (TREE_TYPE (type));
4791 /* Note that an array could be both an array of character type
4792 and an array of wchar_t if wchar_t is signed char or unsigned
4794 bool char_array = (typ1 == char_type_node
4795 || typ1 == signed_char_type_node
4796 || typ1 == unsigned_char_type_node);
4797 bool wchar_array = !!comptypes (typ1, wchar_type_node);
4798 bool char16_array = !!comptypes (typ1, char16_type_node);
4799 bool char32_array = !!comptypes (typ1, char32_type_node);
4801 if (char_array || wchar_array || char16_array || char32_array)
4804 tree typ2 = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (inside_init)));
4805 expr.value = inside_init;
4806 expr.original_code = (strict_string ? STRING_CST : ERROR_MARK);
4807 maybe_warn_string_init (type, expr);
4809 if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
4810 TYPE_MAIN_VARIANT (type)))
4815 if (typ2 != char_type_node)
4817 error_init ("char-array initialized from wide string");
4818 return error_mark_node;
4823 if (typ2 == char_type_node)
4825 error_init ("wide character array initialized from non-wide "
4827 return error_mark_node;
4829 else if (!comptypes(typ1, typ2))
4831 error_init ("wide character array initialized from "
4832 "incompatible wide string");
4833 return error_mark_node;
4837 TREE_TYPE (inside_init) = type;
4838 if (TYPE_DOMAIN (type) != 0
4839 && TYPE_SIZE (type) != 0
4840 && TREE_CODE (TYPE_SIZE (type)) == INTEGER_CST
4841 /* Subtract the size of a single (possibly wide) character
4842 because it's ok to ignore the terminating null char
4843 that is counted in the length of the constant. */
4844 && 0 > compare_tree_int (TYPE_SIZE_UNIT (type),
4845 TREE_STRING_LENGTH (inside_init)
4846 - (TYPE_PRECISION (typ1)
4848 pedwarn_init (input_location, 0,
4849 "initializer-string for array of chars is too long");
4853 else if (INTEGRAL_TYPE_P (typ1))
4855 error_init ("array of inappropriate type initialized "
4856 "from string constant");
4857 return error_mark_node;
4861 /* Build a VECTOR_CST from a *constant* vector constructor. If the
4862 vector constructor is not constant (e.g. {1,2,3,foo()}) then punt
4863 below and handle as a constructor. */
4864 if (code == VECTOR_TYPE
4865 && TREE_CODE (TREE_TYPE (inside_init)) == VECTOR_TYPE
4866 && vector_types_convertible_p (TREE_TYPE (inside_init), type, true)
4867 && TREE_CONSTANT (inside_init))
4869 if (TREE_CODE (inside_init) == VECTOR_CST
4870 && comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
4871 TYPE_MAIN_VARIANT (type)))
4874 if (TREE_CODE (inside_init) == CONSTRUCTOR)
4876 unsigned HOST_WIDE_INT ix;
4878 bool constant_p = true;
4880 /* Iterate through elements and check if all constructor
4881 elements are *_CSTs. */
4882 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (inside_init), ix, value)
4883 if (!CONSTANT_CLASS_P (value))
4890 return build_vector_from_ctor (type,
4891 CONSTRUCTOR_ELTS (inside_init));
4895 if (warn_sequence_point)
4896 verify_sequence_points (inside_init);
4898 /* Any type can be initialized
4899 from an expression of the same type, optionally with braces. */
4901 if (inside_init && TREE_TYPE (inside_init) != 0
4902 && (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
4903 TYPE_MAIN_VARIANT (type))
4904 || (code == ARRAY_TYPE
4905 && comptypes (TREE_TYPE (inside_init), type))
4906 || (code == VECTOR_TYPE
4907 && comptypes (TREE_TYPE (inside_init), type))
4908 || (code == POINTER_TYPE
4909 && TREE_CODE (TREE_TYPE (inside_init)) == ARRAY_TYPE
4910 && comptypes (TREE_TYPE (TREE_TYPE (inside_init)),
4911 TREE_TYPE (type)))))
4913 if (code == POINTER_TYPE)
4915 if (TREE_CODE (TREE_TYPE (inside_init)) == ARRAY_TYPE)
4917 if (TREE_CODE (inside_init) == STRING_CST
4918 || TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
4919 inside_init = array_to_pointer_conversion (inside_init);
4922 error_init ("invalid use of non-lvalue array");
4923 return error_mark_node;
4928 if (code == VECTOR_TYPE)
4929 /* Although the types are compatible, we may require a
4931 inside_init = convert (type, inside_init);
4933 if (require_constant
4934 && (code == VECTOR_TYPE || !flag_isoc99)
4935 && TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
4937 /* As an extension, allow initializing objects with static storage
4938 duration with compound literals (which are then treated just as
4939 the brace enclosed list they contain). Also allow this for
4940 vectors, as we can only assign them with compound literals. */
4941 tree decl = COMPOUND_LITERAL_EXPR_DECL (inside_init);
4942 inside_init = DECL_INITIAL (decl);
4945 if (code == ARRAY_TYPE && TREE_CODE (inside_init) != STRING_CST
4946 && TREE_CODE (inside_init) != CONSTRUCTOR)
4948 error_init ("array initialized from non-constant array expression");
4949 return error_mark_node;
4952 if (optimize && TREE_CODE (inside_init) == VAR_DECL)
4953 inside_init = decl_constant_value_for_broken_optimization (inside_init);
4955 /* Compound expressions can only occur here if -pedantic or
4956 -pedantic-errors is specified. In the later case, we always want
4957 an error. In the former case, we simply want a warning. */
4958 if (require_constant && pedantic
4959 && TREE_CODE (inside_init) == COMPOUND_EXPR)
4962 = valid_compound_expr_initializer (inside_init,
4963 TREE_TYPE (inside_init));
4964 if (inside_init == error_mark_node)
4965 error_init ("initializer element is not constant");
4967 pedwarn_init (input_location, OPT_pedantic,
4968 "initializer element is not constant");
4969 if (flag_pedantic_errors)
4970 inside_init = error_mark_node;
4972 else if (require_constant
4973 && !initializer_constant_valid_p (inside_init,
4974 TREE_TYPE (inside_init)))
4976 error_init ("initializer element is not constant");
4977 inside_init = error_mark_node;
4980 /* Added to enable additional -Wmissing-format-attribute warnings. */
4981 if (TREE_CODE (TREE_TYPE (inside_init)) == POINTER_TYPE)
4982 inside_init = convert_for_assignment (type, inside_init, ic_init, NULL_TREE,
4987 /* Handle scalar types, including conversions. */
4989 if (code == INTEGER_TYPE || code == REAL_TYPE || code == FIXED_POINT_TYPE
4990 || code == POINTER_TYPE || code == ENUMERAL_TYPE || code == BOOLEAN_TYPE
4991 || code == COMPLEX_TYPE || code == VECTOR_TYPE)
4993 if (TREE_CODE (TREE_TYPE (init)) == ARRAY_TYPE
4994 && (TREE_CODE (init) == STRING_CST
4995 || TREE_CODE (init) == COMPOUND_LITERAL_EXPR))
4996 init = array_to_pointer_conversion (init);
4998 = convert_for_assignment (type, init, ic_init,
4999 NULL_TREE, NULL_TREE, 0);
5001 /* Check to see if we have already given an error message. */
5002 if (inside_init == error_mark_node)
5004 else if (require_constant && !TREE_CONSTANT (inside_init))
5006 error_init ("initializer element is not constant");
5007 inside_init = error_mark_node;
5009 else if (require_constant
5010 && !initializer_constant_valid_p (inside_init,
5011 TREE_TYPE (inside_init)))
5013 error_init ("initializer element is not computable at load time");
5014 inside_init = error_mark_node;
5020 /* Come here only for records and arrays. */
5022 if (COMPLETE_TYPE_P (type) && TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST)
5024 error_init ("variable-sized object may not be initialized");
5025 return error_mark_node;
5028 error_init ("invalid initializer");
5029 return error_mark_node;
5032 /* Handle initializers that use braces. */
5034 /* Type of object we are accumulating a constructor for.
5035 This type is always a RECORD_TYPE, UNION_TYPE or ARRAY_TYPE. */
5036 static tree constructor_type;
5038 /* For a RECORD_TYPE or UNION_TYPE, this is the chain of fields
5040 static tree constructor_fields;
5042 /* For an ARRAY_TYPE, this is the specified index
5043 at which to store the next element we get. */
5044 static tree constructor_index;
5046 /* For an ARRAY_TYPE, this is the maximum index. */
5047 static tree constructor_max_index;
5049 /* For a RECORD_TYPE, this is the first field not yet written out. */
5050 static tree constructor_unfilled_fields;
5052 /* For an ARRAY_TYPE, this is the index of the first element
5053 not yet written out. */
5054 static tree constructor_unfilled_index;
5056 /* In a RECORD_TYPE, the byte index of the next consecutive field.
5057 This is so we can generate gaps between fields, when appropriate. */
5058 static tree constructor_bit_index;
5060 /* If we are saving up the elements rather than allocating them,
5061 this is the list of elements so far (in reverse order,
5062 most recent first). */
5063 static VEC(constructor_elt,gc) *constructor_elements;
5065 /* 1 if constructor should be incrementally stored into a constructor chain,
5066 0 if all the elements should be kept in AVL tree. */
5067 static int constructor_incremental;
5069 /* 1 if so far this constructor's elements are all compile-time constants. */
5070 static int constructor_constant;
5072 /* 1 if so far this constructor's elements are all valid address constants. */
5073 static int constructor_simple;
5075 /* 1 if this constructor is erroneous so far. */
5076 static int constructor_erroneous;
5078 /* Structure for managing pending initializer elements, organized as an
5083 struct init_node *left, *right;
5084 struct init_node *parent;
5090 /* Tree of pending elements at this constructor level.
5091 These are elements encountered out of order
5092 which belong at places we haven't reached yet in actually
5094 Will never hold tree nodes across GC runs. */
5095 static struct init_node *constructor_pending_elts;
5097 /* The SPELLING_DEPTH of this constructor. */
5098 static int constructor_depth;
5100 /* DECL node for which an initializer is being read.
5101 0 means we are reading a constructor expression
5102 such as (struct foo) {...}. */
5103 static tree constructor_decl;
5105 /* Nonzero if this is an initializer for a top-level decl. */
5106 static int constructor_top_level;
5108 /* Nonzero if there were any member designators in this initializer. */
5109 static int constructor_designated;
5111 /* Nesting depth of designator list. */
5112 static int designator_depth;
5114 /* Nonzero if there were diagnosed errors in this designator list. */
5115 static int designator_erroneous;
5118 /* This stack has a level for each implicit or explicit level of
5119 structuring in the initializer, including the outermost one. It
5120 saves the values of most of the variables above. */
5122 struct constructor_range_stack;
5124 struct constructor_stack
5126 struct constructor_stack *next;
5131 tree unfilled_index;
5132 tree unfilled_fields;
5134 VEC(constructor_elt,gc) *elements;
5135 struct init_node *pending_elts;
5138 /* If value nonzero, this value should replace the entire
5139 constructor at this level. */
5140 struct c_expr replacement_value;
5141 struct constructor_range_stack *range_stack;
5151 static struct constructor_stack *constructor_stack;
5153 /* This stack represents designators from some range designator up to
5154 the last designator in the list. */
5156 struct constructor_range_stack
5158 struct constructor_range_stack *next, *prev;
5159 struct constructor_stack *stack;
5166 static struct constructor_range_stack *constructor_range_stack;
5168 /* This stack records separate initializers that are nested.
5169 Nested initializers can't happen in ANSI C, but GNU C allows them
5170 in cases like { ... (struct foo) { ... } ... }. */
5172 struct initializer_stack
5174 struct initializer_stack *next;
5176 struct constructor_stack *constructor_stack;
5177 struct constructor_range_stack *constructor_range_stack;
5178 VEC(constructor_elt,gc) *elements;
5179 struct spelling *spelling;
5180 struct spelling *spelling_base;
5183 char require_constant_value;
5184 char require_constant_elements;
5187 static struct initializer_stack *initializer_stack;
5189 /* Prepare to parse and output the initializer for variable DECL. */
5192 start_init (tree decl, tree asmspec_tree ATTRIBUTE_UNUSED, int top_level)
5195 struct initializer_stack *p = XNEW (struct initializer_stack);
5197 p->decl = constructor_decl;
5198 p->require_constant_value = require_constant_value;
5199 p->require_constant_elements = require_constant_elements;
5200 p->constructor_stack = constructor_stack;
5201 p->constructor_range_stack = constructor_range_stack;
5202 p->elements = constructor_elements;
5203 p->spelling = spelling;
5204 p->spelling_base = spelling_base;
5205 p->spelling_size = spelling_size;
5206 p->top_level = constructor_top_level;
5207 p->next = initializer_stack;
5208 initializer_stack = p;
5210 constructor_decl = decl;
5211 constructor_designated = 0;
5212 constructor_top_level = top_level;
5214 if (decl != 0 && decl != error_mark_node)
5216 require_constant_value = TREE_STATIC (decl);
5217 require_constant_elements
5218 = ((TREE_STATIC (decl) || (pedantic && !flag_isoc99))
5219 /* For a scalar, you can always use any value to initialize,
5220 even within braces. */
5221 && (TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE
5222 || TREE_CODE (TREE_TYPE (decl)) == RECORD_TYPE
5223 || TREE_CODE (TREE_TYPE (decl)) == UNION_TYPE
5224 || TREE_CODE (TREE_TYPE (decl)) == QUAL_UNION_TYPE));
5225 locus = IDENTIFIER_POINTER (DECL_NAME (decl));
5229 require_constant_value = 0;
5230 require_constant_elements = 0;
5231 locus = "(anonymous)";
5234 constructor_stack = 0;
5235 constructor_range_stack = 0;
5237 missing_braces_mentioned = 0;
5241 RESTORE_SPELLING_DEPTH (0);
5244 push_string (locus);
5250 struct initializer_stack *p = initializer_stack;
5252 /* Free the whole constructor stack of this initializer. */
5253 while (constructor_stack)
5255 struct constructor_stack *q = constructor_stack;
5256 constructor_stack = q->next;
5260 gcc_assert (!constructor_range_stack);
5262 /* Pop back to the data of the outer initializer (if any). */
5263 free (spelling_base);
5265 constructor_decl = p->decl;
5266 require_constant_value = p->require_constant_value;
5267 require_constant_elements = p->require_constant_elements;
5268 constructor_stack = p->constructor_stack;
5269 constructor_range_stack = p->constructor_range_stack;
5270 constructor_elements = p->elements;
5271 spelling = p->spelling;
5272 spelling_base = p->spelling_base;
5273 spelling_size = p->spelling_size;
5274 constructor_top_level = p->top_level;
5275 initializer_stack = p->next;
5279 /* Call here when we see the initializer is surrounded by braces.
5280 This is instead of a call to push_init_level;
5281 it is matched by a call to pop_init_level.
5283 TYPE is the type to initialize, for a constructor expression.
5284 For an initializer for a decl, TYPE is zero. */
5287 really_start_incremental_init (tree type)
5289 struct constructor_stack *p = XNEW (struct constructor_stack);
5292 type = TREE_TYPE (constructor_decl);
5294 if (targetm.vector_opaque_p (type))
5295 error ("opaque vector types cannot be initialized");
5297 p->type = constructor_type;
5298 p->fields = constructor_fields;
5299 p->index = constructor_index;
5300 p->max_index = constructor_max_index;
5301 p->unfilled_index = constructor_unfilled_index;
5302 p->unfilled_fields = constructor_unfilled_fields;
5303 p->bit_index = constructor_bit_index;
5304 p->elements = constructor_elements;
5305 p->constant = constructor_constant;
5306 p->simple = constructor_simple;
5307 p->erroneous = constructor_erroneous;
5308 p->pending_elts = constructor_pending_elts;
5309 p->depth = constructor_depth;
5310 p->replacement_value.value = 0;
5311 p->replacement_value.original_code = ERROR_MARK;
5315 p->incremental = constructor_incremental;
5316 p->designated = constructor_designated;
5318 constructor_stack = p;
5320 constructor_constant = 1;
5321 constructor_simple = 1;
5322 constructor_depth = SPELLING_DEPTH ();
5323 constructor_elements = 0;
5324 constructor_pending_elts = 0;
5325 constructor_type = type;
5326 constructor_incremental = 1;
5327 constructor_designated = 0;
5328 designator_depth = 0;
5329 designator_erroneous = 0;
5331 if (TREE_CODE (constructor_type) == RECORD_TYPE
5332 || TREE_CODE (constructor_type) == UNION_TYPE)
5334 constructor_fields = TYPE_FIELDS (constructor_type);
5335 /* Skip any nameless bit fields at the beginning. */
5336 while (constructor_fields != 0 && DECL_C_BIT_FIELD (constructor_fields)
5337 && DECL_NAME (constructor_fields) == 0)
5338 constructor_fields = TREE_CHAIN (constructor_fields);
5340 constructor_unfilled_fields = constructor_fields;
5341 constructor_bit_index = bitsize_zero_node;
5343 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5345 if (TYPE_DOMAIN (constructor_type))
5347 constructor_max_index
5348 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type));
5350 /* Detect non-empty initializations of zero-length arrays. */
5351 if (constructor_max_index == NULL_TREE
5352 && TYPE_SIZE (constructor_type))
5353 constructor_max_index = build_int_cst (NULL_TREE, -1);
5355 /* constructor_max_index needs to be an INTEGER_CST. Attempts
5356 to initialize VLAs will cause a proper error; avoid tree
5357 checking errors as well by setting a safe value. */
5358 if (constructor_max_index
5359 && TREE_CODE (constructor_max_index) != INTEGER_CST)
5360 constructor_max_index = build_int_cst (NULL_TREE, -1);
5363 = convert (bitsizetype,
5364 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
5368 constructor_index = bitsize_zero_node;
5369 constructor_max_index = NULL_TREE;
5372 constructor_unfilled_index = constructor_index;
5374 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
5376 /* Vectors are like simple fixed-size arrays. */
5377 constructor_max_index =
5378 build_int_cst (NULL_TREE, TYPE_VECTOR_SUBPARTS (constructor_type) - 1);
5379 constructor_index = bitsize_zero_node;
5380 constructor_unfilled_index = constructor_index;
5384 /* Handle the case of int x = {5}; */
5385 constructor_fields = constructor_type;
5386 constructor_unfilled_fields = constructor_type;
5390 /* Push down into a subobject, for initialization.
5391 If this is for an explicit set of braces, IMPLICIT is 0.
5392 If it is because the next element belongs at a lower level,
5393 IMPLICIT is 1 (or 2 if the push is because of designator list). */
5396 push_init_level (int implicit)
5398 struct constructor_stack *p;
5399 tree value = NULL_TREE;
5401 /* If we've exhausted any levels that didn't have braces,
5402 pop them now. If implicit == 1, this will have been done in
5403 process_init_element; do not repeat it here because in the case
5404 of excess initializers for an empty aggregate this leads to an
5405 infinite cycle of popping a level and immediately recreating
5409 while (constructor_stack->implicit)
5411 if ((TREE_CODE (constructor_type) == RECORD_TYPE
5412 || TREE_CODE (constructor_type) == UNION_TYPE)
5413 && constructor_fields == 0)
5414 process_init_element (pop_init_level (1), true);
5415 else if (TREE_CODE (constructor_type) == ARRAY_TYPE
5416 && constructor_max_index
5417 && tree_int_cst_lt (constructor_max_index,
5419 process_init_element (pop_init_level (1), true);
5425 /* Unless this is an explicit brace, we need to preserve previous
5429 if ((TREE_CODE (constructor_type) == RECORD_TYPE
5430 || TREE_CODE (constructor_type) == UNION_TYPE)
5431 && constructor_fields)
5432 value = find_init_member (constructor_fields);
5433 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5434 value = find_init_member (constructor_index);
5437 p = XNEW (struct constructor_stack);
5438 p->type = constructor_type;
5439 p->fields = constructor_fields;
5440 p->index = constructor_index;
5441 p->max_index = constructor_max_index;
5442 p->unfilled_index = constructor_unfilled_index;
5443 p->unfilled_fields = constructor_unfilled_fields;
5444 p->bit_index = constructor_bit_index;
5445 p->elements = constructor_elements;
5446 p->constant = constructor_constant;
5447 p->simple = constructor_simple;
5448 p->erroneous = constructor_erroneous;
5449 p->pending_elts = constructor_pending_elts;
5450 p->depth = constructor_depth;
5451 p->replacement_value.value = 0;
5452 p->replacement_value.original_code = ERROR_MARK;
5453 p->implicit = implicit;
5455 p->incremental = constructor_incremental;
5456 p->designated = constructor_designated;
5457 p->next = constructor_stack;
5459 constructor_stack = p;
5461 constructor_constant = 1;
5462 constructor_simple = 1;
5463 constructor_depth = SPELLING_DEPTH ();
5464 constructor_elements = 0;
5465 constructor_incremental = 1;
5466 constructor_designated = 0;
5467 constructor_pending_elts = 0;
5470 p->range_stack = constructor_range_stack;
5471 constructor_range_stack = 0;
5472 designator_depth = 0;
5473 designator_erroneous = 0;
5476 /* Don't die if an entire brace-pair level is superfluous
5477 in the containing level. */
5478 if (constructor_type == 0)
5480 else if (TREE_CODE (constructor_type) == RECORD_TYPE
5481 || TREE_CODE (constructor_type) == UNION_TYPE)
5483 /* Don't die if there are extra init elts at the end. */
5484 if (constructor_fields == 0)
5485 constructor_type = 0;
5488 constructor_type = TREE_TYPE (constructor_fields);
5489 push_member_name (constructor_fields);
5490 constructor_depth++;
5493 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5495 constructor_type = TREE_TYPE (constructor_type);
5496 push_array_bounds (tree_low_cst (constructor_index, 1));
5497 constructor_depth++;
5500 if (constructor_type == 0)
5502 error_init ("extra brace group at end of initializer");
5503 constructor_fields = 0;
5504 constructor_unfilled_fields = 0;
5508 if (value && TREE_CODE (value) == CONSTRUCTOR)
5510 constructor_constant = TREE_CONSTANT (value);
5511 constructor_simple = TREE_STATIC (value);
5512 constructor_elements = CONSTRUCTOR_ELTS (value);
5513 if (!VEC_empty (constructor_elt, constructor_elements)
5514 && (TREE_CODE (constructor_type) == RECORD_TYPE
5515 || TREE_CODE (constructor_type) == ARRAY_TYPE))
5516 set_nonincremental_init ();
5519 if (implicit == 1 && warn_missing_braces && !missing_braces_mentioned)
5521 missing_braces_mentioned = 1;
5522 warning_init (OPT_Wmissing_braces, "missing braces around initializer");
5525 if (TREE_CODE (constructor_type) == RECORD_TYPE
5526 || TREE_CODE (constructor_type) == UNION_TYPE)
5528 constructor_fields = TYPE_FIELDS (constructor_type);
5529 /* Skip any nameless bit fields at the beginning. */
5530 while (constructor_fields != 0 && DECL_C_BIT_FIELD (constructor_fields)
5531 && DECL_NAME (constructor_fields) == 0)
5532 constructor_fields = TREE_CHAIN (constructor_fields);
5534 constructor_unfilled_fields = constructor_fields;
5535 constructor_bit_index = bitsize_zero_node;
5537 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
5539 /* Vectors are like simple fixed-size arrays. */
5540 constructor_max_index =
5541 build_int_cst (NULL_TREE, TYPE_VECTOR_SUBPARTS (constructor_type) - 1);
5542 constructor_index = convert (bitsizetype, integer_zero_node);
5543 constructor_unfilled_index = constructor_index;
5545 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5547 if (TYPE_DOMAIN (constructor_type))
5549 constructor_max_index
5550 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type));
5552 /* Detect non-empty initializations of zero-length arrays. */
5553 if (constructor_max_index == NULL_TREE
5554 && TYPE_SIZE (constructor_type))
5555 constructor_max_index = build_int_cst (NULL_TREE, -1);
5557 /* constructor_max_index needs to be an INTEGER_CST. Attempts
5558 to initialize VLAs will cause a proper error; avoid tree
5559 checking errors as well by setting a safe value. */
5560 if (constructor_max_index
5561 && TREE_CODE (constructor_max_index) != INTEGER_CST)
5562 constructor_max_index = build_int_cst (NULL_TREE, -1);
5565 = convert (bitsizetype,
5566 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
5569 constructor_index = bitsize_zero_node;
5571 constructor_unfilled_index = constructor_index;
5572 if (value && TREE_CODE (value) == STRING_CST)
5574 /* We need to split the char/wchar array into individual
5575 characters, so that we don't have to special case it
5577 set_nonincremental_init_from_string (value);
5582 if (constructor_type != error_mark_node)
5583 warning_init (0, "braces around scalar initializer");
5584 constructor_fields = constructor_type;
5585 constructor_unfilled_fields = constructor_type;
5589 /* At the end of an implicit or explicit brace level,
5590 finish up that level of constructor. If a single expression
5591 with redundant braces initialized that level, return the
5592 c_expr structure for that expression. Otherwise, the original_code
5593 element is set to ERROR_MARK.
5594 If we were outputting the elements as they are read, return 0 as the value
5595 from inner levels (process_init_element ignores that),
5596 but return error_mark_node as the value from the outermost level
5597 (that's what we want to put in DECL_INITIAL).
5598 Otherwise, return a CONSTRUCTOR expression as the value. */
5601 pop_init_level (int implicit)
5603 struct constructor_stack *p;
5606 ret.original_code = ERROR_MARK;
5610 /* When we come to an explicit close brace,
5611 pop any inner levels that didn't have explicit braces. */
5612 while (constructor_stack->implicit)
5613 process_init_element (pop_init_level (1), true);
5615 gcc_assert (!constructor_range_stack);
5618 /* Now output all pending elements. */
5619 constructor_incremental = 1;
5620 output_pending_init_elements (1);
5622 p = constructor_stack;
5624 /* Error for initializing a flexible array member, or a zero-length
5625 array member in an inappropriate context. */
5626 if (constructor_type && constructor_fields
5627 && TREE_CODE (constructor_type) == ARRAY_TYPE
5628 && TYPE_DOMAIN (constructor_type)
5629 && !TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type)))
5631 /* Silently discard empty initializations. The parser will
5632 already have pedwarned for empty brackets. */
5633 if (integer_zerop (constructor_unfilled_index))
5634 constructor_type = NULL_TREE;
5637 gcc_assert (!TYPE_SIZE (constructor_type));
5639 if (constructor_depth > 2)
5640 error_init ("initialization of flexible array member in a nested context");
5642 pedwarn_init (input_location, OPT_pedantic,
5643 "initialization of a flexible array member");
5645 /* We have already issued an error message for the existence
5646 of a flexible array member not at the end of the structure.
5647 Discard the initializer so that we do not die later. */
5648 if (TREE_CHAIN (constructor_fields) != NULL_TREE)
5649 constructor_type = NULL_TREE;
5653 /* Warn when some struct elements are implicitly initialized to zero. */
5654 if (warn_missing_field_initializers
5656 && TREE_CODE (constructor_type) == RECORD_TYPE
5657 && constructor_unfilled_fields)
5659 /* Do not warn for flexible array members or zero-length arrays. */
5660 while (constructor_unfilled_fields
5661 && (!DECL_SIZE (constructor_unfilled_fields)
5662 || integer_zerop (DECL_SIZE (constructor_unfilled_fields))))
5663 constructor_unfilled_fields = TREE_CHAIN (constructor_unfilled_fields);
5665 /* Do not warn if this level of the initializer uses member
5666 designators; it is likely to be deliberate. */
5667 if (constructor_unfilled_fields && !constructor_designated)
5669 push_member_name (constructor_unfilled_fields);
5670 warning_init (OPT_Wmissing_field_initializers,
5671 "missing initializer");
5672 RESTORE_SPELLING_DEPTH (constructor_depth);
5676 /* Pad out the end of the structure. */
5677 if (p->replacement_value.value)
5678 /* If this closes a superfluous brace pair,
5679 just pass out the element between them. */
5680 ret = p->replacement_value;
5681 else if (constructor_type == 0)
5683 else if (TREE_CODE (constructor_type) != RECORD_TYPE
5684 && TREE_CODE (constructor_type) != UNION_TYPE
5685 && TREE_CODE (constructor_type) != ARRAY_TYPE
5686 && TREE_CODE (constructor_type) != VECTOR_TYPE)
5688 /* A nonincremental scalar initializer--just return
5689 the element, after verifying there is just one. */
5690 if (VEC_empty (constructor_elt,constructor_elements))
5692 if (!constructor_erroneous)
5693 error_init ("empty scalar initializer");
5694 ret.value = error_mark_node;
5696 else if (VEC_length (constructor_elt,constructor_elements) != 1)
5698 error_init ("extra elements in scalar initializer");
5699 ret.value = VEC_index (constructor_elt,constructor_elements,0)->value;
5702 ret.value = VEC_index (constructor_elt,constructor_elements,0)->value;
5706 if (constructor_erroneous)
5707 ret.value = error_mark_node;
5710 ret.value = build_constructor (constructor_type,
5711 constructor_elements);
5712 if (constructor_constant)
5713 TREE_CONSTANT (ret.value) = 1;
5714 if (constructor_constant && constructor_simple)
5715 TREE_STATIC (ret.value) = 1;
5719 constructor_type = p->type;
5720 constructor_fields = p->fields;
5721 constructor_index = p->index;
5722 constructor_max_index = p->max_index;
5723 constructor_unfilled_index = p->unfilled_index;
5724 constructor_unfilled_fields = p->unfilled_fields;
5725 constructor_bit_index = p->bit_index;
5726 constructor_elements = p->elements;
5727 constructor_constant = p->constant;
5728 constructor_simple = p->simple;
5729 constructor_erroneous = p->erroneous;
5730 constructor_incremental = p->incremental;
5731 constructor_designated = p->designated;
5732 constructor_pending_elts = p->pending_elts;
5733 constructor_depth = p->depth;
5735 constructor_range_stack = p->range_stack;
5736 RESTORE_SPELLING_DEPTH (constructor_depth);
5738 constructor_stack = p->next;
5741 if (ret.value == 0 && constructor_stack == 0)
5742 ret.value = error_mark_node;
5746 /* Common handling for both array range and field name designators.
5747 ARRAY argument is nonzero for array ranges. Returns zero for success. */
5750 set_designator (int array)
5753 enum tree_code subcode;
5755 /* Don't die if an entire brace-pair level is superfluous
5756 in the containing level. */
5757 if (constructor_type == 0)
5760 /* If there were errors in this designator list already, bail out
5762 if (designator_erroneous)
5765 if (!designator_depth)
5767 gcc_assert (!constructor_range_stack);
5769 /* Designator list starts at the level of closest explicit
5771 while (constructor_stack->implicit)
5772 process_init_element (pop_init_level (1), true);
5773 constructor_designated = 1;
5777 switch (TREE_CODE (constructor_type))
5781 subtype = TREE_TYPE (constructor_fields);
5782 if (subtype != error_mark_node)
5783 subtype = TYPE_MAIN_VARIANT (subtype);
5786 subtype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
5792 subcode = TREE_CODE (subtype);
5793 if (array && subcode != ARRAY_TYPE)
5795 error_init ("array index in non-array initializer");
5798 else if (!array && subcode != RECORD_TYPE && subcode != UNION_TYPE)
5800 error_init ("field name not in record or union initializer");
5804 constructor_designated = 1;
5805 push_init_level (2);
5809 /* If there are range designators in designator list, push a new designator
5810 to constructor_range_stack. RANGE_END is end of such stack range or
5811 NULL_TREE if there is no range designator at this level. */
5814 push_range_stack (tree range_end)
5816 struct constructor_range_stack *p;
5818 p = GGC_NEW (struct constructor_range_stack);
5819 p->prev = constructor_range_stack;
5821 p->fields = constructor_fields;
5822 p->range_start = constructor_index;
5823 p->index = constructor_index;
5824 p->stack = constructor_stack;
5825 p->range_end = range_end;
5826 if (constructor_range_stack)
5827 constructor_range_stack->next = p;
5828 constructor_range_stack = p;
5831 /* Within an array initializer, specify the next index to be initialized.
5832 FIRST is that index. If LAST is nonzero, then initialize a range
5833 of indices, running from FIRST through LAST. */
5836 set_init_index (tree first, tree last)
5838 if (set_designator (1))
5841 designator_erroneous = 1;
5843 if (!INTEGRAL_TYPE_P (TREE_TYPE (first))
5844 || (last && !INTEGRAL_TYPE_P (TREE_TYPE (last))))
5846 error_init ("array index in initializer not of integer type");
5850 if (TREE_CODE (first) != INTEGER_CST)
5851 error_init ("nonconstant array index in initializer");
5852 else if (last != 0 && TREE_CODE (last) != INTEGER_CST)
5853 error_init ("nonconstant array index in initializer");
5854 else if (TREE_CODE (constructor_type) != ARRAY_TYPE)
5855 error_init ("array index in non-array initializer");
5856 else if (tree_int_cst_sgn (first) == -1)
5857 error_init ("array index in initializer exceeds array bounds");
5858 else if (constructor_max_index
5859 && tree_int_cst_lt (constructor_max_index, first))
5860 error_init ("array index in initializer exceeds array bounds");
5863 constructor_index = convert (bitsizetype, first);
5867 if (tree_int_cst_equal (first, last))
5869 else if (tree_int_cst_lt (last, first))
5871 error_init ("empty index range in initializer");
5876 last = convert (bitsizetype, last);
5877 if (constructor_max_index != 0
5878 && tree_int_cst_lt (constructor_max_index, last))
5880 error_init ("array index range in initializer exceeds array bounds");
5887 designator_erroneous = 0;
5888 if (constructor_range_stack || last)
5889 push_range_stack (last);
5893 /* Within a struct initializer, specify the next field to be initialized. */
5896 set_init_label (tree fieldname)
5900 if (set_designator (0))
5903 designator_erroneous = 1;
5905 if (TREE_CODE (constructor_type) != RECORD_TYPE
5906 && TREE_CODE (constructor_type) != UNION_TYPE)
5908 error_init ("field name not in record or union initializer");
5912 for (tail = TYPE_FIELDS (constructor_type); tail;
5913 tail = TREE_CHAIN (tail))
5915 if (DECL_NAME (tail) == fieldname)
5920 error ("unknown field %qE specified in initializer", fieldname);
5923 constructor_fields = tail;
5925 designator_erroneous = 0;
5926 if (constructor_range_stack)
5927 push_range_stack (NULL_TREE);
5931 /* Add a new initializer to the tree of pending initializers. PURPOSE
5932 identifies the initializer, either array index or field in a structure.
5933 VALUE is the value of that index or field.
5935 IMPLICIT is true if value comes from pop_init_level (1),
5936 the new initializer has been merged with the existing one
5937 and thus no warnings should be emitted about overriding an
5938 existing initializer. */
5941 add_pending_init (tree purpose, tree value, bool implicit)
5943 struct init_node *p, **q, *r;
5945 q = &constructor_pending_elts;
5948 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5953 if (tree_int_cst_lt (purpose, p->purpose))
5955 else if (tree_int_cst_lt (p->purpose, purpose))
5961 if (TREE_SIDE_EFFECTS (p->value))
5962 warning_init (0, "initialized field with side-effects overwritten");
5963 else if (warn_override_init)
5964 warning_init (OPT_Woverride_init, "initialized field overwritten");
5975 bitpos = bit_position (purpose);
5979 if (tree_int_cst_lt (bitpos, bit_position (p->purpose)))
5981 else if (p->purpose != purpose)
5987 if (TREE_SIDE_EFFECTS (p->value))
5988 warning_init (0, "initialized field with side-effects overwritten");
5989 else if (warn_override_init)
5990 warning_init (OPT_Woverride_init, "initialized field overwritten");
5998 r = GGC_NEW (struct init_node);
5999 r->purpose = purpose;
6010 struct init_node *s;
6014 if (p->balance == 0)
6016 else if (p->balance < 0)
6023 p->left->parent = p;
6040 constructor_pending_elts = r;
6045 struct init_node *t = r->right;
6049 r->right->parent = r;
6054 p->left->parent = p;
6057 p->balance = t->balance < 0;
6058 r->balance = -(t->balance > 0);
6073 constructor_pending_elts = t;
6079 /* p->balance == +1; growth of left side balances the node. */
6084 else /* r == p->right */
6086 if (p->balance == 0)
6087 /* Growth propagation from right side. */
6089 else if (p->balance > 0)
6096 p->right->parent = p;
6113 constructor_pending_elts = r;
6115 else /* r->balance == -1 */
6118 struct init_node *t = r->left;
6122 r->left->parent = r;
6127 p->right->parent = p;
6130 r->balance = (t->balance < 0);
6131 p->balance = -(t->balance > 0);
6146 constructor_pending_elts = t;
6152 /* p->balance == -1; growth of right side balances the node. */
6163 /* Build AVL tree from a sorted chain. */
6166 set_nonincremental_init (void)
6168 unsigned HOST_WIDE_INT ix;
6171 if (TREE_CODE (constructor_type) != RECORD_TYPE
6172 && TREE_CODE (constructor_type) != ARRAY_TYPE)
6175 FOR_EACH_CONSTRUCTOR_ELT (constructor_elements, ix, index, value)
6176 add_pending_init (index, value, false);
6177 constructor_elements = 0;
6178 if (TREE_CODE (constructor_type) == RECORD_TYPE)
6180 constructor_unfilled_fields = TYPE_FIELDS (constructor_type);
6181 /* Skip any nameless bit fields at the beginning. */
6182 while (constructor_unfilled_fields != 0
6183 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
6184 && DECL_NAME (constructor_unfilled_fields) == 0)
6185 constructor_unfilled_fields = TREE_CHAIN (constructor_unfilled_fields);
6188 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6190 if (TYPE_DOMAIN (constructor_type))
6191 constructor_unfilled_index
6192 = convert (bitsizetype,
6193 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
6195 constructor_unfilled_index = bitsize_zero_node;
6197 constructor_incremental = 0;
6200 /* Build AVL tree from a string constant. */
6203 set_nonincremental_init_from_string (tree str)
6205 tree value, purpose, type;
6206 HOST_WIDE_INT val[2];
6207 const char *p, *end;
6208 int byte, wchar_bytes, charwidth, bitpos;
6210 gcc_assert (TREE_CODE (constructor_type) == ARRAY_TYPE);
6212 wchar_bytes = TYPE_PRECISION (TREE_TYPE (TREE_TYPE (str))) / BITS_PER_UNIT;
6213 charwidth = TYPE_PRECISION (char_type_node);
6214 type = TREE_TYPE (constructor_type);
6215 p = TREE_STRING_POINTER (str);
6216 end = p + TREE_STRING_LENGTH (str);
6218 for (purpose = bitsize_zero_node;
6219 p < end && !tree_int_cst_lt (constructor_max_index, purpose);
6220 purpose = size_binop (PLUS_EXPR, purpose, bitsize_one_node))
6222 if (wchar_bytes == 1)
6224 val[1] = (unsigned char) *p++;
6231 for (byte = 0; byte < wchar_bytes; byte++)
6233 if (BYTES_BIG_ENDIAN)
6234 bitpos = (wchar_bytes - byte - 1) * charwidth;
6236 bitpos = byte * charwidth;
6237 val[bitpos < HOST_BITS_PER_WIDE_INT]
6238 |= ((unsigned HOST_WIDE_INT) ((unsigned char) *p++))
6239 << (bitpos % HOST_BITS_PER_WIDE_INT);
6243 if (!TYPE_UNSIGNED (type))
6245 bitpos = ((wchar_bytes - 1) * charwidth) + HOST_BITS_PER_CHAR;
6246 if (bitpos < HOST_BITS_PER_WIDE_INT)
6248 if (val[1] & (((HOST_WIDE_INT) 1) << (bitpos - 1)))
6250 val[1] |= ((HOST_WIDE_INT) -1) << bitpos;
6254 else if (bitpos == HOST_BITS_PER_WIDE_INT)
6259 else if (val[0] & (((HOST_WIDE_INT) 1)
6260 << (bitpos - 1 - HOST_BITS_PER_WIDE_INT)))
6261 val[0] |= ((HOST_WIDE_INT) -1)
6262 << (bitpos - HOST_BITS_PER_WIDE_INT);
6265 value = build_int_cst_wide (type, val[1], val[0]);
6266 add_pending_init (purpose, value, false);
6269 constructor_incremental = 0;
6272 /* Return value of FIELD in pending initializer or zero if the field was
6273 not initialized yet. */
6276 find_init_member (tree field)
6278 struct init_node *p;
6280 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6282 if (constructor_incremental
6283 && tree_int_cst_lt (field, constructor_unfilled_index))
6284 set_nonincremental_init ();
6286 p = constructor_pending_elts;
6289 if (tree_int_cst_lt (field, p->purpose))
6291 else if (tree_int_cst_lt (p->purpose, field))
6297 else if (TREE_CODE (constructor_type) == RECORD_TYPE)
6299 tree bitpos = bit_position (field);
6301 if (constructor_incremental
6302 && (!constructor_unfilled_fields
6303 || tree_int_cst_lt (bitpos,
6304 bit_position (constructor_unfilled_fields))))
6305 set_nonincremental_init ();
6307 p = constructor_pending_elts;
6310 if (field == p->purpose)
6312 else if (tree_int_cst_lt (bitpos, bit_position (p->purpose)))
6318 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6320 if (!VEC_empty (constructor_elt, constructor_elements)
6321 && (VEC_last (constructor_elt, constructor_elements)->index
6323 return VEC_last (constructor_elt, constructor_elements)->value;
6328 /* "Output" the next constructor element.
6329 At top level, really output it to assembler code now.
6330 Otherwise, collect it in a list from which we will make a CONSTRUCTOR.
6331 TYPE is the data type that the containing data type wants here.
6332 FIELD is the field (a FIELD_DECL) or the index that this element fills.
6333 If VALUE is a string constant, STRICT_STRING is true if it is
6334 unparenthesized or we should not warn here for it being parenthesized.
6335 For other types of VALUE, STRICT_STRING is not used.
6337 PENDING if non-nil means output pending elements that belong
6338 right after this element. (PENDING is normally 1;
6339 it is 0 while outputting pending elements, to avoid recursion.)
6341 IMPLICIT is true if value comes from pop_init_level (1),
6342 the new initializer has been merged with the existing one
6343 and thus no warnings should be emitted about overriding an
6344 existing initializer. */
6347 output_init_element (tree value, bool strict_string, tree type, tree field,
6348 int pending, bool implicit)
6350 constructor_elt *celt;
6352 if (type == error_mark_node || value == error_mark_node)
6354 constructor_erroneous = 1;
6357 if (TREE_CODE (TREE_TYPE (value)) == ARRAY_TYPE
6358 && (TREE_CODE (value) == STRING_CST
6359 || TREE_CODE (value) == COMPOUND_LITERAL_EXPR)
6360 && !(TREE_CODE (value) == STRING_CST
6361 && TREE_CODE (type) == ARRAY_TYPE
6362 && INTEGRAL_TYPE_P (TREE_TYPE (type)))
6363 && !comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (value)),
6364 TYPE_MAIN_VARIANT (type)))
6365 value = array_to_pointer_conversion (value);
6367 if (TREE_CODE (value) == COMPOUND_LITERAL_EXPR
6368 && require_constant_value && !flag_isoc99 && pending)
6370 /* As an extension, allow initializing objects with static storage
6371 duration with compound literals (which are then treated just as
6372 the brace enclosed list they contain). */
6373 tree decl = COMPOUND_LITERAL_EXPR_DECL (value);
6374 value = DECL_INITIAL (decl);
6377 if (value == error_mark_node)
6378 constructor_erroneous = 1;
6379 else if (!TREE_CONSTANT (value))
6380 constructor_constant = 0;
6381 else if (!initializer_constant_valid_p (value, TREE_TYPE (value))
6382 || ((TREE_CODE (constructor_type) == RECORD_TYPE
6383 || TREE_CODE (constructor_type) == UNION_TYPE)
6384 && DECL_C_BIT_FIELD (field)
6385 && TREE_CODE (value) != INTEGER_CST))
6386 constructor_simple = 0;
6388 if (!initializer_constant_valid_p (value, TREE_TYPE (value)))
6390 if (require_constant_value)
6392 error_init ("initializer element is not constant");
6393 value = error_mark_node;
6395 else if (require_constant_elements)
6396 pedwarn (input_location, 0,
6397 "initializer element is not computable at load time");
6400 /* If this field is empty (and not at the end of structure),
6401 don't do anything other than checking the initializer. */
6403 && (TREE_TYPE (field) == error_mark_node
6404 || (COMPLETE_TYPE_P (TREE_TYPE (field))
6405 && integer_zerop (TYPE_SIZE (TREE_TYPE (field)))
6406 && (TREE_CODE (constructor_type) == ARRAY_TYPE
6407 || TREE_CHAIN (field)))))
6410 value = digest_init (type, value, strict_string, require_constant_value);
6411 if (value == error_mark_node)
6413 constructor_erroneous = 1;
6417 /* If this element doesn't come next in sequence,
6418 put it on constructor_pending_elts. */
6419 if (TREE_CODE (constructor_type) == ARRAY_TYPE
6420 && (!constructor_incremental
6421 || !tree_int_cst_equal (field, constructor_unfilled_index)))
6423 if (constructor_incremental
6424 && tree_int_cst_lt (field, constructor_unfilled_index))
6425 set_nonincremental_init ();
6427 add_pending_init (field, value, implicit);
6430 else if (TREE_CODE (constructor_type) == RECORD_TYPE
6431 && (!constructor_incremental
6432 || field != constructor_unfilled_fields))
6434 /* We do this for records but not for unions. In a union,
6435 no matter which field is specified, it can be initialized
6436 right away since it starts at the beginning of the union. */
6437 if (constructor_incremental)
6439 if (!constructor_unfilled_fields)
6440 set_nonincremental_init ();
6443 tree bitpos, unfillpos;
6445 bitpos = bit_position (field);
6446 unfillpos = bit_position (constructor_unfilled_fields);
6448 if (tree_int_cst_lt (bitpos, unfillpos))
6449 set_nonincremental_init ();
6453 add_pending_init (field, value, implicit);
6456 else if (TREE_CODE (constructor_type) == UNION_TYPE
6457 && !VEC_empty (constructor_elt, constructor_elements))
6461 if (TREE_SIDE_EFFECTS (VEC_last (constructor_elt,
6462 constructor_elements)->value))
6464 "initialized field with side-effects overwritten");
6465 else if (warn_override_init)
6466 warning_init (OPT_Woverride_init, "initialized field overwritten");
6469 /* We can have just one union field set. */
6470 constructor_elements = 0;
6473 /* Otherwise, output this element either to
6474 constructor_elements or to the assembler file. */
6476 celt = VEC_safe_push (constructor_elt, gc, constructor_elements, NULL);
6477 celt->index = field;
6478 celt->value = value;
6480 /* Advance the variable that indicates sequential elements output. */
6481 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6482 constructor_unfilled_index
6483 = size_binop (PLUS_EXPR, constructor_unfilled_index,
6485 else if (TREE_CODE (constructor_type) == RECORD_TYPE)
6487 constructor_unfilled_fields
6488 = TREE_CHAIN (constructor_unfilled_fields);
6490 /* Skip any nameless bit fields. */
6491 while (constructor_unfilled_fields != 0
6492 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
6493 && DECL_NAME (constructor_unfilled_fields) == 0)
6494 constructor_unfilled_fields =
6495 TREE_CHAIN (constructor_unfilled_fields);
6497 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6498 constructor_unfilled_fields = 0;
6500 /* Now output any pending elements which have become next. */
6502 output_pending_init_elements (0);
6505 /* Output any pending elements which have become next.
6506 As we output elements, constructor_unfilled_{fields,index}
6507 advances, which may cause other elements to become next;
6508 if so, they too are output.
6510 If ALL is 0, we return when there are
6511 no more pending elements to output now.
6513 If ALL is 1, we output space as necessary so that
6514 we can output all the pending elements. */
6517 output_pending_init_elements (int all)
6519 struct init_node *elt = constructor_pending_elts;
6524 /* Look through the whole pending tree.
6525 If we find an element that should be output now,
6526 output it. Otherwise, set NEXT to the element
6527 that comes first among those still pending. */
6532 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6534 if (tree_int_cst_equal (elt->purpose,
6535 constructor_unfilled_index))
6536 output_init_element (elt->value, true,
6537 TREE_TYPE (constructor_type),
6538 constructor_unfilled_index, 0, false);
6539 else if (tree_int_cst_lt (constructor_unfilled_index,
6542 /* Advance to the next smaller node. */
6547 /* We have reached the smallest node bigger than the
6548 current unfilled index. Fill the space first. */
6549 next = elt->purpose;
6555 /* Advance to the next bigger node. */
6560 /* We have reached the biggest node in a subtree. Find
6561 the parent of it, which is the next bigger node. */
6562 while (elt->parent && elt->parent->right == elt)
6565 if (elt && tree_int_cst_lt (constructor_unfilled_index,
6568 next = elt->purpose;
6574 else if (TREE_CODE (constructor_type) == RECORD_TYPE
6575 || TREE_CODE (constructor_type) == UNION_TYPE)
6577 tree ctor_unfilled_bitpos, elt_bitpos;
6579 /* If the current record is complete we are done. */
6580 if (constructor_unfilled_fields == 0)
6583 ctor_unfilled_bitpos = bit_position (constructor_unfilled_fields);
6584 elt_bitpos = bit_position (elt->purpose);
6585 /* We can't compare fields here because there might be empty
6586 fields in between. */
6587 if (tree_int_cst_equal (elt_bitpos, ctor_unfilled_bitpos))
6589 constructor_unfilled_fields = elt->purpose;
6590 output_init_element (elt->value, true, TREE_TYPE (elt->purpose),
6591 elt->purpose, 0, false);
6593 else if (tree_int_cst_lt (ctor_unfilled_bitpos, elt_bitpos))
6595 /* Advance to the next smaller node. */
6600 /* We have reached the smallest node bigger than the
6601 current unfilled field. Fill the space first. */
6602 next = elt->purpose;
6608 /* Advance to the next bigger node. */
6613 /* We have reached the biggest node in a subtree. Find
6614 the parent of it, which is the next bigger node. */
6615 while (elt->parent && elt->parent->right == elt)
6619 && (tree_int_cst_lt (ctor_unfilled_bitpos,
6620 bit_position (elt->purpose))))
6622 next = elt->purpose;
6630 /* Ordinarily return, but not if we want to output all
6631 and there are elements left. */
6632 if (!(all && next != 0))
6635 /* If it's not incremental, just skip over the gap, so that after
6636 jumping to retry we will output the next successive element. */
6637 if (TREE_CODE (constructor_type) == RECORD_TYPE
6638 || TREE_CODE (constructor_type) == UNION_TYPE)
6639 constructor_unfilled_fields = next;
6640 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6641 constructor_unfilled_index = next;
6643 /* ELT now points to the node in the pending tree with the next
6644 initializer to output. */
6648 /* Add one non-braced element to the current constructor level.
6649 This adjusts the current position within the constructor's type.
6650 This may also start or terminate implicit levels
6651 to handle a partly-braced initializer.
6653 Once this has found the correct level for the new element,
6654 it calls output_init_element.
6656 IMPLICIT is true if value comes from pop_init_level (1),
6657 the new initializer has been merged with the existing one
6658 and thus no warnings should be emitted about overriding an
6659 existing initializer. */
6662 process_init_element (struct c_expr value, bool implicit)
6664 tree orig_value = value.value;
6665 int string_flag = orig_value != 0 && TREE_CODE (orig_value) == STRING_CST;
6666 bool strict_string = value.original_code == STRING_CST;
6668 designator_depth = 0;
6669 designator_erroneous = 0;
6671 /* Handle superfluous braces around string cst as in
6672 char x[] = {"foo"}; */
6675 && TREE_CODE (constructor_type) == ARRAY_TYPE
6676 && INTEGRAL_TYPE_P (TREE_TYPE (constructor_type))
6677 && integer_zerop (constructor_unfilled_index))
6679 if (constructor_stack->replacement_value.value)
6680 error_init ("excess elements in char array initializer");
6681 constructor_stack->replacement_value = value;
6685 if (constructor_stack->replacement_value.value != 0)
6687 error_init ("excess elements in struct initializer");
6691 /* Ignore elements of a brace group if it is entirely superfluous
6692 and has already been diagnosed. */
6693 if (constructor_type == 0)
6696 /* If we've exhausted any levels that didn't have braces,
6698 while (constructor_stack->implicit)
6700 if ((TREE_CODE (constructor_type) == RECORD_TYPE
6701 || TREE_CODE (constructor_type) == UNION_TYPE)
6702 && constructor_fields == 0)
6703 process_init_element (pop_init_level (1), true);
6704 else if (TREE_CODE (constructor_type) == ARRAY_TYPE
6705 && (constructor_max_index == 0
6706 || tree_int_cst_lt (constructor_max_index,
6707 constructor_index)))
6708 process_init_element (pop_init_level (1), true);
6713 /* In the case of [LO ... HI] = VALUE, only evaluate VALUE once. */
6714 if (constructor_range_stack)
6716 /* If value is a compound literal and we'll be just using its
6717 content, don't put it into a SAVE_EXPR. */
6718 if (TREE_CODE (value.value) != COMPOUND_LITERAL_EXPR
6719 || !require_constant_value
6721 value.value = save_expr (value.value);
6726 if (TREE_CODE (constructor_type) == RECORD_TYPE)
6729 enum tree_code fieldcode;
6731 if (constructor_fields == 0)
6733 pedwarn_init (input_location, 0,
6734 "excess elements in struct initializer");
6738 fieldtype = TREE_TYPE (constructor_fields);
6739 if (fieldtype != error_mark_node)
6740 fieldtype = TYPE_MAIN_VARIANT (fieldtype);
6741 fieldcode = TREE_CODE (fieldtype);
6743 /* Error for non-static initialization of a flexible array member. */
6744 if (fieldcode == ARRAY_TYPE
6745 && !require_constant_value
6746 && TYPE_SIZE (fieldtype) == NULL_TREE
6747 && TREE_CHAIN (constructor_fields) == NULL_TREE)
6749 error_init ("non-static initialization of a flexible array member");
6753 /* Accept a string constant to initialize a subarray. */
6754 if (value.value != 0
6755 && fieldcode == ARRAY_TYPE
6756 && INTEGRAL_TYPE_P (TREE_TYPE (fieldtype))
6758 value.value = orig_value;
6759 /* Otherwise, if we have come to a subaggregate,
6760 and we don't have an element of its type, push into it. */
6761 else if (value.value != 0
6762 && value.value != error_mark_node
6763 && TYPE_MAIN_VARIANT (TREE_TYPE (value.value)) != fieldtype
6764 && (fieldcode == RECORD_TYPE || fieldcode == ARRAY_TYPE
6765 || fieldcode == UNION_TYPE))
6767 push_init_level (1);
6773 push_member_name (constructor_fields);
6774 output_init_element (value.value, strict_string,
6775 fieldtype, constructor_fields, 1, implicit);
6776 RESTORE_SPELLING_DEPTH (constructor_depth);
6779 /* Do the bookkeeping for an element that was
6780 directly output as a constructor. */
6782 /* For a record, keep track of end position of last field. */
6783 if (DECL_SIZE (constructor_fields))
6784 constructor_bit_index
6785 = size_binop (PLUS_EXPR,
6786 bit_position (constructor_fields),
6787 DECL_SIZE (constructor_fields));
6789 /* If the current field was the first one not yet written out,
6790 it isn't now, so update. */
6791 if (constructor_unfilled_fields == constructor_fields)
6793 constructor_unfilled_fields = TREE_CHAIN (constructor_fields);
6794 /* Skip any nameless bit fields. */
6795 while (constructor_unfilled_fields != 0
6796 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
6797 && DECL_NAME (constructor_unfilled_fields) == 0)
6798 constructor_unfilled_fields =
6799 TREE_CHAIN (constructor_unfilled_fields);
6803 constructor_fields = TREE_CHAIN (constructor_fields);
6804 /* Skip any nameless bit fields at the beginning. */
6805 while (constructor_fields != 0
6806 && DECL_C_BIT_FIELD (constructor_fields)
6807 && DECL_NAME (constructor_fields) == 0)
6808 constructor_fields = TREE_CHAIN (constructor_fields);
6810 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6813 enum tree_code fieldcode;
6815 if (constructor_fields == 0)
6817 pedwarn_init (input_location, 0,
6818 "excess elements in union initializer");
6822 fieldtype = TREE_TYPE (constructor_fields);
6823 if (fieldtype != error_mark_node)
6824 fieldtype = TYPE_MAIN_VARIANT (fieldtype);
6825 fieldcode = TREE_CODE (fieldtype);
6827 /* Warn that traditional C rejects initialization of unions.
6828 We skip the warning if the value is zero. This is done
6829 under the assumption that the zero initializer in user
6830 code appears conditioned on e.g. __STDC__ to avoid
6831 "missing initializer" warnings and relies on default
6832 initialization to zero in the traditional C case.
6833 We also skip the warning if the initializer is designated,
6834 again on the assumption that this must be conditional on
6835 __STDC__ anyway (and we've already complained about the
6836 member-designator already). */
6837 if (!in_system_header && !constructor_designated
6838 && !(value.value && (integer_zerop (value.value)
6839 || real_zerop (value.value))))
6840 warning (OPT_Wtraditional, "traditional C rejects initialization "
6843 /* Accept a string constant to initialize a subarray. */
6844 if (value.value != 0
6845 && fieldcode == ARRAY_TYPE
6846 && INTEGRAL_TYPE_P (TREE_TYPE (fieldtype))
6848 value.value = orig_value;
6849 /* Otherwise, if we have come to a subaggregate,
6850 and we don't have an element of its type, push into it. */
6851 else if (value.value != 0
6852 && value.value != error_mark_node
6853 && TYPE_MAIN_VARIANT (TREE_TYPE (value.value)) != fieldtype
6854 && (fieldcode == RECORD_TYPE || fieldcode == ARRAY_TYPE
6855 || fieldcode == UNION_TYPE))
6857 push_init_level (1);
6863 push_member_name (constructor_fields);
6864 output_init_element (value.value, strict_string,
6865 fieldtype, constructor_fields, 1, implicit);
6866 RESTORE_SPELLING_DEPTH (constructor_depth);
6869 /* Do the bookkeeping for an element that was
6870 directly output as a constructor. */
6872 constructor_bit_index = DECL_SIZE (constructor_fields);
6873 constructor_unfilled_fields = TREE_CHAIN (constructor_fields);
6876 constructor_fields = 0;
6878 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6880 tree elttype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
6881 enum tree_code eltcode = TREE_CODE (elttype);
6883 /* Accept a string constant to initialize a subarray. */
6884 if (value.value != 0
6885 && eltcode == ARRAY_TYPE
6886 && INTEGRAL_TYPE_P (TREE_TYPE (elttype))
6888 value.value = orig_value;
6889 /* Otherwise, if we have come to a subaggregate,
6890 and we don't have an element of its type, push into it. */
6891 else if (value.value != 0
6892 && value.value != error_mark_node
6893 && TYPE_MAIN_VARIANT (TREE_TYPE (value.value)) != elttype
6894 && (eltcode == RECORD_TYPE || eltcode == ARRAY_TYPE
6895 || eltcode == UNION_TYPE))
6897 push_init_level (1);
6901 if (constructor_max_index != 0
6902 && (tree_int_cst_lt (constructor_max_index, constructor_index)
6903 || integer_all_onesp (constructor_max_index)))
6905 pedwarn_init (input_location, 0,
6906 "excess elements in array initializer");
6910 /* Now output the actual element. */
6913 push_array_bounds (tree_low_cst (constructor_index, 1));
6914 output_init_element (value.value, strict_string,
6915 elttype, constructor_index, 1, implicit);
6916 RESTORE_SPELLING_DEPTH (constructor_depth);
6920 = size_binop (PLUS_EXPR, constructor_index, bitsize_one_node);
6923 /* If we are doing the bookkeeping for an element that was
6924 directly output as a constructor, we must update
6925 constructor_unfilled_index. */
6926 constructor_unfilled_index = constructor_index;
6928 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
6930 tree elttype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
6932 /* Do a basic check of initializer size. Note that vectors
6933 always have a fixed size derived from their type. */
6934 if (tree_int_cst_lt (constructor_max_index, constructor_index))
6936 pedwarn_init (input_location, 0,
6937 "excess elements in vector initializer");
6941 /* Now output the actual element. */
6943 output_init_element (value.value, strict_string,
6944 elttype, constructor_index, 1, implicit);
6947 = size_binop (PLUS_EXPR, constructor_index, bitsize_one_node);
6950 /* If we are doing the bookkeeping for an element that was
6951 directly output as a constructor, we must update
6952 constructor_unfilled_index. */
6953 constructor_unfilled_index = constructor_index;
6956 /* Handle the sole element allowed in a braced initializer
6957 for a scalar variable. */
6958 else if (constructor_type != error_mark_node
6959 && constructor_fields == 0)
6961 pedwarn_init (input_location, 0,
6962 "excess elements in scalar initializer");
6968 output_init_element (value.value, strict_string,
6969 constructor_type, NULL_TREE, 1, implicit);
6970 constructor_fields = 0;
6973 /* Handle range initializers either at this level or anywhere higher
6974 in the designator stack. */
6975 if (constructor_range_stack)
6977 struct constructor_range_stack *p, *range_stack;
6980 range_stack = constructor_range_stack;
6981 constructor_range_stack = 0;
6982 while (constructor_stack != range_stack->stack)
6984 gcc_assert (constructor_stack->implicit);
6985 process_init_element (pop_init_level (1), true);
6987 for (p = range_stack;
6988 !p->range_end || tree_int_cst_equal (p->index, p->range_end);
6991 gcc_assert (constructor_stack->implicit);
6992 process_init_element (pop_init_level (1), true);
6995 p->index = size_binop (PLUS_EXPR, p->index, bitsize_one_node);
6996 if (tree_int_cst_equal (p->index, p->range_end) && !p->prev)
7001 constructor_index = p->index;
7002 constructor_fields = p->fields;
7003 if (finish && p->range_end && p->index == p->range_start)
7011 push_init_level (2);
7012 p->stack = constructor_stack;
7013 if (p->range_end && tree_int_cst_equal (p->index, p->range_end))
7014 p->index = p->range_start;
7018 constructor_range_stack = range_stack;
7025 constructor_range_stack = 0;
7028 /* Build a complete asm-statement, whose components are a CV_QUALIFIER
7029 (guaranteed to be 'volatile' or null) and ARGS (represented using
7030 an ASM_EXPR node). */
7032 build_asm_stmt (tree cv_qualifier, tree args)
7034 if (!ASM_VOLATILE_P (args) && cv_qualifier)
7035 ASM_VOLATILE_P (args) = 1;
7036 return add_stmt (args);
7039 /* Build an asm-expr, whose components are a STRING, some OUTPUTS,
7040 some INPUTS, and some CLOBBERS. The latter three may be NULL.
7041 SIMPLE indicates whether there was anything at all after the
7042 string in the asm expression -- asm("blah") and asm("blah" : )
7043 are subtly different. We use a ASM_EXPR node to represent this. */
7045 build_asm_expr (tree string, tree outputs, tree inputs, tree clobbers,
7051 const char *constraint;
7052 const char **oconstraints;
7053 bool allows_mem, allows_reg, is_inout;
7054 int ninputs, noutputs;
7056 ninputs = list_length (inputs);
7057 noutputs = list_length (outputs);
7058 oconstraints = (const char **) alloca (noutputs * sizeof (const char *));
7060 string = resolve_asm_operand_names (string, outputs, inputs);
7062 /* Remove output conversions that change the type but not the mode. */
7063 for (i = 0, tail = outputs; tail; ++i, tail = TREE_CHAIN (tail))
7065 tree output = TREE_VALUE (tail);
7067 /* ??? Really, this should not be here. Users should be using a
7068 proper lvalue, dammit. But there's a long history of using casts
7069 in the output operands. In cases like longlong.h, this becomes a
7070 primitive form of typechecking -- if the cast can be removed, then
7071 the output operand had a type of the proper width; otherwise we'll
7072 get an error. Gross, but ... */
7073 STRIP_NOPS (output);
7075 if (!lvalue_or_else (output, lv_asm))
7076 output = error_mark_node;
7078 if (output != error_mark_node
7079 && (TREE_READONLY (output)
7080 || TYPE_READONLY (TREE_TYPE (output))
7081 || ((TREE_CODE (TREE_TYPE (output)) == RECORD_TYPE
7082 || TREE_CODE (TREE_TYPE (output)) == UNION_TYPE)
7083 && C_TYPE_FIELDS_READONLY (TREE_TYPE (output)))))
7084 readonly_error (output, lv_asm);
7086 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
7087 oconstraints[i] = constraint;
7089 if (parse_output_constraint (&constraint, i, ninputs, noutputs,
7090 &allows_mem, &allows_reg, &is_inout))
7092 /* If the operand is going to end up in memory,
7093 mark it addressable. */
7094 if (!allows_reg && !c_mark_addressable (output))
7095 output = error_mark_node;
7098 output = error_mark_node;
7100 TREE_VALUE (tail) = output;
7103 for (i = 0, tail = inputs; tail; ++i, tail = TREE_CHAIN (tail))
7107 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
7108 input = TREE_VALUE (tail);
7110 if (parse_input_constraint (&constraint, i, ninputs, noutputs, 0,
7111 oconstraints, &allows_mem, &allows_reg))
7113 /* If the operand is going to end up in memory,
7114 mark it addressable. */
7115 if (!allows_reg && allows_mem)
7117 /* Strip the nops as we allow this case. FIXME, this really
7118 should be rejected or made deprecated. */
7120 if (!c_mark_addressable (input))
7121 input = error_mark_node;
7125 input = error_mark_node;
7127 TREE_VALUE (tail) = input;
7130 args = build_stmt (ASM_EXPR, string, outputs, inputs, clobbers);
7132 /* asm statements without outputs, including simple ones, are treated
7134 ASM_INPUT_P (args) = simple;
7135 ASM_VOLATILE_P (args) = (noutputs == 0);
7140 /* Generate a goto statement to LABEL. */
7143 c_finish_goto_label (tree label)
7145 tree decl = lookup_label (label);
7149 if (C_DECL_UNJUMPABLE_STMT_EXPR (decl))
7151 error ("jump into statement expression");
7155 if (C_DECL_UNJUMPABLE_VM (decl))
7157 error ("jump into scope of identifier with variably modified type");
7161 if (!C_DECL_UNDEFINABLE_STMT_EXPR (decl))
7163 /* No jump from outside this statement expression context, so
7164 record that there is a jump from within this context. */
7165 struct c_label_list *nlist;
7166 nlist = XOBNEW (&parser_obstack, struct c_label_list);
7167 nlist->next = label_context_stack_se->labels_used;
7168 nlist->label = decl;
7169 label_context_stack_se->labels_used = nlist;
7172 if (!C_DECL_UNDEFINABLE_VM (decl))
7174 /* No jump from outside this context context of identifiers with
7175 variably modified type, so record that there is a jump from
7176 within this context. */
7177 struct c_label_list *nlist;
7178 nlist = XOBNEW (&parser_obstack, struct c_label_list);
7179 nlist->next = label_context_stack_vm->labels_used;
7180 nlist->label = decl;
7181 label_context_stack_vm->labels_used = nlist;
7184 TREE_USED (decl) = 1;
7185 return add_stmt (build1 (GOTO_EXPR, void_type_node, decl));
7188 /* Generate a computed goto statement to EXPR. */
7191 c_finish_goto_ptr (tree expr)
7193 pedwarn (input_location, OPT_pedantic, "ISO C forbids %<goto *expr;%>");
7194 expr = convert (ptr_type_node, expr);
7195 return add_stmt (build1 (GOTO_EXPR, void_type_node, expr));
7198 /* Generate a C `return' statement. RETVAL is the expression for what
7199 to return, or a null pointer for `return;' with no value. */
7202 c_finish_return (tree retval)
7204 tree valtype = TREE_TYPE (TREE_TYPE (current_function_decl)), ret_stmt;
7205 bool no_warning = false;
7207 if (TREE_THIS_VOLATILE (current_function_decl))
7208 warning (0, "function declared %<noreturn%> has a %<return%> statement");
7212 current_function_returns_null = 1;
7213 if ((warn_return_type || flag_isoc99)
7214 && valtype != 0 && TREE_CODE (valtype) != VOID_TYPE)
7216 pedwarn_c99 (input_location, flag_isoc99 ? 0 : OPT_Wreturn_type,
7217 "%<return%> with no value, in "
7218 "function returning non-void");
7222 else if (valtype == 0 || TREE_CODE (valtype) == VOID_TYPE)
7224 current_function_returns_null = 1;
7225 if (TREE_CODE (TREE_TYPE (retval)) != VOID_TYPE)
7226 pedwarn (input_location, 0,
7227 "%<return%> with a value, in function returning void");
7229 pedwarn (input_location, OPT_pedantic, "ISO C forbids "
7230 "%<return%> with expression, in function returning void");
7234 tree t = convert_for_assignment (valtype, retval, ic_return,
7235 NULL_TREE, NULL_TREE, 0);
7236 tree res = DECL_RESULT (current_function_decl);
7239 current_function_returns_value = 1;
7240 if (t == error_mark_node)
7243 inner = t = convert (TREE_TYPE (res), t);
7245 /* Strip any conversions, additions, and subtractions, and see if
7246 we are returning the address of a local variable. Warn if so. */
7249 switch (TREE_CODE (inner))
7252 case NON_LVALUE_EXPR:
7254 case POINTER_PLUS_EXPR:
7255 inner = TREE_OPERAND (inner, 0);
7259 /* If the second operand of the MINUS_EXPR has a pointer
7260 type (or is converted from it), this may be valid, so
7261 don't give a warning. */
7263 tree op1 = TREE_OPERAND (inner, 1);
7265 while (!POINTER_TYPE_P (TREE_TYPE (op1))
7266 && (CONVERT_EXPR_P (op1)
7267 || TREE_CODE (op1) == NON_LVALUE_EXPR))
7268 op1 = TREE_OPERAND (op1, 0);
7270 if (POINTER_TYPE_P (TREE_TYPE (op1)))
7273 inner = TREE_OPERAND (inner, 0);
7278 inner = TREE_OPERAND (inner, 0);
7280 while (REFERENCE_CLASS_P (inner)
7281 && TREE_CODE (inner) != INDIRECT_REF)
7282 inner = TREE_OPERAND (inner, 0);
7285 && !DECL_EXTERNAL (inner)
7286 && !TREE_STATIC (inner)
7287 && DECL_CONTEXT (inner) == current_function_decl)
7288 warning (0, "function returns address of local variable");
7298 retval = build2 (MODIFY_EXPR, TREE_TYPE (res), res, t);
7300 if (warn_sequence_point)
7301 verify_sequence_points (retval);
7304 ret_stmt = build_stmt (RETURN_EXPR, retval);
7305 TREE_NO_WARNING (ret_stmt) |= no_warning;
7306 return add_stmt (ret_stmt);
7310 /* The SWITCH_EXPR being built. */
7313 /* The original type of the testing expression, i.e. before the
7314 default conversion is applied. */
7317 /* A splay-tree mapping the low element of a case range to the high
7318 element, or NULL_TREE if there is no high element. Used to
7319 determine whether or not a new case label duplicates an old case
7320 label. We need a tree, rather than simply a hash table, because
7321 of the GNU case range extension. */
7324 /* Number of nested statement expressions within this switch
7325 statement; if nonzero, case and default labels may not
7327 unsigned int blocked_stmt_expr;
7329 /* Scope of outermost declarations of identifiers with variably
7330 modified type within this switch statement; if nonzero, case and
7331 default labels may not appear. */
7332 unsigned int blocked_vm;
7334 /* The next node on the stack. */
7335 struct c_switch *next;
7338 /* A stack of the currently active switch statements. The innermost
7339 switch statement is on the top of the stack. There is no need to
7340 mark the stack for garbage collection because it is only active
7341 during the processing of the body of a function, and we never
7342 collect at that point. */
7344 struct c_switch *c_switch_stack;
7346 /* Start a C switch statement, testing expression EXP. Return the new
7350 c_start_case (tree exp)
7352 tree orig_type = error_mark_node;
7353 struct c_switch *cs;
7355 if (exp != error_mark_node)
7357 orig_type = TREE_TYPE (exp);
7359 if (!INTEGRAL_TYPE_P (orig_type))
7361 if (orig_type != error_mark_node)
7363 error ("switch quantity not an integer");
7364 orig_type = error_mark_node;
7366 exp = integer_zero_node;
7370 tree type = TYPE_MAIN_VARIANT (orig_type);
7372 if (!in_system_header
7373 && (type == long_integer_type_node
7374 || type == long_unsigned_type_node))
7375 warning (OPT_Wtraditional, "%<long%> switch expression not "
7376 "converted to %<int%> in ISO C");
7378 exp = default_conversion (exp);
7380 if (warn_sequence_point)
7381 verify_sequence_points (exp);
7385 /* Add this new SWITCH_EXPR to the stack. */
7386 cs = XNEW (struct c_switch);
7387 cs->switch_expr = build3 (SWITCH_EXPR, orig_type, exp, NULL_TREE, NULL_TREE);
7388 cs->orig_type = orig_type;
7389 cs->cases = splay_tree_new (case_compare, NULL, NULL);
7390 cs->blocked_stmt_expr = 0;
7392 cs->next = c_switch_stack;
7393 c_switch_stack = cs;
7395 return add_stmt (cs->switch_expr);
7398 /* Process a case label. */
7401 do_case (tree low_value, tree high_value)
7403 tree label = NULL_TREE;
7405 if (c_switch_stack && !c_switch_stack->blocked_stmt_expr
7406 && !c_switch_stack->blocked_vm)
7408 label = c_add_case_label (c_switch_stack->cases,
7409 SWITCH_COND (c_switch_stack->switch_expr),
7410 c_switch_stack->orig_type,
7411 low_value, high_value);
7412 if (label == error_mark_node)
7415 else if (c_switch_stack && c_switch_stack->blocked_stmt_expr)
7418 error ("case label in statement expression not containing "
7419 "enclosing switch statement");
7421 error ("%<default%> label in statement expression not containing "
7422 "enclosing switch statement");
7424 else if (c_switch_stack && c_switch_stack->blocked_vm)
7427 error ("case label in scope of identifier with variably modified "
7428 "type not containing enclosing switch statement");
7430 error ("%<default%> label in scope of identifier with variably "
7431 "modified type not containing enclosing switch statement");
7434 error ("case label not within a switch statement");
7436 error ("%<default%> label not within a switch statement");
7441 /* Finish the switch statement. */
7444 c_finish_case (tree body)
7446 struct c_switch *cs = c_switch_stack;
7447 location_t switch_location;
7449 SWITCH_BODY (cs->switch_expr) = body;
7451 /* We must not be within a statement expression nested in the switch
7452 at this point; we might, however, be within the scope of an
7453 identifier with variably modified type nested in the switch. */
7454 gcc_assert (!cs->blocked_stmt_expr);
7456 /* Emit warnings as needed. */
7457 if (EXPR_HAS_LOCATION (cs->switch_expr))
7458 switch_location = EXPR_LOCATION (cs->switch_expr);
7460 switch_location = input_location;
7461 c_do_switch_warnings (cs->cases, switch_location,
7462 TREE_TYPE (cs->switch_expr),
7463 SWITCH_COND (cs->switch_expr));
7465 /* Pop the stack. */
7466 c_switch_stack = cs->next;
7467 splay_tree_delete (cs->cases);
7471 /* Emit an if statement. IF_LOCUS is the location of the 'if'. COND,
7472 THEN_BLOCK and ELSE_BLOCK are expressions to be used; ELSE_BLOCK
7473 may be null. NESTED_IF is true if THEN_BLOCK contains another IF
7474 statement, and was not surrounded with parenthesis. */
7477 c_finish_if_stmt (location_t if_locus, tree cond, tree then_block,
7478 tree else_block, bool nested_if)
7482 /* Diagnose an ambiguous else if if-then-else is nested inside if-then. */
7483 if (warn_parentheses && nested_if && else_block == NULL)
7485 tree inner_if = then_block;
7487 /* We know from the grammar productions that there is an IF nested
7488 within THEN_BLOCK. Due to labels and c99 conditional declarations,
7489 it might not be exactly THEN_BLOCK, but should be the last
7490 non-container statement within. */
7492 switch (TREE_CODE (inner_if))
7497 inner_if = BIND_EXPR_BODY (inner_if);
7499 case STATEMENT_LIST:
7500 inner_if = expr_last (then_block);
7502 case TRY_FINALLY_EXPR:
7503 case TRY_CATCH_EXPR:
7504 inner_if = TREE_OPERAND (inner_if, 0);
7511 if (COND_EXPR_ELSE (inner_if))
7512 warning (OPT_Wparentheses,
7513 "%Hsuggest explicit braces to avoid ambiguous %<else%>",
7517 stmt = build3 (COND_EXPR, void_type_node, cond, then_block, else_block);
7518 SET_EXPR_LOCATION (stmt, if_locus);
7522 /* Emit a general-purpose loop construct. START_LOCUS is the location of
7523 the beginning of the loop. COND is the loop condition. COND_IS_FIRST
7524 is false for DO loops. INCR is the FOR increment expression. BODY is
7525 the statement controlled by the loop. BLAB is the break label. CLAB is
7526 the continue label. Everything is allowed to be NULL. */
7529 c_finish_loop (location_t start_locus, tree cond, tree incr, tree body,
7530 tree blab, tree clab, bool cond_is_first)
7532 tree entry = NULL, exit = NULL, t;
7534 /* If the condition is zero don't generate a loop construct. */
7535 if (cond && integer_zerop (cond))
7539 t = build_and_jump (&blab);
7540 SET_EXPR_LOCATION (t, start_locus);
7546 tree top = build1 (LABEL_EXPR, void_type_node, NULL_TREE);
7548 /* If we have an exit condition, then we build an IF with gotos either
7549 out of the loop, or to the top of it. If there's no exit condition,
7550 then we just build a jump back to the top. */
7551 exit = build_and_jump (&LABEL_EXPR_LABEL (top));
7553 if (cond && !integer_nonzerop (cond))
7555 /* Canonicalize the loop condition to the end. This means
7556 generating a branch to the loop condition. Reuse the
7557 continue label, if possible. */
7562 entry = build1 (LABEL_EXPR, void_type_node, NULL_TREE);
7563 t = build_and_jump (&LABEL_EXPR_LABEL (entry));
7566 t = build1 (GOTO_EXPR, void_type_node, clab);
7567 SET_EXPR_LOCATION (t, start_locus);
7571 t = build_and_jump (&blab);
7572 exit = fold_build3 (COND_EXPR, void_type_node, cond, exit, t);
7574 SET_EXPR_LOCATION (exit, start_locus);
7576 SET_EXPR_LOCATION (exit, input_location);
7585 add_stmt (build1 (LABEL_EXPR, void_type_node, clab));
7593 add_stmt (build1 (LABEL_EXPR, void_type_node, blab));
7597 c_finish_bc_stmt (tree *label_p, bool is_break)
7600 tree label = *label_p;
7602 /* In switch statements break is sometimes stylistically used after
7603 a return statement. This can lead to spurious warnings about
7604 control reaching the end of a non-void function when it is
7605 inlined. Note that we are calling block_may_fallthru with
7606 language specific tree nodes; this works because
7607 block_may_fallthru returns true when given something it does not
7609 skip = !block_may_fallthru (cur_stmt_list);
7614 *label_p = label = create_artificial_label ();
7616 else if (TREE_CODE (label) == LABEL_DECL)
7618 else switch (TREE_INT_CST_LOW (label))
7622 error ("break statement not within loop or switch");
7624 error ("continue statement not within a loop");
7628 gcc_assert (is_break);
7629 error ("break statement used with OpenMP for loop");
7640 add_stmt (build_predict_expr (PRED_CONTINUE, NOT_TAKEN));
7642 return add_stmt (build1 (GOTO_EXPR, void_type_node, label));
7645 /* A helper routine for c_process_expr_stmt and c_finish_stmt_expr. */
7648 emit_side_effect_warnings (tree expr)
7650 if (expr == error_mark_node)
7652 else if (!TREE_SIDE_EFFECTS (expr))
7654 if (!VOID_TYPE_P (TREE_TYPE (expr)) && !TREE_NO_WARNING (expr))
7655 warning (OPT_Wunused_value, "%Hstatement with no effect",
7656 EXPR_HAS_LOCATION (expr) ? EXPR_LOCUS (expr) : &input_location);
7659 warn_if_unused_value (expr, input_location);
7662 /* Process an expression as if it were a complete statement. Emit
7663 diagnostics, but do not call ADD_STMT. */
7666 c_process_expr_stmt (tree expr)
7671 if (warn_sequence_point)
7672 verify_sequence_points (expr);
7674 if (TREE_TYPE (expr) != error_mark_node
7675 && !COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (expr))
7676 && TREE_CODE (TREE_TYPE (expr)) != ARRAY_TYPE)
7677 error ("expression statement has incomplete type");
7679 /* If we're not processing a statement expression, warn about unused values.
7680 Warnings for statement expressions will be emitted later, once we figure
7681 out which is the result. */
7682 if (!STATEMENT_LIST_STMT_EXPR (cur_stmt_list)
7683 && warn_unused_value)
7684 emit_side_effect_warnings (expr);
7686 /* If the expression is not of a type to which we cannot assign a line
7687 number, wrap the thing in a no-op NOP_EXPR. */
7688 if (DECL_P (expr) || CONSTANT_CLASS_P (expr))
7689 expr = build1 (NOP_EXPR, TREE_TYPE (expr), expr);
7691 if (CAN_HAVE_LOCATION_P (expr))
7692 SET_EXPR_LOCATION (expr, input_location);
7697 /* Emit an expression as a statement. */
7700 c_finish_expr_stmt (tree expr)
7703 return add_stmt (c_process_expr_stmt (expr));
7708 /* Do the opposite and emit a statement as an expression. To begin,
7709 create a new binding level and return it. */
7712 c_begin_stmt_expr (void)
7715 struct c_label_context_se *nstack;
7716 struct c_label_list *glist;
7718 /* We must force a BLOCK for this level so that, if it is not expanded
7719 later, there is a way to turn off the entire subtree of blocks that
7720 are contained in it. */
7722 ret = c_begin_compound_stmt (true);
7725 c_switch_stack->blocked_stmt_expr++;
7726 gcc_assert (c_switch_stack->blocked_stmt_expr != 0);
7728 for (glist = label_context_stack_se->labels_used;
7730 glist = glist->next)
7732 C_DECL_UNDEFINABLE_STMT_EXPR (glist->label) = 1;
7734 nstack = XOBNEW (&parser_obstack, struct c_label_context_se);
7735 nstack->labels_def = NULL;
7736 nstack->labels_used = NULL;
7737 nstack->next = label_context_stack_se;
7738 label_context_stack_se = nstack;
7740 /* Mark the current statement list as belonging to a statement list. */
7741 STATEMENT_LIST_STMT_EXPR (ret) = 1;
7747 c_finish_stmt_expr (tree body)
7749 tree last, type, tmp, val;
7751 struct c_label_list *dlist, *glist, *glist_prev = NULL;
7753 body = c_end_compound_stmt (body, true);
7756 gcc_assert (c_switch_stack->blocked_stmt_expr != 0);
7757 c_switch_stack->blocked_stmt_expr--;
7759 /* It is no longer possible to jump to labels defined within this
7760 statement expression. */
7761 for (dlist = label_context_stack_se->labels_def;
7763 dlist = dlist->next)
7765 C_DECL_UNJUMPABLE_STMT_EXPR (dlist->label) = 1;
7767 /* It is again possible to define labels with a goto just outside
7768 this statement expression. */
7769 for (glist = label_context_stack_se->next->labels_used;
7771 glist = glist->next)
7773 C_DECL_UNDEFINABLE_STMT_EXPR (glist->label) = 0;
7776 if (glist_prev != NULL)
7777 glist_prev->next = label_context_stack_se->labels_used;
7779 label_context_stack_se->next->labels_used
7780 = label_context_stack_se->labels_used;
7781 label_context_stack_se = label_context_stack_se->next;
7783 /* Locate the last statement in BODY. See c_end_compound_stmt
7784 about always returning a BIND_EXPR. */
7785 last_p = &BIND_EXPR_BODY (body);
7786 last = BIND_EXPR_BODY (body);
7789 if (TREE_CODE (last) == STATEMENT_LIST)
7791 tree_stmt_iterator i;
7793 /* This can happen with degenerate cases like ({ }). No value. */
7794 if (!TREE_SIDE_EFFECTS (last))
7797 /* If we're supposed to generate side effects warnings, process
7798 all of the statements except the last. */
7799 if (warn_unused_value)
7801 for (i = tsi_start (last); !tsi_one_before_end_p (i); tsi_next (&i))
7802 emit_side_effect_warnings (tsi_stmt (i));
7805 i = tsi_last (last);
7806 last_p = tsi_stmt_ptr (i);
7810 /* If the end of the list is exception related, then the list was split
7811 by a call to push_cleanup. Continue searching. */
7812 if (TREE_CODE (last) == TRY_FINALLY_EXPR
7813 || TREE_CODE (last) == TRY_CATCH_EXPR)
7815 last_p = &TREE_OPERAND (last, 0);
7817 goto continue_searching;
7820 /* In the case that the BIND_EXPR is not necessary, return the
7821 expression out from inside it. */
7822 if (last == error_mark_node
7823 || (last == BIND_EXPR_BODY (body)
7824 && BIND_EXPR_VARS (body) == NULL))
7826 /* Do not warn if the return value of a statement expression is
7828 if (CAN_HAVE_LOCATION_P (last))
7829 TREE_NO_WARNING (last) = 1;
7833 /* Extract the type of said expression. */
7834 type = TREE_TYPE (last);
7836 /* If we're not returning a value at all, then the BIND_EXPR that
7837 we already have is a fine expression to return. */
7838 if (!type || VOID_TYPE_P (type))
7841 /* Now that we've located the expression containing the value, it seems
7842 silly to make voidify_wrapper_expr repeat the process. Create a
7843 temporary of the appropriate type and stick it in a TARGET_EXPR. */
7844 tmp = create_tmp_var_raw (type, NULL);
7846 /* Unwrap a no-op NOP_EXPR as added by c_finish_expr_stmt. This avoids
7847 tree_expr_nonnegative_p giving up immediately. */
7849 if (TREE_CODE (val) == NOP_EXPR
7850 && TREE_TYPE (val) == TREE_TYPE (TREE_OPERAND (val, 0)))
7851 val = TREE_OPERAND (val, 0);
7853 *last_p = build2 (MODIFY_EXPR, void_type_node, tmp, val);
7854 SET_EXPR_LOCUS (*last_p, EXPR_LOCUS (last));
7856 return build4 (TARGET_EXPR, type, tmp, body, NULL_TREE, NULL_TREE);
7859 /* Begin the scope of an identifier of variably modified type, scope
7860 number SCOPE. Jumping from outside this scope to inside it is not
7864 c_begin_vm_scope (unsigned int scope)
7866 struct c_label_context_vm *nstack;
7867 struct c_label_list *glist;
7869 gcc_assert (scope > 0);
7871 /* At file_scope, we don't have to do any processing. */
7872 if (label_context_stack_vm == NULL)
7875 if (c_switch_stack && !c_switch_stack->blocked_vm)
7876 c_switch_stack->blocked_vm = scope;
7877 for (glist = label_context_stack_vm->labels_used;
7879 glist = glist->next)
7881 C_DECL_UNDEFINABLE_VM (glist->label) = 1;
7883 nstack = XOBNEW (&parser_obstack, struct c_label_context_vm);
7884 nstack->labels_def = NULL;
7885 nstack->labels_used = NULL;
7886 nstack->scope = scope;
7887 nstack->next = label_context_stack_vm;
7888 label_context_stack_vm = nstack;
7891 /* End a scope which may contain identifiers of variably modified
7892 type, scope number SCOPE. */
7895 c_end_vm_scope (unsigned int scope)
7897 if (label_context_stack_vm == NULL)
7899 if (c_switch_stack && c_switch_stack->blocked_vm == scope)
7900 c_switch_stack->blocked_vm = 0;
7901 /* We may have a number of nested scopes of identifiers with
7902 variably modified type, all at this depth. Pop each in turn. */
7903 while (label_context_stack_vm->scope == scope)
7905 struct c_label_list *dlist, *glist, *glist_prev = NULL;
7907 /* It is no longer possible to jump to labels defined within this
7909 for (dlist = label_context_stack_vm->labels_def;
7911 dlist = dlist->next)
7913 C_DECL_UNJUMPABLE_VM (dlist->label) = 1;
7915 /* It is again possible to define labels with a goto just outside
7917 for (glist = label_context_stack_vm->next->labels_used;
7919 glist = glist->next)
7921 C_DECL_UNDEFINABLE_VM (glist->label) = 0;
7924 if (glist_prev != NULL)
7925 glist_prev->next = label_context_stack_vm->labels_used;
7927 label_context_stack_vm->next->labels_used
7928 = label_context_stack_vm->labels_used;
7929 label_context_stack_vm = label_context_stack_vm->next;
7933 /* Begin and end compound statements. This is as simple as pushing
7934 and popping new statement lists from the tree. */
7937 c_begin_compound_stmt (bool do_scope)
7939 tree stmt = push_stmt_list ();
7946 c_end_compound_stmt (tree stmt, bool do_scope)
7952 if (c_dialect_objc ())
7953 objc_clear_super_receiver ();
7954 block = pop_scope ();
7957 stmt = pop_stmt_list (stmt);
7958 stmt = c_build_bind_expr (block, stmt);
7960 /* If this compound statement is nested immediately inside a statement
7961 expression, then force a BIND_EXPR to be created. Otherwise we'll
7962 do the wrong thing for ({ { 1; } }) or ({ 1; { } }). In particular,
7963 STATEMENT_LISTs merge, and thus we can lose track of what statement
7966 && STATEMENT_LIST_STMT_EXPR (cur_stmt_list)
7967 && TREE_CODE (stmt) != BIND_EXPR)
7969 stmt = build3 (BIND_EXPR, void_type_node, NULL, stmt, NULL);
7970 TREE_SIDE_EFFECTS (stmt) = 1;
7976 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
7977 when the current scope is exited. EH_ONLY is true when this is not
7978 meant to apply to normal control flow transfer. */
7981 push_cleanup (tree ARG_UNUSED (decl), tree cleanup, bool eh_only)
7983 enum tree_code code;
7987 code = eh_only ? TRY_CATCH_EXPR : TRY_FINALLY_EXPR;
7988 stmt = build_stmt (code, NULL, cleanup);
7990 stmt_expr = STATEMENT_LIST_STMT_EXPR (cur_stmt_list);
7991 list = push_stmt_list ();
7992 TREE_OPERAND (stmt, 0) = list;
7993 STATEMENT_LIST_STMT_EXPR (list) = stmt_expr;
7996 /* Build a binary-operation expression without default conversions.
7997 CODE is the kind of expression to build.
7998 LOCATION is the operator's location.
7999 This function differs from `build' in several ways:
8000 the data type of the result is computed and recorded in it,
8001 warnings are generated if arg data types are invalid,
8002 special handling for addition and subtraction of pointers is known,
8003 and some optimization is done (operations on narrow ints
8004 are done in the narrower type when that gives the same result).
8005 Constant folding is also done before the result is returned.
8007 Note that the operands will never have enumeral types, or function
8008 or array types, because either they will have the default conversions
8009 performed or they have both just been converted to some other type in which
8010 the arithmetic is to be done. */
8013 build_binary_op (location_t location, enum tree_code code,
8014 tree orig_op0, tree orig_op1, int convert_p)
8017 enum tree_code code0, code1;
8019 tree ret = error_mark_node;
8020 const char *invalid_op_diag;
8022 /* Expression code to give to the expression when it is built.
8023 Normally this is CODE, which is what the caller asked for,
8024 but in some special cases we change it. */
8025 enum tree_code resultcode = code;
8027 /* Data type in which the computation is to be performed.
8028 In the simplest cases this is the common type of the arguments. */
8029 tree result_type = NULL;
8031 /* Nonzero means operands have already been type-converted
8032 in whatever way is necessary.
8033 Zero means they need to be converted to RESULT_TYPE. */
8036 /* Nonzero means create the expression with this type, rather than
8038 tree build_type = 0;
8040 /* Nonzero means after finally constructing the expression
8041 convert it to this type. */
8042 tree final_type = 0;
8044 /* Nonzero if this is an operation like MIN or MAX which can
8045 safely be computed in short if both args are promoted shorts.
8046 Also implies COMMON.
8047 -1 indicates a bitwise operation; this makes a difference
8048 in the exact conditions for when it is safe to do the operation
8049 in a narrower mode. */
8052 /* Nonzero if this is a comparison operation;
8053 if both args are promoted shorts, compare the original shorts.
8054 Also implies COMMON. */
8055 int short_compare = 0;
8057 /* Nonzero if this is a right-shift operation, which can be computed on the
8058 original short and then promoted if the operand is a promoted short. */
8059 int short_shift = 0;
8061 /* Nonzero means set RESULT_TYPE to the common type of the args. */
8064 /* True means types are compatible as far as ObjC is concerned. */
8067 if (location == UNKNOWN_LOCATION)
8068 location = input_location;
8072 op0 = default_conversion (orig_op0);
8073 op1 = default_conversion (orig_op1);
8081 type0 = TREE_TYPE (op0);
8082 type1 = TREE_TYPE (op1);
8084 /* The expression codes of the data types of the arguments tell us
8085 whether the arguments are integers, floating, pointers, etc. */
8086 code0 = TREE_CODE (type0);
8087 code1 = TREE_CODE (type1);
8089 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
8090 STRIP_TYPE_NOPS (op0);
8091 STRIP_TYPE_NOPS (op1);
8093 /* If an error was already reported for one of the arguments,
8094 avoid reporting another error. */
8096 if (code0 == ERROR_MARK || code1 == ERROR_MARK)
8097 return error_mark_node;
8099 if ((invalid_op_diag
8100 = targetm.invalid_binary_op (code, type0, type1)))
8102 error_at (location, invalid_op_diag);
8103 return error_mark_node;
8106 objc_ok = objc_compare_types (type0, type1, -3, NULL_TREE);
8111 /* Handle the pointer + int case. */
8112 if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
8114 ret = pointer_int_sum (PLUS_EXPR, op0, op1);
8115 goto return_build_binary_op;
8117 else if (code1 == POINTER_TYPE && code0 == INTEGER_TYPE)
8119 ret = pointer_int_sum (PLUS_EXPR, op1, op0);
8120 goto return_build_binary_op;
8127 /* Subtraction of two similar pointers.
8128 We must subtract them as integers, then divide by object size. */
8129 if (code0 == POINTER_TYPE && code1 == POINTER_TYPE
8130 && comp_target_types (type0, type1))
8132 ret = pointer_diff (op0, op1);
8133 goto return_build_binary_op;
8135 /* Handle pointer minus int. Just like pointer plus int. */
8136 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
8138 ret = pointer_int_sum (MINUS_EXPR, op0, op1);
8139 goto return_build_binary_op;
8149 case TRUNC_DIV_EXPR:
8151 case FLOOR_DIV_EXPR:
8152 case ROUND_DIV_EXPR:
8153 case EXACT_DIV_EXPR:
8154 warn_for_div_by_zero (location, op1);
8156 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
8157 || code0 == FIXED_POINT_TYPE
8158 || code0 == COMPLEX_TYPE || code0 == VECTOR_TYPE)
8159 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
8160 || code1 == FIXED_POINT_TYPE
8161 || code1 == COMPLEX_TYPE || code1 == VECTOR_TYPE))
8163 enum tree_code tcode0 = code0, tcode1 = code1;
8165 if (code0 == COMPLEX_TYPE || code0 == VECTOR_TYPE)
8166 tcode0 = TREE_CODE (TREE_TYPE (TREE_TYPE (op0)));
8167 if (code1 == COMPLEX_TYPE || code1 == VECTOR_TYPE)
8168 tcode1 = TREE_CODE (TREE_TYPE (TREE_TYPE (op1)));
8170 if (!((tcode0 == INTEGER_TYPE && tcode1 == INTEGER_TYPE)
8171 || (tcode0 == FIXED_POINT_TYPE && tcode1 == FIXED_POINT_TYPE)))
8172 resultcode = RDIV_EXPR;
8174 /* Although it would be tempting to shorten always here, that
8175 loses on some targets, since the modulo instruction is
8176 undefined if the quotient can't be represented in the
8177 computation mode. We shorten only if unsigned or if
8178 dividing by something we know != -1. */
8179 shorten = (TYPE_UNSIGNED (TREE_TYPE (orig_op0))
8180 || (TREE_CODE (op1) == INTEGER_CST
8181 && !integer_all_onesp (op1)));
8189 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
8191 /* Allow vector types which are not floating point types. */
8192 else if (code0 == VECTOR_TYPE
8193 && code1 == VECTOR_TYPE
8194 && !VECTOR_FLOAT_TYPE_P (type0)
8195 && !VECTOR_FLOAT_TYPE_P (type1))
8199 case TRUNC_MOD_EXPR:
8200 case FLOOR_MOD_EXPR:
8201 warn_for_div_by_zero (location, op1);
8203 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
8205 /* Although it would be tempting to shorten always here, that loses
8206 on some targets, since the modulo instruction is undefined if the
8207 quotient can't be represented in the computation mode. We shorten
8208 only if unsigned or if dividing by something we know != -1. */
8209 shorten = (TYPE_UNSIGNED (TREE_TYPE (orig_op0))
8210 || (TREE_CODE (op1) == INTEGER_CST
8211 && !integer_all_onesp (op1)));
8216 case TRUTH_ANDIF_EXPR:
8217 case TRUTH_ORIF_EXPR:
8218 case TRUTH_AND_EXPR:
8220 case TRUTH_XOR_EXPR:
8221 if ((code0 == INTEGER_TYPE || code0 == POINTER_TYPE
8222 || code0 == REAL_TYPE || code0 == COMPLEX_TYPE
8223 || code0 == FIXED_POINT_TYPE)
8224 && (code1 == INTEGER_TYPE || code1 == POINTER_TYPE
8225 || code1 == REAL_TYPE || code1 == COMPLEX_TYPE
8226 || code1 == FIXED_POINT_TYPE))
8228 /* Result of these operations is always an int,
8229 but that does not mean the operands should be
8230 converted to ints! */
8231 result_type = integer_type_node;
8232 op0 = c_common_truthvalue_conversion (location, op0);
8233 op1 = c_common_truthvalue_conversion (location, op1);
8238 /* Shift operations: result has same type as first operand;
8239 always convert second operand to int.
8240 Also set SHORT_SHIFT if shifting rightward. */
8243 if ((code0 == INTEGER_TYPE || code0 == FIXED_POINT_TYPE)
8244 && code1 == INTEGER_TYPE)
8246 if (TREE_CODE (op1) == INTEGER_CST && skip_evaluation == 0)
8248 if (tree_int_cst_sgn (op1) < 0)
8249 warning (0, "right shift count is negative");
8252 if (!integer_zerop (op1))
8255 if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
8256 warning (0, "right shift count >= width of type");
8260 /* Use the type of the value to be shifted. */
8261 result_type = type0;
8262 /* Convert the shift-count to an integer, regardless of size
8263 of value being shifted. */
8264 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
8265 op1 = convert (integer_type_node, op1);
8266 /* Avoid converting op1 to result_type later. */
8272 if ((code0 == INTEGER_TYPE || code0 == FIXED_POINT_TYPE)
8273 && code1 == INTEGER_TYPE)
8275 if (TREE_CODE (op1) == INTEGER_CST && skip_evaluation == 0)
8277 if (tree_int_cst_sgn (op1) < 0)
8278 warning (0, "left shift count is negative");
8280 else if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
8281 warning (0, "left shift count >= width of type");
8284 /* Use the type of the value to be shifted. */
8285 result_type = type0;
8286 /* Convert the shift-count to an integer, regardless of size
8287 of value being shifted. */
8288 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
8289 op1 = convert (integer_type_node, op1);
8290 /* Avoid converting op1 to result_type later. */
8297 if (FLOAT_TYPE_P (type0) || FLOAT_TYPE_P (type1))
8298 warning_at (location,
8300 "comparing floating point with == or != is unsafe");
8301 /* Result of comparison is always int,
8302 but don't convert the args to int! */
8303 build_type = integer_type_node;
8304 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
8305 || code0 == FIXED_POINT_TYPE || code0 == COMPLEX_TYPE)
8306 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
8307 || code1 == FIXED_POINT_TYPE || code1 == COMPLEX_TYPE))
8309 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
8311 tree tt0 = TREE_TYPE (type0);
8312 tree tt1 = TREE_TYPE (type1);
8313 /* Anything compares with void *. void * compares with anything.
8314 Otherwise, the targets must be compatible
8315 and both must be object or both incomplete. */
8316 if (comp_target_types (type0, type1))
8317 result_type = common_pointer_type (type0, type1);
8318 else if (VOID_TYPE_P (tt0))
8320 /* op0 != orig_op0 detects the case of something
8321 whose value is 0 but which isn't a valid null ptr const. */
8322 if (pedantic && !null_pointer_constant_p (orig_op0)
8323 && TREE_CODE (tt1) == FUNCTION_TYPE)
8324 pedwarn (location, OPT_pedantic, "ISO C forbids "
8325 "comparison of %<void *%> with function pointer");
8327 else if (VOID_TYPE_P (tt1))
8329 if (pedantic && !null_pointer_constant_p (orig_op1)
8330 && TREE_CODE (tt0) == FUNCTION_TYPE)
8331 pedwarn (location, OPT_pedantic, "ISO C forbids "
8332 "comparison of %<void *%> with function pointer");
8335 /* Avoid warning about the volatile ObjC EH puts on decls. */
8337 pedwarn (location, 0,
8338 "comparison of distinct pointer types lacks a cast");
8340 if (result_type == NULL_TREE)
8341 result_type = ptr_type_node;
8343 else if (code0 == POINTER_TYPE && null_pointer_constant_p (orig_op1))
8345 if (TREE_CODE (op0) == ADDR_EXPR
8346 && decl_with_nonnull_addr_p (TREE_OPERAND (op0, 0)))
8347 warning_at (location,
8348 OPT_Waddress, "the address of %qD will never be NULL",
8349 TREE_OPERAND (op0, 0));
8350 result_type = type0;
8352 else if (code1 == POINTER_TYPE && null_pointer_constant_p (orig_op0))
8354 if (TREE_CODE (op1) == ADDR_EXPR
8355 && decl_with_nonnull_addr_p (TREE_OPERAND (op1, 0)))
8356 warning_at (location,
8357 OPT_Waddress, "the address of %qD will never be NULL",
8358 TREE_OPERAND (op1, 0));
8359 result_type = type1;
8361 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
8363 result_type = type0;
8364 pedwarn (location, 0, "comparison between pointer and integer");
8366 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
8368 result_type = type1;
8369 pedwarn (location, 0, "comparison between pointer and integer");
8377 build_type = integer_type_node;
8378 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
8379 || code0 == FIXED_POINT_TYPE)
8380 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
8381 || code1 == FIXED_POINT_TYPE))
8383 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
8385 if (comp_target_types (type0, type1))
8387 result_type = common_pointer_type (type0, type1);
8388 if (!COMPLETE_TYPE_P (TREE_TYPE (type0))
8389 != !COMPLETE_TYPE_P (TREE_TYPE (type1)))
8390 pedwarn (location, 0,
8391 "comparison of complete and incomplete pointers");
8392 else if (TREE_CODE (TREE_TYPE (type0)) == FUNCTION_TYPE)
8393 pedwarn (location, OPT_pedantic, "ISO C forbids "
8394 "ordered comparisons of pointers to functions");
8398 result_type = ptr_type_node;
8399 pedwarn (location, 0,
8400 "comparison of distinct pointer types lacks a cast");
8403 else if (code0 == POINTER_TYPE && null_pointer_constant_p (orig_op1))
8405 result_type = type0;
8407 pedwarn (location, OPT_pedantic,
8408 "ordered comparison of pointer with integer zero");
8409 else if (extra_warnings)
8410 warning_at (location, OPT_Wextra,
8411 "ordered comparison of pointer with integer zero");
8413 else if (code1 == POINTER_TYPE && null_pointer_constant_p (orig_op0))
8415 result_type = type1;
8416 pedwarn (location, OPT_pedantic,
8417 "ordered comparison of pointer with integer zero");
8419 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
8421 result_type = type0;
8422 pedwarn (location, 0, "comparison between pointer and integer");
8424 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
8426 result_type = type1;
8427 pedwarn (location, 0, "comparison between pointer and integer");
8435 if (code0 == ERROR_MARK || code1 == ERROR_MARK)
8436 return error_mark_node;
8438 if (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE
8439 && (!tree_int_cst_equal (TYPE_SIZE (type0), TYPE_SIZE (type1))
8440 || !same_scalar_type_ignoring_signedness (TREE_TYPE (type0),
8441 TREE_TYPE (type1))))
8443 binary_op_error (location, code, type0, type1);
8444 return error_mark_node;
8447 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE || code0 == COMPLEX_TYPE
8448 || code0 == FIXED_POINT_TYPE || code0 == VECTOR_TYPE)
8450 (code1 == INTEGER_TYPE || code1 == REAL_TYPE || code1 == COMPLEX_TYPE
8451 || code1 == FIXED_POINT_TYPE || code1 == VECTOR_TYPE))
8453 int none_complex = (code0 != COMPLEX_TYPE && code1 != COMPLEX_TYPE);
8455 if (shorten || common || short_compare)
8457 result_type = c_common_type (type0, type1);
8458 if (result_type == error_mark_node)
8459 return error_mark_node;
8462 /* For certain operations (which identify themselves by shorten != 0)
8463 if both args were extended from the same smaller type,
8464 do the arithmetic in that type and then extend.
8466 shorten !=0 and !=1 indicates a bitwise operation.
8467 For them, this optimization is safe only if
8468 both args are zero-extended or both are sign-extended.
8469 Otherwise, we might change the result.
8470 Eg, (short)-1 | (unsigned short)-1 is (int)-1
8471 but calculated in (unsigned short) it would be (unsigned short)-1. */
8473 if (shorten && none_complex)
8475 final_type = result_type;
8476 result_type = shorten_binary_op (result_type, op0, op1,
8480 /* Shifts can be shortened if shifting right. */
8485 tree arg0 = get_narrower (op0, &unsigned_arg);
8487 final_type = result_type;
8489 if (arg0 == op0 && final_type == TREE_TYPE (op0))
8490 unsigned_arg = TYPE_UNSIGNED (TREE_TYPE (op0));
8492 if (TYPE_PRECISION (TREE_TYPE (arg0)) < TYPE_PRECISION (result_type)
8493 && tree_int_cst_sgn (op1) > 0
8494 /* We can shorten only if the shift count is less than the
8495 number of bits in the smaller type size. */
8496 && compare_tree_int (op1, TYPE_PRECISION (TREE_TYPE (arg0))) < 0
8497 /* We cannot drop an unsigned shift after sign-extension. */
8498 && (!TYPE_UNSIGNED (final_type) || unsigned_arg))
8500 /* Do an unsigned shift if the operand was zero-extended. */
8502 = c_common_signed_or_unsigned_type (unsigned_arg,
8504 /* Convert value-to-be-shifted to that type. */
8505 if (TREE_TYPE (op0) != result_type)
8506 op0 = convert (result_type, op0);
8511 /* Comparison operations are shortened too but differently.
8512 They identify themselves by setting short_compare = 1. */
8516 /* Don't write &op0, etc., because that would prevent op0
8517 from being kept in a register.
8518 Instead, make copies of the our local variables and
8519 pass the copies by reference, then copy them back afterward. */
8520 tree xop0 = op0, xop1 = op1, xresult_type = result_type;
8521 enum tree_code xresultcode = resultcode;
8523 = shorten_compare (&xop0, &xop1, &xresult_type, &xresultcode);
8528 goto return_build_binary_op;
8531 op0 = xop0, op1 = xop1;
8533 resultcode = xresultcode;
8535 if (warn_sign_compare && !skip_evaluation)
8537 warn_for_sign_compare (location, orig_op0, orig_op1, op0, op1,
8538 result_type, resultcode);
8543 /* At this point, RESULT_TYPE must be nonzero to avoid an error message.
8544 If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
8545 Then the expression will be built.
8546 It will be given type FINAL_TYPE if that is nonzero;
8547 otherwise, it will be given type RESULT_TYPE. */
8551 binary_op_error (location, code, TREE_TYPE (op0), TREE_TYPE (op1));
8552 return error_mark_node;
8557 if (TREE_TYPE (op0) != result_type)
8558 op0 = convert_and_check (result_type, op0);
8559 if (TREE_TYPE (op1) != result_type)
8560 op1 = convert_and_check (result_type, op1);
8562 /* This can happen if one operand has a vector type, and the other
8563 has a different type. */
8564 if (TREE_CODE (op0) == ERROR_MARK || TREE_CODE (op1) == ERROR_MARK)
8565 return error_mark_node;
8568 if (build_type == NULL_TREE)
8569 build_type = result_type;
8571 /* Treat expressions in initializers specially as they can't trap. */
8572 ret = require_constant_value ? fold_build2_initializer (resultcode,
8575 : fold_build2 (resultcode, build_type,
8577 if (final_type != 0)
8578 ret = convert (final_type, ret);
8580 return_build_binary_op:
8581 gcc_assert (ret != error_mark_node);
8582 protected_set_expr_location (ret, location);
8587 /* Convert EXPR to be a truth-value, validating its type for this
8588 purpose. LOCATION is the source location for the expression. */
8591 c_objc_common_truthvalue_conversion (location_t location, tree expr)
8593 switch (TREE_CODE (TREE_TYPE (expr)))
8596 error_at (location, "used array that cannot be converted to pointer where scalar is required");
8597 return error_mark_node;
8600 error_at (location, "used struct type value where scalar is required");
8601 return error_mark_node;
8604 error_at (location, "used union type value where scalar is required");
8605 return error_mark_node;
8614 /* ??? Should we also give an error for void and vectors rather than
8615 leaving those to give errors later? */
8616 return c_common_truthvalue_conversion (location, expr);
8620 /* Convert EXPR to a contained DECL, updating *TC, *TI and *SE as
8624 c_expr_to_decl (tree expr, bool *tc ATTRIBUTE_UNUSED, bool *se)
8626 if (TREE_CODE (expr) == COMPOUND_LITERAL_EXPR)
8628 tree decl = COMPOUND_LITERAL_EXPR_DECL (expr);
8629 /* Executing a compound literal inside a function reinitializes
8631 if (!TREE_STATIC (decl))
8639 /* Like c_begin_compound_stmt, except force the retention of the BLOCK. */
8642 c_begin_omp_parallel (void)
8647 block = c_begin_compound_stmt (true);
8652 /* Generate OMP_PARALLEL, with CLAUSES and BLOCK as its compound statement. */
8655 c_finish_omp_parallel (tree clauses, tree block)
8659 block = c_end_compound_stmt (block, true);
8661 stmt = make_node (OMP_PARALLEL);
8662 TREE_TYPE (stmt) = void_type_node;
8663 OMP_PARALLEL_CLAUSES (stmt) = clauses;
8664 OMP_PARALLEL_BODY (stmt) = block;
8666 return add_stmt (stmt);
8669 /* Like c_begin_compound_stmt, except force the retention of the BLOCK. */
8672 c_begin_omp_task (void)
8677 block = c_begin_compound_stmt (true);
8682 /* Generate OMP_TASK, with CLAUSES and BLOCK as its compound statement. */
8685 c_finish_omp_task (tree clauses, tree block)
8689 block = c_end_compound_stmt (block, true);
8691 stmt = make_node (OMP_TASK);
8692 TREE_TYPE (stmt) = void_type_node;
8693 OMP_TASK_CLAUSES (stmt) = clauses;
8694 OMP_TASK_BODY (stmt) = block;
8696 return add_stmt (stmt);
8699 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
8700 Remove any elements from the list that are invalid. */
8703 c_finish_omp_clauses (tree clauses)
8705 bitmap_head generic_head, firstprivate_head, lastprivate_head;
8706 tree c, t, *pc = &clauses;
8709 bitmap_obstack_initialize (NULL);
8710 bitmap_initialize (&generic_head, &bitmap_default_obstack);
8711 bitmap_initialize (&firstprivate_head, &bitmap_default_obstack);
8712 bitmap_initialize (&lastprivate_head, &bitmap_default_obstack);
8714 for (pc = &clauses, c = clauses; c ; c = *pc)
8716 bool remove = false;
8717 bool need_complete = false;
8718 bool need_implicitly_determined = false;
8720 switch (OMP_CLAUSE_CODE (c))
8722 case OMP_CLAUSE_SHARED:
8724 need_implicitly_determined = true;
8725 goto check_dup_generic;
8727 case OMP_CLAUSE_PRIVATE:
8729 need_complete = true;
8730 need_implicitly_determined = true;
8731 goto check_dup_generic;
8733 case OMP_CLAUSE_REDUCTION:
8735 need_implicitly_determined = true;
8736 t = OMP_CLAUSE_DECL (c);
8737 if (AGGREGATE_TYPE_P (TREE_TYPE (t))
8738 || POINTER_TYPE_P (TREE_TYPE (t)))
8740 error ("%qE has invalid type for %<reduction%>", t);
8743 else if (FLOAT_TYPE_P (TREE_TYPE (t)))
8745 enum tree_code r_code = OMP_CLAUSE_REDUCTION_CODE (c);
8746 const char *r_name = NULL;
8763 case TRUTH_ANDIF_EXPR:
8766 case TRUTH_ORIF_EXPR:
8774 error ("%qE has invalid type for %<reduction(%s)%>",
8779 goto check_dup_generic;
8781 case OMP_CLAUSE_COPYPRIVATE:
8782 name = "copyprivate";
8783 goto check_dup_generic;
8785 case OMP_CLAUSE_COPYIN:
8787 t = OMP_CLAUSE_DECL (c);
8788 if (TREE_CODE (t) != VAR_DECL || !DECL_THREAD_LOCAL_P (t))
8790 error ("%qE must be %<threadprivate%> for %<copyin%>", t);
8793 goto check_dup_generic;
8796 t = OMP_CLAUSE_DECL (c);
8797 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
8799 error ("%qE is not a variable in clause %qs", t, name);
8802 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
8803 || bitmap_bit_p (&firstprivate_head, DECL_UID (t))
8804 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
8806 error ("%qE appears more than once in data clauses", t);
8810 bitmap_set_bit (&generic_head, DECL_UID (t));
8813 case OMP_CLAUSE_FIRSTPRIVATE:
8814 name = "firstprivate";
8815 t = OMP_CLAUSE_DECL (c);
8816 need_complete = true;
8817 need_implicitly_determined = true;
8818 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
8820 error ("%qE is not a variable in clause %<firstprivate%>", t);
8823 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
8824 || bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
8826 error ("%qE appears more than once in data clauses", t);
8830 bitmap_set_bit (&firstprivate_head, DECL_UID (t));
8833 case OMP_CLAUSE_LASTPRIVATE:
8834 name = "lastprivate";
8835 t = OMP_CLAUSE_DECL (c);
8836 need_complete = true;
8837 need_implicitly_determined = true;
8838 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
8840 error ("%qE is not a variable in clause %<lastprivate%>", t);
8843 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
8844 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
8846 error ("%qE appears more than once in data clauses", t);
8850 bitmap_set_bit (&lastprivate_head, DECL_UID (t));
8854 case OMP_CLAUSE_NUM_THREADS:
8855 case OMP_CLAUSE_SCHEDULE:
8856 case OMP_CLAUSE_NOWAIT:
8857 case OMP_CLAUSE_ORDERED:
8858 case OMP_CLAUSE_DEFAULT:
8859 case OMP_CLAUSE_UNTIED:
8860 case OMP_CLAUSE_COLLAPSE:
8861 pc = &OMP_CLAUSE_CHAIN (c);
8870 t = OMP_CLAUSE_DECL (c);
8874 t = require_complete_type (t);
8875 if (t == error_mark_node)
8879 if (need_implicitly_determined)
8881 const char *share_name = NULL;
8883 if (TREE_CODE (t) == VAR_DECL && DECL_THREAD_LOCAL_P (t))
8884 share_name = "threadprivate";
8885 else switch (c_omp_predetermined_sharing (t))
8887 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
8889 case OMP_CLAUSE_DEFAULT_SHARED:
8890 share_name = "shared";
8892 case OMP_CLAUSE_DEFAULT_PRIVATE:
8893 share_name = "private";
8900 error ("%qE is predetermined %qs for %qs",
8901 t, share_name, name);
8908 *pc = OMP_CLAUSE_CHAIN (c);
8910 pc = &OMP_CLAUSE_CHAIN (c);
8913 bitmap_obstack_release (NULL);
8917 /* Make a variant type in the proper way for C/C++, propagating qualifiers
8918 down to the element type of an array. */
8921 c_build_qualified_type (tree type, int type_quals)
8923 if (type == error_mark_node)
8926 if (TREE_CODE (type) == ARRAY_TYPE)
8929 tree element_type = c_build_qualified_type (TREE_TYPE (type),
8932 /* See if we already have an identically qualified type. */
8933 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
8935 if (TYPE_QUALS (strip_array_types (t)) == type_quals
8936 && TYPE_NAME (t) == TYPE_NAME (type)
8937 && TYPE_CONTEXT (t) == TYPE_CONTEXT (type)
8938 && attribute_list_equal (TYPE_ATTRIBUTES (t),
8939 TYPE_ATTRIBUTES (type)))
8944 tree domain = TYPE_DOMAIN (type);
8946 t = build_variant_type_copy (type);
8947 TREE_TYPE (t) = element_type;
8949 if (TYPE_STRUCTURAL_EQUALITY_P (element_type)
8950 || (domain && TYPE_STRUCTURAL_EQUALITY_P (domain)))
8951 SET_TYPE_STRUCTURAL_EQUALITY (t);
8952 else if (TYPE_CANONICAL (element_type) != element_type
8953 || (domain && TYPE_CANONICAL (domain) != domain))
8955 tree unqualified_canon
8956 = build_array_type (TYPE_CANONICAL (element_type),
8957 domain? TYPE_CANONICAL (domain)
8960 = c_build_qualified_type (unqualified_canon, type_quals);
8963 TYPE_CANONICAL (t) = t;
8968 /* A restrict-qualified pointer type must be a pointer to object or
8969 incomplete type. Note that the use of POINTER_TYPE_P also allows
8970 REFERENCE_TYPEs, which is appropriate for C++. */
8971 if ((type_quals & TYPE_QUAL_RESTRICT)
8972 && (!POINTER_TYPE_P (type)
8973 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type))))
8975 error ("invalid use of %<restrict%>");
8976 type_quals &= ~TYPE_QUAL_RESTRICT;
8979 return build_qualified_type (type, type_quals);