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 /* Check that the function is called through a compatible prototype.
2421 If it is not, replace the call by a trap, wrapped up in a compound
2422 expression if necessary. This has the nice side-effect to prevent
2423 the tree-inliner from generating invalid assignment trees which may
2424 blow up in the RTL expander later. */
2425 if (CONVERT_EXPR_P (function)
2426 && TREE_CODE (tem = TREE_OPERAND (function, 0)) == ADDR_EXPR
2427 && TREE_CODE (tem = TREE_OPERAND (tem, 0)) == FUNCTION_DECL
2428 && !comptypes (fntype, TREE_TYPE (tem)))
2430 tree return_type = TREE_TYPE (fntype);
2431 tree trap = build_function_call (built_in_decls[BUILT_IN_TRAP],
2434 /* This situation leads to run-time undefined behavior. We can't,
2435 therefore, simply error unless we can prove that all possible
2436 executions of the program must execute the code. */
2437 if (warning (0, "function called through a non-compatible type"))
2438 /* We can, however, treat "undefined" any way we please.
2439 Call abort to encourage the user to fix the program. */
2440 inform (input_location, "if this code is reached, the program will abort");
2442 if (VOID_TYPE_P (return_type))
2448 if (AGGREGATE_TYPE_P (return_type))
2449 rhs = build_compound_literal (return_type,
2450 build_constructor (return_type, 0));
2452 rhs = fold_convert (return_type, integer_zero_node);
2454 return build2 (COMPOUND_EXPR, return_type, trap, rhs);
2458 /* Convert the parameters to the types declared in the
2459 function prototype, or apply default promotions. */
2461 nargs = list_length (params);
2462 argarray = (tree *) alloca (nargs * sizeof (tree));
2463 nargs = convert_arguments (nargs, argarray, TYPE_ARG_TYPES (fntype),
2464 params, function, fundecl);
2466 return error_mark_node;
2468 /* Check that arguments to builtin functions match the expectations. */
2470 && DECL_BUILT_IN (fundecl)
2471 && DECL_BUILT_IN_CLASS (fundecl) == BUILT_IN_NORMAL
2472 && !check_builtin_function_arguments (fundecl, nargs, argarray))
2473 return error_mark_node;
2475 /* Check that the arguments to the function are valid. */
2476 check_function_arguments (TYPE_ATTRIBUTES (fntype), nargs, argarray,
2477 TYPE_ARG_TYPES (fntype));
2479 if (require_constant_value)
2481 result = fold_build_call_array_initializer (TREE_TYPE (fntype),
2482 function, nargs, argarray);
2483 if (TREE_CONSTANT (result)
2484 && (name == NULL_TREE
2485 || strncmp (IDENTIFIER_POINTER (name), "__builtin_", 10) != 0))
2486 pedwarn_init (input_location, 0, "initializer element is not constant");
2489 result = fold_build_call_array (TREE_TYPE (fntype),
2490 function, nargs, argarray);
2492 if (VOID_TYPE_P (TREE_TYPE (result)))
2494 return require_complete_type (result);
2497 /* Convert the argument expressions in the list VALUES
2498 to the types in the list TYPELIST. The resulting arguments are
2499 stored in the array ARGARRAY which has size NARGS.
2501 If TYPELIST is exhausted, or when an element has NULL as its type,
2502 perform the default conversions.
2504 PARMLIST is the chain of parm decls for the function being called.
2505 It may be 0, if that info is not available.
2506 It is used only for generating error messages.
2508 FUNCTION is a tree for the called function. It is used only for
2509 error messages, where it is formatted with %qE.
2511 This is also where warnings about wrong number of args are generated.
2513 VALUES is a chain of TREE_LIST nodes with the elements of the list
2514 in the TREE_VALUE slots of those nodes.
2516 Returns the actual number of arguments processed (which may be less
2517 than NARGS in some error situations), or -1 on failure. */
2520 convert_arguments (int nargs, tree *argarray,
2521 tree typelist, tree values, tree function, tree fundecl)
2523 tree typetail, valtail;
2525 const bool type_generic = fundecl
2526 && lookup_attribute ("type generic", TYPE_ATTRIBUTES(TREE_TYPE (fundecl)));
2529 /* Change pointer to function to the function itself for
2531 if (TREE_CODE (function) == ADDR_EXPR
2532 && TREE_CODE (TREE_OPERAND (function, 0)) == FUNCTION_DECL)
2533 function = TREE_OPERAND (function, 0);
2535 /* Handle an ObjC selector specially for diagnostics. */
2536 selector = objc_message_selector ();
2538 /* Scan the given expressions and types, producing individual
2539 converted arguments and storing them in ARGARRAY. */
2541 for (valtail = values, typetail = typelist, parmnum = 0;
2543 valtail = TREE_CHAIN (valtail), parmnum++)
2545 tree type = typetail ? TREE_VALUE (typetail) : 0;
2546 tree val = TREE_VALUE (valtail);
2547 tree rname = function;
2548 int argnum = parmnum + 1;
2549 const char *invalid_func_diag;
2551 if (type == void_type_node)
2553 error ("too many arguments to function %qE", function);
2557 if (selector && argnum > 2)
2563 STRIP_TYPE_NOPS (val);
2565 val = require_complete_type (val);
2569 /* Formal parm type is specified by a function prototype. */
2572 if (type == error_mark_node || !COMPLETE_TYPE_P (type))
2574 error ("type of formal parameter %d is incomplete", parmnum + 1);
2579 /* Optionally warn about conversions that
2580 differ from the default conversions. */
2581 if (warn_traditional_conversion || warn_traditional)
2583 unsigned int formal_prec = TYPE_PRECISION (type);
2585 if (INTEGRAL_TYPE_P (type)
2586 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
2587 warning (0, "passing argument %d of %qE as integer "
2588 "rather than floating due to prototype",
2590 if (INTEGRAL_TYPE_P (type)
2591 && TREE_CODE (TREE_TYPE (val)) == COMPLEX_TYPE)
2592 warning (0, "passing argument %d of %qE as integer "
2593 "rather than complex due to prototype",
2595 else if (TREE_CODE (type) == COMPLEX_TYPE
2596 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
2597 warning (0, "passing argument %d of %qE as complex "
2598 "rather than floating due to prototype",
2600 else if (TREE_CODE (type) == REAL_TYPE
2601 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
2602 warning (0, "passing argument %d of %qE as floating "
2603 "rather than integer due to prototype",
2605 else if (TREE_CODE (type) == COMPLEX_TYPE
2606 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
2607 warning (0, "passing argument %d of %qE as complex "
2608 "rather than integer due to prototype",
2610 else if (TREE_CODE (type) == REAL_TYPE
2611 && TREE_CODE (TREE_TYPE (val)) == COMPLEX_TYPE)
2612 warning (0, "passing argument %d of %qE as floating "
2613 "rather than complex due to prototype",
2615 /* ??? At some point, messages should be written about
2616 conversions between complex types, but that's too messy
2618 else if (TREE_CODE (type) == REAL_TYPE
2619 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
2621 /* Warn if any argument is passed as `float',
2622 since without a prototype it would be `double'. */
2623 if (formal_prec == TYPE_PRECISION (float_type_node)
2624 && type != dfloat32_type_node)
2625 warning (0, "passing argument %d of %qE as %<float%> "
2626 "rather than %<double%> due to prototype",
2629 /* Warn if mismatch between argument and prototype
2630 for decimal float types. Warn of conversions with
2631 binary float types and of precision narrowing due to
2633 else if (type != TREE_TYPE (val)
2634 && (type == dfloat32_type_node
2635 || type == dfloat64_type_node
2636 || type == dfloat128_type_node
2637 || TREE_TYPE (val) == dfloat32_type_node
2638 || TREE_TYPE (val) == dfloat64_type_node
2639 || TREE_TYPE (val) == dfloat128_type_node)
2641 <= TYPE_PRECISION (TREE_TYPE (val))
2642 || (type == dfloat128_type_node
2644 != dfloat64_type_node
2646 != dfloat32_type_node)))
2647 || (type == dfloat64_type_node
2649 != dfloat32_type_node))))
2650 warning (0, "passing argument %d of %qE as %qT "
2651 "rather than %qT due to prototype",
2652 argnum, rname, type, TREE_TYPE (val));
2655 /* Detect integer changing in width or signedness.
2656 These warnings are only activated with
2657 -Wtraditional-conversion, not with -Wtraditional. */
2658 else if (warn_traditional_conversion && INTEGRAL_TYPE_P (type)
2659 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
2661 tree would_have_been = default_conversion (val);
2662 tree type1 = TREE_TYPE (would_have_been);
2664 if (TREE_CODE (type) == ENUMERAL_TYPE
2665 && (TYPE_MAIN_VARIANT (type)
2666 == TYPE_MAIN_VARIANT (TREE_TYPE (val))))
2667 /* No warning if function asks for enum
2668 and the actual arg is that enum type. */
2670 else if (formal_prec != TYPE_PRECISION (type1))
2671 warning (OPT_Wtraditional_conversion, "passing argument %d of %qE "
2672 "with different width due to prototype",
2674 else if (TYPE_UNSIGNED (type) == TYPE_UNSIGNED (type1))
2676 /* Don't complain if the formal parameter type
2677 is an enum, because we can't tell now whether
2678 the value was an enum--even the same enum. */
2679 else if (TREE_CODE (type) == ENUMERAL_TYPE)
2681 else if (TREE_CODE (val) == INTEGER_CST
2682 && int_fits_type_p (val, type))
2683 /* Change in signedness doesn't matter
2684 if a constant value is unaffected. */
2686 /* If the value is extended from a narrower
2687 unsigned type, it doesn't matter whether we
2688 pass it as signed or unsigned; the value
2689 certainly is the same either way. */
2690 else if (TYPE_PRECISION (TREE_TYPE (val)) < TYPE_PRECISION (type)
2691 && TYPE_UNSIGNED (TREE_TYPE (val)))
2693 else if (TYPE_UNSIGNED (type))
2694 warning (OPT_Wtraditional_conversion, "passing argument %d of %qE "
2695 "as unsigned due to prototype",
2698 warning (OPT_Wtraditional_conversion, "passing argument %d of %qE "
2699 "as signed due to prototype", argnum, rname);
2703 parmval = convert_for_assignment (type, val, ic_argpass,
2707 if (targetm.calls.promote_prototypes (fundecl ? TREE_TYPE (fundecl) : 0)
2708 && INTEGRAL_TYPE_P (type)
2709 && (TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node)))
2710 parmval = default_conversion (parmval);
2712 argarray[parmnum] = parmval;
2714 else if (TREE_CODE (TREE_TYPE (val)) == REAL_TYPE
2715 && (TYPE_PRECISION (TREE_TYPE (val))
2716 < TYPE_PRECISION (double_type_node))
2717 && !DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (val))))
2720 argarray[parmnum] = val;
2722 /* Convert `float' to `double'. */
2723 argarray[parmnum] = convert (double_type_node, val);
2725 else if ((invalid_func_diag =
2726 targetm.calls.invalid_arg_for_unprototyped_fn (typelist, fundecl, val)))
2728 error (invalid_func_diag);
2732 /* Convert `short' and `char' to full-size `int'. */
2733 argarray[parmnum] = default_conversion (val);
2736 typetail = TREE_CHAIN (typetail);
2739 gcc_assert (parmnum == nargs);
2741 if (typetail != 0 && TREE_VALUE (typetail) != void_type_node)
2743 error ("too few arguments to function %qE", function);
2750 /* This is the entry point used by the parser to build unary operators
2751 in the input. CODE, a tree_code, specifies the unary operator, and
2752 ARG is the operand. For unary plus, the C parser currently uses
2753 CONVERT_EXPR for code.
2755 LOC is the location to use for the tree generated.
2759 parser_build_unary_op (enum tree_code code, struct c_expr arg, location_t loc)
2761 struct c_expr result;
2763 result.value = build_unary_op (loc, code, arg.value, 0);
2764 result.original_code = code;
2766 if (TREE_OVERFLOW_P (result.value) && !TREE_OVERFLOW_P (arg.value))
2767 overflow_warning (result.value);
2772 /* This is the entry point used by the parser to build binary operators
2773 in the input. CODE, a tree_code, specifies the binary operator, and
2774 ARG1 and ARG2 are the operands. In addition to constructing the
2775 expression, we check for operands that were written with other binary
2776 operators in a way that is likely to confuse the user.
2778 LOCATION is the location of the binary operator. */
2781 parser_build_binary_op (location_t location, enum tree_code code,
2782 struct c_expr arg1, struct c_expr arg2)
2784 struct c_expr result;
2786 enum tree_code code1 = arg1.original_code;
2787 enum tree_code code2 = arg2.original_code;
2789 result.value = build_binary_op (location, code,
2790 arg1.value, arg2.value, 1);
2791 result.original_code = code;
2793 if (TREE_CODE (result.value) == ERROR_MARK)
2796 if (location != UNKNOWN_LOCATION)
2797 protected_set_expr_location (result.value, location);
2799 /* Check for cases such as x+y<<z which users are likely
2801 if (warn_parentheses)
2802 warn_about_parentheses (code, code1, arg1.value, code2, arg2.value);
2804 if (TREE_CODE_CLASS (code1) != tcc_comparison)
2805 warn_logical_operator (code, arg1.value, arg2.value);
2807 /* Warn about comparisons against string literals, with the exception
2808 of testing for equality or inequality of a string literal with NULL. */
2809 if (code == EQ_EXPR || code == NE_EXPR)
2811 if ((code1 == STRING_CST && !integer_zerop (arg2.value))
2812 || (code2 == STRING_CST && !integer_zerop (arg1.value)))
2813 warning (OPT_Waddress, "comparison with string literal results in unspecified behavior");
2815 else if (TREE_CODE_CLASS (code) == tcc_comparison
2816 && (code1 == STRING_CST || code2 == STRING_CST))
2817 warning (OPT_Waddress, "comparison with string literal results in unspecified behavior");
2819 if (TREE_OVERFLOW_P (result.value)
2820 && !TREE_OVERFLOW_P (arg1.value)
2821 && !TREE_OVERFLOW_P (arg2.value))
2822 overflow_warning (result.value);
2827 /* Return a tree for the difference of pointers OP0 and OP1.
2828 The resulting tree has type int. */
2831 pointer_diff (tree op0, tree op1)
2833 tree restype = ptrdiff_type_node;
2835 tree target_type = TREE_TYPE (TREE_TYPE (op0));
2836 tree con0, con1, lit0, lit1;
2837 tree orig_op1 = op1;
2839 if (TREE_CODE (target_type) == VOID_TYPE)
2840 pedwarn (input_location, pedantic ? OPT_pedantic : OPT_Wpointer_arith,
2841 "pointer of type %<void *%> used in subtraction");
2842 if (TREE_CODE (target_type) == FUNCTION_TYPE)
2843 pedwarn (input_location, pedantic ? OPT_pedantic : OPT_Wpointer_arith,
2844 "pointer to a function used in subtraction");
2846 /* If the conversion to ptrdiff_type does anything like widening or
2847 converting a partial to an integral mode, we get a convert_expression
2848 that is in the way to do any simplifications.
2849 (fold-const.c doesn't know that the extra bits won't be needed.
2850 split_tree uses STRIP_SIGN_NOPS, which leaves conversions to a
2851 different mode in place.)
2852 So first try to find a common term here 'by hand'; we want to cover
2853 at least the cases that occur in legal static initializers. */
2854 if (CONVERT_EXPR_P (op0)
2855 && (TYPE_PRECISION (TREE_TYPE (op0))
2856 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op0, 0)))))
2857 con0 = TREE_OPERAND (op0, 0);
2860 if (CONVERT_EXPR_P (op1)
2861 && (TYPE_PRECISION (TREE_TYPE (op1))
2862 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op1, 0)))))
2863 con1 = TREE_OPERAND (op1, 0);
2867 if (TREE_CODE (con0) == PLUS_EXPR)
2869 lit0 = TREE_OPERAND (con0, 1);
2870 con0 = TREE_OPERAND (con0, 0);
2873 lit0 = integer_zero_node;
2875 if (TREE_CODE (con1) == PLUS_EXPR)
2877 lit1 = TREE_OPERAND (con1, 1);
2878 con1 = TREE_OPERAND (con1, 0);
2881 lit1 = integer_zero_node;
2883 if (operand_equal_p (con0, con1, 0))
2890 /* First do the subtraction as integers;
2891 then drop through to build the divide operator.
2892 Do not do default conversions on the minus operator
2893 in case restype is a short type. */
2895 op0 = build_binary_op (input_location,
2896 MINUS_EXPR, convert (restype, op0),
2897 convert (restype, op1), 0);
2898 /* This generates an error if op1 is pointer to incomplete type. */
2899 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (TREE_TYPE (orig_op1))))
2900 error ("arithmetic on pointer to an incomplete type");
2902 /* This generates an error if op0 is pointer to incomplete type. */
2903 op1 = c_size_in_bytes (target_type);
2905 /* Divide by the size, in easiest possible way. */
2906 return fold_build2 (EXACT_DIV_EXPR, restype, op0, convert (restype, op1));
2909 /* Construct and perhaps optimize a tree representation
2910 for a unary operation. CODE, a tree_code, specifies the operation
2911 and XARG is the operand.
2912 For any CODE other than ADDR_EXPR, FLAG nonzero suppresses
2913 the default promotions (such as from short to int).
2914 For ADDR_EXPR, the default promotions are not applied; FLAG nonzero
2915 allows non-lvalues; this is only used to handle conversion of non-lvalue
2916 arrays to pointers in C99.
2918 LOCATION is the location of the operator. */
2921 build_unary_op (location_t location,
2922 enum tree_code code, tree xarg, int flag)
2924 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
2927 enum tree_code typecode;
2929 tree ret = error_mark_node;
2930 int noconvert = flag;
2931 const char *invalid_op_diag;
2933 if (code != ADDR_EXPR)
2934 arg = require_complete_type (arg);
2936 typecode = TREE_CODE (TREE_TYPE (arg));
2937 if (typecode == ERROR_MARK)
2938 return error_mark_node;
2939 if (typecode == ENUMERAL_TYPE || typecode == BOOLEAN_TYPE)
2940 typecode = INTEGER_TYPE;
2942 if ((invalid_op_diag
2943 = targetm.invalid_unary_op (code, TREE_TYPE (xarg))))
2945 error_at (location, invalid_op_diag);
2946 return error_mark_node;
2952 /* This is used for unary plus, because a CONVERT_EXPR
2953 is enough to prevent anybody from looking inside for
2954 associativity, but won't generate any code. */
2955 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2956 || typecode == FIXED_POINT_TYPE || typecode == COMPLEX_TYPE
2957 || typecode == VECTOR_TYPE))
2959 error_at (location, "wrong type argument to unary plus");
2960 return error_mark_node;
2962 else if (!noconvert)
2963 arg = default_conversion (arg);
2964 arg = non_lvalue (arg);
2968 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2969 || typecode == FIXED_POINT_TYPE || typecode == COMPLEX_TYPE
2970 || typecode == VECTOR_TYPE))
2972 error_at (location, "wrong type argument to unary minus");
2973 return error_mark_node;
2975 else if (!noconvert)
2976 arg = default_conversion (arg);
2980 /* ~ works on integer types and non float vectors. */
2981 if (typecode == INTEGER_TYPE
2982 || (typecode == VECTOR_TYPE
2983 && !VECTOR_FLOAT_TYPE_P (TREE_TYPE (arg))))
2986 arg = default_conversion (arg);
2988 else if (typecode == COMPLEX_TYPE)
2991 pedwarn (location, OPT_pedantic,
2992 "ISO C does not support %<~%> for complex conjugation");
2994 arg = default_conversion (arg);
2998 error_at (location, "wrong type argument to bit-complement");
2999 return error_mark_node;
3004 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE))
3006 error_at (location, "wrong type argument to abs");
3007 return error_mark_node;
3009 else if (!noconvert)
3010 arg = default_conversion (arg);
3014 /* Conjugating a real value is a no-op, but allow it anyway. */
3015 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
3016 || typecode == COMPLEX_TYPE))
3018 error_at (location, "wrong type argument to conjugation");
3019 return error_mark_node;
3021 else if (!noconvert)
3022 arg = default_conversion (arg);
3025 case TRUTH_NOT_EXPR:
3026 if (typecode != INTEGER_TYPE && typecode != FIXED_POINT_TYPE
3027 && typecode != REAL_TYPE && typecode != POINTER_TYPE
3028 && typecode != COMPLEX_TYPE)
3031 "wrong type argument to unary exclamation mark");
3032 return error_mark_node;
3034 arg = c_objc_common_truthvalue_conversion (location, arg);
3035 ret = invert_truthvalue (arg);
3036 goto return_build_unary_op;
3039 if (TREE_CODE (arg) == COMPLEX_CST)
3040 ret = TREE_REALPART (arg);
3041 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
3042 ret = fold_build1 (REALPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg);
3045 goto return_build_unary_op;
3048 if (TREE_CODE (arg) == COMPLEX_CST)
3049 ret = TREE_IMAGPART (arg);
3050 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
3051 ret = fold_build1 (IMAGPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg);
3053 ret = omit_one_operand (TREE_TYPE (arg), integer_zero_node, arg);
3054 goto return_build_unary_op;
3056 case PREINCREMENT_EXPR:
3057 case POSTINCREMENT_EXPR:
3058 case PREDECREMENT_EXPR:
3059 case POSTDECREMENT_EXPR:
3061 /* Increment or decrement the real part of the value,
3062 and don't change the imaginary part. */
3063 if (typecode == COMPLEX_TYPE)
3067 pedwarn (location, OPT_pedantic,
3068 "ISO C does not support %<++%> and %<--%> on complex types");
3070 arg = stabilize_reference (arg);
3071 real = build_unary_op (EXPR_LOCATION (arg), REALPART_EXPR, arg, 1);
3072 imag = build_unary_op (EXPR_LOCATION (arg), IMAGPART_EXPR, arg, 1);
3073 real = build_unary_op (EXPR_LOCATION (arg), code, real, 1);
3074 if (real == error_mark_node || imag == error_mark_node)
3075 return error_mark_node;
3076 ret = build2 (COMPLEX_EXPR, TREE_TYPE (arg),
3078 goto return_build_unary_op;
3081 /* Report invalid types. */
3083 if (typecode != POINTER_TYPE && typecode != FIXED_POINT_TYPE
3084 && typecode != INTEGER_TYPE && typecode != REAL_TYPE)
3086 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
3087 error_at (location, "wrong type argument to increment");
3089 error_at (location, "wrong type argument to decrement");
3091 return error_mark_node;
3097 argtype = TREE_TYPE (arg);
3099 /* Compute the increment. */
3101 if (typecode == POINTER_TYPE)
3103 /* If pointer target is an undefined struct,
3104 we just cannot know how to do the arithmetic. */
3105 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (argtype)))
3107 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
3109 "increment of pointer to unknown structure");
3112 "decrement of pointer to unknown structure");
3114 else if (TREE_CODE (TREE_TYPE (argtype)) == FUNCTION_TYPE
3115 || TREE_CODE (TREE_TYPE (argtype)) == VOID_TYPE)
3117 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
3118 pedwarn (location, pedantic ? OPT_pedantic : OPT_Wpointer_arith,
3119 "wrong type argument to increment");
3121 pedwarn (location, pedantic ? OPT_pedantic : OPT_Wpointer_arith,
3122 "wrong type argument to decrement");
3125 inc = c_size_in_bytes (TREE_TYPE (argtype));
3126 inc = fold_convert (sizetype, inc);
3128 else if (FRACT_MODE_P (TYPE_MODE (argtype)))
3130 /* For signed fract types, we invert ++ to -- or
3131 -- to ++, and change inc from 1 to -1, because
3132 it is not possible to represent 1 in signed fract constants.
3133 For unsigned fract types, the result always overflows and
3134 we get an undefined (original) or the maximum value. */
3135 if (code == PREINCREMENT_EXPR)
3136 code = PREDECREMENT_EXPR;
3137 else if (code == PREDECREMENT_EXPR)
3138 code = PREINCREMENT_EXPR;
3139 else if (code == POSTINCREMENT_EXPR)
3140 code = POSTDECREMENT_EXPR;
3141 else /* code == POSTDECREMENT_EXPR */
3142 code = POSTINCREMENT_EXPR;
3144 inc = integer_minus_one_node;
3145 inc = convert (argtype, inc);
3149 inc = integer_one_node;
3150 inc = convert (argtype, inc);
3153 /* Complain about anything else that is not a true lvalue. */
3154 if (!lvalue_or_else (arg, ((code == PREINCREMENT_EXPR
3155 || code == POSTINCREMENT_EXPR)
3158 return error_mark_node;
3160 /* Report a read-only lvalue. */
3161 if (TREE_READONLY (arg))
3163 readonly_error (arg,
3164 ((code == PREINCREMENT_EXPR
3165 || code == POSTINCREMENT_EXPR)
3166 ? lv_increment : lv_decrement));
3167 return error_mark_node;
3170 if (TREE_CODE (TREE_TYPE (arg)) == BOOLEAN_TYPE)
3171 val = boolean_increment (code, arg);
3173 val = build2 (code, TREE_TYPE (arg), arg, inc);
3174 TREE_SIDE_EFFECTS (val) = 1;
3175 if (TREE_CODE (val) != code)
3176 TREE_NO_WARNING (val) = 1;
3178 goto return_build_unary_op;
3182 /* Note that this operation never does default_conversion. */
3184 /* Let &* cancel out to simplify resulting code. */
3185 if (TREE_CODE (arg) == INDIRECT_REF)
3187 /* Don't let this be an lvalue. */
3188 if (lvalue_p (TREE_OPERAND (arg, 0)))
3189 return non_lvalue (TREE_OPERAND (arg, 0));
3190 ret = TREE_OPERAND (arg, 0);
3191 goto return_build_unary_op;
3194 /* For &x[y], return x+y */
3195 if (TREE_CODE (arg) == ARRAY_REF)
3197 tree op0 = TREE_OPERAND (arg, 0);
3198 if (!c_mark_addressable (op0))
3199 return error_mark_node;
3200 return build_binary_op (location, PLUS_EXPR,
3201 (TREE_CODE (TREE_TYPE (op0)) == ARRAY_TYPE
3202 ? array_to_pointer_conversion (op0)
3204 TREE_OPERAND (arg, 1), 1);
3207 /* Anything not already handled and not a true memory reference
3208 or a non-lvalue array is an error. */
3209 else if (typecode != FUNCTION_TYPE && !flag
3210 && !lvalue_or_else (arg, lv_addressof))
3211 return error_mark_node;
3213 /* Ordinary case; arg is a COMPONENT_REF or a decl. */
3214 argtype = TREE_TYPE (arg);
3216 /* If the lvalue is const or volatile, merge that into the type
3217 to which the address will point. Note that you can't get a
3218 restricted pointer by taking the address of something, so we
3219 only have to deal with `const' and `volatile' here. */
3220 if ((DECL_P (arg) || REFERENCE_CLASS_P (arg))
3221 && (TREE_READONLY (arg) || TREE_THIS_VOLATILE (arg)))
3222 argtype = c_build_type_variant (argtype,
3223 TREE_READONLY (arg),
3224 TREE_THIS_VOLATILE (arg));
3226 if (!c_mark_addressable (arg))
3227 return error_mark_node;
3229 gcc_assert (TREE_CODE (arg) != COMPONENT_REF
3230 || !DECL_C_BIT_FIELD (TREE_OPERAND (arg, 1)));
3232 argtype = build_pointer_type (argtype);
3234 /* ??? Cope with user tricks that amount to offsetof. Delete this
3235 when we have proper support for integer constant expressions. */
3236 val = get_base_address (arg);
3237 if (val && TREE_CODE (val) == INDIRECT_REF
3238 && TREE_CONSTANT (TREE_OPERAND (val, 0)))
3240 tree op0 = fold_convert (sizetype, fold_offsetof (arg, val)), op1;
3242 op1 = fold_convert (argtype, TREE_OPERAND (val, 0));
3243 ret = fold_build2 (POINTER_PLUS_EXPR, argtype, op1, op0);
3244 goto return_build_unary_op;
3247 val = build1 (ADDR_EXPR, argtype, arg);
3250 goto return_build_unary_op;
3257 argtype = TREE_TYPE (arg);
3258 ret = require_constant_value ? fold_build1_initializer (code, argtype, arg)
3259 : fold_build1 (code, argtype, arg);
3260 return_build_unary_op:
3261 gcc_assert (ret != error_mark_node);
3262 protected_set_expr_location (ret, location);
3266 /* Return nonzero if REF is an lvalue valid for this language.
3267 Lvalues can be assigned, unless their type has TYPE_READONLY.
3268 Lvalues can have their address taken, unless they have C_DECL_REGISTER. */
3271 lvalue_p (const_tree ref)
3273 const enum tree_code code = TREE_CODE (ref);
3280 return lvalue_p (TREE_OPERAND (ref, 0));
3282 case COMPOUND_LITERAL_EXPR:
3292 return (TREE_CODE (TREE_TYPE (ref)) != FUNCTION_TYPE
3293 && TREE_CODE (TREE_TYPE (ref)) != METHOD_TYPE);
3296 return TREE_CODE (TREE_TYPE (ref)) == ARRAY_TYPE;
3303 /* Give an error for storing in something that is 'const'. */
3306 readonly_error (tree arg, enum lvalue_use use)
3308 gcc_assert (use == lv_assign || use == lv_increment || use == lv_decrement
3310 /* Using this macro rather than (for example) arrays of messages
3311 ensures that all the format strings are checked at compile
3313 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
3314 : (use == lv_increment ? (I) \
3315 : (use == lv_decrement ? (D) : (AS))))
3316 if (TREE_CODE (arg) == COMPONENT_REF)
3318 if (TYPE_READONLY (TREE_TYPE (TREE_OPERAND (arg, 0))))
3319 readonly_error (TREE_OPERAND (arg, 0), use);
3321 error (READONLY_MSG (G_("assignment of read-only member %qD"),
3322 G_("increment of read-only member %qD"),
3323 G_("decrement of read-only member %qD"),
3324 G_("read-only member %qD used as %<asm%> output")),
3325 TREE_OPERAND (arg, 1));
3327 else if (TREE_CODE (arg) == VAR_DECL)
3328 error (READONLY_MSG (G_("assignment of read-only variable %qD"),
3329 G_("increment of read-only variable %qD"),
3330 G_("decrement of read-only variable %qD"),
3331 G_("read-only variable %qD used as %<asm%> output")),
3334 error (READONLY_MSG (G_("assignment of read-only location %qE"),
3335 G_("increment of read-only location %qE"),
3336 G_("decrement of read-only location %qE"),
3337 G_("read-only location %qE used as %<asm%> output")),
3342 /* Return nonzero if REF is an lvalue valid for this language;
3343 otherwise, print an error message and return zero. USE says
3344 how the lvalue is being used and so selects the error message. */
3347 lvalue_or_else (const_tree ref, enum lvalue_use use)
3349 int win = lvalue_p (ref);
3357 /* Mark EXP saying that we need to be able to take the
3358 address of it; it should not be allocated in a register.
3359 Returns true if successful. */
3362 c_mark_addressable (tree exp)
3367 switch (TREE_CODE (x))
3370 if (DECL_C_BIT_FIELD (TREE_OPERAND (x, 1)))
3373 ("cannot take address of bit-field %qD", TREE_OPERAND (x, 1));
3377 /* ... fall through ... */
3383 x = TREE_OPERAND (x, 0);
3386 case COMPOUND_LITERAL_EXPR:
3388 TREE_ADDRESSABLE (x) = 1;
3395 if (C_DECL_REGISTER (x)
3396 && DECL_NONLOCAL (x))
3398 if (TREE_PUBLIC (x) || TREE_STATIC (x) || DECL_EXTERNAL (x))
3401 ("global register variable %qD used in nested function", x);
3404 pedwarn (input_location, 0, "register variable %qD used in nested function", x);
3406 else if (C_DECL_REGISTER (x))
3408 if (TREE_PUBLIC (x) || TREE_STATIC (x) || DECL_EXTERNAL (x))
3409 error ("address of global register variable %qD requested", x);
3411 error ("address of register variable %qD requested", x);
3417 TREE_ADDRESSABLE (x) = 1;
3424 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
3427 build_conditional_expr (tree ifexp, tree op1, tree op2)
3431 enum tree_code code1;
3432 enum tree_code code2;
3433 tree result_type = NULL;
3434 tree orig_op1 = op1, orig_op2 = op2;
3436 /* Promote both alternatives. */
3438 if (TREE_CODE (TREE_TYPE (op1)) != VOID_TYPE)
3439 op1 = default_conversion (op1);
3440 if (TREE_CODE (TREE_TYPE (op2)) != VOID_TYPE)
3441 op2 = default_conversion (op2);
3443 if (TREE_CODE (ifexp) == ERROR_MARK
3444 || TREE_CODE (TREE_TYPE (op1)) == ERROR_MARK
3445 || TREE_CODE (TREE_TYPE (op2)) == ERROR_MARK)
3446 return error_mark_node;
3448 type1 = TREE_TYPE (op1);
3449 code1 = TREE_CODE (type1);
3450 type2 = TREE_TYPE (op2);
3451 code2 = TREE_CODE (type2);
3453 /* C90 does not permit non-lvalue arrays in conditional expressions.
3454 In C99 they will be pointers by now. */
3455 if (code1 == ARRAY_TYPE || code2 == ARRAY_TYPE)
3457 error ("non-lvalue array in conditional expression");
3458 return error_mark_node;
3461 /* Quickly detect the usual case where op1 and op2 have the same type
3463 if (TYPE_MAIN_VARIANT (type1) == TYPE_MAIN_VARIANT (type2))
3466 result_type = type1;
3468 result_type = TYPE_MAIN_VARIANT (type1);
3470 else if ((code1 == INTEGER_TYPE || code1 == REAL_TYPE
3471 || code1 == COMPLEX_TYPE)
3472 && (code2 == INTEGER_TYPE || code2 == REAL_TYPE
3473 || code2 == COMPLEX_TYPE))
3475 result_type = c_common_type (type1, type2);
3477 /* If -Wsign-compare, warn here if type1 and type2 have
3478 different signedness. We'll promote the signed to unsigned
3479 and later code won't know it used to be different.
3480 Do this check on the original types, so that explicit casts
3481 will be considered, but default promotions won't. */
3482 if (warn_sign_compare && !skip_evaluation)
3484 int unsigned_op1 = TYPE_UNSIGNED (TREE_TYPE (orig_op1));
3485 int unsigned_op2 = TYPE_UNSIGNED (TREE_TYPE (orig_op2));
3487 if (unsigned_op1 ^ unsigned_op2)
3491 /* Do not warn if the result type is signed, since the
3492 signed type will only be chosen if it can represent
3493 all the values of the unsigned type. */
3494 if (!TYPE_UNSIGNED (result_type))
3496 /* Do not warn if the signed quantity is an unsuffixed
3497 integer literal (or some static constant expression
3498 involving such literals) and it is non-negative. */
3499 else if ((unsigned_op2
3500 && tree_expr_nonnegative_warnv_p (op1, &ovf))
3502 && tree_expr_nonnegative_warnv_p (op2, &ovf)))
3505 warning (OPT_Wsign_compare, "signed and unsigned type in conditional expression");
3509 else if (code1 == VOID_TYPE || code2 == VOID_TYPE)
3511 if (code1 != VOID_TYPE || code2 != VOID_TYPE)
3512 pedwarn (input_location, OPT_pedantic,
3513 "ISO C forbids conditional expr with only one void side");
3514 result_type = void_type_node;
3516 else if (code1 == POINTER_TYPE && code2 == POINTER_TYPE)
3518 if (comp_target_types (type1, type2))
3519 result_type = common_pointer_type (type1, type2);
3520 else if (null_pointer_constant_p (orig_op1))
3521 result_type = qualify_type (type2, type1);
3522 else if (null_pointer_constant_p (orig_op2))
3523 result_type = qualify_type (type1, type2);
3524 else if (VOID_TYPE_P (TREE_TYPE (type1)))
3526 if (TREE_CODE (TREE_TYPE (type2)) == FUNCTION_TYPE)
3527 pedwarn (input_location, OPT_pedantic,
3528 "ISO C forbids conditional expr between "
3529 "%<void *%> and function pointer");
3530 result_type = build_pointer_type (qualify_type (TREE_TYPE (type1),
3531 TREE_TYPE (type2)));
3533 else if (VOID_TYPE_P (TREE_TYPE (type2)))
3535 if (TREE_CODE (TREE_TYPE (type1)) == FUNCTION_TYPE)
3536 pedwarn (input_location, OPT_pedantic,
3537 "ISO C forbids conditional expr between "
3538 "%<void *%> and function pointer");
3539 result_type = build_pointer_type (qualify_type (TREE_TYPE (type2),
3540 TREE_TYPE (type1)));
3544 pedwarn (input_location, 0,
3545 "pointer type mismatch in conditional expression");
3546 result_type = build_pointer_type (void_type_node);
3549 else if (code1 == POINTER_TYPE && code2 == INTEGER_TYPE)
3551 if (!null_pointer_constant_p (orig_op2))
3552 pedwarn (input_location, 0,
3553 "pointer/integer type mismatch in conditional expression");
3556 op2 = null_pointer_node;
3558 result_type = type1;
3560 else if (code2 == POINTER_TYPE && code1 == INTEGER_TYPE)
3562 if (!null_pointer_constant_p (orig_op1))
3563 pedwarn (input_location, 0,
3564 "pointer/integer type mismatch in conditional expression");
3567 op1 = null_pointer_node;
3569 result_type = type2;
3574 if (flag_cond_mismatch)
3575 result_type = void_type_node;
3578 error ("type mismatch in conditional expression");
3579 return error_mark_node;
3583 /* Merge const and volatile flags of the incoming types. */
3585 = build_type_variant (result_type,
3586 TREE_READONLY (op1) || TREE_READONLY (op2),
3587 TREE_THIS_VOLATILE (op1) || TREE_THIS_VOLATILE (op2));
3589 if (result_type != TREE_TYPE (op1))
3590 op1 = convert_and_check (result_type, op1);
3591 if (result_type != TREE_TYPE (op2))
3592 op2 = convert_and_check (result_type, op2);
3594 return fold_build3 (COND_EXPR, result_type, ifexp, op1, op2);
3597 /* Return a compound expression that performs two expressions and
3598 returns the value of the second of them. */
3601 build_compound_expr (tree expr1, tree expr2)
3603 if (!TREE_SIDE_EFFECTS (expr1))
3605 /* The left-hand operand of a comma expression is like an expression
3606 statement: with -Wunused, we should warn if it doesn't have
3607 any side-effects, unless it was explicitly cast to (void). */
3608 if (warn_unused_value)
3610 if (VOID_TYPE_P (TREE_TYPE (expr1))
3611 && CONVERT_EXPR_P (expr1))
3613 else if (VOID_TYPE_P (TREE_TYPE (expr1))
3614 && TREE_CODE (expr1) == COMPOUND_EXPR
3615 && CONVERT_EXPR_P (TREE_OPERAND (expr1, 1)))
3616 ; /* (void) a, (void) b, c */
3618 warning (OPT_Wunused_value,
3619 "left-hand operand of comma expression has no effect");
3623 /* With -Wunused, we should also warn if the left-hand operand does have
3624 side-effects, but computes a value which is not used. For example, in
3625 `foo() + bar(), baz()' the result of the `+' operator is not used,
3626 so we should issue a warning. */
3627 else if (warn_unused_value)
3628 warn_if_unused_value (expr1, input_location);
3630 if (expr2 == error_mark_node)
3631 return error_mark_node;
3633 return build2 (COMPOUND_EXPR, TREE_TYPE (expr2), expr1, expr2);
3636 /* Build an expression representing a cast to type TYPE of expression EXPR. */
3639 build_c_cast (tree type, tree expr)
3643 if (type == error_mark_node || expr == error_mark_node)
3644 return error_mark_node;
3646 /* The ObjC front-end uses TYPE_MAIN_VARIANT to tie together types differing
3647 only in <protocol> qualifications. But when constructing cast expressions,
3648 the protocols do matter and must be kept around. */
3649 if (objc_is_object_ptr (type) && objc_is_object_ptr (TREE_TYPE (expr)))
3650 return build1 (NOP_EXPR, type, expr);
3652 type = TYPE_MAIN_VARIANT (type);
3654 if (TREE_CODE (type) == ARRAY_TYPE)
3656 error ("cast specifies array type");
3657 return error_mark_node;
3660 if (TREE_CODE (type) == FUNCTION_TYPE)
3662 error ("cast specifies function type");
3663 return error_mark_node;
3666 if (!VOID_TYPE_P (type))
3668 value = require_complete_type (value);
3669 if (value == error_mark_node)
3670 return error_mark_node;
3673 if (type == TYPE_MAIN_VARIANT (TREE_TYPE (value)))
3675 if (TREE_CODE (type) == RECORD_TYPE
3676 || TREE_CODE (type) == UNION_TYPE)
3677 pedwarn (input_location, OPT_pedantic,
3678 "ISO C forbids casting nonscalar to the same type");
3680 else if (TREE_CODE (type) == UNION_TYPE)
3684 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
3685 if (TREE_TYPE (field) != error_mark_node
3686 && comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (field)),
3687 TYPE_MAIN_VARIANT (TREE_TYPE (value))))
3694 pedwarn (input_location, OPT_pedantic,
3695 "ISO C forbids casts to union type");
3696 t = digest_init (type,
3697 build_constructor_single (type, field, value),
3699 TREE_CONSTANT (t) = TREE_CONSTANT (value);
3702 error ("cast to union type from type not present in union");
3703 return error_mark_node;
3709 if (type == void_type_node)
3710 return build1 (CONVERT_EXPR, type, value);
3712 otype = TREE_TYPE (value);
3714 /* Optionally warn about potentially worrisome casts. */
3717 && TREE_CODE (type) == POINTER_TYPE
3718 && TREE_CODE (otype) == POINTER_TYPE)
3720 tree in_type = type;
3721 tree in_otype = otype;
3725 /* Check that the qualifiers on IN_TYPE are a superset of
3726 the qualifiers of IN_OTYPE. The outermost level of
3727 POINTER_TYPE nodes is uninteresting and we stop as soon
3728 as we hit a non-POINTER_TYPE node on either type. */
3731 in_otype = TREE_TYPE (in_otype);
3732 in_type = TREE_TYPE (in_type);
3734 /* GNU C allows cv-qualified function types. 'const'
3735 means the function is very pure, 'volatile' means it
3736 can't return. We need to warn when such qualifiers
3737 are added, not when they're taken away. */
3738 if (TREE_CODE (in_otype) == FUNCTION_TYPE
3739 && TREE_CODE (in_type) == FUNCTION_TYPE)
3740 added |= (TYPE_QUALS (in_type) & ~TYPE_QUALS (in_otype));
3742 discarded |= (TYPE_QUALS (in_otype) & ~TYPE_QUALS (in_type));
3744 while (TREE_CODE (in_type) == POINTER_TYPE
3745 && TREE_CODE (in_otype) == POINTER_TYPE);
3748 warning (OPT_Wcast_qual, "cast adds new qualifiers to function type");
3751 /* There are qualifiers present in IN_OTYPE that are not
3752 present in IN_TYPE. */
3753 warning (OPT_Wcast_qual, "cast discards qualifiers from pointer target type");
3756 /* Warn about possible alignment problems. */
3757 if (STRICT_ALIGNMENT
3758 && TREE_CODE (type) == POINTER_TYPE
3759 && TREE_CODE (otype) == POINTER_TYPE
3760 && TREE_CODE (TREE_TYPE (otype)) != VOID_TYPE
3761 && TREE_CODE (TREE_TYPE (otype)) != FUNCTION_TYPE
3762 /* Don't warn about opaque types, where the actual alignment
3763 restriction is unknown. */
3764 && !((TREE_CODE (TREE_TYPE (otype)) == UNION_TYPE
3765 || TREE_CODE (TREE_TYPE (otype)) == RECORD_TYPE)
3766 && TYPE_MODE (TREE_TYPE (otype)) == VOIDmode)
3767 && TYPE_ALIGN (TREE_TYPE (type)) > TYPE_ALIGN (TREE_TYPE (otype)))
3768 warning (OPT_Wcast_align,
3769 "cast increases required alignment of target type");
3771 if (TREE_CODE (type) == INTEGER_TYPE
3772 && TREE_CODE (otype) == POINTER_TYPE
3773 && TYPE_PRECISION (type) != TYPE_PRECISION (otype))
3774 /* Unlike conversion of integers to pointers, where the
3775 warning is disabled for converting constants because
3776 of cases such as SIG_*, warn about converting constant
3777 pointers to integers. In some cases it may cause unwanted
3778 sign extension, and a warning is appropriate. */
3779 warning (OPT_Wpointer_to_int_cast,
3780 "cast from pointer to integer of different size");
3782 if (TREE_CODE (value) == CALL_EXPR
3783 && TREE_CODE (type) != TREE_CODE (otype))
3784 warning (OPT_Wbad_function_cast, "cast from function call of type %qT "
3785 "to non-matching type %qT", otype, type);
3787 if (TREE_CODE (type) == POINTER_TYPE
3788 && TREE_CODE (otype) == INTEGER_TYPE
3789 && TYPE_PRECISION (type) != TYPE_PRECISION (otype)
3790 /* Don't warn about converting any constant. */
3791 && !TREE_CONSTANT (value))
3792 warning (OPT_Wint_to_pointer_cast, "cast to pointer from integer "
3793 "of different size");
3795 if (warn_strict_aliasing <= 2)
3796 strict_aliasing_warning (otype, type, expr);
3798 /* If pedantic, warn for conversions between function and object
3799 pointer types, except for converting a null pointer constant
3800 to function pointer type. */
3802 && TREE_CODE (type) == POINTER_TYPE
3803 && TREE_CODE (otype) == POINTER_TYPE
3804 && TREE_CODE (TREE_TYPE (otype)) == FUNCTION_TYPE
3805 && TREE_CODE (TREE_TYPE (type)) != FUNCTION_TYPE)
3806 pedwarn (input_location, OPT_pedantic, "ISO C forbids "
3807 "conversion of function pointer to object pointer type");
3810 && TREE_CODE (type) == POINTER_TYPE
3811 && TREE_CODE (otype) == POINTER_TYPE
3812 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE
3813 && TREE_CODE (TREE_TYPE (otype)) != FUNCTION_TYPE
3814 && !null_pointer_constant_p (value))
3815 pedwarn (input_location, OPT_pedantic, "ISO C forbids "
3816 "conversion of object pointer to function pointer type");
3819 value = convert (type, value);
3821 /* Ignore any integer overflow caused by the cast. */
3822 if (TREE_CODE (value) == INTEGER_CST)
3824 if (CONSTANT_CLASS_P (ovalue) && TREE_OVERFLOW (ovalue))
3826 if (!TREE_OVERFLOW (value))
3828 /* Avoid clobbering a shared constant. */
3829 value = copy_node (value);
3830 TREE_OVERFLOW (value) = TREE_OVERFLOW (ovalue);
3833 else if (TREE_OVERFLOW (value))
3834 /* Reset VALUE's overflow flags, ensuring constant sharing. */
3835 value = build_int_cst_wide (TREE_TYPE (value),
3836 TREE_INT_CST_LOW (value),
3837 TREE_INT_CST_HIGH (value));
3841 /* Don't let a cast be an lvalue. */
3843 value = non_lvalue (value);
3848 /* Interpret a cast of expression EXPR to type TYPE. */
3850 c_cast_expr (struct c_type_name *type_name, tree expr)
3853 int saved_wsp = warn_strict_prototypes;
3855 /* This avoids warnings about unprototyped casts on
3856 integers. E.g. "#define SIG_DFL (void(*)())0". */
3857 if (TREE_CODE (expr) == INTEGER_CST)
3858 warn_strict_prototypes = 0;
3859 type = groktypename (type_name);
3860 warn_strict_prototypes = saved_wsp;
3862 return build_c_cast (type, expr);
3865 /* Build an assignment expression of lvalue LHS from value RHS.
3866 MODIFYCODE is the code for a binary operator that we use
3867 to combine the old value of LHS with RHS to get the new value.
3868 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
3870 LOCATION is the location of the MODIFYCODE operator. */
3873 build_modify_expr (location_t location,
3874 tree lhs, enum tree_code modifycode, tree rhs)
3878 tree lhstype = TREE_TYPE (lhs);
3879 tree olhstype = lhstype;
3881 /* Types that aren't fully specified cannot be used in assignments. */
3882 lhs = require_complete_type (lhs);
3884 /* Avoid duplicate error messages from operands that had errors. */
3885 if (TREE_CODE (lhs) == ERROR_MARK || TREE_CODE (rhs) == ERROR_MARK)
3886 return error_mark_node;
3888 if (!lvalue_or_else (lhs, lv_assign))
3889 return error_mark_node;
3891 STRIP_TYPE_NOPS (rhs);
3895 /* If a binary op has been requested, combine the old LHS value with the RHS
3896 producing the value we should actually store into the LHS. */
3898 if (modifycode != NOP_EXPR)
3900 lhs = stabilize_reference (lhs);
3901 newrhs = build_binary_op (location,
3902 modifycode, lhs, rhs, 1);
3905 /* Give an error for storing in something that is 'const'. */
3907 if (TREE_READONLY (lhs) || TYPE_READONLY (lhstype)
3908 || ((TREE_CODE (lhstype) == RECORD_TYPE
3909 || TREE_CODE (lhstype) == UNION_TYPE)
3910 && C_TYPE_FIELDS_READONLY (lhstype)))
3912 readonly_error (lhs, lv_assign);
3913 return error_mark_node;
3916 /* If storing into a structure or union member,
3917 it has probably been given type `int'.
3918 Compute the type that would go with
3919 the actual amount of storage the member occupies. */
3921 if (TREE_CODE (lhs) == COMPONENT_REF
3922 && (TREE_CODE (lhstype) == INTEGER_TYPE
3923 || TREE_CODE (lhstype) == BOOLEAN_TYPE
3924 || TREE_CODE (lhstype) == REAL_TYPE
3925 || TREE_CODE (lhstype) == ENUMERAL_TYPE))
3926 lhstype = TREE_TYPE (get_unwidened (lhs, 0));
3928 /* If storing in a field that is in actuality a short or narrower than one,
3929 we must store in the field in its actual type. */
3931 if (lhstype != TREE_TYPE (lhs))
3933 lhs = copy_node (lhs);
3934 TREE_TYPE (lhs) = lhstype;
3937 /* Convert new value to destination type. */
3939 newrhs = convert_for_assignment (lhstype, newrhs, ic_assign,
3940 NULL_TREE, NULL_TREE, 0);
3941 if (TREE_CODE (newrhs) == ERROR_MARK)
3942 return error_mark_node;
3944 /* Emit ObjC write barrier, if necessary. */
3945 if (c_dialect_objc () && flag_objc_gc)
3947 result = objc_generate_write_barrier (lhs, modifycode, newrhs);
3950 protected_set_expr_location (result, location);
3955 /* Scan operands. */
3957 result = build2 (MODIFY_EXPR, lhstype, lhs, newrhs);
3958 TREE_SIDE_EFFECTS (result) = 1;
3959 protected_set_expr_location (result, location);
3961 /* If we got the LHS in a different type for storing in,
3962 convert the result back to the nominal type of LHS
3963 so that the value we return always has the same type
3964 as the LHS argument. */
3966 if (olhstype == TREE_TYPE (result))
3969 result = convert_for_assignment (olhstype, result, ic_assign,
3970 NULL_TREE, NULL_TREE, 0);
3971 protected_set_expr_location (result, location);
3975 /* Convert value RHS to type TYPE as preparation for an assignment
3976 to an lvalue of type TYPE.
3977 The real work of conversion is done by `convert'.
3978 The purpose of this function is to generate error messages
3979 for assignments that are not allowed in C.
3980 ERRTYPE says whether it is argument passing, assignment,
3981 initialization or return.
3983 FUNCTION is a tree for the function being called.
3984 PARMNUM is the number of the argument, for printing in error messages. */
3987 convert_for_assignment (tree type, tree rhs, enum impl_conv errtype,
3988 tree fundecl, tree function, int parmnum)
3990 enum tree_code codel = TREE_CODE (type);
3992 enum tree_code coder;
3993 tree rname = NULL_TREE;
3994 bool objc_ok = false;
3996 if (errtype == ic_argpass)
3999 /* Change pointer to function to the function itself for
4001 if (TREE_CODE (function) == ADDR_EXPR
4002 && TREE_CODE (TREE_OPERAND (function, 0)) == FUNCTION_DECL)
4003 function = TREE_OPERAND (function, 0);
4005 /* Handle an ObjC selector specially for diagnostics. */
4006 selector = objc_message_selector ();
4008 if (selector && parmnum > 2)
4015 /* This macro is used to emit diagnostics to ensure that all format
4016 strings are complete sentences, visible to gettext and checked at
4018 #define WARN_FOR_ASSIGNMENT(LOCATION, OPT, AR, AS, IN, RE) \
4023 if (pedwarn (LOCATION, OPT, AR, parmnum, rname)) \
4024 inform ((fundecl && !DECL_IS_BUILTIN (fundecl)) \
4025 ? DECL_SOURCE_LOCATION (fundecl) : LOCATION, \
4026 "expected %qT but argument is of type %qT", \
4030 pedwarn (LOCATION, OPT, AS); \
4033 pedwarn (LOCATION, OPT, IN); \
4036 pedwarn (LOCATION, OPT, RE); \
4039 gcc_unreachable (); \
4043 STRIP_TYPE_NOPS (rhs);
4045 if (optimize && TREE_CODE (rhs) == VAR_DECL
4046 && TREE_CODE (TREE_TYPE (rhs)) != ARRAY_TYPE)
4047 rhs = decl_constant_value_for_broken_optimization (rhs);
4049 rhstype = TREE_TYPE (rhs);
4050 coder = TREE_CODE (rhstype);
4052 if (coder == ERROR_MARK)
4053 return error_mark_node;
4055 if (c_dialect_objc ())
4078 objc_ok = objc_compare_types (type, rhstype, parmno, rname);
4081 if (TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (rhstype))
4084 if (coder == VOID_TYPE)
4086 /* Except for passing an argument to an unprototyped function,
4087 this is a constraint violation. When passing an argument to
4088 an unprototyped function, it is compile-time undefined;
4089 making it a constraint in that case was rejected in
4091 error ("void value not ignored as it ought to be");
4092 return error_mark_node;
4094 rhs = require_complete_type (rhs);
4095 if (rhs == error_mark_node)
4096 return error_mark_node;
4097 /* A type converts to a reference to it.
4098 This code doesn't fully support references, it's just for the
4099 special case of va_start and va_copy. */
4100 if (codel == REFERENCE_TYPE
4101 && comptypes (TREE_TYPE (type), TREE_TYPE (rhs)) == 1)
4103 if (!lvalue_p (rhs))
4105 error ("cannot pass rvalue to reference parameter");
4106 return error_mark_node;
4108 if (!c_mark_addressable (rhs))
4109 return error_mark_node;
4110 rhs = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (rhs)), rhs);
4112 /* We already know that these two types are compatible, but they
4113 may not be exactly identical. In fact, `TREE_TYPE (type)' is
4114 likely to be __builtin_va_list and `TREE_TYPE (rhs)' is
4115 likely to be va_list, a typedef to __builtin_va_list, which
4116 is different enough that it will cause problems later. */
4117 if (TREE_TYPE (TREE_TYPE (rhs)) != TREE_TYPE (type))
4118 rhs = build1 (NOP_EXPR, build_pointer_type (TREE_TYPE (type)), rhs);
4120 rhs = build1 (NOP_EXPR, type, rhs);
4123 /* Some types can interconvert without explicit casts. */
4124 else if (codel == VECTOR_TYPE && coder == VECTOR_TYPE
4125 && vector_types_convertible_p (type, TREE_TYPE (rhs), true))
4126 return convert (type, rhs);
4127 /* Arithmetic types all interconvert, and enum is treated like int. */
4128 else if ((codel == INTEGER_TYPE || codel == REAL_TYPE
4129 || codel == FIXED_POINT_TYPE
4130 || codel == ENUMERAL_TYPE || codel == COMPLEX_TYPE
4131 || codel == BOOLEAN_TYPE)
4132 && (coder == INTEGER_TYPE || coder == REAL_TYPE
4133 || coder == FIXED_POINT_TYPE
4134 || coder == ENUMERAL_TYPE || coder == COMPLEX_TYPE
4135 || coder == BOOLEAN_TYPE))
4136 return convert_and_check (type, rhs);
4138 /* Aggregates in different TUs might need conversion. */
4139 if ((codel == RECORD_TYPE || codel == UNION_TYPE)
4141 && comptypes (type, rhstype))
4142 return convert_and_check (type, rhs);
4144 /* Conversion to a transparent union from its member types.
4145 This applies only to function arguments. */
4146 if (codel == UNION_TYPE && TYPE_TRANSPARENT_UNION (type)
4147 && errtype == ic_argpass)
4149 tree memb, marginal_memb = NULL_TREE;
4151 for (memb = TYPE_FIELDS (type); memb ; memb = TREE_CHAIN (memb))
4153 tree memb_type = TREE_TYPE (memb);
4155 if (comptypes (TYPE_MAIN_VARIANT (memb_type),
4156 TYPE_MAIN_VARIANT (rhstype)))
4159 if (TREE_CODE (memb_type) != POINTER_TYPE)
4162 if (coder == POINTER_TYPE)
4164 tree ttl = TREE_TYPE (memb_type);
4165 tree ttr = TREE_TYPE (rhstype);
4167 /* Any non-function converts to a [const][volatile] void *
4168 and vice versa; otherwise, targets must be the same.
4169 Meanwhile, the lhs target must have all the qualifiers of
4171 if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
4172 || comp_target_types (memb_type, rhstype))
4174 /* If this type won't generate any warnings, use it. */
4175 if (TYPE_QUALS (ttl) == TYPE_QUALS (ttr)
4176 || ((TREE_CODE (ttr) == FUNCTION_TYPE
4177 && TREE_CODE (ttl) == FUNCTION_TYPE)
4178 ? ((TYPE_QUALS (ttl) | TYPE_QUALS (ttr))
4179 == TYPE_QUALS (ttr))
4180 : ((TYPE_QUALS (ttl) | TYPE_QUALS (ttr))
4181 == TYPE_QUALS (ttl))))
4184 /* Keep looking for a better type, but remember this one. */
4186 marginal_memb = memb;
4190 /* Can convert integer zero to any pointer type. */
4191 if (null_pointer_constant_p (rhs))
4193 rhs = null_pointer_node;
4198 if (memb || marginal_memb)
4202 /* We have only a marginally acceptable member type;
4203 it needs a warning. */
4204 tree ttl = TREE_TYPE (TREE_TYPE (marginal_memb));
4205 tree ttr = TREE_TYPE (rhstype);
4207 /* Const and volatile mean something different for function
4208 types, so the usual warnings are not appropriate. */
4209 if (TREE_CODE (ttr) == FUNCTION_TYPE
4210 && TREE_CODE (ttl) == FUNCTION_TYPE)
4212 /* Because const and volatile on functions are
4213 restrictions that say the function will not do
4214 certain things, it is okay to use a const or volatile
4215 function where an ordinary one is wanted, but not
4217 if (TYPE_QUALS (ttl) & ~TYPE_QUALS (ttr))
4218 WARN_FOR_ASSIGNMENT (input_location, 0,
4219 G_("passing argument %d of %qE "
4220 "makes qualified function "
4221 "pointer from unqualified"),
4222 G_("assignment makes qualified "
4223 "function pointer from "
4225 G_("initialization makes qualified "
4226 "function pointer from "
4228 G_("return makes qualified function "
4229 "pointer from unqualified"));
4231 else if (TYPE_QUALS (ttr) & ~TYPE_QUALS (ttl))
4232 WARN_FOR_ASSIGNMENT (input_location, 0,
4233 G_("passing argument %d of %qE discards "
4234 "qualifiers from pointer target type"),
4235 G_("assignment discards qualifiers "
4236 "from pointer target type"),
4237 G_("initialization discards qualifiers "
4238 "from pointer target type"),
4239 G_("return discards qualifiers from "
4240 "pointer target type"));
4242 memb = marginal_memb;
4245 if (!fundecl || !DECL_IN_SYSTEM_HEADER (fundecl))
4246 pedwarn (input_location, OPT_pedantic,
4247 "ISO C prohibits argument conversion to union type");
4249 rhs = fold_convert (TREE_TYPE (memb), rhs);
4250 return build_constructor_single (type, memb, rhs);
4254 /* Conversions among pointers */
4255 else if ((codel == POINTER_TYPE || codel == REFERENCE_TYPE)
4256 && (coder == codel))
4258 tree ttl = TREE_TYPE (type);
4259 tree ttr = TREE_TYPE (rhstype);
4262 bool is_opaque_pointer;
4263 int target_cmp = 0; /* Cache comp_target_types () result. */
4265 if (TREE_CODE (mvl) != ARRAY_TYPE)
4266 mvl = TYPE_MAIN_VARIANT (mvl);
4267 if (TREE_CODE (mvr) != ARRAY_TYPE)
4268 mvr = TYPE_MAIN_VARIANT (mvr);
4269 /* Opaque pointers are treated like void pointers. */
4270 is_opaque_pointer = vector_targets_convertible_p (ttl, ttr);
4272 /* C++ does not allow the implicit conversion void* -> T*. However,
4273 for the purpose of reducing the number of false positives, we
4274 tolerate the special case of
4278 where NULL is typically defined in C to be '(void *) 0'. */
4279 if (VOID_TYPE_P (ttr) && rhs != null_pointer_node && !VOID_TYPE_P (ttl))
4280 warning (OPT_Wc___compat, "request for implicit conversion from "
4281 "%qT to %qT not permitted in C++", rhstype, type);
4283 /* Check if the right-hand side has a format attribute but the
4284 left-hand side doesn't. */
4285 if (warn_missing_format_attribute
4286 && check_missing_format_attribute (type, rhstype))
4291 warning (OPT_Wmissing_format_attribute,
4292 "argument %d of %qE might be "
4293 "a candidate for a format attribute",
4297 warning (OPT_Wmissing_format_attribute,
4298 "assignment left-hand side might be "
4299 "a candidate for a format attribute");
4302 warning (OPT_Wmissing_format_attribute,
4303 "initialization left-hand side might be "
4304 "a candidate for a format attribute");
4307 warning (OPT_Wmissing_format_attribute,
4308 "return type might be "
4309 "a candidate for a format attribute");
4316 /* Any non-function converts to a [const][volatile] void *
4317 and vice versa; otherwise, targets must be the same.
4318 Meanwhile, the lhs target must have all the qualifiers of the rhs. */
4319 if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
4320 || (target_cmp = comp_target_types (type, rhstype))
4321 || is_opaque_pointer
4322 || (c_common_unsigned_type (mvl)
4323 == c_common_unsigned_type (mvr)))
4326 && ((VOID_TYPE_P (ttl) && TREE_CODE (ttr) == FUNCTION_TYPE)
4329 && !null_pointer_constant_p (rhs)
4330 && TREE_CODE (ttl) == FUNCTION_TYPE)))
4331 WARN_FOR_ASSIGNMENT (input_location, OPT_pedantic,
4332 G_("ISO C forbids passing argument %d of "
4333 "%qE between function pointer "
4335 G_("ISO C forbids assignment between "
4336 "function pointer and %<void *%>"),
4337 G_("ISO C forbids initialization between "
4338 "function pointer and %<void *%>"),
4339 G_("ISO C forbids return between function "
4340 "pointer and %<void *%>"));
4341 /* Const and volatile mean something different for function types,
4342 so the usual warnings are not appropriate. */
4343 else if (TREE_CODE (ttr) != FUNCTION_TYPE
4344 && TREE_CODE (ttl) != FUNCTION_TYPE)
4346 if (TYPE_QUALS (ttr) & ~TYPE_QUALS (ttl))
4348 /* Types differing only by the presence of the 'volatile'
4349 qualifier are acceptable if the 'volatile' has been added
4350 in by the Objective-C EH machinery. */
4351 if (!objc_type_quals_match (ttl, ttr))
4352 WARN_FOR_ASSIGNMENT (input_location, 0,
4353 G_("passing argument %d of %qE discards "
4354 "qualifiers from pointer target type"),
4355 G_("assignment discards qualifiers "
4356 "from pointer target type"),
4357 G_("initialization discards qualifiers "
4358 "from pointer target type"),
4359 G_("return discards qualifiers from "
4360 "pointer target type"));
4362 /* If this is not a case of ignoring a mismatch in signedness,
4364 else if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
4367 /* If there is a mismatch, do warn. */
4368 else if (warn_pointer_sign)
4369 WARN_FOR_ASSIGNMENT (input_location, OPT_Wpointer_sign,
4370 G_("pointer targets in passing argument "
4371 "%d of %qE differ in signedness"),
4372 G_("pointer targets in assignment "
4373 "differ in signedness"),
4374 G_("pointer targets in initialization "
4375 "differ in signedness"),
4376 G_("pointer targets in return differ "
4379 else if (TREE_CODE (ttl) == FUNCTION_TYPE
4380 && TREE_CODE (ttr) == FUNCTION_TYPE)
4382 /* Because const and volatile on functions are restrictions
4383 that say the function will not do certain things,
4384 it is okay to use a const or volatile function
4385 where an ordinary one is wanted, but not vice-versa. */
4386 if (TYPE_QUALS (ttl) & ~TYPE_QUALS (ttr))
4387 WARN_FOR_ASSIGNMENT (input_location, 0,
4388 G_("passing argument %d of %qE makes "
4389 "qualified function pointer "
4390 "from unqualified"),
4391 G_("assignment makes qualified function "
4392 "pointer from unqualified"),
4393 G_("initialization makes qualified "
4394 "function pointer from unqualified"),
4395 G_("return makes qualified function "
4396 "pointer from unqualified"));
4400 /* Avoid warning about the volatile ObjC EH puts on decls. */
4402 WARN_FOR_ASSIGNMENT (input_location, 0,
4403 G_("passing argument %d of %qE from "
4404 "incompatible pointer type"),
4405 G_("assignment from incompatible pointer type"),
4406 G_("initialization from incompatible "
4408 G_("return from incompatible pointer type"));
4410 return convert (type, rhs);
4412 else if (codel == POINTER_TYPE && coder == ARRAY_TYPE)
4414 /* ??? This should not be an error when inlining calls to
4415 unprototyped functions. */
4416 error ("invalid use of non-lvalue array");
4417 return error_mark_node;
4419 else if (codel == POINTER_TYPE && coder == INTEGER_TYPE)
4421 /* An explicit constant 0 can convert to a pointer,
4422 or one that results from arithmetic, even including
4423 a cast to integer type. */
4424 if (!null_pointer_constant_p (rhs))
4425 WARN_FOR_ASSIGNMENT (input_location, 0,
4426 G_("passing argument %d of %qE makes "
4427 "pointer from integer without a cast"),
4428 G_("assignment makes pointer from integer "
4430 G_("initialization makes pointer from "
4431 "integer without a cast"),
4432 G_("return makes pointer from integer "
4435 return convert (type, rhs);
4437 else if (codel == INTEGER_TYPE && coder == POINTER_TYPE)
4439 WARN_FOR_ASSIGNMENT (input_location, 0,
4440 G_("passing argument %d of %qE makes integer "
4441 "from pointer without a cast"),
4442 G_("assignment makes integer from pointer "
4444 G_("initialization makes integer from pointer "
4446 G_("return makes integer from pointer "
4448 return convert (type, rhs);
4450 else if (codel == BOOLEAN_TYPE && coder == POINTER_TYPE)
4451 return convert (type, rhs);
4456 error ("incompatible type for argument %d of %qE", parmnum, rname);
4457 inform ((fundecl && !DECL_IS_BUILTIN (fundecl))
4458 ? DECL_SOURCE_LOCATION (fundecl) : input_location,
4459 "expected %qT but argument is of type %qT", type, rhstype);
4462 error ("incompatible types when assigning to type %qT from type %qT",
4466 error ("incompatible types when initializing type %qT using type %qT",
4470 error ("incompatible types when returning type %qT but %qT was expected",
4477 return error_mark_node;
4480 /* If VALUE is a compound expr all of whose expressions are constant, then
4481 return its value. Otherwise, return error_mark_node.
4483 This is for handling COMPOUND_EXPRs as initializer elements
4484 which is allowed with a warning when -pedantic is specified. */
4487 valid_compound_expr_initializer (tree value, tree endtype)
4489 if (TREE_CODE (value) == COMPOUND_EXPR)
4491 if (valid_compound_expr_initializer (TREE_OPERAND (value, 0), endtype)
4493 return error_mark_node;
4494 return valid_compound_expr_initializer (TREE_OPERAND (value, 1),
4497 else if (!initializer_constant_valid_p (value, endtype))
4498 return error_mark_node;
4503 /* Perform appropriate conversions on the initial value of a variable,
4504 store it in the declaration DECL,
4505 and print any error messages that are appropriate.
4506 If the init is invalid, store an ERROR_MARK. */
4509 store_init_value (tree decl, tree init)
4513 /* If variable's type was invalidly declared, just ignore it. */
4515 type = TREE_TYPE (decl);
4516 if (TREE_CODE (type) == ERROR_MARK)
4519 /* Digest the specified initializer into an expression. */
4521 value = digest_init (type, init, true, TREE_STATIC (decl));
4523 /* Store the expression if valid; else report error. */
4525 if (!in_system_header
4526 && AGGREGATE_TYPE_P (TREE_TYPE (decl)) && !TREE_STATIC (decl))
4527 warning (OPT_Wtraditional, "traditional C rejects automatic "
4528 "aggregate initialization");
4530 DECL_INITIAL (decl) = value;
4532 /* ANSI wants warnings about out-of-range constant initializers. */
4533 STRIP_TYPE_NOPS (value);
4534 if (TREE_STATIC (decl))
4535 constant_expression_warning (value);
4537 /* Check if we need to set array size from compound literal size. */
4538 if (TREE_CODE (type) == ARRAY_TYPE
4539 && TYPE_DOMAIN (type) == 0
4540 && value != error_mark_node)
4542 tree inside_init = init;
4544 STRIP_TYPE_NOPS (inside_init);
4545 inside_init = fold (inside_init);
4547 if (TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
4549 tree cldecl = COMPOUND_LITERAL_EXPR_DECL (inside_init);
4551 if (TYPE_DOMAIN (TREE_TYPE (cldecl)))
4553 /* For int foo[] = (int [3]){1}; we need to set array size
4554 now since later on array initializer will be just the
4555 brace enclosed list of the compound literal. */
4556 type = build_distinct_type_copy (TYPE_MAIN_VARIANT (type));
4557 TREE_TYPE (decl) = type;
4558 TYPE_DOMAIN (type) = TYPE_DOMAIN (TREE_TYPE (cldecl));
4560 layout_decl (cldecl, 0);
4566 /* Methods for storing and printing names for error messages. */
4568 /* Implement a spelling stack that allows components of a name to be pushed
4569 and popped. Each element on the stack is this structure. */
4576 unsigned HOST_WIDE_INT i;
4581 #define SPELLING_STRING 1
4582 #define SPELLING_MEMBER 2
4583 #define SPELLING_BOUNDS 3
4585 static struct spelling *spelling; /* Next stack element (unused). */
4586 static struct spelling *spelling_base; /* Spelling stack base. */
4587 static int spelling_size; /* Size of the spelling stack. */
4589 /* Macros to save and restore the spelling stack around push_... functions.
4590 Alternative to SAVE_SPELLING_STACK. */
4592 #define SPELLING_DEPTH() (spelling - spelling_base)
4593 #define RESTORE_SPELLING_DEPTH(DEPTH) (spelling = spelling_base + (DEPTH))
4595 /* Push an element on the spelling stack with type KIND and assign VALUE
4598 #define PUSH_SPELLING(KIND, VALUE, MEMBER) \
4600 int depth = SPELLING_DEPTH (); \
4602 if (depth >= spelling_size) \
4604 spelling_size += 10; \
4605 spelling_base = XRESIZEVEC (struct spelling, spelling_base, \
4607 RESTORE_SPELLING_DEPTH (depth); \
4610 spelling->kind = (KIND); \
4611 spelling->MEMBER = (VALUE); \
4615 /* Push STRING on the stack. Printed literally. */
4618 push_string (const char *string)
4620 PUSH_SPELLING (SPELLING_STRING, string, u.s);
4623 /* Push a member name on the stack. Printed as '.' STRING. */
4626 push_member_name (tree decl)
4628 const char *const string
4629 = DECL_NAME (decl) ? IDENTIFIER_POINTER (DECL_NAME (decl)) : "<anonymous>";
4630 PUSH_SPELLING (SPELLING_MEMBER, string, u.s);
4633 /* Push an array bounds on the stack. Printed as [BOUNDS]. */
4636 push_array_bounds (unsigned HOST_WIDE_INT bounds)
4638 PUSH_SPELLING (SPELLING_BOUNDS, bounds, u.i);
4641 /* Compute the maximum size in bytes of the printed spelling. */
4644 spelling_length (void)
4649 for (p = spelling_base; p < spelling; p++)
4651 if (p->kind == SPELLING_BOUNDS)
4654 size += strlen (p->u.s) + 1;
4660 /* Print the spelling to BUFFER and return it. */
4663 print_spelling (char *buffer)
4668 for (p = spelling_base; p < spelling; p++)
4669 if (p->kind == SPELLING_BOUNDS)
4671 sprintf (d, "[" HOST_WIDE_INT_PRINT_UNSIGNED "]", p->u.i);
4677 if (p->kind == SPELLING_MEMBER)
4679 for (s = p->u.s; (*d = *s++); d++)
4686 /* Issue an error message for a bad initializer component.
4687 MSGID identifies the message.
4688 The component name is taken from the spelling stack. */
4691 error_init (const char *msgid)
4695 error ("%s", _(msgid));
4696 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4698 error ("(near initialization for %qs)", ofwhat);
4701 /* Issue a pedantic warning for a bad initializer component. OPT is
4702 the option OPT_* (from options.h) controlling this warning or 0 if
4703 it is unconditionally given. MSGID identifies the message. The
4704 component name is taken from the spelling stack. */
4707 pedwarn_init (location_t location, int opt, const char *msgid)
4711 pedwarn (location, opt, "%s", _(msgid));
4712 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4714 pedwarn (location, opt, "(near initialization for %qs)", ofwhat);
4717 /* Issue a warning for a bad initializer component.
4719 OPT is the OPT_W* value corresponding to the warning option that
4720 controls this warning. MSGID identifies the message. The
4721 component name is taken from the spelling stack. */
4724 warning_init (int opt, const char *msgid)
4728 warning (opt, "%s", _(msgid));
4729 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4731 warning (opt, "(near initialization for %qs)", ofwhat);
4734 /* If TYPE is an array type and EXPR is a parenthesized string
4735 constant, warn if pedantic that EXPR is being used to initialize an
4736 object of type TYPE. */
4739 maybe_warn_string_init (tree type, struct c_expr expr)
4742 && TREE_CODE (type) == ARRAY_TYPE
4743 && TREE_CODE (expr.value) == STRING_CST
4744 && expr.original_code != STRING_CST)
4745 pedwarn_init (input_location, OPT_pedantic,
4746 "array initialized from parenthesized string constant");
4749 /* Digest the parser output INIT as an initializer for type TYPE.
4750 Return a C expression of type TYPE to represent the initial value.
4752 If INIT is a string constant, STRICT_STRING is true if it is
4753 unparenthesized or we should not warn here for it being parenthesized.
4754 For other types of INIT, STRICT_STRING is not used.
4756 REQUIRE_CONSTANT requests an error if non-constant initializers or
4757 elements are seen. */
4760 digest_init (tree type, tree init, bool strict_string, int require_constant)
4762 enum tree_code code = TREE_CODE (type);
4763 tree inside_init = init;
4765 if (type == error_mark_node
4767 || init == error_mark_node
4768 || TREE_TYPE (init) == error_mark_node)
4769 return error_mark_node;
4771 STRIP_TYPE_NOPS (inside_init);
4773 inside_init = fold (inside_init);
4775 /* Initialization of an array of chars from a string constant
4776 optionally enclosed in braces. */
4778 if (code == ARRAY_TYPE && inside_init
4779 && TREE_CODE (inside_init) == STRING_CST)
4781 tree typ1 = TYPE_MAIN_VARIANT (TREE_TYPE (type));
4782 /* Note that an array could be both an array of character type
4783 and an array of wchar_t if wchar_t is signed char or unsigned
4785 bool char_array = (typ1 == char_type_node
4786 || typ1 == signed_char_type_node
4787 || typ1 == unsigned_char_type_node);
4788 bool wchar_array = !!comptypes (typ1, wchar_type_node);
4789 bool char16_array = !!comptypes (typ1, char16_type_node);
4790 bool char32_array = !!comptypes (typ1, char32_type_node);
4792 if (char_array || wchar_array || char16_array || char32_array)
4795 tree typ2 = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (inside_init)));
4796 expr.value = inside_init;
4797 expr.original_code = (strict_string ? STRING_CST : ERROR_MARK);
4798 maybe_warn_string_init (type, expr);
4800 if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
4801 TYPE_MAIN_VARIANT (type)))
4806 if (typ2 != char_type_node)
4808 error_init ("char-array initialized from wide string");
4809 return error_mark_node;
4814 if (typ2 == char_type_node)
4816 error_init ("wide character array initialized from non-wide "
4818 return error_mark_node;
4820 else if (!comptypes(typ1, typ2))
4822 error_init ("wide character array initialized from "
4823 "incompatible wide string");
4824 return error_mark_node;
4828 TREE_TYPE (inside_init) = type;
4829 if (TYPE_DOMAIN (type) != 0
4830 && TYPE_SIZE (type) != 0
4831 && TREE_CODE (TYPE_SIZE (type)) == INTEGER_CST
4832 /* Subtract the size of a single (possibly wide) character
4833 because it's ok to ignore the terminating null char
4834 that is counted in the length of the constant. */
4835 && 0 > compare_tree_int (TYPE_SIZE_UNIT (type),
4836 TREE_STRING_LENGTH (inside_init)
4837 - (TYPE_PRECISION (typ1)
4839 pedwarn_init (input_location, 0,
4840 "initializer-string for array of chars is too long");
4844 else if (INTEGRAL_TYPE_P (typ1))
4846 error_init ("array of inappropriate type initialized "
4847 "from string constant");
4848 return error_mark_node;
4852 /* Build a VECTOR_CST from a *constant* vector constructor. If the
4853 vector constructor is not constant (e.g. {1,2,3,foo()}) then punt
4854 below and handle as a constructor. */
4855 if (code == VECTOR_TYPE
4856 && TREE_CODE (TREE_TYPE (inside_init)) == VECTOR_TYPE
4857 && vector_types_convertible_p (TREE_TYPE (inside_init), type, true)
4858 && TREE_CONSTANT (inside_init))
4860 if (TREE_CODE (inside_init) == VECTOR_CST
4861 && comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
4862 TYPE_MAIN_VARIANT (type)))
4865 if (TREE_CODE (inside_init) == CONSTRUCTOR)
4867 unsigned HOST_WIDE_INT ix;
4869 bool constant_p = true;
4871 /* Iterate through elements and check if all constructor
4872 elements are *_CSTs. */
4873 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (inside_init), ix, value)
4874 if (!CONSTANT_CLASS_P (value))
4881 return build_vector_from_ctor (type,
4882 CONSTRUCTOR_ELTS (inside_init));
4886 if (warn_sequence_point)
4887 verify_sequence_points (inside_init);
4889 /* Any type can be initialized
4890 from an expression of the same type, optionally with braces. */
4892 if (inside_init && TREE_TYPE (inside_init) != 0
4893 && (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
4894 TYPE_MAIN_VARIANT (type))
4895 || (code == ARRAY_TYPE
4896 && comptypes (TREE_TYPE (inside_init), type))
4897 || (code == VECTOR_TYPE
4898 && comptypes (TREE_TYPE (inside_init), type))
4899 || (code == POINTER_TYPE
4900 && TREE_CODE (TREE_TYPE (inside_init)) == ARRAY_TYPE
4901 && comptypes (TREE_TYPE (TREE_TYPE (inside_init)),
4902 TREE_TYPE (type)))))
4904 if (code == POINTER_TYPE)
4906 if (TREE_CODE (TREE_TYPE (inside_init)) == ARRAY_TYPE)
4908 if (TREE_CODE (inside_init) == STRING_CST
4909 || TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
4910 inside_init = array_to_pointer_conversion (inside_init);
4913 error_init ("invalid use of non-lvalue array");
4914 return error_mark_node;
4919 if (code == VECTOR_TYPE)
4920 /* Although the types are compatible, we may require a
4922 inside_init = convert (type, inside_init);
4924 if (require_constant
4925 && (code == VECTOR_TYPE || !flag_isoc99)
4926 && TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
4928 /* As an extension, allow initializing objects with static storage
4929 duration with compound literals (which are then treated just as
4930 the brace enclosed list they contain). Also allow this for
4931 vectors, as we can only assign them with compound literals. */
4932 tree decl = COMPOUND_LITERAL_EXPR_DECL (inside_init);
4933 inside_init = DECL_INITIAL (decl);
4936 if (code == ARRAY_TYPE && TREE_CODE (inside_init) != STRING_CST
4937 && TREE_CODE (inside_init) != CONSTRUCTOR)
4939 error_init ("array initialized from non-constant array expression");
4940 return error_mark_node;
4943 if (optimize && TREE_CODE (inside_init) == VAR_DECL)
4944 inside_init = decl_constant_value_for_broken_optimization (inside_init);
4946 /* Compound expressions can only occur here if -pedantic or
4947 -pedantic-errors is specified. In the later case, we always want
4948 an error. In the former case, we simply want a warning. */
4949 if (require_constant && pedantic
4950 && TREE_CODE (inside_init) == COMPOUND_EXPR)
4953 = valid_compound_expr_initializer (inside_init,
4954 TREE_TYPE (inside_init));
4955 if (inside_init == error_mark_node)
4956 error_init ("initializer element is not constant");
4958 pedwarn_init (input_location, OPT_pedantic,
4959 "initializer element is not constant");
4960 if (flag_pedantic_errors)
4961 inside_init = error_mark_node;
4963 else if (require_constant
4964 && !initializer_constant_valid_p (inside_init,
4965 TREE_TYPE (inside_init)))
4967 error_init ("initializer element is not constant");
4968 inside_init = error_mark_node;
4971 /* Added to enable additional -Wmissing-format-attribute warnings. */
4972 if (TREE_CODE (TREE_TYPE (inside_init)) == POINTER_TYPE)
4973 inside_init = convert_for_assignment (type, inside_init, ic_init, NULL_TREE,
4978 /* Handle scalar types, including conversions. */
4980 if (code == INTEGER_TYPE || code == REAL_TYPE || code == FIXED_POINT_TYPE
4981 || code == POINTER_TYPE || code == ENUMERAL_TYPE || code == BOOLEAN_TYPE
4982 || code == COMPLEX_TYPE || code == VECTOR_TYPE)
4984 if (TREE_CODE (TREE_TYPE (init)) == ARRAY_TYPE
4985 && (TREE_CODE (init) == STRING_CST
4986 || TREE_CODE (init) == COMPOUND_LITERAL_EXPR))
4987 init = array_to_pointer_conversion (init);
4989 = convert_for_assignment (type, init, ic_init,
4990 NULL_TREE, NULL_TREE, 0);
4992 /* Check to see if we have already given an error message. */
4993 if (inside_init == error_mark_node)
4995 else if (require_constant && !TREE_CONSTANT (inside_init))
4997 error_init ("initializer element is not constant");
4998 inside_init = error_mark_node;
5000 else if (require_constant
5001 && !initializer_constant_valid_p (inside_init,
5002 TREE_TYPE (inside_init)))
5004 error_init ("initializer element is not computable at load time");
5005 inside_init = error_mark_node;
5011 /* Come here only for records and arrays. */
5013 if (COMPLETE_TYPE_P (type) && TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST)
5015 error_init ("variable-sized object may not be initialized");
5016 return error_mark_node;
5019 error_init ("invalid initializer");
5020 return error_mark_node;
5023 /* Handle initializers that use braces. */
5025 /* Type of object we are accumulating a constructor for.
5026 This type is always a RECORD_TYPE, UNION_TYPE or ARRAY_TYPE. */
5027 static tree constructor_type;
5029 /* For a RECORD_TYPE or UNION_TYPE, this is the chain of fields
5031 static tree constructor_fields;
5033 /* For an ARRAY_TYPE, this is the specified index
5034 at which to store the next element we get. */
5035 static tree constructor_index;
5037 /* For an ARRAY_TYPE, this is the maximum index. */
5038 static tree constructor_max_index;
5040 /* For a RECORD_TYPE, this is the first field not yet written out. */
5041 static tree constructor_unfilled_fields;
5043 /* For an ARRAY_TYPE, this is the index of the first element
5044 not yet written out. */
5045 static tree constructor_unfilled_index;
5047 /* In a RECORD_TYPE, the byte index of the next consecutive field.
5048 This is so we can generate gaps between fields, when appropriate. */
5049 static tree constructor_bit_index;
5051 /* If we are saving up the elements rather than allocating them,
5052 this is the list of elements so far (in reverse order,
5053 most recent first). */
5054 static VEC(constructor_elt,gc) *constructor_elements;
5056 /* 1 if constructor should be incrementally stored into a constructor chain,
5057 0 if all the elements should be kept in AVL tree. */
5058 static int constructor_incremental;
5060 /* 1 if so far this constructor's elements are all compile-time constants. */
5061 static int constructor_constant;
5063 /* 1 if so far this constructor's elements are all valid address constants. */
5064 static int constructor_simple;
5066 /* 1 if this constructor is erroneous so far. */
5067 static int constructor_erroneous;
5069 /* Structure for managing pending initializer elements, organized as an
5074 struct init_node *left, *right;
5075 struct init_node *parent;
5081 /* Tree of pending elements at this constructor level.
5082 These are elements encountered out of order
5083 which belong at places we haven't reached yet in actually
5085 Will never hold tree nodes across GC runs. */
5086 static struct init_node *constructor_pending_elts;
5088 /* The SPELLING_DEPTH of this constructor. */
5089 static int constructor_depth;
5091 /* DECL node for which an initializer is being read.
5092 0 means we are reading a constructor expression
5093 such as (struct foo) {...}. */
5094 static tree constructor_decl;
5096 /* Nonzero if this is an initializer for a top-level decl. */
5097 static int constructor_top_level;
5099 /* Nonzero if there were any member designators in this initializer. */
5100 static int constructor_designated;
5102 /* Nesting depth of designator list. */
5103 static int designator_depth;
5105 /* Nonzero if there were diagnosed errors in this designator list. */
5106 static int designator_erroneous;
5109 /* This stack has a level for each implicit or explicit level of
5110 structuring in the initializer, including the outermost one. It
5111 saves the values of most of the variables above. */
5113 struct constructor_range_stack;
5115 struct constructor_stack
5117 struct constructor_stack *next;
5122 tree unfilled_index;
5123 tree unfilled_fields;
5125 VEC(constructor_elt,gc) *elements;
5126 struct init_node *pending_elts;
5129 /* If value nonzero, this value should replace the entire
5130 constructor at this level. */
5131 struct c_expr replacement_value;
5132 struct constructor_range_stack *range_stack;
5142 static struct constructor_stack *constructor_stack;
5144 /* This stack represents designators from some range designator up to
5145 the last designator in the list. */
5147 struct constructor_range_stack
5149 struct constructor_range_stack *next, *prev;
5150 struct constructor_stack *stack;
5157 static struct constructor_range_stack *constructor_range_stack;
5159 /* This stack records separate initializers that are nested.
5160 Nested initializers can't happen in ANSI C, but GNU C allows them
5161 in cases like { ... (struct foo) { ... } ... }. */
5163 struct initializer_stack
5165 struct initializer_stack *next;
5167 struct constructor_stack *constructor_stack;
5168 struct constructor_range_stack *constructor_range_stack;
5169 VEC(constructor_elt,gc) *elements;
5170 struct spelling *spelling;
5171 struct spelling *spelling_base;
5174 char require_constant_value;
5175 char require_constant_elements;
5178 static struct initializer_stack *initializer_stack;
5180 /* Prepare to parse and output the initializer for variable DECL. */
5183 start_init (tree decl, tree asmspec_tree ATTRIBUTE_UNUSED, int top_level)
5186 struct initializer_stack *p = XNEW (struct initializer_stack);
5188 p->decl = constructor_decl;
5189 p->require_constant_value = require_constant_value;
5190 p->require_constant_elements = require_constant_elements;
5191 p->constructor_stack = constructor_stack;
5192 p->constructor_range_stack = constructor_range_stack;
5193 p->elements = constructor_elements;
5194 p->spelling = spelling;
5195 p->spelling_base = spelling_base;
5196 p->spelling_size = spelling_size;
5197 p->top_level = constructor_top_level;
5198 p->next = initializer_stack;
5199 initializer_stack = p;
5201 constructor_decl = decl;
5202 constructor_designated = 0;
5203 constructor_top_level = top_level;
5205 if (decl != 0 && decl != error_mark_node)
5207 require_constant_value = TREE_STATIC (decl);
5208 require_constant_elements
5209 = ((TREE_STATIC (decl) || (pedantic && !flag_isoc99))
5210 /* For a scalar, you can always use any value to initialize,
5211 even within braces. */
5212 && (TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE
5213 || TREE_CODE (TREE_TYPE (decl)) == RECORD_TYPE
5214 || TREE_CODE (TREE_TYPE (decl)) == UNION_TYPE
5215 || TREE_CODE (TREE_TYPE (decl)) == QUAL_UNION_TYPE));
5216 locus = IDENTIFIER_POINTER (DECL_NAME (decl));
5220 require_constant_value = 0;
5221 require_constant_elements = 0;
5222 locus = "(anonymous)";
5225 constructor_stack = 0;
5226 constructor_range_stack = 0;
5228 missing_braces_mentioned = 0;
5232 RESTORE_SPELLING_DEPTH (0);
5235 push_string (locus);
5241 struct initializer_stack *p = initializer_stack;
5243 /* Free the whole constructor stack of this initializer. */
5244 while (constructor_stack)
5246 struct constructor_stack *q = constructor_stack;
5247 constructor_stack = q->next;
5251 gcc_assert (!constructor_range_stack);
5253 /* Pop back to the data of the outer initializer (if any). */
5254 free (spelling_base);
5256 constructor_decl = p->decl;
5257 require_constant_value = p->require_constant_value;
5258 require_constant_elements = p->require_constant_elements;
5259 constructor_stack = p->constructor_stack;
5260 constructor_range_stack = p->constructor_range_stack;
5261 constructor_elements = p->elements;
5262 spelling = p->spelling;
5263 spelling_base = p->spelling_base;
5264 spelling_size = p->spelling_size;
5265 constructor_top_level = p->top_level;
5266 initializer_stack = p->next;
5270 /* Call here when we see the initializer is surrounded by braces.
5271 This is instead of a call to push_init_level;
5272 it is matched by a call to pop_init_level.
5274 TYPE is the type to initialize, for a constructor expression.
5275 For an initializer for a decl, TYPE is zero. */
5278 really_start_incremental_init (tree type)
5280 struct constructor_stack *p = XNEW (struct constructor_stack);
5283 type = TREE_TYPE (constructor_decl);
5285 if (targetm.vector_opaque_p (type))
5286 error ("opaque vector types cannot be initialized");
5288 p->type = constructor_type;
5289 p->fields = constructor_fields;
5290 p->index = constructor_index;
5291 p->max_index = constructor_max_index;
5292 p->unfilled_index = constructor_unfilled_index;
5293 p->unfilled_fields = constructor_unfilled_fields;
5294 p->bit_index = constructor_bit_index;
5295 p->elements = constructor_elements;
5296 p->constant = constructor_constant;
5297 p->simple = constructor_simple;
5298 p->erroneous = constructor_erroneous;
5299 p->pending_elts = constructor_pending_elts;
5300 p->depth = constructor_depth;
5301 p->replacement_value.value = 0;
5302 p->replacement_value.original_code = ERROR_MARK;
5306 p->incremental = constructor_incremental;
5307 p->designated = constructor_designated;
5309 constructor_stack = p;
5311 constructor_constant = 1;
5312 constructor_simple = 1;
5313 constructor_depth = SPELLING_DEPTH ();
5314 constructor_elements = 0;
5315 constructor_pending_elts = 0;
5316 constructor_type = type;
5317 constructor_incremental = 1;
5318 constructor_designated = 0;
5319 designator_depth = 0;
5320 designator_erroneous = 0;
5322 if (TREE_CODE (constructor_type) == RECORD_TYPE
5323 || TREE_CODE (constructor_type) == UNION_TYPE)
5325 constructor_fields = TYPE_FIELDS (constructor_type);
5326 /* Skip any nameless bit fields at the beginning. */
5327 while (constructor_fields != 0 && DECL_C_BIT_FIELD (constructor_fields)
5328 && DECL_NAME (constructor_fields) == 0)
5329 constructor_fields = TREE_CHAIN (constructor_fields);
5331 constructor_unfilled_fields = constructor_fields;
5332 constructor_bit_index = bitsize_zero_node;
5334 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5336 if (TYPE_DOMAIN (constructor_type))
5338 constructor_max_index
5339 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type));
5341 /* Detect non-empty initializations of zero-length arrays. */
5342 if (constructor_max_index == NULL_TREE
5343 && TYPE_SIZE (constructor_type))
5344 constructor_max_index = build_int_cst (NULL_TREE, -1);
5346 /* constructor_max_index needs to be an INTEGER_CST. Attempts
5347 to initialize VLAs will cause a proper error; avoid tree
5348 checking errors as well by setting a safe value. */
5349 if (constructor_max_index
5350 && TREE_CODE (constructor_max_index) != INTEGER_CST)
5351 constructor_max_index = build_int_cst (NULL_TREE, -1);
5354 = convert (bitsizetype,
5355 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
5359 constructor_index = bitsize_zero_node;
5360 constructor_max_index = NULL_TREE;
5363 constructor_unfilled_index = constructor_index;
5365 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
5367 /* Vectors are like simple fixed-size arrays. */
5368 constructor_max_index =
5369 build_int_cst (NULL_TREE, TYPE_VECTOR_SUBPARTS (constructor_type) - 1);
5370 constructor_index = bitsize_zero_node;
5371 constructor_unfilled_index = constructor_index;
5375 /* Handle the case of int x = {5}; */
5376 constructor_fields = constructor_type;
5377 constructor_unfilled_fields = constructor_type;
5381 /* Push down into a subobject, for initialization.
5382 If this is for an explicit set of braces, IMPLICIT is 0.
5383 If it is because the next element belongs at a lower level,
5384 IMPLICIT is 1 (or 2 if the push is because of designator list). */
5387 push_init_level (int implicit)
5389 struct constructor_stack *p;
5390 tree value = NULL_TREE;
5392 /* If we've exhausted any levels that didn't have braces,
5393 pop them now. If implicit == 1, this will have been done in
5394 process_init_element; do not repeat it here because in the case
5395 of excess initializers for an empty aggregate this leads to an
5396 infinite cycle of popping a level and immediately recreating
5400 while (constructor_stack->implicit)
5402 if ((TREE_CODE (constructor_type) == RECORD_TYPE
5403 || TREE_CODE (constructor_type) == UNION_TYPE)
5404 && constructor_fields == 0)
5405 process_init_element (pop_init_level (1), true);
5406 else if (TREE_CODE (constructor_type) == ARRAY_TYPE
5407 && constructor_max_index
5408 && tree_int_cst_lt (constructor_max_index,
5410 process_init_element (pop_init_level (1), true);
5416 /* Unless this is an explicit brace, we need to preserve previous
5420 if ((TREE_CODE (constructor_type) == RECORD_TYPE
5421 || TREE_CODE (constructor_type) == UNION_TYPE)
5422 && constructor_fields)
5423 value = find_init_member (constructor_fields);
5424 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5425 value = find_init_member (constructor_index);
5428 p = XNEW (struct constructor_stack);
5429 p->type = constructor_type;
5430 p->fields = constructor_fields;
5431 p->index = constructor_index;
5432 p->max_index = constructor_max_index;
5433 p->unfilled_index = constructor_unfilled_index;
5434 p->unfilled_fields = constructor_unfilled_fields;
5435 p->bit_index = constructor_bit_index;
5436 p->elements = constructor_elements;
5437 p->constant = constructor_constant;
5438 p->simple = constructor_simple;
5439 p->erroneous = constructor_erroneous;
5440 p->pending_elts = constructor_pending_elts;
5441 p->depth = constructor_depth;
5442 p->replacement_value.value = 0;
5443 p->replacement_value.original_code = ERROR_MARK;
5444 p->implicit = implicit;
5446 p->incremental = constructor_incremental;
5447 p->designated = constructor_designated;
5448 p->next = constructor_stack;
5450 constructor_stack = p;
5452 constructor_constant = 1;
5453 constructor_simple = 1;
5454 constructor_depth = SPELLING_DEPTH ();
5455 constructor_elements = 0;
5456 constructor_incremental = 1;
5457 constructor_designated = 0;
5458 constructor_pending_elts = 0;
5461 p->range_stack = constructor_range_stack;
5462 constructor_range_stack = 0;
5463 designator_depth = 0;
5464 designator_erroneous = 0;
5467 /* Don't die if an entire brace-pair level is superfluous
5468 in the containing level. */
5469 if (constructor_type == 0)
5471 else if (TREE_CODE (constructor_type) == RECORD_TYPE
5472 || TREE_CODE (constructor_type) == UNION_TYPE)
5474 /* Don't die if there are extra init elts at the end. */
5475 if (constructor_fields == 0)
5476 constructor_type = 0;
5479 constructor_type = TREE_TYPE (constructor_fields);
5480 push_member_name (constructor_fields);
5481 constructor_depth++;
5484 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5486 constructor_type = TREE_TYPE (constructor_type);
5487 push_array_bounds (tree_low_cst (constructor_index, 1));
5488 constructor_depth++;
5491 if (constructor_type == 0)
5493 error_init ("extra brace group at end of initializer");
5494 constructor_fields = 0;
5495 constructor_unfilled_fields = 0;
5499 if (value && TREE_CODE (value) == CONSTRUCTOR)
5501 constructor_constant = TREE_CONSTANT (value);
5502 constructor_simple = TREE_STATIC (value);
5503 constructor_elements = CONSTRUCTOR_ELTS (value);
5504 if (!VEC_empty (constructor_elt, constructor_elements)
5505 && (TREE_CODE (constructor_type) == RECORD_TYPE
5506 || TREE_CODE (constructor_type) == ARRAY_TYPE))
5507 set_nonincremental_init ();
5510 if (implicit == 1 && warn_missing_braces && !missing_braces_mentioned)
5512 missing_braces_mentioned = 1;
5513 warning_init (OPT_Wmissing_braces, "missing braces around initializer");
5516 if (TREE_CODE (constructor_type) == RECORD_TYPE
5517 || TREE_CODE (constructor_type) == UNION_TYPE)
5519 constructor_fields = TYPE_FIELDS (constructor_type);
5520 /* Skip any nameless bit fields at the beginning. */
5521 while (constructor_fields != 0 && DECL_C_BIT_FIELD (constructor_fields)
5522 && DECL_NAME (constructor_fields) == 0)
5523 constructor_fields = TREE_CHAIN (constructor_fields);
5525 constructor_unfilled_fields = constructor_fields;
5526 constructor_bit_index = bitsize_zero_node;
5528 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
5530 /* Vectors are like simple fixed-size arrays. */
5531 constructor_max_index =
5532 build_int_cst (NULL_TREE, TYPE_VECTOR_SUBPARTS (constructor_type) - 1);
5533 constructor_index = convert (bitsizetype, integer_zero_node);
5534 constructor_unfilled_index = constructor_index;
5536 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5538 if (TYPE_DOMAIN (constructor_type))
5540 constructor_max_index
5541 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type));
5543 /* Detect non-empty initializations of zero-length arrays. */
5544 if (constructor_max_index == NULL_TREE
5545 && TYPE_SIZE (constructor_type))
5546 constructor_max_index = build_int_cst (NULL_TREE, -1);
5548 /* constructor_max_index needs to be an INTEGER_CST. Attempts
5549 to initialize VLAs will cause a proper error; avoid tree
5550 checking errors as well by setting a safe value. */
5551 if (constructor_max_index
5552 && TREE_CODE (constructor_max_index) != INTEGER_CST)
5553 constructor_max_index = build_int_cst (NULL_TREE, -1);
5556 = convert (bitsizetype,
5557 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
5560 constructor_index = bitsize_zero_node;
5562 constructor_unfilled_index = constructor_index;
5563 if (value && TREE_CODE (value) == STRING_CST)
5565 /* We need to split the char/wchar array into individual
5566 characters, so that we don't have to special case it
5568 set_nonincremental_init_from_string (value);
5573 if (constructor_type != error_mark_node)
5574 warning_init (0, "braces around scalar initializer");
5575 constructor_fields = constructor_type;
5576 constructor_unfilled_fields = constructor_type;
5580 /* At the end of an implicit or explicit brace level,
5581 finish up that level of constructor. If a single expression
5582 with redundant braces initialized that level, return the
5583 c_expr structure for that expression. Otherwise, the original_code
5584 element is set to ERROR_MARK.
5585 If we were outputting the elements as they are read, return 0 as the value
5586 from inner levels (process_init_element ignores that),
5587 but return error_mark_node as the value from the outermost level
5588 (that's what we want to put in DECL_INITIAL).
5589 Otherwise, return a CONSTRUCTOR expression as the value. */
5592 pop_init_level (int implicit)
5594 struct constructor_stack *p;
5597 ret.original_code = ERROR_MARK;
5601 /* When we come to an explicit close brace,
5602 pop any inner levels that didn't have explicit braces. */
5603 while (constructor_stack->implicit)
5604 process_init_element (pop_init_level (1), true);
5606 gcc_assert (!constructor_range_stack);
5609 /* Now output all pending elements. */
5610 constructor_incremental = 1;
5611 output_pending_init_elements (1);
5613 p = constructor_stack;
5615 /* Error for initializing a flexible array member, or a zero-length
5616 array member in an inappropriate context. */
5617 if (constructor_type && constructor_fields
5618 && TREE_CODE (constructor_type) == ARRAY_TYPE
5619 && TYPE_DOMAIN (constructor_type)
5620 && !TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type)))
5622 /* Silently discard empty initializations. The parser will
5623 already have pedwarned for empty brackets. */
5624 if (integer_zerop (constructor_unfilled_index))
5625 constructor_type = NULL_TREE;
5628 gcc_assert (!TYPE_SIZE (constructor_type));
5630 if (constructor_depth > 2)
5631 error_init ("initialization of flexible array member in a nested context");
5633 pedwarn_init (input_location, OPT_pedantic,
5634 "initialization of a flexible array member");
5636 /* We have already issued an error message for the existence
5637 of a flexible array member not at the end of the structure.
5638 Discard the initializer so that we do not die later. */
5639 if (TREE_CHAIN (constructor_fields) != NULL_TREE)
5640 constructor_type = NULL_TREE;
5644 /* Warn when some struct elements are implicitly initialized to zero. */
5645 if (warn_missing_field_initializers
5647 && TREE_CODE (constructor_type) == RECORD_TYPE
5648 && constructor_unfilled_fields)
5650 /* Do not warn for flexible array members or zero-length arrays. */
5651 while (constructor_unfilled_fields
5652 && (!DECL_SIZE (constructor_unfilled_fields)
5653 || integer_zerop (DECL_SIZE (constructor_unfilled_fields))))
5654 constructor_unfilled_fields = TREE_CHAIN (constructor_unfilled_fields);
5656 /* Do not warn if this level of the initializer uses member
5657 designators; it is likely to be deliberate. */
5658 if (constructor_unfilled_fields && !constructor_designated)
5660 push_member_name (constructor_unfilled_fields);
5661 warning_init (OPT_Wmissing_field_initializers,
5662 "missing initializer");
5663 RESTORE_SPELLING_DEPTH (constructor_depth);
5667 /* Pad out the end of the structure. */
5668 if (p->replacement_value.value)
5669 /* If this closes a superfluous brace pair,
5670 just pass out the element between them. */
5671 ret = p->replacement_value;
5672 else if (constructor_type == 0)
5674 else if (TREE_CODE (constructor_type) != RECORD_TYPE
5675 && TREE_CODE (constructor_type) != UNION_TYPE
5676 && TREE_CODE (constructor_type) != ARRAY_TYPE
5677 && TREE_CODE (constructor_type) != VECTOR_TYPE)
5679 /* A nonincremental scalar initializer--just return
5680 the element, after verifying there is just one. */
5681 if (VEC_empty (constructor_elt,constructor_elements))
5683 if (!constructor_erroneous)
5684 error_init ("empty scalar initializer");
5685 ret.value = error_mark_node;
5687 else if (VEC_length (constructor_elt,constructor_elements) != 1)
5689 error_init ("extra elements in scalar initializer");
5690 ret.value = VEC_index (constructor_elt,constructor_elements,0)->value;
5693 ret.value = VEC_index (constructor_elt,constructor_elements,0)->value;
5697 if (constructor_erroneous)
5698 ret.value = error_mark_node;
5701 ret.value = build_constructor (constructor_type,
5702 constructor_elements);
5703 if (constructor_constant)
5704 TREE_CONSTANT (ret.value) = 1;
5705 if (constructor_constant && constructor_simple)
5706 TREE_STATIC (ret.value) = 1;
5710 constructor_type = p->type;
5711 constructor_fields = p->fields;
5712 constructor_index = p->index;
5713 constructor_max_index = p->max_index;
5714 constructor_unfilled_index = p->unfilled_index;
5715 constructor_unfilled_fields = p->unfilled_fields;
5716 constructor_bit_index = p->bit_index;
5717 constructor_elements = p->elements;
5718 constructor_constant = p->constant;
5719 constructor_simple = p->simple;
5720 constructor_erroneous = p->erroneous;
5721 constructor_incremental = p->incremental;
5722 constructor_designated = p->designated;
5723 constructor_pending_elts = p->pending_elts;
5724 constructor_depth = p->depth;
5726 constructor_range_stack = p->range_stack;
5727 RESTORE_SPELLING_DEPTH (constructor_depth);
5729 constructor_stack = p->next;
5732 if (ret.value == 0 && constructor_stack == 0)
5733 ret.value = error_mark_node;
5737 /* Common handling for both array range and field name designators.
5738 ARRAY argument is nonzero for array ranges. Returns zero for success. */
5741 set_designator (int array)
5744 enum tree_code subcode;
5746 /* Don't die if an entire brace-pair level is superfluous
5747 in the containing level. */
5748 if (constructor_type == 0)
5751 /* If there were errors in this designator list already, bail out
5753 if (designator_erroneous)
5756 if (!designator_depth)
5758 gcc_assert (!constructor_range_stack);
5760 /* Designator list starts at the level of closest explicit
5762 while (constructor_stack->implicit)
5763 process_init_element (pop_init_level (1), true);
5764 constructor_designated = 1;
5768 switch (TREE_CODE (constructor_type))
5772 subtype = TREE_TYPE (constructor_fields);
5773 if (subtype != error_mark_node)
5774 subtype = TYPE_MAIN_VARIANT (subtype);
5777 subtype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
5783 subcode = TREE_CODE (subtype);
5784 if (array && subcode != ARRAY_TYPE)
5786 error_init ("array index in non-array initializer");
5789 else if (!array && subcode != RECORD_TYPE && subcode != UNION_TYPE)
5791 error_init ("field name not in record or union initializer");
5795 constructor_designated = 1;
5796 push_init_level (2);
5800 /* If there are range designators in designator list, push a new designator
5801 to constructor_range_stack. RANGE_END is end of such stack range or
5802 NULL_TREE if there is no range designator at this level. */
5805 push_range_stack (tree range_end)
5807 struct constructor_range_stack *p;
5809 p = GGC_NEW (struct constructor_range_stack);
5810 p->prev = constructor_range_stack;
5812 p->fields = constructor_fields;
5813 p->range_start = constructor_index;
5814 p->index = constructor_index;
5815 p->stack = constructor_stack;
5816 p->range_end = range_end;
5817 if (constructor_range_stack)
5818 constructor_range_stack->next = p;
5819 constructor_range_stack = p;
5822 /* Within an array initializer, specify the next index to be initialized.
5823 FIRST is that index. If LAST is nonzero, then initialize a range
5824 of indices, running from FIRST through LAST. */
5827 set_init_index (tree first, tree last)
5829 if (set_designator (1))
5832 designator_erroneous = 1;
5834 if (!INTEGRAL_TYPE_P (TREE_TYPE (first))
5835 || (last && !INTEGRAL_TYPE_P (TREE_TYPE (last))))
5837 error_init ("array index in initializer not of integer type");
5841 if (TREE_CODE (first) != INTEGER_CST)
5842 error_init ("nonconstant array index in initializer");
5843 else if (last != 0 && TREE_CODE (last) != INTEGER_CST)
5844 error_init ("nonconstant array index in initializer");
5845 else if (TREE_CODE (constructor_type) != ARRAY_TYPE)
5846 error_init ("array index in non-array initializer");
5847 else if (tree_int_cst_sgn (first) == -1)
5848 error_init ("array index in initializer exceeds array bounds");
5849 else if (constructor_max_index
5850 && tree_int_cst_lt (constructor_max_index, first))
5851 error_init ("array index in initializer exceeds array bounds");
5854 constructor_index = convert (bitsizetype, first);
5858 if (tree_int_cst_equal (first, last))
5860 else if (tree_int_cst_lt (last, first))
5862 error_init ("empty index range in initializer");
5867 last = convert (bitsizetype, last);
5868 if (constructor_max_index != 0
5869 && tree_int_cst_lt (constructor_max_index, last))
5871 error_init ("array index range in initializer exceeds array bounds");
5878 designator_erroneous = 0;
5879 if (constructor_range_stack || last)
5880 push_range_stack (last);
5884 /* Within a struct initializer, specify the next field to be initialized. */
5887 set_init_label (tree fieldname)
5891 if (set_designator (0))
5894 designator_erroneous = 1;
5896 if (TREE_CODE (constructor_type) != RECORD_TYPE
5897 && TREE_CODE (constructor_type) != UNION_TYPE)
5899 error_init ("field name not in record or union initializer");
5903 for (tail = TYPE_FIELDS (constructor_type); tail;
5904 tail = TREE_CHAIN (tail))
5906 if (DECL_NAME (tail) == fieldname)
5911 error ("unknown field %qE specified in initializer", fieldname);
5914 constructor_fields = tail;
5916 designator_erroneous = 0;
5917 if (constructor_range_stack)
5918 push_range_stack (NULL_TREE);
5922 /* Add a new initializer to the tree of pending initializers. PURPOSE
5923 identifies the initializer, either array index or field in a structure.
5924 VALUE is the value of that index or field.
5926 IMPLICIT is true if value comes from pop_init_level (1),
5927 the new initializer has been merged with the existing one
5928 and thus no warnings should be emitted about overriding an
5929 existing initializer. */
5932 add_pending_init (tree purpose, tree value, bool implicit)
5934 struct init_node *p, **q, *r;
5936 q = &constructor_pending_elts;
5939 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5944 if (tree_int_cst_lt (purpose, p->purpose))
5946 else if (tree_int_cst_lt (p->purpose, purpose))
5952 if (TREE_SIDE_EFFECTS (p->value))
5953 warning_init (0, "initialized field with side-effects overwritten");
5954 else if (warn_override_init)
5955 warning_init (OPT_Woverride_init, "initialized field overwritten");
5966 bitpos = bit_position (purpose);
5970 if (tree_int_cst_lt (bitpos, bit_position (p->purpose)))
5972 else if (p->purpose != purpose)
5978 if (TREE_SIDE_EFFECTS (p->value))
5979 warning_init (0, "initialized field with side-effects overwritten");
5980 else if (warn_override_init)
5981 warning_init (OPT_Woverride_init, "initialized field overwritten");
5989 r = GGC_NEW (struct init_node);
5990 r->purpose = purpose;
6001 struct init_node *s;
6005 if (p->balance == 0)
6007 else if (p->balance < 0)
6014 p->left->parent = p;
6031 constructor_pending_elts = r;
6036 struct init_node *t = r->right;
6040 r->right->parent = r;
6045 p->left->parent = p;
6048 p->balance = t->balance < 0;
6049 r->balance = -(t->balance > 0);
6064 constructor_pending_elts = t;
6070 /* p->balance == +1; growth of left side balances the node. */
6075 else /* r == p->right */
6077 if (p->balance == 0)
6078 /* Growth propagation from right side. */
6080 else if (p->balance > 0)
6087 p->right->parent = p;
6104 constructor_pending_elts = r;
6106 else /* r->balance == -1 */
6109 struct init_node *t = r->left;
6113 r->left->parent = r;
6118 p->right->parent = p;
6121 r->balance = (t->balance < 0);
6122 p->balance = -(t->balance > 0);
6137 constructor_pending_elts = t;
6143 /* p->balance == -1; growth of right side balances the node. */
6154 /* Build AVL tree from a sorted chain. */
6157 set_nonincremental_init (void)
6159 unsigned HOST_WIDE_INT ix;
6162 if (TREE_CODE (constructor_type) != RECORD_TYPE
6163 && TREE_CODE (constructor_type) != ARRAY_TYPE)
6166 FOR_EACH_CONSTRUCTOR_ELT (constructor_elements, ix, index, value)
6167 add_pending_init (index, value, false);
6168 constructor_elements = 0;
6169 if (TREE_CODE (constructor_type) == RECORD_TYPE)
6171 constructor_unfilled_fields = TYPE_FIELDS (constructor_type);
6172 /* Skip any nameless bit fields at the beginning. */
6173 while (constructor_unfilled_fields != 0
6174 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
6175 && DECL_NAME (constructor_unfilled_fields) == 0)
6176 constructor_unfilled_fields = TREE_CHAIN (constructor_unfilled_fields);
6179 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6181 if (TYPE_DOMAIN (constructor_type))
6182 constructor_unfilled_index
6183 = convert (bitsizetype,
6184 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
6186 constructor_unfilled_index = bitsize_zero_node;
6188 constructor_incremental = 0;
6191 /* Build AVL tree from a string constant. */
6194 set_nonincremental_init_from_string (tree str)
6196 tree value, purpose, type;
6197 HOST_WIDE_INT val[2];
6198 const char *p, *end;
6199 int byte, wchar_bytes, charwidth, bitpos;
6201 gcc_assert (TREE_CODE (constructor_type) == ARRAY_TYPE);
6203 wchar_bytes = TYPE_PRECISION (TREE_TYPE (TREE_TYPE (str))) / BITS_PER_UNIT;
6204 charwidth = TYPE_PRECISION (char_type_node);
6205 type = TREE_TYPE (constructor_type);
6206 p = TREE_STRING_POINTER (str);
6207 end = p + TREE_STRING_LENGTH (str);
6209 for (purpose = bitsize_zero_node;
6210 p < end && !tree_int_cst_lt (constructor_max_index, purpose);
6211 purpose = size_binop (PLUS_EXPR, purpose, bitsize_one_node))
6213 if (wchar_bytes == 1)
6215 val[1] = (unsigned char) *p++;
6222 for (byte = 0; byte < wchar_bytes; byte++)
6224 if (BYTES_BIG_ENDIAN)
6225 bitpos = (wchar_bytes - byte - 1) * charwidth;
6227 bitpos = byte * charwidth;
6228 val[bitpos < HOST_BITS_PER_WIDE_INT]
6229 |= ((unsigned HOST_WIDE_INT) ((unsigned char) *p++))
6230 << (bitpos % HOST_BITS_PER_WIDE_INT);
6234 if (!TYPE_UNSIGNED (type))
6236 bitpos = ((wchar_bytes - 1) * charwidth) + HOST_BITS_PER_CHAR;
6237 if (bitpos < HOST_BITS_PER_WIDE_INT)
6239 if (val[1] & (((HOST_WIDE_INT) 1) << (bitpos - 1)))
6241 val[1] |= ((HOST_WIDE_INT) -1) << bitpos;
6245 else if (bitpos == HOST_BITS_PER_WIDE_INT)
6250 else if (val[0] & (((HOST_WIDE_INT) 1)
6251 << (bitpos - 1 - HOST_BITS_PER_WIDE_INT)))
6252 val[0] |= ((HOST_WIDE_INT) -1)
6253 << (bitpos - HOST_BITS_PER_WIDE_INT);
6256 value = build_int_cst_wide (type, val[1], val[0]);
6257 add_pending_init (purpose, value, false);
6260 constructor_incremental = 0;
6263 /* Return value of FIELD in pending initializer or zero if the field was
6264 not initialized yet. */
6267 find_init_member (tree field)
6269 struct init_node *p;
6271 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6273 if (constructor_incremental
6274 && tree_int_cst_lt (field, constructor_unfilled_index))
6275 set_nonincremental_init ();
6277 p = constructor_pending_elts;
6280 if (tree_int_cst_lt (field, p->purpose))
6282 else if (tree_int_cst_lt (p->purpose, field))
6288 else if (TREE_CODE (constructor_type) == RECORD_TYPE)
6290 tree bitpos = bit_position (field);
6292 if (constructor_incremental
6293 && (!constructor_unfilled_fields
6294 || tree_int_cst_lt (bitpos,
6295 bit_position (constructor_unfilled_fields))))
6296 set_nonincremental_init ();
6298 p = constructor_pending_elts;
6301 if (field == p->purpose)
6303 else if (tree_int_cst_lt (bitpos, bit_position (p->purpose)))
6309 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6311 if (!VEC_empty (constructor_elt, constructor_elements)
6312 && (VEC_last (constructor_elt, constructor_elements)->index
6314 return VEC_last (constructor_elt, constructor_elements)->value;
6319 /* "Output" the next constructor element.
6320 At top level, really output it to assembler code now.
6321 Otherwise, collect it in a list from which we will make a CONSTRUCTOR.
6322 TYPE is the data type that the containing data type wants here.
6323 FIELD is the field (a FIELD_DECL) or the index that this element fills.
6324 If VALUE is a string constant, STRICT_STRING is true if it is
6325 unparenthesized or we should not warn here for it being parenthesized.
6326 For other types of VALUE, STRICT_STRING is not used.
6328 PENDING if non-nil means output pending elements that belong
6329 right after this element. (PENDING is normally 1;
6330 it is 0 while outputting pending elements, to avoid recursion.)
6332 IMPLICIT is true if value comes from pop_init_level (1),
6333 the new initializer has been merged with the existing one
6334 and thus no warnings should be emitted about overriding an
6335 existing initializer. */
6338 output_init_element (tree value, bool strict_string, tree type, tree field,
6339 int pending, bool implicit)
6341 constructor_elt *celt;
6343 if (type == error_mark_node || value == error_mark_node)
6345 constructor_erroneous = 1;
6348 if (TREE_CODE (TREE_TYPE (value)) == ARRAY_TYPE
6349 && (TREE_CODE (value) == STRING_CST
6350 || TREE_CODE (value) == COMPOUND_LITERAL_EXPR)
6351 && !(TREE_CODE (value) == STRING_CST
6352 && TREE_CODE (type) == ARRAY_TYPE
6353 && INTEGRAL_TYPE_P (TREE_TYPE (type)))
6354 && !comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (value)),
6355 TYPE_MAIN_VARIANT (type)))
6356 value = array_to_pointer_conversion (value);
6358 if (TREE_CODE (value) == COMPOUND_LITERAL_EXPR
6359 && require_constant_value && !flag_isoc99 && pending)
6361 /* As an extension, allow initializing objects with static storage
6362 duration with compound literals (which are then treated just as
6363 the brace enclosed list they contain). */
6364 tree decl = COMPOUND_LITERAL_EXPR_DECL (value);
6365 value = DECL_INITIAL (decl);
6368 if (value == error_mark_node)
6369 constructor_erroneous = 1;
6370 else if (!TREE_CONSTANT (value))
6371 constructor_constant = 0;
6372 else if (!initializer_constant_valid_p (value, TREE_TYPE (value))
6373 || ((TREE_CODE (constructor_type) == RECORD_TYPE
6374 || TREE_CODE (constructor_type) == UNION_TYPE)
6375 && DECL_C_BIT_FIELD (field)
6376 && TREE_CODE (value) != INTEGER_CST))
6377 constructor_simple = 0;
6379 if (!initializer_constant_valid_p (value, TREE_TYPE (value)))
6381 if (require_constant_value)
6383 error_init ("initializer element is not constant");
6384 value = error_mark_node;
6386 else if (require_constant_elements)
6387 pedwarn (input_location, 0,
6388 "initializer element is not computable at load time");
6391 /* If this field is empty (and not at the end of structure),
6392 don't do anything other than checking the initializer. */
6394 && (TREE_TYPE (field) == error_mark_node
6395 || (COMPLETE_TYPE_P (TREE_TYPE (field))
6396 && integer_zerop (TYPE_SIZE (TREE_TYPE (field)))
6397 && (TREE_CODE (constructor_type) == ARRAY_TYPE
6398 || TREE_CHAIN (field)))))
6401 value = digest_init (type, value, strict_string, require_constant_value);
6402 if (value == error_mark_node)
6404 constructor_erroneous = 1;
6408 /* If this element doesn't come next in sequence,
6409 put it on constructor_pending_elts. */
6410 if (TREE_CODE (constructor_type) == ARRAY_TYPE
6411 && (!constructor_incremental
6412 || !tree_int_cst_equal (field, constructor_unfilled_index)))
6414 if (constructor_incremental
6415 && tree_int_cst_lt (field, constructor_unfilled_index))
6416 set_nonincremental_init ();
6418 add_pending_init (field, value, implicit);
6421 else if (TREE_CODE (constructor_type) == RECORD_TYPE
6422 && (!constructor_incremental
6423 || field != constructor_unfilled_fields))
6425 /* We do this for records but not for unions. In a union,
6426 no matter which field is specified, it can be initialized
6427 right away since it starts at the beginning of the union. */
6428 if (constructor_incremental)
6430 if (!constructor_unfilled_fields)
6431 set_nonincremental_init ();
6434 tree bitpos, unfillpos;
6436 bitpos = bit_position (field);
6437 unfillpos = bit_position (constructor_unfilled_fields);
6439 if (tree_int_cst_lt (bitpos, unfillpos))
6440 set_nonincremental_init ();
6444 add_pending_init (field, value, implicit);
6447 else if (TREE_CODE (constructor_type) == UNION_TYPE
6448 && !VEC_empty (constructor_elt, constructor_elements))
6452 if (TREE_SIDE_EFFECTS (VEC_last (constructor_elt,
6453 constructor_elements)->value))
6455 "initialized field with side-effects overwritten");
6456 else if (warn_override_init)
6457 warning_init (OPT_Woverride_init, "initialized field overwritten");
6460 /* We can have just one union field set. */
6461 constructor_elements = 0;
6464 /* Otherwise, output this element either to
6465 constructor_elements or to the assembler file. */
6467 celt = VEC_safe_push (constructor_elt, gc, constructor_elements, NULL);
6468 celt->index = field;
6469 celt->value = value;
6471 /* Advance the variable that indicates sequential elements output. */
6472 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6473 constructor_unfilled_index
6474 = size_binop (PLUS_EXPR, constructor_unfilled_index,
6476 else if (TREE_CODE (constructor_type) == RECORD_TYPE)
6478 constructor_unfilled_fields
6479 = TREE_CHAIN (constructor_unfilled_fields);
6481 /* Skip any nameless bit fields. */
6482 while (constructor_unfilled_fields != 0
6483 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
6484 && DECL_NAME (constructor_unfilled_fields) == 0)
6485 constructor_unfilled_fields =
6486 TREE_CHAIN (constructor_unfilled_fields);
6488 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6489 constructor_unfilled_fields = 0;
6491 /* Now output any pending elements which have become next. */
6493 output_pending_init_elements (0);
6496 /* Output any pending elements which have become next.
6497 As we output elements, constructor_unfilled_{fields,index}
6498 advances, which may cause other elements to become next;
6499 if so, they too are output.
6501 If ALL is 0, we return when there are
6502 no more pending elements to output now.
6504 If ALL is 1, we output space as necessary so that
6505 we can output all the pending elements. */
6508 output_pending_init_elements (int all)
6510 struct init_node *elt = constructor_pending_elts;
6515 /* Look through the whole pending tree.
6516 If we find an element that should be output now,
6517 output it. Otherwise, set NEXT to the element
6518 that comes first among those still pending. */
6523 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6525 if (tree_int_cst_equal (elt->purpose,
6526 constructor_unfilled_index))
6527 output_init_element (elt->value, true,
6528 TREE_TYPE (constructor_type),
6529 constructor_unfilled_index, 0, false);
6530 else if (tree_int_cst_lt (constructor_unfilled_index,
6533 /* Advance to the next smaller node. */
6538 /* We have reached the smallest node bigger than the
6539 current unfilled index. Fill the space first. */
6540 next = elt->purpose;
6546 /* Advance to the next bigger node. */
6551 /* We have reached the biggest node in a subtree. Find
6552 the parent of it, which is the next bigger node. */
6553 while (elt->parent && elt->parent->right == elt)
6556 if (elt && tree_int_cst_lt (constructor_unfilled_index,
6559 next = elt->purpose;
6565 else if (TREE_CODE (constructor_type) == RECORD_TYPE
6566 || TREE_CODE (constructor_type) == UNION_TYPE)
6568 tree ctor_unfilled_bitpos, elt_bitpos;
6570 /* If the current record is complete we are done. */
6571 if (constructor_unfilled_fields == 0)
6574 ctor_unfilled_bitpos = bit_position (constructor_unfilled_fields);
6575 elt_bitpos = bit_position (elt->purpose);
6576 /* We can't compare fields here because there might be empty
6577 fields in between. */
6578 if (tree_int_cst_equal (elt_bitpos, ctor_unfilled_bitpos))
6580 constructor_unfilled_fields = elt->purpose;
6581 output_init_element (elt->value, true, TREE_TYPE (elt->purpose),
6582 elt->purpose, 0, false);
6584 else if (tree_int_cst_lt (ctor_unfilled_bitpos, elt_bitpos))
6586 /* Advance to the next smaller node. */
6591 /* We have reached the smallest node bigger than the
6592 current unfilled field. Fill the space first. */
6593 next = elt->purpose;
6599 /* Advance to the next bigger node. */
6604 /* We have reached the biggest node in a subtree. Find
6605 the parent of it, which is the next bigger node. */
6606 while (elt->parent && elt->parent->right == elt)
6610 && (tree_int_cst_lt (ctor_unfilled_bitpos,
6611 bit_position (elt->purpose))))
6613 next = elt->purpose;
6621 /* Ordinarily return, but not if we want to output all
6622 and there are elements left. */
6623 if (!(all && next != 0))
6626 /* If it's not incremental, just skip over the gap, so that after
6627 jumping to retry we will output the next successive element. */
6628 if (TREE_CODE (constructor_type) == RECORD_TYPE
6629 || TREE_CODE (constructor_type) == UNION_TYPE)
6630 constructor_unfilled_fields = next;
6631 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6632 constructor_unfilled_index = next;
6634 /* ELT now points to the node in the pending tree with the next
6635 initializer to output. */
6639 /* Add one non-braced element to the current constructor level.
6640 This adjusts the current position within the constructor's type.
6641 This may also start or terminate implicit levels
6642 to handle a partly-braced initializer.
6644 Once this has found the correct level for the new element,
6645 it calls output_init_element.
6647 IMPLICIT is true if value comes from pop_init_level (1),
6648 the new initializer has been merged with the existing one
6649 and thus no warnings should be emitted about overriding an
6650 existing initializer. */
6653 process_init_element (struct c_expr value, bool implicit)
6655 tree orig_value = value.value;
6656 int string_flag = orig_value != 0 && TREE_CODE (orig_value) == STRING_CST;
6657 bool strict_string = value.original_code == STRING_CST;
6659 designator_depth = 0;
6660 designator_erroneous = 0;
6662 /* Handle superfluous braces around string cst as in
6663 char x[] = {"foo"}; */
6666 && TREE_CODE (constructor_type) == ARRAY_TYPE
6667 && INTEGRAL_TYPE_P (TREE_TYPE (constructor_type))
6668 && integer_zerop (constructor_unfilled_index))
6670 if (constructor_stack->replacement_value.value)
6671 error_init ("excess elements in char array initializer");
6672 constructor_stack->replacement_value = value;
6676 if (constructor_stack->replacement_value.value != 0)
6678 error_init ("excess elements in struct initializer");
6682 /* Ignore elements of a brace group if it is entirely superfluous
6683 and has already been diagnosed. */
6684 if (constructor_type == 0)
6687 /* If we've exhausted any levels that didn't have braces,
6689 while (constructor_stack->implicit)
6691 if ((TREE_CODE (constructor_type) == RECORD_TYPE
6692 || TREE_CODE (constructor_type) == UNION_TYPE)
6693 && constructor_fields == 0)
6694 process_init_element (pop_init_level (1), true);
6695 else if (TREE_CODE (constructor_type) == ARRAY_TYPE
6696 && (constructor_max_index == 0
6697 || tree_int_cst_lt (constructor_max_index,
6698 constructor_index)))
6699 process_init_element (pop_init_level (1), true);
6704 /* In the case of [LO ... HI] = VALUE, only evaluate VALUE once. */
6705 if (constructor_range_stack)
6707 /* If value is a compound literal and we'll be just using its
6708 content, don't put it into a SAVE_EXPR. */
6709 if (TREE_CODE (value.value) != COMPOUND_LITERAL_EXPR
6710 || !require_constant_value
6712 value.value = save_expr (value.value);
6717 if (TREE_CODE (constructor_type) == RECORD_TYPE)
6720 enum tree_code fieldcode;
6722 if (constructor_fields == 0)
6724 pedwarn_init (input_location, 0,
6725 "excess elements in struct initializer");
6729 fieldtype = TREE_TYPE (constructor_fields);
6730 if (fieldtype != error_mark_node)
6731 fieldtype = TYPE_MAIN_VARIANT (fieldtype);
6732 fieldcode = TREE_CODE (fieldtype);
6734 /* Error for non-static initialization of a flexible array member. */
6735 if (fieldcode == ARRAY_TYPE
6736 && !require_constant_value
6737 && TYPE_SIZE (fieldtype) == NULL_TREE
6738 && TREE_CHAIN (constructor_fields) == NULL_TREE)
6740 error_init ("non-static initialization of a flexible array member");
6744 /* Accept a string constant to initialize a subarray. */
6745 if (value.value != 0
6746 && fieldcode == ARRAY_TYPE
6747 && INTEGRAL_TYPE_P (TREE_TYPE (fieldtype))
6749 value.value = orig_value;
6750 /* Otherwise, if we have come to a subaggregate,
6751 and we don't have an element of its type, push into it. */
6752 else if (value.value != 0
6753 && value.value != error_mark_node
6754 && TYPE_MAIN_VARIANT (TREE_TYPE (value.value)) != fieldtype
6755 && (fieldcode == RECORD_TYPE || fieldcode == ARRAY_TYPE
6756 || fieldcode == UNION_TYPE))
6758 push_init_level (1);
6764 push_member_name (constructor_fields);
6765 output_init_element (value.value, strict_string,
6766 fieldtype, constructor_fields, 1, implicit);
6767 RESTORE_SPELLING_DEPTH (constructor_depth);
6770 /* Do the bookkeeping for an element that was
6771 directly output as a constructor. */
6773 /* For a record, keep track of end position of last field. */
6774 if (DECL_SIZE (constructor_fields))
6775 constructor_bit_index
6776 = size_binop (PLUS_EXPR,
6777 bit_position (constructor_fields),
6778 DECL_SIZE (constructor_fields));
6780 /* If the current field was the first one not yet written out,
6781 it isn't now, so update. */
6782 if (constructor_unfilled_fields == constructor_fields)
6784 constructor_unfilled_fields = TREE_CHAIN (constructor_fields);
6785 /* Skip any nameless bit fields. */
6786 while (constructor_unfilled_fields != 0
6787 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
6788 && DECL_NAME (constructor_unfilled_fields) == 0)
6789 constructor_unfilled_fields =
6790 TREE_CHAIN (constructor_unfilled_fields);
6794 constructor_fields = TREE_CHAIN (constructor_fields);
6795 /* Skip any nameless bit fields at the beginning. */
6796 while (constructor_fields != 0
6797 && DECL_C_BIT_FIELD (constructor_fields)
6798 && DECL_NAME (constructor_fields) == 0)
6799 constructor_fields = TREE_CHAIN (constructor_fields);
6801 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6804 enum tree_code fieldcode;
6806 if (constructor_fields == 0)
6808 pedwarn_init (input_location, 0,
6809 "excess elements in union initializer");
6813 fieldtype = TREE_TYPE (constructor_fields);
6814 if (fieldtype != error_mark_node)
6815 fieldtype = TYPE_MAIN_VARIANT (fieldtype);
6816 fieldcode = TREE_CODE (fieldtype);
6818 /* Warn that traditional C rejects initialization of unions.
6819 We skip the warning if the value is zero. This is done
6820 under the assumption that the zero initializer in user
6821 code appears conditioned on e.g. __STDC__ to avoid
6822 "missing initializer" warnings and relies on default
6823 initialization to zero in the traditional C case.
6824 We also skip the warning if the initializer is designated,
6825 again on the assumption that this must be conditional on
6826 __STDC__ anyway (and we've already complained about the
6827 member-designator already). */
6828 if (!in_system_header && !constructor_designated
6829 && !(value.value && (integer_zerop (value.value)
6830 || real_zerop (value.value))))
6831 warning (OPT_Wtraditional, "traditional C rejects initialization "
6834 /* Accept a string constant to initialize a subarray. */
6835 if (value.value != 0
6836 && fieldcode == ARRAY_TYPE
6837 && INTEGRAL_TYPE_P (TREE_TYPE (fieldtype))
6839 value.value = orig_value;
6840 /* Otherwise, if we have come to a subaggregate,
6841 and we don't have an element of its type, push into it. */
6842 else if (value.value != 0
6843 && value.value != error_mark_node
6844 && TYPE_MAIN_VARIANT (TREE_TYPE (value.value)) != fieldtype
6845 && (fieldcode == RECORD_TYPE || fieldcode == ARRAY_TYPE
6846 || fieldcode == UNION_TYPE))
6848 push_init_level (1);
6854 push_member_name (constructor_fields);
6855 output_init_element (value.value, strict_string,
6856 fieldtype, constructor_fields, 1, implicit);
6857 RESTORE_SPELLING_DEPTH (constructor_depth);
6860 /* Do the bookkeeping for an element that was
6861 directly output as a constructor. */
6863 constructor_bit_index = DECL_SIZE (constructor_fields);
6864 constructor_unfilled_fields = TREE_CHAIN (constructor_fields);
6867 constructor_fields = 0;
6869 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6871 tree elttype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
6872 enum tree_code eltcode = TREE_CODE (elttype);
6874 /* Accept a string constant to initialize a subarray. */
6875 if (value.value != 0
6876 && eltcode == ARRAY_TYPE
6877 && INTEGRAL_TYPE_P (TREE_TYPE (elttype))
6879 value.value = orig_value;
6880 /* Otherwise, if we have come to a subaggregate,
6881 and we don't have an element of its type, push into it. */
6882 else if (value.value != 0
6883 && value.value != error_mark_node
6884 && TYPE_MAIN_VARIANT (TREE_TYPE (value.value)) != elttype
6885 && (eltcode == RECORD_TYPE || eltcode == ARRAY_TYPE
6886 || eltcode == UNION_TYPE))
6888 push_init_level (1);
6892 if (constructor_max_index != 0
6893 && (tree_int_cst_lt (constructor_max_index, constructor_index)
6894 || integer_all_onesp (constructor_max_index)))
6896 pedwarn_init (input_location, 0,
6897 "excess elements in array initializer");
6901 /* Now output the actual element. */
6904 push_array_bounds (tree_low_cst (constructor_index, 1));
6905 output_init_element (value.value, strict_string,
6906 elttype, constructor_index, 1, implicit);
6907 RESTORE_SPELLING_DEPTH (constructor_depth);
6911 = size_binop (PLUS_EXPR, constructor_index, bitsize_one_node);
6914 /* If we are doing the bookkeeping for an element that was
6915 directly output as a constructor, we must update
6916 constructor_unfilled_index. */
6917 constructor_unfilled_index = constructor_index;
6919 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
6921 tree elttype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
6923 /* Do a basic check of initializer size. Note that vectors
6924 always have a fixed size derived from their type. */
6925 if (tree_int_cst_lt (constructor_max_index, constructor_index))
6927 pedwarn_init (input_location, 0,
6928 "excess elements in vector initializer");
6932 /* Now output the actual element. */
6934 output_init_element (value.value, strict_string,
6935 elttype, constructor_index, 1, implicit);
6938 = size_binop (PLUS_EXPR, constructor_index, bitsize_one_node);
6941 /* If we are doing the bookkeeping for an element that was
6942 directly output as a constructor, we must update
6943 constructor_unfilled_index. */
6944 constructor_unfilled_index = constructor_index;
6947 /* Handle the sole element allowed in a braced initializer
6948 for a scalar variable. */
6949 else if (constructor_type != error_mark_node
6950 && constructor_fields == 0)
6952 pedwarn_init (input_location, 0,
6953 "excess elements in scalar initializer");
6959 output_init_element (value.value, strict_string,
6960 constructor_type, NULL_TREE, 1, implicit);
6961 constructor_fields = 0;
6964 /* Handle range initializers either at this level or anywhere higher
6965 in the designator stack. */
6966 if (constructor_range_stack)
6968 struct constructor_range_stack *p, *range_stack;
6971 range_stack = constructor_range_stack;
6972 constructor_range_stack = 0;
6973 while (constructor_stack != range_stack->stack)
6975 gcc_assert (constructor_stack->implicit);
6976 process_init_element (pop_init_level (1), true);
6978 for (p = range_stack;
6979 !p->range_end || tree_int_cst_equal (p->index, p->range_end);
6982 gcc_assert (constructor_stack->implicit);
6983 process_init_element (pop_init_level (1), true);
6986 p->index = size_binop (PLUS_EXPR, p->index, bitsize_one_node);
6987 if (tree_int_cst_equal (p->index, p->range_end) && !p->prev)
6992 constructor_index = p->index;
6993 constructor_fields = p->fields;
6994 if (finish && p->range_end && p->index == p->range_start)
7002 push_init_level (2);
7003 p->stack = constructor_stack;
7004 if (p->range_end && tree_int_cst_equal (p->index, p->range_end))
7005 p->index = p->range_start;
7009 constructor_range_stack = range_stack;
7016 constructor_range_stack = 0;
7019 /* Build a complete asm-statement, whose components are a CV_QUALIFIER
7020 (guaranteed to be 'volatile' or null) and ARGS (represented using
7021 an ASM_EXPR node). */
7023 build_asm_stmt (tree cv_qualifier, tree args)
7025 if (!ASM_VOLATILE_P (args) && cv_qualifier)
7026 ASM_VOLATILE_P (args) = 1;
7027 return add_stmt (args);
7030 /* Build an asm-expr, whose components are a STRING, some OUTPUTS,
7031 some INPUTS, and some CLOBBERS. The latter three may be NULL.
7032 SIMPLE indicates whether there was anything at all after the
7033 string in the asm expression -- asm("blah") and asm("blah" : )
7034 are subtly different. We use a ASM_EXPR node to represent this. */
7036 build_asm_expr (tree string, tree outputs, tree inputs, tree clobbers,
7042 const char *constraint;
7043 const char **oconstraints;
7044 bool allows_mem, allows_reg, is_inout;
7045 int ninputs, noutputs;
7047 ninputs = list_length (inputs);
7048 noutputs = list_length (outputs);
7049 oconstraints = (const char **) alloca (noutputs * sizeof (const char *));
7051 string = resolve_asm_operand_names (string, outputs, inputs);
7053 /* Remove output conversions that change the type but not the mode. */
7054 for (i = 0, tail = outputs; tail; ++i, tail = TREE_CHAIN (tail))
7056 tree output = TREE_VALUE (tail);
7058 /* ??? Really, this should not be here. Users should be using a
7059 proper lvalue, dammit. But there's a long history of using casts
7060 in the output operands. In cases like longlong.h, this becomes a
7061 primitive form of typechecking -- if the cast can be removed, then
7062 the output operand had a type of the proper width; otherwise we'll
7063 get an error. Gross, but ... */
7064 STRIP_NOPS (output);
7066 if (!lvalue_or_else (output, lv_asm))
7067 output = error_mark_node;
7069 if (output != error_mark_node
7070 && (TREE_READONLY (output)
7071 || TYPE_READONLY (TREE_TYPE (output))
7072 || ((TREE_CODE (TREE_TYPE (output)) == RECORD_TYPE
7073 || TREE_CODE (TREE_TYPE (output)) == UNION_TYPE)
7074 && C_TYPE_FIELDS_READONLY (TREE_TYPE (output)))))
7075 readonly_error (output, lv_asm);
7077 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
7078 oconstraints[i] = constraint;
7080 if (parse_output_constraint (&constraint, i, ninputs, noutputs,
7081 &allows_mem, &allows_reg, &is_inout))
7083 /* If the operand is going to end up in memory,
7084 mark it addressable. */
7085 if (!allows_reg && !c_mark_addressable (output))
7086 output = error_mark_node;
7089 output = error_mark_node;
7091 TREE_VALUE (tail) = output;
7094 for (i = 0, tail = inputs; tail; ++i, tail = TREE_CHAIN (tail))
7098 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
7099 input = TREE_VALUE (tail);
7101 if (parse_input_constraint (&constraint, i, ninputs, noutputs, 0,
7102 oconstraints, &allows_mem, &allows_reg))
7104 /* If the operand is going to end up in memory,
7105 mark it addressable. */
7106 if (!allows_reg && allows_mem)
7108 /* Strip the nops as we allow this case. FIXME, this really
7109 should be rejected or made deprecated. */
7111 if (!c_mark_addressable (input))
7112 input = error_mark_node;
7116 input = error_mark_node;
7118 TREE_VALUE (tail) = input;
7121 args = build_stmt (ASM_EXPR, string, outputs, inputs, clobbers);
7123 /* asm statements without outputs, including simple ones, are treated
7125 ASM_INPUT_P (args) = simple;
7126 ASM_VOLATILE_P (args) = (noutputs == 0);
7131 /* Generate a goto statement to LABEL. */
7134 c_finish_goto_label (tree label)
7136 tree decl = lookup_label (label);
7140 if (C_DECL_UNJUMPABLE_STMT_EXPR (decl))
7142 error ("jump into statement expression");
7146 if (C_DECL_UNJUMPABLE_VM (decl))
7148 error ("jump into scope of identifier with variably modified type");
7152 if (!C_DECL_UNDEFINABLE_STMT_EXPR (decl))
7154 /* No jump from outside this statement expression context, so
7155 record that there is a jump from within this context. */
7156 struct c_label_list *nlist;
7157 nlist = XOBNEW (&parser_obstack, struct c_label_list);
7158 nlist->next = label_context_stack_se->labels_used;
7159 nlist->label = decl;
7160 label_context_stack_se->labels_used = nlist;
7163 if (!C_DECL_UNDEFINABLE_VM (decl))
7165 /* No jump from outside this context context of identifiers with
7166 variably modified type, so record that there is a jump from
7167 within this context. */
7168 struct c_label_list *nlist;
7169 nlist = XOBNEW (&parser_obstack, struct c_label_list);
7170 nlist->next = label_context_stack_vm->labels_used;
7171 nlist->label = decl;
7172 label_context_stack_vm->labels_used = nlist;
7175 TREE_USED (decl) = 1;
7176 return add_stmt (build1 (GOTO_EXPR, void_type_node, decl));
7179 /* Generate a computed goto statement to EXPR. */
7182 c_finish_goto_ptr (tree expr)
7184 pedwarn (input_location, OPT_pedantic, "ISO C forbids %<goto *expr;%>");
7185 expr = convert (ptr_type_node, expr);
7186 return add_stmt (build1 (GOTO_EXPR, void_type_node, expr));
7189 /* Generate a C `return' statement. RETVAL is the expression for what
7190 to return, or a null pointer for `return;' with no value. */
7193 c_finish_return (tree retval)
7195 tree valtype = TREE_TYPE (TREE_TYPE (current_function_decl)), ret_stmt;
7196 bool no_warning = false;
7198 if (TREE_THIS_VOLATILE (current_function_decl))
7199 warning (0, "function declared %<noreturn%> has a %<return%> statement");
7203 current_function_returns_null = 1;
7204 if ((warn_return_type || flag_isoc99)
7205 && valtype != 0 && TREE_CODE (valtype) != VOID_TYPE)
7207 pedwarn_c99 (input_location, flag_isoc99 ? 0 : OPT_Wreturn_type,
7208 "%<return%> with no value, in "
7209 "function returning non-void");
7213 else if (valtype == 0 || TREE_CODE (valtype) == VOID_TYPE)
7215 current_function_returns_null = 1;
7216 if (TREE_CODE (TREE_TYPE (retval)) != VOID_TYPE)
7217 pedwarn (input_location, 0,
7218 "%<return%> with a value, in function returning void");
7220 pedwarn (input_location, OPT_pedantic, "ISO C forbids "
7221 "%<return%> with expression, in function returning void");
7225 tree t = convert_for_assignment (valtype, retval, ic_return,
7226 NULL_TREE, NULL_TREE, 0);
7227 tree res = DECL_RESULT (current_function_decl);
7230 current_function_returns_value = 1;
7231 if (t == error_mark_node)
7234 inner = t = convert (TREE_TYPE (res), t);
7236 /* Strip any conversions, additions, and subtractions, and see if
7237 we are returning the address of a local variable. Warn if so. */
7240 switch (TREE_CODE (inner))
7243 case NON_LVALUE_EXPR:
7245 case POINTER_PLUS_EXPR:
7246 inner = TREE_OPERAND (inner, 0);
7250 /* If the second operand of the MINUS_EXPR has a pointer
7251 type (or is converted from it), this may be valid, so
7252 don't give a warning. */
7254 tree op1 = TREE_OPERAND (inner, 1);
7256 while (!POINTER_TYPE_P (TREE_TYPE (op1))
7257 && (CONVERT_EXPR_P (op1)
7258 || TREE_CODE (op1) == NON_LVALUE_EXPR))
7259 op1 = TREE_OPERAND (op1, 0);
7261 if (POINTER_TYPE_P (TREE_TYPE (op1)))
7264 inner = TREE_OPERAND (inner, 0);
7269 inner = TREE_OPERAND (inner, 0);
7271 while (REFERENCE_CLASS_P (inner)
7272 && TREE_CODE (inner) != INDIRECT_REF)
7273 inner = TREE_OPERAND (inner, 0);
7276 && !DECL_EXTERNAL (inner)
7277 && !TREE_STATIC (inner)
7278 && DECL_CONTEXT (inner) == current_function_decl)
7279 warning (0, "function returns address of local variable");
7289 retval = build2 (MODIFY_EXPR, TREE_TYPE (res), res, t);
7291 if (warn_sequence_point)
7292 verify_sequence_points (retval);
7295 ret_stmt = build_stmt (RETURN_EXPR, retval);
7296 TREE_NO_WARNING (ret_stmt) |= no_warning;
7297 return add_stmt (ret_stmt);
7301 /* The SWITCH_EXPR being built. */
7304 /* The original type of the testing expression, i.e. before the
7305 default conversion is applied. */
7308 /* A splay-tree mapping the low element of a case range to the high
7309 element, or NULL_TREE if there is no high element. Used to
7310 determine whether or not a new case label duplicates an old case
7311 label. We need a tree, rather than simply a hash table, because
7312 of the GNU case range extension. */
7315 /* Number of nested statement expressions within this switch
7316 statement; if nonzero, case and default labels may not
7318 unsigned int blocked_stmt_expr;
7320 /* Scope of outermost declarations of identifiers with variably
7321 modified type within this switch statement; if nonzero, case and
7322 default labels may not appear. */
7323 unsigned int blocked_vm;
7325 /* The next node on the stack. */
7326 struct c_switch *next;
7329 /* A stack of the currently active switch statements. The innermost
7330 switch statement is on the top of the stack. There is no need to
7331 mark the stack for garbage collection because it is only active
7332 during the processing of the body of a function, and we never
7333 collect at that point. */
7335 struct c_switch *c_switch_stack;
7337 /* Start a C switch statement, testing expression EXP. Return the new
7341 c_start_case (tree exp)
7343 tree orig_type = error_mark_node;
7344 struct c_switch *cs;
7346 if (exp != error_mark_node)
7348 orig_type = TREE_TYPE (exp);
7350 if (!INTEGRAL_TYPE_P (orig_type))
7352 if (orig_type != error_mark_node)
7354 error ("switch quantity not an integer");
7355 orig_type = error_mark_node;
7357 exp = integer_zero_node;
7361 tree type = TYPE_MAIN_VARIANT (orig_type);
7363 if (!in_system_header
7364 && (type == long_integer_type_node
7365 || type == long_unsigned_type_node))
7366 warning (OPT_Wtraditional, "%<long%> switch expression not "
7367 "converted to %<int%> in ISO C");
7369 exp = default_conversion (exp);
7371 if (warn_sequence_point)
7372 verify_sequence_points (exp);
7376 /* Add this new SWITCH_EXPR to the stack. */
7377 cs = XNEW (struct c_switch);
7378 cs->switch_expr = build3 (SWITCH_EXPR, orig_type, exp, NULL_TREE, NULL_TREE);
7379 cs->orig_type = orig_type;
7380 cs->cases = splay_tree_new (case_compare, NULL, NULL);
7381 cs->blocked_stmt_expr = 0;
7383 cs->next = c_switch_stack;
7384 c_switch_stack = cs;
7386 return add_stmt (cs->switch_expr);
7389 /* Process a case label. */
7392 do_case (tree low_value, tree high_value)
7394 tree label = NULL_TREE;
7396 if (c_switch_stack && !c_switch_stack->blocked_stmt_expr
7397 && !c_switch_stack->blocked_vm)
7399 label = c_add_case_label (c_switch_stack->cases,
7400 SWITCH_COND (c_switch_stack->switch_expr),
7401 c_switch_stack->orig_type,
7402 low_value, high_value);
7403 if (label == error_mark_node)
7406 else if (c_switch_stack && c_switch_stack->blocked_stmt_expr)
7409 error ("case label in statement expression not containing "
7410 "enclosing switch statement");
7412 error ("%<default%> label in statement expression not containing "
7413 "enclosing switch statement");
7415 else if (c_switch_stack && c_switch_stack->blocked_vm)
7418 error ("case label in scope of identifier with variably modified "
7419 "type not containing enclosing switch statement");
7421 error ("%<default%> label in scope of identifier with variably "
7422 "modified type not containing enclosing switch statement");
7425 error ("case label not within a switch statement");
7427 error ("%<default%> label not within a switch statement");
7432 /* Finish the switch statement. */
7435 c_finish_case (tree body)
7437 struct c_switch *cs = c_switch_stack;
7438 location_t switch_location;
7440 SWITCH_BODY (cs->switch_expr) = body;
7442 /* We must not be within a statement expression nested in the switch
7443 at this point; we might, however, be within the scope of an
7444 identifier with variably modified type nested in the switch. */
7445 gcc_assert (!cs->blocked_stmt_expr);
7447 /* Emit warnings as needed. */
7448 if (EXPR_HAS_LOCATION (cs->switch_expr))
7449 switch_location = EXPR_LOCATION (cs->switch_expr);
7451 switch_location = input_location;
7452 c_do_switch_warnings (cs->cases, switch_location,
7453 TREE_TYPE (cs->switch_expr),
7454 SWITCH_COND (cs->switch_expr));
7456 /* Pop the stack. */
7457 c_switch_stack = cs->next;
7458 splay_tree_delete (cs->cases);
7462 /* Emit an if statement. IF_LOCUS is the location of the 'if'. COND,
7463 THEN_BLOCK and ELSE_BLOCK are expressions to be used; ELSE_BLOCK
7464 may be null. NESTED_IF is true if THEN_BLOCK contains another IF
7465 statement, and was not surrounded with parenthesis. */
7468 c_finish_if_stmt (location_t if_locus, tree cond, tree then_block,
7469 tree else_block, bool nested_if)
7473 /* Diagnose an ambiguous else if if-then-else is nested inside if-then. */
7474 if (warn_parentheses && nested_if && else_block == NULL)
7476 tree inner_if = then_block;
7478 /* We know from the grammar productions that there is an IF nested
7479 within THEN_BLOCK. Due to labels and c99 conditional declarations,
7480 it might not be exactly THEN_BLOCK, but should be the last
7481 non-container statement within. */
7483 switch (TREE_CODE (inner_if))
7488 inner_if = BIND_EXPR_BODY (inner_if);
7490 case STATEMENT_LIST:
7491 inner_if = expr_last (then_block);
7493 case TRY_FINALLY_EXPR:
7494 case TRY_CATCH_EXPR:
7495 inner_if = TREE_OPERAND (inner_if, 0);
7502 if (COND_EXPR_ELSE (inner_if))
7503 warning (OPT_Wparentheses,
7504 "%Hsuggest explicit braces to avoid ambiguous %<else%>",
7508 stmt = build3 (COND_EXPR, void_type_node, cond, then_block, else_block);
7509 SET_EXPR_LOCATION (stmt, if_locus);
7513 /* Emit a general-purpose loop construct. START_LOCUS is the location of
7514 the beginning of the loop. COND is the loop condition. COND_IS_FIRST
7515 is false for DO loops. INCR is the FOR increment expression. BODY is
7516 the statement controlled by the loop. BLAB is the break label. CLAB is
7517 the continue label. Everything is allowed to be NULL. */
7520 c_finish_loop (location_t start_locus, tree cond, tree incr, tree body,
7521 tree blab, tree clab, bool cond_is_first)
7523 tree entry = NULL, exit = NULL, t;
7525 /* If the condition is zero don't generate a loop construct. */
7526 if (cond && integer_zerop (cond))
7530 t = build_and_jump (&blab);
7531 SET_EXPR_LOCATION (t, start_locus);
7537 tree top = build1 (LABEL_EXPR, void_type_node, NULL_TREE);
7539 /* If we have an exit condition, then we build an IF with gotos either
7540 out of the loop, or to the top of it. If there's no exit condition,
7541 then we just build a jump back to the top. */
7542 exit = build_and_jump (&LABEL_EXPR_LABEL (top));
7544 if (cond && !integer_nonzerop (cond))
7546 /* Canonicalize the loop condition to the end. This means
7547 generating a branch to the loop condition. Reuse the
7548 continue label, if possible. */
7553 entry = build1 (LABEL_EXPR, void_type_node, NULL_TREE);
7554 t = build_and_jump (&LABEL_EXPR_LABEL (entry));
7557 t = build1 (GOTO_EXPR, void_type_node, clab);
7558 SET_EXPR_LOCATION (t, start_locus);
7562 t = build_and_jump (&blab);
7563 exit = fold_build3 (COND_EXPR, void_type_node, cond, exit, t);
7565 SET_EXPR_LOCATION (exit, start_locus);
7567 SET_EXPR_LOCATION (exit, input_location);
7576 add_stmt (build1 (LABEL_EXPR, void_type_node, clab));
7584 add_stmt (build1 (LABEL_EXPR, void_type_node, blab));
7588 c_finish_bc_stmt (tree *label_p, bool is_break)
7591 tree label = *label_p;
7593 /* In switch statements break is sometimes stylistically used after
7594 a return statement. This can lead to spurious warnings about
7595 control reaching the end of a non-void function when it is
7596 inlined. Note that we are calling block_may_fallthru with
7597 language specific tree nodes; this works because
7598 block_may_fallthru returns true when given something it does not
7600 skip = !block_may_fallthru (cur_stmt_list);
7605 *label_p = label = create_artificial_label ();
7607 else if (TREE_CODE (label) == LABEL_DECL)
7609 else switch (TREE_INT_CST_LOW (label))
7613 error ("break statement not within loop or switch");
7615 error ("continue statement not within a loop");
7619 gcc_assert (is_break);
7620 error ("break statement used with OpenMP for loop");
7631 add_stmt (build_predict_expr (PRED_CONTINUE, NOT_TAKEN));
7633 return add_stmt (build1 (GOTO_EXPR, void_type_node, label));
7636 /* A helper routine for c_process_expr_stmt and c_finish_stmt_expr. */
7639 emit_side_effect_warnings (tree expr)
7641 if (expr == error_mark_node)
7643 else if (!TREE_SIDE_EFFECTS (expr))
7645 if (!VOID_TYPE_P (TREE_TYPE (expr)) && !TREE_NO_WARNING (expr))
7646 warning (OPT_Wunused_value, "%Hstatement with no effect",
7647 EXPR_HAS_LOCATION (expr) ? EXPR_LOCUS (expr) : &input_location);
7650 warn_if_unused_value (expr, input_location);
7653 /* Process an expression as if it were a complete statement. Emit
7654 diagnostics, but do not call ADD_STMT. */
7657 c_process_expr_stmt (tree expr)
7662 if (warn_sequence_point)
7663 verify_sequence_points (expr);
7665 if (TREE_TYPE (expr) != error_mark_node
7666 && !COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (expr))
7667 && TREE_CODE (TREE_TYPE (expr)) != ARRAY_TYPE)
7668 error ("expression statement has incomplete type");
7670 /* If we're not processing a statement expression, warn about unused values.
7671 Warnings for statement expressions will be emitted later, once we figure
7672 out which is the result. */
7673 if (!STATEMENT_LIST_STMT_EXPR (cur_stmt_list)
7674 && warn_unused_value)
7675 emit_side_effect_warnings (expr);
7677 /* If the expression is not of a type to which we cannot assign a line
7678 number, wrap the thing in a no-op NOP_EXPR. */
7679 if (DECL_P (expr) || CONSTANT_CLASS_P (expr))
7680 expr = build1 (NOP_EXPR, TREE_TYPE (expr), expr);
7682 if (CAN_HAVE_LOCATION_P (expr))
7683 SET_EXPR_LOCATION (expr, input_location);
7688 /* Emit an expression as a statement. */
7691 c_finish_expr_stmt (tree expr)
7694 return add_stmt (c_process_expr_stmt (expr));
7699 /* Do the opposite and emit a statement as an expression. To begin,
7700 create a new binding level and return it. */
7703 c_begin_stmt_expr (void)
7706 struct c_label_context_se *nstack;
7707 struct c_label_list *glist;
7709 /* We must force a BLOCK for this level so that, if it is not expanded
7710 later, there is a way to turn off the entire subtree of blocks that
7711 are contained in it. */
7713 ret = c_begin_compound_stmt (true);
7716 c_switch_stack->blocked_stmt_expr++;
7717 gcc_assert (c_switch_stack->blocked_stmt_expr != 0);
7719 for (glist = label_context_stack_se->labels_used;
7721 glist = glist->next)
7723 C_DECL_UNDEFINABLE_STMT_EXPR (glist->label) = 1;
7725 nstack = XOBNEW (&parser_obstack, struct c_label_context_se);
7726 nstack->labels_def = NULL;
7727 nstack->labels_used = NULL;
7728 nstack->next = label_context_stack_se;
7729 label_context_stack_se = nstack;
7731 /* Mark the current statement list as belonging to a statement list. */
7732 STATEMENT_LIST_STMT_EXPR (ret) = 1;
7738 c_finish_stmt_expr (tree body)
7740 tree last, type, tmp, val;
7742 struct c_label_list *dlist, *glist, *glist_prev = NULL;
7744 body = c_end_compound_stmt (body, true);
7747 gcc_assert (c_switch_stack->blocked_stmt_expr != 0);
7748 c_switch_stack->blocked_stmt_expr--;
7750 /* It is no longer possible to jump to labels defined within this
7751 statement expression. */
7752 for (dlist = label_context_stack_se->labels_def;
7754 dlist = dlist->next)
7756 C_DECL_UNJUMPABLE_STMT_EXPR (dlist->label) = 1;
7758 /* It is again possible to define labels with a goto just outside
7759 this statement expression. */
7760 for (glist = label_context_stack_se->next->labels_used;
7762 glist = glist->next)
7764 C_DECL_UNDEFINABLE_STMT_EXPR (glist->label) = 0;
7767 if (glist_prev != NULL)
7768 glist_prev->next = label_context_stack_se->labels_used;
7770 label_context_stack_se->next->labels_used
7771 = label_context_stack_se->labels_used;
7772 label_context_stack_se = label_context_stack_se->next;
7774 /* Locate the last statement in BODY. See c_end_compound_stmt
7775 about always returning a BIND_EXPR. */
7776 last_p = &BIND_EXPR_BODY (body);
7777 last = BIND_EXPR_BODY (body);
7780 if (TREE_CODE (last) == STATEMENT_LIST)
7782 tree_stmt_iterator i;
7784 /* This can happen with degenerate cases like ({ }). No value. */
7785 if (!TREE_SIDE_EFFECTS (last))
7788 /* If we're supposed to generate side effects warnings, process
7789 all of the statements except the last. */
7790 if (warn_unused_value)
7792 for (i = tsi_start (last); !tsi_one_before_end_p (i); tsi_next (&i))
7793 emit_side_effect_warnings (tsi_stmt (i));
7796 i = tsi_last (last);
7797 last_p = tsi_stmt_ptr (i);
7801 /* If the end of the list is exception related, then the list was split
7802 by a call to push_cleanup. Continue searching. */
7803 if (TREE_CODE (last) == TRY_FINALLY_EXPR
7804 || TREE_CODE (last) == TRY_CATCH_EXPR)
7806 last_p = &TREE_OPERAND (last, 0);
7808 goto continue_searching;
7811 /* In the case that the BIND_EXPR is not necessary, return the
7812 expression out from inside it. */
7813 if (last == error_mark_node
7814 || (last == BIND_EXPR_BODY (body)
7815 && BIND_EXPR_VARS (body) == NULL))
7817 /* Do not warn if the return value of a statement expression is
7819 if (CAN_HAVE_LOCATION_P (last))
7820 TREE_NO_WARNING (last) = 1;
7824 /* Extract the type of said expression. */
7825 type = TREE_TYPE (last);
7827 /* If we're not returning a value at all, then the BIND_EXPR that
7828 we already have is a fine expression to return. */
7829 if (!type || VOID_TYPE_P (type))
7832 /* Now that we've located the expression containing the value, it seems
7833 silly to make voidify_wrapper_expr repeat the process. Create a
7834 temporary of the appropriate type and stick it in a TARGET_EXPR. */
7835 tmp = create_tmp_var_raw (type, NULL);
7837 /* Unwrap a no-op NOP_EXPR as added by c_finish_expr_stmt. This avoids
7838 tree_expr_nonnegative_p giving up immediately. */
7840 if (TREE_CODE (val) == NOP_EXPR
7841 && TREE_TYPE (val) == TREE_TYPE (TREE_OPERAND (val, 0)))
7842 val = TREE_OPERAND (val, 0);
7844 *last_p = build2 (MODIFY_EXPR, void_type_node, tmp, val);
7845 SET_EXPR_LOCUS (*last_p, EXPR_LOCUS (last));
7847 return build4 (TARGET_EXPR, type, tmp, body, NULL_TREE, NULL_TREE);
7850 /* Begin the scope of an identifier of variably modified type, scope
7851 number SCOPE. Jumping from outside this scope to inside it is not
7855 c_begin_vm_scope (unsigned int scope)
7857 struct c_label_context_vm *nstack;
7858 struct c_label_list *glist;
7860 gcc_assert (scope > 0);
7862 /* At file_scope, we don't have to do any processing. */
7863 if (label_context_stack_vm == NULL)
7866 if (c_switch_stack && !c_switch_stack->blocked_vm)
7867 c_switch_stack->blocked_vm = scope;
7868 for (glist = label_context_stack_vm->labels_used;
7870 glist = glist->next)
7872 C_DECL_UNDEFINABLE_VM (glist->label) = 1;
7874 nstack = XOBNEW (&parser_obstack, struct c_label_context_vm);
7875 nstack->labels_def = NULL;
7876 nstack->labels_used = NULL;
7877 nstack->scope = scope;
7878 nstack->next = label_context_stack_vm;
7879 label_context_stack_vm = nstack;
7882 /* End a scope which may contain identifiers of variably modified
7883 type, scope number SCOPE. */
7886 c_end_vm_scope (unsigned int scope)
7888 if (label_context_stack_vm == NULL)
7890 if (c_switch_stack && c_switch_stack->blocked_vm == scope)
7891 c_switch_stack->blocked_vm = 0;
7892 /* We may have a number of nested scopes of identifiers with
7893 variably modified type, all at this depth. Pop each in turn. */
7894 while (label_context_stack_vm->scope == scope)
7896 struct c_label_list *dlist, *glist, *glist_prev = NULL;
7898 /* It is no longer possible to jump to labels defined within this
7900 for (dlist = label_context_stack_vm->labels_def;
7902 dlist = dlist->next)
7904 C_DECL_UNJUMPABLE_VM (dlist->label) = 1;
7906 /* It is again possible to define labels with a goto just outside
7908 for (glist = label_context_stack_vm->next->labels_used;
7910 glist = glist->next)
7912 C_DECL_UNDEFINABLE_VM (glist->label) = 0;
7915 if (glist_prev != NULL)
7916 glist_prev->next = label_context_stack_vm->labels_used;
7918 label_context_stack_vm->next->labels_used
7919 = label_context_stack_vm->labels_used;
7920 label_context_stack_vm = label_context_stack_vm->next;
7924 /* Begin and end compound statements. This is as simple as pushing
7925 and popping new statement lists from the tree. */
7928 c_begin_compound_stmt (bool do_scope)
7930 tree stmt = push_stmt_list ();
7937 c_end_compound_stmt (tree stmt, bool do_scope)
7943 if (c_dialect_objc ())
7944 objc_clear_super_receiver ();
7945 block = pop_scope ();
7948 stmt = pop_stmt_list (stmt);
7949 stmt = c_build_bind_expr (block, stmt);
7951 /* If this compound statement is nested immediately inside a statement
7952 expression, then force a BIND_EXPR to be created. Otherwise we'll
7953 do the wrong thing for ({ { 1; } }) or ({ 1; { } }). In particular,
7954 STATEMENT_LISTs merge, and thus we can lose track of what statement
7957 && STATEMENT_LIST_STMT_EXPR (cur_stmt_list)
7958 && TREE_CODE (stmt) != BIND_EXPR)
7960 stmt = build3 (BIND_EXPR, void_type_node, NULL, stmt, NULL);
7961 TREE_SIDE_EFFECTS (stmt) = 1;
7967 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
7968 when the current scope is exited. EH_ONLY is true when this is not
7969 meant to apply to normal control flow transfer. */
7972 push_cleanup (tree ARG_UNUSED (decl), tree cleanup, bool eh_only)
7974 enum tree_code code;
7978 code = eh_only ? TRY_CATCH_EXPR : TRY_FINALLY_EXPR;
7979 stmt = build_stmt (code, NULL, cleanup);
7981 stmt_expr = STATEMENT_LIST_STMT_EXPR (cur_stmt_list);
7982 list = push_stmt_list ();
7983 TREE_OPERAND (stmt, 0) = list;
7984 STATEMENT_LIST_STMT_EXPR (list) = stmt_expr;
7987 /* Build a binary-operation expression without default conversions.
7988 CODE is the kind of expression to build.
7989 LOCATION is the operator's location.
7990 This function differs from `build' in several ways:
7991 the data type of the result is computed and recorded in it,
7992 warnings are generated if arg data types are invalid,
7993 special handling for addition and subtraction of pointers is known,
7994 and some optimization is done (operations on narrow ints
7995 are done in the narrower type when that gives the same result).
7996 Constant folding is also done before the result is returned.
7998 Note that the operands will never have enumeral types, or function
7999 or array types, because either they will have the default conversions
8000 performed or they have both just been converted to some other type in which
8001 the arithmetic is to be done. */
8004 build_binary_op (location_t location, enum tree_code code,
8005 tree orig_op0, tree orig_op1, int convert_p)
8008 enum tree_code code0, code1;
8010 tree ret = error_mark_node;
8011 const char *invalid_op_diag;
8013 /* Expression code to give to the expression when it is built.
8014 Normally this is CODE, which is what the caller asked for,
8015 but in some special cases we change it. */
8016 enum tree_code resultcode = code;
8018 /* Data type in which the computation is to be performed.
8019 In the simplest cases this is the common type of the arguments. */
8020 tree result_type = NULL;
8022 /* Nonzero means operands have already been type-converted
8023 in whatever way is necessary.
8024 Zero means they need to be converted to RESULT_TYPE. */
8027 /* Nonzero means create the expression with this type, rather than
8029 tree build_type = 0;
8031 /* Nonzero means after finally constructing the expression
8032 convert it to this type. */
8033 tree final_type = 0;
8035 /* Nonzero if this is an operation like MIN or MAX which can
8036 safely be computed in short if both args are promoted shorts.
8037 Also implies COMMON.
8038 -1 indicates a bitwise operation; this makes a difference
8039 in the exact conditions for when it is safe to do the operation
8040 in a narrower mode. */
8043 /* Nonzero if this is a comparison operation;
8044 if both args are promoted shorts, compare the original shorts.
8045 Also implies COMMON. */
8046 int short_compare = 0;
8048 /* Nonzero if this is a right-shift operation, which can be computed on the
8049 original short and then promoted if the operand is a promoted short. */
8050 int short_shift = 0;
8052 /* Nonzero means set RESULT_TYPE to the common type of the args. */
8055 /* True means types are compatible as far as ObjC is concerned. */
8058 if (location == UNKNOWN_LOCATION)
8059 location = input_location;
8063 op0 = default_conversion (orig_op0);
8064 op1 = default_conversion (orig_op1);
8072 type0 = TREE_TYPE (op0);
8073 type1 = TREE_TYPE (op1);
8075 /* The expression codes of the data types of the arguments tell us
8076 whether the arguments are integers, floating, pointers, etc. */
8077 code0 = TREE_CODE (type0);
8078 code1 = TREE_CODE (type1);
8080 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
8081 STRIP_TYPE_NOPS (op0);
8082 STRIP_TYPE_NOPS (op1);
8084 /* If an error was already reported for one of the arguments,
8085 avoid reporting another error. */
8087 if (code0 == ERROR_MARK || code1 == ERROR_MARK)
8088 return error_mark_node;
8090 if ((invalid_op_diag
8091 = targetm.invalid_binary_op (code, type0, type1)))
8093 error_at (location, invalid_op_diag);
8094 return error_mark_node;
8097 objc_ok = objc_compare_types (type0, type1, -3, NULL_TREE);
8102 /* Handle the pointer + int case. */
8103 if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
8105 ret = pointer_int_sum (PLUS_EXPR, op0, op1);
8106 goto return_build_binary_op;
8108 else if (code1 == POINTER_TYPE && code0 == INTEGER_TYPE)
8110 ret = pointer_int_sum (PLUS_EXPR, op1, op0);
8111 goto return_build_binary_op;
8118 /* Subtraction of two similar pointers.
8119 We must subtract them as integers, then divide by object size. */
8120 if (code0 == POINTER_TYPE && code1 == POINTER_TYPE
8121 && comp_target_types (type0, type1))
8123 ret = pointer_diff (op0, op1);
8124 goto return_build_binary_op;
8126 /* Handle pointer minus int. Just like pointer plus int. */
8127 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
8129 ret = pointer_int_sum (MINUS_EXPR, op0, op1);
8130 goto return_build_binary_op;
8140 case TRUNC_DIV_EXPR:
8142 case FLOOR_DIV_EXPR:
8143 case ROUND_DIV_EXPR:
8144 case EXACT_DIV_EXPR:
8145 warn_for_div_by_zero (location, op1);
8147 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
8148 || code0 == FIXED_POINT_TYPE
8149 || code0 == COMPLEX_TYPE || code0 == VECTOR_TYPE)
8150 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
8151 || code1 == FIXED_POINT_TYPE
8152 || code1 == COMPLEX_TYPE || code1 == VECTOR_TYPE))
8154 enum tree_code tcode0 = code0, tcode1 = code1;
8156 if (code0 == COMPLEX_TYPE || code0 == VECTOR_TYPE)
8157 tcode0 = TREE_CODE (TREE_TYPE (TREE_TYPE (op0)));
8158 if (code1 == COMPLEX_TYPE || code1 == VECTOR_TYPE)
8159 tcode1 = TREE_CODE (TREE_TYPE (TREE_TYPE (op1)));
8161 if (!((tcode0 == INTEGER_TYPE && tcode1 == INTEGER_TYPE)
8162 || (tcode0 == FIXED_POINT_TYPE && tcode1 == FIXED_POINT_TYPE)))
8163 resultcode = RDIV_EXPR;
8165 /* Although it would be tempting to shorten always here, that
8166 loses on some targets, since the modulo instruction is
8167 undefined if the quotient can't be represented in the
8168 computation mode. We shorten only if unsigned or if
8169 dividing by something we know != -1. */
8170 shorten = (TYPE_UNSIGNED (TREE_TYPE (orig_op0))
8171 || (TREE_CODE (op1) == INTEGER_CST
8172 && !integer_all_onesp (op1)));
8180 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
8182 /* Allow vector types which are not floating point types. */
8183 else if (code0 == VECTOR_TYPE
8184 && code1 == VECTOR_TYPE
8185 && !VECTOR_FLOAT_TYPE_P (type0)
8186 && !VECTOR_FLOAT_TYPE_P (type1))
8190 case TRUNC_MOD_EXPR:
8191 case FLOOR_MOD_EXPR:
8192 warn_for_div_by_zero (location, op1);
8194 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
8196 /* Although it would be tempting to shorten always here, that loses
8197 on some targets, since the modulo instruction is undefined if the
8198 quotient can't be represented in the computation mode. We shorten
8199 only if unsigned or if dividing by something we know != -1. */
8200 shorten = (TYPE_UNSIGNED (TREE_TYPE (orig_op0))
8201 || (TREE_CODE (op1) == INTEGER_CST
8202 && !integer_all_onesp (op1)));
8207 case TRUTH_ANDIF_EXPR:
8208 case TRUTH_ORIF_EXPR:
8209 case TRUTH_AND_EXPR:
8211 case TRUTH_XOR_EXPR:
8212 if ((code0 == INTEGER_TYPE || code0 == POINTER_TYPE
8213 || code0 == REAL_TYPE || code0 == COMPLEX_TYPE
8214 || code0 == FIXED_POINT_TYPE)
8215 && (code1 == INTEGER_TYPE || code1 == POINTER_TYPE
8216 || code1 == REAL_TYPE || code1 == COMPLEX_TYPE
8217 || code1 == FIXED_POINT_TYPE))
8219 /* Result of these operations is always an int,
8220 but that does not mean the operands should be
8221 converted to ints! */
8222 result_type = integer_type_node;
8223 op0 = c_common_truthvalue_conversion (location, op0);
8224 op1 = c_common_truthvalue_conversion (location, op1);
8229 /* Shift operations: result has same type as first operand;
8230 always convert second operand to int.
8231 Also set SHORT_SHIFT if shifting rightward. */
8234 if ((code0 == INTEGER_TYPE || code0 == FIXED_POINT_TYPE)
8235 && code1 == INTEGER_TYPE)
8237 if (TREE_CODE (op1) == INTEGER_CST && skip_evaluation == 0)
8239 if (tree_int_cst_sgn (op1) < 0)
8240 warning (0, "right shift count is negative");
8243 if (!integer_zerop (op1))
8246 if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
8247 warning (0, "right shift count >= width of type");
8251 /* Use the type of the value to be shifted. */
8252 result_type = type0;
8253 /* Convert the shift-count to an integer, regardless of size
8254 of value being shifted. */
8255 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
8256 op1 = convert (integer_type_node, op1);
8257 /* Avoid converting op1 to result_type later. */
8263 if ((code0 == INTEGER_TYPE || code0 == FIXED_POINT_TYPE)
8264 && code1 == INTEGER_TYPE)
8266 if (TREE_CODE (op1) == INTEGER_CST && skip_evaluation == 0)
8268 if (tree_int_cst_sgn (op1) < 0)
8269 warning (0, "left shift count is negative");
8271 else if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
8272 warning (0, "left shift count >= width of type");
8275 /* Use the type of the value to be shifted. */
8276 result_type = type0;
8277 /* Convert the shift-count to an integer, regardless of size
8278 of value being shifted. */
8279 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
8280 op1 = convert (integer_type_node, op1);
8281 /* Avoid converting op1 to result_type later. */
8288 if (FLOAT_TYPE_P (type0) || FLOAT_TYPE_P (type1))
8289 warning_at (location,
8291 "comparing floating point with == or != is unsafe");
8292 /* Result of comparison is always int,
8293 but don't convert the args to int! */
8294 build_type = integer_type_node;
8295 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
8296 || code0 == FIXED_POINT_TYPE || code0 == COMPLEX_TYPE)
8297 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
8298 || code1 == FIXED_POINT_TYPE || code1 == COMPLEX_TYPE))
8300 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
8302 tree tt0 = TREE_TYPE (type0);
8303 tree tt1 = TREE_TYPE (type1);
8304 /* Anything compares with void *. void * compares with anything.
8305 Otherwise, the targets must be compatible
8306 and both must be object or both incomplete. */
8307 if (comp_target_types (type0, type1))
8308 result_type = common_pointer_type (type0, type1);
8309 else if (VOID_TYPE_P (tt0))
8311 /* op0 != orig_op0 detects the case of something
8312 whose value is 0 but which isn't a valid null ptr const. */
8313 if (pedantic && !null_pointer_constant_p (orig_op0)
8314 && TREE_CODE (tt1) == FUNCTION_TYPE)
8315 pedwarn (location, OPT_pedantic, "ISO C forbids "
8316 "comparison of %<void *%> with function pointer");
8318 else if (VOID_TYPE_P (tt1))
8320 if (pedantic && !null_pointer_constant_p (orig_op1)
8321 && TREE_CODE (tt0) == FUNCTION_TYPE)
8322 pedwarn (location, OPT_pedantic, "ISO C forbids "
8323 "comparison of %<void *%> with function pointer");
8326 /* Avoid warning about the volatile ObjC EH puts on decls. */
8328 pedwarn (location, 0,
8329 "comparison of distinct pointer types lacks a cast");
8331 if (result_type == NULL_TREE)
8332 result_type = ptr_type_node;
8334 else if (code0 == POINTER_TYPE && null_pointer_constant_p (orig_op1))
8336 if (TREE_CODE (op0) == ADDR_EXPR
8337 && decl_with_nonnull_addr_p (TREE_OPERAND (op0, 0)))
8338 warning_at (location,
8339 OPT_Waddress, "the address of %qD will never be NULL",
8340 TREE_OPERAND (op0, 0));
8341 result_type = type0;
8343 else if (code1 == POINTER_TYPE && null_pointer_constant_p (orig_op0))
8345 if (TREE_CODE (op1) == ADDR_EXPR
8346 && decl_with_nonnull_addr_p (TREE_OPERAND (op1, 0)))
8347 warning_at (location,
8348 OPT_Waddress, "the address of %qD will never be NULL",
8349 TREE_OPERAND (op1, 0));
8350 result_type = type1;
8352 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
8354 result_type = type0;
8355 pedwarn (location, 0, "comparison between pointer and integer");
8357 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
8359 result_type = type1;
8360 pedwarn (location, 0, "comparison between pointer and integer");
8368 build_type = integer_type_node;
8369 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
8370 || code0 == FIXED_POINT_TYPE)
8371 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
8372 || code1 == FIXED_POINT_TYPE))
8374 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
8376 if (comp_target_types (type0, type1))
8378 result_type = common_pointer_type (type0, type1);
8379 if (!COMPLETE_TYPE_P (TREE_TYPE (type0))
8380 != !COMPLETE_TYPE_P (TREE_TYPE (type1)))
8381 pedwarn (location, 0,
8382 "comparison of complete and incomplete pointers");
8383 else if (TREE_CODE (TREE_TYPE (type0)) == FUNCTION_TYPE)
8384 pedwarn (location, OPT_pedantic, "ISO C forbids "
8385 "ordered comparisons of pointers to functions");
8389 result_type = ptr_type_node;
8390 pedwarn (location, 0,
8391 "comparison of distinct pointer types lacks a cast");
8394 else if (code0 == POINTER_TYPE && null_pointer_constant_p (orig_op1))
8396 result_type = type0;
8398 pedwarn (location, OPT_pedantic,
8399 "ordered comparison of pointer with integer zero");
8400 else if (extra_warnings)
8401 warning_at (location, OPT_Wextra,
8402 "ordered comparison of pointer with integer zero");
8404 else if (code1 == POINTER_TYPE && null_pointer_constant_p (orig_op0))
8406 result_type = type1;
8407 pedwarn (location, OPT_pedantic,
8408 "ordered comparison of pointer with integer zero");
8410 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
8412 result_type = type0;
8413 pedwarn (location, 0, "comparison between pointer and integer");
8415 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
8417 result_type = type1;
8418 pedwarn (location, 0, "comparison between pointer and integer");
8426 if (code0 == ERROR_MARK || code1 == ERROR_MARK)
8427 return error_mark_node;
8429 if (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE
8430 && (!tree_int_cst_equal (TYPE_SIZE (type0), TYPE_SIZE (type1))
8431 || !same_scalar_type_ignoring_signedness (TREE_TYPE (type0),
8432 TREE_TYPE (type1))))
8434 binary_op_error (location, code, type0, type1);
8435 return error_mark_node;
8438 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE || code0 == COMPLEX_TYPE
8439 || code0 == FIXED_POINT_TYPE || code0 == VECTOR_TYPE)
8441 (code1 == INTEGER_TYPE || code1 == REAL_TYPE || code1 == COMPLEX_TYPE
8442 || code1 == FIXED_POINT_TYPE || code1 == VECTOR_TYPE))
8444 int none_complex = (code0 != COMPLEX_TYPE && code1 != COMPLEX_TYPE);
8446 if (shorten || common || short_compare)
8448 result_type = c_common_type (type0, type1);
8449 if (result_type == error_mark_node)
8450 return error_mark_node;
8453 /* For certain operations (which identify themselves by shorten != 0)
8454 if both args were extended from the same smaller type,
8455 do the arithmetic in that type and then extend.
8457 shorten !=0 and !=1 indicates a bitwise operation.
8458 For them, this optimization is safe only if
8459 both args are zero-extended or both are sign-extended.
8460 Otherwise, we might change the result.
8461 Eg, (short)-1 | (unsigned short)-1 is (int)-1
8462 but calculated in (unsigned short) it would be (unsigned short)-1. */
8464 if (shorten && none_complex)
8466 final_type = result_type;
8467 result_type = shorten_binary_op (result_type, op0, op1,
8471 /* Shifts can be shortened if shifting right. */
8476 tree arg0 = get_narrower (op0, &unsigned_arg);
8478 final_type = result_type;
8480 if (arg0 == op0 && final_type == TREE_TYPE (op0))
8481 unsigned_arg = TYPE_UNSIGNED (TREE_TYPE (op0));
8483 if (TYPE_PRECISION (TREE_TYPE (arg0)) < TYPE_PRECISION (result_type)
8484 /* We can shorten only if the shift count is less than the
8485 number of bits in the smaller type size. */
8486 && compare_tree_int (op1, TYPE_PRECISION (TREE_TYPE (arg0))) < 0
8487 /* We cannot drop an unsigned shift after sign-extension. */
8488 && (!TYPE_UNSIGNED (final_type) || unsigned_arg))
8490 /* Do an unsigned shift if the operand was zero-extended. */
8492 = c_common_signed_or_unsigned_type (unsigned_arg,
8494 /* Convert value-to-be-shifted to that type. */
8495 if (TREE_TYPE (op0) != result_type)
8496 op0 = convert (result_type, op0);
8501 /* Comparison operations are shortened too but differently.
8502 They identify themselves by setting short_compare = 1. */
8506 /* Don't write &op0, etc., because that would prevent op0
8507 from being kept in a register.
8508 Instead, make copies of the our local variables and
8509 pass the copies by reference, then copy them back afterward. */
8510 tree xop0 = op0, xop1 = op1, xresult_type = result_type;
8511 enum tree_code xresultcode = resultcode;
8513 = shorten_compare (&xop0, &xop1, &xresult_type, &xresultcode);
8518 goto return_build_binary_op;
8521 op0 = xop0, op1 = xop1;
8523 resultcode = xresultcode;
8525 if (warn_sign_compare && !skip_evaluation)
8527 warn_for_sign_compare (location, orig_op0, orig_op1, op0, op1,
8528 result_type, resultcode);
8533 /* At this point, RESULT_TYPE must be nonzero to avoid an error message.
8534 If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
8535 Then the expression will be built.
8536 It will be given type FINAL_TYPE if that is nonzero;
8537 otherwise, it will be given type RESULT_TYPE. */
8541 binary_op_error (location, code, TREE_TYPE (op0), TREE_TYPE (op1));
8542 return error_mark_node;
8547 if (TREE_TYPE (op0) != result_type)
8548 op0 = convert_and_check (result_type, op0);
8549 if (TREE_TYPE (op1) != result_type)
8550 op1 = convert_and_check (result_type, op1);
8552 /* This can happen if one operand has a vector type, and the other
8553 has a different type. */
8554 if (TREE_CODE (op0) == ERROR_MARK || TREE_CODE (op1) == ERROR_MARK)
8555 return error_mark_node;
8558 if (build_type == NULL_TREE)
8559 build_type = result_type;
8561 /* Treat expressions in initializers specially as they can't trap. */
8562 ret = require_constant_value ? fold_build2_initializer (resultcode,
8565 : fold_build2 (resultcode, build_type,
8567 if (final_type != 0)
8568 ret = convert (final_type, ret);
8570 return_build_binary_op:
8571 gcc_assert (ret != error_mark_node);
8572 protected_set_expr_location (ret, location);
8577 /* Convert EXPR to be a truth-value, validating its type for this
8578 purpose. LOCATION is the source location for the expression. */
8581 c_objc_common_truthvalue_conversion (location_t location, tree expr)
8583 switch (TREE_CODE (TREE_TYPE (expr)))
8586 error_at (location, "used array that cannot be converted to pointer where scalar is required");
8587 return error_mark_node;
8590 error_at (location, "used struct type value where scalar is required");
8591 return error_mark_node;
8594 error_at (location, "used union type value where scalar is required");
8595 return error_mark_node;
8604 /* ??? Should we also give an error for void and vectors rather than
8605 leaving those to give errors later? */
8606 return c_common_truthvalue_conversion (location, expr);
8610 /* Convert EXPR to a contained DECL, updating *TC, *TI and *SE as
8614 c_expr_to_decl (tree expr, bool *tc ATTRIBUTE_UNUSED, bool *se)
8616 if (TREE_CODE (expr) == COMPOUND_LITERAL_EXPR)
8618 tree decl = COMPOUND_LITERAL_EXPR_DECL (expr);
8619 /* Executing a compound literal inside a function reinitializes
8621 if (!TREE_STATIC (decl))
8629 /* Like c_begin_compound_stmt, except force the retention of the BLOCK. */
8632 c_begin_omp_parallel (void)
8637 block = c_begin_compound_stmt (true);
8642 /* Generate OMP_PARALLEL, with CLAUSES and BLOCK as its compound statement. */
8645 c_finish_omp_parallel (tree clauses, tree block)
8649 block = c_end_compound_stmt (block, true);
8651 stmt = make_node (OMP_PARALLEL);
8652 TREE_TYPE (stmt) = void_type_node;
8653 OMP_PARALLEL_CLAUSES (stmt) = clauses;
8654 OMP_PARALLEL_BODY (stmt) = block;
8656 return add_stmt (stmt);
8659 /* Like c_begin_compound_stmt, except force the retention of the BLOCK. */
8662 c_begin_omp_task (void)
8667 block = c_begin_compound_stmt (true);
8672 /* Generate OMP_TASK, with CLAUSES and BLOCK as its compound statement. */
8675 c_finish_omp_task (tree clauses, tree block)
8679 block = c_end_compound_stmt (block, true);
8681 stmt = make_node (OMP_TASK);
8682 TREE_TYPE (stmt) = void_type_node;
8683 OMP_TASK_CLAUSES (stmt) = clauses;
8684 OMP_TASK_BODY (stmt) = block;
8686 return add_stmt (stmt);
8689 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
8690 Remove any elements from the list that are invalid. */
8693 c_finish_omp_clauses (tree clauses)
8695 bitmap_head generic_head, firstprivate_head, lastprivate_head;
8696 tree c, t, *pc = &clauses;
8699 bitmap_obstack_initialize (NULL);
8700 bitmap_initialize (&generic_head, &bitmap_default_obstack);
8701 bitmap_initialize (&firstprivate_head, &bitmap_default_obstack);
8702 bitmap_initialize (&lastprivate_head, &bitmap_default_obstack);
8704 for (pc = &clauses, c = clauses; c ; c = *pc)
8706 bool remove = false;
8707 bool need_complete = false;
8708 bool need_implicitly_determined = false;
8710 switch (OMP_CLAUSE_CODE (c))
8712 case OMP_CLAUSE_SHARED:
8714 need_implicitly_determined = true;
8715 goto check_dup_generic;
8717 case OMP_CLAUSE_PRIVATE:
8719 need_complete = true;
8720 need_implicitly_determined = true;
8721 goto check_dup_generic;
8723 case OMP_CLAUSE_REDUCTION:
8725 need_implicitly_determined = true;
8726 t = OMP_CLAUSE_DECL (c);
8727 if (AGGREGATE_TYPE_P (TREE_TYPE (t))
8728 || POINTER_TYPE_P (TREE_TYPE (t)))
8730 error ("%qE has invalid type for %<reduction%>", t);
8733 else if (FLOAT_TYPE_P (TREE_TYPE (t)))
8735 enum tree_code r_code = OMP_CLAUSE_REDUCTION_CODE (c);
8736 const char *r_name = NULL;
8753 case TRUTH_ANDIF_EXPR:
8756 case TRUTH_ORIF_EXPR:
8764 error ("%qE has invalid type for %<reduction(%s)%>",
8769 goto check_dup_generic;
8771 case OMP_CLAUSE_COPYPRIVATE:
8772 name = "copyprivate";
8773 goto check_dup_generic;
8775 case OMP_CLAUSE_COPYIN:
8777 t = OMP_CLAUSE_DECL (c);
8778 if (TREE_CODE (t) != VAR_DECL || !DECL_THREAD_LOCAL_P (t))
8780 error ("%qE must be %<threadprivate%> for %<copyin%>", t);
8783 goto check_dup_generic;
8786 t = OMP_CLAUSE_DECL (c);
8787 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
8789 error ("%qE is not a variable in clause %qs", t, name);
8792 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
8793 || bitmap_bit_p (&firstprivate_head, DECL_UID (t))
8794 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
8796 error ("%qE appears more than once in data clauses", t);
8800 bitmap_set_bit (&generic_head, DECL_UID (t));
8803 case OMP_CLAUSE_FIRSTPRIVATE:
8804 name = "firstprivate";
8805 t = OMP_CLAUSE_DECL (c);
8806 need_complete = true;
8807 need_implicitly_determined = true;
8808 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
8810 error ("%qE is not a variable in clause %<firstprivate%>", t);
8813 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
8814 || bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
8816 error ("%qE appears more than once in data clauses", t);
8820 bitmap_set_bit (&firstprivate_head, DECL_UID (t));
8823 case OMP_CLAUSE_LASTPRIVATE:
8824 name = "lastprivate";
8825 t = OMP_CLAUSE_DECL (c);
8826 need_complete = true;
8827 need_implicitly_determined = true;
8828 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
8830 error ("%qE is not a variable in clause %<lastprivate%>", t);
8833 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
8834 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
8836 error ("%qE appears more than once in data clauses", t);
8840 bitmap_set_bit (&lastprivate_head, DECL_UID (t));
8844 case OMP_CLAUSE_NUM_THREADS:
8845 case OMP_CLAUSE_SCHEDULE:
8846 case OMP_CLAUSE_NOWAIT:
8847 case OMP_CLAUSE_ORDERED:
8848 case OMP_CLAUSE_DEFAULT:
8849 case OMP_CLAUSE_UNTIED:
8850 case OMP_CLAUSE_COLLAPSE:
8851 pc = &OMP_CLAUSE_CHAIN (c);
8860 t = OMP_CLAUSE_DECL (c);
8864 t = require_complete_type (t);
8865 if (t == error_mark_node)
8869 if (need_implicitly_determined)
8871 const char *share_name = NULL;
8873 if (TREE_CODE (t) == VAR_DECL && DECL_THREAD_LOCAL_P (t))
8874 share_name = "threadprivate";
8875 else switch (c_omp_predetermined_sharing (t))
8877 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
8879 case OMP_CLAUSE_DEFAULT_SHARED:
8880 share_name = "shared";
8882 case OMP_CLAUSE_DEFAULT_PRIVATE:
8883 share_name = "private";
8890 error ("%qE is predetermined %qs for %qs",
8891 t, share_name, name);
8898 *pc = OMP_CLAUSE_CHAIN (c);
8900 pc = &OMP_CLAUSE_CHAIN (c);
8903 bitmap_obstack_release (NULL);
8907 /* Make a variant type in the proper way for C/C++, propagating qualifiers
8908 down to the element type of an array. */
8911 c_build_qualified_type (tree type, int type_quals)
8913 if (type == error_mark_node)
8916 if (TREE_CODE (type) == ARRAY_TYPE)
8919 tree element_type = c_build_qualified_type (TREE_TYPE (type),
8922 /* See if we already have an identically qualified type. */
8923 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
8925 if (TYPE_QUALS (strip_array_types (t)) == type_quals
8926 && TYPE_NAME (t) == TYPE_NAME (type)
8927 && TYPE_CONTEXT (t) == TYPE_CONTEXT (type)
8928 && attribute_list_equal (TYPE_ATTRIBUTES (t),
8929 TYPE_ATTRIBUTES (type)))
8934 tree domain = TYPE_DOMAIN (type);
8936 t = build_variant_type_copy (type);
8937 TREE_TYPE (t) = element_type;
8939 if (TYPE_STRUCTURAL_EQUALITY_P (element_type)
8940 || (domain && TYPE_STRUCTURAL_EQUALITY_P (domain)))
8941 SET_TYPE_STRUCTURAL_EQUALITY (t);
8942 else if (TYPE_CANONICAL (element_type) != element_type
8943 || (domain && TYPE_CANONICAL (domain) != domain))
8945 tree unqualified_canon
8946 = build_array_type (TYPE_CANONICAL (element_type),
8947 domain? TYPE_CANONICAL (domain)
8950 = c_build_qualified_type (unqualified_canon, type_quals);
8953 TYPE_CANONICAL (t) = t;
8958 /* A restrict-qualified pointer type must be a pointer to object or
8959 incomplete type. Note that the use of POINTER_TYPE_P also allows
8960 REFERENCE_TYPEs, which is appropriate for C++. */
8961 if ((type_quals & TYPE_QUAL_RESTRICT)
8962 && (!POINTER_TYPE_P (type)
8963 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type))))
8965 error ("invalid use of %<restrict%>");
8966 type_quals &= ~TYPE_QUAL_RESTRICT;
8969 return build_qualified_type (type, type_quals);