1 /* Build expressions with type checking for C compiler.
2 Copyright (C) 1987, 1988, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008
4 Free Software Foundation, Inc.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 3, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
23 /* This file is part of the C front end.
24 It contains routines to build C expressions given their operands,
25 including computing the types of the result, C-specific error checks,
26 and some optimization. */
30 #include "coretypes.h"
34 #include "langhooks.h"
44 #include "tree-iterator.h"
45 #include "tree-gimple.h"
46 #include "tree-flow.h"
48 /* Possible cases of implicit bad conversions. Used to select
49 diagnostic messages in convert_for_assignment. */
58 /* The level of nesting inside "__alignof__". */
61 /* The level of nesting inside "sizeof". */
64 /* The level of nesting inside "typeof". */
67 struct c_label_context_se *label_context_stack_se;
68 struct c_label_context_vm *label_context_stack_vm;
70 /* Nonzero if we've already printed a "missing braces around initializer"
71 message within this initializer. */
72 static int missing_braces_mentioned;
74 static int require_constant_value;
75 static int require_constant_elements;
77 static bool null_pointer_constant_p (const_tree);
78 static tree qualify_type (tree, tree);
79 static int tagged_types_tu_compatible_p (const_tree, const_tree);
80 static int comp_target_types (tree, tree);
81 static int function_types_compatible_p (const_tree, const_tree);
82 static int type_lists_compatible_p (const_tree, const_tree);
83 static tree decl_constant_value_for_broken_optimization (tree);
84 static tree lookup_field (tree, tree);
85 static int convert_arguments (int, tree *, tree, tree, tree, tree);
86 static tree pointer_diff (tree, tree);
87 static tree convert_for_assignment (tree, tree, enum impl_conv, tree, tree,
89 static tree valid_compound_expr_initializer (tree, tree);
90 static void push_string (const char *);
91 static void push_member_name (tree);
92 static int spelling_length (void);
93 static char *print_spelling (char *);
94 static void warning_init (int, const char *);
95 static tree digest_init (tree, tree, bool, int);
96 static void output_init_element (tree, bool, tree, tree, int);
97 static void output_pending_init_elements (int);
98 static int set_designator (int);
99 static void push_range_stack (tree);
100 static void add_pending_init (tree, tree);
101 static void set_nonincremental_init (void);
102 static void set_nonincremental_init_from_string (tree);
103 static tree find_init_member (tree);
104 static void readonly_error (tree, enum lvalue_use);
105 static int lvalue_or_else (const_tree, enum lvalue_use);
106 static int lvalue_p (const_tree);
107 static void record_maybe_used_decl (tree);
108 static int comptypes_internal (const_tree, const_tree);
110 /* Return true if EXP is a null pointer constant, false otherwise. */
113 null_pointer_constant_p (const_tree expr)
115 /* This should really operate on c_expr structures, but they aren't
116 yet available everywhere required. */
117 tree type = TREE_TYPE (expr);
118 return (TREE_CODE (expr) == INTEGER_CST
119 && !TREE_OVERFLOW (expr)
120 && integer_zerop (expr)
121 && (INTEGRAL_TYPE_P (type)
122 || (TREE_CODE (type) == POINTER_TYPE
123 && VOID_TYPE_P (TREE_TYPE (type))
124 && TYPE_QUALS (TREE_TYPE (type)) == TYPE_UNQUALIFIED)));
126 \f/* This is a cache to hold if two types are compatible or not. */
128 struct tagged_tu_seen_cache {
129 const struct tagged_tu_seen_cache * next;
132 /* The return value of tagged_types_tu_compatible_p if we had seen
133 these two types already. */
137 static const struct tagged_tu_seen_cache * tagged_tu_seen_base;
138 static void free_all_tagged_tu_seen_up_to (const struct tagged_tu_seen_cache *);
140 /* Do `exp = require_complete_type (exp);' to make sure exp
141 does not have an incomplete type. (That includes void types.) */
144 require_complete_type (tree value)
146 tree type = TREE_TYPE (value);
148 if (value == error_mark_node || type == error_mark_node)
149 return error_mark_node;
151 /* First, detect a valid value with a complete type. */
152 if (COMPLETE_TYPE_P (type))
155 c_incomplete_type_error (value, type);
156 return error_mark_node;
159 /* Print an error message for invalid use of an incomplete type.
160 VALUE is the expression that was used (or 0 if that isn't known)
161 and TYPE is the type that was invalid. */
164 c_incomplete_type_error (const_tree value, const_tree type)
166 const char *type_code_string;
168 /* Avoid duplicate error message. */
169 if (TREE_CODE (type) == ERROR_MARK)
172 if (value != 0 && (TREE_CODE (value) == VAR_DECL
173 || TREE_CODE (value) == PARM_DECL))
174 error ("%qD has an incomplete type", value);
178 /* We must print an error message. Be clever about what it says. */
180 switch (TREE_CODE (type))
183 type_code_string = "struct";
187 type_code_string = "union";
191 type_code_string = "enum";
195 error ("invalid use of void expression");
199 if (TYPE_DOMAIN (type))
201 if (TYPE_MAX_VALUE (TYPE_DOMAIN (type)) == NULL)
203 error ("invalid use of flexible array member");
206 type = TREE_TYPE (type);
209 error ("invalid use of array with unspecified bounds");
216 if (TREE_CODE (TYPE_NAME (type)) == IDENTIFIER_NODE)
217 error ("invalid use of undefined type %<%s %E%>",
218 type_code_string, TYPE_NAME (type));
220 /* If this type has a typedef-name, the TYPE_NAME is a TYPE_DECL. */
221 error ("invalid use of incomplete typedef %qD", TYPE_NAME (type));
225 /* Given a type, apply default promotions wrt unnamed function
226 arguments and return the new type. */
229 c_type_promotes_to (tree type)
231 if (TYPE_MAIN_VARIANT (type) == float_type_node)
232 return double_type_node;
234 if (c_promoting_integer_type_p (type))
236 /* Preserve unsignedness if not really getting any wider. */
237 if (TYPE_UNSIGNED (type)
238 && (TYPE_PRECISION (type) == TYPE_PRECISION (integer_type_node)))
239 return unsigned_type_node;
240 return integer_type_node;
246 /* Return a variant of TYPE which has all the type qualifiers of LIKE
247 as well as those of TYPE. */
250 qualify_type (tree type, tree like)
252 return c_build_qualified_type (type,
253 TYPE_QUALS (type) | TYPE_QUALS (like));
256 /* Return true iff the given tree T is a variable length array. */
259 c_vla_type_p (const_tree t)
261 if (TREE_CODE (t) == ARRAY_TYPE
262 && C_TYPE_VARIABLE_SIZE (t))
267 /* Return the composite type of two compatible types.
269 We assume that comptypes has already been done and returned
270 nonzero; if that isn't so, this may crash. In particular, we
271 assume that qualifiers match. */
274 composite_type (tree t1, tree t2)
276 enum tree_code code1;
277 enum tree_code code2;
280 /* Save time if the two types are the same. */
282 if (t1 == t2) return t1;
284 /* If one type is nonsense, use the other. */
285 if (t1 == error_mark_node)
287 if (t2 == error_mark_node)
290 code1 = TREE_CODE (t1);
291 code2 = TREE_CODE (t2);
293 /* Merge the attributes. */
294 attributes = targetm.merge_type_attributes (t1, t2);
296 /* If one is an enumerated type and the other is the compatible
297 integer type, the composite type might be either of the two
298 (DR#013 question 3). For consistency, use the enumerated type as
299 the composite type. */
301 if (code1 == ENUMERAL_TYPE && code2 == INTEGER_TYPE)
303 if (code2 == ENUMERAL_TYPE && code1 == INTEGER_TYPE)
306 gcc_assert (code1 == code2);
311 /* For two pointers, do this recursively on the target type. */
313 tree pointed_to_1 = TREE_TYPE (t1);
314 tree pointed_to_2 = TREE_TYPE (t2);
315 tree target = composite_type (pointed_to_1, pointed_to_2);
316 t1 = build_pointer_type (target);
317 t1 = build_type_attribute_variant (t1, attributes);
318 return qualify_type (t1, t2);
323 tree elt = composite_type (TREE_TYPE (t1), TREE_TYPE (t2));
326 tree d1 = TYPE_DOMAIN (t1);
327 tree d2 = TYPE_DOMAIN (t2);
328 bool d1_variable, d2_variable;
329 bool d1_zero, d2_zero;
331 /* We should not have any type quals on arrays at all. */
332 gcc_assert (!TYPE_QUALS (t1) && !TYPE_QUALS (t2));
334 d1_zero = d1 == 0 || !TYPE_MAX_VALUE (d1);
335 d2_zero = d2 == 0 || !TYPE_MAX_VALUE (d2);
337 d1_variable = (!d1_zero
338 && (TREE_CODE (TYPE_MIN_VALUE (d1)) != INTEGER_CST
339 || TREE_CODE (TYPE_MAX_VALUE (d1)) != INTEGER_CST));
340 d2_variable = (!d2_zero
341 && (TREE_CODE (TYPE_MIN_VALUE (d2)) != INTEGER_CST
342 || TREE_CODE (TYPE_MAX_VALUE (d2)) != INTEGER_CST));
343 d1_variable = d1_variable || (d1_zero && c_vla_type_p (t1));
344 d2_variable = d2_variable || (d2_zero && c_vla_type_p (t2));
346 /* Save space: see if the result is identical to one of the args. */
347 if (elt == TREE_TYPE (t1) && TYPE_DOMAIN (t1)
348 && (d2_variable || d2_zero || !d1_variable))
349 return build_type_attribute_variant (t1, attributes);
350 if (elt == TREE_TYPE (t2) && TYPE_DOMAIN (t2)
351 && (d1_variable || d1_zero || !d2_variable))
352 return build_type_attribute_variant (t2, attributes);
354 if (elt == TREE_TYPE (t1) && !TYPE_DOMAIN (t2) && !TYPE_DOMAIN (t1))
355 return build_type_attribute_variant (t1, attributes);
356 if (elt == TREE_TYPE (t2) && !TYPE_DOMAIN (t2) && !TYPE_DOMAIN (t1))
357 return build_type_attribute_variant (t2, attributes);
359 /* Merge the element types, and have a size if either arg has
360 one. We may have qualifiers on the element types. To set
361 up TYPE_MAIN_VARIANT correctly, we need to form the
362 composite of the unqualified types and add the qualifiers
364 quals = TYPE_QUALS (strip_array_types (elt));
365 unqual_elt = c_build_qualified_type (elt, TYPE_UNQUALIFIED);
366 t1 = build_array_type (unqual_elt,
367 TYPE_DOMAIN ((TYPE_DOMAIN (t1)
373 t1 = c_build_qualified_type (t1, quals);
374 return build_type_attribute_variant (t1, attributes);
380 if (attributes != NULL)
382 /* Try harder not to create a new aggregate type. */
383 if (attribute_list_equal (TYPE_ATTRIBUTES (t1), attributes))
385 if (attribute_list_equal (TYPE_ATTRIBUTES (t2), attributes))
388 return build_type_attribute_variant (t1, attributes);
391 /* Function types: prefer the one that specified arg types.
392 If both do, merge the arg types. Also merge the return types. */
394 tree valtype = composite_type (TREE_TYPE (t1), TREE_TYPE (t2));
395 tree p1 = TYPE_ARG_TYPES (t1);
396 tree p2 = TYPE_ARG_TYPES (t2);
401 /* Save space: see if the result is identical to one of the args. */
402 if (valtype == TREE_TYPE (t1) && !TYPE_ARG_TYPES (t2))
403 return build_type_attribute_variant (t1, attributes);
404 if (valtype == TREE_TYPE (t2) && !TYPE_ARG_TYPES (t1))
405 return build_type_attribute_variant (t2, attributes);
407 /* Simple way if one arg fails to specify argument types. */
408 if (TYPE_ARG_TYPES (t1) == 0)
410 t1 = build_function_type (valtype, TYPE_ARG_TYPES (t2));
411 t1 = build_type_attribute_variant (t1, attributes);
412 return qualify_type (t1, t2);
414 if (TYPE_ARG_TYPES (t2) == 0)
416 t1 = build_function_type (valtype, TYPE_ARG_TYPES (t1));
417 t1 = build_type_attribute_variant (t1, attributes);
418 return qualify_type (t1, t2);
421 /* If both args specify argument types, we must merge the two
422 lists, argument by argument. */
423 /* Tell global_bindings_p to return false so that variable_size
424 doesn't die on VLAs in parameter types. */
425 c_override_global_bindings_to_false = true;
427 len = list_length (p1);
430 for (i = 0; i < len; i++)
431 newargs = tree_cons (NULL_TREE, NULL_TREE, newargs);
436 p1 = TREE_CHAIN (p1), p2 = TREE_CHAIN (p2), n = TREE_CHAIN (n))
438 /* A null type means arg type is not specified.
439 Take whatever the other function type has. */
440 if (TREE_VALUE (p1) == 0)
442 TREE_VALUE (n) = TREE_VALUE (p2);
445 if (TREE_VALUE (p2) == 0)
447 TREE_VALUE (n) = TREE_VALUE (p1);
451 /* Given wait (union {union wait *u; int *i} *)
452 and wait (union wait *),
453 prefer union wait * as type of parm. */
454 if (TREE_CODE (TREE_VALUE (p1)) == UNION_TYPE
455 && TREE_VALUE (p1) != TREE_VALUE (p2))
458 tree mv2 = TREE_VALUE (p2);
459 if (mv2 && mv2 != error_mark_node
460 && TREE_CODE (mv2) != ARRAY_TYPE)
461 mv2 = TYPE_MAIN_VARIANT (mv2);
462 for (memb = TYPE_FIELDS (TREE_VALUE (p1));
463 memb; memb = TREE_CHAIN (memb))
465 tree mv3 = TREE_TYPE (memb);
466 if (mv3 && mv3 != error_mark_node
467 && TREE_CODE (mv3) != ARRAY_TYPE)
468 mv3 = TYPE_MAIN_VARIANT (mv3);
469 if (comptypes (mv3, mv2))
471 TREE_VALUE (n) = composite_type (TREE_TYPE (memb),
474 pedwarn ("function types not truly compatible in ISO C");
479 if (TREE_CODE (TREE_VALUE (p2)) == UNION_TYPE
480 && TREE_VALUE (p2) != TREE_VALUE (p1))
483 tree mv1 = TREE_VALUE (p1);
484 if (mv1 && mv1 != error_mark_node
485 && TREE_CODE (mv1) != ARRAY_TYPE)
486 mv1 = TYPE_MAIN_VARIANT (mv1);
487 for (memb = TYPE_FIELDS (TREE_VALUE (p2));
488 memb; memb = TREE_CHAIN (memb))
490 tree mv3 = TREE_TYPE (memb);
491 if (mv3 && mv3 != error_mark_node
492 && TREE_CODE (mv3) != ARRAY_TYPE)
493 mv3 = TYPE_MAIN_VARIANT (mv3);
494 if (comptypes (mv3, mv1))
496 TREE_VALUE (n) = composite_type (TREE_TYPE (memb),
499 pedwarn ("function types not truly compatible in ISO C");
504 TREE_VALUE (n) = composite_type (TREE_VALUE (p1), TREE_VALUE (p2));
508 c_override_global_bindings_to_false = false;
509 t1 = build_function_type (valtype, newargs);
510 t1 = qualify_type (t1, t2);
511 /* ... falls through ... */
515 return build_type_attribute_variant (t1, attributes);
520 /* Return the type of a conditional expression between pointers to
521 possibly differently qualified versions of compatible types.
523 We assume that comp_target_types has already been done and returned
524 nonzero; if that isn't so, this may crash. */
527 common_pointer_type (tree t1, tree t2)
530 tree pointed_to_1, mv1;
531 tree pointed_to_2, mv2;
533 unsigned target_quals;
535 /* Save time if the two types are the same. */
537 if (t1 == t2) return t1;
539 /* If one type is nonsense, use the other. */
540 if (t1 == error_mark_node)
542 if (t2 == error_mark_node)
545 gcc_assert (TREE_CODE (t1) == POINTER_TYPE
546 && TREE_CODE (t2) == POINTER_TYPE);
548 /* Merge the attributes. */
549 attributes = targetm.merge_type_attributes (t1, t2);
551 /* Find the composite type of the target types, and combine the
552 qualifiers of the two types' targets. Do not lose qualifiers on
553 array element types by taking the TYPE_MAIN_VARIANT. */
554 mv1 = pointed_to_1 = TREE_TYPE (t1);
555 mv2 = pointed_to_2 = TREE_TYPE (t2);
556 if (TREE_CODE (mv1) != ARRAY_TYPE)
557 mv1 = TYPE_MAIN_VARIANT (pointed_to_1);
558 if (TREE_CODE (mv2) != ARRAY_TYPE)
559 mv2 = TYPE_MAIN_VARIANT (pointed_to_2);
560 target = composite_type (mv1, mv2);
562 /* For function types do not merge const qualifiers, but drop them
563 if used inconsistently. The middle-end uses these to mark const
564 and noreturn functions. */
565 if (TREE_CODE (pointed_to_1) == FUNCTION_TYPE)
566 target_quals = TYPE_QUALS (pointed_to_1) & TYPE_QUALS (pointed_to_2);
568 target_quals = TYPE_QUALS (pointed_to_1) | TYPE_QUALS (pointed_to_2);
569 t1 = build_pointer_type (c_build_qualified_type (target, target_quals));
570 return build_type_attribute_variant (t1, attributes);
573 /* Return the common type for two arithmetic types under the usual
574 arithmetic conversions. The default conversions have already been
575 applied, and enumerated types converted to their compatible integer
576 types. The resulting type is unqualified and has no attributes.
578 This is the type for the result of most arithmetic operations
579 if the operands have the given two types. */
582 c_common_type (tree t1, tree t2)
584 enum tree_code code1;
585 enum tree_code code2;
587 /* If one type is nonsense, use the other. */
588 if (t1 == error_mark_node)
590 if (t2 == error_mark_node)
593 if (TYPE_QUALS (t1) != TYPE_UNQUALIFIED)
594 t1 = TYPE_MAIN_VARIANT (t1);
596 if (TYPE_QUALS (t2) != TYPE_UNQUALIFIED)
597 t2 = TYPE_MAIN_VARIANT (t2);
599 if (TYPE_ATTRIBUTES (t1) != NULL_TREE)
600 t1 = build_type_attribute_variant (t1, NULL_TREE);
602 if (TYPE_ATTRIBUTES (t2) != NULL_TREE)
603 t2 = build_type_attribute_variant (t2, NULL_TREE);
605 /* Save time if the two types are the same. */
607 if (t1 == t2) return t1;
609 code1 = TREE_CODE (t1);
610 code2 = TREE_CODE (t2);
612 gcc_assert (code1 == VECTOR_TYPE || code1 == COMPLEX_TYPE
613 || code1 == FIXED_POINT_TYPE || code1 == REAL_TYPE
614 || code1 == INTEGER_TYPE);
615 gcc_assert (code2 == VECTOR_TYPE || code2 == COMPLEX_TYPE
616 || code2 == FIXED_POINT_TYPE || code2 == REAL_TYPE
617 || code2 == INTEGER_TYPE);
619 /* When one operand is a decimal float type, the other operand cannot be
620 a generic float type or a complex type. We also disallow vector types
622 if ((DECIMAL_FLOAT_TYPE_P (t1) || DECIMAL_FLOAT_TYPE_P (t2))
623 && !(DECIMAL_FLOAT_TYPE_P (t1) && DECIMAL_FLOAT_TYPE_P (t2)))
625 if (code1 == VECTOR_TYPE || code2 == VECTOR_TYPE)
627 error ("can%'t mix operands of decimal float and vector types");
628 return error_mark_node;
630 if (code1 == COMPLEX_TYPE || code2 == COMPLEX_TYPE)
632 error ("can%'t mix operands of decimal float and complex types");
633 return error_mark_node;
635 if (code1 == REAL_TYPE && code2 == REAL_TYPE)
637 error ("can%'t mix operands of decimal float and other float types");
638 return error_mark_node;
642 /* If one type is a vector type, return that type. (How the usual
643 arithmetic conversions apply to the vector types extension is not
644 precisely specified.) */
645 if (code1 == VECTOR_TYPE)
648 if (code2 == VECTOR_TYPE)
651 /* If one type is complex, form the common type of the non-complex
652 components, then make that complex. Use T1 or T2 if it is the
654 if (code1 == COMPLEX_TYPE || code2 == COMPLEX_TYPE)
656 tree subtype1 = code1 == COMPLEX_TYPE ? TREE_TYPE (t1) : t1;
657 tree subtype2 = code2 == COMPLEX_TYPE ? TREE_TYPE (t2) : t2;
658 tree subtype = c_common_type (subtype1, subtype2);
660 if (code1 == COMPLEX_TYPE && TREE_TYPE (t1) == subtype)
662 else if (code2 == COMPLEX_TYPE && TREE_TYPE (t2) == subtype)
665 return build_complex_type (subtype);
668 /* If only one is real, use it as the result. */
670 if (code1 == REAL_TYPE && code2 != REAL_TYPE)
673 if (code2 == REAL_TYPE && code1 != REAL_TYPE)
676 /* If both are real and either are decimal floating point types, use
677 the decimal floating point type with the greater precision. */
679 if (code1 == REAL_TYPE && code2 == REAL_TYPE)
681 if (TYPE_MAIN_VARIANT (t1) == dfloat128_type_node
682 || TYPE_MAIN_VARIANT (t2) == dfloat128_type_node)
683 return dfloat128_type_node;
684 else if (TYPE_MAIN_VARIANT (t1) == dfloat64_type_node
685 || TYPE_MAIN_VARIANT (t2) == dfloat64_type_node)
686 return dfloat64_type_node;
687 else if (TYPE_MAIN_VARIANT (t1) == dfloat32_type_node
688 || TYPE_MAIN_VARIANT (t2) == dfloat32_type_node)
689 return dfloat32_type_node;
692 /* Deal with fixed-point types. */
693 if (code1 == FIXED_POINT_TYPE || code2 == FIXED_POINT_TYPE)
695 unsigned int unsignedp = 0, satp = 0;
696 enum machine_mode m1, m2;
697 unsigned int fbit1, ibit1, fbit2, ibit2, max_fbit, max_ibit;
702 /* If one input type is saturating, the result type is saturating. */
703 if (TYPE_SATURATING (t1) || TYPE_SATURATING (t2))
706 /* If both fixed-point types are unsigned, the result type is unsigned.
707 When mixing fixed-point and integer types, follow the sign of the
709 Otherwise, the result type is signed. */
710 if ((TYPE_UNSIGNED (t1) && TYPE_UNSIGNED (t2)
711 && code1 == FIXED_POINT_TYPE && code2 == FIXED_POINT_TYPE)
712 || (code1 == FIXED_POINT_TYPE && code2 != FIXED_POINT_TYPE
713 && TYPE_UNSIGNED (t1))
714 || (code1 != FIXED_POINT_TYPE && code2 == FIXED_POINT_TYPE
715 && TYPE_UNSIGNED (t2)))
718 /* The result type is signed. */
721 /* If the input type is unsigned, we need to convert to the
723 if (code1 == FIXED_POINT_TYPE && TYPE_UNSIGNED (t1))
725 unsigned char mclass = 0;
726 if (GET_MODE_CLASS (m1) == MODE_UFRACT)
728 else if (GET_MODE_CLASS (m1) == MODE_UACCUM)
732 m1 = mode_for_size (GET_MODE_PRECISION (m1), mclass, 0);
734 if (code2 == FIXED_POINT_TYPE && TYPE_UNSIGNED (t2))
736 unsigned char mclass = 0;
737 if (GET_MODE_CLASS (m2) == MODE_UFRACT)
739 else if (GET_MODE_CLASS (m2) == MODE_UACCUM)
743 m2 = mode_for_size (GET_MODE_PRECISION (m2), mclass, 0);
747 if (code1 == FIXED_POINT_TYPE)
749 fbit1 = GET_MODE_FBIT (m1);
750 ibit1 = GET_MODE_IBIT (m1);
755 /* Signed integers need to subtract one sign bit. */
756 ibit1 = TYPE_PRECISION (t1) - (!TYPE_UNSIGNED (t1));
759 if (code2 == FIXED_POINT_TYPE)
761 fbit2 = GET_MODE_FBIT (m2);
762 ibit2 = GET_MODE_IBIT (m2);
767 /* Signed integers need to subtract one sign bit. */
768 ibit2 = TYPE_PRECISION (t2) - (!TYPE_UNSIGNED (t2));
771 max_ibit = ibit1 >= ibit2 ? ibit1 : ibit2;
772 max_fbit = fbit1 >= fbit2 ? fbit1 : fbit2;
773 return c_common_fixed_point_type_for_size (max_ibit, max_fbit, unsignedp,
777 /* Both real or both integers; use the one with greater precision. */
779 if (TYPE_PRECISION (t1) > TYPE_PRECISION (t2))
781 else if (TYPE_PRECISION (t2) > TYPE_PRECISION (t1))
784 /* Same precision. Prefer long longs to longs to ints when the
785 same precision, following the C99 rules on integer type rank
786 (which are equivalent to the C90 rules for C90 types). */
788 if (TYPE_MAIN_VARIANT (t1) == long_long_unsigned_type_node
789 || TYPE_MAIN_VARIANT (t2) == long_long_unsigned_type_node)
790 return long_long_unsigned_type_node;
792 if (TYPE_MAIN_VARIANT (t1) == long_long_integer_type_node
793 || TYPE_MAIN_VARIANT (t2) == long_long_integer_type_node)
795 if (TYPE_UNSIGNED (t1) || TYPE_UNSIGNED (t2))
796 return long_long_unsigned_type_node;
798 return long_long_integer_type_node;
801 if (TYPE_MAIN_VARIANT (t1) == long_unsigned_type_node
802 || TYPE_MAIN_VARIANT (t2) == long_unsigned_type_node)
803 return long_unsigned_type_node;
805 if (TYPE_MAIN_VARIANT (t1) == long_integer_type_node
806 || TYPE_MAIN_VARIANT (t2) == long_integer_type_node)
808 /* But preserve unsignedness from the other type,
809 since long cannot hold all the values of an unsigned int. */
810 if (TYPE_UNSIGNED (t1) || TYPE_UNSIGNED (t2))
811 return long_unsigned_type_node;
813 return long_integer_type_node;
816 /* Likewise, prefer long double to double even if same size. */
817 if (TYPE_MAIN_VARIANT (t1) == long_double_type_node
818 || TYPE_MAIN_VARIANT (t2) == long_double_type_node)
819 return long_double_type_node;
821 /* Otherwise prefer the unsigned one. */
823 if (TYPE_UNSIGNED (t1))
829 /* Wrapper around c_common_type that is used by c-common.c and other
830 front end optimizations that remove promotions. ENUMERAL_TYPEs
831 are allowed here and are converted to their compatible integer types.
832 BOOLEAN_TYPEs are allowed here and return either boolean_type_node or
833 preferably a non-Boolean type as the common type. */
835 common_type (tree t1, tree t2)
837 if (TREE_CODE (t1) == ENUMERAL_TYPE)
838 t1 = c_common_type_for_size (TYPE_PRECISION (t1), 1);
839 if (TREE_CODE (t2) == ENUMERAL_TYPE)
840 t2 = c_common_type_for_size (TYPE_PRECISION (t2), 1);
842 /* If both types are BOOLEAN_TYPE, then return boolean_type_node. */
843 if (TREE_CODE (t1) == BOOLEAN_TYPE
844 && TREE_CODE (t2) == BOOLEAN_TYPE)
845 return boolean_type_node;
847 /* If either type is BOOLEAN_TYPE, then return the other. */
848 if (TREE_CODE (t1) == BOOLEAN_TYPE)
850 if (TREE_CODE (t2) == BOOLEAN_TYPE)
853 return c_common_type (t1, t2);
856 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
857 or various other operations. Return 2 if they are compatible
858 but a warning may be needed if you use them together. */
861 comptypes (tree type1, tree type2)
863 const struct tagged_tu_seen_cache * tagged_tu_seen_base1 = tagged_tu_seen_base;
866 val = comptypes_internal (type1, type2);
867 free_all_tagged_tu_seen_up_to (tagged_tu_seen_base1);
872 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
873 or various other operations. Return 2 if they are compatible
874 but a warning may be needed if you use them together. This
875 differs from comptypes, in that we don't free the seen types. */
878 comptypes_internal (const_tree type1, const_tree type2)
880 const_tree t1 = type1;
881 const_tree t2 = type2;
884 /* Suppress errors caused by previously reported errors. */
886 if (t1 == t2 || !t1 || !t2
887 || TREE_CODE (t1) == ERROR_MARK || TREE_CODE (t2) == ERROR_MARK)
890 /* If either type is the internal version of sizetype, return the
892 if (TREE_CODE (t1) == INTEGER_TYPE && TYPE_IS_SIZETYPE (t1)
893 && TYPE_ORIG_SIZE_TYPE (t1))
894 t1 = TYPE_ORIG_SIZE_TYPE (t1);
896 if (TREE_CODE (t2) == INTEGER_TYPE && TYPE_IS_SIZETYPE (t2)
897 && TYPE_ORIG_SIZE_TYPE (t2))
898 t2 = TYPE_ORIG_SIZE_TYPE (t2);
901 /* Enumerated types are compatible with integer types, but this is
902 not transitive: two enumerated types in the same translation unit
903 are compatible with each other only if they are the same type. */
905 if (TREE_CODE (t1) == ENUMERAL_TYPE && TREE_CODE (t2) != ENUMERAL_TYPE)
906 t1 = c_common_type_for_size (TYPE_PRECISION (t1), TYPE_UNSIGNED (t1));
907 else if (TREE_CODE (t2) == ENUMERAL_TYPE && TREE_CODE (t1) != ENUMERAL_TYPE)
908 t2 = c_common_type_for_size (TYPE_PRECISION (t2), TYPE_UNSIGNED (t2));
913 /* Different classes of types can't be compatible. */
915 if (TREE_CODE (t1) != TREE_CODE (t2))
918 /* Qualifiers must match. C99 6.7.3p9 */
920 if (TYPE_QUALS (t1) != TYPE_QUALS (t2))
923 /* Allow for two different type nodes which have essentially the same
924 definition. Note that we already checked for equality of the type
925 qualifiers (just above). */
927 if (TREE_CODE (t1) != ARRAY_TYPE
928 && TYPE_MAIN_VARIANT (t1) == TYPE_MAIN_VARIANT (t2))
931 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
932 if (!(attrval = targetm.comp_type_attributes (t1, t2)))
935 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
938 switch (TREE_CODE (t1))
941 /* Do not remove mode or aliasing information. */
942 if (TYPE_MODE (t1) != TYPE_MODE (t2)
943 || TYPE_REF_CAN_ALIAS_ALL (t1) != TYPE_REF_CAN_ALIAS_ALL (t2))
945 val = (TREE_TYPE (t1) == TREE_TYPE (t2)
946 ? 1 : comptypes_internal (TREE_TYPE (t1), TREE_TYPE (t2)));
950 val = function_types_compatible_p (t1, t2);
955 tree d1 = TYPE_DOMAIN (t1);
956 tree d2 = TYPE_DOMAIN (t2);
957 bool d1_variable, d2_variable;
958 bool d1_zero, d2_zero;
961 /* Target types must match incl. qualifiers. */
962 if (TREE_TYPE (t1) != TREE_TYPE (t2)
963 && 0 == (val = comptypes_internal (TREE_TYPE (t1), TREE_TYPE (t2))))
966 /* Sizes must match unless one is missing or variable. */
967 if (d1 == 0 || d2 == 0 || d1 == d2)
970 d1_zero = !TYPE_MAX_VALUE (d1);
971 d2_zero = !TYPE_MAX_VALUE (d2);
973 d1_variable = (!d1_zero
974 && (TREE_CODE (TYPE_MIN_VALUE (d1)) != INTEGER_CST
975 || TREE_CODE (TYPE_MAX_VALUE (d1)) != INTEGER_CST));
976 d2_variable = (!d2_zero
977 && (TREE_CODE (TYPE_MIN_VALUE (d2)) != INTEGER_CST
978 || TREE_CODE (TYPE_MAX_VALUE (d2)) != INTEGER_CST));
979 d1_variable = d1_variable || (d1_zero && c_vla_type_p (t1));
980 d2_variable = d2_variable || (d2_zero && c_vla_type_p (t2));
982 if (d1_variable || d2_variable)
984 if (d1_zero && d2_zero)
986 if (d1_zero || d2_zero
987 || !tree_int_cst_equal (TYPE_MIN_VALUE (d1), TYPE_MIN_VALUE (d2))
988 || !tree_int_cst_equal (TYPE_MAX_VALUE (d1), TYPE_MAX_VALUE (d2)))
997 if (val != 1 && !same_translation_unit_p (t1, t2))
999 tree a1 = TYPE_ATTRIBUTES (t1);
1000 tree a2 = TYPE_ATTRIBUTES (t2);
1002 if (! attribute_list_contained (a1, a2)
1003 && ! attribute_list_contained (a2, a1))
1007 return tagged_types_tu_compatible_p (t1, t2);
1008 val = tagged_types_tu_compatible_p (t1, t2);
1013 val = TYPE_VECTOR_SUBPARTS (t1) == TYPE_VECTOR_SUBPARTS (t2)
1014 && comptypes_internal (TREE_TYPE (t1), TREE_TYPE (t2));
1020 return attrval == 2 && val == 1 ? 2 : val;
1023 /* Return 1 if TTL and TTR are pointers to types that are equivalent,
1024 ignoring their qualifiers. */
1027 comp_target_types (tree ttl, tree ttr)
1032 /* Do not lose qualifiers on element types of array types that are
1033 pointer targets by taking their TYPE_MAIN_VARIANT. */
1034 mvl = TREE_TYPE (ttl);
1035 mvr = TREE_TYPE (ttr);
1036 if (TREE_CODE (mvl) != ARRAY_TYPE)
1037 mvl = TYPE_MAIN_VARIANT (mvl);
1038 if (TREE_CODE (mvr) != ARRAY_TYPE)
1039 mvr = TYPE_MAIN_VARIANT (mvr);
1040 val = comptypes (mvl, mvr);
1042 if (val == 2 && pedantic)
1043 pedwarn ("types are not quite compatible");
1047 /* Subroutines of `comptypes'. */
1049 /* Determine whether two trees derive from the same translation unit.
1050 If the CONTEXT chain ends in a null, that tree's context is still
1051 being parsed, so if two trees have context chains ending in null,
1052 they're in the same translation unit. */
1054 same_translation_unit_p (const_tree t1, const_tree t2)
1056 while (t1 && TREE_CODE (t1) != TRANSLATION_UNIT_DECL)
1057 switch (TREE_CODE_CLASS (TREE_CODE (t1)))
1059 case tcc_declaration:
1060 t1 = DECL_CONTEXT (t1); break;
1062 t1 = TYPE_CONTEXT (t1); break;
1063 case tcc_exceptional:
1064 t1 = BLOCK_SUPERCONTEXT (t1); break; /* assume block */
1065 default: gcc_unreachable ();
1068 while (t2 && TREE_CODE (t2) != TRANSLATION_UNIT_DECL)
1069 switch (TREE_CODE_CLASS (TREE_CODE (t2)))
1071 case tcc_declaration:
1072 t2 = DECL_CONTEXT (t2); break;
1074 t2 = TYPE_CONTEXT (t2); break;
1075 case tcc_exceptional:
1076 t2 = BLOCK_SUPERCONTEXT (t2); break; /* assume block */
1077 default: gcc_unreachable ();
1083 /* Allocate the seen two types, assuming that they are compatible. */
1085 static struct tagged_tu_seen_cache *
1086 alloc_tagged_tu_seen_cache (const_tree t1, const_tree t2)
1088 struct tagged_tu_seen_cache *tu = XNEW (struct tagged_tu_seen_cache);
1089 tu->next = tagged_tu_seen_base;
1093 tagged_tu_seen_base = tu;
1095 /* The C standard says that two structures in different translation
1096 units are compatible with each other only if the types of their
1097 fields are compatible (among other things). We assume that they
1098 are compatible until proven otherwise when building the cache.
1099 An example where this can occur is:
1104 If we are comparing this against a similar struct in another TU,
1105 and did not assume they were compatible, we end up with an infinite
1111 /* Free the seen types until we get to TU_TIL. */
1114 free_all_tagged_tu_seen_up_to (const struct tagged_tu_seen_cache *tu_til)
1116 const struct tagged_tu_seen_cache *tu = tagged_tu_seen_base;
1117 while (tu != tu_til)
1119 const struct tagged_tu_seen_cache *const tu1
1120 = (const struct tagged_tu_seen_cache *) tu;
1122 free (CONST_CAST (struct tagged_tu_seen_cache *, tu1));
1124 tagged_tu_seen_base = tu_til;
1127 /* Return 1 if two 'struct', 'union', or 'enum' types T1 and T2 are
1128 compatible. If the two types are not the same (which has been
1129 checked earlier), this can only happen when multiple translation
1130 units are being compiled. See C99 6.2.7 paragraph 1 for the exact
1134 tagged_types_tu_compatible_p (const_tree t1, const_tree t2)
1137 bool needs_warning = false;
1139 /* We have to verify that the tags of the types are the same. This
1140 is harder than it looks because this may be a typedef, so we have
1141 to go look at the original type. It may even be a typedef of a
1143 In the case of compiler-created builtin structs the TYPE_DECL
1144 may be a dummy, with no DECL_ORIGINAL_TYPE. Don't fault. */
1145 while (TYPE_NAME (t1)
1146 && TREE_CODE (TYPE_NAME (t1)) == TYPE_DECL
1147 && DECL_ORIGINAL_TYPE (TYPE_NAME (t1)))
1148 t1 = DECL_ORIGINAL_TYPE (TYPE_NAME (t1));
1150 while (TYPE_NAME (t2)
1151 && TREE_CODE (TYPE_NAME (t2)) == TYPE_DECL
1152 && DECL_ORIGINAL_TYPE (TYPE_NAME (t2)))
1153 t2 = DECL_ORIGINAL_TYPE (TYPE_NAME (t2));
1155 /* C90 didn't have the requirement that the two tags be the same. */
1156 if (flag_isoc99 && TYPE_NAME (t1) != TYPE_NAME (t2))
1159 /* C90 didn't say what happened if one or both of the types were
1160 incomplete; we choose to follow C99 rules here, which is that they
1162 if (TYPE_SIZE (t1) == NULL
1163 || TYPE_SIZE (t2) == NULL)
1167 const struct tagged_tu_seen_cache * tts_i;
1168 for (tts_i = tagged_tu_seen_base; tts_i != NULL; tts_i = tts_i->next)
1169 if (tts_i->t1 == t1 && tts_i->t2 == t2)
1173 switch (TREE_CODE (t1))
1177 struct tagged_tu_seen_cache *tu = alloc_tagged_tu_seen_cache (t1, t2);
1178 /* Speed up the case where the type values are in the same order. */
1179 tree tv1 = TYPE_VALUES (t1);
1180 tree tv2 = TYPE_VALUES (t2);
1187 for (;tv1 && tv2; tv1 = TREE_CHAIN (tv1), tv2 = TREE_CHAIN (tv2))
1189 if (TREE_PURPOSE (tv1) != TREE_PURPOSE (tv2))
1191 if (simple_cst_equal (TREE_VALUE (tv1), TREE_VALUE (tv2)) != 1)
1198 if (tv1 == NULL_TREE && tv2 == NULL_TREE)
1202 if (tv1 == NULL_TREE || tv2 == NULL_TREE)
1208 if (list_length (TYPE_VALUES (t1)) != list_length (TYPE_VALUES (t2)))
1214 for (s1 = TYPE_VALUES (t1); s1; s1 = TREE_CHAIN (s1))
1216 s2 = purpose_member (TREE_PURPOSE (s1), TYPE_VALUES (t2));
1218 || simple_cst_equal (TREE_VALUE (s1), TREE_VALUE (s2)) != 1)
1229 struct tagged_tu_seen_cache *tu = alloc_tagged_tu_seen_cache (t1, t2);
1230 if (list_length (TYPE_FIELDS (t1)) != list_length (TYPE_FIELDS (t2)))
1236 /* Speed up the common case where the fields are in the same order. */
1237 for (s1 = TYPE_FIELDS (t1), s2 = TYPE_FIELDS (t2); s1 && s2;
1238 s1 = TREE_CHAIN (s1), s2 = TREE_CHAIN (s2))
1242 if (DECL_NAME (s1) != DECL_NAME (s2))
1244 result = comptypes_internal (TREE_TYPE (s1), TREE_TYPE (s2));
1246 if (result != 1 && !DECL_NAME (s1))
1254 needs_warning = true;
1256 if (TREE_CODE (s1) == FIELD_DECL
1257 && simple_cst_equal (DECL_FIELD_BIT_OFFSET (s1),
1258 DECL_FIELD_BIT_OFFSET (s2)) != 1)
1266 tu->val = needs_warning ? 2 : 1;
1270 for (s1 = TYPE_FIELDS (t1); s1; s1 = TREE_CHAIN (s1))
1274 for (s2 = TYPE_FIELDS (t2); s2; s2 = TREE_CHAIN (s2))
1275 if (DECL_NAME (s1) == DECL_NAME (s2))
1279 result = comptypes_internal (TREE_TYPE (s1), TREE_TYPE (s2));
1281 if (result != 1 && !DECL_NAME (s1))
1289 needs_warning = true;
1291 if (TREE_CODE (s1) == FIELD_DECL
1292 && simple_cst_equal (DECL_FIELD_BIT_OFFSET (s1),
1293 DECL_FIELD_BIT_OFFSET (s2)) != 1)
1305 tu->val = needs_warning ? 2 : 10;
1311 struct tagged_tu_seen_cache *tu = alloc_tagged_tu_seen_cache (t1, t2);
1313 for (s1 = TYPE_FIELDS (t1), s2 = TYPE_FIELDS (t2);
1315 s1 = TREE_CHAIN (s1), s2 = TREE_CHAIN (s2))
1318 if (TREE_CODE (s1) != TREE_CODE (s2)
1319 || DECL_NAME (s1) != DECL_NAME (s2))
1321 result = comptypes_internal (TREE_TYPE (s1), TREE_TYPE (s2));
1325 needs_warning = true;
1327 if (TREE_CODE (s1) == FIELD_DECL
1328 && simple_cst_equal (DECL_FIELD_BIT_OFFSET (s1),
1329 DECL_FIELD_BIT_OFFSET (s2)) != 1)
1335 tu->val = needs_warning ? 2 : 1;
1344 /* Return 1 if two function types F1 and F2 are compatible.
1345 If either type specifies no argument types,
1346 the other must specify a fixed number of self-promoting arg types.
1347 Otherwise, if one type specifies only the number of arguments,
1348 the other must specify that number of self-promoting arg types.
1349 Otherwise, the argument types must match. */
1352 function_types_compatible_p (const_tree f1, const_tree f2)
1355 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1360 ret1 = TREE_TYPE (f1);
1361 ret2 = TREE_TYPE (f2);
1363 /* 'volatile' qualifiers on a function's return type used to mean
1364 the function is noreturn. */
1365 if (TYPE_VOLATILE (ret1) != TYPE_VOLATILE (ret2))
1366 pedwarn ("function return types not compatible due to %<volatile%>");
1367 if (TYPE_VOLATILE (ret1))
1368 ret1 = build_qualified_type (TYPE_MAIN_VARIANT (ret1),
1369 TYPE_QUALS (ret1) & ~TYPE_QUAL_VOLATILE);
1370 if (TYPE_VOLATILE (ret2))
1371 ret2 = build_qualified_type (TYPE_MAIN_VARIANT (ret2),
1372 TYPE_QUALS (ret2) & ~TYPE_QUAL_VOLATILE);
1373 val = comptypes_internal (ret1, ret2);
1377 args1 = TYPE_ARG_TYPES (f1);
1378 args2 = TYPE_ARG_TYPES (f2);
1380 /* An unspecified parmlist matches any specified parmlist
1381 whose argument types don't need default promotions. */
1385 if (!self_promoting_args_p (args2))
1387 /* If one of these types comes from a non-prototype fn definition,
1388 compare that with the other type's arglist.
1389 If they don't match, ask for a warning (but no error). */
1390 if (TYPE_ACTUAL_ARG_TYPES (f1)
1391 && 1 != type_lists_compatible_p (args2, TYPE_ACTUAL_ARG_TYPES (f1)))
1397 if (!self_promoting_args_p (args1))
1399 if (TYPE_ACTUAL_ARG_TYPES (f2)
1400 && 1 != type_lists_compatible_p (args1, TYPE_ACTUAL_ARG_TYPES (f2)))
1405 /* Both types have argument lists: compare them and propagate results. */
1406 val1 = type_lists_compatible_p (args1, args2);
1407 return val1 != 1 ? val1 : val;
1410 /* Check two lists of types for compatibility,
1411 returning 0 for incompatible, 1 for compatible,
1412 or 2 for compatible with warning. */
1415 type_lists_compatible_p (const_tree args1, const_tree args2)
1417 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1423 tree a1, mv1, a2, mv2;
1424 if (args1 == 0 && args2 == 0)
1426 /* If one list is shorter than the other,
1427 they fail to match. */
1428 if (args1 == 0 || args2 == 0)
1430 mv1 = a1 = TREE_VALUE (args1);
1431 mv2 = a2 = TREE_VALUE (args2);
1432 if (mv1 && mv1 != error_mark_node && TREE_CODE (mv1) != ARRAY_TYPE)
1433 mv1 = TYPE_MAIN_VARIANT (mv1);
1434 if (mv2 && mv2 != error_mark_node && TREE_CODE (mv2) != ARRAY_TYPE)
1435 mv2 = TYPE_MAIN_VARIANT (mv2);
1436 /* A null pointer instead of a type
1437 means there is supposed to be an argument
1438 but nothing is specified about what type it has.
1439 So match anything that self-promotes. */
1442 if (c_type_promotes_to (a2) != a2)
1447 if (c_type_promotes_to (a1) != a1)
1450 /* If one of the lists has an error marker, ignore this arg. */
1451 else if (TREE_CODE (a1) == ERROR_MARK
1452 || TREE_CODE (a2) == ERROR_MARK)
1454 else if (!(newval = comptypes_internal (mv1, mv2)))
1456 /* Allow wait (union {union wait *u; int *i} *)
1457 and wait (union wait *) to be compatible. */
1458 if (TREE_CODE (a1) == UNION_TYPE
1459 && (TYPE_NAME (a1) == 0
1460 || TYPE_TRANSPARENT_UNION (a1))
1461 && TREE_CODE (TYPE_SIZE (a1)) == INTEGER_CST
1462 && tree_int_cst_equal (TYPE_SIZE (a1),
1466 for (memb = TYPE_FIELDS (a1);
1467 memb; memb = TREE_CHAIN (memb))
1469 tree mv3 = TREE_TYPE (memb);
1470 if (mv3 && mv3 != error_mark_node
1471 && TREE_CODE (mv3) != ARRAY_TYPE)
1472 mv3 = TYPE_MAIN_VARIANT (mv3);
1473 if (comptypes_internal (mv3, mv2))
1479 else if (TREE_CODE (a2) == UNION_TYPE
1480 && (TYPE_NAME (a2) == 0
1481 || TYPE_TRANSPARENT_UNION (a2))
1482 && TREE_CODE (TYPE_SIZE (a2)) == INTEGER_CST
1483 && tree_int_cst_equal (TYPE_SIZE (a2),
1487 for (memb = TYPE_FIELDS (a2);
1488 memb; memb = TREE_CHAIN (memb))
1490 tree mv3 = TREE_TYPE (memb);
1491 if (mv3 && mv3 != error_mark_node
1492 && TREE_CODE (mv3) != ARRAY_TYPE)
1493 mv3 = TYPE_MAIN_VARIANT (mv3);
1494 if (comptypes_internal (mv3, mv1))
1504 /* comptypes said ok, but record if it said to warn. */
1508 args1 = TREE_CHAIN (args1);
1509 args2 = TREE_CHAIN (args2);
1513 /* Compute the size to increment a pointer by. */
1516 c_size_in_bytes (const_tree type)
1518 enum tree_code code = TREE_CODE (type);
1520 if (code == FUNCTION_TYPE || code == VOID_TYPE || code == ERROR_MARK)
1521 return size_one_node;
1523 if (!COMPLETE_OR_VOID_TYPE_P (type))
1525 error ("arithmetic on pointer to an incomplete type");
1526 return size_one_node;
1529 /* Convert in case a char is more than one unit. */
1530 return size_binop (CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type),
1531 size_int (TYPE_PRECISION (char_type_node)
1535 /* Return either DECL or its known constant value (if it has one). */
1538 decl_constant_value (tree decl)
1540 if (/* Don't change a variable array bound or initial value to a constant
1541 in a place where a variable is invalid. Note that DECL_INITIAL
1542 isn't valid for a PARM_DECL. */
1543 current_function_decl != 0
1544 && TREE_CODE (decl) != PARM_DECL
1545 && !TREE_THIS_VOLATILE (decl)
1546 && TREE_READONLY (decl)
1547 && DECL_INITIAL (decl) != 0
1548 && TREE_CODE (DECL_INITIAL (decl)) != ERROR_MARK
1549 /* This is invalid if initial value is not constant.
1550 If it has either a function call, a memory reference,
1551 or a variable, then re-evaluating it could give different results. */
1552 && TREE_CONSTANT (DECL_INITIAL (decl))
1553 /* Check for cases where this is sub-optimal, even though valid. */
1554 && TREE_CODE (DECL_INITIAL (decl)) != CONSTRUCTOR)
1555 return DECL_INITIAL (decl);
1559 /* Return either DECL or its known constant value (if it has one), but
1560 return DECL if pedantic or DECL has mode BLKmode. This is for
1561 bug-compatibility with the old behavior of decl_constant_value
1562 (before GCC 3.0); every use of this function is a bug and it should
1563 be removed before GCC 3.1. It is not appropriate to use pedantic
1564 in a way that affects optimization, and BLKmode is probably not the
1565 right test for avoiding misoptimizations either. */
1568 decl_constant_value_for_broken_optimization (tree decl)
1572 if (pedantic || DECL_MODE (decl) == BLKmode)
1575 ret = decl_constant_value (decl);
1576 /* Avoid unwanted tree sharing between the initializer and current
1577 function's body where the tree can be modified e.g. by the
1579 if (ret != decl && TREE_STATIC (decl))
1580 ret = unshare_expr (ret);
1584 /* Convert the array expression EXP to a pointer. */
1586 array_to_pointer_conversion (tree exp)
1588 tree orig_exp = exp;
1589 tree type = TREE_TYPE (exp);
1591 tree restype = TREE_TYPE (type);
1594 gcc_assert (TREE_CODE (type) == ARRAY_TYPE);
1596 STRIP_TYPE_NOPS (exp);
1598 if (TREE_NO_WARNING (orig_exp))
1599 TREE_NO_WARNING (exp) = 1;
1601 ptrtype = build_pointer_type (restype);
1603 if (TREE_CODE (exp) == INDIRECT_REF)
1604 return convert (ptrtype, TREE_OPERAND (exp, 0));
1606 if (TREE_CODE (exp) == VAR_DECL)
1608 /* We are making an ADDR_EXPR of ptrtype. This is a valid
1609 ADDR_EXPR because it's the best way of representing what
1610 happens in C when we take the address of an array and place
1611 it in a pointer to the element type. */
1612 adr = build1 (ADDR_EXPR, ptrtype, exp);
1613 if (!c_mark_addressable (exp))
1614 return error_mark_node;
1615 TREE_SIDE_EFFECTS (adr) = 0; /* Default would be, same as EXP. */
1619 /* This way is better for a COMPONENT_REF since it can
1620 simplify the offset for a component. */
1621 adr = build_unary_op (ADDR_EXPR, exp, 1);
1622 return convert (ptrtype, adr);
1625 /* Convert the function expression EXP to a pointer. */
1627 function_to_pointer_conversion (tree exp)
1629 tree orig_exp = exp;
1631 gcc_assert (TREE_CODE (TREE_TYPE (exp)) == FUNCTION_TYPE);
1633 STRIP_TYPE_NOPS (exp);
1635 if (TREE_NO_WARNING (orig_exp))
1636 TREE_NO_WARNING (exp) = 1;
1638 return build_unary_op (ADDR_EXPR, exp, 0);
1641 /* Perform the default conversion of arrays and functions to pointers.
1642 Return the result of converting EXP. For any other expression, just
1643 return EXP after removing NOPs. */
1646 default_function_array_conversion (struct c_expr exp)
1648 tree orig_exp = exp.value;
1649 tree type = TREE_TYPE (exp.value);
1650 enum tree_code code = TREE_CODE (type);
1656 bool not_lvalue = false;
1657 bool lvalue_array_p;
1659 while ((TREE_CODE (exp.value) == NON_LVALUE_EXPR
1660 || TREE_CODE (exp.value) == NOP_EXPR
1661 || TREE_CODE (exp.value) == CONVERT_EXPR)
1662 && TREE_TYPE (TREE_OPERAND (exp.value, 0)) == type)
1664 if (TREE_CODE (exp.value) == NON_LVALUE_EXPR)
1666 exp.value = TREE_OPERAND (exp.value, 0);
1669 if (TREE_NO_WARNING (orig_exp))
1670 TREE_NO_WARNING (exp.value) = 1;
1672 lvalue_array_p = !not_lvalue && lvalue_p (exp.value);
1673 if (!flag_isoc99 && !lvalue_array_p)
1675 /* Before C99, non-lvalue arrays do not decay to pointers.
1676 Normally, using such an array would be invalid; but it can
1677 be used correctly inside sizeof or as a statement expression.
1678 Thus, do not give an error here; an error will result later. */
1682 exp.value = array_to_pointer_conversion (exp.value);
1686 exp.value = function_to_pointer_conversion (exp.value);
1689 STRIP_TYPE_NOPS (exp.value);
1690 if (TREE_NO_WARNING (orig_exp))
1691 TREE_NO_WARNING (exp.value) = 1;
1699 /* EXP is an expression of integer type. Apply the integer promotions
1700 to it and return the promoted value. */
1703 perform_integral_promotions (tree exp)
1705 tree type = TREE_TYPE (exp);
1706 enum tree_code code = TREE_CODE (type);
1708 gcc_assert (INTEGRAL_TYPE_P (type));
1710 /* Normally convert enums to int,
1711 but convert wide enums to something wider. */
1712 if (code == ENUMERAL_TYPE)
1714 type = c_common_type_for_size (MAX (TYPE_PRECISION (type),
1715 TYPE_PRECISION (integer_type_node)),
1716 ((TYPE_PRECISION (type)
1717 >= TYPE_PRECISION (integer_type_node))
1718 && TYPE_UNSIGNED (type)));
1720 return convert (type, exp);
1723 /* ??? This should no longer be needed now bit-fields have their
1725 if (TREE_CODE (exp) == COMPONENT_REF
1726 && DECL_C_BIT_FIELD (TREE_OPERAND (exp, 1))
1727 /* If it's thinner than an int, promote it like a
1728 c_promoting_integer_type_p, otherwise leave it alone. */
1729 && 0 > compare_tree_int (DECL_SIZE (TREE_OPERAND (exp, 1)),
1730 TYPE_PRECISION (integer_type_node)))
1731 return convert (integer_type_node, exp);
1733 if (c_promoting_integer_type_p (type))
1735 /* Preserve unsignedness if not really getting any wider. */
1736 if (TYPE_UNSIGNED (type)
1737 && TYPE_PRECISION (type) == TYPE_PRECISION (integer_type_node))
1738 return convert (unsigned_type_node, exp);
1740 return convert (integer_type_node, exp);
1747 /* Perform default promotions for C data used in expressions.
1748 Enumeral types or short or char are converted to int.
1749 In addition, manifest constants symbols are replaced by their values. */
1752 default_conversion (tree exp)
1755 tree type = TREE_TYPE (exp);
1756 enum tree_code code = TREE_CODE (type);
1758 /* Functions and arrays have been converted during parsing. */
1759 gcc_assert (code != FUNCTION_TYPE);
1760 if (code == ARRAY_TYPE)
1763 /* Constants can be used directly unless they're not loadable. */
1764 if (TREE_CODE (exp) == CONST_DECL)
1765 exp = DECL_INITIAL (exp);
1767 /* Replace a nonvolatile const static variable with its value unless
1768 it is an array, in which case we must be sure that taking the
1769 address of the array produces consistent results. */
1770 else if (optimize && TREE_CODE (exp) == VAR_DECL && code != ARRAY_TYPE)
1772 exp = decl_constant_value_for_broken_optimization (exp);
1773 type = TREE_TYPE (exp);
1776 /* Strip no-op conversions. */
1778 STRIP_TYPE_NOPS (exp);
1780 if (TREE_NO_WARNING (orig_exp))
1781 TREE_NO_WARNING (exp) = 1;
1783 if (code == VOID_TYPE)
1785 error ("void value not ignored as it ought to be");
1786 return error_mark_node;
1789 exp = require_complete_type (exp);
1790 if (exp == error_mark_node)
1791 return error_mark_node;
1793 if (INTEGRAL_TYPE_P (type))
1794 return perform_integral_promotions (exp);
1799 /* Look up COMPONENT in a structure or union DECL.
1801 If the component name is not found, returns NULL_TREE. Otherwise,
1802 the return value is a TREE_LIST, with each TREE_VALUE a FIELD_DECL
1803 stepping down the chain to the component, which is in the last
1804 TREE_VALUE of the list. Normally the list is of length one, but if
1805 the component is embedded within (nested) anonymous structures or
1806 unions, the list steps down the chain to the component. */
1809 lookup_field (tree decl, tree component)
1811 tree type = TREE_TYPE (decl);
1814 /* If TYPE_LANG_SPECIFIC is set, then it is a sorted array of pointers
1815 to the field elements. Use a binary search on this array to quickly
1816 find the element. Otherwise, do a linear search. TYPE_LANG_SPECIFIC
1817 will always be set for structures which have many elements. */
1819 if (TYPE_LANG_SPECIFIC (type) && TYPE_LANG_SPECIFIC (type)->s)
1822 tree *field_array = &TYPE_LANG_SPECIFIC (type)->s->elts[0];
1824 field = TYPE_FIELDS (type);
1826 top = TYPE_LANG_SPECIFIC (type)->s->len;
1827 while (top - bot > 1)
1829 half = (top - bot + 1) >> 1;
1830 field = field_array[bot+half];
1832 if (DECL_NAME (field) == NULL_TREE)
1834 /* Step through all anon unions in linear fashion. */
1835 while (DECL_NAME (field_array[bot]) == NULL_TREE)
1837 field = field_array[bot++];
1838 if (TREE_CODE (TREE_TYPE (field)) == RECORD_TYPE
1839 || TREE_CODE (TREE_TYPE (field)) == UNION_TYPE)
1841 tree anon = lookup_field (field, component);
1844 return tree_cons (NULL_TREE, field, anon);
1848 /* Entire record is only anon unions. */
1852 /* Restart the binary search, with new lower bound. */
1856 if (DECL_NAME (field) == component)
1858 if (DECL_NAME (field) < component)
1864 if (DECL_NAME (field_array[bot]) == component)
1865 field = field_array[bot];
1866 else if (DECL_NAME (field) != component)
1871 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
1873 if (DECL_NAME (field) == NULL_TREE
1874 && (TREE_CODE (TREE_TYPE (field)) == RECORD_TYPE
1875 || TREE_CODE (TREE_TYPE (field)) == UNION_TYPE))
1877 tree anon = lookup_field (field, component);
1880 return tree_cons (NULL_TREE, field, anon);
1883 if (DECL_NAME (field) == component)
1887 if (field == NULL_TREE)
1891 return tree_cons (NULL_TREE, field, NULL_TREE);
1894 /* Make an expression to refer to the COMPONENT field of
1895 structure or union value DATUM. COMPONENT is an IDENTIFIER_NODE. */
1898 build_component_ref (tree datum, tree component)
1900 tree type = TREE_TYPE (datum);
1901 enum tree_code code = TREE_CODE (type);
1905 if (!objc_is_public (datum, component))
1906 return error_mark_node;
1908 /* See if there is a field or component with name COMPONENT. */
1910 if (code == RECORD_TYPE || code == UNION_TYPE)
1912 if (!COMPLETE_TYPE_P (type))
1914 c_incomplete_type_error (NULL_TREE, type);
1915 return error_mark_node;
1918 field = lookup_field (datum, component);
1922 error ("%qT has no member named %qE", type, component);
1923 return error_mark_node;
1926 /* Chain the COMPONENT_REFs if necessary down to the FIELD.
1927 This might be better solved in future the way the C++ front
1928 end does it - by giving the anonymous entities each a
1929 separate name and type, and then have build_component_ref
1930 recursively call itself. We can't do that here. */
1933 tree subdatum = TREE_VALUE (field);
1937 if (TREE_TYPE (subdatum) == error_mark_node)
1938 return error_mark_node;
1940 quals = TYPE_QUALS (strip_array_types (TREE_TYPE (subdatum)));
1941 quals |= TYPE_QUALS (TREE_TYPE (datum));
1942 subtype = c_build_qualified_type (TREE_TYPE (subdatum), quals);
1944 ref = build3 (COMPONENT_REF, subtype, datum, subdatum,
1946 if (TREE_READONLY (datum) || TREE_READONLY (subdatum))
1947 TREE_READONLY (ref) = 1;
1948 if (TREE_THIS_VOLATILE (datum) || TREE_THIS_VOLATILE (subdatum))
1949 TREE_THIS_VOLATILE (ref) = 1;
1951 if (TREE_DEPRECATED (subdatum))
1952 warn_deprecated_use (subdatum);
1956 field = TREE_CHAIN (field);
1962 else if (code != ERROR_MARK)
1963 error ("request for member %qE in something not a structure or union",
1966 return error_mark_node;
1969 /* Given an expression PTR for a pointer, return an expression
1970 for the value pointed to.
1971 ERRORSTRING is the name of the operator to appear in error messages. */
1974 build_indirect_ref (tree ptr, const char *errorstring)
1976 tree pointer = default_conversion (ptr);
1977 tree type = TREE_TYPE (pointer);
1979 if (TREE_CODE (type) == POINTER_TYPE)
1981 if (TREE_CODE (pointer) == CONVERT_EXPR
1982 || TREE_CODE (pointer) == NOP_EXPR
1983 || TREE_CODE (pointer) == VIEW_CONVERT_EXPR)
1985 /* If a warning is issued, mark it to avoid duplicates from
1986 the backend. This only needs to be done at
1987 warn_strict_aliasing > 2. */
1988 if (warn_strict_aliasing > 2)
1989 if (strict_aliasing_warning (TREE_TYPE (TREE_OPERAND (pointer, 0)),
1990 type, TREE_OPERAND (pointer, 0)))
1991 TREE_NO_WARNING (pointer) = 1;
1994 if (TREE_CODE (pointer) == ADDR_EXPR
1995 && (TREE_TYPE (TREE_OPERAND (pointer, 0))
1996 == TREE_TYPE (type)))
1997 return TREE_OPERAND (pointer, 0);
2000 tree t = TREE_TYPE (type);
2003 ref = build1 (INDIRECT_REF, t, pointer);
2005 if (!COMPLETE_OR_VOID_TYPE_P (t) && TREE_CODE (t) != ARRAY_TYPE)
2007 error ("dereferencing pointer to incomplete type");
2008 return error_mark_node;
2010 if (VOID_TYPE_P (t) && skip_evaluation == 0)
2011 warning (0, "dereferencing %<void *%> pointer");
2013 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
2014 so that we get the proper error message if the result is used
2015 to assign to. Also, &* is supposed to be a no-op.
2016 And ANSI C seems to specify that the type of the result
2017 should be the const type. */
2018 /* A de-reference of a pointer to const is not a const. It is valid
2019 to change it via some other pointer. */
2020 TREE_READONLY (ref) = TYPE_READONLY (t);
2021 TREE_SIDE_EFFECTS (ref)
2022 = TYPE_VOLATILE (t) || TREE_SIDE_EFFECTS (pointer);
2023 TREE_THIS_VOLATILE (ref) = TYPE_VOLATILE (t);
2027 else if (TREE_CODE (pointer) != ERROR_MARK)
2028 error ("invalid type argument of %qs (have %qT)", errorstring, type);
2029 return error_mark_node;
2032 /* This handles expressions of the form "a[i]", which denotes
2035 This is logically equivalent in C to *(a+i), but we may do it differently.
2036 If A is a variable or a member, we generate a primitive ARRAY_REF.
2037 This avoids forcing the array out of registers, and can work on
2038 arrays that are not lvalues (for example, members of structures returned
2042 build_array_ref (tree array, tree index)
2044 bool swapped = false;
2045 if (TREE_TYPE (array) == error_mark_node
2046 || TREE_TYPE (index) == error_mark_node)
2047 return error_mark_node;
2049 if (TREE_CODE (TREE_TYPE (array)) != ARRAY_TYPE
2050 && TREE_CODE (TREE_TYPE (array)) != POINTER_TYPE)
2053 if (TREE_CODE (TREE_TYPE (index)) != ARRAY_TYPE
2054 && TREE_CODE (TREE_TYPE (index)) != POINTER_TYPE)
2056 error ("subscripted value is neither array nor pointer");
2057 return error_mark_node;
2065 if (!INTEGRAL_TYPE_P (TREE_TYPE (index)))
2067 error ("array subscript is not an integer");
2068 return error_mark_node;
2071 if (TREE_CODE (TREE_TYPE (TREE_TYPE (array))) == FUNCTION_TYPE)
2073 error ("subscripted value is pointer to function");
2074 return error_mark_node;
2077 /* ??? Existing practice has been to warn only when the char
2078 index is syntactically the index, not for char[array]. */
2080 warn_array_subscript_with_type_char (index);
2082 /* Apply default promotions *after* noticing character types. */
2083 index = default_conversion (index);
2085 gcc_assert (TREE_CODE (TREE_TYPE (index)) == INTEGER_TYPE);
2087 if (TREE_CODE (TREE_TYPE (array)) == ARRAY_TYPE)
2091 /* An array that is indexed by a non-constant
2092 cannot be stored in a register; we must be able to do
2093 address arithmetic on its address.
2094 Likewise an array of elements of variable size. */
2095 if (TREE_CODE (index) != INTEGER_CST
2096 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array)))
2097 && TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array)))) != INTEGER_CST))
2099 if (!c_mark_addressable (array))
2100 return error_mark_node;
2102 /* An array that is indexed by a constant value which is not within
2103 the array bounds cannot be stored in a register either; because we
2104 would get a crash in store_bit_field/extract_bit_field when trying
2105 to access a non-existent part of the register. */
2106 if (TREE_CODE (index) == INTEGER_CST
2107 && TYPE_DOMAIN (TREE_TYPE (array))
2108 && !int_fits_type_p (index, TYPE_DOMAIN (TREE_TYPE (array))))
2110 if (!c_mark_addressable (array))
2111 return error_mark_node;
2117 while (TREE_CODE (foo) == COMPONENT_REF)
2118 foo = TREE_OPERAND (foo, 0);
2119 if (TREE_CODE (foo) == VAR_DECL && C_DECL_REGISTER (foo))
2120 pedwarn ("ISO C forbids subscripting %<register%> array");
2121 else if (!flag_isoc99 && !lvalue_p (foo))
2122 pedwarn ("ISO C90 forbids subscripting non-lvalue array");
2125 type = TREE_TYPE (TREE_TYPE (array));
2126 rval = build4 (ARRAY_REF, type, array, index, NULL_TREE, NULL_TREE);
2127 /* Array ref is const/volatile if the array elements are
2128 or if the array is. */
2129 TREE_READONLY (rval)
2130 |= (TYPE_READONLY (TREE_TYPE (TREE_TYPE (array)))
2131 | TREE_READONLY (array));
2132 TREE_SIDE_EFFECTS (rval)
2133 |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array)))
2134 | TREE_SIDE_EFFECTS (array));
2135 TREE_THIS_VOLATILE (rval)
2136 |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array)))
2137 /* This was added by rms on 16 Nov 91.
2138 It fixes vol struct foo *a; a->elts[1]
2139 in an inline function.
2140 Hope it doesn't break something else. */
2141 | TREE_THIS_VOLATILE (array));
2142 return require_complete_type (fold (rval));
2146 tree ar = default_conversion (array);
2148 if (ar == error_mark_node)
2151 gcc_assert (TREE_CODE (TREE_TYPE (ar)) == POINTER_TYPE);
2152 gcc_assert (TREE_CODE (TREE_TYPE (TREE_TYPE (ar))) != FUNCTION_TYPE);
2154 return build_indirect_ref (build_binary_op (PLUS_EXPR, ar, index, 0),
2159 /* Build an external reference to identifier ID. FUN indicates
2160 whether this will be used for a function call. LOC is the source
2161 location of the identifier. */
2163 build_external_ref (tree id, int fun, location_t loc)
2166 tree decl = lookup_name (id);
2168 /* In Objective-C, an instance variable (ivar) may be preferred to
2169 whatever lookup_name() found. */
2170 decl = objc_lookup_ivar (decl, id);
2172 if (decl && decl != error_mark_node)
2175 /* Implicit function declaration. */
2176 ref = implicitly_declare (id);
2177 else if (decl == error_mark_node)
2178 /* Don't complain about something that's already been
2179 complained about. */
2180 return error_mark_node;
2183 undeclared_variable (id, loc);
2184 return error_mark_node;
2187 if (TREE_TYPE (ref) == error_mark_node)
2188 return error_mark_node;
2190 if (TREE_DEPRECATED (ref))
2191 warn_deprecated_use (ref);
2193 /* Recursive call does not count as usage. */
2194 if (ref != current_function_decl)
2196 if (!skip_evaluation)
2197 assemble_external (ref);
2198 TREE_USED (ref) = 1;
2201 if (TREE_CODE (ref) == FUNCTION_DECL && !in_alignof)
2203 if (!in_sizeof && !in_typeof)
2204 C_DECL_USED (ref) = 1;
2205 else if (DECL_INITIAL (ref) == 0
2206 && DECL_EXTERNAL (ref)
2207 && !TREE_PUBLIC (ref))
2208 record_maybe_used_decl (ref);
2211 if (TREE_CODE (ref) == CONST_DECL)
2213 used_types_insert (TREE_TYPE (ref));
2214 ref = DECL_INITIAL (ref);
2215 TREE_CONSTANT (ref) = 1;
2217 else if (current_function_decl != 0
2218 && !DECL_FILE_SCOPE_P (current_function_decl)
2219 && (TREE_CODE (ref) == VAR_DECL
2220 || TREE_CODE (ref) == PARM_DECL
2221 || TREE_CODE (ref) == FUNCTION_DECL))
2223 tree context = decl_function_context (ref);
2225 if (context != 0 && context != current_function_decl)
2226 DECL_NONLOCAL (ref) = 1;
2228 /* C99 6.7.4p3: An inline definition of a function with external
2229 linkage ... shall not contain a reference to an identifier with
2230 internal linkage. */
2231 else if (current_function_decl != 0
2232 && DECL_DECLARED_INLINE_P (current_function_decl)
2233 && DECL_EXTERNAL (current_function_decl)
2234 && VAR_OR_FUNCTION_DECL_P (ref)
2235 && (TREE_CODE (ref) != VAR_DECL || TREE_STATIC (ref))
2236 && ! TREE_PUBLIC (ref)
2237 && DECL_CONTEXT (ref) != current_function_decl)
2238 pedwarn ("%H%qD is static but used in inline function %qD "
2239 "which is not static", &loc, ref, current_function_decl);
2244 /* Record details of decls possibly used inside sizeof or typeof. */
2245 struct maybe_used_decl
2249 /* The level seen at (in_sizeof + in_typeof). */
2251 /* The next one at this level or above, or NULL. */
2252 struct maybe_used_decl *next;
2255 static struct maybe_used_decl *maybe_used_decls;
2257 /* Record that DECL, an undefined static function reference seen
2258 inside sizeof or typeof, might be used if the operand of sizeof is
2259 a VLA type or the operand of typeof is a variably modified
2263 record_maybe_used_decl (tree decl)
2265 struct maybe_used_decl *t = XOBNEW (&parser_obstack, struct maybe_used_decl);
2267 t->level = in_sizeof + in_typeof;
2268 t->next = maybe_used_decls;
2269 maybe_used_decls = t;
2272 /* Pop the stack of decls possibly used inside sizeof or typeof. If
2273 USED is false, just discard them. If it is true, mark them used
2274 (if no longer inside sizeof or typeof) or move them to the next
2275 level up (if still inside sizeof or typeof). */
2278 pop_maybe_used (bool used)
2280 struct maybe_used_decl *p = maybe_used_decls;
2281 int cur_level = in_sizeof + in_typeof;
2282 while (p && p->level > cur_level)
2287 C_DECL_USED (p->decl) = 1;
2289 p->level = cur_level;
2293 if (!used || cur_level == 0)
2294 maybe_used_decls = p;
2297 /* Return the result of sizeof applied to EXPR. */
2300 c_expr_sizeof_expr (struct c_expr expr)
2303 if (expr.value == error_mark_node)
2305 ret.value = error_mark_node;
2306 ret.original_code = ERROR_MARK;
2307 pop_maybe_used (false);
2311 ret.value = c_sizeof (TREE_TYPE (expr.value));
2312 ret.original_code = ERROR_MARK;
2313 if (c_vla_type_p (TREE_TYPE (expr.value)))
2315 /* sizeof is evaluated when given a vla (C99 6.5.3.4p2). */
2316 ret.value = build2 (COMPOUND_EXPR, TREE_TYPE (ret.value), expr.value, ret.value);
2318 pop_maybe_used (C_TYPE_VARIABLE_SIZE (TREE_TYPE (expr.value)));
2323 /* Return the result of sizeof applied to T, a structure for the type
2324 name passed to sizeof (rather than the type itself). */
2327 c_expr_sizeof_type (struct c_type_name *t)
2331 type = groktypename (t);
2332 ret.value = c_sizeof (type);
2333 ret.original_code = ERROR_MARK;
2334 pop_maybe_used (type != error_mark_node
2335 ? C_TYPE_VARIABLE_SIZE (type) : false);
2339 /* Build a function call to function FUNCTION with parameters PARAMS.
2340 PARAMS is a list--a chain of TREE_LIST nodes--in which the
2341 TREE_VALUE of each node is a parameter-expression.
2342 FUNCTION's data type may be a function type or a pointer-to-function. */
2345 build_function_call (tree function, tree params)
2347 tree fntype, fundecl = 0;
2348 tree name = NULL_TREE, result;
2354 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
2355 STRIP_TYPE_NOPS (function);
2357 /* Convert anything with function type to a pointer-to-function. */
2358 if (TREE_CODE (function) == FUNCTION_DECL)
2360 /* Implement type-directed function overloading for builtins.
2361 resolve_overloaded_builtin and targetm.resolve_overloaded_builtin
2362 handle all the type checking. The result is a complete expression
2363 that implements this function call. */
2364 tem = resolve_overloaded_builtin (function, params);
2368 name = DECL_NAME (function);
2371 if (TREE_CODE (TREE_TYPE (function)) == FUNCTION_TYPE)
2372 function = function_to_pointer_conversion (function);
2374 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
2375 expressions, like those used for ObjC messenger dispatches. */
2376 function = objc_rewrite_function_call (function, params);
2378 fntype = TREE_TYPE (function);
2380 if (TREE_CODE (fntype) == ERROR_MARK)
2381 return error_mark_node;
2383 if (!(TREE_CODE (fntype) == POINTER_TYPE
2384 && TREE_CODE (TREE_TYPE (fntype)) == FUNCTION_TYPE))
2386 error ("called object %qE is not a function", function);
2387 return error_mark_node;
2390 if (fundecl && TREE_THIS_VOLATILE (fundecl))
2391 current_function_returns_abnormally = 1;
2393 /* fntype now gets the type of function pointed to. */
2394 fntype = TREE_TYPE (fntype);
2396 /* Check that the function is called through a compatible prototype.
2397 If it is not, replace the call by a trap, wrapped up in a compound
2398 expression if necessary. This has the nice side-effect to prevent
2399 the tree-inliner from generating invalid assignment trees which may
2400 blow up in the RTL expander later. */
2401 if ((TREE_CODE (function) == NOP_EXPR
2402 || TREE_CODE (function) == CONVERT_EXPR)
2403 && TREE_CODE (tem = TREE_OPERAND (function, 0)) == ADDR_EXPR
2404 && TREE_CODE (tem = TREE_OPERAND (tem, 0)) == FUNCTION_DECL
2405 && !comptypes (fntype, TREE_TYPE (tem)))
2407 tree return_type = TREE_TYPE (fntype);
2408 tree trap = build_function_call (built_in_decls[BUILT_IN_TRAP],
2411 /* This situation leads to run-time undefined behavior. We can't,
2412 therefore, simply error unless we can prove that all possible
2413 executions of the program must execute the code. */
2414 warning (0, "function called through a non-compatible type");
2416 /* We can, however, treat "undefined" any way we please.
2417 Call abort to encourage the user to fix the program. */
2418 inform ("if this code is reached, the program will abort");
2420 if (VOID_TYPE_P (return_type))
2426 if (AGGREGATE_TYPE_P (return_type))
2427 rhs = build_compound_literal (return_type,
2428 build_constructor (return_type, 0));
2430 rhs = fold_convert (return_type, integer_zero_node);
2432 return build2 (COMPOUND_EXPR, return_type, trap, rhs);
2436 /* Convert the parameters to the types declared in the
2437 function prototype, or apply default promotions. */
2439 nargs = list_length (params);
2440 argarray = (tree *) alloca (nargs * sizeof (tree));
2441 nargs = convert_arguments (nargs, argarray, TYPE_ARG_TYPES (fntype),
2442 params, function, fundecl);
2444 return error_mark_node;
2446 /* Check that arguments to builtin functions match the expectations. */
2448 && DECL_BUILT_IN (fundecl)
2449 && DECL_BUILT_IN_CLASS (fundecl) == BUILT_IN_NORMAL
2450 && !check_builtin_function_arguments (fundecl, nargs, argarray))
2451 return error_mark_node;
2453 /* Check that the arguments to the function are valid. */
2454 check_function_arguments (TYPE_ATTRIBUTES (fntype), nargs, argarray,
2455 TYPE_ARG_TYPES (fntype));
2457 if (require_constant_value)
2459 result = fold_build_call_array_initializer (TREE_TYPE (fntype),
2460 function, nargs, argarray);
2461 if (TREE_CONSTANT (result)
2462 && (name == NULL_TREE
2463 || strncmp (IDENTIFIER_POINTER (name), "__builtin_", 10) != 0))
2464 pedwarn_init ("initializer element is not constant");
2467 result = fold_build_call_array (TREE_TYPE (fntype),
2468 function, nargs, argarray);
2470 if (VOID_TYPE_P (TREE_TYPE (result)))
2472 return require_complete_type (result);
2475 /* Convert the argument expressions in the list VALUES
2476 to the types in the list TYPELIST. The resulting arguments are
2477 stored in the array ARGARRAY which has size NARGS.
2479 If TYPELIST is exhausted, or when an element has NULL as its type,
2480 perform the default conversions.
2482 PARMLIST is the chain of parm decls for the function being called.
2483 It may be 0, if that info is not available.
2484 It is used only for generating error messages.
2486 FUNCTION is a tree for the called function. It is used only for
2487 error messages, where it is formatted with %qE.
2489 This is also where warnings about wrong number of args are generated.
2491 VALUES is a chain of TREE_LIST nodes with the elements of the list
2492 in the TREE_VALUE slots of those nodes.
2494 Returns the actual number of arguments processed (which may be less
2495 than NARGS in some error situations), or -1 on failure. */
2498 convert_arguments (int nargs, tree *argarray,
2499 tree typelist, tree values, tree function, tree fundecl)
2501 tree typetail, valtail;
2503 const bool type_generic = fundecl
2504 && lookup_attribute ("type generic", TYPE_ATTRIBUTES(TREE_TYPE (fundecl)));
2507 /* Change pointer to function to the function itself for
2509 if (TREE_CODE (function) == ADDR_EXPR
2510 && TREE_CODE (TREE_OPERAND (function, 0)) == FUNCTION_DECL)
2511 function = TREE_OPERAND (function, 0);
2513 /* Handle an ObjC selector specially for diagnostics. */
2514 selector = objc_message_selector ();
2516 /* Scan the given expressions and types, producing individual
2517 converted arguments and storing them in ARGARRAY. */
2519 for (valtail = values, typetail = typelist, parmnum = 0;
2521 valtail = TREE_CHAIN (valtail), parmnum++)
2523 tree type = typetail ? TREE_VALUE (typetail) : 0;
2524 tree val = TREE_VALUE (valtail);
2525 tree rname = function;
2526 int argnum = parmnum + 1;
2527 const char *invalid_func_diag;
2529 if (type == void_type_node)
2531 error ("too many arguments to function %qE", function);
2535 if (selector && argnum > 2)
2541 STRIP_TYPE_NOPS (val);
2543 val = require_complete_type (val);
2547 /* Formal parm type is specified by a function prototype. */
2550 if (type == error_mark_node || !COMPLETE_TYPE_P (type))
2552 error ("type of formal parameter %d is incomplete", parmnum + 1);
2557 /* Optionally warn about conversions that
2558 differ from the default conversions. */
2559 if (warn_traditional_conversion || warn_traditional)
2561 unsigned int formal_prec = TYPE_PRECISION (type);
2563 if (INTEGRAL_TYPE_P (type)
2564 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
2565 warning (0, "passing argument %d of %qE as integer "
2566 "rather than floating due to prototype",
2568 if (INTEGRAL_TYPE_P (type)
2569 && TREE_CODE (TREE_TYPE (val)) == COMPLEX_TYPE)
2570 warning (0, "passing argument %d of %qE as integer "
2571 "rather than complex due to prototype",
2573 else if (TREE_CODE (type) == COMPLEX_TYPE
2574 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
2575 warning (0, "passing argument %d of %qE as complex "
2576 "rather than floating due to prototype",
2578 else if (TREE_CODE (type) == REAL_TYPE
2579 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
2580 warning (0, "passing argument %d of %qE as floating "
2581 "rather than integer due to prototype",
2583 else if (TREE_CODE (type) == COMPLEX_TYPE
2584 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
2585 warning (0, "passing argument %d of %qE as complex "
2586 "rather than integer due to prototype",
2588 else if (TREE_CODE (type) == REAL_TYPE
2589 && TREE_CODE (TREE_TYPE (val)) == COMPLEX_TYPE)
2590 warning (0, "passing argument %d of %qE as floating "
2591 "rather than complex due to prototype",
2593 /* ??? At some point, messages should be written about
2594 conversions between complex types, but that's too messy
2596 else if (TREE_CODE (type) == REAL_TYPE
2597 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
2599 /* Warn if any argument is passed as `float',
2600 since without a prototype it would be `double'. */
2601 if (formal_prec == TYPE_PRECISION (float_type_node)
2602 && type != dfloat32_type_node)
2603 warning (0, "passing argument %d of %qE as %<float%> "
2604 "rather than %<double%> due to prototype",
2607 /* Warn if mismatch between argument and prototype
2608 for decimal float types. Warn of conversions with
2609 binary float types and of precision narrowing due to
2611 else if (type != TREE_TYPE (val)
2612 && (type == dfloat32_type_node
2613 || type == dfloat64_type_node
2614 || type == dfloat128_type_node
2615 || TREE_TYPE (val) == dfloat32_type_node
2616 || TREE_TYPE (val) == dfloat64_type_node
2617 || TREE_TYPE (val) == dfloat128_type_node)
2619 <= TYPE_PRECISION (TREE_TYPE (val))
2620 || (type == dfloat128_type_node
2622 != dfloat64_type_node
2624 != dfloat32_type_node)))
2625 || (type == dfloat64_type_node
2627 != dfloat32_type_node))))
2628 warning (0, "passing argument %d of %qE as %qT "
2629 "rather than %qT due to prototype",
2630 argnum, rname, type, TREE_TYPE (val));
2633 /* Detect integer changing in width or signedness.
2634 These warnings are only activated with
2635 -Wtraditional-conversion, not with -Wtraditional. */
2636 else if (warn_traditional_conversion && INTEGRAL_TYPE_P (type)
2637 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
2639 tree would_have_been = default_conversion (val);
2640 tree type1 = TREE_TYPE (would_have_been);
2642 if (TREE_CODE (type) == ENUMERAL_TYPE
2643 && (TYPE_MAIN_VARIANT (type)
2644 == TYPE_MAIN_VARIANT (TREE_TYPE (val))))
2645 /* No warning if function asks for enum
2646 and the actual arg is that enum type. */
2648 else if (formal_prec != TYPE_PRECISION (type1))
2649 warning (OPT_Wtraditional_conversion, "passing argument %d of %qE "
2650 "with different width due to prototype",
2652 else if (TYPE_UNSIGNED (type) == TYPE_UNSIGNED (type1))
2654 /* Don't complain if the formal parameter type
2655 is an enum, because we can't tell now whether
2656 the value was an enum--even the same enum. */
2657 else if (TREE_CODE (type) == ENUMERAL_TYPE)
2659 else if (TREE_CODE (val) == INTEGER_CST
2660 && int_fits_type_p (val, type))
2661 /* Change in signedness doesn't matter
2662 if a constant value is unaffected. */
2664 /* If the value is extended from a narrower
2665 unsigned type, it doesn't matter whether we
2666 pass it as signed or unsigned; the value
2667 certainly is the same either way. */
2668 else if (TYPE_PRECISION (TREE_TYPE (val)) < TYPE_PRECISION (type)
2669 && TYPE_UNSIGNED (TREE_TYPE (val)))
2671 else if (TYPE_UNSIGNED (type))
2672 warning (OPT_Wtraditional_conversion, "passing argument %d of %qE "
2673 "as unsigned due to prototype",
2676 warning (OPT_Wtraditional_conversion, "passing argument %d of %qE "
2677 "as signed due to prototype", argnum, rname);
2681 parmval = convert_for_assignment (type, val, ic_argpass,
2685 if (targetm.calls.promote_prototypes (fundecl ? TREE_TYPE (fundecl) : 0)
2686 && INTEGRAL_TYPE_P (type)
2687 && (TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node)))
2688 parmval = default_conversion (parmval);
2690 argarray[parmnum] = parmval;
2692 else if (TREE_CODE (TREE_TYPE (val)) == REAL_TYPE
2693 && (TYPE_PRECISION (TREE_TYPE (val))
2694 < TYPE_PRECISION (double_type_node))
2695 && !DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (val))))
2698 argarray[parmnum] = val;
2700 /* Convert `float' to `double'. */
2701 argarray[parmnum] = convert (double_type_node, val);
2703 else if ((invalid_func_diag =
2704 targetm.calls.invalid_arg_for_unprototyped_fn (typelist, fundecl, val)))
2706 error (invalid_func_diag);
2710 /* Convert `short' and `char' to full-size `int'. */
2711 argarray[parmnum] = default_conversion (val);
2714 typetail = TREE_CHAIN (typetail);
2717 gcc_assert (parmnum == nargs);
2719 if (typetail != 0 && TREE_VALUE (typetail) != void_type_node)
2721 error ("too few arguments to function %qE", function);
2728 /* This is the entry point used by the parser to build unary operators
2729 in the input. CODE, a tree_code, specifies the unary operator, and
2730 ARG is the operand. For unary plus, the C parser currently uses
2731 CONVERT_EXPR for code. */
2734 parser_build_unary_op (enum tree_code code, struct c_expr arg)
2736 struct c_expr result;
2738 result.original_code = ERROR_MARK;
2739 result.value = build_unary_op (code, arg.value, 0);
2741 if (TREE_OVERFLOW_P (result.value) && !TREE_OVERFLOW_P (arg.value))
2742 overflow_warning (result.value);
2747 /* This is the entry point used by the parser to build binary operators
2748 in the input. CODE, a tree_code, specifies the binary operator, and
2749 ARG1 and ARG2 are the operands. In addition to constructing the
2750 expression, we check for operands that were written with other binary
2751 operators in a way that is likely to confuse the user. */
2754 parser_build_binary_op (enum tree_code code, struct c_expr arg1,
2757 struct c_expr result;
2759 enum tree_code code1 = arg1.original_code;
2760 enum tree_code code2 = arg2.original_code;
2762 result.value = build_binary_op (code, arg1.value, arg2.value, 1);
2763 result.original_code = code;
2765 if (TREE_CODE (result.value) == ERROR_MARK)
2768 /* Check for cases such as x+y<<z which users are likely
2770 if (warn_parentheses)
2771 warn_about_parentheses (code, code1, code2);
2773 if (code1 != tcc_comparison)
2774 warn_logical_operator (code, arg1.value, arg2.value);
2776 /* Warn about comparisons against string literals, with the exception
2777 of testing for equality or inequality of a string literal with NULL. */
2778 if (code == EQ_EXPR || code == NE_EXPR)
2780 if ((code1 == STRING_CST && !integer_zerop (arg2.value))
2781 || (code2 == STRING_CST && !integer_zerop (arg1.value)))
2782 warning (OPT_Waddress, "comparison with string literal results in unspecified behavior");
2784 else if (TREE_CODE_CLASS (code) == tcc_comparison
2785 && (code1 == STRING_CST || code2 == STRING_CST))
2786 warning (OPT_Waddress, "comparison with string literal results in unspecified behavior");
2788 if (TREE_OVERFLOW_P (result.value)
2789 && !TREE_OVERFLOW_P (arg1.value)
2790 && !TREE_OVERFLOW_P (arg2.value))
2791 overflow_warning (result.value);
2796 /* Return a tree for the difference of pointers OP0 and OP1.
2797 The resulting tree has type int. */
2800 pointer_diff (tree op0, tree op1)
2802 tree restype = ptrdiff_type_node;
2804 tree target_type = TREE_TYPE (TREE_TYPE (op0));
2805 tree con0, con1, lit0, lit1;
2806 tree orig_op1 = op1;
2808 if (pedantic || warn_pointer_arith)
2810 if (TREE_CODE (target_type) == VOID_TYPE)
2811 pedwarn ("pointer of type %<void *%> used in subtraction");
2812 if (TREE_CODE (target_type) == FUNCTION_TYPE)
2813 pedwarn ("pointer to a function used in subtraction");
2816 /* If the conversion to ptrdiff_type does anything like widening or
2817 converting a partial to an integral mode, we get a convert_expression
2818 that is in the way to do any simplifications.
2819 (fold-const.c doesn't know that the extra bits won't be needed.
2820 split_tree uses STRIP_SIGN_NOPS, which leaves conversions to a
2821 different mode in place.)
2822 So first try to find a common term here 'by hand'; we want to cover
2823 at least the cases that occur in legal static initializers. */
2824 if ((TREE_CODE (op0) == NOP_EXPR || TREE_CODE (op0) == CONVERT_EXPR)
2825 && (TYPE_PRECISION (TREE_TYPE (op0))
2826 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op0, 0)))))
2827 con0 = TREE_OPERAND (op0, 0);
2830 if ((TREE_CODE (op1) == NOP_EXPR || TREE_CODE (op1) == CONVERT_EXPR)
2831 && (TYPE_PRECISION (TREE_TYPE (op1))
2832 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op1, 0)))))
2833 con1 = TREE_OPERAND (op1, 0);
2837 if (TREE_CODE (con0) == PLUS_EXPR)
2839 lit0 = TREE_OPERAND (con0, 1);
2840 con0 = TREE_OPERAND (con0, 0);
2843 lit0 = integer_zero_node;
2845 if (TREE_CODE (con1) == PLUS_EXPR)
2847 lit1 = TREE_OPERAND (con1, 1);
2848 con1 = TREE_OPERAND (con1, 0);
2851 lit1 = integer_zero_node;
2853 if (operand_equal_p (con0, con1, 0))
2860 /* First do the subtraction as integers;
2861 then drop through to build the divide operator.
2862 Do not do default conversions on the minus operator
2863 in case restype is a short type. */
2865 op0 = build_binary_op (MINUS_EXPR, convert (restype, op0),
2866 convert (restype, op1), 0);
2867 /* This generates an error if op1 is pointer to incomplete type. */
2868 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (TREE_TYPE (orig_op1))))
2869 error ("arithmetic on pointer to an incomplete type");
2871 /* This generates an error if op0 is pointer to incomplete type. */
2872 op1 = c_size_in_bytes (target_type);
2874 /* Divide by the size, in easiest possible way. */
2875 return fold_build2 (EXACT_DIV_EXPR, restype, op0, convert (restype, op1));
2878 /* Construct and perhaps optimize a tree representation
2879 for a unary operation. CODE, a tree_code, specifies the operation
2880 and XARG is the operand.
2881 For any CODE other than ADDR_EXPR, FLAG nonzero suppresses
2882 the default promotions (such as from short to int).
2883 For ADDR_EXPR, the default promotions are not applied; FLAG nonzero
2884 allows non-lvalues; this is only used to handle conversion of non-lvalue
2885 arrays to pointers in C99. */
2888 build_unary_op (enum tree_code code, tree xarg, int flag)
2890 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
2893 enum tree_code typecode;
2895 int noconvert = flag;
2896 const char *invalid_op_diag;
2898 if (code != ADDR_EXPR)
2899 arg = require_complete_type (arg);
2901 typecode = TREE_CODE (TREE_TYPE (arg));
2902 if (typecode == ERROR_MARK)
2903 return error_mark_node;
2904 if (typecode == ENUMERAL_TYPE || typecode == BOOLEAN_TYPE)
2905 typecode = INTEGER_TYPE;
2907 if ((invalid_op_diag
2908 = targetm.invalid_unary_op (code, TREE_TYPE (xarg))))
2910 error (invalid_op_diag);
2911 return error_mark_node;
2917 /* This is used for unary plus, because a CONVERT_EXPR
2918 is enough to prevent anybody from looking inside for
2919 associativity, but won't generate any code. */
2920 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2921 || typecode == FIXED_POINT_TYPE || typecode == COMPLEX_TYPE
2922 || typecode == VECTOR_TYPE))
2924 error ("wrong type argument to unary plus");
2925 return error_mark_node;
2927 else if (!noconvert)
2928 arg = default_conversion (arg);
2929 arg = non_lvalue (arg);
2933 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2934 || typecode == FIXED_POINT_TYPE || typecode == COMPLEX_TYPE
2935 || typecode == VECTOR_TYPE))
2937 error ("wrong type argument to unary minus");
2938 return error_mark_node;
2940 else if (!noconvert)
2941 arg = default_conversion (arg);
2945 /* ~ works on integer types and non float vectors. */
2946 if (typecode == INTEGER_TYPE
2947 || (typecode == VECTOR_TYPE
2948 && !VECTOR_FLOAT_TYPE_P (TREE_TYPE (arg))))
2951 arg = default_conversion (arg);
2953 else if (typecode == COMPLEX_TYPE)
2957 pedwarn ("ISO C does not support %<~%> for complex conjugation");
2959 arg = default_conversion (arg);
2963 error ("wrong type argument to bit-complement");
2964 return error_mark_node;
2969 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE))
2971 error ("wrong type argument to abs");
2972 return error_mark_node;
2974 else if (!noconvert)
2975 arg = default_conversion (arg);
2979 /* Conjugating a real value is a no-op, but allow it anyway. */
2980 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2981 || typecode == COMPLEX_TYPE))
2983 error ("wrong type argument to conjugation");
2984 return error_mark_node;
2986 else if (!noconvert)
2987 arg = default_conversion (arg);
2990 case TRUTH_NOT_EXPR:
2991 if (typecode != INTEGER_TYPE && typecode != FIXED_POINT_TYPE
2992 && typecode != REAL_TYPE && typecode != POINTER_TYPE
2993 && typecode != COMPLEX_TYPE)
2995 error ("wrong type argument to unary exclamation mark");
2996 return error_mark_node;
2998 arg = c_objc_common_truthvalue_conversion (arg);
2999 return invert_truthvalue (arg);
3002 if (TREE_CODE (arg) == COMPLEX_CST)
3003 return TREE_REALPART (arg);
3004 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
3005 return fold_build1 (REALPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg);
3010 if (TREE_CODE (arg) == COMPLEX_CST)
3011 return TREE_IMAGPART (arg);
3012 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
3013 return fold_build1 (IMAGPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg);
3015 return convert (TREE_TYPE (arg), integer_zero_node);
3017 case PREINCREMENT_EXPR:
3018 case POSTINCREMENT_EXPR:
3019 case PREDECREMENT_EXPR:
3020 case POSTDECREMENT_EXPR:
3022 /* Increment or decrement the real part of the value,
3023 and don't change the imaginary part. */
3024 if (typecode == COMPLEX_TYPE)
3029 pedwarn ("ISO C does not support %<++%> and %<--%>"
3030 " on complex types");
3032 arg = stabilize_reference (arg);
3033 real = build_unary_op (REALPART_EXPR, arg, 1);
3034 imag = build_unary_op (IMAGPART_EXPR, arg, 1);
3035 real = build_unary_op (code, real, 1);
3036 if (real == error_mark_node || imag == error_mark_node)
3037 return error_mark_node;
3038 return build2 (COMPLEX_EXPR, TREE_TYPE (arg),
3042 /* Report invalid types. */
3044 if (typecode != POINTER_TYPE && typecode != FIXED_POINT_TYPE
3045 && typecode != INTEGER_TYPE && typecode != REAL_TYPE)
3047 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
3048 error ("wrong type argument to increment");
3050 error ("wrong type argument to decrement");
3052 return error_mark_node;
3057 tree result_type = TREE_TYPE (arg);
3059 arg = get_unwidened (arg, 0);
3060 argtype = TREE_TYPE (arg);
3062 /* Compute the increment. */
3064 if (typecode == POINTER_TYPE)
3066 /* If pointer target is an undefined struct,
3067 we just cannot know how to do the arithmetic. */
3068 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (result_type)))
3070 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
3071 error ("increment of pointer to unknown structure");
3073 error ("decrement of pointer to unknown structure");
3075 else if ((pedantic || warn_pointer_arith)
3076 && (TREE_CODE (TREE_TYPE (result_type)) == FUNCTION_TYPE
3077 || TREE_CODE (TREE_TYPE (result_type)) == VOID_TYPE))
3079 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
3080 pedwarn ("wrong type argument to increment");
3082 pedwarn ("wrong type argument to decrement");
3085 inc = c_size_in_bytes (TREE_TYPE (result_type));
3086 inc = fold_convert (sizetype, inc);
3088 else if (FRACT_MODE_P (TYPE_MODE (result_type)))
3090 /* For signed fract types, we invert ++ to -- or
3091 -- to ++, and change inc from 1 to -1, because
3092 it is not possible to represent 1 in signed fract constants.
3093 For unsigned fract types, the result always overflows and
3094 we get an undefined (original) or the maximum value. */
3095 if (code == PREINCREMENT_EXPR)
3096 code = PREDECREMENT_EXPR;
3097 else if (code == PREDECREMENT_EXPR)
3098 code = PREINCREMENT_EXPR;
3099 else if (code == POSTINCREMENT_EXPR)
3100 code = POSTDECREMENT_EXPR;
3101 else /* code == POSTDECREMENT_EXPR */
3102 code = POSTINCREMENT_EXPR;
3104 inc = integer_minus_one_node;
3105 inc = convert (argtype, inc);
3109 inc = integer_one_node;
3110 inc = convert (argtype, inc);
3113 /* Complain about anything else that is not a true lvalue. */
3114 if (!lvalue_or_else (arg, ((code == PREINCREMENT_EXPR
3115 || code == POSTINCREMENT_EXPR)
3118 return error_mark_node;
3120 /* Report a read-only lvalue. */
3121 if (TREE_READONLY (arg))
3123 readonly_error (arg,
3124 ((code == PREINCREMENT_EXPR
3125 || code == POSTINCREMENT_EXPR)
3126 ? lv_increment : lv_decrement));
3127 return error_mark_node;
3130 if (TREE_CODE (TREE_TYPE (arg)) == BOOLEAN_TYPE)
3131 val = boolean_increment (code, arg);
3133 val = build2 (code, TREE_TYPE (arg), arg, inc);
3134 TREE_SIDE_EFFECTS (val) = 1;
3135 val = convert (result_type, val);
3136 if (TREE_CODE (val) != code)
3137 TREE_NO_WARNING (val) = 1;
3142 /* Note that this operation never does default_conversion. */
3144 /* Let &* cancel out to simplify resulting code. */
3145 if (TREE_CODE (arg) == INDIRECT_REF)
3147 /* Don't let this be an lvalue. */
3148 if (lvalue_p (TREE_OPERAND (arg, 0)))
3149 return non_lvalue (TREE_OPERAND (arg, 0));
3150 return TREE_OPERAND (arg, 0);
3153 /* For &x[y], return x+y */
3154 if (TREE_CODE (arg) == ARRAY_REF)
3156 tree op0 = TREE_OPERAND (arg, 0);
3157 if (!c_mark_addressable (op0))
3158 return error_mark_node;
3159 return build_binary_op (PLUS_EXPR,
3160 (TREE_CODE (TREE_TYPE (op0)) == ARRAY_TYPE
3161 ? array_to_pointer_conversion (op0)
3163 TREE_OPERAND (arg, 1), 1);
3166 /* Anything not already handled and not a true memory reference
3167 or a non-lvalue array is an error. */
3168 else if (typecode != FUNCTION_TYPE && !flag
3169 && !lvalue_or_else (arg, lv_addressof))
3170 return error_mark_node;
3172 /* Ordinary case; arg is a COMPONENT_REF or a decl. */
3173 argtype = TREE_TYPE (arg);
3175 /* If the lvalue is const or volatile, merge that into the type
3176 to which the address will point. Note that you can't get a
3177 restricted pointer by taking the address of something, so we
3178 only have to deal with `const' and `volatile' here. */
3179 if ((DECL_P (arg) || REFERENCE_CLASS_P (arg))
3180 && (TREE_READONLY (arg) || TREE_THIS_VOLATILE (arg)))
3181 argtype = c_build_type_variant (argtype,
3182 TREE_READONLY (arg),
3183 TREE_THIS_VOLATILE (arg));
3185 if (!c_mark_addressable (arg))
3186 return error_mark_node;
3188 gcc_assert (TREE_CODE (arg) != COMPONENT_REF
3189 || !DECL_C_BIT_FIELD (TREE_OPERAND (arg, 1)));
3191 argtype = build_pointer_type (argtype);
3193 /* ??? Cope with user tricks that amount to offsetof. Delete this
3194 when we have proper support for integer constant expressions. */
3195 val = get_base_address (arg);
3196 if (val && TREE_CODE (val) == INDIRECT_REF
3197 && TREE_CONSTANT (TREE_OPERAND (val, 0)))
3199 tree op0 = fold_convert (sizetype, fold_offsetof (arg, val)), op1;
3201 op1 = fold_convert (argtype, TREE_OPERAND (val, 0));
3202 return fold_build2 (POINTER_PLUS_EXPR, argtype, op1, op0);
3205 val = build1 (ADDR_EXPR, argtype, arg);
3214 argtype = TREE_TYPE (arg);
3215 return require_constant_value ? fold_build1_initializer (code, argtype, arg)
3216 : fold_build1 (code, argtype, arg);
3219 /* Return nonzero if REF is an lvalue valid for this language.
3220 Lvalues can be assigned, unless their type has TYPE_READONLY.
3221 Lvalues can have their address taken, unless they have C_DECL_REGISTER. */
3224 lvalue_p (const_tree ref)
3226 const enum tree_code code = TREE_CODE (ref);
3233 return lvalue_p (TREE_OPERAND (ref, 0));
3235 case COMPOUND_LITERAL_EXPR:
3245 return (TREE_CODE (TREE_TYPE (ref)) != FUNCTION_TYPE
3246 && TREE_CODE (TREE_TYPE (ref)) != METHOD_TYPE);
3249 return TREE_CODE (TREE_TYPE (ref)) == ARRAY_TYPE;
3256 /* Give an error for storing in something that is 'const'. */
3259 readonly_error (tree arg, enum lvalue_use use)
3261 gcc_assert (use == lv_assign || use == lv_increment || use == lv_decrement
3263 /* Using this macro rather than (for example) arrays of messages
3264 ensures that all the format strings are checked at compile
3266 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
3267 : (use == lv_increment ? (I) \
3268 : (use == lv_decrement ? (D) : (AS))))
3269 if (TREE_CODE (arg) == COMPONENT_REF)
3271 if (TYPE_READONLY (TREE_TYPE (TREE_OPERAND (arg, 0))))
3272 readonly_error (TREE_OPERAND (arg, 0), use);
3274 error (READONLY_MSG (G_("assignment of read-only member %qD"),
3275 G_("increment of read-only member %qD"),
3276 G_("decrement of read-only member %qD"),
3277 G_("read-only member %qD used as %<asm%> output")),
3278 TREE_OPERAND (arg, 1));
3280 else if (TREE_CODE (arg) == VAR_DECL)
3281 error (READONLY_MSG (G_("assignment of read-only variable %qD"),
3282 G_("increment of read-only variable %qD"),
3283 G_("decrement of read-only variable %qD"),
3284 G_("read-only variable %qD used as %<asm%> output")),
3287 error (READONLY_MSG (G_("assignment of read-only location %qE"),
3288 G_("increment of read-only location %qE"),
3289 G_("decrement of read-only location %qE"),
3290 G_("read-only location %qE used as %<asm%> output")),
3295 /* Return nonzero if REF is an lvalue valid for this language;
3296 otherwise, print an error message and return zero. USE says
3297 how the lvalue is being used and so selects the error message. */
3300 lvalue_or_else (const_tree ref, enum lvalue_use use)
3302 int win = lvalue_p (ref);
3310 /* Mark EXP saying that we need to be able to take the
3311 address of it; it should not be allocated in a register.
3312 Returns true if successful. */
3315 c_mark_addressable (tree exp)
3320 switch (TREE_CODE (x))
3323 if (DECL_C_BIT_FIELD (TREE_OPERAND (x, 1)))
3326 ("cannot take address of bit-field %qD", TREE_OPERAND (x, 1));
3330 /* ... fall through ... */
3336 x = TREE_OPERAND (x, 0);
3339 case COMPOUND_LITERAL_EXPR:
3341 TREE_ADDRESSABLE (x) = 1;
3348 if (C_DECL_REGISTER (x)
3349 && DECL_NONLOCAL (x))
3351 if (TREE_PUBLIC (x) || TREE_STATIC (x) || DECL_EXTERNAL (x))
3354 ("global register variable %qD used in nested function", x);
3357 pedwarn ("register variable %qD used in nested function", x);
3359 else if (C_DECL_REGISTER (x))
3361 if (TREE_PUBLIC (x) || TREE_STATIC (x) || DECL_EXTERNAL (x))
3362 error ("address of global register variable %qD requested", x);
3364 error ("address of register variable %qD requested", x);
3370 TREE_ADDRESSABLE (x) = 1;
3377 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
3380 build_conditional_expr (tree ifexp, tree op1, tree op2)
3384 enum tree_code code1;
3385 enum tree_code code2;
3386 tree result_type = NULL;
3387 tree orig_op1 = op1, orig_op2 = op2;
3389 /* Promote both alternatives. */
3391 if (TREE_CODE (TREE_TYPE (op1)) != VOID_TYPE)
3392 op1 = default_conversion (op1);
3393 if (TREE_CODE (TREE_TYPE (op2)) != VOID_TYPE)
3394 op2 = default_conversion (op2);
3396 if (TREE_CODE (ifexp) == ERROR_MARK
3397 || TREE_CODE (TREE_TYPE (op1)) == ERROR_MARK
3398 || TREE_CODE (TREE_TYPE (op2)) == ERROR_MARK)
3399 return error_mark_node;
3401 type1 = TREE_TYPE (op1);
3402 code1 = TREE_CODE (type1);
3403 type2 = TREE_TYPE (op2);
3404 code2 = TREE_CODE (type2);
3406 /* C90 does not permit non-lvalue arrays in conditional expressions.
3407 In C99 they will be pointers by now. */
3408 if (code1 == ARRAY_TYPE || code2 == ARRAY_TYPE)
3410 error ("non-lvalue array in conditional expression");
3411 return error_mark_node;
3414 /* Quickly detect the usual case where op1 and op2 have the same type
3416 if (TYPE_MAIN_VARIANT (type1) == TYPE_MAIN_VARIANT (type2))
3419 result_type = type1;
3421 result_type = TYPE_MAIN_VARIANT (type1);
3423 else if ((code1 == INTEGER_TYPE || code1 == REAL_TYPE
3424 || code1 == COMPLEX_TYPE)
3425 && (code2 == INTEGER_TYPE || code2 == REAL_TYPE
3426 || code2 == COMPLEX_TYPE))
3428 result_type = c_common_type (type1, type2);
3430 /* If -Wsign-compare, warn here if type1 and type2 have
3431 different signedness. We'll promote the signed to unsigned
3432 and later code won't know it used to be different.
3433 Do this check on the original types, so that explicit casts
3434 will be considered, but default promotions won't. */
3435 if (warn_sign_compare && !skip_evaluation)
3437 int unsigned_op1 = TYPE_UNSIGNED (TREE_TYPE (orig_op1));
3438 int unsigned_op2 = TYPE_UNSIGNED (TREE_TYPE (orig_op2));
3440 if (unsigned_op1 ^ unsigned_op2)
3444 /* Do not warn if the result type is signed, since the
3445 signed type will only be chosen if it can represent
3446 all the values of the unsigned type. */
3447 if (!TYPE_UNSIGNED (result_type))
3449 /* Do not warn if the signed quantity is an unsuffixed
3450 integer literal (or some static constant expression
3451 involving such literals) and it is non-negative. */
3452 else if ((unsigned_op2
3453 && tree_expr_nonnegative_warnv_p (op1, &ovf))
3455 && tree_expr_nonnegative_warnv_p (op2, &ovf)))
3458 warning (OPT_Wsign_compare, "signed and unsigned type in conditional expression");
3462 else if (code1 == VOID_TYPE || code2 == VOID_TYPE)
3464 if (pedantic && (code1 != VOID_TYPE || code2 != VOID_TYPE))
3465 pedwarn ("ISO C forbids conditional expr with only one void side");
3466 result_type = void_type_node;
3468 else if (code1 == POINTER_TYPE && code2 == POINTER_TYPE)
3470 if (comp_target_types (type1, type2))
3471 result_type = common_pointer_type (type1, type2);
3472 else if (null_pointer_constant_p (orig_op1))
3473 result_type = qualify_type (type2, type1);
3474 else if (null_pointer_constant_p (orig_op2))
3475 result_type = qualify_type (type1, type2);
3476 else if (VOID_TYPE_P (TREE_TYPE (type1)))
3478 if (pedantic && TREE_CODE (TREE_TYPE (type2)) == FUNCTION_TYPE)
3479 pedwarn ("ISO C forbids conditional expr between "
3480 "%<void *%> and function pointer");
3481 result_type = build_pointer_type (qualify_type (TREE_TYPE (type1),
3482 TREE_TYPE (type2)));
3484 else if (VOID_TYPE_P (TREE_TYPE (type2)))
3486 if (pedantic && TREE_CODE (TREE_TYPE (type1)) == FUNCTION_TYPE)
3487 pedwarn ("ISO C forbids conditional expr between "
3488 "%<void *%> and function pointer");
3489 result_type = build_pointer_type (qualify_type (TREE_TYPE (type2),
3490 TREE_TYPE (type1)));
3494 pedwarn ("pointer type mismatch in conditional expression");
3495 result_type = build_pointer_type (void_type_node);
3498 else if (code1 == POINTER_TYPE && code2 == INTEGER_TYPE)
3500 if (!null_pointer_constant_p (orig_op2))
3501 pedwarn ("pointer/integer type mismatch in conditional expression");
3504 op2 = null_pointer_node;
3506 result_type = type1;
3508 else if (code2 == POINTER_TYPE && code1 == INTEGER_TYPE)
3510 if (!null_pointer_constant_p (orig_op1))
3511 pedwarn ("pointer/integer type mismatch in conditional expression");
3514 op1 = null_pointer_node;
3516 result_type = type2;
3521 if (flag_cond_mismatch)
3522 result_type = void_type_node;
3525 error ("type mismatch in conditional expression");
3526 return error_mark_node;
3530 /* Merge const and volatile flags of the incoming types. */
3532 = build_type_variant (result_type,
3533 TREE_READONLY (op1) || TREE_READONLY (op2),
3534 TREE_THIS_VOLATILE (op1) || TREE_THIS_VOLATILE (op2));
3536 if (result_type != TREE_TYPE (op1))
3537 op1 = convert_and_check (result_type, op1);
3538 if (result_type != TREE_TYPE (op2))
3539 op2 = convert_and_check (result_type, op2);
3541 return fold_build3 (COND_EXPR, result_type, ifexp, op1, op2);
3544 /* Return a compound expression that performs two expressions and
3545 returns the value of the second of them. */
3548 build_compound_expr (tree expr1, tree expr2)
3550 if (!TREE_SIDE_EFFECTS (expr1))
3552 /* The left-hand operand of a comma expression is like an expression
3553 statement: with -Wunused, we should warn if it doesn't have
3554 any side-effects, unless it was explicitly cast to (void). */
3555 if (warn_unused_value)
3557 if (VOID_TYPE_P (TREE_TYPE (expr1))
3558 && (TREE_CODE (expr1) == NOP_EXPR
3559 || TREE_CODE (expr1) == CONVERT_EXPR))
3561 else if (VOID_TYPE_P (TREE_TYPE (expr1))
3562 && TREE_CODE (expr1) == COMPOUND_EXPR
3563 && (TREE_CODE (TREE_OPERAND (expr1, 1)) == CONVERT_EXPR
3564 || TREE_CODE (TREE_OPERAND (expr1, 1)) == NOP_EXPR))
3565 ; /* (void) a, (void) b, c */
3567 warning (OPT_Wunused_value,
3568 "left-hand operand of comma expression has no effect");
3572 /* With -Wunused, we should also warn if the left-hand operand does have
3573 side-effects, but computes a value which is not used. For example, in
3574 `foo() + bar(), baz()' the result of the `+' operator is not used,
3575 so we should issue a warning. */
3576 else if (warn_unused_value)
3577 warn_if_unused_value (expr1, input_location);
3579 if (expr2 == error_mark_node)
3580 return error_mark_node;
3582 return build2 (COMPOUND_EXPR, TREE_TYPE (expr2), expr1, expr2);
3585 /* Build an expression representing a cast to type TYPE of expression EXPR. */
3588 build_c_cast (tree type, tree expr)
3592 if (type == error_mark_node || expr == error_mark_node)
3593 return error_mark_node;
3595 /* The ObjC front-end uses TYPE_MAIN_VARIANT to tie together types differing
3596 only in <protocol> qualifications. But when constructing cast expressions,
3597 the protocols do matter and must be kept around. */
3598 if (objc_is_object_ptr (type) && objc_is_object_ptr (TREE_TYPE (expr)))
3599 return build1 (NOP_EXPR, type, expr);
3601 type = TYPE_MAIN_VARIANT (type);
3603 if (TREE_CODE (type) == ARRAY_TYPE)
3605 error ("cast specifies array type");
3606 return error_mark_node;
3609 if (TREE_CODE (type) == FUNCTION_TYPE)
3611 error ("cast specifies function type");
3612 return error_mark_node;
3615 if (!VOID_TYPE_P (type))
3617 value = require_complete_type (value);
3618 if (value == error_mark_node)
3619 return error_mark_node;
3622 if (type == TYPE_MAIN_VARIANT (TREE_TYPE (value)))
3626 if (TREE_CODE (type) == RECORD_TYPE
3627 || TREE_CODE (type) == UNION_TYPE)
3628 pedwarn ("ISO C forbids casting nonscalar to the same type");
3631 else if (TREE_CODE (type) == UNION_TYPE)
3635 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
3636 if (TREE_TYPE (field) != error_mark_node
3637 && comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (field)),
3638 TYPE_MAIN_VARIANT (TREE_TYPE (value))))
3646 pedwarn ("ISO C forbids casts to union type");
3647 t = digest_init (type,
3648 build_constructor_single (type, field, value),
3650 TREE_CONSTANT (t) = TREE_CONSTANT (value);
3653 error ("cast to union type from type not present in union");
3654 return error_mark_node;
3660 if (type == void_type_node)
3661 return build1 (CONVERT_EXPR, type, value);
3663 otype = TREE_TYPE (value);
3665 /* Optionally warn about potentially worrisome casts. */
3668 && TREE_CODE (type) == POINTER_TYPE
3669 && TREE_CODE (otype) == POINTER_TYPE)
3671 tree in_type = type;
3672 tree in_otype = otype;
3676 /* Check that the qualifiers on IN_TYPE are a superset of
3677 the qualifiers of IN_OTYPE. The outermost level of
3678 POINTER_TYPE nodes is uninteresting and we stop as soon
3679 as we hit a non-POINTER_TYPE node on either type. */
3682 in_otype = TREE_TYPE (in_otype);
3683 in_type = TREE_TYPE (in_type);
3685 /* GNU C allows cv-qualified function types. 'const'
3686 means the function is very pure, 'volatile' means it
3687 can't return. We need to warn when such qualifiers
3688 are added, not when they're taken away. */
3689 if (TREE_CODE (in_otype) == FUNCTION_TYPE
3690 && TREE_CODE (in_type) == FUNCTION_TYPE)
3691 added |= (TYPE_QUALS (in_type) & ~TYPE_QUALS (in_otype));
3693 discarded |= (TYPE_QUALS (in_otype) & ~TYPE_QUALS (in_type));
3695 while (TREE_CODE (in_type) == POINTER_TYPE
3696 && TREE_CODE (in_otype) == POINTER_TYPE);
3699 warning (OPT_Wcast_qual, "cast adds new qualifiers to function type");
3702 /* There are qualifiers present in IN_OTYPE that are not
3703 present in IN_TYPE. */
3704 warning (OPT_Wcast_qual, "cast discards qualifiers from pointer target type");
3707 /* Warn about possible alignment problems. */
3708 if (STRICT_ALIGNMENT
3709 && TREE_CODE (type) == POINTER_TYPE
3710 && TREE_CODE (otype) == POINTER_TYPE
3711 && TREE_CODE (TREE_TYPE (otype)) != VOID_TYPE
3712 && TREE_CODE (TREE_TYPE (otype)) != FUNCTION_TYPE
3713 /* Don't warn about opaque types, where the actual alignment
3714 restriction is unknown. */
3715 && !((TREE_CODE (TREE_TYPE (otype)) == UNION_TYPE
3716 || TREE_CODE (TREE_TYPE (otype)) == RECORD_TYPE)
3717 && TYPE_MODE (TREE_TYPE (otype)) == VOIDmode)
3718 && TYPE_ALIGN (TREE_TYPE (type)) > TYPE_ALIGN (TREE_TYPE (otype)))
3719 warning (OPT_Wcast_align,
3720 "cast increases required alignment of target type");
3722 if (TREE_CODE (type) == INTEGER_TYPE
3723 && TREE_CODE (otype) == POINTER_TYPE
3724 && TYPE_PRECISION (type) != TYPE_PRECISION (otype))
3725 /* Unlike conversion of integers to pointers, where the
3726 warning is disabled for converting constants because
3727 of cases such as SIG_*, warn about converting constant
3728 pointers to integers. In some cases it may cause unwanted
3729 sign extension, and a warning is appropriate. */
3730 warning (OPT_Wpointer_to_int_cast,
3731 "cast from pointer to integer of different size");
3733 if (TREE_CODE (value) == CALL_EXPR
3734 && TREE_CODE (type) != TREE_CODE (otype))
3735 warning (OPT_Wbad_function_cast, "cast from function call of type %qT "
3736 "to non-matching type %qT", otype, type);
3738 if (TREE_CODE (type) == POINTER_TYPE
3739 && TREE_CODE (otype) == INTEGER_TYPE
3740 && TYPE_PRECISION (type) != TYPE_PRECISION (otype)
3741 /* Don't warn about converting any constant. */
3742 && !TREE_CONSTANT (value))
3743 warning (OPT_Wint_to_pointer_cast, "cast to pointer from integer "
3744 "of different size");
3746 if (warn_strict_aliasing <= 2)
3747 strict_aliasing_warning (otype, type, expr);
3749 /* If pedantic, warn for conversions between function and object
3750 pointer types, except for converting a null pointer constant
3751 to function pointer type. */
3753 && TREE_CODE (type) == POINTER_TYPE
3754 && TREE_CODE (otype) == POINTER_TYPE
3755 && TREE_CODE (TREE_TYPE (otype)) == FUNCTION_TYPE
3756 && TREE_CODE (TREE_TYPE (type)) != FUNCTION_TYPE)
3757 pedwarn ("ISO C forbids conversion of function pointer to object pointer type");
3760 && TREE_CODE (type) == POINTER_TYPE
3761 && TREE_CODE (otype) == POINTER_TYPE
3762 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE
3763 && TREE_CODE (TREE_TYPE (otype)) != FUNCTION_TYPE
3764 && !null_pointer_constant_p (value))
3765 pedwarn ("ISO C forbids conversion of object pointer to function pointer type");
3768 value = convert (type, value);
3770 /* Ignore any integer overflow caused by the cast. */
3771 if (TREE_CODE (value) == INTEGER_CST)
3773 if (CONSTANT_CLASS_P (ovalue) && TREE_OVERFLOW (ovalue))
3775 if (!TREE_OVERFLOW (value))
3777 /* Avoid clobbering a shared constant. */
3778 value = copy_node (value);
3779 TREE_OVERFLOW (value) = TREE_OVERFLOW (ovalue);
3782 else if (TREE_OVERFLOW (value))
3783 /* Reset VALUE's overflow flags, ensuring constant sharing. */
3784 value = build_int_cst_wide (TREE_TYPE (value),
3785 TREE_INT_CST_LOW (value),
3786 TREE_INT_CST_HIGH (value));
3790 /* Don't let a cast be an lvalue. */
3792 value = non_lvalue (value);
3797 /* Interpret a cast of expression EXPR to type TYPE. */
3799 c_cast_expr (struct c_type_name *type_name, tree expr)
3802 int saved_wsp = warn_strict_prototypes;
3804 /* This avoids warnings about unprototyped casts on
3805 integers. E.g. "#define SIG_DFL (void(*)())0". */
3806 if (TREE_CODE (expr) == INTEGER_CST)
3807 warn_strict_prototypes = 0;
3808 type = groktypename (type_name);
3809 warn_strict_prototypes = saved_wsp;
3811 return build_c_cast (type, expr);
3814 /* Build an assignment expression of lvalue LHS from value RHS.
3815 MODIFYCODE is the code for a binary operator that we use
3816 to combine the old value of LHS with RHS to get the new value.
3817 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment. */
3820 build_modify_expr (tree lhs, enum tree_code modifycode, tree rhs)
3824 tree lhstype = TREE_TYPE (lhs);
3825 tree olhstype = lhstype;
3827 /* Types that aren't fully specified cannot be used in assignments. */
3828 lhs = require_complete_type (lhs);
3830 /* Avoid duplicate error messages from operands that had errors. */
3831 if (TREE_CODE (lhs) == ERROR_MARK || TREE_CODE (rhs) == ERROR_MARK)
3832 return error_mark_node;
3834 if (!lvalue_or_else (lhs, lv_assign))
3835 return error_mark_node;
3837 STRIP_TYPE_NOPS (rhs);
3841 /* If a binary op has been requested, combine the old LHS value with the RHS
3842 producing the value we should actually store into the LHS. */
3844 if (modifycode != NOP_EXPR)
3846 lhs = stabilize_reference (lhs);
3847 newrhs = build_binary_op (modifycode, lhs, rhs, 1);
3850 /* Give an error for storing in something that is 'const'. */
3852 if (TREE_READONLY (lhs) || TYPE_READONLY (lhstype)
3853 || ((TREE_CODE (lhstype) == RECORD_TYPE
3854 || TREE_CODE (lhstype) == UNION_TYPE)
3855 && C_TYPE_FIELDS_READONLY (lhstype)))
3857 readonly_error (lhs, lv_assign);
3858 return error_mark_node;
3861 /* If storing into a structure or union member,
3862 it has probably been given type `int'.
3863 Compute the type that would go with
3864 the actual amount of storage the member occupies. */
3866 if (TREE_CODE (lhs) == COMPONENT_REF
3867 && (TREE_CODE (lhstype) == INTEGER_TYPE
3868 || TREE_CODE (lhstype) == BOOLEAN_TYPE
3869 || TREE_CODE (lhstype) == REAL_TYPE
3870 || TREE_CODE (lhstype) == ENUMERAL_TYPE))
3871 lhstype = TREE_TYPE (get_unwidened (lhs, 0));
3873 /* If storing in a field that is in actuality a short or narrower than one,
3874 we must store in the field in its actual type. */
3876 if (lhstype != TREE_TYPE (lhs))
3878 lhs = copy_node (lhs);
3879 TREE_TYPE (lhs) = lhstype;
3882 /* Convert new value to destination type. */
3884 newrhs = convert_for_assignment (lhstype, newrhs, ic_assign,
3885 NULL_TREE, NULL_TREE, 0);
3886 if (TREE_CODE (newrhs) == ERROR_MARK)
3887 return error_mark_node;
3889 /* Emit ObjC write barrier, if necessary. */
3890 if (c_dialect_objc () && flag_objc_gc)
3892 result = objc_generate_write_barrier (lhs, modifycode, newrhs);
3897 /* Scan operands. */
3899 result = build2 (MODIFY_EXPR, lhstype, lhs, newrhs);
3900 TREE_SIDE_EFFECTS (result) = 1;
3902 /* If we got the LHS in a different type for storing in,
3903 convert the result back to the nominal type of LHS
3904 so that the value we return always has the same type
3905 as the LHS argument. */
3907 if (olhstype == TREE_TYPE (result))
3909 return convert_for_assignment (olhstype, result, ic_assign,
3910 NULL_TREE, NULL_TREE, 0);
3913 /* Convert value RHS to type TYPE as preparation for an assignment
3914 to an lvalue of type TYPE.
3915 The real work of conversion is done by `convert'.
3916 The purpose of this function is to generate error messages
3917 for assignments that are not allowed in C.
3918 ERRTYPE says whether it is argument passing, assignment,
3919 initialization or return.
3921 FUNCTION is a tree for the function being called.
3922 PARMNUM is the number of the argument, for printing in error messages. */
3925 convert_for_assignment (tree type, tree rhs, enum impl_conv errtype,
3926 tree fundecl, tree function, int parmnum)
3928 enum tree_code codel = TREE_CODE (type);
3930 enum tree_code coder;
3931 tree rname = NULL_TREE;
3932 bool objc_ok = false;
3934 if (errtype == ic_argpass || errtype == ic_argpass_nonproto)
3937 /* Change pointer to function to the function itself for
3939 if (TREE_CODE (function) == ADDR_EXPR
3940 && TREE_CODE (TREE_OPERAND (function, 0)) == FUNCTION_DECL)
3941 function = TREE_OPERAND (function, 0);
3943 /* Handle an ObjC selector specially for diagnostics. */
3944 selector = objc_message_selector ();
3946 if (selector && parmnum > 2)
3953 /* This macro is used to emit diagnostics to ensure that all format
3954 strings are complete sentences, visible to gettext and checked at
3956 #define WARN_FOR_ASSIGNMENT(AR, AS, IN, RE) \
3961 pedwarn (AR, parmnum, rname); \
3963 case ic_argpass_nonproto: \
3964 warning (0, AR, parmnum, rname); \
3976 gcc_unreachable (); \
3980 STRIP_TYPE_NOPS (rhs);
3982 if (optimize && TREE_CODE (rhs) == VAR_DECL
3983 && TREE_CODE (TREE_TYPE (rhs)) != ARRAY_TYPE)
3984 rhs = decl_constant_value_for_broken_optimization (rhs);
3986 rhstype = TREE_TYPE (rhs);
3987 coder = TREE_CODE (rhstype);
3989 if (coder == ERROR_MARK)
3990 return error_mark_node;
3992 if (c_dialect_objc ())
4015 objc_ok = objc_compare_types (type, rhstype, parmno, rname);
4018 if (TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (rhstype))
4021 if (coder == VOID_TYPE)
4023 /* Except for passing an argument to an unprototyped function,
4024 this is a constraint violation. When passing an argument to
4025 an unprototyped function, it is compile-time undefined;
4026 making it a constraint in that case was rejected in
4028 error ("void value not ignored as it ought to be");
4029 return error_mark_node;
4031 rhs = require_complete_type (rhs);
4032 if (rhs == error_mark_node)
4033 return error_mark_node;
4034 /* A type converts to a reference to it.
4035 This code doesn't fully support references, it's just for the
4036 special case of va_start and va_copy. */
4037 if (codel == REFERENCE_TYPE
4038 && comptypes (TREE_TYPE (type), TREE_TYPE (rhs)) == 1)
4040 if (!lvalue_p (rhs))
4042 error ("cannot pass rvalue to reference parameter");
4043 return error_mark_node;
4045 if (!c_mark_addressable (rhs))
4046 return error_mark_node;
4047 rhs = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (rhs)), rhs);
4049 /* We already know that these two types are compatible, but they
4050 may not be exactly identical. In fact, `TREE_TYPE (type)' is
4051 likely to be __builtin_va_list and `TREE_TYPE (rhs)' is
4052 likely to be va_list, a typedef to __builtin_va_list, which
4053 is different enough that it will cause problems later. */
4054 if (TREE_TYPE (TREE_TYPE (rhs)) != TREE_TYPE (type))
4055 rhs = build1 (NOP_EXPR, build_pointer_type (TREE_TYPE (type)), rhs);
4057 rhs = build1 (NOP_EXPR, type, rhs);
4060 /* Some types can interconvert without explicit casts. */
4061 else if (codel == VECTOR_TYPE && coder == VECTOR_TYPE
4062 && vector_types_convertible_p (type, TREE_TYPE (rhs), true))
4063 return convert (type, rhs);
4064 /* Arithmetic types all interconvert, and enum is treated like int. */
4065 else if ((codel == INTEGER_TYPE || codel == REAL_TYPE
4066 || codel == FIXED_POINT_TYPE
4067 || codel == ENUMERAL_TYPE || codel == COMPLEX_TYPE
4068 || codel == BOOLEAN_TYPE)
4069 && (coder == INTEGER_TYPE || coder == REAL_TYPE
4070 || coder == FIXED_POINT_TYPE
4071 || coder == ENUMERAL_TYPE || coder == COMPLEX_TYPE
4072 || coder == BOOLEAN_TYPE))
4073 return convert_and_check (type, rhs);
4075 /* Aggregates in different TUs might need conversion. */
4076 if ((codel == RECORD_TYPE || codel == UNION_TYPE)
4078 && comptypes (type, rhstype))
4079 return convert_and_check (type, rhs);
4081 /* Conversion to a transparent union from its member types.
4082 This applies only to function arguments. */
4083 if (codel == UNION_TYPE && TYPE_TRANSPARENT_UNION (type)
4084 && (errtype == ic_argpass || errtype == ic_argpass_nonproto))
4086 tree memb, marginal_memb = NULL_TREE;
4088 for (memb = TYPE_FIELDS (type); memb ; memb = TREE_CHAIN (memb))
4090 tree memb_type = TREE_TYPE (memb);
4092 if (comptypes (TYPE_MAIN_VARIANT (memb_type),
4093 TYPE_MAIN_VARIANT (rhstype)))
4096 if (TREE_CODE (memb_type) != POINTER_TYPE)
4099 if (coder == POINTER_TYPE)
4101 tree ttl = TREE_TYPE (memb_type);
4102 tree ttr = TREE_TYPE (rhstype);
4104 /* Any non-function converts to a [const][volatile] void *
4105 and vice versa; otherwise, targets must be the same.
4106 Meanwhile, the lhs target must have all the qualifiers of
4108 if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
4109 || comp_target_types (memb_type, rhstype))
4111 /* If this type won't generate any warnings, use it. */
4112 if (TYPE_QUALS (ttl) == TYPE_QUALS (ttr)
4113 || ((TREE_CODE (ttr) == FUNCTION_TYPE
4114 && TREE_CODE (ttl) == FUNCTION_TYPE)
4115 ? ((TYPE_QUALS (ttl) | TYPE_QUALS (ttr))
4116 == TYPE_QUALS (ttr))
4117 : ((TYPE_QUALS (ttl) | TYPE_QUALS (ttr))
4118 == TYPE_QUALS (ttl))))
4121 /* Keep looking for a better type, but remember this one. */
4123 marginal_memb = memb;
4127 /* Can convert integer zero to any pointer type. */
4128 if (null_pointer_constant_p (rhs))
4130 rhs = null_pointer_node;
4135 if (memb || marginal_memb)
4139 /* We have only a marginally acceptable member type;
4140 it needs a warning. */
4141 tree ttl = TREE_TYPE (TREE_TYPE (marginal_memb));
4142 tree ttr = TREE_TYPE (rhstype);
4144 /* Const and volatile mean something different for function
4145 types, so the usual warnings are not appropriate. */
4146 if (TREE_CODE (ttr) == FUNCTION_TYPE
4147 && TREE_CODE (ttl) == FUNCTION_TYPE)
4149 /* Because const and volatile on functions are
4150 restrictions that say the function will not do
4151 certain things, it is okay to use a const or volatile
4152 function where an ordinary one is wanted, but not
4154 if (TYPE_QUALS (ttl) & ~TYPE_QUALS (ttr))
4155 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE "
4156 "makes qualified function "
4157 "pointer from unqualified"),
4158 G_("assignment makes qualified "
4159 "function pointer from "
4161 G_("initialization makes qualified "
4162 "function pointer from "
4164 G_("return makes qualified function "
4165 "pointer from unqualified"));
4167 else if (TYPE_QUALS (ttr) & ~TYPE_QUALS (ttl))
4168 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE discards "
4169 "qualifiers from pointer target type"),
4170 G_("assignment discards qualifiers "
4171 "from pointer target type"),
4172 G_("initialization discards qualifiers "
4173 "from pointer target type"),
4174 G_("return discards qualifiers from "
4175 "pointer target type"));
4177 memb = marginal_memb;
4180 if (pedantic && (!fundecl || !DECL_IN_SYSTEM_HEADER (fundecl)))
4181 pedwarn ("ISO C prohibits argument conversion to union type");
4183 rhs = fold_convert (TREE_TYPE (memb), rhs);
4184 return build_constructor_single (type, memb, rhs);
4188 /* Conversions among pointers */
4189 else if ((codel == POINTER_TYPE || codel == REFERENCE_TYPE)
4190 && (coder == codel))
4192 tree ttl = TREE_TYPE (type);
4193 tree ttr = TREE_TYPE (rhstype);
4196 bool is_opaque_pointer;
4197 int target_cmp = 0; /* Cache comp_target_types () result. */
4199 if (TREE_CODE (mvl) != ARRAY_TYPE)
4200 mvl = TYPE_MAIN_VARIANT (mvl);
4201 if (TREE_CODE (mvr) != ARRAY_TYPE)
4202 mvr = TYPE_MAIN_VARIANT (mvr);
4203 /* Opaque pointers are treated like void pointers. */
4204 is_opaque_pointer = (targetm.vector_opaque_p (type)
4205 || targetm.vector_opaque_p (rhstype))
4206 && TREE_CODE (ttl) == VECTOR_TYPE
4207 && TREE_CODE (ttr) == VECTOR_TYPE;
4209 /* C++ does not allow the implicit conversion void* -> T*. However,
4210 for the purpose of reducing the number of false positives, we
4211 tolerate the special case of
4215 where NULL is typically defined in C to be '(void *) 0'. */
4216 if (VOID_TYPE_P (ttr) && rhs != null_pointer_node && !VOID_TYPE_P (ttl))
4217 warning (OPT_Wc___compat, "request for implicit conversion from "
4218 "%qT to %qT not permitted in C++", rhstype, type);
4220 /* Check if the right-hand side has a format attribute but the
4221 left-hand side doesn't. */
4222 if (warn_missing_format_attribute
4223 && check_missing_format_attribute (type, rhstype))
4228 case ic_argpass_nonproto:
4229 warning (OPT_Wmissing_format_attribute,
4230 "argument %d of %qE might be "
4231 "a candidate for a format attribute",
4235 warning (OPT_Wmissing_format_attribute,
4236 "assignment left-hand side might be "
4237 "a candidate for a format attribute");
4240 warning (OPT_Wmissing_format_attribute,
4241 "initialization left-hand side might be "
4242 "a candidate for a format attribute");
4245 warning (OPT_Wmissing_format_attribute,
4246 "return type might be "
4247 "a candidate for a format attribute");
4254 /* Any non-function converts to a [const][volatile] void *
4255 and vice versa; otherwise, targets must be the same.
4256 Meanwhile, the lhs target must have all the qualifiers of the rhs. */
4257 if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
4258 || (target_cmp = comp_target_types (type, rhstype))
4259 || is_opaque_pointer
4260 || (c_common_unsigned_type (mvl)
4261 == c_common_unsigned_type (mvr)))
4264 && ((VOID_TYPE_P (ttl) && TREE_CODE (ttr) == FUNCTION_TYPE)
4267 && !null_pointer_constant_p (rhs)
4268 && TREE_CODE (ttl) == FUNCTION_TYPE)))
4269 WARN_FOR_ASSIGNMENT (G_("ISO C forbids passing argument %d of "
4270 "%qE between function pointer "
4272 G_("ISO C forbids assignment between "
4273 "function pointer and %<void *%>"),
4274 G_("ISO C forbids initialization between "
4275 "function pointer and %<void *%>"),
4276 G_("ISO C forbids return between function "
4277 "pointer and %<void *%>"));
4278 /* Const and volatile mean something different for function types,
4279 so the usual warnings are not appropriate. */
4280 else if (TREE_CODE (ttr) != FUNCTION_TYPE
4281 && TREE_CODE (ttl) != FUNCTION_TYPE)
4283 if (TYPE_QUALS (ttr) & ~TYPE_QUALS (ttl))
4285 /* Types differing only by the presence of the 'volatile'
4286 qualifier are acceptable if the 'volatile' has been added
4287 in by the Objective-C EH machinery. */
4288 if (!objc_type_quals_match (ttl, ttr))
4289 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE discards "
4290 "qualifiers from pointer target type"),
4291 G_("assignment discards qualifiers "
4292 "from pointer target type"),
4293 G_("initialization discards qualifiers "
4294 "from pointer target type"),
4295 G_("return discards qualifiers from "
4296 "pointer target type"));
4298 /* If this is not a case of ignoring a mismatch in signedness,
4300 else if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
4303 /* If there is a mismatch, do warn. */
4304 else if (warn_pointer_sign)
4305 WARN_FOR_ASSIGNMENT (G_("pointer targets in passing argument "
4306 "%d of %qE differ in signedness"),
4307 G_("pointer targets in assignment "
4308 "differ in signedness"),
4309 G_("pointer targets in initialization "
4310 "differ in signedness"),
4311 G_("pointer targets in return differ "
4314 else if (TREE_CODE (ttl) == FUNCTION_TYPE
4315 && TREE_CODE (ttr) == FUNCTION_TYPE)
4317 /* Because const and volatile on functions are restrictions
4318 that say the function will not do certain things,
4319 it is okay to use a const or volatile function
4320 where an ordinary one is wanted, but not vice-versa. */
4321 if (TYPE_QUALS (ttl) & ~TYPE_QUALS (ttr))
4322 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE makes "
4323 "qualified function pointer "
4324 "from unqualified"),
4325 G_("assignment makes qualified function "
4326 "pointer from unqualified"),
4327 G_("initialization makes qualified "
4328 "function pointer from unqualified"),
4329 G_("return makes qualified function "
4330 "pointer from unqualified"));
4334 /* Avoid warning about the volatile ObjC EH puts on decls. */
4336 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE from "
4337 "incompatible pointer type"),
4338 G_("assignment from incompatible pointer type"),
4339 G_("initialization from incompatible "
4341 G_("return from incompatible pointer type"));
4343 return convert (type, rhs);
4345 else if (codel == POINTER_TYPE && coder == ARRAY_TYPE)
4347 /* ??? This should not be an error when inlining calls to
4348 unprototyped functions. */
4349 error ("invalid use of non-lvalue array");
4350 return error_mark_node;
4352 else if (codel == POINTER_TYPE && coder == INTEGER_TYPE)
4354 /* An explicit constant 0 can convert to a pointer,
4355 or one that results from arithmetic, even including
4356 a cast to integer type. */
4357 if (!null_pointer_constant_p (rhs))
4358 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE makes "
4359 "pointer from integer without a cast"),
4360 G_("assignment makes pointer from integer "
4362 G_("initialization makes pointer from "
4363 "integer without a cast"),
4364 G_("return makes pointer from integer "
4367 return convert (type, rhs);
4369 else if (codel == INTEGER_TYPE && coder == POINTER_TYPE)
4371 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE makes integer "
4372 "from pointer without a cast"),
4373 G_("assignment makes integer from pointer "
4375 G_("initialization makes integer from pointer "
4377 G_("return makes integer from pointer "
4379 return convert (type, rhs);
4381 else if (codel == BOOLEAN_TYPE && coder == POINTER_TYPE)
4382 return convert (type, rhs);
4387 case ic_argpass_nonproto:
4388 /* ??? This should not be an error when inlining calls to
4389 unprototyped functions. */
4390 error ("incompatible type for argument %d of %qE", parmnum, rname);
4393 error ("incompatible types in assignment");
4396 error ("incompatible types in initialization");
4399 error ("incompatible types in return");
4405 return error_mark_node;
4408 /* If VALUE is a compound expr all of whose expressions are constant, then
4409 return its value. Otherwise, return error_mark_node.
4411 This is for handling COMPOUND_EXPRs as initializer elements
4412 which is allowed with a warning when -pedantic is specified. */
4415 valid_compound_expr_initializer (tree value, tree endtype)
4417 if (TREE_CODE (value) == COMPOUND_EXPR)
4419 if (valid_compound_expr_initializer (TREE_OPERAND (value, 0), endtype)
4421 return error_mark_node;
4422 return valid_compound_expr_initializer (TREE_OPERAND (value, 1),
4425 else if (!initializer_constant_valid_p (value, endtype))
4426 return error_mark_node;
4431 /* Perform appropriate conversions on the initial value of a variable,
4432 store it in the declaration DECL,
4433 and print any error messages that are appropriate.
4434 If the init is invalid, store an ERROR_MARK. */
4437 store_init_value (tree decl, tree init)
4441 /* If variable's type was invalidly declared, just ignore it. */
4443 type = TREE_TYPE (decl);
4444 if (TREE_CODE (type) == ERROR_MARK)
4447 /* Digest the specified initializer into an expression. */
4449 value = digest_init (type, init, true, TREE_STATIC (decl));
4451 /* Store the expression if valid; else report error. */
4453 if (!in_system_header
4454 && AGGREGATE_TYPE_P (TREE_TYPE (decl)) && !TREE_STATIC (decl))
4455 warning (OPT_Wtraditional, "traditional C rejects automatic "
4456 "aggregate initialization");
4458 DECL_INITIAL (decl) = value;
4460 /* ANSI wants warnings about out-of-range constant initializers. */
4461 STRIP_TYPE_NOPS (value);
4462 if (TREE_STATIC (decl))
4463 constant_expression_warning (value);
4465 /* Check if we need to set array size from compound literal size. */
4466 if (TREE_CODE (type) == ARRAY_TYPE
4467 && TYPE_DOMAIN (type) == 0
4468 && value != error_mark_node)
4470 tree inside_init = init;
4472 STRIP_TYPE_NOPS (inside_init);
4473 inside_init = fold (inside_init);
4475 if (TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
4477 tree cldecl = COMPOUND_LITERAL_EXPR_DECL (inside_init);
4479 if (TYPE_DOMAIN (TREE_TYPE (cldecl)))
4481 /* For int foo[] = (int [3]){1}; we need to set array size
4482 now since later on array initializer will be just the
4483 brace enclosed list of the compound literal. */
4484 type = build_distinct_type_copy (TYPE_MAIN_VARIANT (type));
4485 TREE_TYPE (decl) = type;
4486 TYPE_DOMAIN (type) = TYPE_DOMAIN (TREE_TYPE (cldecl));
4488 layout_decl (cldecl, 0);
4494 /* Methods for storing and printing names for error messages. */
4496 /* Implement a spelling stack that allows components of a name to be pushed
4497 and popped. Each element on the stack is this structure. */
4504 unsigned HOST_WIDE_INT i;
4509 #define SPELLING_STRING 1
4510 #define SPELLING_MEMBER 2
4511 #define SPELLING_BOUNDS 3
4513 static struct spelling *spelling; /* Next stack element (unused). */
4514 static struct spelling *spelling_base; /* Spelling stack base. */
4515 static int spelling_size; /* Size of the spelling stack. */
4517 /* Macros to save and restore the spelling stack around push_... functions.
4518 Alternative to SAVE_SPELLING_STACK. */
4520 #define SPELLING_DEPTH() (spelling - spelling_base)
4521 #define RESTORE_SPELLING_DEPTH(DEPTH) (spelling = spelling_base + (DEPTH))
4523 /* Push an element on the spelling stack with type KIND and assign VALUE
4526 #define PUSH_SPELLING(KIND, VALUE, MEMBER) \
4528 int depth = SPELLING_DEPTH (); \
4530 if (depth >= spelling_size) \
4532 spelling_size += 10; \
4533 spelling_base = XRESIZEVEC (struct spelling, spelling_base, \
4535 RESTORE_SPELLING_DEPTH (depth); \
4538 spelling->kind = (KIND); \
4539 spelling->MEMBER = (VALUE); \
4543 /* Push STRING on the stack. Printed literally. */
4546 push_string (const char *string)
4548 PUSH_SPELLING (SPELLING_STRING, string, u.s);
4551 /* Push a member name on the stack. Printed as '.' STRING. */
4554 push_member_name (tree decl)
4556 const char *const string
4557 = DECL_NAME (decl) ? IDENTIFIER_POINTER (DECL_NAME (decl)) : "<anonymous>";
4558 PUSH_SPELLING (SPELLING_MEMBER, string, u.s);
4561 /* Push an array bounds on the stack. Printed as [BOUNDS]. */
4564 push_array_bounds (unsigned HOST_WIDE_INT bounds)
4566 PUSH_SPELLING (SPELLING_BOUNDS, bounds, u.i);
4569 /* Compute the maximum size in bytes of the printed spelling. */
4572 spelling_length (void)
4577 for (p = spelling_base; p < spelling; p++)
4579 if (p->kind == SPELLING_BOUNDS)
4582 size += strlen (p->u.s) + 1;
4588 /* Print the spelling to BUFFER and return it. */
4591 print_spelling (char *buffer)
4596 for (p = spelling_base; p < spelling; p++)
4597 if (p->kind == SPELLING_BOUNDS)
4599 sprintf (d, "[" HOST_WIDE_INT_PRINT_UNSIGNED "]", p->u.i);
4605 if (p->kind == SPELLING_MEMBER)
4607 for (s = p->u.s; (*d = *s++); d++)
4614 /* Issue an error message for a bad initializer component.
4615 MSGID identifies the message.
4616 The component name is taken from the spelling stack. */
4619 error_init (const char *msgid)
4623 error ("%s", _(msgid));
4624 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4626 error ("(near initialization for %qs)", ofwhat);
4629 /* Issue a pedantic warning for a bad initializer component.
4630 MSGID identifies the message.
4631 The component name is taken from the spelling stack. */
4634 pedwarn_init (const char *msgid)
4638 pedwarn ("%s", _(msgid));
4639 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4641 pedwarn ("(near initialization for %qs)", ofwhat);
4644 /* Issue a warning for a bad initializer component.
4646 OPT is the OPT_W* value corresponding to the warning option that
4647 controls this warning. MSGID identifies the message. The
4648 component name is taken from the spelling stack. */
4651 warning_init (int opt, const char *msgid)
4655 warning (opt, "%s", _(msgid));
4656 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4658 warning (opt, "(near initialization for %qs)", ofwhat);
4661 /* If TYPE is an array type and EXPR is a parenthesized string
4662 constant, warn if pedantic that EXPR is being used to initialize an
4663 object of type TYPE. */
4666 maybe_warn_string_init (tree type, struct c_expr expr)
4669 && TREE_CODE (type) == ARRAY_TYPE
4670 && TREE_CODE (expr.value) == STRING_CST
4671 && expr.original_code != STRING_CST)
4672 pedwarn_init ("array initialized from parenthesized string constant");
4675 /* Digest the parser output INIT as an initializer for type TYPE.
4676 Return a C expression of type TYPE to represent the initial value.
4678 If INIT is a string constant, STRICT_STRING is true if it is
4679 unparenthesized or we should not warn here for it being parenthesized.
4680 For other types of INIT, STRICT_STRING is not used.
4682 REQUIRE_CONSTANT requests an error if non-constant initializers or
4683 elements are seen. */
4686 digest_init (tree type, tree init, bool strict_string, int require_constant)
4688 enum tree_code code = TREE_CODE (type);
4689 tree inside_init = init;
4691 if (type == error_mark_node
4693 || init == error_mark_node
4694 || TREE_TYPE (init) == error_mark_node)
4695 return error_mark_node;
4697 STRIP_TYPE_NOPS (inside_init);
4699 inside_init = fold (inside_init);
4701 /* Initialization of an array of chars from a string constant
4702 optionally enclosed in braces. */
4704 if (code == ARRAY_TYPE && inside_init
4705 && TREE_CODE (inside_init) == STRING_CST)
4707 tree typ1 = TYPE_MAIN_VARIANT (TREE_TYPE (type));
4708 /* Note that an array could be both an array of character type
4709 and an array of wchar_t if wchar_t is signed char or unsigned
4711 bool char_array = (typ1 == char_type_node
4712 || typ1 == signed_char_type_node
4713 || typ1 == unsigned_char_type_node);
4714 bool wchar_array = !!comptypes (typ1, wchar_type_node);
4715 if (char_array || wchar_array)
4719 expr.value = inside_init;
4720 expr.original_code = (strict_string ? STRING_CST : ERROR_MARK);
4721 maybe_warn_string_init (type, expr);
4724 = (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (inside_init)))
4727 if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
4728 TYPE_MAIN_VARIANT (type)))
4731 if (!wchar_array && !char_string)
4733 error_init ("char-array initialized from wide string");
4734 return error_mark_node;
4736 if (char_string && !char_array)
4738 error_init ("wchar_t-array initialized from non-wide string");
4739 return error_mark_node;
4742 TREE_TYPE (inside_init) = type;
4743 if (TYPE_DOMAIN (type) != 0
4744 && TYPE_SIZE (type) != 0
4745 && TREE_CODE (TYPE_SIZE (type)) == INTEGER_CST
4746 /* Subtract 1 (or sizeof (wchar_t))
4747 because it's ok to ignore the terminating null char
4748 that is counted in the length of the constant. */
4749 && 0 > compare_tree_int (TYPE_SIZE_UNIT (type),
4750 TREE_STRING_LENGTH (inside_init)
4751 - ((TYPE_PRECISION (typ1)
4752 != TYPE_PRECISION (char_type_node))
4753 ? (TYPE_PRECISION (wchar_type_node)
4756 pedwarn_init ("initializer-string for array of chars is too long");
4760 else if (INTEGRAL_TYPE_P (typ1))
4762 error_init ("array of inappropriate type initialized "
4763 "from string constant");
4764 return error_mark_node;
4768 /* Build a VECTOR_CST from a *constant* vector constructor. If the
4769 vector constructor is not constant (e.g. {1,2,3,foo()}) then punt
4770 below and handle as a constructor. */
4771 if (code == VECTOR_TYPE
4772 && TREE_CODE (TREE_TYPE (inside_init)) == VECTOR_TYPE
4773 && vector_types_convertible_p (TREE_TYPE (inside_init), type, true)
4774 && TREE_CONSTANT (inside_init))
4776 if (TREE_CODE (inside_init) == VECTOR_CST
4777 && comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
4778 TYPE_MAIN_VARIANT (type)))
4781 if (TREE_CODE (inside_init) == CONSTRUCTOR)
4783 unsigned HOST_WIDE_INT ix;
4785 bool constant_p = true;
4787 /* Iterate through elements and check if all constructor
4788 elements are *_CSTs. */
4789 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (inside_init), ix, value)
4790 if (!CONSTANT_CLASS_P (value))
4797 return build_vector_from_ctor (type,
4798 CONSTRUCTOR_ELTS (inside_init));
4802 /* Any type can be initialized
4803 from an expression of the same type, optionally with braces. */
4805 if (inside_init && TREE_TYPE (inside_init) != 0
4806 && (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
4807 TYPE_MAIN_VARIANT (type))
4808 || (code == ARRAY_TYPE
4809 && comptypes (TREE_TYPE (inside_init), type))
4810 || (code == VECTOR_TYPE
4811 && comptypes (TREE_TYPE (inside_init), type))
4812 || (code == POINTER_TYPE
4813 && TREE_CODE (TREE_TYPE (inside_init)) == ARRAY_TYPE
4814 && comptypes (TREE_TYPE (TREE_TYPE (inside_init)),
4815 TREE_TYPE (type)))))
4817 if (code == POINTER_TYPE)
4819 if (TREE_CODE (TREE_TYPE (inside_init)) == ARRAY_TYPE)
4821 if (TREE_CODE (inside_init) == STRING_CST
4822 || TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
4823 inside_init = array_to_pointer_conversion (inside_init);
4826 error_init ("invalid use of non-lvalue array");
4827 return error_mark_node;
4832 if (code == VECTOR_TYPE)
4833 /* Although the types are compatible, we may require a
4835 inside_init = convert (type, inside_init);
4837 if (require_constant
4838 && (code == VECTOR_TYPE || !flag_isoc99)
4839 && TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
4841 /* As an extension, allow initializing objects with static storage
4842 duration with compound literals (which are then treated just as
4843 the brace enclosed list they contain). Also allow this for
4844 vectors, as we can only assign them with compound literals. */
4845 tree decl = COMPOUND_LITERAL_EXPR_DECL (inside_init);
4846 inside_init = DECL_INITIAL (decl);
4849 if (code == ARRAY_TYPE && TREE_CODE (inside_init) != STRING_CST
4850 && TREE_CODE (inside_init) != CONSTRUCTOR)
4852 error_init ("array initialized from non-constant array expression");
4853 return error_mark_node;
4856 if (optimize && TREE_CODE (inside_init) == VAR_DECL)
4857 inside_init = decl_constant_value_for_broken_optimization (inside_init);
4859 /* Compound expressions can only occur here if -pedantic or
4860 -pedantic-errors is specified. In the later case, we always want
4861 an error. In the former case, we simply want a warning. */
4862 if (require_constant && pedantic
4863 && TREE_CODE (inside_init) == COMPOUND_EXPR)
4866 = valid_compound_expr_initializer (inside_init,
4867 TREE_TYPE (inside_init));
4868 if (inside_init == error_mark_node)
4869 error_init ("initializer element is not constant");
4871 pedwarn_init ("initializer element is not constant");
4872 if (flag_pedantic_errors)
4873 inside_init = error_mark_node;
4875 else if (require_constant
4876 && !initializer_constant_valid_p (inside_init,
4877 TREE_TYPE (inside_init)))
4879 error_init ("initializer element is not constant");
4880 inside_init = error_mark_node;
4883 /* Added to enable additional -Wmissing-format-attribute warnings. */
4884 if (TREE_CODE (TREE_TYPE (inside_init)) == POINTER_TYPE)
4885 inside_init = convert_for_assignment (type, inside_init, ic_init, NULL_TREE,
4890 /* Handle scalar types, including conversions. */
4892 if (code == INTEGER_TYPE || code == REAL_TYPE || code == FIXED_POINT_TYPE
4893 || code == POINTER_TYPE || code == ENUMERAL_TYPE || code == BOOLEAN_TYPE
4894 || code == COMPLEX_TYPE || code == VECTOR_TYPE)
4896 if (TREE_CODE (TREE_TYPE (init)) == ARRAY_TYPE
4897 && (TREE_CODE (init) == STRING_CST
4898 || TREE_CODE (init) == COMPOUND_LITERAL_EXPR))
4899 init = array_to_pointer_conversion (init);
4901 = convert_for_assignment (type, init, ic_init,
4902 NULL_TREE, NULL_TREE, 0);
4904 /* Check to see if we have already given an error message. */
4905 if (inside_init == error_mark_node)
4907 else if (require_constant && !TREE_CONSTANT (inside_init))
4909 error_init ("initializer element is not constant");
4910 inside_init = error_mark_node;
4912 else if (require_constant
4913 && !initializer_constant_valid_p (inside_init,
4914 TREE_TYPE (inside_init)))
4916 error_init ("initializer element is not computable at load time");
4917 inside_init = error_mark_node;
4923 /* Come here only for records and arrays. */
4925 if (COMPLETE_TYPE_P (type) && TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST)
4927 error_init ("variable-sized object may not be initialized");
4928 return error_mark_node;
4931 error_init ("invalid initializer");
4932 return error_mark_node;
4935 /* Handle initializers that use braces. */
4937 /* Type of object we are accumulating a constructor for.
4938 This type is always a RECORD_TYPE, UNION_TYPE or ARRAY_TYPE. */
4939 static tree constructor_type;
4941 /* For a RECORD_TYPE or UNION_TYPE, this is the chain of fields
4943 static tree constructor_fields;
4945 /* For an ARRAY_TYPE, this is the specified index
4946 at which to store the next element we get. */
4947 static tree constructor_index;
4949 /* For an ARRAY_TYPE, this is the maximum index. */
4950 static tree constructor_max_index;
4952 /* For a RECORD_TYPE, this is the first field not yet written out. */
4953 static tree constructor_unfilled_fields;
4955 /* For an ARRAY_TYPE, this is the index of the first element
4956 not yet written out. */
4957 static tree constructor_unfilled_index;
4959 /* In a RECORD_TYPE, the byte index of the next consecutive field.
4960 This is so we can generate gaps between fields, when appropriate. */
4961 static tree constructor_bit_index;
4963 /* If we are saving up the elements rather than allocating them,
4964 this is the list of elements so far (in reverse order,
4965 most recent first). */
4966 static VEC(constructor_elt,gc) *constructor_elements;
4968 /* 1 if constructor should be incrementally stored into a constructor chain,
4969 0 if all the elements should be kept in AVL tree. */
4970 static int constructor_incremental;
4972 /* 1 if so far this constructor's elements are all compile-time constants. */
4973 static int constructor_constant;
4975 /* 1 if so far this constructor's elements are all valid address constants. */
4976 static int constructor_simple;
4978 /* 1 if this constructor is erroneous so far. */
4979 static int constructor_erroneous;
4981 /* Structure for managing pending initializer elements, organized as an
4986 struct init_node *left, *right;
4987 struct init_node *parent;
4993 /* Tree of pending elements at this constructor level.
4994 These are elements encountered out of order
4995 which belong at places we haven't reached yet in actually
4997 Will never hold tree nodes across GC runs. */
4998 static struct init_node *constructor_pending_elts;
5000 /* The SPELLING_DEPTH of this constructor. */
5001 static int constructor_depth;
5003 /* DECL node for which an initializer is being read.
5004 0 means we are reading a constructor expression
5005 such as (struct foo) {...}. */
5006 static tree constructor_decl;
5008 /* Nonzero if this is an initializer for a top-level decl. */
5009 static int constructor_top_level;
5011 /* Nonzero if there were any member designators in this initializer. */
5012 static int constructor_designated;
5014 /* Nesting depth of designator list. */
5015 static int designator_depth;
5017 /* Nonzero if there were diagnosed errors in this designator list. */
5018 static int designator_erroneous;
5021 /* This stack has a level for each implicit or explicit level of
5022 structuring in the initializer, including the outermost one. It
5023 saves the values of most of the variables above. */
5025 struct constructor_range_stack;
5027 struct constructor_stack
5029 struct constructor_stack *next;
5034 tree unfilled_index;
5035 tree unfilled_fields;
5037 VEC(constructor_elt,gc) *elements;
5038 struct init_node *pending_elts;
5041 /* If value nonzero, this value should replace the entire
5042 constructor at this level. */
5043 struct c_expr replacement_value;
5044 struct constructor_range_stack *range_stack;
5054 static struct constructor_stack *constructor_stack;
5056 /* This stack represents designators from some range designator up to
5057 the last designator in the list. */
5059 struct constructor_range_stack
5061 struct constructor_range_stack *next, *prev;
5062 struct constructor_stack *stack;
5069 static struct constructor_range_stack *constructor_range_stack;
5071 /* This stack records separate initializers that are nested.
5072 Nested initializers can't happen in ANSI C, but GNU C allows them
5073 in cases like { ... (struct foo) { ... } ... }. */
5075 struct initializer_stack
5077 struct initializer_stack *next;
5079 struct constructor_stack *constructor_stack;
5080 struct constructor_range_stack *constructor_range_stack;
5081 VEC(constructor_elt,gc) *elements;
5082 struct spelling *spelling;
5083 struct spelling *spelling_base;
5086 char require_constant_value;
5087 char require_constant_elements;
5090 static struct initializer_stack *initializer_stack;
5092 /* Prepare to parse and output the initializer for variable DECL. */
5095 start_init (tree decl, tree asmspec_tree ATTRIBUTE_UNUSED, int top_level)
5098 struct initializer_stack *p = XNEW (struct initializer_stack);
5100 p->decl = constructor_decl;
5101 p->require_constant_value = require_constant_value;
5102 p->require_constant_elements = require_constant_elements;
5103 p->constructor_stack = constructor_stack;
5104 p->constructor_range_stack = constructor_range_stack;
5105 p->elements = constructor_elements;
5106 p->spelling = spelling;
5107 p->spelling_base = spelling_base;
5108 p->spelling_size = spelling_size;
5109 p->top_level = constructor_top_level;
5110 p->next = initializer_stack;
5111 initializer_stack = p;
5113 constructor_decl = decl;
5114 constructor_designated = 0;
5115 constructor_top_level = top_level;
5117 if (decl != 0 && decl != error_mark_node)
5119 require_constant_value = TREE_STATIC (decl);
5120 require_constant_elements
5121 = ((TREE_STATIC (decl) || (pedantic && !flag_isoc99))
5122 /* For a scalar, you can always use any value to initialize,
5123 even within braces. */
5124 && (TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE
5125 || TREE_CODE (TREE_TYPE (decl)) == RECORD_TYPE
5126 || TREE_CODE (TREE_TYPE (decl)) == UNION_TYPE
5127 || TREE_CODE (TREE_TYPE (decl)) == QUAL_UNION_TYPE));
5128 locus = IDENTIFIER_POINTER (DECL_NAME (decl));
5132 require_constant_value = 0;
5133 require_constant_elements = 0;
5134 locus = "(anonymous)";
5137 constructor_stack = 0;
5138 constructor_range_stack = 0;
5140 missing_braces_mentioned = 0;
5144 RESTORE_SPELLING_DEPTH (0);
5147 push_string (locus);
5153 struct initializer_stack *p = initializer_stack;
5155 /* Free the whole constructor stack of this initializer. */
5156 while (constructor_stack)
5158 struct constructor_stack *q = constructor_stack;
5159 constructor_stack = q->next;
5163 gcc_assert (!constructor_range_stack);
5165 /* Pop back to the data of the outer initializer (if any). */
5166 free (spelling_base);
5168 constructor_decl = p->decl;
5169 require_constant_value = p->require_constant_value;
5170 require_constant_elements = p->require_constant_elements;
5171 constructor_stack = p->constructor_stack;
5172 constructor_range_stack = p->constructor_range_stack;
5173 constructor_elements = p->elements;
5174 spelling = p->spelling;
5175 spelling_base = p->spelling_base;
5176 spelling_size = p->spelling_size;
5177 constructor_top_level = p->top_level;
5178 initializer_stack = p->next;
5182 /* Call here when we see the initializer is surrounded by braces.
5183 This is instead of a call to push_init_level;
5184 it is matched by a call to pop_init_level.
5186 TYPE is the type to initialize, for a constructor expression.
5187 For an initializer for a decl, TYPE is zero. */
5190 really_start_incremental_init (tree type)
5192 struct constructor_stack *p = XNEW (struct constructor_stack);
5195 type = TREE_TYPE (constructor_decl);
5197 if (targetm.vector_opaque_p (type))
5198 error ("opaque vector types cannot be initialized");
5200 p->type = constructor_type;
5201 p->fields = constructor_fields;
5202 p->index = constructor_index;
5203 p->max_index = constructor_max_index;
5204 p->unfilled_index = constructor_unfilled_index;
5205 p->unfilled_fields = constructor_unfilled_fields;
5206 p->bit_index = constructor_bit_index;
5207 p->elements = constructor_elements;
5208 p->constant = constructor_constant;
5209 p->simple = constructor_simple;
5210 p->erroneous = constructor_erroneous;
5211 p->pending_elts = constructor_pending_elts;
5212 p->depth = constructor_depth;
5213 p->replacement_value.value = 0;
5214 p->replacement_value.original_code = ERROR_MARK;
5218 p->incremental = constructor_incremental;
5219 p->designated = constructor_designated;
5221 constructor_stack = p;
5223 constructor_constant = 1;
5224 constructor_simple = 1;
5225 constructor_depth = SPELLING_DEPTH ();
5226 constructor_elements = 0;
5227 constructor_pending_elts = 0;
5228 constructor_type = type;
5229 constructor_incremental = 1;
5230 constructor_designated = 0;
5231 designator_depth = 0;
5232 designator_erroneous = 0;
5234 if (TREE_CODE (constructor_type) == RECORD_TYPE
5235 || TREE_CODE (constructor_type) == UNION_TYPE)
5237 constructor_fields = TYPE_FIELDS (constructor_type);
5238 /* Skip any nameless bit fields at the beginning. */
5239 while (constructor_fields != 0 && DECL_C_BIT_FIELD (constructor_fields)
5240 && DECL_NAME (constructor_fields) == 0)
5241 constructor_fields = TREE_CHAIN (constructor_fields);
5243 constructor_unfilled_fields = constructor_fields;
5244 constructor_bit_index = bitsize_zero_node;
5246 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5248 if (TYPE_DOMAIN (constructor_type))
5250 constructor_max_index
5251 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type));
5253 /* Detect non-empty initializations of zero-length arrays. */
5254 if (constructor_max_index == NULL_TREE
5255 && TYPE_SIZE (constructor_type))
5256 constructor_max_index = build_int_cst (NULL_TREE, -1);
5258 /* constructor_max_index needs to be an INTEGER_CST. Attempts
5259 to initialize VLAs will cause a proper error; avoid tree
5260 checking errors as well by setting a safe value. */
5261 if (constructor_max_index
5262 && TREE_CODE (constructor_max_index) != INTEGER_CST)
5263 constructor_max_index = build_int_cst (NULL_TREE, -1);
5266 = convert (bitsizetype,
5267 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
5271 constructor_index = bitsize_zero_node;
5272 constructor_max_index = NULL_TREE;
5275 constructor_unfilled_index = constructor_index;
5277 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
5279 /* Vectors are like simple fixed-size arrays. */
5280 constructor_max_index =
5281 build_int_cst (NULL_TREE, TYPE_VECTOR_SUBPARTS (constructor_type) - 1);
5282 constructor_index = bitsize_zero_node;
5283 constructor_unfilled_index = constructor_index;
5287 /* Handle the case of int x = {5}; */
5288 constructor_fields = constructor_type;
5289 constructor_unfilled_fields = constructor_type;
5293 /* Push down into a subobject, for initialization.
5294 If this is for an explicit set of braces, IMPLICIT is 0.
5295 If it is because the next element belongs at a lower level,
5296 IMPLICIT is 1 (or 2 if the push is because of designator list). */
5299 push_init_level (int implicit)
5301 struct constructor_stack *p;
5302 tree value = NULL_TREE;
5304 /* If we've exhausted any levels that didn't have braces,
5305 pop them now. If implicit == 1, this will have been done in
5306 process_init_element; do not repeat it here because in the case
5307 of excess initializers for an empty aggregate this leads to an
5308 infinite cycle of popping a level and immediately recreating
5312 while (constructor_stack->implicit)
5314 if ((TREE_CODE (constructor_type) == RECORD_TYPE
5315 || TREE_CODE (constructor_type) == UNION_TYPE)
5316 && constructor_fields == 0)
5317 process_init_element (pop_init_level (1));
5318 else if (TREE_CODE (constructor_type) == ARRAY_TYPE
5319 && constructor_max_index
5320 && tree_int_cst_lt (constructor_max_index,
5322 process_init_element (pop_init_level (1));
5328 /* Unless this is an explicit brace, we need to preserve previous
5332 if ((TREE_CODE (constructor_type) == RECORD_TYPE
5333 || TREE_CODE (constructor_type) == UNION_TYPE)
5334 && constructor_fields)
5335 value = find_init_member (constructor_fields);
5336 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5337 value = find_init_member (constructor_index);
5340 p = XNEW (struct constructor_stack);
5341 p->type = constructor_type;
5342 p->fields = constructor_fields;
5343 p->index = constructor_index;
5344 p->max_index = constructor_max_index;
5345 p->unfilled_index = constructor_unfilled_index;
5346 p->unfilled_fields = constructor_unfilled_fields;
5347 p->bit_index = constructor_bit_index;
5348 p->elements = constructor_elements;
5349 p->constant = constructor_constant;
5350 p->simple = constructor_simple;
5351 p->erroneous = constructor_erroneous;
5352 p->pending_elts = constructor_pending_elts;
5353 p->depth = constructor_depth;
5354 p->replacement_value.value = 0;
5355 p->replacement_value.original_code = ERROR_MARK;
5356 p->implicit = implicit;
5358 p->incremental = constructor_incremental;
5359 p->designated = constructor_designated;
5360 p->next = constructor_stack;
5362 constructor_stack = p;
5364 constructor_constant = 1;
5365 constructor_simple = 1;
5366 constructor_depth = SPELLING_DEPTH ();
5367 constructor_elements = 0;
5368 constructor_incremental = 1;
5369 constructor_designated = 0;
5370 constructor_pending_elts = 0;
5373 p->range_stack = constructor_range_stack;
5374 constructor_range_stack = 0;
5375 designator_depth = 0;
5376 designator_erroneous = 0;
5379 /* Don't die if an entire brace-pair level is superfluous
5380 in the containing level. */
5381 if (constructor_type == 0)
5383 else if (TREE_CODE (constructor_type) == RECORD_TYPE
5384 || TREE_CODE (constructor_type) == UNION_TYPE)
5386 /* Don't die if there are extra init elts at the end. */
5387 if (constructor_fields == 0)
5388 constructor_type = 0;
5391 constructor_type = TREE_TYPE (constructor_fields);
5392 push_member_name (constructor_fields);
5393 constructor_depth++;
5396 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5398 constructor_type = TREE_TYPE (constructor_type);
5399 push_array_bounds (tree_low_cst (constructor_index, 1));
5400 constructor_depth++;
5403 if (constructor_type == 0)
5405 error_init ("extra brace group at end of initializer");
5406 constructor_fields = 0;
5407 constructor_unfilled_fields = 0;
5411 if (value && TREE_CODE (value) == CONSTRUCTOR)
5413 constructor_constant = TREE_CONSTANT (value);
5414 constructor_simple = TREE_STATIC (value);
5415 constructor_elements = CONSTRUCTOR_ELTS (value);
5416 if (!VEC_empty (constructor_elt, constructor_elements)
5417 && (TREE_CODE (constructor_type) == RECORD_TYPE
5418 || TREE_CODE (constructor_type) == ARRAY_TYPE))
5419 set_nonincremental_init ();
5422 if (implicit == 1 && warn_missing_braces && !missing_braces_mentioned)
5424 missing_braces_mentioned = 1;
5425 warning_init (OPT_Wmissing_braces, "missing braces around initializer");
5428 if (TREE_CODE (constructor_type) == RECORD_TYPE
5429 || TREE_CODE (constructor_type) == UNION_TYPE)
5431 constructor_fields = TYPE_FIELDS (constructor_type);
5432 /* Skip any nameless bit fields at the beginning. */
5433 while (constructor_fields != 0 && DECL_C_BIT_FIELD (constructor_fields)
5434 && DECL_NAME (constructor_fields) == 0)
5435 constructor_fields = TREE_CHAIN (constructor_fields);
5437 constructor_unfilled_fields = constructor_fields;
5438 constructor_bit_index = bitsize_zero_node;
5440 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
5442 /* Vectors are like simple fixed-size arrays. */
5443 constructor_max_index =
5444 build_int_cst (NULL_TREE, TYPE_VECTOR_SUBPARTS (constructor_type) - 1);
5445 constructor_index = convert (bitsizetype, integer_zero_node);
5446 constructor_unfilled_index = constructor_index;
5448 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5450 if (TYPE_DOMAIN (constructor_type))
5452 constructor_max_index
5453 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type));
5455 /* Detect non-empty initializations of zero-length arrays. */
5456 if (constructor_max_index == NULL_TREE
5457 && TYPE_SIZE (constructor_type))
5458 constructor_max_index = build_int_cst (NULL_TREE, -1);
5460 /* constructor_max_index needs to be an INTEGER_CST. Attempts
5461 to initialize VLAs will cause a proper error; avoid tree
5462 checking errors as well by setting a safe value. */
5463 if (constructor_max_index
5464 && TREE_CODE (constructor_max_index) != INTEGER_CST)
5465 constructor_max_index = build_int_cst (NULL_TREE, -1);
5468 = convert (bitsizetype,
5469 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
5472 constructor_index = bitsize_zero_node;
5474 constructor_unfilled_index = constructor_index;
5475 if (value && TREE_CODE (value) == STRING_CST)
5477 /* We need to split the char/wchar array into individual
5478 characters, so that we don't have to special case it
5480 set_nonincremental_init_from_string (value);
5485 if (constructor_type != error_mark_node)
5486 warning_init (0, "braces around scalar initializer");
5487 constructor_fields = constructor_type;
5488 constructor_unfilled_fields = constructor_type;
5492 /* At the end of an implicit or explicit brace level,
5493 finish up that level of constructor. If a single expression
5494 with redundant braces initialized that level, return the
5495 c_expr structure for that expression. Otherwise, the original_code
5496 element is set to ERROR_MARK.
5497 If we were outputting the elements as they are read, return 0 as the value
5498 from inner levels (process_init_element ignores that),
5499 but return error_mark_node as the value from the outermost level
5500 (that's what we want to put in DECL_INITIAL).
5501 Otherwise, return a CONSTRUCTOR expression as the value. */
5504 pop_init_level (int implicit)
5506 struct constructor_stack *p;
5509 ret.original_code = ERROR_MARK;
5513 /* When we come to an explicit close brace,
5514 pop any inner levels that didn't have explicit braces. */
5515 while (constructor_stack->implicit)
5516 process_init_element (pop_init_level (1));
5518 gcc_assert (!constructor_range_stack);
5521 /* Now output all pending elements. */
5522 constructor_incremental = 1;
5523 output_pending_init_elements (1);
5525 p = constructor_stack;
5527 /* Error for initializing a flexible array member, or a zero-length
5528 array member in an inappropriate context. */
5529 if (constructor_type && constructor_fields
5530 && TREE_CODE (constructor_type) == ARRAY_TYPE
5531 && TYPE_DOMAIN (constructor_type)
5532 && !TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type)))
5534 /* Silently discard empty initializations. The parser will
5535 already have pedwarned for empty brackets. */
5536 if (integer_zerop (constructor_unfilled_index))
5537 constructor_type = NULL_TREE;
5540 gcc_assert (!TYPE_SIZE (constructor_type));
5542 if (constructor_depth > 2)
5543 error_init ("initialization of flexible array member in a nested context");
5545 pedwarn_init ("initialization of a flexible array member");
5547 /* We have already issued an error message for the existence
5548 of a flexible array member not at the end of the structure.
5549 Discard the initializer so that we do not die later. */
5550 if (TREE_CHAIN (constructor_fields) != NULL_TREE)
5551 constructor_type = NULL_TREE;
5555 /* Warn when some struct elements are implicitly initialized to zero. */
5556 if (warn_missing_field_initializers
5558 && TREE_CODE (constructor_type) == RECORD_TYPE
5559 && constructor_unfilled_fields)
5561 /* Do not warn for flexible array members or zero-length arrays. */
5562 while (constructor_unfilled_fields
5563 && (!DECL_SIZE (constructor_unfilled_fields)
5564 || integer_zerop (DECL_SIZE (constructor_unfilled_fields))))
5565 constructor_unfilled_fields = TREE_CHAIN (constructor_unfilled_fields);
5567 /* Do not warn if this level of the initializer uses member
5568 designators; it is likely to be deliberate. */
5569 if (constructor_unfilled_fields && !constructor_designated)
5571 push_member_name (constructor_unfilled_fields);
5572 warning_init (OPT_Wmissing_field_initializers,
5573 "missing initializer");
5574 RESTORE_SPELLING_DEPTH (constructor_depth);
5578 /* Pad out the end of the structure. */
5579 if (p->replacement_value.value)
5580 /* If this closes a superfluous brace pair,
5581 just pass out the element between them. */
5582 ret = p->replacement_value;
5583 else if (constructor_type == 0)
5585 else if (TREE_CODE (constructor_type) != RECORD_TYPE
5586 && TREE_CODE (constructor_type) != UNION_TYPE
5587 && TREE_CODE (constructor_type) != ARRAY_TYPE
5588 && TREE_CODE (constructor_type) != VECTOR_TYPE)
5590 /* A nonincremental scalar initializer--just return
5591 the element, after verifying there is just one. */
5592 if (VEC_empty (constructor_elt,constructor_elements))
5594 if (!constructor_erroneous)
5595 error_init ("empty scalar initializer");
5596 ret.value = error_mark_node;
5598 else if (VEC_length (constructor_elt,constructor_elements) != 1)
5600 error_init ("extra elements in scalar initializer");
5601 ret.value = VEC_index (constructor_elt,constructor_elements,0)->value;
5604 ret.value = VEC_index (constructor_elt,constructor_elements,0)->value;
5608 if (constructor_erroneous)
5609 ret.value = error_mark_node;
5612 ret.value = build_constructor (constructor_type,
5613 constructor_elements);
5614 if (constructor_constant)
5615 TREE_CONSTANT (ret.value) = 1;
5616 if (constructor_constant && constructor_simple)
5617 TREE_STATIC (ret.value) = 1;
5621 constructor_type = p->type;
5622 constructor_fields = p->fields;
5623 constructor_index = p->index;
5624 constructor_max_index = p->max_index;
5625 constructor_unfilled_index = p->unfilled_index;
5626 constructor_unfilled_fields = p->unfilled_fields;
5627 constructor_bit_index = p->bit_index;
5628 constructor_elements = p->elements;
5629 constructor_constant = p->constant;
5630 constructor_simple = p->simple;
5631 constructor_erroneous = p->erroneous;
5632 constructor_incremental = p->incremental;
5633 constructor_designated = p->designated;
5634 constructor_pending_elts = p->pending_elts;
5635 constructor_depth = p->depth;
5637 constructor_range_stack = p->range_stack;
5638 RESTORE_SPELLING_DEPTH (constructor_depth);
5640 constructor_stack = p->next;
5643 if (ret.value == 0 && constructor_stack == 0)
5644 ret.value = error_mark_node;
5648 /* Common handling for both array range and field name designators.
5649 ARRAY argument is nonzero for array ranges. Returns zero for success. */
5652 set_designator (int array)
5655 enum tree_code subcode;
5657 /* Don't die if an entire brace-pair level is superfluous
5658 in the containing level. */
5659 if (constructor_type == 0)
5662 /* If there were errors in this designator list already, bail out
5664 if (designator_erroneous)
5667 if (!designator_depth)
5669 gcc_assert (!constructor_range_stack);
5671 /* Designator list starts at the level of closest explicit
5673 while (constructor_stack->implicit)
5674 process_init_element (pop_init_level (1));
5675 constructor_designated = 1;
5679 switch (TREE_CODE (constructor_type))
5683 subtype = TREE_TYPE (constructor_fields);
5684 if (subtype != error_mark_node)
5685 subtype = TYPE_MAIN_VARIANT (subtype);
5688 subtype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
5694 subcode = TREE_CODE (subtype);
5695 if (array && subcode != ARRAY_TYPE)
5697 error_init ("array index in non-array initializer");
5700 else if (!array && subcode != RECORD_TYPE && subcode != UNION_TYPE)
5702 error_init ("field name not in record or union initializer");
5706 constructor_designated = 1;
5707 push_init_level (2);
5711 /* If there are range designators in designator list, push a new designator
5712 to constructor_range_stack. RANGE_END is end of such stack range or
5713 NULL_TREE if there is no range designator at this level. */
5716 push_range_stack (tree range_end)
5718 struct constructor_range_stack *p;
5720 p = GGC_NEW (struct constructor_range_stack);
5721 p->prev = constructor_range_stack;
5723 p->fields = constructor_fields;
5724 p->range_start = constructor_index;
5725 p->index = constructor_index;
5726 p->stack = constructor_stack;
5727 p->range_end = range_end;
5728 if (constructor_range_stack)
5729 constructor_range_stack->next = p;
5730 constructor_range_stack = p;
5733 /* Within an array initializer, specify the next index to be initialized.
5734 FIRST is that index. If LAST is nonzero, then initialize a range
5735 of indices, running from FIRST through LAST. */
5738 set_init_index (tree first, tree last)
5740 if (set_designator (1))
5743 designator_erroneous = 1;
5745 if (!INTEGRAL_TYPE_P (TREE_TYPE (first))
5746 || (last && !INTEGRAL_TYPE_P (TREE_TYPE (last))))
5748 error_init ("array index in initializer not of integer type");
5752 if (TREE_CODE (first) != INTEGER_CST)
5753 error_init ("nonconstant array index in initializer");
5754 else if (last != 0 && TREE_CODE (last) != INTEGER_CST)
5755 error_init ("nonconstant array index in initializer");
5756 else if (TREE_CODE (constructor_type) != ARRAY_TYPE)
5757 error_init ("array index in non-array initializer");
5758 else if (tree_int_cst_sgn (first) == -1)
5759 error_init ("array index in initializer exceeds array bounds");
5760 else if (constructor_max_index
5761 && tree_int_cst_lt (constructor_max_index, first))
5762 error_init ("array index in initializer exceeds array bounds");
5765 constructor_index = convert (bitsizetype, first);
5769 if (tree_int_cst_equal (first, last))
5771 else if (tree_int_cst_lt (last, first))
5773 error_init ("empty index range in initializer");
5778 last = convert (bitsizetype, last);
5779 if (constructor_max_index != 0
5780 && tree_int_cst_lt (constructor_max_index, last))
5782 error_init ("array index range in initializer exceeds array bounds");
5789 designator_erroneous = 0;
5790 if (constructor_range_stack || last)
5791 push_range_stack (last);
5795 /* Within a struct initializer, specify the next field to be initialized. */
5798 set_init_label (tree fieldname)
5802 if (set_designator (0))
5805 designator_erroneous = 1;
5807 if (TREE_CODE (constructor_type) != RECORD_TYPE
5808 && TREE_CODE (constructor_type) != UNION_TYPE)
5810 error_init ("field name not in record or union initializer");
5814 for (tail = TYPE_FIELDS (constructor_type); tail;
5815 tail = TREE_CHAIN (tail))
5817 if (DECL_NAME (tail) == fieldname)
5822 error ("unknown field %qE specified in initializer", fieldname);
5825 constructor_fields = tail;
5827 designator_erroneous = 0;
5828 if (constructor_range_stack)
5829 push_range_stack (NULL_TREE);
5833 /* Add a new initializer to the tree of pending initializers. PURPOSE
5834 identifies the initializer, either array index or field in a structure.
5835 VALUE is the value of that index or field. */
5838 add_pending_init (tree purpose, tree value)
5840 struct init_node *p, **q, *r;
5842 q = &constructor_pending_elts;
5845 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5850 if (tree_int_cst_lt (purpose, p->purpose))
5852 else if (tree_int_cst_lt (p->purpose, purpose))
5856 if (TREE_SIDE_EFFECTS (p->value))
5857 warning_init (0, "initialized field with side-effects overwritten");
5858 else if (warn_override_init)
5859 warning_init (OPT_Woverride_init, "initialized field overwritten");
5869 bitpos = bit_position (purpose);
5873 if (tree_int_cst_lt (bitpos, bit_position (p->purpose)))
5875 else if (p->purpose != purpose)
5879 if (TREE_SIDE_EFFECTS (p->value))
5880 warning_init (0, "initialized field with side-effects overwritten");
5881 else if (warn_override_init)
5882 warning_init (OPT_Woverride_init, "initialized field overwritten");
5889 r = GGC_NEW (struct init_node);
5890 r->purpose = purpose;
5901 struct init_node *s;
5905 if (p->balance == 0)
5907 else if (p->balance < 0)
5914 p->left->parent = p;
5931 constructor_pending_elts = r;
5936 struct init_node *t = r->right;
5940 r->right->parent = r;
5945 p->left->parent = p;
5948 p->balance = t->balance < 0;
5949 r->balance = -(t->balance > 0);
5964 constructor_pending_elts = t;
5970 /* p->balance == +1; growth of left side balances the node. */
5975 else /* r == p->right */
5977 if (p->balance == 0)
5978 /* Growth propagation from right side. */
5980 else if (p->balance > 0)
5987 p->right->parent = p;
6004 constructor_pending_elts = r;
6006 else /* r->balance == -1 */
6009 struct init_node *t = r->left;
6013 r->left->parent = r;
6018 p->right->parent = p;
6021 r->balance = (t->balance < 0);
6022 p->balance = -(t->balance > 0);
6037 constructor_pending_elts = t;
6043 /* p->balance == -1; growth of right side balances the node. */
6054 /* Build AVL tree from a sorted chain. */
6057 set_nonincremental_init (void)
6059 unsigned HOST_WIDE_INT ix;
6062 if (TREE_CODE (constructor_type) != RECORD_TYPE
6063 && TREE_CODE (constructor_type) != ARRAY_TYPE)
6066 FOR_EACH_CONSTRUCTOR_ELT (constructor_elements, ix, index, value)
6067 add_pending_init (index, value);
6068 constructor_elements = 0;
6069 if (TREE_CODE (constructor_type) == RECORD_TYPE)
6071 constructor_unfilled_fields = TYPE_FIELDS (constructor_type);
6072 /* Skip any nameless bit fields at the beginning. */
6073 while (constructor_unfilled_fields != 0
6074 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
6075 && DECL_NAME (constructor_unfilled_fields) == 0)
6076 constructor_unfilled_fields = TREE_CHAIN (constructor_unfilled_fields);
6079 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6081 if (TYPE_DOMAIN (constructor_type))
6082 constructor_unfilled_index
6083 = convert (bitsizetype,
6084 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
6086 constructor_unfilled_index = bitsize_zero_node;
6088 constructor_incremental = 0;
6091 /* Build AVL tree from a string constant. */
6094 set_nonincremental_init_from_string (tree str)
6096 tree value, purpose, type;
6097 HOST_WIDE_INT val[2];
6098 const char *p, *end;
6099 int byte, wchar_bytes, charwidth, bitpos;
6101 gcc_assert (TREE_CODE (constructor_type) == ARRAY_TYPE);
6103 if (TYPE_PRECISION (TREE_TYPE (TREE_TYPE (str)))
6104 == TYPE_PRECISION (char_type_node))
6108 gcc_assert (TYPE_PRECISION (TREE_TYPE (TREE_TYPE (str)))
6109 == TYPE_PRECISION (wchar_type_node));
6110 wchar_bytes = TYPE_PRECISION (wchar_type_node) / BITS_PER_UNIT;
6112 charwidth = TYPE_PRECISION (char_type_node);
6113 type = TREE_TYPE (constructor_type);
6114 p = TREE_STRING_POINTER (str);
6115 end = p + TREE_STRING_LENGTH (str);
6117 for (purpose = bitsize_zero_node;
6118 p < end && !tree_int_cst_lt (constructor_max_index, purpose);
6119 purpose = size_binop (PLUS_EXPR, purpose, bitsize_one_node))
6121 if (wchar_bytes == 1)
6123 val[1] = (unsigned char) *p++;
6130 for (byte = 0; byte < wchar_bytes; byte++)
6132 if (BYTES_BIG_ENDIAN)
6133 bitpos = (wchar_bytes - byte - 1) * charwidth;
6135 bitpos = byte * charwidth;
6136 val[bitpos < HOST_BITS_PER_WIDE_INT]
6137 |= ((unsigned HOST_WIDE_INT) ((unsigned char) *p++))
6138 << (bitpos % HOST_BITS_PER_WIDE_INT);
6142 if (!TYPE_UNSIGNED (type))
6144 bitpos = ((wchar_bytes - 1) * charwidth) + HOST_BITS_PER_CHAR;
6145 if (bitpos < HOST_BITS_PER_WIDE_INT)
6147 if (val[1] & (((HOST_WIDE_INT) 1) << (bitpos - 1)))
6149 val[1] |= ((HOST_WIDE_INT) -1) << bitpos;
6153 else if (bitpos == HOST_BITS_PER_WIDE_INT)
6158 else if (val[0] & (((HOST_WIDE_INT) 1)
6159 << (bitpos - 1 - HOST_BITS_PER_WIDE_INT)))
6160 val[0] |= ((HOST_WIDE_INT) -1)
6161 << (bitpos - HOST_BITS_PER_WIDE_INT);
6164 value = build_int_cst_wide (type, val[1], val[0]);
6165 add_pending_init (purpose, value);
6168 constructor_incremental = 0;
6171 /* Return value of FIELD in pending initializer or zero if the field was
6172 not initialized yet. */
6175 find_init_member (tree field)
6177 struct init_node *p;
6179 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6181 if (constructor_incremental
6182 && tree_int_cst_lt (field, constructor_unfilled_index))
6183 set_nonincremental_init ();
6185 p = constructor_pending_elts;
6188 if (tree_int_cst_lt (field, p->purpose))
6190 else if (tree_int_cst_lt (p->purpose, field))
6196 else if (TREE_CODE (constructor_type) == RECORD_TYPE)
6198 tree bitpos = bit_position (field);
6200 if (constructor_incremental
6201 && (!constructor_unfilled_fields
6202 || tree_int_cst_lt (bitpos,
6203 bit_position (constructor_unfilled_fields))))
6204 set_nonincremental_init ();
6206 p = constructor_pending_elts;
6209 if (field == p->purpose)
6211 else if (tree_int_cst_lt (bitpos, bit_position (p->purpose)))
6217 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6219 if (!VEC_empty (constructor_elt, constructor_elements)
6220 && (VEC_last (constructor_elt, constructor_elements)->index
6222 return VEC_last (constructor_elt, constructor_elements)->value;
6227 /* "Output" the next constructor element.
6228 At top level, really output it to assembler code now.
6229 Otherwise, collect it in a list from which we will make a CONSTRUCTOR.
6230 TYPE is the data type that the containing data type wants here.
6231 FIELD is the field (a FIELD_DECL) or the index that this element fills.
6232 If VALUE is a string constant, STRICT_STRING is true if it is
6233 unparenthesized or we should not warn here for it being parenthesized.
6234 For other types of VALUE, STRICT_STRING is not used.
6236 PENDING if non-nil means output pending elements that belong
6237 right after this element. (PENDING is normally 1;
6238 it is 0 while outputting pending elements, to avoid recursion.) */
6241 output_init_element (tree value, bool strict_string, tree type, tree field,
6244 constructor_elt *celt;
6246 if (type == error_mark_node || value == error_mark_node)
6248 constructor_erroneous = 1;
6251 if (TREE_CODE (TREE_TYPE (value)) == ARRAY_TYPE
6252 && (TREE_CODE (value) == STRING_CST
6253 || TREE_CODE (value) == COMPOUND_LITERAL_EXPR)
6254 && !(TREE_CODE (value) == STRING_CST
6255 && TREE_CODE (type) == ARRAY_TYPE
6256 && INTEGRAL_TYPE_P (TREE_TYPE (type)))
6257 && !comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (value)),
6258 TYPE_MAIN_VARIANT (type)))
6259 value = array_to_pointer_conversion (value);
6261 if (TREE_CODE (value) == COMPOUND_LITERAL_EXPR
6262 && require_constant_value && !flag_isoc99 && pending)
6264 /* As an extension, allow initializing objects with static storage
6265 duration with compound literals (which are then treated just as
6266 the brace enclosed list they contain). */
6267 tree decl = COMPOUND_LITERAL_EXPR_DECL (value);
6268 value = DECL_INITIAL (decl);
6271 if (value == error_mark_node)
6272 constructor_erroneous = 1;
6273 else if (!TREE_CONSTANT (value))
6274 constructor_constant = 0;
6275 else if (!initializer_constant_valid_p (value, TREE_TYPE (value))
6276 || ((TREE_CODE (constructor_type) == RECORD_TYPE
6277 || TREE_CODE (constructor_type) == UNION_TYPE)
6278 && DECL_C_BIT_FIELD (field)
6279 && TREE_CODE (value) != INTEGER_CST))
6280 constructor_simple = 0;
6282 if (!initializer_constant_valid_p (value, TREE_TYPE (value)))
6284 if (require_constant_value)
6286 error_init ("initializer element is not constant");
6287 value = error_mark_node;
6289 else if (require_constant_elements)
6290 pedwarn ("initializer element is not computable at load time");
6293 /* If this field is empty (and not at the end of structure),
6294 don't do anything other than checking the initializer. */
6296 && (TREE_TYPE (field) == error_mark_node
6297 || (COMPLETE_TYPE_P (TREE_TYPE (field))
6298 && integer_zerop (TYPE_SIZE (TREE_TYPE (field)))
6299 && (TREE_CODE (constructor_type) == ARRAY_TYPE
6300 || TREE_CHAIN (field)))))
6303 value = digest_init (type, value, strict_string, require_constant_value);
6304 if (value == error_mark_node)
6306 constructor_erroneous = 1;
6310 /* If this element doesn't come next in sequence,
6311 put it on constructor_pending_elts. */
6312 if (TREE_CODE (constructor_type) == ARRAY_TYPE
6313 && (!constructor_incremental
6314 || !tree_int_cst_equal (field, constructor_unfilled_index)))
6316 if (constructor_incremental
6317 && tree_int_cst_lt (field, constructor_unfilled_index))
6318 set_nonincremental_init ();
6320 add_pending_init (field, value);
6323 else if (TREE_CODE (constructor_type) == RECORD_TYPE
6324 && (!constructor_incremental
6325 || field != constructor_unfilled_fields))
6327 /* We do this for records but not for unions. In a union,
6328 no matter which field is specified, it can be initialized
6329 right away since it starts at the beginning of the union. */
6330 if (constructor_incremental)
6332 if (!constructor_unfilled_fields)
6333 set_nonincremental_init ();
6336 tree bitpos, unfillpos;
6338 bitpos = bit_position (field);
6339 unfillpos = bit_position (constructor_unfilled_fields);
6341 if (tree_int_cst_lt (bitpos, unfillpos))
6342 set_nonincremental_init ();
6346 add_pending_init (field, value);
6349 else if (TREE_CODE (constructor_type) == UNION_TYPE
6350 && !VEC_empty (constructor_elt, constructor_elements))
6352 if (TREE_SIDE_EFFECTS (VEC_last (constructor_elt,
6353 constructor_elements)->value))
6354 warning_init (0, "initialized field with side-effects overwritten");
6355 else if (warn_override_init)
6356 warning_init (OPT_Woverride_init, "initialized field overwritten");
6358 /* We can have just one union field set. */
6359 constructor_elements = 0;
6362 /* Otherwise, output this element either to
6363 constructor_elements or to the assembler file. */
6365 celt = VEC_safe_push (constructor_elt, gc, constructor_elements, NULL);
6366 celt->index = field;
6367 celt->value = value;
6369 /* Advance the variable that indicates sequential elements output. */
6370 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6371 constructor_unfilled_index
6372 = size_binop (PLUS_EXPR, constructor_unfilled_index,
6374 else if (TREE_CODE (constructor_type) == RECORD_TYPE)
6376 constructor_unfilled_fields
6377 = TREE_CHAIN (constructor_unfilled_fields);
6379 /* Skip any nameless bit fields. */
6380 while (constructor_unfilled_fields != 0
6381 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
6382 && DECL_NAME (constructor_unfilled_fields) == 0)
6383 constructor_unfilled_fields =
6384 TREE_CHAIN (constructor_unfilled_fields);
6386 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6387 constructor_unfilled_fields = 0;
6389 /* Now output any pending elements which have become next. */
6391 output_pending_init_elements (0);
6394 /* Output any pending elements which have become next.
6395 As we output elements, constructor_unfilled_{fields,index}
6396 advances, which may cause other elements to become next;
6397 if so, they too are output.
6399 If ALL is 0, we return when there are
6400 no more pending elements to output now.
6402 If ALL is 1, we output space as necessary so that
6403 we can output all the pending elements. */
6406 output_pending_init_elements (int all)
6408 struct init_node *elt = constructor_pending_elts;
6413 /* Look through the whole pending tree.
6414 If we find an element that should be output now,
6415 output it. Otherwise, set NEXT to the element
6416 that comes first among those still pending. */
6421 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6423 if (tree_int_cst_equal (elt->purpose,
6424 constructor_unfilled_index))
6425 output_init_element (elt->value, true,
6426 TREE_TYPE (constructor_type),
6427 constructor_unfilled_index, 0);
6428 else if (tree_int_cst_lt (constructor_unfilled_index,
6431 /* Advance to the next smaller node. */
6436 /* We have reached the smallest node bigger than the
6437 current unfilled index. Fill the space first. */
6438 next = elt->purpose;
6444 /* Advance to the next bigger node. */
6449 /* We have reached the biggest node in a subtree. Find
6450 the parent of it, which is the next bigger node. */
6451 while (elt->parent && elt->parent->right == elt)
6454 if (elt && tree_int_cst_lt (constructor_unfilled_index,
6457 next = elt->purpose;
6463 else if (TREE_CODE (constructor_type) == RECORD_TYPE
6464 || TREE_CODE (constructor_type) == UNION_TYPE)
6466 tree ctor_unfilled_bitpos, elt_bitpos;
6468 /* If the current record is complete we are done. */
6469 if (constructor_unfilled_fields == 0)
6472 ctor_unfilled_bitpos = bit_position (constructor_unfilled_fields);
6473 elt_bitpos = bit_position (elt->purpose);
6474 /* We can't compare fields here because there might be empty
6475 fields in between. */
6476 if (tree_int_cst_equal (elt_bitpos, ctor_unfilled_bitpos))
6478 constructor_unfilled_fields = elt->purpose;
6479 output_init_element (elt->value, true, TREE_TYPE (elt->purpose),
6482 else if (tree_int_cst_lt (ctor_unfilled_bitpos, elt_bitpos))
6484 /* Advance to the next smaller node. */
6489 /* We have reached the smallest node bigger than the
6490 current unfilled field. Fill the space first. */
6491 next = elt->purpose;
6497 /* Advance to the next bigger node. */
6502 /* We have reached the biggest node in a subtree. Find
6503 the parent of it, which is the next bigger node. */
6504 while (elt->parent && elt->parent->right == elt)
6508 && (tree_int_cst_lt (ctor_unfilled_bitpos,
6509 bit_position (elt->purpose))))
6511 next = elt->purpose;
6519 /* Ordinarily return, but not if we want to output all
6520 and there are elements left. */
6521 if (!(all && next != 0))
6524 /* If it's not incremental, just skip over the gap, so that after
6525 jumping to retry we will output the next successive element. */
6526 if (TREE_CODE (constructor_type) == RECORD_TYPE
6527 || TREE_CODE (constructor_type) == UNION_TYPE)
6528 constructor_unfilled_fields = next;
6529 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6530 constructor_unfilled_index = next;
6532 /* ELT now points to the node in the pending tree with the next
6533 initializer to output. */
6537 /* Add one non-braced element to the current constructor level.
6538 This adjusts the current position within the constructor's type.
6539 This may also start or terminate implicit levels
6540 to handle a partly-braced initializer.
6542 Once this has found the correct level for the new element,
6543 it calls output_init_element. */
6546 process_init_element (struct c_expr value)
6548 tree orig_value = value.value;
6549 int string_flag = orig_value != 0 && TREE_CODE (orig_value) == STRING_CST;
6550 bool strict_string = value.original_code == STRING_CST;
6552 designator_depth = 0;
6553 designator_erroneous = 0;
6555 /* Handle superfluous braces around string cst as in
6556 char x[] = {"foo"}; */
6559 && TREE_CODE (constructor_type) == ARRAY_TYPE
6560 && INTEGRAL_TYPE_P (TREE_TYPE (constructor_type))
6561 && integer_zerop (constructor_unfilled_index))
6563 if (constructor_stack->replacement_value.value)
6564 error_init ("excess elements in char array initializer");
6565 constructor_stack->replacement_value = value;
6569 if (constructor_stack->replacement_value.value != 0)
6571 error_init ("excess elements in struct initializer");
6575 /* Ignore elements of a brace group if it is entirely superfluous
6576 and has already been diagnosed. */
6577 if (constructor_type == 0)
6580 /* If we've exhausted any levels that didn't have braces,
6582 while (constructor_stack->implicit)
6584 if ((TREE_CODE (constructor_type) == RECORD_TYPE
6585 || TREE_CODE (constructor_type) == UNION_TYPE)
6586 && constructor_fields == 0)
6587 process_init_element (pop_init_level (1));
6588 else if (TREE_CODE (constructor_type) == ARRAY_TYPE
6589 && (constructor_max_index == 0
6590 || tree_int_cst_lt (constructor_max_index,
6591 constructor_index)))
6592 process_init_element (pop_init_level (1));
6597 /* In the case of [LO ... HI] = VALUE, only evaluate VALUE once. */
6598 if (constructor_range_stack)
6600 /* If value is a compound literal and we'll be just using its
6601 content, don't put it into a SAVE_EXPR. */
6602 if (TREE_CODE (value.value) != COMPOUND_LITERAL_EXPR
6603 || !require_constant_value
6605 value.value = save_expr (value.value);
6610 if (TREE_CODE (constructor_type) == RECORD_TYPE)
6613 enum tree_code fieldcode;
6615 if (constructor_fields == 0)
6617 pedwarn_init ("excess elements in struct initializer");
6621 fieldtype = TREE_TYPE (constructor_fields);
6622 if (fieldtype != error_mark_node)
6623 fieldtype = TYPE_MAIN_VARIANT (fieldtype);
6624 fieldcode = TREE_CODE (fieldtype);
6626 /* Error for non-static initialization of a flexible array member. */
6627 if (fieldcode == ARRAY_TYPE
6628 && !require_constant_value
6629 && TYPE_SIZE (fieldtype) == NULL_TREE
6630 && TREE_CHAIN (constructor_fields) == NULL_TREE)
6632 error_init ("non-static initialization of a flexible array member");
6636 /* Accept a string constant to initialize a subarray. */
6637 if (value.value != 0
6638 && fieldcode == ARRAY_TYPE
6639 && INTEGRAL_TYPE_P (TREE_TYPE (fieldtype))
6641 value.value = orig_value;
6642 /* Otherwise, if we have come to a subaggregate,
6643 and we don't have an element of its type, push into it. */
6644 else if (value.value != 0
6645 && value.value != error_mark_node
6646 && TYPE_MAIN_VARIANT (TREE_TYPE (value.value)) != fieldtype
6647 && (fieldcode == RECORD_TYPE || fieldcode == ARRAY_TYPE
6648 || fieldcode == UNION_TYPE))
6650 push_init_level (1);
6656 push_member_name (constructor_fields);
6657 output_init_element (value.value, strict_string,
6658 fieldtype, constructor_fields, 1);
6659 RESTORE_SPELLING_DEPTH (constructor_depth);
6662 /* Do the bookkeeping for an element that was
6663 directly output as a constructor. */
6665 /* For a record, keep track of end position of last field. */
6666 if (DECL_SIZE (constructor_fields))
6667 constructor_bit_index
6668 = size_binop (PLUS_EXPR,
6669 bit_position (constructor_fields),
6670 DECL_SIZE (constructor_fields));
6672 /* If the current field was the first one not yet written out,
6673 it isn't now, so update. */
6674 if (constructor_unfilled_fields == constructor_fields)
6676 constructor_unfilled_fields = TREE_CHAIN (constructor_fields);
6677 /* Skip any nameless bit fields. */
6678 while (constructor_unfilled_fields != 0
6679 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
6680 && DECL_NAME (constructor_unfilled_fields) == 0)
6681 constructor_unfilled_fields =
6682 TREE_CHAIN (constructor_unfilled_fields);
6686 constructor_fields = TREE_CHAIN (constructor_fields);
6687 /* Skip any nameless bit fields at the beginning. */
6688 while (constructor_fields != 0
6689 && DECL_C_BIT_FIELD (constructor_fields)
6690 && DECL_NAME (constructor_fields) == 0)
6691 constructor_fields = TREE_CHAIN (constructor_fields);
6693 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6696 enum tree_code fieldcode;
6698 if (constructor_fields == 0)
6700 pedwarn_init ("excess elements in union initializer");
6704 fieldtype = TREE_TYPE (constructor_fields);
6705 if (fieldtype != error_mark_node)
6706 fieldtype = TYPE_MAIN_VARIANT (fieldtype);
6707 fieldcode = TREE_CODE (fieldtype);
6709 /* Warn that traditional C rejects initialization of unions.
6710 We skip the warning if the value is zero. This is done
6711 under the assumption that the zero initializer in user
6712 code appears conditioned on e.g. __STDC__ to avoid
6713 "missing initializer" warnings and relies on default
6714 initialization to zero in the traditional C case.
6715 We also skip the warning if the initializer is designated,
6716 again on the assumption that this must be conditional on
6717 __STDC__ anyway (and we've already complained about the
6718 member-designator already). */
6719 if (!in_system_header && !constructor_designated
6720 && !(value.value && (integer_zerop (value.value)
6721 || real_zerop (value.value))))
6722 warning (OPT_Wtraditional, "traditional C rejects initialization "
6725 /* Accept a string constant to initialize a subarray. */
6726 if (value.value != 0
6727 && fieldcode == ARRAY_TYPE
6728 && INTEGRAL_TYPE_P (TREE_TYPE (fieldtype))
6730 value.value = orig_value;
6731 /* Otherwise, if we have come to a subaggregate,
6732 and we don't have an element of its type, push into it. */
6733 else if (value.value != 0
6734 && value.value != error_mark_node
6735 && TYPE_MAIN_VARIANT (TREE_TYPE (value.value)) != fieldtype
6736 && (fieldcode == RECORD_TYPE || fieldcode == ARRAY_TYPE
6737 || fieldcode == UNION_TYPE))
6739 push_init_level (1);
6745 push_member_name (constructor_fields);
6746 output_init_element (value.value, strict_string,
6747 fieldtype, constructor_fields, 1);
6748 RESTORE_SPELLING_DEPTH (constructor_depth);
6751 /* Do the bookkeeping for an element that was
6752 directly output as a constructor. */
6754 constructor_bit_index = DECL_SIZE (constructor_fields);
6755 constructor_unfilled_fields = TREE_CHAIN (constructor_fields);
6758 constructor_fields = 0;
6760 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6762 tree elttype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
6763 enum tree_code eltcode = TREE_CODE (elttype);
6765 /* Accept a string constant to initialize a subarray. */
6766 if (value.value != 0
6767 && eltcode == ARRAY_TYPE
6768 && INTEGRAL_TYPE_P (TREE_TYPE (elttype))
6770 value.value = orig_value;
6771 /* Otherwise, if we have come to a subaggregate,
6772 and we don't have an element of its type, push into it. */
6773 else if (value.value != 0
6774 && value.value != error_mark_node
6775 && TYPE_MAIN_VARIANT (TREE_TYPE (value.value)) != elttype
6776 && (eltcode == RECORD_TYPE || eltcode == ARRAY_TYPE
6777 || eltcode == UNION_TYPE))
6779 push_init_level (1);
6783 if (constructor_max_index != 0
6784 && (tree_int_cst_lt (constructor_max_index, constructor_index)
6785 || integer_all_onesp (constructor_max_index)))
6787 pedwarn_init ("excess elements in array initializer");
6791 /* Now output the actual element. */
6794 push_array_bounds (tree_low_cst (constructor_index, 1));
6795 output_init_element (value.value, strict_string,
6796 elttype, constructor_index, 1);
6797 RESTORE_SPELLING_DEPTH (constructor_depth);
6801 = size_binop (PLUS_EXPR, constructor_index, bitsize_one_node);
6804 /* If we are doing the bookkeeping for an element that was
6805 directly output as a constructor, we must update
6806 constructor_unfilled_index. */
6807 constructor_unfilled_index = constructor_index;
6809 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
6811 tree elttype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
6813 /* Do a basic check of initializer size. Note that vectors
6814 always have a fixed size derived from their type. */
6815 if (tree_int_cst_lt (constructor_max_index, constructor_index))
6817 pedwarn_init ("excess elements in vector initializer");
6821 /* Now output the actual element. */
6823 output_init_element (value.value, strict_string,
6824 elttype, constructor_index, 1);
6827 = size_binop (PLUS_EXPR, constructor_index, bitsize_one_node);
6830 /* If we are doing the bookkeeping for an element that was
6831 directly output as a constructor, we must update
6832 constructor_unfilled_index. */
6833 constructor_unfilled_index = constructor_index;
6836 /* Handle the sole element allowed in a braced initializer
6837 for a scalar variable. */
6838 else if (constructor_type != error_mark_node
6839 && constructor_fields == 0)
6841 pedwarn_init ("excess elements in scalar initializer");
6847 output_init_element (value.value, strict_string,
6848 constructor_type, NULL_TREE, 1);
6849 constructor_fields = 0;
6852 /* Handle range initializers either at this level or anywhere higher
6853 in the designator stack. */
6854 if (constructor_range_stack)
6856 struct constructor_range_stack *p, *range_stack;
6859 range_stack = constructor_range_stack;
6860 constructor_range_stack = 0;
6861 while (constructor_stack != range_stack->stack)
6863 gcc_assert (constructor_stack->implicit);
6864 process_init_element (pop_init_level (1));
6866 for (p = range_stack;
6867 !p->range_end || tree_int_cst_equal (p->index, p->range_end);
6870 gcc_assert (constructor_stack->implicit);
6871 process_init_element (pop_init_level (1));
6874 p->index = size_binop (PLUS_EXPR, p->index, bitsize_one_node);
6875 if (tree_int_cst_equal (p->index, p->range_end) && !p->prev)
6880 constructor_index = p->index;
6881 constructor_fields = p->fields;
6882 if (finish && p->range_end && p->index == p->range_start)
6890 push_init_level (2);
6891 p->stack = constructor_stack;
6892 if (p->range_end && tree_int_cst_equal (p->index, p->range_end))
6893 p->index = p->range_start;
6897 constructor_range_stack = range_stack;
6904 constructor_range_stack = 0;
6907 /* Build a complete asm-statement, whose components are a CV_QUALIFIER
6908 (guaranteed to be 'volatile' or null) and ARGS (represented using
6909 an ASM_EXPR node). */
6911 build_asm_stmt (tree cv_qualifier, tree args)
6913 if (!ASM_VOLATILE_P (args) && cv_qualifier)
6914 ASM_VOLATILE_P (args) = 1;
6915 return add_stmt (args);
6918 /* Build an asm-expr, whose components are a STRING, some OUTPUTS,
6919 some INPUTS, and some CLOBBERS. The latter three may be NULL.
6920 SIMPLE indicates whether there was anything at all after the
6921 string in the asm expression -- asm("blah") and asm("blah" : )
6922 are subtly different. We use a ASM_EXPR node to represent this. */
6924 build_asm_expr (tree string, tree outputs, tree inputs, tree clobbers,
6930 const char *constraint;
6931 const char **oconstraints;
6932 bool allows_mem, allows_reg, is_inout;
6933 int ninputs, noutputs;
6935 ninputs = list_length (inputs);
6936 noutputs = list_length (outputs);
6937 oconstraints = (const char **) alloca (noutputs * sizeof (const char *));
6939 string = resolve_asm_operand_names (string, outputs, inputs);
6941 /* Remove output conversions that change the type but not the mode. */
6942 for (i = 0, tail = outputs; tail; ++i, tail = TREE_CHAIN (tail))
6944 tree output = TREE_VALUE (tail);
6946 /* ??? Really, this should not be here. Users should be using a
6947 proper lvalue, dammit. But there's a long history of using casts
6948 in the output operands. In cases like longlong.h, this becomes a
6949 primitive form of typechecking -- if the cast can be removed, then
6950 the output operand had a type of the proper width; otherwise we'll
6951 get an error. Gross, but ... */
6952 STRIP_NOPS (output);
6954 if (!lvalue_or_else (output, lv_asm))
6955 output = error_mark_node;
6957 if (output != error_mark_node
6958 && (TREE_READONLY (output)
6959 || TYPE_READONLY (TREE_TYPE (output))
6960 || ((TREE_CODE (TREE_TYPE (output)) == RECORD_TYPE
6961 || TREE_CODE (TREE_TYPE (output)) == UNION_TYPE)
6962 && C_TYPE_FIELDS_READONLY (TREE_TYPE (output)))))
6963 readonly_error (output, lv_asm);
6965 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
6966 oconstraints[i] = constraint;
6968 if (parse_output_constraint (&constraint, i, ninputs, noutputs,
6969 &allows_mem, &allows_reg, &is_inout))
6971 /* If the operand is going to end up in memory,
6972 mark it addressable. */
6973 if (!allows_reg && !c_mark_addressable (output))
6974 output = error_mark_node;
6977 output = error_mark_node;
6979 TREE_VALUE (tail) = output;
6982 for (i = 0, tail = inputs; tail; ++i, tail = TREE_CHAIN (tail))
6986 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
6987 input = TREE_VALUE (tail);
6989 if (parse_input_constraint (&constraint, i, ninputs, noutputs, 0,
6990 oconstraints, &allows_mem, &allows_reg))
6992 /* If the operand is going to end up in memory,
6993 mark it addressable. */
6994 if (!allows_reg && allows_mem)
6996 /* Strip the nops as we allow this case. FIXME, this really
6997 should be rejected or made deprecated. */
6999 if (!c_mark_addressable (input))
7000 input = error_mark_node;
7004 input = error_mark_node;
7006 TREE_VALUE (tail) = input;
7009 args = build_stmt (ASM_EXPR, string, outputs, inputs, clobbers);
7011 /* asm statements without outputs, including simple ones, are treated
7013 ASM_INPUT_P (args) = simple;
7014 ASM_VOLATILE_P (args) = (noutputs == 0);
7019 /* Generate a goto statement to LABEL. */
7022 c_finish_goto_label (tree label)
7024 tree decl = lookup_label (label);
7028 if (C_DECL_UNJUMPABLE_STMT_EXPR (decl))
7030 error ("jump into statement expression");
7034 if (C_DECL_UNJUMPABLE_VM (decl))
7036 error ("jump into scope of identifier with variably modified type");
7040 if (!C_DECL_UNDEFINABLE_STMT_EXPR (decl))
7042 /* No jump from outside this statement expression context, so
7043 record that there is a jump from within this context. */
7044 struct c_label_list *nlist;
7045 nlist = XOBNEW (&parser_obstack, struct c_label_list);
7046 nlist->next = label_context_stack_se->labels_used;
7047 nlist->label = decl;
7048 label_context_stack_se->labels_used = nlist;
7051 if (!C_DECL_UNDEFINABLE_VM (decl))
7053 /* No jump from outside this context context of identifiers with
7054 variably modified type, so record that there is a jump from
7055 within this context. */
7056 struct c_label_list *nlist;
7057 nlist = XOBNEW (&parser_obstack, struct c_label_list);
7058 nlist->next = label_context_stack_vm->labels_used;
7059 nlist->label = decl;
7060 label_context_stack_vm->labels_used = nlist;
7063 TREE_USED (decl) = 1;
7064 return add_stmt (build1 (GOTO_EXPR, void_type_node, decl));
7067 /* Generate a computed goto statement to EXPR. */
7070 c_finish_goto_ptr (tree expr)
7073 pedwarn ("ISO C forbids %<goto *expr;%>");
7074 expr = convert (ptr_type_node, expr);
7075 return add_stmt (build1 (GOTO_EXPR, void_type_node, expr));
7078 /* Generate a C `return' statement. RETVAL is the expression for what
7079 to return, or a null pointer for `return;' with no value. */
7082 c_finish_return (tree retval)
7084 tree valtype = TREE_TYPE (TREE_TYPE (current_function_decl)), ret_stmt;
7085 bool no_warning = false;
7087 if (TREE_THIS_VOLATILE (current_function_decl))
7088 warning (0, "function declared %<noreturn%> has a %<return%> statement");
7092 current_function_returns_null = 1;
7093 if ((warn_return_type || flag_isoc99)
7094 && valtype != 0 && TREE_CODE (valtype) != VOID_TYPE)
7096 pedwarn_c99 ("%<return%> with no value, in "
7097 "function returning non-void");
7101 else if (valtype == 0 || TREE_CODE (valtype) == VOID_TYPE)
7103 current_function_returns_null = 1;
7104 if (TREE_CODE (TREE_TYPE (retval)) != VOID_TYPE)
7105 pedwarn ("%<return%> with a value, in function returning void");
7107 pedwarn ("ISO C forbids %<return%> with expression, in function returning void");
7111 tree t = convert_for_assignment (valtype, retval, ic_return,
7112 NULL_TREE, NULL_TREE, 0);
7113 tree res = DECL_RESULT (current_function_decl);
7116 current_function_returns_value = 1;
7117 if (t == error_mark_node)
7120 inner = t = convert (TREE_TYPE (res), t);
7122 /* Strip any conversions, additions, and subtractions, and see if
7123 we are returning the address of a local variable. Warn if so. */
7126 switch (TREE_CODE (inner))
7128 case NOP_EXPR: case NON_LVALUE_EXPR: case CONVERT_EXPR:
7130 inner = TREE_OPERAND (inner, 0);
7134 /* If the second operand of the MINUS_EXPR has a pointer
7135 type (or is converted from it), this may be valid, so
7136 don't give a warning. */
7138 tree op1 = TREE_OPERAND (inner, 1);
7140 while (!POINTER_TYPE_P (TREE_TYPE (op1))
7141 && (TREE_CODE (op1) == NOP_EXPR
7142 || TREE_CODE (op1) == NON_LVALUE_EXPR
7143 || TREE_CODE (op1) == CONVERT_EXPR))
7144 op1 = TREE_OPERAND (op1, 0);
7146 if (POINTER_TYPE_P (TREE_TYPE (op1)))
7149 inner = TREE_OPERAND (inner, 0);
7154 inner = TREE_OPERAND (inner, 0);
7156 while (REFERENCE_CLASS_P (inner)
7157 && TREE_CODE (inner) != INDIRECT_REF)
7158 inner = TREE_OPERAND (inner, 0);
7161 && !DECL_EXTERNAL (inner)
7162 && !TREE_STATIC (inner)
7163 && DECL_CONTEXT (inner) == current_function_decl)
7164 warning (0, "function returns address of local variable");
7174 retval = build2 (MODIFY_EXPR, TREE_TYPE (res), res, t);
7177 ret_stmt = build_stmt (RETURN_EXPR, retval);
7178 TREE_NO_WARNING (ret_stmt) |= no_warning;
7179 return add_stmt (ret_stmt);
7183 /* The SWITCH_EXPR being built. */
7186 /* The original type of the testing expression, i.e. before the
7187 default conversion is applied. */
7190 /* A splay-tree mapping the low element of a case range to the high
7191 element, or NULL_TREE if there is no high element. Used to
7192 determine whether or not a new case label duplicates an old case
7193 label. We need a tree, rather than simply a hash table, because
7194 of the GNU case range extension. */
7197 /* Number of nested statement expressions within this switch
7198 statement; if nonzero, case and default labels may not
7200 unsigned int blocked_stmt_expr;
7202 /* Scope of outermost declarations of identifiers with variably
7203 modified type within this switch statement; if nonzero, case and
7204 default labels may not appear. */
7205 unsigned int blocked_vm;
7207 /* The next node on the stack. */
7208 struct c_switch *next;
7211 /* A stack of the currently active switch statements. The innermost
7212 switch statement is on the top of the stack. There is no need to
7213 mark the stack for garbage collection because it is only active
7214 during the processing of the body of a function, and we never
7215 collect at that point. */
7217 struct c_switch *c_switch_stack;
7219 /* Start a C switch statement, testing expression EXP. Return the new
7223 c_start_case (tree exp)
7225 tree orig_type = error_mark_node;
7226 struct c_switch *cs;
7228 if (exp != error_mark_node)
7230 orig_type = TREE_TYPE (exp);
7232 if (!INTEGRAL_TYPE_P (orig_type))
7234 if (orig_type != error_mark_node)
7236 error ("switch quantity not an integer");
7237 orig_type = error_mark_node;
7239 exp = integer_zero_node;
7243 tree type = TYPE_MAIN_VARIANT (orig_type);
7245 if (!in_system_header
7246 && (type == long_integer_type_node
7247 || type == long_unsigned_type_node))
7248 warning (OPT_Wtraditional, "%<long%> switch expression not "
7249 "converted to %<int%> in ISO C");
7251 exp = default_conversion (exp);
7255 /* Add this new SWITCH_EXPR to the stack. */
7256 cs = XNEW (struct c_switch);
7257 cs->switch_expr = build3 (SWITCH_EXPR, orig_type, exp, NULL_TREE, NULL_TREE);
7258 cs->orig_type = orig_type;
7259 cs->cases = splay_tree_new (case_compare, NULL, NULL);
7260 cs->blocked_stmt_expr = 0;
7262 cs->next = c_switch_stack;
7263 c_switch_stack = cs;
7265 return add_stmt (cs->switch_expr);
7268 /* Process a case label. */
7271 do_case (tree low_value, tree high_value)
7273 tree label = NULL_TREE;
7275 if (c_switch_stack && !c_switch_stack->blocked_stmt_expr
7276 && !c_switch_stack->blocked_vm)
7278 label = c_add_case_label (c_switch_stack->cases,
7279 SWITCH_COND (c_switch_stack->switch_expr),
7280 c_switch_stack->orig_type,
7281 low_value, high_value);
7282 if (label == error_mark_node)
7285 else if (c_switch_stack && c_switch_stack->blocked_stmt_expr)
7288 error ("case label in statement expression not containing "
7289 "enclosing switch statement");
7291 error ("%<default%> label in statement expression not containing "
7292 "enclosing switch statement");
7294 else if (c_switch_stack && c_switch_stack->blocked_vm)
7297 error ("case label in scope of identifier with variably modified "
7298 "type not containing enclosing switch statement");
7300 error ("%<default%> label in scope of identifier with variably "
7301 "modified type not containing enclosing switch statement");
7304 error ("case label not within a switch statement");
7306 error ("%<default%> label not within a switch statement");
7311 /* Finish the switch statement. */
7314 c_finish_case (tree body)
7316 struct c_switch *cs = c_switch_stack;
7317 location_t switch_location;
7319 SWITCH_BODY (cs->switch_expr) = body;
7321 /* We must not be within a statement expression nested in the switch
7322 at this point; we might, however, be within the scope of an
7323 identifier with variably modified type nested in the switch. */
7324 gcc_assert (!cs->blocked_stmt_expr);
7326 /* Emit warnings as needed. */
7327 if (EXPR_HAS_LOCATION (cs->switch_expr))
7328 switch_location = EXPR_LOCATION (cs->switch_expr);
7330 switch_location = input_location;
7331 c_do_switch_warnings (cs->cases, switch_location,
7332 TREE_TYPE (cs->switch_expr),
7333 SWITCH_COND (cs->switch_expr));
7335 /* Pop the stack. */
7336 c_switch_stack = cs->next;
7337 splay_tree_delete (cs->cases);
7341 /* Emit an if statement. IF_LOCUS is the location of the 'if'. COND,
7342 THEN_BLOCK and ELSE_BLOCK are expressions to be used; ELSE_BLOCK
7343 may be null. NESTED_IF is true if THEN_BLOCK contains another IF
7344 statement, and was not surrounded with parenthesis. */
7347 c_finish_if_stmt (location_t if_locus, tree cond, tree then_block,
7348 tree else_block, bool nested_if)
7352 /* Diagnose an ambiguous else if if-then-else is nested inside if-then. */
7353 if (warn_parentheses && nested_if && else_block == NULL)
7355 tree inner_if = then_block;
7357 /* We know from the grammar productions that there is an IF nested
7358 within THEN_BLOCK. Due to labels and c99 conditional declarations,
7359 it might not be exactly THEN_BLOCK, but should be the last
7360 non-container statement within. */
7362 switch (TREE_CODE (inner_if))
7367 inner_if = BIND_EXPR_BODY (inner_if);
7369 case STATEMENT_LIST:
7370 inner_if = expr_last (then_block);
7372 case TRY_FINALLY_EXPR:
7373 case TRY_CATCH_EXPR:
7374 inner_if = TREE_OPERAND (inner_if, 0);
7381 if (COND_EXPR_ELSE (inner_if))
7382 warning (OPT_Wparentheses,
7383 "%Hsuggest explicit braces to avoid ambiguous %<else%>",
7387 empty_if_body_warning (then_block, else_block);
7389 stmt = build3 (COND_EXPR, void_type_node, cond, then_block, else_block);
7390 SET_EXPR_LOCATION (stmt, if_locus);
7394 /* Emit a general-purpose loop construct. START_LOCUS is the location of
7395 the beginning of the loop. COND is the loop condition. COND_IS_FIRST
7396 is false for DO loops. INCR is the FOR increment expression. BODY is
7397 the statement controlled by the loop. BLAB is the break label. CLAB is
7398 the continue label. Everything is allowed to be NULL. */
7401 c_finish_loop (location_t start_locus, tree cond, tree incr, tree body,
7402 tree blab, tree clab, bool cond_is_first)
7404 tree entry = NULL, exit = NULL, t;
7406 /* If the condition is zero don't generate a loop construct. */
7407 if (cond && integer_zerop (cond))
7411 t = build_and_jump (&blab);
7412 SET_EXPR_LOCATION (t, start_locus);
7418 tree top = build1 (LABEL_EXPR, void_type_node, NULL_TREE);
7420 /* If we have an exit condition, then we build an IF with gotos either
7421 out of the loop, or to the top of it. If there's no exit condition,
7422 then we just build a jump back to the top. */
7423 exit = build_and_jump (&LABEL_EXPR_LABEL (top));
7425 if (cond && !integer_nonzerop (cond))
7427 /* Canonicalize the loop condition to the end. This means
7428 generating a branch to the loop condition. Reuse the
7429 continue label, if possible. */
7434 entry = build1 (LABEL_EXPR, void_type_node, NULL_TREE);
7435 t = build_and_jump (&LABEL_EXPR_LABEL (entry));
7438 t = build1 (GOTO_EXPR, void_type_node, clab);
7439 SET_EXPR_LOCATION (t, start_locus);
7443 t = build_and_jump (&blab);
7444 exit = fold_build3 (COND_EXPR, void_type_node, cond, exit, t);
7446 SET_EXPR_LOCATION (exit, start_locus);
7448 SET_EXPR_LOCATION (exit, input_location);
7457 add_stmt (build1 (LABEL_EXPR, void_type_node, clab));
7465 add_stmt (build1 (LABEL_EXPR, void_type_node, blab));
7469 c_finish_bc_stmt (tree *label_p, bool is_break)
7472 tree label = *label_p;
7474 /* In switch statements break is sometimes stylistically used after
7475 a return statement. This can lead to spurious warnings about
7476 control reaching the end of a non-void function when it is
7477 inlined. Note that we are calling block_may_fallthru with
7478 language specific tree nodes; this works because
7479 block_may_fallthru returns true when given something it does not
7481 skip = !block_may_fallthru (cur_stmt_list);
7486 *label_p = label = create_artificial_label ();
7488 else if (TREE_CODE (label) == LABEL_DECL)
7490 else switch (TREE_INT_CST_LOW (label))
7494 error ("break statement not within loop or switch");
7496 error ("continue statement not within a loop");
7500 gcc_assert (is_break);
7501 error ("break statement used with OpenMP for loop");
7512 add_stmt (build_predict_expr (PRED_CONTINUE, NOT_TAKEN));
7514 return add_stmt (build1 (GOTO_EXPR, void_type_node, label));
7517 /* A helper routine for c_process_expr_stmt and c_finish_stmt_expr. */
7520 emit_side_effect_warnings (tree expr)
7522 if (expr == error_mark_node)
7524 else if (!TREE_SIDE_EFFECTS (expr))
7526 if (!VOID_TYPE_P (TREE_TYPE (expr)) && !TREE_NO_WARNING (expr))
7527 warning (OPT_Wunused_value, "%Hstatement with no effect",
7528 EXPR_HAS_LOCATION (expr) ? EXPR_LOCUS (expr) : &input_location);
7531 warn_if_unused_value (expr, input_location);
7534 /* Process an expression as if it were a complete statement. Emit
7535 diagnostics, but do not call ADD_STMT. */
7538 c_process_expr_stmt (tree expr)
7543 if (warn_sequence_point)
7544 verify_sequence_points (expr);
7546 if (TREE_TYPE (expr) != error_mark_node
7547 && !COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (expr))
7548 && TREE_CODE (TREE_TYPE (expr)) != ARRAY_TYPE)
7549 error ("expression statement has incomplete type");
7551 /* If we're not processing a statement expression, warn about unused values.
7552 Warnings for statement expressions will be emitted later, once we figure
7553 out which is the result. */
7554 if (!STATEMENT_LIST_STMT_EXPR (cur_stmt_list)
7555 && warn_unused_value)
7556 emit_side_effect_warnings (expr);
7558 /* If the expression is not of a type to which we cannot assign a line
7559 number, wrap the thing in a no-op NOP_EXPR. */
7560 if (DECL_P (expr) || CONSTANT_CLASS_P (expr))
7561 expr = build1 (NOP_EXPR, TREE_TYPE (expr), expr);
7563 if (CAN_HAVE_LOCATION_P (expr))
7564 SET_EXPR_LOCATION (expr, input_location);
7569 /* Emit an expression as a statement. */
7572 c_finish_expr_stmt (tree expr)
7575 return add_stmt (c_process_expr_stmt (expr));
7580 /* Do the opposite and emit a statement as an expression. To begin,
7581 create a new binding level and return it. */
7584 c_begin_stmt_expr (void)
7587 struct c_label_context_se *nstack;
7588 struct c_label_list *glist;
7590 /* We must force a BLOCK for this level so that, if it is not expanded
7591 later, there is a way to turn off the entire subtree of blocks that
7592 are contained in it. */
7594 ret = c_begin_compound_stmt (true);
7597 c_switch_stack->blocked_stmt_expr++;
7598 gcc_assert (c_switch_stack->blocked_stmt_expr != 0);
7600 for (glist = label_context_stack_se->labels_used;
7602 glist = glist->next)
7604 C_DECL_UNDEFINABLE_STMT_EXPR (glist->label) = 1;
7606 nstack = XOBNEW (&parser_obstack, struct c_label_context_se);
7607 nstack->labels_def = NULL;
7608 nstack->labels_used = NULL;
7609 nstack->next = label_context_stack_se;
7610 label_context_stack_se = nstack;
7612 /* Mark the current statement list as belonging to a statement list. */
7613 STATEMENT_LIST_STMT_EXPR (ret) = 1;
7619 c_finish_stmt_expr (tree body)
7621 tree last, type, tmp, val;
7623 struct c_label_list *dlist, *glist, *glist_prev = NULL;
7625 body = c_end_compound_stmt (body, true);
7628 gcc_assert (c_switch_stack->blocked_stmt_expr != 0);
7629 c_switch_stack->blocked_stmt_expr--;
7631 /* It is no longer possible to jump to labels defined within this
7632 statement expression. */
7633 for (dlist = label_context_stack_se->labels_def;
7635 dlist = dlist->next)
7637 C_DECL_UNJUMPABLE_STMT_EXPR (dlist->label) = 1;
7639 /* It is again possible to define labels with a goto just outside
7640 this statement expression. */
7641 for (glist = label_context_stack_se->next->labels_used;
7643 glist = glist->next)
7645 C_DECL_UNDEFINABLE_STMT_EXPR (glist->label) = 0;
7648 if (glist_prev != NULL)
7649 glist_prev->next = label_context_stack_se->labels_used;
7651 label_context_stack_se->next->labels_used
7652 = label_context_stack_se->labels_used;
7653 label_context_stack_se = label_context_stack_se->next;
7655 /* Locate the last statement in BODY. See c_end_compound_stmt
7656 about always returning a BIND_EXPR. */
7657 last_p = &BIND_EXPR_BODY (body);
7658 last = BIND_EXPR_BODY (body);
7661 if (TREE_CODE (last) == STATEMENT_LIST)
7663 tree_stmt_iterator i;
7665 /* This can happen with degenerate cases like ({ }). No value. */
7666 if (!TREE_SIDE_EFFECTS (last))
7669 /* If we're supposed to generate side effects warnings, process
7670 all of the statements except the last. */
7671 if (warn_unused_value)
7673 for (i = tsi_start (last); !tsi_one_before_end_p (i); tsi_next (&i))
7674 emit_side_effect_warnings (tsi_stmt (i));
7677 i = tsi_last (last);
7678 last_p = tsi_stmt_ptr (i);
7682 /* If the end of the list is exception related, then the list was split
7683 by a call to push_cleanup. Continue searching. */
7684 if (TREE_CODE (last) == TRY_FINALLY_EXPR
7685 || TREE_CODE (last) == TRY_CATCH_EXPR)
7687 last_p = &TREE_OPERAND (last, 0);
7689 goto continue_searching;
7692 /* In the case that the BIND_EXPR is not necessary, return the
7693 expression out from inside it. */
7694 if (last == error_mark_node
7695 || (last == BIND_EXPR_BODY (body)
7696 && BIND_EXPR_VARS (body) == NULL))
7698 /* Do not warn if the return value of a statement expression is
7700 if (CAN_HAVE_LOCATION_P (last))
7701 TREE_NO_WARNING (last) = 1;
7705 /* Extract the type of said expression. */
7706 type = TREE_TYPE (last);
7708 /* If we're not returning a value at all, then the BIND_EXPR that
7709 we already have is a fine expression to return. */
7710 if (!type || VOID_TYPE_P (type))
7713 /* Now that we've located the expression containing the value, it seems
7714 silly to make voidify_wrapper_expr repeat the process. Create a
7715 temporary of the appropriate type and stick it in a TARGET_EXPR. */
7716 tmp = create_tmp_var_raw (type, NULL);
7718 /* Unwrap a no-op NOP_EXPR as added by c_finish_expr_stmt. This avoids
7719 tree_expr_nonnegative_p giving up immediately. */
7721 if (TREE_CODE (val) == NOP_EXPR
7722 && TREE_TYPE (val) == TREE_TYPE (TREE_OPERAND (val, 0)))
7723 val = TREE_OPERAND (val, 0);
7725 *last_p = build2 (MODIFY_EXPR, void_type_node, tmp, val);
7726 SET_EXPR_LOCUS (*last_p, EXPR_LOCUS (last));
7728 return build4 (TARGET_EXPR, type, tmp, body, NULL_TREE, NULL_TREE);
7731 /* Begin the scope of an identifier of variably modified type, scope
7732 number SCOPE. Jumping from outside this scope to inside it is not
7736 c_begin_vm_scope (unsigned int scope)
7738 struct c_label_context_vm *nstack;
7739 struct c_label_list *glist;
7741 gcc_assert (scope > 0);
7743 /* At file_scope, we don't have to do any processing. */
7744 if (label_context_stack_vm == NULL)
7747 if (c_switch_stack && !c_switch_stack->blocked_vm)
7748 c_switch_stack->blocked_vm = scope;
7749 for (glist = label_context_stack_vm->labels_used;
7751 glist = glist->next)
7753 C_DECL_UNDEFINABLE_VM (glist->label) = 1;
7755 nstack = XOBNEW (&parser_obstack, struct c_label_context_vm);
7756 nstack->labels_def = NULL;
7757 nstack->labels_used = NULL;
7758 nstack->scope = scope;
7759 nstack->next = label_context_stack_vm;
7760 label_context_stack_vm = nstack;
7763 /* End a scope which may contain identifiers of variably modified
7764 type, scope number SCOPE. */
7767 c_end_vm_scope (unsigned int scope)
7769 if (label_context_stack_vm == NULL)
7771 if (c_switch_stack && c_switch_stack->blocked_vm == scope)
7772 c_switch_stack->blocked_vm = 0;
7773 /* We may have a number of nested scopes of identifiers with
7774 variably modified type, all at this depth. Pop each in turn. */
7775 while (label_context_stack_vm->scope == scope)
7777 struct c_label_list *dlist, *glist, *glist_prev = NULL;
7779 /* It is no longer possible to jump to labels defined within this
7781 for (dlist = label_context_stack_vm->labels_def;
7783 dlist = dlist->next)
7785 C_DECL_UNJUMPABLE_VM (dlist->label) = 1;
7787 /* It is again possible to define labels with a goto just outside
7789 for (glist = label_context_stack_vm->next->labels_used;
7791 glist = glist->next)
7793 C_DECL_UNDEFINABLE_VM (glist->label) = 0;
7796 if (glist_prev != NULL)
7797 glist_prev->next = label_context_stack_vm->labels_used;
7799 label_context_stack_vm->next->labels_used
7800 = label_context_stack_vm->labels_used;
7801 label_context_stack_vm = label_context_stack_vm->next;
7805 /* Begin and end compound statements. This is as simple as pushing
7806 and popping new statement lists from the tree. */
7809 c_begin_compound_stmt (bool do_scope)
7811 tree stmt = push_stmt_list ();
7818 c_end_compound_stmt (tree stmt, bool do_scope)
7824 if (c_dialect_objc ())
7825 objc_clear_super_receiver ();
7826 block = pop_scope ();
7829 stmt = pop_stmt_list (stmt);
7830 stmt = c_build_bind_expr (block, stmt);
7832 /* If this compound statement is nested immediately inside a statement
7833 expression, then force a BIND_EXPR to be created. Otherwise we'll
7834 do the wrong thing for ({ { 1; } }) or ({ 1; { } }). In particular,
7835 STATEMENT_LISTs merge, and thus we can lose track of what statement
7838 && STATEMENT_LIST_STMT_EXPR (cur_stmt_list)
7839 && TREE_CODE (stmt) != BIND_EXPR)
7841 stmt = build3 (BIND_EXPR, void_type_node, NULL, stmt, NULL);
7842 TREE_SIDE_EFFECTS (stmt) = 1;
7848 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
7849 when the current scope is exited. EH_ONLY is true when this is not
7850 meant to apply to normal control flow transfer. */
7853 push_cleanup (tree ARG_UNUSED (decl), tree cleanup, bool eh_only)
7855 enum tree_code code;
7859 code = eh_only ? TRY_CATCH_EXPR : TRY_FINALLY_EXPR;
7860 stmt = build_stmt (code, NULL, cleanup);
7862 stmt_expr = STATEMENT_LIST_STMT_EXPR (cur_stmt_list);
7863 list = push_stmt_list ();
7864 TREE_OPERAND (stmt, 0) = list;
7865 STATEMENT_LIST_STMT_EXPR (list) = stmt_expr;
7868 /* Build a binary-operation expression without default conversions.
7869 CODE is the kind of expression to build.
7870 This function differs from `build' in several ways:
7871 the data type of the result is computed and recorded in it,
7872 warnings are generated if arg data types are invalid,
7873 special handling for addition and subtraction of pointers is known,
7874 and some optimization is done (operations on narrow ints
7875 are done in the narrower type when that gives the same result).
7876 Constant folding is also done before the result is returned.
7878 Note that the operands will never have enumeral types, or function
7879 or array types, because either they will have the default conversions
7880 performed or they have both just been converted to some other type in which
7881 the arithmetic is to be done. */
7884 build_binary_op (enum tree_code code, tree orig_op0, tree orig_op1,
7888 enum tree_code code0, code1;
7890 const char *invalid_op_diag;
7892 /* Expression code to give to the expression when it is built.
7893 Normally this is CODE, which is what the caller asked for,
7894 but in some special cases we change it. */
7895 enum tree_code resultcode = code;
7897 /* Data type in which the computation is to be performed.
7898 In the simplest cases this is the common type of the arguments. */
7899 tree result_type = NULL;
7901 /* Nonzero means operands have already been type-converted
7902 in whatever way is necessary.
7903 Zero means they need to be converted to RESULT_TYPE. */
7906 /* Nonzero means create the expression with this type, rather than
7908 tree build_type = 0;
7910 /* Nonzero means after finally constructing the expression
7911 convert it to this type. */
7912 tree final_type = 0;
7914 /* Nonzero if this is an operation like MIN or MAX which can
7915 safely be computed in short if both args are promoted shorts.
7916 Also implies COMMON.
7917 -1 indicates a bitwise operation; this makes a difference
7918 in the exact conditions for when it is safe to do the operation
7919 in a narrower mode. */
7922 /* Nonzero if this is a comparison operation;
7923 if both args are promoted shorts, compare the original shorts.
7924 Also implies COMMON. */
7925 int short_compare = 0;
7927 /* Nonzero if this is a right-shift operation, which can be computed on the
7928 original short and then promoted if the operand is a promoted short. */
7929 int short_shift = 0;
7931 /* Nonzero means set RESULT_TYPE to the common type of the args. */
7934 /* True means types are compatible as far as ObjC is concerned. */
7939 op0 = default_conversion (orig_op0);
7940 op1 = default_conversion (orig_op1);
7948 type0 = TREE_TYPE (op0);
7949 type1 = TREE_TYPE (op1);
7951 /* The expression codes of the data types of the arguments tell us
7952 whether the arguments are integers, floating, pointers, etc. */
7953 code0 = TREE_CODE (type0);
7954 code1 = TREE_CODE (type1);
7956 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
7957 STRIP_TYPE_NOPS (op0);
7958 STRIP_TYPE_NOPS (op1);
7960 /* If an error was already reported for one of the arguments,
7961 avoid reporting another error. */
7963 if (code0 == ERROR_MARK || code1 == ERROR_MARK)
7964 return error_mark_node;
7966 if ((invalid_op_diag
7967 = targetm.invalid_binary_op (code, type0, type1)))
7969 error (invalid_op_diag);
7970 return error_mark_node;
7973 objc_ok = objc_compare_types (type0, type1, -3, NULL_TREE);
7978 /* Handle the pointer + int case. */
7979 if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
7980 return pointer_int_sum (PLUS_EXPR, op0, op1);
7981 else if (code1 == POINTER_TYPE && code0 == INTEGER_TYPE)
7982 return pointer_int_sum (PLUS_EXPR, op1, op0);
7988 /* Subtraction of two similar pointers.
7989 We must subtract them as integers, then divide by object size. */
7990 if (code0 == POINTER_TYPE && code1 == POINTER_TYPE
7991 && comp_target_types (type0, type1))
7992 return pointer_diff (op0, op1);
7993 /* Handle pointer minus int. Just like pointer plus int. */
7994 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
7995 return pointer_int_sum (MINUS_EXPR, op0, op1);
8004 case TRUNC_DIV_EXPR:
8006 case FLOOR_DIV_EXPR:
8007 case ROUND_DIV_EXPR:
8008 case EXACT_DIV_EXPR:
8009 warn_for_div_by_zero (op1);
8011 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
8012 || code0 == FIXED_POINT_TYPE
8013 || code0 == COMPLEX_TYPE || code0 == VECTOR_TYPE)
8014 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
8015 || code1 == FIXED_POINT_TYPE
8016 || code1 == COMPLEX_TYPE || code1 == VECTOR_TYPE))
8018 enum tree_code tcode0 = code0, tcode1 = code1;
8020 if (code0 == COMPLEX_TYPE || code0 == VECTOR_TYPE)
8021 tcode0 = TREE_CODE (TREE_TYPE (TREE_TYPE (op0)));
8022 if (code1 == COMPLEX_TYPE || code1 == VECTOR_TYPE)
8023 tcode1 = TREE_CODE (TREE_TYPE (TREE_TYPE (op1)));
8025 if (!((tcode0 == INTEGER_TYPE && tcode1 == INTEGER_TYPE)
8026 || (tcode0 == FIXED_POINT_TYPE && tcode1 == FIXED_POINT_TYPE)))
8027 resultcode = RDIV_EXPR;
8029 /* Although it would be tempting to shorten always here, that
8030 loses on some targets, since the modulo instruction is
8031 undefined if the quotient can't be represented in the
8032 computation mode. We shorten only if unsigned or if
8033 dividing by something we know != -1. */
8034 shorten = (TYPE_UNSIGNED (TREE_TYPE (orig_op0))
8035 || (TREE_CODE (op1) == INTEGER_CST
8036 && !integer_all_onesp (op1)));
8044 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
8046 /* Allow vector types which are not floating point types. */
8047 else if (code0 == VECTOR_TYPE
8048 && code1 == VECTOR_TYPE
8049 && !VECTOR_FLOAT_TYPE_P (type0)
8050 && !VECTOR_FLOAT_TYPE_P (type1))
8054 case TRUNC_MOD_EXPR:
8055 case FLOOR_MOD_EXPR:
8056 warn_for_div_by_zero (op1);
8058 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
8060 /* Although it would be tempting to shorten always here, that loses
8061 on some targets, since the modulo instruction is undefined if the
8062 quotient can't be represented in the computation mode. We shorten
8063 only if unsigned or if dividing by something we know != -1. */
8064 shorten = (TYPE_UNSIGNED (TREE_TYPE (orig_op0))
8065 || (TREE_CODE (op1) == INTEGER_CST
8066 && !integer_all_onesp (op1)));
8071 case TRUTH_ANDIF_EXPR:
8072 case TRUTH_ORIF_EXPR:
8073 case TRUTH_AND_EXPR:
8075 case TRUTH_XOR_EXPR:
8076 if ((code0 == INTEGER_TYPE || code0 == POINTER_TYPE
8077 || code0 == REAL_TYPE || code0 == COMPLEX_TYPE
8078 || code0 == FIXED_POINT_TYPE)
8079 && (code1 == INTEGER_TYPE || code1 == POINTER_TYPE
8080 || code1 == REAL_TYPE || code1 == COMPLEX_TYPE
8081 || code1 == FIXED_POINT_TYPE))
8083 /* Result of these operations is always an int,
8084 but that does not mean the operands should be
8085 converted to ints! */
8086 result_type = integer_type_node;
8087 op0 = c_common_truthvalue_conversion (op0);
8088 op1 = c_common_truthvalue_conversion (op1);
8093 /* Shift operations: result has same type as first operand;
8094 always convert second operand to int.
8095 Also set SHORT_SHIFT if shifting rightward. */
8098 if ((code0 == INTEGER_TYPE || code0 == FIXED_POINT_TYPE)
8099 && code1 == INTEGER_TYPE)
8101 if (TREE_CODE (op1) == INTEGER_CST && skip_evaluation == 0)
8103 if (tree_int_cst_sgn (op1) < 0)
8104 warning (0, "right shift count is negative");
8107 if (!integer_zerop (op1))
8110 if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
8111 warning (0, "right shift count >= width of type");
8115 /* Use the type of the value to be shifted. */
8116 result_type = type0;
8117 /* Convert the shift-count to an integer, regardless of size
8118 of value being shifted. */
8119 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
8120 op1 = convert (integer_type_node, op1);
8121 /* Avoid converting op1 to result_type later. */
8127 if ((code0 == INTEGER_TYPE || code0 == FIXED_POINT_TYPE)
8128 && code1 == INTEGER_TYPE)
8130 if (TREE_CODE (op1) == INTEGER_CST && skip_evaluation == 0)
8132 if (tree_int_cst_sgn (op1) < 0)
8133 warning (0, "left shift count is negative");
8135 else if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
8136 warning (0, "left shift count >= width of type");
8139 /* Use the type of the value to be shifted. */
8140 result_type = type0;
8141 /* Convert the shift-count to an integer, regardless of size
8142 of value being shifted. */
8143 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
8144 op1 = convert (integer_type_node, op1);
8145 /* Avoid converting op1 to result_type later. */
8152 if (FLOAT_TYPE_P (type0) || FLOAT_TYPE_P (type1))
8153 warning (OPT_Wfloat_equal,
8154 "comparing floating point with == or != is unsafe");
8155 /* Result of comparison is always int,
8156 but don't convert the args to int! */
8157 build_type = integer_type_node;
8158 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
8159 || code0 == FIXED_POINT_TYPE || code0 == COMPLEX_TYPE)
8160 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
8161 || code1 == FIXED_POINT_TYPE || code1 == COMPLEX_TYPE))
8163 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
8165 tree tt0 = TREE_TYPE (type0);
8166 tree tt1 = TREE_TYPE (type1);
8167 /* Anything compares with void *. void * compares with anything.
8168 Otherwise, the targets must be compatible
8169 and both must be object or both incomplete. */
8170 if (comp_target_types (type0, type1))
8171 result_type = common_pointer_type (type0, type1);
8172 else if (VOID_TYPE_P (tt0))
8174 /* op0 != orig_op0 detects the case of something
8175 whose value is 0 but which isn't a valid null ptr const. */
8176 if (pedantic && !null_pointer_constant_p (orig_op0)
8177 && TREE_CODE (tt1) == FUNCTION_TYPE)
8178 pedwarn ("ISO C forbids comparison of %<void *%>"
8179 " with function pointer");
8181 else if (VOID_TYPE_P (tt1))
8183 if (pedantic && !null_pointer_constant_p (orig_op1)
8184 && TREE_CODE (tt0) == FUNCTION_TYPE)
8185 pedwarn ("ISO C forbids comparison of %<void *%>"
8186 " with function pointer");
8189 /* Avoid warning about the volatile ObjC EH puts on decls. */
8191 pedwarn ("comparison of distinct pointer types lacks a cast");
8193 if (result_type == NULL_TREE)
8194 result_type = ptr_type_node;
8196 else if (code0 == POINTER_TYPE && null_pointer_constant_p (orig_op1))
8198 if (TREE_CODE (op0) == ADDR_EXPR
8199 && decl_with_nonnull_addr_p (TREE_OPERAND (op0, 0)))
8200 warning (OPT_Waddress, "the address of %qD will never be NULL",
8201 TREE_OPERAND (op0, 0));
8202 result_type = type0;
8204 else if (code1 == POINTER_TYPE && null_pointer_constant_p (orig_op0))
8206 if (TREE_CODE (op1) == ADDR_EXPR
8207 && decl_with_nonnull_addr_p (TREE_OPERAND (op1, 0)))
8208 warning (OPT_Waddress, "the address of %qD will never be NULL",
8209 TREE_OPERAND (op1, 0));
8210 result_type = type1;
8212 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
8214 result_type = type0;
8215 pedwarn ("comparison between pointer and integer");
8217 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
8219 result_type = type1;
8220 pedwarn ("comparison between pointer and integer");
8228 build_type = integer_type_node;
8229 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
8230 || code0 == FIXED_POINT_TYPE)
8231 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
8232 || code1 == FIXED_POINT_TYPE))
8234 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
8236 if (comp_target_types (type0, type1))
8238 result_type = common_pointer_type (type0, type1);
8239 if (!COMPLETE_TYPE_P (TREE_TYPE (type0))
8240 != !COMPLETE_TYPE_P (TREE_TYPE (type1)))
8241 pedwarn ("comparison of complete and incomplete pointers");
8243 && TREE_CODE (TREE_TYPE (type0)) == FUNCTION_TYPE)
8244 pedwarn ("ISO C forbids ordered comparisons of pointers to functions");
8248 result_type = ptr_type_node;
8249 pedwarn ("comparison of distinct pointer types lacks a cast");
8252 else if (code0 == POINTER_TYPE && null_pointer_constant_p (orig_op1))
8254 result_type = type0;
8255 if (pedantic || extra_warnings)
8256 pedwarn ("ordered comparison of pointer with integer zero");
8258 else if (code1 == POINTER_TYPE && null_pointer_constant_p (orig_op0))
8260 result_type = type1;
8262 pedwarn ("ordered comparison of pointer with integer zero");
8264 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
8266 result_type = type0;
8267 pedwarn ("comparison between pointer and integer");
8269 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
8271 result_type = type1;
8272 pedwarn ("comparison between pointer and integer");
8280 if (code0 == ERROR_MARK || code1 == ERROR_MARK)
8281 return error_mark_node;
8283 if (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE
8284 && (!tree_int_cst_equal (TYPE_SIZE (type0), TYPE_SIZE (type1))
8285 || !same_scalar_type_ignoring_signedness (TREE_TYPE (type0),
8286 TREE_TYPE (type1))))
8288 binary_op_error (code, type0, type1);
8289 return error_mark_node;
8292 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE || code0 == COMPLEX_TYPE
8293 || code0 == FIXED_POINT_TYPE || code0 == VECTOR_TYPE)
8295 (code1 == INTEGER_TYPE || code1 == REAL_TYPE || code1 == COMPLEX_TYPE
8296 || code1 == FIXED_POINT_TYPE || code1 == VECTOR_TYPE))
8298 int none_complex = (code0 != COMPLEX_TYPE && code1 != COMPLEX_TYPE);
8300 if (shorten || common || short_compare)
8302 result_type = c_common_type (type0, type1);
8303 if (result_type == error_mark_node)
8304 return error_mark_node;
8307 /* For certain operations (which identify themselves by shorten != 0)
8308 if both args were extended from the same smaller type,
8309 do the arithmetic in that type and then extend.
8311 shorten !=0 and !=1 indicates a bitwise operation.
8312 For them, this optimization is safe only if
8313 both args are zero-extended or both are sign-extended.
8314 Otherwise, we might change the result.
8315 Eg, (short)-1 | (unsigned short)-1 is (int)-1
8316 but calculated in (unsigned short) it would be (unsigned short)-1. */
8318 if (shorten && none_complex)
8320 int unsigned0, unsigned1;
8325 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
8326 excessive narrowing when we call get_narrower below. For
8327 example, suppose that OP0 is of unsigned int extended
8328 from signed char and that RESULT_TYPE is long long int.
8329 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
8332 (long long int) (unsigned int) signed_char
8334 which get_narrower would narrow down to
8336 (unsigned int) signed char
8338 If we do not cast OP0 first, get_narrower would return
8339 signed_char, which is inconsistent with the case of the
8341 op0 = convert (result_type, op0);
8342 op1 = convert (result_type, op1);
8344 arg0 = get_narrower (op0, &unsigned0);
8345 arg1 = get_narrower (op1, &unsigned1);
8347 /* UNS is 1 if the operation to be done is an unsigned one. */
8348 uns = TYPE_UNSIGNED (result_type);
8350 final_type = result_type;
8352 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
8353 but it *requires* conversion to FINAL_TYPE. */
8355 if ((TYPE_PRECISION (TREE_TYPE (op0))
8356 == TYPE_PRECISION (TREE_TYPE (arg0)))
8357 && TREE_TYPE (op0) != final_type)
8358 unsigned0 = TYPE_UNSIGNED (TREE_TYPE (op0));
8359 if ((TYPE_PRECISION (TREE_TYPE (op1))
8360 == TYPE_PRECISION (TREE_TYPE (arg1)))
8361 && TREE_TYPE (op1) != final_type)
8362 unsigned1 = TYPE_UNSIGNED (TREE_TYPE (op1));
8364 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
8366 /* For bitwise operations, signedness of nominal type
8367 does not matter. Consider only how operands were extended. */
8371 /* Note that in all three cases below we refrain from optimizing
8372 an unsigned operation on sign-extended args.
8373 That would not be valid. */
8375 /* Both args variable: if both extended in same way
8376 from same width, do it in that width.
8377 Do it unsigned if args were zero-extended. */
8378 if ((TYPE_PRECISION (TREE_TYPE (arg0))
8379 < TYPE_PRECISION (result_type))
8380 && (TYPE_PRECISION (TREE_TYPE (arg1))
8381 == TYPE_PRECISION (TREE_TYPE (arg0)))
8382 && unsigned0 == unsigned1
8383 && (unsigned0 || !uns))
8385 = c_common_signed_or_unsigned_type
8386 (unsigned0, common_type (TREE_TYPE (arg0), TREE_TYPE (arg1)));
8387 else if (TREE_CODE (arg0) == INTEGER_CST
8388 && (unsigned1 || !uns)
8389 && (TYPE_PRECISION (TREE_TYPE (arg1))
8390 < TYPE_PRECISION (result_type))
8392 = c_common_signed_or_unsigned_type (unsigned1,
8394 && !POINTER_TYPE_P (type)
8395 && int_fits_type_p (arg0, type))
8397 else if (TREE_CODE (arg1) == INTEGER_CST
8398 && (unsigned0 || !uns)
8399 && (TYPE_PRECISION (TREE_TYPE (arg0))
8400 < TYPE_PRECISION (result_type))
8402 = c_common_signed_or_unsigned_type (unsigned0,
8404 && !POINTER_TYPE_P (type)
8405 && int_fits_type_p (arg1, type))
8409 /* Shifts can be shortened if shifting right. */
8414 tree arg0 = get_narrower (op0, &unsigned_arg);
8416 final_type = result_type;
8418 if (arg0 == op0 && final_type == TREE_TYPE (op0))
8419 unsigned_arg = TYPE_UNSIGNED (TREE_TYPE (op0));
8421 if (TYPE_PRECISION (TREE_TYPE (arg0)) < TYPE_PRECISION (result_type)
8422 /* We can shorten only if the shift count is less than the
8423 number of bits in the smaller type size. */
8424 && compare_tree_int (op1, TYPE_PRECISION (TREE_TYPE (arg0))) < 0
8425 /* We cannot drop an unsigned shift after sign-extension. */
8426 && (!TYPE_UNSIGNED (final_type) || unsigned_arg))
8428 /* Do an unsigned shift if the operand was zero-extended. */
8430 = c_common_signed_or_unsigned_type (unsigned_arg,
8432 /* Convert value-to-be-shifted to that type. */
8433 if (TREE_TYPE (op0) != result_type)
8434 op0 = convert (result_type, op0);
8439 /* Comparison operations are shortened too but differently.
8440 They identify themselves by setting short_compare = 1. */
8444 /* Don't write &op0, etc., because that would prevent op0
8445 from being kept in a register.
8446 Instead, make copies of the our local variables and
8447 pass the copies by reference, then copy them back afterward. */
8448 tree xop0 = op0, xop1 = op1, xresult_type = result_type;
8449 enum tree_code xresultcode = resultcode;
8451 = shorten_compare (&xop0, &xop1, &xresult_type, &xresultcode);
8456 op0 = xop0, op1 = xop1;
8458 resultcode = xresultcode;
8460 if (warn_sign_compare && skip_evaluation == 0)
8462 int op0_signed = !TYPE_UNSIGNED (TREE_TYPE (orig_op0));
8463 int op1_signed = !TYPE_UNSIGNED (TREE_TYPE (orig_op1));
8464 int unsignedp0, unsignedp1;
8465 tree primop0 = get_narrower (op0, &unsignedp0);
8466 tree primop1 = get_narrower (op1, &unsignedp1);
8470 STRIP_TYPE_NOPS (xop0);
8471 STRIP_TYPE_NOPS (xop1);
8473 /* Give warnings for comparisons between signed and unsigned
8474 quantities that may fail.
8476 Do the checking based on the original operand trees, so that
8477 casts will be considered, but default promotions won't be.
8479 Do not warn if the comparison is being done in a signed type,
8480 since the signed type will only be chosen if it can represent
8481 all the values of the unsigned type. */
8482 if (!TYPE_UNSIGNED (result_type))
8484 /* Do not warn if both operands are the same signedness. */
8485 else if (op0_signed == op1_signed)
8493 sop = xop0, uop = xop1;
8495 sop = xop1, uop = xop0;
8497 /* Do not warn if the signed quantity is an
8498 unsuffixed integer literal (or some static
8499 constant expression involving such literals or a
8500 conditional expression involving such literals)
8501 and it is non-negative. */
8502 if (tree_expr_nonnegative_warnv_p (sop, &ovf))
8504 /* Do not warn if the comparison is an equality operation,
8505 the unsigned quantity is an integral constant, and it
8506 would fit in the result if the result were signed. */
8507 else if (TREE_CODE (uop) == INTEGER_CST
8508 && (resultcode == EQ_EXPR || resultcode == NE_EXPR)
8510 (uop, c_common_signed_type (result_type)))
8512 /* Do not warn if the unsigned quantity is an enumeration
8513 constant and its maximum value would fit in the result
8514 if the result were signed. */
8515 else if (TREE_CODE (uop) == INTEGER_CST
8516 && TREE_CODE (TREE_TYPE (uop)) == ENUMERAL_TYPE
8518 (TYPE_MAX_VALUE (TREE_TYPE (uop)),
8519 c_common_signed_type (result_type)))
8522 warning (OPT_Wsign_compare, "comparison between signed and unsigned");
8525 /* Warn if two unsigned values are being compared in a size
8526 larger than their original size, and one (and only one) is the
8527 result of a `~' operator. This comparison will always fail.
8529 Also warn if one operand is a constant, and the constant
8530 does not have all bits set that are set in the ~ operand
8531 when it is extended. */
8533 if ((TREE_CODE (primop0) == BIT_NOT_EXPR)
8534 != (TREE_CODE (primop1) == BIT_NOT_EXPR))
8536 if (TREE_CODE (primop0) == BIT_NOT_EXPR)
8537 primop0 = get_narrower (TREE_OPERAND (primop0, 0),
8540 primop1 = get_narrower (TREE_OPERAND (primop1, 0),
8543 if (host_integerp (primop0, 0) || host_integerp (primop1, 0))
8546 HOST_WIDE_INT constant, mask;
8547 int unsignedp, bits;
8549 if (host_integerp (primop0, 0))
8552 unsignedp = unsignedp1;
8553 constant = tree_low_cst (primop0, 0);
8558 unsignedp = unsignedp0;
8559 constant = tree_low_cst (primop1, 0);
8562 bits = TYPE_PRECISION (TREE_TYPE (primop));
8563 if (bits < TYPE_PRECISION (result_type)
8564 && bits < HOST_BITS_PER_WIDE_INT && unsignedp)
8566 mask = (~(HOST_WIDE_INT) 0) << bits;
8567 if ((mask & constant) != mask)
8568 warning (OPT_Wsign_compare, "comparison of promoted ~unsigned with constant");
8571 else if (unsignedp0 && unsignedp1
8572 && (TYPE_PRECISION (TREE_TYPE (primop0))
8573 < TYPE_PRECISION (result_type))
8574 && (TYPE_PRECISION (TREE_TYPE (primop1))
8575 < TYPE_PRECISION (result_type)))
8576 warning (OPT_Wsign_compare, "comparison of promoted ~unsigned with unsigned");
8582 /* At this point, RESULT_TYPE must be nonzero to avoid an error message.
8583 If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
8584 Then the expression will be built.
8585 It will be given type FINAL_TYPE if that is nonzero;
8586 otherwise, it will be given type RESULT_TYPE. */
8590 binary_op_error (code, TREE_TYPE (op0), TREE_TYPE (op1));
8591 return error_mark_node;
8596 if (TREE_TYPE (op0) != result_type)
8597 op0 = convert_and_check (result_type, op0);
8598 if (TREE_TYPE (op1) != result_type)
8599 op1 = convert_and_check (result_type, op1);
8601 /* This can happen if one operand has a vector type, and the other
8602 has a different type. */
8603 if (TREE_CODE (op0) == ERROR_MARK || TREE_CODE (op1) == ERROR_MARK)
8604 return error_mark_node;
8607 if (build_type == NULL_TREE)
8608 build_type = result_type;
8611 /* Treat expressions in initializers specially as they can't trap. */
8612 tree result = require_constant_value ? fold_build2_initializer (resultcode,
8615 : fold_build2 (resultcode, build_type,
8618 if (final_type != 0)
8619 result = convert (final_type, result);
8625 /* Convert EXPR to be a truth-value, validating its type for this
8629 c_objc_common_truthvalue_conversion (tree expr)
8631 switch (TREE_CODE (TREE_TYPE (expr)))
8634 error ("used array that cannot be converted to pointer where scalar is required");
8635 return error_mark_node;
8638 error ("used struct type value where scalar is required");
8639 return error_mark_node;
8642 error ("used union type value where scalar is required");
8643 return error_mark_node;
8652 /* ??? Should we also give an error for void and vectors rather than
8653 leaving those to give errors later? */
8654 return c_common_truthvalue_conversion (expr);
8658 /* Convert EXPR to a contained DECL, updating *TC, *TI and *SE as
8662 c_expr_to_decl (tree expr, bool *tc ATTRIBUTE_UNUSED, bool *se)
8664 if (TREE_CODE (expr) == COMPOUND_LITERAL_EXPR)
8666 tree decl = COMPOUND_LITERAL_EXPR_DECL (expr);
8667 /* Executing a compound literal inside a function reinitializes
8669 if (!TREE_STATIC (decl))
8677 /* Like c_begin_compound_stmt, except force the retention of the BLOCK. */
8680 c_begin_omp_parallel (void)
8685 block = c_begin_compound_stmt (true);
8691 c_finish_omp_parallel (tree clauses, tree block)
8695 block = c_end_compound_stmt (block, true);
8697 stmt = make_node (OMP_PARALLEL);
8698 TREE_TYPE (stmt) = void_type_node;
8699 OMP_PARALLEL_CLAUSES (stmt) = clauses;
8700 OMP_PARALLEL_BODY (stmt) = block;
8702 return add_stmt (stmt);
8705 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
8706 Remove any elements from the list that are invalid. */
8709 c_finish_omp_clauses (tree clauses)
8711 bitmap_head generic_head, firstprivate_head, lastprivate_head;
8712 tree c, t, *pc = &clauses;
8715 bitmap_obstack_initialize (NULL);
8716 bitmap_initialize (&generic_head, &bitmap_default_obstack);
8717 bitmap_initialize (&firstprivate_head, &bitmap_default_obstack);
8718 bitmap_initialize (&lastprivate_head, &bitmap_default_obstack);
8720 for (pc = &clauses, c = clauses; c ; c = *pc)
8722 bool remove = false;
8723 bool need_complete = false;
8724 bool need_implicitly_determined = false;
8726 switch (OMP_CLAUSE_CODE (c))
8728 case OMP_CLAUSE_SHARED:
8730 need_implicitly_determined = true;
8731 goto check_dup_generic;
8733 case OMP_CLAUSE_PRIVATE:
8735 need_complete = true;
8736 need_implicitly_determined = true;
8737 goto check_dup_generic;
8739 case OMP_CLAUSE_REDUCTION:
8741 need_implicitly_determined = true;
8742 t = OMP_CLAUSE_DECL (c);
8743 if (AGGREGATE_TYPE_P (TREE_TYPE (t))
8744 || POINTER_TYPE_P (TREE_TYPE (t)))
8746 error ("%qE has invalid type for %<reduction%>", t);
8749 else if (FLOAT_TYPE_P (TREE_TYPE (t)))
8751 enum tree_code r_code = OMP_CLAUSE_REDUCTION_CODE (c);
8752 const char *r_name = NULL;
8769 case TRUTH_ANDIF_EXPR:
8772 case TRUTH_ORIF_EXPR:
8780 error ("%qE has invalid type for %<reduction(%s)%>",
8785 goto check_dup_generic;
8787 case OMP_CLAUSE_COPYPRIVATE:
8788 name = "copyprivate";
8789 goto check_dup_generic;
8791 case OMP_CLAUSE_COPYIN:
8793 t = OMP_CLAUSE_DECL (c);
8794 if (TREE_CODE (t) != VAR_DECL || !DECL_THREAD_LOCAL_P (t))
8796 error ("%qE must be %<threadprivate%> for %<copyin%>", t);
8799 goto check_dup_generic;
8802 t = OMP_CLAUSE_DECL (c);
8803 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
8805 error ("%qE is not a variable in clause %qs", t, name);
8808 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
8809 || bitmap_bit_p (&firstprivate_head, DECL_UID (t))
8810 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
8812 error ("%qE appears more than once in data clauses", t);
8816 bitmap_set_bit (&generic_head, DECL_UID (t));
8819 case OMP_CLAUSE_FIRSTPRIVATE:
8820 name = "firstprivate";
8821 t = OMP_CLAUSE_DECL (c);
8822 need_complete = true;
8823 need_implicitly_determined = true;
8824 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
8826 error ("%qE is not a variable in clause %<firstprivate%>", t);
8829 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
8830 || bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
8832 error ("%qE appears more than once in data clauses", t);
8836 bitmap_set_bit (&firstprivate_head, DECL_UID (t));
8839 case OMP_CLAUSE_LASTPRIVATE:
8840 name = "lastprivate";
8841 t = OMP_CLAUSE_DECL (c);
8842 need_complete = true;
8843 need_implicitly_determined = true;
8844 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
8846 error ("%qE is not a variable in clause %<lastprivate%>", t);
8849 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
8850 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
8852 error ("%qE appears more than once in data clauses", t);
8856 bitmap_set_bit (&lastprivate_head, DECL_UID (t));
8860 case OMP_CLAUSE_NUM_THREADS:
8861 case OMP_CLAUSE_SCHEDULE:
8862 case OMP_CLAUSE_NOWAIT:
8863 case OMP_CLAUSE_ORDERED:
8864 case OMP_CLAUSE_DEFAULT:
8865 pc = &OMP_CLAUSE_CHAIN (c);
8874 t = OMP_CLAUSE_DECL (c);
8878 t = require_complete_type (t);
8879 if (t == error_mark_node)
8883 if (need_implicitly_determined)
8885 const char *share_name = NULL;
8887 if (TREE_CODE (t) == VAR_DECL && DECL_THREAD_LOCAL_P (t))
8888 share_name = "threadprivate";
8889 else switch (c_omp_predetermined_sharing (t))
8891 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
8893 case OMP_CLAUSE_DEFAULT_SHARED:
8894 share_name = "shared";
8896 case OMP_CLAUSE_DEFAULT_PRIVATE:
8897 share_name = "private";
8904 error ("%qE is predetermined %qs for %qs",
8905 t, share_name, name);
8912 *pc = OMP_CLAUSE_CHAIN (c);
8914 pc = &OMP_CLAUSE_CHAIN (c);
8917 bitmap_obstack_release (NULL);
8921 /* Make a variant type in the proper way for C/C++, propagating qualifiers
8922 down to the element type of an array. */
8925 c_build_qualified_type (tree type, int type_quals)
8927 if (type == error_mark_node)
8930 if (TREE_CODE (type) == ARRAY_TYPE)
8933 tree element_type = c_build_qualified_type (TREE_TYPE (type),
8936 /* See if we already have an identically qualified type. */
8937 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
8939 if (TYPE_QUALS (strip_array_types (t)) == type_quals
8940 && TYPE_NAME (t) == TYPE_NAME (type)
8941 && TYPE_CONTEXT (t) == TYPE_CONTEXT (type)
8942 && attribute_list_equal (TYPE_ATTRIBUTES (t),
8943 TYPE_ATTRIBUTES (type)))
8948 tree domain = TYPE_DOMAIN (type);
8950 t = build_variant_type_copy (type);
8951 TREE_TYPE (t) = element_type;
8953 if (TYPE_STRUCTURAL_EQUALITY_P (element_type)
8954 || (domain && TYPE_STRUCTURAL_EQUALITY_P (domain)))
8955 SET_TYPE_STRUCTURAL_EQUALITY (t);
8956 else if (TYPE_CANONICAL (element_type) != element_type
8957 || (domain && TYPE_CANONICAL (domain) != domain))
8959 tree unqualified_canon
8960 = build_array_type (TYPE_CANONICAL (element_type),
8961 domain? TYPE_CANONICAL (domain)
8964 = c_build_qualified_type (unqualified_canon, type_quals);
8967 TYPE_CANONICAL (t) = t;
8972 /* A restrict-qualified pointer type must be a pointer to object or
8973 incomplete type. Note that the use of POINTER_TYPE_P also allows
8974 REFERENCE_TYPEs, which is appropriate for C++. */
8975 if ((type_quals & TYPE_QUAL_RESTRICT)
8976 && (!POINTER_TYPE_P (type)
8977 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type))))
8979 error ("invalid use of %<restrict%>");
8980 type_quals &= ~TYPE_QUAL_RESTRICT;
8983 return build_qualified_type (type, type_quals);