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
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);
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);
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;
330 /* We should not have any type quals on arrays at all. */
331 gcc_assert (!TYPE_QUALS (t1) && !TYPE_QUALS (t2));
333 d1_zero = d1 == 0 || !TYPE_MAX_VALUE (d1);
334 d2_zero = d2 == 0 || !TYPE_MAX_VALUE (d2);
336 d1_variable = (!d1_zero
337 && (TREE_CODE (TYPE_MIN_VALUE (d1)) != INTEGER_CST
338 || TREE_CODE (TYPE_MAX_VALUE (d1)) != INTEGER_CST));
339 d2_variable = (!d2_zero
340 && (TREE_CODE (TYPE_MIN_VALUE (d2)) != INTEGER_CST
341 || TREE_CODE (TYPE_MAX_VALUE (d2)) != INTEGER_CST));
342 d1_variable = d1_variable || (d1_zero && c_vla_type_p (t1));
343 d2_variable = d2_variable || (d2_zero && c_vla_type_p (t2));
345 /* Save space: see if the result is identical to one of the args. */
346 if (elt == TREE_TYPE (t1) && TYPE_DOMAIN (t1)
347 && (d2_variable || d2_zero || !d1_variable))
348 return build_type_attribute_variant (t1, attributes);
349 if (elt == TREE_TYPE (t2) && TYPE_DOMAIN (t2)
350 && (d1_variable || d1_zero || !d2_variable))
351 return build_type_attribute_variant (t2, attributes);
353 if (elt == TREE_TYPE (t1) && !TYPE_DOMAIN (t2) && !TYPE_DOMAIN (t1))
354 return build_type_attribute_variant (t1, attributes);
355 if (elt == TREE_TYPE (t2) && !TYPE_DOMAIN (t2) && !TYPE_DOMAIN (t1))
356 return build_type_attribute_variant (t2, attributes);
358 /* Merge the element types, and have a size if either arg has
359 one. We may have qualifiers on the element types. To set
360 up TYPE_MAIN_VARIANT correctly, we need to form the
361 composite of the unqualified types and add the qualifiers
363 quals = TYPE_QUALS (strip_array_types (elt));
364 unqual_elt = c_build_qualified_type (elt, TYPE_UNQUALIFIED);
365 t1 = build_array_type (unqual_elt,
366 TYPE_DOMAIN ((TYPE_DOMAIN (t1)
372 t1 = c_build_qualified_type (t1, quals);
373 return build_type_attribute_variant (t1, attributes);
379 if (attributes != NULL)
381 /* Try harder not to create a new aggregate type. */
382 if (attribute_list_equal (TYPE_ATTRIBUTES (t1), attributes))
384 if (attribute_list_equal (TYPE_ATTRIBUTES (t2), attributes))
387 return build_type_attribute_variant (t1, attributes);
390 /* Function types: prefer the one that specified arg types.
391 If both do, merge the arg types. Also merge the return types. */
393 tree valtype = composite_type (TREE_TYPE (t1), TREE_TYPE (t2));
394 tree p1 = TYPE_ARG_TYPES (t1);
395 tree p2 = TYPE_ARG_TYPES (t2);
400 /* Save space: see if the result is identical to one of the args. */
401 if (valtype == TREE_TYPE (t1) && !TYPE_ARG_TYPES (t2))
402 return build_type_attribute_variant (t1, attributes);
403 if (valtype == TREE_TYPE (t2) && !TYPE_ARG_TYPES (t1))
404 return build_type_attribute_variant (t2, attributes);
406 /* Simple way if one arg fails to specify argument types. */
407 if (TYPE_ARG_TYPES (t1) == 0)
409 t1 = build_function_type (valtype, TYPE_ARG_TYPES (t2));
410 t1 = build_type_attribute_variant (t1, attributes);
411 return qualify_type (t1, t2);
413 if (TYPE_ARG_TYPES (t2) == 0)
415 t1 = build_function_type (valtype, TYPE_ARG_TYPES (t1));
416 t1 = build_type_attribute_variant (t1, attributes);
417 return qualify_type (t1, t2);
420 /* If both args specify argument types, we must merge the two
421 lists, argument by argument. */
422 /* Tell global_bindings_p to return false so that variable_size
423 doesn't die on VLAs in parameter types. */
424 c_override_global_bindings_to_false = true;
426 len = list_length (p1);
429 for (i = 0; i < len; i++)
430 newargs = tree_cons (NULL_TREE, NULL_TREE, newargs);
435 p1 = TREE_CHAIN (p1), p2 = TREE_CHAIN (p2), n = TREE_CHAIN (n))
437 /* A null type means arg type is not specified.
438 Take whatever the other function type has. */
439 if (TREE_VALUE (p1) == 0)
441 TREE_VALUE (n) = TREE_VALUE (p2);
444 if (TREE_VALUE (p2) == 0)
446 TREE_VALUE (n) = TREE_VALUE (p1);
450 /* Given wait (union {union wait *u; int *i} *)
451 and wait (union wait *),
452 prefer union wait * as type of parm. */
453 if (TREE_CODE (TREE_VALUE (p1)) == UNION_TYPE
454 && TREE_VALUE (p1) != TREE_VALUE (p2))
457 tree mv2 = TREE_VALUE (p2);
458 if (mv2 && mv2 != error_mark_node
459 && TREE_CODE (mv2) != ARRAY_TYPE)
460 mv2 = TYPE_MAIN_VARIANT (mv2);
461 for (memb = TYPE_FIELDS (TREE_VALUE (p1));
462 memb; memb = TREE_CHAIN (memb))
464 tree mv3 = TREE_TYPE (memb);
465 if (mv3 && mv3 != error_mark_node
466 && TREE_CODE (mv3) != ARRAY_TYPE)
467 mv3 = TYPE_MAIN_VARIANT (mv3);
468 if (comptypes (mv3, mv2))
470 TREE_VALUE (n) = composite_type (TREE_TYPE (memb),
472 pedwarn (input_location, OPT_pedantic,
473 "function types not truly compatible in ISO C");
478 if (TREE_CODE (TREE_VALUE (p2)) == UNION_TYPE
479 && TREE_VALUE (p2) != TREE_VALUE (p1))
482 tree mv1 = TREE_VALUE (p1);
483 if (mv1 && mv1 != error_mark_node
484 && TREE_CODE (mv1) != ARRAY_TYPE)
485 mv1 = TYPE_MAIN_VARIANT (mv1);
486 for (memb = TYPE_FIELDS (TREE_VALUE (p2));
487 memb; memb = TREE_CHAIN (memb))
489 tree mv3 = TREE_TYPE (memb);
490 if (mv3 && mv3 != error_mark_node
491 && TREE_CODE (mv3) != ARRAY_TYPE)
492 mv3 = TYPE_MAIN_VARIANT (mv3);
493 if (comptypes (mv3, mv1))
495 TREE_VALUE (n) = composite_type (TREE_TYPE (memb),
497 pedwarn (input_location, OPT_pedantic,
498 "function types not truly compatible in ISO C");
503 TREE_VALUE (n) = composite_type (TREE_VALUE (p1), TREE_VALUE (p2));
507 c_override_global_bindings_to_false = false;
508 t1 = build_function_type (valtype, newargs);
509 t1 = qualify_type (t1, t2);
510 /* ... falls through ... */
514 return build_type_attribute_variant (t1, attributes);
519 /* Return the type of a conditional expression between pointers to
520 possibly differently qualified versions of compatible types.
522 We assume that comp_target_types has already been done and returned
523 nonzero; if that isn't so, this may crash. */
526 common_pointer_type (tree t1, tree t2)
529 tree pointed_to_1, mv1;
530 tree pointed_to_2, mv2;
532 unsigned target_quals;
534 /* Save time if the two types are the same. */
536 if (t1 == t2) return t1;
538 /* If one type is nonsense, use the other. */
539 if (t1 == error_mark_node)
541 if (t2 == error_mark_node)
544 gcc_assert (TREE_CODE (t1) == POINTER_TYPE
545 && TREE_CODE (t2) == POINTER_TYPE);
547 /* Merge the attributes. */
548 attributes = targetm.merge_type_attributes (t1, t2);
550 /* Find the composite type of the target types, and combine the
551 qualifiers of the two types' targets. Do not lose qualifiers on
552 array element types by taking the TYPE_MAIN_VARIANT. */
553 mv1 = pointed_to_1 = TREE_TYPE (t1);
554 mv2 = pointed_to_2 = TREE_TYPE (t2);
555 if (TREE_CODE (mv1) != ARRAY_TYPE)
556 mv1 = TYPE_MAIN_VARIANT (pointed_to_1);
557 if (TREE_CODE (mv2) != ARRAY_TYPE)
558 mv2 = TYPE_MAIN_VARIANT (pointed_to_2);
559 target = composite_type (mv1, mv2);
561 /* For function types do not merge const qualifiers, but drop them
562 if used inconsistently. The middle-end uses these to mark const
563 and noreturn functions. */
564 if (TREE_CODE (pointed_to_1) == FUNCTION_TYPE)
565 target_quals = TYPE_QUALS (pointed_to_1) & TYPE_QUALS (pointed_to_2);
567 target_quals = TYPE_QUALS (pointed_to_1) | TYPE_QUALS (pointed_to_2);
568 t1 = build_pointer_type (c_build_qualified_type (target, target_quals));
569 return build_type_attribute_variant (t1, attributes);
572 /* Return the common type for two arithmetic types under the usual
573 arithmetic conversions. The default conversions have already been
574 applied, and enumerated types converted to their compatible integer
575 types. The resulting type is unqualified and has no attributes.
577 This is the type for the result of most arithmetic operations
578 if the operands have the given two types. */
581 c_common_type (tree t1, tree t2)
583 enum tree_code code1;
584 enum tree_code code2;
586 /* If one type is nonsense, use the other. */
587 if (t1 == error_mark_node)
589 if (t2 == error_mark_node)
592 if (TYPE_QUALS (t1) != TYPE_UNQUALIFIED)
593 t1 = TYPE_MAIN_VARIANT (t1);
595 if (TYPE_QUALS (t2) != TYPE_UNQUALIFIED)
596 t2 = TYPE_MAIN_VARIANT (t2);
598 if (TYPE_ATTRIBUTES (t1) != NULL_TREE)
599 t1 = build_type_attribute_variant (t1, NULL_TREE);
601 if (TYPE_ATTRIBUTES (t2) != NULL_TREE)
602 t2 = build_type_attribute_variant (t2, NULL_TREE);
604 /* Save time if the two types are the same. */
606 if (t1 == t2) return t1;
608 code1 = TREE_CODE (t1);
609 code2 = TREE_CODE (t2);
611 gcc_assert (code1 == VECTOR_TYPE || code1 == COMPLEX_TYPE
612 || code1 == FIXED_POINT_TYPE || code1 == REAL_TYPE
613 || code1 == INTEGER_TYPE);
614 gcc_assert (code2 == VECTOR_TYPE || code2 == COMPLEX_TYPE
615 || code2 == FIXED_POINT_TYPE || code2 == REAL_TYPE
616 || code2 == INTEGER_TYPE);
618 /* When one operand is a decimal float type, the other operand cannot be
619 a generic float type or a complex type. We also disallow vector types
621 if ((DECIMAL_FLOAT_TYPE_P (t1) || DECIMAL_FLOAT_TYPE_P (t2))
622 && !(DECIMAL_FLOAT_TYPE_P (t1) && DECIMAL_FLOAT_TYPE_P (t2)))
624 if (code1 == VECTOR_TYPE || code2 == VECTOR_TYPE)
626 error ("can%'t mix operands of decimal float and vector types");
627 return error_mark_node;
629 if (code1 == COMPLEX_TYPE || code2 == COMPLEX_TYPE)
631 error ("can%'t mix operands of decimal float and complex types");
632 return error_mark_node;
634 if (code1 == REAL_TYPE && code2 == REAL_TYPE)
636 error ("can%'t mix operands of decimal float and other float types");
637 return error_mark_node;
641 /* If one type is a vector type, return that type. (How the usual
642 arithmetic conversions apply to the vector types extension is not
643 precisely specified.) */
644 if (code1 == VECTOR_TYPE)
647 if (code2 == VECTOR_TYPE)
650 /* If one type is complex, form the common type of the non-complex
651 components, then make that complex. Use T1 or T2 if it is the
653 if (code1 == COMPLEX_TYPE || code2 == COMPLEX_TYPE)
655 tree subtype1 = code1 == COMPLEX_TYPE ? TREE_TYPE (t1) : t1;
656 tree subtype2 = code2 == COMPLEX_TYPE ? TREE_TYPE (t2) : t2;
657 tree subtype = c_common_type (subtype1, subtype2);
659 if (code1 == COMPLEX_TYPE && TREE_TYPE (t1) == subtype)
661 else if (code2 == COMPLEX_TYPE && TREE_TYPE (t2) == subtype)
664 return build_complex_type (subtype);
667 /* If only one is real, use it as the result. */
669 if (code1 == REAL_TYPE && code2 != REAL_TYPE)
672 if (code2 == REAL_TYPE && code1 != REAL_TYPE)
675 /* If both are real and either are decimal floating point types, use
676 the decimal floating point type with the greater precision. */
678 if (code1 == REAL_TYPE && code2 == REAL_TYPE)
680 if (TYPE_MAIN_VARIANT (t1) == dfloat128_type_node
681 || TYPE_MAIN_VARIANT (t2) == dfloat128_type_node)
682 return dfloat128_type_node;
683 else if (TYPE_MAIN_VARIANT (t1) == dfloat64_type_node
684 || TYPE_MAIN_VARIANT (t2) == dfloat64_type_node)
685 return dfloat64_type_node;
686 else if (TYPE_MAIN_VARIANT (t1) == dfloat32_type_node
687 || TYPE_MAIN_VARIANT (t2) == dfloat32_type_node)
688 return dfloat32_type_node;
691 /* Deal with fixed-point types. */
692 if (code1 == FIXED_POINT_TYPE || code2 == FIXED_POINT_TYPE)
694 unsigned int unsignedp = 0, satp = 0;
695 enum machine_mode m1, m2;
696 unsigned int fbit1, ibit1, fbit2, ibit2, max_fbit, max_ibit;
701 /* If one input type is saturating, the result type is saturating. */
702 if (TYPE_SATURATING (t1) || TYPE_SATURATING (t2))
705 /* If both fixed-point types are unsigned, the result type is unsigned.
706 When mixing fixed-point and integer types, follow the sign of the
708 Otherwise, the result type is signed. */
709 if ((TYPE_UNSIGNED (t1) && TYPE_UNSIGNED (t2)
710 && code1 == FIXED_POINT_TYPE && code2 == FIXED_POINT_TYPE)
711 || (code1 == FIXED_POINT_TYPE && code2 != FIXED_POINT_TYPE
712 && TYPE_UNSIGNED (t1))
713 || (code1 != FIXED_POINT_TYPE && code2 == FIXED_POINT_TYPE
714 && TYPE_UNSIGNED (t2)))
717 /* The result type is signed. */
720 /* If the input type is unsigned, we need to convert to the
722 if (code1 == FIXED_POINT_TYPE && TYPE_UNSIGNED (t1))
724 enum mode_class mclass = (enum mode_class) 0;
725 if (GET_MODE_CLASS (m1) == MODE_UFRACT)
727 else if (GET_MODE_CLASS (m1) == MODE_UACCUM)
731 m1 = mode_for_size (GET_MODE_PRECISION (m1), mclass, 0);
733 if (code2 == FIXED_POINT_TYPE && TYPE_UNSIGNED (t2))
735 enum mode_class mclass = (enum mode_class) 0;
736 if (GET_MODE_CLASS (m2) == MODE_UFRACT)
738 else if (GET_MODE_CLASS (m2) == MODE_UACCUM)
742 m2 = mode_for_size (GET_MODE_PRECISION (m2), mclass, 0);
746 if (code1 == FIXED_POINT_TYPE)
748 fbit1 = GET_MODE_FBIT (m1);
749 ibit1 = GET_MODE_IBIT (m1);
754 /* Signed integers need to subtract one sign bit. */
755 ibit1 = TYPE_PRECISION (t1) - (!TYPE_UNSIGNED (t1));
758 if (code2 == FIXED_POINT_TYPE)
760 fbit2 = GET_MODE_FBIT (m2);
761 ibit2 = GET_MODE_IBIT (m2);
766 /* Signed integers need to subtract one sign bit. */
767 ibit2 = TYPE_PRECISION (t2) - (!TYPE_UNSIGNED (t2));
770 max_ibit = ibit1 >= ibit2 ? ibit1 : ibit2;
771 max_fbit = fbit1 >= fbit2 ? fbit1 : fbit2;
772 return c_common_fixed_point_type_for_size (max_ibit, max_fbit, unsignedp,
776 /* Both real or both integers; use the one with greater precision. */
778 if (TYPE_PRECISION (t1) > TYPE_PRECISION (t2))
780 else if (TYPE_PRECISION (t2) > TYPE_PRECISION (t1))
783 /* Same precision. Prefer long longs to longs to ints when the
784 same precision, following the C99 rules on integer type rank
785 (which are equivalent to the C90 rules for C90 types). */
787 if (TYPE_MAIN_VARIANT (t1) == long_long_unsigned_type_node
788 || TYPE_MAIN_VARIANT (t2) == long_long_unsigned_type_node)
789 return long_long_unsigned_type_node;
791 if (TYPE_MAIN_VARIANT (t1) == long_long_integer_type_node
792 || TYPE_MAIN_VARIANT (t2) == long_long_integer_type_node)
794 if (TYPE_UNSIGNED (t1) || TYPE_UNSIGNED (t2))
795 return long_long_unsigned_type_node;
797 return long_long_integer_type_node;
800 if (TYPE_MAIN_VARIANT (t1) == long_unsigned_type_node
801 || TYPE_MAIN_VARIANT (t2) == long_unsigned_type_node)
802 return long_unsigned_type_node;
804 if (TYPE_MAIN_VARIANT (t1) == long_integer_type_node
805 || TYPE_MAIN_VARIANT (t2) == long_integer_type_node)
807 /* But preserve unsignedness from the other type,
808 since long cannot hold all the values of an unsigned int. */
809 if (TYPE_UNSIGNED (t1) || TYPE_UNSIGNED (t2))
810 return long_unsigned_type_node;
812 return long_integer_type_node;
815 /* Likewise, prefer long double to double even if same size. */
816 if (TYPE_MAIN_VARIANT (t1) == long_double_type_node
817 || TYPE_MAIN_VARIANT (t2) == long_double_type_node)
818 return long_double_type_node;
820 /* Otherwise prefer the unsigned one. */
822 if (TYPE_UNSIGNED (t1))
828 /* Wrapper around c_common_type that is used by c-common.c and other
829 front end optimizations that remove promotions. ENUMERAL_TYPEs
830 are allowed here and are converted to their compatible integer types.
831 BOOLEAN_TYPEs are allowed here and return either boolean_type_node or
832 preferably a non-Boolean type as the common type. */
834 common_type (tree t1, tree t2)
836 if (TREE_CODE (t1) == ENUMERAL_TYPE)
837 t1 = c_common_type_for_size (TYPE_PRECISION (t1), 1);
838 if (TREE_CODE (t2) == ENUMERAL_TYPE)
839 t2 = c_common_type_for_size (TYPE_PRECISION (t2), 1);
841 /* If both types are BOOLEAN_TYPE, then return boolean_type_node. */
842 if (TREE_CODE (t1) == BOOLEAN_TYPE
843 && TREE_CODE (t2) == BOOLEAN_TYPE)
844 return boolean_type_node;
846 /* If either type is BOOLEAN_TYPE, then return the other. */
847 if (TREE_CODE (t1) == BOOLEAN_TYPE)
849 if (TREE_CODE (t2) == BOOLEAN_TYPE)
852 return c_common_type (t1, t2);
855 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
856 or various other operations. Return 2 if they are compatible
857 but a warning may be needed if you use them together. */
860 comptypes (tree type1, tree type2)
862 const struct tagged_tu_seen_cache * tagged_tu_seen_base1 = tagged_tu_seen_base;
865 val = comptypes_internal (type1, type2);
866 free_all_tagged_tu_seen_up_to (tagged_tu_seen_base1);
871 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
872 or various other operations. Return 2 if they are compatible
873 but a warning may be needed if you use them together. This
874 differs from comptypes, in that we don't free the seen types. */
877 comptypes_internal (const_tree type1, const_tree type2)
879 const_tree t1 = type1;
880 const_tree t2 = type2;
883 /* Suppress errors caused by previously reported errors. */
885 if (t1 == t2 || !t1 || !t2
886 || TREE_CODE (t1) == ERROR_MARK || TREE_CODE (t2) == ERROR_MARK)
889 /* If either type is the internal version of sizetype, return the
891 if (TREE_CODE (t1) == INTEGER_TYPE && TYPE_IS_SIZETYPE (t1)
892 && TYPE_ORIG_SIZE_TYPE (t1))
893 t1 = TYPE_ORIG_SIZE_TYPE (t1);
895 if (TREE_CODE (t2) == INTEGER_TYPE && TYPE_IS_SIZETYPE (t2)
896 && TYPE_ORIG_SIZE_TYPE (t2))
897 t2 = TYPE_ORIG_SIZE_TYPE (t2);
900 /* Enumerated types are compatible with integer types, but this is
901 not transitive: two enumerated types in the same translation unit
902 are compatible with each other only if they are the same type. */
904 if (TREE_CODE (t1) == ENUMERAL_TYPE && TREE_CODE (t2) != ENUMERAL_TYPE)
905 t1 = c_common_type_for_size (TYPE_PRECISION (t1), TYPE_UNSIGNED (t1));
906 else if (TREE_CODE (t2) == ENUMERAL_TYPE && TREE_CODE (t1) != ENUMERAL_TYPE)
907 t2 = c_common_type_for_size (TYPE_PRECISION (t2), TYPE_UNSIGNED (t2));
912 /* Different classes of types can't be compatible. */
914 if (TREE_CODE (t1) != TREE_CODE (t2))
917 /* Qualifiers must match. C99 6.7.3p9 */
919 if (TYPE_QUALS (t1) != TYPE_QUALS (t2))
922 /* Allow for two different type nodes which have essentially the same
923 definition. Note that we already checked for equality of the type
924 qualifiers (just above). */
926 if (TREE_CODE (t1) != ARRAY_TYPE
927 && TYPE_MAIN_VARIANT (t1) == TYPE_MAIN_VARIANT (t2))
930 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
931 if (!(attrval = targetm.comp_type_attributes (t1, t2)))
934 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
937 switch (TREE_CODE (t1))
940 /* Do not remove mode or aliasing information. */
941 if (TYPE_MODE (t1) != TYPE_MODE (t2)
942 || TYPE_REF_CAN_ALIAS_ALL (t1) != TYPE_REF_CAN_ALIAS_ALL (t2))
944 val = (TREE_TYPE (t1) == TREE_TYPE (t2)
945 ? 1 : comptypes_internal (TREE_TYPE (t1), TREE_TYPE (t2)));
949 val = function_types_compatible_p (t1, t2);
954 tree d1 = TYPE_DOMAIN (t1);
955 tree d2 = TYPE_DOMAIN (t2);
956 bool d1_variable, d2_variable;
957 bool d1_zero, d2_zero;
960 /* Target types must match incl. qualifiers. */
961 if (TREE_TYPE (t1) != TREE_TYPE (t2)
962 && 0 == (val = comptypes_internal (TREE_TYPE (t1), TREE_TYPE (t2))))
965 /* Sizes must match unless one is missing or variable. */
966 if (d1 == 0 || d2 == 0 || d1 == d2)
969 d1_zero = !TYPE_MAX_VALUE (d1);
970 d2_zero = !TYPE_MAX_VALUE (d2);
972 d1_variable = (!d1_zero
973 && (TREE_CODE (TYPE_MIN_VALUE (d1)) != INTEGER_CST
974 || TREE_CODE (TYPE_MAX_VALUE (d1)) != INTEGER_CST));
975 d2_variable = (!d2_zero
976 && (TREE_CODE (TYPE_MIN_VALUE (d2)) != INTEGER_CST
977 || TREE_CODE (TYPE_MAX_VALUE (d2)) != INTEGER_CST));
978 d1_variable = d1_variable || (d1_zero && c_vla_type_p (t1));
979 d2_variable = d2_variable || (d2_zero && c_vla_type_p (t2));
981 if (d1_variable || d2_variable)
983 if (d1_zero && d2_zero)
985 if (d1_zero || d2_zero
986 || !tree_int_cst_equal (TYPE_MIN_VALUE (d1), TYPE_MIN_VALUE (d2))
987 || !tree_int_cst_equal (TYPE_MAX_VALUE (d1), TYPE_MAX_VALUE (d2)))
996 if (val != 1 && !same_translation_unit_p (t1, t2))
998 tree a1 = TYPE_ATTRIBUTES (t1);
999 tree a2 = TYPE_ATTRIBUTES (t2);
1001 if (! attribute_list_contained (a1, a2)
1002 && ! attribute_list_contained (a2, a1))
1006 return tagged_types_tu_compatible_p (t1, t2);
1007 val = tagged_types_tu_compatible_p (t1, t2);
1012 val = TYPE_VECTOR_SUBPARTS (t1) == TYPE_VECTOR_SUBPARTS (t2)
1013 && comptypes_internal (TREE_TYPE (t1), TREE_TYPE (t2));
1019 return attrval == 2 && val == 1 ? 2 : val;
1022 /* Return 1 if TTL and TTR are pointers to types that are equivalent,
1023 ignoring their qualifiers. */
1026 comp_target_types (tree ttl, tree ttr)
1031 /* Do not lose qualifiers on element types of array types that are
1032 pointer targets by taking their TYPE_MAIN_VARIANT. */
1033 mvl = TREE_TYPE (ttl);
1034 mvr = TREE_TYPE (ttr);
1035 if (TREE_CODE (mvl) != ARRAY_TYPE)
1036 mvl = TYPE_MAIN_VARIANT (mvl);
1037 if (TREE_CODE (mvr) != ARRAY_TYPE)
1038 mvr = TYPE_MAIN_VARIANT (mvr);
1039 val = comptypes (mvl, mvr);
1042 pedwarn (input_location, OPT_pedantic, "types are not quite compatible");
1046 /* Subroutines of `comptypes'. */
1048 /* Determine whether two trees derive from the same translation unit.
1049 If the CONTEXT chain ends in a null, that tree's context is still
1050 being parsed, so if two trees have context chains ending in null,
1051 they're in the same translation unit. */
1053 same_translation_unit_p (const_tree t1, const_tree t2)
1055 while (t1 && TREE_CODE (t1) != TRANSLATION_UNIT_DECL)
1056 switch (TREE_CODE_CLASS (TREE_CODE (t1)))
1058 case tcc_declaration:
1059 t1 = DECL_CONTEXT (t1); break;
1061 t1 = TYPE_CONTEXT (t1); break;
1062 case tcc_exceptional:
1063 t1 = BLOCK_SUPERCONTEXT (t1); break; /* assume block */
1064 default: gcc_unreachable ();
1067 while (t2 && TREE_CODE (t2) != TRANSLATION_UNIT_DECL)
1068 switch (TREE_CODE_CLASS (TREE_CODE (t2)))
1070 case tcc_declaration:
1071 t2 = DECL_CONTEXT (t2); break;
1073 t2 = TYPE_CONTEXT (t2); break;
1074 case tcc_exceptional:
1075 t2 = BLOCK_SUPERCONTEXT (t2); break; /* assume block */
1076 default: gcc_unreachable ();
1082 /* Allocate the seen two types, assuming that they are compatible. */
1084 static struct tagged_tu_seen_cache *
1085 alloc_tagged_tu_seen_cache (const_tree t1, const_tree t2)
1087 struct tagged_tu_seen_cache *tu = XNEW (struct tagged_tu_seen_cache);
1088 tu->next = tagged_tu_seen_base;
1092 tagged_tu_seen_base = tu;
1094 /* The C standard says that two structures in different translation
1095 units are compatible with each other only if the types of their
1096 fields are compatible (among other things). We assume that they
1097 are compatible until proven otherwise when building the cache.
1098 An example where this can occur is:
1103 If we are comparing this against a similar struct in another TU,
1104 and did not assume they were compatible, we end up with an infinite
1110 /* Free the seen types until we get to TU_TIL. */
1113 free_all_tagged_tu_seen_up_to (const struct tagged_tu_seen_cache *tu_til)
1115 const struct tagged_tu_seen_cache *tu = tagged_tu_seen_base;
1116 while (tu != tu_til)
1118 const struct tagged_tu_seen_cache *const tu1
1119 = (const struct tagged_tu_seen_cache *) tu;
1121 free (CONST_CAST (struct tagged_tu_seen_cache *, tu1));
1123 tagged_tu_seen_base = tu_til;
1126 /* Return 1 if two 'struct', 'union', or 'enum' types T1 and T2 are
1127 compatible. If the two types are not the same (which has been
1128 checked earlier), this can only happen when multiple translation
1129 units are being compiled. See C99 6.2.7 paragraph 1 for the exact
1133 tagged_types_tu_compatible_p (const_tree t1, const_tree t2)
1136 bool needs_warning = false;
1138 /* We have to verify that the tags of the types are the same. This
1139 is harder than it looks because this may be a typedef, so we have
1140 to go look at the original type. It may even be a typedef of a
1142 In the case of compiler-created builtin structs the TYPE_DECL
1143 may be a dummy, with no DECL_ORIGINAL_TYPE. Don't fault. */
1144 while (TYPE_NAME (t1)
1145 && TREE_CODE (TYPE_NAME (t1)) == TYPE_DECL
1146 && DECL_ORIGINAL_TYPE (TYPE_NAME (t1)))
1147 t1 = DECL_ORIGINAL_TYPE (TYPE_NAME (t1));
1149 while (TYPE_NAME (t2)
1150 && TREE_CODE (TYPE_NAME (t2)) == TYPE_DECL
1151 && DECL_ORIGINAL_TYPE (TYPE_NAME (t2)))
1152 t2 = DECL_ORIGINAL_TYPE (TYPE_NAME (t2));
1154 /* C90 didn't have the requirement that the two tags be the same. */
1155 if (flag_isoc99 && TYPE_NAME (t1) != TYPE_NAME (t2))
1158 /* C90 didn't say what happened if one or both of the types were
1159 incomplete; we choose to follow C99 rules here, which is that they
1161 if (TYPE_SIZE (t1) == NULL
1162 || TYPE_SIZE (t2) == NULL)
1166 const struct tagged_tu_seen_cache * tts_i;
1167 for (tts_i = tagged_tu_seen_base; tts_i != NULL; tts_i = tts_i->next)
1168 if (tts_i->t1 == t1 && tts_i->t2 == t2)
1172 switch (TREE_CODE (t1))
1176 struct tagged_tu_seen_cache *tu = alloc_tagged_tu_seen_cache (t1, t2);
1177 /* Speed up the case where the type values are in the same order. */
1178 tree tv1 = TYPE_VALUES (t1);
1179 tree tv2 = TYPE_VALUES (t2);
1186 for (;tv1 && tv2; tv1 = TREE_CHAIN (tv1), tv2 = TREE_CHAIN (tv2))
1188 if (TREE_PURPOSE (tv1) != TREE_PURPOSE (tv2))
1190 if (simple_cst_equal (TREE_VALUE (tv1), TREE_VALUE (tv2)) != 1)
1197 if (tv1 == NULL_TREE && tv2 == NULL_TREE)
1201 if (tv1 == NULL_TREE || tv2 == NULL_TREE)
1207 if (list_length (TYPE_VALUES (t1)) != list_length (TYPE_VALUES (t2)))
1213 for (s1 = TYPE_VALUES (t1); s1; s1 = TREE_CHAIN (s1))
1215 s2 = purpose_member (TREE_PURPOSE (s1), TYPE_VALUES (t2));
1217 || simple_cst_equal (TREE_VALUE (s1), TREE_VALUE (s2)) != 1)
1228 struct tagged_tu_seen_cache *tu = alloc_tagged_tu_seen_cache (t1, t2);
1229 if (list_length (TYPE_FIELDS (t1)) != list_length (TYPE_FIELDS (t2)))
1235 /* Speed up the common case where the fields are in the same order. */
1236 for (s1 = TYPE_FIELDS (t1), s2 = TYPE_FIELDS (t2); s1 && s2;
1237 s1 = TREE_CHAIN (s1), s2 = TREE_CHAIN (s2))
1241 if (DECL_NAME (s1) != DECL_NAME (s2))
1243 result = comptypes_internal (TREE_TYPE (s1), TREE_TYPE (s2));
1245 if (result != 1 && !DECL_NAME (s1))
1253 needs_warning = true;
1255 if (TREE_CODE (s1) == FIELD_DECL
1256 && simple_cst_equal (DECL_FIELD_BIT_OFFSET (s1),
1257 DECL_FIELD_BIT_OFFSET (s2)) != 1)
1265 tu->val = needs_warning ? 2 : 1;
1269 for (s1 = TYPE_FIELDS (t1); s1; s1 = TREE_CHAIN (s1))
1273 for (s2 = TYPE_FIELDS (t2); s2; s2 = TREE_CHAIN (s2))
1274 if (DECL_NAME (s1) == DECL_NAME (s2))
1278 result = comptypes_internal (TREE_TYPE (s1), TREE_TYPE (s2));
1280 if (result != 1 && !DECL_NAME (s1))
1288 needs_warning = true;
1290 if (TREE_CODE (s1) == FIELD_DECL
1291 && simple_cst_equal (DECL_FIELD_BIT_OFFSET (s1),
1292 DECL_FIELD_BIT_OFFSET (s2)) != 1)
1304 tu->val = needs_warning ? 2 : 10;
1310 struct tagged_tu_seen_cache *tu = alloc_tagged_tu_seen_cache (t1, t2);
1312 for (s1 = TYPE_FIELDS (t1), s2 = TYPE_FIELDS (t2);
1314 s1 = TREE_CHAIN (s1), s2 = TREE_CHAIN (s2))
1317 if (TREE_CODE (s1) != TREE_CODE (s2)
1318 || DECL_NAME (s1) != DECL_NAME (s2))
1320 result = comptypes_internal (TREE_TYPE (s1), TREE_TYPE (s2));
1324 needs_warning = true;
1326 if (TREE_CODE (s1) == FIELD_DECL
1327 && simple_cst_equal (DECL_FIELD_BIT_OFFSET (s1),
1328 DECL_FIELD_BIT_OFFSET (s2)) != 1)
1334 tu->val = needs_warning ? 2 : 1;
1343 /* Return 1 if two function types F1 and F2 are compatible.
1344 If either type specifies no argument types,
1345 the other must specify a fixed number of self-promoting arg types.
1346 Otherwise, if one type specifies only the number of arguments,
1347 the other must specify that number of self-promoting arg types.
1348 Otherwise, the argument types must match. */
1351 function_types_compatible_p (const_tree f1, const_tree f2)
1354 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1359 ret1 = TREE_TYPE (f1);
1360 ret2 = TREE_TYPE (f2);
1362 /* 'volatile' qualifiers on a function's return type used to mean
1363 the function is noreturn. */
1364 if (TYPE_VOLATILE (ret1) != TYPE_VOLATILE (ret2))
1365 pedwarn (input_location, 0, "function return types not compatible due to %<volatile%>");
1366 if (TYPE_VOLATILE (ret1))
1367 ret1 = build_qualified_type (TYPE_MAIN_VARIANT (ret1),
1368 TYPE_QUALS (ret1) & ~TYPE_QUAL_VOLATILE);
1369 if (TYPE_VOLATILE (ret2))
1370 ret2 = build_qualified_type (TYPE_MAIN_VARIANT (ret2),
1371 TYPE_QUALS (ret2) & ~TYPE_QUAL_VOLATILE);
1372 val = comptypes_internal (ret1, ret2);
1376 args1 = TYPE_ARG_TYPES (f1);
1377 args2 = TYPE_ARG_TYPES (f2);
1379 /* An unspecified parmlist matches any specified parmlist
1380 whose argument types don't need default promotions. */
1384 if (!self_promoting_args_p (args2))
1386 /* If one of these types comes from a non-prototype fn definition,
1387 compare that with the other type's arglist.
1388 If they don't match, ask for a warning (but no error). */
1389 if (TYPE_ACTUAL_ARG_TYPES (f1)
1390 && 1 != type_lists_compatible_p (args2, TYPE_ACTUAL_ARG_TYPES (f1)))
1396 if (!self_promoting_args_p (args1))
1398 if (TYPE_ACTUAL_ARG_TYPES (f2)
1399 && 1 != type_lists_compatible_p (args1, TYPE_ACTUAL_ARG_TYPES (f2)))
1404 /* Both types have argument lists: compare them and propagate results. */
1405 val1 = type_lists_compatible_p (args1, args2);
1406 return val1 != 1 ? val1 : val;
1409 /* Check two lists of types for compatibility,
1410 returning 0 for incompatible, 1 for compatible,
1411 or 2 for compatible with warning. */
1414 type_lists_compatible_p (const_tree args1, const_tree args2)
1416 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1422 tree a1, mv1, a2, mv2;
1423 if (args1 == 0 && args2 == 0)
1425 /* If one list is shorter than the other,
1426 they fail to match. */
1427 if (args1 == 0 || args2 == 0)
1429 mv1 = a1 = TREE_VALUE (args1);
1430 mv2 = a2 = TREE_VALUE (args2);
1431 if (mv1 && mv1 != error_mark_node && TREE_CODE (mv1) != ARRAY_TYPE)
1432 mv1 = TYPE_MAIN_VARIANT (mv1);
1433 if (mv2 && mv2 != error_mark_node && TREE_CODE (mv2) != ARRAY_TYPE)
1434 mv2 = TYPE_MAIN_VARIANT (mv2);
1435 /* A null pointer instead of a type
1436 means there is supposed to be an argument
1437 but nothing is specified about what type it has.
1438 So match anything that self-promotes. */
1441 if (c_type_promotes_to (a2) != a2)
1446 if (c_type_promotes_to (a1) != a1)
1449 /* If one of the lists has an error marker, ignore this arg. */
1450 else if (TREE_CODE (a1) == ERROR_MARK
1451 || TREE_CODE (a2) == ERROR_MARK)
1453 else if (!(newval = comptypes_internal (mv1, mv2)))
1455 /* Allow wait (union {union wait *u; int *i} *)
1456 and wait (union wait *) to be compatible. */
1457 if (TREE_CODE (a1) == UNION_TYPE
1458 && (TYPE_NAME (a1) == 0
1459 || TYPE_TRANSPARENT_UNION (a1))
1460 && TREE_CODE (TYPE_SIZE (a1)) == INTEGER_CST
1461 && tree_int_cst_equal (TYPE_SIZE (a1),
1465 for (memb = TYPE_FIELDS (a1);
1466 memb; memb = TREE_CHAIN (memb))
1468 tree mv3 = TREE_TYPE (memb);
1469 if (mv3 && mv3 != error_mark_node
1470 && TREE_CODE (mv3) != ARRAY_TYPE)
1471 mv3 = TYPE_MAIN_VARIANT (mv3);
1472 if (comptypes_internal (mv3, mv2))
1478 else if (TREE_CODE (a2) == UNION_TYPE
1479 && (TYPE_NAME (a2) == 0
1480 || TYPE_TRANSPARENT_UNION (a2))
1481 && TREE_CODE (TYPE_SIZE (a2)) == INTEGER_CST
1482 && tree_int_cst_equal (TYPE_SIZE (a2),
1486 for (memb = TYPE_FIELDS (a2);
1487 memb; memb = TREE_CHAIN (memb))
1489 tree mv3 = TREE_TYPE (memb);
1490 if (mv3 && mv3 != error_mark_node
1491 && TREE_CODE (mv3) != ARRAY_TYPE)
1492 mv3 = TYPE_MAIN_VARIANT (mv3);
1493 if (comptypes_internal (mv3, mv1))
1503 /* comptypes said ok, but record if it said to warn. */
1507 args1 = TREE_CHAIN (args1);
1508 args2 = TREE_CHAIN (args2);
1512 /* Compute the size to increment a pointer by. */
1515 c_size_in_bytes (const_tree type)
1517 enum tree_code code = TREE_CODE (type);
1519 if (code == FUNCTION_TYPE || code == VOID_TYPE || code == ERROR_MARK)
1520 return size_one_node;
1522 if (!COMPLETE_OR_VOID_TYPE_P (type))
1524 error ("arithmetic on pointer to an incomplete type");
1525 return size_one_node;
1528 /* Convert in case a char is more than one unit. */
1529 return size_binop (CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type),
1530 size_int (TYPE_PRECISION (char_type_node)
1534 /* Return either DECL or its known constant value (if it has one). */
1537 decl_constant_value (tree decl)
1539 if (/* Don't change a variable array bound or initial value to a constant
1540 in a place where a variable is invalid. Note that DECL_INITIAL
1541 isn't valid for a PARM_DECL. */
1542 current_function_decl != 0
1543 && TREE_CODE (decl) != PARM_DECL
1544 && !TREE_THIS_VOLATILE (decl)
1545 && TREE_READONLY (decl)
1546 && DECL_INITIAL (decl) != 0
1547 && TREE_CODE (DECL_INITIAL (decl)) != ERROR_MARK
1548 /* This is invalid if initial value is not constant.
1549 If it has either a function call, a memory reference,
1550 or a variable, then re-evaluating it could give different results. */
1551 && TREE_CONSTANT (DECL_INITIAL (decl))
1552 /* Check for cases where this is sub-optimal, even though valid. */
1553 && TREE_CODE (DECL_INITIAL (decl)) != CONSTRUCTOR)
1554 return DECL_INITIAL (decl);
1558 /* Return either DECL or its known constant value (if it has one), but
1559 return DECL if pedantic or DECL has mode BLKmode. This is for
1560 bug-compatibility with the old behavior of decl_constant_value
1561 (before GCC 3.0); every use of this function is a bug and it should
1562 be removed before GCC 3.1. It is not appropriate to use pedantic
1563 in a way that affects optimization, and BLKmode is probably not the
1564 right test for avoiding misoptimizations either. */
1567 decl_constant_value_for_broken_optimization (tree decl)
1571 if (pedantic || DECL_MODE (decl) == BLKmode)
1574 ret = decl_constant_value (decl);
1575 /* Avoid unwanted tree sharing between the initializer and current
1576 function's body where the tree can be modified e.g. by the
1578 if (ret != decl && TREE_STATIC (decl))
1579 ret = unshare_expr (ret);
1583 /* Convert the array expression EXP to a pointer. */
1585 array_to_pointer_conversion (tree exp)
1587 tree orig_exp = exp;
1588 tree type = TREE_TYPE (exp);
1590 tree restype = TREE_TYPE (type);
1593 gcc_assert (TREE_CODE (type) == ARRAY_TYPE);
1595 STRIP_TYPE_NOPS (exp);
1597 if (TREE_NO_WARNING (orig_exp))
1598 TREE_NO_WARNING (exp) = 1;
1600 ptrtype = build_pointer_type (restype);
1602 if (TREE_CODE (exp) == INDIRECT_REF)
1603 return convert (ptrtype, TREE_OPERAND (exp, 0));
1605 if (TREE_CODE (exp) == VAR_DECL)
1607 /* We are making an ADDR_EXPR of ptrtype. This is a valid
1608 ADDR_EXPR because it's the best way of representing what
1609 happens in C when we take the address of an array and place
1610 it in a pointer to the element type. */
1611 adr = build1 (ADDR_EXPR, ptrtype, exp);
1612 if (!c_mark_addressable (exp))
1613 return error_mark_node;
1614 TREE_SIDE_EFFECTS (adr) = 0; /* Default would be, same as EXP. */
1618 /* This way is better for a COMPONENT_REF since it can
1619 simplify the offset for a component. */
1620 adr = build_unary_op (EXPR_LOCATION (exp), ADDR_EXPR, exp, 1);
1621 return convert (ptrtype, adr);
1624 /* Convert the function expression EXP to a pointer. */
1626 function_to_pointer_conversion (tree exp)
1628 tree orig_exp = exp;
1630 gcc_assert (TREE_CODE (TREE_TYPE (exp)) == FUNCTION_TYPE);
1632 STRIP_TYPE_NOPS (exp);
1634 if (TREE_NO_WARNING (orig_exp))
1635 TREE_NO_WARNING (exp) = 1;
1637 return build_unary_op (EXPR_LOCATION (exp), ADDR_EXPR, exp, 0);
1640 /* Perform the default conversion of arrays and functions to pointers.
1641 Return the result of converting EXP. For any other expression, just
1642 return EXP after removing NOPs. */
1645 default_function_array_conversion (struct c_expr exp)
1647 tree orig_exp = exp.value;
1648 tree type = TREE_TYPE (exp.value);
1649 enum tree_code code = TREE_CODE (type);
1655 bool not_lvalue = false;
1656 bool lvalue_array_p;
1658 while ((TREE_CODE (exp.value) == NON_LVALUE_EXPR
1659 || CONVERT_EXPR_P (exp.value))
1660 && TREE_TYPE (TREE_OPERAND (exp.value, 0)) == type)
1662 if (TREE_CODE (exp.value) == NON_LVALUE_EXPR)
1664 exp.value = TREE_OPERAND (exp.value, 0);
1667 if (TREE_NO_WARNING (orig_exp))
1668 TREE_NO_WARNING (exp.value) = 1;
1670 lvalue_array_p = !not_lvalue && lvalue_p (exp.value);
1671 if (!flag_isoc99 && !lvalue_array_p)
1673 /* Before C99, non-lvalue arrays do not decay to pointers.
1674 Normally, using such an array would be invalid; but it can
1675 be used correctly inside sizeof or as a statement expression.
1676 Thus, do not give an error here; an error will result later. */
1680 exp.value = array_to_pointer_conversion (exp.value);
1684 exp.value = function_to_pointer_conversion (exp.value);
1687 STRIP_TYPE_NOPS (exp.value);
1688 if (TREE_NO_WARNING (orig_exp))
1689 TREE_NO_WARNING (exp.value) = 1;
1697 /* EXP is an expression of integer type. Apply the integer promotions
1698 to it and return the promoted value. */
1701 perform_integral_promotions (tree exp)
1703 tree type = TREE_TYPE (exp);
1704 enum tree_code code = TREE_CODE (type);
1706 gcc_assert (INTEGRAL_TYPE_P (type));
1708 /* Normally convert enums to int,
1709 but convert wide enums to something wider. */
1710 if (code == ENUMERAL_TYPE)
1712 type = c_common_type_for_size (MAX (TYPE_PRECISION (type),
1713 TYPE_PRECISION (integer_type_node)),
1714 ((TYPE_PRECISION (type)
1715 >= TYPE_PRECISION (integer_type_node))
1716 && TYPE_UNSIGNED (type)));
1718 return convert (type, exp);
1721 /* ??? This should no longer be needed now bit-fields have their
1723 if (TREE_CODE (exp) == COMPONENT_REF
1724 && DECL_C_BIT_FIELD (TREE_OPERAND (exp, 1))
1725 /* If it's thinner than an int, promote it like a
1726 c_promoting_integer_type_p, otherwise leave it alone. */
1727 && 0 > compare_tree_int (DECL_SIZE (TREE_OPERAND (exp, 1)),
1728 TYPE_PRECISION (integer_type_node)))
1729 return convert (integer_type_node, exp);
1731 if (c_promoting_integer_type_p (type))
1733 /* Preserve unsignedness if not really getting any wider. */
1734 if (TYPE_UNSIGNED (type)
1735 && TYPE_PRECISION (type) == TYPE_PRECISION (integer_type_node))
1736 return convert (unsigned_type_node, exp);
1738 return convert (integer_type_node, exp);
1745 /* Perform default promotions for C data used in expressions.
1746 Enumeral types or short or char are converted to int.
1747 In addition, manifest constants symbols are replaced by their values. */
1750 default_conversion (tree exp)
1753 tree type = TREE_TYPE (exp);
1754 enum tree_code code = TREE_CODE (type);
1756 /* Functions and arrays have been converted during parsing. */
1757 gcc_assert (code != FUNCTION_TYPE);
1758 if (code == ARRAY_TYPE)
1761 /* Constants can be used directly unless they're not loadable. */
1762 if (TREE_CODE (exp) == CONST_DECL)
1763 exp = DECL_INITIAL (exp);
1765 /* Replace a nonvolatile const static variable with its value unless
1766 it is an array, in which case we must be sure that taking the
1767 address of the array produces consistent results. */
1768 else if (optimize && TREE_CODE (exp) == VAR_DECL && code != ARRAY_TYPE)
1770 exp = decl_constant_value_for_broken_optimization (exp);
1771 type = TREE_TYPE (exp);
1774 /* Strip no-op conversions. */
1776 STRIP_TYPE_NOPS (exp);
1778 if (TREE_NO_WARNING (orig_exp))
1779 TREE_NO_WARNING (exp) = 1;
1781 if (code == VOID_TYPE)
1783 error ("void value not ignored as it ought to be");
1784 return error_mark_node;
1787 exp = require_complete_type (exp);
1788 if (exp == error_mark_node)
1789 return error_mark_node;
1791 if (INTEGRAL_TYPE_P (type))
1792 return perform_integral_promotions (exp);
1797 /* Look up COMPONENT in a structure or union DECL.
1799 If the component name is not found, returns NULL_TREE. Otherwise,
1800 the return value is a TREE_LIST, with each TREE_VALUE a FIELD_DECL
1801 stepping down the chain to the component, which is in the last
1802 TREE_VALUE of the list. Normally the list is of length one, but if
1803 the component is embedded within (nested) anonymous structures or
1804 unions, the list steps down the chain to the component. */
1807 lookup_field (tree decl, tree component)
1809 tree type = TREE_TYPE (decl);
1812 /* If TYPE_LANG_SPECIFIC is set, then it is a sorted array of pointers
1813 to the field elements. Use a binary search on this array to quickly
1814 find the element. Otherwise, do a linear search. TYPE_LANG_SPECIFIC
1815 will always be set for structures which have many elements. */
1817 if (TYPE_LANG_SPECIFIC (type) && TYPE_LANG_SPECIFIC (type)->s)
1820 tree *field_array = &TYPE_LANG_SPECIFIC (type)->s->elts[0];
1822 field = TYPE_FIELDS (type);
1824 top = TYPE_LANG_SPECIFIC (type)->s->len;
1825 while (top - bot > 1)
1827 half = (top - bot + 1) >> 1;
1828 field = field_array[bot+half];
1830 if (DECL_NAME (field) == NULL_TREE)
1832 /* Step through all anon unions in linear fashion. */
1833 while (DECL_NAME (field_array[bot]) == NULL_TREE)
1835 field = field_array[bot++];
1836 if (TREE_CODE (TREE_TYPE (field)) == RECORD_TYPE
1837 || TREE_CODE (TREE_TYPE (field)) == UNION_TYPE)
1839 tree anon = lookup_field (field, component);
1842 return tree_cons (NULL_TREE, field, anon);
1846 /* Entire record is only anon unions. */
1850 /* Restart the binary search, with new lower bound. */
1854 if (DECL_NAME (field) == component)
1856 if (DECL_NAME (field) < component)
1862 if (DECL_NAME (field_array[bot]) == component)
1863 field = field_array[bot];
1864 else if (DECL_NAME (field) != component)
1869 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
1871 if (DECL_NAME (field) == NULL_TREE
1872 && (TREE_CODE (TREE_TYPE (field)) == RECORD_TYPE
1873 || TREE_CODE (TREE_TYPE (field)) == UNION_TYPE))
1875 tree anon = lookup_field (field, component);
1878 return tree_cons (NULL_TREE, field, anon);
1881 if (DECL_NAME (field) == component)
1885 if (field == NULL_TREE)
1889 return tree_cons (NULL_TREE, field, NULL_TREE);
1892 /* Make an expression to refer to the COMPONENT field of
1893 structure or union value DATUM. COMPONENT is an IDENTIFIER_NODE. */
1896 build_component_ref (tree datum, tree component)
1898 tree type = TREE_TYPE (datum);
1899 enum tree_code code = TREE_CODE (type);
1903 if (!objc_is_public (datum, component))
1904 return error_mark_node;
1906 /* See if there is a field or component with name COMPONENT. */
1908 if (code == RECORD_TYPE || code == UNION_TYPE)
1910 if (!COMPLETE_TYPE_P (type))
1912 c_incomplete_type_error (NULL_TREE, type);
1913 return error_mark_node;
1916 field = lookup_field (datum, component);
1920 error ("%qT has no member named %qE", type, component);
1921 return error_mark_node;
1924 /* Chain the COMPONENT_REFs if necessary down to the FIELD.
1925 This might be better solved in future the way the C++ front
1926 end does it - by giving the anonymous entities each a
1927 separate name and type, and then have build_component_ref
1928 recursively call itself. We can't do that here. */
1931 tree subdatum = TREE_VALUE (field);
1935 if (TREE_TYPE (subdatum) == error_mark_node)
1936 return error_mark_node;
1938 quals = TYPE_QUALS (strip_array_types (TREE_TYPE (subdatum)));
1939 quals |= TYPE_QUALS (TREE_TYPE (datum));
1940 subtype = c_build_qualified_type (TREE_TYPE (subdatum), quals);
1942 ref = build3 (COMPONENT_REF, subtype, datum, subdatum,
1944 if (TREE_READONLY (datum) || TREE_READONLY (subdatum))
1945 TREE_READONLY (ref) = 1;
1946 if (TREE_THIS_VOLATILE (datum) || TREE_THIS_VOLATILE (subdatum))
1947 TREE_THIS_VOLATILE (ref) = 1;
1949 if (TREE_DEPRECATED (subdatum))
1950 warn_deprecated_use (subdatum);
1954 field = TREE_CHAIN (field);
1960 else if (code != ERROR_MARK)
1961 error ("request for member %qE in something not a structure or union",
1964 return error_mark_node;
1967 /* Given an expression PTR for a pointer, return an expression
1968 for the value pointed to.
1969 ERRORSTRING is the name of the operator to appear in error messages.
1971 LOC is the location to use for the generated tree. */
1974 build_indirect_ref (location_t loc, tree ptr, const char *errorstring)
1976 tree pointer = default_conversion (ptr);
1977 tree type = TREE_TYPE (pointer);
1980 if (TREE_CODE (type) == POINTER_TYPE)
1982 if (CONVERT_EXPR_P (pointer)
1983 || TREE_CODE (pointer) == VIEW_CONVERT_EXPR)
1985 /* If a warning is issued, mark it to avoid duplicates from
1986 the backend. This only needs to be done at
1987 warn_strict_aliasing > 2. */
1988 if (warn_strict_aliasing > 2)
1989 if (strict_aliasing_warning (TREE_TYPE (TREE_OPERAND (pointer, 0)),
1990 type, TREE_OPERAND (pointer, 0)))
1991 TREE_NO_WARNING (pointer) = 1;
1994 if (TREE_CODE (pointer) == ADDR_EXPR
1995 && (TREE_TYPE (TREE_OPERAND (pointer, 0))
1996 == TREE_TYPE (type)))
1998 ref = TREE_OPERAND (pointer, 0);
1999 protected_set_expr_location (ref, loc);
2004 tree t = TREE_TYPE (type);
2006 ref = build1 (INDIRECT_REF, t, pointer);
2008 if (!COMPLETE_OR_VOID_TYPE_P (t) && TREE_CODE (t) != ARRAY_TYPE)
2010 error_at (loc, "dereferencing pointer to incomplete type");
2011 return error_mark_node;
2013 if (VOID_TYPE_P (t) && skip_evaluation == 0)
2014 warning_at (loc, 0, "dereferencing %<void *%> pointer");
2016 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
2017 so that we get the proper error message if the result is used
2018 to assign to. Also, &* is supposed to be a no-op.
2019 And ANSI C seems to specify that the type of the result
2020 should be the const type. */
2021 /* A de-reference of a pointer to const is not a const. It is valid
2022 to change it via some other pointer. */
2023 TREE_READONLY (ref) = TYPE_READONLY (t);
2024 TREE_SIDE_EFFECTS (ref)
2025 = TYPE_VOLATILE (t) || TREE_SIDE_EFFECTS (pointer);
2026 TREE_THIS_VOLATILE (ref) = TYPE_VOLATILE (t);
2027 protected_set_expr_location (ref, loc);
2031 else if (TREE_CODE (pointer) != ERROR_MARK)
2033 "invalid type argument of %qs (have %qT)", errorstring, type);
2034 return error_mark_node;
2037 /* This handles expressions of the form "a[i]", which denotes
2040 This is logically equivalent in C to *(a+i), but we may do it differently.
2041 If A is a variable or a member, we generate a primitive ARRAY_REF.
2042 This avoids forcing the array out of registers, and can work on
2043 arrays that are not lvalues (for example, members of structures returned
2046 LOC is the location to use for the returned expression. */
2049 build_array_ref (tree array, tree index, location_t loc)
2052 bool swapped = false;
2053 if (TREE_TYPE (array) == error_mark_node
2054 || TREE_TYPE (index) == error_mark_node)
2055 return error_mark_node;
2057 if (TREE_CODE (TREE_TYPE (array)) != ARRAY_TYPE
2058 && TREE_CODE (TREE_TYPE (array)) != POINTER_TYPE)
2061 if (TREE_CODE (TREE_TYPE (index)) != ARRAY_TYPE
2062 && TREE_CODE (TREE_TYPE (index)) != POINTER_TYPE)
2064 error_at (loc, "subscripted value is neither array nor pointer");
2065 return error_mark_node;
2073 if (!INTEGRAL_TYPE_P (TREE_TYPE (index)))
2075 error_at (loc, "array subscript is not an integer");
2076 return error_mark_node;
2079 if (TREE_CODE (TREE_TYPE (TREE_TYPE (array))) == FUNCTION_TYPE)
2081 error_at (loc, "subscripted value is pointer to function");
2082 return error_mark_node;
2085 /* ??? Existing practice has been to warn only when the char
2086 index is syntactically the index, not for char[array]. */
2088 warn_array_subscript_with_type_char (index);
2090 /* Apply default promotions *after* noticing character types. */
2091 index = default_conversion (index);
2093 gcc_assert (TREE_CODE (TREE_TYPE (index)) == INTEGER_TYPE);
2095 if (TREE_CODE (TREE_TYPE (array)) == ARRAY_TYPE)
2099 /* An array that is indexed by a non-constant
2100 cannot be stored in a register; we must be able to do
2101 address arithmetic on its address.
2102 Likewise an array of elements of variable size. */
2103 if (TREE_CODE (index) != INTEGER_CST
2104 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array)))
2105 && TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array)))) != INTEGER_CST))
2107 if (!c_mark_addressable (array))
2108 return error_mark_node;
2110 /* An array that is indexed by a constant value which is not within
2111 the array bounds cannot be stored in a register either; because we
2112 would get a crash in store_bit_field/extract_bit_field when trying
2113 to access a non-existent part of the register. */
2114 if (TREE_CODE (index) == INTEGER_CST
2115 && TYPE_DOMAIN (TREE_TYPE (array))
2116 && !int_fits_type_p (index, TYPE_DOMAIN (TREE_TYPE (array))))
2118 if (!c_mark_addressable (array))
2119 return error_mark_node;
2125 while (TREE_CODE (foo) == COMPONENT_REF)
2126 foo = TREE_OPERAND (foo, 0);
2127 if (TREE_CODE (foo) == VAR_DECL && C_DECL_REGISTER (foo))
2128 pedwarn (loc, OPT_pedantic,
2129 "ISO C forbids subscripting %<register%> array");
2130 else if (!flag_isoc99 && !lvalue_p (foo))
2131 pedwarn (loc, OPT_pedantic,
2132 "ISO C90 forbids subscripting non-lvalue array");
2135 type = TREE_TYPE (TREE_TYPE (array));
2136 rval = build4 (ARRAY_REF, type, array, index, NULL_TREE, NULL_TREE);
2137 /* Array ref is const/volatile if the array elements are
2138 or if the array is. */
2139 TREE_READONLY (rval)
2140 |= (TYPE_READONLY (TREE_TYPE (TREE_TYPE (array)))
2141 | TREE_READONLY (array));
2142 TREE_SIDE_EFFECTS (rval)
2143 |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array)))
2144 | TREE_SIDE_EFFECTS (array));
2145 TREE_THIS_VOLATILE (rval)
2146 |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array)))
2147 /* This was added by rms on 16 Nov 91.
2148 It fixes vol struct foo *a; a->elts[1]
2149 in an inline function.
2150 Hope it doesn't break something else. */
2151 | TREE_THIS_VOLATILE (array));
2152 ret = require_complete_type (fold (rval));
2153 protected_set_expr_location (ret, loc);
2158 tree ar = default_conversion (array);
2160 if (ar == error_mark_node)
2163 gcc_assert (TREE_CODE (TREE_TYPE (ar)) == POINTER_TYPE);
2164 gcc_assert (TREE_CODE (TREE_TYPE (TREE_TYPE (ar))) != FUNCTION_TYPE);
2166 return build_indirect_ref
2167 (loc, build_binary_op (loc, PLUS_EXPR, ar, index, 0),
2172 /* Build an external reference to identifier ID. FUN indicates
2173 whether this will be used for a function call. LOC is the source
2174 location of the identifier. */
2176 build_external_ref (tree id, int fun, location_t loc)
2179 tree decl = lookup_name (id);
2181 /* In Objective-C, an instance variable (ivar) may be preferred to
2182 whatever lookup_name() found. */
2183 decl = objc_lookup_ivar (decl, id);
2185 if (decl && decl != error_mark_node)
2188 /* Implicit function declaration. */
2189 ref = implicitly_declare (id);
2190 else if (decl == error_mark_node)
2191 /* Don't complain about something that's already been
2192 complained about. */
2193 return error_mark_node;
2196 undeclared_variable (id, loc);
2197 return error_mark_node;
2200 if (TREE_TYPE (ref) == error_mark_node)
2201 return error_mark_node;
2203 if (TREE_DEPRECATED (ref))
2204 warn_deprecated_use (ref);
2206 /* Recursive call does not count as usage. */
2207 if (ref != current_function_decl)
2209 TREE_USED (ref) = 1;
2212 if (TREE_CODE (ref) == FUNCTION_DECL && !in_alignof)
2214 if (!in_sizeof && !in_typeof)
2215 C_DECL_USED (ref) = 1;
2216 else if (DECL_INITIAL (ref) == 0
2217 && DECL_EXTERNAL (ref)
2218 && !TREE_PUBLIC (ref))
2219 record_maybe_used_decl (ref);
2222 if (TREE_CODE (ref) == CONST_DECL)
2224 used_types_insert (TREE_TYPE (ref));
2225 ref = DECL_INITIAL (ref);
2226 TREE_CONSTANT (ref) = 1;
2228 else if (current_function_decl != 0
2229 && !DECL_FILE_SCOPE_P (current_function_decl)
2230 && (TREE_CODE (ref) == VAR_DECL
2231 || TREE_CODE (ref) == PARM_DECL
2232 || TREE_CODE (ref) == FUNCTION_DECL))
2234 tree context = decl_function_context (ref);
2236 if (context != 0 && context != current_function_decl)
2237 DECL_NONLOCAL (ref) = 1;
2239 /* C99 6.7.4p3: An inline definition of a function with external
2240 linkage ... shall not contain a reference to an identifier with
2241 internal linkage. */
2242 else if (current_function_decl != 0
2243 && DECL_DECLARED_INLINE_P (current_function_decl)
2244 && DECL_EXTERNAL (current_function_decl)
2245 && VAR_OR_FUNCTION_DECL_P (ref)
2246 && (TREE_CODE (ref) != VAR_DECL || TREE_STATIC (ref))
2247 && ! TREE_PUBLIC (ref)
2248 && DECL_CONTEXT (ref) != current_function_decl)
2249 pedwarn (loc, 0, "%qD is static but used in inline function %qD "
2250 "which is not static", ref, current_function_decl);
2255 /* Record details of decls possibly used inside sizeof or typeof. */
2256 struct maybe_used_decl
2260 /* The level seen at (in_sizeof + in_typeof). */
2262 /* The next one at this level or above, or NULL. */
2263 struct maybe_used_decl *next;
2266 static struct maybe_used_decl *maybe_used_decls;
2268 /* Record that DECL, an undefined static function reference seen
2269 inside sizeof or typeof, might be used if the operand of sizeof is
2270 a VLA type or the operand of typeof is a variably modified
2274 record_maybe_used_decl (tree decl)
2276 struct maybe_used_decl *t = XOBNEW (&parser_obstack, struct maybe_used_decl);
2278 t->level = in_sizeof + in_typeof;
2279 t->next = maybe_used_decls;
2280 maybe_used_decls = t;
2283 /* Pop the stack of decls possibly used inside sizeof or typeof. If
2284 USED is false, just discard them. If it is true, mark them used
2285 (if no longer inside sizeof or typeof) or move them to the next
2286 level up (if still inside sizeof or typeof). */
2289 pop_maybe_used (bool used)
2291 struct maybe_used_decl *p = maybe_used_decls;
2292 int cur_level = in_sizeof + in_typeof;
2293 while (p && p->level > cur_level)
2298 C_DECL_USED (p->decl) = 1;
2300 p->level = cur_level;
2304 if (!used || cur_level == 0)
2305 maybe_used_decls = p;
2308 /* Return the result of sizeof applied to EXPR. */
2311 c_expr_sizeof_expr (struct c_expr expr)
2314 if (expr.value == error_mark_node)
2316 ret.value = error_mark_node;
2317 ret.original_code = ERROR_MARK;
2318 pop_maybe_used (false);
2322 ret.value = c_sizeof (TREE_TYPE (expr.value));
2323 ret.original_code = ERROR_MARK;
2324 if (c_vla_type_p (TREE_TYPE (expr.value)))
2326 /* sizeof is evaluated when given a vla (C99 6.5.3.4p2). */
2327 ret.value = build2 (COMPOUND_EXPR, TREE_TYPE (ret.value), expr.value, ret.value);
2329 pop_maybe_used (C_TYPE_VARIABLE_SIZE (TREE_TYPE (expr.value)));
2334 /* Return the result of sizeof applied to T, a structure for the type
2335 name passed to sizeof (rather than the type itself). */
2338 c_expr_sizeof_type (struct c_type_name *t)
2342 type = groktypename (t);
2343 ret.value = c_sizeof (type);
2344 ret.original_code = ERROR_MARK;
2345 pop_maybe_used (type != error_mark_node
2346 ? C_TYPE_VARIABLE_SIZE (type) : false);
2350 /* Build a function call to function FUNCTION with parameters PARAMS.
2351 PARAMS is a list--a chain of TREE_LIST nodes--in which the
2352 TREE_VALUE of each node is a parameter-expression.
2353 FUNCTION's data type may be a function type or a pointer-to-function. */
2356 build_function_call (tree function, tree params)
2358 tree fntype, fundecl = 0;
2359 tree name = NULL_TREE, result;
2365 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
2366 STRIP_TYPE_NOPS (function);
2368 /* Convert anything with function type to a pointer-to-function. */
2369 if (TREE_CODE (function) == FUNCTION_DECL)
2371 /* Implement type-directed function overloading for builtins.
2372 resolve_overloaded_builtin and targetm.resolve_overloaded_builtin
2373 handle all the type checking. The result is a complete expression
2374 that implements this function call. */
2375 tem = resolve_overloaded_builtin (function, params);
2379 name = DECL_NAME (function);
2382 if (TREE_CODE (TREE_TYPE (function)) == FUNCTION_TYPE)
2383 function = function_to_pointer_conversion (function);
2385 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
2386 expressions, like those used for ObjC messenger dispatches. */
2387 function = objc_rewrite_function_call (function, params);
2389 fntype = TREE_TYPE (function);
2391 if (TREE_CODE (fntype) == ERROR_MARK)
2392 return error_mark_node;
2394 if (!(TREE_CODE (fntype) == POINTER_TYPE
2395 && TREE_CODE (TREE_TYPE (fntype)) == FUNCTION_TYPE))
2397 error ("called object %qE is not a function", function);
2398 return error_mark_node;
2401 if (fundecl && TREE_THIS_VOLATILE (fundecl))
2402 current_function_returns_abnormally = 1;
2404 /* fntype now gets the type of function pointed to. */
2405 fntype = TREE_TYPE (fntype);
2407 /* Check that the function is called through a compatible prototype.
2408 If it is not, replace the call by a trap, wrapped up in a compound
2409 expression if necessary. This has the nice side-effect to prevent
2410 the tree-inliner from generating invalid assignment trees which may
2411 blow up in the RTL expander later. */
2412 if (CONVERT_EXPR_P (function)
2413 && TREE_CODE (tem = TREE_OPERAND (function, 0)) == ADDR_EXPR
2414 && TREE_CODE (tem = TREE_OPERAND (tem, 0)) == FUNCTION_DECL
2415 && !comptypes (fntype, TREE_TYPE (tem)))
2417 tree return_type = TREE_TYPE (fntype);
2418 tree trap = build_function_call (built_in_decls[BUILT_IN_TRAP],
2421 /* This situation leads to run-time undefined behavior. We can't,
2422 therefore, simply error unless we can prove that all possible
2423 executions of the program must execute the code. */
2424 if (warning (0, "function called through a non-compatible type"))
2425 /* We can, however, treat "undefined" any way we please.
2426 Call abort to encourage the user to fix the program. */
2427 inform (input_location, "if this code is reached, the program will abort");
2429 if (VOID_TYPE_P (return_type))
2435 if (AGGREGATE_TYPE_P (return_type))
2436 rhs = build_compound_literal (return_type,
2437 build_constructor (return_type, 0));
2439 rhs = fold_convert (return_type, integer_zero_node);
2441 return build2 (COMPOUND_EXPR, return_type, trap, rhs);
2445 /* Convert the parameters to the types declared in the
2446 function prototype, or apply default promotions. */
2448 nargs = list_length (params);
2449 argarray = (tree *) alloca (nargs * sizeof (tree));
2450 nargs = convert_arguments (nargs, argarray, TYPE_ARG_TYPES (fntype),
2451 params, function, fundecl);
2453 return error_mark_node;
2455 /* Check that arguments to builtin functions match the expectations. */
2457 && DECL_BUILT_IN (fundecl)
2458 && DECL_BUILT_IN_CLASS (fundecl) == BUILT_IN_NORMAL
2459 && !check_builtin_function_arguments (fundecl, nargs, argarray))
2460 return error_mark_node;
2462 /* Check that the arguments to the function are valid. */
2463 check_function_arguments (TYPE_ATTRIBUTES (fntype), nargs, argarray,
2464 TYPE_ARG_TYPES (fntype));
2466 if (require_constant_value)
2468 result = fold_build_call_array_initializer (TREE_TYPE (fntype),
2469 function, nargs, argarray);
2470 if (TREE_CONSTANT (result)
2471 && (name == NULL_TREE
2472 || strncmp (IDENTIFIER_POINTER (name), "__builtin_", 10) != 0))
2473 pedwarn_init (input_location, 0, "initializer element is not constant");
2476 result = fold_build_call_array (TREE_TYPE (fntype),
2477 function, nargs, argarray);
2479 if (VOID_TYPE_P (TREE_TYPE (result)))
2481 return require_complete_type (result);
2484 /* Convert the argument expressions in the list VALUES
2485 to the types in the list TYPELIST. The resulting arguments are
2486 stored in the array ARGARRAY which has size NARGS.
2488 If TYPELIST is exhausted, or when an element has NULL as its type,
2489 perform the default conversions.
2491 PARMLIST is the chain of parm decls for the function being called.
2492 It may be 0, if that info is not available.
2493 It is used only for generating error messages.
2495 FUNCTION is a tree for the called function. It is used only for
2496 error messages, where it is formatted with %qE.
2498 This is also where warnings about wrong number of args are generated.
2500 VALUES is a chain of TREE_LIST nodes with the elements of the list
2501 in the TREE_VALUE slots of those nodes.
2503 Returns the actual number of arguments processed (which may be less
2504 than NARGS in some error situations), or -1 on failure. */
2507 convert_arguments (int nargs, tree *argarray,
2508 tree typelist, tree values, tree function, tree fundecl)
2510 tree typetail, valtail;
2512 const bool type_generic = fundecl
2513 && lookup_attribute ("type generic", TYPE_ATTRIBUTES(TREE_TYPE (fundecl)));
2516 /* Change pointer to function to the function itself for
2518 if (TREE_CODE (function) == ADDR_EXPR
2519 && TREE_CODE (TREE_OPERAND (function, 0)) == FUNCTION_DECL)
2520 function = TREE_OPERAND (function, 0);
2522 /* Handle an ObjC selector specially for diagnostics. */
2523 selector = objc_message_selector ();
2525 /* Scan the given expressions and types, producing individual
2526 converted arguments and storing them in ARGARRAY. */
2528 for (valtail = values, typetail = typelist, parmnum = 0;
2530 valtail = TREE_CHAIN (valtail), parmnum++)
2532 tree type = typetail ? TREE_VALUE (typetail) : 0;
2533 tree val = TREE_VALUE (valtail);
2534 tree rname = function;
2535 int argnum = parmnum + 1;
2536 const char *invalid_func_diag;
2538 if (type == void_type_node)
2540 error ("too many arguments to function %qE", function);
2544 if (selector && argnum > 2)
2550 STRIP_TYPE_NOPS (val);
2552 val = require_complete_type (val);
2556 /* Formal parm type is specified by a function prototype. */
2559 if (type == error_mark_node || !COMPLETE_TYPE_P (type))
2561 error ("type of formal parameter %d is incomplete", parmnum + 1);
2566 /* Optionally warn about conversions that
2567 differ from the default conversions. */
2568 if (warn_traditional_conversion || warn_traditional)
2570 unsigned int formal_prec = TYPE_PRECISION (type);
2572 if (INTEGRAL_TYPE_P (type)
2573 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
2574 warning (0, "passing argument %d of %qE as integer "
2575 "rather than floating due to prototype",
2577 if (INTEGRAL_TYPE_P (type)
2578 && TREE_CODE (TREE_TYPE (val)) == COMPLEX_TYPE)
2579 warning (0, "passing argument %d of %qE as integer "
2580 "rather than complex due to prototype",
2582 else if (TREE_CODE (type) == COMPLEX_TYPE
2583 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
2584 warning (0, "passing argument %d of %qE as complex "
2585 "rather than floating due to prototype",
2587 else if (TREE_CODE (type) == REAL_TYPE
2588 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
2589 warning (0, "passing argument %d of %qE as floating "
2590 "rather than integer due to prototype",
2592 else if (TREE_CODE (type) == COMPLEX_TYPE
2593 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
2594 warning (0, "passing argument %d of %qE as complex "
2595 "rather than integer due to prototype",
2597 else if (TREE_CODE (type) == REAL_TYPE
2598 && TREE_CODE (TREE_TYPE (val)) == COMPLEX_TYPE)
2599 warning (0, "passing argument %d of %qE as floating "
2600 "rather than complex due to prototype",
2602 /* ??? At some point, messages should be written about
2603 conversions between complex types, but that's too messy
2605 else if (TREE_CODE (type) == REAL_TYPE
2606 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
2608 /* Warn if any argument is passed as `float',
2609 since without a prototype it would be `double'. */
2610 if (formal_prec == TYPE_PRECISION (float_type_node)
2611 && type != dfloat32_type_node)
2612 warning (0, "passing argument %d of %qE as %<float%> "
2613 "rather than %<double%> due to prototype",
2616 /* Warn if mismatch between argument and prototype
2617 for decimal float types. Warn of conversions with
2618 binary float types and of precision narrowing due to
2620 else if (type != TREE_TYPE (val)
2621 && (type == dfloat32_type_node
2622 || type == dfloat64_type_node
2623 || type == dfloat128_type_node
2624 || TREE_TYPE (val) == dfloat32_type_node
2625 || TREE_TYPE (val) == dfloat64_type_node
2626 || TREE_TYPE (val) == dfloat128_type_node)
2628 <= TYPE_PRECISION (TREE_TYPE (val))
2629 || (type == dfloat128_type_node
2631 != dfloat64_type_node
2633 != dfloat32_type_node)))
2634 || (type == dfloat64_type_node
2636 != dfloat32_type_node))))
2637 warning (0, "passing argument %d of %qE as %qT "
2638 "rather than %qT due to prototype",
2639 argnum, rname, type, TREE_TYPE (val));
2642 /* Detect integer changing in width or signedness.
2643 These warnings are only activated with
2644 -Wtraditional-conversion, not with -Wtraditional. */
2645 else if (warn_traditional_conversion && INTEGRAL_TYPE_P (type)
2646 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
2648 tree would_have_been = default_conversion (val);
2649 tree type1 = TREE_TYPE (would_have_been);
2651 if (TREE_CODE (type) == ENUMERAL_TYPE
2652 && (TYPE_MAIN_VARIANT (type)
2653 == TYPE_MAIN_VARIANT (TREE_TYPE (val))))
2654 /* No warning if function asks for enum
2655 and the actual arg is that enum type. */
2657 else if (formal_prec != TYPE_PRECISION (type1))
2658 warning (OPT_Wtraditional_conversion, "passing argument %d of %qE "
2659 "with different width due to prototype",
2661 else if (TYPE_UNSIGNED (type) == TYPE_UNSIGNED (type1))
2663 /* Don't complain if the formal parameter type
2664 is an enum, because we can't tell now whether
2665 the value was an enum--even the same enum. */
2666 else if (TREE_CODE (type) == ENUMERAL_TYPE)
2668 else if (TREE_CODE (val) == INTEGER_CST
2669 && int_fits_type_p (val, type))
2670 /* Change in signedness doesn't matter
2671 if a constant value is unaffected. */
2673 /* If the value is extended from a narrower
2674 unsigned type, it doesn't matter whether we
2675 pass it as signed or unsigned; the value
2676 certainly is the same either way. */
2677 else if (TYPE_PRECISION (TREE_TYPE (val)) < TYPE_PRECISION (type)
2678 && TYPE_UNSIGNED (TREE_TYPE (val)))
2680 else if (TYPE_UNSIGNED (type))
2681 warning (OPT_Wtraditional_conversion, "passing argument %d of %qE "
2682 "as unsigned due to prototype",
2685 warning (OPT_Wtraditional_conversion, "passing argument %d of %qE "
2686 "as signed due to prototype", argnum, rname);
2690 parmval = convert_for_assignment (type, val, ic_argpass,
2694 if (targetm.calls.promote_prototypes (fundecl ? TREE_TYPE (fundecl) : 0)
2695 && INTEGRAL_TYPE_P (type)
2696 && (TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node)))
2697 parmval = default_conversion (parmval);
2699 argarray[parmnum] = parmval;
2701 else if (TREE_CODE (TREE_TYPE (val)) == REAL_TYPE
2702 && (TYPE_PRECISION (TREE_TYPE (val))
2703 < TYPE_PRECISION (double_type_node))
2704 && !DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (val))))
2707 argarray[parmnum] = val;
2709 /* Convert `float' to `double'. */
2710 argarray[parmnum] = convert (double_type_node, val);
2712 else if ((invalid_func_diag =
2713 targetm.calls.invalid_arg_for_unprototyped_fn (typelist, fundecl, val)))
2715 error (invalid_func_diag);
2719 /* Convert `short' and `char' to full-size `int'. */
2720 argarray[parmnum] = default_conversion (val);
2723 typetail = TREE_CHAIN (typetail);
2726 gcc_assert (parmnum == nargs);
2728 if (typetail != 0 && TREE_VALUE (typetail) != void_type_node)
2730 error ("too few arguments to function %qE", function);
2737 /* This is the entry point used by the parser to build unary operators
2738 in the input. CODE, a tree_code, specifies the unary operator, and
2739 ARG is the operand. For unary plus, the C parser currently uses
2740 CONVERT_EXPR for code.
2742 LOC is the location to use for the tree generated.
2746 parser_build_unary_op (enum tree_code code, struct c_expr arg, location_t loc)
2748 struct c_expr result;
2750 result.value = build_unary_op (loc, code, arg.value, 0);
2751 result.original_code = code;
2753 if (TREE_OVERFLOW_P (result.value) && !TREE_OVERFLOW_P (arg.value))
2754 overflow_warning (result.value);
2759 /* This is the entry point used by the parser to build binary operators
2760 in the input. CODE, a tree_code, specifies the binary operator, and
2761 ARG1 and ARG2 are the operands. In addition to constructing the
2762 expression, we check for operands that were written with other binary
2763 operators in a way that is likely to confuse the user.
2765 LOCATION is the location of the binary operator. */
2768 parser_build_binary_op (location_t location, enum tree_code code,
2769 struct c_expr arg1, struct c_expr arg2)
2771 struct c_expr result;
2773 enum tree_code code1 = arg1.original_code;
2774 enum tree_code code2 = arg2.original_code;
2776 result.value = build_binary_op (location, code,
2777 arg1.value, arg2.value, 1);
2778 result.original_code = code;
2780 if (TREE_CODE (result.value) == ERROR_MARK)
2783 if (location != UNKNOWN_LOCATION)
2784 protected_set_expr_location (result.value, location);
2786 /* Check for cases such as x+y<<z which users are likely
2788 if (warn_parentheses)
2789 warn_about_parentheses (code, code1, arg1.value, code2, arg2.value);
2791 if (TREE_CODE_CLASS (code1) != tcc_comparison)
2792 warn_logical_operator (code, arg1.value, arg2.value);
2794 /* Warn about comparisons against string literals, with the exception
2795 of testing for equality or inequality of a string literal with NULL. */
2796 if (code == EQ_EXPR || code == NE_EXPR)
2798 if ((code1 == STRING_CST && !integer_zerop (arg2.value))
2799 || (code2 == STRING_CST && !integer_zerop (arg1.value)))
2800 warning (OPT_Waddress, "comparison with string literal results in unspecified behavior");
2802 else if (TREE_CODE_CLASS (code) == tcc_comparison
2803 && (code1 == STRING_CST || code2 == STRING_CST))
2804 warning (OPT_Waddress, "comparison with string literal results in unspecified behavior");
2806 if (TREE_OVERFLOW_P (result.value)
2807 && !TREE_OVERFLOW_P (arg1.value)
2808 && !TREE_OVERFLOW_P (arg2.value))
2809 overflow_warning (result.value);
2814 /* Return a tree for the difference of pointers OP0 and OP1.
2815 The resulting tree has type int. */
2818 pointer_diff (tree op0, tree op1)
2820 tree restype = ptrdiff_type_node;
2822 tree target_type = TREE_TYPE (TREE_TYPE (op0));
2823 tree con0, con1, lit0, lit1;
2824 tree orig_op1 = op1;
2826 if (TREE_CODE (target_type) == VOID_TYPE)
2827 pedwarn (input_location, pedantic ? OPT_pedantic : OPT_Wpointer_arith,
2828 "pointer of type %<void *%> used in subtraction");
2829 if (TREE_CODE (target_type) == FUNCTION_TYPE)
2830 pedwarn (input_location, pedantic ? OPT_pedantic : OPT_Wpointer_arith,
2831 "pointer to a function used in subtraction");
2833 /* If the conversion to ptrdiff_type does anything like widening or
2834 converting a partial to an integral mode, we get a convert_expression
2835 that is in the way to do any simplifications.
2836 (fold-const.c doesn't know that the extra bits won't be needed.
2837 split_tree uses STRIP_SIGN_NOPS, which leaves conversions to a
2838 different mode in place.)
2839 So first try to find a common term here 'by hand'; we want to cover
2840 at least the cases that occur in legal static initializers. */
2841 if (CONVERT_EXPR_P (op0)
2842 && (TYPE_PRECISION (TREE_TYPE (op0))
2843 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op0, 0)))))
2844 con0 = TREE_OPERAND (op0, 0);
2847 if (CONVERT_EXPR_P (op1)
2848 && (TYPE_PRECISION (TREE_TYPE (op1))
2849 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op1, 0)))))
2850 con1 = TREE_OPERAND (op1, 0);
2854 if (TREE_CODE (con0) == PLUS_EXPR)
2856 lit0 = TREE_OPERAND (con0, 1);
2857 con0 = TREE_OPERAND (con0, 0);
2860 lit0 = integer_zero_node;
2862 if (TREE_CODE (con1) == PLUS_EXPR)
2864 lit1 = TREE_OPERAND (con1, 1);
2865 con1 = TREE_OPERAND (con1, 0);
2868 lit1 = integer_zero_node;
2870 if (operand_equal_p (con0, con1, 0))
2877 /* First do the subtraction as integers;
2878 then drop through to build the divide operator.
2879 Do not do default conversions on the minus operator
2880 in case restype is a short type. */
2882 op0 = build_binary_op (input_location,
2883 MINUS_EXPR, convert (restype, op0),
2884 convert (restype, op1), 0);
2885 /* This generates an error if op1 is pointer to incomplete type. */
2886 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (TREE_TYPE (orig_op1))))
2887 error ("arithmetic on pointer to an incomplete type");
2889 /* This generates an error if op0 is pointer to incomplete type. */
2890 op1 = c_size_in_bytes (target_type);
2892 /* Divide by the size, in easiest possible way. */
2893 return fold_build2 (EXACT_DIV_EXPR, restype, op0, convert (restype, op1));
2896 /* Construct and perhaps optimize a tree representation
2897 for a unary operation. CODE, a tree_code, specifies the operation
2898 and XARG is the operand.
2899 For any CODE other than ADDR_EXPR, FLAG nonzero suppresses
2900 the default promotions (such as from short to int).
2901 For ADDR_EXPR, the default promotions are not applied; FLAG nonzero
2902 allows non-lvalues; this is only used to handle conversion of non-lvalue
2903 arrays to pointers in C99.
2905 LOCATION is the location of the operator. */
2908 build_unary_op (location_t location,
2909 enum tree_code code, tree xarg, int flag)
2911 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
2914 enum tree_code typecode;
2916 tree ret = error_mark_node;
2917 int noconvert = flag;
2918 const char *invalid_op_diag;
2920 if (code != ADDR_EXPR)
2921 arg = require_complete_type (arg);
2923 typecode = TREE_CODE (TREE_TYPE (arg));
2924 if (typecode == ERROR_MARK)
2925 return error_mark_node;
2926 if (typecode == ENUMERAL_TYPE || typecode == BOOLEAN_TYPE)
2927 typecode = INTEGER_TYPE;
2929 if ((invalid_op_diag
2930 = targetm.invalid_unary_op (code, TREE_TYPE (xarg))))
2932 error_at (location, invalid_op_diag);
2933 return error_mark_node;
2939 /* This is used for unary plus, because a CONVERT_EXPR
2940 is enough to prevent anybody from looking inside for
2941 associativity, but won't generate any code. */
2942 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2943 || typecode == FIXED_POINT_TYPE || typecode == COMPLEX_TYPE
2944 || typecode == VECTOR_TYPE))
2946 error_at (location, "wrong type argument to unary plus");
2947 return error_mark_node;
2949 else if (!noconvert)
2950 arg = default_conversion (arg);
2951 arg = non_lvalue (arg);
2955 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2956 || typecode == FIXED_POINT_TYPE || typecode == COMPLEX_TYPE
2957 || typecode == VECTOR_TYPE))
2959 error_at (location, "wrong type argument to unary minus");
2960 return error_mark_node;
2962 else if (!noconvert)
2963 arg = default_conversion (arg);
2967 /* ~ works on integer types and non float vectors. */
2968 if (typecode == INTEGER_TYPE
2969 || (typecode == VECTOR_TYPE
2970 && !VECTOR_FLOAT_TYPE_P (TREE_TYPE (arg))))
2973 arg = default_conversion (arg);
2975 else if (typecode == COMPLEX_TYPE)
2978 pedwarn (location, OPT_pedantic,
2979 "ISO C does not support %<~%> for complex conjugation");
2981 arg = default_conversion (arg);
2985 error_at (location, "wrong type argument to bit-complement");
2986 return error_mark_node;
2991 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE))
2993 error_at (location, "wrong type argument to abs");
2994 return error_mark_node;
2996 else if (!noconvert)
2997 arg = default_conversion (arg);
3001 /* Conjugating a real value is a no-op, but allow it anyway. */
3002 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
3003 || typecode == COMPLEX_TYPE))
3005 error_at (location, "wrong type argument to conjugation");
3006 return error_mark_node;
3008 else if (!noconvert)
3009 arg = default_conversion (arg);
3012 case TRUTH_NOT_EXPR:
3013 if (typecode != INTEGER_TYPE && typecode != FIXED_POINT_TYPE
3014 && typecode != REAL_TYPE && typecode != POINTER_TYPE
3015 && typecode != COMPLEX_TYPE)
3018 "wrong type argument to unary exclamation mark");
3019 return error_mark_node;
3021 arg = c_objc_common_truthvalue_conversion (location, arg);
3022 ret = invert_truthvalue (arg);
3023 goto return_build_unary_op;
3026 if (TREE_CODE (arg) == COMPLEX_CST)
3027 ret = TREE_REALPART (arg);
3028 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
3029 ret = fold_build1 (REALPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg);
3032 goto return_build_unary_op;
3035 if (TREE_CODE (arg) == COMPLEX_CST)
3036 ret = TREE_IMAGPART (arg);
3037 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
3038 ret = fold_build1 (IMAGPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg);
3040 ret = omit_one_operand (TREE_TYPE (arg), integer_zero_node, arg);
3041 goto return_build_unary_op;
3043 case PREINCREMENT_EXPR:
3044 case POSTINCREMENT_EXPR:
3045 case PREDECREMENT_EXPR:
3046 case POSTDECREMENT_EXPR:
3048 /* Increment or decrement the real part of the value,
3049 and don't change the imaginary part. */
3050 if (typecode == COMPLEX_TYPE)
3054 pedwarn (location, OPT_pedantic,
3055 "ISO C does not support %<++%> and %<--%> on complex types");
3057 arg = stabilize_reference (arg);
3058 real = build_unary_op (EXPR_LOCATION (arg), REALPART_EXPR, arg, 1);
3059 imag = build_unary_op (EXPR_LOCATION (arg), IMAGPART_EXPR, arg, 1);
3060 real = build_unary_op (EXPR_LOCATION (arg), code, real, 1);
3061 if (real == error_mark_node || imag == error_mark_node)
3062 return error_mark_node;
3063 ret = build2 (COMPLEX_EXPR, TREE_TYPE (arg),
3065 goto return_build_unary_op;
3068 /* Report invalid types. */
3070 if (typecode != POINTER_TYPE && typecode != FIXED_POINT_TYPE
3071 && typecode != INTEGER_TYPE && typecode != REAL_TYPE)
3073 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
3074 error_at (location, "wrong type argument to increment");
3076 error_at (location, "wrong type argument to decrement");
3078 return error_mark_node;
3083 tree result_type = TREE_TYPE (arg);
3085 arg = get_unwidened (arg, 0);
3086 argtype = TREE_TYPE (arg);
3088 /* Compute the increment. */
3090 if (typecode == POINTER_TYPE)
3092 /* If pointer target is an undefined struct,
3093 we just cannot know how to do the arithmetic. */
3094 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (result_type)))
3096 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
3098 "increment of pointer to unknown structure");
3101 "decrement of pointer to unknown structure");
3103 else if (TREE_CODE (TREE_TYPE (result_type)) == FUNCTION_TYPE
3104 || TREE_CODE (TREE_TYPE (result_type)) == VOID_TYPE)
3106 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
3107 pedwarn (location, pedantic ? OPT_pedantic : OPT_Wpointer_arith,
3108 "wrong type argument to increment");
3110 pedwarn (location, pedantic ? OPT_pedantic : OPT_Wpointer_arith,
3111 "wrong type argument to decrement");
3114 inc = c_size_in_bytes (TREE_TYPE (result_type));
3115 inc = fold_convert (sizetype, inc);
3117 else if (FRACT_MODE_P (TYPE_MODE (result_type)))
3119 /* For signed fract types, we invert ++ to -- or
3120 -- to ++, and change inc from 1 to -1, because
3121 it is not possible to represent 1 in signed fract constants.
3122 For unsigned fract types, the result always overflows and
3123 we get an undefined (original) or the maximum value. */
3124 if (code == PREINCREMENT_EXPR)
3125 code = PREDECREMENT_EXPR;
3126 else if (code == PREDECREMENT_EXPR)
3127 code = PREINCREMENT_EXPR;
3128 else if (code == POSTINCREMENT_EXPR)
3129 code = POSTDECREMENT_EXPR;
3130 else /* code == POSTDECREMENT_EXPR */
3131 code = POSTINCREMENT_EXPR;
3133 inc = integer_minus_one_node;
3134 inc = convert (argtype, inc);
3138 inc = integer_one_node;
3139 inc = convert (argtype, inc);
3142 /* Complain about anything else that is not a true lvalue. */
3143 if (!lvalue_or_else (arg, ((code == PREINCREMENT_EXPR
3144 || code == POSTINCREMENT_EXPR)
3147 return error_mark_node;
3149 /* Report a read-only lvalue. */
3150 if (TREE_READONLY (arg))
3152 readonly_error (arg,
3153 ((code == PREINCREMENT_EXPR
3154 || code == POSTINCREMENT_EXPR)
3155 ? lv_increment : lv_decrement));
3156 return error_mark_node;
3159 if (TREE_CODE (TREE_TYPE (arg)) == BOOLEAN_TYPE)
3160 val = boolean_increment (code, arg);
3162 val = build2 (code, TREE_TYPE (arg), arg, inc);
3163 TREE_SIDE_EFFECTS (val) = 1;
3164 val = convert (result_type, val);
3165 if (TREE_CODE (val) != code)
3166 TREE_NO_WARNING (val) = 1;
3168 goto return_build_unary_op;
3172 /* Note that this operation never does default_conversion. */
3174 /* Let &* cancel out to simplify resulting code. */
3175 if (TREE_CODE (arg) == INDIRECT_REF)
3177 /* Don't let this be an lvalue. */
3178 if (lvalue_p (TREE_OPERAND (arg, 0)))
3179 return non_lvalue (TREE_OPERAND (arg, 0));
3180 ret = TREE_OPERAND (arg, 0);
3181 goto return_build_unary_op;
3184 /* For &x[y], return x+y */
3185 if (TREE_CODE (arg) == ARRAY_REF)
3187 tree op0 = TREE_OPERAND (arg, 0);
3188 if (!c_mark_addressable (op0))
3189 return error_mark_node;
3190 return build_binary_op (location, PLUS_EXPR,
3191 (TREE_CODE (TREE_TYPE (op0)) == ARRAY_TYPE
3192 ? array_to_pointer_conversion (op0)
3194 TREE_OPERAND (arg, 1), 1);
3197 /* Anything not already handled and not a true memory reference
3198 or a non-lvalue array is an error. */
3199 else if (typecode != FUNCTION_TYPE && !flag
3200 && !lvalue_or_else (arg, lv_addressof))
3201 return error_mark_node;
3203 /* Ordinary case; arg is a COMPONENT_REF or a decl. */
3204 argtype = TREE_TYPE (arg);
3206 /* If the lvalue is const or volatile, merge that into the type
3207 to which the address will point. Note that you can't get a
3208 restricted pointer by taking the address of something, so we
3209 only have to deal with `const' and `volatile' here. */
3210 if ((DECL_P (arg) || REFERENCE_CLASS_P (arg))
3211 && (TREE_READONLY (arg) || TREE_THIS_VOLATILE (arg)))
3212 argtype = c_build_type_variant (argtype,
3213 TREE_READONLY (arg),
3214 TREE_THIS_VOLATILE (arg));
3216 if (!c_mark_addressable (arg))
3217 return error_mark_node;
3219 gcc_assert (TREE_CODE (arg) != COMPONENT_REF
3220 || !DECL_C_BIT_FIELD (TREE_OPERAND (arg, 1)));
3222 argtype = build_pointer_type (argtype);
3224 /* ??? Cope with user tricks that amount to offsetof. Delete this
3225 when we have proper support for integer constant expressions. */
3226 val = get_base_address (arg);
3227 if (val && TREE_CODE (val) == INDIRECT_REF
3228 && TREE_CONSTANT (TREE_OPERAND (val, 0)))
3230 tree op0 = fold_convert (sizetype, fold_offsetof (arg, val)), op1;
3232 op1 = fold_convert (argtype, TREE_OPERAND (val, 0));
3233 ret = fold_build2 (POINTER_PLUS_EXPR, argtype, op1, op0);
3234 goto return_build_unary_op;
3237 val = build1 (ADDR_EXPR, argtype, arg);
3240 goto return_build_unary_op;
3247 argtype = TREE_TYPE (arg);
3248 ret = require_constant_value ? fold_build1_initializer (code, argtype, arg)
3249 : fold_build1 (code, argtype, arg);
3250 return_build_unary_op:
3251 gcc_assert (ret != error_mark_node);
3252 protected_set_expr_location (ret, location);
3256 /* Return nonzero if REF is an lvalue valid for this language.
3257 Lvalues can be assigned, unless their type has TYPE_READONLY.
3258 Lvalues can have their address taken, unless they have C_DECL_REGISTER. */
3261 lvalue_p (const_tree ref)
3263 const enum tree_code code = TREE_CODE (ref);
3270 return lvalue_p (TREE_OPERAND (ref, 0));
3272 case COMPOUND_LITERAL_EXPR:
3282 return (TREE_CODE (TREE_TYPE (ref)) != FUNCTION_TYPE
3283 && TREE_CODE (TREE_TYPE (ref)) != METHOD_TYPE);
3286 return TREE_CODE (TREE_TYPE (ref)) == ARRAY_TYPE;
3293 /* Give an error for storing in something that is 'const'. */
3296 readonly_error (tree arg, enum lvalue_use use)
3298 gcc_assert (use == lv_assign || use == lv_increment || use == lv_decrement
3300 /* Using this macro rather than (for example) arrays of messages
3301 ensures that all the format strings are checked at compile
3303 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
3304 : (use == lv_increment ? (I) \
3305 : (use == lv_decrement ? (D) : (AS))))
3306 if (TREE_CODE (arg) == COMPONENT_REF)
3308 if (TYPE_READONLY (TREE_TYPE (TREE_OPERAND (arg, 0))))
3309 readonly_error (TREE_OPERAND (arg, 0), use);
3311 error (READONLY_MSG (G_("assignment of read-only member %qD"),
3312 G_("increment of read-only member %qD"),
3313 G_("decrement of read-only member %qD"),
3314 G_("read-only member %qD used as %<asm%> output")),
3315 TREE_OPERAND (arg, 1));
3317 else if (TREE_CODE (arg) == VAR_DECL)
3318 error (READONLY_MSG (G_("assignment of read-only variable %qD"),
3319 G_("increment of read-only variable %qD"),
3320 G_("decrement of read-only variable %qD"),
3321 G_("read-only variable %qD used as %<asm%> output")),
3324 error (READONLY_MSG (G_("assignment of read-only location %qE"),
3325 G_("increment of read-only location %qE"),
3326 G_("decrement of read-only location %qE"),
3327 G_("read-only location %qE used as %<asm%> output")),
3332 /* Return nonzero if REF is an lvalue valid for this language;
3333 otherwise, print an error message and return zero. USE says
3334 how the lvalue is being used and so selects the error message. */
3337 lvalue_or_else (const_tree ref, enum lvalue_use use)
3339 int win = lvalue_p (ref);
3347 /* Mark EXP saying that we need to be able to take the
3348 address of it; it should not be allocated in a register.
3349 Returns true if successful. */
3352 c_mark_addressable (tree exp)
3357 switch (TREE_CODE (x))
3360 if (DECL_C_BIT_FIELD (TREE_OPERAND (x, 1)))
3363 ("cannot take address of bit-field %qD", TREE_OPERAND (x, 1));
3367 /* ... fall through ... */
3373 x = TREE_OPERAND (x, 0);
3376 case COMPOUND_LITERAL_EXPR:
3378 TREE_ADDRESSABLE (x) = 1;
3385 if (C_DECL_REGISTER (x)
3386 && DECL_NONLOCAL (x))
3388 if (TREE_PUBLIC (x) || TREE_STATIC (x) || DECL_EXTERNAL (x))
3391 ("global register variable %qD used in nested function", x);
3394 pedwarn (input_location, 0, "register variable %qD used in nested function", x);
3396 else if (C_DECL_REGISTER (x))
3398 if (TREE_PUBLIC (x) || TREE_STATIC (x) || DECL_EXTERNAL (x))
3399 error ("address of global register variable %qD requested", x);
3401 error ("address of register variable %qD requested", x);
3407 TREE_ADDRESSABLE (x) = 1;
3414 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
3417 build_conditional_expr (tree ifexp, tree op1, tree op2)
3421 enum tree_code code1;
3422 enum tree_code code2;
3423 tree result_type = NULL;
3424 tree orig_op1 = op1, orig_op2 = op2;
3426 /* Promote both alternatives. */
3428 if (TREE_CODE (TREE_TYPE (op1)) != VOID_TYPE)
3429 op1 = default_conversion (op1);
3430 if (TREE_CODE (TREE_TYPE (op2)) != VOID_TYPE)
3431 op2 = default_conversion (op2);
3433 if (TREE_CODE (ifexp) == ERROR_MARK
3434 || TREE_CODE (TREE_TYPE (op1)) == ERROR_MARK
3435 || TREE_CODE (TREE_TYPE (op2)) == ERROR_MARK)
3436 return error_mark_node;
3438 type1 = TREE_TYPE (op1);
3439 code1 = TREE_CODE (type1);
3440 type2 = TREE_TYPE (op2);
3441 code2 = TREE_CODE (type2);
3443 /* C90 does not permit non-lvalue arrays in conditional expressions.
3444 In C99 they will be pointers by now. */
3445 if (code1 == ARRAY_TYPE || code2 == ARRAY_TYPE)
3447 error ("non-lvalue array in conditional expression");
3448 return error_mark_node;
3451 /* Quickly detect the usual case where op1 and op2 have the same type
3453 if (TYPE_MAIN_VARIANT (type1) == TYPE_MAIN_VARIANT (type2))
3456 result_type = type1;
3458 result_type = TYPE_MAIN_VARIANT (type1);
3460 else if ((code1 == INTEGER_TYPE || code1 == REAL_TYPE
3461 || code1 == COMPLEX_TYPE)
3462 && (code2 == INTEGER_TYPE || code2 == REAL_TYPE
3463 || code2 == COMPLEX_TYPE))
3465 result_type = c_common_type (type1, type2);
3467 /* If -Wsign-compare, warn here if type1 and type2 have
3468 different signedness. We'll promote the signed to unsigned
3469 and later code won't know it used to be different.
3470 Do this check on the original types, so that explicit casts
3471 will be considered, but default promotions won't. */
3472 if (warn_sign_compare && !skip_evaluation)
3474 int unsigned_op1 = TYPE_UNSIGNED (TREE_TYPE (orig_op1));
3475 int unsigned_op2 = TYPE_UNSIGNED (TREE_TYPE (orig_op2));
3477 if (unsigned_op1 ^ unsigned_op2)
3481 /* Do not warn if the result type is signed, since the
3482 signed type will only be chosen if it can represent
3483 all the values of the unsigned type. */
3484 if (!TYPE_UNSIGNED (result_type))
3486 /* Do not warn if the signed quantity is an unsuffixed
3487 integer literal (or some static constant expression
3488 involving such literals) and it is non-negative. */
3489 else if ((unsigned_op2
3490 && tree_expr_nonnegative_warnv_p (op1, &ovf))
3492 && tree_expr_nonnegative_warnv_p (op2, &ovf)))
3495 warning (OPT_Wsign_compare, "signed and unsigned type in conditional expression");
3499 else if (code1 == VOID_TYPE || code2 == VOID_TYPE)
3501 if (code1 != VOID_TYPE || code2 != VOID_TYPE)
3502 pedwarn (input_location, OPT_pedantic,
3503 "ISO C forbids conditional expr with only one void side");
3504 result_type = void_type_node;
3506 else if (code1 == POINTER_TYPE && code2 == POINTER_TYPE)
3508 if (comp_target_types (type1, type2))
3509 result_type = common_pointer_type (type1, type2);
3510 else if (null_pointer_constant_p (orig_op1))
3511 result_type = qualify_type (type2, type1);
3512 else if (null_pointer_constant_p (orig_op2))
3513 result_type = qualify_type (type1, type2);
3514 else if (VOID_TYPE_P (TREE_TYPE (type1)))
3516 if (TREE_CODE (TREE_TYPE (type2)) == FUNCTION_TYPE)
3517 pedwarn (input_location, OPT_pedantic,
3518 "ISO C forbids conditional expr between "
3519 "%<void *%> and function pointer");
3520 result_type = build_pointer_type (qualify_type (TREE_TYPE (type1),
3521 TREE_TYPE (type2)));
3523 else if (VOID_TYPE_P (TREE_TYPE (type2)))
3525 if (TREE_CODE (TREE_TYPE (type1)) == FUNCTION_TYPE)
3526 pedwarn (input_location, OPT_pedantic,
3527 "ISO C forbids conditional expr between "
3528 "%<void *%> and function pointer");
3529 result_type = build_pointer_type (qualify_type (TREE_TYPE (type2),
3530 TREE_TYPE (type1)));
3534 pedwarn (input_location, 0,
3535 "pointer type mismatch in conditional expression");
3536 result_type = build_pointer_type (void_type_node);
3539 else if (code1 == POINTER_TYPE && code2 == INTEGER_TYPE)
3541 if (!null_pointer_constant_p (orig_op2))
3542 pedwarn (input_location, 0,
3543 "pointer/integer type mismatch in conditional expression");
3546 op2 = null_pointer_node;
3548 result_type = type1;
3550 else if (code2 == POINTER_TYPE && code1 == INTEGER_TYPE)
3552 if (!null_pointer_constant_p (orig_op1))
3553 pedwarn (input_location, 0,
3554 "pointer/integer type mismatch in conditional expression");
3557 op1 = null_pointer_node;
3559 result_type = type2;
3564 if (flag_cond_mismatch)
3565 result_type = void_type_node;
3568 error ("type mismatch in conditional expression");
3569 return error_mark_node;
3573 /* Merge const and volatile flags of the incoming types. */
3575 = build_type_variant (result_type,
3576 TREE_READONLY (op1) || TREE_READONLY (op2),
3577 TREE_THIS_VOLATILE (op1) || TREE_THIS_VOLATILE (op2));
3579 if (result_type != TREE_TYPE (op1))
3580 op1 = convert_and_check (result_type, op1);
3581 if (result_type != TREE_TYPE (op2))
3582 op2 = convert_and_check (result_type, op2);
3584 return fold_build3 (COND_EXPR, result_type, ifexp, op1, op2);
3587 /* Return a compound expression that performs two expressions and
3588 returns the value of the second of them. */
3591 build_compound_expr (tree expr1, tree expr2)
3593 if (!TREE_SIDE_EFFECTS (expr1))
3595 /* The left-hand operand of a comma expression is like an expression
3596 statement: with -Wunused, we should warn if it doesn't have
3597 any side-effects, unless it was explicitly cast to (void). */
3598 if (warn_unused_value)
3600 if (VOID_TYPE_P (TREE_TYPE (expr1))
3601 && CONVERT_EXPR_P (expr1))
3603 else if (VOID_TYPE_P (TREE_TYPE (expr1))
3604 && TREE_CODE (expr1) == COMPOUND_EXPR
3605 && CONVERT_EXPR_P (TREE_OPERAND (expr1, 1)))
3606 ; /* (void) a, (void) b, c */
3608 warning (OPT_Wunused_value,
3609 "left-hand operand of comma expression has no effect");
3613 /* With -Wunused, we should also warn if the left-hand operand does have
3614 side-effects, but computes a value which is not used. For example, in
3615 `foo() + bar(), baz()' the result of the `+' operator is not used,
3616 so we should issue a warning. */
3617 else if (warn_unused_value)
3618 warn_if_unused_value (expr1, input_location);
3620 if (expr2 == error_mark_node)
3621 return error_mark_node;
3623 return build2 (COMPOUND_EXPR, TREE_TYPE (expr2), expr1, expr2);
3626 /* Build an expression representing a cast to type TYPE of expression EXPR. */
3629 build_c_cast (tree type, tree expr)
3633 if (type == error_mark_node || expr == error_mark_node)
3634 return error_mark_node;
3636 /* The ObjC front-end uses TYPE_MAIN_VARIANT to tie together types differing
3637 only in <protocol> qualifications. But when constructing cast expressions,
3638 the protocols do matter and must be kept around. */
3639 if (objc_is_object_ptr (type) && objc_is_object_ptr (TREE_TYPE (expr)))
3640 return build1 (NOP_EXPR, type, expr);
3642 type = TYPE_MAIN_VARIANT (type);
3644 if (TREE_CODE (type) == ARRAY_TYPE)
3646 error ("cast specifies array type");
3647 return error_mark_node;
3650 if (TREE_CODE (type) == FUNCTION_TYPE)
3652 error ("cast specifies function type");
3653 return error_mark_node;
3656 if (!VOID_TYPE_P (type))
3658 value = require_complete_type (value);
3659 if (value == error_mark_node)
3660 return error_mark_node;
3663 if (type == TYPE_MAIN_VARIANT (TREE_TYPE (value)))
3665 if (TREE_CODE (type) == RECORD_TYPE
3666 || TREE_CODE (type) == UNION_TYPE)
3667 pedwarn (input_location, OPT_pedantic,
3668 "ISO C forbids casting nonscalar to the same type");
3670 else if (TREE_CODE (type) == UNION_TYPE)
3674 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
3675 if (TREE_TYPE (field) != error_mark_node
3676 && comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (field)),
3677 TYPE_MAIN_VARIANT (TREE_TYPE (value))))
3684 pedwarn (input_location, OPT_pedantic,
3685 "ISO C forbids casts to union type");
3686 t = digest_init (type,
3687 build_constructor_single (type, field, value),
3689 TREE_CONSTANT (t) = TREE_CONSTANT (value);
3692 error ("cast to union type from type not present in union");
3693 return error_mark_node;
3699 if (type == void_type_node)
3700 return build1 (CONVERT_EXPR, type, value);
3702 otype = TREE_TYPE (value);
3704 /* Optionally warn about potentially worrisome casts. */
3707 && TREE_CODE (type) == POINTER_TYPE
3708 && TREE_CODE (otype) == POINTER_TYPE)
3710 tree in_type = type;
3711 tree in_otype = otype;
3715 /* Check that the qualifiers on IN_TYPE are a superset of
3716 the qualifiers of IN_OTYPE. The outermost level of
3717 POINTER_TYPE nodes is uninteresting and we stop as soon
3718 as we hit a non-POINTER_TYPE node on either type. */
3721 in_otype = TREE_TYPE (in_otype);
3722 in_type = TREE_TYPE (in_type);
3724 /* GNU C allows cv-qualified function types. 'const'
3725 means the function is very pure, 'volatile' means it
3726 can't return. We need to warn when such qualifiers
3727 are added, not when they're taken away. */
3728 if (TREE_CODE (in_otype) == FUNCTION_TYPE
3729 && TREE_CODE (in_type) == FUNCTION_TYPE)
3730 added |= (TYPE_QUALS (in_type) & ~TYPE_QUALS (in_otype));
3732 discarded |= (TYPE_QUALS (in_otype) & ~TYPE_QUALS (in_type));
3734 while (TREE_CODE (in_type) == POINTER_TYPE
3735 && TREE_CODE (in_otype) == POINTER_TYPE);
3738 warning (OPT_Wcast_qual, "cast adds new qualifiers to function type");
3741 /* There are qualifiers present in IN_OTYPE that are not
3742 present in IN_TYPE. */
3743 warning (OPT_Wcast_qual, "cast discards qualifiers from pointer target type");
3746 /* Warn about possible alignment problems. */
3747 if (STRICT_ALIGNMENT
3748 && TREE_CODE (type) == POINTER_TYPE
3749 && TREE_CODE (otype) == POINTER_TYPE
3750 && TREE_CODE (TREE_TYPE (otype)) != VOID_TYPE
3751 && TREE_CODE (TREE_TYPE (otype)) != FUNCTION_TYPE
3752 /* Don't warn about opaque types, where the actual alignment
3753 restriction is unknown. */
3754 && !((TREE_CODE (TREE_TYPE (otype)) == UNION_TYPE
3755 || TREE_CODE (TREE_TYPE (otype)) == RECORD_TYPE)
3756 && TYPE_MODE (TREE_TYPE (otype)) == VOIDmode)
3757 && TYPE_ALIGN (TREE_TYPE (type)) > TYPE_ALIGN (TREE_TYPE (otype)))
3758 warning (OPT_Wcast_align,
3759 "cast increases required alignment of target type");
3761 if (TREE_CODE (type) == INTEGER_TYPE
3762 && TREE_CODE (otype) == POINTER_TYPE
3763 && TYPE_PRECISION (type) != TYPE_PRECISION (otype))
3764 /* Unlike conversion of integers to pointers, where the
3765 warning is disabled for converting constants because
3766 of cases such as SIG_*, warn about converting constant
3767 pointers to integers. In some cases it may cause unwanted
3768 sign extension, and a warning is appropriate. */
3769 warning (OPT_Wpointer_to_int_cast,
3770 "cast from pointer to integer of different size");
3772 if (TREE_CODE (value) == CALL_EXPR
3773 && TREE_CODE (type) != TREE_CODE (otype))
3774 warning (OPT_Wbad_function_cast, "cast from function call of type %qT "
3775 "to non-matching type %qT", otype, type);
3777 if (TREE_CODE (type) == POINTER_TYPE
3778 && TREE_CODE (otype) == INTEGER_TYPE
3779 && TYPE_PRECISION (type) != TYPE_PRECISION (otype)
3780 /* Don't warn about converting any constant. */
3781 && !TREE_CONSTANT (value))
3782 warning (OPT_Wint_to_pointer_cast, "cast to pointer from integer "
3783 "of different size");
3785 if (warn_strict_aliasing <= 2)
3786 strict_aliasing_warning (otype, type, expr);
3788 /* If pedantic, warn for conversions between function and object
3789 pointer types, except for converting a null pointer constant
3790 to function pointer type. */
3792 && TREE_CODE (type) == POINTER_TYPE
3793 && TREE_CODE (otype) == POINTER_TYPE
3794 && TREE_CODE (TREE_TYPE (otype)) == FUNCTION_TYPE
3795 && TREE_CODE (TREE_TYPE (type)) != FUNCTION_TYPE)
3796 pedwarn (input_location, OPT_pedantic, "ISO C forbids "
3797 "conversion of function pointer to object pointer type");
3800 && TREE_CODE (type) == POINTER_TYPE
3801 && TREE_CODE (otype) == POINTER_TYPE
3802 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE
3803 && TREE_CODE (TREE_TYPE (otype)) != FUNCTION_TYPE
3804 && !null_pointer_constant_p (value))
3805 pedwarn (input_location, OPT_pedantic, "ISO C forbids "
3806 "conversion of object pointer to function pointer type");
3809 value = convert (type, value);
3811 /* Ignore any integer overflow caused by the cast. */
3812 if (TREE_CODE (value) == INTEGER_CST)
3814 if (CONSTANT_CLASS_P (ovalue) && TREE_OVERFLOW (ovalue))
3816 if (!TREE_OVERFLOW (value))
3818 /* Avoid clobbering a shared constant. */
3819 value = copy_node (value);
3820 TREE_OVERFLOW (value) = TREE_OVERFLOW (ovalue);
3823 else if (TREE_OVERFLOW (value))
3824 /* Reset VALUE's overflow flags, ensuring constant sharing. */
3825 value = build_int_cst_wide (TREE_TYPE (value),
3826 TREE_INT_CST_LOW (value),
3827 TREE_INT_CST_HIGH (value));
3831 /* Don't let a cast be an lvalue. */
3833 value = non_lvalue (value);
3838 /* Interpret a cast of expression EXPR to type TYPE. */
3840 c_cast_expr (struct c_type_name *type_name, tree expr)
3843 int saved_wsp = warn_strict_prototypes;
3845 /* This avoids warnings about unprototyped casts on
3846 integers. E.g. "#define SIG_DFL (void(*)())0". */
3847 if (TREE_CODE (expr) == INTEGER_CST)
3848 warn_strict_prototypes = 0;
3849 type = groktypename (type_name);
3850 warn_strict_prototypes = saved_wsp;
3852 return build_c_cast (type, expr);
3855 /* Build an assignment expression of lvalue LHS from value RHS.
3856 MODIFYCODE is the code for a binary operator that we use
3857 to combine the old value of LHS with RHS to get the new value.
3858 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
3860 LOCATION is the location of the MODIFYCODE operator. */
3863 build_modify_expr (location_t location,
3864 tree lhs, enum tree_code modifycode, tree rhs)
3868 tree lhstype = TREE_TYPE (lhs);
3869 tree olhstype = lhstype;
3871 /* Types that aren't fully specified cannot be used in assignments. */
3872 lhs = require_complete_type (lhs);
3874 /* Avoid duplicate error messages from operands that had errors. */
3875 if (TREE_CODE (lhs) == ERROR_MARK || TREE_CODE (rhs) == ERROR_MARK)
3876 return error_mark_node;
3878 if (!lvalue_or_else (lhs, lv_assign))
3879 return error_mark_node;
3881 STRIP_TYPE_NOPS (rhs);
3885 /* If a binary op has been requested, combine the old LHS value with the RHS
3886 producing the value we should actually store into the LHS. */
3888 if (modifycode != NOP_EXPR)
3890 lhs = stabilize_reference (lhs);
3891 newrhs = build_binary_op (location,
3892 modifycode, lhs, rhs, 1);
3895 /* Give an error for storing in something that is 'const'. */
3897 if (TREE_READONLY (lhs) || TYPE_READONLY (lhstype)
3898 || ((TREE_CODE (lhstype) == RECORD_TYPE
3899 || TREE_CODE (lhstype) == UNION_TYPE)
3900 && C_TYPE_FIELDS_READONLY (lhstype)))
3902 readonly_error (lhs, lv_assign);
3903 return error_mark_node;
3906 /* If storing into a structure or union member,
3907 it has probably been given type `int'.
3908 Compute the type that would go with
3909 the actual amount of storage the member occupies. */
3911 if (TREE_CODE (lhs) == COMPONENT_REF
3912 && (TREE_CODE (lhstype) == INTEGER_TYPE
3913 || TREE_CODE (lhstype) == BOOLEAN_TYPE
3914 || TREE_CODE (lhstype) == REAL_TYPE
3915 || TREE_CODE (lhstype) == ENUMERAL_TYPE))
3916 lhstype = TREE_TYPE (get_unwidened (lhs, 0));
3918 /* If storing in a field that is in actuality a short or narrower than one,
3919 we must store in the field in its actual type. */
3921 if (lhstype != TREE_TYPE (lhs))
3923 lhs = copy_node (lhs);
3924 TREE_TYPE (lhs) = lhstype;
3927 /* Convert new value to destination type. */
3929 newrhs = convert_for_assignment (lhstype, newrhs, ic_assign,
3930 NULL_TREE, NULL_TREE, 0);
3931 if (TREE_CODE (newrhs) == ERROR_MARK)
3932 return error_mark_node;
3934 /* Emit ObjC write barrier, if necessary. */
3935 if (c_dialect_objc () && flag_objc_gc)
3937 result = objc_generate_write_barrier (lhs, modifycode, newrhs);
3940 protected_set_expr_location (result, location);
3945 /* Scan operands. */
3947 result = build2 (MODIFY_EXPR, lhstype, lhs, newrhs);
3948 TREE_SIDE_EFFECTS (result) = 1;
3949 protected_set_expr_location (result, location);
3951 /* If we got the LHS in a different type for storing in,
3952 convert the result back to the nominal type of LHS
3953 so that the value we return always has the same type
3954 as the LHS argument. */
3956 if (olhstype == TREE_TYPE (result))
3959 result = convert_for_assignment (olhstype, result, ic_assign,
3960 NULL_TREE, NULL_TREE, 0);
3961 protected_set_expr_location (result, location);
3965 /* Convert value RHS to type TYPE as preparation for an assignment
3966 to an lvalue of type TYPE.
3967 The real work of conversion is done by `convert'.
3968 The purpose of this function is to generate error messages
3969 for assignments that are not allowed in C.
3970 ERRTYPE says whether it is argument passing, assignment,
3971 initialization or return.
3973 FUNCTION is a tree for the function being called.
3974 PARMNUM is the number of the argument, for printing in error messages. */
3977 convert_for_assignment (tree type, tree rhs, enum impl_conv errtype,
3978 tree fundecl, tree function, int parmnum)
3980 enum tree_code codel = TREE_CODE (type);
3982 enum tree_code coder;
3983 tree rname = NULL_TREE;
3984 bool objc_ok = false;
3986 if (errtype == ic_argpass)
3989 /* Change pointer to function to the function itself for
3991 if (TREE_CODE (function) == ADDR_EXPR
3992 && TREE_CODE (TREE_OPERAND (function, 0)) == FUNCTION_DECL)
3993 function = TREE_OPERAND (function, 0);
3995 /* Handle an ObjC selector specially for diagnostics. */
3996 selector = objc_message_selector ();
3998 if (selector && parmnum > 2)
4005 /* This macro is used to emit diagnostics to ensure that all format
4006 strings are complete sentences, visible to gettext and checked at
4008 #define WARN_FOR_ASSIGNMENT(LOCATION, OPT, AR, AS, IN, RE) \
4013 if (pedwarn (LOCATION, OPT, AR, parmnum, rname)) \
4014 inform ((fundecl && !DECL_IS_BUILTIN (fundecl)) \
4015 ? DECL_SOURCE_LOCATION (fundecl) : LOCATION, \
4016 "expected %qT but argument is of type %qT", \
4020 pedwarn (LOCATION, OPT, AS); \
4023 pedwarn (LOCATION, OPT, IN); \
4026 pedwarn (LOCATION, OPT, RE); \
4029 gcc_unreachable (); \
4033 STRIP_TYPE_NOPS (rhs);
4035 if (optimize && TREE_CODE (rhs) == VAR_DECL
4036 && TREE_CODE (TREE_TYPE (rhs)) != ARRAY_TYPE)
4037 rhs = decl_constant_value_for_broken_optimization (rhs);
4039 rhstype = TREE_TYPE (rhs);
4040 coder = TREE_CODE (rhstype);
4042 if (coder == ERROR_MARK)
4043 return error_mark_node;
4045 if (c_dialect_objc ())
4068 objc_ok = objc_compare_types (type, rhstype, parmno, rname);
4071 if (TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (rhstype))
4074 if (coder == VOID_TYPE)
4076 /* Except for passing an argument to an unprototyped function,
4077 this is a constraint violation. When passing an argument to
4078 an unprototyped function, it is compile-time undefined;
4079 making it a constraint in that case was rejected in
4081 error ("void value not ignored as it ought to be");
4082 return error_mark_node;
4084 rhs = require_complete_type (rhs);
4085 if (rhs == error_mark_node)
4086 return error_mark_node;
4087 /* A type converts to a reference to it.
4088 This code doesn't fully support references, it's just for the
4089 special case of va_start and va_copy. */
4090 if (codel == REFERENCE_TYPE
4091 && comptypes (TREE_TYPE (type), TREE_TYPE (rhs)) == 1)
4093 if (!lvalue_p (rhs))
4095 error ("cannot pass rvalue to reference parameter");
4096 return error_mark_node;
4098 if (!c_mark_addressable (rhs))
4099 return error_mark_node;
4100 rhs = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (rhs)), rhs);
4102 /* We already know that these two types are compatible, but they
4103 may not be exactly identical. In fact, `TREE_TYPE (type)' is
4104 likely to be __builtin_va_list and `TREE_TYPE (rhs)' is
4105 likely to be va_list, a typedef to __builtin_va_list, which
4106 is different enough that it will cause problems later. */
4107 if (TREE_TYPE (TREE_TYPE (rhs)) != TREE_TYPE (type))
4108 rhs = build1 (NOP_EXPR, build_pointer_type (TREE_TYPE (type)), rhs);
4110 rhs = build1 (NOP_EXPR, type, rhs);
4113 /* Some types can interconvert without explicit casts. */
4114 else if (codel == VECTOR_TYPE && coder == VECTOR_TYPE
4115 && vector_types_convertible_p (type, TREE_TYPE (rhs), true))
4116 return convert (type, rhs);
4117 /* Arithmetic types all interconvert, and enum is treated like int. */
4118 else if ((codel == INTEGER_TYPE || codel == REAL_TYPE
4119 || codel == FIXED_POINT_TYPE
4120 || codel == ENUMERAL_TYPE || codel == COMPLEX_TYPE
4121 || codel == BOOLEAN_TYPE)
4122 && (coder == INTEGER_TYPE || coder == REAL_TYPE
4123 || coder == FIXED_POINT_TYPE
4124 || coder == ENUMERAL_TYPE || coder == COMPLEX_TYPE
4125 || coder == BOOLEAN_TYPE))
4126 return convert_and_check (type, rhs);
4128 /* Aggregates in different TUs might need conversion. */
4129 if ((codel == RECORD_TYPE || codel == UNION_TYPE)
4131 && comptypes (type, rhstype))
4132 return convert_and_check (type, rhs);
4134 /* Conversion to a transparent union from its member types.
4135 This applies only to function arguments. */
4136 if (codel == UNION_TYPE && TYPE_TRANSPARENT_UNION (type)
4137 && errtype == ic_argpass)
4139 tree memb, marginal_memb = NULL_TREE;
4141 for (memb = TYPE_FIELDS (type); memb ; memb = TREE_CHAIN (memb))
4143 tree memb_type = TREE_TYPE (memb);
4145 if (comptypes (TYPE_MAIN_VARIANT (memb_type),
4146 TYPE_MAIN_VARIANT (rhstype)))
4149 if (TREE_CODE (memb_type) != POINTER_TYPE)
4152 if (coder == POINTER_TYPE)
4154 tree ttl = TREE_TYPE (memb_type);
4155 tree ttr = TREE_TYPE (rhstype);
4157 /* Any non-function converts to a [const][volatile] void *
4158 and vice versa; otherwise, targets must be the same.
4159 Meanwhile, the lhs target must have all the qualifiers of
4161 if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
4162 || comp_target_types (memb_type, rhstype))
4164 /* If this type won't generate any warnings, use it. */
4165 if (TYPE_QUALS (ttl) == TYPE_QUALS (ttr)
4166 || ((TREE_CODE (ttr) == FUNCTION_TYPE
4167 && TREE_CODE (ttl) == FUNCTION_TYPE)
4168 ? ((TYPE_QUALS (ttl) | TYPE_QUALS (ttr))
4169 == TYPE_QUALS (ttr))
4170 : ((TYPE_QUALS (ttl) | TYPE_QUALS (ttr))
4171 == TYPE_QUALS (ttl))))
4174 /* Keep looking for a better type, but remember this one. */
4176 marginal_memb = memb;
4180 /* Can convert integer zero to any pointer type. */
4181 if (null_pointer_constant_p (rhs))
4183 rhs = null_pointer_node;
4188 if (memb || marginal_memb)
4192 /* We have only a marginally acceptable member type;
4193 it needs a warning. */
4194 tree ttl = TREE_TYPE (TREE_TYPE (marginal_memb));
4195 tree ttr = TREE_TYPE (rhstype);
4197 /* Const and volatile mean something different for function
4198 types, so the usual warnings are not appropriate. */
4199 if (TREE_CODE (ttr) == FUNCTION_TYPE
4200 && TREE_CODE (ttl) == FUNCTION_TYPE)
4202 /* Because const and volatile on functions are
4203 restrictions that say the function will not do
4204 certain things, it is okay to use a const or volatile
4205 function where an ordinary one is wanted, but not
4207 if (TYPE_QUALS (ttl) & ~TYPE_QUALS (ttr))
4208 WARN_FOR_ASSIGNMENT (input_location, 0,
4209 G_("passing argument %d of %qE "
4210 "makes qualified function "
4211 "pointer from unqualified"),
4212 G_("assignment makes qualified "
4213 "function pointer from "
4215 G_("initialization makes qualified "
4216 "function pointer from "
4218 G_("return makes qualified function "
4219 "pointer from unqualified"));
4221 else if (TYPE_QUALS (ttr) & ~TYPE_QUALS (ttl))
4222 WARN_FOR_ASSIGNMENT (input_location, 0,
4223 G_("passing argument %d of %qE discards "
4224 "qualifiers from pointer target type"),
4225 G_("assignment discards qualifiers "
4226 "from pointer target type"),
4227 G_("initialization discards qualifiers "
4228 "from pointer target type"),
4229 G_("return discards qualifiers from "
4230 "pointer target type"));
4232 memb = marginal_memb;
4235 if (!fundecl || !DECL_IN_SYSTEM_HEADER (fundecl))
4236 pedwarn (input_location, OPT_pedantic,
4237 "ISO C prohibits argument conversion to union type");
4239 rhs = fold_convert (TREE_TYPE (memb), rhs);
4240 return build_constructor_single (type, memb, rhs);
4244 /* Conversions among pointers */
4245 else if ((codel == POINTER_TYPE || codel == REFERENCE_TYPE)
4246 && (coder == codel))
4248 tree ttl = TREE_TYPE (type);
4249 tree ttr = TREE_TYPE (rhstype);
4252 bool is_opaque_pointer;
4253 int target_cmp = 0; /* Cache comp_target_types () result. */
4255 if (TREE_CODE (mvl) != ARRAY_TYPE)
4256 mvl = TYPE_MAIN_VARIANT (mvl);
4257 if (TREE_CODE (mvr) != ARRAY_TYPE)
4258 mvr = TYPE_MAIN_VARIANT (mvr);
4259 /* Opaque pointers are treated like void pointers. */
4260 is_opaque_pointer = vector_targets_convertible_p (ttl, ttr);
4262 /* C++ does not allow the implicit conversion void* -> T*. However,
4263 for the purpose of reducing the number of false positives, we
4264 tolerate the special case of
4268 where NULL is typically defined in C to be '(void *) 0'. */
4269 if (VOID_TYPE_P (ttr) && rhs != null_pointer_node && !VOID_TYPE_P (ttl))
4270 warning (OPT_Wc___compat, "request for implicit conversion from "
4271 "%qT to %qT not permitted in C++", rhstype, type);
4273 /* Check if the right-hand side has a format attribute but the
4274 left-hand side doesn't. */
4275 if (warn_missing_format_attribute
4276 && check_missing_format_attribute (type, rhstype))
4281 warning (OPT_Wmissing_format_attribute,
4282 "argument %d of %qE might be "
4283 "a candidate for a format attribute",
4287 warning (OPT_Wmissing_format_attribute,
4288 "assignment left-hand side might be "
4289 "a candidate for a format attribute");
4292 warning (OPT_Wmissing_format_attribute,
4293 "initialization left-hand side might be "
4294 "a candidate for a format attribute");
4297 warning (OPT_Wmissing_format_attribute,
4298 "return type might be "
4299 "a candidate for a format attribute");
4306 /* Any non-function converts to a [const][volatile] void *
4307 and vice versa; otherwise, targets must be the same.
4308 Meanwhile, the lhs target must have all the qualifiers of the rhs. */
4309 if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
4310 || (target_cmp = comp_target_types (type, rhstype))
4311 || is_opaque_pointer
4312 || (c_common_unsigned_type (mvl)
4313 == c_common_unsigned_type (mvr)))
4316 && ((VOID_TYPE_P (ttl) && TREE_CODE (ttr) == FUNCTION_TYPE)
4319 && !null_pointer_constant_p (rhs)
4320 && TREE_CODE (ttl) == FUNCTION_TYPE)))
4321 WARN_FOR_ASSIGNMENT (input_location, OPT_pedantic,
4322 G_("ISO C forbids passing argument %d of "
4323 "%qE between function pointer "
4325 G_("ISO C forbids assignment between "
4326 "function pointer and %<void *%>"),
4327 G_("ISO C forbids initialization between "
4328 "function pointer and %<void *%>"),
4329 G_("ISO C forbids return between function "
4330 "pointer and %<void *%>"));
4331 /* Const and volatile mean something different for function types,
4332 so the usual warnings are not appropriate. */
4333 else if (TREE_CODE (ttr) != FUNCTION_TYPE
4334 && TREE_CODE (ttl) != FUNCTION_TYPE)
4336 if (TYPE_QUALS (ttr) & ~TYPE_QUALS (ttl))
4338 /* Types differing only by the presence of the 'volatile'
4339 qualifier are acceptable if the 'volatile' has been added
4340 in by the Objective-C EH machinery. */
4341 if (!objc_type_quals_match (ttl, ttr))
4342 WARN_FOR_ASSIGNMENT (input_location, 0,
4343 G_("passing argument %d of %qE discards "
4344 "qualifiers from pointer target type"),
4345 G_("assignment discards qualifiers "
4346 "from pointer target type"),
4347 G_("initialization discards qualifiers "
4348 "from pointer target type"),
4349 G_("return discards qualifiers from "
4350 "pointer target type"));
4352 /* If this is not a case of ignoring a mismatch in signedness,
4354 else if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
4357 /* If there is a mismatch, do warn. */
4358 else if (warn_pointer_sign)
4359 WARN_FOR_ASSIGNMENT (input_location, OPT_Wpointer_sign,
4360 G_("pointer targets in passing argument "
4361 "%d of %qE differ in signedness"),
4362 G_("pointer targets in assignment "
4363 "differ in signedness"),
4364 G_("pointer targets in initialization "
4365 "differ in signedness"),
4366 G_("pointer targets in return differ "
4369 else if (TREE_CODE (ttl) == FUNCTION_TYPE
4370 && TREE_CODE (ttr) == FUNCTION_TYPE)
4372 /* Because const and volatile on functions are restrictions
4373 that say the function will not do certain things,
4374 it is okay to use a const or volatile function
4375 where an ordinary one is wanted, but not vice-versa. */
4376 if (TYPE_QUALS (ttl) & ~TYPE_QUALS (ttr))
4377 WARN_FOR_ASSIGNMENT (input_location, 0,
4378 G_("passing argument %d of %qE makes "
4379 "qualified function pointer "
4380 "from unqualified"),
4381 G_("assignment makes qualified function "
4382 "pointer from unqualified"),
4383 G_("initialization makes qualified "
4384 "function pointer from unqualified"),
4385 G_("return makes qualified function "
4386 "pointer from unqualified"));
4390 /* Avoid warning about the volatile ObjC EH puts on decls. */
4392 WARN_FOR_ASSIGNMENT (input_location, 0,
4393 G_("passing argument %d of %qE from "
4394 "incompatible pointer type"),
4395 G_("assignment from incompatible pointer type"),
4396 G_("initialization from incompatible "
4398 G_("return from incompatible pointer type"));
4400 return convert (type, rhs);
4402 else if (codel == POINTER_TYPE && coder == ARRAY_TYPE)
4404 /* ??? This should not be an error when inlining calls to
4405 unprototyped functions. */
4406 error ("invalid use of non-lvalue array");
4407 return error_mark_node;
4409 else if (codel == POINTER_TYPE && coder == INTEGER_TYPE)
4411 /* An explicit constant 0 can convert to a pointer,
4412 or one that results from arithmetic, even including
4413 a cast to integer type. */
4414 if (!null_pointer_constant_p (rhs))
4415 WARN_FOR_ASSIGNMENT (input_location, 0,
4416 G_("passing argument %d of %qE makes "
4417 "pointer from integer without a cast"),
4418 G_("assignment makes pointer from integer "
4420 G_("initialization makes pointer from "
4421 "integer without a cast"),
4422 G_("return makes pointer from integer "
4425 return convert (type, rhs);
4427 else if (codel == INTEGER_TYPE && coder == POINTER_TYPE)
4429 WARN_FOR_ASSIGNMENT (input_location, 0,
4430 G_("passing argument %d of %qE makes integer "
4431 "from pointer without a cast"),
4432 G_("assignment makes integer from pointer "
4434 G_("initialization makes integer from pointer "
4436 G_("return makes integer from pointer "
4438 return convert (type, rhs);
4440 else if (codel == BOOLEAN_TYPE && coder == POINTER_TYPE)
4441 return convert (type, rhs);
4446 error ("incompatible type for argument %d of %qE", parmnum, rname);
4447 inform ((fundecl && !DECL_IS_BUILTIN (fundecl))
4448 ? DECL_SOURCE_LOCATION (fundecl) : input_location,
4449 "expected %qT but argument is of type %qT", type, rhstype);
4452 error ("incompatible types when assigning to type %qT from type %qT",
4456 error ("incompatible types when initializing type %qT using type %qT",
4460 error ("incompatible types when returning type %qT but %qT was expected",
4467 return error_mark_node;
4470 /* If VALUE is a compound expr all of whose expressions are constant, then
4471 return its value. Otherwise, return error_mark_node.
4473 This is for handling COMPOUND_EXPRs as initializer elements
4474 which is allowed with a warning when -pedantic is specified. */
4477 valid_compound_expr_initializer (tree value, tree endtype)
4479 if (TREE_CODE (value) == COMPOUND_EXPR)
4481 if (valid_compound_expr_initializer (TREE_OPERAND (value, 0), endtype)
4483 return error_mark_node;
4484 return valid_compound_expr_initializer (TREE_OPERAND (value, 1),
4487 else if (!initializer_constant_valid_p (value, endtype))
4488 return error_mark_node;
4493 /* Perform appropriate conversions on the initial value of a variable,
4494 store it in the declaration DECL,
4495 and print any error messages that are appropriate.
4496 If the init is invalid, store an ERROR_MARK. */
4499 store_init_value (tree decl, tree init)
4503 /* If variable's type was invalidly declared, just ignore it. */
4505 type = TREE_TYPE (decl);
4506 if (TREE_CODE (type) == ERROR_MARK)
4509 /* Digest the specified initializer into an expression. */
4511 value = digest_init (type, init, true, TREE_STATIC (decl));
4513 /* Store the expression if valid; else report error. */
4515 if (!in_system_header
4516 && AGGREGATE_TYPE_P (TREE_TYPE (decl)) && !TREE_STATIC (decl))
4517 warning (OPT_Wtraditional, "traditional C rejects automatic "
4518 "aggregate initialization");
4520 DECL_INITIAL (decl) = value;
4522 /* ANSI wants warnings about out-of-range constant initializers. */
4523 STRIP_TYPE_NOPS (value);
4524 if (TREE_STATIC (decl))
4525 constant_expression_warning (value);
4527 /* Check if we need to set array size from compound literal size. */
4528 if (TREE_CODE (type) == ARRAY_TYPE
4529 && TYPE_DOMAIN (type) == 0
4530 && value != error_mark_node)
4532 tree inside_init = init;
4534 STRIP_TYPE_NOPS (inside_init);
4535 inside_init = fold (inside_init);
4537 if (TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
4539 tree cldecl = COMPOUND_LITERAL_EXPR_DECL (inside_init);
4541 if (TYPE_DOMAIN (TREE_TYPE (cldecl)))
4543 /* For int foo[] = (int [3]){1}; we need to set array size
4544 now since later on array initializer will be just the
4545 brace enclosed list of the compound literal. */
4546 type = build_distinct_type_copy (TYPE_MAIN_VARIANT (type));
4547 TREE_TYPE (decl) = type;
4548 TYPE_DOMAIN (type) = TYPE_DOMAIN (TREE_TYPE (cldecl));
4550 layout_decl (cldecl, 0);
4556 /* Methods for storing and printing names for error messages. */
4558 /* Implement a spelling stack that allows components of a name to be pushed
4559 and popped. Each element on the stack is this structure. */
4566 unsigned HOST_WIDE_INT i;
4571 #define SPELLING_STRING 1
4572 #define SPELLING_MEMBER 2
4573 #define SPELLING_BOUNDS 3
4575 static struct spelling *spelling; /* Next stack element (unused). */
4576 static struct spelling *spelling_base; /* Spelling stack base. */
4577 static int spelling_size; /* Size of the spelling stack. */
4579 /* Macros to save and restore the spelling stack around push_... functions.
4580 Alternative to SAVE_SPELLING_STACK. */
4582 #define SPELLING_DEPTH() (spelling - spelling_base)
4583 #define RESTORE_SPELLING_DEPTH(DEPTH) (spelling = spelling_base + (DEPTH))
4585 /* Push an element on the spelling stack with type KIND and assign VALUE
4588 #define PUSH_SPELLING(KIND, VALUE, MEMBER) \
4590 int depth = SPELLING_DEPTH (); \
4592 if (depth >= spelling_size) \
4594 spelling_size += 10; \
4595 spelling_base = XRESIZEVEC (struct spelling, spelling_base, \
4597 RESTORE_SPELLING_DEPTH (depth); \
4600 spelling->kind = (KIND); \
4601 spelling->MEMBER = (VALUE); \
4605 /* Push STRING on the stack. Printed literally. */
4608 push_string (const char *string)
4610 PUSH_SPELLING (SPELLING_STRING, string, u.s);
4613 /* Push a member name on the stack. Printed as '.' STRING. */
4616 push_member_name (tree decl)
4618 const char *const string
4619 = DECL_NAME (decl) ? IDENTIFIER_POINTER (DECL_NAME (decl)) : "<anonymous>";
4620 PUSH_SPELLING (SPELLING_MEMBER, string, u.s);
4623 /* Push an array bounds on the stack. Printed as [BOUNDS]. */
4626 push_array_bounds (unsigned HOST_WIDE_INT bounds)
4628 PUSH_SPELLING (SPELLING_BOUNDS, bounds, u.i);
4631 /* Compute the maximum size in bytes of the printed spelling. */
4634 spelling_length (void)
4639 for (p = spelling_base; p < spelling; p++)
4641 if (p->kind == SPELLING_BOUNDS)
4644 size += strlen (p->u.s) + 1;
4650 /* Print the spelling to BUFFER and return it. */
4653 print_spelling (char *buffer)
4658 for (p = spelling_base; p < spelling; p++)
4659 if (p->kind == SPELLING_BOUNDS)
4661 sprintf (d, "[" HOST_WIDE_INT_PRINT_UNSIGNED "]", p->u.i);
4667 if (p->kind == SPELLING_MEMBER)
4669 for (s = p->u.s; (*d = *s++); d++)
4676 /* Issue an error message for a bad initializer component.
4677 MSGID identifies the message.
4678 The component name is taken from the spelling stack. */
4681 error_init (const char *msgid)
4685 error ("%s", _(msgid));
4686 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4688 error ("(near initialization for %qs)", ofwhat);
4691 /* Issue a pedantic warning for a bad initializer component. OPT is
4692 the option OPT_* (from options.h) controlling this warning or 0 if
4693 it is unconditionally given. MSGID identifies the message. The
4694 component name is taken from the spelling stack. */
4697 pedwarn_init (location_t location, int opt, const char *msgid)
4701 pedwarn (location, opt, "%s", _(msgid));
4702 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4704 pedwarn (location, opt, "(near initialization for %qs)", ofwhat);
4707 /* Issue a warning for a bad initializer component.
4709 OPT is the OPT_W* value corresponding to the warning option that
4710 controls this warning. MSGID identifies the message. The
4711 component name is taken from the spelling stack. */
4714 warning_init (int opt, const char *msgid)
4718 warning (opt, "%s", _(msgid));
4719 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4721 warning (opt, "(near initialization for %qs)", ofwhat);
4724 /* If TYPE is an array type and EXPR is a parenthesized string
4725 constant, warn if pedantic that EXPR is being used to initialize an
4726 object of type TYPE. */
4729 maybe_warn_string_init (tree type, struct c_expr expr)
4732 && TREE_CODE (type) == ARRAY_TYPE
4733 && TREE_CODE (expr.value) == STRING_CST
4734 && expr.original_code != STRING_CST)
4735 pedwarn_init (input_location, OPT_pedantic,
4736 "array initialized from parenthesized string constant");
4739 /* Digest the parser output INIT as an initializer for type TYPE.
4740 Return a C expression of type TYPE to represent the initial value.
4742 If INIT is a string constant, STRICT_STRING is true if it is
4743 unparenthesized or we should not warn here for it being parenthesized.
4744 For other types of INIT, STRICT_STRING is not used.
4746 REQUIRE_CONSTANT requests an error if non-constant initializers or
4747 elements are seen. */
4750 digest_init (tree type, tree init, bool strict_string, int require_constant)
4752 enum tree_code code = TREE_CODE (type);
4753 tree inside_init = init;
4755 if (type == error_mark_node
4757 || init == error_mark_node
4758 || TREE_TYPE (init) == error_mark_node)
4759 return error_mark_node;
4761 STRIP_TYPE_NOPS (inside_init);
4763 inside_init = fold (inside_init);
4765 /* Initialization of an array of chars from a string constant
4766 optionally enclosed in braces. */
4768 if (code == ARRAY_TYPE && inside_init
4769 && TREE_CODE (inside_init) == STRING_CST)
4771 tree typ1 = TYPE_MAIN_VARIANT (TREE_TYPE (type));
4772 /* Note that an array could be both an array of character type
4773 and an array of wchar_t if wchar_t is signed char or unsigned
4775 bool char_array = (typ1 == char_type_node
4776 || typ1 == signed_char_type_node
4777 || typ1 == unsigned_char_type_node);
4778 bool wchar_array = !!comptypes (typ1, wchar_type_node);
4779 bool char16_array = !!comptypes (typ1, char16_type_node);
4780 bool char32_array = !!comptypes (typ1, char32_type_node);
4782 if (char_array || wchar_array || char16_array || char32_array)
4785 tree typ2 = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (inside_init)));
4786 expr.value = inside_init;
4787 expr.original_code = (strict_string ? STRING_CST : ERROR_MARK);
4788 maybe_warn_string_init (type, expr);
4790 if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
4791 TYPE_MAIN_VARIANT (type)))
4796 if (typ2 != char_type_node)
4798 error_init ("char-array initialized from wide string");
4799 return error_mark_node;
4804 if (typ2 == char_type_node)
4806 error_init ("wide character array initialized from non-wide "
4808 return error_mark_node;
4810 else if (!comptypes(typ1, typ2))
4812 error_init ("wide character array initialized from "
4813 "incompatible wide string");
4814 return error_mark_node;
4818 TREE_TYPE (inside_init) = type;
4819 if (TYPE_DOMAIN (type) != 0
4820 && TYPE_SIZE (type) != 0
4821 && TREE_CODE (TYPE_SIZE (type)) == INTEGER_CST
4822 /* Subtract the size of a single (possibly wide) character
4823 because it's ok to ignore the terminating null char
4824 that is counted in the length of the constant. */
4825 && 0 > compare_tree_int (TYPE_SIZE_UNIT (type),
4826 TREE_STRING_LENGTH (inside_init)
4827 - (TYPE_PRECISION (typ1)
4829 pedwarn_init (input_location, 0,
4830 "initializer-string for array of chars is too long");
4834 else if (INTEGRAL_TYPE_P (typ1))
4836 error_init ("array of inappropriate type initialized "
4837 "from string constant");
4838 return error_mark_node;
4842 /* Build a VECTOR_CST from a *constant* vector constructor. If the
4843 vector constructor is not constant (e.g. {1,2,3,foo()}) then punt
4844 below and handle as a constructor. */
4845 if (code == VECTOR_TYPE
4846 && TREE_CODE (TREE_TYPE (inside_init)) == VECTOR_TYPE
4847 && vector_types_convertible_p (TREE_TYPE (inside_init), type, true)
4848 && TREE_CONSTANT (inside_init))
4850 if (TREE_CODE (inside_init) == VECTOR_CST
4851 && comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
4852 TYPE_MAIN_VARIANT (type)))
4855 if (TREE_CODE (inside_init) == CONSTRUCTOR)
4857 unsigned HOST_WIDE_INT ix;
4859 bool constant_p = true;
4861 /* Iterate through elements and check if all constructor
4862 elements are *_CSTs. */
4863 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (inside_init), ix, value)
4864 if (!CONSTANT_CLASS_P (value))
4871 return build_vector_from_ctor (type,
4872 CONSTRUCTOR_ELTS (inside_init));
4876 if (warn_sequence_point)
4877 verify_sequence_points (inside_init);
4879 /* Any type can be initialized
4880 from an expression of the same type, optionally with braces. */
4882 if (inside_init && TREE_TYPE (inside_init) != 0
4883 && (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
4884 TYPE_MAIN_VARIANT (type))
4885 || (code == ARRAY_TYPE
4886 && comptypes (TREE_TYPE (inside_init), type))
4887 || (code == VECTOR_TYPE
4888 && comptypes (TREE_TYPE (inside_init), type))
4889 || (code == POINTER_TYPE
4890 && TREE_CODE (TREE_TYPE (inside_init)) == ARRAY_TYPE
4891 && comptypes (TREE_TYPE (TREE_TYPE (inside_init)),
4892 TREE_TYPE (type)))))
4894 if (code == POINTER_TYPE)
4896 if (TREE_CODE (TREE_TYPE (inside_init)) == ARRAY_TYPE)
4898 if (TREE_CODE (inside_init) == STRING_CST
4899 || TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
4900 inside_init = array_to_pointer_conversion (inside_init);
4903 error_init ("invalid use of non-lvalue array");
4904 return error_mark_node;
4909 if (code == VECTOR_TYPE)
4910 /* Although the types are compatible, we may require a
4912 inside_init = convert (type, inside_init);
4914 if (require_constant
4915 && (code == VECTOR_TYPE || !flag_isoc99)
4916 && TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
4918 /* As an extension, allow initializing objects with static storage
4919 duration with compound literals (which are then treated just as
4920 the brace enclosed list they contain). Also allow this for
4921 vectors, as we can only assign them with compound literals. */
4922 tree decl = COMPOUND_LITERAL_EXPR_DECL (inside_init);
4923 inside_init = DECL_INITIAL (decl);
4926 if (code == ARRAY_TYPE && TREE_CODE (inside_init) != STRING_CST
4927 && TREE_CODE (inside_init) != CONSTRUCTOR)
4929 error_init ("array initialized from non-constant array expression");
4930 return error_mark_node;
4933 if (optimize && TREE_CODE (inside_init) == VAR_DECL)
4934 inside_init = decl_constant_value_for_broken_optimization (inside_init);
4936 /* Compound expressions can only occur here if -pedantic or
4937 -pedantic-errors is specified. In the later case, we always want
4938 an error. In the former case, we simply want a warning. */
4939 if (require_constant && pedantic
4940 && TREE_CODE (inside_init) == COMPOUND_EXPR)
4943 = valid_compound_expr_initializer (inside_init,
4944 TREE_TYPE (inside_init));
4945 if (inside_init == error_mark_node)
4946 error_init ("initializer element is not constant");
4948 pedwarn_init (input_location, OPT_pedantic,
4949 "initializer element is not constant");
4950 if (flag_pedantic_errors)
4951 inside_init = error_mark_node;
4953 else if (require_constant
4954 && !initializer_constant_valid_p (inside_init,
4955 TREE_TYPE (inside_init)))
4957 error_init ("initializer element is not constant");
4958 inside_init = error_mark_node;
4961 /* Added to enable additional -Wmissing-format-attribute warnings. */
4962 if (TREE_CODE (TREE_TYPE (inside_init)) == POINTER_TYPE)
4963 inside_init = convert_for_assignment (type, inside_init, ic_init, NULL_TREE,
4968 /* Handle scalar types, including conversions. */
4970 if (code == INTEGER_TYPE || code == REAL_TYPE || code == FIXED_POINT_TYPE
4971 || code == POINTER_TYPE || code == ENUMERAL_TYPE || code == BOOLEAN_TYPE
4972 || code == COMPLEX_TYPE || code == VECTOR_TYPE)
4974 if (TREE_CODE (TREE_TYPE (init)) == ARRAY_TYPE
4975 && (TREE_CODE (init) == STRING_CST
4976 || TREE_CODE (init) == COMPOUND_LITERAL_EXPR))
4977 init = array_to_pointer_conversion (init);
4979 = convert_for_assignment (type, init, ic_init,
4980 NULL_TREE, NULL_TREE, 0);
4982 /* Check to see if we have already given an error message. */
4983 if (inside_init == error_mark_node)
4985 else if (require_constant && !TREE_CONSTANT (inside_init))
4987 error_init ("initializer element is not constant");
4988 inside_init = error_mark_node;
4990 else if (require_constant
4991 && !initializer_constant_valid_p (inside_init,
4992 TREE_TYPE (inside_init)))
4994 error_init ("initializer element is not computable at load time");
4995 inside_init = error_mark_node;
5001 /* Come here only for records and arrays. */
5003 if (COMPLETE_TYPE_P (type) && TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST)
5005 error_init ("variable-sized object may not be initialized");
5006 return error_mark_node;
5009 error_init ("invalid initializer");
5010 return error_mark_node;
5013 /* Handle initializers that use braces. */
5015 /* Type of object we are accumulating a constructor for.
5016 This type is always a RECORD_TYPE, UNION_TYPE or ARRAY_TYPE. */
5017 static tree constructor_type;
5019 /* For a RECORD_TYPE or UNION_TYPE, this is the chain of fields
5021 static tree constructor_fields;
5023 /* For an ARRAY_TYPE, this is the specified index
5024 at which to store the next element we get. */
5025 static tree constructor_index;
5027 /* For an ARRAY_TYPE, this is the maximum index. */
5028 static tree constructor_max_index;
5030 /* For a RECORD_TYPE, this is the first field not yet written out. */
5031 static tree constructor_unfilled_fields;
5033 /* For an ARRAY_TYPE, this is the index of the first element
5034 not yet written out. */
5035 static tree constructor_unfilled_index;
5037 /* In a RECORD_TYPE, the byte index of the next consecutive field.
5038 This is so we can generate gaps between fields, when appropriate. */
5039 static tree constructor_bit_index;
5041 /* If we are saving up the elements rather than allocating them,
5042 this is the list of elements so far (in reverse order,
5043 most recent first). */
5044 static VEC(constructor_elt,gc) *constructor_elements;
5046 /* 1 if constructor should be incrementally stored into a constructor chain,
5047 0 if all the elements should be kept in AVL tree. */
5048 static int constructor_incremental;
5050 /* 1 if so far this constructor's elements are all compile-time constants. */
5051 static int constructor_constant;
5053 /* 1 if so far this constructor's elements are all valid address constants. */
5054 static int constructor_simple;
5056 /* 1 if this constructor is erroneous so far. */
5057 static int constructor_erroneous;
5059 /* Structure for managing pending initializer elements, organized as an
5064 struct init_node *left, *right;
5065 struct init_node *parent;
5071 /* Tree of pending elements at this constructor level.
5072 These are elements encountered out of order
5073 which belong at places we haven't reached yet in actually
5075 Will never hold tree nodes across GC runs. */
5076 static struct init_node *constructor_pending_elts;
5078 /* The SPELLING_DEPTH of this constructor. */
5079 static int constructor_depth;
5081 /* DECL node for which an initializer is being read.
5082 0 means we are reading a constructor expression
5083 such as (struct foo) {...}. */
5084 static tree constructor_decl;
5086 /* Nonzero if this is an initializer for a top-level decl. */
5087 static int constructor_top_level;
5089 /* Nonzero if there were any member designators in this initializer. */
5090 static int constructor_designated;
5092 /* Nesting depth of designator list. */
5093 static int designator_depth;
5095 /* Nonzero if there were diagnosed errors in this designator list. */
5096 static int designator_erroneous;
5099 /* This stack has a level for each implicit or explicit level of
5100 structuring in the initializer, including the outermost one. It
5101 saves the values of most of the variables above. */
5103 struct constructor_range_stack;
5105 struct constructor_stack
5107 struct constructor_stack *next;
5112 tree unfilled_index;
5113 tree unfilled_fields;
5115 VEC(constructor_elt,gc) *elements;
5116 struct init_node *pending_elts;
5119 /* If value nonzero, this value should replace the entire
5120 constructor at this level. */
5121 struct c_expr replacement_value;
5122 struct constructor_range_stack *range_stack;
5132 static struct constructor_stack *constructor_stack;
5134 /* This stack represents designators from some range designator up to
5135 the last designator in the list. */
5137 struct constructor_range_stack
5139 struct constructor_range_stack *next, *prev;
5140 struct constructor_stack *stack;
5147 static struct constructor_range_stack *constructor_range_stack;
5149 /* This stack records separate initializers that are nested.
5150 Nested initializers can't happen in ANSI C, but GNU C allows them
5151 in cases like { ... (struct foo) { ... } ... }. */
5153 struct initializer_stack
5155 struct initializer_stack *next;
5157 struct constructor_stack *constructor_stack;
5158 struct constructor_range_stack *constructor_range_stack;
5159 VEC(constructor_elt,gc) *elements;
5160 struct spelling *spelling;
5161 struct spelling *spelling_base;
5164 char require_constant_value;
5165 char require_constant_elements;
5168 static struct initializer_stack *initializer_stack;
5170 /* Prepare to parse and output the initializer for variable DECL. */
5173 start_init (tree decl, tree asmspec_tree ATTRIBUTE_UNUSED, int top_level)
5176 struct initializer_stack *p = XNEW (struct initializer_stack);
5178 p->decl = constructor_decl;
5179 p->require_constant_value = require_constant_value;
5180 p->require_constant_elements = require_constant_elements;
5181 p->constructor_stack = constructor_stack;
5182 p->constructor_range_stack = constructor_range_stack;
5183 p->elements = constructor_elements;
5184 p->spelling = spelling;
5185 p->spelling_base = spelling_base;
5186 p->spelling_size = spelling_size;
5187 p->top_level = constructor_top_level;
5188 p->next = initializer_stack;
5189 initializer_stack = p;
5191 constructor_decl = decl;
5192 constructor_designated = 0;
5193 constructor_top_level = top_level;
5195 if (decl != 0 && decl != error_mark_node)
5197 require_constant_value = TREE_STATIC (decl);
5198 require_constant_elements
5199 = ((TREE_STATIC (decl) || (pedantic && !flag_isoc99))
5200 /* For a scalar, you can always use any value to initialize,
5201 even within braces. */
5202 && (TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE
5203 || TREE_CODE (TREE_TYPE (decl)) == RECORD_TYPE
5204 || TREE_CODE (TREE_TYPE (decl)) == UNION_TYPE
5205 || TREE_CODE (TREE_TYPE (decl)) == QUAL_UNION_TYPE));
5206 locus = IDENTIFIER_POINTER (DECL_NAME (decl));
5210 require_constant_value = 0;
5211 require_constant_elements = 0;
5212 locus = "(anonymous)";
5215 constructor_stack = 0;
5216 constructor_range_stack = 0;
5218 missing_braces_mentioned = 0;
5222 RESTORE_SPELLING_DEPTH (0);
5225 push_string (locus);
5231 struct initializer_stack *p = initializer_stack;
5233 /* Free the whole constructor stack of this initializer. */
5234 while (constructor_stack)
5236 struct constructor_stack *q = constructor_stack;
5237 constructor_stack = q->next;
5241 gcc_assert (!constructor_range_stack);
5243 /* Pop back to the data of the outer initializer (if any). */
5244 free (spelling_base);
5246 constructor_decl = p->decl;
5247 require_constant_value = p->require_constant_value;
5248 require_constant_elements = p->require_constant_elements;
5249 constructor_stack = p->constructor_stack;
5250 constructor_range_stack = p->constructor_range_stack;
5251 constructor_elements = p->elements;
5252 spelling = p->spelling;
5253 spelling_base = p->spelling_base;
5254 spelling_size = p->spelling_size;
5255 constructor_top_level = p->top_level;
5256 initializer_stack = p->next;
5260 /* Call here when we see the initializer is surrounded by braces.
5261 This is instead of a call to push_init_level;
5262 it is matched by a call to pop_init_level.
5264 TYPE is the type to initialize, for a constructor expression.
5265 For an initializer for a decl, TYPE is zero. */
5268 really_start_incremental_init (tree type)
5270 struct constructor_stack *p = XNEW (struct constructor_stack);
5273 type = TREE_TYPE (constructor_decl);
5275 if (targetm.vector_opaque_p (type))
5276 error ("opaque vector types cannot be initialized");
5278 p->type = constructor_type;
5279 p->fields = constructor_fields;
5280 p->index = constructor_index;
5281 p->max_index = constructor_max_index;
5282 p->unfilled_index = constructor_unfilled_index;
5283 p->unfilled_fields = constructor_unfilled_fields;
5284 p->bit_index = constructor_bit_index;
5285 p->elements = constructor_elements;
5286 p->constant = constructor_constant;
5287 p->simple = constructor_simple;
5288 p->erroneous = constructor_erroneous;
5289 p->pending_elts = constructor_pending_elts;
5290 p->depth = constructor_depth;
5291 p->replacement_value.value = 0;
5292 p->replacement_value.original_code = ERROR_MARK;
5296 p->incremental = constructor_incremental;
5297 p->designated = constructor_designated;
5299 constructor_stack = p;
5301 constructor_constant = 1;
5302 constructor_simple = 1;
5303 constructor_depth = SPELLING_DEPTH ();
5304 constructor_elements = 0;
5305 constructor_pending_elts = 0;
5306 constructor_type = type;
5307 constructor_incremental = 1;
5308 constructor_designated = 0;
5309 designator_depth = 0;
5310 designator_erroneous = 0;
5312 if (TREE_CODE (constructor_type) == RECORD_TYPE
5313 || TREE_CODE (constructor_type) == UNION_TYPE)
5315 constructor_fields = TYPE_FIELDS (constructor_type);
5316 /* Skip any nameless bit fields at the beginning. */
5317 while (constructor_fields != 0 && DECL_C_BIT_FIELD (constructor_fields)
5318 && DECL_NAME (constructor_fields) == 0)
5319 constructor_fields = TREE_CHAIN (constructor_fields);
5321 constructor_unfilled_fields = constructor_fields;
5322 constructor_bit_index = bitsize_zero_node;
5324 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5326 if (TYPE_DOMAIN (constructor_type))
5328 constructor_max_index
5329 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type));
5331 /* Detect non-empty initializations of zero-length arrays. */
5332 if (constructor_max_index == NULL_TREE
5333 && TYPE_SIZE (constructor_type))
5334 constructor_max_index = build_int_cst (NULL_TREE, -1);
5336 /* constructor_max_index needs to be an INTEGER_CST. Attempts
5337 to initialize VLAs will cause a proper error; avoid tree
5338 checking errors as well by setting a safe value. */
5339 if (constructor_max_index
5340 && TREE_CODE (constructor_max_index) != INTEGER_CST)
5341 constructor_max_index = build_int_cst (NULL_TREE, -1);
5344 = convert (bitsizetype,
5345 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
5349 constructor_index = bitsize_zero_node;
5350 constructor_max_index = NULL_TREE;
5353 constructor_unfilled_index = constructor_index;
5355 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
5357 /* Vectors are like simple fixed-size arrays. */
5358 constructor_max_index =
5359 build_int_cst (NULL_TREE, TYPE_VECTOR_SUBPARTS (constructor_type) - 1);
5360 constructor_index = bitsize_zero_node;
5361 constructor_unfilled_index = constructor_index;
5365 /* Handle the case of int x = {5}; */
5366 constructor_fields = constructor_type;
5367 constructor_unfilled_fields = constructor_type;
5371 /* Push down into a subobject, for initialization.
5372 If this is for an explicit set of braces, IMPLICIT is 0.
5373 If it is because the next element belongs at a lower level,
5374 IMPLICIT is 1 (or 2 if the push is because of designator list). */
5377 push_init_level (int implicit)
5379 struct constructor_stack *p;
5380 tree value = NULL_TREE;
5382 /* If we've exhausted any levels that didn't have braces,
5383 pop them now. If implicit == 1, this will have been done in
5384 process_init_element; do not repeat it here because in the case
5385 of excess initializers for an empty aggregate this leads to an
5386 infinite cycle of popping a level and immediately recreating
5390 while (constructor_stack->implicit)
5392 if ((TREE_CODE (constructor_type) == RECORD_TYPE
5393 || TREE_CODE (constructor_type) == UNION_TYPE)
5394 && constructor_fields == 0)
5395 process_init_element (pop_init_level (1));
5396 else if (TREE_CODE (constructor_type) == ARRAY_TYPE
5397 && constructor_max_index
5398 && tree_int_cst_lt (constructor_max_index,
5400 process_init_element (pop_init_level (1));
5406 /* Unless this is an explicit brace, we need to preserve previous
5410 if ((TREE_CODE (constructor_type) == RECORD_TYPE
5411 || TREE_CODE (constructor_type) == UNION_TYPE)
5412 && constructor_fields)
5413 value = find_init_member (constructor_fields);
5414 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5415 value = find_init_member (constructor_index);
5418 p = XNEW (struct constructor_stack);
5419 p->type = constructor_type;
5420 p->fields = constructor_fields;
5421 p->index = constructor_index;
5422 p->max_index = constructor_max_index;
5423 p->unfilled_index = constructor_unfilled_index;
5424 p->unfilled_fields = constructor_unfilled_fields;
5425 p->bit_index = constructor_bit_index;
5426 p->elements = constructor_elements;
5427 p->constant = constructor_constant;
5428 p->simple = constructor_simple;
5429 p->erroneous = constructor_erroneous;
5430 p->pending_elts = constructor_pending_elts;
5431 p->depth = constructor_depth;
5432 p->replacement_value.value = 0;
5433 p->replacement_value.original_code = ERROR_MARK;
5434 p->implicit = implicit;
5436 p->incremental = constructor_incremental;
5437 p->designated = constructor_designated;
5438 p->next = constructor_stack;
5440 constructor_stack = p;
5442 constructor_constant = 1;
5443 constructor_simple = 1;
5444 constructor_depth = SPELLING_DEPTH ();
5445 constructor_elements = 0;
5446 constructor_incremental = 1;
5447 constructor_designated = 0;
5448 constructor_pending_elts = 0;
5451 p->range_stack = constructor_range_stack;
5452 constructor_range_stack = 0;
5453 designator_depth = 0;
5454 designator_erroneous = 0;
5457 /* Don't die if an entire brace-pair level is superfluous
5458 in the containing level. */
5459 if (constructor_type == 0)
5461 else if (TREE_CODE (constructor_type) == RECORD_TYPE
5462 || TREE_CODE (constructor_type) == UNION_TYPE)
5464 /* Don't die if there are extra init elts at the end. */
5465 if (constructor_fields == 0)
5466 constructor_type = 0;
5469 constructor_type = TREE_TYPE (constructor_fields);
5470 push_member_name (constructor_fields);
5471 constructor_depth++;
5474 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5476 constructor_type = TREE_TYPE (constructor_type);
5477 push_array_bounds (tree_low_cst (constructor_index, 1));
5478 constructor_depth++;
5481 if (constructor_type == 0)
5483 error_init ("extra brace group at end of initializer");
5484 constructor_fields = 0;
5485 constructor_unfilled_fields = 0;
5489 if (value && TREE_CODE (value) == CONSTRUCTOR)
5491 constructor_constant = TREE_CONSTANT (value);
5492 constructor_simple = TREE_STATIC (value);
5493 constructor_elements = CONSTRUCTOR_ELTS (value);
5494 if (!VEC_empty (constructor_elt, constructor_elements)
5495 && (TREE_CODE (constructor_type) == RECORD_TYPE
5496 || TREE_CODE (constructor_type) == ARRAY_TYPE))
5497 set_nonincremental_init ();
5500 if (implicit == 1 && warn_missing_braces && !missing_braces_mentioned)
5502 missing_braces_mentioned = 1;
5503 warning_init (OPT_Wmissing_braces, "missing braces around initializer");
5506 if (TREE_CODE (constructor_type) == RECORD_TYPE
5507 || TREE_CODE (constructor_type) == UNION_TYPE)
5509 constructor_fields = TYPE_FIELDS (constructor_type);
5510 /* Skip any nameless bit fields at the beginning. */
5511 while (constructor_fields != 0 && DECL_C_BIT_FIELD (constructor_fields)
5512 && DECL_NAME (constructor_fields) == 0)
5513 constructor_fields = TREE_CHAIN (constructor_fields);
5515 constructor_unfilled_fields = constructor_fields;
5516 constructor_bit_index = bitsize_zero_node;
5518 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
5520 /* Vectors are like simple fixed-size arrays. */
5521 constructor_max_index =
5522 build_int_cst (NULL_TREE, TYPE_VECTOR_SUBPARTS (constructor_type) - 1);
5523 constructor_index = convert (bitsizetype, integer_zero_node);
5524 constructor_unfilled_index = constructor_index;
5526 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5528 if (TYPE_DOMAIN (constructor_type))
5530 constructor_max_index
5531 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type));
5533 /* Detect non-empty initializations of zero-length arrays. */
5534 if (constructor_max_index == NULL_TREE
5535 && TYPE_SIZE (constructor_type))
5536 constructor_max_index = build_int_cst (NULL_TREE, -1);
5538 /* constructor_max_index needs to be an INTEGER_CST. Attempts
5539 to initialize VLAs will cause a proper error; avoid tree
5540 checking errors as well by setting a safe value. */
5541 if (constructor_max_index
5542 && TREE_CODE (constructor_max_index) != INTEGER_CST)
5543 constructor_max_index = build_int_cst (NULL_TREE, -1);
5546 = convert (bitsizetype,
5547 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
5550 constructor_index = bitsize_zero_node;
5552 constructor_unfilled_index = constructor_index;
5553 if (value && TREE_CODE (value) == STRING_CST)
5555 /* We need to split the char/wchar array into individual
5556 characters, so that we don't have to special case it
5558 set_nonincremental_init_from_string (value);
5563 if (constructor_type != error_mark_node)
5564 warning_init (0, "braces around scalar initializer");
5565 constructor_fields = constructor_type;
5566 constructor_unfilled_fields = constructor_type;
5570 /* At the end of an implicit or explicit brace level,
5571 finish up that level of constructor. If a single expression
5572 with redundant braces initialized that level, return the
5573 c_expr structure for that expression. Otherwise, the original_code
5574 element is set to ERROR_MARK.
5575 If we were outputting the elements as they are read, return 0 as the value
5576 from inner levels (process_init_element ignores that),
5577 but return error_mark_node as the value from the outermost level
5578 (that's what we want to put in DECL_INITIAL).
5579 Otherwise, return a CONSTRUCTOR expression as the value. */
5582 pop_init_level (int implicit)
5584 struct constructor_stack *p;
5587 ret.original_code = ERROR_MARK;
5591 /* When we come to an explicit close brace,
5592 pop any inner levels that didn't have explicit braces. */
5593 while (constructor_stack->implicit)
5594 process_init_element (pop_init_level (1));
5596 gcc_assert (!constructor_range_stack);
5599 /* Now output all pending elements. */
5600 constructor_incremental = 1;
5601 output_pending_init_elements (1);
5603 p = constructor_stack;
5605 /* Error for initializing a flexible array member, or a zero-length
5606 array member in an inappropriate context. */
5607 if (constructor_type && constructor_fields
5608 && TREE_CODE (constructor_type) == ARRAY_TYPE
5609 && TYPE_DOMAIN (constructor_type)
5610 && !TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type)))
5612 /* Silently discard empty initializations. The parser will
5613 already have pedwarned for empty brackets. */
5614 if (integer_zerop (constructor_unfilled_index))
5615 constructor_type = NULL_TREE;
5618 gcc_assert (!TYPE_SIZE (constructor_type));
5620 if (constructor_depth > 2)
5621 error_init ("initialization of flexible array member in a nested context");
5623 pedwarn_init (input_location, OPT_pedantic,
5624 "initialization of a flexible array member");
5626 /* We have already issued an error message for the existence
5627 of a flexible array member not at the end of the structure.
5628 Discard the initializer so that we do not die later. */
5629 if (TREE_CHAIN (constructor_fields) != NULL_TREE)
5630 constructor_type = NULL_TREE;
5634 /* Warn when some struct elements are implicitly initialized to zero. */
5635 if (warn_missing_field_initializers
5637 && TREE_CODE (constructor_type) == RECORD_TYPE
5638 && constructor_unfilled_fields)
5640 /* Do not warn for flexible array members or zero-length arrays. */
5641 while (constructor_unfilled_fields
5642 && (!DECL_SIZE (constructor_unfilled_fields)
5643 || integer_zerop (DECL_SIZE (constructor_unfilled_fields))))
5644 constructor_unfilled_fields = TREE_CHAIN (constructor_unfilled_fields);
5646 /* Do not warn if this level of the initializer uses member
5647 designators; it is likely to be deliberate. */
5648 if (constructor_unfilled_fields && !constructor_designated)
5650 push_member_name (constructor_unfilled_fields);
5651 warning_init (OPT_Wmissing_field_initializers,
5652 "missing initializer");
5653 RESTORE_SPELLING_DEPTH (constructor_depth);
5657 /* Pad out the end of the structure. */
5658 if (p->replacement_value.value)
5659 /* If this closes a superfluous brace pair,
5660 just pass out the element between them. */
5661 ret = p->replacement_value;
5662 else if (constructor_type == 0)
5664 else if (TREE_CODE (constructor_type) != RECORD_TYPE
5665 && TREE_CODE (constructor_type) != UNION_TYPE
5666 && TREE_CODE (constructor_type) != ARRAY_TYPE
5667 && TREE_CODE (constructor_type) != VECTOR_TYPE)
5669 /* A nonincremental scalar initializer--just return
5670 the element, after verifying there is just one. */
5671 if (VEC_empty (constructor_elt,constructor_elements))
5673 if (!constructor_erroneous)
5674 error_init ("empty scalar initializer");
5675 ret.value = error_mark_node;
5677 else if (VEC_length (constructor_elt,constructor_elements) != 1)
5679 error_init ("extra elements in scalar initializer");
5680 ret.value = VEC_index (constructor_elt,constructor_elements,0)->value;
5683 ret.value = VEC_index (constructor_elt,constructor_elements,0)->value;
5687 if (constructor_erroneous)
5688 ret.value = error_mark_node;
5691 ret.value = build_constructor (constructor_type,
5692 constructor_elements);
5693 if (constructor_constant)
5694 TREE_CONSTANT (ret.value) = 1;
5695 if (constructor_constant && constructor_simple)
5696 TREE_STATIC (ret.value) = 1;
5700 constructor_type = p->type;
5701 constructor_fields = p->fields;
5702 constructor_index = p->index;
5703 constructor_max_index = p->max_index;
5704 constructor_unfilled_index = p->unfilled_index;
5705 constructor_unfilled_fields = p->unfilled_fields;
5706 constructor_bit_index = p->bit_index;
5707 constructor_elements = p->elements;
5708 constructor_constant = p->constant;
5709 constructor_simple = p->simple;
5710 constructor_erroneous = p->erroneous;
5711 constructor_incremental = p->incremental;
5712 constructor_designated = p->designated;
5713 constructor_pending_elts = p->pending_elts;
5714 constructor_depth = p->depth;
5716 constructor_range_stack = p->range_stack;
5717 RESTORE_SPELLING_DEPTH (constructor_depth);
5719 constructor_stack = p->next;
5722 if (ret.value == 0 && constructor_stack == 0)
5723 ret.value = error_mark_node;
5727 /* Common handling for both array range and field name designators.
5728 ARRAY argument is nonzero for array ranges. Returns zero for success. */
5731 set_designator (int array)
5734 enum tree_code subcode;
5736 /* Don't die if an entire brace-pair level is superfluous
5737 in the containing level. */
5738 if (constructor_type == 0)
5741 /* If there were errors in this designator list already, bail out
5743 if (designator_erroneous)
5746 if (!designator_depth)
5748 gcc_assert (!constructor_range_stack);
5750 /* Designator list starts at the level of closest explicit
5752 while (constructor_stack->implicit)
5753 process_init_element (pop_init_level (1));
5754 constructor_designated = 1;
5758 switch (TREE_CODE (constructor_type))
5762 subtype = TREE_TYPE (constructor_fields);
5763 if (subtype != error_mark_node)
5764 subtype = TYPE_MAIN_VARIANT (subtype);
5767 subtype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
5773 subcode = TREE_CODE (subtype);
5774 if (array && subcode != ARRAY_TYPE)
5776 error_init ("array index in non-array initializer");
5779 else if (!array && subcode != RECORD_TYPE && subcode != UNION_TYPE)
5781 error_init ("field name not in record or union initializer");
5785 constructor_designated = 1;
5786 push_init_level (2);
5790 /* If there are range designators in designator list, push a new designator
5791 to constructor_range_stack. RANGE_END is end of such stack range or
5792 NULL_TREE if there is no range designator at this level. */
5795 push_range_stack (tree range_end)
5797 struct constructor_range_stack *p;
5799 p = GGC_NEW (struct constructor_range_stack);
5800 p->prev = constructor_range_stack;
5802 p->fields = constructor_fields;
5803 p->range_start = constructor_index;
5804 p->index = constructor_index;
5805 p->stack = constructor_stack;
5806 p->range_end = range_end;
5807 if (constructor_range_stack)
5808 constructor_range_stack->next = p;
5809 constructor_range_stack = p;
5812 /* Within an array initializer, specify the next index to be initialized.
5813 FIRST is that index. If LAST is nonzero, then initialize a range
5814 of indices, running from FIRST through LAST. */
5817 set_init_index (tree first, tree last)
5819 if (set_designator (1))
5822 designator_erroneous = 1;
5824 if (!INTEGRAL_TYPE_P (TREE_TYPE (first))
5825 || (last && !INTEGRAL_TYPE_P (TREE_TYPE (last))))
5827 error_init ("array index in initializer not of integer type");
5831 if (TREE_CODE (first) != INTEGER_CST)
5832 error_init ("nonconstant array index in initializer");
5833 else if (last != 0 && TREE_CODE (last) != INTEGER_CST)
5834 error_init ("nonconstant array index in initializer");
5835 else if (TREE_CODE (constructor_type) != ARRAY_TYPE)
5836 error_init ("array index in non-array initializer");
5837 else if (tree_int_cst_sgn (first) == -1)
5838 error_init ("array index in initializer exceeds array bounds");
5839 else if (constructor_max_index
5840 && tree_int_cst_lt (constructor_max_index, first))
5841 error_init ("array index in initializer exceeds array bounds");
5844 constructor_index = convert (bitsizetype, first);
5848 if (tree_int_cst_equal (first, last))
5850 else if (tree_int_cst_lt (last, first))
5852 error_init ("empty index range in initializer");
5857 last = convert (bitsizetype, last);
5858 if (constructor_max_index != 0
5859 && tree_int_cst_lt (constructor_max_index, last))
5861 error_init ("array index range in initializer exceeds array bounds");
5868 designator_erroneous = 0;
5869 if (constructor_range_stack || last)
5870 push_range_stack (last);
5874 /* Within a struct initializer, specify the next field to be initialized. */
5877 set_init_label (tree fieldname)
5881 if (set_designator (0))
5884 designator_erroneous = 1;
5886 if (TREE_CODE (constructor_type) != RECORD_TYPE
5887 && TREE_CODE (constructor_type) != UNION_TYPE)
5889 error_init ("field name not in record or union initializer");
5893 for (tail = TYPE_FIELDS (constructor_type); tail;
5894 tail = TREE_CHAIN (tail))
5896 if (DECL_NAME (tail) == fieldname)
5901 error ("unknown field %qE specified in initializer", fieldname);
5904 constructor_fields = tail;
5906 designator_erroneous = 0;
5907 if (constructor_range_stack)
5908 push_range_stack (NULL_TREE);
5912 /* Add a new initializer to the tree of pending initializers. PURPOSE
5913 identifies the initializer, either array index or field in a structure.
5914 VALUE is the value of that index or field. */
5917 add_pending_init (tree purpose, tree value)
5919 struct init_node *p, **q, *r;
5921 q = &constructor_pending_elts;
5924 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5929 if (tree_int_cst_lt (purpose, p->purpose))
5931 else if (tree_int_cst_lt (p->purpose, purpose))
5935 if (TREE_SIDE_EFFECTS (p->value))
5936 warning_init (0, "initialized field with side-effects overwritten");
5937 else if (warn_override_init)
5938 warning_init (OPT_Woverride_init, "initialized field overwritten");
5948 bitpos = bit_position (purpose);
5952 if (tree_int_cst_lt (bitpos, bit_position (p->purpose)))
5954 else if (p->purpose != purpose)
5958 if (TREE_SIDE_EFFECTS (p->value))
5959 warning_init (0, "initialized field with side-effects overwritten");
5960 else if (warn_override_init)
5961 warning_init (OPT_Woverride_init, "initialized field overwritten");
5968 r = GGC_NEW (struct init_node);
5969 r->purpose = purpose;
5980 struct init_node *s;
5984 if (p->balance == 0)
5986 else if (p->balance < 0)
5993 p->left->parent = p;
6010 constructor_pending_elts = r;
6015 struct init_node *t = r->right;
6019 r->right->parent = r;
6024 p->left->parent = p;
6027 p->balance = t->balance < 0;
6028 r->balance = -(t->balance > 0);
6043 constructor_pending_elts = t;
6049 /* p->balance == +1; growth of left side balances the node. */
6054 else /* r == p->right */
6056 if (p->balance == 0)
6057 /* Growth propagation from right side. */
6059 else if (p->balance > 0)
6066 p->right->parent = p;
6083 constructor_pending_elts = r;
6085 else /* r->balance == -1 */
6088 struct init_node *t = r->left;
6092 r->left->parent = r;
6097 p->right->parent = p;
6100 r->balance = (t->balance < 0);
6101 p->balance = -(t->balance > 0);
6116 constructor_pending_elts = t;
6122 /* p->balance == -1; growth of right side balances the node. */
6133 /* Build AVL tree from a sorted chain. */
6136 set_nonincremental_init (void)
6138 unsigned HOST_WIDE_INT ix;
6141 if (TREE_CODE (constructor_type) != RECORD_TYPE
6142 && TREE_CODE (constructor_type) != ARRAY_TYPE)
6145 FOR_EACH_CONSTRUCTOR_ELT (constructor_elements, ix, index, value)
6146 add_pending_init (index, value);
6147 constructor_elements = 0;
6148 if (TREE_CODE (constructor_type) == RECORD_TYPE)
6150 constructor_unfilled_fields = TYPE_FIELDS (constructor_type);
6151 /* Skip any nameless bit fields at the beginning. */
6152 while (constructor_unfilled_fields != 0
6153 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
6154 && DECL_NAME (constructor_unfilled_fields) == 0)
6155 constructor_unfilled_fields = TREE_CHAIN (constructor_unfilled_fields);
6158 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6160 if (TYPE_DOMAIN (constructor_type))
6161 constructor_unfilled_index
6162 = convert (bitsizetype,
6163 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
6165 constructor_unfilled_index = bitsize_zero_node;
6167 constructor_incremental = 0;
6170 /* Build AVL tree from a string constant. */
6173 set_nonincremental_init_from_string (tree str)
6175 tree value, purpose, type;
6176 HOST_WIDE_INT val[2];
6177 const char *p, *end;
6178 int byte, wchar_bytes, charwidth, bitpos;
6180 gcc_assert (TREE_CODE (constructor_type) == ARRAY_TYPE);
6182 wchar_bytes = TYPE_PRECISION (TREE_TYPE (TREE_TYPE (str))) / BITS_PER_UNIT;
6183 charwidth = TYPE_PRECISION (char_type_node);
6184 type = TREE_TYPE (constructor_type);
6185 p = TREE_STRING_POINTER (str);
6186 end = p + TREE_STRING_LENGTH (str);
6188 for (purpose = bitsize_zero_node;
6189 p < end && !tree_int_cst_lt (constructor_max_index, purpose);
6190 purpose = size_binop (PLUS_EXPR, purpose, bitsize_one_node))
6192 if (wchar_bytes == 1)
6194 val[1] = (unsigned char) *p++;
6201 for (byte = 0; byte < wchar_bytes; byte++)
6203 if (BYTES_BIG_ENDIAN)
6204 bitpos = (wchar_bytes - byte - 1) * charwidth;
6206 bitpos = byte * charwidth;
6207 val[bitpos < HOST_BITS_PER_WIDE_INT]
6208 |= ((unsigned HOST_WIDE_INT) ((unsigned char) *p++))
6209 << (bitpos % HOST_BITS_PER_WIDE_INT);
6213 if (!TYPE_UNSIGNED (type))
6215 bitpos = ((wchar_bytes - 1) * charwidth) + HOST_BITS_PER_CHAR;
6216 if (bitpos < HOST_BITS_PER_WIDE_INT)
6218 if (val[1] & (((HOST_WIDE_INT) 1) << (bitpos - 1)))
6220 val[1] |= ((HOST_WIDE_INT) -1) << bitpos;
6224 else if (bitpos == HOST_BITS_PER_WIDE_INT)
6229 else if (val[0] & (((HOST_WIDE_INT) 1)
6230 << (bitpos - 1 - HOST_BITS_PER_WIDE_INT)))
6231 val[0] |= ((HOST_WIDE_INT) -1)
6232 << (bitpos - HOST_BITS_PER_WIDE_INT);
6235 value = build_int_cst_wide (type, val[1], val[0]);
6236 add_pending_init (purpose, value);
6239 constructor_incremental = 0;
6242 /* Return value of FIELD in pending initializer or zero if the field was
6243 not initialized yet. */
6246 find_init_member (tree field)
6248 struct init_node *p;
6250 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6252 if (constructor_incremental
6253 && tree_int_cst_lt (field, constructor_unfilled_index))
6254 set_nonincremental_init ();
6256 p = constructor_pending_elts;
6259 if (tree_int_cst_lt (field, p->purpose))
6261 else if (tree_int_cst_lt (p->purpose, field))
6267 else if (TREE_CODE (constructor_type) == RECORD_TYPE)
6269 tree bitpos = bit_position (field);
6271 if (constructor_incremental
6272 && (!constructor_unfilled_fields
6273 || tree_int_cst_lt (bitpos,
6274 bit_position (constructor_unfilled_fields))))
6275 set_nonincremental_init ();
6277 p = constructor_pending_elts;
6280 if (field == p->purpose)
6282 else if (tree_int_cst_lt (bitpos, bit_position (p->purpose)))
6288 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6290 if (!VEC_empty (constructor_elt, constructor_elements)
6291 && (VEC_last (constructor_elt, constructor_elements)->index
6293 return VEC_last (constructor_elt, constructor_elements)->value;
6298 /* "Output" the next constructor element.
6299 At top level, really output it to assembler code now.
6300 Otherwise, collect it in a list from which we will make a CONSTRUCTOR.
6301 TYPE is the data type that the containing data type wants here.
6302 FIELD is the field (a FIELD_DECL) or the index that this element fills.
6303 If VALUE is a string constant, STRICT_STRING is true if it is
6304 unparenthesized or we should not warn here for it being parenthesized.
6305 For other types of VALUE, STRICT_STRING is not used.
6307 PENDING if non-nil means output pending elements that belong
6308 right after this element. (PENDING is normally 1;
6309 it is 0 while outputting pending elements, to avoid recursion.) */
6312 output_init_element (tree value, bool strict_string, tree type, tree field,
6315 constructor_elt *celt;
6317 if (type == error_mark_node || value == error_mark_node)
6319 constructor_erroneous = 1;
6322 if (TREE_CODE (TREE_TYPE (value)) == ARRAY_TYPE
6323 && (TREE_CODE (value) == STRING_CST
6324 || TREE_CODE (value) == COMPOUND_LITERAL_EXPR)
6325 && !(TREE_CODE (value) == STRING_CST
6326 && TREE_CODE (type) == ARRAY_TYPE
6327 && INTEGRAL_TYPE_P (TREE_TYPE (type)))
6328 && !comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (value)),
6329 TYPE_MAIN_VARIANT (type)))
6330 value = array_to_pointer_conversion (value);
6332 if (TREE_CODE (value) == COMPOUND_LITERAL_EXPR
6333 && require_constant_value && !flag_isoc99 && pending)
6335 /* As an extension, allow initializing objects with static storage
6336 duration with compound literals (which are then treated just as
6337 the brace enclosed list they contain). */
6338 tree decl = COMPOUND_LITERAL_EXPR_DECL (value);
6339 value = DECL_INITIAL (decl);
6342 if (value == error_mark_node)
6343 constructor_erroneous = 1;
6344 else if (!TREE_CONSTANT (value))
6345 constructor_constant = 0;
6346 else if (!initializer_constant_valid_p (value, TREE_TYPE (value))
6347 || ((TREE_CODE (constructor_type) == RECORD_TYPE
6348 || TREE_CODE (constructor_type) == UNION_TYPE)
6349 && DECL_C_BIT_FIELD (field)
6350 && TREE_CODE (value) != INTEGER_CST))
6351 constructor_simple = 0;
6353 if (!initializer_constant_valid_p (value, TREE_TYPE (value)))
6355 if (require_constant_value)
6357 error_init ("initializer element is not constant");
6358 value = error_mark_node;
6360 else if (require_constant_elements)
6361 pedwarn (input_location, 0,
6362 "initializer element is not computable at load time");
6365 /* If this field is empty (and not at the end of structure),
6366 don't do anything other than checking the initializer. */
6368 && (TREE_TYPE (field) == error_mark_node
6369 || (COMPLETE_TYPE_P (TREE_TYPE (field))
6370 && integer_zerop (TYPE_SIZE (TREE_TYPE (field)))
6371 && (TREE_CODE (constructor_type) == ARRAY_TYPE
6372 || TREE_CHAIN (field)))))
6375 value = digest_init (type, value, strict_string, require_constant_value);
6376 if (value == error_mark_node)
6378 constructor_erroneous = 1;
6382 /* If this element doesn't come next in sequence,
6383 put it on constructor_pending_elts. */
6384 if (TREE_CODE (constructor_type) == ARRAY_TYPE
6385 && (!constructor_incremental
6386 || !tree_int_cst_equal (field, constructor_unfilled_index)))
6388 if (constructor_incremental
6389 && tree_int_cst_lt (field, constructor_unfilled_index))
6390 set_nonincremental_init ();
6392 add_pending_init (field, value);
6395 else if (TREE_CODE (constructor_type) == RECORD_TYPE
6396 && (!constructor_incremental
6397 || field != constructor_unfilled_fields))
6399 /* We do this for records but not for unions. In a union,
6400 no matter which field is specified, it can be initialized
6401 right away since it starts at the beginning of the union. */
6402 if (constructor_incremental)
6404 if (!constructor_unfilled_fields)
6405 set_nonincremental_init ();
6408 tree bitpos, unfillpos;
6410 bitpos = bit_position (field);
6411 unfillpos = bit_position (constructor_unfilled_fields);
6413 if (tree_int_cst_lt (bitpos, unfillpos))
6414 set_nonincremental_init ();
6418 add_pending_init (field, value);
6421 else if (TREE_CODE (constructor_type) == UNION_TYPE
6422 && !VEC_empty (constructor_elt, constructor_elements))
6424 if (TREE_SIDE_EFFECTS (VEC_last (constructor_elt,
6425 constructor_elements)->value))
6426 warning_init (0, "initialized field with side-effects overwritten");
6427 else if (warn_override_init)
6428 warning_init (OPT_Woverride_init, "initialized field overwritten");
6430 /* We can have just one union field set. */
6431 constructor_elements = 0;
6434 /* Otherwise, output this element either to
6435 constructor_elements or to the assembler file. */
6437 celt = VEC_safe_push (constructor_elt, gc, constructor_elements, NULL);
6438 celt->index = field;
6439 celt->value = value;
6441 /* Advance the variable that indicates sequential elements output. */
6442 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6443 constructor_unfilled_index
6444 = size_binop (PLUS_EXPR, constructor_unfilled_index,
6446 else if (TREE_CODE (constructor_type) == RECORD_TYPE)
6448 constructor_unfilled_fields
6449 = TREE_CHAIN (constructor_unfilled_fields);
6451 /* Skip any nameless bit fields. */
6452 while (constructor_unfilled_fields != 0
6453 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
6454 && DECL_NAME (constructor_unfilled_fields) == 0)
6455 constructor_unfilled_fields =
6456 TREE_CHAIN (constructor_unfilled_fields);
6458 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6459 constructor_unfilled_fields = 0;
6461 /* Now output any pending elements which have become next. */
6463 output_pending_init_elements (0);
6466 /* Output any pending elements which have become next.
6467 As we output elements, constructor_unfilled_{fields,index}
6468 advances, which may cause other elements to become next;
6469 if so, they too are output.
6471 If ALL is 0, we return when there are
6472 no more pending elements to output now.
6474 If ALL is 1, we output space as necessary so that
6475 we can output all the pending elements. */
6478 output_pending_init_elements (int all)
6480 struct init_node *elt = constructor_pending_elts;
6485 /* Look through the whole pending tree.
6486 If we find an element that should be output now,
6487 output it. Otherwise, set NEXT to the element
6488 that comes first among those still pending. */
6493 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6495 if (tree_int_cst_equal (elt->purpose,
6496 constructor_unfilled_index))
6497 output_init_element (elt->value, true,
6498 TREE_TYPE (constructor_type),
6499 constructor_unfilled_index, 0);
6500 else if (tree_int_cst_lt (constructor_unfilled_index,
6503 /* Advance to the next smaller node. */
6508 /* We have reached the smallest node bigger than the
6509 current unfilled index. Fill the space first. */
6510 next = elt->purpose;
6516 /* Advance to the next bigger node. */
6521 /* We have reached the biggest node in a subtree. Find
6522 the parent of it, which is the next bigger node. */
6523 while (elt->parent && elt->parent->right == elt)
6526 if (elt && tree_int_cst_lt (constructor_unfilled_index,
6529 next = elt->purpose;
6535 else if (TREE_CODE (constructor_type) == RECORD_TYPE
6536 || TREE_CODE (constructor_type) == UNION_TYPE)
6538 tree ctor_unfilled_bitpos, elt_bitpos;
6540 /* If the current record is complete we are done. */
6541 if (constructor_unfilled_fields == 0)
6544 ctor_unfilled_bitpos = bit_position (constructor_unfilled_fields);
6545 elt_bitpos = bit_position (elt->purpose);
6546 /* We can't compare fields here because there might be empty
6547 fields in between. */
6548 if (tree_int_cst_equal (elt_bitpos, ctor_unfilled_bitpos))
6550 constructor_unfilled_fields = elt->purpose;
6551 output_init_element (elt->value, true, TREE_TYPE (elt->purpose),
6554 else if (tree_int_cst_lt (ctor_unfilled_bitpos, elt_bitpos))
6556 /* Advance to the next smaller node. */
6561 /* We have reached the smallest node bigger than the
6562 current unfilled field. Fill the space first. */
6563 next = elt->purpose;
6569 /* Advance to the next bigger node. */
6574 /* We have reached the biggest node in a subtree. Find
6575 the parent of it, which is the next bigger node. */
6576 while (elt->parent && elt->parent->right == elt)
6580 && (tree_int_cst_lt (ctor_unfilled_bitpos,
6581 bit_position (elt->purpose))))
6583 next = elt->purpose;
6591 /* Ordinarily return, but not if we want to output all
6592 and there are elements left. */
6593 if (!(all && next != 0))
6596 /* If it's not incremental, just skip over the gap, so that after
6597 jumping to retry we will output the next successive element. */
6598 if (TREE_CODE (constructor_type) == RECORD_TYPE
6599 || TREE_CODE (constructor_type) == UNION_TYPE)
6600 constructor_unfilled_fields = next;
6601 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6602 constructor_unfilled_index = next;
6604 /* ELT now points to the node in the pending tree with the next
6605 initializer to output. */
6609 /* Add one non-braced element to the current constructor level.
6610 This adjusts the current position within the constructor's type.
6611 This may also start or terminate implicit levels
6612 to handle a partly-braced initializer.
6614 Once this has found the correct level for the new element,
6615 it calls output_init_element. */
6618 process_init_element (struct c_expr value)
6620 tree orig_value = value.value;
6621 int string_flag = orig_value != 0 && TREE_CODE (orig_value) == STRING_CST;
6622 bool strict_string = value.original_code == STRING_CST;
6624 designator_depth = 0;
6625 designator_erroneous = 0;
6627 /* Handle superfluous braces around string cst as in
6628 char x[] = {"foo"}; */
6631 && TREE_CODE (constructor_type) == ARRAY_TYPE
6632 && INTEGRAL_TYPE_P (TREE_TYPE (constructor_type))
6633 && integer_zerop (constructor_unfilled_index))
6635 if (constructor_stack->replacement_value.value)
6636 error_init ("excess elements in char array initializer");
6637 constructor_stack->replacement_value = value;
6641 if (constructor_stack->replacement_value.value != 0)
6643 error_init ("excess elements in struct initializer");
6647 /* Ignore elements of a brace group if it is entirely superfluous
6648 and has already been diagnosed. */
6649 if (constructor_type == 0)
6652 /* If we've exhausted any levels that didn't have braces,
6654 while (constructor_stack->implicit)
6656 if ((TREE_CODE (constructor_type) == RECORD_TYPE
6657 || TREE_CODE (constructor_type) == UNION_TYPE)
6658 && constructor_fields == 0)
6659 process_init_element (pop_init_level (1));
6660 else if (TREE_CODE (constructor_type) == ARRAY_TYPE
6661 && (constructor_max_index == 0
6662 || tree_int_cst_lt (constructor_max_index,
6663 constructor_index)))
6664 process_init_element (pop_init_level (1));
6669 /* In the case of [LO ... HI] = VALUE, only evaluate VALUE once. */
6670 if (constructor_range_stack)
6672 /* If value is a compound literal and we'll be just using its
6673 content, don't put it into a SAVE_EXPR. */
6674 if (TREE_CODE (value.value) != COMPOUND_LITERAL_EXPR
6675 || !require_constant_value
6677 value.value = save_expr (value.value);
6682 if (TREE_CODE (constructor_type) == RECORD_TYPE)
6685 enum tree_code fieldcode;
6687 if (constructor_fields == 0)
6689 pedwarn_init (input_location, 0,
6690 "excess elements in struct initializer");
6694 fieldtype = TREE_TYPE (constructor_fields);
6695 if (fieldtype != error_mark_node)
6696 fieldtype = TYPE_MAIN_VARIANT (fieldtype);
6697 fieldcode = TREE_CODE (fieldtype);
6699 /* Error for non-static initialization of a flexible array member. */
6700 if (fieldcode == ARRAY_TYPE
6701 && !require_constant_value
6702 && TYPE_SIZE (fieldtype) == NULL_TREE
6703 && TREE_CHAIN (constructor_fields) == NULL_TREE)
6705 error_init ("non-static initialization of a flexible array member");
6709 /* Accept a string constant to initialize a subarray. */
6710 if (value.value != 0
6711 && fieldcode == ARRAY_TYPE
6712 && INTEGRAL_TYPE_P (TREE_TYPE (fieldtype))
6714 value.value = orig_value;
6715 /* Otherwise, if we have come to a subaggregate,
6716 and we don't have an element of its type, push into it. */
6717 else if (value.value != 0
6718 && value.value != error_mark_node
6719 && TYPE_MAIN_VARIANT (TREE_TYPE (value.value)) != fieldtype
6720 && (fieldcode == RECORD_TYPE || fieldcode == ARRAY_TYPE
6721 || fieldcode == UNION_TYPE))
6723 push_init_level (1);
6729 push_member_name (constructor_fields);
6730 output_init_element (value.value, strict_string,
6731 fieldtype, constructor_fields, 1);
6732 RESTORE_SPELLING_DEPTH (constructor_depth);
6735 /* Do the bookkeeping for an element that was
6736 directly output as a constructor. */
6738 /* For a record, keep track of end position of last field. */
6739 if (DECL_SIZE (constructor_fields))
6740 constructor_bit_index
6741 = size_binop (PLUS_EXPR,
6742 bit_position (constructor_fields),
6743 DECL_SIZE (constructor_fields));
6745 /* If the current field was the first one not yet written out,
6746 it isn't now, so update. */
6747 if (constructor_unfilled_fields == constructor_fields)
6749 constructor_unfilled_fields = TREE_CHAIN (constructor_fields);
6750 /* Skip any nameless bit fields. */
6751 while (constructor_unfilled_fields != 0
6752 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
6753 && DECL_NAME (constructor_unfilled_fields) == 0)
6754 constructor_unfilled_fields =
6755 TREE_CHAIN (constructor_unfilled_fields);
6759 constructor_fields = TREE_CHAIN (constructor_fields);
6760 /* Skip any nameless bit fields at the beginning. */
6761 while (constructor_fields != 0
6762 && DECL_C_BIT_FIELD (constructor_fields)
6763 && DECL_NAME (constructor_fields) == 0)
6764 constructor_fields = TREE_CHAIN (constructor_fields);
6766 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6769 enum tree_code fieldcode;
6771 if (constructor_fields == 0)
6773 pedwarn_init (input_location, 0,
6774 "excess elements in union initializer");
6778 fieldtype = TREE_TYPE (constructor_fields);
6779 if (fieldtype != error_mark_node)
6780 fieldtype = TYPE_MAIN_VARIANT (fieldtype);
6781 fieldcode = TREE_CODE (fieldtype);
6783 /* Warn that traditional C rejects initialization of unions.
6784 We skip the warning if the value is zero. This is done
6785 under the assumption that the zero initializer in user
6786 code appears conditioned on e.g. __STDC__ to avoid
6787 "missing initializer" warnings and relies on default
6788 initialization to zero in the traditional C case.
6789 We also skip the warning if the initializer is designated,
6790 again on the assumption that this must be conditional on
6791 __STDC__ anyway (and we've already complained about the
6792 member-designator already). */
6793 if (!in_system_header && !constructor_designated
6794 && !(value.value && (integer_zerop (value.value)
6795 || real_zerop (value.value))))
6796 warning (OPT_Wtraditional, "traditional C rejects initialization "
6799 /* Accept a string constant to initialize a subarray. */
6800 if (value.value != 0
6801 && fieldcode == ARRAY_TYPE
6802 && INTEGRAL_TYPE_P (TREE_TYPE (fieldtype))
6804 value.value = orig_value;
6805 /* Otherwise, if we have come to a subaggregate,
6806 and we don't have an element of its type, push into it. */
6807 else if (value.value != 0
6808 && value.value != error_mark_node
6809 && TYPE_MAIN_VARIANT (TREE_TYPE (value.value)) != fieldtype
6810 && (fieldcode == RECORD_TYPE || fieldcode == ARRAY_TYPE
6811 || fieldcode == UNION_TYPE))
6813 push_init_level (1);
6819 push_member_name (constructor_fields);
6820 output_init_element (value.value, strict_string,
6821 fieldtype, constructor_fields, 1);
6822 RESTORE_SPELLING_DEPTH (constructor_depth);
6825 /* Do the bookkeeping for an element that was
6826 directly output as a constructor. */
6828 constructor_bit_index = DECL_SIZE (constructor_fields);
6829 constructor_unfilled_fields = TREE_CHAIN (constructor_fields);
6832 constructor_fields = 0;
6834 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6836 tree elttype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
6837 enum tree_code eltcode = TREE_CODE (elttype);
6839 /* Accept a string constant to initialize a subarray. */
6840 if (value.value != 0
6841 && eltcode == ARRAY_TYPE
6842 && INTEGRAL_TYPE_P (TREE_TYPE (elttype))
6844 value.value = orig_value;
6845 /* Otherwise, if we have come to a subaggregate,
6846 and we don't have an element of its type, push into it. */
6847 else if (value.value != 0
6848 && value.value != error_mark_node
6849 && TYPE_MAIN_VARIANT (TREE_TYPE (value.value)) != elttype
6850 && (eltcode == RECORD_TYPE || eltcode == ARRAY_TYPE
6851 || eltcode == UNION_TYPE))
6853 push_init_level (1);
6857 if (constructor_max_index != 0
6858 && (tree_int_cst_lt (constructor_max_index, constructor_index)
6859 || integer_all_onesp (constructor_max_index)))
6861 pedwarn_init (input_location, 0,
6862 "excess elements in array initializer");
6866 /* Now output the actual element. */
6869 push_array_bounds (tree_low_cst (constructor_index, 1));
6870 output_init_element (value.value, strict_string,
6871 elttype, constructor_index, 1);
6872 RESTORE_SPELLING_DEPTH (constructor_depth);
6876 = size_binop (PLUS_EXPR, constructor_index, bitsize_one_node);
6879 /* If we are doing the bookkeeping for an element that was
6880 directly output as a constructor, we must update
6881 constructor_unfilled_index. */
6882 constructor_unfilled_index = constructor_index;
6884 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
6886 tree elttype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
6888 /* Do a basic check of initializer size. Note that vectors
6889 always have a fixed size derived from their type. */
6890 if (tree_int_cst_lt (constructor_max_index, constructor_index))
6892 pedwarn_init (input_location, 0,
6893 "excess elements in vector initializer");
6897 /* Now output the actual element. */
6899 output_init_element (value.value, strict_string,
6900 elttype, constructor_index, 1);
6903 = size_binop (PLUS_EXPR, constructor_index, bitsize_one_node);
6906 /* If we are doing the bookkeeping for an element that was
6907 directly output as a constructor, we must update
6908 constructor_unfilled_index. */
6909 constructor_unfilled_index = constructor_index;
6912 /* Handle the sole element allowed in a braced initializer
6913 for a scalar variable. */
6914 else if (constructor_type != error_mark_node
6915 && constructor_fields == 0)
6917 pedwarn_init (input_location, 0,
6918 "excess elements in scalar initializer");
6924 output_init_element (value.value, strict_string,
6925 constructor_type, NULL_TREE, 1);
6926 constructor_fields = 0;
6929 /* Handle range initializers either at this level or anywhere higher
6930 in the designator stack. */
6931 if (constructor_range_stack)
6933 struct constructor_range_stack *p, *range_stack;
6936 range_stack = constructor_range_stack;
6937 constructor_range_stack = 0;
6938 while (constructor_stack != range_stack->stack)
6940 gcc_assert (constructor_stack->implicit);
6941 process_init_element (pop_init_level (1));
6943 for (p = range_stack;
6944 !p->range_end || tree_int_cst_equal (p->index, p->range_end);
6947 gcc_assert (constructor_stack->implicit);
6948 process_init_element (pop_init_level (1));
6951 p->index = size_binop (PLUS_EXPR, p->index, bitsize_one_node);
6952 if (tree_int_cst_equal (p->index, p->range_end) && !p->prev)
6957 constructor_index = p->index;
6958 constructor_fields = p->fields;
6959 if (finish && p->range_end && p->index == p->range_start)
6967 push_init_level (2);
6968 p->stack = constructor_stack;
6969 if (p->range_end && tree_int_cst_equal (p->index, p->range_end))
6970 p->index = p->range_start;
6974 constructor_range_stack = range_stack;
6981 constructor_range_stack = 0;
6984 /* Build a complete asm-statement, whose components are a CV_QUALIFIER
6985 (guaranteed to be 'volatile' or null) and ARGS (represented using
6986 an ASM_EXPR node). */
6988 build_asm_stmt (tree cv_qualifier, tree args)
6990 if (!ASM_VOLATILE_P (args) && cv_qualifier)
6991 ASM_VOLATILE_P (args) = 1;
6992 return add_stmt (args);
6995 /* Build an asm-expr, whose components are a STRING, some OUTPUTS,
6996 some INPUTS, and some CLOBBERS. The latter three may be NULL.
6997 SIMPLE indicates whether there was anything at all after the
6998 string in the asm expression -- asm("blah") and asm("blah" : )
6999 are subtly different. We use a ASM_EXPR node to represent this. */
7001 build_asm_expr (tree string, tree outputs, tree inputs, tree clobbers,
7007 const char *constraint;
7008 const char **oconstraints;
7009 bool allows_mem, allows_reg, is_inout;
7010 int ninputs, noutputs;
7012 ninputs = list_length (inputs);
7013 noutputs = list_length (outputs);
7014 oconstraints = (const char **) alloca (noutputs * sizeof (const char *));
7016 string = resolve_asm_operand_names (string, outputs, inputs);
7018 /* Remove output conversions that change the type but not the mode. */
7019 for (i = 0, tail = outputs; tail; ++i, tail = TREE_CHAIN (tail))
7021 tree output = TREE_VALUE (tail);
7023 /* ??? Really, this should not be here. Users should be using a
7024 proper lvalue, dammit. But there's a long history of using casts
7025 in the output operands. In cases like longlong.h, this becomes a
7026 primitive form of typechecking -- if the cast can be removed, then
7027 the output operand had a type of the proper width; otherwise we'll
7028 get an error. Gross, but ... */
7029 STRIP_NOPS (output);
7031 if (!lvalue_or_else (output, lv_asm))
7032 output = error_mark_node;
7034 if (output != error_mark_node
7035 && (TREE_READONLY (output)
7036 || TYPE_READONLY (TREE_TYPE (output))
7037 || ((TREE_CODE (TREE_TYPE (output)) == RECORD_TYPE
7038 || TREE_CODE (TREE_TYPE (output)) == UNION_TYPE)
7039 && C_TYPE_FIELDS_READONLY (TREE_TYPE (output)))))
7040 readonly_error (output, lv_asm);
7042 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
7043 oconstraints[i] = constraint;
7045 if (parse_output_constraint (&constraint, i, ninputs, noutputs,
7046 &allows_mem, &allows_reg, &is_inout))
7048 /* If the operand is going to end up in memory,
7049 mark it addressable. */
7050 if (!allows_reg && !c_mark_addressable (output))
7051 output = error_mark_node;
7054 output = error_mark_node;
7056 TREE_VALUE (tail) = output;
7059 for (i = 0, tail = inputs; tail; ++i, tail = TREE_CHAIN (tail))
7063 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
7064 input = TREE_VALUE (tail);
7066 if (parse_input_constraint (&constraint, i, ninputs, noutputs, 0,
7067 oconstraints, &allows_mem, &allows_reg))
7069 /* If the operand is going to end up in memory,
7070 mark it addressable. */
7071 if (!allows_reg && allows_mem)
7073 /* Strip the nops as we allow this case. FIXME, this really
7074 should be rejected or made deprecated. */
7076 if (!c_mark_addressable (input))
7077 input = error_mark_node;
7081 input = error_mark_node;
7083 TREE_VALUE (tail) = input;
7086 args = build_stmt (ASM_EXPR, string, outputs, inputs, clobbers);
7088 /* asm statements without outputs, including simple ones, are treated
7090 ASM_INPUT_P (args) = simple;
7091 ASM_VOLATILE_P (args) = (noutputs == 0);
7096 /* Generate a goto statement to LABEL. */
7099 c_finish_goto_label (tree label)
7101 tree decl = lookup_label (label);
7105 if (C_DECL_UNJUMPABLE_STMT_EXPR (decl))
7107 error ("jump into statement expression");
7111 if (C_DECL_UNJUMPABLE_VM (decl))
7113 error ("jump into scope of identifier with variably modified type");
7117 if (!C_DECL_UNDEFINABLE_STMT_EXPR (decl))
7119 /* No jump from outside this statement expression context, so
7120 record that there is a jump from within this context. */
7121 struct c_label_list *nlist;
7122 nlist = XOBNEW (&parser_obstack, struct c_label_list);
7123 nlist->next = label_context_stack_se->labels_used;
7124 nlist->label = decl;
7125 label_context_stack_se->labels_used = nlist;
7128 if (!C_DECL_UNDEFINABLE_VM (decl))
7130 /* No jump from outside this context context of identifiers with
7131 variably modified type, so record that there is a jump from
7132 within this context. */
7133 struct c_label_list *nlist;
7134 nlist = XOBNEW (&parser_obstack, struct c_label_list);
7135 nlist->next = label_context_stack_vm->labels_used;
7136 nlist->label = decl;
7137 label_context_stack_vm->labels_used = nlist;
7140 TREE_USED (decl) = 1;
7141 return add_stmt (build1 (GOTO_EXPR, void_type_node, decl));
7144 /* Generate a computed goto statement to EXPR. */
7147 c_finish_goto_ptr (tree expr)
7149 pedwarn (input_location, OPT_pedantic, "ISO C forbids %<goto *expr;%>");
7150 expr = convert (ptr_type_node, expr);
7151 return add_stmt (build1 (GOTO_EXPR, void_type_node, expr));
7154 /* Generate a C `return' statement. RETVAL is the expression for what
7155 to return, or a null pointer for `return;' with no value. */
7158 c_finish_return (tree retval)
7160 tree valtype = TREE_TYPE (TREE_TYPE (current_function_decl)), ret_stmt;
7161 bool no_warning = false;
7163 if (TREE_THIS_VOLATILE (current_function_decl))
7164 warning (0, "function declared %<noreturn%> has a %<return%> statement");
7168 current_function_returns_null = 1;
7169 if ((warn_return_type || flag_isoc99)
7170 && valtype != 0 && TREE_CODE (valtype) != VOID_TYPE)
7172 pedwarn_c99 (input_location, flag_isoc99 ? 0 : OPT_Wreturn_type,
7173 "%<return%> with no value, in "
7174 "function returning non-void");
7178 else if (valtype == 0 || TREE_CODE (valtype) == VOID_TYPE)
7180 current_function_returns_null = 1;
7181 if (TREE_CODE (TREE_TYPE (retval)) != VOID_TYPE)
7182 pedwarn (input_location, 0,
7183 "%<return%> with a value, in function returning void");
7185 pedwarn (input_location, OPT_pedantic, "ISO C forbids "
7186 "%<return%> with expression, in function returning void");
7190 tree t = convert_for_assignment (valtype, retval, ic_return,
7191 NULL_TREE, NULL_TREE, 0);
7192 tree res = DECL_RESULT (current_function_decl);
7195 current_function_returns_value = 1;
7196 if (t == error_mark_node)
7199 inner = t = convert (TREE_TYPE (res), t);
7201 /* Strip any conversions, additions, and subtractions, and see if
7202 we are returning the address of a local variable. Warn if so. */
7205 switch (TREE_CODE (inner))
7207 CASE_CONVERT: case NON_LVALUE_EXPR:
7209 inner = TREE_OPERAND (inner, 0);
7213 /* If the second operand of the MINUS_EXPR has a pointer
7214 type (or is converted from it), this may be valid, so
7215 don't give a warning. */
7217 tree op1 = TREE_OPERAND (inner, 1);
7219 while (!POINTER_TYPE_P (TREE_TYPE (op1))
7220 && (CONVERT_EXPR_P (op1)
7221 || TREE_CODE (op1) == NON_LVALUE_EXPR))
7222 op1 = TREE_OPERAND (op1, 0);
7224 if (POINTER_TYPE_P (TREE_TYPE (op1)))
7227 inner = TREE_OPERAND (inner, 0);
7232 inner = TREE_OPERAND (inner, 0);
7234 while (REFERENCE_CLASS_P (inner)
7235 && TREE_CODE (inner) != INDIRECT_REF)
7236 inner = TREE_OPERAND (inner, 0);
7239 && !DECL_EXTERNAL (inner)
7240 && !TREE_STATIC (inner)
7241 && DECL_CONTEXT (inner) == current_function_decl)
7242 warning (0, "function returns address of local variable");
7252 retval = build2 (MODIFY_EXPR, TREE_TYPE (res), res, t);
7254 if (warn_sequence_point)
7255 verify_sequence_points (retval);
7258 ret_stmt = build_stmt (RETURN_EXPR, retval);
7259 TREE_NO_WARNING (ret_stmt) |= no_warning;
7260 return add_stmt (ret_stmt);
7264 /* The SWITCH_EXPR being built. */
7267 /* The original type of the testing expression, i.e. before the
7268 default conversion is applied. */
7271 /* A splay-tree mapping the low element of a case range to the high
7272 element, or NULL_TREE if there is no high element. Used to
7273 determine whether or not a new case label duplicates an old case
7274 label. We need a tree, rather than simply a hash table, because
7275 of the GNU case range extension. */
7278 /* Number of nested statement expressions within this switch
7279 statement; if nonzero, case and default labels may not
7281 unsigned int blocked_stmt_expr;
7283 /* Scope of outermost declarations of identifiers with variably
7284 modified type within this switch statement; if nonzero, case and
7285 default labels may not appear. */
7286 unsigned int blocked_vm;
7288 /* The next node on the stack. */
7289 struct c_switch *next;
7292 /* A stack of the currently active switch statements. The innermost
7293 switch statement is on the top of the stack. There is no need to
7294 mark the stack for garbage collection because it is only active
7295 during the processing of the body of a function, and we never
7296 collect at that point. */
7298 struct c_switch *c_switch_stack;
7300 /* Start a C switch statement, testing expression EXP. Return the new
7304 c_start_case (tree exp)
7306 tree orig_type = error_mark_node;
7307 struct c_switch *cs;
7309 if (exp != error_mark_node)
7311 orig_type = TREE_TYPE (exp);
7313 if (!INTEGRAL_TYPE_P (orig_type))
7315 if (orig_type != error_mark_node)
7317 error ("switch quantity not an integer");
7318 orig_type = error_mark_node;
7320 exp = integer_zero_node;
7324 tree type = TYPE_MAIN_VARIANT (orig_type);
7326 if (!in_system_header
7327 && (type == long_integer_type_node
7328 || type == long_unsigned_type_node))
7329 warning (OPT_Wtraditional, "%<long%> switch expression not "
7330 "converted to %<int%> in ISO C");
7332 exp = default_conversion (exp);
7334 if (warn_sequence_point)
7335 verify_sequence_points (exp);
7339 /* Add this new SWITCH_EXPR to the stack. */
7340 cs = XNEW (struct c_switch);
7341 cs->switch_expr = build3 (SWITCH_EXPR, orig_type, exp, NULL_TREE, NULL_TREE);
7342 cs->orig_type = orig_type;
7343 cs->cases = splay_tree_new (case_compare, NULL, NULL);
7344 cs->blocked_stmt_expr = 0;
7346 cs->next = c_switch_stack;
7347 c_switch_stack = cs;
7349 return add_stmt (cs->switch_expr);
7352 /* Process a case label. */
7355 do_case (tree low_value, tree high_value)
7357 tree label = NULL_TREE;
7359 if (c_switch_stack && !c_switch_stack->blocked_stmt_expr
7360 && !c_switch_stack->blocked_vm)
7362 label = c_add_case_label (c_switch_stack->cases,
7363 SWITCH_COND (c_switch_stack->switch_expr),
7364 c_switch_stack->orig_type,
7365 low_value, high_value);
7366 if (label == error_mark_node)
7369 else if (c_switch_stack && c_switch_stack->blocked_stmt_expr)
7372 error ("case label in statement expression not containing "
7373 "enclosing switch statement");
7375 error ("%<default%> label in statement expression not containing "
7376 "enclosing switch statement");
7378 else if (c_switch_stack && c_switch_stack->blocked_vm)
7381 error ("case label in scope of identifier with variably modified "
7382 "type not containing enclosing switch statement");
7384 error ("%<default%> label in scope of identifier with variably "
7385 "modified type not containing enclosing switch statement");
7388 error ("case label not within a switch statement");
7390 error ("%<default%> label not within a switch statement");
7395 /* Finish the switch statement. */
7398 c_finish_case (tree body)
7400 struct c_switch *cs = c_switch_stack;
7401 location_t switch_location;
7403 SWITCH_BODY (cs->switch_expr) = body;
7405 /* We must not be within a statement expression nested in the switch
7406 at this point; we might, however, be within the scope of an
7407 identifier with variably modified type nested in the switch. */
7408 gcc_assert (!cs->blocked_stmt_expr);
7410 /* Emit warnings as needed. */
7411 if (EXPR_HAS_LOCATION (cs->switch_expr))
7412 switch_location = EXPR_LOCATION (cs->switch_expr);
7414 switch_location = input_location;
7415 c_do_switch_warnings (cs->cases, switch_location,
7416 TREE_TYPE (cs->switch_expr),
7417 SWITCH_COND (cs->switch_expr));
7419 /* Pop the stack. */
7420 c_switch_stack = cs->next;
7421 splay_tree_delete (cs->cases);
7425 /* Emit an if statement. IF_LOCUS is the location of the 'if'. COND,
7426 THEN_BLOCK and ELSE_BLOCK are expressions to be used; ELSE_BLOCK
7427 may be null. NESTED_IF is true if THEN_BLOCK contains another IF
7428 statement, and was not surrounded with parenthesis. */
7431 c_finish_if_stmt (location_t if_locus, tree cond, tree then_block,
7432 tree else_block, bool nested_if)
7436 /* Diagnose an ambiguous else if if-then-else is nested inside if-then. */
7437 if (warn_parentheses && nested_if && else_block == NULL)
7439 tree inner_if = then_block;
7441 /* We know from the grammar productions that there is an IF nested
7442 within THEN_BLOCK. Due to labels and c99 conditional declarations,
7443 it might not be exactly THEN_BLOCK, but should be the last
7444 non-container statement within. */
7446 switch (TREE_CODE (inner_if))
7451 inner_if = BIND_EXPR_BODY (inner_if);
7453 case STATEMENT_LIST:
7454 inner_if = expr_last (then_block);
7456 case TRY_FINALLY_EXPR:
7457 case TRY_CATCH_EXPR:
7458 inner_if = TREE_OPERAND (inner_if, 0);
7465 if (COND_EXPR_ELSE (inner_if))
7466 warning (OPT_Wparentheses,
7467 "%Hsuggest explicit braces to avoid ambiguous %<else%>",
7471 stmt = build3 (COND_EXPR, void_type_node, cond, then_block, else_block);
7472 SET_EXPR_LOCATION (stmt, if_locus);
7476 /* Emit a general-purpose loop construct. START_LOCUS is the location of
7477 the beginning of the loop. COND is the loop condition. COND_IS_FIRST
7478 is false for DO loops. INCR is the FOR increment expression. BODY is
7479 the statement controlled by the loop. BLAB is the break label. CLAB is
7480 the continue label. Everything is allowed to be NULL. */
7483 c_finish_loop (location_t start_locus, tree cond, tree incr, tree body,
7484 tree blab, tree clab, bool cond_is_first)
7486 tree entry = NULL, exit = NULL, t;
7488 /* If the condition is zero don't generate a loop construct. */
7489 if (cond && integer_zerop (cond))
7493 t = build_and_jump (&blab);
7494 SET_EXPR_LOCATION (t, start_locus);
7500 tree top = build1 (LABEL_EXPR, void_type_node, NULL_TREE);
7502 /* If we have an exit condition, then we build an IF with gotos either
7503 out of the loop, or to the top of it. If there's no exit condition,
7504 then we just build a jump back to the top. */
7505 exit = build_and_jump (&LABEL_EXPR_LABEL (top));
7507 if (cond && !integer_nonzerop (cond))
7509 /* Canonicalize the loop condition to the end. This means
7510 generating a branch to the loop condition. Reuse the
7511 continue label, if possible. */
7516 entry = build1 (LABEL_EXPR, void_type_node, NULL_TREE);
7517 t = build_and_jump (&LABEL_EXPR_LABEL (entry));
7520 t = build1 (GOTO_EXPR, void_type_node, clab);
7521 SET_EXPR_LOCATION (t, start_locus);
7525 t = build_and_jump (&blab);
7526 exit = fold_build3 (COND_EXPR, void_type_node, cond, exit, t);
7528 SET_EXPR_LOCATION (exit, start_locus);
7530 SET_EXPR_LOCATION (exit, input_location);
7539 add_stmt (build1 (LABEL_EXPR, void_type_node, clab));
7547 add_stmt (build1 (LABEL_EXPR, void_type_node, blab));
7551 c_finish_bc_stmt (tree *label_p, bool is_break)
7554 tree label = *label_p;
7556 /* In switch statements break is sometimes stylistically used after
7557 a return statement. This can lead to spurious warnings about
7558 control reaching the end of a non-void function when it is
7559 inlined. Note that we are calling block_may_fallthru with
7560 language specific tree nodes; this works because
7561 block_may_fallthru returns true when given something it does not
7563 skip = !block_may_fallthru (cur_stmt_list);
7568 *label_p = label = create_artificial_label ();
7570 else if (TREE_CODE (label) == LABEL_DECL)
7572 else switch (TREE_INT_CST_LOW (label))
7576 error ("break statement not within loop or switch");
7578 error ("continue statement not within a loop");
7582 gcc_assert (is_break);
7583 error ("break statement used with OpenMP for loop");
7594 add_stmt (build_predict_expr (PRED_CONTINUE, NOT_TAKEN));
7596 return add_stmt (build1 (GOTO_EXPR, void_type_node, label));
7599 /* A helper routine for c_process_expr_stmt and c_finish_stmt_expr. */
7602 emit_side_effect_warnings (tree expr)
7604 if (expr == error_mark_node)
7606 else if (!TREE_SIDE_EFFECTS (expr))
7608 if (!VOID_TYPE_P (TREE_TYPE (expr)) && !TREE_NO_WARNING (expr))
7609 warning (OPT_Wunused_value, "%Hstatement with no effect",
7610 EXPR_HAS_LOCATION (expr) ? EXPR_LOCUS (expr) : &input_location);
7613 warn_if_unused_value (expr, input_location);
7616 /* Process an expression as if it were a complete statement. Emit
7617 diagnostics, but do not call ADD_STMT. */
7620 c_process_expr_stmt (tree expr)
7625 if (warn_sequence_point)
7626 verify_sequence_points (expr);
7628 if (TREE_TYPE (expr) != error_mark_node
7629 && !COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (expr))
7630 && TREE_CODE (TREE_TYPE (expr)) != ARRAY_TYPE)
7631 error ("expression statement has incomplete type");
7633 /* If we're not processing a statement expression, warn about unused values.
7634 Warnings for statement expressions will be emitted later, once we figure
7635 out which is the result. */
7636 if (!STATEMENT_LIST_STMT_EXPR (cur_stmt_list)
7637 && warn_unused_value)
7638 emit_side_effect_warnings (expr);
7640 /* If the expression is not of a type to which we cannot assign a line
7641 number, wrap the thing in a no-op NOP_EXPR. */
7642 if (DECL_P (expr) || CONSTANT_CLASS_P (expr))
7643 expr = build1 (NOP_EXPR, TREE_TYPE (expr), expr);
7645 if (CAN_HAVE_LOCATION_P (expr))
7646 SET_EXPR_LOCATION (expr, input_location);
7651 /* Emit an expression as a statement. */
7654 c_finish_expr_stmt (tree expr)
7657 return add_stmt (c_process_expr_stmt (expr));
7662 /* Do the opposite and emit a statement as an expression. To begin,
7663 create a new binding level and return it. */
7666 c_begin_stmt_expr (void)
7669 struct c_label_context_se *nstack;
7670 struct c_label_list *glist;
7672 /* We must force a BLOCK for this level so that, if it is not expanded
7673 later, there is a way to turn off the entire subtree of blocks that
7674 are contained in it. */
7676 ret = c_begin_compound_stmt (true);
7679 c_switch_stack->blocked_stmt_expr++;
7680 gcc_assert (c_switch_stack->blocked_stmt_expr != 0);
7682 for (glist = label_context_stack_se->labels_used;
7684 glist = glist->next)
7686 C_DECL_UNDEFINABLE_STMT_EXPR (glist->label) = 1;
7688 nstack = XOBNEW (&parser_obstack, struct c_label_context_se);
7689 nstack->labels_def = NULL;
7690 nstack->labels_used = NULL;
7691 nstack->next = label_context_stack_se;
7692 label_context_stack_se = nstack;
7694 /* Mark the current statement list as belonging to a statement list. */
7695 STATEMENT_LIST_STMT_EXPR (ret) = 1;
7701 c_finish_stmt_expr (tree body)
7703 tree last, type, tmp, val;
7705 struct c_label_list *dlist, *glist, *glist_prev = NULL;
7707 body = c_end_compound_stmt (body, true);
7710 gcc_assert (c_switch_stack->blocked_stmt_expr != 0);
7711 c_switch_stack->blocked_stmt_expr--;
7713 /* It is no longer possible to jump to labels defined within this
7714 statement expression. */
7715 for (dlist = label_context_stack_se->labels_def;
7717 dlist = dlist->next)
7719 C_DECL_UNJUMPABLE_STMT_EXPR (dlist->label) = 1;
7721 /* It is again possible to define labels with a goto just outside
7722 this statement expression. */
7723 for (glist = label_context_stack_se->next->labels_used;
7725 glist = glist->next)
7727 C_DECL_UNDEFINABLE_STMT_EXPR (glist->label) = 0;
7730 if (glist_prev != NULL)
7731 glist_prev->next = label_context_stack_se->labels_used;
7733 label_context_stack_se->next->labels_used
7734 = label_context_stack_se->labels_used;
7735 label_context_stack_se = label_context_stack_se->next;
7737 /* Locate the last statement in BODY. See c_end_compound_stmt
7738 about always returning a BIND_EXPR. */
7739 last_p = &BIND_EXPR_BODY (body);
7740 last = BIND_EXPR_BODY (body);
7743 if (TREE_CODE (last) == STATEMENT_LIST)
7745 tree_stmt_iterator i;
7747 /* This can happen with degenerate cases like ({ }). No value. */
7748 if (!TREE_SIDE_EFFECTS (last))
7751 /* If we're supposed to generate side effects warnings, process
7752 all of the statements except the last. */
7753 if (warn_unused_value)
7755 for (i = tsi_start (last); !tsi_one_before_end_p (i); tsi_next (&i))
7756 emit_side_effect_warnings (tsi_stmt (i));
7759 i = tsi_last (last);
7760 last_p = tsi_stmt_ptr (i);
7764 /* If the end of the list is exception related, then the list was split
7765 by a call to push_cleanup. Continue searching. */
7766 if (TREE_CODE (last) == TRY_FINALLY_EXPR
7767 || TREE_CODE (last) == TRY_CATCH_EXPR)
7769 last_p = &TREE_OPERAND (last, 0);
7771 goto continue_searching;
7774 /* In the case that the BIND_EXPR is not necessary, return the
7775 expression out from inside it. */
7776 if (last == error_mark_node
7777 || (last == BIND_EXPR_BODY (body)
7778 && BIND_EXPR_VARS (body) == NULL))
7780 /* Do not warn if the return value of a statement expression is
7782 if (CAN_HAVE_LOCATION_P (last))
7783 TREE_NO_WARNING (last) = 1;
7787 /* Extract the type of said expression. */
7788 type = TREE_TYPE (last);
7790 /* If we're not returning a value at all, then the BIND_EXPR that
7791 we already have is a fine expression to return. */
7792 if (!type || VOID_TYPE_P (type))
7795 /* Now that we've located the expression containing the value, it seems
7796 silly to make voidify_wrapper_expr repeat the process. Create a
7797 temporary of the appropriate type and stick it in a TARGET_EXPR. */
7798 tmp = create_tmp_var_raw (type, NULL);
7800 /* Unwrap a no-op NOP_EXPR as added by c_finish_expr_stmt. This avoids
7801 tree_expr_nonnegative_p giving up immediately. */
7803 if (TREE_CODE (val) == NOP_EXPR
7804 && TREE_TYPE (val) == TREE_TYPE (TREE_OPERAND (val, 0)))
7805 val = TREE_OPERAND (val, 0);
7807 *last_p = build2 (MODIFY_EXPR, void_type_node, tmp, val);
7808 SET_EXPR_LOCUS (*last_p, EXPR_LOCUS (last));
7810 return build4 (TARGET_EXPR, type, tmp, body, NULL_TREE, NULL_TREE);
7813 /* Begin the scope of an identifier of variably modified type, scope
7814 number SCOPE. Jumping from outside this scope to inside it is not
7818 c_begin_vm_scope (unsigned int scope)
7820 struct c_label_context_vm *nstack;
7821 struct c_label_list *glist;
7823 gcc_assert (scope > 0);
7825 /* At file_scope, we don't have to do any processing. */
7826 if (label_context_stack_vm == NULL)
7829 if (c_switch_stack && !c_switch_stack->blocked_vm)
7830 c_switch_stack->blocked_vm = scope;
7831 for (glist = label_context_stack_vm->labels_used;
7833 glist = glist->next)
7835 C_DECL_UNDEFINABLE_VM (glist->label) = 1;
7837 nstack = XOBNEW (&parser_obstack, struct c_label_context_vm);
7838 nstack->labels_def = NULL;
7839 nstack->labels_used = NULL;
7840 nstack->scope = scope;
7841 nstack->next = label_context_stack_vm;
7842 label_context_stack_vm = nstack;
7845 /* End a scope which may contain identifiers of variably modified
7846 type, scope number SCOPE. */
7849 c_end_vm_scope (unsigned int scope)
7851 if (label_context_stack_vm == NULL)
7853 if (c_switch_stack && c_switch_stack->blocked_vm == scope)
7854 c_switch_stack->blocked_vm = 0;
7855 /* We may have a number of nested scopes of identifiers with
7856 variably modified type, all at this depth. Pop each in turn. */
7857 while (label_context_stack_vm->scope == scope)
7859 struct c_label_list *dlist, *glist, *glist_prev = NULL;
7861 /* It is no longer possible to jump to labels defined within this
7863 for (dlist = label_context_stack_vm->labels_def;
7865 dlist = dlist->next)
7867 C_DECL_UNJUMPABLE_VM (dlist->label) = 1;
7869 /* It is again possible to define labels with a goto just outside
7871 for (glist = label_context_stack_vm->next->labels_used;
7873 glist = glist->next)
7875 C_DECL_UNDEFINABLE_VM (glist->label) = 0;
7878 if (glist_prev != NULL)
7879 glist_prev->next = label_context_stack_vm->labels_used;
7881 label_context_stack_vm->next->labels_used
7882 = label_context_stack_vm->labels_used;
7883 label_context_stack_vm = label_context_stack_vm->next;
7887 /* Begin and end compound statements. This is as simple as pushing
7888 and popping new statement lists from the tree. */
7891 c_begin_compound_stmt (bool do_scope)
7893 tree stmt = push_stmt_list ();
7900 c_end_compound_stmt (tree stmt, bool do_scope)
7906 if (c_dialect_objc ())
7907 objc_clear_super_receiver ();
7908 block = pop_scope ();
7911 stmt = pop_stmt_list (stmt);
7912 stmt = c_build_bind_expr (block, stmt);
7914 /* If this compound statement is nested immediately inside a statement
7915 expression, then force a BIND_EXPR to be created. Otherwise we'll
7916 do the wrong thing for ({ { 1; } }) or ({ 1; { } }). In particular,
7917 STATEMENT_LISTs merge, and thus we can lose track of what statement
7920 && STATEMENT_LIST_STMT_EXPR (cur_stmt_list)
7921 && TREE_CODE (stmt) != BIND_EXPR)
7923 stmt = build3 (BIND_EXPR, void_type_node, NULL, stmt, NULL);
7924 TREE_SIDE_EFFECTS (stmt) = 1;
7930 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
7931 when the current scope is exited. EH_ONLY is true when this is not
7932 meant to apply to normal control flow transfer. */
7935 push_cleanup (tree ARG_UNUSED (decl), tree cleanup, bool eh_only)
7937 enum tree_code code;
7941 code = eh_only ? TRY_CATCH_EXPR : TRY_FINALLY_EXPR;
7942 stmt = build_stmt (code, NULL, cleanup);
7944 stmt_expr = STATEMENT_LIST_STMT_EXPR (cur_stmt_list);
7945 list = push_stmt_list ();
7946 TREE_OPERAND (stmt, 0) = list;
7947 STATEMENT_LIST_STMT_EXPR (list) = stmt_expr;
7950 /* Build a binary-operation expression without default conversions.
7951 CODE is the kind of expression to build.
7952 LOCATION is the operator's location.
7953 This function differs from `build' in several ways:
7954 the data type of the result is computed and recorded in it,
7955 warnings are generated if arg data types are invalid,
7956 special handling for addition and subtraction of pointers is known,
7957 and some optimization is done (operations on narrow ints
7958 are done in the narrower type when that gives the same result).
7959 Constant folding is also done before the result is returned.
7961 Note that the operands will never have enumeral types, or function
7962 or array types, because either they will have the default conversions
7963 performed or they have both just been converted to some other type in which
7964 the arithmetic is to be done. */
7967 build_binary_op (location_t location, enum tree_code code,
7968 tree orig_op0, tree orig_op1, int convert_p)
7971 enum tree_code code0, code1;
7973 tree ret = error_mark_node;
7974 const char *invalid_op_diag;
7976 /* Expression code to give to the expression when it is built.
7977 Normally this is CODE, which is what the caller asked for,
7978 but in some special cases we change it. */
7979 enum tree_code resultcode = code;
7981 /* Data type in which the computation is to be performed.
7982 In the simplest cases this is the common type of the arguments. */
7983 tree result_type = NULL;
7985 /* Nonzero means operands have already been type-converted
7986 in whatever way is necessary.
7987 Zero means they need to be converted to RESULT_TYPE. */
7990 /* Nonzero means create the expression with this type, rather than
7992 tree build_type = 0;
7994 /* Nonzero means after finally constructing the expression
7995 convert it to this type. */
7996 tree final_type = 0;
7998 /* Nonzero if this is an operation like MIN or MAX which can
7999 safely be computed in short if both args are promoted shorts.
8000 Also implies COMMON.
8001 -1 indicates a bitwise operation; this makes a difference
8002 in the exact conditions for when it is safe to do the operation
8003 in a narrower mode. */
8006 /* Nonzero if this is a comparison operation;
8007 if both args are promoted shorts, compare the original shorts.
8008 Also implies COMMON. */
8009 int short_compare = 0;
8011 /* Nonzero if this is a right-shift operation, which can be computed on the
8012 original short and then promoted if the operand is a promoted short. */
8013 int short_shift = 0;
8015 /* Nonzero means set RESULT_TYPE to the common type of the args. */
8018 /* True means types are compatible as far as ObjC is concerned. */
8021 if (location == UNKNOWN_LOCATION)
8022 location = input_location;
8026 op0 = default_conversion (orig_op0);
8027 op1 = default_conversion (orig_op1);
8035 type0 = TREE_TYPE (op0);
8036 type1 = TREE_TYPE (op1);
8038 /* The expression codes of the data types of the arguments tell us
8039 whether the arguments are integers, floating, pointers, etc. */
8040 code0 = TREE_CODE (type0);
8041 code1 = TREE_CODE (type1);
8043 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
8044 STRIP_TYPE_NOPS (op0);
8045 STRIP_TYPE_NOPS (op1);
8047 /* If an error was already reported for one of the arguments,
8048 avoid reporting another error. */
8050 if (code0 == ERROR_MARK || code1 == ERROR_MARK)
8051 return error_mark_node;
8053 if ((invalid_op_diag
8054 = targetm.invalid_binary_op (code, type0, type1)))
8056 error_at (location, invalid_op_diag);
8057 return error_mark_node;
8060 objc_ok = objc_compare_types (type0, type1, -3, NULL_TREE);
8065 /* Handle the pointer + int case. */
8066 if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
8068 ret = pointer_int_sum (PLUS_EXPR, op0, op1);
8069 goto return_build_binary_op;
8071 else if (code1 == POINTER_TYPE && code0 == INTEGER_TYPE)
8073 ret = pointer_int_sum (PLUS_EXPR, op1, op0);
8074 goto return_build_binary_op;
8081 /* Subtraction of two similar pointers.
8082 We must subtract them as integers, then divide by object size. */
8083 if (code0 == POINTER_TYPE && code1 == POINTER_TYPE
8084 && comp_target_types (type0, type1))
8086 ret = pointer_diff (op0, op1);
8087 goto return_build_binary_op;
8089 /* Handle pointer minus int. Just like pointer plus int. */
8090 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
8092 ret = pointer_int_sum (MINUS_EXPR, op0, op1);
8093 goto return_build_binary_op;
8103 case TRUNC_DIV_EXPR:
8105 case FLOOR_DIV_EXPR:
8106 case ROUND_DIV_EXPR:
8107 case EXACT_DIV_EXPR:
8108 warn_for_div_by_zero (location, op1);
8110 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
8111 || code0 == FIXED_POINT_TYPE
8112 || code0 == COMPLEX_TYPE || code0 == VECTOR_TYPE)
8113 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
8114 || code1 == FIXED_POINT_TYPE
8115 || code1 == COMPLEX_TYPE || code1 == VECTOR_TYPE))
8117 enum tree_code tcode0 = code0, tcode1 = code1;
8119 if (code0 == COMPLEX_TYPE || code0 == VECTOR_TYPE)
8120 tcode0 = TREE_CODE (TREE_TYPE (TREE_TYPE (op0)));
8121 if (code1 == COMPLEX_TYPE || code1 == VECTOR_TYPE)
8122 tcode1 = TREE_CODE (TREE_TYPE (TREE_TYPE (op1)));
8124 if (!((tcode0 == INTEGER_TYPE && tcode1 == INTEGER_TYPE)
8125 || (tcode0 == FIXED_POINT_TYPE && tcode1 == FIXED_POINT_TYPE)))
8126 resultcode = RDIV_EXPR;
8128 /* Although it would be tempting to shorten always here, that
8129 loses on some targets, since the modulo instruction is
8130 undefined if the quotient can't be represented in the
8131 computation mode. We shorten only if unsigned or if
8132 dividing by something we know != -1. */
8133 shorten = (TYPE_UNSIGNED (TREE_TYPE (orig_op0))
8134 || (TREE_CODE (op1) == INTEGER_CST
8135 && !integer_all_onesp (op1)));
8143 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
8145 /* Allow vector types which are not floating point types. */
8146 else if (code0 == VECTOR_TYPE
8147 && code1 == VECTOR_TYPE
8148 && !VECTOR_FLOAT_TYPE_P (type0)
8149 && !VECTOR_FLOAT_TYPE_P (type1))
8153 case TRUNC_MOD_EXPR:
8154 case FLOOR_MOD_EXPR:
8155 warn_for_div_by_zero (location, op1);
8157 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
8159 /* Although it would be tempting to shorten always here, that loses
8160 on some targets, since the modulo instruction is undefined if the
8161 quotient can't be represented in the computation mode. We shorten
8162 only if unsigned or if dividing by something we know != -1. */
8163 shorten = (TYPE_UNSIGNED (TREE_TYPE (orig_op0))
8164 || (TREE_CODE (op1) == INTEGER_CST
8165 && !integer_all_onesp (op1)));
8170 case TRUTH_ANDIF_EXPR:
8171 case TRUTH_ORIF_EXPR:
8172 case TRUTH_AND_EXPR:
8174 case TRUTH_XOR_EXPR:
8175 if ((code0 == INTEGER_TYPE || code0 == POINTER_TYPE
8176 || code0 == REAL_TYPE || code0 == COMPLEX_TYPE
8177 || code0 == FIXED_POINT_TYPE)
8178 && (code1 == INTEGER_TYPE || code1 == POINTER_TYPE
8179 || code1 == REAL_TYPE || code1 == COMPLEX_TYPE
8180 || code1 == FIXED_POINT_TYPE))
8182 /* Result of these operations is always an int,
8183 but that does not mean the operands should be
8184 converted to ints! */
8185 result_type = integer_type_node;
8186 op0 = c_common_truthvalue_conversion (location, op0);
8187 op1 = c_common_truthvalue_conversion (location, op1);
8192 /* Shift operations: result has same type as first operand;
8193 always convert second operand to int.
8194 Also set SHORT_SHIFT if shifting rightward. */
8197 if ((code0 == INTEGER_TYPE || code0 == FIXED_POINT_TYPE)
8198 && code1 == INTEGER_TYPE)
8200 if (TREE_CODE (op1) == INTEGER_CST && skip_evaluation == 0)
8202 if (tree_int_cst_sgn (op1) < 0)
8203 warning (0, "right shift count is negative");
8206 if (!integer_zerop (op1))
8209 if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
8210 warning (0, "right shift count >= width of type");
8214 /* Use the type of the value to be shifted. */
8215 result_type = type0;
8216 /* Convert the shift-count to an integer, regardless of size
8217 of value being shifted. */
8218 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
8219 op1 = convert (integer_type_node, op1);
8220 /* Avoid converting op1 to result_type later. */
8226 if ((code0 == INTEGER_TYPE || code0 == FIXED_POINT_TYPE)
8227 && code1 == INTEGER_TYPE)
8229 if (TREE_CODE (op1) == INTEGER_CST && skip_evaluation == 0)
8231 if (tree_int_cst_sgn (op1) < 0)
8232 warning (0, "left shift count is negative");
8234 else if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
8235 warning (0, "left shift count >= width of type");
8238 /* Use the type of the value to be shifted. */
8239 result_type = type0;
8240 /* Convert the shift-count to an integer, regardless of size
8241 of value being shifted. */
8242 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
8243 op1 = convert (integer_type_node, op1);
8244 /* Avoid converting op1 to result_type later. */
8251 if (FLOAT_TYPE_P (type0) || FLOAT_TYPE_P (type1))
8252 warning_at (location,
8254 "comparing floating point with == or != is unsafe");
8255 /* Result of comparison is always int,
8256 but don't convert the args to int! */
8257 build_type = integer_type_node;
8258 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
8259 || code0 == FIXED_POINT_TYPE || code0 == COMPLEX_TYPE)
8260 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
8261 || code1 == FIXED_POINT_TYPE || code1 == COMPLEX_TYPE))
8263 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
8265 tree tt0 = TREE_TYPE (type0);
8266 tree tt1 = TREE_TYPE (type1);
8267 /* Anything compares with void *. void * compares with anything.
8268 Otherwise, the targets must be compatible
8269 and both must be object or both incomplete. */
8270 if (comp_target_types (type0, type1))
8271 result_type = common_pointer_type (type0, type1);
8272 else if (VOID_TYPE_P (tt0))
8274 /* op0 != orig_op0 detects the case of something
8275 whose value is 0 but which isn't a valid null ptr const. */
8276 if (pedantic && !null_pointer_constant_p (orig_op0)
8277 && TREE_CODE (tt1) == FUNCTION_TYPE)
8278 pedwarn (location, OPT_pedantic, "ISO C forbids "
8279 "comparison of %<void *%> with function pointer");
8281 else if (VOID_TYPE_P (tt1))
8283 if (pedantic && !null_pointer_constant_p (orig_op1)
8284 && TREE_CODE (tt0) == FUNCTION_TYPE)
8285 pedwarn (location, OPT_pedantic, "ISO C forbids "
8286 "comparison of %<void *%> with function pointer");
8289 /* Avoid warning about the volatile ObjC EH puts on decls. */
8291 pedwarn (location, 0,
8292 "comparison of distinct pointer types lacks a cast");
8294 if (result_type == NULL_TREE)
8295 result_type = ptr_type_node;
8297 else if (code0 == POINTER_TYPE && null_pointer_constant_p (orig_op1))
8299 if (TREE_CODE (op0) == ADDR_EXPR
8300 && decl_with_nonnull_addr_p (TREE_OPERAND (op0, 0)))
8301 warning_at (location,
8302 OPT_Waddress, "the address of %qD will never be NULL",
8303 TREE_OPERAND (op0, 0));
8304 result_type = type0;
8306 else if (code1 == POINTER_TYPE && null_pointer_constant_p (orig_op0))
8308 if (TREE_CODE (op1) == ADDR_EXPR
8309 && decl_with_nonnull_addr_p (TREE_OPERAND (op1, 0)))
8310 warning_at (location,
8311 OPT_Waddress, "the address of %qD will never be NULL",
8312 TREE_OPERAND (op1, 0));
8313 result_type = type1;
8315 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
8317 result_type = type0;
8318 pedwarn (location, 0, "comparison between pointer and integer");
8320 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
8322 result_type = type1;
8323 pedwarn (location, 0, "comparison between pointer and integer");
8331 build_type = integer_type_node;
8332 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
8333 || code0 == FIXED_POINT_TYPE)
8334 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
8335 || code1 == FIXED_POINT_TYPE))
8337 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
8339 if (comp_target_types (type0, type1))
8341 result_type = common_pointer_type (type0, type1);
8342 if (!COMPLETE_TYPE_P (TREE_TYPE (type0))
8343 != !COMPLETE_TYPE_P (TREE_TYPE (type1)))
8344 pedwarn (location, 0,
8345 "comparison of complete and incomplete pointers");
8346 else if (TREE_CODE (TREE_TYPE (type0)) == FUNCTION_TYPE)
8347 pedwarn (location, OPT_pedantic, "ISO C forbids "
8348 "ordered comparisons of pointers to functions");
8352 result_type = ptr_type_node;
8353 pedwarn (location, 0,
8354 "comparison of distinct pointer types lacks a cast");
8357 else if (code0 == POINTER_TYPE && null_pointer_constant_p (orig_op1))
8359 result_type = type0;
8361 pedwarn (location, OPT_pedantic,
8362 "ordered comparison of pointer with integer zero");
8363 else if (extra_warnings)
8364 warning_at (location, OPT_Wextra,
8365 "ordered comparison of pointer with integer zero");
8367 else if (code1 == POINTER_TYPE && null_pointer_constant_p (orig_op0))
8369 result_type = type1;
8370 pedwarn (location, OPT_pedantic,
8371 "ordered comparison of pointer with integer zero");
8373 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
8375 result_type = type0;
8376 pedwarn (location, 0, "comparison between pointer and integer");
8378 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
8380 result_type = type1;
8381 pedwarn (location, 0, "comparison between pointer and integer");
8389 if (code0 == ERROR_MARK || code1 == ERROR_MARK)
8390 return error_mark_node;
8392 if (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE
8393 && (!tree_int_cst_equal (TYPE_SIZE (type0), TYPE_SIZE (type1))
8394 || !same_scalar_type_ignoring_signedness (TREE_TYPE (type0),
8395 TREE_TYPE (type1))))
8397 binary_op_error (location, code, type0, type1);
8398 return error_mark_node;
8401 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE || code0 == COMPLEX_TYPE
8402 || code0 == FIXED_POINT_TYPE || code0 == VECTOR_TYPE)
8404 (code1 == INTEGER_TYPE || code1 == REAL_TYPE || code1 == COMPLEX_TYPE
8405 || code1 == FIXED_POINT_TYPE || code1 == VECTOR_TYPE))
8407 int none_complex = (code0 != COMPLEX_TYPE && code1 != COMPLEX_TYPE);
8409 if (shorten || common || short_compare)
8411 result_type = c_common_type (type0, type1);
8412 if (result_type == error_mark_node)
8413 return error_mark_node;
8416 /* For certain operations (which identify themselves by shorten != 0)
8417 if both args were extended from the same smaller type,
8418 do the arithmetic in that type and then extend.
8420 shorten !=0 and !=1 indicates a bitwise operation.
8421 For them, this optimization is safe only if
8422 both args are zero-extended or both are sign-extended.
8423 Otherwise, we might change the result.
8424 Eg, (short)-1 | (unsigned short)-1 is (int)-1
8425 but calculated in (unsigned short) it would be (unsigned short)-1. */
8427 if (shorten && none_complex)
8429 final_type = result_type;
8430 result_type = shorten_binary_op (result_type, op0, op1,
8434 /* Shifts can be shortened if shifting right. */
8439 tree arg0 = get_narrower (op0, &unsigned_arg);
8441 final_type = result_type;
8443 if (arg0 == op0 && final_type == TREE_TYPE (op0))
8444 unsigned_arg = TYPE_UNSIGNED (TREE_TYPE (op0));
8446 if (TYPE_PRECISION (TREE_TYPE (arg0)) < TYPE_PRECISION (result_type)
8447 /* We can shorten only if the shift count is less than the
8448 number of bits in the smaller type size. */
8449 && compare_tree_int (op1, TYPE_PRECISION (TREE_TYPE (arg0))) < 0
8450 /* We cannot drop an unsigned shift after sign-extension. */
8451 && (!TYPE_UNSIGNED (final_type) || unsigned_arg))
8453 /* Do an unsigned shift if the operand was zero-extended. */
8455 = c_common_signed_or_unsigned_type (unsigned_arg,
8457 /* Convert value-to-be-shifted to that type. */
8458 if (TREE_TYPE (op0) != result_type)
8459 op0 = convert (result_type, op0);
8464 /* Comparison operations are shortened too but differently.
8465 They identify themselves by setting short_compare = 1. */
8469 /* Don't write &op0, etc., because that would prevent op0
8470 from being kept in a register.
8471 Instead, make copies of the our local variables and
8472 pass the copies by reference, then copy them back afterward. */
8473 tree xop0 = op0, xop1 = op1, xresult_type = result_type;
8474 enum tree_code xresultcode = resultcode;
8476 = shorten_compare (&xop0, &xop1, &xresult_type, &xresultcode);
8481 goto return_build_binary_op;
8484 op0 = xop0, op1 = xop1;
8486 resultcode = xresultcode;
8488 if (warn_sign_compare && !skip_evaluation)
8490 warn_for_sign_compare (location, orig_op0, orig_op1, op0, op1,
8491 result_type, resultcode);
8496 /* At this point, RESULT_TYPE must be nonzero to avoid an error message.
8497 If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
8498 Then the expression will be built.
8499 It will be given type FINAL_TYPE if that is nonzero;
8500 otherwise, it will be given type RESULT_TYPE. */
8504 binary_op_error (location, code, TREE_TYPE (op0), TREE_TYPE (op1));
8505 return error_mark_node;
8510 if (TREE_TYPE (op0) != result_type)
8511 op0 = convert_and_check (result_type, op0);
8512 if (TREE_TYPE (op1) != result_type)
8513 op1 = convert_and_check (result_type, op1);
8515 /* This can happen if one operand has a vector type, and the other
8516 has a different type. */
8517 if (TREE_CODE (op0) == ERROR_MARK || TREE_CODE (op1) == ERROR_MARK)
8518 return error_mark_node;
8521 if (build_type == NULL_TREE)
8522 build_type = result_type;
8524 /* Treat expressions in initializers specially as they can't trap. */
8525 ret = require_constant_value ? fold_build2_initializer (resultcode,
8528 : fold_build2 (resultcode, build_type,
8530 if (final_type != 0)
8531 ret = convert (final_type, ret);
8533 return_build_binary_op:
8534 gcc_assert (ret != error_mark_node);
8535 protected_set_expr_location (ret, location);
8540 /* Convert EXPR to be a truth-value, validating its type for this
8541 purpose. LOCATION is the source location for the expression. */
8544 c_objc_common_truthvalue_conversion (location_t location, tree expr)
8546 switch (TREE_CODE (TREE_TYPE (expr)))
8549 error_at (location, "used array that cannot be converted to pointer where scalar is required");
8550 return error_mark_node;
8553 error_at (location, "used struct type value where scalar is required");
8554 return error_mark_node;
8557 error_at (location, "used union type value where scalar is required");
8558 return error_mark_node;
8567 /* ??? Should we also give an error for void and vectors rather than
8568 leaving those to give errors later? */
8569 return c_common_truthvalue_conversion (location, expr);
8573 /* Convert EXPR to a contained DECL, updating *TC, *TI and *SE as
8577 c_expr_to_decl (tree expr, bool *tc ATTRIBUTE_UNUSED, bool *se)
8579 if (TREE_CODE (expr) == COMPOUND_LITERAL_EXPR)
8581 tree decl = COMPOUND_LITERAL_EXPR_DECL (expr);
8582 /* Executing a compound literal inside a function reinitializes
8584 if (!TREE_STATIC (decl))
8592 /* Like c_begin_compound_stmt, except force the retention of the BLOCK. */
8595 c_begin_omp_parallel (void)
8600 block = c_begin_compound_stmt (true);
8605 /* Generate OMP_PARALLEL, with CLAUSES and BLOCK as its compound statement. */
8608 c_finish_omp_parallel (tree clauses, tree block)
8612 block = c_end_compound_stmt (block, true);
8614 stmt = make_node (OMP_PARALLEL);
8615 TREE_TYPE (stmt) = void_type_node;
8616 OMP_PARALLEL_CLAUSES (stmt) = clauses;
8617 OMP_PARALLEL_BODY (stmt) = block;
8619 return add_stmt (stmt);
8622 /* Like c_begin_compound_stmt, except force the retention of the BLOCK. */
8625 c_begin_omp_task (void)
8630 block = c_begin_compound_stmt (true);
8635 /* Generate OMP_TASK, with CLAUSES and BLOCK as its compound statement. */
8638 c_finish_omp_task (tree clauses, tree block)
8642 block = c_end_compound_stmt (block, true);
8644 stmt = make_node (OMP_TASK);
8645 TREE_TYPE (stmt) = void_type_node;
8646 OMP_TASK_CLAUSES (stmt) = clauses;
8647 OMP_TASK_BODY (stmt) = block;
8649 return add_stmt (stmt);
8652 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
8653 Remove any elements from the list that are invalid. */
8656 c_finish_omp_clauses (tree clauses)
8658 bitmap_head generic_head, firstprivate_head, lastprivate_head;
8659 tree c, t, *pc = &clauses;
8662 bitmap_obstack_initialize (NULL);
8663 bitmap_initialize (&generic_head, &bitmap_default_obstack);
8664 bitmap_initialize (&firstprivate_head, &bitmap_default_obstack);
8665 bitmap_initialize (&lastprivate_head, &bitmap_default_obstack);
8667 for (pc = &clauses, c = clauses; c ; c = *pc)
8669 bool remove = false;
8670 bool need_complete = false;
8671 bool need_implicitly_determined = false;
8673 switch (OMP_CLAUSE_CODE (c))
8675 case OMP_CLAUSE_SHARED:
8677 need_implicitly_determined = true;
8678 goto check_dup_generic;
8680 case OMP_CLAUSE_PRIVATE:
8682 need_complete = true;
8683 need_implicitly_determined = true;
8684 goto check_dup_generic;
8686 case OMP_CLAUSE_REDUCTION:
8688 need_implicitly_determined = true;
8689 t = OMP_CLAUSE_DECL (c);
8690 if (AGGREGATE_TYPE_P (TREE_TYPE (t))
8691 || POINTER_TYPE_P (TREE_TYPE (t)))
8693 error ("%qE has invalid type for %<reduction%>", t);
8696 else if (FLOAT_TYPE_P (TREE_TYPE (t)))
8698 enum tree_code r_code = OMP_CLAUSE_REDUCTION_CODE (c);
8699 const char *r_name = NULL;
8716 case TRUTH_ANDIF_EXPR:
8719 case TRUTH_ORIF_EXPR:
8727 error ("%qE has invalid type for %<reduction(%s)%>",
8732 goto check_dup_generic;
8734 case OMP_CLAUSE_COPYPRIVATE:
8735 name = "copyprivate";
8736 goto check_dup_generic;
8738 case OMP_CLAUSE_COPYIN:
8740 t = OMP_CLAUSE_DECL (c);
8741 if (TREE_CODE (t) != VAR_DECL || !DECL_THREAD_LOCAL_P (t))
8743 error ("%qE must be %<threadprivate%> for %<copyin%>", t);
8746 goto check_dup_generic;
8749 t = OMP_CLAUSE_DECL (c);
8750 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
8752 error ("%qE is not a variable in clause %qs", t, name);
8755 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
8756 || bitmap_bit_p (&firstprivate_head, DECL_UID (t))
8757 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
8759 error ("%qE appears more than once in data clauses", t);
8763 bitmap_set_bit (&generic_head, DECL_UID (t));
8766 case OMP_CLAUSE_FIRSTPRIVATE:
8767 name = "firstprivate";
8768 t = OMP_CLAUSE_DECL (c);
8769 need_complete = true;
8770 need_implicitly_determined = true;
8771 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
8773 error ("%qE is not a variable in clause %<firstprivate%>", t);
8776 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
8777 || bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
8779 error ("%qE appears more than once in data clauses", t);
8783 bitmap_set_bit (&firstprivate_head, DECL_UID (t));
8786 case OMP_CLAUSE_LASTPRIVATE:
8787 name = "lastprivate";
8788 t = OMP_CLAUSE_DECL (c);
8789 need_complete = true;
8790 need_implicitly_determined = true;
8791 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
8793 error ("%qE is not a variable in clause %<lastprivate%>", t);
8796 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
8797 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
8799 error ("%qE appears more than once in data clauses", t);
8803 bitmap_set_bit (&lastprivate_head, DECL_UID (t));
8807 case OMP_CLAUSE_NUM_THREADS:
8808 case OMP_CLAUSE_SCHEDULE:
8809 case OMP_CLAUSE_NOWAIT:
8810 case OMP_CLAUSE_ORDERED:
8811 case OMP_CLAUSE_DEFAULT:
8812 case OMP_CLAUSE_UNTIED:
8813 case OMP_CLAUSE_COLLAPSE:
8814 pc = &OMP_CLAUSE_CHAIN (c);
8823 t = OMP_CLAUSE_DECL (c);
8827 t = require_complete_type (t);
8828 if (t == error_mark_node)
8832 if (need_implicitly_determined)
8834 const char *share_name = NULL;
8836 if (TREE_CODE (t) == VAR_DECL && DECL_THREAD_LOCAL_P (t))
8837 share_name = "threadprivate";
8838 else switch (c_omp_predetermined_sharing (t))
8840 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
8842 case OMP_CLAUSE_DEFAULT_SHARED:
8843 share_name = "shared";
8845 case OMP_CLAUSE_DEFAULT_PRIVATE:
8846 share_name = "private";
8853 error ("%qE is predetermined %qs for %qs",
8854 t, share_name, name);
8861 *pc = OMP_CLAUSE_CHAIN (c);
8863 pc = &OMP_CLAUSE_CHAIN (c);
8866 bitmap_obstack_release (NULL);
8870 /* Make a variant type in the proper way for C/C++, propagating qualifiers
8871 down to the element type of an array. */
8874 c_build_qualified_type (tree type, int type_quals)
8876 if (type == error_mark_node)
8879 if (TREE_CODE (type) == ARRAY_TYPE)
8882 tree element_type = c_build_qualified_type (TREE_TYPE (type),
8885 /* See if we already have an identically qualified type. */
8886 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
8888 if (TYPE_QUALS (strip_array_types (t)) == type_quals
8889 && TYPE_NAME (t) == TYPE_NAME (type)
8890 && TYPE_CONTEXT (t) == TYPE_CONTEXT (type)
8891 && attribute_list_equal (TYPE_ATTRIBUTES (t),
8892 TYPE_ATTRIBUTES (type)))
8897 tree domain = TYPE_DOMAIN (type);
8899 t = build_variant_type_copy (type);
8900 TREE_TYPE (t) = element_type;
8902 if (TYPE_STRUCTURAL_EQUALITY_P (element_type)
8903 || (domain && TYPE_STRUCTURAL_EQUALITY_P (domain)))
8904 SET_TYPE_STRUCTURAL_EQUALITY (t);
8905 else if (TYPE_CANONICAL (element_type) != element_type
8906 || (domain && TYPE_CANONICAL (domain) != domain))
8908 tree unqualified_canon
8909 = build_array_type (TYPE_CANONICAL (element_type),
8910 domain? TYPE_CANONICAL (domain)
8913 = c_build_qualified_type (unqualified_canon, type_quals);
8916 TYPE_CANONICAL (t) = t;
8921 /* A restrict-qualified pointer type must be a pointer to object or
8922 incomplete type. Note that the use of POINTER_TYPE_P also allows
8923 REFERENCE_TYPEs, which is appropriate for C++. */
8924 if ((type_quals & TYPE_QUAL_RESTRICT)
8925 && (!POINTER_TYPE_P (type)
8926 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type))))
8928 error ("invalid use of %<restrict%>");
8929 type_quals &= ~TYPE_QUAL_RESTRICT;
8932 return build_qualified_type (type, type_quals);