1 /* Build expressions with type checking for C compiler.
2 Copyright (C) 1987, 1988, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009
4 Free Software Foundation, Inc.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 3, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
23 /* This file is part of the C front end.
24 It contains routines to build C expressions given their operands,
25 including computing the types of the result, C-specific error checks,
26 and some optimization. */
30 #include "coretypes.h"
34 #include "langhooks.h"
44 #include "tree-iterator.h"
46 #include "tree-flow.h"
48 /* Possible cases of implicit bad conversions. Used to select
49 diagnostic messages in convert_for_assignment. */
57 /* The level of nesting inside "__alignof__". */
60 /* The level of nesting inside "sizeof". */
63 /* The level of nesting inside "typeof". */
66 struct c_label_context_se *label_context_stack_se;
67 struct c_label_context_vm *label_context_stack_vm;
69 /* Nonzero if we've already printed a "missing braces around initializer"
70 message within this initializer. */
71 static int missing_braces_mentioned;
73 static int require_constant_value;
74 static int require_constant_elements;
76 static bool null_pointer_constant_p (const_tree);
77 static tree qualify_type (tree, tree);
78 static int tagged_types_tu_compatible_p (const_tree, const_tree);
79 static int comp_target_types (tree, tree);
80 static int function_types_compatible_p (const_tree, const_tree);
81 static int type_lists_compatible_p (const_tree, const_tree);
82 static tree decl_constant_value_for_broken_optimization (tree);
83 static tree lookup_field (tree, tree);
84 static int convert_arguments (int, tree *, tree, tree, tree, tree);
85 static tree pointer_diff (tree, tree);
86 static tree convert_for_assignment (tree, tree, enum impl_conv, tree, tree,
88 static tree valid_compound_expr_initializer (tree, tree);
89 static void push_string (const char *);
90 static void push_member_name (tree);
91 static int spelling_length (void);
92 static char *print_spelling (char *);
93 static void warning_init (int, const char *);
94 static tree digest_init (tree, tree, bool, int);
95 static void output_init_element (tree, bool, tree, tree, int, bool);
96 static void output_pending_init_elements (int);
97 static int set_designator (int);
98 static void push_range_stack (tree);
99 static void add_pending_init (tree, tree, bool);
100 static void set_nonincremental_init (void);
101 static void set_nonincremental_init_from_string (tree);
102 static tree find_init_member (tree);
103 static void readonly_error (tree, enum lvalue_use);
104 static int lvalue_or_else (const_tree, enum lvalue_use);
105 static int lvalue_p (const_tree);
106 static void record_maybe_used_decl (tree);
107 static int comptypes_internal (const_tree, const_tree);
109 /* Return true if EXP is a null pointer constant, false otherwise. */
112 null_pointer_constant_p (const_tree expr)
114 /* This should really operate on c_expr structures, but they aren't
115 yet available everywhere required. */
116 tree type = TREE_TYPE (expr);
117 return (TREE_CODE (expr) == INTEGER_CST
118 && !TREE_OVERFLOW (expr)
119 && integer_zerop (expr)
120 && (INTEGRAL_TYPE_P (type)
121 || (TREE_CODE (type) == POINTER_TYPE
122 && VOID_TYPE_P (TREE_TYPE (type))
123 && TYPE_QUALS (TREE_TYPE (type)) == TYPE_UNQUALIFIED)));
125 \f/* This is a cache to hold if two types are compatible or not. */
127 struct tagged_tu_seen_cache {
128 const struct tagged_tu_seen_cache * next;
131 /* The return value of tagged_types_tu_compatible_p if we had seen
132 these two types already. */
136 static const struct tagged_tu_seen_cache * tagged_tu_seen_base;
137 static void free_all_tagged_tu_seen_up_to (const struct tagged_tu_seen_cache *);
139 /* Do `exp = require_complete_type (exp);' to make sure exp
140 does not have an incomplete type. (That includes void types.) */
143 require_complete_type (tree value)
145 tree type = TREE_TYPE (value);
147 if (value == error_mark_node || type == error_mark_node)
148 return error_mark_node;
150 /* First, detect a valid value with a complete type. */
151 if (COMPLETE_TYPE_P (type))
154 c_incomplete_type_error (value, type);
155 return error_mark_node;
158 /* Print an error message for invalid use of an incomplete type.
159 VALUE is the expression that was used (or 0 if that isn't known)
160 and TYPE is the type that was invalid. */
163 c_incomplete_type_error (const_tree value, const_tree type)
165 const char *type_code_string;
167 /* Avoid duplicate error message. */
168 if (TREE_CODE (type) == ERROR_MARK)
171 if (value != 0 && (TREE_CODE (value) == VAR_DECL
172 || TREE_CODE (value) == PARM_DECL))
173 error ("%qD has an incomplete type", value);
177 /* We must print an error message. Be clever about what it says. */
179 switch (TREE_CODE (type))
182 type_code_string = "struct";
186 type_code_string = "union";
190 type_code_string = "enum";
194 error ("invalid use of void expression");
198 if (TYPE_DOMAIN (type))
200 if (TYPE_MAX_VALUE (TYPE_DOMAIN (type)) == NULL)
202 error ("invalid use of flexible array member");
205 type = TREE_TYPE (type);
208 error ("invalid use of array with unspecified bounds");
215 if (TREE_CODE (TYPE_NAME (type)) == IDENTIFIER_NODE)
216 error ("invalid use of undefined type %<%s %E%>",
217 type_code_string, TYPE_NAME (type));
219 /* If this type has a typedef-name, the TYPE_NAME is a TYPE_DECL. */
220 error ("invalid use of incomplete typedef %qD", TYPE_NAME (type));
224 /* Given a type, apply default promotions wrt unnamed function
225 arguments and return the new type. */
228 c_type_promotes_to (tree type)
230 if (TYPE_MAIN_VARIANT (type) == float_type_node)
231 return double_type_node;
233 if (c_promoting_integer_type_p (type))
235 /* Preserve unsignedness if not really getting any wider. */
236 if (TYPE_UNSIGNED (type)
237 && (TYPE_PRECISION (type) == TYPE_PRECISION (integer_type_node)))
238 return unsigned_type_node;
239 return integer_type_node;
245 /* Return a variant of TYPE which has all the type qualifiers of LIKE
246 as well as those of TYPE. */
249 qualify_type (tree type, tree like)
251 return c_build_qualified_type (type,
252 TYPE_QUALS (type) | TYPE_QUALS (like));
255 /* Return true iff the given tree T is a variable length array. */
258 c_vla_type_p (const_tree t)
260 if (TREE_CODE (t) == ARRAY_TYPE
261 && C_TYPE_VARIABLE_SIZE (t))
266 /* Return the composite type of two compatible types.
268 We assume that comptypes has already been done and returned
269 nonzero; if that isn't so, this may crash. In particular, we
270 assume that qualifiers match. */
273 composite_type (tree t1, tree t2)
275 enum tree_code code1;
276 enum tree_code code2;
279 /* Save time if the two types are the same. */
281 if (t1 == t2) return t1;
283 /* If one type is nonsense, use the other. */
284 if (t1 == error_mark_node)
286 if (t2 == error_mark_node)
289 code1 = TREE_CODE (t1);
290 code2 = TREE_CODE (t2);
292 /* Merge the attributes. */
293 attributes = targetm.merge_type_attributes (t1, t2);
295 /* If one is an enumerated type and the other is the compatible
296 integer type, the composite type might be either of the two
297 (DR#013 question 3). For consistency, use the enumerated type as
298 the composite type. */
300 if (code1 == ENUMERAL_TYPE && code2 == INTEGER_TYPE)
302 if (code2 == ENUMERAL_TYPE && code1 == INTEGER_TYPE)
305 gcc_assert (code1 == code2);
310 /* For two pointers, do this recursively on the target type. */
312 tree pointed_to_1 = TREE_TYPE (t1);
313 tree pointed_to_2 = TREE_TYPE (t2);
314 tree target = composite_type (pointed_to_1, pointed_to_2);
315 t1 = build_pointer_type (target);
316 t1 = build_type_attribute_variant (t1, attributes);
317 return qualify_type (t1, t2);
322 tree elt = composite_type (TREE_TYPE (t1), TREE_TYPE (t2));
325 tree d1 = TYPE_DOMAIN (t1);
326 tree d2 = TYPE_DOMAIN (t2);
327 bool d1_variable, d2_variable;
328 bool d1_zero, d2_zero;
329 bool t1_complete, t2_complete;
331 /* We should not have any type quals on arrays at all. */
332 gcc_assert (!TYPE_QUALS (t1) && !TYPE_QUALS (t2));
334 t1_complete = COMPLETE_TYPE_P (t1);
335 t2_complete = COMPLETE_TYPE_P (t2);
337 d1_zero = d1 == 0 || !TYPE_MAX_VALUE (d1);
338 d2_zero = d2 == 0 || !TYPE_MAX_VALUE (d2);
340 d1_variable = (!d1_zero
341 && (TREE_CODE (TYPE_MIN_VALUE (d1)) != INTEGER_CST
342 || TREE_CODE (TYPE_MAX_VALUE (d1)) != INTEGER_CST));
343 d2_variable = (!d2_zero
344 && (TREE_CODE (TYPE_MIN_VALUE (d2)) != INTEGER_CST
345 || TREE_CODE (TYPE_MAX_VALUE (d2)) != INTEGER_CST));
346 d1_variable = d1_variable || (d1_zero && c_vla_type_p (t1));
347 d2_variable = d2_variable || (d2_zero && c_vla_type_p (t2));
349 /* Save space: see if the result is identical to one of the args. */
350 if (elt == TREE_TYPE (t1) && TYPE_DOMAIN (t1)
351 && (d2_variable || d2_zero || !d1_variable))
352 return build_type_attribute_variant (t1, attributes);
353 if (elt == TREE_TYPE (t2) && TYPE_DOMAIN (t2)
354 && (d1_variable || d1_zero || !d2_variable))
355 return build_type_attribute_variant (t2, attributes);
357 if (elt == TREE_TYPE (t1) && !TYPE_DOMAIN (t2) && !TYPE_DOMAIN (t1))
358 return build_type_attribute_variant (t1, attributes);
359 if (elt == TREE_TYPE (t2) && !TYPE_DOMAIN (t2) && !TYPE_DOMAIN (t1))
360 return build_type_attribute_variant (t2, attributes);
362 /* Merge the element types, and have a size if either arg has
363 one. We may have qualifiers on the element types. To set
364 up TYPE_MAIN_VARIANT correctly, we need to form the
365 composite of the unqualified types and add the qualifiers
367 quals = TYPE_QUALS (strip_array_types (elt));
368 unqual_elt = c_build_qualified_type (elt, TYPE_UNQUALIFIED);
369 t1 = build_array_type (unqual_elt,
370 TYPE_DOMAIN ((TYPE_DOMAIN (t1)
376 /* Ensure a composite type involving a zero-length array type
377 is a zero-length type not an incomplete type. */
378 if (d1_zero && d2_zero
379 && (t1_complete || t2_complete)
380 && !COMPLETE_TYPE_P (t1))
382 TYPE_SIZE (t1) = bitsize_zero_node;
383 TYPE_SIZE_UNIT (t1) = size_zero_node;
385 t1 = c_build_qualified_type (t1, quals);
386 return build_type_attribute_variant (t1, attributes);
392 if (attributes != NULL)
394 /* Try harder not to create a new aggregate type. */
395 if (attribute_list_equal (TYPE_ATTRIBUTES (t1), attributes))
397 if (attribute_list_equal (TYPE_ATTRIBUTES (t2), attributes))
400 return build_type_attribute_variant (t1, attributes);
403 /* Function types: prefer the one that specified arg types.
404 If both do, merge the arg types. Also merge the return types. */
406 tree valtype = composite_type (TREE_TYPE (t1), TREE_TYPE (t2));
407 tree p1 = TYPE_ARG_TYPES (t1);
408 tree p2 = TYPE_ARG_TYPES (t2);
413 /* Save space: see if the result is identical to one of the args. */
414 if (valtype == TREE_TYPE (t1) && !TYPE_ARG_TYPES (t2))
415 return build_type_attribute_variant (t1, attributes);
416 if (valtype == TREE_TYPE (t2) && !TYPE_ARG_TYPES (t1))
417 return build_type_attribute_variant (t2, attributes);
419 /* Simple way if one arg fails to specify argument types. */
420 if (TYPE_ARG_TYPES (t1) == 0)
422 t1 = build_function_type (valtype, TYPE_ARG_TYPES (t2));
423 t1 = build_type_attribute_variant (t1, attributes);
424 return qualify_type (t1, t2);
426 if (TYPE_ARG_TYPES (t2) == 0)
428 t1 = build_function_type (valtype, TYPE_ARG_TYPES (t1));
429 t1 = build_type_attribute_variant (t1, attributes);
430 return qualify_type (t1, t2);
433 /* If both args specify argument types, we must merge the two
434 lists, argument by argument. */
435 /* Tell global_bindings_p to return false so that variable_size
436 doesn't die on VLAs in parameter types. */
437 c_override_global_bindings_to_false = true;
439 len = list_length (p1);
442 for (i = 0; i < len; i++)
443 newargs = tree_cons (NULL_TREE, NULL_TREE, newargs);
448 p1 = TREE_CHAIN (p1), p2 = TREE_CHAIN (p2), n = TREE_CHAIN (n))
450 /* A null type means arg type is not specified.
451 Take whatever the other function type has. */
452 if (TREE_VALUE (p1) == 0)
454 TREE_VALUE (n) = TREE_VALUE (p2);
457 if (TREE_VALUE (p2) == 0)
459 TREE_VALUE (n) = TREE_VALUE (p1);
463 /* Given wait (union {union wait *u; int *i} *)
464 and wait (union wait *),
465 prefer union wait * as type of parm. */
466 if (TREE_CODE (TREE_VALUE (p1)) == UNION_TYPE
467 && TREE_VALUE (p1) != TREE_VALUE (p2))
470 tree mv2 = TREE_VALUE (p2);
471 if (mv2 && mv2 != error_mark_node
472 && TREE_CODE (mv2) != ARRAY_TYPE)
473 mv2 = TYPE_MAIN_VARIANT (mv2);
474 for (memb = TYPE_FIELDS (TREE_VALUE (p1));
475 memb; memb = TREE_CHAIN (memb))
477 tree mv3 = TREE_TYPE (memb);
478 if (mv3 && mv3 != error_mark_node
479 && TREE_CODE (mv3) != ARRAY_TYPE)
480 mv3 = TYPE_MAIN_VARIANT (mv3);
481 if (comptypes (mv3, mv2))
483 TREE_VALUE (n) = composite_type (TREE_TYPE (memb),
485 pedwarn (input_location, OPT_pedantic,
486 "function types not truly compatible in ISO C");
491 if (TREE_CODE (TREE_VALUE (p2)) == UNION_TYPE
492 && TREE_VALUE (p2) != TREE_VALUE (p1))
495 tree mv1 = TREE_VALUE (p1);
496 if (mv1 && mv1 != error_mark_node
497 && TREE_CODE (mv1) != ARRAY_TYPE)
498 mv1 = TYPE_MAIN_VARIANT (mv1);
499 for (memb = TYPE_FIELDS (TREE_VALUE (p2));
500 memb; memb = TREE_CHAIN (memb))
502 tree mv3 = TREE_TYPE (memb);
503 if (mv3 && mv3 != error_mark_node
504 && TREE_CODE (mv3) != ARRAY_TYPE)
505 mv3 = TYPE_MAIN_VARIANT (mv3);
506 if (comptypes (mv3, mv1))
508 TREE_VALUE (n) = composite_type (TREE_TYPE (memb),
510 pedwarn (input_location, OPT_pedantic,
511 "function types not truly compatible in ISO C");
516 TREE_VALUE (n) = composite_type (TREE_VALUE (p1), TREE_VALUE (p2));
520 c_override_global_bindings_to_false = false;
521 t1 = build_function_type (valtype, newargs);
522 t1 = qualify_type (t1, t2);
523 /* ... falls through ... */
527 return build_type_attribute_variant (t1, attributes);
532 /* Return the type of a conditional expression between pointers to
533 possibly differently qualified versions of compatible types.
535 We assume that comp_target_types has already been done and returned
536 nonzero; if that isn't so, this may crash. */
539 common_pointer_type (tree t1, tree t2)
542 tree pointed_to_1, mv1;
543 tree pointed_to_2, mv2;
545 unsigned target_quals;
547 /* Save time if the two types are the same. */
549 if (t1 == t2) return t1;
551 /* If one type is nonsense, use the other. */
552 if (t1 == error_mark_node)
554 if (t2 == error_mark_node)
557 gcc_assert (TREE_CODE (t1) == POINTER_TYPE
558 && TREE_CODE (t2) == POINTER_TYPE);
560 /* Merge the attributes. */
561 attributes = targetm.merge_type_attributes (t1, t2);
563 /* Find the composite type of the target types, and combine the
564 qualifiers of the two types' targets. Do not lose qualifiers on
565 array element types by taking the TYPE_MAIN_VARIANT. */
566 mv1 = pointed_to_1 = TREE_TYPE (t1);
567 mv2 = pointed_to_2 = TREE_TYPE (t2);
568 if (TREE_CODE (mv1) != ARRAY_TYPE)
569 mv1 = TYPE_MAIN_VARIANT (pointed_to_1);
570 if (TREE_CODE (mv2) != ARRAY_TYPE)
571 mv2 = TYPE_MAIN_VARIANT (pointed_to_2);
572 target = composite_type (mv1, mv2);
574 /* For function types do not merge const qualifiers, but drop them
575 if used inconsistently. The middle-end uses these to mark const
576 and noreturn functions. */
577 if (TREE_CODE (pointed_to_1) == FUNCTION_TYPE)
578 target_quals = TYPE_QUALS (pointed_to_1) & TYPE_QUALS (pointed_to_2);
580 target_quals = TYPE_QUALS (pointed_to_1) | TYPE_QUALS (pointed_to_2);
581 t1 = build_pointer_type (c_build_qualified_type (target, target_quals));
582 return build_type_attribute_variant (t1, attributes);
585 /* Return the common type for two arithmetic types under the usual
586 arithmetic conversions. The default conversions have already been
587 applied, and enumerated types converted to their compatible integer
588 types. The resulting type is unqualified and has no attributes.
590 This is the type for the result of most arithmetic operations
591 if the operands have the given two types. */
594 c_common_type (tree t1, tree t2)
596 enum tree_code code1;
597 enum tree_code code2;
599 /* If one type is nonsense, use the other. */
600 if (t1 == error_mark_node)
602 if (t2 == error_mark_node)
605 if (TYPE_QUALS (t1) != TYPE_UNQUALIFIED)
606 t1 = TYPE_MAIN_VARIANT (t1);
608 if (TYPE_QUALS (t2) != TYPE_UNQUALIFIED)
609 t2 = TYPE_MAIN_VARIANT (t2);
611 if (TYPE_ATTRIBUTES (t1) != NULL_TREE)
612 t1 = build_type_attribute_variant (t1, NULL_TREE);
614 if (TYPE_ATTRIBUTES (t2) != NULL_TREE)
615 t2 = build_type_attribute_variant (t2, NULL_TREE);
617 /* Save time if the two types are the same. */
619 if (t1 == t2) return t1;
621 code1 = TREE_CODE (t1);
622 code2 = TREE_CODE (t2);
624 gcc_assert (code1 == VECTOR_TYPE || code1 == COMPLEX_TYPE
625 || code1 == FIXED_POINT_TYPE || code1 == REAL_TYPE
626 || code1 == INTEGER_TYPE);
627 gcc_assert (code2 == VECTOR_TYPE || code2 == COMPLEX_TYPE
628 || code2 == FIXED_POINT_TYPE || code2 == REAL_TYPE
629 || code2 == INTEGER_TYPE);
631 /* When one operand is a decimal float type, the other operand cannot be
632 a generic float type or a complex type. We also disallow vector types
634 if ((DECIMAL_FLOAT_TYPE_P (t1) || DECIMAL_FLOAT_TYPE_P (t2))
635 && !(DECIMAL_FLOAT_TYPE_P (t1) && DECIMAL_FLOAT_TYPE_P (t2)))
637 if (code1 == VECTOR_TYPE || code2 == VECTOR_TYPE)
639 error ("can%'t mix operands of decimal float and vector types");
640 return error_mark_node;
642 if (code1 == COMPLEX_TYPE || code2 == COMPLEX_TYPE)
644 error ("can%'t mix operands of decimal float and complex types");
645 return error_mark_node;
647 if (code1 == REAL_TYPE && code2 == REAL_TYPE)
649 error ("can%'t mix operands of decimal float and other float types");
650 return error_mark_node;
654 /* If one type is a vector type, return that type. (How the usual
655 arithmetic conversions apply to the vector types extension is not
656 precisely specified.) */
657 if (code1 == VECTOR_TYPE)
660 if (code2 == VECTOR_TYPE)
663 /* If one type is complex, form the common type of the non-complex
664 components, then make that complex. Use T1 or T2 if it is the
666 if (code1 == COMPLEX_TYPE || code2 == COMPLEX_TYPE)
668 tree subtype1 = code1 == COMPLEX_TYPE ? TREE_TYPE (t1) : t1;
669 tree subtype2 = code2 == COMPLEX_TYPE ? TREE_TYPE (t2) : t2;
670 tree subtype = c_common_type (subtype1, subtype2);
672 if (code1 == COMPLEX_TYPE && TREE_TYPE (t1) == subtype)
674 else if (code2 == COMPLEX_TYPE && TREE_TYPE (t2) == subtype)
677 return build_complex_type (subtype);
680 /* If only one is real, use it as the result. */
682 if (code1 == REAL_TYPE && code2 != REAL_TYPE)
685 if (code2 == REAL_TYPE && code1 != REAL_TYPE)
688 /* If both are real and either are decimal floating point types, use
689 the decimal floating point type with the greater precision. */
691 if (code1 == REAL_TYPE && code2 == REAL_TYPE)
693 if (TYPE_MAIN_VARIANT (t1) == dfloat128_type_node
694 || TYPE_MAIN_VARIANT (t2) == dfloat128_type_node)
695 return dfloat128_type_node;
696 else if (TYPE_MAIN_VARIANT (t1) == dfloat64_type_node
697 || TYPE_MAIN_VARIANT (t2) == dfloat64_type_node)
698 return dfloat64_type_node;
699 else if (TYPE_MAIN_VARIANT (t1) == dfloat32_type_node
700 || TYPE_MAIN_VARIANT (t2) == dfloat32_type_node)
701 return dfloat32_type_node;
704 /* Deal with fixed-point types. */
705 if (code1 == FIXED_POINT_TYPE || code2 == FIXED_POINT_TYPE)
707 unsigned int unsignedp = 0, satp = 0;
708 enum machine_mode m1, m2;
709 unsigned int fbit1, ibit1, fbit2, ibit2, max_fbit, max_ibit;
714 /* If one input type is saturating, the result type is saturating. */
715 if (TYPE_SATURATING (t1) || TYPE_SATURATING (t2))
718 /* If both fixed-point types are unsigned, the result type is unsigned.
719 When mixing fixed-point and integer types, follow the sign of the
721 Otherwise, the result type is signed. */
722 if ((TYPE_UNSIGNED (t1) && TYPE_UNSIGNED (t2)
723 && code1 == FIXED_POINT_TYPE && code2 == FIXED_POINT_TYPE)
724 || (code1 == FIXED_POINT_TYPE && code2 != FIXED_POINT_TYPE
725 && TYPE_UNSIGNED (t1))
726 || (code1 != FIXED_POINT_TYPE && code2 == FIXED_POINT_TYPE
727 && TYPE_UNSIGNED (t2)))
730 /* The result type is signed. */
733 /* If the input type is unsigned, we need to convert to the
735 if (code1 == FIXED_POINT_TYPE && TYPE_UNSIGNED (t1))
737 enum mode_class mclass = (enum mode_class) 0;
738 if (GET_MODE_CLASS (m1) == MODE_UFRACT)
740 else if (GET_MODE_CLASS (m1) == MODE_UACCUM)
744 m1 = mode_for_size (GET_MODE_PRECISION (m1), mclass, 0);
746 if (code2 == FIXED_POINT_TYPE && TYPE_UNSIGNED (t2))
748 enum mode_class mclass = (enum mode_class) 0;
749 if (GET_MODE_CLASS (m2) == MODE_UFRACT)
751 else if (GET_MODE_CLASS (m2) == MODE_UACCUM)
755 m2 = mode_for_size (GET_MODE_PRECISION (m2), mclass, 0);
759 if (code1 == FIXED_POINT_TYPE)
761 fbit1 = GET_MODE_FBIT (m1);
762 ibit1 = GET_MODE_IBIT (m1);
767 /* Signed integers need to subtract one sign bit. */
768 ibit1 = TYPE_PRECISION (t1) - (!TYPE_UNSIGNED (t1));
771 if (code2 == FIXED_POINT_TYPE)
773 fbit2 = GET_MODE_FBIT (m2);
774 ibit2 = GET_MODE_IBIT (m2);
779 /* Signed integers need to subtract one sign bit. */
780 ibit2 = TYPE_PRECISION (t2) - (!TYPE_UNSIGNED (t2));
783 max_ibit = ibit1 >= ibit2 ? ibit1 : ibit2;
784 max_fbit = fbit1 >= fbit2 ? fbit1 : fbit2;
785 return c_common_fixed_point_type_for_size (max_ibit, max_fbit, unsignedp,
789 /* Both real or both integers; use the one with greater precision. */
791 if (TYPE_PRECISION (t1) > TYPE_PRECISION (t2))
793 else if (TYPE_PRECISION (t2) > TYPE_PRECISION (t1))
796 /* Same precision. Prefer long longs to longs to ints when the
797 same precision, following the C99 rules on integer type rank
798 (which are equivalent to the C90 rules for C90 types). */
800 if (TYPE_MAIN_VARIANT (t1) == long_long_unsigned_type_node
801 || TYPE_MAIN_VARIANT (t2) == long_long_unsigned_type_node)
802 return long_long_unsigned_type_node;
804 if (TYPE_MAIN_VARIANT (t1) == long_long_integer_type_node
805 || TYPE_MAIN_VARIANT (t2) == long_long_integer_type_node)
807 if (TYPE_UNSIGNED (t1) || TYPE_UNSIGNED (t2))
808 return long_long_unsigned_type_node;
810 return long_long_integer_type_node;
813 if (TYPE_MAIN_VARIANT (t1) == long_unsigned_type_node
814 || TYPE_MAIN_VARIANT (t2) == long_unsigned_type_node)
815 return long_unsigned_type_node;
817 if (TYPE_MAIN_VARIANT (t1) == long_integer_type_node
818 || TYPE_MAIN_VARIANT (t2) == long_integer_type_node)
820 /* But preserve unsignedness from the other type,
821 since long cannot hold all the values of an unsigned int. */
822 if (TYPE_UNSIGNED (t1) || TYPE_UNSIGNED (t2))
823 return long_unsigned_type_node;
825 return long_integer_type_node;
828 /* Likewise, prefer long double to double even if same size. */
829 if (TYPE_MAIN_VARIANT (t1) == long_double_type_node
830 || TYPE_MAIN_VARIANT (t2) == long_double_type_node)
831 return long_double_type_node;
833 /* Otherwise prefer the unsigned one. */
835 if (TYPE_UNSIGNED (t1))
841 /* Wrapper around c_common_type that is used by c-common.c and other
842 front end optimizations that remove promotions. ENUMERAL_TYPEs
843 are allowed here and are converted to their compatible integer types.
844 BOOLEAN_TYPEs are allowed here and return either boolean_type_node or
845 preferably a non-Boolean type as the common type. */
847 common_type (tree t1, tree t2)
849 if (TREE_CODE (t1) == ENUMERAL_TYPE)
850 t1 = c_common_type_for_size (TYPE_PRECISION (t1), 1);
851 if (TREE_CODE (t2) == ENUMERAL_TYPE)
852 t2 = c_common_type_for_size (TYPE_PRECISION (t2), 1);
854 /* If both types are BOOLEAN_TYPE, then return boolean_type_node. */
855 if (TREE_CODE (t1) == BOOLEAN_TYPE
856 && TREE_CODE (t2) == BOOLEAN_TYPE)
857 return boolean_type_node;
859 /* If either type is BOOLEAN_TYPE, then return the other. */
860 if (TREE_CODE (t1) == BOOLEAN_TYPE)
862 if (TREE_CODE (t2) == BOOLEAN_TYPE)
865 return c_common_type (t1, t2);
868 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
869 or various other operations. Return 2 if they are compatible
870 but a warning may be needed if you use them together. */
873 comptypes (tree type1, tree type2)
875 const struct tagged_tu_seen_cache * tagged_tu_seen_base1 = tagged_tu_seen_base;
878 val = comptypes_internal (type1, type2);
879 free_all_tagged_tu_seen_up_to (tagged_tu_seen_base1);
884 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
885 or various other operations. Return 2 if they are compatible
886 but a warning may be needed if you use them together. This
887 differs from comptypes, in that we don't free the seen types. */
890 comptypes_internal (const_tree type1, const_tree type2)
892 const_tree t1 = type1;
893 const_tree t2 = type2;
896 /* Suppress errors caused by previously reported errors. */
898 if (t1 == t2 || !t1 || !t2
899 || TREE_CODE (t1) == ERROR_MARK || TREE_CODE (t2) == ERROR_MARK)
902 /* If either type is the internal version of sizetype, return the
904 if (TREE_CODE (t1) == INTEGER_TYPE && TYPE_IS_SIZETYPE (t1)
905 && TYPE_ORIG_SIZE_TYPE (t1))
906 t1 = TYPE_ORIG_SIZE_TYPE (t1);
908 if (TREE_CODE (t2) == INTEGER_TYPE && TYPE_IS_SIZETYPE (t2)
909 && TYPE_ORIG_SIZE_TYPE (t2))
910 t2 = TYPE_ORIG_SIZE_TYPE (t2);
913 /* Enumerated types are compatible with integer types, but this is
914 not transitive: two enumerated types in the same translation unit
915 are compatible with each other only if they are the same type. */
917 if (TREE_CODE (t1) == ENUMERAL_TYPE && TREE_CODE (t2) != ENUMERAL_TYPE)
918 t1 = c_common_type_for_size (TYPE_PRECISION (t1), TYPE_UNSIGNED (t1));
919 else if (TREE_CODE (t2) == ENUMERAL_TYPE && TREE_CODE (t1) != ENUMERAL_TYPE)
920 t2 = c_common_type_for_size (TYPE_PRECISION (t2), TYPE_UNSIGNED (t2));
925 /* Different classes of types can't be compatible. */
927 if (TREE_CODE (t1) != TREE_CODE (t2))
930 /* Qualifiers must match. C99 6.7.3p9 */
932 if (TYPE_QUALS (t1) != TYPE_QUALS (t2))
935 /* Allow for two different type nodes which have essentially the same
936 definition. Note that we already checked for equality of the type
937 qualifiers (just above). */
939 if (TREE_CODE (t1) != ARRAY_TYPE
940 && TYPE_MAIN_VARIANT (t1) == TYPE_MAIN_VARIANT (t2))
943 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
944 if (!(attrval = targetm.comp_type_attributes (t1, t2)))
947 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
950 switch (TREE_CODE (t1))
953 /* Do not remove mode or aliasing information. */
954 if (TYPE_MODE (t1) != TYPE_MODE (t2)
955 || TYPE_REF_CAN_ALIAS_ALL (t1) != TYPE_REF_CAN_ALIAS_ALL (t2))
957 val = (TREE_TYPE (t1) == TREE_TYPE (t2)
958 ? 1 : comptypes_internal (TREE_TYPE (t1), TREE_TYPE (t2)));
962 val = function_types_compatible_p (t1, t2);
967 tree d1 = TYPE_DOMAIN (t1);
968 tree d2 = TYPE_DOMAIN (t2);
969 bool d1_variable, d2_variable;
970 bool d1_zero, d2_zero;
973 /* Target types must match incl. qualifiers. */
974 if (TREE_TYPE (t1) != TREE_TYPE (t2)
975 && 0 == (val = comptypes_internal (TREE_TYPE (t1), TREE_TYPE (t2))))
978 /* Sizes must match unless one is missing or variable. */
979 if (d1 == 0 || d2 == 0 || d1 == d2)
982 d1_zero = !TYPE_MAX_VALUE (d1);
983 d2_zero = !TYPE_MAX_VALUE (d2);
985 d1_variable = (!d1_zero
986 && (TREE_CODE (TYPE_MIN_VALUE (d1)) != INTEGER_CST
987 || TREE_CODE (TYPE_MAX_VALUE (d1)) != INTEGER_CST));
988 d2_variable = (!d2_zero
989 && (TREE_CODE (TYPE_MIN_VALUE (d2)) != INTEGER_CST
990 || TREE_CODE (TYPE_MAX_VALUE (d2)) != INTEGER_CST));
991 d1_variable = d1_variable || (d1_zero && c_vla_type_p (t1));
992 d2_variable = d2_variable || (d2_zero && c_vla_type_p (t2));
994 if (d1_variable || d2_variable)
996 if (d1_zero && d2_zero)
998 if (d1_zero || d2_zero
999 || !tree_int_cst_equal (TYPE_MIN_VALUE (d1), TYPE_MIN_VALUE (d2))
1000 || !tree_int_cst_equal (TYPE_MAX_VALUE (d1), TYPE_MAX_VALUE (d2)))
1009 if (val != 1 && !same_translation_unit_p (t1, t2))
1011 tree a1 = TYPE_ATTRIBUTES (t1);
1012 tree a2 = TYPE_ATTRIBUTES (t2);
1014 if (! attribute_list_contained (a1, a2)
1015 && ! attribute_list_contained (a2, a1))
1019 return tagged_types_tu_compatible_p (t1, t2);
1020 val = tagged_types_tu_compatible_p (t1, t2);
1025 val = TYPE_VECTOR_SUBPARTS (t1) == TYPE_VECTOR_SUBPARTS (t2)
1026 && comptypes_internal (TREE_TYPE (t1), TREE_TYPE (t2));
1032 return attrval == 2 && val == 1 ? 2 : val;
1035 /* Return 1 if TTL and TTR are pointers to types that are equivalent,
1036 ignoring their qualifiers. */
1039 comp_target_types (tree ttl, tree ttr)
1044 /* Do not lose qualifiers on element types of array types that are
1045 pointer targets by taking their TYPE_MAIN_VARIANT. */
1046 mvl = TREE_TYPE (ttl);
1047 mvr = TREE_TYPE (ttr);
1048 if (TREE_CODE (mvl) != ARRAY_TYPE)
1049 mvl = TYPE_MAIN_VARIANT (mvl);
1050 if (TREE_CODE (mvr) != ARRAY_TYPE)
1051 mvr = TYPE_MAIN_VARIANT (mvr);
1052 val = comptypes (mvl, mvr);
1055 pedwarn (input_location, OPT_pedantic, "types are not quite compatible");
1059 /* Subroutines of `comptypes'. */
1061 /* Determine whether two trees derive from the same translation unit.
1062 If the CONTEXT chain ends in a null, that tree's context is still
1063 being parsed, so if two trees have context chains ending in null,
1064 they're in the same translation unit. */
1066 same_translation_unit_p (const_tree t1, const_tree t2)
1068 while (t1 && TREE_CODE (t1) != TRANSLATION_UNIT_DECL)
1069 switch (TREE_CODE_CLASS (TREE_CODE (t1)))
1071 case tcc_declaration:
1072 t1 = DECL_CONTEXT (t1); break;
1074 t1 = TYPE_CONTEXT (t1); break;
1075 case tcc_exceptional:
1076 t1 = BLOCK_SUPERCONTEXT (t1); break; /* assume block */
1077 default: gcc_unreachable ();
1080 while (t2 && TREE_CODE (t2) != TRANSLATION_UNIT_DECL)
1081 switch (TREE_CODE_CLASS (TREE_CODE (t2)))
1083 case tcc_declaration:
1084 t2 = DECL_CONTEXT (t2); break;
1086 t2 = TYPE_CONTEXT (t2); break;
1087 case tcc_exceptional:
1088 t2 = BLOCK_SUPERCONTEXT (t2); break; /* assume block */
1089 default: gcc_unreachable ();
1095 /* Allocate the seen two types, assuming that they are compatible. */
1097 static struct tagged_tu_seen_cache *
1098 alloc_tagged_tu_seen_cache (const_tree t1, const_tree t2)
1100 struct tagged_tu_seen_cache *tu = XNEW (struct tagged_tu_seen_cache);
1101 tu->next = tagged_tu_seen_base;
1105 tagged_tu_seen_base = tu;
1107 /* The C standard says that two structures in different translation
1108 units are compatible with each other only if the types of their
1109 fields are compatible (among other things). We assume that they
1110 are compatible until proven otherwise when building the cache.
1111 An example where this can occur is:
1116 If we are comparing this against a similar struct in another TU,
1117 and did not assume they were compatible, we end up with an infinite
1123 /* Free the seen types until we get to TU_TIL. */
1126 free_all_tagged_tu_seen_up_to (const struct tagged_tu_seen_cache *tu_til)
1128 const struct tagged_tu_seen_cache *tu = tagged_tu_seen_base;
1129 while (tu != tu_til)
1131 const struct tagged_tu_seen_cache *const tu1
1132 = (const struct tagged_tu_seen_cache *) tu;
1134 free (CONST_CAST (struct tagged_tu_seen_cache *, tu1));
1136 tagged_tu_seen_base = tu_til;
1139 /* Return 1 if two 'struct', 'union', or 'enum' types T1 and T2 are
1140 compatible. If the two types are not the same (which has been
1141 checked earlier), this can only happen when multiple translation
1142 units are being compiled. See C99 6.2.7 paragraph 1 for the exact
1146 tagged_types_tu_compatible_p (const_tree t1, const_tree t2)
1149 bool needs_warning = false;
1151 /* We have to verify that the tags of the types are the same. This
1152 is harder than it looks because this may be a typedef, so we have
1153 to go look at the original type. It may even be a typedef of a
1155 In the case of compiler-created builtin structs the TYPE_DECL
1156 may be a dummy, with no DECL_ORIGINAL_TYPE. Don't fault. */
1157 while (TYPE_NAME (t1)
1158 && TREE_CODE (TYPE_NAME (t1)) == TYPE_DECL
1159 && DECL_ORIGINAL_TYPE (TYPE_NAME (t1)))
1160 t1 = DECL_ORIGINAL_TYPE (TYPE_NAME (t1));
1162 while (TYPE_NAME (t2)
1163 && TREE_CODE (TYPE_NAME (t2)) == TYPE_DECL
1164 && DECL_ORIGINAL_TYPE (TYPE_NAME (t2)))
1165 t2 = DECL_ORIGINAL_TYPE (TYPE_NAME (t2));
1167 /* C90 didn't have the requirement that the two tags be the same. */
1168 if (flag_isoc99 && TYPE_NAME (t1) != TYPE_NAME (t2))
1171 /* C90 didn't say what happened if one or both of the types were
1172 incomplete; we choose to follow C99 rules here, which is that they
1174 if (TYPE_SIZE (t1) == NULL
1175 || TYPE_SIZE (t2) == NULL)
1179 const struct tagged_tu_seen_cache * tts_i;
1180 for (tts_i = tagged_tu_seen_base; tts_i != NULL; tts_i = tts_i->next)
1181 if (tts_i->t1 == t1 && tts_i->t2 == t2)
1185 switch (TREE_CODE (t1))
1189 struct tagged_tu_seen_cache *tu = alloc_tagged_tu_seen_cache (t1, t2);
1190 /* Speed up the case where the type values are in the same order. */
1191 tree tv1 = TYPE_VALUES (t1);
1192 tree tv2 = TYPE_VALUES (t2);
1199 for (;tv1 && tv2; tv1 = TREE_CHAIN (tv1), tv2 = TREE_CHAIN (tv2))
1201 if (TREE_PURPOSE (tv1) != TREE_PURPOSE (tv2))
1203 if (simple_cst_equal (TREE_VALUE (tv1), TREE_VALUE (tv2)) != 1)
1210 if (tv1 == NULL_TREE && tv2 == NULL_TREE)
1214 if (tv1 == NULL_TREE || tv2 == NULL_TREE)
1220 if (list_length (TYPE_VALUES (t1)) != list_length (TYPE_VALUES (t2)))
1226 for (s1 = TYPE_VALUES (t1); s1; s1 = TREE_CHAIN (s1))
1228 s2 = purpose_member (TREE_PURPOSE (s1), TYPE_VALUES (t2));
1230 || simple_cst_equal (TREE_VALUE (s1), TREE_VALUE (s2)) != 1)
1241 struct tagged_tu_seen_cache *tu = alloc_tagged_tu_seen_cache (t1, t2);
1242 if (list_length (TYPE_FIELDS (t1)) != list_length (TYPE_FIELDS (t2)))
1248 /* Speed up the common case where the fields are in the same order. */
1249 for (s1 = TYPE_FIELDS (t1), s2 = TYPE_FIELDS (t2); s1 && s2;
1250 s1 = TREE_CHAIN (s1), s2 = TREE_CHAIN (s2))
1254 if (DECL_NAME (s1) != DECL_NAME (s2))
1256 result = comptypes_internal (TREE_TYPE (s1), TREE_TYPE (s2));
1258 if (result != 1 && !DECL_NAME (s1))
1266 needs_warning = true;
1268 if (TREE_CODE (s1) == FIELD_DECL
1269 && simple_cst_equal (DECL_FIELD_BIT_OFFSET (s1),
1270 DECL_FIELD_BIT_OFFSET (s2)) != 1)
1278 tu->val = needs_warning ? 2 : 1;
1282 for (s1 = TYPE_FIELDS (t1); s1; s1 = TREE_CHAIN (s1))
1286 for (s2 = TYPE_FIELDS (t2); s2; s2 = TREE_CHAIN (s2))
1287 if (DECL_NAME (s1) == DECL_NAME (s2))
1291 result = comptypes_internal (TREE_TYPE (s1), TREE_TYPE (s2));
1293 if (result != 1 && !DECL_NAME (s1))
1301 needs_warning = true;
1303 if (TREE_CODE (s1) == FIELD_DECL
1304 && simple_cst_equal (DECL_FIELD_BIT_OFFSET (s1),
1305 DECL_FIELD_BIT_OFFSET (s2)) != 1)
1317 tu->val = needs_warning ? 2 : 10;
1323 struct tagged_tu_seen_cache *tu = alloc_tagged_tu_seen_cache (t1, t2);
1325 for (s1 = TYPE_FIELDS (t1), s2 = TYPE_FIELDS (t2);
1327 s1 = TREE_CHAIN (s1), s2 = TREE_CHAIN (s2))
1330 if (TREE_CODE (s1) != TREE_CODE (s2)
1331 || DECL_NAME (s1) != DECL_NAME (s2))
1333 result = comptypes_internal (TREE_TYPE (s1), TREE_TYPE (s2));
1337 needs_warning = true;
1339 if (TREE_CODE (s1) == FIELD_DECL
1340 && simple_cst_equal (DECL_FIELD_BIT_OFFSET (s1),
1341 DECL_FIELD_BIT_OFFSET (s2)) != 1)
1347 tu->val = needs_warning ? 2 : 1;
1356 /* Return 1 if two function types F1 and F2 are compatible.
1357 If either type specifies no argument types,
1358 the other must specify a fixed number of self-promoting arg types.
1359 Otherwise, if one type specifies only the number of arguments,
1360 the other must specify that number of self-promoting arg types.
1361 Otherwise, the argument types must match. */
1364 function_types_compatible_p (const_tree f1, const_tree f2)
1367 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1372 ret1 = TREE_TYPE (f1);
1373 ret2 = TREE_TYPE (f2);
1375 /* 'volatile' qualifiers on a function's return type used to mean
1376 the function is noreturn. */
1377 if (TYPE_VOLATILE (ret1) != TYPE_VOLATILE (ret2))
1378 pedwarn (input_location, 0, "function return types not compatible due to %<volatile%>");
1379 if (TYPE_VOLATILE (ret1))
1380 ret1 = build_qualified_type (TYPE_MAIN_VARIANT (ret1),
1381 TYPE_QUALS (ret1) & ~TYPE_QUAL_VOLATILE);
1382 if (TYPE_VOLATILE (ret2))
1383 ret2 = build_qualified_type (TYPE_MAIN_VARIANT (ret2),
1384 TYPE_QUALS (ret2) & ~TYPE_QUAL_VOLATILE);
1385 val = comptypes_internal (ret1, ret2);
1389 args1 = TYPE_ARG_TYPES (f1);
1390 args2 = TYPE_ARG_TYPES (f2);
1392 /* An unspecified parmlist matches any specified parmlist
1393 whose argument types don't need default promotions. */
1397 if (!self_promoting_args_p (args2))
1399 /* If one of these types comes from a non-prototype fn definition,
1400 compare that with the other type's arglist.
1401 If they don't match, ask for a warning (but no error). */
1402 if (TYPE_ACTUAL_ARG_TYPES (f1)
1403 && 1 != type_lists_compatible_p (args2, TYPE_ACTUAL_ARG_TYPES (f1)))
1409 if (!self_promoting_args_p (args1))
1411 if (TYPE_ACTUAL_ARG_TYPES (f2)
1412 && 1 != type_lists_compatible_p (args1, TYPE_ACTUAL_ARG_TYPES (f2)))
1417 /* Both types have argument lists: compare them and propagate results. */
1418 val1 = type_lists_compatible_p (args1, args2);
1419 return val1 != 1 ? val1 : val;
1422 /* Check two lists of types for compatibility,
1423 returning 0 for incompatible, 1 for compatible,
1424 or 2 for compatible with warning. */
1427 type_lists_compatible_p (const_tree args1, const_tree args2)
1429 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1435 tree a1, mv1, a2, mv2;
1436 if (args1 == 0 && args2 == 0)
1438 /* If one list is shorter than the other,
1439 they fail to match. */
1440 if (args1 == 0 || args2 == 0)
1442 mv1 = a1 = TREE_VALUE (args1);
1443 mv2 = a2 = TREE_VALUE (args2);
1444 if (mv1 && mv1 != error_mark_node && TREE_CODE (mv1) != ARRAY_TYPE)
1445 mv1 = TYPE_MAIN_VARIANT (mv1);
1446 if (mv2 && mv2 != error_mark_node && TREE_CODE (mv2) != ARRAY_TYPE)
1447 mv2 = TYPE_MAIN_VARIANT (mv2);
1448 /* A null pointer instead of a type
1449 means there is supposed to be an argument
1450 but nothing is specified about what type it has.
1451 So match anything that self-promotes. */
1454 if (c_type_promotes_to (a2) != a2)
1459 if (c_type_promotes_to (a1) != a1)
1462 /* If one of the lists has an error marker, ignore this arg. */
1463 else if (TREE_CODE (a1) == ERROR_MARK
1464 || TREE_CODE (a2) == ERROR_MARK)
1466 else if (!(newval = comptypes_internal (mv1, mv2)))
1468 /* Allow wait (union {union wait *u; int *i} *)
1469 and wait (union wait *) to be compatible. */
1470 if (TREE_CODE (a1) == UNION_TYPE
1471 && (TYPE_NAME (a1) == 0
1472 || TYPE_TRANSPARENT_UNION (a1))
1473 && TREE_CODE (TYPE_SIZE (a1)) == INTEGER_CST
1474 && tree_int_cst_equal (TYPE_SIZE (a1),
1478 for (memb = TYPE_FIELDS (a1);
1479 memb; memb = TREE_CHAIN (memb))
1481 tree mv3 = TREE_TYPE (memb);
1482 if (mv3 && mv3 != error_mark_node
1483 && TREE_CODE (mv3) != ARRAY_TYPE)
1484 mv3 = TYPE_MAIN_VARIANT (mv3);
1485 if (comptypes_internal (mv3, mv2))
1491 else if (TREE_CODE (a2) == UNION_TYPE
1492 && (TYPE_NAME (a2) == 0
1493 || TYPE_TRANSPARENT_UNION (a2))
1494 && TREE_CODE (TYPE_SIZE (a2)) == INTEGER_CST
1495 && tree_int_cst_equal (TYPE_SIZE (a2),
1499 for (memb = TYPE_FIELDS (a2);
1500 memb; memb = TREE_CHAIN (memb))
1502 tree mv3 = TREE_TYPE (memb);
1503 if (mv3 && mv3 != error_mark_node
1504 && TREE_CODE (mv3) != ARRAY_TYPE)
1505 mv3 = TYPE_MAIN_VARIANT (mv3);
1506 if (comptypes_internal (mv3, mv1))
1516 /* comptypes said ok, but record if it said to warn. */
1520 args1 = TREE_CHAIN (args1);
1521 args2 = TREE_CHAIN (args2);
1525 /* Compute the size to increment a pointer by. */
1528 c_size_in_bytes (const_tree type)
1530 enum tree_code code = TREE_CODE (type);
1532 if (code == FUNCTION_TYPE || code == VOID_TYPE || code == ERROR_MARK)
1533 return size_one_node;
1535 if (!COMPLETE_OR_VOID_TYPE_P (type))
1537 error ("arithmetic on pointer to an incomplete type");
1538 return size_one_node;
1541 /* Convert in case a char is more than one unit. */
1542 return size_binop (CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type),
1543 size_int (TYPE_PRECISION (char_type_node)
1547 /* Return either DECL or its known constant value (if it has one). */
1550 decl_constant_value (tree decl)
1552 if (/* Don't change a variable array bound or initial value to a constant
1553 in a place where a variable is invalid. Note that DECL_INITIAL
1554 isn't valid for a PARM_DECL. */
1555 current_function_decl != 0
1556 && TREE_CODE (decl) != PARM_DECL
1557 && !TREE_THIS_VOLATILE (decl)
1558 && TREE_READONLY (decl)
1559 && DECL_INITIAL (decl) != 0
1560 && TREE_CODE (DECL_INITIAL (decl)) != ERROR_MARK
1561 /* This is invalid if initial value is not constant.
1562 If it has either a function call, a memory reference,
1563 or a variable, then re-evaluating it could give different results. */
1564 && TREE_CONSTANT (DECL_INITIAL (decl))
1565 /* Check for cases where this is sub-optimal, even though valid. */
1566 && TREE_CODE (DECL_INITIAL (decl)) != CONSTRUCTOR)
1567 return DECL_INITIAL (decl);
1571 /* Return either DECL or its known constant value (if it has one), but
1572 return DECL if pedantic or DECL has mode BLKmode. This is for
1573 bug-compatibility with the old behavior of decl_constant_value
1574 (before GCC 3.0); every use of this function is a bug and it should
1575 be removed before GCC 3.1. It is not appropriate to use pedantic
1576 in a way that affects optimization, and BLKmode is probably not the
1577 right test for avoiding misoptimizations either. */
1580 decl_constant_value_for_broken_optimization (tree decl)
1584 if (pedantic || DECL_MODE (decl) == BLKmode)
1587 ret = decl_constant_value (decl);
1588 /* Avoid unwanted tree sharing between the initializer and current
1589 function's body where the tree can be modified e.g. by the
1591 if (ret != decl && TREE_STATIC (decl))
1592 ret = unshare_expr (ret);
1596 /* Convert the array expression EXP to a pointer. */
1598 array_to_pointer_conversion (tree exp)
1600 tree orig_exp = exp;
1601 tree type = TREE_TYPE (exp);
1603 tree restype = TREE_TYPE (type);
1606 gcc_assert (TREE_CODE (type) == ARRAY_TYPE);
1608 STRIP_TYPE_NOPS (exp);
1610 if (TREE_NO_WARNING (orig_exp))
1611 TREE_NO_WARNING (exp) = 1;
1613 ptrtype = build_pointer_type (restype);
1615 if (TREE_CODE (exp) == INDIRECT_REF)
1616 return convert (ptrtype, TREE_OPERAND (exp, 0));
1618 if (TREE_CODE (exp) == VAR_DECL)
1620 /* We are making an ADDR_EXPR of ptrtype. This is a valid
1621 ADDR_EXPR because it's the best way of representing what
1622 happens in C when we take the address of an array and place
1623 it in a pointer to the element type. */
1624 adr = build1 (ADDR_EXPR, ptrtype, exp);
1625 if (!c_mark_addressable (exp))
1626 return error_mark_node;
1627 TREE_SIDE_EFFECTS (adr) = 0; /* Default would be, same as EXP. */
1631 /* This way is better for a COMPONENT_REF since it can
1632 simplify the offset for a component. */
1633 adr = build_unary_op (EXPR_LOCATION (exp), ADDR_EXPR, exp, 1);
1634 return convert (ptrtype, adr);
1637 /* Convert the function expression EXP to a pointer. */
1639 function_to_pointer_conversion (tree exp)
1641 tree orig_exp = exp;
1643 gcc_assert (TREE_CODE (TREE_TYPE (exp)) == FUNCTION_TYPE);
1645 STRIP_TYPE_NOPS (exp);
1647 if (TREE_NO_WARNING (orig_exp))
1648 TREE_NO_WARNING (exp) = 1;
1650 return build_unary_op (EXPR_LOCATION (exp), ADDR_EXPR, exp, 0);
1653 /* Perform the default conversion of arrays and functions to pointers.
1654 Return the result of converting EXP. For any other expression, just
1655 return EXP after removing NOPs. */
1658 default_function_array_conversion (struct c_expr exp)
1660 tree orig_exp = exp.value;
1661 tree type = TREE_TYPE (exp.value);
1662 enum tree_code code = TREE_CODE (type);
1668 bool not_lvalue = false;
1669 bool lvalue_array_p;
1671 while ((TREE_CODE (exp.value) == NON_LVALUE_EXPR
1672 || CONVERT_EXPR_P (exp.value))
1673 && TREE_TYPE (TREE_OPERAND (exp.value, 0)) == type)
1675 if (TREE_CODE (exp.value) == NON_LVALUE_EXPR)
1677 exp.value = TREE_OPERAND (exp.value, 0);
1680 if (TREE_NO_WARNING (orig_exp))
1681 TREE_NO_WARNING (exp.value) = 1;
1683 lvalue_array_p = !not_lvalue && lvalue_p (exp.value);
1684 if (!flag_isoc99 && !lvalue_array_p)
1686 /* Before C99, non-lvalue arrays do not decay to pointers.
1687 Normally, using such an array would be invalid; but it can
1688 be used correctly inside sizeof or as a statement expression.
1689 Thus, do not give an error here; an error will result later. */
1693 exp.value = array_to_pointer_conversion (exp.value);
1697 exp.value = function_to_pointer_conversion (exp.value);
1700 STRIP_TYPE_NOPS (exp.value);
1701 if (TREE_NO_WARNING (orig_exp))
1702 TREE_NO_WARNING (exp.value) = 1;
1710 /* EXP is an expression of integer type. Apply the integer promotions
1711 to it and return the promoted value. */
1714 perform_integral_promotions (tree exp)
1716 tree type = TREE_TYPE (exp);
1717 enum tree_code code = TREE_CODE (type);
1719 gcc_assert (INTEGRAL_TYPE_P (type));
1721 /* Normally convert enums to int,
1722 but convert wide enums to something wider. */
1723 if (code == ENUMERAL_TYPE)
1725 type = c_common_type_for_size (MAX (TYPE_PRECISION (type),
1726 TYPE_PRECISION (integer_type_node)),
1727 ((TYPE_PRECISION (type)
1728 >= TYPE_PRECISION (integer_type_node))
1729 && TYPE_UNSIGNED (type)));
1731 return convert (type, exp);
1734 /* ??? This should no longer be needed now bit-fields have their
1736 if (TREE_CODE (exp) == COMPONENT_REF
1737 && DECL_C_BIT_FIELD (TREE_OPERAND (exp, 1))
1738 /* If it's thinner than an int, promote it like a
1739 c_promoting_integer_type_p, otherwise leave it alone. */
1740 && 0 > compare_tree_int (DECL_SIZE (TREE_OPERAND (exp, 1)),
1741 TYPE_PRECISION (integer_type_node)))
1742 return convert (integer_type_node, exp);
1744 if (c_promoting_integer_type_p (type))
1746 /* Preserve unsignedness if not really getting any wider. */
1747 if (TYPE_UNSIGNED (type)
1748 && TYPE_PRECISION (type) == TYPE_PRECISION (integer_type_node))
1749 return convert (unsigned_type_node, exp);
1751 return convert (integer_type_node, exp);
1758 /* Perform default promotions for C data used in expressions.
1759 Enumeral types or short or char are converted to int.
1760 In addition, manifest constants symbols are replaced by their values. */
1763 default_conversion (tree exp)
1766 tree type = TREE_TYPE (exp);
1767 enum tree_code code = TREE_CODE (type);
1769 /* Functions and arrays have been converted during parsing. */
1770 gcc_assert (code != FUNCTION_TYPE);
1771 if (code == ARRAY_TYPE)
1774 /* Constants can be used directly unless they're not loadable. */
1775 if (TREE_CODE (exp) == CONST_DECL)
1776 exp = DECL_INITIAL (exp);
1778 /* Replace a nonvolatile const static variable with its value unless
1779 it is an array, in which case we must be sure that taking the
1780 address of the array produces consistent results. */
1781 else if (optimize && TREE_CODE (exp) == VAR_DECL && code != ARRAY_TYPE)
1783 exp = decl_constant_value_for_broken_optimization (exp);
1784 type = TREE_TYPE (exp);
1787 /* Strip no-op conversions. */
1789 STRIP_TYPE_NOPS (exp);
1791 if (TREE_NO_WARNING (orig_exp))
1792 TREE_NO_WARNING (exp) = 1;
1794 if (code == VOID_TYPE)
1796 error ("void value not ignored as it ought to be");
1797 return error_mark_node;
1800 exp = require_complete_type (exp);
1801 if (exp == error_mark_node)
1802 return error_mark_node;
1804 if (INTEGRAL_TYPE_P (type))
1805 return perform_integral_promotions (exp);
1810 /* Look up COMPONENT in a structure or union DECL.
1812 If the component name is not found, returns NULL_TREE. Otherwise,
1813 the return value is a TREE_LIST, with each TREE_VALUE a FIELD_DECL
1814 stepping down the chain to the component, which is in the last
1815 TREE_VALUE of the list. Normally the list is of length one, but if
1816 the component is embedded within (nested) anonymous structures or
1817 unions, the list steps down the chain to the component. */
1820 lookup_field (tree decl, tree component)
1822 tree type = TREE_TYPE (decl);
1825 /* If TYPE_LANG_SPECIFIC is set, then it is a sorted array of pointers
1826 to the field elements. Use a binary search on this array to quickly
1827 find the element. Otherwise, do a linear search. TYPE_LANG_SPECIFIC
1828 will always be set for structures which have many elements. */
1830 if (TYPE_LANG_SPECIFIC (type) && TYPE_LANG_SPECIFIC (type)->s)
1833 tree *field_array = &TYPE_LANG_SPECIFIC (type)->s->elts[0];
1835 field = TYPE_FIELDS (type);
1837 top = TYPE_LANG_SPECIFIC (type)->s->len;
1838 while (top - bot > 1)
1840 half = (top - bot + 1) >> 1;
1841 field = field_array[bot+half];
1843 if (DECL_NAME (field) == NULL_TREE)
1845 /* Step through all anon unions in linear fashion. */
1846 while (DECL_NAME (field_array[bot]) == NULL_TREE)
1848 field = field_array[bot++];
1849 if (TREE_CODE (TREE_TYPE (field)) == RECORD_TYPE
1850 || TREE_CODE (TREE_TYPE (field)) == UNION_TYPE)
1852 tree anon = lookup_field (field, component);
1855 return tree_cons (NULL_TREE, field, anon);
1859 /* Entire record is only anon unions. */
1863 /* Restart the binary search, with new lower bound. */
1867 if (DECL_NAME (field) == component)
1869 if (DECL_NAME (field) < component)
1875 if (DECL_NAME (field_array[bot]) == component)
1876 field = field_array[bot];
1877 else if (DECL_NAME (field) != component)
1882 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
1884 if (DECL_NAME (field) == NULL_TREE
1885 && (TREE_CODE (TREE_TYPE (field)) == RECORD_TYPE
1886 || TREE_CODE (TREE_TYPE (field)) == UNION_TYPE))
1888 tree anon = lookup_field (field, component);
1891 return tree_cons (NULL_TREE, field, anon);
1894 if (DECL_NAME (field) == component)
1898 if (field == NULL_TREE)
1902 return tree_cons (NULL_TREE, field, NULL_TREE);
1905 /* Make an expression to refer to the COMPONENT field of
1906 structure or union value DATUM. COMPONENT is an IDENTIFIER_NODE. */
1909 build_component_ref (tree datum, tree component)
1911 tree type = TREE_TYPE (datum);
1912 enum tree_code code = TREE_CODE (type);
1916 if (!objc_is_public (datum, component))
1917 return error_mark_node;
1919 /* See if there is a field or component with name COMPONENT. */
1921 if (code == RECORD_TYPE || code == UNION_TYPE)
1923 if (!COMPLETE_TYPE_P (type))
1925 c_incomplete_type_error (NULL_TREE, type);
1926 return error_mark_node;
1929 field = lookup_field (datum, component);
1933 error ("%qT has no member named %qE", type, component);
1934 return error_mark_node;
1937 /* Chain the COMPONENT_REFs if necessary down to the FIELD.
1938 This might be better solved in future the way the C++ front
1939 end does it - by giving the anonymous entities each a
1940 separate name and type, and then have build_component_ref
1941 recursively call itself. We can't do that here. */
1944 tree subdatum = TREE_VALUE (field);
1948 if (TREE_TYPE (subdatum) == error_mark_node)
1949 return error_mark_node;
1951 quals = TYPE_QUALS (strip_array_types (TREE_TYPE (subdatum)));
1952 quals |= TYPE_QUALS (TREE_TYPE (datum));
1953 subtype = c_build_qualified_type (TREE_TYPE (subdatum), quals);
1955 ref = build3 (COMPONENT_REF, subtype, datum, subdatum,
1957 if (TREE_READONLY (datum) || TREE_READONLY (subdatum))
1958 TREE_READONLY (ref) = 1;
1959 if (TREE_THIS_VOLATILE (datum) || TREE_THIS_VOLATILE (subdatum))
1960 TREE_THIS_VOLATILE (ref) = 1;
1962 if (TREE_DEPRECATED (subdatum))
1963 warn_deprecated_use (subdatum);
1967 field = TREE_CHAIN (field);
1973 else if (code != ERROR_MARK)
1974 error ("request for member %qE in something not a structure or union",
1977 return error_mark_node;
1980 /* Given an expression PTR for a pointer, return an expression
1981 for the value pointed to.
1982 ERRORSTRING is the name of the operator to appear in error messages.
1984 LOC is the location to use for the generated tree. */
1987 build_indirect_ref (location_t loc, tree ptr, const char *errorstring)
1989 tree pointer = default_conversion (ptr);
1990 tree type = TREE_TYPE (pointer);
1993 if (TREE_CODE (type) == POINTER_TYPE)
1995 if (CONVERT_EXPR_P (pointer)
1996 || TREE_CODE (pointer) == VIEW_CONVERT_EXPR)
1998 /* If a warning is issued, mark it to avoid duplicates from
1999 the backend. This only needs to be done at
2000 warn_strict_aliasing > 2. */
2001 if (warn_strict_aliasing > 2)
2002 if (strict_aliasing_warning (TREE_TYPE (TREE_OPERAND (pointer, 0)),
2003 type, TREE_OPERAND (pointer, 0)))
2004 TREE_NO_WARNING (pointer) = 1;
2007 if (TREE_CODE (pointer) == ADDR_EXPR
2008 && (TREE_TYPE (TREE_OPERAND (pointer, 0))
2009 == TREE_TYPE (type)))
2011 ref = TREE_OPERAND (pointer, 0);
2012 protected_set_expr_location (ref, loc);
2017 tree t = TREE_TYPE (type);
2019 ref = build1 (INDIRECT_REF, t, pointer);
2021 if (!COMPLETE_OR_VOID_TYPE_P (t) && TREE_CODE (t) != ARRAY_TYPE)
2023 error_at (loc, "dereferencing pointer to incomplete type");
2024 return error_mark_node;
2026 if (VOID_TYPE_P (t) && skip_evaluation == 0)
2027 warning_at (loc, 0, "dereferencing %<void *%> pointer");
2029 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
2030 so that we get the proper error message if the result is used
2031 to assign to. Also, &* is supposed to be a no-op.
2032 And ANSI C seems to specify that the type of the result
2033 should be the const type. */
2034 /* A de-reference of a pointer to const is not a const. It is valid
2035 to change it via some other pointer. */
2036 TREE_READONLY (ref) = TYPE_READONLY (t);
2037 TREE_SIDE_EFFECTS (ref)
2038 = TYPE_VOLATILE (t) || TREE_SIDE_EFFECTS (pointer);
2039 TREE_THIS_VOLATILE (ref) = TYPE_VOLATILE (t);
2040 protected_set_expr_location (ref, loc);
2044 else if (TREE_CODE (pointer) != ERROR_MARK)
2046 "invalid type argument of %qs (have %qT)", errorstring, type);
2047 return error_mark_node;
2050 /* This handles expressions of the form "a[i]", which denotes
2053 This is logically equivalent in C to *(a+i), but we may do it differently.
2054 If A is a variable or a member, we generate a primitive ARRAY_REF.
2055 This avoids forcing the array out of registers, and can work on
2056 arrays that are not lvalues (for example, members of structures returned
2059 LOC is the location to use for the returned expression. */
2062 build_array_ref (tree array, tree index, location_t loc)
2065 bool swapped = false;
2066 if (TREE_TYPE (array) == error_mark_node
2067 || TREE_TYPE (index) == error_mark_node)
2068 return error_mark_node;
2070 if (TREE_CODE (TREE_TYPE (array)) != ARRAY_TYPE
2071 && TREE_CODE (TREE_TYPE (array)) != POINTER_TYPE)
2074 if (TREE_CODE (TREE_TYPE (index)) != ARRAY_TYPE
2075 && TREE_CODE (TREE_TYPE (index)) != POINTER_TYPE)
2077 error_at (loc, "subscripted value is neither array nor pointer");
2078 return error_mark_node;
2086 if (!INTEGRAL_TYPE_P (TREE_TYPE (index)))
2088 error_at (loc, "array subscript is not an integer");
2089 return error_mark_node;
2092 if (TREE_CODE (TREE_TYPE (TREE_TYPE (array))) == FUNCTION_TYPE)
2094 error_at (loc, "subscripted value is pointer to function");
2095 return error_mark_node;
2098 /* ??? Existing practice has been to warn only when the char
2099 index is syntactically the index, not for char[array]. */
2101 warn_array_subscript_with_type_char (index);
2103 /* Apply default promotions *after* noticing character types. */
2104 index = default_conversion (index);
2106 gcc_assert (TREE_CODE (TREE_TYPE (index)) == INTEGER_TYPE);
2108 if (TREE_CODE (TREE_TYPE (array)) == ARRAY_TYPE)
2112 /* An array that is indexed by a non-constant
2113 cannot be stored in a register; we must be able to do
2114 address arithmetic on its address.
2115 Likewise an array of elements of variable size. */
2116 if (TREE_CODE (index) != INTEGER_CST
2117 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array)))
2118 && TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array)))) != INTEGER_CST))
2120 if (!c_mark_addressable (array))
2121 return error_mark_node;
2123 /* An array that is indexed by a constant value which is not within
2124 the array bounds cannot be stored in a register either; because we
2125 would get a crash in store_bit_field/extract_bit_field when trying
2126 to access a non-existent part of the register. */
2127 if (TREE_CODE (index) == INTEGER_CST
2128 && TYPE_DOMAIN (TREE_TYPE (array))
2129 && !int_fits_type_p (index, TYPE_DOMAIN (TREE_TYPE (array))))
2131 if (!c_mark_addressable (array))
2132 return error_mark_node;
2138 while (TREE_CODE (foo) == COMPONENT_REF)
2139 foo = TREE_OPERAND (foo, 0);
2140 if (TREE_CODE (foo) == VAR_DECL && C_DECL_REGISTER (foo))
2141 pedwarn (loc, OPT_pedantic,
2142 "ISO C forbids subscripting %<register%> array");
2143 else if (!flag_isoc99 && !lvalue_p (foo))
2144 pedwarn (loc, OPT_pedantic,
2145 "ISO C90 forbids subscripting non-lvalue array");
2148 type = TREE_TYPE (TREE_TYPE (array));
2149 rval = build4 (ARRAY_REF, type, array, index, NULL_TREE, NULL_TREE);
2150 /* Array ref is const/volatile if the array elements are
2151 or if the array is. */
2152 TREE_READONLY (rval)
2153 |= (TYPE_READONLY (TREE_TYPE (TREE_TYPE (array)))
2154 | TREE_READONLY (array));
2155 TREE_SIDE_EFFECTS (rval)
2156 |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array)))
2157 | TREE_SIDE_EFFECTS (array));
2158 TREE_THIS_VOLATILE (rval)
2159 |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array)))
2160 /* This was added by rms on 16 Nov 91.
2161 It fixes vol struct foo *a; a->elts[1]
2162 in an inline function.
2163 Hope it doesn't break something else. */
2164 | TREE_THIS_VOLATILE (array));
2165 ret = require_complete_type (fold (rval));
2166 protected_set_expr_location (ret, loc);
2171 tree ar = default_conversion (array);
2173 if (ar == error_mark_node)
2176 gcc_assert (TREE_CODE (TREE_TYPE (ar)) == POINTER_TYPE);
2177 gcc_assert (TREE_CODE (TREE_TYPE (TREE_TYPE (ar))) != FUNCTION_TYPE);
2179 return build_indirect_ref
2180 (loc, build_binary_op (loc, PLUS_EXPR, ar, index, 0),
2185 /* Build an external reference to identifier ID. FUN indicates
2186 whether this will be used for a function call. LOC is the source
2187 location of the identifier. */
2189 build_external_ref (tree id, int fun, location_t loc)
2192 tree decl = lookup_name (id);
2194 /* In Objective-C, an instance variable (ivar) may be preferred to
2195 whatever lookup_name() found. */
2196 decl = objc_lookup_ivar (decl, id);
2198 if (decl && decl != error_mark_node)
2201 /* Implicit function declaration. */
2202 ref = implicitly_declare (id);
2203 else if (decl == error_mark_node)
2204 /* Don't complain about something that's already been
2205 complained about. */
2206 return error_mark_node;
2209 undeclared_variable (id, loc);
2210 return error_mark_node;
2213 if (TREE_TYPE (ref) == error_mark_node)
2214 return error_mark_node;
2216 if (TREE_DEPRECATED (ref))
2217 warn_deprecated_use (ref);
2219 /* Recursive call does not count as usage. */
2220 if (ref != current_function_decl)
2222 TREE_USED (ref) = 1;
2225 if (TREE_CODE (ref) == FUNCTION_DECL && !in_alignof)
2227 if (!in_sizeof && !in_typeof)
2228 C_DECL_USED (ref) = 1;
2229 else if (DECL_INITIAL (ref) == 0
2230 && DECL_EXTERNAL (ref)
2231 && !TREE_PUBLIC (ref))
2232 record_maybe_used_decl (ref);
2235 if (TREE_CODE (ref) == CONST_DECL)
2237 used_types_insert (TREE_TYPE (ref));
2238 ref = DECL_INITIAL (ref);
2239 TREE_CONSTANT (ref) = 1;
2241 else if (current_function_decl != 0
2242 && !DECL_FILE_SCOPE_P (current_function_decl)
2243 && (TREE_CODE (ref) == VAR_DECL
2244 || TREE_CODE (ref) == PARM_DECL
2245 || TREE_CODE (ref) == FUNCTION_DECL))
2247 tree context = decl_function_context (ref);
2249 if (context != 0 && context != current_function_decl)
2250 DECL_NONLOCAL (ref) = 1;
2252 /* C99 6.7.4p3: An inline definition of a function with external
2253 linkage ... shall not contain a reference to an identifier with
2254 internal linkage. */
2255 else if (current_function_decl != 0
2256 && DECL_DECLARED_INLINE_P (current_function_decl)
2257 && DECL_EXTERNAL (current_function_decl)
2258 && VAR_OR_FUNCTION_DECL_P (ref)
2259 && (TREE_CODE (ref) != VAR_DECL || TREE_STATIC (ref))
2260 && ! TREE_PUBLIC (ref)
2261 && DECL_CONTEXT (ref) != current_function_decl)
2262 pedwarn (loc, 0, "%qD is static but used in inline function %qD "
2263 "which is not static", ref, current_function_decl);
2268 /* Record details of decls possibly used inside sizeof or typeof. */
2269 struct maybe_used_decl
2273 /* The level seen at (in_sizeof + in_typeof). */
2275 /* The next one at this level or above, or NULL. */
2276 struct maybe_used_decl *next;
2279 static struct maybe_used_decl *maybe_used_decls;
2281 /* Record that DECL, an undefined static function reference seen
2282 inside sizeof or typeof, might be used if the operand of sizeof is
2283 a VLA type or the operand of typeof is a variably modified
2287 record_maybe_used_decl (tree decl)
2289 struct maybe_used_decl *t = XOBNEW (&parser_obstack, struct maybe_used_decl);
2291 t->level = in_sizeof + in_typeof;
2292 t->next = maybe_used_decls;
2293 maybe_used_decls = t;
2296 /* Pop the stack of decls possibly used inside sizeof or typeof. If
2297 USED is false, just discard them. If it is true, mark them used
2298 (if no longer inside sizeof or typeof) or move them to the next
2299 level up (if still inside sizeof or typeof). */
2302 pop_maybe_used (bool used)
2304 struct maybe_used_decl *p = maybe_used_decls;
2305 int cur_level = in_sizeof + in_typeof;
2306 while (p && p->level > cur_level)
2311 C_DECL_USED (p->decl) = 1;
2313 p->level = cur_level;
2317 if (!used || cur_level == 0)
2318 maybe_used_decls = p;
2321 /* Return the result of sizeof applied to EXPR. */
2324 c_expr_sizeof_expr (struct c_expr expr)
2327 if (expr.value == error_mark_node)
2329 ret.value = error_mark_node;
2330 ret.original_code = ERROR_MARK;
2331 pop_maybe_used (false);
2335 ret.value = c_sizeof (TREE_TYPE (expr.value));
2336 ret.original_code = ERROR_MARK;
2337 if (c_vla_type_p (TREE_TYPE (expr.value)))
2339 /* sizeof is evaluated when given a vla (C99 6.5.3.4p2). */
2340 ret.value = build2 (COMPOUND_EXPR, TREE_TYPE (ret.value), expr.value, ret.value);
2342 pop_maybe_used (C_TYPE_VARIABLE_SIZE (TREE_TYPE (expr.value)));
2347 /* Return the result of sizeof applied to T, a structure for the type
2348 name passed to sizeof (rather than the type itself). */
2351 c_expr_sizeof_type (struct c_type_name *t)
2355 type = groktypename (t);
2356 ret.value = c_sizeof (type);
2357 ret.original_code = ERROR_MARK;
2358 pop_maybe_used (type != error_mark_node
2359 ? C_TYPE_VARIABLE_SIZE (type) : false);
2363 /* Build a function call to function FUNCTION with parameters PARAMS.
2364 PARAMS is a list--a chain of TREE_LIST nodes--in which the
2365 TREE_VALUE of each node is a parameter-expression.
2366 FUNCTION's data type may be a function type or a pointer-to-function. */
2369 build_function_call (tree function, tree params)
2371 tree fntype, fundecl = 0;
2372 tree name = NULL_TREE, result;
2378 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
2379 STRIP_TYPE_NOPS (function);
2381 /* Convert anything with function type to a pointer-to-function. */
2382 if (TREE_CODE (function) == FUNCTION_DECL)
2384 /* Implement type-directed function overloading for builtins.
2385 resolve_overloaded_builtin and targetm.resolve_overloaded_builtin
2386 handle all the type checking. The result is a complete expression
2387 that implements this function call. */
2388 tem = resolve_overloaded_builtin (function, params);
2392 name = DECL_NAME (function);
2395 if (TREE_CODE (TREE_TYPE (function)) == FUNCTION_TYPE)
2396 function = function_to_pointer_conversion (function);
2398 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
2399 expressions, like those used for ObjC messenger dispatches. */
2400 function = objc_rewrite_function_call (function, params);
2402 fntype = TREE_TYPE (function);
2404 if (TREE_CODE (fntype) == ERROR_MARK)
2405 return error_mark_node;
2407 if (!(TREE_CODE (fntype) == POINTER_TYPE
2408 && TREE_CODE (TREE_TYPE (fntype)) == FUNCTION_TYPE))
2410 error ("called object %qE is not a function", function);
2411 return error_mark_node;
2414 if (fundecl && TREE_THIS_VOLATILE (fundecl))
2415 current_function_returns_abnormally = 1;
2417 /* fntype now gets the type of function pointed to. */
2418 fntype = TREE_TYPE (fntype);
2420 /* Convert the parameters to the types declared in the
2421 function prototype, or apply default promotions. */
2423 nargs = list_length (params);
2424 argarray = (tree *) alloca (nargs * sizeof (tree));
2425 nargs = convert_arguments (nargs, argarray, TYPE_ARG_TYPES (fntype),
2426 params, function, fundecl);
2428 return error_mark_node;
2430 /* Check that the function is called through a compatible prototype.
2431 If it is not, replace the call by a trap, wrapped up in a compound
2432 expression if necessary. This has the nice side-effect to prevent
2433 the tree-inliner from generating invalid assignment trees which may
2434 blow up in the RTL expander later. */
2435 if (CONVERT_EXPR_P (function)
2436 && TREE_CODE (tem = TREE_OPERAND (function, 0)) == ADDR_EXPR
2437 && TREE_CODE (tem = TREE_OPERAND (tem, 0)) == FUNCTION_DECL
2438 && !comptypes (fntype, TREE_TYPE (tem)))
2440 tree return_type = TREE_TYPE (fntype);
2441 tree trap = build_function_call (built_in_decls[BUILT_IN_TRAP],
2445 /* This situation leads to run-time undefined behavior. We can't,
2446 therefore, simply error unless we can prove that all possible
2447 executions of the program must execute the code. */
2448 if (warning (0, "function called through a non-compatible type"))
2449 /* We can, however, treat "undefined" any way we please.
2450 Call abort to encourage the user to fix the program. */
2451 inform (input_location, "if this code is reached, the program will abort");
2452 /* Before the abort, allow the function arguments to exit or
2454 for (i = 0; i < nargs; i++)
2455 trap = build2 (COMPOUND_EXPR, void_type_node, argarray[i], trap);
2457 if (VOID_TYPE_P (return_type))
2463 if (AGGREGATE_TYPE_P (return_type))
2464 rhs = build_compound_literal (return_type,
2465 build_constructor (return_type, 0));
2467 rhs = fold_convert (return_type, integer_zero_node);
2469 return build2 (COMPOUND_EXPR, return_type, trap, rhs);
2473 /* Check that arguments to builtin functions match the expectations. */
2475 && DECL_BUILT_IN (fundecl)
2476 && DECL_BUILT_IN_CLASS (fundecl) == BUILT_IN_NORMAL
2477 && !check_builtin_function_arguments (fundecl, nargs, argarray))
2478 return error_mark_node;
2480 /* Check that the arguments to the function are valid. */
2481 check_function_arguments (TYPE_ATTRIBUTES (fntype), nargs, argarray,
2482 TYPE_ARG_TYPES (fntype));
2484 if (require_constant_value)
2486 result = fold_build_call_array_initializer (TREE_TYPE (fntype),
2487 function, nargs, argarray);
2488 if (TREE_CONSTANT (result)
2489 && (name == NULL_TREE
2490 || strncmp (IDENTIFIER_POINTER (name), "__builtin_", 10) != 0))
2491 pedwarn_init (input_location, 0, "initializer element is not constant");
2494 result = fold_build_call_array (TREE_TYPE (fntype),
2495 function, nargs, argarray);
2497 if (VOID_TYPE_P (TREE_TYPE (result)))
2499 return require_complete_type (result);
2502 /* Convert the argument expressions in the list VALUES
2503 to the types in the list TYPELIST. The resulting arguments are
2504 stored in the array ARGARRAY which has size NARGS.
2506 If TYPELIST is exhausted, or when an element has NULL as its type,
2507 perform the default conversions.
2509 PARMLIST is the chain of parm decls for the function being called.
2510 It may be 0, if that info is not available.
2511 It is used only for generating error messages.
2513 FUNCTION is a tree for the called function. It is used only for
2514 error messages, where it is formatted with %qE.
2516 This is also where warnings about wrong number of args are generated.
2518 VALUES is a chain of TREE_LIST nodes with the elements of the list
2519 in the TREE_VALUE slots of those nodes.
2521 Returns the actual number of arguments processed (which may be less
2522 than NARGS in some error situations), or -1 on failure. */
2525 convert_arguments (int nargs, tree *argarray,
2526 tree typelist, tree values, tree function, tree fundecl)
2528 tree typetail, valtail;
2530 bool error_args = false;
2531 const bool type_generic = fundecl
2532 && lookup_attribute ("type generic", TYPE_ATTRIBUTES(TREE_TYPE (fundecl)));
2535 /* Change pointer to function to the function itself for
2537 if (TREE_CODE (function) == ADDR_EXPR
2538 && TREE_CODE (TREE_OPERAND (function, 0)) == FUNCTION_DECL)
2539 function = TREE_OPERAND (function, 0);
2541 /* Handle an ObjC selector specially for diagnostics. */
2542 selector = objc_message_selector ();
2544 /* Scan the given expressions and types, producing individual
2545 converted arguments and storing them in ARGARRAY. */
2547 for (valtail = values, typetail = typelist, parmnum = 0;
2549 valtail = TREE_CHAIN (valtail), parmnum++)
2551 tree type = typetail ? TREE_VALUE (typetail) : 0;
2552 tree val = TREE_VALUE (valtail);
2553 tree rname = function;
2554 int argnum = parmnum + 1;
2555 const char *invalid_func_diag;
2557 if (type == void_type_node)
2559 error ("too many arguments to function %qE", function);
2563 if (selector && argnum > 2)
2569 STRIP_TYPE_NOPS (val);
2571 val = require_complete_type (val);
2575 /* Formal parm type is specified by a function prototype. */
2578 if (type == error_mark_node || !COMPLETE_TYPE_P (type))
2580 error ("type of formal parameter %d is incomplete", parmnum + 1);
2585 /* Optionally warn about conversions that
2586 differ from the default conversions. */
2587 if (warn_traditional_conversion || warn_traditional)
2589 unsigned int formal_prec = TYPE_PRECISION (type);
2591 if (INTEGRAL_TYPE_P (type)
2592 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
2593 warning (0, "passing argument %d of %qE as integer "
2594 "rather than floating due to prototype",
2596 if (INTEGRAL_TYPE_P (type)
2597 && TREE_CODE (TREE_TYPE (val)) == COMPLEX_TYPE)
2598 warning (0, "passing argument %d of %qE as integer "
2599 "rather than complex due to prototype",
2601 else if (TREE_CODE (type) == COMPLEX_TYPE
2602 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
2603 warning (0, "passing argument %d of %qE as complex "
2604 "rather than floating due to prototype",
2606 else if (TREE_CODE (type) == REAL_TYPE
2607 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
2608 warning (0, "passing argument %d of %qE as floating "
2609 "rather than integer due to prototype",
2611 else if (TREE_CODE (type) == COMPLEX_TYPE
2612 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
2613 warning (0, "passing argument %d of %qE as complex "
2614 "rather than integer due to prototype",
2616 else if (TREE_CODE (type) == REAL_TYPE
2617 && TREE_CODE (TREE_TYPE (val)) == COMPLEX_TYPE)
2618 warning (0, "passing argument %d of %qE as floating "
2619 "rather than complex due to prototype",
2621 /* ??? At some point, messages should be written about
2622 conversions between complex types, but that's too messy
2624 else if (TREE_CODE (type) == REAL_TYPE
2625 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
2627 /* Warn if any argument is passed as `float',
2628 since without a prototype it would be `double'. */
2629 if (formal_prec == TYPE_PRECISION (float_type_node)
2630 && type != dfloat32_type_node)
2631 warning (0, "passing argument %d of %qE as %<float%> "
2632 "rather than %<double%> due to prototype",
2635 /* Warn if mismatch between argument and prototype
2636 for decimal float types. Warn of conversions with
2637 binary float types and of precision narrowing due to
2639 else if (type != TREE_TYPE (val)
2640 && (type == dfloat32_type_node
2641 || type == dfloat64_type_node
2642 || type == dfloat128_type_node
2643 || TREE_TYPE (val) == dfloat32_type_node
2644 || TREE_TYPE (val) == dfloat64_type_node
2645 || TREE_TYPE (val) == dfloat128_type_node)
2647 <= TYPE_PRECISION (TREE_TYPE (val))
2648 || (type == dfloat128_type_node
2650 != dfloat64_type_node
2652 != dfloat32_type_node)))
2653 || (type == dfloat64_type_node
2655 != dfloat32_type_node))))
2656 warning (0, "passing argument %d of %qE as %qT "
2657 "rather than %qT due to prototype",
2658 argnum, rname, type, TREE_TYPE (val));
2661 /* Detect integer changing in width or signedness.
2662 These warnings are only activated with
2663 -Wtraditional-conversion, not with -Wtraditional. */
2664 else if (warn_traditional_conversion && INTEGRAL_TYPE_P (type)
2665 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
2667 tree would_have_been = default_conversion (val);
2668 tree type1 = TREE_TYPE (would_have_been);
2670 if (TREE_CODE (type) == ENUMERAL_TYPE
2671 && (TYPE_MAIN_VARIANT (type)
2672 == TYPE_MAIN_VARIANT (TREE_TYPE (val))))
2673 /* No warning if function asks for enum
2674 and the actual arg is that enum type. */
2676 else if (formal_prec != TYPE_PRECISION (type1))
2677 warning (OPT_Wtraditional_conversion, "passing argument %d of %qE "
2678 "with different width due to prototype",
2680 else if (TYPE_UNSIGNED (type) == TYPE_UNSIGNED (type1))
2682 /* Don't complain if the formal parameter type
2683 is an enum, because we can't tell now whether
2684 the value was an enum--even the same enum. */
2685 else if (TREE_CODE (type) == ENUMERAL_TYPE)
2687 else if (TREE_CODE (val) == INTEGER_CST
2688 && int_fits_type_p (val, type))
2689 /* Change in signedness doesn't matter
2690 if a constant value is unaffected. */
2692 /* If the value is extended from a narrower
2693 unsigned type, it doesn't matter whether we
2694 pass it as signed or unsigned; the value
2695 certainly is the same either way. */
2696 else if (TYPE_PRECISION (TREE_TYPE (val)) < TYPE_PRECISION (type)
2697 && TYPE_UNSIGNED (TREE_TYPE (val)))
2699 else if (TYPE_UNSIGNED (type))
2700 warning (OPT_Wtraditional_conversion, "passing argument %d of %qE "
2701 "as unsigned due to prototype",
2704 warning (OPT_Wtraditional_conversion, "passing argument %d of %qE "
2705 "as signed due to prototype", argnum, rname);
2709 parmval = convert_for_assignment (type, val, ic_argpass,
2713 if (targetm.calls.promote_prototypes (fundecl ? TREE_TYPE (fundecl) : 0)
2714 && INTEGRAL_TYPE_P (type)
2715 && (TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node)))
2716 parmval = default_conversion (parmval);
2718 argarray[parmnum] = parmval;
2720 else if (TREE_CODE (TREE_TYPE (val)) == REAL_TYPE
2721 && (TYPE_PRECISION (TREE_TYPE (val))
2722 < TYPE_PRECISION (double_type_node))
2723 && !DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (val))))
2726 argarray[parmnum] = val;
2728 /* Convert `float' to `double'. */
2729 argarray[parmnum] = convert (double_type_node, val);
2731 else if ((invalid_func_diag =
2732 targetm.calls.invalid_arg_for_unprototyped_fn (typelist, fundecl, val)))
2734 error (invalid_func_diag);
2738 /* Convert `short' and `char' to full-size `int'. */
2739 argarray[parmnum] = default_conversion (val);
2741 if (argarray[parmnum] == error_mark_node)
2745 typetail = TREE_CHAIN (typetail);
2748 gcc_assert (parmnum == nargs);
2750 if (typetail != 0 && TREE_VALUE (typetail) != void_type_node)
2752 error ("too few arguments to function %qE", function);
2756 return error_args ? -1 : parmnum;
2759 /* This is the entry point used by the parser to build unary operators
2760 in the input. CODE, a tree_code, specifies the unary operator, and
2761 ARG is the operand. For unary plus, the C parser currently uses
2762 CONVERT_EXPR for code.
2764 LOC is the location to use for the tree generated.
2768 parser_build_unary_op (enum tree_code code, struct c_expr arg, location_t loc)
2770 struct c_expr result;
2772 result.value = build_unary_op (loc, code, arg.value, 0);
2773 result.original_code = code;
2775 if (TREE_OVERFLOW_P (result.value) && !TREE_OVERFLOW_P (arg.value))
2776 overflow_warning (result.value);
2781 /* This is the entry point used by the parser to build binary operators
2782 in the input. CODE, a tree_code, specifies the binary operator, and
2783 ARG1 and ARG2 are the operands. In addition to constructing the
2784 expression, we check for operands that were written with other binary
2785 operators in a way that is likely to confuse the user.
2787 LOCATION is the location of the binary operator. */
2790 parser_build_binary_op (location_t location, enum tree_code code,
2791 struct c_expr arg1, struct c_expr arg2)
2793 struct c_expr result;
2795 enum tree_code code1 = arg1.original_code;
2796 enum tree_code code2 = arg2.original_code;
2798 result.value = build_binary_op (location, code,
2799 arg1.value, arg2.value, 1);
2800 result.original_code = code;
2802 if (TREE_CODE (result.value) == ERROR_MARK)
2805 if (location != UNKNOWN_LOCATION)
2806 protected_set_expr_location (result.value, location);
2808 /* Check for cases such as x+y<<z which users are likely
2810 if (warn_parentheses)
2811 warn_about_parentheses (code, code1, arg1.value, code2, arg2.value);
2813 if (TREE_CODE_CLASS (code1) != tcc_comparison)
2814 warn_logical_operator (code, arg1.value, arg2.value);
2816 /* Warn about comparisons against string literals, with the exception
2817 of testing for equality or inequality of a string literal with NULL. */
2818 if (code == EQ_EXPR || code == NE_EXPR)
2820 if ((code1 == STRING_CST && !integer_zerop (arg2.value))
2821 || (code2 == STRING_CST && !integer_zerop (arg1.value)))
2822 warning (OPT_Waddress, "comparison with string literal results in unspecified behavior");
2824 else if (TREE_CODE_CLASS (code) == tcc_comparison
2825 && (code1 == STRING_CST || code2 == STRING_CST))
2826 warning (OPT_Waddress, "comparison with string literal results in unspecified behavior");
2828 if (TREE_OVERFLOW_P (result.value)
2829 && !TREE_OVERFLOW_P (arg1.value)
2830 && !TREE_OVERFLOW_P (arg2.value))
2831 overflow_warning (result.value);
2836 /* Return a tree for the difference of pointers OP0 and OP1.
2837 The resulting tree has type int. */
2840 pointer_diff (tree op0, tree op1)
2842 tree restype = ptrdiff_type_node;
2844 tree target_type = TREE_TYPE (TREE_TYPE (op0));
2845 tree con0, con1, lit0, lit1;
2846 tree orig_op1 = op1;
2848 if (TREE_CODE (target_type) == VOID_TYPE)
2849 pedwarn (input_location, pedantic ? OPT_pedantic : OPT_Wpointer_arith,
2850 "pointer of type %<void *%> used in subtraction");
2851 if (TREE_CODE (target_type) == FUNCTION_TYPE)
2852 pedwarn (input_location, pedantic ? OPT_pedantic : OPT_Wpointer_arith,
2853 "pointer to a function used in subtraction");
2855 /* If the conversion to ptrdiff_type does anything like widening or
2856 converting a partial to an integral mode, we get a convert_expression
2857 that is in the way to do any simplifications.
2858 (fold-const.c doesn't know that the extra bits won't be needed.
2859 split_tree uses STRIP_SIGN_NOPS, which leaves conversions to a
2860 different mode in place.)
2861 So first try to find a common term here 'by hand'; we want to cover
2862 at least the cases that occur in legal static initializers. */
2863 if (CONVERT_EXPR_P (op0)
2864 && (TYPE_PRECISION (TREE_TYPE (op0))
2865 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op0, 0)))))
2866 con0 = TREE_OPERAND (op0, 0);
2869 if (CONVERT_EXPR_P (op1)
2870 && (TYPE_PRECISION (TREE_TYPE (op1))
2871 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op1, 0)))))
2872 con1 = TREE_OPERAND (op1, 0);
2876 if (TREE_CODE (con0) == PLUS_EXPR)
2878 lit0 = TREE_OPERAND (con0, 1);
2879 con0 = TREE_OPERAND (con0, 0);
2882 lit0 = integer_zero_node;
2884 if (TREE_CODE (con1) == PLUS_EXPR)
2886 lit1 = TREE_OPERAND (con1, 1);
2887 con1 = TREE_OPERAND (con1, 0);
2890 lit1 = integer_zero_node;
2892 if (operand_equal_p (con0, con1, 0))
2899 /* First do the subtraction as integers;
2900 then drop through to build the divide operator.
2901 Do not do default conversions on the minus operator
2902 in case restype is a short type. */
2904 op0 = build_binary_op (input_location,
2905 MINUS_EXPR, convert (restype, op0),
2906 convert (restype, op1), 0);
2907 /* This generates an error if op1 is pointer to incomplete type. */
2908 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (TREE_TYPE (orig_op1))))
2909 error ("arithmetic on pointer to an incomplete type");
2911 /* This generates an error if op0 is pointer to incomplete type. */
2912 op1 = c_size_in_bytes (target_type);
2914 /* Divide by the size, in easiest possible way. */
2915 return fold_build2 (EXACT_DIV_EXPR, restype, op0, convert (restype, op1));
2918 /* Construct and perhaps optimize a tree representation
2919 for a unary operation. CODE, a tree_code, specifies the operation
2920 and XARG is the operand.
2921 For any CODE other than ADDR_EXPR, FLAG nonzero suppresses
2922 the default promotions (such as from short to int).
2923 For ADDR_EXPR, the default promotions are not applied; FLAG nonzero
2924 allows non-lvalues; this is only used to handle conversion of non-lvalue
2925 arrays to pointers in C99.
2927 LOCATION is the location of the operator. */
2930 build_unary_op (location_t location,
2931 enum tree_code code, tree xarg, int flag)
2933 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
2936 enum tree_code typecode;
2938 tree ret = error_mark_node;
2939 int noconvert = flag;
2940 const char *invalid_op_diag;
2942 if (code != ADDR_EXPR)
2943 arg = require_complete_type (arg);
2945 typecode = TREE_CODE (TREE_TYPE (arg));
2946 if (typecode == ERROR_MARK)
2947 return error_mark_node;
2948 if (typecode == ENUMERAL_TYPE || typecode == BOOLEAN_TYPE)
2949 typecode = INTEGER_TYPE;
2951 if ((invalid_op_diag
2952 = targetm.invalid_unary_op (code, TREE_TYPE (xarg))))
2954 error_at (location, invalid_op_diag);
2955 return error_mark_node;
2961 /* This is used for unary plus, because a CONVERT_EXPR
2962 is enough to prevent anybody from looking inside for
2963 associativity, but won't generate any code. */
2964 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2965 || typecode == FIXED_POINT_TYPE || typecode == COMPLEX_TYPE
2966 || typecode == VECTOR_TYPE))
2968 error_at (location, "wrong type argument to unary plus");
2969 return error_mark_node;
2971 else if (!noconvert)
2972 arg = default_conversion (arg);
2973 arg = non_lvalue (arg);
2977 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2978 || typecode == FIXED_POINT_TYPE || typecode == COMPLEX_TYPE
2979 || typecode == VECTOR_TYPE))
2981 error_at (location, "wrong type argument to unary minus");
2982 return error_mark_node;
2984 else if (!noconvert)
2985 arg = default_conversion (arg);
2989 /* ~ works on integer types and non float vectors. */
2990 if (typecode == INTEGER_TYPE
2991 || (typecode == VECTOR_TYPE
2992 && !VECTOR_FLOAT_TYPE_P (TREE_TYPE (arg))))
2995 arg = default_conversion (arg);
2997 else if (typecode == COMPLEX_TYPE)
3000 pedwarn (location, OPT_pedantic,
3001 "ISO C does not support %<~%> for complex conjugation");
3003 arg = default_conversion (arg);
3007 error_at (location, "wrong type argument to bit-complement");
3008 return error_mark_node;
3013 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE))
3015 error_at (location, "wrong type argument to abs");
3016 return error_mark_node;
3018 else if (!noconvert)
3019 arg = default_conversion (arg);
3023 /* Conjugating a real value is a no-op, but allow it anyway. */
3024 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
3025 || typecode == COMPLEX_TYPE))
3027 error_at (location, "wrong type argument to conjugation");
3028 return error_mark_node;
3030 else if (!noconvert)
3031 arg = default_conversion (arg);
3034 case TRUTH_NOT_EXPR:
3035 if (typecode != INTEGER_TYPE && typecode != FIXED_POINT_TYPE
3036 && typecode != REAL_TYPE && typecode != POINTER_TYPE
3037 && typecode != COMPLEX_TYPE)
3040 "wrong type argument to unary exclamation mark");
3041 return error_mark_node;
3043 arg = c_objc_common_truthvalue_conversion (location, arg);
3044 ret = invert_truthvalue (arg);
3045 goto return_build_unary_op;
3048 if (TREE_CODE (arg) == COMPLEX_CST)
3049 ret = TREE_REALPART (arg);
3050 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
3051 ret = fold_build1 (REALPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg);
3054 goto return_build_unary_op;
3057 if (TREE_CODE (arg) == COMPLEX_CST)
3058 ret = TREE_IMAGPART (arg);
3059 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
3060 ret = fold_build1 (IMAGPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg);
3062 ret = omit_one_operand (TREE_TYPE (arg), integer_zero_node, arg);
3063 goto return_build_unary_op;
3065 case PREINCREMENT_EXPR:
3066 case POSTINCREMENT_EXPR:
3067 case PREDECREMENT_EXPR:
3068 case POSTDECREMENT_EXPR:
3070 /* Increment or decrement the real part of the value,
3071 and don't change the imaginary part. */
3072 if (typecode == COMPLEX_TYPE)
3076 pedwarn (location, OPT_pedantic,
3077 "ISO C does not support %<++%> and %<--%> on complex types");
3079 arg = stabilize_reference (arg);
3080 real = build_unary_op (EXPR_LOCATION (arg), REALPART_EXPR, arg, 1);
3081 imag = build_unary_op (EXPR_LOCATION (arg), IMAGPART_EXPR, arg, 1);
3082 real = build_unary_op (EXPR_LOCATION (arg), code, real, 1);
3083 if (real == error_mark_node || imag == error_mark_node)
3084 return error_mark_node;
3085 ret = build2 (COMPLEX_EXPR, TREE_TYPE (arg),
3087 goto return_build_unary_op;
3090 /* Report invalid types. */
3092 if (typecode != POINTER_TYPE && typecode != FIXED_POINT_TYPE
3093 && typecode != INTEGER_TYPE && typecode != REAL_TYPE)
3095 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
3096 error_at (location, "wrong type argument to increment");
3098 error_at (location, "wrong type argument to decrement");
3100 return error_mark_node;
3106 argtype = TREE_TYPE (arg);
3108 /* Compute the increment. */
3110 if (typecode == POINTER_TYPE)
3112 /* If pointer target is an undefined struct,
3113 we just cannot know how to do the arithmetic. */
3114 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (argtype)))
3116 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
3118 "increment of pointer to unknown structure");
3121 "decrement of pointer to unknown structure");
3123 else if (TREE_CODE (TREE_TYPE (argtype)) == FUNCTION_TYPE
3124 || TREE_CODE (TREE_TYPE (argtype)) == VOID_TYPE)
3126 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
3127 pedwarn (location, pedantic ? OPT_pedantic : OPT_Wpointer_arith,
3128 "wrong type argument to increment");
3130 pedwarn (location, pedantic ? OPT_pedantic : OPT_Wpointer_arith,
3131 "wrong type argument to decrement");
3134 inc = c_size_in_bytes (TREE_TYPE (argtype));
3135 inc = fold_convert (sizetype, inc);
3137 else if (FRACT_MODE_P (TYPE_MODE (argtype)))
3139 /* For signed fract types, we invert ++ to -- or
3140 -- to ++, and change inc from 1 to -1, because
3141 it is not possible to represent 1 in signed fract constants.
3142 For unsigned fract types, the result always overflows and
3143 we get an undefined (original) or the maximum value. */
3144 if (code == PREINCREMENT_EXPR)
3145 code = PREDECREMENT_EXPR;
3146 else if (code == PREDECREMENT_EXPR)
3147 code = PREINCREMENT_EXPR;
3148 else if (code == POSTINCREMENT_EXPR)
3149 code = POSTDECREMENT_EXPR;
3150 else /* code == POSTDECREMENT_EXPR */
3151 code = POSTINCREMENT_EXPR;
3153 inc = integer_minus_one_node;
3154 inc = convert (argtype, inc);
3158 inc = integer_one_node;
3159 inc = convert (argtype, inc);
3162 /* Complain about anything else that is not a true lvalue. */
3163 if (!lvalue_or_else (arg, ((code == PREINCREMENT_EXPR
3164 || code == POSTINCREMENT_EXPR)
3167 return error_mark_node;
3169 /* Report a read-only lvalue. */
3170 if (TREE_READONLY (arg))
3172 readonly_error (arg,
3173 ((code == PREINCREMENT_EXPR
3174 || code == POSTINCREMENT_EXPR)
3175 ? lv_increment : lv_decrement));
3176 return error_mark_node;
3179 if (TREE_CODE (TREE_TYPE (arg)) == BOOLEAN_TYPE)
3180 val = boolean_increment (code, arg);
3182 val = build2 (code, TREE_TYPE (arg), arg, inc);
3183 TREE_SIDE_EFFECTS (val) = 1;
3184 if (TREE_CODE (val) != code)
3185 TREE_NO_WARNING (val) = 1;
3187 goto return_build_unary_op;
3191 /* Note that this operation never does default_conversion. */
3193 /* Let &* cancel out to simplify resulting code. */
3194 if (TREE_CODE (arg) == INDIRECT_REF)
3196 /* Don't let this be an lvalue. */
3197 if (lvalue_p (TREE_OPERAND (arg, 0)))
3198 return non_lvalue (TREE_OPERAND (arg, 0));
3199 ret = TREE_OPERAND (arg, 0);
3200 goto return_build_unary_op;
3203 /* For &x[y], return x+y */
3204 if (TREE_CODE (arg) == ARRAY_REF)
3206 tree op0 = TREE_OPERAND (arg, 0);
3207 if (!c_mark_addressable (op0))
3208 return error_mark_node;
3209 return build_binary_op (location, PLUS_EXPR,
3210 (TREE_CODE (TREE_TYPE (op0)) == ARRAY_TYPE
3211 ? array_to_pointer_conversion (op0)
3213 TREE_OPERAND (arg, 1), 1);
3216 /* Anything not already handled and not a true memory reference
3217 or a non-lvalue array is an error. */
3218 else if (typecode != FUNCTION_TYPE && !flag
3219 && !lvalue_or_else (arg, lv_addressof))
3220 return error_mark_node;
3222 /* Ordinary case; arg is a COMPONENT_REF or a decl. */
3223 argtype = TREE_TYPE (arg);
3225 /* If the lvalue is const or volatile, merge that into the type
3226 to which the address will point. Note that you can't get a
3227 restricted pointer by taking the address of something, so we
3228 only have to deal with `const' and `volatile' here. */
3229 if ((DECL_P (arg) || REFERENCE_CLASS_P (arg))
3230 && (TREE_READONLY (arg) || TREE_THIS_VOLATILE (arg)))
3231 argtype = c_build_type_variant (argtype,
3232 TREE_READONLY (arg),
3233 TREE_THIS_VOLATILE (arg));
3235 if (!c_mark_addressable (arg))
3236 return error_mark_node;
3238 gcc_assert (TREE_CODE (arg) != COMPONENT_REF
3239 || !DECL_C_BIT_FIELD (TREE_OPERAND (arg, 1)));
3241 argtype = build_pointer_type (argtype);
3243 /* ??? Cope with user tricks that amount to offsetof. Delete this
3244 when we have proper support for integer constant expressions. */
3245 val = get_base_address (arg);
3246 if (val && TREE_CODE (val) == INDIRECT_REF
3247 && TREE_CONSTANT (TREE_OPERAND (val, 0)))
3249 tree op0 = fold_convert (sizetype, fold_offsetof (arg, val)), op1;
3251 op1 = fold_convert (argtype, TREE_OPERAND (val, 0));
3252 ret = fold_build2 (POINTER_PLUS_EXPR, argtype, op1, op0);
3253 goto return_build_unary_op;
3256 val = build1 (ADDR_EXPR, argtype, arg);
3259 goto return_build_unary_op;
3266 argtype = TREE_TYPE (arg);
3267 ret = require_constant_value ? fold_build1_initializer (code, argtype, arg)
3268 : fold_build1 (code, argtype, arg);
3269 return_build_unary_op:
3270 gcc_assert (ret != error_mark_node);
3271 protected_set_expr_location (ret, location);
3275 /* Return nonzero if REF is an lvalue valid for this language.
3276 Lvalues can be assigned, unless their type has TYPE_READONLY.
3277 Lvalues can have their address taken, unless they have C_DECL_REGISTER. */
3280 lvalue_p (const_tree ref)
3282 const enum tree_code code = TREE_CODE (ref);
3289 return lvalue_p (TREE_OPERAND (ref, 0));
3291 case COMPOUND_LITERAL_EXPR:
3301 return (TREE_CODE (TREE_TYPE (ref)) != FUNCTION_TYPE
3302 && TREE_CODE (TREE_TYPE (ref)) != METHOD_TYPE);
3305 return TREE_CODE (TREE_TYPE (ref)) == ARRAY_TYPE;
3312 /* Give an error for storing in something that is 'const'. */
3315 readonly_error (tree arg, enum lvalue_use use)
3317 gcc_assert (use == lv_assign || use == lv_increment || use == lv_decrement
3319 /* Using this macro rather than (for example) arrays of messages
3320 ensures that all the format strings are checked at compile
3322 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
3323 : (use == lv_increment ? (I) \
3324 : (use == lv_decrement ? (D) : (AS))))
3325 if (TREE_CODE (arg) == COMPONENT_REF)
3327 if (TYPE_READONLY (TREE_TYPE (TREE_OPERAND (arg, 0))))
3328 readonly_error (TREE_OPERAND (arg, 0), use);
3330 error (READONLY_MSG (G_("assignment of read-only member %qD"),
3331 G_("increment of read-only member %qD"),
3332 G_("decrement of read-only member %qD"),
3333 G_("read-only member %qD used as %<asm%> output")),
3334 TREE_OPERAND (arg, 1));
3336 else if (TREE_CODE (arg) == VAR_DECL)
3337 error (READONLY_MSG (G_("assignment of read-only variable %qD"),
3338 G_("increment of read-only variable %qD"),
3339 G_("decrement of read-only variable %qD"),
3340 G_("read-only variable %qD used as %<asm%> output")),
3343 error (READONLY_MSG (G_("assignment of read-only location %qE"),
3344 G_("increment of read-only location %qE"),
3345 G_("decrement of read-only location %qE"),
3346 G_("read-only location %qE used as %<asm%> output")),
3351 /* Return nonzero if REF is an lvalue valid for this language;
3352 otherwise, print an error message and return zero. USE says
3353 how the lvalue is being used and so selects the error message. */
3356 lvalue_or_else (const_tree ref, enum lvalue_use use)
3358 int win = lvalue_p (ref);
3366 /* Mark EXP saying that we need to be able to take the
3367 address of it; it should not be allocated in a register.
3368 Returns true if successful. */
3371 c_mark_addressable (tree exp)
3376 switch (TREE_CODE (x))
3379 if (DECL_C_BIT_FIELD (TREE_OPERAND (x, 1)))
3382 ("cannot take address of bit-field %qD", TREE_OPERAND (x, 1));
3386 /* ... fall through ... */
3392 x = TREE_OPERAND (x, 0);
3395 case COMPOUND_LITERAL_EXPR:
3397 TREE_ADDRESSABLE (x) = 1;
3404 if (C_DECL_REGISTER (x)
3405 && DECL_NONLOCAL (x))
3407 if (TREE_PUBLIC (x) || TREE_STATIC (x) || DECL_EXTERNAL (x))
3410 ("global register variable %qD used in nested function", x);
3413 pedwarn (input_location, 0, "register variable %qD used in nested function", x);
3415 else if (C_DECL_REGISTER (x))
3417 if (TREE_PUBLIC (x) || TREE_STATIC (x) || DECL_EXTERNAL (x))
3418 error ("address of global register variable %qD requested", x);
3420 error ("address of register variable %qD requested", x);
3426 TREE_ADDRESSABLE (x) = 1;
3433 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
3436 build_conditional_expr (tree ifexp, tree op1, tree op2)
3440 enum tree_code code1;
3441 enum tree_code code2;
3442 tree result_type = NULL;
3443 tree orig_op1 = op1, orig_op2 = op2;
3446 /* Promote both alternatives. */
3448 if (TREE_CODE (TREE_TYPE (op1)) != VOID_TYPE)
3449 op1 = default_conversion (op1);
3450 if (TREE_CODE (TREE_TYPE (op2)) != VOID_TYPE)
3451 op2 = default_conversion (op2);
3453 if (TREE_CODE (ifexp) == ERROR_MARK
3454 || TREE_CODE (TREE_TYPE (op1)) == ERROR_MARK
3455 || TREE_CODE (TREE_TYPE (op2)) == ERROR_MARK)
3456 return error_mark_node;
3458 type1 = TREE_TYPE (op1);
3459 code1 = TREE_CODE (type1);
3460 type2 = TREE_TYPE (op2);
3461 code2 = TREE_CODE (type2);
3463 /* C90 does not permit non-lvalue arrays in conditional expressions.
3464 In C99 they will be pointers by now. */
3465 if (code1 == ARRAY_TYPE || code2 == ARRAY_TYPE)
3467 error ("non-lvalue array in conditional expression");
3468 return error_mark_node;
3471 objc_ok = objc_compare_types (type1, type2, -3, NULL_TREE);
3473 /* Quickly detect the usual case where op1 and op2 have the same type
3475 if (TYPE_MAIN_VARIANT (type1) == TYPE_MAIN_VARIANT (type2))
3478 result_type = type1;
3480 result_type = TYPE_MAIN_VARIANT (type1);
3482 else if ((code1 == INTEGER_TYPE || code1 == REAL_TYPE
3483 || code1 == COMPLEX_TYPE)
3484 && (code2 == INTEGER_TYPE || code2 == REAL_TYPE
3485 || code2 == COMPLEX_TYPE))
3487 result_type = c_common_type (type1, type2);
3489 /* If -Wsign-compare, warn here if type1 and type2 have
3490 different signedness. We'll promote the signed to unsigned
3491 and later code won't know it used to be different.
3492 Do this check on the original types, so that explicit casts
3493 will be considered, but default promotions won't. */
3494 if (warn_sign_compare && !skip_evaluation)
3496 int unsigned_op1 = TYPE_UNSIGNED (TREE_TYPE (orig_op1));
3497 int unsigned_op2 = TYPE_UNSIGNED (TREE_TYPE (orig_op2));
3499 if (unsigned_op1 ^ unsigned_op2)
3503 /* Do not warn if the result type is signed, since the
3504 signed type will only be chosen if it can represent
3505 all the values of the unsigned type. */
3506 if (!TYPE_UNSIGNED (result_type))
3508 /* Do not warn if the signed quantity is an unsuffixed
3509 integer literal (or some static constant expression
3510 involving such literals) and it is non-negative. */
3511 else if ((unsigned_op2
3512 && tree_expr_nonnegative_warnv_p (op1, &ovf))
3514 && tree_expr_nonnegative_warnv_p (op2, &ovf)))
3517 warning (OPT_Wsign_compare, "signed and unsigned type in conditional expression");
3521 else if (code1 == VOID_TYPE || code2 == VOID_TYPE)
3523 if (code1 != VOID_TYPE || code2 != VOID_TYPE)
3524 pedwarn (input_location, OPT_pedantic,
3525 "ISO C forbids conditional expr with only one void side");
3526 result_type = void_type_node;
3528 else if (code1 == POINTER_TYPE && code2 == POINTER_TYPE)
3530 if (comp_target_types (type1, type2))
3531 result_type = common_pointer_type (type1, type2);
3532 else if (null_pointer_constant_p (orig_op1))
3533 result_type = qualify_type (type2, type1);
3534 else if (null_pointer_constant_p (orig_op2))
3535 result_type = qualify_type (type1, type2);
3536 else if (VOID_TYPE_P (TREE_TYPE (type1)))
3538 if (TREE_CODE (TREE_TYPE (type2)) == FUNCTION_TYPE)
3539 pedwarn (input_location, OPT_pedantic,
3540 "ISO C forbids conditional expr between "
3541 "%<void *%> and function pointer");
3542 result_type = build_pointer_type (qualify_type (TREE_TYPE (type1),
3543 TREE_TYPE (type2)));
3545 else if (VOID_TYPE_P (TREE_TYPE (type2)))
3547 if (TREE_CODE (TREE_TYPE (type1)) == FUNCTION_TYPE)
3548 pedwarn (input_location, OPT_pedantic,
3549 "ISO C forbids conditional expr between "
3550 "%<void *%> and function pointer");
3551 result_type = build_pointer_type (qualify_type (TREE_TYPE (type2),
3552 TREE_TYPE (type1)));
3557 pedwarn (input_location, 0,
3558 "pointer type mismatch in conditional expression");
3559 result_type = build_pointer_type (void_type_node);
3562 else if (code1 == POINTER_TYPE && code2 == INTEGER_TYPE)
3564 if (!null_pointer_constant_p (orig_op2))
3565 pedwarn (input_location, 0,
3566 "pointer/integer type mismatch in conditional expression");
3569 op2 = null_pointer_node;
3571 result_type = type1;
3573 else if (code2 == POINTER_TYPE && code1 == INTEGER_TYPE)
3575 if (!null_pointer_constant_p (orig_op1))
3576 pedwarn (input_location, 0,
3577 "pointer/integer type mismatch in conditional expression");
3580 op1 = null_pointer_node;
3582 result_type = type2;
3587 if (flag_cond_mismatch)
3588 result_type = void_type_node;
3591 error ("type mismatch in conditional expression");
3592 return error_mark_node;
3596 /* Merge const and volatile flags of the incoming types. */
3598 = build_type_variant (result_type,
3599 TREE_READONLY (op1) || TREE_READONLY (op2),
3600 TREE_THIS_VOLATILE (op1) || TREE_THIS_VOLATILE (op2));
3602 if (result_type != TREE_TYPE (op1))
3603 op1 = convert_and_check (result_type, op1);
3604 if (result_type != TREE_TYPE (op2))
3605 op2 = convert_and_check (result_type, op2);
3607 return fold_build3 (COND_EXPR, result_type, ifexp, op1, op2);
3610 /* Return a compound expression that performs two expressions and
3611 returns the value of the second of them. */
3614 build_compound_expr (tree expr1, tree expr2)
3616 if (!TREE_SIDE_EFFECTS (expr1))
3618 /* The left-hand operand of a comma expression is like an expression
3619 statement: with -Wunused, we should warn if it doesn't have
3620 any side-effects, unless it was explicitly cast to (void). */
3621 if (warn_unused_value)
3623 if (VOID_TYPE_P (TREE_TYPE (expr1))
3624 && CONVERT_EXPR_P (expr1))
3626 else if (VOID_TYPE_P (TREE_TYPE (expr1))
3627 && TREE_CODE (expr1) == COMPOUND_EXPR
3628 && CONVERT_EXPR_P (TREE_OPERAND (expr1, 1)))
3629 ; /* (void) a, (void) b, c */
3631 warning (OPT_Wunused_value,
3632 "left-hand operand of comma expression has no effect");
3636 /* With -Wunused, we should also warn if the left-hand operand does have
3637 side-effects, but computes a value which is not used. For example, in
3638 `foo() + bar(), baz()' the result of the `+' operator is not used,
3639 so we should issue a warning. */
3640 else if (warn_unused_value)
3641 warn_if_unused_value (expr1, input_location);
3643 if (expr2 == error_mark_node)
3644 return error_mark_node;
3646 return build2 (COMPOUND_EXPR, TREE_TYPE (expr2), expr1, expr2);
3649 /* Build an expression representing a cast to type TYPE of expression EXPR. */
3652 build_c_cast (tree type, tree expr)
3656 if (type == error_mark_node || expr == error_mark_node)
3657 return error_mark_node;
3659 /* The ObjC front-end uses TYPE_MAIN_VARIANT to tie together types differing
3660 only in <protocol> qualifications. But when constructing cast expressions,
3661 the protocols do matter and must be kept around. */
3662 if (objc_is_object_ptr (type) && objc_is_object_ptr (TREE_TYPE (expr)))
3663 return build1 (NOP_EXPR, type, expr);
3665 type = TYPE_MAIN_VARIANT (type);
3667 if (TREE_CODE (type) == ARRAY_TYPE)
3669 error ("cast specifies array type");
3670 return error_mark_node;
3673 if (TREE_CODE (type) == FUNCTION_TYPE)
3675 error ("cast specifies function type");
3676 return error_mark_node;
3679 if (!VOID_TYPE_P (type))
3681 value = require_complete_type (value);
3682 if (value == error_mark_node)
3683 return error_mark_node;
3686 if (type == TYPE_MAIN_VARIANT (TREE_TYPE (value)))
3688 if (TREE_CODE (type) == RECORD_TYPE
3689 || TREE_CODE (type) == UNION_TYPE)
3690 pedwarn (input_location, OPT_pedantic,
3691 "ISO C forbids casting nonscalar to the same type");
3693 else if (TREE_CODE (type) == UNION_TYPE)
3697 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
3698 if (TREE_TYPE (field) != error_mark_node
3699 && comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (field)),
3700 TYPE_MAIN_VARIANT (TREE_TYPE (value))))
3707 pedwarn (input_location, OPT_pedantic,
3708 "ISO C forbids casts to union type");
3709 t = digest_init (type,
3710 build_constructor_single (type, field, value),
3712 TREE_CONSTANT (t) = TREE_CONSTANT (value);
3715 error ("cast to union type from type not present in union");
3716 return error_mark_node;
3722 if (type == void_type_node)
3723 return build1 (CONVERT_EXPR, type, value);
3725 otype = TREE_TYPE (value);
3727 /* Optionally warn about potentially worrisome casts. */
3730 && TREE_CODE (type) == POINTER_TYPE
3731 && TREE_CODE (otype) == POINTER_TYPE)
3733 tree in_type = type;
3734 tree in_otype = otype;
3738 /* Check that the qualifiers on IN_TYPE are a superset of
3739 the qualifiers of IN_OTYPE. The outermost level of
3740 POINTER_TYPE nodes is uninteresting and we stop as soon
3741 as we hit a non-POINTER_TYPE node on either type. */
3744 in_otype = TREE_TYPE (in_otype);
3745 in_type = TREE_TYPE (in_type);
3747 /* GNU C allows cv-qualified function types. 'const'
3748 means the function is very pure, 'volatile' means it
3749 can't return. We need to warn when such qualifiers
3750 are added, not when they're taken away. */
3751 if (TREE_CODE (in_otype) == FUNCTION_TYPE
3752 && TREE_CODE (in_type) == FUNCTION_TYPE)
3753 added |= (TYPE_QUALS (in_type) & ~TYPE_QUALS (in_otype));
3755 discarded |= (TYPE_QUALS (in_otype) & ~TYPE_QUALS (in_type));
3757 while (TREE_CODE (in_type) == POINTER_TYPE
3758 && TREE_CODE (in_otype) == POINTER_TYPE);
3761 warning (OPT_Wcast_qual, "cast adds new qualifiers to function type");
3764 /* There are qualifiers present in IN_OTYPE that are not
3765 present in IN_TYPE. */
3766 warning (OPT_Wcast_qual, "cast discards qualifiers from pointer target type");
3769 /* Warn about possible alignment problems. */
3770 if (STRICT_ALIGNMENT
3771 && TREE_CODE (type) == POINTER_TYPE
3772 && TREE_CODE (otype) == POINTER_TYPE
3773 && TREE_CODE (TREE_TYPE (otype)) != VOID_TYPE
3774 && TREE_CODE (TREE_TYPE (otype)) != FUNCTION_TYPE
3775 /* Don't warn about opaque types, where the actual alignment
3776 restriction is unknown. */
3777 && !((TREE_CODE (TREE_TYPE (otype)) == UNION_TYPE
3778 || TREE_CODE (TREE_TYPE (otype)) == RECORD_TYPE)
3779 && TYPE_MODE (TREE_TYPE (otype)) == VOIDmode)
3780 && TYPE_ALIGN (TREE_TYPE (type)) > TYPE_ALIGN (TREE_TYPE (otype)))
3781 warning (OPT_Wcast_align,
3782 "cast increases required alignment of target type");
3784 if (TREE_CODE (type) == INTEGER_TYPE
3785 && TREE_CODE (otype) == POINTER_TYPE
3786 && TYPE_PRECISION (type) != TYPE_PRECISION (otype))
3787 /* Unlike conversion of integers to pointers, where the
3788 warning is disabled for converting constants because
3789 of cases such as SIG_*, warn about converting constant
3790 pointers to integers. In some cases it may cause unwanted
3791 sign extension, and a warning is appropriate. */
3792 warning (OPT_Wpointer_to_int_cast,
3793 "cast from pointer to integer of different size");
3795 if (TREE_CODE (value) == CALL_EXPR
3796 && TREE_CODE (type) != TREE_CODE (otype))
3797 warning (OPT_Wbad_function_cast, "cast from function call of type %qT "
3798 "to non-matching type %qT", otype, type);
3800 if (TREE_CODE (type) == POINTER_TYPE
3801 && TREE_CODE (otype) == INTEGER_TYPE
3802 && TYPE_PRECISION (type) != TYPE_PRECISION (otype)
3803 /* Don't warn about converting any constant. */
3804 && !TREE_CONSTANT (value))
3805 warning (OPT_Wint_to_pointer_cast, "cast to pointer from integer "
3806 "of different size");
3808 if (warn_strict_aliasing <= 2)
3809 strict_aliasing_warning (otype, type, expr);
3811 /* If pedantic, warn for conversions between function and object
3812 pointer types, except for converting a null pointer constant
3813 to function pointer type. */
3815 && TREE_CODE (type) == POINTER_TYPE
3816 && TREE_CODE (otype) == POINTER_TYPE
3817 && TREE_CODE (TREE_TYPE (otype)) == FUNCTION_TYPE
3818 && TREE_CODE (TREE_TYPE (type)) != FUNCTION_TYPE)
3819 pedwarn (input_location, OPT_pedantic, "ISO C forbids "
3820 "conversion of function pointer to object pointer type");
3823 && TREE_CODE (type) == POINTER_TYPE
3824 && TREE_CODE (otype) == POINTER_TYPE
3825 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE
3826 && TREE_CODE (TREE_TYPE (otype)) != FUNCTION_TYPE
3827 && !null_pointer_constant_p (value))
3828 pedwarn (input_location, OPT_pedantic, "ISO C forbids "
3829 "conversion of object pointer to function pointer type");
3832 value = convert (type, value);
3834 /* Ignore any integer overflow caused by the cast. */
3835 if (TREE_CODE (value) == INTEGER_CST)
3837 if (CONSTANT_CLASS_P (ovalue) && TREE_OVERFLOW (ovalue))
3839 if (!TREE_OVERFLOW (value))
3841 /* Avoid clobbering a shared constant. */
3842 value = copy_node (value);
3843 TREE_OVERFLOW (value) = TREE_OVERFLOW (ovalue);
3846 else if (TREE_OVERFLOW (value))
3847 /* Reset VALUE's overflow flags, ensuring constant sharing. */
3848 value = build_int_cst_wide (TREE_TYPE (value),
3849 TREE_INT_CST_LOW (value),
3850 TREE_INT_CST_HIGH (value));
3854 /* Don't let a cast be an lvalue. */
3856 value = non_lvalue (value);
3861 /* Interpret a cast of expression EXPR to type TYPE. */
3863 c_cast_expr (struct c_type_name *type_name, tree expr)
3866 int saved_wsp = warn_strict_prototypes;
3868 /* This avoids warnings about unprototyped casts on
3869 integers. E.g. "#define SIG_DFL (void(*)())0". */
3870 if (TREE_CODE (expr) == INTEGER_CST)
3871 warn_strict_prototypes = 0;
3872 type = groktypename (type_name);
3873 warn_strict_prototypes = saved_wsp;
3875 return build_c_cast (type, expr);
3878 /* Build an assignment expression of lvalue LHS from value RHS.
3879 MODIFYCODE is the code for a binary operator that we use
3880 to combine the old value of LHS with RHS to get the new value.
3881 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
3883 LOCATION is the location of the MODIFYCODE operator. */
3886 build_modify_expr (location_t location,
3887 tree lhs, enum tree_code modifycode, tree rhs)
3891 tree lhstype = TREE_TYPE (lhs);
3892 tree olhstype = lhstype;
3894 /* Types that aren't fully specified cannot be used in assignments. */
3895 lhs = require_complete_type (lhs);
3897 /* Avoid duplicate error messages from operands that had errors. */
3898 if (TREE_CODE (lhs) == ERROR_MARK || TREE_CODE (rhs) == ERROR_MARK)
3899 return error_mark_node;
3901 if (!lvalue_or_else (lhs, lv_assign))
3902 return error_mark_node;
3904 STRIP_TYPE_NOPS (rhs);
3908 /* If a binary op has been requested, combine the old LHS value with the RHS
3909 producing the value we should actually store into the LHS. */
3911 if (modifycode != NOP_EXPR)
3913 lhs = stabilize_reference (lhs);
3914 newrhs = build_binary_op (location,
3915 modifycode, lhs, rhs, 1);
3918 /* Give an error for storing in something that is 'const'. */
3920 if (TREE_READONLY (lhs) || TYPE_READONLY (lhstype)
3921 || ((TREE_CODE (lhstype) == RECORD_TYPE
3922 || TREE_CODE (lhstype) == UNION_TYPE)
3923 && C_TYPE_FIELDS_READONLY (lhstype)))
3925 readonly_error (lhs, lv_assign);
3926 return error_mark_node;
3929 /* If storing into a structure or union member,
3930 it has probably been given type `int'.
3931 Compute the type that would go with
3932 the actual amount of storage the member occupies. */
3934 if (TREE_CODE (lhs) == COMPONENT_REF
3935 && (TREE_CODE (lhstype) == INTEGER_TYPE
3936 || TREE_CODE (lhstype) == BOOLEAN_TYPE
3937 || TREE_CODE (lhstype) == REAL_TYPE
3938 || TREE_CODE (lhstype) == ENUMERAL_TYPE))
3939 lhstype = TREE_TYPE (get_unwidened (lhs, 0));
3941 /* If storing in a field that is in actuality a short or narrower than one,
3942 we must store in the field in its actual type. */
3944 if (lhstype != TREE_TYPE (lhs))
3946 lhs = copy_node (lhs);
3947 TREE_TYPE (lhs) = lhstype;
3950 /* Convert new value to destination type. */
3952 newrhs = convert_for_assignment (lhstype, newrhs, ic_assign,
3953 NULL_TREE, NULL_TREE, 0);
3954 if (TREE_CODE (newrhs) == ERROR_MARK)
3955 return error_mark_node;
3957 /* Emit ObjC write barrier, if necessary. */
3958 if (c_dialect_objc () && flag_objc_gc)
3960 result = objc_generate_write_barrier (lhs, modifycode, newrhs);
3963 protected_set_expr_location (result, location);
3968 /* Scan operands. */
3970 result = build2 (MODIFY_EXPR, lhstype, lhs, newrhs);
3971 TREE_SIDE_EFFECTS (result) = 1;
3972 protected_set_expr_location (result, location);
3974 /* If we got the LHS in a different type for storing in,
3975 convert the result back to the nominal type of LHS
3976 so that the value we return always has the same type
3977 as the LHS argument. */
3979 if (olhstype == TREE_TYPE (result))
3982 result = convert_for_assignment (olhstype, result, ic_assign,
3983 NULL_TREE, NULL_TREE, 0);
3984 protected_set_expr_location (result, location);
3988 /* Convert value RHS to type TYPE as preparation for an assignment
3989 to an lvalue of type TYPE.
3990 The real work of conversion is done by `convert'.
3991 The purpose of this function is to generate error messages
3992 for assignments that are not allowed in C.
3993 ERRTYPE says whether it is argument passing, assignment,
3994 initialization or return.
3996 FUNCTION is a tree for the function being called.
3997 PARMNUM is the number of the argument, for printing in error messages. */
4000 convert_for_assignment (tree type, tree rhs, enum impl_conv errtype,
4001 tree fundecl, tree function, int parmnum)
4003 enum tree_code codel = TREE_CODE (type);
4005 enum tree_code coder;
4006 tree rname = NULL_TREE;
4007 bool objc_ok = false;
4009 if (errtype == ic_argpass)
4012 /* Change pointer to function to the function itself for
4014 if (TREE_CODE (function) == ADDR_EXPR
4015 && TREE_CODE (TREE_OPERAND (function, 0)) == FUNCTION_DECL)
4016 function = TREE_OPERAND (function, 0);
4018 /* Handle an ObjC selector specially for diagnostics. */
4019 selector = objc_message_selector ();
4021 if (selector && parmnum > 2)
4028 /* This macro is used to emit diagnostics to ensure that all format
4029 strings are complete sentences, visible to gettext and checked at
4031 #define WARN_FOR_ASSIGNMENT(LOCATION, OPT, AR, AS, IN, RE) \
4036 if (pedwarn (LOCATION, OPT, AR, parmnum, rname)) \
4037 inform ((fundecl && !DECL_IS_BUILTIN (fundecl)) \
4038 ? DECL_SOURCE_LOCATION (fundecl) : LOCATION, \
4039 "expected %qT but argument is of type %qT", \
4043 pedwarn (LOCATION, OPT, AS); \
4046 pedwarn (LOCATION, OPT, IN); \
4049 pedwarn (LOCATION, OPT, RE); \
4052 gcc_unreachable (); \
4056 STRIP_TYPE_NOPS (rhs);
4058 if (optimize && TREE_CODE (rhs) == VAR_DECL
4059 && TREE_CODE (TREE_TYPE (rhs)) != ARRAY_TYPE)
4060 rhs = decl_constant_value_for_broken_optimization (rhs);
4062 rhstype = TREE_TYPE (rhs);
4063 coder = TREE_CODE (rhstype);
4065 if (coder == ERROR_MARK)
4066 return error_mark_node;
4068 if (c_dialect_objc ())
4091 objc_ok = objc_compare_types (type, rhstype, parmno, rname);
4094 if (TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (rhstype))
4097 if (coder == VOID_TYPE)
4099 /* Except for passing an argument to an unprototyped function,
4100 this is a constraint violation. When passing an argument to
4101 an unprototyped function, it is compile-time undefined;
4102 making it a constraint in that case was rejected in
4104 error ("void value not ignored as it ought to be");
4105 return error_mark_node;
4107 rhs = require_complete_type (rhs);
4108 if (rhs == error_mark_node)
4109 return error_mark_node;
4110 /* A type converts to a reference to it.
4111 This code doesn't fully support references, it's just for the
4112 special case of va_start and va_copy. */
4113 if (codel == REFERENCE_TYPE
4114 && comptypes (TREE_TYPE (type), TREE_TYPE (rhs)) == 1)
4116 if (!lvalue_p (rhs))
4118 error ("cannot pass rvalue to reference parameter");
4119 return error_mark_node;
4121 if (!c_mark_addressable (rhs))
4122 return error_mark_node;
4123 rhs = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (rhs)), rhs);
4125 /* We already know that these two types are compatible, but they
4126 may not be exactly identical. In fact, `TREE_TYPE (type)' is
4127 likely to be __builtin_va_list and `TREE_TYPE (rhs)' is
4128 likely to be va_list, a typedef to __builtin_va_list, which
4129 is different enough that it will cause problems later. */
4130 if (TREE_TYPE (TREE_TYPE (rhs)) != TREE_TYPE (type))
4131 rhs = build1 (NOP_EXPR, build_pointer_type (TREE_TYPE (type)), rhs);
4133 rhs = build1 (NOP_EXPR, type, rhs);
4136 /* Some types can interconvert without explicit casts. */
4137 else if (codel == VECTOR_TYPE && coder == VECTOR_TYPE
4138 && vector_types_convertible_p (type, TREE_TYPE (rhs), true))
4139 return convert (type, rhs);
4140 /* Arithmetic types all interconvert, and enum is treated like int. */
4141 else if ((codel == INTEGER_TYPE || codel == REAL_TYPE
4142 || codel == FIXED_POINT_TYPE
4143 || codel == ENUMERAL_TYPE || codel == COMPLEX_TYPE
4144 || codel == BOOLEAN_TYPE)
4145 && (coder == INTEGER_TYPE || coder == REAL_TYPE
4146 || coder == FIXED_POINT_TYPE
4147 || coder == ENUMERAL_TYPE || coder == COMPLEX_TYPE
4148 || coder == BOOLEAN_TYPE))
4149 return convert_and_check (type, rhs);
4151 /* Aggregates in different TUs might need conversion. */
4152 if ((codel == RECORD_TYPE || codel == UNION_TYPE)
4154 && comptypes (type, rhstype))
4155 return convert_and_check (type, rhs);
4157 /* Conversion to a transparent union from its member types.
4158 This applies only to function arguments. */
4159 if (codel == UNION_TYPE && TYPE_TRANSPARENT_UNION (type)
4160 && errtype == ic_argpass)
4162 tree memb, marginal_memb = NULL_TREE;
4164 for (memb = TYPE_FIELDS (type); memb ; memb = TREE_CHAIN (memb))
4166 tree memb_type = TREE_TYPE (memb);
4168 if (comptypes (TYPE_MAIN_VARIANT (memb_type),
4169 TYPE_MAIN_VARIANT (rhstype)))
4172 if (TREE_CODE (memb_type) != POINTER_TYPE)
4175 if (coder == POINTER_TYPE)
4177 tree ttl = TREE_TYPE (memb_type);
4178 tree ttr = TREE_TYPE (rhstype);
4180 /* Any non-function converts to a [const][volatile] void *
4181 and vice versa; otherwise, targets must be the same.
4182 Meanwhile, the lhs target must have all the qualifiers of
4184 if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
4185 || comp_target_types (memb_type, rhstype))
4187 /* If this type won't generate any warnings, use it. */
4188 if (TYPE_QUALS (ttl) == TYPE_QUALS (ttr)
4189 || ((TREE_CODE (ttr) == FUNCTION_TYPE
4190 && TREE_CODE (ttl) == FUNCTION_TYPE)
4191 ? ((TYPE_QUALS (ttl) | TYPE_QUALS (ttr))
4192 == TYPE_QUALS (ttr))
4193 : ((TYPE_QUALS (ttl) | TYPE_QUALS (ttr))
4194 == TYPE_QUALS (ttl))))
4197 /* Keep looking for a better type, but remember this one. */
4199 marginal_memb = memb;
4203 /* Can convert integer zero to any pointer type. */
4204 if (null_pointer_constant_p (rhs))
4206 rhs = null_pointer_node;
4211 if (memb || marginal_memb)
4215 /* We have only a marginally acceptable member type;
4216 it needs a warning. */
4217 tree ttl = TREE_TYPE (TREE_TYPE (marginal_memb));
4218 tree ttr = TREE_TYPE (rhstype);
4220 /* Const and volatile mean something different for function
4221 types, so the usual warnings are not appropriate. */
4222 if (TREE_CODE (ttr) == FUNCTION_TYPE
4223 && TREE_CODE (ttl) == FUNCTION_TYPE)
4225 /* Because const and volatile on functions are
4226 restrictions that say the function will not do
4227 certain things, it is okay to use a const or volatile
4228 function where an ordinary one is wanted, but not
4230 if (TYPE_QUALS (ttl) & ~TYPE_QUALS (ttr))
4231 WARN_FOR_ASSIGNMENT (input_location, 0,
4232 G_("passing argument %d of %qE "
4233 "makes qualified function "
4234 "pointer from unqualified"),
4235 G_("assignment makes qualified "
4236 "function pointer from "
4238 G_("initialization makes qualified "
4239 "function pointer from "
4241 G_("return makes qualified function "
4242 "pointer from unqualified"));
4244 else if (TYPE_QUALS (ttr) & ~TYPE_QUALS (ttl))
4245 WARN_FOR_ASSIGNMENT (input_location, 0,
4246 G_("passing argument %d of %qE discards "
4247 "qualifiers from pointer target type"),
4248 G_("assignment discards qualifiers "
4249 "from pointer target type"),
4250 G_("initialization discards qualifiers "
4251 "from pointer target type"),
4252 G_("return discards qualifiers from "
4253 "pointer target type"));
4255 memb = marginal_memb;
4258 if (!fundecl || !DECL_IN_SYSTEM_HEADER (fundecl))
4259 pedwarn (input_location, OPT_pedantic,
4260 "ISO C prohibits argument conversion to union type");
4262 rhs = fold_convert (TREE_TYPE (memb), rhs);
4263 return build_constructor_single (type, memb, rhs);
4267 /* Conversions among pointers */
4268 else if ((codel == POINTER_TYPE || codel == REFERENCE_TYPE)
4269 && (coder == codel))
4271 tree ttl = TREE_TYPE (type);
4272 tree ttr = TREE_TYPE (rhstype);
4275 bool is_opaque_pointer;
4276 int target_cmp = 0; /* Cache comp_target_types () result. */
4278 if (TREE_CODE (mvl) != ARRAY_TYPE)
4279 mvl = TYPE_MAIN_VARIANT (mvl);
4280 if (TREE_CODE (mvr) != ARRAY_TYPE)
4281 mvr = TYPE_MAIN_VARIANT (mvr);
4282 /* Opaque pointers are treated like void pointers. */
4283 is_opaque_pointer = vector_targets_convertible_p (ttl, ttr);
4285 /* C++ does not allow the implicit conversion void* -> T*. However,
4286 for the purpose of reducing the number of false positives, we
4287 tolerate the special case of
4291 where NULL is typically defined in C to be '(void *) 0'. */
4292 if (VOID_TYPE_P (ttr) && rhs != null_pointer_node && !VOID_TYPE_P (ttl))
4293 warning (OPT_Wc___compat, "request for implicit conversion from "
4294 "%qT to %qT not permitted in C++", rhstype, type);
4296 /* Check if the right-hand side has a format attribute but the
4297 left-hand side doesn't. */
4298 if (warn_missing_format_attribute
4299 && check_missing_format_attribute (type, rhstype))
4304 warning (OPT_Wmissing_format_attribute,
4305 "argument %d of %qE might be "
4306 "a candidate for a format attribute",
4310 warning (OPT_Wmissing_format_attribute,
4311 "assignment left-hand side might be "
4312 "a candidate for a format attribute");
4315 warning (OPT_Wmissing_format_attribute,
4316 "initialization left-hand side might be "
4317 "a candidate for a format attribute");
4320 warning (OPT_Wmissing_format_attribute,
4321 "return type might be "
4322 "a candidate for a format attribute");
4329 /* Any non-function converts to a [const][volatile] void *
4330 and vice versa; otherwise, targets must be the same.
4331 Meanwhile, the lhs target must have all the qualifiers of the rhs. */
4332 if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
4333 || (target_cmp = comp_target_types (type, rhstype))
4334 || is_opaque_pointer
4335 || (c_common_unsigned_type (mvl)
4336 == c_common_unsigned_type (mvr)))
4339 && ((VOID_TYPE_P (ttl) && TREE_CODE (ttr) == FUNCTION_TYPE)
4342 && !null_pointer_constant_p (rhs)
4343 && TREE_CODE (ttl) == FUNCTION_TYPE)))
4344 WARN_FOR_ASSIGNMENT (input_location, OPT_pedantic,
4345 G_("ISO C forbids passing argument %d of "
4346 "%qE between function pointer "
4348 G_("ISO C forbids assignment between "
4349 "function pointer and %<void *%>"),
4350 G_("ISO C forbids initialization between "
4351 "function pointer and %<void *%>"),
4352 G_("ISO C forbids return between function "
4353 "pointer and %<void *%>"));
4354 /* Const and volatile mean something different for function types,
4355 so the usual warnings are not appropriate. */
4356 else if (TREE_CODE (ttr) != FUNCTION_TYPE
4357 && TREE_CODE (ttl) != FUNCTION_TYPE)
4359 if (TYPE_QUALS (ttr) & ~TYPE_QUALS (ttl))
4361 /* Types differing only by the presence of the 'volatile'
4362 qualifier are acceptable if the 'volatile' has been added
4363 in by the Objective-C EH machinery. */
4364 if (!objc_type_quals_match (ttl, ttr))
4365 WARN_FOR_ASSIGNMENT (input_location, 0,
4366 G_("passing argument %d of %qE discards "
4367 "qualifiers from pointer target type"),
4368 G_("assignment discards qualifiers "
4369 "from pointer target type"),
4370 G_("initialization discards qualifiers "
4371 "from pointer target type"),
4372 G_("return discards qualifiers from "
4373 "pointer target type"));
4375 /* If this is not a case of ignoring a mismatch in signedness,
4377 else if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
4380 /* If there is a mismatch, do warn. */
4381 else if (warn_pointer_sign)
4382 WARN_FOR_ASSIGNMENT (input_location, OPT_Wpointer_sign,
4383 G_("pointer targets in passing argument "
4384 "%d of %qE differ in signedness"),
4385 G_("pointer targets in assignment "
4386 "differ in signedness"),
4387 G_("pointer targets in initialization "
4388 "differ in signedness"),
4389 G_("pointer targets in return differ "
4392 else if (TREE_CODE (ttl) == FUNCTION_TYPE
4393 && TREE_CODE (ttr) == FUNCTION_TYPE)
4395 /* Because const and volatile on functions are restrictions
4396 that say the function will not do certain things,
4397 it is okay to use a const or volatile function
4398 where an ordinary one is wanted, but not vice-versa. */
4399 if (TYPE_QUALS (ttl) & ~TYPE_QUALS (ttr))
4400 WARN_FOR_ASSIGNMENT (input_location, 0,
4401 G_("passing argument %d of %qE makes "
4402 "qualified function pointer "
4403 "from unqualified"),
4404 G_("assignment makes qualified function "
4405 "pointer from unqualified"),
4406 G_("initialization makes qualified "
4407 "function pointer from unqualified"),
4408 G_("return makes qualified function "
4409 "pointer from unqualified"));
4413 /* Avoid warning about the volatile ObjC EH puts on decls. */
4415 WARN_FOR_ASSIGNMENT (input_location, 0,
4416 G_("passing argument %d of %qE from "
4417 "incompatible pointer type"),
4418 G_("assignment from incompatible pointer type"),
4419 G_("initialization from incompatible "
4421 G_("return from incompatible pointer type"));
4423 return convert (type, rhs);
4425 else if (codel == POINTER_TYPE && coder == ARRAY_TYPE)
4427 /* ??? This should not be an error when inlining calls to
4428 unprototyped functions. */
4429 error ("invalid use of non-lvalue array");
4430 return error_mark_node;
4432 else if (codel == POINTER_TYPE && coder == INTEGER_TYPE)
4434 /* An explicit constant 0 can convert to a pointer,
4435 or one that results from arithmetic, even including
4436 a cast to integer type. */
4437 if (!null_pointer_constant_p (rhs))
4438 WARN_FOR_ASSIGNMENT (input_location, 0,
4439 G_("passing argument %d of %qE makes "
4440 "pointer from integer without a cast"),
4441 G_("assignment makes pointer from integer "
4443 G_("initialization makes pointer from "
4444 "integer without a cast"),
4445 G_("return makes pointer from integer "
4448 return convert (type, rhs);
4450 else if (codel == INTEGER_TYPE && coder == POINTER_TYPE)
4452 WARN_FOR_ASSIGNMENT (input_location, 0,
4453 G_("passing argument %d of %qE makes integer "
4454 "from pointer without a cast"),
4455 G_("assignment makes integer from pointer "
4457 G_("initialization makes integer from pointer "
4459 G_("return makes integer from pointer "
4461 return convert (type, rhs);
4463 else if (codel == BOOLEAN_TYPE && coder == POINTER_TYPE)
4464 return convert (type, rhs);
4469 error ("incompatible type for argument %d of %qE", parmnum, rname);
4470 inform ((fundecl && !DECL_IS_BUILTIN (fundecl))
4471 ? DECL_SOURCE_LOCATION (fundecl) : input_location,
4472 "expected %qT but argument is of type %qT", type, rhstype);
4475 error ("incompatible types when assigning to type %qT from type %qT",
4479 error ("incompatible types when initializing type %qT using type %qT",
4483 error ("incompatible types when returning type %qT but %qT was expected",
4490 return error_mark_node;
4493 /* If VALUE is a compound expr all of whose expressions are constant, then
4494 return its value. Otherwise, return error_mark_node.
4496 This is for handling COMPOUND_EXPRs as initializer elements
4497 which is allowed with a warning when -pedantic is specified. */
4500 valid_compound_expr_initializer (tree value, tree endtype)
4502 if (TREE_CODE (value) == COMPOUND_EXPR)
4504 if (valid_compound_expr_initializer (TREE_OPERAND (value, 0), endtype)
4506 return error_mark_node;
4507 return valid_compound_expr_initializer (TREE_OPERAND (value, 1),
4510 else if (!initializer_constant_valid_p (value, endtype))
4511 return error_mark_node;
4516 /* Perform appropriate conversions on the initial value of a variable,
4517 store it in the declaration DECL,
4518 and print any error messages that are appropriate.
4519 If the init is invalid, store an ERROR_MARK. */
4522 store_init_value (tree decl, tree init)
4526 /* If variable's type was invalidly declared, just ignore it. */
4528 type = TREE_TYPE (decl);
4529 if (TREE_CODE (type) == ERROR_MARK)
4532 /* Digest the specified initializer into an expression. */
4534 value = digest_init (type, init, true, TREE_STATIC (decl));
4536 /* Store the expression if valid; else report error. */
4538 if (!in_system_header
4539 && AGGREGATE_TYPE_P (TREE_TYPE (decl)) && !TREE_STATIC (decl))
4540 warning (OPT_Wtraditional, "traditional C rejects automatic "
4541 "aggregate initialization");
4543 DECL_INITIAL (decl) = value;
4545 /* ANSI wants warnings about out-of-range constant initializers. */
4546 STRIP_TYPE_NOPS (value);
4547 if (TREE_STATIC (decl))
4548 constant_expression_warning (value);
4550 /* Check if we need to set array size from compound literal size. */
4551 if (TREE_CODE (type) == ARRAY_TYPE
4552 && TYPE_DOMAIN (type) == 0
4553 && value != error_mark_node)
4555 tree inside_init = init;
4557 STRIP_TYPE_NOPS (inside_init);
4558 inside_init = fold (inside_init);
4560 if (TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
4562 tree cldecl = COMPOUND_LITERAL_EXPR_DECL (inside_init);
4564 if (TYPE_DOMAIN (TREE_TYPE (cldecl)))
4566 /* For int foo[] = (int [3]){1}; we need to set array size
4567 now since later on array initializer will be just the
4568 brace enclosed list of the compound literal. */
4569 type = build_distinct_type_copy (TYPE_MAIN_VARIANT (type));
4570 TREE_TYPE (decl) = type;
4571 TYPE_DOMAIN (type) = TYPE_DOMAIN (TREE_TYPE (cldecl));
4573 layout_decl (cldecl, 0);
4579 /* Methods for storing and printing names for error messages. */
4581 /* Implement a spelling stack that allows components of a name to be pushed
4582 and popped. Each element on the stack is this structure. */
4589 unsigned HOST_WIDE_INT i;
4594 #define SPELLING_STRING 1
4595 #define SPELLING_MEMBER 2
4596 #define SPELLING_BOUNDS 3
4598 static struct spelling *spelling; /* Next stack element (unused). */
4599 static struct spelling *spelling_base; /* Spelling stack base. */
4600 static int spelling_size; /* Size of the spelling stack. */
4602 /* Macros to save and restore the spelling stack around push_... functions.
4603 Alternative to SAVE_SPELLING_STACK. */
4605 #define SPELLING_DEPTH() (spelling - spelling_base)
4606 #define RESTORE_SPELLING_DEPTH(DEPTH) (spelling = spelling_base + (DEPTH))
4608 /* Push an element on the spelling stack with type KIND and assign VALUE
4611 #define PUSH_SPELLING(KIND, VALUE, MEMBER) \
4613 int depth = SPELLING_DEPTH (); \
4615 if (depth >= spelling_size) \
4617 spelling_size += 10; \
4618 spelling_base = XRESIZEVEC (struct spelling, spelling_base, \
4620 RESTORE_SPELLING_DEPTH (depth); \
4623 spelling->kind = (KIND); \
4624 spelling->MEMBER = (VALUE); \
4628 /* Push STRING on the stack. Printed literally. */
4631 push_string (const char *string)
4633 PUSH_SPELLING (SPELLING_STRING, string, u.s);
4636 /* Push a member name on the stack. Printed as '.' STRING. */
4639 push_member_name (tree decl)
4641 const char *const string
4642 = DECL_NAME (decl) ? IDENTIFIER_POINTER (DECL_NAME (decl)) : "<anonymous>";
4643 PUSH_SPELLING (SPELLING_MEMBER, string, u.s);
4646 /* Push an array bounds on the stack. Printed as [BOUNDS]. */
4649 push_array_bounds (unsigned HOST_WIDE_INT bounds)
4651 PUSH_SPELLING (SPELLING_BOUNDS, bounds, u.i);
4654 /* Compute the maximum size in bytes of the printed spelling. */
4657 spelling_length (void)
4662 for (p = spelling_base; p < spelling; p++)
4664 if (p->kind == SPELLING_BOUNDS)
4667 size += strlen (p->u.s) + 1;
4673 /* Print the spelling to BUFFER and return it. */
4676 print_spelling (char *buffer)
4681 for (p = spelling_base; p < spelling; p++)
4682 if (p->kind == SPELLING_BOUNDS)
4684 sprintf (d, "[" HOST_WIDE_INT_PRINT_UNSIGNED "]", p->u.i);
4690 if (p->kind == SPELLING_MEMBER)
4692 for (s = p->u.s; (*d = *s++); d++)
4699 /* Issue an error message for a bad initializer component.
4700 MSGID identifies the message.
4701 The component name is taken from the spelling stack. */
4704 error_init (const char *msgid)
4708 error ("%s", _(msgid));
4709 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4711 error ("(near initialization for %qs)", ofwhat);
4714 /* Issue a pedantic warning for a bad initializer component. OPT is
4715 the option OPT_* (from options.h) controlling this warning or 0 if
4716 it is unconditionally given. MSGID identifies the message. The
4717 component name is taken from the spelling stack. */
4720 pedwarn_init (location_t location, int opt, const char *msgid)
4724 pedwarn (location, opt, "%s", _(msgid));
4725 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4727 pedwarn (location, opt, "(near initialization for %qs)", ofwhat);
4730 /* Issue a warning for a bad initializer component.
4732 OPT is the OPT_W* value corresponding to the warning option that
4733 controls this warning. MSGID identifies the message. The
4734 component name is taken from the spelling stack. */
4737 warning_init (int opt, const char *msgid)
4741 warning (opt, "%s", _(msgid));
4742 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4744 warning (opt, "(near initialization for %qs)", ofwhat);
4747 /* If TYPE is an array type and EXPR is a parenthesized string
4748 constant, warn if pedantic that EXPR is being used to initialize an
4749 object of type TYPE. */
4752 maybe_warn_string_init (tree type, struct c_expr expr)
4755 && TREE_CODE (type) == ARRAY_TYPE
4756 && TREE_CODE (expr.value) == STRING_CST
4757 && expr.original_code != STRING_CST)
4758 pedwarn_init (input_location, OPT_pedantic,
4759 "array initialized from parenthesized string constant");
4762 /* Digest the parser output INIT as an initializer for type TYPE.
4763 Return a C expression of type TYPE to represent the initial value.
4765 If INIT is a string constant, STRICT_STRING is true if it is
4766 unparenthesized or we should not warn here for it being parenthesized.
4767 For other types of INIT, STRICT_STRING is not used.
4769 REQUIRE_CONSTANT requests an error if non-constant initializers or
4770 elements are seen. */
4773 digest_init (tree type, tree init, bool strict_string, int require_constant)
4775 enum tree_code code = TREE_CODE (type);
4776 tree inside_init = init;
4778 if (type == error_mark_node
4780 || init == error_mark_node
4781 || TREE_TYPE (init) == error_mark_node)
4782 return error_mark_node;
4784 STRIP_TYPE_NOPS (inside_init);
4786 inside_init = fold (inside_init);
4788 /* Initialization of an array of chars from a string constant
4789 optionally enclosed in braces. */
4791 if (code == ARRAY_TYPE && inside_init
4792 && TREE_CODE (inside_init) == STRING_CST)
4794 tree typ1 = TYPE_MAIN_VARIANT (TREE_TYPE (type));
4795 /* Note that an array could be both an array of character type
4796 and an array of wchar_t if wchar_t is signed char or unsigned
4798 bool char_array = (typ1 == char_type_node
4799 || typ1 == signed_char_type_node
4800 || typ1 == unsigned_char_type_node);
4801 bool wchar_array = !!comptypes (typ1, wchar_type_node);
4802 bool char16_array = !!comptypes (typ1, char16_type_node);
4803 bool char32_array = !!comptypes (typ1, char32_type_node);
4805 if (char_array || wchar_array || char16_array || char32_array)
4808 tree typ2 = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (inside_init)));
4809 expr.value = inside_init;
4810 expr.original_code = (strict_string ? STRING_CST : ERROR_MARK);
4811 maybe_warn_string_init (type, expr);
4813 if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
4814 TYPE_MAIN_VARIANT (type)))
4819 if (typ2 != char_type_node)
4821 error_init ("char-array initialized from wide string");
4822 return error_mark_node;
4827 if (typ2 == char_type_node)
4829 error_init ("wide character array initialized from non-wide "
4831 return error_mark_node;
4833 else if (!comptypes(typ1, typ2))
4835 error_init ("wide character array initialized from "
4836 "incompatible wide string");
4837 return error_mark_node;
4841 TREE_TYPE (inside_init) = type;
4842 if (TYPE_DOMAIN (type) != 0
4843 && TYPE_SIZE (type) != 0
4844 && TREE_CODE (TYPE_SIZE (type)) == INTEGER_CST
4845 /* Subtract the size of a single (possibly wide) character
4846 because it's ok to ignore the terminating null char
4847 that is counted in the length of the constant. */
4848 && 0 > compare_tree_int (TYPE_SIZE_UNIT (type),
4849 TREE_STRING_LENGTH (inside_init)
4850 - (TYPE_PRECISION (typ1)
4852 pedwarn_init (input_location, 0,
4853 "initializer-string for array of chars is too long");
4857 else if (INTEGRAL_TYPE_P (typ1))
4859 error_init ("array of inappropriate type initialized "
4860 "from string constant");
4861 return error_mark_node;
4865 /* Build a VECTOR_CST from a *constant* vector constructor. If the
4866 vector constructor is not constant (e.g. {1,2,3,foo()}) then punt
4867 below and handle as a constructor. */
4868 if (code == VECTOR_TYPE
4869 && TREE_CODE (TREE_TYPE (inside_init)) == VECTOR_TYPE
4870 && vector_types_convertible_p (TREE_TYPE (inside_init), type, true)
4871 && TREE_CONSTANT (inside_init))
4873 if (TREE_CODE (inside_init) == VECTOR_CST
4874 && comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
4875 TYPE_MAIN_VARIANT (type)))
4878 if (TREE_CODE (inside_init) == CONSTRUCTOR)
4880 unsigned HOST_WIDE_INT ix;
4882 bool constant_p = true;
4884 /* Iterate through elements and check if all constructor
4885 elements are *_CSTs. */
4886 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (inside_init), ix, value)
4887 if (!CONSTANT_CLASS_P (value))
4894 return build_vector_from_ctor (type,
4895 CONSTRUCTOR_ELTS (inside_init));
4899 if (warn_sequence_point)
4900 verify_sequence_points (inside_init);
4902 /* Any type can be initialized
4903 from an expression of the same type, optionally with braces. */
4905 if (inside_init && TREE_TYPE (inside_init) != 0
4906 && (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
4907 TYPE_MAIN_VARIANT (type))
4908 || (code == ARRAY_TYPE
4909 && comptypes (TREE_TYPE (inside_init), type))
4910 || (code == VECTOR_TYPE
4911 && comptypes (TREE_TYPE (inside_init), type))
4912 || (code == POINTER_TYPE
4913 && TREE_CODE (TREE_TYPE (inside_init)) == ARRAY_TYPE
4914 && comptypes (TREE_TYPE (TREE_TYPE (inside_init)),
4915 TREE_TYPE (type)))))
4917 if (code == POINTER_TYPE)
4919 if (TREE_CODE (TREE_TYPE (inside_init)) == ARRAY_TYPE)
4921 if (TREE_CODE (inside_init) == STRING_CST
4922 || TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
4923 inside_init = array_to_pointer_conversion (inside_init);
4926 error_init ("invalid use of non-lvalue array");
4927 return error_mark_node;
4932 if (code == VECTOR_TYPE)
4933 /* Although the types are compatible, we may require a
4935 inside_init = convert (type, inside_init);
4937 if (require_constant
4938 && (code == VECTOR_TYPE || !flag_isoc99)
4939 && TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
4941 /* As an extension, allow initializing objects with static storage
4942 duration with compound literals (which are then treated just as
4943 the brace enclosed list they contain). Also allow this for
4944 vectors, as we can only assign them with compound literals. */
4945 tree decl = COMPOUND_LITERAL_EXPR_DECL (inside_init);
4946 inside_init = DECL_INITIAL (decl);
4949 if (code == ARRAY_TYPE && TREE_CODE (inside_init) != STRING_CST
4950 && TREE_CODE (inside_init) != CONSTRUCTOR)
4952 error_init ("array initialized from non-constant array expression");
4953 return error_mark_node;
4956 if (optimize && TREE_CODE (inside_init) == VAR_DECL)
4957 inside_init = decl_constant_value_for_broken_optimization (inside_init);
4959 /* Compound expressions can only occur here if -pedantic or
4960 -pedantic-errors is specified. In the later case, we always want
4961 an error. In the former case, we simply want a warning. */
4962 if (require_constant && pedantic
4963 && TREE_CODE (inside_init) == COMPOUND_EXPR)
4966 = valid_compound_expr_initializer (inside_init,
4967 TREE_TYPE (inside_init));
4968 if (inside_init == error_mark_node)
4969 error_init ("initializer element is not constant");
4971 pedwarn_init (input_location, OPT_pedantic,
4972 "initializer element is not constant");
4973 if (flag_pedantic_errors)
4974 inside_init = error_mark_node;
4976 else if (require_constant
4977 && !initializer_constant_valid_p (inside_init,
4978 TREE_TYPE (inside_init)))
4980 error_init ("initializer element is not constant");
4981 inside_init = error_mark_node;
4984 /* Added to enable additional -Wmissing-format-attribute warnings. */
4985 if (TREE_CODE (TREE_TYPE (inside_init)) == POINTER_TYPE)
4986 inside_init = convert_for_assignment (type, inside_init, ic_init, NULL_TREE,
4991 /* Handle scalar types, including conversions. */
4993 if (code == INTEGER_TYPE || code == REAL_TYPE || code == FIXED_POINT_TYPE
4994 || code == POINTER_TYPE || code == ENUMERAL_TYPE || code == BOOLEAN_TYPE
4995 || code == COMPLEX_TYPE || code == VECTOR_TYPE)
4997 if (TREE_CODE (TREE_TYPE (init)) == ARRAY_TYPE
4998 && (TREE_CODE (init) == STRING_CST
4999 || TREE_CODE (init) == COMPOUND_LITERAL_EXPR))
5000 init = array_to_pointer_conversion (init);
5002 = convert_for_assignment (type, init, ic_init,
5003 NULL_TREE, NULL_TREE, 0);
5005 /* Check to see if we have already given an error message. */
5006 if (inside_init == error_mark_node)
5008 else if (require_constant && !TREE_CONSTANT (inside_init))
5010 error_init ("initializer element is not constant");
5011 inside_init = error_mark_node;
5013 else if (require_constant
5014 && !initializer_constant_valid_p (inside_init,
5015 TREE_TYPE (inside_init)))
5017 error_init ("initializer element is not computable at load time");
5018 inside_init = error_mark_node;
5024 /* Come here only for records and arrays. */
5026 if (COMPLETE_TYPE_P (type) && TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST)
5028 error_init ("variable-sized object may not be initialized");
5029 return error_mark_node;
5032 error_init ("invalid initializer");
5033 return error_mark_node;
5036 /* Handle initializers that use braces. */
5038 /* Type of object we are accumulating a constructor for.
5039 This type is always a RECORD_TYPE, UNION_TYPE or ARRAY_TYPE. */
5040 static tree constructor_type;
5042 /* For a RECORD_TYPE or UNION_TYPE, this is the chain of fields
5044 static tree constructor_fields;
5046 /* For an ARRAY_TYPE, this is the specified index
5047 at which to store the next element we get. */
5048 static tree constructor_index;
5050 /* For an ARRAY_TYPE, this is the maximum index. */
5051 static tree constructor_max_index;
5053 /* For a RECORD_TYPE, this is the first field not yet written out. */
5054 static tree constructor_unfilled_fields;
5056 /* For an ARRAY_TYPE, this is the index of the first element
5057 not yet written out. */
5058 static tree constructor_unfilled_index;
5060 /* In a RECORD_TYPE, the byte index of the next consecutive field.
5061 This is so we can generate gaps between fields, when appropriate. */
5062 static tree constructor_bit_index;
5064 /* If we are saving up the elements rather than allocating them,
5065 this is the list of elements so far (in reverse order,
5066 most recent first). */
5067 static VEC(constructor_elt,gc) *constructor_elements;
5069 /* 1 if constructor should be incrementally stored into a constructor chain,
5070 0 if all the elements should be kept in AVL tree. */
5071 static int constructor_incremental;
5073 /* 1 if so far this constructor's elements are all compile-time constants. */
5074 static int constructor_constant;
5076 /* 1 if so far this constructor's elements are all valid address constants. */
5077 static int constructor_simple;
5079 /* 1 if this constructor is erroneous so far. */
5080 static int constructor_erroneous;
5082 /* Structure for managing pending initializer elements, organized as an
5087 struct init_node *left, *right;
5088 struct init_node *parent;
5094 /* Tree of pending elements at this constructor level.
5095 These are elements encountered out of order
5096 which belong at places we haven't reached yet in actually
5098 Will never hold tree nodes across GC runs. */
5099 static struct init_node *constructor_pending_elts;
5101 /* The SPELLING_DEPTH of this constructor. */
5102 static int constructor_depth;
5104 /* DECL node for which an initializer is being read.
5105 0 means we are reading a constructor expression
5106 such as (struct foo) {...}. */
5107 static tree constructor_decl;
5109 /* Nonzero if this is an initializer for a top-level decl. */
5110 static int constructor_top_level;
5112 /* Nonzero if there were any member designators in this initializer. */
5113 static int constructor_designated;
5115 /* Nesting depth of designator list. */
5116 static int designator_depth;
5118 /* Nonzero if there were diagnosed errors in this designator list. */
5119 static int designator_erroneous;
5122 /* This stack has a level for each implicit or explicit level of
5123 structuring in the initializer, including the outermost one. It
5124 saves the values of most of the variables above. */
5126 struct constructor_range_stack;
5128 struct constructor_stack
5130 struct constructor_stack *next;
5135 tree unfilled_index;
5136 tree unfilled_fields;
5138 VEC(constructor_elt,gc) *elements;
5139 struct init_node *pending_elts;
5142 /* If value nonzero, this value should replace the entire
5143 constructor at this level. */
5144 struct c_expr replacement_value;
5145 struct constructor_range_stack *range_stack;
5155 static struct constructor_stack *constructor_stack;
5157 /* This stack represents designators from some range designator up to
5158 the last designator in the list. */
5160 struct constructor_range_stack
5162 struct constructor_range_stack *next, *prev;
5163 struct constructor_stack *stack;
5170 static struct constructor_range_stack *constructor_range_stack;
5172 /* This stack records separate initializers that are nested.
5173 Nested initializers can't happen in ANSI C, but GNU C allows them
5174 in cases like { ... (struct foo) { ... } ... }. */
5176 struct initializer_stack
5178 struct initializer_stack *next;
5180 struct constructor_stack *constructor_stack;
5181 struct constructor_range_stack *constructor_range_stack;
5182 VEC(constructor_elt,gc) *elements;
5183 struct spelling *spelling;
5184 struct spelling *spelling_base;
5187 char require_constant_value;
5188 char require_constant_elements;
5191 static struct initializer_stack *initializer_stack;
5193 /* Prepare to parse and output the initializer for variable DECL. */
5196 start_init (tree decl, tree asmspec_tree ATTRIBUTE_UNUSED, int top_level)
5199 struct initializer_stack *p = XNEW (struct initializer_stack);
5201 p->decl = constructor_decl;
5202 p->require_constant_value = require_constant_value;
5203 p->require_constant_elements = require_constant_elements;
5204 p->constructor_stack = constructor_stack;
5205 p->constructor_range_stack = constructor_range_stack;
5206 p->elements = constructor_elements;
5207 p->spelling = spelling;
5208 p->spelling_base = spelling_base;
5209 p->spelling_size = spelling_size;
5210 p->top_level = constructor_top_level;
5211 p->next = initializer_stack;
5212 initializer_stack = p;
5214 constructor_decl = decl;
5215 constructor_designated = 0;
5216 constructor_top_level = top_level;
5218 if (decl != 0 && decl != error_mark_node)
5220 require_constant_value = TREE_STATIC (decl);
5221 require_constant_elements
5222 = ((TREE_STATIC (decl) || (pedantic && !flag_isoc99))
5223 /* For a scalar, you can always use any value to initialize,
5224 even within braces. */
5225 && (TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE
5226 || TREE_CODE (TREE_TYPE (decl)) == RECORD_TYPE
5227 || TREE_CODE (TREE_TYPE (decl)) == UNION_TYPE
5228 || TREE_CODE (TREE_TYPE (decl)) == QUAL_UNION_TYPE));
5229 locus = IDENTIFIER_POINTER (DECL_NAME (decl));
5233 require_constant_value = 0;
5234 require_constant_elements = 0;
5235 locus = "(anonymous)";
5238 constructor_stack = 0;
5239 constructor_range_stack = 0;
5241 missing_braces_mentioned = 0;
5245 RESTORE_SPELLING_DEPTH (0);
5248 push_string (locus);
5254 struct initializer_stack *p = initializer_stack;
5256 /* Free the whole constructor stack of this initializer. */
5257 while (constructor_stack)
5259 struct constructor_stack *q = constructor_stack;
5260 constructor_stack = q->next;
5264 gcc_assert (!constructor_range_stack);
5266 /* Pop back to the data of the outer initializer (if any). */
5267 free (spelling_base);
5269 constructor_decl = p->decl;
5270 require_constant_value = p->require_constant_value;
5271 require_constant_elements = p->require_constant_elements;
5272 constructor_stack = p->constructor_stack;
5273 constructor_range_stack = p->constructor_range_stack;
5274 constructor_elements = p->elements;
5275 spelling = p->spelling;
5276 spelling_base = p->spelling_base;
5277 spelling_size = p->spelling_size;
5278 constructor_top_level = p->top_level;
5279 initializer_stack = p->next;
5283 /* Call here when we see the initializer is surrounded by braces.
5284 This is instead of a call to push_init_level;
5285 it is matched by a call to pop_init_level.
5287 TYPE is the type to initialize, for a constructor expression.
5288 For an initializer for a decl, TYPE is zero. */
5291 really_start_incremental_init (tree type)
5293 struct constructor_stack *p = XNEW (struct constructor_stack);
5296 type = TREE_TYPE (constructor_decl);
5298 if (targetm.vector_opaque_p (type))
5299 error ("opaque vector types cannot be initialized");
5301 p->type = constructor_type;
5302 p->fields = constructor_fields;
5303 p->index = constructor_index;
5304 p->max_index = constructor_max_index;
5305 p->unfilled_index = constructor_unfilled_index;
5306 p->unfilled_fields = constructor_unfilled_fields;
5307 p->bit_index = constructor_bit_index;
5308 p->elements = constructor_elements;
5309 p->constant = constructor_constant;
5310 p->simple = constructor_simple;
5311 p->erroneous = constructor_erroneous;
5312 p->pending_elts = constructor_pending_elts;
5313 p->depth = constructor_depth;
5314 p->replacement_value.value = 0;
5315 p->replacement_value.original_code = ERROR_MARK;
5319 p->incremental = constructor_incremental;
5320 p->designated = constructor_designated;
5322 constructor_stack = p;
5324 constructor_constant = 1;
5325 constructor_simple = 1;
5326 constructor_depth = SPELLING_DEPTH ();
5327 constructor_elements = 0;
5328 constructor_pending_elts = 0;
5329 constructor_type = type;
5330 constructor_incremental = 1;
5331 constructor_designated = 0;
5332 designator_depth = 0;
5333 designator_erroneous = 0;
5335 if (TREE_CODE (constructor_type) == RECORD_TYPE
5336 || TREE_CODE (constructor_type) == UNION_TYPE)
5338 constructor_fields = TYPE_FIELDS (constructor_type);
5339 /* Skip any nameless bit fields at the beginning. */
5340 while (constructor_fields != 0 && DECL_C_BIT_FIELD (constructor_fields)
5341 && DECL_NAME (constructor_fields) == 0)
5342 constructor_fields = TREE_CHAIN (constructor_fields);
5344 constructor_unfilled_fields = constructor_fields;
5345 constructor_bit_index = bitsize_zero_node;
5347 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5349 if (TYPE_DOMAIN (constructor_type))
5351 constructor_max_index
5352 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type));
5354 /* Detect non-empty initializations of zero-length arrays. */
5355 if (constructor_max_index == NULL_TREE
5356 && TYPE_SIZE (constructor_type))
5357 constructor_max_index = build_int_cst (NULL_TREE, -1);
5359 /* constructor_max_index needs to be an INTEGER_CST. Attempts
5360 to initialize VLAs will cause a proper error; avoid tree
5361 checking errors as well by setting a safe value. */
5362 if (constructor_max_index
5363 && TREE_CODE (constructor_max_index) != INTEGER_CST)
5364 constructor_max_index = build_int_cst (NULL_TREE, -1);
5367 = convert (bitsizetype,
5368 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
5372 constructor_index = bitsize_zero_node;
5373 constructor_max_index = NULL_TREE;
5376 constructor_unfilled_index = constructor_index;
5378 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
5380 /* Vectors are like simple fixed-size arrays. */
5381 constructor_max_index =
5382 build_int_cst (NULL_TREE, TYPE_VECTOR_SUBPARTS (constructor_type) - 1);
5383 constructor_index = bitsize_zero_node;
5384 constructor_unfilled_index = constructor_index;
5388 /* Handle the case of int x = {5}; */
5389 constructor_fields = constructor_type;
5390 constructor_unfilled_fields = constructor_type;
5394 /* Push down into a subobject, for initialization.
5395 If this is for an explicit set of braces, IMPLICIT is 0.
5396 If it is because the next element belongs at a lower level,
5397 IMPLICIT is 1 (or 2 if the push is because of designator list). */
5400 push_init_level (int implicit)
5402 struct constructor_stack *p;
5403 tree value = NULL_TREE;
5405 /* If we've exhausted any levels that didn't have braces,
5406 pop them now. If implicit == 1, this will have been done in
5407 process_init_element; do not repeat it here because in the case
5408 of excess initializers for an empty aggregate this leads to an
5409 infinite cycle of popping a level and immediately recreating
5413 while (constructor_stack->implicit)
5415 if ((TREE_CODE (constructor_type) == RECORD_TYPE
5416 || TREE_CODE (constructor_type) == UNION_TYPE)
5417 && constructor_fields == 0)
5418 process_init_element (pop_init_level (1), true);
5419 else if (TREE_CODE (constructor_type) == ARRAY_TYPE
5420 && constructor_max_index
5421 && tree_int_cst_lt (constructor_max_index,
5423 process_init_element (pop_init_level (1), true);
5429 /* Unless this is an explicit brace, we need to preserve previous
5433 if ((TREE_CODE (constructor_type) == RECORD_TYPE
5434 || TREE_CODE (constructor_type) == UNION_TYPE)
5435 && constructor_fields)
5436 value = find_init_member (constructor_fields);
5437 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5438 value = find_init_member (constructor_index);
5441 p = XNEW (struct constructor_stack);
5442 p->type = constructor_type;
5443 p->fields = constructor_fields;
5444 p->index = constructor_index;
5445 p->max_index = constructor_max_index;
5446 p->unfilled_index = constructor_unfilled_index;
5447 p->unfilled_fields = constructor_unfilled_fields;
5448 p->bit_index = constructor_bit_index;
5449 p->elements = constructor_elements;
5450 p->constant = constructor_constant;
5451 p->simple = constructor_simple;
5452 p->erroneous = constructor_erroneous;
5453 p->pending_elts = constructor_pending_elts;
5454 p->depth = constructor_depth;
5455 p->replacement_value.value = 0;
5456 p->replacement_value.original_code = ERROR_MARK;
5457 p->implicit = implicit;
5459 p->incremental = constructor_incremental;
5460 p->designated = constructor_designated;
5461 p->next = constructor_stack;
5463 constructor_stack = p;
5465 constructor_constant = 1;
5466 constructor_simple = 1;
5467 constructor_depth = SPELLING_DEPTH ();
5468 constructor_elements = 0;
5469 constructor_incremental = 1;
5470 constructor_designated = 0;
5471 constructor_pending_elts = 0;
5474 p->range_stack = constructor_range_stack;
5475 constructor_range_stack = 0;
5476 designator_depth = 0;
5477 designator_erroneous = 0;
5480 /* Don't die if an entire brace-pair level is superfluous
5481 in the containing level. */
5482 if (constructor_type == 0)
5484 else if (TREE_CODE (constructor_type) == RECORD_TYPE
5485 || TREE_CODE (constructor_type) == UNION_TYPE)
5487 /* Don't die if there are extra init elts at the end. */
5488 if (constructor_fields == 0)
5489 constructor_type = 0;
5492 constructor_type = TREE_TYPE (constructor_fields);
5493 push_member_name (constructor_fields);
5494 constructor_depth++;
5497 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5499 constructor_type = TREE_TYPE (constructor_type);
5500 push_array_bounds (tree_low_cst (constructor_index, 1));
5501 constructor_depth++;
5504 if (constructor_type == 0)
5506 error_init ("extra brace group at end of initializer");
5507 constructor_fields = 0;
5508 constructor_unfilled_fields = 0;
5512 if (value && TREE_CODE (value) == CONSTRUCTOR)
5514 constructor_constant = TREE_CONSTANT (value);
5515 constructor_simple = TREE_STATIC (value);
5516 constructor_elements = CONSTRUCTOR_ELTS (value);
5517 if (!VEC_empty (constructor_elt, constructor_elements)
5518 && (TREE_CODE (constructor_type) == RECORD_TYPE
5519 || TREE_CODE (constructor_type) == ARRAY_TYPE))
5520 set_nonincremental_init ();
5523 if (implicit == 1 && warn_missing_braces && !missing_braces_mentioned)
5525 missing_braces_mentioned = 1;
5526 warning_init (OPT_Wmissing_braces, "missing braces around initializer");
5529 if (TREE_CODE (constructor_type) == RECORD_TYPE
5530 || TREE_CODE (constructor_type) == UNION_TYPE)
5532 constructor_fields = TYPE_FIELDS (constructor_type);
5533 /* Skip any nameless bit fields at the beginning. */
5534 while (constructor_fields != 0 && DECL_C_BIT_FIELD (constructor_fields)
5535 && DECL_NAME (constructor_fields) == 0)
5536 constructor_fields = TREE_CHAIN (constructor_fields);
5538 constructor_unfilled_fields = constructor_fields;
5539 constructor_bit_index = bitsize_zero_node;
5541 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
5543 /* Vectors are like simple fixed-size arrays. */
5544 constructor_max_index =
5545 build_int_cst (NULL_TREE, TYPE_VECTOR_SUBPARTS (constructor_type) - 1);
5546 constructor_index = convert (bitsizetype, integer_zero_node);
5547 constructor_unfilled_index = constructor_index;
5549 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5551 if (TYPE_DOMAIN (constructor_type))
5553 constructor_max_index
5554 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type));
5556 /* Detect non-empty initializations of zero-length arrays. */
5557 if (constructor_max_index == NULL_TREE
5558 && TYPE_SIZE (constructor_type))
5559 constructor_max_index = build_int_cst (NULL_TREE, -1);
5561 /* constructor_max_index needs to be an INTEGER_CST. Attempts
5562 to initialize VLAs will cause a proper error; avoid tree
5563 checking errors as well by setting a safe value. */
5564 if (constructor_max_index
5565 && TREE_CODE (constructor_max_index) != INTEGER_CST)
5566 constructor_max_index = build_int_cst (NULL_TREE, -1);
5569 = convert (bitsizetype,
5570 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
5573 constructor_index = bitsize_zero_node;
5575 constructor_unfilled_index = constructor_index;
5576 if (value && TREE_CODE (value) == STRING_CST)
5578 /* We need to split the char/wchar array into individual
5579 characters, so that we don't have to special case it
5581 set_nonincremental_init_from_string (value);
5586 if (constructor_type != error_mark_node)
5587 warning_init (0, "braces around scalar initializer");
5588 constructor_fields = constructor_type;
5589 constructor_unfilled_fields = constructor_type;
5593 /* At the end of an implicit or explicit brace level,
5594 finish up that level of constructor. If a single expression
5595 with redundant braces initialized that level, return the
5596 c_expr structure for that expression. Otherwise, the original_code
5597 element is set to ERROR_MARK.
5598 If we were outputting the elements as they are read, return 0 as the value
5599 from inner levels (process_init_element ignores that),
5600 but return error_mark_node as the value from the outermost level
5601 (that's what we want to put in DECL_INITIAL).
5602 Otherwise, return a CONSTRUCTOR expression as the value. */
5605 pop_init_level (int implicit)
5607 struct constructor_stack *p;
5610 ret.original_code = ERROR_MARK;
5614 /* When we come to an explicit close brace,
5615 pop any inner levels that didn't have explicit braces. */
5616 while (constructor_stack->implicit)
5617 process_init_element (pop_init_level (1), true);
5619 gcc_assert (!constructor_range_stack);
5622 /* Now output all pending elements. */
5623 constructor_incremental = 1;
5624 output_pending_init_elements (1);
5626 p = constructor_stack;
5628 /* Error for initializing a flexible array member, or a zero-length
5629 array member in an inappropriate context. */
5630 if (constructor_type && constructor_fields
5631 && TREE_CODE (constructor_type) == ARRAY_TYPE
5632 && TYPE_DOMAIN (constructor_type)
5633 && !TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type)))
5635 /* Silently discard empty initializations. The parser will
5636 already have pedwarned for empty brackets. */
5637 if (integer_zerop (constructor_unfilled_index))
5638 constructor_type = NULL_TREE;
5641 gcc_assert (!TYPE_SIZE (constructor_type));
5643 if (constructor_depth > 2)
5644 error_init ("initialization of flexible array member in a nested context");
5646 pedwarn_init (input_location, OPT_pedantic,
5647 "initialization of a flexible array member");
5649 /* We have already issued an error message for the existence
5650 of a flexible array member not at the end of the structure.
5651 Discard the initializer so that we do not die later. */
5652 if (TREE_CHAIN (constructor_fields) != NULL_TREE)
5653 constructor_type = NULL_TREE;
5657 /* Warn when some struct elements are implicitly initialized to zero. */
5658 if (warn_missing_field_initializers
5660 && TREE_CODE (constructor_type) == RECORD_TYPE
5661 && constructor_unfilled_fields)
5663 /* Do not warn for flexible array members or zero-length arrays. */
5664 while (constructor_unfilled_fields
5665 && (!DECL_SIZE (constructor_unfilled_fields)
5666 || integer_zerop (DECL_SIZE (constructor_unfilled_fields))))
5667 constructor_unfilled_fields = TREE_CHAIN (constructor_unfilled_fields);
5669 /* Do not warn if this level of the initializer uses member
5670 designators; it is likely to be deliberate. */
5671 if (constructor_unfilled_fields && !constructor_designated)
5673 push_member_name (constructor_unfilled_fields);
5674 warning_init (OPT_Wmissing_field_initializers,
5675 "missing initializer");
5676 RESTORE_SPELLING_DEPTH (constructor_depth);
5680 /* Pad out the end of the structure. */
5681 if (p->replacement_value.value)
5682 /* If this closes a superfluous brace pair,
5683 just pass out the element between them. */
5684 ret = p->replacement_value;
5685 else if (constructor_type == 0)
5687 else if (TREE_CODE (constructor_type) != RECORD_TYPE
5688 && TREE_CODE (constructor_type) != UNION_TYPE
5689 && TREE_CODE (constructor_type) != ARRAY_TYPE
5690 && TREE_CODE (constructor_type) != VECTOR_TYPE)
5692 /* A nonincremental scalar initializer--just return
5693 the element, after verifying there is just one. */
5694 if (VEC_empty (constructor_elt,constructor_elements))
5696 if (!constructor_erroneous)
5697 error_init ("empty scalar initializer");
5698 ret.value = error_mark_node;
5700 else if (VEC_length (constructor_elt,constructor_elements) != 1)
5702 error_init ("extra elements in scalar initializer");
5703 ret.value = VEC_index (constructor_elt,constructor_elements,0)->value;
5706 ret.value = VEC_index (constructor_elt,constructor_elements,0)->value;
5710 if (constructor_erroneous)
5711 ret.value = error_mark_node;
5714 ret.value = build_constructor (constructor_type,
5715 constructor_elements);
5716 if (constructor_constant)
5717 TREE_CONSTANT (ret.value) = 1;
5718 if (constructor_constant && constructor_simple)
5719 TREE_STATIC (ret.value) = 1;
5723 constructor_type = p->type;
5724 constructor_fields = p->fields;
5725 constructor_index = p->index;
5726 constructor_max_index = p->max_index;
5727 constructor_unfilled_index = p->unfilled_index;
5728 constructor_unfilled_fields = p->unfilled_fields;
5729 constructor_bit_index = p->bit_index;
5730 constructor_elements = p->elements;
5731 constructor_constant = p->constant;
5732 constructor_simple = p->simple;
5733 constructor_erroneous = p->erroneous;
5734 constructor_incremental = p->incremental;
5735 constructor_designated = p->designated;
5736 constructor_pending_elts = p->pending_elts;
5737 constructor_depth = p->depth;
5739 constructor_range_stack = p->range_stack;
5740 RESTORE_SPELLING_DEPTH (constructor_depth);
5742 constructor_stack = p->next;
5745 if (ret.value == 0 && constructor_stack == 0)
5746 ret.value = error_mark_node;
5750 /* Common handling for both array range and field name designators.
5751 ARRAY argument is nonzero for array ranges. Returns zero for success. */
5754 set_designator (int array)
5757 enum tree_code subcode;
5759 /* Don't die if an entire brace-pair level is superfluous
5760 in the containing level. */
5761 if (constructor_type == 0)
5764 /* If there were errors in this designator list already, bail out
5766 if (designator_erroneous)
5769 if (!designator_depth)
5771 gcc_assert (!constructor_range_stack);
5773 /* Designator list starts at the level of closest explicit
5775 while (constructor_stack->implicit)
5776 process_init_element (pop_init_level (1), true);
5777 constructor_designated = 1;
5781 switch (TREE_CODE (constructor_type))
5785 subtype = TREE_TYPE (constructor_fields);
5786 if (subtype != error_mark_node)
5787 subtype = TYPE_MAIN_VARIANT (subtype);
5790 subtype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
5796 subcode = TREE_CODE (subtype);
5797 if (array && subcode != ARRAY_TYPE)
5799 error_init ("array index in non-array initializer");
5802 else if (!array && subcode != RECORD_TYPE && subcode != UNION_TYPE)
5804 error_init ("field name not in record or union initializer");
5808 constructor_designated = 1;
5809 push_init_level (2);
5813 /* If there are range designators in designator list, push a new designator
5814 to constructor_range_stack. RANGE_END is end of such stack range or
5815 NULL_TREE if there is no range designator at this level. */
5818 push_range_stack (tree range_end)
5820 struct constructor_range_stack *p;
5822 p = GGC_NEW (struct constructor_range_stack);
5823 p->prev = constructor_range_stack;
5825 p->fields = constructor_fields;
5826 p->range_start = constructor_index;
5827 p->index = constructor_index;
5828 p->stack = constructor_stack;
5829 p->range_end = range_end;
5830 if (constructor_range_stack)
5831 constructor_range_stack->next = p;
5832 constructor_range_stack = p;
5835 /* Within an array initializer, specify the next index to be initialized.
5836 FIRST is that index. If LAST is nonzero, then initialize a range
5837 of indices, running from FIRST through LAST. */
5840 set_init_index (tree first, tree last)
5842 if (set_designator (1))
5845 designator_erroneous = 1;
5847 if (!INTEGRAL_TYPE_P (TREE_TYPE (first))
5848 || (last && !INTEGRAL_TYPE_P (TREE_TYPE (last))))
5850 error_init ("array index in initializer not of integer type");
5854 if (TREE_CODE (first) != INTEGER_CST)
5855 error_init ("nonconstant array index in initializer");
5856 else if (last != 0 && TREE_CODE (last) != INTEGER_CST)
5857 error_init ("nonconstant array index in initializer");
5858 else if (TREE_CODE (constructor_type) != ARRAY_TYPE)
5859 error_init ("array index in non-array initializer");
5860 else if (tree_int_cst_sgn (first) == -1)
5861 error_init ("array index in initializer exceeds array bounds");
5862 else if (constructor_max_index
5863 && tree_int_cst_lt (constructor_max_index, first))
5864 error_init ("array index in initializer exceeds array bounds");
5867 constructor_index = convert (bitsizetype, first);
5871 if (tree_int_cst_equal (first, last))
5873 else if (tree_int_cst_lt (last, first))
5875 error_init ("empty index range in initializer");
5880 last = convert (bitsizetype, last);
5881 if (constructor_max_index != 0
5882 && tree_int_cst_lt (constructor_max_index, last))
5884 error_init ("array index range in initializer exceeds array bounds");
5891 designator_erroneous = 0;
5892 if (constructor_range_stack || last)
5893 push_range_stack (last);
5897 /* Within a struct initializer, specify the next field to be initialized. */
5900 set_init_label (tree fieldname)
5904 if (set_designator (0))
5907 designator_erroneous = 1;
5909 if (TREE_CODE (constructor_type) != RECORD_TYPE
5910 && TREE_CODE (constructor_type) != UNION_TYPE)
5912 error_init ("field name not in record or union initializer");
5916 for (tail = TYPE_FIELDS (constructor_type); tail;
5917 tail = TREE_CHAIN (tail))
5919 if (DECL_NAME (tail) == fieldname)
5924 error ("unknown field %qE specified in initializer", fieldname);
5927 constructor_fields = tail;
5929 designator_erroneous = 0;
5930 if (constructor_range_stack)
5931 push_range_stack (NULL_TREE);
5935 /* Add a new initializer to the tree of pending initializers. PURPOSE
5936 identifies the initializer, either array index or field in a structure.
5937 VALUE is the value of that index or field.
5939 IMPLICIT is true if value comes from pop_init_level (1),
5940 the new initializer has been merged with the existing one
5941 and thus no warnings should be emitted about overriding an
5942 existing initializer. */
5945 add_pending_init (tree purpose, tree value, bool implicit)
5947 struct init_node *p, **q, *r;
5949 q = &constructor_pending_elts;
5952 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5957 if (tree_int_cst_lt (purpose, p->purpose))
5959 else if (tree_int_cst_lt (p->purpose, purpose))
5965 if (TREE_SIDE_EFFECTS (p->value))
5966 warning_init (0, "initialized field with side-effects overwritten");
5967 else if (warn_override_init)
5968 warning_init (OPT_Woverride_init, "initialized field overwritten");
5979 bitpos = bit_position (purpose);
5983 if (tree_int_cst_lt (bitpos, bit_position (p->purpose)))
5985 else if (p->purpose != purpose)
5991 if (TREE_SIDE_EFFECTS (p->value))
5992 warning_init (0, "initialized field with side-effects overwritten");
5993 else if (warn_override_init)
5994 warning_init (OPT_Woverride_init, "initialized field overwritten");
6002 r = GGC_NEW (struct init_node);
6003 r->purpose = purpose;
6014 struct init_node *s;
6018 if (p->balance == 0)
6020 else if (p->balance < 0)
6027 p->left->parent = p;
6044 constructor_pending_elts = r;
6049 struct init_node *t = r->right;
6053 r->right->parent = r;
6058 p->left->parent = p;
6061 p->balance = t->balance < 0;
6062 r->balance = -(t->balance > 0);
6077 constructor_pending_elts = t;
6083 /* p->balance == +1; growth of left side balances the node. */
6088 else /* r == p->right */
6090 if (p->balance == 0)
6091 /* Growth propagation from right side. */
6093 else if (p->balance > 0)
6100 p->right->parent = p;
6117 constructor_pending_elts = r;
6119 else /* r->balance == -1 */
6122 struct init_node *t = r->left;
6126 r->left->parent = r;
6131 p->right->parent = p;
6134 r->balance = (t->balance < 0);
6135 p->balance = -(t->balance > 0);
6150 constructor_pending_elts = t;
6156 /* p->balance == -1; growth of right side balances the node. */
6167 /* Build AVL tree from a sorted chain. */
6170 set_nonincremental_init (void)
6172 unsigned HOST_WIDE_INT ix;
6175 if (TREE_CODE (constructor_type) != RECORD_TYPE
6176 && TREE_CODE (constructor_type) != ARRAY_TYPE)
6179 FOR_EACH_CONSTRUCTOR_ELT (constructor_elements, ix, index, value)
6180 add_pending_init (index, value, false);
6181 constructor_elements = 0;
6182 if (TREE_CODE (constructor_type) == RECORD_TYPE)
6184 constructor_unfilled_fields = TYPE_FIELDS (constructor_type);
6185 /* Skip any nameless bit fields at the beginning. */
6186 while (constructor_unfilled_fields != 0
6187 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
6188 && DECL_NAME (constructor_unfilled_fields) == 0)
6189 constructor_unfilled_fields = TREE_CHAIN (constructor_unfilled_fields);
6192 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6194 if (TYPE_DOMAIN (constructor_type))
6195 constructor_unfilled_index
6196 = convert (bitsizetype,
6197 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
6199 constructor_unfilled_index = bitsize_zero_node;
6201 constructor_incremental = 0;
6204 /* Build AVL tree from a string constant. */
6207 set_nonincremental_init_from_string (tree str)
6209 tree value, purpose, type;
6210 HOST_WIDE_INT val[2];
6211 const char *p, *end;
6212 int byte, wchar_bytes, charwidth, bitpos;
6214 gcc_assert (TREE_CODE (constructor_type) == ARRAY_TYPE);
6216 wchar_bytes = TYPE_PRECISION (TREE_TYPE (TREE_TYPE (str))) / BITS_PER_UNIT;
6217 charwidth = TYPE_PRECISION (char_type_node);
6218 type = TREE_TYPE (constructor_type);
6219 p = TREE_STRING_POINTER (str);
6220 end = p + TREE_STRING_LENGTH (str);
6222 for (purpose = bitsize_zero_node;
6223 p < end && !tree_int_cst_lt (constructor_max_index, purpose);
6224 purpose = size_binop (PLUS_EXPR, purpose, bitsize_one_node))
6226 if (wchar_bytes == 1)
6228 val[1] = (unsigned char) *p++;
6235 for (byte = 0; byte < wchar_bytes; byte++)
6237 if (BYTES_BIG_ENDIAN)
6238 bitpos = (wchar_bytes - byte - 1) * charwidth;
6240 bitpos = byte * charwidth;
6241 val[bitpos < HOST_BITS_PER_WIDE_INT]
6242 |= ((unsigned HOST_WIDE_INT) ((unsigned char) *p++))
6243 << (bitpos % HOST_BITS_PER_WIDE_INT);
6247 if (!TYPE_UNSIGNED (type))
6249 bitpos = ((wchar_bytes - 1) * charwidth) + HOST_BITS_PER_CHAR;
6250 if (bitpos < HOST_BITS_PER_WIDE_INT)
6252 if (val[1] & (((HOST_WIDE_INT) 1) << (bitpos - 1)))
6254 val[1] |= ((HOST_WIDE_INT) -1) << bitpos;
6258 else if (bitpos == HOST_BITS_PER_WIDE_INT)
6263 else if (val[0] & (((HOST_WIDE_INT) 1)
6264 << (bitpos - 1 - HOST_BITS_PER_WIDE_INT)))
6265 val[0] |= ((HOST_WIDE_INT) -1)
6266 << (bitpos - HOST_BITS_PER_WIDE_INT);
6269 value = build_int_cst_wide (type, val[1], val[0]);
6270 add_pending_init (purpose, value, false);
6273 constructor_incremental = 0;
6276 /* Return value of FIELD in pending initializer or zero if the field was
6277 not initialized yet. */
6280 find_init_member (tree field)
6282 struct init_node *p;
6284 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6286 if (constructor_incremental
6287 && tree_int_cst_lt (field, constructor_unfilled_index))
6288 set_nonincremental_init ();
6290 p = constructor_pending_elts;
6293 if (tree_int_cst_lt (field, p->purpose))
6295 else if (tree_int_cst_lt (p->purpose, field))
6301 else if (TREE_CODE (constructor_type) == RECORD_TYPE)
6303 tree bitpos = bit_position (field);
6305 if (constructor_incremental
6306 && (!constructor_unfilled_fields
6307 || tree_int_cst_lt (bitpos,
6308 bit_position (constructor_unfilled_fields))))
6309 set_nonincremental_init ();
6311 p = constructor_pending_elts;
6314 if (field == p->purpose)
6316 else if (tree_int_cst_lt (bitpos, bit_position (p->purpose)))
6322 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6324 if (!VEC_empty (constructor_elt, constructor_elements)
6325 && (VEC_last (constructor_elt, constructor_elements)->index
6327 return VEC_last (constructor_elt, constructor_elements)->value;
6332 /* "Output" the next constructor element.
6333 At top level, really output it to assembler code now.
6334 Otherwise, collect it in a list from which we will make a CONSTRUCTOR.
6335 TYPE is the data type that the containing data type wants here.
6336 FIELD is the field (a FIELD_DECL) or the index that this element fills.
6337 If VALUE is a string constant, STRICT_STRING is true if it is
6338 unparenthesized or we should not warn here for it being parenthesized.
6339 For other types of VALUE, STRICT_STRING is not used.
6341 PENDING if non-nil means output pending elements that belong
6342 right after this element. (PENDING is normally 1;
6343 it is 0 while outputting pending elements, to avoid recursion.)
6345 IMPLICIT is true if value comes from pop_init_level (1),
6346 the new initializer has been merged with the existing one
6347 and thus no warnings should be emitted about overriding an
6348 existing initializer. */
6351 output_init_element (tree value, bool strict_string, tree type, tree field,
6352 int pending, bool implicit)
6354 constructor_elt *celt;
6356 if (type == error_mark_node || value == error_mark_node)
6358 constructor_erroneous = 1;
6361 if (TREE_CODE (TREE_TYPE (value)) == ARRAY_TYPE
6362 && (TREE_CODE (value) == STRING_CST
6363 || TREE_CODE (value) == COMPOUND_LITERAL_EXPR)
6364 && !(TREE_CODE (value) == STRING_CST
6365 && TREE_CODE (type) == ARRAY_TYPE
6366 && INTEGRAL_TYPE_P (TREE_TYPE (type)))
6367 && !comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (value)),
6368 TYPE_MAIN_VARIANT (type)))
6369 value = array_to_pointer_conversion (value);
6371 if (TREE_CODE (value) == COMPOUND_LITERAL_EXPR
6372 && require_constant_value && !flag_isoc99 && pending)
6374 /* As an extension, allow initializing objects with static storage
6375 duration with compound literals (which are then treated just as
6376 the brace enclosed list they contain). */
6377 tree decl = COMPOUND_LITERAL_EXPR_DECL (value);
6378 value = DECL_INITIAL (decl);
6381 if (value == error_mark_node)
6382 constructor_erroneous = 1;
6383 else if (!TREE_CONSTANT (value))
6384 constructor_constant = 0;
6385 else if (!initializer_constant_valid_p (value, TREE_TYPE (value))
6386 || ((TREE_CODE (constructor_type) == RECORD_TYPE
6387 || TREE_CODE (constructor_type) == UNION_TYPE)
6388 && DECL_C_BIT_FIELD (field)
6389 && TREE_CODE (value) != INTEGER_CST))
6390 constructor_simple = 0;
6392 if (!initializer_constant_valid_p (value, TREE_TYPE (value)))
6394 if (require_constant_value)
6396 error_init ("initializer element is not constant");
6397 value = error_mark_node;
6399 else if (require_constant_elements)
6400 pedwarn (input_location, 0,
6401 "initializer element is not computable at load time");
6404 /* If this field is empty (and not at the end of structure),
6405 don't do anything other than checking the initializer. */
6407 && (TREE_TYPE (field) == error_mark_node
6408 || (COMPLETE_TYPE_P (TREE_TYPE (field))
6409 && integer_zerop (TYPE_SIZE (TREE_TYPE (field)))
6410 && (TREE_CODE (constructor_type) == ARRAY_TYPE
6411 || TREE_CHAIN (field)))))
6414 value = digest_init (type, value, strict_string, require_constant_value);
6415 if (value == error_mark_node)
6417 constructor_erroneous = 1;
6421 /* If this element doesn't come next in sequence,
6422 put it on constructor_pending_elts. */
6423 if (TREE_CODE (constructor_type) == ARRAY_TYPE
6424 && (!constructor_incremental
6425 || !tree_int_cst_equal (field, constructor_unfilled_index)))
6427 if (constructor_incremental
6428 && tree_int_cst_lt (field, constructor_unfilled_index))
6429 set_nonincremental_init ();
6431 add_pending_init (field, value, implicit);
6434 else if (TREE_CODE (constructor_type) == RECORD_TYPE
6435 && (!constructor_incremental
6436 || field != constructor_unfilled_fields))
6438 /* We do this for records but not for unions. In a union,
6439 no matter which field is specified, it can be initialized
6440 right away since it starts at the beginning of the union. */
6441 if (constructor_incremental)
6443 if (!constructor_unfilled_fields)
6444 set_nonincremental_init ();
6447 tree bitpos, unfillpos;
6449 bitpos = bit_position (field);
6450 unfillpos = bit_position (constructor_unfilled_fields);
6452 if (tree_int_cst_lt (bitpos, unfillpos))
6453 set_nonincremental_init ();
6457 add_pending_init (field, value, implicit);
6460 else if (TREE_CODE (constructor_type) == UNION_TYPE
6461 && !VEC_empty (constructor_elt, constructor_elements))
6465 if (TREE_SIDE_EFFECTS (VEC_last (constructor_elt,
6466 constructor_elements)->value))
6468 "initialized field with side-effects overwritten");
6469 else if (warn_override_init)
6470 warning_init (OPT_Woverride_init, "initialized field overwritten");
6473 /* We can have just one union field set. */
6474 constructor_elements = 0;
6477 /* Otherwise, output this element either to
6478 constructor_elements or to the assembler file. */
6480 celt = VEC_safe_push (constructor_elt, gc, constructor_elements, NULL);
6481 celt->index = field;
6482 celt->value = value;
6484 /* Advance the variable that indicates sequential elements output. */
6485 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6486 constructor_unfilled_index
6487 = size_binop (PLUS_EXPR, constructor_unfilled_index,
6489 else if (TREE_CODE (constructor_type) == RECORD_TYPE)
6491 constructor_unfilled_fields
6492 = TREE_CHAIN (constructor_unfilled_fields);
6494 /* Skip any nameless bit fields. */
6495 while (constructor_unfilled_fields != 0
6496 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
6497 && DECL_NAME (constructor_unfilled_fields) == 0)
6498 constructor_unfilled_fields =
6499 TREE_CHAIN (constructor_unfilled_fields);
6501 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6502 constructor_unfilled_fields = 0;
6504 /* Now output any pending elements which have become next. */
6506 output_pending_init_elements (0);
6509 /* Output any pending elements which have become next.
6510 As we output elements, constructor_unfilled_{fields,index}
6511 advances, which may cause other elements to become next;
6512 if so, they too are output.
6514 If ALL is 0, we return when there are
6515 no more pending elements to output now.
6517 If ALL is 1, we output space as necessary so that
6518 we can output all the pending elements. */
6521 output_pending_init_elements (int all)
6523 struct init_node *elt = constructor_pending_elts;
6528 /* Look through the whole pending tree.
6529 If we find an element that should be output now,
6530 output it. Otherwise, set NEXT to the element
6531 that comes first among those still pending. */
6536 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6538 if (tree_int_cst_equal (elt->purpose,
6539 constructor_unfilled_index))
6540 output_init_element (elt->value, true,
6541 TREE_TYPE (constructor_type),
6542 constructor_unfilled_index, 0, false);
6543 else if (tree_int_cst_lt (constructor_unfilled_index,
6546 /* Advance to the next smaller node. */
6551 /* We have reached the smallest node bigger than the
6552 current unfilled index. Fill the space first. */
6553 next = elt->purpose;
6559 /* Advance to the next bigger node. */
6564 /* We have reached the biggest node in a subtree. Find
6565 the parent of it, which is the next bigger node. */
6566 while (elt->parent && elt->parent->right == elt)
6569 if (elt && tree_int_cst_lt (constructor_unfilled_index,
6572 next = elt->purpose;
6578 else if (TREE_CODE (constructor_type) == RECORD_TYPE
6579 || TREE_CODE (constructor_type) == UNION_TYPE)
6581 tree ctor_unfilled_bitpos, elt_bitpos;
6583 /* If the current record is complete we are done. */
6584 if (constructor_unfilled_fields == 0)
6587 ctor_unfilled_bitpos = bit_position (constructor_unfilled_fields);
6588 elt_bitpos = bit_position (elt->purpose);
6589 /* We can't compare fields here because there might be empty
6590 fields in between. */
6591 if (tree_int_cst_equal (elt_bitpos, ctor_unfilled_bitpos))
6593 constructor_unfilled_fields = elt->purpose;
6594 output_init_element (elt->value, true, TREE_TYPE (elt->purpose),
6595 elt->purpose, 0, false);
6597 else if (tree_int_cst_lt (ctor_unfilled_bitpos, elt_bitpos))
6599 /* Advance to the next smaller node. */
6604 /* We have reached the smallest node bigger than the
6605 current unfilled field. Fill the space first. */
6606 next = elt->purpose;
6612 /* Advance to the next bigger node. */
6617 /* We have reached the biggest node in a subtree. Find
6618 the parent of it, which is the next bigger node. */
6619 while (elt->parent && elt->parent->right == elt)
6623 && (tree_int_cst_lt (ctor_unfilled_bitpos,
6624 bit_position (elt->purpose))))
6626 next = elt->purpose;
6634 /* Ordinarily return, but not if we want to output all
6635 and there are elements left. */
6636 if (!(all && next != 0))
6639 /* If it's not incremental, just skip over the gap, so that after
6640 jumping to retry we will output the next successive element. */
6641 if (TREE_CODE (constructor_type) == RECORD_TYPE
6642 || TREE_CODE (constructor_type) == UNION_TYPE)
6643 constructor_unfilled_fields = next;
6644 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6645 constructor_unfilled_index = next;
6647 /* ELT now points to the node in the pending tree with the next
6648 initializer to output. */
6652 /* Add one non-braced element to the current constructor level.
6653 This adjusts the current position within the constructor's type.
6654 This may also start or terminate implicit levels
6655 to handle a partly-braced initializer.
6657 Once this has found the correct level for the new element,
6658 it calls output_init_element.
6660 IMPLICIT is true if value comes from pop_init_level (1),
6661 the new initializer has been merged with the existing one
6662 and thus no warnings should be emitted about overriding an
6663 existing initializer. */
6666 process_init_element (struct c_expr value, bool implicit)
6668 tree orig_value = value.value;
6669 int string_flag = orig_value != 0 && TREE_CODE (orig_value) == STRING_CST;
6670 bool strict_string = value.original_code == STRING_CST;
6672 designator_depth = 0;
6673 designator_erroneous = 0;
6675 /* Handle superfluous braces around string cst as in
6676 char x[] = {"foo"}; */
6679 && TREE_CODE (constructor_type) == ARRAY_TYPE
6680 && INTEGRAL_TYPE_P (TREE_TYPE (constructor_type))
6681 && integer_zerop (constructor_unfilled_index))
6683 if (constructor_stack->replacement_value.value)
6684 error_init ("excess elements in char array initializer");
6685 constructor_stack->replacement_value = value;
6689 if (constructor_stack->replacement_value.value != 0)
6691 error_init ("excess elements in struct initializer");
6695 /* Ignore elements of a brace group if it is entirely superfluous
6696 and has already been diagnosed. */
6697 if (constructor_type == 0)
6700 /* If we've exhausted any levels that didn't have braces,
6702 while (constructor_stack->implicit)
6704 if ((TREE_CODE (constructor_type) == RECORD_TYPE
6705 || TREE_CODE (constructor_type) == UNION_TYPE)
6706 && constructor_fields == 0)
6707 process_init_element (pop_init_level (1), true);
6708 else if (TREE_CODE (constructor_type) == ARRAY_TYPE
6709 && (constructor_max_index == 0
6710 || tree_int_cst_lt (constructor_max_index,
6711 constructor_index)))
6712 process_init_element (pop_init_level (1), true);
6717 /* In the case of [LO ... HI] = VALUE, only evaluate VALUE once. */
6718 if (constructor_range_stack)
6720 /* If value is a compound literal and we'll be just using its
6721 content, don't put it into a SAVE_EXPR. */
6722 if (TREE_CODE (value.value) != COMPOUND_LITERAL_EXPR
6723 || !require_constant_value
6725 value.value = save_expr (value.value);
6730 if (TREE_CODE (constructor_type) == RECORD_TYPE)
6733 enum tree_code fieldcode;
6735 if (constructor_fields == 0)
6737 pedwarn_init (input_location, 0,
6738 "excess elements in struct initializer");
6742 fieldtype = TREE_TYPE (constructor_fields);
6743 if (fieldtype != error_mark_node)
6744 fieldtype = TYPE_MAIN_VARIANT (fieldtype);
6745 fieldcode = TREE_CODE (fieldtype);
6747 /* Error for non-static initialization of a flexible array member. */
6748 if (fieldcode == ARRAY_TYPE
6749 && !require_constant_value
6750 && TYPE_SIZE (fieldtype) == NULL_TREE
6751 && TREE_CHAIN (constructor_fields) == NULL_TREE)
6753 error_init ("non-static initialization of a flexible array member");
6757 /* Accept a string constant to initialize a subarray. */
6758 if (value.value != 0
6759 && fieldcode == ARRAY_TYPE
6760 && INTEGRAL_TYPE_P (TREE_TYPE (fieldtype))
6762 value.value = orig_value;
6763 /* Otherwise, if we have come to a subaggregate,
6764 and we don't have an element of its type, push into it. */
6765 else if (value.value != 0
6766 && value.value != error_mark_node
6767 && TYPE_MAIN_VARIANT (TREE_TYPE (value.value)) != fieldtype
6768 && (fieldcode == RECORD_TYPE || fieldcode == ARRAY_TYPE
6769 || fieldcode == UNION_TYPE))
6771 push_init_level (1);
6777 push_member_name (constructor_fields);
6778 output_init_element (value.value, strict_string,
6779 fieldtype, constructor_fields, 1, implicit);
6780 RESTORE_SPELLING_DEPTH (constructor_depth);
6783 /* Do the bookkeeping for an element that was
6784 directly output as a constructor. */
6786 /* For a record, keep track of end position of last field. */
6787 if (DECL_SIZE (constructor_fields))
6788 constructor_bit_index
6789 = size_binop (PLUS_EXPR,
6790 bit_position (constructor_fields),
6791 DECL_SIZE (constructor_fields));
6793 /* If the current field was the first one not yet written out,
6794 it isn't now, so update. */
6795 if (constructor_unfilled_fields == constructor_fields)
6797 constructor_unfilled_fields = TREE_CHAIN (constructor_fields);
6798 /* Skip any nameless bit fields. */
6799 while (constructor_unfilled_fields != 0
6800 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
6801 && DECL_NAME (constructor_unfilled_fields) == 0)
6802 constructor_unfilled_fields =
6803 TREE_CHAIN (constructor_unfilled_fields);
6807 constructor_fields = TREE_CHAIN (constructor_fields);
6808 /* Skip any nameless bit fields at the beginning. */
6809 while (constructor_fields != 0
6810 && DECL_C_BIT_FIELD (constructor_fields)
6811 && DECL_NAME (constructor_fields) == 0)
6812 constructor_fields = TREE_CHAIN (constructor_fields);
6814 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6817 enum tree_code fieldcode;
6819 if (constructor_fields == 0)
6821 pedwarn_init (input_location, 0,
6822 "excess elements in union initializer");
6826 fieldtype = TREE_TYPE (constructor_fields);
6827 if (fieldtype != error_mark_node)
6828 fieldtype = TYPE_MAIN_VARIANT (fieldtype);
6829 fieldcode = TREE_CODE (fieldtype);
6831 /* Warn that traditional C rejects initialization of unions.
6832 We skip the warning if the value is zero. This is done
6833 under the assumption that the zero initializer in user
6834 code appears conditioned on e.g. __STDC__ to avoid
6835 "missing initializer" warnings and relies on default
6836 initialization to zero in the traditional C case.
6837 We also skip the warning if the initializer is designated,
6838 again on the assumption that this must be conditional on
6839 __STDC__ anyway (and we've already complained about the
6840 member-designator already). */
6841 if (!in_system_header && !constructor_designated
6842 && !(value.value && (integer_zerop (value.value)
6843 || real_zerop (value.value))))
6844 warning (OPT_Wtraditional, "traditional C rejects initialization "
6847 /* Accept a string constant to initialize a subarray. */
6848 if (value.value != 0
6849 && fieldcode == ARRAY_TYPE
6850 && INTEGRAL_TYPE_P (TREE_TYPE (fieldtype))
6852 value.value = orig_value;
6853 /* Otherwise, if we have come to a subaggregate,
6854 and we don't have an element of its type, push into it. */
6855 else if (value.value != 0
6856 && value.value != error_mark_node
6857 && TYPE_MAIN_VARIANT (TREE_TYPE (value.value)) != fieldtype
6858 && (fieldcode == RECORD_TYPE || fieldcode == ARRAY_TYPE
6859 || fieldcode == UNION_TYPE))
6861 push_init_level (1);
6867 push_member_name (constructor_fields);
6868 output_init_element (value.value, strict_string,
6869 fieldtype, constructor_fields, 1, implicit);
6870 RESTORE_SPELLING_DEPTH (constructor_depth);
6873 /* Do the bookkeeping for an element that was
6874 directly output as a constructor. */
6876 constructor_bit_index = DECL_SIZE (constructor_fields);
6877 constructor_unfilled_fields = TREE_CHAIN (constructor_fields);
6880 constructor_fields = 0;
6882 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6884 tree elttype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
6885 enum tree_code eltcode = TREE_CODE (elttype);
6887 /* Accept a string constant to initialize a subarray. */
6888 if (value.value != 0
6889 && eltcode == ARRAY_TYPE
6890 && INTEGRAL_TYPE_P (TREE_TYPE (elttype))
6892 value.value = orig_value;
6893 /* Otherwise, if we have come to a subaggregate,
6894 and we don't have an element of its type, push into it. */
6895 else if (value.value != 0
6896 && value.value != error_mark_node
6897 && TYPE_MAIN_VARIANT (TREE_TYPE (value.value)) != elttype
6898 && (eltcode == RECORD_TYPE || eltcode == ARRAY_TYPE
6899 || eltcode == UNION_TYPE))
6901 push_init_level (1);
6905 if (constructor_max_index != 0
6906 && (tree_int_cst_lt (constructor_max_index, constructor_index)
6907 || integer_all_onesp (constructor_max_index)))
6909 pedwarn_init (input_location, 0,
6910 "excess elements in array initializer");
6914 /* Now output the actual element. */
6917 push_array_bounds (tree_low_cst (constructor_index, 1));
6918 output_init_element (value.value, strict_string,
6919 elttype, constructor_index, 1, implicit);
6920 RESTORE_SPELLING_DEPTH (constructor_depth);
6924 = size_binop (PLUS_EXPR, constructor_index, bitsize_one_node);
6927 /* If we are doing the bookkeeping for an element that was
6928 directly output as a constructor, we must update
6929 constructor_unfilled_index. */
6930 constructor_unfilled_index = constructor_index;
6932 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
6934 tree elttype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
6936 /* Do a basic check of initializer size. Note that vectors
6937 always have a fixed size derived from their type. */
6938 if (tree_int_cst_lt (constructor_max_index, constructor_index))
6940 pedwarn_init (input_location, 0,
6941 "excess elements in vector initializer");
6945 /* Now output the actual element. */
6947 output_init_element (value.value, strict_string,
6948 elttype, constructor_index, 1, implicit);
6951 = size_binop (PLUS_EXPR, constructor_index, bitsize_one_node);
6954 /* If we are doing the bookkeeping for an element that was
6955 directly output as a constructor, we must update
6956 constructor_unfilled_index. */
6957 constructor_unfilled_index = constructor_index;
6960 /* Handle the sole element allowed in a braced initializer
6961 for a scalar variable. */
6962 else if (constructor_type != error_mark_node
6963 && constructor_fields == 0)
6965 pedwarn_init (input_location, 0,
6966 "excess elements in scalar initializer");
6972 output_init_element (value.value, strict_string,
6973 constructor_type, NULL_TREE, 1, implicit);
6974 constructor_fields = 0;
6977 /* Handle range initializers either at this level or anywhere higher
6978 in the designator stack. */
6979 if (constructor_range_stack)
6981 struct constructor_range_stack *p, *range_stack;
6984 range_stack = constructor_range_stack;
6985 constructor_range_stack = 0;
6986 while (constructor_stack != range_stack->stack)
6988 gcc_assert (constructor_stack->implicit);
6989 process_init_element (pop_init_level (1), true);
6991 for (p = range_stack;
6992 !p->range_end || tree_int_cst_equal (p->index, p->range_end);
6995 gcc_assert (constructor_stack->implicit);
6996 process_init_element (pop_init_level (1), true);
6999 p->index = size_binop (PLUS_EXPR, p->index, bitsize_one_node);
7000 if (tree_int_cst_equal (p->index, p->range_end) && !p->prev)
7005 constructor_index = p->index;
7006 constructor_fields = p->fields;
7007 if (finish && p->range_end && p->index == p->range_start)
7015 push_init_level (2);
7016 p->stack = constructor_stack;
7017 if (p->range_end && tree_int_cst_equal (p->index, p->range_end))
7018 p->index = p->range_start;
7022 constructor_range_stack = range_stack;
7029 constructor_range_stack = 0;
7032 /* Build a complete asm-statement, whose components are a CV_QUALIFIER
7033 (guaranteed to be 'volatile' or null) and ARGS (represented using
7034 an ASM_EXPR node). */
7036 build_asm_stmt (tree cv_qualifier, tree args)
7038 if (!ASM_VOLATILE_P (args) && cv_qualifier)
7039 ASM_VOLATILE_P (args) = 1;
7040 return add_stmt (args);
7043 /* Build an asm-expr, whose components are a STRING, some OUTPUTS,
7044 some INPUTS, and some CLOBBERS. The latter three may be NULL.
7045 SIMPLE indicates whether there was anything at all after the
7046 string in the asm expression -- asm("blah") and asm("blah" : )
7047 are subtly different. We use a ASM_EXPR node to represent this. */
7049 build_asm_expr (tree string, tree outputs, tree inputs, tree clobbers,
7055 const char *constraint;
7056 const char **oconstraints;
7057 bool allows_mem, allows_reg, is_inout;
7058 int ninputs, noutputs;
7060 ninputs = list_length (inputs);
7061 noutputs = list_length (outputs);
7062 oconstraints = (const char **) alloca (noutputs * sizeof (const char *));
7064 string = resolve_asm_operand_names (string, outputs, inputs);
7066 /* Remove output conversions that change the type but not the mode. */
7067 for (i = 0, tail = outputs; tail; ++i, tail = TREE_CHAIN (tail))
7069 tree output = TREE_VALUE (tail);
7071 /* ??? Really, this should not be here. Users should be using a
7072 proper lvalue, dammit. But there's a long history of using casts
7073 in the output operands. In cases like longlong.h, this becomes a
7074 primitive form of typechecking -- if the cast can be removed, then
7075 the output operand had a type of the proper width; otherwise we'll
7076 get an error. Gross, but ... */
7077 STRIP_NOPS (output);
7079 if (!lvalue_or_else (output, lv_asm))
7080 output = error_mark_node;
7082 if (output != error_mark_node
7083 && (TREE_READONLY (output)
7084 || TYPE_READONLY (TREE_TYPE (output))
7085 || ((TREE_CODE (TREE_TYPE (output)) == RECORD_TYPE
7086 || TREE_CODE (TREE_TYPE (output)) == UNION_TYPE)
7087 && C_TYPE_FIELDS_READONLY (TREE_TYPE (output)))))
7088 readonly_error (output, lv_asm);
7090 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
7091 oconstraints[i] = constraint;
7093 if (parse_output_constraint (&constraint, i, ninputs, noutputs,
7094 &allows_mem, &allows_reg, &is_inout))
7096 /* If the operand is going to end up in memory,
7097 mark it addressable. */
7098 if (!allows_reg && !c_mark_addressable (output))
7099 output = error_mark_node;
7102 output = error_mark_node;
7104 TREE_VALUE (tail) = output;
7107 for (i = 0, tail = inputs; tail; ++i, tail = TREE_CHAIN (tail))
7111 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
7112 input = TREE_VALUE (tail);
7114 if (parse_input_constraint (&constraint, i, ninputs, noutputs, 0,
7115 oconstraints, &allows_mem, &allows_reg))
7117 /* If the operand is going to end up in memory,
7118 mark it addressable. */
7119 if (!allows_reg && allows_mem)
7121 /* Strip the nops as we allow this case. FIXME, this really
7122 should be rejected or made deprecated. */
7124 if (!c_mark_addressable (input))
7125 input = error_mark_node;
7129 input = error_mark_node;
7131 TREE_VALUE (tail) = input;
7134 args = build_stmt (ASM_EXPR, string, outputs, inputs, clobbers);
7136 /* asm statements without outputs, including simple ones, are treated
7138 ASM_INPUT_P (args) = simple;
7139 ASM_VOLATILE_P (args) = (noutputs == 0);
7144 /* Generate a goto statement to LABEL. */
7147 c_finish_goto_label (tree label)
7149 tree decl = lookup_label (label);
7153 if (C_DECL_UNJUMPABLE_STMT_EXPR (decl))
7155 error ("jump into statement expression");
7159 if (C_DECL_UNJUMPABLE_VM (decl))
7161 error ("jump into scope of identifier with variably modified type");
7165 if (!C_DECL_UNDEFINABLE_STMT_EXPR (decl))
7167 /* No jump from outside this statement expression context, so
7168 record that there is a jump from within this context. */
7169 struct c_label_list *nlist;
7170 nlist = XOBNEW (&parser_obstack, struct c_label_list);
7171 nlist->next = label_context_stack_se->labels_used;
7172 nlist->label = decl;
7173 label_context_stack_se->labels_used = nlist;
7176 if (!C_DECL_UNDEFINABLE_VM (decl))
7178 /* No jump from outside this context context of identifiers with
7179 variably modified type, so record that there is a jump from
7180 within this context. */
7181 struct c_label_list *nlist;
7182 nlist = XOBNEW (&parser_obstack, struct c_label_list);
7183 nlist->next = label_context_stack_vm->labels_used;
7184 nlist->label = decl;
7185 label_context_stack_vm->labels_used = nlist;
7188 TREE_USED (decl) = 1;
7189 return add_stmt (build1 (GOTO_EXPR, void_type_node, decl));
7192 /* Generate a computed goto statement to EXPR. */
7195 c_finish_goto_ptr (tree expr)
7197 pedwarn (input_location, OPT_pedantic, "ISO C forbids %<goto *expr;%>");
7198 expr = convert (ptr_type_node, expr);
7199 return add_stmt (build1 (GOTO_EXPR, void_type_node, expr));
7202 /* Generate a C `return' statement. RETVAL is the expression for what
7203 to return, or a null pointer for `return;' with no value. */
7206 c_finish_return (tree retval)
7208 tree valtype = TREE_TYPE (TREE_TYPE (current_function_decl)), ret_stmt;
7209 bool no_warning = false;
7211 if (TREE_THIS_VOLATILE (current_function_decl))
7212 warning (0, "function declared %<noreturn%> has a %<return%> statement");
7216 current_function_returns_null = 1;
7217 if ((warn_return_type || flag_isoc99)
7218 && valtype != 0 && TREE_CODE (valtype) != VOID_TYPE)
7220 pedwarn_c99 (input_location, flag_isoc99 ? 0 : OPT_Wreturn_type,
7221 "%<return%> with no value, in "
7222 "function returning non-void");
7226 else if (valtype == 0 || TREE_CODE (valtype) == VOID_TYPE)
7228 current_function_returns_null = 1;
7229 if (TREE_CODE (TREE_TYPE (retval)) != VOID_TYPE)
7230 pedwarn (input_location, 0,
7231 "%<return%> with a value, in function returning void");
7233 pedwarn (input_location, OPT_pedantic, "ISO C forbids "
7234 "%<return%> with expression, in function returning void");
7238 tree t = convert_for_assignment (valtype, retval, ic_return,
7239 NULL_TREE, NULL_TREE, 0);
7240 tree res = DECL_RESULT (current_function_decl);
7243 current_function_returns_value = 1;
7244 if (t == error_mark_node)
7247 inner = t = convert (TREE_TYPE (res), t);
7249 /* Strip any conversions, additions, and subtractions, and see if
7250 we are returning the address of a local variable. Warn if so. */
7253 switch (TREE_CODE (inner))
7256 case NON_LVALUE_EXPR:
7258 case POINTER_PLUS_EXPR:
7259 inner = TREE_OPERAND (inner, 0);
7263 /* If the second operand of the MINUS_EXPR has a pointer
7264 type (or is converted from it), this may be valid, so
7265 don't give a warning. */
7267 tree op1 = TREE_OPERAND (inner, 1);
7269 while (!POINTER_TYPE_P (TREE_TYPE (op1))
7270 && (CONVERT_EXPR_P (op1)
7271 || TREE_CODE (op1) == NON_LVALUE_EXPR))
7272 op1 = TREE_OPERAND (op1, 0);
7274 if (POINTER_TYPE_P (TREE_TYPE (op1)))
7277 inner = TREE_OPERAND (inner, 0);
7282 inner = TREE_OPERAND (inner, 0);
7284 while (REFERENCE_CLASS_P (inner)
7285 && TREE_CODE (inner) != INDIRECT_REF)
7286 inner = TREE_OPERAND (inner, 0);
7289 && !DECL_EXTERNAL (inner)
7290 && !TREE_STATIC (inner)
7291 && DECL_CONTEXT (inner) == current_function_decl)
7292 warning (0, "function returns address of local variable");
7302 retval = build2 (MODIFY_EXPR, TREE_TYPE (res), res, t);
7304 if (warn_sequence_point)
7305 verify_sequence_points (retval);
7308 ret_stmt = build_stmt (RETURN_EXPR, retval);
7309 TREE_NO_WARNING (ret_stmt) |= no_warning;
7310 return add_stmt (ret_stmt);
7314 /* The SWITCH_EXPR being built. */
7317 /* The original type of the testing expression, i.e. before the
7318 default conversion is applied. */
7321 /* A splay-tree mapping the low element of a case range to the high
7322 element, or NULL_TREE if there is no high element. Used to
7323 determine whether or not a new case label duplicates an old case
7324 label. We need a tree, rather than simply a hash table, because
7325 of the GNU case range extension. */
7328 /* Number of nested statement expressions within this switch
7329 statement; if nonzero, case and default labels may not
7331 unsigned int blocked_stmt_expr;
7333 /* Scope of outermost declarations of identifiers with variably
7334 modified type within this switch statement; if nonzero, case and
7335 default labels may not appear. */
7336 unsigned int blocked_vm;
7338 /* The next node on the stack. */
7339 struct c_switch *next;
7342 /* A stack of the currently active switch statements. The innermost
7343 switch statement is on the top of the stack. There is no need to
7344 mark the stack for garbage collection because it is only active
7345 during the processing of the body of a function, and we never
7346 collect at that point. */
7348 struct c_switch *c_switch_stack;
7350 /* Start a C switch statement, testing expression EXP. Return the new
7354 c_start_case (tree exp)
7356 tree orig_type = error_mark_node;
7357 struct c_switch *cs;
7359 if (exp != error_mark_node)
7361 orig_type = TREE_TYPE (exp);
7363 if (!INTEGRAL_TYPE_P (orig_type))
7365 if (orig_type != error_mark_node)
7367 error ("switch quantity not an integer");
7368 orig_type = error_mark_node;
7370 exp = integer_zero_node;
7374 tree type = TYPE_MAIN_VARIANT (orig_type);
7376 if (!in_system_header
7377 && (type == long_integer_type_node
7378 || type == long_unsigned_type_node))
7379 warning (OPT_Wtraditional, "%<long%> switch expression not "
7380 "converted to %<int%> in ISO C");
7382 exp = default_conversion (exp);
7384 if (warn_sequence_point)
7385 verify_sequence_points (exp);
7389 /* Add this new SWITCH_EXPR to the stack. */
7390 cs = XNEW (struct c_switch);
7391 cs->switch_expr = build3 (SWITCH_EXPR, orig_type, exp, NULL_TREE, NULL_TREE);
7392 cs->orig_type = orig_type;
7393 cs->cases = splay_tree_new (case_compare, NULL, NULL);
7394 cs->blocked_stmt_expr = 0;
7396 cs->next = c_switch_stack;
7397 c_switch_stack = cs;
7399 return add_stmt (cs->switch_expr);
7402 /* Process a case label. */
7405 do_case (tree low_value, tree high_value)
7407 tree label = NULL_TREE;
7409 if (c_switch_stack && !c_switch_stack->blocked_stmt_expr
7410 && !c_switch_stack->blocked_vm)
7412 label = c_add_case_label (c_switch_stack->cases,
7413 SWITCH_COND (c_switch_stack->switch_expr),
7414 c_switch_stack->orig_type,
7415 low_value, high_value);
7416 if (label == error_mark_node)
7419 else if (c_switch_stack && c_switch_stack->blocked_stmt_expr)
7422 error ("case label in statement expression not containing "
7423 "enclosing switch statement");
7425 error ("%<default%> label in statement expression not containing "
7426 "enclosing switch statement");
7428 else if (c_switch_stack && c_switch_stack->blocked_vm)
7431 error ("case label in scope of identifier with variably modified "
7432 "type not containing enclosing switch statement");
7434 error ("%<default%> label in scope of identifier with variably "
7435 "modified type not containing enclosing switch statement");
7438 error ("case label not within a switch statement");
7440 error ("%<default%> label not within a switch statement");
7445 /* Finish the switch statement. */
7448 c_finish_case (tree body)
7450 struct c_switch *cs = c_switch_stack;
7451 location_t switch_location;
7453 SWITCH_BODY (cs->switch_expr) = body;
7455 /* We must not be within a statement expression nested in the switch
7456 at this point; we might, however, be within the scope of an
7457 identifier with variably modified type nested in the switch. */
7458 gcc_assert (!cs->blocked_stmt_expr);
7460 /* Emit warnings as needed. */
7461 if (EXPR_HAS_LOCATION (cs->switch_expr))
7462 switch_location = EXPR_LOCATION (cs->switch_expr);
7464 switch_location = input_location;
7465 c_do_switch_warnings (cs->cases, switch_location,
7466 TREE_TYPE (cs->switch_expr),
7467 SWITCH_COND (cs->switch_expr));
7469 /* Pop the stack. */
7470 c_switch_stack = cs->next;
7471 splay_tree_delete (cs->cases);
7475 /* Emit an if statement. IF_LOCUS is the location of the 'if'. COND,
7476 THEN_BLOCK and ELSE_BLOCK are expressions to be used; ELSE_BLOCK
7477 may be null. NESTED_IF is true if THEN_BLOCK contains another IF
7478 statement, and was not surrounded with parenthesis. */
7481 c_finish_if_stmt (location_t if_locus, tree cond, tree then_block,
7482 tree else_block, bool nested_if)
7486 /* Diagnose an ambiguous else if if-then-else is nested inside if-then. */
7487 if (warn_parentheses && nested_if && else_block == NULL)
7489 tree inner_if = then_block;
7491 /* We know from the grammar productions that there is an IF nested
7492 within THEN_BLOCK. Due to labels and c99 conditional declarations,
7493 it might not be exactly THEN_BLOCK, but should be the last
7494 non-container statement within. */
7496 switch (TREE_CODE (inner_if))
7501 inner_if = BIND_EXPR_BODY (inner_if);
7503 case STATEMENT_LIST:
7504 inner_if = expr_last (then_block);
7506 case TRY_FINALLY_EXPR:
7507 case TRY_CATCH_EXPR:
7508 inner_if = TREE_OPERAND (inner_if, 0);
7515 if (COND_EXPR_ELSE (inner_if))
7516 warning (OPT_Wparentheses,
7517 "%Hsuggest explicit braces to avoid ambiguous %<else%>",
7521 stmt = build3 (COND_EXPR, void_type_node, cond, then_block, else_block);
7522 SET_EXPR_LOCATION (stmt, if_locus);
7526 /* Emit a general-purpose loop construct. START_LOCUS is the location of
7527 the beginning of the loop. COND is the loop condition. COND_IS_FIRST
7528 is false for DO loops. INCR is the FOR increment expression. BODY is
7529 the statement controlled by the loop. BLAB is the break label. CLAB is
7530 the continue label. Everything is allowed to be NULL. */
7533 c_finish_loop (location_t start_locus, tree cond, tree incr, tree body,
7534 tree blab, tree clab, bool cond_is_first)
7536 tree entry = NULL, exit = NULL, t;
7538 /* If the condition is zero don't generate a loop construct. */
7539 if (cond && integer_zerop (cond))
7543 t = build_and_jump (&blab);
7544 SET_EXPR_LOCATION (t, start_locus);
7550 tree top = build1 (LABEL_EXPR, void_type_node, NULL_TREE);
7552 /* If we have an exit condition, then we build an IF with gotos either
7553 out of the loop, or to the top of it. If there's no exit condition,
7554 then we just build a jump back to the top. */
7555 exit = build_and_jump (&LABEL_EXPR_LABEL (top));
7557 if (cond && !integer_nonzerop (cond))
7559 /* Canonicalize the loop condition to the end. This means
7560 generating a branch to the loop condition. Reuse the
7561 continue label, if possible. */
7566 entry = build1 (LABEL_EXPR, void_type_node, NULL_TREE);
7567 t = build_and_jump (&LABEL_EXPR_LABEL (entry));
7570 t = build1 (GOTO_EXPR, void_type_node, clab);
7571 SET_EXPR_LOCATION (t, start_locus);
7575 t = build_and_jump (&blab);
7576 exit = fold_build3 (COND_EXPR, void_type_node, cond, exit, t);
7578 SET_EXPR_LOCATION (exit, start_locus);
7580 SET_EXPR_LOCATION (exit, input_location);
7589 add_stmt (build1 (LABEL_EXPR, void_type_node, clab));
7597 add_stmt (build1 (LABEL_EXPR, void_type_node, blab));
7601 c_finish_bc_stmt (tree *label_p, bool is_break)
7604 tree label = *label_p;
7606 /* In switch statements break is sometimes stylistically used after
7607 a return statement. This can lead to spurious warnings about
7608 control reaching the end of a non-void function when it is
7609 inlined. Note that we are calling block_may_fallthru with
7610 language specific tree nodes; this works because
7611 block_may_fallthru returns true when given something it does not
7613 skip = !block_may_fallthru (cur_stmt_list);
7618 *label_p = label = create_artificial_label ();
7620 else if (TREE_CODE (label) == LABEL_DECL)
7622 else switch (TREE_INT_CST_LOW (label))
7626 error ("break statement not within loop or switch");
7628 error ("continue statement not within a loop");
7632 gcc_assert (is_break);
7633 error ("break statement used with OpenMP for loop");
7644 add_stmt (build_predict_expr (PRED_CONTINUE, NOT_TAKEN));
7646 return add_stmt (build1 (GOTO_EXPR, void_type_node, label));
7649 /* A helper routine for c_process_expr_stmt and c_finish_stmt_expr. */
7652 emit_side_effect_warnings (tree expr)
7654 if (expr == error_mark_node)
7656 else if (!TREE_SIDE_EFFECTS (expr))
7658 if (!VOID_TYPE_P (TREE_TYPE (expr)) && !TREE_NO_WARNING (expr))
7659 warning (OPT_Wunused_value, "%Hstatement with no effect",
7660 EXPR_HAS_LOCATION (expr) ? EXPR_LOCUS (expr) : &input_location);
7663 warn_if_unused_value (expr, input_location);
7666 /* Process an expression as if it were a complete statement. Emit
7667 diagnostics, but do not call ADD_STMT. */
7670 c_process_expr_stmt (tree expr)
7675 if (warn_sequence_point)
7676 verify_sequence_points (expr);
7678 if (TREE_TYPE (expr) != error_mark_node
7679 && !COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (expr))
7680 && TREE_CODE (TREE_TYPE (expr)) != ARRAY_TYPE)
7681 error ("expression statement has incomplete type");
7683 /* If we're not processing a statement expression, warn about unused values.
7684 Warnings for statement expressions will be emitted later, once we figure
7685 out which is the result. */
7686 if (!STATEMENT_LIST_STMT_EXPR (cur_stmt_list)
7687 && warn_unused_value)
7688 emit_side_effect_warnings (expr);
7690 /* If the expression is not of a type to which we cannot assign a line
7691 number, wrap the thing in a no-op NOP_EXPR. */
7692 if (DECL_P (expr) || CONSTANT_CLASS_P (expr))
7693 expr = build1 (NOP_EXPR, TREE_TYPE (expr), expr);
7695 if (CAN_HAVE_LOCATION_P (expr))
7696 SET_EXPR_LOCATION (expr, input_location);
7701 /* Emit an expression as a statement. */
7704 c_finish_expr_stmt (tree expr)
7707 return add_stmt (c_process_expr_stmt (expr));
7712 /* Do the opposite and emit a statement as an expression. To begin,
7713 create a new binding level and return it. */
7716 c_begin_stmt_expr (void)
7719 struct c_label_context_se *nstack;
7720 struct c_label_list *glist;
7722 /* We must force a BLOCK for this level so that, if it is not expanded
7723 later, there is a way to turn off the entire subtree of blocks that
7724 are contained in it. */
7726 ret = c_begin_compound_stmt (true);
7729 c_switch_stack->blocked_stmt_expr++;
7730 gcc_assert (c_switch_stack->blocked_stmt_expr != 0);
7732 for (glist = label_context_stack_se->labels_used;
7734 glist = glist->next)
7736 C_DECL_UNDEFINABLE_STMT_EXPR (glist->label) = 1;
7738 nstack = XOBNEW (&parser_obstack, struct c_label_context_se);
7739 nstack->labels_def = NULL;
7740 nstack->labels_used = NULL;
7741 nstack->next = label_context_stack_se;
7742 label_context_stack_se = nstack;
7744 /* Mark the current statement list as belonging to a statement list. */
7745 STATEMENT_LIST_STMT_EXPR (ret) = 1;
7751 c_finish_stmt_expr (tree body)
7753 tree last, type, tmp, val;
7755 struct c_label_list *dlist, *glist, *glist_prev = NULL;
7757 body = c_end_compound_stmt (body, true);
7760 gcc_assert (c_switch_stack->blocked_stmt_expr != 0);
7761 c_switch_stack->blocked_stmt_expr--;
7763 /* It is no longer possible to jump to labels defined within this
7764 statement expression. */
7765 for (dlist = label_context_stack_se->labels_def;
7767 dlist = dlist->next)
7769 C_DECL_UNJUMPABLE_STMT_EXPR (dlist->label) = 1;
7771 /* It is again possible to define labels with a goto just outside
7772 this statement expression. */
7773 for (glist = label_context_stack_se->next->labels_used;
7775 glist = glist->next)
7777 C_DECL_UNDEFINABLE_STMT_EXPR (glist->label) = 0;
7780 if (glist_prev != NULL)
7781 glist_prev->next = label_context_stack_se->labels_used;
7783 label_context_stack_se->next->labels_used
7784 = label_context_stack_se->labels_used;
7785 label_context_stack_se = label_context_stack_se->next;
7787 /* Locate the last statement in BODY. See c_end_compound_stmt
7788 about always returning a BIND_EXPR. */
7789 last_p = &BIND_EXPR_BODY (body);
7790 last = BIND_EXPR_BODY (body);
7793 if (TREE_CODE (last) == STATEMENT_LIST)
7795 tree_stmt_iterator i;
7797 /* This can happen with degenerate cases like ({ }). No value. */
7798 if (!TREE_SIDE_EFFECTS (last))
7801 /* If we're supposed to generate side effects warnings, process
7802 all of the statements except the last. */
7803 if (warn_unused_value)
7805 for (i = tsi_start (last); !tsi_one_before_end_p (i); tsi_next (&i))
7806 emit_side_effect_warnings (tsi_stmt (i));
7809 i = tsi_last (last);
7810 last_p = tsi_stmt_ptr (i);
7814 /* If the end of the list is exception related, then the list was split
7815 by a call to push_cleanup. Continue searching. */
7816 if (TREE_CODE (last) == TRY_FINALLY_EXPR
7817 || TREE_CODE (last) == TRY_CATCH_EXPR)
7819 last_p = &TREE_OPERAND (last, 0);
7821 goto continue_searching;
7824 /* In the case that the BIND_EXPR is not necessary, return the
7825 expression out from inside it. */
7826 if (last == error_mark_node
7827 || (last == BIND_EXPR_BODY (body)
7828 && BIND_EXPR_VARS (body) == NULL))
7830 /* Do not warn if the return value of a statement expression is
7832 if (CAN_HAVE_LOCATION_P (last))
7833 TREE_NO_WARNING (last) = 1;
7837 /* Extract the type of said expression. */
7838 type = TREE_TYPE (last);
7840 /* If we're not returning a value at all, then the BIND_EXPR that
7841 we already have is a fine expression to return. */
7842 if (!type || VOID_TYPE_P (type))
7845 /* Now that we've located the expression containing the value, it seems
7846 silly to make voidify_wrapper_expr repeat the process. Create a
7847 temporary of the appropriate type and stick it in a TARGET_EXPR. */
7848 tmp = create_tmp_var_raw (type, NULL);
7850 /* Unwrap a no-op NOP_EXPR as added by c_finish_expr_stmt. This avoids
7851 tree_expr_nonnegative_p giving up immediately. */
7853 if (TREE_CODE (val) == NOP_EXPR
7854 && TREE_TYPE (val) == TREE_TYPE (TREE_OPERAND (val, 0)))
7855 val = TREE_OPERAND (val, 0);
7857 *last_p = build2 (MODIFY_EXPR, void_type_node, tmp, val);
7858 SET_EXPR_LOCUS (*last_p, EXPR_LOCUS (last));
7860 return build4 (TARGET_EXPR, type, tmp, body, NULL_TREE, NULL_TREE);
7863 /* Begin the scope of an identifier of variably modified type, scope
7864 number SCOPE. Jumping from outside this scope to inside it is not
7868 c_begin_vm_scope (unsigned int scope)
7870 struct c_label_context_vm *nstack;
7871 struct c_label_list *glist;
7873 gcc_assert (scope > 0);
7875 /* At file_scope, we don't have to do any processing. */
7876 if (label_context_stack_vm == NULL)
7879 if (c_switch_stack && !c_switch_stack->blocked_vm)
7880 c_switch_stack->blocked_vm = scope;
7881 for (glist = label_context_stack_vm->labels_used;
7883 glist = glist->next)
7885 C_DECL_UNDEFINABLE_VM (glist->label) = 1;
7887 nstack = XOBNEW (&parser_obstack, struct c_label_context_vm);
7888 nstack->labels_def = NULL;
7889 nstack->labels_used = NULL;
7890 nstack->scope = scope;
7891 nstack->next = label_context_stack_vm;
7892 label_context_stack_vm = nstack;
7895 /* End a scope which may contain identifiers of variably modified
7896 type, scope number SCOPE. */
7899 c_end_vm_scope (unsigned int scope)
7901 if (label_context_stack_vm == NULL)
7903 if (c_switch_stack && c_switch_stack->blocked_vm == scope)
7904 c_switch_stack->blocked_vm = 0;
7905 /* We may have a number of nested scopes of identifiers with
7906 variably modified type, all at this depth. Pop each in turn. */
7907 while (label_context_stack_vm->scope == scope)
7909 struct c_label_list *dlist, *glist, *glist_prev = NULL;
7911 /* It is no longer possible to jump to labels defined within this
7913 for (dlist = label_context_stack_vm->labels_def;
7915 dlist = dlist->next)
7917 C_DECL_UNJUMPABLE_VM (dlist->label) = 1;
7919 /* It is again possible to define labels with a goto just outside
7921 for (glist = label_context_stack_vm->next->labels_used;
7923 glist = glist->next)
7925 C_DECL_UNDEFINABLE_VM (glist->label) = 0;
7928 if (glist_prev != NULL)
7929 glist_prev->next = label_context_stack_vm->labels_used;
7931 label_context_stack_vm->next->labels_used
7932 = label_context_stack_vm->labels_used;
7933 label_context_stack_vm = label_context_stack_vm->next;
7937 /* Begin and end compound statements. This is as simple as pushing
7938 and popping new statement lists from the tree. */
7941 c_begin_compound_stmt (bool do_scope)
7943 tree stmt = push_stmt_list ();
7950 c_end_compound_stmt (tree stmt, bool do_scope)
7956 if (c_dialect_objc ())
7957 objc_clear_super_receiver ();
7958 block = pop_scope ();
7961 stmt = pop_stmt_list (stmt);
7962 stmt = c_build_bind_expr (block, stmt);
7964 /* If this compound statement is nested immediately inside a statement
7965 expression, then force a BIND_EXPR to be created. Otherwise we'll
7966 do the wrong thing for ({ { 1; } }) or ({ 1; { } }). In particular,
7967 STATEMENT_LISTs merge, and thus we can lose track of what statement
7970 && STATEMENT_LIST_STMT_EXPR (cur_stmt_list)
7971 && TREE_CODE (stmt) != BIND_EXPR)
7973 stmt = build3 (BIND_EXPR, void_type_node, NULL, stmt, NULL);
7974 TREE_SIDE_EFFECTS (stmt) = 1;
7980 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
7981 when the current scope is exited. EH_ONLY is true when this is not
7982 meant to apply to normal control flow transfer. */
7985 push_cleanup (tree ARG_UNUSED (decl), tree cleanup, bool eh_only)
7987 enum tree_code code;
7991 code = eh_only ? TRY_CATCH_EXPR : TRY_FINALLY_EXPR;
7992 stmt = build_stmt (code, NULL, cleanup);
7994 stmt_expr = STATEMENT_LIST_STMT_EXPR (cur_stmt_list);
7995 list = push_stmt_list ();
7996 TREE_OPERAND (stmt, 0) = list;
7997 STATEMENT_LIST_STMT_EXPR (list) = stmt_expr;
8000 /* Build a binary-operation expression without default conversions.
8001 CODE is the kind of expression to build.
8002 LOCATION is the operator's location.
8003 This function differs from `build' in several ways:
8004 the data type of the result is computed and recorded in it,
8005 warnings are generated if arg data types are invalid,
8006 special handling for addition and subtraction of pointers is known,
8007 and some optimization is done (operations on narrow ints
8008 are done in the narrower type when that gives the same result).
8009 Constant folding is also done before the result is returned.
8011 Note that the operands will never have enumeral types, or function
8012 or array types, because either they will have the default conversions
8013 performed or they have both just been converted to some other type in which
8014 the arithmetic is to be done. */
8017 build_binary_op (location_t location, enum tree_code code,
8018 tree orig_op0, tree orig_op1, int convert_p)
8021 enum tree_code code0, code1;
8023 tree ret = error_mark_node;
8024 const char *invalid_op_diag;
8026 /* Expression code to give to the expression when it is built.
8027 Normally this is CODE, which is what the caller asked for,
8028 but in some special cases we change it. */
8029 enum tree_code resultcode = code;
8031 /* Data type in which the computation is to be performed.
8032 In the simplest cases this is the common type of the arguments. */
8033 tree result_type = NULL;
8035 /* Nonzero means operands have already been type-converted
8036 in whatever way is necessary.
8037 Zero means they need to be converted to RESULT_TYPE. */
8040 /* Nonzero means create the expression with this type, rather than
8042 tree build_type = 0;
8044 /* Nonzero means after finally constructing the expression
8045 convert it to this type. */
8046 tree final_type = 0;
8048 /* Nonzero if this is an operation like MIN or MAX which can
8049 safely be computed in short if both args are promoted shorts.
8050 Also implies COMMON.
8051 -1 indicates a bitwise operation; this makes a difference
8052 in the exact conditions for when it is safe to do the operation
8053 in a narrower mode. */
8056 /* Nonzero if this is a comparison operation;
8057 if both args are promoted shorts, compare the original shorts.
8058 Also implies COMMON. */
8059 int short_compare = 0;
8061 /* Nonzero if this is a right-shift operation, which can be computed on the
8062 original short and then promoted if the operand is a promoted short. */
8063 int short_shift = 0;
8065 /* Nonzero means set RESULT_TYPE to the common type of the args. */
8068 /* True means types are compatible as far as ObjC is concerned. */
8071 if (location == UNKNOWN_LOCATION)
8072 location = input_location;
8076 op0 = default_conversion (orig_op0);
8077 op1 = default_conversion (orig_op1);
8085 type0 = TREE_TYPE (op0);
8086 type1 = TREE_TYPE (op1);
8088 /* The expression codes of the data types of the arguments tell us
8089 whether the arguments are integers, floating, pointers, etc. */
8090 code0 = TREE_CODE (type0);
8091 code1 = TREE_CODE (type1);
8093 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
8094 STRIP_TYPE_NOPS (op0);
8095 STRIP_TYPE_NOPS (op1);
8097 /* If an error was already reported for one of the arguments,
8098 avoid reporting another error. */
8100 if (code0 == ERROR_MARK || code1 == ERROR_MARK)
8101 return error_mark_node;
8103 if ((invalid_op_diag
8104 = targetm.invalid_binary_op (code, type0, type1)))
8106 error_at (location, invalid_op_diag);
8107 return error_mark_node;
8110 objc_ok = objc_compare_types (type0, type1, -3, NULL_TREE);
8115 /* Handle the pointer + int case. */
8116 if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
8118 ret = pointer_int_sum (PLUS_EXPR, op0, op1);
8119 goto return_build_binary_op;
8121 else if (code1 == POINTER_TYPE && code0 == INTEGER_TYPE)
8123 ret = pointer_int_sum (PLUS_EXPR, op1, op0);
8124 goto return_build_binary_op;
8131 /* Subtraction of two similar pointers.
8132 We must subtract them as integers, then divide by object size. */
8133 if (code0 == POINTER_TYPE && code1 == POINTER_TYPE
8134 && comp_target_types (type0, type1))
8136 ret = pointer_diff (op0, op1);
8137 goto return_build_binary_op;
8139 /* Handle pointer minus int. Just like pointer plus int. */
8140 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
8142 ret = pointer_int_sum (MINUS_EXPR, op0, op1);
8143 goto return_build_binary_op;
8153 case TRUNC_DIV_EXPR:
8155 case FLOOR_DIV_EXPR:
8156 case ROUND_DIV_EXPR:
8157 case EXACT_DIV_EXPR:
8158 warn_for_div_by_zero (location, op1);
8160 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
8161 || code0 == FIXED_POINT_TYPE
8162 || code0 == COMPLEX_TYPE || code0 == VECTOR_TYPE)
8163 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
8164 || code1 == FIXED_POINT_TYPE
8165 || code1 == COMPLEX_TYPE || code1 == VECTOR_TYPE))
8167 enum tree_code tcode0 = code0, tcode1 = code1;
8169 if (code0 == COMPLEX_TYPE || code0 == VECTOR_TYPE)
8170 tcode0 = TREE_CODE (TREE_TYPE (TREE_TYPE (op0)));
8171 if (code1 == COMPLEX_TYPE || code1 == VECTOR_TYPE)
8172 tcode1 = TREE_CODE (TREE_TYPE (TREE_TYPE (op1)));
8174 if (!((tcode0 == INTEGER_TYPE && tcode1 == INTEGER_TYPE)
8175 || (tcode0 == FIXED_POINT_TYPE && tcode1 == FIXED_POINT_TYPE)))
8176 resultcode = RDIV_EXPR;
8178 /* Although it would be tempting to shorten always here, that
8179 loses on some targets, since the modulo instruction is
8180 undefined if the quotient can't be represented in the
8181 computation mode. We shorten only if unsigned or if
8182 dividing by something we know != -1. */
8183 shorten = (TYPE_UNSIGNED (TREE_TYPE (orig_op0))
8184 || (TREE_CODE (op1) == INTEGER_CST
8185 && !integer_all_onesp (op1)));
8193 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
8195 /* Allow vector types which are not floating point types. */
8196 else if (code0 == VECTOR_TYPE
8197 && code1 == VECTOR_TYPE
8198 && !VECTOR_FLOAT_TYPE_P (type0)
8199 && !VECTOR_FLOAT_TYPE_P (type1))
8203 case TRUNC_MOD_EXPR:
8204 case FLOOR_MOD_EXPR:
8205 warn_for_div_by_zero (location, op1);
8207 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
8209 /* Although it would be tempting to shorten always here, that loses
8210 on some targets, since the modulo instruction is undefined if the
8211 quotient can't be represented in the computation mode. We shorten
8212 only if unsigned or if dividing by something we know != -1. */
8213 shorten = (TYPE_UNSIGNED (TREE_TYPE (orig_op0))
8214 || (TREE_CODE (op1) == INTEGER_CST
8215 && !integer_all_onesp (op1)));
8220 case TRUTH_ANDIF_EXPR:
8221 case TRUTH_ORIF_EXPR:
8222 case TRUTH_AND_EXPR:
8224 case TRUTH_XOR_EXPR:
8225 if ((code0 == INTEGER_TYPE || code0 == POINTER_TYPE
8226 || code0 == REAL_TYPE || code0 == COMPLEX_TYPE
8227 || code0 == FIXED_POINT_TYPE)
8228 && (code1 == INTEGER_TYPE || code1 == POINTER_TYPE
8229 || code1 == REAL_TYPE || code1 == COMPLEX_TYPE
8230 || code1 == FIXED_POINT_TYPE))
8232 /* Result of these operations is always an int,
8233 but that does not mean the operands should be
8234 converted to ints! */
8235 result_type = integer_type_node;
8236 op0 = c_common_truthvalue_conversion (location, op0);
8237 op1 = c_common_truthvalue_conversion (location, op1);
8242 /* Shift operations: result has same type as first operand;
8243 always convert second operand to int.
8244 Also set SHORT_SHIFT if shifting rightward. */
8247 if ((code0 == INTEGER_TYPE || code0 == FIXED_POINT_TYPE)
8248 && code1 == INTEGER_TYPE)
8250 if (TREE_CODE (op1) == INTEGER_CST && skip_evaluation == 0)
8252 if (tree_int_cst_sgn (op1) < 0)
8253 warning (0, "right shift count is negative");
8256 if (!integer_zerop (op1))
8259 if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
8260 warning (0, "right shift count >= width of type");
8264 /* Use the type of the value to be shifted. */
8265 result_type = type0;
8266 /* Convert the shift-count to an integer, regardless of size
8267 of value being shifted. */
8268 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
8269 op1 = convert (integer_type_node, op1);
8270 /* Avoid converting op1 to result_type later. */
8276 if ((code0 == INTEGER_TYPE || code0 == FIXED_POINT_TYPE)
8277 && code1 == INTEGER_TYPE)
8279 if (TREE_CODE (op1) == INTEGER_CST && skip_evaluation == 0)
8281 if (tree_int_cst_sgn (op1) < 0)
8282 warning (0, "left shift count is negative");
8284 else if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
8285 warning (0, "left shift count >= width of type");
8288 /* Use the type of the value to be shifted. */
8289 result_type = type0;
8290 /* Convert the shift-count to an integer, regardless of size
8291 of value being shifted. */
8292 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
8293 op1 = convert (integer_type_node, op1);
8294 /* Avoid converting op1 to result_type later. */
8301 if (FLOAT_TYPE_P (type0) || FLOAT_TYPE_P (type1))
8302 warning_at (location,
8304 "comparing floating point with == or != is unsafe");
8305 /* Result of comparison is always int,
8306 but don't convert the args to int! */
8307 build_type = integer_type_node;
8308 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
8309 || code0 == FIXED_POINT_TYPE || code0 == COMPLEX_TYPE)
8310 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
8311 || code1 == FIXED_POINT_TYPE || code1 == COMPLEX_TYPE))
8313 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
8315 tree tt0 = TREE_TYPE (type0);
8316 tree tt1 = TREE_TYPE (type1);
8317 /* Anything compares with void *. void * compares with anything.
8318 Otherwise, the targets must be compatible
8319 and both must be object or both incomplete. */
8320 if (comp_target_types (type0, type1))
8321 result_type = common_pointer_type (type0, type1);
8322 else if (VOID_TYPE_P (tt0))
8324 /* op0 != orig_op0 detects the case of something
8325 whose value is 0 but which isn't a valid null ptr const. */
8326 if (pedantic && !null_pointer_constant_p (orig_op0)
8327 && TREE_CODE (tt1) == FUNCTION_TYPE)
8328 pedwarn (location, OPT_pedantic, "ISO C forbids "
8329 "comparison of %<void *%> with function pointer");
8331 else if (VOID_TYPE_P (tt1))
8333 if (pedantic && !null_pointer_constant_p (orig_op1)
8334 && TREE_CODE (tt0) == FUNCTION_TYPE)
8335 pedwarn (location, OPT_pedantic, "ISO C forbids "
8336 "comparison of %<void *%> with function pointer");
8339 /* Avoid warning about the volatile ObjC EH puts on decls. */
8341 pedwarn (location, 0,
8342 "comparison of distinct pointer types lacks a cast");
8344 if (result_type == NULL_TREE)
8345 result_type = ptr_type_node;
8347 else if (code0 == POINTER_TYPE && null_pointer_constant_p (orig_op1))
8349 if (TREE_CODE (op0) == ADDR_EXPR
8350 && decl_with_nonnull_addr_p (TREE_OPERAND (op0, 0)))
8351 warning_at (location,
8352 OPT_Waddress, "the address of %qD will never be NULL",
8353 TREE_OPERAND (op0, 0));
8354 result_type = type0;
8356 else if (code1 == POINTER_TYPE && null_pointer_constant_p (orig_op0))
8358 if (TREE_CODE (op1) == ADDR_EXPR
8359 && decl_with_nonnull_addr_p (TREE_OPERAND (op1, 0)))
8360 warning_at (location,
8361 OPT_Waddress, "the address of %qD will never be NULL",
8362 TREE_OPERAND (op1, 0));
8363 result_type = type1;
8365 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
8367 result_type = type0;
8368 pedwarn (location, 0, "comparison between pointer and integer");
8370 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
8372 result_type = type1;
8373 pedwarn (location, 0, "comparison between pointer and integer");
8381 build_type = integer_type_node;
8382 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
8383 || code0 == FIXED_POINT_TYPE)
8384 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
8385 || code1 == FIXED_POINT_TYPE))
8387 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
8389 if (comp_target_types (type0, type1))
8391 result_type = common_pointer_type (type0, type1);
8392 if (!COMPLETE_TYPE_P (TREE_TYPE (type0))
8393 != !COMPLETE_TYPE_P (TREE_TYPE (type1)))
8394 pedwarn (location, 0,
8395 "comparison of complete and incomplete pointers");
8396 else if (TREE_CODE (TREE_TYPE (type0)) == FUNCTION_TYPE)
8397 pedwarn (location, OPT_pedantic, "ISO C forbids "
8398 "ordered comparisons of pointers to functions");
8402 result_type = ptr_type_node;
8403 pedwarn (location, 0,
8404 "comparison of distinct pointer types lacks a cast");
8407 else if (code0 == POINTER_TYPE && null_pointer_constant_p (orig_op1))
8409 result_type = type0;
8411 pedwarn (location, OPT_pedantic,
8412 "ordered comparison of pointer with integer zero");
8413 else if (extra_warnings)
8414 warning_at (location, OPT_Wextra,
8415 "ordered comparison of pointer with integer zero");
8417 else if (code1 == POINTER_TYPE && null_pointer_constant_p (orig_op0))
8419 result_type = type1;
8420 pedwarn (location, OPT_pedantic,
8421 "ordered comparison of pointer with integer zero");
8423 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
8425 result_type = type0;
8426 pedwarn (location, 0, "comparison between pointer and integer");
8428 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
8430 result_type = type1;
8431 pedwarn (location, 0, "comparison between pointer and integer");
8439 if (code0 == ERROR_MARK || code1 == ERROR_MARK)
8440 return error_mark_node;
8442 if (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE
8443 && (!tree_int_cst_equal (TYPE_SIZE (type0), TYPE_SIZE (type1))
8444 || !same_scalar_type_ignoring_signedness (TREE_TYPE (type0),
8445 TREE_TYPE (type1))))
8447 binary_op_error (location, code, type0, type1);
8448 return error_mark_node;
8451 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE || code0 == COMPLEX_TYPE
8452 || code0 == FIXED_POINT_TYPE || code0 == VECTOR_TYPE)
8454 (code1 == INTEGER_TYPE || code1 == REAL_TYPE || code1 == COMPLEX_TYPE
8455 || code1 == FIXED_POINT_TYPE || code1 == VECTOR_TYPE))
8457 int none_complex = (code0 != COMPLEX_TYPE && code1 != COMPLEX_TYPE);
8459 if (shorten || common || short_compare)
8461 result_type = c_common_type (type0, type1);
8462 if (result_type == error_mark_node)
8463 return error_mark_node;
8466 /* For certain operations (which identify themselves by shorten != 0)
8467 if both args were extended from the same smaller type,
8468 do the arithmetic in that type and then extend.
8470 shorten !=0 and !=1 indicates a bitwise operation.
8471 For them, this optimization is safe only if
8472 both args are zero-extended or both are sign-extended.
8473 Otherwise, we might change the result.
8474 Eg, (short)-1 | (unsigned short)-1 is (int)-1
8475 but calculated in (unsigned short) it would be (unsigned short)-1. */
8477 if (shorten && none_complex)
8479 final_type = result_type;
8480 result_type = shorten_binary_op (result_type, op0, op1,
8484 /* Shifts can be shortened if shifting right. */
8489 tree arg0 = get_narrower (op0, &unsigned_arg);
8491 final_type = result_type;
8493 if (arg0 == op0 && final_type == TREE_TYPE (op0))
8494 unsigned_arg = TYPE_UNSIGNED (TREE_TYPE (op0));
8496 if (TYPE_PRECISION (TREE_TYPE (arg0)) < TYPE_PRECISION (result_type)
8497 && tree_int_cst_sgn (op1) > 0
8498 /* We can shorten only if the shift count is less than the
8499 number of bits in the smaller type size. */
8500 && compare_tree_int (op1, TYPE_PRECISION (TREE_TYPE (arg0))) < 0
8501 /* We cannot drop an unsigned shift after sign-extension. */
8502 && (!TYPE_UNSIGNED (final_type) || unsigned_arg))
8504 /* Do an unsigned shift if the operand was zero-extended. */
8506 = c_common_signed_or_unsigned_type (unsigned_arg,
8508 /* Convert value-to-be-shifted to that type. */
8509 if (TREE_TYPE (op0) != result_type)
8510 op0 = convert (result_type, op0);
8515 /* Comparison operations are shortened too but differently.
8516 They identify themselves by setting short_compare = 1. */
8520 /* Don't write &op0, etc., because that would prevent op0
8521 from being kept in a register.
8522 Instead, make copies of the our local variables and
8523 pass the copies by reference, then copy them back afterward. */
8524 tree xop0 = op0, xop1 = op1, xresult_type = result_type;
8525 enum tree_code xresultcode = resultcode;
8527 = shorten_compare (&xop0, &xop1, &xresult_type, &xresultcode);
8532 goto return_build_binary_op;
8535 op0 = xop0, op1 = xop1;
8537 resultcode = xresultcode;
8539 if (warn_sign_compare && !skip_evaluation)
8541 warn_for_sign_compare (location, orig_op0, orig_op1, op0, op1,
8542 result_type, resultcode);
8547 /* At this point, RESULT_TYPE must be nonzero to avoid an error message.
8548 If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
8549 Then the expression will be built.
8550 It will be given type FINAL_TYPE if that is nonzero;
8551 otherwise, it will be given type RESULT_TYPE. */
8555 binary_op_error (location, code, TREE_TYPE (op0), TREE_TYPE (op1));
8556 return error_mark_node;
8561 if (TREE_TYPE (op0) != result_type)
8562 op0 = convert_and_check (result_type, op0);
8563 if (TREE_TYPE (op1) != result_type)
8564 op1 = convert_and_check (result_type, op1);
8566 /* This can happen if one operand has a vector type, and the other
8567 has a different type. */
8568 if (TREE_CODE (op0) == ERROR_MARK || TREE_CODE (op1) == ERROR_MARK)
8569 return error_mark_node;
8572 if (build_type == NULL_TREE)
8573 build_type = result_type;
8575 /* Treat expressions in initializers specially as they can't trap. */
8576 ret = require_constant_value ? fold_build2_initializer (resultcode,
8579 : fold_build2 (resultcode, build_type,
8581 if (final_type != 0)
8582 ret = convert (final_type, ret);
8584 return_build_binary_op:
8585 gcc_assert (ret != error_mark_node);
8586 protected_set_expr_location (ret, location);
8591 /* Convert EXPR to be a truth-value, validating its type for this
8592 purpose. LOCATION is the source location for the expression. */
8595 c_objc_common_truthvalue_conversion (location_t location, tree expr)
8597 switch (TREE_CODE (TREE_TYPE (expr)))
8600 error_at (location, "used array that cannot be converted to pointer where scalar is required");
8601 return error_mark_node;
8604 error_at (location, "used struct type value where scalar is required");
8605 return error_mark_node;
8608 error_at (location, "used union type value where scalar is required");
8609 return error_mark_node;
8618 /* ??? Should we also give an error for void and vectors rather than
8619 leaving those to give errors later? */
8620 return c_common_truthvalue_conversion (location, expr);
8624 /* Convert EXPR to a contained DECL, updating *TC, *TI and *SE as
8628 c_expr_to_decl (tree expr, bool *tc ATTRIBUTE_UNUSED, bool *se)
8630 if (TREE_CODE (expr) == COMPOUND_LITERAL_EXPR)
8632 tree decl = COMPOUND_LITERAL_EXPR_DECL (expr);
8633 /* Executing a compound literal inside a function reinitializes
8635 if (!TREE_STATIC (decl))
8643 /* Like c_begin_compound_stmt, except force the retention of the BLOCK. */
8646 c_begin_omp_parallel (void)
8651 block = c_begin_compound_stmt (true);
8656 /* Generate OMP_PARALLEL, with CLAUSES and BLOCK as its compound statement. */
8659 c_finish_omp_parallel (tree clauses, tree block)
8663 block = c_end_compound_stmt (block, true);
8665 stmt = make_node (OMP_PARALLEL);
8666 TREE_TYPE (stmt) = void_type_node;
8667 OMP_PARALLEL_CLAUSES (stmt) = clauses;
8668 OMP_PARALLEL_BODY (stmt) = block;
8670 return add_stmt (stmt);
8673 /* Like c_begin_compound_stmt, except force the retention of the BLOCK. */
8676 c_begin_omp_task (void)
8681 block = c_begin_compound_stmt (true);
8686 /* Generate OMP_TASK, with CLAUSES and BLOCK as its compound statement. */
8689 c_finish_omp_task (tree clauses, tree block)
8693 block = c_end_compound_stmt (block, true);
8695 stmt = make_node (OMP_TASK);
8696 TREE_TYPE (stmt) = void_type_node;
8697 OMP_TASK_CLAUSES (stmt) = clauses;
8698 OMP_TASK_BODY (stmt) = block;
8700 return add_stmt (stmt);
8703 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
8704 Remove any elements from the list that are invalid. */
8707 c_finish_omp_clauses (tree clauses)
8709 bitmap_head generic_head, firstprivate_head, lastprivate_head;
8710 tree c, t, *pc = &clauses;
8713 bitmap_obstack_initialize (NULL);
8714 bitmap_initialize (&generic_head, &bitmap_default_obstack);
8715 bitmap_initialize (&firstprivate_head, &bitmap_default_obstack);
8716 bitmap_initialize (&lastprivate_head, &bitmap_default_obstack);
8718 for (pc = &clauses, c = clauses; c ; c = *pc)
8720 bool remove = false;
8721 bool need_complete = false;
8722 bool need_implicitly_determined = false;
8724 switch (OMP_CLAUSE_CODE (c))
8726 case OMP_CLAUSE_SHARED:
8728 need_implicitly_determined = true;
8729 goto check_dup_generic;
8731 case OMP_CLAUSE_PRIVATE:
8733 need_complete = true;
8734 need_implicitly_determined = true;
8735 goto check_dup_generic;
8737 case OMP_CLAUSE_REDUCTION:
8739 need_implicitly_determined = true;
8740 t = OMP_CLAUSE_DECL (c);
8741 if (AGGREGATE_TYPE_P (TREE_TYPE (t))
8742 || POINTER_TYPE_P (TREE_TYPE (t)))
8744 error ("%qE has invalid type for %<reduction%>", t);
8747 else if (FLOAT_TYPE_P (TREE_TYPE (t)))
8749 enum tree_code r_code = OMP_CLAUSE_REDUCTION_CODE (c);
8750 const char *r_name = NULL;
8767 case TRUTH_ANDIF_EXPR:
8770 case TRUTH_ORIF_EXPR:
8778 error ("%qE has invalid type for %<reduction(%s)%>",
8783 goto check_dup_generic;
8785 case OMP_CLAUSE_COPYPRIVATE:
8786 name = "copyprivate";
8787 goto check_dup_generic;
8789 case OMP_CLAUSE_COPYIN:
8791 t = OMP_CLAUSE_DECL (c);
8792 if (TREE_CODE (t) != VAR_DECL || !DECL_THREAD_LOCAL_P (t))
8794 error ("%qE must be %<threadprivate%> for %<copyin%>", t);
8797 goto check_dup_generic;
8800 t = OMP_CLAUSE_DECL (c);
8801 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
8803 error ("%qE is not a variable in clause %qs", t, name);
8806 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
8807 || bitmap_bit_p (&firstprivate_head, DECL_UID (t))
8808 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
8810 error ("%qE appears more than once in data clauses", t);
8814 bitmap_set_bit (&generic_head, DECL_UID (t));
8817 case OMP_CLAUSE_FIRSTPRIVATE:
8818 name = "firstprivate";
8819 t = OMP_CLAUSE_DECL (c);
8820 need_complete = true;
8821 need_implicitly_determined = true;
8822 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
8824 error ("%qE is not a variable in clause %<firstprivate%>", t);
8827 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
8828 || bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
8830 error ("%qE appears more than once in data clauses", t);
8834 bitmap_set_bit (&firstprivate_head, DECL_UID (t));
8837 case OMP_CLAUSE_LASTPRIVATE:
8838 name = "lastprivate";
8839 t = OMP_CLAUSE_DECL (c);
8840 need_complete = true;
8841 need_implicitly_determined = true;
8842 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
8844 error ("%qE is not a variable in clause %<lastprivate%>", t);
8847 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
8848 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
8850 error ("%qE appears more than once in data clauses", t);
8854 bitmap_set_bit (&lastprivate_head, DECL_UID (t));
8858 case OMP_CLAUSE_NUM_THREADS:
8859 case OMP_CLAUSE_SCHEDULE:
8860 case OMP_CLAUSE_NOWAIT:
8861 case OMP_CLAUSE_ORDERED:
8862 case OMP_CLAUSE_DEFAULT:
8863 case OMP_CLAUSE_UNTIED:
8864 case OMP_CLAUSE_COLLAPSE:
8865 pc = &OMP_CLAUSE_CHAIN (c);
8874 t = OMP_CLAUSE_DECL (c);
8878 t = require_complete_type (t);
8879 if (t == error_mark_node)
8883 if (need_implicitly_determined)
8885 const char *share_name = NULL;
8887 if (TREE_CODE (t) == VAR_DECL && DECL_THREAD_LOCAL_P (t))
8888 share_name = "threadprivate";
8889 else switch (c_omp_predetermined_sharing (t))
8891 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
8893 case OMP_CLAUSE_DEFAULT_SHARED:
8894 share_name = "shared";
8896 case OMP_CLAUSE_DEFAULT_PRIVATE:
8897 share_name = "private";
8904 error ("%qE is predetermined %qs for %qs",
8905 t, share_name, name);
8912 *pc = OMP_CLAUSE_CHAIN (c);
8914 pc = &OMP_CLAUSE_CHAIN (c);
8917 bitmap_obstack_release (NULL);
8921 /* Make a variant type in the proper way for C/C++, propagating qualifiers
8922 down to the element type of an array. */
8925 c_build_qualified_type (tree type, int type_quals)
8927 if (type == error_mark_node)
8930 if (TREE_CODE (type) == ARRAY_TYPE)
8933 tree element_type = c_build_qualified_type (TREE_TYPE (type),
8936 /* See if we already have an identically qualified type. */
8937 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
8939 if (TYPE_QUALS (strip_array_types (t)) == type_quals
8940 && TYPE_NAME (t) == TYPE_NAME (type)
8941 && TYPE_CONTEXT (t) == TYPE_CONTEXT (type)
8942 && attribute_list_equal (TYPE_ATTRIBUTES (t),
8943 TYPE_ATTRIBUTES (type)))
8948 tree domain = TYPE_DOMAIN (type);
8950 t = build_variant_type_copy (type);
8951 TREE_TYPE (t) = element_type;
8953 if (TYPE_STRUCTURAL_EQUALITY_P (element_type)
8954 || (domain && TYPE_STRUCTURAL_EQUALITY_P (domain)))
8955 SET_TYPE_STRUCTURAL_EQUALITY (t);
8956 else if (TYPE_CANONICAL (element_type) != element_type
8957 || (domain && TYPE_CANONICAL (domain) != domain))
8959 tree unqualified_canon
8960 = build_array_type (TYPE_CANONICAL (element_type),
8961 domain? TYPE_CANONICAL (domain)
8964 = c_build_qualified_type (unqualified_canon, type_quals);
8967 TYPE_CANONICAL (t) = t;
8972 /* A restrict-qualified pointer type must be a pointer to object or
8973 incomplete type. Note that the use of POINTER_TYPE_P also allows
8974 REFERENCE_TYPEs, which is appropriate for C++. */
8975 if ((type_quals & TYPE_QUAL_RESTRICT)
8976 && (!POINTER_TYPE_P (type)
8977 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type))))
8979 error ("invalid use of %<restrict%>");
8980 type_quals &= ~TYPE_QUAL_RESTRICT;
8983 return build_qualified_type (type, type_quals);