1 /* Build expressions with type checking for C compiler.
2 Copyright (C) 1987, 1988, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008
4 Free Software Foundation, Inc.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 3, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
23 /* This file is part of the C front end.
24 It contains routines to build C expressions given their operands,
25 including computing the types of the result, C-specific error checks,
26 and some optimization. */
30 #include "coretypes.h"
34 #include "langhooks.h"
44 #include "tree-iterator.h"
46 #include "tree-flow.h"
48 /* Possible cases of implicit bad conversions. Used to select
49 diagnostic messages in convert_for_assignment. */
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),
473 pedwarn (OPT_pedantic,
474 "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),
498 pedwarn (OPT_pedantic,
499 "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 enum mode_class mclass = (enum mode_class) 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 enum mode_class mclass = (enum mode_class) 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);
1043 pedwarn (OPT_pedantic, "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 (0, "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 || CONVERT_EXPR_P (exp.value))
1661 && TREE_TYPE (TREE_OPERAND (exp.value, 0)) == type)
1663 if (TREE_CODE (exp.value) == NON_LVALUE_EXPR)
1665 exp.value = TREE_OPERAND (exp.value, 0);
1668 if (TREE_NO_WARNING (orig_exp))
1669 TREE_NO_WARNING (exp.value) = 1;
1671 lvalue_array_p = !not_lvalue && lvalue_p (exp.value);
1672 if (!flag_isoc99 && !lvalue_array_p)
1674 /* Before C99, non-lvalue arrays do not decay to pointers.
1675 Normally, using such an array would be invalid; but it can
1676 be used correctly inside sizeof or as a statement expression.
1677 Thus, do not give an error here; an error will result later. */
1681 exp.value = array_to_pointer_conversion (exp.value);
1685 exp.value = function_to_pointer_conversion (exp.value);
1688 STRIP_TYPE_NOPS (exp.value);
1689 if (TREE_NO_WARNING (orig_exp))
1690 TREE_NO_WARNING (exp.value) = 1;
1698 /* EXP is an expression of integer type. Apply the integer promotions
1699 to it and return the promoted value. */
1702 perform_integral_promotions (tree exp)
1704 tree type = TREE_TYPE (exp);
1705 enum tree_code code = TREE_CODE (type);
1707 gcc_assert (INTEGRAL_TYPE_P (type));
1709 /* Normally convert enums to int,
1710 but convert wide enums to something wider. */
1711 if (code == ENUMERAL_TYPE)
1713 type = c_common_type_for_size (MAX (TYPE_PRECISION (type),
1714 TYPE_PRECISION (integer_type_node)),
1715 ((TYPE_PRECISION (type)
1716 >= TYPE_PRECISION (integer_type_node))
1717 && TYPE_UNSIGNED (type)));
1719 return convert (type, exp);
1722 /* ??? This should no longer be needed now bit-fields have their
1724 if (TREE_CODE (exp) == COMPONENT_REF
1725 && DECL_C_BIT_FIELD (TREE_OPERAND (exp, 1))
1726 /* If it's thinner than an int, promote it like a
1727 c_promoting_integer_type_p, otherwise leave it alone. */
1728 && 0 > compare_tree_int (DECL_SIZE (TREE_OPERAND (exp, 1)),
1729 TYPE_PRECISION (integer_type_node)))
1730 return convert (integer_type_node, exp);
1732 if (c_promoting_integer_type_p (type))
1734 /* Preserve unsignedness if not really getting any wider. */
1735 if (TYPE_UNSIGNED (type)
1736 && TYPE_PRECISION (type) == TYPE_PRECISION (integer_type_node))
1737 return convert (unsigned_type_node, exp);
1739 return convert (integer_type_node, exp);
1746 /* Perform default promotions for C data used in expressions.
1747 Enumeral types or short or char are converted to int.
1748 In addition, manifest constants symbols are replaced by their values. */
1751 default_conversion (tree exp)
1754 tree type = TREE_TYPE (exp);
1755 enum tree_code code = TREE_CODE (type);
1757 /* Functions and arrays have been converted during parsing. */
1758 gcc_assert (code != FUNCTION_TYPE);
1759 if (code == ARRAY_TYPE)
1762 /* Constants can be used directly unless they're not loadable. */
1763 if (TREE_CODE (exp) == CONST_DECL)
1764 exp = DECL_INITIAL (exp);
1766 /* Replace a nonvolatile const static variable with its value unless
1767 it is an array, in which case we must be sure that taking the
1768 address of the array produces consistent results. */
1769 else if (optimize && TREE_CODE (exp) == VAR_DECL && code != ARRAY_TYPE)
1771 exp = decl_constant_value_for_broken_optimization (exp);
1772 type = TREE_TYPE (exp);
1775 /* Strip no-op conversions. */
1777 STRIP_TYPE_NOPS (exp);
1779 if (TREE_NO_WARNING (orig_exp))
1780 TREE_NO_WARNING (exp) = 1;
1782 if (code == VOID_TYPE)
1784 error ("void value not ignored as it ought to be");
1785 return error_mark_node;
1788 exp = require_complete_type (exp);
1789 if (exp == error_mark_node)
1790 return error_mark_node;
1792 if (INTEGRAL_TYPE_P (type))
1793 return perform_integral_promotions (exp);
1798 /* Look up COMPONENT in a structure or union DECL.
1800 If the component name is not found, returns NULL_TREE. Otherwise,
1801 the return value is a TREE_LIST, with each TREE_VALUE a FIELD_DECL
1802 stepping down the chain to the component, which is in the last
1803 TREE_VALUE of the list. Normally the list is of length one, but if
1804 the component is embedded within (nested) anonymous structures or
1805 unions, the list steps down the chain to the component. */
1808 lookup_field (tree decl, tree component)
1810 tree type = TREE_TYPE (decl);
1813 /* If TYPE_LANG_SPECIFIC is set, then it is a sorted array of pointers
1814 to the field elements. Use a binary search on this array to quickly
1815 find the element. Otherwise, do a linear search. TYPE_LANG_SPECIFIC
1816 will always be set for structures which have many elements. */
1818 if (TYPE_LANG_SPECIFIC (type) && TYPE_LANG_SPECIFIC (type)->s)
1821 tree *field_array = &TYPE_LANG_SPECIFIC (type)->s->elts[0];
1823 field = TYPE_FIELDS (type);
1825 top = TYPE_LANG_SPECIFIC (type)->s->len;
1826 while (top - bot > 1)
1828 half = (top - bot + 1) >> 1;
1829 field = field_array[bot+half];
1831 if (DECL_NAME (field) == NULL_TREE)
1833 /* Step through all anon unions in linear fashion. */
1834 while (DECL_NAME (field_array[bot]) == NULL_TREE)
1836 field = field_array[bot++];
1837 if (TREE_CODE (TREE_TYPE (field)) == RECORD_TYPE
1838 || TREE_CODE (TREE_TYPE (field)) == UNION_TYPE)
1840 tree anon = lookup_field (field, component);
1843 return tree_cons (NULL_TREE, field, anon);
1847 /* Entire record is only anon unions. */
1851 /* Restart the binary search, with new lower bound. */
1855 if (DECL_NAME (field) == component)
1857 if (DECL_NAME (field) < component)
1863 if (DECL_NAME (field_array[bot]) == component)
1864 field = field_array[bot];
1865 else if (DECL_NAME (field) != component)
1870 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
1872 if (DECL_NAME (field) == NULL_TREE
1873 && (TREE_CODE (TREE_TYPE (field)) == RECORD_TYPE
1874 || TREE_CODE (TREE_TYPE (field)) == UNION_TYPE))
1876 tree anon = lookup_field (field, component);
1879 return tree_cons (NULL_TREE, field, anon);
1882 if (DECL_NAME (field) == component)
1886 if (field == NULL_TREE)
1890 return tree_cons (NULL_TREE, field, NULL_TREE);
1893 /* Make an expression to refer to the COMPONENT field of
1894 structure or union value DATUM. COMPONENT is an IDENTIFIER_NODE. */
1897 build_component_ref (tree datum, tree component)
1899 tree type = TREE_TYPE (datum);
1900 enum tree_code code = TREE_CODE (type);
1904 if (!objc_is_public (datum, component))
1905 return error_mark_node;
1907 /* See if there is a field or component with name COMPONENT. */
1909 if (code == RECORD_TYPE || code == UNION_TYPE)
1911 if (!COMPLETE_TYPE_P (type))
1913 c_incomplete_type_error (NULL_TREE, type);
1914 return error_mark_node;
1917 field = lookup_field (datum, component);
1921 error ("%qT has no member named %qE", type, component);
1922 return error_mark_node;
1925 /* Chain the COMPONENT_REFs if necessary down to the FIELD.
1926 This might be better solved in future the way the C++ front
1927 end does it - by giving the anonymous entities each a
1928 separate name and type, and then have build_component_ref
1929 recursively call itself. We can't do that here. */
1932 tree subdatum = TREE_VALUE (field);
1936 if (TREE_TYPE (subdatum) == error_mark_node)
1937 return error_mark_node;
1939 quals = TYPE_QUALS (strip_array_types (TREE_TYPE (subdatum)));
1940 quals |= TYPE_QUALS (TREE_TYPE (datum));
1941 subtype = c_build_qualified_type (TREE_TYPE (subdatum), quals);
1943 ref = build3 (COMPONENT_REF, subtype, datum, subdatum,
1945 if (TREE_READONLY (datum) || TREE_READONLY (subdatum))
1946 TREE_READONLY (ref) = 1;
1947 if (TREE_THIS_VOLATILE (datum) || TREE_THIS_VOLATILE (subdatum))
1948 TREE_THIS_VOLATILE (ref) = 1;
1950 if (TREE_DEPRECATED (subdatum))
1951 warn_deprecated_use (subdatum);
1955 field = TREE_CHAIN (field);
1961 else if (code != ERROR_MARK)
1962 error ("request for member %qE in something not a structure or union",
1965 return error_mark_node;
1968 /* Given an expression PTR for a pointer, return an expression
1969 for the value pointed to.
1970 ERRORSTRING is the name of the operator to appear in error messages. */
1973 build_indirect_ref (tree ptr, const char *errorstring)
1975 tree pointer = default_conversion (ptr);
1976 tree type = TREE_TYPE (pointer);
1978 if (TREE_CODE (type) == POINTER_TYPE)
1980 if (CONVERT_EXPR_P (pointer)
1981 || TREE_CODE (pointer) == VIEW_CONVERT_EXPR)
1983 /* If a warning is issued, mark it to avoid duplicates from
1984 the backend. This only needs to be done at
1985 warn_strict_aliasing > 2. */
1986 if (warn_strict_aliasing > 2)
1987 if (strict_aliasing_warning (TREE_TYPE (TREE_OPERAND (pointer, 0)),
1988 type, TREE_OPERAND (pointer, 0)))
1989 TREE_NO_WARNING (pointer) = 1;
1992 if (TREE_CODE (pointer) == ADDR_EXPR
1993 && (TREE_TYPE (TREE_OPERAND (pointer, 0))
1994 == TREE_TYPE (type)))
1995 return TREE_OPERAND (pointer, 0);
1998 tree t = TREE_TYPE (type);
2001 ref = build1 (INDIRECT_REF, t, pointer);
2003 if (!COMPLETE_OR_VOID_TYPE_P (t) && TREE_CODE (t) != ARRAY_TYPE)
2005 error ("dereferencing pointer to incomplete type");
2006 return error_mark_node;
2008 if (VOID_TYPE_P (t) && skip_evaluation == 0)
2009 warning (0, "dereferencing %<void *%> pointer");
2011 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
2012 so that we get the proper error message if the result is used
2013 to assign to. Also, &* is supposed to be a no-op.
2014 And ANSI C seems to specify that the type of the result
2015 should be the const type. */
2016 /* A de-reference of a pointer to const is not a const. It is valid
2017 to change it via some other pointer. */
2018 TREE_READONLY (ref) = TYPE_READONLY (t);
2019 TREE_SIDE_EFFECTS (ref)
2020 = TYPE_VOLATILE (t) || TREE_SIDE_EFFECTS (pointer);
2021 TREE_THIS_VOLATILE (ref) = TYPE_VOLATILE (t);
2025 else if (TREE_CODE (pointer) != ERROR_MARK)
2026 error ("invalid type argument of %qs (have %qT)", errorstring, type);
2027 return error_mark_node;
2030 /* This handles expressions of the form "a[i]", which denotes
2033 This is logically equivalent in C to *(a+i), but we may do it differently.
2034 If A is a variable or a member, we generate a primitive ARRAY_REF.
2035 This avoids forcing the array out of registers, and can work on
2036 arrays that are not lvalues (for example, members of structures returned
2040 build_array_ref (tree array, tree index)
2042 bool swapped = false;
2043 if (TREE_TYPE (array) == error_mark_node
2044 || TREE_TYPE (index) == error_mark_node)
2045 return error_mark_node;
2047 if (TREE_CODE (TREE_TYPE (array)) != ARRAY_TYPE
2048 && TREE_CODE (TREE_TYPE (array)) != POINTER_TYPE)
2051 if (TREE_CODE (TREE_TYPE (index)) != ARRAY_TYPE
2052 && TREE_CODE (TREE_TYPE (index)) != POINTER_TYPE)
2054 error ("subscripted value is neither array nor pointer");
2055 return error_mark_node;
2063 if (!INTEGRAL_TYPE_P (TREE_TYPE (index)))
2065 error ("array subscript is not an integer");
2066 return error_mark_node;
2069 if (TREE_CODE (TREE_TYPE (TREE_TYPE (array))) == FUNCTION_TYPE)
2071 error ("subscripted value is pointer to function");
2072 return error_mark_node;
2075 /* ??? Existing practice has been to warn only when the char
2076 index is syntactically the index, not for char[array]. */
2078 warn_array_subscript_with_type_char (index);
2080 /* Apply default promotions *after* noticing character types. */
2081 index = default_conversion (index);
2083 gcc_assert (TREE_CODE (TREE_TYPE (index)) == INTEGER_TYPE);
2085 if (TREE_CODE (TREE_TYPE (array)) == ARRAY_TYPE)
2089 /* An array that is indexed by a non-constant
2090 cannot be stored in a register; we must be able to do
2091 address arithmetic on its address.
2092 Likewise an array of elements of variable size. */
2093 if (TREE_CODE (index) != INTEGER_CST
2094 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array)))
2095 && TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array)))) != INTEGER_CST))
2097 if (!c_mark_addressable (array))
2098 return error_mark_node;
2100 /* An array that is indexed by a constant value which is not within
2101 the array bounds cannot be stored in a register either; because we
2102 would get a crash in store_bit_field/extract_bit_field when trying
2103 to access a non-existent part of the register. */
2104 if (TREE_CODE (index) == INTEGER_CST
2105 && TYPE_DOMAIN (TREE_TYPE (array))
2106 && !int_fits_type_p (index, TYPE_DOMAIN (TREE_TYPE (array))))
2108 if (!c_mark_addressable (array))
2109 return error_mark_node;
2115 while (TREE_CODE (foo) == COMPONENT_REF)
2116 foo = TREE_OPERAND (foo, 0);
2117 if (TREE_CODE (foo) == VAR_DECL && C_DECL_REGISTER (foo))
2118 pedwarn (OPT_pedantic,
2119 "ISO C forbids subscripting %<register%> array");
2120 else if (!flag_isoc99 && !lvalue_p (foo))
2121 pedwarn (OPT_pedantic,
2122 "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 TREE_USED (ref) = 1;
2199 if (TREE_CODE (ref) == FUNCTION_DECL && !in_alignof)
2201 if (!in_sizeof && !in_typeof)
2202 C_DECL_USED (ref) = 1;
2203 else if (DECL_INITIAL (ref) == 0
2204 && DECL_EXTERNAL (ref)
2205 && !TREE_PUBLIC (ref))
2206 record_maybe_used_decl (ref);
2209 if (TREE_CODE (ref) == CONST_DECL)
2211 used_types_insert (TREE_TYPE (ref));
2212 ref = DECL_INITIAL (ref);
2213 TREE_CONSTANT (ref) = 1;
2215 else if (current_function_decl != 0
2216 && !DECL_FILE_SCOPE_P (current_function_decl)
2217 && (TREE_CODE (ref) == VAR_DECL
2218 || TREE_CODE (ref) == PARM_DECL
2219 || TREE_CODE (ref) == FUNCTION_DECL))
2221 tree context = decl_function_context (ref);
2223 if (context != 0 && context != current_function_decl)
2224 DECL_NONLOCAL (ref) = 1;
2226 /* C99 6.7.4p3: An inline definition of a function with external
2227 linkage ... shall not contain a reference to an identifier with
2228 internal linkage. */
2229 else if (current_function_decl != 0
2230 && DECL_DECLARED_INLINE_P (current_function_decl)
2231 && DECL_EXTERNAL (current_function_decl)
2232 && VAR_OR_FUNCTION_DECL_P (ref)
2233 && (TREE_CODE (ref) != VAR_DECL || TREE_STATIC (ref))
2234 && ! TREE_PUBLIC (ref)
2235 && DECL_CONTEXT (ref) != current_function_decl)
2236 pedwarn (0, "%H%qD is static but used in inline function %qD "
2237 "which is not static", &loc, ref, current_function_decl);
2242 /* Record details of decls possibly used inside sizeof or typeof. */
2243 struct maybe_used_decl
2247 /* The level seen at (in_sizeof + in_typeof). */
2249 /* The next one at this level or above, or NULL. */
2250 struct maybe_used_decl *next;
2253 static struct maybe_used_decl *maybe_used_decls;
2255 /* Record that DECL, an undefined static function reference seen
2256 inside sizeof or typeof, might be used if the operand of sizeof is
2257 a VLA type or the operand of typeof is a variably modified
2261 record_maybe_used_decl (tree decl)
2263 struct maybe_used_decl *t = XOBNEW (&parser_obstack, struct maybe_used_decl);
2265 t->level = in_sizeof + in_typeof;
2266 t->next = maybe_used_decls;
2267 maybe_used_decls = t;
2270 /* Pop the stack of decls possibly used inside sizeof or typeof. If
2271 USED is false, just discard them. If it is true, mark them used
2272 (if no longer inside sizeof or typeof) or move them to the next
2273 level up (if still inside sizeof or typeof). */
2276 pop_maybe_used (bool used)
2278 struct maybe_used_decl *p = maybe_used_decls;
2279 int cur_level = in_sizeof + in_typeof;
2280 while (p && p->level > cur_level)
2285 C_DECL_USED (p->decl) = 1;
2287 p->level = cur_level;
2291 if (!used || cur_level == 0)
2292 maybe_used_decls = p;
2295 /* Return the result of sizeof applied to EXPR. */
2298 c_expr_sizeof_expr (struct c_expr expr)
2301 if (expr.value == error_mark_node)
2303 ret.value = error_mark_node;
2304 ret.original_code = ERROR_MARK;
2305 pop_maybe_used (false);
2309 ret.value = c_sizeof (TREE_TYPE (expr.value));
2310 ret.original_code = ERROR_MARK;
2311 if (c_vla_type_p (TREE_TYPE (expr.value)))
2313 /* sizeof is evaluated when given a vla (C99 6.5.3.4p2). */
2314 ret.value = build2 (COMPOUND_EXPR, TREE_TYPE (ret.value), expr.value, ret.value);
2316 pop_maybe_used (C_TYPE_VARIABLE_SIZE (TREE_TYPE (expr.value)));
2321 /* Return the result of sizeof applied to T, a structure for the type
2322 name passed to sizeof (rather than the type itself). */
2325 c_expr_sizeof_type (struct c_type_name *t)
2329 type = groktypename (t);
2330 ret.value = c_sizeof (type);
2331 ret.original_code = ERROR_MARK;
2332 pop_maybe_used (type != error_mark_node
2333 ? C_TYPE_VARIABLE_SIZE (type) : false);
2337 /* Build a function call to function FUNCTION with parameters PARAMS.
2338 PARAMS is a list--a chain of TREE_LIST nodes--in which the
2339 TREE_VALUE of each node is a parameter-expression.
2340 FUNCTION's data type may be a function type or a pointer-to-function. */
2343 build_function_call (tree function, tree params)
2345 tree fntype, fundecl = 0;
2346 tree name = NULL_TREE, result;
2352 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
2353 STRIP_TYPE_NOPS (function);
2355 /* Convert anything with function type to a pointer-to-function. */
2356 if (TREE_CODE (function) == FUNCTION_DECL)
2358 /* Implement type-directed function overloading for builtins.
2359 resolve_overloaded_builtin and targetm.resolve_overloaded_builtin
2360 handle all the type checking. The result is a complete expression
2361 that implements this function call. */
2362 tem = resolve_overloaded_builtin (function, params);
2366 name = DECL_NAME (function);
2369 if (TREE_CODE (TREE_TYPE (function)) == FUNCTION_TYPE)
2370 function = function_to_pointer_conversion (function);
2372 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
2373 expressions, like those used for ObjC messenger dispatches. */
2374 function = objc_rewrite_function_call (function, params);
2376 fntype = TREE_TYPE (function);
2378 if (TREE_CODE (fntype) == ERROR_MARK)
2379 return error_mark_node;
2381 if (!(TREE_CODE (fntype) == POINTER_TYPE
2382 && TREE_CODE (TREE_TYPE (fntype)) == FUNCTION_TYPE))
2384 error ("called object %qE is not a function", function);
2385 return error_mark_node;
2388 if (fundecl && TREE_THIS_VOLATILE (fundecl))
2389 current_function_returns_abnormally = 1;
2391 /* fntype now gets the type of function pointed to. */
2392 fntype = TREE_TYPE (fntype);
2394 /* Check that the function is called through a compatible prototype.
2395 If it is not, replace the call by a trap, wrapped up in a compound
2396 expression if necessary. This has the nice side-effect to prevent
2397 the tree-inliner from generating invalid assignment trees which may
2398 blow up in the RTL expander later. */
2399 if (CONVERT_EXPR_P (function)
2400 && TREE_CODE (tem = TREE_OPERAND (function, 0)) == ADDR_EXPR
2401 && TREE_CODE (tem = TREE_OPERAND (tem, 0)) == FUNCTION_DECL
2402 && !comptypes (fntype, TREE_TYPE (tem)))
2404 tree return_type = TREE_TYPE (fntype);
2405 tree trap = build_function_call (built_in_decls[BUILT_IN_TRAP],
2408 /* This situation leads to run-time undefined behavior. We can't,
2409 therefore, simply error unless we can prove that all possible
2410 executions of the program must execute the code. */
2411 warning (0, "function called through a non-compatible type");
2413 /* We can, however, treat "undefined" any way we please.
2414 Call abort to encourage the user to fix the program. */
2415 inform ("if this code is reached, the program will abort");
2417 if (VOID_TYPE_P (return_type))
2423 if (AGGREGATE_TYPE_P (return_type))
2424 rhs = build_compound_literal (return_type,
2425 build_constructor (return_type, 0));
2427 rhs = fold_convert (return_type, integer_zero_node);
2429 return build2 (COMPOUND_EXPR, return_type, trap, rhs);
2433 /* Convert the parameters to the types declared in the
2434 function prototype, or apply default promotions. */
2436 nargs = list_length (params);
2437 argarray = (tree *) alloca (nargs * sizeof (tree));
2438 nargs = convert_arguments (nargs, argarray, TYPE_ARG_TYPES (fntype),
2439 params, function, fundecl);
2441 return error_mark_node;
2443 /* Check that arguments to builtin functions match the expectations. */
2445 && DECL_BUILT_IN (fundecl)
2446 && DECL_BUILT_IN_CLASS (fundecl) == BUILT_IN_NORMAL
2447 && !check_builtin_function_arguments (fundecl, nargs, argarray))
2448 return error_mark_node;
2450 /* Check that the arguments to the function are valid. */
2451 check_function_arguments (TYPE_ATTRIBUTES (fntype), nargs, argarray,
2452 TYPE_ARG_TYPES (fntype));
2454 if (require_constant_value)
2456 result = fold_build_call_array_initializer (TREE_TYPE (fntype),
2457 function, nargs, argarray);
2458 if (TREE_CONSTANT (result)
2459 && (name == NULL_TREE
2460 || strncmp (IDENTIFIER_POINTER (name), "__builtin_", 10) != 0))
2461 pedwarn_init (0, "initializer element is not constant");
2464 result = fold_build_call_array (TREE_TYPE (fntype),
2465 function, nargs, argarray);
2467 if (VOID_TYPE_P (TREE_TYPE (result)))
2469 return require_complete_type (result);
2472 /* Convert the argument expressions in the list VALUES
2473 to the types in the list TYPELIST. The resulting arguments are
2474 stored in the array ARGARRAY which has size NARGS.
2476 If TYPELIST is exhausted, or when an element has NULL as its type,
2477 perform the default conversions.
2479 PARMLIST is the chain of parm decls for the function being called.
2480 It may be 0, if that info is not available.
2481 It is used only for generating error messages.
2483 FUNCTION is a tree for the called function. It is used only for
2484 error messages, where it is formatted with %qE.
2486 This is also where warnings about wrong number of args are generated.
2488 VALUES is a chain of TREE_LIST nodes with the elements of the list
2489 in the TREE_VALUE slots of those nodes.
2491 Returns the actual number of arguments processed (which may be less
2492 than NARGS in some error situations), or -1 on failure. */
2495 convert_arguments (int nargs, tree *argarray,
2496 tree typelist, tree values, tree function, tree fundecl)
2498 tree typetail, valtail;
2500 const bool type_generic = fundecl
2501 && lookup_attribute ("type generic", TYPE_ATTRIBUTES(TREE_TYPE (fundecl)));
2504 /* Change pointer to function to the function itself for
2506 if (TREE_CODE (function) == ADDR_EXPR
2507 && TREE_CODE (TREE_OPERAND (function, 0)) == FUNCTION_DECL)
2508 function = TREE_OPERAND (function, 0);
2510 /* Handle an ObjC selector specially for diagnostics. */
2511 selector = objc_message_selector ();
2513 /* Scan the given expressions and types, producing individual
2514 converted arguments and storing them in ARGARRAY. */
2516 for (valtail = values, typetail = typelist, parmnum = 0;
2518 valtail = TREE_CHAIN (valtail), parmnum++)
2520 tree type = typetail ? TREE_VALUE (typetail) : 0;
2521 tree val = TREE_VALUE (valtail);
2522 tree rname = function;
2523 int argnum = parmnum + 1;
2524 const char *invalid_func_diag;
2526 if (type == void_type_node)
2528 error ("too many arguments to function %qE", function);
2532 if (selector && argnum > 2)
2538 STRIP_TYPE_NOPS (val);
2540 val = require_complete_type (val);
2544 /* Formal parm type is specified by a function prototype. */
2547 if (type == error_mark_node || !COMPLETE_TYPE_P (type))
2549 error ("type of formal parameter %d is incomplete", parmnum + 1);
2554 /* Optionally warn about conversions that
2555 differ from the default conversions. */
2556 if (warn_traditional_conversion || warn_traditional)
2558 unsigned int formal_prec = TYPE_PRECISION (type);
2560 if (INTEGRAL_TYPE_P (type)
2561 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
2562 warning (0, "passing argument %d of %qE as integer "
2563 "rather than floating due to prototype",
2565 if (INTEGRAL_TYPE_P (type)
2566 && TREE_CODE (TREE_TYPE (val)) == COMPLEX_TYPE)
2567 warning (0, "passing argument %d of %qE as integer "
2568 "rather than complex due to prototype",
2570 else if (TREE_CODE (type) == COMPLEX_TYPE
2571 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
2572 warning (0, "passing argument %d of %qE as complex "
2573 "rather than floating due to prototype",
2575 else if (TREE_CODE (type) == REAL_TYPE
2576 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
2577 warning (0, "passing argument %d of %qE as floating "
2578 "rather than integer due to prototype",
2580 else if (TREE_CODE (type) == COMPLEX_TYPE
2581 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
2582 warning (0, "passing argument %d of %qE as complex "
2583 "rather than integer due to prototype",
2585 else if (TREE_CODE (type) == REAL_TYPE
2586 && TREE_CODE (TREE_TYPE (val)) == COMPLEX_TYPE)
2587 warning (0, "passing argument %d of %qE as floating "
2588 "rather than complex due to prototype",
2590 /* ??? At some point, messages should be written about
2591 conversions between complex types, but that's too messy
2593 else if (TREE_CODE (type) == REAL_TYPE
2594 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
2596 /* Warn if any argument is passed as `float',
2597 since without a prototype it would be `double'. */
2598 if (formal_prec == TYPE_PRECISION (float_type_node)
2599 && type != dfloat32_type_node)
2600 warning (0, "passing argument %d of %qE as %<float%> "
2601 "rather than %<double%> due to prototype",
2604 /* Warn if mismatch between argument and prototype
2605 for decimal float types. Warn of conversions with
2606 binary float types and of precision narrowing due to
2608 else if (type != TREE_TYPE (val)
2609 && (type == dfloat32_type_node
2610 || type == dfloat64_type_node
2611 || type == dfloat128_type_node
2612 || TREE_TYPE (val) == dfloat32_type_node
2613 || TREE_TYPE (val) == dfloat64_type_node
2614 || TREE_TYPE (val) == dfloat128_type_node)
2616 <= TYPE_PRECISION (TREE_TYPE (val))
2617 || (type == dfloat128_type_node
2619 != dfloat64_type_node
2621 != dfloat32_type_node)))
2622 || (type == dfloat64_type_node
2624 != dfloat32_type_node))))
2625 warning (0, "passing argument %d of %qE as %qT "
2626 "rather than %qT due to prototype",
2627 argnum, rname, type, TREE_TYPE (val));
2630 /* Detect integer changing in width or signedness.
2631 These warnings are only activated with
2632 -Wtraditional-conversion, not with -Wtraditional. */
2633 else if (warn_traditional_conversion && INTEGRAL_TYPE_P (type)
2634 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
2636 tree would_have_been = default_conversion (val);
2637 tree type1 = TREE_TYPE (would_have_been);
2639 if (TREE_CODE (type) == ENUMERAL_TYPE
2640 && (TYPE_MAIN_VARIANT (type)
2641 == TYPE_MAIN_VARIANT (TREE_TYPE (val))))
2642 /* No warning if function asks for enum
2643 and the actual arg is that enum type. */
2645 else if (formal_prec != TYPE_PRECISION (type1))
2646 warning (OPT_Wtraditional_conversion, "passing argument %d of %qE "
2647 "with different width due to prototype",
2649 else if (TYPE_UNSIGNED (type) == TYPE_UNSIGNED (type1))
2651 /* Don't complain if the formal parameter type
2652 is an enum, because we can't tell now whether
2653 the value was an enum--even the same enum. */
2654 else if (TREE_CODE (type) == ENUMERAL_TYPE)
2656 else if (TREE_CODE (val) == INTEGER_CST
2657 && int_fits_type_p (val, type))
2658 /* Change in signedness doesn't matter
2659 if a constant value is unaffected. */
2661 /* If the value is extended from a narrower
2662 unsigned type, it doesn't matter whether we
2663 pass it as signed or unsigned; the value
2664 certainly is the same either way. */
2665 else if (TYPE_PRECISION (TREE_TYPE (val)) < TYPE_PRECISION (type)
2666 && TYPE_UNSIGNED (TREE_TYPE (val)))
2668 else if (TYPE_UNSIGNED (type))
2669 warning (OPT_Wtraditional_conversion, "passing argument %d of %qE "
2670 "as unsigned due to prototype",
2673 warning (OPT_Wtraditional_conversion, "passing argument %d of %qE "
2674 "as signed due to prototype", argnum, rname);
2678 parmval = convert_for_assignment (type, val, ic_argpass,
2682 if (targetm.calls.promote_prototypes (fundecl ? TREE_TYPE (fundecl) : 0)
2683 && INTEGRAL_TYPE_P (type)
2684 && (TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node)))
2685 parmval = default_conversion (parmval);
2687 argarray[parmnum] = parmval;
2689 else if (TREE_CODE (TREE_TYPE (val)) == REAL_TYPE
2690 && (TYPE_PRECISION (TREE_TYPE (val))
2691 < TYPE_PRECISION (double_type_node))
2692 && !DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (val))))
2695 argarray[parmnum] = val;
2697 /* Convert `float' to `double'. */
2698 argarray[parmnum] = convert (double_type_node, val);
2700 else if ((invalid_func_diag =
2701 targetm.calls.invalid_arg_for_unprototyped_fn (typelist, fundecl, val)))
2703 error (invalid_func_diag);
2707 /* Convert `short' and `char' to full-size `int'. */
2708 argarray[parmnum] = default_conversion (val);
2711 typetail = TREE_CHAIN (typetail);
2714 gcc_assert (parmnum == nargs);
2716 if (typetail != 0 && TREE_VALUE (typetail) != void_type_node)
2718 error ("too few arguments to function %qE", function);
2725 /* This is the entry point used by the parser to build unary operators
2726 in the input. CODE, a tree_code, specifies the unary operator, and
2727 ARG is the operand. For unary plus, the C parser currently uses
2728 CONVERT_EXPR for code. */
2731 parser_build_unary_op (enum tree_code code, struct c_expr arg)
2733 struct c_expr result;
2735 result.original_code = ERROR_MARK;
2736 result.value = build_unary_op (code, arg.value, 0);
2738 if (TREE_OVERFLOW_P (result.value) && !TREE_OVERFLOW_P (arg.value))
2739 overflow_warning (result.value);
2744 /* This is the entry point used by the parser to build binary operators
2745 in the input. CODE, a tree_code, specifies the binary operator, and
2746 ARG1 and ARG2 are the operands. In addition to constructing the
2747 expression, we check for operands that were written with other binary
2748 operators in a way that is likely to confuse the user. */
2751 parser_build_binary_op (enum tree_code code, struct c_expr arg1,
2754 struct c_expr result;
2756 enum tree_code code1 = arg1.original_code;
2757 enum tree_code code2 = arg2.original_code;
2759 result.value = build_binary_op (code, arg1.value, arg2.value, 1);
2760 result.original_code = code;
2762 if (TREE_CODE (result.value) == ERROR_MARK)
2765 /* Check for cases such as x+y<<z which users are likely
2767 if (warn_parentheses)
2768 warn_about_parentheses (code, code1, code2);
2770 if (TREE_CODE_CLASS (code1) != tcc_comparison)
2771 warn_logical_operator (code, arg1.value, arg2.value);
2773 /* Warn about comparisons against string literals, with the exception
2774 of testing for equality or inequality of a string literal with NULL. */
2775 if (code == EQ_EXPR || code == NE_EXPR)
2777 if ((code1 == STRING_CST && !integer_zerop (arg2.value))
2778 || (code2 == STRING_CST && !integer_zerop (arg1.value)))
2779 warning (OPT_Waddress, "comparison with string literal results in unspecified behavior");
2781 else if (TREE_CODE_CLASS (code) == tcc_comparison
2782 && (code1 == STRING_CST || code2 == STRING_CST))
2783 warning (OPT_Waddress, "comparison with string literal results in unspecified behavior");
2785 if (TREE_OVERFLOW_P (result.value)
2786 && !TREE_OVERFLOW_P (arg1.value)
2787 && !TREE_OVERFLOW_P (arg2.value))
2788 overflow_warning (result.value);
2793 /* Return a tree for the difference of pointers OP0 and OP1.
2794 The resulting tree has type int. */
2797 pointer_diff (tree op0, tree op1)
2799 tree restype = ptrdiff_type_node;
2801 tree target_type = TREE_TYPE (TREE_TYPE (op0));
2802 tree con0, con1, lit0, lit1;
2803 tree orig_op1 = op1;
2805 if (TREE_CODE (target_type) == VOID_TYPE)
2806 pedwarn (pedantic ? OPT_pedantic : OPT_Wpointer_arith,
2807 "pointer of type %<void *%> used in subtraction");
2808 if (TREE_CODE (target_type) == FUNCTION_TYPE)
2809 pedwarn (pedantic ? OPT_pedantic : OPT_Wpointer_arith,
2810 "pointer to a function used in subtraction");
2812 /* If the conversion to ptrdiff_type does anything like widening or
2813 converting a partial to an integral mode, we get a convert_expression
2814 that is in the way to do any simplifications.
2815 (fold-const.c doesn't know that the extra bits won't be needed.
2816 split_tree uses STRIP_SIGN_NOPS, which leaves conversions to a
2817 different mode in place.)
2818 So first try to find a common term here 'by hand'; we want to cover
2819 at least the cases that occur in legal static initializers. */
2820 if (CONVERT_EXPR_P (op0)
2821 && (TYPE_PRECISION (TREE_TYPE (op0))
2822 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op0, 0)))))
2823 con0 = TREE_OPERAND (op0, 0);
2826 if (CONVERT_EXPR_P (op1)
2827 && (TYPE_PRECISION (TREE_TYPE (op1))
2828 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op1, 0)))))
2829 con1 = TREE_OPERAND (op1, 0);
2833 if (TREE_CODE (con0) == PLUS_EXPR)
2835 lit0 = TREE_OPERAND (con0, 1);
2836 con0 = TREE_OPERAND (con0, 0);
2839 lit0 = integer_zero_node;
2841 if (TREE_CODE (con1) == PLUS_EXPR)
2843 lit1 = TREE_OPERAND (con1, 1);
2844 con1 = TREE_OPERAND (con1, 0);
2847 lit1 = integer_zero_node;
2849 if (operand_equal_p (con0, con1, 0))
2856 /* First do the subtraction as integers;
2857 then drop through to build the divide operator.
2858 Do not do default conversions on the minus operator
2859 in case restype is a short type. */
2861 op0 = build_binary_op (MINUS_EXPR, convert (restype, op0),
2862 convert (restype, op1), 0);
2863 /* This generates an error if op1 is pointer to incomplete type. */
2864 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (TREE_TYPE (orig_op1))))
2865 error ("arithmetic on pointer to an incomplete type");
2867 /* This generates an error if op0 is pointer to incomplete type. */
2868 op1 = c_size_in_bytes (target_type);
2870 /* Divide by the size, in easiest possible way. */
2871 return fold_build2 (EXACT_DIV_EXPR, restype, op0, convert (restype, op1));
2874 /* Construct and perhaps optimize a tree representation
2875 for a unary operation. CODE, a tree_code, specifies the operation
2876 and XARG is the operand.
2877 For any CODE other than ADDR_EXPR, FLAG nonzero suppresses
2878 the default promotions (such as from short to int).
2879 For ADDR_EXPR, the default promotions are not applied; FLAG nonzero
2880 allows non-lvalues; this is only used to handle conversion of non-lvalue
2881 arrays to pointers in C99. */
2884 build_unary_op (enum tree_code code, tree xarg, int flag)
2886 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
2889 enum tree_code typecode;
2891 int noconvert = flag;
2892 const char *invalid_op_diag;
2894 if (code != ADDR_EXPR)
2895 arg = require_complete_type (arg);
2897 typecode = TREE_CODE (TREE_TYPE (arg));
2898 if (typecode == ERROR_MARK)
2899 return error_mark_node;
2900 if (typecode == ENUMERAL_TYPE || typecode == BOOLEAN_TYPE)
2901 typecode = INTEGER_TYPE;
2903 if ((invalid_op_diag
2904 = targetm.invalid_unary_op (code, TREE_TYPE (xarg))))
2906 error (invalid_op_diag);
2907 return error_mark_node;
2913 /* This is used for unary plus, because a CONVERT_EXPR
2914 is enough to prevent anybody from looking inside for
2915 associativity, but won't generate any code. */
2916 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2917 || typecode == FIXED_POINT_TYPE || typecode == COMPLEX_TYPE
2918 || typecode == VECTOR_TYPE))
2920 error ("wrong type argument to unary plus");
2921 return error_mark_node;
2923 else if (!noconvert)
2924 arg = default_conversion (arg);
2925 arg = non_lvalue (arg);
2929 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2930 || typecode == FIXED_POINT_TYPE || typecode == COMPLEX_TYPE
2931 || typecode == VECTOR_TYPE))
2933 error ("wrong type argument to unary minus");
2934 return error_mark_node;
2936 else if (!noconvert)
2937 arg = default_conversion (arg);
2941 /* ~ works on integer types and non float vectors. */
2942 if (typecode == INTEGER_TYPE
2943 || (typecode == VECTOR_TYPE
2944 && !VECTOR_FLOAT_TYPE_P (TREE_TYPE (arg))))
2947 arg = default_conversion (arg);
2949 else if (typecode == COMPLEX_TYPE)
2952 pedwarn (OPT_pedantic,
2953 "ISO C does not support %<~%> for complex conjugation");
2955 arg = default_conversion (arg);
2959 error ("wrong type argument to bit-complement");
2960 return error_mark_node;
2965 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE))
2967 error ("wrong type argument to abs");
2968 return error_mark_node;
2970 else if (!noconvert)
2971 arg = default_conversion (arg);
2975 /* Conjugating a real value is a no-op, but allow it anyway. */
2976 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2977 || typecode == COMPLEX_TYPE))
2979 error ("wrong type argument to conjugation");
2980 return error_mark_node;
2982 else if (!noconvert)
2983 arg = default_conversion (arg);
2986 case TRUTH_NOT_EXPR:
2987 if (typecode != INTEGER_TYPE && typecode != FIXED_POINT_TYPE
2988 && typecode != REAL_TYPE && typecode != POINTER_TYPE
2989 && typecode != COMPLEX_TYPE)
2991 error ("wrong type argument to unary exclamation mark");
2992 return error_mark_node;
2994 arg = c_objc_common_truthvalue_conversion (arg);
2995 return invert_truthvalue (arg);
2998 if (TREE_CODE (arg) == COMPLEX_CST)
2999 return TREE_REALPART (arg);
3000 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
3001 return fold_build1 (REALPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg);
3006 if (TREE_CODE (arg) == COMPLEX_CST)
3007 return TREE_IMAGPART (arg);
3008 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
3009 return fold_build1 (IMAGPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg);
3011 return convert (TREE_TYPE (arg), integer_zero_node);
3013 case PREINCREMENT_EXPR:
3014 case POSTINCREMENT_EXPR:
3015 case PREDECREMENT_EXPR:
3016 case POSTDECREMENT_EXPR:
3018 /* Increment or decrement the real part of the value,
3019 and don't change the imaginary part. */
3020 if (typecode == COMPLEX_TYPE)
3024 pedwarn (OPT_pedantic, "ISO C does not support %<++%> and %<--%>"
3025 " on complex types");
3027 arg = stabilize_reference (arg);
3028 real = build_unary_op (REALPART_EXPR, arg, 1);
3029 imag = build_unary_op (IMAGPART_EXPR, arg, 1);
3030 real = build_unary_op (code, real, 1);
3031 if (real == error_mark_node || imag == error_mark_node)
3032 return error_mark_node;
3033 return build2 (COMPLEX_EXPR, TREE_TYPE (arg),
3037 /* Report invalid types. */
3039 if (typecode != POINTER_TYPE && typecode != FIXED_POINT_TYPE
3040 && typecode != INTEGER_TYPE && typecode != REAL_TYPE)
3042 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
3043 error ("wrong type argument to increment");
3045 error ("wrong type argument to decrement");
3047 return error_mark_node;
3052 tree result_type = TREE_TYPE (arg);
3054 arg = get_unwidened (arg, 0);
3055 argtype = TREE_TYPE (arg);
3057 /* Compute the increment. */
3059 if (typecode == POINTER_TYPE)
3061 /* If pointer target is an undefined struct,
3062 we just cannot know how to do the arithmetic. */
3063 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (result_type)))
3065 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
3066 error ("increment of pointer to unknown structure");
3068 error ("decrement of pointer to unknown structure");
3070 else if (TREE_CODE (TREE_TYPE (result_type)) == FUNCTION_TYPE
3071 || TREE_CODE (TREE_TYPE (result_type)) == VOID_TYPE)
3073 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
3074 pedwarn (pedantic ? OPT_pedantic : OPT_Wpointer_arith,
3075 "wrong type argument to increment");
3077 pedwarn (pedantic ? OPT_pedantic : OPT_Wpointer_arith,
3078 "wrong type argument to decrement");
3081 inc = c_size_in_bytes (TREE_TYPE (result_type));
3082 inc = fold_convert (sizetype, inc);
3084 else if (FRACT_MODE_P (TYPE_MODE (result_type)))
3086 /* For signed fract types, we invert ++ to -- or
3087 -- to ++, and change inc from 1 to -1, because
3088 it is not possible to represent 1 in signed fract constants.
3089 For unsigned fract types, the result always overflows and
3090 we get an undefined (original) or the maximum value. */
3091 if (code == PREINCREMENT_EXPR)
3092 code = PREDECREMENT_EXPR;
3093 else if (code == PREDECREMENT_EXPR)
3094 code = PREINCREMENT_EXPR;
3095 else if (code == POSTINCREMENT_EXPR)
3096 code = POSTDECREMENT_EXPR;
3097 else /* code == POSTDECREMENT_EXPR */
3098 code = POSTINCREMENT_EXPR;
3100 inc = integer_minus_one_node;
3101 inc = convert (argtype, inc);
3105 inc = integer_one_node;
3106 inc = convert (argtype, inc);
3109 /* Complain about anything else that is not a true lvalue. */
3110 if (!lvalue_or_else (arg, ((code == PREINCREMENT_EXPR
3111 || code == POSTINCREMENT_EXPR)
3114 return error_mark_node;
3116 /* Report a read-only lvalue. */
3117 if (TREE_READONLY (arg))
3119 readonly_error (arg,
3120 ((code == PREINCREMENT_EXPR
3121 || code == POSTINCREMENT_EXPR)
3122 ? lv_increment : lv_decrement));
3123 return error_mark_node;
3126 if (TREE_CODE (TREE_TYPE (arg)) == BOOLEAN_TYPE)
3127 val = boolean_increment (code, arg);
3129 val = build2 (code, TREE_TYPE (arg), arg, inc);
3130 TREE_SIDE_EFFECTS (val) = 1;
3131 val = convert (result_type, val);
3132 if (TREE_CODE (val) != code)
3133 TREE_NO_WARNING (val) = 1;
3138 /* Note that this operation never does default_conversion. */
3140 /* Let &* cancel out to simplify resulting code. */
3141 if (TREE_CODE (arg) == INDIRECT_REF)
3143 /* Don't let this be an lvalue. */
3144 if (lvalue_p (TREE_OPERAND (arg, 0)))
3145 return non_lvalue (TREE_OPERAND (arg, 0));
3146 return TREE_OPERAND (arg, 0);
3149 /* For &x[y], return x+y */
3150 if (TREE_CODE (arg) == ARRAY_REF)
3152 tree op0 = TREE_OPERAND (arg, 0);
3153 if (!c_mark_addressable (op0))
3154 return error_mark_node;
3155 return build_binary_op (PLUS_EXPR,
3156 (TREE_CODE (TREE_TYPE (op0)) == ARRAY_TYPE
3157 ? array_to_pointer_conversion (op0)
3159 TREE_OPERAND (arg, 1), 1);
3162 /* Anything not already handled and not a true memory reference
3163 or a non-lvalue array is an error. */
3164 else if (typecode != FUNCTION_TYPE && !flag
3165 && !lvalue_or_else (arg, lv_addressof))
3166 return error_mark_node;
3168 /* Ordinary case; arg is a COMPONENT_REF or a decl. */
3169 argtype = TREE_TYPE (arg);
3171 /* If the lvalue is const or volatile, merge that into the type
3172 to which the address will point. Note that you can't get a
3173 restricted pointer by taking the address of something, so we
3174 only have to deal with `const' and `volatile' here. */
3175 if ((DECL_P (arg) || REFERENCE_CLASS_P (arg))
3176 && (TREE_READONLY (arg) || TREE_THIS_VOLATILE (arg)))
3177 argtype = c_build_type_variant (argtype,
3178 TREE_READONLY (arg),
3179 TREE_THIS_VOLATILE (arg));
3181 if (!c_mark_addressable (arg))
3182 return error_mark_node;
3184 gcc_assert (TREE_CODE (arg) != COMPONENT_REF
3185 || !DECL_C_BIT_FIELD (TREE_OPERAND (arg, 1)));
3187 argtype = build_pointer_type (argtype);
3189 /* ??? Cope with user tricks that amount to offsetof. Delete this
3190 when we have proper support for integer constant expressions. */
3191 val = get_base_address (arg);
3192 if (val && TREE_CODE (val) == INDIRECT_REF
3193 && TREE_CONSTANT (TREE_OPERAND (val, 0)))
3195 tree op0 = fold_convert (sizetype, fold_offsetof (arg, val)), op1;
3197 op1 = fold_convert (argtype, TREE_OPERAND (val, 0));
3198 return fold_build2 (POINTER_PLUS_EXPR, argtype, op1, op0);
3201 val = build1 (ADDR_EXPR, argtype, arg);
3210 argtype = TREE_TYPE (arg);
3211 return require_constant_value ? fold_build1_initializer (code, argtype, arg)
3212 : fold_build1 (code, argtype, arg);
3215 /* Return nonzero if REF is an lvalue valid for this language.
3216 Lvalues can be assigned, unless their type has TYPE_READONLY.
3217 Lvalues can have their address taken, unless they have C_DECL_REGISTER. */
3220 lvalue_p (const_tree ref)
3222 const enum tree_code code = TREE_CODE (ref);
3229 return lvalue_p (TREE_OPERAND (ref, 0));
3231 case COMPOUND_LITERAL_EXPR:
3241 return (TREE_CODE (TREE_TYPE (ref)) != FUNCTION_TYPE
3242 && TREE_CODE (TREE_TYPE (ref)) != METHOD_TYPE);
3245 return TREE_CODE (TREE_TYPE (ref)) == ARRAY_TYPE;
3252 /* Give an error for storing in something that is 'const'. */
3255 readonly_error (tree arg, enum lvalue_use use)
3257 gcc_assert (use == lv_assign || use == lv_increment || use == lv_decrement
3259 /* Using this macro rather than (for example) arrays of messages
3260 ensures that all the format strings are checked at compile
3262 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
3263 : (use == lv_increment ? (I) \
3264 : (use == lv_decrement ? (D) : (AS))))
3265 if (TREE_CODE (arg) == COMPONENT_REF)
3267 if (TYPE_READONLY (TREE_TYPE (TREE_OPERAND (arg, 0))))
3268 readonly_error (TREE_OPERAND (arg, 0), use);
3270 error (READONLY_MSG (G_("assignment of read-only member %qD"),
3271 G_("increment of read-only member %qD"),
3272 G_("decrement of read-only member %qD"),
3273 G_("read-only member %qD used as %<asm%> output")),
3274 TREE_OPERAND (arg, 1));
3276 else if (TREE_CODE (arg) == VAR_DECL)
3277 error (READONLY_MSG (G_("assignment of read-only variable %qD"),
3278 G_("increment of read-only variable %qD"),
3279 G_("decrement of read-only variable %qD"),
3280 G_("read-only variable %qD used as %<asm%> output")),
3283 error (READONLY_MSG (G_("assignment of read-only location %qE"),
3284 G_("increment of read-only location %qE"),
3285 G_("decrement of read-only location %qE"),
3286 G_("read-only location %qE used as %<asm%> output")),
3291 /* Return nonzero if REF is an lvalue valid for this language;
3292 otherwise, print an error message and return zero. USE says
3293 how the lvalue is being used and so selects the error message. */
3296 lvalue_or_else (const_tree ref, enum lvalue_use use)
3298 int win = lvalue_p (ref);
3306 /* Mark EXP saying that we need to be able to take the
3307 address of it; it should not be allocated in a register.
3308 Returns true if successful. */
3311 c_mark_addressable (tree exp)
3316 switch (TREE_CODE (x))
3319 if (DECL_C_BIT_FIELD (TREE_OPERAND (x, 1)))
3322 ("cannot take address of bit-field %qD", TREE_OPERAND (x, 1));
3326 /* ... fall through ... */
3332 x = TREE_OPERAND (x, 0);
3335 case COMPOUND_LITERAL_EXPR:
3337 TREE_ADDRESSABLE (x) = 1;
3344 if (C_DECL_REGISTER (x)
3345 && DECL_NONLOCAL (x))
3347 if (TREE_PUBLIC (x) || TREE_STATIC (x) || DECL_EXTERNAL (x))
3350 ("global register variable %qD used in nested function", x);
3353 pedwarn (0, "register variable %qD used in nested function", x);
3355 else if (C_DECL_REGISTER (x))
3357 if (TREE_PUBLIC (x) || TREE_STATIC (x) || DECL_EXTERNAL (x))
3358 error ("address of global register variable %qD requested", x);
3360 error ("address of register variable %qD requested", x);
3366 TREE_ADDRESSABLE (x) = 1;
3373 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
3376 build_conditional_expr (tree ifexp, tree op1, tree op2)
3380 enum tree_code code1;
3381 enum tree_code code2;
3382 tree result_type = NULL;
3383 tree orig_op1 = op1, orig_op2 = op2;
3385 /* Promote both alternatives. */
3387 if (TREE_CODE (TREE_TYPE (op1)) != VOID_TYPE)
3388 op1 = default_conversion (op1);
3389 if (TREE_CODE (TREE_TYPE (op2)) != VOID_TYPE)
3390 op2 = default_conversion (op2);
3392 if (TREE_CODE (ifexp) == ERROR_MARK
3393 || TREE_CODE (TREE_TYPE (op1)) == ERROR_MARK
3394 || TREE_CODE (TREE_TYPE (op2)) == ERROR_MARK)
3395 return error_mark_node;
3397 type1 = TREE_TYPE (op1);
3398 code1 = TREE_CODE (type1);
3399 type2 = TREE_TYPE (op2);
3400 code2 = TREE_CODE (type2);
3402 /* C90 does not permit non-lvalue arrays in conditional expressions.
3403 In C99 they will be pointers by now. */
3404 if (code1 == ARRAY_TYPE || code2 == ARRAY_TYPE)
3406 error ("non-lvalue array in conditional expression");
3407 return error_mark_node;
3410 /* Quickly detect the usual case where op1 and op2 have the same type
3412 if (TYPE_MAIN_VARIANT (type1) == TYPE_MAIN_VARIANT (type2))
3415 result_type = type1;
3417 result_type = TYPE_MAIN_VARIANT (type1);
3419 else if ((code1 == INTEGER_TYPE || code1 == REAL_TYPE
3420 || code1 == COMPLEX_TYPE)
3421 && (code2 == INTEGER_TYPE || code2 == REAL_TYPE
3422 || code2 == COMPLEX_TYPE))
3424 result_type = c_common_type (type1, type2);
3426 /* If -Wsign-compare, warn here if type1 and type2 have
3427 different signedness. We'll promote the signed to unsigned
3428 and later code won't know it used to be different.
3429 Do this check on the original types, so that explicit casts
3430 will be considered, but default promotions won't. */
3431 if (warn_sign_compare && !skip_evaluation)
3433 int unsigned_op1 = TYPE_UNSIGNED (TREE_TYPE (orig_op1));
3434 int unsigned_op2 = TYPE_UNSIGNED (TREE_TYPE (orig_op2));
3436 if (unsigned_op1 ^ unsigned_op2)
3440 /* Do not warn if the result type is signed, since the
3441 signed type will only be chosen if it can represent
3442 all the values of the unsigned type. */
3443 if (!TYPE_UNSIGNED (result_type))
3445 /* Do not warn if the signed quantity is an unsuffixed
3446 integer literal (or some static constant expression
3447 involving such literals) and it is non-negative. */
3448 else if ((unsigned_op2
3449 && tree_expr_nonnegative_warnv_p (op1, &ovf))
3451 && tree_expr_nonnegative_warnv_p (op2, &ovf)))
3454 warning (OPT_Wsign_compare, "signed and unsigned type in conditional expression");
3458 else if (code1 == VOID_TYPE || code2 == VOID_TYPE)
3460 if (code1 != VOID_TYPE || code2 != VOID_TYPE)
3461 pedwarn (OPT_pedantic,
3462 "ISO C forbids conditional expr with only one void side");
3463 result_type = void_type_node;
3465 else if (code1 == POINTER_TYPE && code2 == POINTER_TYPE)
3467 if (comp_target_types (type1, type2))
3468 result_type = common_pointer_type (type1, type2);
3469 else if (null_pointer_constant_p (orig_op1))
3470 result_type = qualify_type (type2, type1);
3471 else if (null_pointer_constant_p (orig_op2))
3472 result_type = qualify_type (type1, type2);
3473 else if (VOID_TYPE_P (TREE_TYPE (type1)))
3475 if (TREE_CODE (TREE_TYPE (type2)) == FUNCTION_TYPE)
3476 pedwarn (OPT_pedantic, "ISO C forbids conditional expr between "
3477 "%<void *%> and function pointer");
3478 result_type = build_pointer_type (qualify_type (TREE_TYPE (type1),
3479 TREE_TYPE (type2)));
3481 else if (VOID_TYPE_P (TREE_TYPE (type2)))
3483 if (TREE_CODE (TREE_TYPE (type1)) == FUNCTION_TYPE)
3484 pedwarn (OPT_pedantic, "ISO C forbids conditional expr between "
3485 "%<void *%> and function pointer");
3486 result_type = build_pointer_type (qualify_type (TREE_TYPE (type2),
3487 TREE_TYPE (type1)));
3491 pedwarn (0, "pointer type mismatch in conditional expression");
3492 result_type = build_pointer_type (void_type_node);
3495 else if (code1 == POINTER_TYPE && code2 == INTEGER_TYPE)
3497 if (!null_pointer_constant_p (orig_op2))
3498 pedwarn (0, "pointer/integer type mismatch in conditional expression");
3501 op2 = null_pointer_node;
3503 result_type = type1;
3505 else if (code2 == POINTER_TYPE && code1 == INTEGER_TYPE)
3507 if (!null_pointer_constant_p (orig_op1))
3508 pedwarn (0, "pointer/integer type mismatch in conditional expression");
3511 op1 = null_pointer_node;
3513 result_type = type2;
3518 if (flag_cond_mismatch)
3519 result_type = void_type_node;
3522 error ("type mismatch in conditional expression");
3523 return error_mark_node;
3527 /* Merge const and volatile flags of the incoming types. */
3529 = build_type_variant (result_type,
3530 TREE_READONLY (op1) || TREE_READONLY (op2),
3531 TREE_THIS_VOLATILE (op1) || TREE_THIS_VOLATILE (op2));
3533 if (result_type != TREE_TYPE (op1))
3534 op1 = convert_and_check (result_type, op1);
3535 if (result_type != TREE_TYPE (op2))
3536 op2 = convert_and_check (result_type, op2);
3538 return fold_build3 (COND_EXPR, result_type, ifexp, op1, op2);
3541 /* Return a compound expression that performs two expressions and
3542 returns the value of the second of them. */
3545 build_compound_expr (tree expr1, tree expr2)
3547 if (!TREE_SIDE_EFFECTS (expr1))
3549 /* The left-hand operand of a comma expression is like an expression
3550 statement: with -Wunused, we should warn if it doesn't have
3551 any side-effects, unless it was explicitly cast to (void). */
3552 if (warn_unused_value)
3554 if (VOID_TYPE_P (TREE_TYPE (expr1))
3555 && CONVERT_EXPR_P (expr1))
3557 else if (VOID_TYPE_P (TREE_TYPE (expr1))
3558 && TREE_CODE (expr1) == COMPOUND_EXPR
3559 && CONVERT_EXPR_P (TREE_OPERAND (expr1, 1)))
3560 ; /* (void) a, (void) b, c */
3562 warning (OPT_Wunused_value,
3563 "left-hand operand of comma expression has no effect");
3567 /* With -Wunused, we should also warn if the left-hand operand does have
3568 side-effects, but computes a value which is not used. For example, in
3569 `foo() + bar(), baz()' the result of the `+' operator is not used,
3570 so we should issue a warning. */
3571 else if (warn_unused_value)
3572 warn_if_unused_value (expr1, input_location);
3574 if (expr2 == error_mark_node)
3575 return error_mark_node;
3577 return build2 (COMPOUND_EXPR, TREE_TYPE (expr2), expr1, expr2);
3580 /* Build an expression representing a cast to type TYPE of expression EXPR. */
3583 build_c_cast (tree type, tree expr)
3587 if (type == error_mark_node || expr == error_mark_node)
3588 return error_mark_node;
3590 /* The ObjC front-end uses TYPE_MAIN_VARIANT to tie together types differing
3591 only in <protocol> qualifications. But when constructing cast expressions,
3592 the protocols do matter and must be kept around. */
3593 if (objc_is_object_ptr (type) && objc_is_object_ptr (TREE_TYPE (expr)))
3594 return build1 (NOP_EXPR, type, expr);
3596 type = TYPE_MAIN_VARIANT (type);
3598 if (TREE_CODE (type) == ARRAY_TYPE)
3600 error ("cast specifies array type");
3601 return error_mark_node;
3604 if (TREE_CODE (type) == FUNCTION_TYPE)
3606 error ("cast specifies function type");
3607 return error_mark_node;
3610 if (!VOID_TYPE_P (type))
3612 value = require_complete_type (value);
3613 if (value == error_mark_node)
3614 return error_mark_node;
3617 if (type == TYPE_MAIN_VARIANT (TREE_TYPE (value)))
3619 if (TREE_CODE (type) == RECORD_TYPE
3620 || TREE_CODE (type) == UNION_TYPE)
3621 pedwarn (OPT_pedantic,
3622 "ISO C forbids casting nonscalar to the same type");
3624 else if (TREE_CODE (type) == UNION_TYPE)
3628 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
3629 if (TREE_TYPE (field) != error_mark_node
3630 && comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (field)),
3631 TYPE_MAIN_VARIANT (TREE_TYPE (value))))
3638 pedwarn (OPT_pedantic, "ISO C forbids casts to union type");
3639 t = digest_init (type,
3640 build_constructor_single (type, field, value),
3642 TREE_CONSTANT (t) = TREE_CONSTANT (value);
3645 error ("cast to union type from type not present in union");
3646 return error_mark_node;
3652 if (type == void_type_node)
3653 return build1 (CONVERT_EXPR, type, value);
3655 otype = TREE_TYPE (value);
3657 /* Optionally warn about potentially worrisome casts. */
3660 && TREE_CODE (type) == POINTER_TYPE
3661 && TREE_CODE (otype) == POINTER_TYPE)
3663 tree in_type = type;
3664 tree in_otype = otype;
3668 /* Check that the qualifiers on IN_TYPE are a superset of
3669 the qualifiers of IN_OTYPE. The outermost level of
3670 POINTER_TYPE nodes is uninteresting and we stop as soon
3671 as we hit a non-POINTER_TYPE node on either type. */
3674 in_otype = TREE_TYPE (in_otype);
3675 in_type = TREE_TYPE (in_type);
3677 /* GNU C allows cv-qualified function types. 'const'
3678 means the function is very pure, 'volatile' means it
3679 can't return. We need to warn when such qualifiers
3680 are added, not when they're taken away. */
3681 if (TREE_CODE (in_otype) == FUNCTION_TYPE
3682 && TREE_CODE (in_type) == FUNCTION_TYPE)
3683 added |= (TYPE_QUALS (in_type) & ~TYPE_QUALS (in_otype));
3685 discarded |= (TYPE_QUALS (in_otype) & ~TYPE_QUALS (in_type));
3687 while (TREE_CODE (in_type) == POINTER_TYPE
3688 && TREE_CODE (in_otype) == POINTER_TYPE);
3691 warning (OPT_Wcast_qual, "cast adds new qualifiers to function type");
3694 /* There are qualifiers present in IN_OTYPE that are not
3695 present in IN_TYPE. */
3696 warning (OPT_Wcast_qual, "cast discards qualifiers from pointer target type");
3699 /* Warn about possible alignment problems. */
3700 if (STRICT_ALIGNMENT
3701 && TREE_CODE (type) == POINTER_TYPE
3702 && TREE_CODE (otype) == POINTER_TYPE
3703 && TREE_CODE (TREE_TYPE (otype)) != VOID_TYPE
3704 && TREE_CODE (TREE_TYPE (otype)) != FUNCTION_TYPE
3705 /* Don't warn about opaque types, where the actual alignment
3706 restriction is unknown. */
3707 && !((TREE_CODE (TREE_TYPE (otype)) == UNION_TYPE
3708 || TREE_CODE (TREE_TYPE (otype)) == RECORD_TYPE)
3709 && TYPE_MODE (TREE_TYPE (otype)) == VOIDmode)
3710 && TYPE_ALIGN (TREE_TYPE (type)) > TYPE_ALIGN (TREE_TYPE (otype)))
3711 warning (OPT_Wcast_align,
3712 "cast increases required alignment of target type");
3714 if (TREE_CODE (type) == INTEGER_TYPE
3715 && TREE_CODE (otype) == POINTER_TYPE
3716 && TYPE_PRECISION (type) != TYPE_PRECISION (otype))
3717 /* Unlike conversion of integers to pointers, where the
3718 warning is disabled for converting constants because
3719 of cases such as SIG_*, warn about converting constant
3720 pointers to integers. In some cases it may cause unwanted
3721 sign extension, and a warning is appropriate. */
3722 warning (OPT_Wpointer_to_int_cast,
3723 "cast from pointer to integer of different size");
3725 if (TREE_CODE (value) == CALL_EXPR
3726 && TREE_CODE (type) != TREE_CODE (otype))
3727 warning (OPT_Wbad_function_cast, "cast from function call of type %qT "
3728 "to non-matching type %qT", otype, type);
3730 if (TREE_CODE (type) == POINTER_TYPE
3731 && TREE_CODE (otype) == INTEGER_TYPE
3732 && TYPE_PRECISION (type) != TYPE_PRECISION (otype)
3733 /* Don't warn about converting any constant. */
3734 && !TREE_CONSTANT (value))
3735 warning (OPT_Wint_to_pointer_cast, "cast to pointer from integer "
3736 "of different size");
3738 if (warn_strict_aliasing <= 2)
3739 strict_aliasing_warning (otype, type, expr);
3741 /* If pedantic, warn for conversions between function and object
3742 pointer types, except for converting a null pointer constant
3743 to function pointer type. */
3745 && TREE_CODE (type) == POINTER_TYPE
3746 && TREE_CODE (otype) == POINTER_TYPE
3747 && TREE_CODE (TREE_TYPE (otype)) == FUNCTION_TYPE
3748 && TREE_CODE (TREE_TYPE (type)) != FUNCTION_TYPE)
3749 pedwarn (OPT_pedantic, "ISO C forbids "
3750 "conversion of function pointer to object pointer type");
3753 && TREE_CODE (type) == POINTER_TYPE
3754 && TREE_CODE (otype) == POINTER_TYPE
3755 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE
3756 && TREE_CODE (TREE_TYPE (otype)) != FUNCTION_TYPE
3757 && !null_pointer_constant_p (value))
3758 pedwarn (OPT_pedantic, "ISO C forbids "
3759 "conversion of object pointer to function pointer type");
3762 value = convert (type, value);
3764 /* Ignore any integer overflow caused by the cast. */
3765 if (TREE_CODE (value) == INTEGER_CST)
3767 if (CONSTANT_CLASS_P (ovalue) && TREE_OVERFLOW (ovalue))
3769 if (!TREE_OVERFLOW (value))
3771 /* Avoid clobbering a shared constant. */
3772 value = copy_node (value);
3773 TREE_OVERFLOW (value) = TREE_OVERFLOW (ovalue);
3776 else if (TREE_OVERFLOW (value))
3777 /* Reset VALUE's overflow flags, ensuring constant sharing. */
3778 value = build_int_cst_wide (TREE_TYPE (value),
3779 TREE_INT_CST_LOW (value),
3780 TREE_INT_CST_HIGH (value));
3784 /* Don't let a cast be an lvalue. */
3786 value = non_lvalue (value);
3791 /* Interpret a cast of expression EXPR to type TYPE. */
3793 c_cast_expr (struct c_type_name *type_name, tree expr)
3796 int saved_wsp = warn_strict_prototypes;
3798 /* This avoids warnings about unprototyped casts on
3799 integers. E.g. "#define SIG_DFL (void(*)())0". */
3800 if (TREE_CODE (expr) == INTEGER_CST)
3801 warn_strict_prototypes = 0;
3802 type = groktypename (type_name);
3803 warn_strict_prototypes = saved_wsp;
3805 return build_c_cast (type, expr);
3808 /* Build an assignment expression of lvalue LHS from value RHS.
3809 MODIFYCODE is the code for a binary operator that we use
3810 to combine the old value of LHS with RHS to get the new value.
3811 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment. */
3814 build_modify_expr (tree lhs, enum tree_code modifycode, tree rhs)
3818 tree lhstype = TREE_TYPE (lhs);
3819 tree olhstype = lhstype;
3821 /* Types that aren't fully specified cannot be used in assignments. */
3822 lhs = require_complete_type (lhs);
3824 /* Avoid duplicate error messages from operands that had errors. */
3825 if (TREE_CODE (lhs) == ERROR_MARK || TREE_CODE (rhs) == ERROR_MARK)
3826 return error_mark_node;
3828 if (!lvalue_or_else (lhs, lv_assign))
3829 return error_mark_node;
3831 STRIP_TYPE_NOPS (rhs);
3835 /* If a binary op has been requested, combine the old LHS value with the RHS
3836 producing the value we should actually store into the LHS. */
3838 if (modifycode != NOP_EXPR)
3840 lhs = stabilize_reference (lhs);
3841 newrhs = build_binary_op (modifycode, lhs, rhs, 1);
3844 /* Give an error for storing in something that is 'const'. */
3846 if (TREE_READONLY (lhs) || TYPE_READONLY (lhstype)
3847 || ((TREE_CODE (lhstype) == RECORD_TYPE
3848 || TREE_CODE (lhstype) == UNION_TYPE)
3849 && C_TYPE_FIELDS_READONLY (lhstype)))
3851 readonly_error (lhs, lv_assign);
3852 return error_mark_node;
3855 /* If storing into a structure or union member,
3856 it has probably been given type `int'.
3857 Compute the type that would go with
3858 the actual amount of storage the member occupies. */
3860 if (TREE_CODE (lhs) == COMPONENT_REF
3861 && (TREE_CODE (lhstype) == INTEGER_TYPE
3862 || TREE_CODE (lhstype) == BOOLEAN_TYPE
3863 || TREE_CODE (lhstype) == REAL_TYPE
3864 || TREE_CODE (lhstype) == ENUMERAL_TYPE))
3865 lhstype = TREE_TYPE (get_unwidened (lhs, 0));
3867 /* If storing in a field that is in actuality a short or narrower than one,
3868 we must store in the field in its actual type. */
3870 if (lhstype != TREE_TYPE (lhs))
3872 lhs = copy_node (lhs);
3873 TREE_TYPE (lhs) = lhstype;
3876 /* Convert new value to destination type. */
3878 newrhs = convert_for_assignment (lhstype, newrhs, ic_assign,
3879 NULL_TREE, NULL_TREE, 0);
3880 if (TREE_CODE (newrhs) == ERROR_MARK)
3881 return error_mark_node;
3883 /* Emit ObjC write barrier, if necessary. */
3884 if (c_dialect_objc () && flag_objc_gc)
3886 result = objc_generate_write_barrier (lhs, modifycode, newrhs);
3891 /* Scan operands. */
3893 result = build2 (MODIFY_EXPR, lhstype, lhs, newrhs);
3894 TREE_SIDE_EFFECTS (result) = 1;
3896 /* If we got the LHS in a different type for storing in,
3897 convert the result back to the nominal type of LHS
3898 so that the value we return always has the same type
3899 as the LHS argument. */
3901 if (olhstype == TREE_TYPE (result))
3903 return convert_for_assignment (olhstype, result, ic_assign,
3904 NULL_TREE, NULL_TREE, 0);
3907 /* Convert value RHS to type TYPE as preparation for an assignment
3908 to an lvalue of type TYPE.
3909 The real work of conversion is done by `convert'.
3910 The purpose of this function is to generate error messages
3911 for assignments that are not allowed in C.
3912 ERRTYPE says whether it is argument passing, assignment,
3913 initialization or return.
3915 FUNCTION is a tree for the function being called.
3916 PARMNUM is the number of the argument, for printing in error messages. */
3919 convert_for_assignment (tree type, tree rhs, enum impl_conv errtype,
3920 tree fundecl, tree function, int parmnum)
3922 enum tree_code codel = TREE_CODE (type);
3924 enum tree_code coder;
3925 tree rname = NULL_TREE;
3926 bool objc_ok = false;
3928 if (errtype == ic_argpass || errtype == ic_argpass_nonproto)
3931 /* Change pointer to function to the function itself for
3933 if (TREE_CODE (function) == ADDR_EXPR
3934 && TREE_CODE (TREE_OPERAND (function, 0)) == FUNCTION_DECL)
3935 function = TREE_OPERAND (function, 0);
3937 /* Handle an ObjC selector specially for diagnostics. */
3938 selector = objc_message_selector ();
3940 if (selector && parmnum > 2)
3947 /* This macro is used to emit diagnostics to ensure that all format
3948 strings are complete sentences, visible to gettext and checked at
3950 #define WARN_FOR_ASSIGNMENT(AR, AS, IN, RE) \
3955 pedwarn (0, AR, parmnum, rname); \
3957 case ic_argpass_nonproto: \
3958 warning (0, AR, parmnum, rname); \
3970 gcc_unreachable (); \
3974 STRIP_TYPE_NOPS (rhs);
3976 if (optimize && TREE_CODE (rhs) == VAR_DECL
3977 && TREE_CODE (TREE_TYPE (rhs)) != ARRAY_TYPE)
3978 rhs = decl_constant_value_for_broken_optimization (rhs);
3980 rhstype = TREE_TYPE (rhs);
3981 coder = TREE_CODE (rhstype);
3983 if (coder == ERROR_MARK)
3984 return error_mark_node;
3986 if (c_dialect_objc ())
4009 objc_ok = objc_compare_types (type, rhstype, parmno, rname);
4012 if (TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (rhstype))
4015 if (coder == VOID_TYPE)
4017 /* Except for passing an argument to an unprototyped function,
4018 this is a constraint violation. When passing an argument to
4019 an unprototyped function, it is compile-time undefined;
4020 making it a constraint in that case was rejected in
4022 error ("void value not ignored as it ought to be");
4023 return error_mark_node;
4025 rhs = require_complete_type (rhs);
4026 if (rhs == error_mark_node)
4027 return error_mark_node;
4028 /* A type converts to a reference to it.
4029 This code doesn't fully support references, it's just for the
4030 special case of va_start and va_copy. */
4031 if (codel == REFERENCE_TYPE
4032 && comptypes (TREE_TYPE (type), TREE_TYPE (rhs)) == 1)
4034 if (!lvalue_p (rhs))
4036 error ("cannot pass rvalue to reference parameter");
4037 return error_mark_node;
4039 if (!c_mark_addressable (rhs))
4040 return error_mark_node;
4041 rhs = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (rhs)), rhs);
4043 /* We already know that these two types are compatible, but they
4044 may not be exactly identical. In fact, `TREE_TYPE (type)' is
4045 likely to be __builtin_va_list and `TREE_TYPE (rhs)' is
4046 likely to be va_list, a typedef to __builtin_va_list, which
4047 is different enough that it will cause problems later. */
4048 if (TREE_TYPE (TREE_TYPE (rhs)) != TREE_TYPE (type))
4049 rhs = build1 (NOP_EXPR, build_pointer_type (TREE_TYPE (type)), rhs);
4051 rhs = build1 (NOP_EXPR, type, rhs);
4054 /* Some types can interconvert without explicit casts. */
4055 else if (codel == VECTOR_TYPE && coder == VECTOR_TYPE
4056 && vector_types_convertible_p (type, TREE_TYPE (rhs), true))
4057 return convert (type, rhs);
4058 /* Arithmetic types all interconvert, and enum is treated like int. */
4059 else if ((codel == INTEGER_TYPE || codel == REAL_TYPE
4060 || codel == FIXED_POINT_TYPE
4061 || codel == ENUMERAL_TYPE || codel == COMPLEX_TYPE
4062 || codel == BOOLEAN_TYPE)
4063 && (coder == INTEGER_TYPE || coder == REAL_TYPE
4064 || coder == FIXED_POINT_TYPE
4065 || coder == ENUMERAL_TYPE || coder == COMPLEX_TYPE
4066 || coder == BOOLEAN_TYPE))
4067 return convert_and_check (type, rhs);
4069 /* Aggregates in different TUs might need conversion. */
4070 if ((codel == RECORD_TYPE || codel == UNION_TYPE)
4072 && comptypes (type, rhstype))
4073 return convert_and_check (type, rhs);
4075 /* Conversion to a transparent union from its member types.
4076 This applies only to function arguments. */
4077 if (codel == UNION_TYPE && TYPE_TRANSPARENT_UNION (type)
4078 && (errtype == ic_argpass || errtype == ic_argpass_nonproto))
4080 tree memb, marginal_memb = NULL_TREE;
4082 for (memb = TYPE_FIELDS (type); memb ; memb = TREE_CHAIN (memb))
4084 tree memb_type = TREE_TYPE (memb);
4086 if (comptypes (TYPE_MAIN_VARIANT (memb_type),
4087 TYPE_MAIN_VARIANT (rhstype)))
4090 if (TREE_CODE (memb_type) != POINTER_TYPE)
4093 if (coder == POINTER_TYPE)
4095 tree ttl = TREE_TYPE (memb_type);
4096 tree ttr = TREE_TYPE (rhstype);
4098 /* Any non-function converts to a [const][volatile] void *
4099 and vice versa; otherwise, targets must be the same.
4100 Meanwhile, the lhs target must have all the qualifiers of
4102 if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
4103 || comp_target_types (memb_type, rhstype))
4105 /* If this type won't generate any warnings, use it. */
4106 if (TYPE_QUALS (ttl) == TYPE_QUALS (ttr)
4107 || ((TREE_CODE (ttr) == FUNCTION_TYPE
4108 && TREE_CODE (ttl) == FUNCTION_TYPE)
4109 ? ((TYPE_QUALS (ttl) | TYPE_QUALS (ttr))
4110 == TYPE_QUALS (ttr))
4111 : ((TYPE_QUALS (ttl) | TYPE_QUALS (ttr))
4112 == TYPE_QUALS (ttl))))
4115 /* Keep looking for a better type, but remember this one. */
4117 marginal_memb = memb;
4121 /* Can convert integer zero to any pointer type. */
4122 if (null_pointer_constant_p (rhs))
4124 rhs = null_pointer_node;
4129 if (memb || marginal_memb)
4133 /* We have only a marginally acceptable member type;
4134 it needs a warning. */
4135 tree ttl = TREE_TYPE (TREE_TYPE (marginal_memb));
4136 tree ttr = TREE_TYPE (rhstype);
4138 /* Const and volatile mean something different for function
4139 types, so the usual warnings are not appropriate. */
4140 if (TREE_CODE (ttr) == FUNCTION_TYPE
4141 && TREE_CODE (ttl) == FUNCTION_TYPE)
4143 /* Because const and volatile on functions are
4144 restrictions that say the function will not do
4145 certain things, it is okay to use a const or volatile
4146 function where an ordinary one is wanted, but not
4148 if (TYPE_QUALS (ttl) & ~TYPE_QUALS (ttr))
4149 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE "
4150 "makes qualified function "
4151 "pointer from unqualified"),
4152 G_("assignment makes qualified "
4153 "function pointer from "
4155 G_("initialization makes qualified "
4156 "function pointer from "
4158 G_("return makes qualified function "
4159 "pointer from unqualified"));
4161 else if (TYPE_QUALS (ttr) & ~TYPE_QUALS (ttl))
4162 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE discards "
4163 "qualifiers from pointer target type"),
4164 G_("assignment discards qualifiers "
4165 "from pointer target type"),
4166 G_("initialization discards qualifiers "
4167 "from pointer target type"),
4168 G_("return discards qualifiers from "
4169 "pointer target type"));
4171 memb = marginal_memb;
4174 if (!fundecl || !DECL_IN_SYSTEM_HEADER (fundecl))
4175 pedwarn (OPT_pedantic,
4176 "ISO C prohibits argument conversion to union type");
4178 rhs = fold_convert (TREE_TYPE (memb), rhs);
4179 return build_constructor_single (type, memb, rhs);
4183 /* Conversions among pointers */
4184 else if ((codel == POINTER_TYPE || codel == REFERENCE_TYPE)
4185 && (coder == codel))
4187 tree ttl = TREE_TYPE (type);
4188 tree ttr = TREE_TYPE (rhstype);
4191 bool is_opaque_pointer;
4192 int target_cmp = 0; /* Cache comp_target_types () result. */
4194 if (TREE_CODE (mvl) != ARRAY_TYPE)
4195 mvl = TYPE_MAIN_VARIANT (mvl);
4196 if (TREE_CODE (mvr) != ARRAY_TYPE)
4197 mvr = TYPE_MAIN_VARIANT (mvr);
4198 /* Opaque pointers are treated like void pointers. */
4199 is_opaque_pointer = vector_targets_convertible_p (ttl, ttr);
4201 /* C++ does not allow the implicit conversion void* -> T*. However,
4202 for the purpose of reducing the number of false positives, we
4203 tolerate the special case of
4207 where NULL is typically defined in C to be '(void *) 0'. */
4208 if (VOID_TYPE_P (ttr) && rhs != null_pointer_node && !VOID_TYPE_P (ttl))
4209 warning (OPT_Wc___compat, "request for implicit conversion from "
4210 "%qT to %qT not permitted in C++", rhstype, type);
4212 /* Check if the right-hand side has a format attribute but the
4213 left-hand side doesn't. */
4214 if (warn_missing_format_attribute
4215 && check_missing_format_attribute (type, rhstype))
4220 case ic_argpass_nonproto:
4221 warning (OPT_Wmissing_format_attribute,
4222 "argument %d of %qE might be "
4223 "a candidate for a format attribute",
4227 warning (OPT_Wmissing_format_attribute,
4228 "assignment left-hand side might be "
4229 "a candidate for a format attribute");
4232 warning (OPT_Wmissing_format_attribute,
4233 "initialization left-hand side might be "
4234 "a candidate for a format attribute");
4237 warning (OPT_Wmissing_format_attribute,
4238 "return type might be "
4239 "a candidate for a format attribute");
4246 /* Any non-function converts to a [const][volatile] void *
4247 and vice versa; otherwise, targets must be the same.
4248 Meanwhile, the lhs target must have all the qualifiers of the rhs. */
4249 if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
4250 || (target_cmp = comp_target_types (type, rhstype))
4251 || is_opaque_pointer
4252 || (c_common_unsigned_type (mvl)
4253 == c_common_unsigned_type (mvr)))
4256 && ((VOID_TYPE_P (ttl) && TREE_CODE (ttr) == FUNCTION_TYPE)
4259 && !null_pointer_constant_p (rhs)
4260 && TREE_CODE (ttl) == FUNCTION_TYPE)))
4261 WARN_FOR_ASSIGNMENT (G_("ISO C forbids passing argument %d of "
4262 "%qE between function pointer "
4264 G_("ISO C forbids assignment between "
4265 "function pointer and %<void *%>"),
4266 G_("ISO C forbids initialization between "
4267 "function pointer and %<void *%>"),
4268 G_("ISO C forbids return between function "
4269 "pointer and %<void *%>"));
4270 /* Const and volatile mean something different for function types,
4271 so the usual warnings are not appropriate. */
4272 else if (TREE_CODE (ttr) != FUNCTION_TYPE
4273 && TREE_CODE (ttl) != FUNCTION_TYPE)
4275 if (TYPE_QUALS (ttr) & ~TYPE_QUALS (ttl))
4277 /* Types differing only by the presence of the 'volatile'
4278 qualifier are acceptable if the 'volatile' has been added
4279 in by the Objective-C EH machinery. */
4280 if (!objc_type_quals_match (ttl, ttr))
4281 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE discards "
4282 "qualifiers from pointer target type"),
4283 G_("assignment discards qualifiers "
4284 "from pointer target type"),
4285 G_("initialization discards qualifiers "
4286 "from pointer target type"),
4287 G_("return discards qualifiers from "
4288 "pointer target type"));
4290 /* If this is not a case of ignoring a mismatch in signedness,
4292 else if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
4295 /* If there is a mismatch, do warn. */
4296 else if (warn_pointer_sign)
4297 WARN_FOR_ASSIGNMENT (G_("pointer targets in passing argument "
4298 "%d of %qE differ in signedness"),
4299 G_("pointer targets in assignment "
4300 "differ in signedness"),
4301 G_("pointer targets in initialization "
4302 "differ in signedness"),
4303 G_("pointer targets in return differ "
4306 else if (TREE_CODE (ttl) == FUNCTION_TYPE
4307 && TREE_CODE (ttr) == FUNCTION_TYPE)
4309 /* Because const and volatile on functions are restrictions
4310 that say the function will not do certain things,
4311 it is okay to use a const or volatile function
4312 where an ordinary one is wanted, but not vice-versa. */
4313 if (TYPE_QUALS (ttl) & ~TYPE_QUALS (ttr))
4314 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE makes "
4315 "qualified function pointer "
4316 "from unqualified"),
4317 G_("assignment makes qualified function "
4318 "pointer from unqualified"),
4319 G_("initialization makes qualified "
4320 "function pointer from unqualified"),
4321 G_("return makes qualified function "
4322 "pointer from unqualified"));
4326 /* Avoid warning about the volatile ObjC EH puts on decls. */
4328 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE from "
4329 "incompatible pointer type"),
4330 G_("assignment from incompatible pointer type"),
4331 G_("initialization from incompatible "
4333 G_("return from incompatible pointer type"));
4335 return convert (type, rhs);
4337 else if (codel == POINTER_TYPE && coder == ARRAY_TYPE)
4339 /* ??? This should not be an error when inlining calls to
4340 unprototyped functions. */
4341 error ("invalid use of non-lvalue array");
4342 return error_mark_node;
4344 else if (codel == POINTER_TYPE && coder == INTEGER_TYPE)
4346 /* An explicit constant 0 can convert to a pointer,
4347 or one that results from arithmetic, even including
4348 a cast to integer type. */
4349 if (!null_pointer_constant_p (rhs))
4350 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE makes "
4351 "pointer from integer without a cast"),
4352 G_("assignment makes pointer from integer "
4354 G_("initialization makes pointer from "
4355 "integer without a cast"),
4356 G_("return makes pointer from integer "
4359 return convert (type, rhs);
4361 else if (codel == INTEGER_TYPE && coder == POINTER_TYPE)
4363 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE makes integer "
4364 "from pointer without a cast"),
4365 G_("assignment makes integer from pointer "
4367 G_("initialization makes integer from pointer "
4369 G_("return makes integer from pointer "
4371 return convert (type, rhs);
4373 else if (codel == BOOLEAN_TYPE && coder == POINTER_TYPE)
4374 return convert (type, rhs);
4379 case ic_argpass_nonproto:
4380 /* ??? This should not be an error when inlining calls to
4381 unprototyped functions. */
4382 error ("incompatible type for argument %d of %qE", parmnum, rname);
4385 error ("incompatible types in assignment");
4388 error ("incompatible types in initialization");
4391 error ("incompatible types in return");
4397 return error_mark_node;
4400 /* If VALUE is a compound expr all of whose expressions are constant, then
4401 return its value. Otherwise, return error_mark_node.
4403 This is for handling COMPOUND_EXPRs as initializer elements
4404 which is allowed with a warning when -pedantic is specified. */
4407 valid_compound_expr_initializer (tree value, tree endtype)
4409 if (TREE_CODE (value) == COMPOUND_EXPR)
4411 if (valid_compound_expr_initializer (TREE_OPERAND (value, 0), endtype)
4413 return error_mark_node;
4414 return valid_compound_expr_initializer (TREE_OPERAND (value, 1),
4417 else if (!initializer_constant_valid_p (value, endtype))
4418 return error_mark_node;
4423 /* Perform appropriate conversions on the initial value of a variable,
4424 store it in the declaration DECL,
4425 and print any error messages that are appropriate.
4426 If the init is invalid, store an ERROR_MARK. */
4429 store_init_value (tree decl, tree init)
4433 /* If variable's type was invalidly declared, just ignore it. */
4435 type = TREE_TYPE (decl);
4436 if (TREE_CODE (type) == ERROR_MARK)
4439 /* Digest the specified initializer into an expression. */
4441 value = digest_init (type, init, true, TREE_STATIC (decl));
4443 /* Store the expression if valid; else report error. */
4445 if (!in_system_header
4446 && AGGREGATE_TYPE_P (TREE_TYPE (decl)) && !TREE_STATIC (decl))
4447 warning (OPT_Wtraditional, "traditional C rejects automatic "
4448 "aggregate initialization");
4450 DECL_INITIAL (decl) = value;
4452 /* ANSI wants warnings about out-of-range constant initializers. */
4453 STRIP_TYPE_NOPS (value);
4454 if (TREE_STATIC (decl))
4455 constant_expression_warning (value);
4457 /* Check if we need to set array size from compound literal size. */
4458 if (TREE_CODE (type) == ARRAY_TYPE
4459 && TYPE_DOMAIN (type) == 0
4460 && value != error_mark_node)
4462 tree inside_init = init;
4464 STRIP_TYPE_NOPS (inside_init);
4465 inside_init = fold (inside_init);
4467 if (TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
4469 tree cldecl = COMPOUND_LITERAL_EXPR_DECL (inside_init);
4471 if (TYPE_DOMAIN (TREE_TYPE (cldecl)))
4473 /* For int foo[] = (int [3]){1}; we need to set array size
4474 now since later on array initializer will be just the
4475 brace enclosed list of the compound literal. */
4476 type = build_distinct_type_copy (TYPE_MAIN_VARIANT (type));
4477 TREE_TYPE (decl) = type;
4478 TYPE_DOMAIN (type) = TYPE_DOMAIN (TREE_TYPE (cldecl));
4480 layout_decl (cldecl, 0);
4486 /* Methods for storing and printing names for error messages. */
4488 /* Implement a spelling stack that allows components of a name to be pushed
4489 and popped. Each element on the stack is this structure. */
4496 unsigned HOST_WIDE_INT i;
4501 #define SPELLING_STRING 1
4502 #define SPELLING_MEMBER 2
4503 #define SPELLING_BOUNDS 3
4505 static struct spelling *spelling; /* Next stack element (unused). */
4506 static struct spelling *spelling_base; /* Spelling stack base. */
4507 static int spelling_size; /* Size of the spelling stack. */
4509 /* Macros to save and restore the spelling stack around push_... functions.
4510 Alternative to SAVE_SPELLING_STACK. */
4512 #define SPELLING_DEPTH() (spelling - spelling_base)
4513 #define RESTORE_SPELLING_DEPTH(DEPTH) (spelling = spelling_base + (DEPTH))
4515 /* Push an element on the spelling stack with type KIND and assign VALUE
4518 #define PUSH_SPELLING(KIND, VALUE, MEMBER) \
4520 int depth = SPELLING_DEPTH (); \
4522 if (depth >= spelling_size) \
4524 spelling_size += 10; \
4525 spelling_base = XRESIZEVEC (struct spelling, spelling_base, \
4527 RESTORE_SPELLING_DEPTH (depth); \
4530 spelling->kind = (KIND); \
4531 spelling->MEMBER = (VALUE); \
4535 /* Push STRING on the stack. Printed literally. */
4538 push_string (const char *string)
4540 PUSH_SPELLING (SPELLING_STRING, string, u.s);
4543 /* Push a member name on the stack. Printed as '.' STRING. */
4546 push_member_name (tree decl)
4548 const char *const string
4549 = DECL_NAME (decl) ? IDENTIFIER_POINTER (DECL_NAME (decl)) : "<anonymous>";
4550 PUSH_SPELLING (SPELLING_MEMBER, string, u.s);
4553 /* Push an array bounds on the stack. Printed as [BOUNDS]. */
4556 push_array_bounds (unsigned HOST_WIDE_INT bounds)
4558 PUSH_SPELLING (SPELLING_BOUNDS, bounds, u.i);
4561 /* Compute the maximum size in bytes of the printed spelling. */
4564 spelling_length (void)
4569 for (p = spelling_base; p < spelling; p++)
4571 if (p->kind == SPELLING_BOUNDS)
4574 size += strlen (p->u.s) + 1;
4580 /* Print the spelling to BUFFER and return it. */
4583 print_spelling (char *buffer)
4588 for (p = spelling_base; p < spelling; p++)
4589 if (p->kind == SPELLING_BOUNDS)
4591 sprintf (d, "[" HOST_WIDE_INT_PRINT_UNSIGNED "]", p->u.i);
4597 if (p->kind == SPELLING_MEMBER)
4599 for (s = p->u.s; (*d = *s++); d++)
4606 /* Issue an error message for a bad initializer component.
4607 MSGID identifies the message.
4608 The component name is taken from the spelling stack. */
4611 error_init (const char *msgid)
4615 error ("%s", _(msgid));
4616 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4618 error ("(near initialization for %qs)", ofwhat);
4621 /* Issue a pedantic warning for a bad initializer component. OPT is
4622 the option OPT_* (from options.h) controlling this warning or 0 if
4623 it is unconditionally given. MSGID identifies the message. The
4624 component name is taken from the spelling stack. */
4627 pedwarn_init (int opt, const char *msgid)
4631 pedwarn (opt, "%s", _(msgid));
4632 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4634 pedwarn (opt, "(near initialization for %qs)", ofwhat);
4637 /* Issue a warning for a bad initializer component.
4639 OPT is the OPT_W* value corresponding to the warning option that
4640 controls this warning. MSGID identifies the message. The
4641 component name is taken from the spelling stack. */
4644 warning_init (int opt, const char *msgid)
4648 warning (opt, "%s", _(msgid));
4649 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4651 warning (opt, "(near initialization for %qs)", ofwhat);
4654 /* If TYPE is an array type and EXPR is a parenthesized string
4655 constant, warn if pedantic that EXPR is being used to initialize an
4656 object of type TYPE. */
4659 maybe_warn_string_init (tree type, struct c_expr expr)
4662 && TREE_CODE (type) == ARRAY_TYPE
4663 && TREE_CODE (expr.value) == STRING_CST
4664 && expr.original_code != STRING_CST)
4665 pedwarn_init (OPT_pedantic,
4666 "array initialized from parenthesized string constant");
4669 /* Digest the parser output INIT as an initializer for type TYPE.
4670 Return a C expression of type TYPE to represent the initial value.
4672 If INIT is a string constant, STRICT_STRING is true if it is
4673 unparenthesized or we should not warn here for it being parenthesized.
4674 For other types of INIT, STRICT_STRING is not used.
4676 REQUIRE_CONSTANT requests an error if non-constant initializers or
4677 elements are seen. */
4680 digest_init (tree type, tree init, bool strict_string, int require_constant)
4682 enum tree_code code = TREE_CODE (type);
4683 tree inside_init = init;
4685 if (type == error_mark_node
4687 || init == error_mark_node
4688 || TREE_TYPE (init) == error_mark_node)
4689 return error_mark_node;
4691 STRIP_TYPE_NOPS (inside_init);
4693 inside_init = fold (inside_init);
4695 /* Initialization of an array of chars from a string constant
4696 optionally enclosed in braces. */
4698 if (code == ARRAY_TYPE && inside_init
4699 && TREE_CODE (inside_init) == STRING_CST)
4701 tree typ1 = TYPE_MAIN_VARIANT (TREE_TYPE (type));
4702 /* Note that an array could be both an array of character type
4703 and an array of wchar_t if wchar_t is signed char or unsigned
4705 bool char_array = (typ1 == char_type_node
4706 || typ1 == signed_char_type_node
4707 || typ1 == unsigned_char_type_node);
4708 bool wchar_array = !!comptypes (typ1, wchar_type_node);
4709 bool char16_array = !!comptypes (typ1, char16_type_node);
4710 bool char32_array = !!comptypes (typ1, char32_type_node);
4712 if (char_array || wchar_array || char16_array || char32_array)
4715 tree typ2 = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (inside_init)));
4716 expr.value = inside_init;
4717 expr.original_code = (strict_string ? STRING_CST : ERROR_MARK);
4718 maybe_warn_string_init (type, expr);
4720 if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
4721 TYPE_MAIN_VARIANT (type)))
4726 if (typ2 != char_type_node)
4728 error_init ("char-array initialized from wide string");
4729 return error_mark_node;
4734 if (typ2 == char_type_node)
4736 error_init ("wide character array initialized from non-wide "
4738 return error_mark_node;
4740 else if (!comptypes(typ1, typ2))
4742 error_init ("wide character array initialized from "
4743 "incompatible wide string");
4744 return error_mark_node;
4748 TREE_TYPE (inside_init) = type;
4749 if (TYPE_DOMAIN (type) != 0
4750 && TYPE_SIZE (type) != 0
4751 && TREE_CODE (TYPE_SIZE (type)) == INTEGER_CST
4752 /* Subtract the size of a single (possibly wide) character
4753 because it's ok to ignore the terminating null char
4754 that is counted in the length of the constant. */
4755 && 0 > compare_tree_int (TYPE_SIZE_UNIT (type),
4756 TREE_STRING_LENGTH (inside_init)
4757 - (TYPE_PRECISION (typ1)
4759 pedwarn_init (0, "initializer-string for array of chars is too long");
4763 else if (INTEGRAL_TYPE_P (typ1))
4765 error_init ("array of inappropriate type initialized "
4766 "from string constant");
4767 return error_mark_node;
4771 /* Build a VECTOR_CST from a *constant* vector constructor. If the
4772 vector constructor is not constant (e.g. {1,2,3,foo()}) then punt
4773 below and handle as a constructor. */
4774 if (code == VECTOR_TYPE
4775 && TREE_CODE (TREE_TYPE (inside_init)) == VECTOR_TYPE
4776 && vector_types_convertible_p (TREE_TYPE (inside_init), type, true)
4777 && TREE_CONSTANT (inside_init))
4779 if (TREE_CODE (inside_init) == VECTOR_CST
4780 && comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
4781 TYPE_MAIN_VARIANT (type)))
4784 if (TREE_CODE (inside_init) == CONSTRUCTOR)
4786 unsigned HOST_WIDE_INT ix;
4788 bool constant_p = true;
4790 /* Iterate through elements and check if all constructor
4791 elements are *_CSTs. */
4792 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (inside_init), ix, value)
4793 if (!CONSTANT_CLASS_P (value))
4800 return build_vector_from_ctor (type,
4801 CONSTRUCTOR_ELTS (inside_init));
4805 /* Any type can be initialized
4806 from an expression of the same type, optionally with braces. */
4808 if (inside_init && TREE_TYPE (inside_init) != 0
4809 && (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
4810 TYPE_MAIN_VARIANT (type))
4811 || (code == ARRAY_TYPE
4812 && comptypes (TREE_TYPE (inside_init), type))
4813 || (code == VECTOR_TYPE
4814 && comptypes (TREE_TYPE (inside_init), type))
4815 || (code == POINTER_TYPE
4816 && TREE_CODE (TREE_TYPE (inside_init)) == ARRAY_TYPE
4817 && comptypes (TREE_TYPE (TREE_TYPE (inside_init)),
4818 TREE_TYPE (type)))))
4820 if (code == POINTER_TYPE)
4822 if (TREE_CODE (TREE_TYPE (inside_init)) == ARRAY_TYPE)
4824 if (TREE_CODE (inside_init) == STRING_CST
4825 || TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
4826 inside_init = array_to_pointer_conversion (inside_init);
4829 error_init ("invalid use of non-lvalue array");
4830 return error_mark_node;
4835 if (code == VECTOR_TYPE)
4836 /* Although the types are compatible, we may require a
4838 inside_init = convert (type, inside_init);
4840 if (require_constant
4841 && (code == VECTOR_TYPE || !flag_isoc99)
4842 && TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
4844 /* As an extension, allow initializing objects with static storage
4845 duration with compound literals (which are then treated just as
4846 the brace enclosed list they contain). Also allow this for
4847 vectors, as we can only assign them with compound literals. */
4848 tree decl = COMPOUND_LITERAL_EXPR_DECL (inside_init);
4849 inside_init = DECL_INITIAL (decl);
4852 if (code == ARRAY_TYPE && TREE_CODE (inside_init) != STRING_CST
4853 && TREE_CODE (inside_init) != CONSTRUCTOR)
4855 error_init ("array initialized from non-constant array expression");
4856 return error_mark_node;
4859 if (optimize && TREE_CODE (inside_init) == VAR_DECL)
4860 inside_init = decl_constant_value_for_broken_optimization (inside_init);
4862 /* Compound expressions can only occur here if -pedantic or
4863 -pedantic-errors is specified. In the later case, we always want
4864 an error. In the former case, we simply want a warning. */
4865 if (require_constant && pedantic
4866 && TREE_CODE (inside_init) == COMPOUND_EXPR)
4869 = valid_compound_expr_initializer (inside_init,
4870 TREE_TYPE (inside_init));
4871 if (inside_init == error_mark_node)
4872 error_init ("initializer element is not constant");
4874 pedwarn_init (OPT_pedantic, "initializer element is not constant");
4875 if (flag_pedantic_errors)
4876 inside_init = error_mark_node;
4878 else if (require_constant
4879 && !initializer_constant_valid_p (inside_init,
4880 TREE_TYPE (inside_init)))
4882 error_init ("initializer element is not constant");
4883 inside_init = error_mark_node;
4886 /* Added to enable additional -Wmissing-format-attribute warnings. */
4887 if (TREE_CODE (TREE_TYPE (inside_init)) == POINTER_TYPE)
4888 inside_init = convert_for_assignment (type, inside_init, ic_init, NULL_TREE,
4893 /* Handle scalar types, including conversions. */
4895 if (code == INTEGER_TYPE || code == REAL_TYPE || code == FIXED_POINT_TYPE
4896 || code == POINTER_TYPE || code == ENUMERAL_TYPE || code == BOOLEAN_TYPE
4897 || code == COMPLEX_TYPE || code == VECTOR_TYPE)
4899 if (TREE_CODE (TREE_TYPE (init)) == ARRAY_TYPE
4900 && (TREE_CODE (init) == STRING_CST
4901 || TREE_CODE (init) == COMPOUND_LITERAL_EXPR))
4902 init = array_to_pointer_conversion (init);
4904 = convert_for_assignment (type, init, ic_init,
4905 NULL_TREE, NULL_TREE, 0);
4907 /* Check to see if we have already given an error message. */
4908 if (inside_init == error_mark_node)
4910 else if (require_constant && !TREE_CONSTANT (inside_init))
4912 error_init ("initializer element is not constant");
4913 inside_init = error_mark_node;
4915 else if (require_constant
4916 && !initializer_constant_valid_p (inside_init,
4917 TREE_TYPE (inside_init)))
4919 error_init ("initializer element is not computable at load time");
4920 inside_init = error_mark_node;
4926 /* Come here only for records and arrays. */
4928 if (COMPLETE_TYPE_P (type) && TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST)
4930 error_init ("variable-sized object may not be initialized");
4931 return error_mark_node;
4934 error_init ("invalid initializer");
4935 return error_mark_node;
4938 /* Handle initializers that use braces. */
4940 /* Type of object we are accumulating a constructor for.
4941 This type is always a RECORD_TYPE, UNION_TYPE or ARRAY_TYPE. */
4942 static tree constructor_type;
4944 /* For a RECORD_TYPE or UNION_TYPE, this is the chain of fields
4946 static tree constructor_fields;
4948 /* For an ARRAY_TYPE, this is the specified index
4949 at which to store the next element we get. */
4950 static tree constructor_index;
4952 /* For an ARRAY_TYPE, this is the maximum index. */
4953 static tree constructor_max_index;
4955 /* For a RECORD_TYPE, this is the first field not yet written out. */
4956 static tree constructor_unfilled_fields;
4958 /* For an ARRAY_TYPE, this is the index of the first element
4959 not yet written out. */
4960 static tree constructor_unfilled_index;
4962 /* In a RECORD_TYPE, the byte index of the next consecutive field.
4963 This is so we can generate gaps between fields, when appropriate. */
4964 static tree constructor_bit_index;
4966 /* If we are saving up the elements rather than allocating them,
4967 this is the list of elements so far (in reverse order,
4968 most recent first). */
4969 static VEC(constructor_elt,gc) *constructor_elements;
4971 /* 1 if constructor should be incrementally stored into a constructor chain,
4972 0 if all the elements should be kept in AVL tree. */
4973 static int constructor_incremental;
4975 /* 1 if so far this constructor's elements are all compile-time constants. */
4976 static int constructor_constant;
4978 /* 1 if so far this constructor's elements are all valid address constants. */
4979 static int constructor_simple;
4981 /* 1 if this constructor is erroneous so far. */
4982 static int constructor_erroneous;
4984 /* Structure for managing pending initializer elements, organized as an
4989 struct init_node *left, *right;
4990 struct init_node *parent;
4996 /* Tree of pending elements at this constructor level.
4997 These are elements encountered out of order
4998 which belong at places we haven't reached yet in actually
5000 Will never hold tree nodes across GC runs. */
5001 static struct init_node *constructor_pending_elts;
5003 /* The SPELLING_DEPTH of this constructor. */
5004 static int constructor_depth;
5006 /* DECL node for which an initializer is being read.
5007 0 means we are reading a constructor expression
5008 such as (struct foo) {...}. */
5009 static tree constructor_decl;
5011 /* Nonzero if this is an initializer for a top-level decl. */
5012 static int constructor_top_level;
5014 /* Nonzero if there were any member designators in this initializer. */
5015 static int constructor_designated;
5017 /* Nesting depth of designator list. */
5018 static int designator_depth;
5020 /* Nonzero if there were diagnosed errors in this designator list. */
5021 static int designator_erroneous;
5024 /* This stack has a level for each implicit or explicit level of
5025 structuring in the initializer, including the outermost one. It
5026 saves the values of most of the variables above. */
5028 struct constructor_range_stack;
5030 struct constructor_stack
5032 struct constructor_stack *next;
5037 tree unfilled_index;
5038 tree unfilled_fields;
5040 VEC(constructor_elt,gc) *elements;
5041 struct init_node *pending_elts;
5044 /* If value nonzero, this value should replace the entire
5045 constructor at this level. */
5046 struct c_expr replacement_value;
5047 struct constructor_range_stack *range_stack;
5057 static struct constructor_stack *constructor_stack;
5059 /* This stack represents designators from some range designator up to
5060 the last designator in the list. */
5062 struct constructor_range_stack
5064 struct constructor_range_stack *next, *prev;
5065 struct constructor_stack *stack;
5072 static struct constructor_range_stack *constructor_range_stack;
5074 /* This stack records separate initializers that are nested.
5075 Nested initializers can't happen in ANSI C, but GNU C allows them
5076 in cases like { ... (struct foo) { ... } ... }. */
5078 struct initializer_stack
5080 struct initializer_stack *next;
5082 struct constructor_stack *constructor_stack;
5083 struct constructor_range_stack *constructor_range_stack;
5084 VEC(constructor_elt,gc) *elements;
5085 struct spelling *spelling;
5086 struct spelling *spelling_base;
5089 char require_constant_value;
5090 char require_constant_elements;
5093 static struct initializer_stack *initializer_stack;
5095 /* Prepare to parse and output the initializer for variable DECL. */
5098 start_init (tree decl, tree asmspec_tree ATTRIBUTE_UNUSED, int top_level)
5101 struct initializer_stack *p = XNEW (struct initializer_stack);
5103 p->decl = constructor_decl;
5104 p->require_constant_value = require_constant_value;
5105 p->require_constant_elements = require_constant_elements;
5106 p->constructor_stack = constructor_stack;
5107 p->constructor_range_stack = constructor_range_stack;
5108 p->elements = constructor_elements;
5109 p->spelling = spelling;
5110 p->spelling_base = spelling_base;
5111 p->spelling_size = spelling_size;
5112 p->top_level = constructor_top_level;
5113 p->next = initializer_stack;
5114 initializer_stack = p;
5116 constructor_decl = decl;
5117 constructor_designated = 0;
5118 constructor_top_level = top_level;
5120 if (decl != 0 && decl != error_mark_node)
5122 require_constant_value = TREE_STATIC (decl);
5123 require_constant_elements
5124 = ((TREE_STATIC (decl) || (pedantic && !flag_isoc99))
5125 /* For a scalar, you can always use any value to initialize,
5126 even within braces. */
5127 && (TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE
5128 || TREE_CODE (TREE_TYPE (decl)) == RECORD_TYPE
5129 || TREE_CODE (TREE_TYPE (decl)) == UNION_TYPE
5130 || TREE_CODE (TREE_TYPE (decl)) == QUAL_UNION_TYPE));
5131 locus = IDENTIFIER_POINTER (DECL_NAME (decl));
5135 require_constant_value = 0;
5136 require_constant_elements = 0;
5137 locus = "(anonymous)";
5140 constructor_stack = 0;
5141 constructor_range_stack = 0;
5143 missing_braces_mentioned = 0;
5147 RESTORE_SPELLING_DEPTH (0);
5150 push_string (locus);
5156 struct initializer_stack *p = initializer_stack;
5158 /* Free the whole constructor stack of this initializer. */
5159 while (constructor_stack)
5161 struct constructor_stack *q = constructor_stack;
5162 constructor_stack = q->next;
5166 gcc_assert (!constructor_range_stack);
5168 /* Pop back to the data of the outer initializer (if any). */
5169 free (spelling_base);
5171 constructor_decl = p->decl;
5172 require_constant_value = p->require_constant_value;
5173 require_constant_elements = p->require_constant_elements;
5174 constructor_stack = p->constructor_stack;
5175 constructor_range_stack = p->constructor_range_stack;
5176 constructor_elements = p->elements;
5177 spelling = p->spelling;
5178 spelling_base = p->spelling_base;
5179 spelling_size = p->spelling_size;
5180 constructor_top_level = p->top_level;
5181 initializer_stack = p->next;
5185 /* Call here when we see the initializer is surrounded by braces.
5186 This is instead of a call to push_init_level;
5187 it is matched by a call to pop_init_level.
5189 TYPE is the type to initialize, for a constructor expression.
5190 For an initializer for a decl, TYPE is zero. */
5193 really_start_incremental_init (tree type)
5195 struct constructor_stack *p = XNEW (struct constructor_stack);
5198 type = TREE_TYPE (constructor_decl);
5200 if (targetm.vector_opaque_p (type))
5201 error ("opaque vector types cannot be initialized");
5203 p->type = constructor_type;
5204 p->fields = constructor_fields;
5205 p->index = constructor_index;
5206 p->max_index = constructor_max_index;
5207 p->unfilled_index = constructor_unfilled_index;
5208 p->unfilled_fields = constructor_unfilled_fields;
5209 p->bit_index = constructor_bit_index;
5210 p->elements = constructor_elements;
5211 p->constant = constructor_constant;
5212 p->simple = constructor_simple;
5213 p->erroneous = constructor_erroneous;
5214 p->pending_elts = constructor_pending_elts;
5215 p->depth = constructor_depth;
5216 p->replacement_value.value = 0;
5217 p->replacement_value.original_code = ERROR_MARK;
5221 p->incremental = constructor_incremental;
5222 p->designated = constructor_designated;
5224 constructor_stack = p;
5226 constructor_constant = 1;
5227 constructor_simple = 1;
5228 constructor_depth = SPELLING_DEPTH ();
5229 constructor_elements = 0;
5230 constructor_pending_elts = 0;
5231 constructor_type = type;
5232 constructor_incremental = 1;
5233 constructor_designated = 0;
5234 designator_depth = 0;
5235 designator_erroneous = 0;
5237 if (TREE_CODE (constructor_type) == RECORD_TYPE
5238 || TREE_CODE (constructor_type) == UNION_TYPE)
5240 constructor_fields = TYPE_FIELDS (constructor_type);
5241 /* Skip any nameless bit fields at the beginning. */
5242 while (constructor_fields != 0 && DECL_C_BIT_FIELD (constructor_fields)
5243 && DECL_NAME (constructor_fields) == 0)
5244 constructor_fields = TREE_CHAIN (constructor_fields);
5246 constructor_unfilled_fields = constructor_fields;
5247 constructor_bit_index = bitsize_zero_node;
5249 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5251 if (TYPE_DOMAIN (constructor_type))
5253 constructor_max_index
5254 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type));
5256 /* Detect non-empty initializations of zero-length arrays. */
5257 if (constructor_max_index == NULL_TREE
5258 && TYPE_SIZE (constructor_type))
5259 constructor_max_index = build_int_cst (NULL_TREE, -1);
5261 /* constructor_max_index needs to be an INTEGER_CST. Attempts
5262 to initialize VLAs will cause a proper error; avoid tree
5263 checking errors as well by setting a safe value. */
5264 if (constructor_max_index
5265 && TREE_CODE (constructor_max_index) != INTEGER_CST)
5266 constructor_max_index = build_int_cst (NULL_TREE, -1);
5269 = convert (bitsizetype,
5270 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
5274 constructor_index = bitsize_zero_node;
5275 constructor_max_index = NULL_TREE;
5278 constructor_unfilled_index = constructor_index;
5280 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
5282 /* Vectors are like simple fixed-size arrays. */
5283 constructor_max_index =
5284 build_int_cst (NULL_TREE, TYPE_VECTOR_SUBPARTS (constructor_type) - 1);
5285 constructor_index = bitsize_zero_node;
5286 constructor_unfilled_index = constructor_index;
5290 /* Handle the case of int x = {5}; */
5291 constructor_fields = constructor_type;
5292 constructor_unfilled_fields = constructor_type;
5296 /* Push down into a subobject, for initialization.
5297 If this is for an explicit set of braces, IMPLICIT is 0.
5298 If it is because the next element belongs at a lower level,
5299 IMPLICIT is 1 (or 2 if the push is because of designator list). */
5302 push_init_level (int implicit)
5304 struct constructor_stack *p;
5305 tree value = NULL_TREE;
5307 /* If we've exhausted any levels that didn't have braces,
5308 pop them now. If implicit == 1, this will have been done in
5309 process_init_element; do not repeat it here because in the case
5310 of excess initializers for an empty aggregate this leads to an
5311 infinite cycle of popping a level and immediately recreating
5315 while (constructor_stack->implicit)
5317 if ((TREE_CODE (constructor_type) == RECORD_TYPE
5318 || TREE_CODE (constructor_type) == UNION_TYPE)
5319 && constructor_fields == 0)
5320 process_init_element (pop_init_level (1));
5321 else if (TREE_CODE (constructor_type) == ARRAY_TYPE
5322 && constructor_max_index
5323 && tree_int_cst_lt (constructor_max_index,
5325 process_init_element (pop_init_level (1));
5331 /* Unless this is an explicit brace, we need to preserve previous
5335 if ((TREE_CODE (constructor_type) == RECORD_TYPE
5336 || TREE_CODE (constructor_type) == UNION_TYPE)
5337 && constructor_fields)
5338 value = find_init_member (constructor_fields);
5339 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5340 value = find_init_member (constructor_index);
5343 p = XNEW (struct constructor_stack);
5344 p->type = constructor_type;
5345 p->fields = constructor_fields;
5346 p->index = constructor_index;
5347 p->max_index = constructor_max_index;
5348 p->unfilled_index = constructor_unfilled_index;
5349 p->unfilled_fields = constructor_unfilled_fields;
5350 p->bit_index = constructor_bit_index;
5351 p->elements = constructor_elements;
5352 p->constant = constructor_constant;
5353 p->simple = constructor_simple;
5354 p->erroneous = constructor_erroneous;
5355 p->pending_elts = constructor_pending_elts;
5356 p->depth = constructor_depth;
5357 p->replacement_value.value = 0;
5358 p->replacement_value.original_code = ERROR_MARK;
5359 p->implicit = implicit;
5361 p->incremental = constructor_incremental;
5362 p->designated = constructor_designated;
5363 p->next = constructor_stack;
5365 constructor_stack = p;
5367 constructor_constant = 1;
5368 constructor_simple = 1;
5369 constructor_depth = SPELLING_DEPTH ();
5370 constructor_elements = 0;
5371 constructor_incremental = 1;
5372 constructor_designated = 0;
5373 constructor_pending_elts = 0;
5376 p->range_stack = constructor_range_stack;
5377 constructor_range_stack = 0;
5378 designator_depth = 0;
5379 designator_erroneous = 0;
5382 /* Don't die if an entire brace-pair level is superfluous
5383 in the containing level. */
5384 if (constructor_type == 0)
5386 else if (TREE_CODE (constructor_type) == RECORD_TYPE
5387 || TREE_CODE (constructor_type) == UNION_TYPE)
5389 /* Don't die if there are extra init elts at the end. */
5390 if (constructor_fields == 0)
5391 constructor_type = 0;
5394 constructor_type = TREE_TYPE (constructor_fields);
5395 push_member_name (constructor_fields);
5396 constructor_depth++;
5399 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5401 constructor_type = TREE_TYPE (constructor_type);
5402 push_array_bounds (tree_low_cst (constructor_index, 1));
5403 constructor_depth++;
5406 if (constructor_type == 0)
5408 error_init ("extra brace group at end of initializer");
5409 constructor_fields = 0;
5410 constructor_unfilled_fields = 0;
5414 if (value && TREE_CODE (value) == CONSTRUCTOR)
5416 constructor_constant = TREE_CONSTANT (value);
5417 constructor_simple = TREE_STATIC (value);
5418 constructor_elements = CONSTRUCTOR_ELTS (value);
5419 if (!VEC_empty (constructor_elt, constructor_elements)
5420 && (TREE_CODE (constructor_type) == RECORD_TYPE
5421 || TREE_CODE (constructor_type) == ARRAY_TYPE))
5422 set_nonincremental_init ();
5425 if (implicit == 1 && warn_missing_braces && !missing_braces_mentioned)
5427 missing_braces_mentioned = 1;
5428 warning_init (OPT_Wmissing_braces, "missing braces around initializer");
5431 if (TREE_CODE (constructor_type) == RECORD_TYPE
5432 || TREE_CODE (constructor_type) == UNION_TYPE)
5434 constructor_fields = TYPE_FIELDS (constructor_type);
5435 /* Skip any nameless bit fields at the beginning. */
5436 while (constructor_fields != 0 && DECL_C_BIT_FIELD (constructor_fields)
5437 && DECL_NAME (constructor_fields) == 0)
5438 constructor_fields = TREE_CHAIN (constructor_fields);
5440 constructor_unfilled_fields = constructor_fields;
5441 constructor_bit_index = bitsize_zero_node;
5443 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
5445 /* Vectors are like simple fixed-size arrays. */
5446 constructor_max_index =
5447 build_int_cst (NULL_TREE, TYPE_VECTOR_SUBPARTS (constructor_type) - 1);
5448 constructor_index = convert (bitsizetype, integer_zero_node);
5449 constructor_unfilled_index = constructor_index;
5451 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5453 if (TYPE_DOMAIN (constructor_type))
5455 constructor_max_index
5456 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type));
5458 /* Detect non-empty initializations of zero-length arrays. */
5459 if (constructor_max_index == NULL_TREE
5460 && TYPE_SIZE (constructor_type))
5461 constructor_max_index = build_int_cst (NULL_TREE, -1);
5463 /* constructor_max_index needs to be an INTEGER_CST. Attempts
5464 to initialize VLAs will cause a proper error; avoid tree
5465 checking errors as well by setting a safe value. */
5466 if (constructor_max_index
5467 && TREE_CODE (constructor_max_index) != INTEGER_CST)
5468 constructor_max_index = build_int_cst (NULL_TREE, -1);
5471 = convert (bitsizetype,
5472 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
5475 constructor_index = bitsize_zero_node;
5477 constructor_unfilled_index = constructor_index;
5478 if (value && TREE_CODE (value) == STRING_CST)
5480 /* We need to split the char/wchar array into individual
5481 characters, so that we don't have to special case it
5483 set_nonincremental_init_from_string (value);
5488 if (constructor_type != error_mark_node)
5489 warning_init (0, "braces around scalar initializer");
5490 constructor_fields = constructor_type;
5491 constructor_unfilled_fields = constructor_type;
5495 /* At the end of an implicit or explicit brace level,
5496 finish up that level of constructor. If a single expression
5497 with redundant braces initialized that level, return the
5498 c_expr structure for that expression. Otherwise, the original_code
5499 element is set to ERROR_MARK.
5500 If we were outputting the elements as they are read, return 0 as the value
5501 from inner levels (process_init_element ignores that),
5502 but return error_mark_node as the value from the outermost level
5503 (that's what we want to put in DECL_INITIAL).
5504 Otherwise, return a CONSTRUCTOR expression as the value. */
5507 pop_init_level (int implicit)
5509 struct constructor_stack *p;
5512 ret.original_code = ERROR_MARK;
5516 /* When we come to an explicit close brace,
5517 pop any inner levels that didn't have explicit braces. */
5518 while (constructor_stack->implicit)
5519 process_init_element (pop_init_level (1));
5521 gcc_assert (!constructor_range_stack);
5524 /* Now output all pending elements. */
5525 constructor_incremental = 1;
5526 output_pending_init_elements (1);
5528 p = constructor_stack;
5530 /* Error for initializing a flexible array member, or a zero-length
5531 array member in an inappropriate context. */
5532 if (constructor_type && constructor_fields
5533 && TREE_CODE (constructor_type) == ARRAY_TYPE
5534 && TYPE_DOMAIN (constructor_type)
5535 && !TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type)))
5537 /* Silently discard empty initializations. The parser will
5538 already have pedwarned for empty brackets. */
5539 if (integer_zerop (constructor_unfilled_index))
5540 constructor_type = NULL_TREE;
5543 gcc_assert (!TYPE_SIZE (constructor_type));
5545 if (constructor_depth > 2)
5546 error_init ("initialization of flexible array member in a nested context");
5548 pedwarn_init (OPT_pedantic, "initialization of a flexible array member");
5550 /* We have already issued an error message for the existence
5551 of a flexible array member not at the end of the structure.
5552 Discard the initializer so that we do not die later. */
5553 if (TREE_CHAIN (constructor_fields) != NULL_TREE)
5554 constructor_type = NULL_TREE;
5558 /* Warn when some struct elements are implicitly initialized to zero. */
5559 if (warn_missing_field_initializers
5561 && TREE_CODE (constructor_type) == RECORD_TYPE
5562 && constructor_unfilled_fields)
5564 /* Do not warn for flexible array members or zero-length arrays. */
5565 while (constructor_unfilled_fields
5566 && (!DECL_SIZE (constructor_unfilled_fields)
5567 || integer_zerop (DECL_SIZE (constructor_unfilled_fields))))
5568 constructor_unfilled_fields = TREE_CHAIN (constructor_unfilled_fields);
5570 /* Do not warn if this level of the initializer uses member
5571 designators; it is likely to be deliberate. */
5572 if (constructor_unfilled_fields && !constructor_designated)
5574 push_member_name (constructor_unfilled_fields);
5575 warning_init (OPT_Wmissing_field_initializers,
5576 "missing initializer");
5577 RESTORE_SPELLING_DEPTH (constructor_depth);
5581 /* Pad out the end of the structure. */
5582 if (p->replacement_value.value)
5583 /* If this closes a superfluous brace pair,
5584 just pass out the element between them. */
5585 ret = p->replacement_value;
5586 else if (constructor_type == 0)
5588 else if (TREE_CODE (constructor_type) != RECORD_TYPE
5589 && TREE_CODE (constructor_type) != UNION_TYPE
5590 && TREE_CODE (constructor_type) != ARRAY_TYPE
5591 && TREE_CODE (constructor_type) != VECTOR_TYPE)
5593 /* A nonincremental scalar initializer--just return
5594 the element, after verifying there is just one. */
5595 if (VEC_empty (constructor_elt,constructor_elements))
5597 if (!constructor_erroneous)
5598 error_init ("empty scalar initializer");
5599 ret.value = error_mark_node;
5601 else if (VEC_length (constructor_elt,constructor_elements) != 1)
5603 error_init ("extra elements in scalar initializer");
5604 ret.value = VEC_index (constructor_elt,constructor_elements,0)->value;
5607 ret.value = VEC_index (constructor_elt,constructor_elements,0)->value;
5611 if (constructor_erroneous)
5612 ret.value = error_mark_node;
5615 ret.value = build_constructor (constructor_type,
5616 constructor_elements);
5617 if (constructor_constant)
5618 TREE_CONSTANT (ret.value) = 1;
5619 if (constructor_constant && constructor_simple)
5620 TREE_STATIC (ret.value) = 1;
5624 constructor_type = p->type;
5625 constructor_fields = p->fields;
5626 constructor_index = p->index;
5627 constructor_max_index = p->max_index;
5628 constructor_unfilled_index = p->unfilled_index;
5629 constructor_unfilled_fields = p->unfilled_fields;
5630 constructor_bit_index = p->bit_index;
5631 constructor_elements = p->elements;
5632 constructor_constant = p->constant;
5633 constructor_simple = p->simple;
5634 constructor_erroneous = p->erroneous;
5635 constructor_incremental = p->incremental;
5636 constructor_designated = p->designated;
5637 constructor_pending_elts = p->pending_elts;
5638 constructor_depth = p->depth;
5640 constructor_range_stack = p->range_stack;
5641 RESTORE_SPELLING_DEPTH (constructor_depth);
5643 constructor_stack = p->next;
5646 if (ret.value == 0 && constructor_stack == 0)
5647 ret.value = error_mark_node;
5651 /* Common handling for both array range and field name designators.
5652 ARRAY argument is nonzero for array ranges. Returns zero for success. */
5655 set_designator (int array)
5658 enum tree_code subcode;
5660 /* Don't die if an entire brace-pair level is superfluous
5661 in the containing level. */
5662 if (constructor_type == 0)
5665 /* If there were errors in this designator list already, bail out
5667 if (designator_erroneous)
5670 if (!designator_depth)
5672 gcc_assert (!constructor_range_stack);
5674 /* Designator list starts at the level of closest explicit
5676 while (constructor_stack->implicit)
5677 process_init_element (pop_init_level (1));
5678 constructor_designated = 1;
5682 switch (TREE_CODE (constructor_type))
5686 subtype = TREE_TYPE (constructor_fields);
5687 if (subtype != error_mark_node)
5688 subtype = TYPE_MAIN_VARIANT (subtype);
5691 subtype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
5697 subcode = TREE_CODE (subtype);
5698 if (array && subcode != ARRAY_TYPE)
5700 error_init ("array index in non-array initializer");
5703 else if (!array && subcode != RECORD_TYPE && subcode != UNION_TYPE)
5705 error_init ("field name not in record or union initializer");
5709 constructor_designated = 1;
5710 push_init_level (2);
5714 /* If there are range designators in designator list, push a new designator
5715 to constructor_range_stack. RANGE_END is end of such stack range or
5716 NULL_TREE if there is no range designator at this level. */
5719 push_range_stack (tree range_end)
5721 struct constructor_range_stack *p;
5723 p = GGC_NEW (struct constructor_range_stack);
5724 p->prev = constructor_range_stack;
5726 p->fields = constructor_fields;
5727 p->range_start = constructor_index;
5728 p->index = constructor_index;
5729 p->stack = constructor_stack;
5730 p->range_end = range_end;
5731 if (constructor_range_stack)
5732 constructor_range_stack->next = p;
5733 constructor_range_stack = p;
5736 /* Within an array initializer, specify the next index to be initialized.
5737 FIRST is that index. If LAST is nonzero, then initialize a range
5738 of indices, running from FIRST through LAST. */
5741 set_init_index (tree first, tree last)
5743 if (set_designator (1))
5746 designator_erroneous = 1;
5748 if (!INTEGRAL_TYPE_P (TREE_TYPE (first))
5749 || (last && !INTEGRAL_TYPE_P (TREE_TYPE (last))))
5751 error_init ("array index in initializer not of integer type");
5755 if (TREE_CODE (first) != INTEGER_CST)
5756 error_init ("nonconstant array index in initializer");
5757 else if (last != 0 && TREE_CODE (last) != INTEGER_CST)
5758 error_init ("nonconstant array index in initializer");
5759 else if (TREE_CODE (constructor_type) != ARRAY_TYPE)
5760 error_init ("array index in non-array initializer");
5761 else if (tree_int_cst_sgn (first) == -1)
5762 error_init ("array index in initializer exceeds array bounds");
5763 else if (constructor_max_index
5764 && tree_int_cst_lt (constructor_max_index, first))
5765 error_init ("array index in initializer exceeds array bounds");
5768 constructor_index = convert (bitsizetype, first);
5772 if (tree_int_cst_equal (first, last))
5774 else if (tree_int_cst_lt (last, first))
5776 error_init ("empty index range in initializer");
5781 last = convert (bitsizetype, last);
5782 if (constructor_max_index != 0
5783 && tree_int_cst_lt (constructor_max_index, last))
5785 error_init ("array index range in initializer exceeds array bounds");
5792 designator_erroneous = 0;
5793 if (constructor_range_stack || last)
5794 push_range_stack (last);
5798 /* Within a struct initializer, specify the next field to be initialized. */
5801 set_init_label (tree fieldname)
5805 if (set_designator (0))
5808 designator_erroneous = 1;
5810 if (TREE_CODE (constructor_type) != RECORD_TYPE
5811 && TREE_CODE (constructor_type) != UNION_TYPE)
5813 error_init ("field name not in record or union initializer");
5817 for (tail = TYPE_FIELDS (constructor_type); tail;
5818 tail = TREE_CHAIN (tail))
5820 if (DECL_NAME (tail) == fieldname)
5825 error ("unknown field %qE specified in initializer", fieldname);
5828 constructor_fields = tail;
5830 designator_erroneous = 0;
5831 if (constructor_range_stack)
5832 push_range_stack (NULL_TREE);
5836 /* Add a new initializer to the tree of pending initializers. PURPOSE
5837 identifies the initializer, either array index or field in a structure.
5838 VALUE is the value of that index or field. */
5841 add_pending_init (tree purpose, tree value)
5843 struct init_node *p, **q, *r;
5845 q = &constructor_pending_elts;
5848 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5853 if (tree_int_cst_lt (purpose, p->purpose))
5855 else if (tree_int_cst_lt (p->purpose, purpose))
5859 if (TREE_SIDE_EFFECTS (p->value))
5860 warning_init (0, "initialized field with side-effects overwritten");
5861 else if (warn_override_init)
5862 warning_init (OPT_Woverride_init, "initialized field overwritten");
5872 bitpos = bit_position (purpose);
5876 if (tree_int_cst_lt (bitpos, bit_position (p->purpose)))
5878 else if (p->purpose != purpose)
5882 if (TREE_SIDE_EFFECTS (p->value))
5883 warning_init (0, "initialized field with side-effects overwritten");
5884 else if (warn_override_init)
5885 warning_init (OPT_Woverride_init, "initialized field overwritten");
5892 r = GGC_NEW (struct init_node);
5893 r->purpose = purpose;
5904 struct init_node *s;
5908 if (p->balance == 0)
5910 else if (p->balance < 0)
5917 p->left->parent = p;
5934 constructor_pending_elts = r;
5939 struct init_node *t = r->right;
5943 r->right->parent = r;
5948 p->left->parent = p;
5951 p->balance = t->balance < 0;
5952 r->balance = -(t->balance > 0);
5967 constructor_pending_elts = t;
5973 /* p->balance == +1; growth of left side balances the node. */
5978 else /* r == p->right */
5980 if (p->balance == 0)
5981 /* Growth propagation from right side. */
5983 else if (p->balance > 0)
5990 p->right->parent = p;
6007 constructor_pending_elts = r;
6009 else /* r->balance == -1 */
6012 struct init_node *t = r->left;
6016 r->left->parent = r;
6021 p->right->parent = p;
6024 r->balance = (t->balance < 0);
6025 p->balance = -(t->balance > 0);
6040 constructor_pending_elts = t;
6046 /* p->balance == -1; growth of right side balances the node. */
6057 /* Build AVL tree from a sorted chain. */
6060 set_nonincremental_init (void)
6062 unsigned HOST_WIDE_INT ix;
6065 if (TREE_CODE (constructor_type) != RECORD_TYPE
6066 && TREE_CODE (constructor_type) != ARRAY_TYPE)
6069 FOR_EACH_CONSTRUCTOR_ELT (constructor_elements, ix, index, value)
6070 add_pending_init (index, value);
6071 constructor_elements = 0;
6072 if (TREE_CODE (constructor_type) == RECORD_TYPE)
6074 constructor_unfilled_fields = TYPE_FIELDS (constructor_type);
6075 /* Skip any nameless bit fields at the beginning. */
6076 while (constructor_unfilled_fields != 0
6077 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
6078 && DECL_NAME (constructor_unfilled_fields) == 0)
6079 constructor_unfilled_fields = TREE_CHAIN (constructor_unfilled_fields);
6082 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6084 if (TYPE_DOMAIN (constructor_type))
6085 constructor_unfilled_index
6086 = convert (bitsizetype,
6087 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
6089 constructor_unfilled_index = bitsize_zero_node;
6091 constructor_incremental = 0;
6094 /* Build AVL tree from a string constant. */
6097 set_nonincremental_init_from_string (tree str)
6099 tree value, purpose, type;
6100 HOST_WIDE_INT val[2];
6101 const char *p, *end;
6102 int byte, wchar_bytes, charwidth, bitpos;
6104 gcc_assert (TREE_CODE (constructor_type) == ARRAY_TYPE);
6106 wchar_bytes = TYPE_PRECISION (TREE_TYPE (TREE_TYPE (str))) / BITS_PER_UNIT;
6107 charwidth = TYPE_PRECISION (char_type_node);
6108 type = TREE_TYPE (constructor_type);
6109 p = TREE_STRING_POINTER (str);
6110 end = p + TREE_STRING_LENGTH (str);
6112 for (purpose = bitsize_zero_node;
6113 p < end && !tree_int_cst_lt (constructor_max_index, purpose);
6114 purpose = size_binop (PLUS_EXPR, purpose, bitsize_one_node))
6116 if (wchar_bytes == 1)
6118 val[1] = (unsigned char) *p++;
6125 for (byte = 0; byte < wchar_bytes; byte++)
6127 if (BYTES_BIG_ENDIAN)
6128 bitpos = (wchar_bytes - byte - 1) * charwidth;
6130 bitpos = byte * charwidth;
6131 val[bitpos < HOST_BITS_PER_WIDE_INT]
6132 |= ((unsigned HOST_WIDE_INT) ((unsigned char) *p++))
6133 << (bitpos % HOST_BITS_PER_WIDE_INT);
6137 if (!TYPE_UNSIGNED (type))
6139 bitpos = ((wchar_bytes - 1) * charwidth) + HOST_BITS_PER_CHAR;
6140 if (bitpos < HOST_BITS_PER_WIDE_INT)
6142 if (val[1] & (((HOST_WIDE_INT) 1) << (bitpos - 1)))
6144 val[1] |= ((HOST_WIDE_INT) -1) << bitpos;
6148 else if (bitpos == HOST_BITS_PER_WIDE_INT)
6153 else if (val[0] & (((HOST_WIDE_INT) 1)
6154 << (bitpos - 1 - HOST_BITS_PER_WIDE_INT)))
6155 val[0] |= ((HOST_WIDE_INT) -1)
6156 << (bitpos - HOST_BITS_PER_WIDE_INT);
6159 value = build_int_cst_wide (type, val[1], val[0]);
6160 add_pending_init (purpose, value);
6163 constructor_incremental = 0;
6166 /* Return value of FIELD in pending initializer or zero if the field was
6167 not initialized yet. */
6170 find_init_member (tree field)
6172 struct init_node *p;
6174 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6176 if (constructor_incremental
6177 && tree_int_cst_lt (field, constructor_unfilled_index))
6178 set_nonincremental_init ();
6180 p = constructor_pending_elts;
6183 if (tree_int_cst_lt (field, p->purpose))
6185 else if (tree_int_cst_lt (p->purpose, field))
6191 else if (TREE_CODE (constructor_type) == RECORD_TYPE)
6193 tree bitpos = bit_position (field);
6195 if (constructor_incremental
6196 && (!constructor_unfilled_fields
6197 || tree_int_cst_lt (bitpos,
6198 bit_position (constructor_unfilled_fields))))
6199 set_nonincremental_init ();
6201 p = constructor_pending_elts;
6204 if (field == p->purpose)
6206 else if (tree_int_cst_lt (bitpos, bit_position (p->purpose)))
6212 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6214 if (!VEC_empty (constructor_elt, constructor_elements)
6215 && (VEC_last (constructor_elt, constructor_elements)->index
6217 return VEC_last (constructor_elt, constructor_elements)->value;
6222 /* "Output" the next constructor element.
6223 At top level, really output it to assembler code now.
6224 Otherwise, collect it in a list from which we will make a CONSTRUCTOR.
6225 TYPE is the data type that the containing data type wants here.
6226 FIELD is the field (a FIELD_DECL) or the index that this element fills.
6227 If VALUE is a string constant, STRICT_STRING is true if it is
6228 unparenthesized or we should not warn here for it being parenthesized.
6229 For other types of VALUE, STRICT_STRING is not used.
6231 PENDING if non-nil means output pending elements that belong
6232 right after this element. (PENDING is normally 1;
6233 it is 0 while outputting pending elements, to avoid recursion.) */
6236 output_init_element (tree value, bool strict_string, tree type, tree field,
6239 constructor_elt *celt;
6241 if (type == error_mark_node || value == error_mark_node)
6243 constructor_erroneous = 1;
6246 if (TREE_CODE (TREE_TYPE (value)) == ARRAY_TYPE
6247 && (TREE_CODE (value) == STRING_CST
6248 || TREE_CODE (value) == COMPOUND_LITERAL_EXPR)
6249 && !(TREE_CODE (value) == STRING_CST
6250 && TREE_CODE (type) == ARRAY_TYPE
6251 && INTEGRAL_TYPE_P (TREE_TYPE (type)))
6252 && !comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (value)),
6253 TYPE_MAIN_VARIANT (type)))
6254 value = array_to_pointer_conversion (value);
6256 if (TREE_CODE (value) == COMPOUND_LITERAL_EXPR
6257 && require_constant_value && !flag_isoc99 && pending)
6259 /* As an extension, allow initializing objects with static storage
6260 duration with compound literals (which are then treated just as
6261 the brace enclosed list they contain). */
6262 tree decl = COMPOUND_LITERAL_EXPR_DECL (value);
6263 value = DECL_INITIAL (decl);
6266 if (value == error_mark_node)
6267 constructor_erroneous = 1;
6268 else if (!TREE_CONSTANT (value))
6269 constructor_constant = 0;
6270 else if (!initializer_constant_valid_p (value, TREE_TYPE (value))
6271 || ((TREE_CODE (constructor_type) == RECORD_TYPE
6272 || TREE_CODE (constructor_type) == UNION_TYPE)
6273 && DECL_C_BIT_FIELD (field)
6274 && TREE_CODE (value) != INTEGER_CST))
6275 constructor_simple = 0;
6277 if (!initializer_constant_valid_p (value, TREE_TYPE (value)))
6279 if (require_constant_value)
6281 error_init ("initializer element is not constant");
6282 value = error_mark_node;
6284 else if (require_constant_elements)
6285 pedwarn (0, "initializer element is not computable at load time");
6288 /* If this field is empty (and not at the end of structure),
6289 don't do anything other than checking the initializer. */
6291 && (TREE_TYPE (field) == error_mark_node
6292 || (COMPLETE_TYPE_P (TREE_TYPE (field))
6293 && integer_zerop (TYPE_SIZE (TREE_TYPE (field)))
6294 && (TREE_CODE (constructor_type) == ARRAY_TYPE
6295 || TREE_CHAIN (field)))))
6298 value = digest_init (type, value, strict_string, require_constant_value);
6299 if (value == error_mark_node)
6301 constructor_erroneous = 1;
6305 /* If this element doesn't come next in sequence,
6306 put it on constructor_pending_elts. */
6307 if (TREE_CODE (constructor_type) == ARRAY_TYPE
6308 && (!constructor_incremental
6309 || !tree_int_cst_equal (field, constructor_unfilled_index)))
6311 if (constructor_incremental
6312 && tree_int_cst_lt (field, constructor_unfilled_index))
6313 set_nonincremental_init ();
6315 add_pending_init (field, value);
6318 else if (TREE_CODE (constructor_type) == RECORD_TYPE
6319 && (!constructor_incremental
6320 || field != constructor_unfilled_fields))
6322 /* We do this for records but not for unions. In a union,
6323 no matter which field is specified, it can be initialized
6324 right away since it starts at the beginning of the union. */
6325 if (constructor_incremental)
6327 if (!constructor_unfilled_fields)
6328 set_nonincremental_init ();
6331 tree bitpos, unfillpos;
6333 bitpos = bit_position (field);
6334 unfillpos = bit_position (constructor_unfilled_fields);
6336 if (tree_int_cst_lt (bitpos, unfillpos))
6337 set_nonincremental_init ();
6341 add_pending_init (field, value);
6344 else if (TREE_CODE (constructor_type) == UNION_TYPE
6345 && !VEC_empty (constructor_elt, constructor_elements))
6347 if (TREE_SIDE_EFFECTS (VEC_last (constructor_elt,
6348 constructor_elements)->value))
6349 warning_init (0, "initialized field with side-effects overwritten");
6350 else if (warn_override_init)
6351 warning_init (OPT_Woverride_init, "initialized field overwritten");
6353 /* We can have just one union field set. */
6354 constructor_elements = 0;
6357 /* Otherwise, output this element either to
6358 constructor_elements or to the assembler file. */
6360 celt = VEC_safe_push (constructor_elt, gc, constructor_elements, NULL);
6361 celt->index = field;
6362 celt->value = value;
6364 /* Advance the variable that indicates sequential elements output. */
6365 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6366 constructor_unfilled_index
6367 = size_binop (PLUS_EXPR, constructor_unfilled_index,
6369 else if (TREE_CODE (constructor_type) == RECORD_TYPE)
6371 constructor_unfilled_fields
6372 = TREE_CHAIN (constructor_unfilled_fields);
6374 /* Skip any nameless bit fields. */
6375 while (constructor_unfilled_fields != 0
6376 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
6377 && DECL_NAME (constructor_unfilled_fields) == 0)
6378 constructor_unfilled_fields =
6379 TREE_CHAIN (constructor_unfilled_fields);
6381 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6382 constructor_unfilled_fields = 0;
6384 /* Now output any pending elements which have become next. */
6386 output_pending_init_elements (0);
6389 /* Output any pending elements which have become next.
6390 As we output elements, constructor_unfilled_{fields,index}
6391 advances, which may cause other elements to become next;
6392 if so, they too are output.
6394 If ALL is 0, we return when there are
6395 no more pending elements to output now.
6397 If ALL is 1, we output space as necessary so that
6398 we can output all the pending elements. */
6401 output_pending_init_elements (int all)
6403 struct init_node *elt = constructor_pending_elts;
6408 /* Look through the whole pending tree.
6409 If we find an element that should be output now,
6410 output it. Otherwise, set NEXT to the element
6411 that comes first among those still pending. */
6416 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6418 if (tree_int_cst_equal (elt->purpose,
6419 constructor_unfilled_index))
6420 output_init_element (elt->value, true,
6421 TREE_TYPE (constructor_type),
6422 constructor_unfilled_index, 0);
6423 else if (tree_int_cst_lt (constructor_unfilled_index,
6426 /* Advance to the next smaller node. */
6431 /* We have reached the smallest node bigger than the
6432 current unfilled index. Fill the space first. */
6433 next = elt->purpose;
6439 /* Advance to the next bigger node. */
6444 /* We have reached the biggest node in a subtree. Find
6445 the parent of it, which is the next bigger node. */
6446 while (elt->parent && elt->parent->right == elt)
6449 if (elt && tree_int_cst_lt (constructor_unfilled_index,
6452 next = elt->purpose;
6458 else if (TREE_CODE (constructor_type) == RECORD_TYPE
6459 || TREE_CODE (constructor_type) == UNION_TYPE)
6461 tree ctor_unfilled_bitpos, elt_bitpos;
6463 /* If the current record is complete we are done. */
6464 if (constructor_unfilled_fields == 0)
6467 ctor_unfilled_bitpos = bit_position (constructor_unfilled_fields);
6468 elt_bitpos = bit_position (elt->purpose);
6469 /* We can't compare fields here because there might be empty
6470 fields in between. */
6471 if (tree_int_cst_equal (elt_bitpos, ctor_unfilled_bitpos))
6473 constructor_unfilled_fields = elt->purpose;
6474 output_init_element (elt->value, true, TREE_TYPE (elt->purpose),
6477 else if (tree_int_cst_lt (ctor_unfilled_bitpos, elt_bitpos))
6479 /* Advance to the next smaller node. */
6484 /* We have reached the smallest node bigger than the
6485 current unfilled field. Fill the space first. */
6486 next = elt->purpose;
6492 /* Advance to the next bigger node. */
6497 /* We have reached the biggest node in a subtree. Find
6498 the parent of it, which is the next bigger node. */
6499 while (elt->parent && elt->parent->right == elt)
6503 && (tree_int_cst_lt (ctor_unfilled_bitpos,
6504 bit_position (elt->purpose))))
6506 next = elt->purpose;
6514 /* Ordinarily return, but not if we want to output all
6515 and there are elements left. */
6516 if (!(all && next != 0))
6519 /* If it's not incremental, just skip over the gap, so that after
6520 jumping to retry we will output the next successive element. */
6521 if (TREE_CODE (constructor_type) == RECORD_TYPE
6522 || TREE_CODE (constructor_type) == UNION_TYPE)
6523 constructor_unfilled_fields = next;
6524 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6525 constructor_unfilled_index = next;
6527 /* ELT now points to the node in the pending tree with the next
6528 initializer to output. */
6532 /* Add one non-braced element to the current constructor level.
6533 This adjusts the current position within the constructor's type.
6534 This may also start or terminate implicit levels
6535 to handle a partly-braced initializer.
6537 Once this has found the correct level for the new element,
6538 it calls output_init_element. */
6541 process_init_element (struct c_expr value)
6543 tree orig_value = value.value;
6544 int string_flag = orig_value != 0 && TREE_CODE (orig_value) == STRING_CST;
6545 bool strict_string = value.original_code == STRING_CST;
6547 designator_depth = 0;
6548 designator_erroneous = 0;
6550 /* Handle superfluous braces around string cst as in
6551 char x[] = {"foo"}; */
6554 && TREE_CODE (constructor_type) == ARRAY_TYPE
6555 && INTEGRAL_TYPE_P (TREE_TYPE (constructor_type))
6556 && integer_zerop (constructor_unfilled_index))
6558 if (constructor_stack->replacement_value.value)
6559 error_init ("excess elements in char array initializer");
6560 constructor_stack->replacement_value = value;
6564 if (constructor_stack->replacement_value.value != 0)
6566 error_init ("excess elements in struct initializer");
6570 /* Ignore elements of a brace group if it is entirely superfluous
6571 and has already been diagnosed. */
6572 if (constructor_type == 0)
6575 /* If we've exhausted any levels that didn't have braces,
6577 while (constructor_stack->implicit)
6579 if ((TREE_CODE (constructor_type) == RECORD_TYPE
6580 || TREE_CODE (constructor_type) == UNION_TYPE)
6581 && constructor_fields == 0)
6582 process_init_element (pop_init_level (1));
6583 else if (TREE_CODE (constructor_type) == ARRAY_TYPE
6584 && (constructor_max_index == 0
6585 || tree_int_cst_lt (constructor_max_index,
6586 constructor_index)))
6587 process_init_element (pop_init_level (1));
6592 /* In the case of [LO ... HI] = VALUE, only evaluate VALUE once. */
6593 if (constructor_range_stack)
6595 /* If value is a compound literal and we'll be just using its
6596 content, don't put it into a SAVE_EXPR. */
6597 if (TREE_CODE (value.value) != COMPOUND_LITERAL_EXPR
6598 || !require_constant_value
6600 value.value = save_expr (value.value);
6605 if (TREE_CODE (constructor_type) == RECORD_TYPE)
6608 enum tree_code fieldcode;
6610 if (constructor_fields == 0)
6612 pedwarn_init (0, "excess elements in struct initializer");
6616 fieldtype = TREE_TYPE (constructor_fields);
6617 if (fieldtype != error_mark_node)
6618 fieldtype = TYPE_MAIN_VARIANT (fieldtype);
6619 fieldcode = TREE_CODE (fieldtype);
6621 /* Error for non-static initialization of a flexible array member. */
6622 if (fieldcode == ARRAY_TYPE
6623 && !require_constant_value
6624 && TYPE_SIZE (fieldtype) == NULL_TREE
6625 && TREE_CHAIN (constructor_fields) == NULL_TREE)
6627 error_init ("non-static initialization of a flexible array member");
6631 /* Accept a string constant to initialize a subarray. */
6632 if (value.value != 0
6633 && fieldcode == ARRAY_TYPE
6634 && INTEGRAL_TYPE_P (TREE_TYPE (fieldtype))
6636 value.value = orig_value;
6637 /* Otherwise, if we have come to a subaggregate,
6638 and we don't have an element of its type, push into it. */
6639 else if (value.value != 0
6640 && value.value != error_mark_node
6641 && TYPE_MAIN_VARIANT (TREE_TYPE (value.value)) != fieldtype
6642 && (fieldcode == RECORD_TYPE || fieldcode == ARRAY_TYPE
6643 || fieldcode == UNION_TYPE))
6645 push_init_level (1);
6651 push_member_name (constructor_fields);
6652 output_init_element (value.value, strict_string,
6653 fieldtype, constructor_fields, 1);
6654 RESTORE_SPELLING_DEPTH (constructor_depth);
6657 /* Do the bookkeeping for an element that was
6658 directly output as a constructor. */
6660 /* For a record, keep track of end position of last field. */
6661 if (DECL_SIZE (constructor_fields))
6662 constructor_bit_index
6663 = size_binop (PLUS_EXPR,
6664 bit_position (constructor_fields),
6665 DECL_SIZE (constructor_fields));
6667 /* If the current field was the first one not yet written out,
6668 it isn't now, so update. */
6669 if (constructor_unfilled_fields == constructor_fields)
6671 constructor_unfilled_fields = TREE_CHAIN (constructor_fields);
6672 /* Skip any nameless bit fields. */
6673 while (constructor_unfilled_fields != 0
6674 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
6675 && DECL_NAME (constructor_unfilled_fields) == 0)
6676 constructor_unfilled_fields =
6677 TREE_CHAIN (constructor_unfilled_fields);
6681 constructor_fields = TREE_CHAIN (constructor_fields);
6682 /* Skip any nameless bit fields at the beginning. */
6683 while (constructor_fields != 0
6684 && DECL_C_BIT_FIELD (constructor_fields)
6685 && DECL_NAME (constructor_fields) == 0)
6686 constructor_fields = TREE_CHAIN (constructor_fields);
6688 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6691 enum tree_code fieldcode;
6693 if (constructor_fields == 0)
6695 pedwarn_init (0, "excess elements in union initializer");
6699 fieldtype = TREE_TYPE (constructor_fields);
6700 if (fieldtype != error_mark_node)
6701 fieldtype = TYPE_MAIN_VARIANT (fieldtype);
6702 fieldcode = TREE_CODE (fieldtype);
6704 /* Warn that traditional C rejects initialization of unions.
6705 We skip the warning if the value is zero. This is done
6706 under the assumption that the zero initializer in user
6707 code appears conditioned on e.g. __STDC__ to avoid
6708 "missing initializer" warnings and relies on default
6709 initialization to zero in the traditional C case.
6710 We also skip the warning if the initializer is designated,
6711 again on the assumption that this must be conditional on
6712 __STDC__ anyway (and we've already complained about the
6713 member-designator already). */
6714 if (!in_system_header && !constructor_designated
6715 && !(value.value && (integer_zerop (value.value)
6716 || real_zerop (value.value))))
6717 warning (OPT_Wtraditional, "traditional C rejects initialization "
6720 /* Accept a string constant to initialize a subarray. */
6721 if (value.value != 0
6722 && fieldcode == ARRAY_TYPE
6723 && INTEGRAL_TYPE_P (TREE_TYPE (fieldtype))
6725 value.value = orig_value;
6726 /* Otherwise, if we have come to a subaggregate,
6727 and we don't have an element of its type, push into it. */
6728 else if (value.value != 0
6729 && value.value != error_mark_node
6730 && TYPE_MAIN_VARIANT (TREE_TYPE (value.value)) != fieldtype
6731 && (fieldcode == RECORD_TYPE || fieldcode == ARRAY_TYPE
6732 || fieldcode == UNION_TYPE))
6734 push_init_level (1);
6740 push_member_name (constructor_fields);
6741 output_init_element (value.value, strict_string,
6742 fieldtype, constructor_fields, 1);
6743 RESTORE_SPELLING_DEPTH (constructor_depth);
6746 /* Do the bookkeeping for an element that was
6747 directly output as a constructor. */
6749 constructor_bit_index = DECL_SIZE (constructor_fields);
6750 constructor_unfilled_fields = TREE_CHAIN (constructor_fields);
6753 constructor_fields = 0;
6755 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6757 tree elttype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
6758 enum tree_code eltcode = TREE_CODE (elttype);
6760 /* Accept a string constant to initialize a subarray. */
6761 if (value.value != 0
6762 && eltcode == ARRAY_TYPE
6763 && INTEGRAL_TYPE_P (TREE_TYPE (elttype))
6765 value.value = orig_value;
6766 /* Otherwise, if we have come to a subaggregate,
6767 and we don't have an element of its type, push into it. */
6768 else if (value.value != 0
6769 && value.value != error_mark_node
6770 && TYPE_MAIN_VARIANT (TREE_TYPE (value.value)) != elttype
6771 && (eltcode == RECORD_TYPE || eltcode == ARRAY_TYPE
6772 || eltcode == UNION_TYPE))
6774 push_init_level (1);
6778 if (constructor_max_index != 0
6779 && (tree_int_cst_lt (constructor_max_index, constructor_index)
6780 || integer_all_onesp (constructor_max_index)))
6782 pedwarn_init (0, "excess elements in array initializer");
6786 /* Now output the actual element. */
6789 push_array_bounds (tree_low_cst (constructor_index, 1));
6790 output_init_element (value.value, strict_string,
6791 elttype, constructor_index, 1);
6792 RESTORE_SPELLING_DEPTH (constructor_depth);
6796 = size_binop (PLUS_EXPR, constructor_index, bitsize_one_node);
6799 /* If we are doing the bookkeeping for an element that was
6800 directly output as a constructor, we must update
6801 constructor_unfilled_index. */
6802 constructor_unfilled_index = constructor_index;
6804 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
6806 tree elttype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
6808 /* Do a basic check of initializer size. Note that vectors
6809 always have a fixed size derived from their type. */
6810 if (tree_int_cst_lt (constructor_max_index, constructor_index))
6812 pedwarn_init (0, "excess elements in vector initializer");
6816 /* Now output the actual element. */
6818 output_init_element (value.value, strict_string,
6819 elttype, constructor_index, 1);
6822 = size_binop (PLUS_EXPR, constructor_index, bitsize_one_node);
6825 /* If we are doing the bookkeeping for an element that was
6826 directly output as a constructor, we must update
6827 constructor_unfilled_index. */
6828 constructor_unfilled_index = constructor_index;
6831 /* Handle the sole element allowed in a braced initializer
6832 for a scalar variable. */
6833 else if (constructor_type != error_mark_node
6834 && constructor_fields == 0)
6836 pedwarn_init (0, "excess elements in scalar initializer");
6842 output_init_element (value.value, strict_string,
6843 constructor_type, NULL_TREE, 1);
6844 constructor_fields = 0;
6847 /* Handle range initializers either at this level or anywhere higher
6848 in the designator stack. */
6849 if (constructor_range_stack)
6851 struct constructor_range_stack *p, *range_stack;
6854 range_stack = constructor_range_stack;
6855 constructor_range_stack = 0;
6856 while (constructor_stack != range_stack->stack)
6858 gcc_assert (constructor_stack->implicit);
6859 process_init_element (pop_init_level (1));
6861 for (p = range_stack;
6862 !p->range_end || tree_int_cst_equal (p->index, p->range_end);
6865 gcc_assert (constructor_stack->implicit);
6866 process_init_element (pop_init_level (1));
6869 p->index = size_binop (PLUS_EXPR, p->index, bitsize_one_node);
6870 if (tree_int_cst_equal (p->index, p->range_end) && !p->prev)
6875 constructor_index = p->index;
6876 constructor_fields = p->fields;
6877 if (finish && p->range_end && p->index == p->range_start)
6885 push_init_level (2);
6886 p->stack = constructor_stack;
6887 if (p->range_end && tree_int_cst_equal (p->index, p->range_end))
6888 p->index = p->range_start;
6892 constructor_range_stack = range_stack;
6899 constructor_range_stack = 0;
6902 /* Build a complete asm-statement, whose components are a CV_QUALIFIER
6903 (guaranteed to be 'volatile' or null) and ARGS (represented using
6904 an ASM_EXPR node). */
6906 build_asm_stmt (tree cv_qualifier, tree args)
6908 if (!ASM_VOLATILE_P (args) && cv_qualifier)
6909 ASM_VOLATILE_P (args) = 1;
6910 return add_stmt (args);
6913 /* Build an asm-expr, whose components are a STRING, some OUTPUTS,
6914 some INPUTS, and some CLOBBERS. The latter three may be NULL.
6915 SIMPLE indicates whether there was anything at all after the
6916 string in the asm expression -- asm("blah") and asm("blah" : )
6917 are subtly different. We use a ASM_EXPR node to represent this. */
6919 build_asm_expr (tree string, tree outputs, tree inputs, tree clobbers,
6925 const char *constraint;
6926 const char **oconstraints;
6927 bool allows_mem, allows_reg, is_inout;
6928 int ninputs, noutputs;
6930 ninputs = list_length (inputs);
6931 noutputs = list_length (outputs);
6932 oconstraints = (const char **) alloca (noutputs * sizeof (const char *));
6934 string = resolve_asm_operand_names (string, outputs, inputs);
6936 /* Remove output conversions that change the type but not the mode. */
6937 for (i = 0, tail = outputs; tail; ++i, tail = TREE_CHAIN (tail))
6939 tree output = TREE_VALUE (tail);
6941 /* ??? Really, this should not be here. Users should be using a
6942 proper lvalue, dammit. But there's a long history of using casts
6943 in the output operands. In cases like longlong.h, this becomes a
6944 primitive form of typechecking -- if the cast can be removed, then
6945 the output operand had a type of the proper width; otherwise we'll
6946 get an error. Gross, but ... */
6947 STRIP_NOPS (output);
6949 if (!lvalue_or_else (output, lv_asm))
6950 output = error_mark_node;
6952 if (output != error_mark_node
6953 && (TREE_READONLY (output)
6954 || TYPE_READONLY (TREE_TYPE (output))
6955 || ((TREE_CODE (TREE_TYPE (output)) == RECORD_TYPE
6956 || TREE_CODE (TREE_TYPE (output)) == UNION_TYPE)
6957 && C_TYPE_FIELDS_READONLY (TREE_TYPE (output)))))
6958 readonly_error (output, lv_asm);
6960 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
6961 oconstraints[i] = constraint;
6963 if (parse_output_constraint (&constraint, i, ninputs, noutputs,
6964 &allows_mem, &allows_reg, &is_inout))
6966 /* If the operand is going to end up in memory,
6967 mark it addressable. */
6968 if (!allows_reg && !c_mark_addressable (output))
6969 output = error_mark_node;
6972 output = error_mark_node;
6974 TREE_VALUE (tail) = output;
6977 for (i = 0, tail = inputs; tail; ++i, tail = TREE_CHAIN (tail))
6981 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
6982 input = TREE_VALUE (tail);
6984 if (parse_input_constraint (&constraint, i, ninputs, noutputs, 0,
6985 oconstraints, &allows_mem, &allows_reg))
6987 /* If the operand is going to end up in memory,
6988 mark it addressable. */
6989 if (!allows_reg && allows_mem)
6991 /* Strip the nops as we allow this case. FIXME, this really
6992 should be rejected or made deprecated. */
6994 if (!c_mark_addressable (input))
6995 input = error_mark_node;
6999 input = error_mark_node;
7001 TREE_VALUE (tail) = input;
7004 args = build_stmt (ASM_EXPR, string, outputs, inputs, clobbers);
7006 /* asm statements without outputs, including simple ones, are treated
7008 ASM_INPUT_P (args) = simple;
7009 ASM_VOLATILE_P (args) = (noutputs == 0);
7014 /* Generate a goto statement to LABEL. */
7017 c_finish_goto_label (tree label)
7019 tree decl = lookup_label (label);
7023 if (C_DECL_UNJUMPABLE_STMT_EXPR (decl))
7025 error ("jump into statement expression");
7029 if (C_DECL_UNJUMPABLE_VM (decl))
7031 error ("jump into scope of identifier with variably modified type");
7035 if (!C_DECL_UNDEFINABLE_STMT_EXPR (decl))
7037 /* No jump from outside this statement expression context, so
7038 record that there is a jump from within this context. */
7039 struct c_label_list *nlist;
7040 nlist = XOBNEW (&parser_obstack, struct c_label_list);
7041 nlist->next = label_context_stack_se->labels_used;
7042 nlist->label = decl;
7043 label_context_stack_se->labels_used = nlist;
7046 if (!C_DECL_UNDEFINABLE_VM (decl))
7048 /* No jump from outside this context context of identifiers with
7049 variably modified type, so record that there is a jump from
7050 within this context. */
7051 struct c_label_list *nlist;
7052 nlist = XOBNEW (&parser_obstack, struct c_label_list);
7053 nlist->next = label_context_stack_vm->labels_used;
7054 nlist->label = decl;
7055 label_context_stack_vm->labels_used = nlist;
7058 TREE_USED (decl) = 1;
7059 return add_stmt (build1 (GOTO_EXPR, void_type_node, decl));
7062 /* Generate a computed goto statement to EXPR. */
7065 c_finish_goto_ptr (tree expr)
7067 pedwarn (OPT_pedantic, "ISO C forbids %<goto *expr;%>");
7068 expr = convert (ptr_type_node, expr);
7069 return add_stmt (build1 (GOTO_EXPR, void_type_node, expr));
7072 /* Generate a C `return' statement. RETVAL is the expression for what
7073 to return, or a null pointer for `return;' with no value. */
7076 c_finish_return (tree retval)
7078 tree valtype = TREE_TYPE (TREE_TYPE (current_function_decl)), ret_stmt;
7079 bool no_warning = false;
7081 if (TREE_THIS_VOLATILE (current_function_decl))
7082 warning (0, "function declared %<noreturn%> has a %<return%> statement");
7086 current_function_returns_null = 1;
7087 if ((warn_return_type || flag_isoc99)
7088 && valtype != 0 && TREE_CODE (valtype) != VOID_TYPE)
7090 pedwarn_c99 (flag_isoc99 ? 0 : OPT_Wreturn_type,
7091 "%<return%> with no value, in "
7092 "function returning non-void");
7096 else if (valtype == 0 || TREE_CODE (valtype) == VOID_TYPE)
7098 current_function_returns_null = 1;
7099 if (TREE_CODE (TREE_TYPE (retval)) != VOID_TYPE)
7100 pedwarn (0, "%<return%> with a value, in function returning void");
7102 pedwarn (OPT_pedantic, "ISO C forbids "
7103 "%<return%> with expression, in function returning void");
7107 tree t = convert_for_assignment (valtype, retval, ic_return,
7108 NULL_TREE, NULL_TREE, 0);
7109 tree res = DECL_RESULT (current_function_decl);
7112 current_function_returns_value = 1;
7113 if (t == error_mark_node)
7116 inner = t = convert (TREE_TYPE (res), t);
7118 /* Strip any conversions, additions, and subtractions, and see if
7119 we are returning the address of a local variable. Warn if so. */
7122 switch (TREE_CODE (inner))
7124 CASE_CONVERT: case NON_LVALUE_EXPR:
7126 inner = TREE_OPERAND (inner, 0);
7130 /* If the second operand of the MINUS_EXPR has a pointer
7131 type (or is converted from it), this may be valid, so
7132 don't give a warning. */
7134 tree op1 = TREE_OPERAND (inner, 1);
7136 while (!POINTER_TYPE_P (TREE_TYPE (op1))
7137 && (CONVERT_EXPR_P (op1)
7138 || TREE_CODE (op1) == NON_LVALUE_EXPR))
7139 op1 = TREE_OPERAND (op1, 0);
7141 if (POINTER_TYPE_P (TREE_TYPE (op1)))
7144 inner = TREE_OPERAND (inner, 0);
7149 inner = TREE_OPERAND (inner, 0);
7151 while (REFERENCE_CLASS_P (inner)
7152 && TREE_CODE (inner) != INDIRECT_REF)
7153 inner = TREE_OPERAND (inner, 0);
7156 && !DECL_EXTERNAL (inner)
7157 && !TREE_STATIC (inner)
7158 && DECL_CONTEXT (inner) == current_function_decl)
7159 warning (0, "function returns address of local variable");
7169 retval = build2 (MODIFY_EXPR, TREE_TYPE (res), res, t);
7172 ret_stmt = build_stmt (RETURN_EXPR, retval);
7173 TREE_NO_WARNING (ret_stmt) |= no_warning;
7174 return add_stmt (ret_stmt);
7178 /* The SWITCH_EXPR being built. */
7181 /* The original type of the testing expression, i.e. before the
7182 default conversion is applied. */
7185 /* A splay-tree mapping the low element of a case range to the high
7186 element, or NULL_TREE if there is no high element. Used to
7187 determine whether or not a new case label duplicates an old case
7188 label. We need a tree, rather than simply a hash table, because
7189 of the GNU case range extension. */
7192 /* Number of nested statement expressions within this switch
7193 statement; if nonzero, case and default labels may not
7195 unsigned int blocked_stmt_expr;
7197 /* Scope of outermost declarations of identifiers with variably
7198 modified type within this switch statement; if nonzero, case and
7199 default labels may not appear. */
7200 unsigned int blocked_vm;
7202 /* The next node on the stack. */
7203 struct c_switch *next;
7206 /* A stack of the currently active switch statements. The innermost
7207 switch statement is on the top of the stack. There is no need to
7208 mark the stack for garbage collection because it is only active
7209 during the processing of the body of a function, and we never
7210 collect at that point. */
7212 struct c_switch *c_switch_stack;
7214 /* Start a C switch statement, testing expression EXP. Return the new
7218 c_start_case (tree exp)
7220 tree orig_type = error_mark_node;
7221 struct c_switch *cs;
7223 if (exp != error_mark_node)
7225 orig_type = TREE_TYPE (exp);
7227 if (!INTEGRAL_TYPE_P (orig_type))
7229 if (orig_type != error_mark_node)
7231 error ("switch quantity not an integer");
7232 orig_type = error_mark_node;
7234 exp = integer_zero_node;
7238 tree type = TYPE_MAIN_VARIANT (orig_type);
7240 if (!in_system_header
7241 && (type == long_integer_type_node
7242 || type == long_unsigned_type_node))
7243 warning (OPT_Wtraditional, "%<long%> switch expression not "
7244 "converted to %<int%> in ISO C");
7246 exp = default_conversion (exp);
7250 /* Add this new SWITCH_EXPR to the stack. */
7251 cs = XNEW (struct c_switch);
7252 cs->switch_expr = build3 (SWITCH_EXPR, orig_type, exp, NULL_TREE, NULL_TREE);
7253 cs->orig_type = orig_type;
7254 cs->cases = splay_tree_new (case_compare, NULL, NULL);
7255 cs->blocked_stmt_expr = 0;
7257 cs->next = c_switch_stack;
7258 c_switch_stack = cs;
7260 return add_stmt (cs->switch_expr);
7263 /* Process a case label. */
7266 do_case (tree low_value, tree high_value)
7268 tree label = NULL_TREE;
7270 if (c_switch_stack && !c_switch_stack->blocked_stmt_expr
7271 && !c_switch_stack->blocked_vm)
7273 label = c_add_case_label (c_switch_stack->cases,
7274 SWITCH_COND (c_switch_stack->switch_expr),
7275 c_switch_stack->orig_type,
7276 low_value, high_value);
7277 if (label == error_mark_node)
7280 else if (c_switch_stack && c_switch_stack->blocked_stmt_expr)
7283 error ("case label in statement expression not containing "
7284 "enclosing switch statement");
7286 error ("%<default%> label in statement expression not containing "
7287 "enclosing switch statement");
7289 else if (c_switch_stack && c_switch_stack->blocked_vm)
7292 error ("case label in scope of identifier with variably modified "
7293 "type not containing enclosing switch statement");
7295 error ("%<default%> label in scope of identifier with variably "
7296 "modified type not containing enclosing switch statement");
7299 error ("case label not within a switch statement");
7301 error ("%<default%> label not within a switch statement");
7306 /* Finish the switch statement. */
7309 c_finish_case (tree body)
7311 struct c_switch *cs = c_switch_stack;
7312 location_t switch_location;
7314 SWITCH_BODY (cs->switch_expr) = body;
7316 /* We must not be within a statement expression nested in the switch
7317 at this point; we might, however, be within the scope of an
7318 identifier with variably modified type nested in the switch. */
7319 gcc_assert (!cs->blocked_stmt_expr);
7321 /* Emit warnings as needed. */
7322 if (EXPR_HAS_LOCATION (cs->switch_expr))
7323 switch_location = EXPR_LOCATION (cs->switch_expr);
7325 switch_location = input_location;
7326 c_do_switch_warnings (cs->cases, switch_location,
7327 TREE_TYPE (cs->switch_expr),
7328 SWITCH_COND (cs->switch_expr));
7330 /* Pop the stack. */
7331 c_switch_stack = cs->next;
7332 splay_tree_delete (cs->cases);
7336 /* Emit an if statement. IF_LOCUS is the location of the 'if'. COND,
7337 THEN_BLOCK and ELSE_BLOCK are expressions to be used; ELSE_BLOCK
7338 may be null. NESTED_IF is true if THEN_BLOCK contains another IF
7339 statement, and was not surrounded with parenthesis. */
7342 c_finish_if_stmt (location_t if_locus, tree cond, tree then_block,
7343 tree else_block, bool nested_if)
7347 /* Diagnose an ambiguous else if if-then-else is nested inside if-then. */
7348 if (warn_parentheses && nested_if && else_block == NULL)
7350 tree inner_if = then_block;
7352 /* We know from the grammar productions that there is an IF nested
7353 within THEN_BLOCK. Due to labels and c99 conditional declarations,
7354 it might not be exactly THEN_BLOCK, but should be the last
7355 non-container statement within. */
7357 switch (TREE_CODE (inner_if))
7362 inner_if = BIND_EXPR_BODY (inner_if);
7364 case STATEMENT_LIST:
7365 inner_if = expr_last (then_block);
7367 case TRY_FINALLY_EXPR:
7368 case TRY_CATCH_EXPR:
7369 inner_if = TREE_OPERAND (inner_if, 0);
7376 if (COND_EXPR_ELSE (inner_if))
7377 warning (OPT_Wparentheses,
7378 "%Hsuggest explicit braces to avoid ambiguous %<else%>",
7382 empty_if_body_warning (then_block, else_block);
7384 stmt = build3 (COND_EXPR, void_type_node, cond, then_block, else_block);
7385 SET_EXPR_LOCATION (stmt, if_locus);
7389 /* Emit a general-purpose loop construct. START_LOCUS is the location of
7390 the beginning of the loop. COND is the loop condition. COND_IS_FIRST
7391 is false for DO loops. INCR is the FOR increment expression. BODY is
7392 the statement controlled by the loop. BLAB is the break label. CLAB is
7393 the continue label. Everything is allowed to be NULL. */
7396 c_finish_loop (location_t start_locus, tree cond, tree incr, tree body,
7397 tree blab, tree clab, bool cond_is_first)
7399 tree entry = NULL, exit = NULL, t;
7401 /* If the condition is zero don't generate a loop construct. */
7402 if (cond && integer_zerop (cond))
7406 t = build_and_jump (&blab);
7407 SET_EXPR_LOCATION (t, start_locus);
7413 tree top = build1 (LABEL_EXPR, void_type_node, NULL_TREE);
7415 /* If we have an exit condition, then we build an IF with gotos either
7416 out of the loop, or to the top of it. If there's no exit condition,
7417 then we just build a jump back to the top. */
7418 exit = build_and_jump (&LABEL_EXPR_LABEL (top));
7420 if (cond && !integer_nonzerop (cond))
7422 /* Canonicalize the loop condition to the end. This means
7423 generating a branch to the loop condition. Reuse the
7424 continue label, if possible. */
7429 entry = build1 (LABEL_EXPR, void_type_node, NULL_TREE);
7430 t = build_and_jump (&LABEL_EXPR_LABEL (entry));
7433 t = build1 (GOTO_EXPR, void_type_node, clab);
7434 SET_EXPR_LOCATION (t, start_locus);
7438 t = build_and_jump (&blab);
7439 exit = fold_build3 (COND_EXPR, void_type_node, cond, exit, t);
7441 SET_EXPR_LOCATION (exit, start_locus);
7443 SET_EXPR_LOCATION (exit, input_location);
7452 add_stmt (build1 (LABEL_EXPR, void_type_node, clab));
7460 add_stmt (build1 (LABEL_EXPR, void_type_node, blab));
7464 c_finish_bc_stmt (tree *label_p, bool is_break)
7467 tree label = *label_p;
7469 /* In switch statements break is sometimes stylistically used after
7470 a return statement. This can lead to spurious warnings about
7471 control reaching the end of a non-void function when it is
7472 inlined. Note that we are calling block_may_fallthru with
7473 language specific tree nodes; this works because
7474 block_may_fallthru returns true when given something it does not
7476 skip = !block_may_fallthru (cur_stmt_list);
7481 *label_p = label = create_artificial_label ();
7483 else if (TREE_CODE (label) == LABEL_DECL)
7485 else switch (TREE_INT_CST_LOW (label))
7489 error ("break statement not within loop or switch");
7491 error ("continue statement not within a loop");
7495 gcc_assert (is_break);
7496 error ("break statement used with OpenMP for loop");
7507 add_stmt (build_predict_expr (PRED_CONTINUE, NOT_TAKEN));
7509 return add_stmt (build1 (GOTO_EXPR, void_type_node, label));
7512 /* A helper routine for c_process_expr_stmt and c_finish_stmt_expr. */
7515 emit_side_effect_warnings (tree expr)
7517 if (expr == error_mark_node)
7519 else if (!TREE_SIDE_EFFECTS (expr))
7521 if (!VOID_TYPE_P (TREE_TYPE (expr)) && !TREE_NO_WARNING (expr))
7522 warning (OPT_Wunused_value, "%Hstatement with no effect",
7523 EXPR_HAS_LOCATION (expr) ? EXPR_LOCUS (expr) : &input_location);
7526 warn_if_unused_value (expr, input_location);
7529 /* Process an expression as if it were a complete statement. Emit
7530 diagnostics, but do not call ADD_STMT. */
7533 c_process_expr_stmt (tree expr)
7538 if (warn_sequence_point)
7539 verify_sequence_points (expr);
7541 if (TREE_TYPE (expr) != error_mark_node
7542 && !COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (expr))
7543 && TREE_CODE (TREE_TYPE (expr)) != ARRAY_TYPE)
7544 error ("expression statement has incomplete type");
7546 /* If we're not processing a statement expression, warn about unused values.
7547 Warnings for statement expressions will be emitted later, once we figure
7548 out which is the result. */
7549 if (!STATEMENT_LIST_STMT_EXPR (cur_stmt_list)
7550 && warn_unused_value)
7551 emit_side_effect_warnings (expr);
7553 /* If the expression is not of a type to which we cannot assign a line
7554 number, wrap the thing in a no-op NOP_EXPR. */
7555 if (DECL_P (expr) || CONSTANT_CLASS_P (expr))
7556 expr = build1 (NOP_EXPR, TREE_TYPE (expr), expr);
7558 if (CAN_HAVE_LOCATION_P (expr))
7559 SET_EXPR_LOCATION (expr, input_location);
7564 /* Emit an expression as a statement. */
7567 c_finish_expr_stmt (tree expr)
7570 return add_stmt (c_process_expr_stmt (expr));
7575 /* Do the opposite and emit a statement as an expression. To begin,
7576 create a new binding level and return it. */
7579 c_begin_stmt_expr (void)
7582 struct c_label_context_se *nstack;
7583 struct c_label_list *glist;
7585 /* We must force a BLOCK for this level so that, if it is not expanded
7586 later, there is a way to turn off the entire subtree of blocks that
7587 are contained in it. */
7589 ret = c_begin_compound_stmt (true);
7592 c_switch_stack->blocked_stmt_expr++;
7593 gcc_assert (c_switch_stack->blocked_stmt_expr != 0);
7595 for (glist = label_context_stack_se->labels_used;
7597 glist = glist->next)
7599 C_DECL_UNDEFINABLE_STMT_EXPR (glist->label) = 1;
7601 nstack = XOBNEW (&parser_obstack, struct c_label_context_se);
7602 nstack->labels_def = NULL;
7603 nstack->labels_used = NULL;
7604 nstack->next = label_context_stack_se;
7605 label_context_stack_se = nstack;
7607 /* Mark the current statement list as belonging to a statement list. */
7608 STATEMENT_LIST_STMT_EXPR (ret) = 1;
7614 c_finish_stmt_expr (tree body)
7616 tree last, type, tmp, val;
7618 struct c_label_list *dlist, *glist, *glist_prev = NULL;
7620 body = c_end_compound_stmt (body, true);
7623 gcc_assert (c_switch_stack->blocked_stmt_expr != 0);
7624 c_switch_stack->blocked_stmt_expr--;
7626 /* It is no longer possible to jump to labels defined within this
7627 statement expression. */
7628 for (dlist = label_context_stack_se->labels_def;
7630 dlist = dlist->next)
7632 C_DECL_UNJUMPABLE_STMT_EXPR (dlist->label) = 1;
7634 /* It is again possible to define labels with a goto just outside
7635 this statement expression. */
7636 for (glist = label_context_stack_se->next->labels_used;
7638 glist = glist->next)
7640 C_DECL_UNDEFINABLE_STMT_EXPR (glist->label) = 0;
7643 if (glist_prev != NULL)
7644 glist_prev->next = label_context_stack_se->labels_used;
7646 label_context_stack_se->next->labels_used
7647 = label_context_stack_se->labels_used;
7648 label_context_stack_se = label_context_stack_se->next;
7650 /* Locate the last statement in BODY. See c_end_compound_stmt
7651 about always returning a BIND_EXPR. */
7652 last_p = &BIND_EXPR_BODY (body);
7653 last = BIND_EXPR_BODY (body);
7656 if (TREE_CODE (last) == STATEMENT_LIST)
7658 tree_stmt_iterator i;
7660 /* This can happen with degenerate cases like ({ }). No value. */
7661 if (!TREE_SIDE_EFFECTS (last))
7664 /* If we're supposed to generate side effects warnings, process
7665 all of the statements except the last. */
7666 if (warn_unused_value)
7668 for (i = tsi_start (last); !tsi_one_before_end_p (i); tsi_next (&i))
7669 emit_side_effect_warnings (tsi_stmt (i));
7672 i = tsi_last (last);
7673 last_p = tsi_stmt_ptr (i);
7677 /* If the end of the list is exception related, then the list was split
7678 by a call to push_cleanup. Continue searching. */
7679 if (TREE_CODE (last) == TRY_FINALLY_EXPR
7680 || TREE_CODE (last) == TRY_CATCH_EXPR)
7682 last_p = &TREE_OPERAND (last, 0);
7684 goto continue_searching;
7687 /* In the case that the BIND_EXPR is not necessary, return the
7688 expression out from inside it. */
7689 if (last == error_mark_node
7690 || (last == BIND_EXPR_BODY (body)
7691 && BIND_EXPR_VARS (body) == NULL))
7693 /* Do not warn if the return value of a statement expression is
7695 if (CAN_HAVE_LOCATION_P (last))
7696 TREE_NO_WARNING (last) = 1;
7700 /* Extract the type of said expression. */
7701 type = TREE_TYPE (last);
7703 /* If we're not returning a value at all, then the BIND_EXPR that
7704 we already have is a fine expression to return. */
7705 if (!type || VOID_TYPE_P (type))
7708 /* Now that we've located the expression containing the value, it seems
7709 silly to make voidify_wrapper_expr repeat the process. Create a
7710 temporary of the appropriate type and stick it in a TARGET_EXPR. */
7711 tmp = create_tmp_var_raw (type, NULL);
7713 /* Unwrap a no-op NOP_EXPR as added by c_finish_expr_stmt. This avoids
7714 tree_expr_nonnegative_p giving up immediately. */
7716 if (TREE_CODE (val) == NOP_EXPR
7717 && TREE_TYPE (val) == TREE_TYPE (TREE_OPERAND (val, 0)))
7718 val = TREE_OPERAND (val, 0);
7720 *last_p = build2 (MODIFY_EXPR, void_type_node, tmp, val);
7721 SET_EXPR_LOCUS (*last_p, EXPR_LOCUS (last));
7723 return build4 (TARGET_EXPR, type, tmp, body, NULL_TREE, NULL_TREE);
7726 /* Begin the scope of an identifier of variably modified type, scope
7727 number SCOPE. Jumping from outside this scope to inside it is not
7731 c_begin_vm_scope (unsigned int scope)
7733 struct c_label_context_vm *nstack;
7734 struct c_label_list *glist;
7736 gcc_assert (scope > 0);
7738 /* At file_scope, we don't have to do any processing. */
7739 if (label_context_stack_vm == NULL)
7742 if (c_switch_stack && !c_switch_stack->blocked_vm)
7743 c_switch_stack->blocked_vm = scope;
7744 for (glist = label_context_stack_vm->labels_used;
7746 glist = glist->next)
7748 C_DECL_UNDEFINABLE_VM (glist->label) = 1;
7750 nstack = XOBNEW (&parser_obstack, struct c_label_context_vm);
7751 nstack->labels_def = NULL;
7752 nstack->labels_used = NULL;
7753 nstack->scope = scope;
7754 nstack->next = label_context_stack_vm;
7755 label_context_stack_vm = nstack;
7758 /* End a scope which may contain identifiers of variably modified
7759 type, scope number SCOPE. */
7762 c_end_vm_scope (unsigned int scope)
7764 if (label_context_stack_vm == NULL)
7766 if (c_switch_stack && c_switch_stack->blocked_vm == scope)
7767 c_switch_stack->blocked_vm = 0;
7768 /* We may have a number of nested scopes of identifiers with
7769 variably modified type, all at this depth. Pop each in turn. */
7770 while (label_context_stack_vm->scope == scope)
7772 struct c_label_list *dlist, *glist, *glist_prev = NULL;
7774 /* It is no longer possible to jump to labels defined within this
7776 for (dlist = label_context_stack_vm->labels_def;
7778 dlist = dlist->next)
7780 C_DECL_UNJUMPABLE_VM (dlist->label) = 1;
7782 /* It is again possible to define labels with a goto just outside
7784 for (glist = label_context_stack_vm->next->labels_used;
7786 glist = glist->next)
7788 C_DECL_UNDEFINABLE_VM (glist->label) = 0;
7791 if (glist_prev != NULL)
7792 glist_prev->next = label_context_stack_vm->labels_used;
7794 label_context_stack_vm->next->labels_used
7795 = label_context_stack_vm->labels_used;
7796 label_context_stack_vm = label_context_stack_vm->next;
7800 /* Begin and end compound statements. This is as simple as pushing
7801 and popping new statement lists from the tree. */
7804 c_begin_compound_stmt (bool do_scope)
7806 tree stmt = push_stmt_list ();
7813 c_end_compound_stmt (tree stmt, bool do_scope)
7819 if (c_dialect_objc ())
7820 objc_clear_super_receiver ();
7821 block = pop_scope ();
7824 stmt = pop_stmt_list (stmt);
7825 stmt = c_build_bind_expr (block, stmt);
7827 /* If this compound statement is nested immediately inside a statement
7828 expression, then force a BIND_EXPR to be created. Otherwise we'll
7829 do the wrong thing for ({ { 1; } }) or ({ 1; { } }). In particular,
7830 STATEMENT_LISTs merge, and thus we can lose track of what statement
7833 && STATEMENT_LIST_STMT_EXPR (cur_stmt_list)
7834 && TREE_CODE (stmt) != BIND_EXPR)
7836 stmt = build3 (BIND_EXPR, void_type_node, NULL, stmt, NULL);
7837 TREE_SIDE_EFFECTS (stmt) = 1;
7843 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
7844 when the current scope is exited. EH_ONLY is true when this is not
7845 meant to apply to normal control flow transfer. */
7848 push_cleanup (tree ARG_UNUSED (decl), tree cleanup, bool eh_only)
7850 enum tree_code code;
7854 code = eh_only ? TRY_CATCH_EXPR : TRY_FINALLY_EXPR;
7855 stmt = build_stmt (code, NULL, cleanup);
7857 stmt_expr = STATEMENT_LIST_STMT_EXPR (cur_stmt_list);
7858 list = push_stmt_list ();
7859 TREE_OPERAND (stmt, 0) = list;
7860 STATEMENT_LIST_STMT_EXPR (list) = stmt_expr;
7863 /* Build a binary-operation expression without default conversions.
7864 CODE is the kind of expression to build.
7865 This function differs from `build' in several ways:
7866 the data type of the result is computed and recorded in it,
7867 warnings are generated if arg data types are invalid,
7868 special handling for addition and subtraction of pointers is known,
7869 and some optimization is done (operations on narrow ints
7870 are done in the narrower type when that gives the same result).
7871 Constant folding is also done before the result is returned.
7873 Note that the operands will never have enumeral types, or function
7874 or array types, because either they will have the default conversions
7875 performed or they have both just been converted to some other type in which
7876 the arithmetic is to be done. */
7879 build_binary_op (enum tree_code code, tree orig_op0, tree orig_op1,
7883 enum tree_code code0, code1;
7885 const char *invalid_op_diag;
7887 /* Expression code to give to the expression when it is built.
7888 Normally this is CODE, which is what the caller asked for,
7889 but in some special cases we change it. */
7890 enum tree_code resultcode = code;
7892 /* Data type in which the computation is to be performed.
7893 In the simplest cases this is the common type of the arguments. */
7894 tree result_type = NULL;
7896 /* Nonzero means operands have already been type-converted
7897 in whatever way is necessary.
7898 Zero means they need to be converted to RESULT_TYPE. */
7901 /* Nonzero means create the expression with this type, rather than
7903 tree build_type = 0;
7905 /* Nonzero means after finally constructing the expression
7906 convert it to this type. */
7907 tree final_type = 0;
7909 /* Nonzero if this is an operation like MIN or MAX which can
7910 safely be computed in short if both args are promoted shorts.
7911 Also implies COMMON.
7912 -1 indicates a bitwise operation; this makes a difference
7913 in the exact conditions for when it is safe to do the operation
7914 in a narrower mode. */
7917 /* Nonzero if this is a comparison operation;
7918 if both args are promoted shorts, compare the original shorts.
7919 Also implies COMMON. */
7920 int short_compare = 0;
7922 /* Nonzero if this is a right-shift operation, which can be computed on the
7923 original short and then promoted if the operand is a promoted short. */
7924 int short_shift = 0;
7926 /* Nonzero means set RESULT_TYPE to the common type of the args. */
7929 /* True means types are compatible as far as ObjC is concerned. */
7934 op0 = default_conversion (orig_op0);
7935 op1 = default_conversion (orig_op1);
7943 type0 = TREE_TYPE (op0);
7944 type1 = TREE_TYPE (op1);
7946 /* The expression codes of the data types of the arguments tell us
7947 whether the arguments are integers, floating, pointers, etc. */
7948 code0 = TREE_CODE (type0);
7949 code1 = TREE_CODE (type1);
7951 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
7952 STRIP_TYPE_NOPS (op0);
7953 STRIP_TYPE_NOPS (op1);
7955 /* If an error was already reported for one of the arguments,
7956 avoid reporting another error. */
7958 if (code0 == ERROR_MARK || code1 == ERROR_MARK)
7959 return error_mark_node;
7961 if ((invalid_op_diag
7962 = targetm.invalid_binary_op (code, type0, type1)))
7964 error (invalid_op_diag);
7965 return error_mark_node;
7968 objc_ok = objc_compare_types (type0, type1, -3, NULL_TREE);
7973 /* Handle the pointer + int case. */
7974 if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
7975 return pointer_int_sum (PLUS_EXPR, op0, op1);
7976 else if (code1 == POINTER_TYPE && code0 == INTEGER_TYPE)
7977 return pointer_int_sum (PLUS_EXPR, op1, op0);
7983 /* Subtraction of two similar pointers.
7984 We must subtract them as integers, then divide by object size. */
7985 if (code0 == POINTER_TYPE && code1 == POINTER_TYPE
7986 && comp_target_types (type0, type1))
7987 return pointer_diff (op0, op1);
7988 /* Handle pointer minus int. Just like pointer plus int. */
7989 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
7990 return pointer_int_sum (MINUS_EXPR, op0, op1);
7999 case TRUNC_DIV_EXPR:
8001 case FLOOR_DIV_EXPR:
8002 case ROUND_DIV_EXPR:
8003 case EXACT_DIV_EXPR:
8004 warn_for_div_by_zero (op1);
8006 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
8007 || code0 == FIXED_POINT_TYPE
8008 || code0 == COMPLEX_TYPE || code0 == VECTOR_TYPE)
8009 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
8010 || code1 == FIXED_POINT_TYPE
8011 || code1 == COMPLEX_TYPE || code1 == VECTOR_TYPE))
8013 enum tree_code tcode0 = code0, tcode1 = code1;
8015 if (code0 == COMPLEX_TYPE || code0 == VECTOR_TYPE)
8016 tcode0 = TREE_CODE (TREE_TYPE (TREE_TYPE (op0)));
8017 if (code1 == COMPLEX_TYPE || code1 == VECTOR_TYPE)
8018 tcode1 = TREE_CODE (TREE_TYPE (TREE_TYPE (op1)));
8020 if (!((tcode0 == INTEGER_TYPE && tcode1 == INTEGER_TYPE)
8021 || (tcode0 == FIXED_POINT_TYPE && tcode1 == FIXED_POINT_TYPE)))
8022 resultcode = RDIV_EXPR;
8024 /* Although it would be tempting to shorten always here, that
8025 loses on some targets, since the modulo instruction is
8026 undefined if the quotient can't be represented in the
8027 computation mode. We shorten only if unsigned or if
8028 dividing by something we know != -1. */
8029 shorten = (TYPE_UNSIGNED (TREE_TYPE (orig_op0))
8030 || (TREE_CODE (op1) == INTEGER_CST
8031 && !integer_all_onesp (op1)));
8039 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
8041 /* Allow vector types which are not floating point types. */
8042 else if (code0 == VECTOR_TYPE
8043 && code1 == VECTOR_TYPE
8044 && !VECTOR_FLOAT_TYPE_P (type0)
8045 && !VECTOR_FLOAT_TYPE_P (type1))
8049 case TRUNC_MOD_EXPR:
8050 case FLOOR_MOD_EXPR:
8051 warn_for_div_by_zero (op1);
8053 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
8055 /* Although it would be tempting to shorten always here, that loses
8056 on some targets, since the modulo instruction is undefined if the
8057 quotient can't be represented in the computation mode. We shorten
8058 only if unsigned or if dividing by something we know != -1. */
8059 shorten = (TYPE_UNSIGNED (TREE_TYPE (orig_op0))
8060 || (TREE_CODE (op1) == INTEGER_CST
8061 && !integer_all_onesp (op1)));
8066 case TRUTH_ANDIF_EXPR:
8067 case TRUTH_ORIF_EXPR:
8068 case TRUTH_AND_EXPR:
8070 case TRUTH_XOR_EXPR:
8071 if ((code0 == INTEGER_TYPE || code0 == POINTER_TYPE
8072 || code0 == REAL_TYPE || code0 == COMPLEX_TYPE
8073 || code0 == FIXED_POINT_TYPE)
8074 && (code1 == INTEGER_TYPE || code1 == POINTER_TYPE
8075 || code1 == REAL_TYPE || code1 == COMPLEX_TYPE
8076 || code1 == FIXED_POINT_TYPE))
8078 /* Result of these operations is always an int,
8079 but that does not mean the operands should be
8080 converted to ints! */
8081 result_type = integer_type_node;
8082 op0 = c_common_truthvalue_conversion (op0);
8083 op1 = c_common_truthvalue_conversion (op1);
8088 /* Shift operations: result has same type as first operand;
8089 always convert second operand to int.
8090 Also set SHORT_SHIFT if shifting rightward. */
8093 if ((code0 == INTEGER_TYPE || code0 == FIXED_POINT_TYPE)
8094 && code1 == INTEGER_TYPE)
8096 if (TREE_CODE (op1) == INTEGER_CST && skip_evaluation == 0)
8098 if (tree_int_cst_sgn (op1) < 0)
8099 warning (0, "right shift count is negative");
8102 if (!integer_zerop (op1))
8105 if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
8106 warning (0, "right shift count >= width of type");
8110 /* Use the type of the value to be shifted. */
8111 result_type = type0;
8112 /* Convert the shift-count to an integer, regardless of size
8113 of value being shifted. */
8114 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
8115 op1 = convert (integer_type_node, op1);
8116 /* Avoid converting op1 to result_type later. */
8122 if ((code0 == INTEGER_TYPE || code0 == FIXED_POINT_TYPE)
8123 && code1 == INTEGER_TYPE)
8125 if (TREE_CODE (op1) == INTEGER_CST && skip_evaluation == 0)
8127 if (tree_int_cst_sgn (op1) < 0)
8128 warning (0, "left shift count is negative");
8130 else if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
8131 warning (0, "left shift count >= width of type");
8134 /* Use the type of the value to be shifted. */
8135 result_type = type0;
8136 /* Convert the shift-count to an integer, regardless of size
8137 of value being shifted. */
8138 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
8139 op1 = convert (integer_type_node, op1);
8140 /* Avoid converting op1 to result_type later. */
8147 if (FLOAT_TYPE_P (type0) || FLOAT_TYPE_P (type1))
8148 warning (OPT_Wfloat_equal,
8149 "comparing floating point with == or != is unsafe");
8150 /* Result of comparison is always int,
8151 but don't convert the args to int! */
8152 build_type = integer_type_node;
8153 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
8154 || code0 == FIXED_POINT_TYPE || code0 == COMPLEX_TYPE)
8155 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
8156 || code1 == FIXED_POINT_TYPE || code1 == COMPLEX_TYPE))
8158 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
8160 tree tt0 = TREE_TYPE (type0);
8161 tree tt1 = TREE_TYPE (type1);
8162 /* Anything compares with void *. void * compares with anything.
8163 Otherwise, the targets must be compatible
8164 and both must be object or both incomplete. */
8165 if (comp_target_types (type0, type1))
8166 result_type = common_pointer_type (type0, type1);
8167 else if (VOID_TYPE_P (tt0))
8169 /* op0 != orig_op0 detects the case of something
8170 whose value is 0 but which isn't a valid null ptr const. */
8171 if (pedantic && !null_pointer_constant_p (orig_op0)
8172 && TREE_CODE (tt1) == FUNCTION_TYPE)
8173 pedwarn (OPT_pedantic, "ISO C forbids "
8174 "comparison of %<void *%> with function pointer");
8176 else if (VOID_TYPE_P (tt1))
8178 if (pedantic && !null_pointer_constant_p (orig_op1)
8179 && TREE_CODE (tt0) == FUNCTION_TYPE)
8180 pedwarn (OPT_pedantic, "ISO C forbids "
8181 "comparison of %<void *%> with function pointer");
8184 /* Avoid warning about the volatile ObjC EH puts on decls. */
8186 pedwarn (0, "comparison of distinct pointer types lacks a cast");
8188 if (result_type == NULL_TREE)
8189 result_type = ptr_type_node;
8191 else if (code0 == POINTER_TYPE && null_pointer_constant_p (orig_op1))
8193 if (TREE_CODE (op0) == ADDR_EXPR
8194 && decl_with_nonnull_addr_p (TREE_OPERAND (op0, 0)))
8195 warning (OPT_Waddress, "the address of %qD will never be NULL",
8196 TREE_OPERAND (op0, 0));
8197 result_type = type0;
8199 else if (code1 == POINTER_TYPE && null_pointer_constant_p (orig_op0))
8201 if (TREE_CODE (op1) == ADDR_EXPR
8202 && decl_with_nonnull_addr_p (TREE_OPERAND (op1, 0)))
8203 warning (OPT_Waddress, "the address of %qD will never be NULL",
8204 TREE_OPERAND (op1, 0));
8205 result_type = type1;
8207 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
8209 result_type = type0;
8210 pedwarn (0, "comparison between pointer and integer");
8212 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
8214 result_type = type1;
8215 pedwarn (0, "comparison between pointer and integer");
8223 build_type = integer_type_node;
8224 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
8225 || code0 == FIXED_POINT_TYPE)
8226 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
8227 || code1 == FIXED_POINT_TYPE))
8229 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
8231 if (comp_target_types (type0, type1))
8233 result_type = common_pointer_type (type0, type1);
8234 if (!COMPLETE_TYPE_P (TREE_TYPE (type0))
8235 != !COMPLETE_TYPE_P (TREE_TYPE (type1)))
8236 pedwarn (0, "comparison of complete and incomplete pointers");
8237 else if (TREE_CODE (TREE_TYPE (type0)) == FUNCTION_TYPE)
8238 pedwarn (OPT_pedantic, "ISO C forbids "
8239 "ordered comparisons of pointers to functions");
8243 result_type = ptr_type_node;
8244 pedwarn (0, "comparison of distinct pointer types lacks a cast");
8247 else if (code0 == POINTER_TYPE && null_pointer_constant_p (orig_op1))
8249 result_type = type0;
8251 pedwarn (OPT_pedantic,
8252 "ordered comparison of pointer with integer zero");
8253 else if (extra_warnings)
8254 warning (OPT_Wextra,
8255 "ordered comparison of pointer with integer zero");
8257 else if (code1 == POINTER_TYPE && null_pointer_constant_p (orig_op0))
8259 result_type = type1;
8260 pedwarn (OPT_pedantic,
8261 "ordered comparison of pointer with integer zero");
8263 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
8265 result_type = type0;
8266 pedwarn (0, "comparison between pointer and integer");
8268 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
8270 result_type = type1;
8271 pedwarn (0, "comparison between pointer and integer");
8279 if (code0 == ERROR_MARK || code1 == ERROR_MARK)
8280 return error_mark_node;
8282 if (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE
8283 && (!tree_int_cst_equal (TYPE_SIZE (type0), TYPE_SIZE (type1))
8284 || !same_scalar_type_ignoring_signedness (TREE_TYPE (type0),
8285 TREE_TYPE (type1))))
8287 binary_op_error (code, type0, type1);
8288 return error_mark_node;
8291 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE || code0 == COMPLEX_TYPE
8292 || code0 == FIXED_POINT_TYPE || code0 == VECTOR_TYPE)
8294 (code1 == INTEGER_TYPE || code1 == REAL_TYPE || code1 == COMPLEX_TYPE
8295 || code1 == FIXED_POINT_TYPE || code1 == VECTOR_TYPE))
8297 int none_complex = (code0 != COMPLEX_TYPE && code1 != COMPLEX_TYPE);
8299 if (shorten || common || short_compare)
8301 result_type = c_common_type (type0, type1);
8302 if (result_type == error_mark_node)
8303 return error_mark_node;
8306 /* For certain operations (which identify themselves by shorten != 0)
8307 if both args were extended from the same smaller type,
8308 do the arithmetic in that type and then extend.
8310 shorten !=0 and !=1 indicates a bitwise operation.
8311 For them, this optimization is safe only if
8312 both args are zero-extended or both are sign-extended.
8313 Otherwise, we might change the result.
8314 Eg, (short)-1 | (unsigned short)-1 is (int)-1
8315 but calculated in (unsigned short) it would be (unsigned short)-1. */
8317 if (shorten && none_complex)
8319 final_type = result_type;
8320 result_type = shorten_binary_op (result_type, op0, op1,
8324 /* Shifts can be shortened if shifting right. */
8329 tree arg0 = get_narrower (op0, &unsigned_arg);
8331 final_type = result_type;
8333 if (arg0 == op0 && final_type == TREE_TYPE (op0))
8334 unsigned_arg = TYPE_UNSIGNED (TREE_TYPE (op0));
8336 if (TYPE_PRECISION (TREE_TYPE (arg0)) < TYPE_PRECISION (result_type)
8337 /* We can shorten only if the shift count is less than the
8338 number of bits in the smaller type size. */
8339 && compare_tree_int (op1, TYPE_PRECISION (TREE_TYPE (arg0))) < 0
8340 /* We cannot drop an unsigned shift after sign-extension. */
8341 && (!TYPE_UNSIGNED (final_type) || unsigned_arg))
8343 /* Do an unsigned shift if the operand was zero-extended. */
8345 = c_common_signed_or_unsigned_type (unsigned_arg,
8347 /* Convert value-to-be-shifted to that type. */
8348 if (TREE_TYPE (op0) != result_type)
8349 op0 = convert (result_type, op0);
8354 /* Comparison operations are shortened too but differently.
8355 They identify themselves by setting short_compare = 1. */
8359 /* Don't write &op0, etc., because that would prevent op0
8360 from being kept in a register.
8361 Instead, make copies of the our local variables and
8362 pass the copies by reference, then copy them back afterward. */
8363 tree xop0 = op0, xop1 = op1, xresult_type = result_type;
8364 enum tree_code xresultcode = resultcode;
8366 = shorten_compare (&xop0, &xop1, &xresult_type, &xresultcode);
8371 op0 = xop0, op1 = xop1;
8373 resultcode = xresultcode;
8375 if (warn_sign_compare && skip_evaluation == 0)
8377 int op0_signed = !TYPE_UNSIGNED (TREE_TYPE (orig_op0));
8378 int op1_signed = !TYPE_UNSIGNED (TREE_TYPE (orig_op1));
8379 int unsignedp0, unsignedp1;
8380 tree primop0 = get_narrower (op0, &unsignedp0);
8381 tree primop1 = get_narrower (op1, &unsignedp1);
8385 STRIP_TYPE_NOPS (xop0);
8386 STRIP_TYPE_NOPS (xop1);
8388 /* Give warnings for comparisons between signed and unsigned
8389 quantities that may fail.
8391 Do the checking based on the original operand trees, so that
8392 casts will be considered, but default promotions won't be.
8394 Do not warn if the comparison is being done in a signed type,
8395 since the signed type will only be chosen if it can represent
8396 all the values of the unsigned type. */
8397 if (!TYPE_UNSIGNED (result_type))
8399 /* Do not warn if both operands are the same signedness. */
8400 else if (op0_signed == op1_signed)
8408 sop = xop0, uop = xop1;
8410 sop = xop1, uop = xop0;
8412 /* Do not warn if the signed quantity is an
8413 unsuffixed integer literal (or some static
8414 constant expression involving such literals or a
8415 conditional expression involving such literals)
8416 and it is non-negative. */
8417 if (tree_expr_nonnegative_warnv_p (sop, &ovf))
8419 /* Do not warn if the comparison is an equality operation,
8420 the unsigned quantity is an integral constant, and it
8421 would fit in the result if the result were signed. */
8422 else if (TREE_CODE (uop) == INTEGER_CST
8423 && (resultcode == EQ_EXPR || resultcode == NE_EXPR)
8425 (uop, c_common_signed_type (result_type)))
8427 /* Do not warn if the unsigned quantity is an enumeration
8428 constant and its maximum value would fit in the result
8429 if the result were signed. */
8430 else if (TREE_CODE (uop) == INTEGER_CST
8431 && TREE_CODE (TREE_TYPE (uop)) == ENUMERAL_TYPE
8433 (TYPE_MAX_VALUE (TREE_TYPE (uop)),
8434 c_common_signed_type (result_type)))
8437 warning (OPT_Wsign_compare, "comparison between signed and unsigned");
8440 /* Warn if two unsigned values are being compared in a size
8441 larger than their original size, and one (and only one) is the
8442 result of a `~' operator. This comparison will always fail.
8444 Also warn if one operand is a constant, and the constant
8445 does not have all bits set that are set in the ~ operand
8446 when it is extended. */
8448 if ((TREE_CODE (primop0) == BIT_NOT_EXPR)
8449 != (TREE_CODE (primop1) == BIT_NOT_EXPR))
8451 if (TREE_CODE (primop0) == BIT_NOT_EXPR)
8452 primop0 = get_narrower (TREE_OPERAND (primop0, 0),
8455 primop1 = get_narrower (TREE_OPERAND (primop1, 0),
8458 if (host_integerp (primop0, 0) || host_integerp (primop1, 0))
8461 HOST_WIDE_INT constant, mask;
8462 int unsignedp, bits;
8464 if (host_integerp (primop0, 0))
8467 unsignedp = unsignedp1;
8468 constant = tree_low_cst (primop0, 0);
8473 unsignedp = unsignedp0;
8474 constant = tree_low_cst (primop1, 0);
8477 bits = TYPE_PRECISION (TREE_TYPE (primop));
8478 if (bits < TYPE_PRECISION (result_type)
8479 && bits < HOST_BITS_PER_WIDE_INT && unsignedp)
8481 mask = (~(HOST_WIDE_INT) 0) << bits;
8482 if ((mask & constant) != mask)
8483 warning (OPT_Wsign_compare, "comparison of promoted ~unsigned with constant");
8486 else if (unsignedp0 && unsignedp1
8487 && (TYPE_PRECISION (TREE_TYPE (primop0))
8488 < TYPE_PRECISION (result_type))
8489 && (TYPE_PRECISION (TREE_TYPE (primop1))
8490 < TYPE_PRECISION (result_type)))
8491 warning (OPT_Wsign_compare, "comparison of promoted ~unsigned with unsigned");
8497 /* At this point, RESULT_TYPE must be nonzero to avoid an error message.
8498 If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
8499 Then the expression will be built.
8500 It will be given type FINAL_TYPE if that is nonzero;
8501 otherwise, it will be given type RESULT_TYPE. */
8505 binary_op_error (code, TREE_TYPE (op0), TREE_TYPE (op1));
8506 return error_mark_node;
8511 if (TREE_TYPE (op0) != result_type)
8512 op0 = convert_and_check (result_type, op0);
8513 if (TREE_TYPE (op1) != result_type)
8514 op1 = convert_and_check (result_type, op1);
8516 /* This can happen if one operand has a vector type, and the other
8517 has a different type. */
8518 if (TREE_CODE (op0) == ERROR_MARK || TREE_CODE (op1) == ERROR_MARK)
8519 return error_mark_node;
8522 if (build_type == NULL_TREE)
8523 build_type = result_type;
8526 /* Treat expressions in initializers specially as they can't trap. */
8527 tree result = require_constant_value ? fold_build2_initializer (resultcode,
8530 : fold_build2 (resultcode, build_type,
8533 if (final_type != 0)
8534 result = convert (final_type, result);
8540 /* Convert EXPR to be a truth-value, validating its type for this
8544 c_objc_common_truthvalue_conversion (tree expr)
8546 switch (TREE_CODE (TREE_TYPE (expr)))
8549 error ("used array that cannot be converted to pointer where scalar is required");
8550 return error_mark_node;
8553 error ("used struct type value where scalar is required");
8554 return error_mark_node;
8557 error ("used union type value where scalar is required");
8558 return error_mark_node;
8567 /* ??? Should we also give an error for void and vectors rather than
8568 leaving those to give errors later? */
8569 return c_common_truthvalue_conversion (expr);
8573 /* Convert EXPR to a contained DECL, updating *TC, *TI and *SE as
8577 c_expr_to_decl (tree expr, bool *tc ATTRIBUTE_UNUSED, bool *se)
8579 if (TREE_CODE (expr) == COMPOUND_LITERAL_EXPR)
8581 tree decl = COMPOUND_LITERAL_EXPR_DECL (expr);
8582 /* Executing a compound literal inside a function reinitializes
8584 if (!TREE_STATIC (decl))
8592 /* Like c_begin_compound_stmt, except force the retention of the BLOCK. */
8595 c_begin_omp_parallel (void)
8600 block = c_begin_compound_stmt (true);
8605 /* Generate OMP_PARALLEL, with CLAUSES and BLOCK as its compound statement. */
8608 c_finish_omp_parallel (tree clauses, tree block)
8612 block = c_end_compound_stmt (block, true);
8614 stmt = make_node (OMP_PARALLEL);
8615 TREE_TYPE (stmt) = void_type_node;
8616 OMP_PARALLEL_CLAUSES (stmt) = clauses;
8617 OMP_PARALLEL_BODY (stmt) = block;
8619 return add_stmt (stmt);
8622 /* Like c_begin_compound_stmt, except force the retention of the BLOCK. */
8625 c_begin_omp_task (void)
8630 block = c_begin_compound_stmt (true);
8635 /* Generate OMP_TASK, with CLAUSES and BLOCK as its compound statement. */
8638 c_finish_omp_task (tree clauses, tree block)
8642 block = c_end_compound_stmt (block, true);
8644 stmt = make_node (OMP_TASK);
8645 TREE_TYPE (stmt) = void_type_node;
8646 OMP_TASK_CLAUSES (stmt) = clauses;
8647 OMP_TASK_BODY (stmt) = block;
8649 return add_stmt (stmt);
8652 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
8653 Remove any elements from the list that are invalid. */
8656 c_finish_omp_clauses (tree clauses)
8658 bitmap_head generic_head, firstprivate_head, lastprivate_head;
8659 tree c, t, *pc = &clauses;
8662 bitmap_obstack_initialize (NULL);
8663 bitmap_initialize (&generic_head, &bitmap_default_obstack);
8664 bitmap_initialize (&firstprivate_head, &bitmap_default_obstack);
8665 bitmap_initialize (&lastprivate_head, &bitmap_default_obstack);
8667 for (pc = &clauses, c = clauses; c ; c = *pc)
8669 bool remove = false;
8670 bool need_complete = false;
8671 bool need_implicitly_determined = false;
8673 switch (OMP_CLAUSE_CODE (c))
8675 case OMP_CLAUSE_SHARED:
8677 need_implicitly_determined = true;
8678 goto check_dup_generic;
8680 case OMP_CLAUSE_PRIVATE:
8682 need_complete = true;
8683 need_implicitly_determined = true;
8684 goto check_dup_generic;
8686 case OMP_CLAUSE_REDUCTION:
8688 need_implicitly_determined = true;
8689 t = OMP_CLAUSE_DECL (c);
8690 if (AGGREGATE_TYPE_P (TREE_TYPE (t))
8691 || POINTER_TYPE_P (TREE_TYPE (t)))
8693 error ("%qE has invalid type for %<reduction%>", t);
8696 else if (FLOAT_TYPE_P (TREE_TYPE (t)))
8698 enum tree_code r_code = OMP_CLAUSE_REDUCTION_CODE (c);
8699 const char *r_name = NULL;
8716 case TRUTH_ANDIF_EXPR:
8719 case TRUTH_ORIF_EXPR:
8727 error ("%qE has invalid type for %<reduction(%s)%>",
8732 goto check_dup_generic;
8734 case OMP_CLAUSE_COPYPRIVATE:
8735 name = "copyprivate";
8736 goto check_dup_generic;
8738 case OMP_CLAUSE_COPYIN:
8740 t = OMP_CLAUSE_DECL (c);
8741 if (TREE_CODE (t) != VAR_DECL || !DECL_THREAD_LOCAL_P (t))
8743 error ("%qE must be %<threadprivate%> for %<copyin%>", t);
8746 goto check_dup_generic;
8749 t = OMP_CLAUSE_DECL (c);
8750 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
8752 error ("%qE is not a variable in clause %qs", t, name);
8755 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
8756 || bitmap_bit_p (&firstprivate_head, DECL_UID (t))
8757 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
8759 error ("%qE appears more than once in data clauses", t);
8763 bitmap_set_bit (&generic_head, DECL_UID (t));
8766 case OMP_CLAUSE_FIRSTPRIVATE:
8767 name = "firstprivate";
8768 t = OMP_CLAUSE_DECL (c);
8769 need_complete = true;
8770 need_implicitly_determined = true;
8771 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
8773 error ("%qE is not a variable in clause %<firstprivate%>", t);
8776 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
8777 || bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
8779 error ("%qE appears more than once in data clauses", t);
8783 bitmap_set_bit (&firstprivate_head, DECL_UID (t));
8786 case OMP_CLAUSE_LASTPRIVATE:
8787 name = "lastprivate";
8788 t = OMP_CLAUSE_DECL (c);
8789 need_complete = true;
8790 need_implicitly_determined = true;
8791 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
8793 error ("%qE is not a variable in clause %<lastprivate%>", t);
8796 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
8797 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
8799 error ("%qE appears more than once in data clauses", t);
8803 bitmap_set_bit (&lastprivate_head, DECL_UID (t));
8807 case OMP_CLAUSE_NUM_THREADS:
8808 case OMP_CLAUSE_SCHEDULE:
8809 case OMP_CLAUSE_NOWAIT:
8810 case OMP_CLAUSE_ORDERED:
8811 case OMP_CLAUSE_DEFAULT:
8812 case OMP_CLAUSE_UNTIED:
8813 case OMP_CLAUSE_COLLAPSE:
8814 pc = &OMP_CLAUSE_CHAIN (c);
8823 t = OMP_CLAUSE_DECL (c);
8827 t = require_complete_type (t);
8828 if (t == error_mark_node)
8832 if (need_implicitly_determined)
8834 const char *share_name = NULL;
8836 if (TREE_CODE (t) == VAR_DECL && DECL_THREAD_LOCAL_P (t))
8837 share_name = "threadprivate";
8838 else switch (c_omp_predetermined_sharing (t))
8840 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
8842 case OMP_CLAUSE_DEFAULT_SHARED:
8843 share_name = "shared";
8845 case OMP_CLAUSE_DEFAULT_PRIVATE:
8846 share_name = "private";
8853 error ("%qE is predetermined %qs for %qs",
8854 t, share_name, name);
8861 *pc = OMP_CLAUSE_CHAIN (c);
8863 pc = &OMP_CLAUSE_CHAIN (c);
8866 bitmap_obstack_release (NULL);
8870 /* Make a variant type in the proper way for C/C++, propagating qualifiers
8871 down to the element type of an array. */
8874 c_build_qualified_type (tree type, int type_quals)
8876 if (type == error_mark_node)
8879 if (TREE_CODE (type) == ARRAY_TYPE)
8882 tree element_type = c_build_qualified_type (TREE_TYPE (type),
8885 /* See if we already have an identically qualified type. */
8886 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
8888 if (TYPE_QUALS (strip_array_types (t)) == type_quals
8889 && TYPE_NAME (t) == TYPE_NAME (type)
8890 && TYPE_CONTEXT (t) == TYPE_CONTEXT (type)
8891 && attribute_list_equal (TYPE_ATTRIBUTES (t),
8892 TYPE_ATTRIBUTES (type)))
8897 tree domain = TYPE_DOMAIN (type);
8899 t = build_variant_type_copy (type);
8900 TREE_TYPE (t) = element_type;
8902 if (TYPE_STRUCTURAL_EQUALITY_P (element_type)
8903 || (domain && TYPE_STRUCTURAL_EQUALITY_P (domain)))
8904 SET_TYPE_STRUCTURAL_EQUALITY (t);
8905 else if (TYPE_CANONICAL (element_type) != element_type
8906 || (domain && TYPE_CANONICAL (domain) != domain))
8908 tree unqualified_canon
8909 = build_array_type (TYPE_CANONICAL (element_type),
8910 domain? TYPE_CANONICAL (domain)
8913 = c_build_qualified_type (unqualified_canon, type_quals);
8916 TYPE_CANONICAL (t) = t;
8921 /* A restrict-qualified pointer type must be a pointer to object or
8922 incomplete type. Note that the use of POINTER_TYPE_P also allows
8923 REFERENCE_TYPEs, which is appropriate for C++. */
8924 if ((type_quals & TYPE_QUAL_RESTRICT)
8925 && (!POINTER_TYPE_P (type)
8926 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type))))
8928 error ("invalid use of %<restrict%>");
8929 type_quals &= ~TYPE_QUAL_RESTRICT;
8932 return build_qualified_type (type, type_quals);