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
4 Free Software Foundation, Inc.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 3, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
23 /* This file is part of the C front end.
24 It contains routines to build C expressions given their operands,
25 including computing the types of the result, C-specific error checks,
26 and some optimization. */
30 #include "coretypes.h"
34 #include "langhooks.h"
44 #include "tree-iterator.h"
45 #include "tree-gimple.h"
46 #include "tree-flow.h"
48 /* Possible cases of implicit bad conversions. Used to select
49 diagnostic messages in convert_for_assignment. */
58 /* The level of nesting inside "__alignof__". */
61 /* The level of nesting inside "sizeof". */
64 /* The level of nesting inside "typeof". */
67 struct c_label_context_se *label_context_stack_se;
68 struct c_label_context_vm *label_context_stack_vm;
70 /* Nonzero if we've already printed a "missing braces around initializer"
71 message within this initializer. */
72 static int missing_braces_mentioned;
74 static int require_constant_value;
75 static int require_constant_elements;
77 static bool null_pointer_constant_p (const_tree);
78 static tree qualify_type (tree, tree);
79 static int tagged_types_tu_compatible_p (const_tree, const_tree);
80 static int comp_target_types (tree, tree);
81 static int function_types_compatible_p (const_tree, const_tree);
82 static int type_lists_compatible_p (const_tree, const_tree);
83 static tree decl_constant_value_for_broken_optimization (tree);
84 static tree lookup_field (tree, tree);
85 static int convert_arguments (int, tree *, tree, tree, tree, tree);
86 static tree pointer_diff (tree, tree);
87 static tree convert_for_assignment (tree, tree, enum impl_conv, tree, tree,
89 static tree valid_compound_expr_initializer (tree, tree);
90 static void push_string (const char *);
91 static void push_member_name (tree);
92 static int spelling_length (void);
93 static char *print_spelling (char *);
94 static void warning_init (const char *);
95 static tree digest_init (tree, tree, bool, int);
96 static void output_init_element (tree, bool, tree, tree, int);
97 static void output_pending_init_elements (int);
98 static int set_designator (int);
99 static void push_range_stack (tree);
100 static void add_pending_init (tree, tree);
101 static void set_nonincremental_init (void);
102 static void set_nonincremental_init_from_string (tree);
103 static tree find_init_member (tree);
104 static void readonly_error (tree, enum lvalue_use);
105 static int lvalue_or_else (const_tree, enum lvalue_use);
106 static int lvalue_p (const_tree);
107 static void record_maybe_used_decl (tree);
108 static int comptypes_internal (const_tree, const_tree);
110 /* Return true if EXP is a null pointer constant, false otherwise. */
113 null_pointer_constant_p (const_tree expr)
115 /* This should really operate on c_expr structures, but they aren't
116 yet available everywhere required. */
117 tree type = TREE_TYPE (expr);
118 return (TREE_CODE (expr) == INTEGER_CST
119 && !TREE_OVERFLOW (expr)
120 && integer_zerop (expr)
121 && (INTEGRAL_TYPE_P (type)
122 || (TREE_CODE (type) == POINTER_TYPE
123 && VOID_TYPE_P (TREE_TYPE (type))
124 && TYPE_QUALS (TREE_TYPE (type)) == TYPE_UNQUALIFIED)));
126 \f/* This is a cache to hold if two types are compatible or not. */
128 struct tagged_tu_seen_cache {
129 const struct tagged_tu_seen_cache * next;
132 /* The return value of tagged_types_tu_compatible_p if we had seen
133 these two types already. */
137 static const struct tagged_tu_seen_cache * tagged_tu_seen_base;
138 static void free_all_tagged_tu_seen_up_to (const struct tagged_tu_seen_cache *);
140 /* Do `exp = require_complete_type (exp);' to make sure exp
141 does not have an incomplete type. (That includes void types.) */
144 require_complete_type (tree value)
146 tree type = TREE_TYPE (value);
148 if (value == error_mark_node || type == error_mark_node)
149 return error_mark_node;
151 /* First, detect a valid value with a complete type. */
152 if (COMPLETE_TYPE_P (type))
155 c_incomplete_type_error (value, type);
156 return error_mark_node;
159 /* Print an error message for invalid use of an incomplete type.
160 VALUE is the expression that was used (or 0 if that isn't known)
161 and TYPE is the type that was invalid. */
164 c_incomplete_type_error (const_tree value, const_tree type)
166 const char *type_code_string;
168 /* Avoid duplicate error message. */
169 if (TREE_CODE (type) == ERROR_MARK)
172 if (value != 0 && (TREE_CODE (value) == VAR_DECL
173 || TREE_CODE (value) == PARM_DECL))
174 error ("%qD has an incomplete type", value);
178 /* We must print an error message. Be clever about what it says. */
180 switch (TREE_CODE (type))
183 type_code_string = "struct";
187 type_code_string = "union";
191 type_code_string = "enum";
195 error ("invalid use of void expression");
199 if (TYPE_DOMAIN (type))
201 if (TYPE_MAX_VALUE (TYPE_DOMAIN (type)) == NULL)
203 error ("invalid use of flexible array member");
206 type = TREE_TYPE (type);
209 error ("invalid use of array with unspecified bounds");
216 if (TREE_CODE (TYPE_NAME (type)) == IDENTIFIER_NODE)
217 error ("invalid use of undefined type %<%s %E%>",
218 type_code_string, TYPE_NAME (type));
220 /* If this type has a typedef-name, the TYPE_NAME is a TYPE_DECL. */
221 error ("invalid use of incomplete typedef %qD", TYPE_NAME (type));
225 /* Given a type, apply default promotions wrt unnamed function
226 arguments and return the new type. */
229 c_type_promotes_to (tree type)
231 if (TYPE_MAIN_VARIANT (type) == float_type_node)
232 return double_type_node;
234 if (c_promoting_integer_type_p (type))
236 /* Preserve unsignedness if not really getting any wider. */
237 if (TYPE_UNSIGNED (type)
238 && (TYPE_PRECISION (type) == TYPE_PRECISION (integer_type_node)))
239 return unsigned_type_node;
240 return integer_type_node;
246 /* Return a variant of TYPE which has all the type qualifiers of LIKE
247 as well as those of TYPE. */
250 qualify_type (tree type, tree like)
252 return c_build_qualified_type (type,
253 TYPE_QUALS (type) | TYPE_QUALS (like));
256 /* Return true iff the given tree T is a variable length array. */
259 c_vla_type_p (const_tree t)
261 if (TREE_CODE (t) == ARRAY_TYPE
262 && C_TYPE_VARIABLE_SIZE (t))
267 /* Return the composite type of two compatible types.
269 We assume that comptypes has already been done and returned
270 nonzero; if that isn't so, this may crash. In particular, we
271 assume that qualifiers match. */
274 composite_type (tree t1, tree t2)
276 enum tree_code code1;
277 enum tree_code code2;
280 /* Save time if the two types are the same. */
282 if (t1 == t2) return t1;
284 /* If one type is nonsense, use the other. */
285 if (t1 == error_mark_node)
287 if (t2 == error_mark_node)
290 code1 = TREE_CODE (t1);
291 code2 = TREE_CODE (t2);
293 /* Merge the attributes. */
294 attributes = targetm.merge_type_attributes (t1, t2);
296 /* If one is an enumerated type and the other is the compatible
297 integer type, the composite type might be either of the two
298 (DR#013 question 3). For consistency, use the enumerated type as
299 the composite type. */
301 if (code1 == ENUMERAL_TYPE && code2 == INTEGER_TYPE)
303 if (code2 == ENUMERAL_TYPE && code1 == INTEGER_TYPE)
306 gcc_assert (code1 == code2);
311 /* For two pointers, do this recursively on the target type. */
313 tree pointed_to_1 = TREE_TYPE (t1);
314 tree pointed_to_2 = TREE_TYPE (t2);
315 tree target = composite_type (pointed_to_1, pointed_to_2);
316 t1 = build_pointer_type (target);
317 t1 = build_type_attribute_variant (t1, attributes);
318 return qualify_type (t1, t2);
323 tree elt = composite_type (TREE_TYPE (t1), TREE_TYPE (t2));
326 tree d1 = TYPE_DOMAIN (t1);
327 tree d2 = TYPE_DOMAIN (t2);
328 bool d1_variable, d2_variable;
329 bool d1_zero, d2_zero;
331 /* We should not have any type quals on arrays at all. */
332 gcc_assert (!TYPE_QUALS (t1) && !TYPE_QUALS (t2));
334 d1_zero = d1 == 0 || !TYPE_MAX_VALUE (d1);
335 d2_zero = d2 == 0 || !TYPE_MAX_VALUE (d2);
337 d1_variable = (!d1_zero
338 && (TREE_CODE (TYPE_MIN_VALUE (d1)) != INTEGER_CST
339 || TREE_CODE (TYPE_MAX_VALUE (d1)) != INTEGER_CST));
340 d2_variable = (!d2_zero
341 && (TREE_CODE (TYPE_MIN_VALUE (d2)) != INTEGER_CST
342 || TREE_CODE (TYPE_MAX_VALUE (d2)) != INTEGER_CST));
343 d1_variable = d1_variable || (d1_zero && c_vla_type_p (t1));
344 d2_variable = d2_variable || (d2_zero && c_vla_type_p (t2));
346 /* Save space: see if the result is identical to one of the args. */
347 if (elt == TREE_TYPE (t1) && TYPE_DOMAIN (t1)
348 && (d2_variable || d2_zero || !d1_variable))
349 return build_type_attribute_variant (t1, attributes);
350 if (elt == TREE_TYPE (t2) && TYPE_DOMAIN (t2)
351 && (d1_variable || d1_zero || !d2_variable))
352 return build_type_attribute_variant (t2, attributes);
354 if (elt == TREE_TYPE (t1) && !TYPE_DOMAIN (t2) && !TYPE_DOMAIN (t1))
355 return build_type_attribute_variant (t1, attributes);
356 if (elt == TREE_TYPE (t2) && !TYPE_DOMAIN (t2) && !TYPE_DOMAIN (t1))
357 return build_type_attribute_variant (t2, attributes);
359 /* Merge the element types, and have a size if either arg has
360 one. We may have qualifiers on the element types. To set
361 up TYPE_MAIN_VARIANT correctly, we need to form the
362 composite of the unqualified types and add the qualifiers
364 quals = TYPE_QUALS (strip_array_types (elt));
365 unqual_elt = c_build_qualified_type (elt, TYPE_UNQUALIFIED);
366 t1 = build_array_type (unqual_elt,
367 TYPE_DOMAIN ((TYPE_DOMAIN (t1)
373 t1 = c_build_qualified_type (t1, quals);
374 return build_type_attribute_variant (t1, attributes);
380 if (attributes != NULL)
382 /* Try harder not to create a new aggregate type. */
383 if (attribute_list_equal (TYPE_ATTRIBUTES (t1), attributes))
385 if (attribute_list_equal (TYPE_ATTRIBUTES (t2), attributes))
388 return build_type_attribute_variant (t1, attributes);
391 /* Function types: prefer the one that specified arg types.
392 If both do, merge the arg types. Also merge the return types. */
394 tree valtype = composite_type (TREE_TYPE (t1), TREE_TYPE (t2));
395 tree p1 = TYPE_ARG_TYPES (t1);
396 tree p2 = TYPE_ARG_TYPES (t2);
401 /* Save space: see if the result is identical to one of the args. */
402 if (valtype == TREE_TYPE (t1) && !TYPE_ARG_TYPES (t2))
403 return build_type_attribute_variant (t1, attributes);
404 if (valtype == TREE_TYPE (t2) && !TYPE_ARG_TYPES (t1))
405 return build_type_attribute_variant (t2, attributes);
407 /* Simple way if one arg fails to specify argument types. */
408 if (TYPE_ARG_TYPES (t1) == 0)
410 t1 = build_function_type (valtype, TYPE_ARG_TYPES (t2));
411 t1 = build_type_attribute_variant (t1, attributes);
412 return qualify_type (t1, t2);
414 if (TYPE_ARG_TYPES (t2) == 0)
416 t1 = build_function_type (valtype, TYPE_ARG_TYPES (t1));
417 t1 = build_type_attribute_variant (t1, attributes);
418 return qualify_type (t1, t2);
421 /* If both args specify argument types, we must merge the two
422 lists, argument by argument. */
423 /* Tell global_bindings_p to return false so that variable_size
424 doesn't die on VLAs in parameter types. */
425 c_override_global_bindings_to_false = true;
427 len = list_length (p1);
430 for (i = 0; i < len; i++)
431 newargs = tree_cons (NULL_TREE, NULL_TREE, newargs);
436 p1 = TREE_CHAIN (p1), p2 = TREE_CHAIN (p2), n = TREE_CHAIN (n))
438 /* A null type means arg type is not specified.
439 Take whatever the other function type has. */
440 if (TREE_VALUE (p1) == 0)
442 TREE_VALUE (n) = TREE_VALUE (p2);
445 if (TREE_VALUE (p2) == 0)
447 TREE_VALUE (n) = TREE_VALUE (p1);
451 /* Given wait (union {union wait *u; int *i} *)
452 and wait (union wait *),
453 prefer union wait * as type of parm. */
454 if (TREE_CODE (TREE_VALUE (p1)) == UNION_TYPE
455 && TREE_VALUE (p1) != TREE_VALUE (p2))
458 tree mv2 = TREE_VALUE (p2);
459 if (mv2 && mv2 != error_mark_node
460 && TREE_CODE (mv2) != ARRAY_TYPE)
461 mv2 = TYPE_MAIN_VARIANT (mv2);
462 for (memb = TYPE_FIELDS (TREE_VALUE (p1));
463 memb; memb = TREE_CHAIN (memb))
465 tree mv3 = TREE_TYPE (memb);
466 if (mv3 && mv3 != error_mark_node
467 && TREE_CODE (mv3) != ARRAY_TYPE)
468 mv3 = TYPE_MAIN_VARIANT (mv3);
469 if (comptypes (mv3, mv2))
471 TREE_VALUE (n) = composite_type (TREE_TYPE (memb),
474 pedwarn ("function types not truly compatible in ISO C");
479 if (TREE_CODE (TREE_VALUE (p2)) == UNION_TYPE
480 && TREE_VALUE (p2) != TREE_VALUE (p1))
483 tree mv1 = TREE_VALUE (p1);
484 if (mv1 && mv1 != error_mark_node
485 && TREE_CODE (mv1) != ARRAY_TYPE)
486 mv1 = TYPE_MAIN_VARIANT (mv1);
487 for (memb = TYPE_FIELDS (TREE_VALUE (p2));
488 memb; memb = TREE_CHAIN (memb))
490 tree mv3 = TREE_TYPE (memb);
491 if (mv3 && mv3 != error_mark_node
492 && TREE_CODE (mv3) != ARRAY_TYPE)
493 mv3 = TYPE_MAIN_VARIANT (mv3);
494 if (comptypes (mv3, mv1))
496 TREE_VALUE (n) = composite_type (TREE_TYPE (memb),
499 pedwarn ("function types not truly compatible in ISO C");
504 TREE_VALUE (n) = composite_type (TREE_VALUE (p1), TREE_VALUE (p2));
508 c_override_global_bindings_to_false = false;
509 t1 = build_function_type (valtype, newargs);
510 t1 = qualify_type (t1, t2);
511 /* ... falls through ... */
515 return build_type_attribute_variant (t1, attributes);
520 /* Return the type of a conditional expression between pointers to
521 possibly differently qualified versions of compatible types.
523 We assume that comp_target_types has already been done and returned
524 nonzero; if that isn't so, this may crash. */
527 common_pointer_type (tree t1, tree t2)
530 tree pointed_to_1, mv1;
531 tree pointed_to_2, mv2;
534 /* Save time if the two types are the same. */
536 if (t1 == t2) return t1;
538 /* If one type is nonsense, use the other. */
539 if (t1 == error_mark_node)
541 if (t2 == error_mark_node)
544 gcc_assert (TREE_CODE (t1) == POINTER_TYPE
545 && TREE_CODE (t2) == POINTER_TYPE);
547 /* Merge the attributes. */
548 attributes = targetm.merge_type_attributes (t1, t2);
550 /* Find the composite type of the target types, and combine the
551 qualifiers of the two types' targets. Do not lose qualifiers on
552 array element types by taking the TYPE_MAIN_VARIANT. */
553 mv1 = pointed_to_1 = TREE_TYPE (t1);
554 mv2 = pointed_to_2 = TREE_TYPE (t2);
555 if (TREE_CODE (mv1) != ARRAY_TYPE)
556 mv1 = TYPE_MAIN_VARIANT (pointed_to_1);
557 if (TREE_CODE (mv2) != ARRAY_TYPE)
558 mv2 = TYPE_MAIN_VARIANT (pointed_to_2);
559 target = composite_type (mv1, mv2);
560 t1 = build_pointer_type (c_build_qualified_type
562 TYPE_QUALS (pointed_to_1) |
563 TYPE_QUALS (pointed_to_2)));
564 return build_type_attribute_variant (t1, attributes);
567 /* Return the common type for two arithmetic types under the usual
568 arithmetic conversions. The default conversions have already been
569 applied, and enumerated types converted to their compatible integer
570 types. The resulting type is unqualified and has no attributes.
572 This is the type for the result of most arithmetic operations
573 if the operands have the given two types. */
576 c_common_type (tree t1, tree t2)
578 enum tree_code code1;
579 enum tree_code code2;
581 /* If one type is nonsense, use the other. */
582 if (t1 == error_mark_node)
584 if (t2 == error_mark_node)
587 if (TYPE_QUALS (t1) != TYPE_UNQUALIFIED)
588 t1 = TYPE_MAIN_VARIANT (t1);
590 if (TYPE_QUALS (t2) != TYPE_UNQUALIFIED)
591 t2 = TYPE_MAIN_VARIANT (t2);
593 if (TYPE_ATTRIBUTES (t1) != NULL_TREE)
594 t1 = build_type_attribute_variant (t1, NULL_TREE);
596 if (TYPE_ATTRIBUTES (t2) != NULL_TREE)
597 t2 = build_type_attribute_variant (t2, NULL_TREE);
599 /* Save time if the two types are the same. */
601 if (t1 == t2) return t1;
603 code1 = TREE_CODE (t1);
604 code2 = TREE_CODE (t2);
606 gcc_assert (code1 == VECTOR_TYPE || code1 == COMPLEX_TYPE
607 || code1 == FIXED_POINT_TYPE || code1 == REAL_TYPE
608 || code1 == INTEGER_TYPE);
609 gcc_assert (code2 == VECTOR_TYPE || code2 == COMPLEX_TYPE
610 || code2 == FIXED_POINT_TYPE || code2 == REAL_TYPE
611 || code2 == INTEGER_TYPE);
613 /* When one operand is a decimal float type, the other operand cannot be
614 a generic float type or a complex type. We also disallow vector types
616 if ((DECIMAL_FLOAT_TYPE_P (t1) || DECIMAL_FLOAT_TYPE_P (t2))
617 && !(DECIMAL_FLOAT_TYPE_P (t1) && DECIMAL_FLOAT_TYPE_P (t2)))
619 if (code1 == VECTOR_TYPE || code2 == VECTOR_TYPE)
621 error ("can%'t mix operands of decimal float and vector types");
622 return error_mark_node;
624 if (code1 == COMPLEX_TYPE || code2 == COMPLEX_TYPE)
626 error ("can%'t mix operands of decimal float and complex types");
627 return error_mark_node;
629 if (code1 == REAL_TYPE && code2 == REAL_TYPE)
631 error ("can%'t mix operands of decimal float and other float types");
632 return error_mark_node;
636 /* If one type is a vector type, return that type. (How the usual
637 arithmetic conversions apply to the vector types extension is not
638 precisely specified.) */
639 if (code1 == VECTOR_TYPE)
642 if (code2 == VECTOR_TYPE)
645 /* If one type is complex, form the common type of the non-complex
646 components, then make that complex. Use T1 or T2 if it is the
648 if (code1 == COMPLEX_TYPE || code2 == COMPLEX_TYPE)
650 tree subtype1 = code1 == COMPLEX_TYPE ? TREE_TYPE (t1) : t1;
651 tree subtype2 = code2 == COMPLEX_TYPE ? TREE_TYPE (t2) : t2;
652 tree subtype = c_common_type (subtype1, subtype2);
654 if (code1 == COMPLEX_TYPE && TREE_TYPE (t1) == subtype)
656 else if (code2 == COMPLEX_TYPE && TREE_TYPE (t2) == subtype)
659 return build_complex_type (subtype);
662 /* If only one is real, use it as the result. */
664 if (code1 == REAL_TYPE && code2 != REAL_TYPE)
667 if (code2 == REAL_TYPE && code1 != REAL_TYPE)
670 /* If both are real and either are decimal floating point types, use
671 the decimal floating point type with the greater precision. */
673 if (code1 == REAL_TYPE && code2 == REAL_TYPE)
675 if (TYPE_MAIN_VARIANT (t1) == dfloat128_type_node
676 || TYPE_MAIN_VARIANT (t2) == dfloat128_type_node)
677 return dfloat128_type_node;
678 else if (TYPE_MAIN_VARIANT (t1) == dfloat64_type_node
679 || TYPE_MAIN_VARIANT (t2) == dfloat64_type_node)
680 return dfloat64_type_node;
681 else if (TYPE_MAIN_VARIANT (t1) == dfloat32_type_node
682 || TYPE_MAIN_VARIANT (t2) == dfloat32_type_node)
683 return dfloat32_type_node;
686 /* Deal with fixed-point types. */
687 if (code1 == FIXED_POINT_TYPE || code2 == FIXED_POINT_TYPE)
689 unsigned int unsignedp = 0, satp = 0;
690 enum machine_mode m1, m2;
691 unsigned int fbit1, ibit1, fbit2, ibit2, max_fbit, max_ibit;
696 /* If one input type is saturating, the result type is saturating. */
697 if (TYPE_SATURATING (t1) || TYPE_SATURATING (t2))
700 /* If both fixed-point types are unsigned, the result type is unsigned.
701 When mixing fixed-point and integer types, follow the sign of the
703 Otherwise, the result type is signed. */
704 if ((TYPE_UNSIGNED (t1) && TYPE_UNSIGNED (t2)
705 && code1 == FIXED_POINT_TYPE && code2 == FIXED_POINT_TYPE)
706 || (code1 == FIXED_POINT_TYPE && code2 != FIXED_POINT_TYPE
707 && TYPE_UNSIGNED (t1))
708 || (code1 != FIXED_POINT_TYPE && code2 == FIXED_POINT_TYPE
709 && TYPE_UNSIGNED (t2)))
712 /* The result type is signed. */
715 /* If the input type is unsigned, we need to convert to the
717 if (code1 == FIXED_POINT_TYPE && TYPE_UNSIGNED (t1))
719 unsigned char mclass = 0;
720 if (GET_MODE_CLASS (m1) == MODE_UFRACT)
722 else if (GET_MODE_CLASS (m1) == MODE_UACCUM)
726 m1 = mode_for_size (GET_MODE_PRECISION (m1), mclass, 0);
728 if (code2 == FIXED_POINT_TYPE && TYPE_UNSIGNED (t2))
730 unsigned char mclass = 0;
731 if (GET_MODE_CLASS (m2) == MODE_UFRACT)
733 else if (GET_MODE_CLASS (m2) == MODE_UACCUM)
737 m2 = mode_for_size (GET_MODE_PRECISION (m2), mclass, 0);
741 if (code1 == FIXED_POINT_TYPE)
743 fbit1 = GET_MODE_FBIT (m1);
744 ibit1 = GET_MODE_IBIT (m1);
749 /* Signed integers need to subtract one sign bit. */
750 ibit1 = TYPE_PRECISION (t1) - (!TYPE_UNSIGNED (t1));
753 if (code2 == FIXED_POINT_TYPE)
755 fbit2 = GET_MODE_FBIT (m2);
756 ibit2 = GET_MODE_IBIT (m2);
761 /* Signed integers need to subtract one sign bit. */
762 ibit2 = TYPE_PRECISION (t2) - (!TYPE_UNSIGNED (t2));
765 max_ibit = ibit1 >= ibit2 ? ibit1 : ibit2;
766 max_fbit = fbit1 >= fbit2 ? fbit1 : fbit2;
767 return c_common_fixed_point_type_for_size (max_ibit, max_fbit, unsignedp,
771 /* Both real or both integers; use the one with greater precision. */
773 if (TYPE_PRECISION (t1) > TYPE_PRECISION (t2))
775 else if (TYPE_PRECISION (t2) > TYPE_PRECISION (t1))
778 /* Same precision. Prefer long longs to longs to ints when the
779 same precision, following the C99 rules on integer type rank
780 (which are equivalent to the C90 rules for C90 types). */
782 if (TYPE_MAIN_VARIANT (t1) == long_long_unsigned_type_node
783 || TYPE_MAIN_VARIANT (t2) == long_long_unsigned_type_node)
784 return long_long_unsigned_type_node;
786 if (TYPE_MAIN_VARIANT (t1) == long_long_integer_type_node
787 || TYPE_MAIN_VARIANT (t2) == long_long_integer_type_node)
789 if (TYPE_UNSIGNED (t1) || TYPE_UNSIGNED (t2))
790 return long_long_unsigned_type_node;
792 return long_long_integer_type_node;
795 if (TYPE_MAIN_VARIANT (t1) == long_unsigned_type_node
796 || TYPE_MAIN_VARIANT (t2) == long_unsigned_type_node)
797 return long_unsigned_type_node;
799 if (TYPE_MAIN_VARIANT (t1) == long_integer_type_node
800 || TYPE_MAIN_VARIANT (t2) == long_integer_type_node)
802 /* But preserve unsignedness from the other type,
803 since long cannot hold all the values of an unsigned int. */
804 if (TYPE_UNSIGNED (t1) || TYPE_UNSIGNED (t2))
805 return long_unsigned_type_node;
807 return long_integer_type_node;
810 /* Likewise, prefer long double to double even if same size. */
811 if (TYPE_MAIN_VARIANT (t1) == long_double_type_node
812 || TYPE_MAIN_VARIANT (t2) == long_double_type_node)
813 return long_double_type_node;
815 /* Otherwise prefer the unsigned one. */
817 if (TYPE_UNSIGNED (t1))
823 /* Wrapper around c_common_type that is used by c-common.c and other
824 front end optimizations that remove promotions. ENUMERAL_TYPEs
825 are allowed here and are converted to their compatible integer types.
826 BOOLEAN_TYPEs are allowed here and return either boolean_type_node or
827 preferably a non-Boolean type as the common type. */
829 common_type (tree t1, tree t2)
831 if (TREE_CODE (t1) == ENUMERAL_TYPE)
832 t1 = c_common_type_for_size (TYPE_PRECISION (t1), 1);
833 if (TREE_CODE (t2) == ENUMERAL_TYPE)
834 t2 = c_common_type_for_size (TYPE_PRECISION (t2), 1);
836 /* If both types are BOOLEAN_TYPE, then return boolean_type_node. */
837 if (TREE_CODE (t1) == BOOLEAN_TYPE
838 && TREE_CODE (t2) == BOOLEAN_TYPE)
839 return boolean_type_node;
841 /* If either type is BOOLEAN_TYPE, then return the other. */
842 if (TREE_CODE (t1) == BOOLEAN_TYPE)
844 if (TREE_CODE (t2) == BOOLEAN_TYPE)
847 return c_common_type (t1, t2);
850 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
851 or various other operations. Return 2 if they are compatible
852 but a warning may be needed if you use them together. */
855 comptypes (tree type1, tree type2)
857 const struct tagged_tu_seen_cache * tagged_tu_seen_base1 = tagged_tu_seen_base;
860 val = comptypes_internal (type1, type2);
861 free_all_tagged_tu_seen_up_to (tagged_tu_seen_base1);
866 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
867 or various other operations. Return 2 if they are compatible
868 but a warning may be needed if you use them together. This
869 differs from comptypes, in that we don't free the seen types. */
872 comptypes_internal (const_tree type1, const_tree type2)
874 const_tree t1 = type1;
875 const_tree t2 = type2;
878 /* Suppress errors caused by previously reported errors. */
880 if (t1 == t2 || !t1 || !t2
881 || TREE_CODE (t1) == ERROR_MARK || TREE_CODE (t2) == ERROR_MARK)
884 /* If either type is the internal version of sizetype, return the
886 if (TREE_CODE (t1) == INTEGER_TYPE && TYPE_IS_SIZETYPE (t1)
887 && TYPE_ORIG_SIZE_TYPE (t1))
888 t1 = TYPE_ORIG_SIZE_TYPE (t1);
890 if (TREE_CODE (t2) == INTEGER_TYPE && TYPE_IS_SIZETYPE (t2)
891 && TYPE_ORIG_SIZE_TYPE (t2))
892 t2 = TYPE_ORIG_SIZE_TYPE (t2);
895 /* Enumerated types are compatible with integer types, but this is
896 not transitive: two enumerated types in the same translation unit
897 are compatible with each other only if they are the same type. */
899 if (TREE_CODE (t1) == ENUMERAL_TYPE && TREE_CODE (t2) != ENUMERAL_TYPE)
900 t1 = c_common_type_for_size (TYPE_PRECISION (t1), TYPE_UNSIGNED (t1));
901 else if (TREE_CODE (t2) == ENUMERAL_TYPE && TREE_CODE (t1) != ENUMERAL_TYPE)
902 t2 = c_common_type_for_size (TYPE_PRECISION (t2), TYPE_UNSIGNED (t2));
907 /* Different classes of types can't be compatible. */
909 if (TREE_CODE (t1) != TREE_CODE (t2))
912 /* Qualifiers must match. C99 6.7.3p9 */
914 if (TYPE_QUALS (t1) != TYPE_QUALS (t2))
917 /* Allow for two different type nodes which have essentially the same
918 definition. Note that we already checked for equality of the type
919 qualifiers (just above). */
921 if (TREE_CODE (t1) != ARRAY_TYPE
922 && TYPE_MAIN_VARIANT (t1) == TYPE_MAIN_VARIANT (t2))
925 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
926 if (!(attrval = targetm.comp_type_attributes (t1, t2)))
929 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
932 switch (TREE_CODE (t1))
935 /* Do not remove mode or aliasing information. */
936 if (TYPE_MODE (t1) != TYPE_MODE (t2)
937 || TYPE_REF_CAN_ALIAS_ALL (t1) != TYPE_REF_CAN_ALIAS_ALL (t2))
939 val = (TREE_TYPE (t1) == TREE_TYPE (t2)
940 ? 1 : comptypes_internal (TREE_TYPE (t1), TREE_TYPE (t2)));
944 val = function_types_compatible_p (t1, t2);
949 tree d1 = TYPE_DOMAIN (t1);
950 tree d2 = TYPE_DOMAIN (t2);
951 bool d1_variable, d2_variable;
952 bool d1_zero, d2_zero;
955 /* Target types must match incl. qualifiers. */
956 if (TREE_TYPE (t1) != TREE_TYPE (t2)
957 && 0 == (val = comptypes_internal (TREE_TYPE (t1), TREE_TYPE (t2))))
960 /* Sizes must match unless one is missing or variable. */
961 if (d1 == 0 || d2 == 0 || d1 == d2)
964 d1_zero = !TYPE_MAX_VALUE (d1);
965 d2_zero = !TYPE_MAX_VALUE (d2);
967 d1_variable = (!d1_zero
968 && (TREE_CODE (TYPE_MIN_VALUE (d1)) != INTEGER_CST
969 || TREE_CODE (TYPE_MAX_VALUE (d1)) != INTEGER_CST));
970 d2_variable = (!d2_zero
971 && (TREE_CODE (TYPE_MIN_VALUE (d2)) != INTEGER_CST
972 || TREE_CODE (TYPE_MAX_VALUE (d2)) != INTEGER_CST));
973 d1_variable = d1_variable || (d1_zero && c_vla_type_p (t1));
974 d2_variable = d2_variable || (d2_zero && c_vla_type_p (t2));
976 if (d1_variable || d2_variable)
978 if (d1_zero && d2_zero)
980 if (d1_zero || d2_zero
981 || !tree_int_cst_equal (TYPE_MIN_VALUE (d1), TYPE_MIN_VALUE (d2))
982 || !tree_int_cst_equal (TYPE_MAX_VALUE (d1), TYPE_MAX_VALUE (d2)))
991 if (val != 1 && !same_translation_unit_p (t1, t2))
993 tree a1 = TYPE_ATTRIBUTES (t1);
994 tree a2 = TYPE_ATTRIBUTES (t2);
996 if (! attribute_list_contained (a1, a2)
997 && ! attribute_list_contained (a2, a1))
1001 return tagged_types_tu_compatible_p (t1, t2);
1002 val = tagged_types_tu_compatible_p (t1, t2);
1007 val = TYPE_VECTOR_SUBPARTS (t1) == TYPE_VECTOR_SUBPARTS (t2)
1008 && comptypes_internal (TREE_TYPE (t1), TREE_TYPE (t2));
1014 return attrval == 2 && val == 1 ? 2 : val;
1017 /* Return 1 if TTL and TTR are pointers to types that are equivalent,
1018 ignoring their qualifiers. */
1021 comp_target_types (tree ttl, tree ttr)
1026 /* Do not lose qualifiers on element types of array types that are
1027 pointer targets by taking their TYPE_MAIN_VARIANT. */
1028 mvl = TREE_TYPE (ttl);
1029 mvr = TREE_TYPE (ttr);
1030 if (TREE_CODE (mvl) != ARRAY_TYPE)
1031 mvl = TYPE_MAIN_VARIANT (mvl);
1032 if (TREE_CODE (mvr) != ARRAY_TYPE)
1033 mvr = TYPE_MAIN_VARIANT (mvr);
1034 val = comptypes (mvl, mvr);
1036 if (val == 2 && pedantic)
1037 pedwarn ("types are not quite compatible");
1041 /* Subroutines of `comptypes'. */
1043 /* Determine whether two trees derive from the same translation unit.
1044 If the CONTEXT chain ends in a null, that tree's context is still
1045 being parsed, so if two trees have context chains ending in null,
1046 they're in the same translation unit. */
1048 same_translation_unit_p (const_tree t1, const_tree t2)
1050 while (t1 && TREE_CODE (t1) != TRANSLATION_UNIT_DECL)
1051 switch (TREE_CODE_CLASS (TREE_CODE (t1)))
1053 case tcc_declaration:
1054 t1 = DECL_CONTEXT (t1); break;
1056 t1 = TYPE_CONTEXT (t1); break;
1057 case tcc_exceptional:
1058 t1 = BLOCK_SUPERCONTEXT (t1); break; /* assume block */
1059 default: gcc_unreachable ();
1062 while (t2 && TREE_CODE (t2) != TRANSLATION_UNIT_DECL)
1063 switch (TREE_CODE_CLASS (TREE_CODE (t2)))
1065 case tcc_declaration:
1066 t2 = DECL_CONTEXT (t2); break;
1068 t2 = TYPE_CONTEXT (t2); break;
1069 case tcc_exceptional:
1070 t2 = BLOCK_SUPERCONTEXT (t2); break; /* assume block */
1071 default: gcc_unreachable ();
1077 /* Allocate the seen two types, assuming that they are compatible. */
1079 static struct tagged_tu_seen_cache *
1080 alloc_tagged_tu_seen_cache (const_tree t1, const_tree t2)
1082 struct tagged_tu_seen_cache *tu = XNEW (struct tagged_tu_seen_cache);
1083 tu->next = tagged_tu_seen_base;
1087 tagged_tu_seen_base = tu;
1089 /* The C standard says that two structures in different translation
1090 units are compatible with each other only if the types of their
1091 fields are compatible (among other things). We assume that they
1092 are compatible until proven otherwise when building the cache.
1093 An example where this can occur is:
1098 If we are comparing this against a similar struct in another TU,
1099 and did not assume they were compatible, we end up with an infinite
1105 /* Free the seen types until we get to TU_TIL. */
1108 free_all_tagged_tu_seen_up_to (const struct tagged_tu_seen_cache *tu_til)
1110 const struct tagged_tu_seen_cache *tu = tagged_tu_seen_base;
1111 while (tu != tu_til)
1113 const struct tagged_tu_seen_cache *const tu1
1114 = (const struct tagged_tu_seen_cache *) tu;
1116 free (CONST_CAST (struct tagged_tu_seen_cache *, tu1));
1118 tagged_tu_seen_base = tu_til;
1121 /* Return 1 if two 'struct', 'union', or 'enum' types T1 and T2 are
1122 compatible. If the two types are not the same (which has been
1123 checked earlier), this can only happen when multiple translation
1124 units are being compiled. See C99 6.2.7 paragraph 1 for the exact
1128 tagged_types_tu_compatible_p (const_tree t1, const_tree t2)
1131 bool needs_warning = false;
1133 /* We have to verify that the tags of the types are the same. This
1134 is harder than it looks because this may be a typedef, so we have
1135 to go look at the original type. It may even be a typedef of a
1137 In the case of compiler-created builtin structs the TYPE_DECL
1138 may be a dummy, with no DECL_ORIGINAL_TYPE. Don't fault. */
1139 while (TYPE_NAME (t1)
1140 && TREE_CODE (TYPE_NAME (t1)) == TYPE_DECL
1141 && DECL_ORIGINAL_TYPE (TYPE_NAME (t1)))
1142 t1 = DECL_ORIGINAL_TYPE (TYPE_NAME (t1));
1144 while (TYPE_NAME (t2)
1145 && TREE_CODE (TYPE_NAME (t2)) == TYPE_DECL
1146 && DECL_ORIGINAL_TYPE (TYPE_NAME (t2)))
1147 t2 = DECL_ORIGINAL_TYPE (TYPE_NAME (t2));
1149 /* C90 didn't have the requirement that the two tags be the same. */
1150 if (flag_isoc99 && TYPE_NAME (t1) != TYPE_NAME (t2))
1153 /* C90 didn't say what happened if one or both of the types were
1154 incomplete; we choose to follow C99 rules here, which is that they
1156 if (TYPE_SIZE (t1) == NULL
1157 || TYPE_SIZE (t2) == NULL)
1161 const struct tagged_tu_seen_cache * tts_i;
1162 for (tts_i = tagged_tu_seen_base; tts_i != NULL; tts_i = tts_i->next)
1163 if (tts_i->t1 == t1 && tts_i->t2 == t2)
1167 switch (TREE_CODE (t1))
1171 struct tagged_tu_seen_cache *tu = alloc_tagged_tu_seen_cache (t1, t2);
1172 /* Speed up the case where the type values are in the same order. */
1173 tree tv1 = TYPE_VALUES (t1);
1174 tree tv2 = TYPE_VALUES (t2);
1181 for (;tv1 && tv2; tv1 = TREE_CHAIN (tv1), tv2 = TREE_CHAIN (tv2))
1183 if (TREE_PURPOSE (tv1) != TREE_PURPOSE (tv2))
1185 if (simple_cst_equal (TREE_VALUE (tv1), TREE_VALUE (tv2)) != 1)
1192 if (tv1 == NULL_TREE && tv2 == NULL_TREE)
1196 if (tv1 == NULL_TREE || tv2 == NULL_TREE)
1202 if (list_length (TYPE_VALUES (t1)) != list_length (TYPE_VALUES (t2)))
1208 for (s1 = TYPE_VALUES (t1); s1; s1 = TREE_CHAIN (s1))
1210 s2 = purpose_member (TREE_PURPOSE (s1), TYPE_VALUES (t2));
1212 || simple_cst_equal (TREE_VALUE (s1), TREE_VALUE (s2)) != 1)
1223 struct tagged_tu_seen_cache *tu = alloc_tagged_tu_seen_cache (t1, t2);
1224 if (list_length (TYPE_FIELDS (t1)) != list_length (TYPE_FIELDS (t2)))
1230 /* Speed up the common case where the fields are in the same order. */
1231 for (s1 = TYPE_FIELDS (t1), s2 = TYPE_FIELDS (t2); s1 && s2;
1232 s1 = TREE_CHAIN (s1), s2 = TREE_CHAIN (s2))
1236 if (DECL_NAME (s1) != DECL_NAME (s2))
1238 result = comptypes_internal (TREE_TYPE (s1), TREE_TYPE (s2));
1240 if (result != 1 && !DECL_NAME (s1))
1248 needs_warning = true;
1250 if (TREE_CODE (s1) == FIELD_DECL
1251 && simple_cst_equal (DECL_FIELD_BIT_OFFSET (s1),
1252 DECL_FIELD_BIT_OFFSET (s2)) != 1)
1260 tu->val = needs_warning ? 2 : 1;
1264 for (s1 = TYPE_FIELDS (t1); s1; s1 = TREE_CHAIN (s1))
1268 for (s2 = TYPE_FIELDS (t2); s2; s2 = TREE_CHAIN (s2))
1269 if (DECL_NAME (s1) == DECL_NAME (s2))
1273 result = comptypes_internal (TREE_TYPE (s1), TREE_TYPE (s2));
1275 if (result != 1 && !DECL_NAME (s1))
1283 needs_warning = true;
1285 if (TREE_CODE (s1) == FIELD_DECL
1286 && simple_cst_equal (DECL_FIELD_BIT_OFFSET (s1),
1287 DECL_FIELD_BIT_OFFSET (s2)) != 1)
1299 tu->val = needs_warning ? 2 : 10;
1305 struct tagged_tu_seen_cache *tu = alloc_tagged_tu_seen_cache (t1, t2);
1307 for (s1 = TYPE_FIELDS (t1), s2 = TYPE_FIELDS (t2);
1309 s1 = TREE_CHAIN (s1), s2 = TREE_CHAIN (s2))
1312 if (TREE_CODE (s1) != TREE_CODE (s2)
1313 || DECL_NAME (s1) != DECL_NAME (s2))
1315 result = comptypes_internal (TREE_TYPE (s1), TREE_TYPE (s2));
1319 needs_warning = true;
1321 if (TREE_CODE (s1) == FIELD_DECL
1322 && simple_cst_equal (DECL_FIELD_BIT_OFFSET (s1),
1323 DECL_FIELD_BIT_OFFSET (s2)) != 1)
1329 tu->val = needs_warning ? 2 : 1;
1338 /* Return 1 if two function types F1 and F2 are compatible.
1339 If either type specifies no argument types,
1340 the other must specify a fixed number of self-promoting arg types.
1341 Otherwise, if one type specifies only the number of arguments,
1342 the other must specify that number of self-promoting arg types.
1343 Otherwise, the argument types must match. */
1346 function_types_compatible_p (const_tree f1, const_tree f2)
1349 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1354 ret1 = TREE_TYPE (f1);
1355 ret2 = TREE_TYPE (f2);
1357 /* 'volatile' qualifiers on a function's return type used to mean
1358 the function is noreturn. */
1359 if (TYPE_VOLATILE (ret1) != TYPE_VOLATILE (ret2))
1360 pedwarn ("function return types not compatible due to %<volatile%>");
1361 if (TYPE_VOLATILE (ret1))
1362 ret1 = build_qualified_type (TYPE_MAIN_VARIANT (ret1),
1363 TYPE_QUALS (ret1) & ~TYPE_QUAL_VOLATILE);
1364 if (TYPE_VOLATILE (ret2))
1365 ret2 = build_qualified_type (TYPE_MAIN_VARIANT (ret2),
1366 TYPE_QUALS (ret2) & ~TYPE_QUAL_VOLATILE);
1367 val = comptypes_internal (ret1, ret2);
1371 args1 = TYPE_ARG_TYPES (f1);
1372 args2 = TYPE_ARG_TYPES (f2);
1374 /* An unspecified parmlist matches any specified parmlist
1375 whose argument types don't need default promotions. */
1379 if (!self_promoting_args_p (args2))
1381 /* If one of these types comes from a non-prototype fn definition,
1382 compare that with the other type's arglist.
1383 If they don't match, ask for a warning (but no error). */
1384 if (TYPE_ACTUAL_ARG_TYPES (f1)
1385 && 1 != type_lists_compatible_p (args2, TYPE_ACTUAL_ARG_TYPES (f1)))
1391 if (!self_promoting_args_p (args1))
1393 if (TYPE_ACTUAL_ARG_TYPES (f2)
1394 && 1 != type_lists_compatible_p (args1, TYPE_ACTUAL_ARG_TYPES (f2)))
1399 /* Both types have argument lists: compare them and propagate results. */
1400 val1 = type_lists_compatible_p (args1, args2);
1401 return val1 != 1 ? val1 : val;
1404 /* Check two lists of types for compatibility,
1405 returning 0 for incompatible, 1 for compatible,
1406 or 2 for compatible with warning. */
1409 type_lists_compatible_p (const_tree args1, const_tree args2)
1411 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1417 tree a1, mv1, a2, mv2;
1418 if (args1 == 0 && args2 == 0)
1420 /* If one list is shorter than the other,
1421 they fail to match. */
1422 if (args1 == 0 || args2 == 0)
1424 mv1 = a1 = TREE_VALUE (args1);
1425 mv2 = a2 = TREE_VALUE (args2);
1426 if (mv1 && mv1 != error_mark_node && TREE_CODE (mv1) != ARRAY_TYPE)
1427 mv1 = TYPE_MAIN_VARIANT (mv1);
1428 if (mv2 && mv2 != error_mark_node && TREE_CODE (mv2) != ARRAY_TYPE)
1429 mv2 = TYPE_MAIN_VARIANT (mv2);
1430 /* A null pointer instead of a type
1431 means there is supposed to be an argument
1432 but nothing is specified about what type it has.
1433 So match anything that self-promotes. */
1436 if (c_type_promotes_to (a2) != a2)
1441 if (c_type_promotes_to (a1) != a1)
1444 /* If one of the lists has an error marker, ignore this arg. */
1445 else if (TREE_CODE (a1) == ERROR_MARK
1446 || TREE_CODE (a2) == ERROR_MARK)
1448 else if (!(newval = comptypes_internal (mv1, mv2)))
1450 /* Allow wait (union {union wait *u; int *i} *)
1451 and wait (union wait *) to be compatible. */
1452 if (TREE_CODE (a1) == UNION_TYPE
1453 && (TYPE_NAME (a1) == 0
1454 || TYPE_TRANSPARENT_UNION (a1))
1455 && TREE_CODE (TYPE_SIZE (a1)) == INTEGER_CST
1456 && tree_int_cst_equal (TYPE_SIZE (a1),
1460 for (memb = TYPE_FIELDS (a1);
1461 memb; memb = TREE_CHAIN (memb))
1463 tree mv3 = TREE_TYPE (memb);
1464 if (mv3 && mv3 != error_mark_node
1465 && TREE_CODE (mv3) != ARRAY_TYPE)
1466 mv3 = TYPE_MAIN_VARIANT (mv3);
1467 if (comptypes_internal (mv3, mv2))
1473 else if (TREE_CODE (a2) == UNION_TYPE
1474 && (TYPE_NAME (a2) == 0
1475 || TYPE_TRANSPARENT_UNION (a2))
1476 && TREE_CODE (TYPE_SIZE (a2)) == INTEGER_CST
1477 && tree_int_cst_equal (TYPE_SIZE (a2),
1481 for (memb = TYPE_FIELDS (a2);
1482 memb; memb = TREE_CHAIN (memb))
1484 tree mv3 = TREE_TYPE (memb);
1485 if (mv3 && mv3 != error_mark_node
1486 && TREE_CODE (mv3) != ARRAY_TYPE)
1487 mv3 = TYPE_MAIN_VARIANT (mv3);
1488 if (comptypes_internal (mv3, mv1))
1498 /* comptypes said ok, but record if it said to warn. */
1502 args1 = TREE_CHAIN (args1);
1503 args2 = TREE_CHAIN (args2);
1507 /* Compute the size to increment a pointer by. */
1510 c_size_in_bytes (const_tree type)
1512 enum tree_code code = TREE_CODE (type);
1514 if (code == FUNCTION_TYPE || code == VOID_TYPE || code == ERROR_MARK)
1515 return size_one_node;
1517 if (!COMPLETE_OR_VOID_TYPE_P (type))
1519 error ("arithmetic on pointer to an incomplete type");
1520 return size_one_node;
1523 /* Convert in case a char is more than one unit. */
1524 return size_binop (CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type),
1525 size_int (TYPE_PRECISION (char_type_node)
1529 /* Return either DECL or its known constant value (if it has one). */
1532 decl_constant_value (tree decl)
1534 if (/* Don't change a variable array bound or initial value to a constant
1535 in a place where a variable is invalid. Note that DECL_INITIAL
1536 isn't valid for a PARM_DECL. */
1537 current_function_decl != 0
1538 && TREE_CODE (decl) != PARM_DECL
1539 && !TREE_THIS_VOLATILE (decl)
1540 && TREE_READONLY (decl)
1541 && DECL_INITIAL (decl) != 0
1542 && TREE_CODE (DECL_INITIAL (decl)) != ERROR_MARK
1543 /* This is invalid if initial value is not constant.
1544 If it has either a function call, a memory reference,
1545 or a variable, then re-evaluating it could give different results. */
1546 && TREE_CONSTANT (DECL_INITIAL (decl))
1547 /* Check for cases where this is sub-optimal, even though valid. */
1548 && TREE_CODE (DECL_INITIAL (decl)) != CONSTRUCTOR)
1549 return DECL_INITIAL (decl);
1553 /* Return either DECL or its known constant value (if it has one), but
1554 return DECL if pedantic or DECL has mode BLKmode. This is for
1555 bug-compatibility with the old behavior of decl_constant_value
1556 (before GCC 3.0); every use of this function is a bug and it should
1557 be removed before GCC 3.1. It is not appropriate to use pedantic
1558 in a way that affects optimization, and BLKmode is probably not the
1559 right test for avoiding misoptimizations either. */
1562 decl_constant_value_for_broken_optimization (tree decl)
1566 if (pedantic || DECL_MODE (decl) == BLKmode)
1569 ret = decl_constant_value (decl);
1570 /* Avoid unwanted tree sharing between the initializer and current
1571 function's body where the tree can be modified e.g. by the
1573 if (ret != decl && TREE_STATIC (decl))
1574 ret = unshare_expr (ret);
1578 /* Convert the array expression EXP to a pointer. */
1580 array_to_pointer_conversion (tree exp)
1582 tree orig_exp = exp;
1583 tree type = TREE_TYPE (exp);
1585 tree restype = TREE_TYPE (type);
1588 gcc_assert (TREE_CODE (type) == ARRAY_TYPE);
1590 STRIP_TYPE_NOPS (exp);
1592 if (TREE_NO_WARNING (orig_exp))
1593 TREE_NO_WARNING (exp) = 1;
1595 ptrtype = build_pointer_type (restype);
1597 if (TREE_CODE (exp) == INDIRECT_REF)
1598 return convert (ptrtype, TREE_OPERAND (exp, 0));
1600 if (TREE_CODE (exp) == VAR_DECL)
1602 /* We are making an ADDR_EXPR of ptrtype. This is a valid
1603 ADDR_EXPR because it's the best way of representing what
1604 happens in C when we take the address of an array and place
1605 it in a pointer to the element type. */
1606 adr = build1 (ADDR_EXPR, ptrtype, exp);
1607 if (!c_mark_addressable (exp))
1608 return error_mark_node;
1609 TREE_SIDE_EFFECTS (adr) = 0; /* Default would be, same as EXP. */
1613 /* This way is better for a COMPONENT_REF since it can
1614 simplify the offset for a component. */
1615 adr = build_unary_op (ADDR_EXPR, exp, 1);
1616 return convert (ptrtype, adr);
1619 /* Convert the function expression EXP to a pointer. */
1621 function_to_pointer_conversion (tree exp)
1623 tree orig_exp = exp;
1625 gcc_assert (TREE_CODE (TREE_TYPE (exp)) == FUNCTION_TYPE);
1627 STRIP_TYPE_NOPS (exp);
1629 if (TREE_NO_WARNING (orig_exp))
1630 TREE_NO_WARNING (exp) = 1;
1632 return build_unary_op (ADDR_EXPR, exp, 0);
1635 /* Perform the default conversion of arrays and functions to pointers.
1636 Return the result of converting EXP. For any other expression, just
1637 return EXP after removing NOPs. */
1640 default_function_array_conversion (struct c_expr exp)
1642 tree orig_exp = exp.value;
1643 tree type = TREE_TYPE (exp.value);
1644 enum tree_code code = TREE_CODE (type);
1650 bool not_lvalue = false;
1651 bool lvalue_array_p;
1653 while ((TREE_CODE (exp.value) == NON_LVALUE_EXPR
1654 || TREE_CODE (exp.value) == NOP_EXPR
1655 || TREE_CODE (exp.value) == CONVERT_EXPR)
1656 && TREE_TYPE (TREE_OPERAND (exp.value, 0)) == type)
1658 if (TREE_CODE (exp.value) == NON_LVALUE_EXPR)
1660 exp.value = TREE_OPERAND (exp.value, 0);
1663 if (TREE_NO_WARNING (orig_exp))
1664 TREE_NO_WARNING (exp.value) = 1;
1666 lvalue_array_p = !not_lvalue && lvalue_p (exp.value);
1667 if (!flag_isoc99 && !lvalue_array_p)
1669 /* Before C99, non-lvalue arrays do not decay to pointers.
1670 Normally, using such an array would be invalid; but it can
1671 be used correctly inside sizeof or as a statement expression.
1672 Thus, do not give an error here; an error will result later. */
1676 exp.value = array_to_pointer_conversion (exp.value);
1680 exp.value = function_to_pointer_conversion (exp.value);
1683 STRIP_TYPE_NOPS (exp.value);
1684 if (TREE_NO_WARNING (orig_exp))
1685 TREE_NO_WARNING (exp.value) = 1;
1693 /* EXP is an expression of integer type. Apply the integer promotions
1694 to it and return the promoted value. */
1697 perform_integral_promotions (tree exp)
1699 tree type = TREE_TYPE (exp);
1700 enum tree_code code = TREE_CODE (type);
1702 gcc_assert (INTEGRAL_TYPE_P (type));
1704 /* Normally convert enums to int,
1705 but convert wide enums to something wider. */
1706 if (code == ENUMERAL_TYPE)
1708 type = c_common_type_for_size (MAX (TYPE_PRECISION (type),
1709 TYPE_PRECISION (integer_type_node)),
1710 ((TYPE_PRECISION (type)
1711 >= TYPE_PRECISION (integer_type_node))
1712 && TYPE_UNSIGNED (type)));
1714 return convert (type, exp);
1717 /* ??? This should no longer be needed now bit-fields have their
1719 if (TREE_CODE (exp) == COMPONENT_REF
1720 && DECL_C_BIT_FIELD (TREE_OPERAND (exp, 1))
1721 /* If it's thinner than an int, promote it like a
1722 c_promoting_integer_type_p, otherwise leave it alone. */
1723 && 0 > compare_tree_int (DECL_SIZE (TREE_OPERAND (exp, 1)),
1724 TYPE_PRECISION (integer_type_node)))
1725 return convert (integer_type_node, exp);
1727 if (c_promoting_integer_type_p (type))
1729 /* Preserve unsignedness if not really getting any wider. */
1730 if (TYPE_UNSIGNED (type)
1731 && TYPE_PRECISION (type) == TYPE_PRECISION (integer_type_node))
1732 return convert (unsigned_type_node, exp);
1734 return convert (integer_type_node, exp);
1741 /* Perform default promotions for C data used in expressions.
1742 Enumeral types or short or char are converted to int.
1743 In addition, manifest constants symbols are replaced by their values. */
1746 default_conversion (tree exp)
1749 tree type = TREE_TYPE (exp);
1750 enum tree_code code = TREE_CODE (type);
1752 /* Functions and arrays have been converted during parsing. */
1753 gcc_assert (code != FUNCTION_TYPE);
1754 if (code == ARRAY_TYPE)
1757 /* Constants can be used directly unless they're not loadable. */
1758 if (TREE_CODE (exp) == CONST_DECL)
1759 exp = DECL_INITIAL (exp);
1761 /* Replace a nonvolatile const static variable with its value unless
1762 it is an array, in which case we must be sure that taking the
1763 address of the array produces consistent results. */
1764 else if (optimize && TREE_CODE (exp) == VAR_DECL && code != ARRAY_TYPE)
1766 exp = decl_constant_value_for_broken_optimization (exp);
1767 type = TREE_TYPE (exp);
1770 /* Strip no-op conversions. */
1772 STRIP_TYPE_NOPS (exp);
1774 if (TREE_NO_WARNING (orig_exp))
1775 TREE_NO_WARNING (exp) = 1;
1777 if (code == VOID_TYPE)
1779 error ("void value not ignored as it ought to be");
1780 return error_mark_node;
1783 exp = require_complete_type (exp);
1784 if (exp == error_mark_node)
1785 return error_mark_node;
1787 if (INTEGRAL_TYPE_P (type))
1788 return perform_integral_promotions (exp);
1793 /* Look up COMPONENT in a structure or union DECL.
1795 If the component name is not found, returns NULL_TREE. Otherwise,
1796 the return value is a TREE_LIST, with each TREE_VALUE a FIELD_DECL
1797 stepping down the chain to the component, which is in the last
1798 TREE_VALUE of the list. Normally the list is of length one, but if
1799 the component is embedded within (nested) anonymous structures or
1800 unions, the list steps down the chain to the component. */
1803 lookup_field (tree decl, tree component)
1805 tree type = TREE_TYPE (decl);
1808 /* If TYPE_LANG_SPECIFIC is set, then it is a sorted array of pointers
1809 to the field elements. Use a binary search on this array to quickly
1810 find the element. Otherwise, do a linear search. TYPE_LANG_SPECIFIC
1811 will always be set for structures which have many elements. */
1813 if (TYPE_LANG_SPECIFIC (type) && TYPE_LANG_SPECIFIC (type)->s)
1816 tree *field_array = &TYPE_LANG_SPECIFIC (type)->s->elts[0];
1818 field = TYPE_FIELDS (type);
1820 top = TYPE_LANG_SPECIFIC (type)->s->len;
1821 while (top - bot > 1)
1823 half = (top - bot + 1) >> 1;
1824 field = field_array[bot+half];
1826 if (DECL_NAME (field) == NULL_TREE)
1828 /* Step through all anon unions in linear fashion. */
1829 while (DECL_NAME (field_array[bot]) == NULL_TREE)
1831 field = field_array[bot++];
1832 if (TREE_CODE (TREE_TYPE (field)) == RECORD_TYPE
1833 || TREE_CODE (TREE_TYPE (field)) == UNION_TYPE)
1835 tree anon = lookup_field (field, component);
1838 return tree_cons (NULL_TREE, field, anon);
1842 /* Entire record is only anon unions. */
1846 /* Restart the binary search, with new lower bound. */
1850 if (DECL_NAME (field) == component)
1852 if (DECL_NAME (field) < component)
1858 if (DECL_NAME (field_array[bot]) == component)
1859 field = field_array[bot];
1860 else if (DECL_NAME (field) != component)
1865 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
1867 if (DECL_NAME (field) == NULL_TREE
1868 && (TREE_CODE (TREE_TYPE (field)) == RECORD_TYPE
1869 || TREE_CODE (TREE_TYPE (field)) == UNION_TYPE))
1871 tree anon = lookup_field (field, component);
1874 return tree_cons (NULL_TREE, field, anon);
1877 if (DECL_NAME (field) == component)
1881 if (field == NULL_TREE)
1885 return tree_cons (NULL_TREE, field, NULL_TREE);
1888 /* Make an expression to refer to the COMPONENT field of
1889 structure or union value DATUM. COMPONENT is an IDENTIFIER_NODE. */
1892 build_component_ref (tree datum, tree component)
1894 tree type = TREE_TYPE (datum);
1895 enum tree_code code = TREE_CODE (type);
1899 if (!objc_is_public (datum, component))
1900 return error_mark_node;
1902 /* See if there is a field or component with name COMPONENT. */
1904 if (code == RECORD_TYPE || code == UNION_TYPE)
1906 if (!COMPLETE_TYPE_P (type))
1908 c_incomplete_type_error (NULL_TREE, type);
1909 return error_mark_node;
1912 field = lookup_field (datum, component);
1916 error ("%qT has no member named %qE", type, component);
1917 return error_mark_node;
1920 /* Chain the COMPONENT_REFs if necessary down to the FIELD.
1921 This might be better solved in future the way the C++ front
1922 end does it - by giving the anonymous entities each a
1923 separate name and type, and then have build_component_ref
1924 recursively call itself. We can't do that here. */
1927 tree subdatum = TREE_VALUE (field);
1931 if (TREE_TYPE (subdatum) == error_mark_node)
1932 return error_mark_node;
1934 quals = TYPE_QUALS (strip_array_types (TREE_TYPE (subdatum)));
1935 quals |= TYPE_QUALS (TREE_TYPE (datum));
1936 subtype = c_build_qualified_type (TREE_TYPE (subdatum), quals);
1938 ref = build3 (COMPONENT_REF, subtype, datum, subdatum,
1940 if (TREE_READONLY (datum) || TREE_READONLY (subdatum))
1941 TREE_READONLY (ref) = 1;
1942 if (TREE_THIS_VOLATILE (datum) || TREE_THIS_VOLATILE (subdatum))
1943 TREE_THIS_VOLATILE (ref) = 1;
1945 if (TREE_DEPRECATED (subdatum))
1946 warn_deprecated_use (subdatum);
1950 field = TREE_CHAIN (field);
1956 else if (code != ERROR_MARK)
1957 error ("request for member %qE in something not a structure or union",
1960 return error_mark_node;
1963 /* Given an expression PTR for a pointer, return an expression
1964 for the value pointed to.
1965 ERRORSTRING is the name of the operator to appear in error messages. */
1968 build_indirect_ref (tree ptr, const char *errorstring)
1970 tree pointer = default_conversion (ptr);
1971 tree type = TREE_TYPE (pointer);
1973 if (TREE_CODE (type) == POINTER_TYPE)
1975 if (TREE_CODE (pointer) == CONVERT_EXPR
1976 || TREE_CODE (pointer) == NOP_EXPR
1977 || TREE_CODE (pointer) == VIEW_CONVERT_EXPR)
1979 /* If a warning is issued, mark it to avoid duplicates from
1980 the backend. This only needs to be done at
1981 warn_strict_aliasing > 2. */
1982 if (warn_strict_aliasing > 2)
1983 if (strict_aliasing_warning (TREE_TYPE (TREE_OPERAND (pointer, 0)),
1984 type, TREE_OPERAND (pointer, 0)))
1985 TREE_NO_WARNING (pointer) = 1;
1988 if (TREE_CODE (pointer) == ADDR_EXPR
1989 && (TREE_TYPE (TREE_OPERAND (pointer, 0))
1990 == TREE_TYPE (type)))
1991 return TREE_OPERAND (pointer, 0);
1994 tree t = TREE_TYPE (type);
1997 ref = build1 (INDIRECT_REF, t, pointer);
1999 if (!COMPLETE_OR_VOID_TYPE_P (t) && TREE_CODE (t) != ARRAY_TYPE)
2001 error ("dereferencing pointer to incomplete type");
2002 return error_mark_node;
2004 if (VOID_TYPE_P (t) && skip_evaluation == 0)
2005 warning (0, "dereferencing %<void *%> pointer");
2007 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
2008 so that we get the proper error message if the result is used
2009 to assign to. Also, &* is supposed to be a no-op.
2010 And ANSI C seems to specify that the type of the result
2011 should be the const type. */
2012 /* A de-reference of a pointer to const is not a const. It is valid
2013 to change it via some other pointer. */
2014 TREE_READONLY (ref) = TYPE_READONLY (t);
2015 TREE_SIDE_EFFECTS (ref)
2016 = TYPE_VOLATILE (t) || TREE_SIDE_EFFECTS (pointer);
2017 TREE_THIS_VOLATILE (ref) = TYPE_VOLATILE (t);
2021 else if (TREE_CODE (pointer) != ERROR_MARK)
2022 error ("invalid type argument of %qs (have %qT)", errorstring, type);
2023 return error_mark_node;
2026 /* This handles expressions of the form "a[i]", which denotes
2029 This is logically equivalent in C to *(a+i), but we may do it differently.
2030 If A is a variable or a member, we generate a primitive ARRAY_REF.
2031 This avoids forcing the array out of registers, and can work on
2032 arrays that are not lvalues (for example, members of structures returned
2036 build_array_ref (tree array, tree index)
2038 bool swapped = false;
2039 if (TREE_TYPE (array) == error_mark_node
2040 || TREE_TYPE (index) == error_mark_node)
2041 return error_mark_node;
2043 if (TREE_CODE (TREE_TYPE (array)) != ARRAY_TYPE
2044 && TREE_CODE (TREE_TYPE (array)) != POINTER_TYPE)
2047 if (TREE_CODE (TREE_TYPE (index)) != ARRAY_TYPE
2048 && TREE_CODE (TREE_TYPE (index)) != POINTER_TYPE)
2050 error ("subscripted value is neither array nor pointer");
2051 return error_mark_node;
2059 if (!INTEGRAL_TYPE_P (TREE_TYPE (index)))
2061 error ("array subscript is not an integer");
2062 return error_mark_node;
2065 if (TREE_CODE (TREE_TYPE (TREE_TYPE (array))) == FUNCTION_TYPE)
2067 error ("subscripted value is pointer to function");
2068 return error_mark_node;
2071 /* ??? Existing practice has been to warn only when the char
2072 index is syntactically the index, not for char[array]. */
2074 warn_array_subscript_with_type_char (index);
2076 /* Apply default promotions *after* noticing character types. */
2077 index = default_conversion (index);
2079 gcc_assert (TREE_CODE (TREE_TYPE (index)) == INTEGER_TYPE);
2081 if (TREE_CODE (TREE_TYPE (array)) == ARRAY_TYPE)
2085 /* An array that is indexed by a non-constant
2086 cannot be stored in a register; we must be able to do
2087 address arithmetic on its address.
2088 Likewise an array of elements of variable size. */
2089 if (TREE_CODE (index) != INTEGER_CST
2090 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array)))
2091 && TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array)))) != INTEGER_CST))
2093 if (!c_mark_addressable (array))
2094 return error_mark_node;
2096 /* An array that is indexed by a constant value which is not within
2097 the array bounds cannot be stored in a register either; because we
2098 would get a crash in store_bit_field/extract_bit_field when trying
2099 to access a non-existent part of the register. */
2100 if (TREE_CODE (index) == INTEGER_CST
2101 && TYPE_DOMAIN (TREE_TYPE (array))
2102 && !int_fits_type_p (index, TYPE_DOMAIN (TREE_TYPE (array))))
2104 if (!c_mark_addressable (array))
2105 return error_mark_node;
2111 while (TREE_CODE (foo) == COMPONENT_REF)
2112 foo = TREE_OPERAND (foo, 0);
2113 if (TREE_CODE (foo) == VAR_DECL && C_DECL_REGISTER (foo))
2114 pedwarn ("ISO C forbids subscripting %<register%> array");
2115 else if (!flag_isoc99 && !lvalue_p (foo))
2116 pedwarn ("ISO C90 forbids subscripting non-lvalue array");
2119 type = TREE_TYPE (TREE_TYPE (array));
2120 rval = build4 (ARRAY_REF, type, array, index, NULL_TREE, NULL_TREE);
2121 /* Array ref is const/volatile if the array elements are
2122 or if the array is. */
2123 TREE_READONLY (rval)
2124 |= (TYPE_READONLY (TREE_TYPE (TREE_TYPE (array)))
2125 | TREE_READONLY (array));
2126 TREE_SIDE_EFFECTS (rval)
2127 |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array)))
2128 | TREE_SIDE_EFFECTS (array));
2129 TREE_THIS_VOLATILE (rval)
2130 |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array)))
2131 /* This was added by rms on 16 Nov 91.
2132 It fixes vol struct foo *a; a->elts[1]
2133 in an inline function.
2134 Hope it doesn't break something else. */
2135 | TREE_THIS_VOLATILE (array));
2136 return require_complete_type (fold (rval));
2140 tree ar = default_conversion (array);
2142 if (ar == error_mark_node)
2145 gcc_assert (TREE_CODE (TREE_TYPE (ar)) == POINTER_TYPE);
2146 gcc_assert (TREE_CODE (TREE_TYPE (TREE_TYPE (ar))) != FUNCTION_TYPE);
2148 return build_indirect_ref (build_binary_op (PLUS_EXPR, ar, index, 0),
2153 /* Build an external reference to identifier ID. FUN indicates
2154 whether this will be used for a function call. LOC is the source
2155 location of the identifier. */
2157 build_external_ref (tree id, int fun, location_t loc)
2160 tree decl = lookup_name (id);
2162 /* In Objective-C, an instance variable (ivar) may be preferred to
2163 whatever lookup_name() found. */
2164 decl = objc_lookup_ivar (decl, id);
2166 if (decl && decl != error_mark_node)
2169 /* Implicit function declaration. */
2170 ref = implicitly_declare (id);
2171 else if (decl == error_mark_node)
2172 /* Don't complain about something that's already been
2173 complained about. */
2174 return error_mark_node;
2177 undeclared_variable (id, loc);
2178 return error_mark_node;
2181 if (TREE_TYPE (ref) == error_mark_node)
2182 return error_mark_node;
2184 if (TREE_DEPRECATED (ref))
2185 warn_deprecated_use (ref);
2187 /* Recursive call does not count as usage. */
2188 if (ref != current_function_decl)
2190 if (!skip_evaluation)
2191 assemble_external (ref);
2192 TREE_USED (ref) = 1;
2195 if (TREE_CODE (ref) == FUNCTION_DECL && !in_alignof)
2197 if (!in_sizeof && !in_typeof)
2198 C_DECL_USED (ref) = 1;
2199 else if (DECL_INITIAL (ref) == 0
2200 && DECL_EXTERNAL (ref)
2201 && !TREE_PUBLIC (ref))
2202 record_maybe_used_decl (ref);
2205 if (TREE_CODE (ref) == CONST_DECL)
2207 used_types_insert (TREE_TYPE (ref));
2208 ref = DECL_INITIAL (ref);
2209 TREE_CONSTANT (ref) = 1;
2210 TREE_INVARIANT (ref) = 1;
2212 else if (current_function_decl != 0
2213 && !DECL_FILE_SCOPE_P (current_function_decl)
2214 && (TREE_CODE (ref) == VAR_DECL
2215 || TREE_CODE (ref) == PARM_DECL
2216 || TREE_CODE (ref) == FUNCTION_DECL))
2218 tree context = decl_function_context (ref);
2220 if (context != 0 && context != current_function_decl)
2221 DECL_NONLOCAL (ref) = 1;
2223 /* C99 6.7.4p3: An inline definition of a function with external
2224 linkage ... shall not contain a reference to an identifier with
2225 internal linkage. */
2226 else if (current_function_decl != 0
2227 && DECL_DECLARED_INLINE_P (current_function_decl)
2228 && DECL_EXTERNAL (current_function_decl)
2229 && VAR_OR_FUNCTION_DECL_P (ref)
2230 && (TREE_CODE (ref) != VAR_DECL || TREE_STATIC (ref))
2231 && ! TREE_PUBLIC (ref))
2232 pedwarn ("%H%qD is static but used in inline function %qD "
2233 "which is not static", &loc, ref, current_function_decl);
2238 /* Record details of decls possibly used inside sizeof or typeof. */
2239 struct maybe_used_decl
2243 /* The level seen at (in_sizeof + in_typeof). */
2245 /* The next one at this level or above, or NULL. */
2246 struct maybe_used_decl *next;
2249 static struct maybe_used_decl *maybe_used_decls;
2251 /* Record that DECL, an undefined static function reference seen
2252 inside sizeof or typeof, might be used if the operand of sizeof is
2253 a VLA type or the operand of typeof is a variably modified
2257 record_maybe_used_decl (tree decl)
2259 struct maybe_used_decl *t = XOBNEW (&parser_obstack, struct maybe_used_decl);
2261 t->level = in_sizeof + in_typeof;
2262 t->next = maybe_used_decls;
2263 maybe_used_decls = t;
2266 /* Pop the stack of decls possibly used inside sizeof or typeof. If
2267 USED is false, just discard them. If it is true, mark them used
2268 (if no longer inside sizeof or typeof) or move them to the next
2269 level up (if still inside sizeof or typeof). */
2272 pop_maybe_used (bool used)
2274 struct maybe_used_decl *p = maybe_used_decls;
2275 int cur_level = in_sizeof + in_typeof;
2276 while (p && p->level > cur_level)
2281 C_DECL_USED (p->decl) = 1;
2283 p->level = cur_level;
2287 if (!used || cur_level == 0)
2288 maybe_used_decls = p;
2291 /* Return the result of sizeof applied to EXPR. */
2294 c_expr_sizeof_expr (struct c_expr expr)
2297 if (expr.value == error_mark_node)
2299 ret.value = error_mark_node;
2300 ret.original_code = ERROR_MARK;
2301 pop_maybe_used (false);
2305 ret.value = c_sizeof (TREE_TYPE (expr.value));
2306 ret.original_code = ERROR_MARK;
2307 if (c_vla_type_p (TREE_TYPE (expr.value)))
2309 /* sizeof is evaluated when given a vla (C99 6.5.3.4p2). */
2310 ret.value = build2 (COMPOUND_EXPR, TREE_TYPE (ret.value), expr.value, ret.value);
2312 pop_maybe_used (C_TYPE_VARIABLE_SIZE (TREE_TYPE (expr.value)));
2317 /* Return the result of sizeof applied to T, a structure for the type
2318 name passed to sizeof (rather than the type itself). */
2321 c_expr_sizeof_type (struct c_type_name *t)
2325 type = groktypename (t);
2326 ret.value = c_sizeof (type);
2327 ret.original_code = ERROR_MARK;
2328 pop_maybe_used (type != error_mark_node
2329 ? C_TYPE_VARIABLE_SIZE (type) : false);
2333 /* Build a function call to function FUNCTION with parameters PARAMS.
2334 PARAMS is a list--a chain of TREE_LIST nodes--in which the
2335 TREE_VALUE of each node is a parameter-expression.
2336 FUNCTION's data type may be a function type or a pointer-to-function. */
2339 build_function_call (tree function, tree params)
2341 tree fntype, fundecl = 0;
2342 tree name = NULL_TREE, result;
2348 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
2349 STRIP_TYPE_NOPS (function);
2351 /* Convert anything with function type to a pointer-to-function. */
2352 if (TREE_CODE (function) == FUNCTION_DECL)
2354 /* Implement type-directed function overloading for builtins.
2355 resolve_overloaded_builtin and targetm.resolve_overloaded_builtin
2356 handle all the type checking. The result is a complete expression
2357 that implements this function call. */
2358 tem = resolve_overloaded_builtin (function, params);
2362 name = DECL_NAME (function);
2365 if (TREE_CODE (TREE_TYPE (function)) == FUNCTION_TYPE)
2366 function = function_to_pointer_conversion (function);
2368 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
2369 expressions, like those used for ObjC messenger dispatches. */
2370 function = objc_rewrite_function_call (function, params);
2372 fntype = TREE_TYPE (function);
2374 if (TREE_CODE (fntype) == ERROR_MARK)
2375 return error_mark_node;
2377 if (!(TREE_CODE (fntype) == POINTER_TYPE
2378 && TREE_CODE (TREE_TYPE (fntype)) == FUNCTION_TYPE))
2380 error ("called object %qE is not a function", function);
2381 return error_mark_node;
2384 if (fundecl && TREE_THIS_VOLATILE (fundecl))
2385 current_function_returns_abnormally = 1;
2387 /* fntype now gets the type of function pointed to. */
2388 fntype = TREE_TYPE (fntype);
2390 /* Check that the function is called through a compatible prototype.
2391 If it is not, replace the call by a trap, wrapped up in a compound
2392 expression if necessary. This has the nice side-effect to prevent
2393 the tree-inliner from generating invalid assignment trees which may
2394 blow up in the RTL expander later. */
2395 if ((TREE_CODE (function) == NOP_EXPR
2396 || TREE_CODE (function) == CONVERT_EXPR)
2397 && TREE_CODE (tem = TREE_OPERAND (function, 0)) == ADDR_EXPR
2398 && TREE_CODE (tem = TREE_OPERAND (tem, 0)) == FUNCTION_DECL
2399 && !comptypes (fntype, TREE_TYPE (tem)))
2401 tree return_type = TREE_TYPE (fntype);
2402 tree trap = build_function_call (built_in_decls[BUILT_IN_TRAP],
2405 /* This situation leads to run-time undefined behavior. We can't,
2406 therefore, simply error unless we can prove that all possible
2407 executions of the program must execute the code. */
2408 warning (0, "function called through a non-compatible type");
2410 /* We can, however, treat "undefined" any way we please.
2411 Call abort to encourage the user to fix the program. */
2412 inform ("if this code is reached, the program will abort");
2414 if (VOID_TYPE_P (return_type))
2420 if (AGGREGATE_TYPE_P (return_type))
2421 rhs = build_compound_literal (return_type,
2422 build_constructor (return_type, 0));
2424 rhs = fold_convert (return_type, integer_zero_node);
2426 return build2 (COMPOUND_EXPR, return_type, trap, rhs);
2430 /* Convert the parameters to the types declared in the
2431 function prototype, or apply default promotions. */
2433 nargs = list_length (params);
2434 argarray = (tree *) alloca (nargs * sizeof (tree));
2435 nargs = convert_arguments (nargs, argarray, TYPE_ARG_TYPES (fntype),
2436 params, function, fundecl);
2438 return error_mark_node;
2440 /* Check that the arguments to the function are valid. */
2442 check_function_arguments (TYPE_ATTRIBUTES (fntype), nargs, argarray,
2443 TYPE_ARG_TYPES (fntype));
2445 if (require_constant_value)
2447 result = fold_build_call_array_initializer (TREE_TYPE (fntype),
2448 function, nargs, argarray);
2449 if (TREE_CONSTANT (result)
2450 && (name == NULL_TREE
2451 || strncmp (IDENTIFIER_POINTER (name), "__builtin_", 10) != 0))
2452 pedwarn_init ("initializer element is not constant");
2455 result = fold_build_call_array (TREE_TYPE (fntype),
2456 function, nargs, argarray);
2458 if (VOID_TYPE_P (TREE_TYPE (result)))
2460 return require_complete_type (result);
2463 /* Convert the argument expressions in the list VALUES
2464 to the types in the list TYPELIST. The resulting arguments are
2465 stored in the array ARGARRAY which has size NARGS.
2467 If TYPELIST is exhausted, or when an element has NULL as its type,
2468 perform the default conversions.
2470 PARMLIST is the chain of parm decls for the function being called.
2471 It may be 0, if that info is not available.
2472 It is used only for generating error messages.
2474 FUNCTION is a tree for the called function. It is used only for
2475 error messages, where it is formatted with %qE.
2477 This is also where warnings about wrong number of args are generated.
2479 VALUES is a chain of TREE_LIST nodes with the elements of the list
2480 in the TREE_VALUE slots of those nodes.
2482 Returns the actual number of arguments processed (which may be less
2483 than NARGS in some error situations), or -1 on failure. */
2486 convert_arguments (int nargs, tree *argarray,
2487 tree typelist, tree values, tree function, tree fundecl)
2489 tree typetail, valtail;
2491 const bool type_generic = fundecl
2492 && lookup_attribute ("type generic", TYPE_ATTRIBUTES(TREE_TYPE (fundecl)));
2495 /* Change pointer to function to the function itself for
2497 if (TREE_CODE (function) == ADDR_EXPR
2498 && TREE_CODE (TREE_OPERAND (function, 0)) == FUNCTION_DECL)
2499 function = TREE_OPERAND (function, 0);
2501 /* Handle an ObjC selector specially for diagnostics. */
2502 selector = objc_message_selector ();
2504 /* Scan the given expressions and types, producing individual
2505 converted arguments and storing them in ARGARRAY. */
2507 for (valtail = values, typetail = typelist, parmnum = 0;
2509 valtail = TREE_CHAIN (valtail), parmnum++)
2511 tree type = typetail ? TREE_VALUE (typetail) : 0;
2512 tree val = TREE_VALUE (valtail);
2513 tree rname = function;
2514 int argnum = parmnum + 1;
2515 const char *invalid_func_diag;
2517 if (type == void_type_node)
2519 error ("too many arguments to function %qE", function);
2523 if (selector && argnum > 2)
2529 STRIP_TYPE_NOPS (val);
2531 val = require_complete_type (val);
2535 /* Formal parm type is specified by a function prototype. */
2538 if (type == error_mark_node || !COMPLETE_TYPE_P (type))
2540 error ("type of formal parameter %d is incomplete", parmnum + 1);
2545 /* Optionally warn about conversions that
2546 differ from the default conversions. */
2547 if (warn_traditional_conversion || warn_traditional)
2549 unsigned int formal_prec = TYPE_PRECISION (type);
2551 if (INTEGRAL_TYPE_P (type)
2552 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
2553 warning (0, "passing argument %d of %qE as integer "
2554 "rather than floating due to prototype",
2556 if (INTEGRAL_TYPE_P (type)
2557 && TREE_CODE (TREE_TYPE (val)) == COMPLEX_TYPE)
2558 warning (0, "passing argument %d of %qE as integer "
2559 "rather than complex due to prototype",
2561 else if (TREE_CODE (type) == COMPLEX_TYPE
2562 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
2563 warning (0, "passing argument %d of %qE as complex "
2564 "rather than floating due to prototype",
2566 else if (TREE_CODE (type) == REAL_TYPE
2567 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
2568 warning (0, "passing argument %d of %qE as floating "
2569 "rather than integer due to prototype",
2571 else if (TREE_CODE (type) == COMPLEX_TYPE
2572 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
2573 warning (0, "passing argument %d of %qE as complex "
2574 "rather than integer due to prototype",
2576 else if (TREE_CODE (type) == REAL_TYPE
2577 && TREE_CODE (TREE_TYPE (val)) == COMPLEX_TYPE)
2578 warning (0, "passing argument %d of %qE as floating "
2579 "rather than complex due to prototype",
2581 /* ??? At some point, messages should be written about
2582 conversions between complex types, but that's too messy
2584 else if (TREE_CODE (type) == REAL_TYPE
2585 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
2587 /* Warn if any argument is passed as `float',
2588 since without a prototype it would be `double'. */
2589 if (formal_prec == TYPE_PRECISION (float_type_node)
2590 && type != dfloat32_type_node)
2591 warning (0, "passing argument %d of %qE as %<float%> "
2592 "rather than %<double%> due to prototype",
2595 /* Warn if mismatch between argument and prototype
2596 for decimal float types. Warn of conversions with
2597 binary float types and of precision narrowing due to
2599 else if (type != TREE_TYPE (val)
2600 && (type == dfloat32_type_node
2601 || type == dfloat64_type_node
2602 || type == dfloat128_type_node
2603 || TREE_TYPE (val) == dfloat32_type_node
2604 || TREE_TYPE (val) == dfloat64_type_node
2605 || TREE_TYPE (val) == dfloat128_type_node)
2607 <= TYPE_PRECISION (TREE_TYPE (val))
2608 || (type == dfloat128_type_node
2610 != dfloat64_type_node
2612 != dfloat32_type_node)))
2613 || (type == dfloat64_type_node
2615 != dfloat32_type_node))))
2616 warning (0, "passing argument %d of %qE as %qT "
2617 "rather than %qT due to prototype",
2618 argnum, rname, type, TREE_TYPE (val));
2621 /* Detect integer changing in width or signedness.
2622 These warnings are only activated with
2623 -Wtraditional-conversion, not with -Wtraditional. */
2624 else if (warn_traditional_conversion && INTEGRAL_TYPE_P (type)
2625 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
2627 tree would_have_been = default_conversion (val);
2628 tree type1 = TREE_TYPE (would_have_been);
2630 if (TREE_CODE (type) == ENUMERAL_TYPE
2631 && (TYPE_MAIN_VARIANT (type)
2632 == TYPE_MAIN_VARIANT (TREE_TYPE (val))))
2633 /* No warning if function asks for enum
2634 and the actual arg is that enum type. */
2636 else if (formal_prec != TYPE_PRECISION (type1))
2637 warning (OPT_Wtraditional_conversion, "passing argument %d of %qE "
2638 "with different width due to prototype",
2640 else if (TYPE_UNSIGNED (type) == TYPE_UNSIGNED (type1))
2642 /* Don't complain if the formal parameter type
2643 is an enum, because we can't tell now whether
2644 the value was an enum--even the same enum. */
2645 else if (TREE_CODE (type) == ENUMERAL_TYPE)
2647 else if (TREE_CODE (val) == INTEGER_CST
2648 && int_fits_type_p (val, type))
2649 /* Change in signedness doesn't matter
2650 if a constant value is unaffected. */
2652 /* If the value is extended from a narrower
2653 unsigned type, it doesn't matter whether we
2654 pass it as signed or unsigned; the value
2655 certainly is the same either way. */
2656 else if (TYPE_PRECISION (TREE_TYPE (val)) < TYPE_PRECISION (type)
2657 && TYPE_UNSIGNED (TREE_TYPE (val)))
2659 else if (TYPE_UNSIGNED (type))
2660 warning (OPT_Wtraditional_conversion, "passing argument %d of %qE "
2661 "as unsigned due to prototype",
2664 warning (OPT_Wtraditional_conversion, "passing argument %d of %qE "
2665 "as signed due to prototype", argnum, rname);
2669 parmval = convert_for_assignment (type, val, ic_argpass,
2673 if (targetm.calls.promote_prototypes (fundecl ? TREE_TYPE (fundecl) : 0)
2674 && INTEGRAL_TYPE_P (type)
2675 && (TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node)))
2676 parmval = default_conversion (parmval);
2678 argarray[parmnum] = parmval;
2680 else if (TREE_CODE (TREE_TYPE (val)) == REAL_TYPE
2681 && (TYPE_PRECISION (TREE_TYPE (val))
2682 < TYPE_PRECISION (double_type_node))
2683 && !DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (val))))
2686 argarray[parmnum] = val;
2688 /* Convert `float' to `double'. */
2689 argarray[parmnum] = convert (double_type_node, val);
2691 else if ((invalid_func_diag =
2692 targetm.calls.invalid_arg_for_unprototyped_fn (typelist, fundecl, val)))
2694 error (invalid_func_diag);
2698 /* Convert `short' and `char' to full-size `int'. */
2699 argarray[parmnum] = default_conversion (val);
2702 typetail = TREE_CHAIN (typetail);
2705 gcc_assert (parmnum == nargs);
2707 if (typetail != 0 && TREE_VALUE (typetail) != void_type_node)
2709 error ("too few arguments to function %qE", function);
2716 /* This is the entry point used by the parser to build unary operators
2717 in the input. CODE, a tree_code, specifies the unary operator, and
2718 ARG is the operand. For unary plus, the C parser currently uses
2719 CONVERT_EXPR for code. */
2722 parser_build_unary_op (enum tree_code code, struct c_expr arg)
2724 struct c_expr result;
2726 result.original_code = ERROR_MARK;
2727 result.value = build_unary_op (code, arg.value, 0);
2729 if (TREE_OVERFLOW_P (result.value) && !TREE_OVERFLOW_P (arg.value))
2730 overflow_warning (result.value);
2735 /* This is the entry point used by the parser to build binary operators
2736 in the input. CODE, a tree_code, specifies the binary operator, and
2737 ARG1 and ARG2 are the operands. In addition to constructing the
2738 expression, we check for operands that were written with other binary
2739 operators in a way that is likely to confuse the user. */
2742 parser_build_binary_op (enum tree_code code, struct c_expr arg1,
2745 struct c_expr result;
2747 enum tree_code code1 = arg1.original_code;
2748 enum tree_code code2 = arg2.original_code;
2750 result.value = build_binary_op (code, arg1.value, arg2.value, 1);
2751 result.original_code = code;
2753 if (TREE_CODE (result.value) == ERROR_MARK)
2756 /* Check for cases such as x+y<<z which users are likely
2758 if (warn_parentheses)
2759 warn_about_parentheses (code, code1, code2);
2761 if (code1 != tcc_comparison)
2762 warn_logical_operator (code, arg1.value, arg2.value);
2764 /* Warn about comparisons against string literals, with the exception
2765 of testing for equality or inequality of a string literal with NULL. */
2766 if (code == EQ_EXPR || code == NE_EXPR)
2768 if ((code1 == STRING_CST && !integer_zerop (arg2.value))
2769 || (code2 == STRING_CST && !integer_zerop (arg1.value)))
2770 warning (OPT_Waddress, "comparison with string literal results in unspecified behavior");
2772 else if (TREE_CODE_CLASS (code) == tcc_comparison
2773 && (code1 == STRING_CST || code2 == STRING_CST))
2774 warning (OPT_Waddress, "comparison with string literal results in unspecified behavior");
2776 if (TREE_OVERFLOW_P (result.value)
2777 && !TREE_OVERFLOW_P (arg1.value)
2778 && !TREE_OVERFLOW_P (arg2.value))
2779 overflow_warning (result.value);
2784 /* Return a tree for the difference of pointers OP0 and OP1.
2785 The resulting tree has type int. */
2788 pointer_diff (tree op0, tree op1)
2790 tree restype = ptrdiff_type_node;
2792 tree target_type = TREE_TYPE (TREE_TYPE (op0));
2793 tree con0, con1, lit0, lit1;
2794 tree orig_op1 = op1;
2796 if (pedantic || warn_pointer_arith)
2798 if (TREE_CODE (target_type) == VOID_TYPE)
2799 pedwarn ("pointer of type %<void *%> used in subtraction");
2800 if (TREE_CODE (target_type) == FUNCTION_TYPE)
2801 pedwarn ("pointer to a function used in subtraction");
2804 /* If the conversion to ptrdiff_type does anything like widening or
2805 converting a partial to an integral mode, we get a convert_expression
2806 that is in the way to do any simplifications.
2807 (fold-const.c doesn't know that the extra bits won't be needed.
2808 split_tree uses STRIP_SIGN_NOPS, which leaves conversions to a
2809 different mode in place.)
2810 So first try to find a common term here 'by hand'; we want to cover
2811 at least the cases that occur in legal static initializers. */
2812 if ((TREE_CODE (op0) == NOP_EXPR || TREE_CODE (op0) == CONVERT_EXPR)
2813 && (TYPE_PRECISION (TREE_TYPE (op0))
2814 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op0, 0)))))
2815 con0 = TREE_OPERAND (op0, 0);
2818 if ((TREE_CODE (op1) == NOP_EXPR || TREE_CODE (op1) == CONVERT_EXPR)
2819 && (TYPE_PRECISION (TREE_TYPE (op1))
2820 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op1, 0)))))
2821 con1 = TREE_OPERAND (op1, 0);
2825 if (TREE_CODE (con0) == PLUS_EXPR)
2827 lit0 = TREE_OPERAND (con0, 1);
2828 con0 = TREE_OPERAND (con0, 0);
2831 lit0 = integer_zero_node;
2833 if (TREE_CODE (con1) == PLUS_EXPR)
2835 lit1 = TREE_OPERAND (con1, 1);
2836 con1 = TREE_OPERAND (con1, 0);
2839 lit1 = integer_zero_node;
2841 if (operand_equal_p (con0, con1, 0))
2848 /* First do the subtraction as integers;
2849 then drop through to build the divide operator.
2850 Do not do default conversions on the minus operator
2851 in case restype is a short type. */
2853 op0 = build_binary_op (MINUS_EXPR, convert (restype, op0),
2854 convert (restype, op1), 0);
2855 /* This generates an error if op1 is pointer to incomplete type. */
2856 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (TREE_TYPE (orig_op1))))
2857 error ("arithmetic on pointer to an incomplete type");
2859 /* This generates an error if op0 is pointer to incomplete type. */
2860 op1 = c_size_in_bytes (target_type);
2862 /* Divide by the size, in easiest possible way. */
2863 return fold_build2 (EXACT_DIV_EXPR, restype, op0, convert (restype, op1));
2866 /* Construct and perhaps optimize a tree representation
2867 for a unary operation. CODE, a tree_code, specifies the operation
2868 and XARG is the operand.
2869 For any CODE other than ADDR_EXPR, FLAG nonzero suppresses
2870 the default promotions (such as from short to int).
2871 For ADDR_EXPR, the default promotions are not applied; FLAG nonzero
2872 allows non-lvalues; this is only used to handle conversion of non-lvalue
2873 arrays to pointers in C99. */
2876 build_unary_op (enum tree_code code, tree xarg, int flag)
2878 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
2881 enum tree_code typecode;
2883 int noconvert = flag;
2884 const char *invalid_op_diag;
2886 if (code != ADDR_EXPR)
2887 arg = require_complete_type (arg);
2889 typecode = TREE_CODE (TREE_TYPE (arg));
2890 if (typecode == ERROR_MARK)
2891 return error_mark_node;
2892 if (typecode == ENUMERAL_TYPE || typecode == BOOLEAN_TYPE)
2893 typecode = INTEGER_TYPE;
2895 if ((invalid_op_diag
2896 = targetm.invalid_unary_op (code, TREE_TYPE (xarg))))
2898 error (invalid_op_diag);
2899 return error_mark_node;
2905 /* This is used for unary plus, because a CONVERT_EXPR
2906 is enough to prevent anybody from looking inside for
2907 associativity, but won't generate any code. */
2908 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2909 || typecode == FIXED_POINT_TYPE || typecode == COMPLEX_TYPE
2910 || typecode == VECTOR_TYPE))
2912 error ("wrong type argument to unary plus");
2913 return error_mark_node;
2915 else if (!noconvert)
2916 arg = default_conversion (arg);
2917 arg = non_lvalue (arg);
2921 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2922 || typecode == FIXED_POINT_TYPE || typecode == COMPLEX_TYPE
2923 || typecode == VECTOR_TYPE))
2925 error ("wrong type argument to unary minus");
2926 return error_mark_node;
2928 else if (!noconvert)
2929 arg = default_conversion (arg);
2933 /* ~ works on integer types and non float vectors. */
2934 if (typecode == INTEGER_TYPE
2935 || (typecode == VECTOR_TYPE
2936 && !VECTOR_FLOAT_TYPE_P (TREE_TYPE (arg))))
2939 arg = default_conversion (arg);
2941 else if (typecode == COMPLEX_TYPE)
2945 pedwarn ("ISO C does not support %<~%> for complex conjugation");
2947 arg = default_conversion (arg);
2951 error ("wrong type argument to bit-complement");
2952 return error_mark_node;
2957 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE))
2959 error ("wrong type argument to abs");
2960 return error_mark_node;
2962 else if (!noconvert)
2963 arg = default_conversion (arg);
2967 /* Conjugating a real value is a no-op, but allow it anyway. */
2968 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2969 || typecode == COMPLEX_TYPE))
2971 error ("wrong type argument to conjugation");
2972 return error_mark_node;
2974 else if (!noconvert)
2975 arg = default_conversion (arg);
2978 case TRUTH_NOT_EXPR:
2979 if (typecode != INTEGER_TYPE && typecode != FIXED_POINT_TYPE
2980 && typecode != REAL_TYPE && typecode != POINTER_TYPE
2981 && typecode != COMPLEX_TYPE)
2983 error ("wrong type argument to unary exclamation mark");
2984 return error_mark_node;
2986 arg = c_objc_common_truthvalue_conversion (arg);
2987 return invert_truthvalue (arg);
2990 if (TREE_CODE (arg) == COMPLEX_CST)
2991 return TREE_REALPART (arg);
2992 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
2993 return fold_build1 (REALPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg);
2998 if (TREE_CODE (arg) == COMPLEX_CST)
2999 return TREE_IMAGPART (arg);
3000 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
3001 return fold_build1 (IMAGPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg);
3003 return convert (TREE_TYPE (arg), integer_zero_node);
3005 case PREINCREMENT_EXPR:
3006 case POSTINCREMENT_EXPR:
3007 case PREDECREMENT_EXPR:
3008 case POSTDECREMENT_EXPR:
3010 /* Increment or decrement the real part of the value,
3011 and don't change the imaginary part. */
3012 if (typecode == COMPLEX_TYPE)
3017 pedwarn ("ISO C does not support %<++%> and %<--%>"
3018 " on complex types");
3020 arg = stabilize_reference (arg);
3021 real = build_unary_op (REALPART_EXPR, arg, 1);
3022 imag = build_unary_op (IMAGPART_EXPR, arg, 1);
3023 real = build_unary_op (code, real, 1);
3024 if (real == error_mark_node || imag == error_mark_node)
3025 return error_mark_node;
3026 return build2 (COMPLEX_EXPR, TREE_TYPE (arg),
3030 /* Report invalid types. */
3032 if (typecode != POINTER_TYPE && typecode != FIXED_POINT_TYPE
3033 && typecode != INTEGER_TYPE && typecode != REAL_TYPE)
3035 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
3036 error ("wrong type argument to increment");
3038 error ("wrong type argument to decrement");
3040 return error_mark_node;
3045 tree result_type = TREE_TYPE (arg);
3047 arg = get_unwidened (arg, 0);
3048 argtype = TREE_TYPE (arg);
3050 /* Compute the increment. */
3052 if (typecode == POINTER_TYPE)
3054 /* If pointer target is an undefined struct,
3055 we just cannot know how to do the arithmetic. */
3056 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (result_type)))
3058 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
3059 error ("increment of pointer to unknown structure");
3061 error ("decrement of pointer to unknown structure");
3063 else if ((pedantic || warn_pointer_arith)
3064 && (TREE_CODE (TREE_TYPE (result_type)) == FUNCTION_TYPE
3065 || TREE_CODE (TREE_TYPE (result_type)) == VOID_TYPE))
3067 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
3068 pedwarn ("wrong type argument to increment");
3070 pedwarn ("wrong type argument to decrement");
3073 inc = c_size_in_bytes (TREE_TYPE (result_type));
3074 inc = fold_convert (sizetype, inc);
3076 else if (FRACT_MODE_P (TYPE_MODE (result_type)))
3078 /* For signed fract types, we invert ++ to -- or
3079 -- to ++, and change inc from 1 to -1, because
3080 it is not possible to represent 1 in signed fract constants.
3081 For unsigned fract types, the result always overflows and
3082 we get an undefined (original) or the maximum value. */
3083 if (code == PREINCREMENT_EXPR)
3084 code = PREDECREMENT_EXPR;
3085 else if (code == PREDECREMENT_EXPR)
3086 code = PREINCREMENT_EXPR;
3087 else if (code == POSTINCREMENT_EXPR)
3088 code = POSTDECREMENT_EXPR;
3089 else /* code == POSTDECREMENT_EXPR */
3090 code = POSTINCREMENT_EXPR;
3092 inc = integer_minus_one_node;
3093 inc = convert (argtype, inc);
3097 inc = integer_one_node;
3098 inc = convert (argtype, inc);
3101 /* Complain about anything else that is not a true lvalue. */
3102 if (!lvalue_or_else (arg, ((code == PREINCREMENT_EXPR
3103 || code == POSTINCREMENT_EXPR)
3106 return error_mark_node;
3108 /* Report a read-only lvalue. */
3109 if (TREE_READONLY (arg))
3111 readonly_error (arg,
3112 ((code == PREINCREMENT_EXPR
3113 || code == POSTINCREMENT_EXPR)
3114 ? lv_increment : lv_decrement));
3115 return error_mark_node;
3118 if (TREE_CODE (TREE_TYPE (arg)) == BOOLEAN_TYPE)
3119 val = boolean_increment (code, arg);
3121 val = build2 (code, TREE_TYPE (arg), arg, inc);
3122 TREE_SIDE_EFFECTS (val) = 1;
3123 val = convert (result_type, val);
3124 if (TREE_CODE (val) != code)
3125 TREE_NO_WARNING (val) = 1;
3130 /* Note that this operation never does default_conversion. */
3132 /* Let &* cancel out to simplify resulting code. */
3133 if (TREE_CODE (arg) == INDIRECT_REF)
3135 /* Don't let this be an lvalue. */
3136 if (lvalue_p (TREE_OPERAND (arg, 0)))
3137 return non_lvalue (TREE_OPERAND (arg, 0));
3138 return TREE_OPERAND (arg, 0);
3141 /* For &x[y], return x+y */
3142 if (TREE_CODE (arg) == ARRAY_REF)
3144 tree op0 = TREE_OPERAND (arg, 0);
3145 if (!c_mark_addressable (op0))
3146 return error_mark_node;
3147 return build_binary_op (PLUS_EXPR,
3148 (TREE_CODE (TREE_TYPE (op0)) == ARRAY_TYPE
3149 ? array_to_pointer_conversion (op0)
3151 TREE_OPERAND (arg, 1), 1);
3154 /* Anything not already handled and not a true memory reference
3155 or a non-lvalue array is an error. */
3156 else if (typecode != FUNCTION_TYPE && !flag
3157 && !lvalue_or_else (arg, lv_addressof))
3158 return error_mark_node;
3160 /* Ordinary case; arg is a COMPONENT_REF or a decl. */
3161 argtype = TREE_TYPE (arg);
3163 /* If the lvalue is const or volatile, merge that into the type
3164 to which the address will point. Note that you can't get a
3165 restricted pointer by taking the address of something, so we
3166 only have to deal with `const' and `volatile' here. */
3167 if ((DECL_P (arg) || REFERENCE_CLASS_P (arg))
3168 && (TREE_READONLY (arg) || TREE_THIS_VOLATILE (arg)))
3169 argtype = c_build_type_variant (argtype,
3170 TREE_READONLY (arg),
3171 TREE_THIS_VOLATILE (arg));
3173 if (!c_mark_addressable (arg))
3174 return error_mark_node;
3176 gcc_assert (TREE_CODE (arg) != COMPONENT_REF
3177 || !DECL_C_BIT_FIELD (TREE_OPERAND (arg, 1)));
3179 argtype = build_pointer_type (argtype);
3181 /* ??? Cope with user tricks that amount to offsetof. Delete this
3182 when we have proper support for integer constant expressions. */
3183 val = get_base_address (arg);
3184 if (val && TREE_CODE (val) == INDIRECT_REF
3185 && TREE_CONSTANT (TREE_OPERAND (val, 0)))
3187 tree op0 = fold_convert (sizetype, fold_offsetof (arg, val)), op1;
3189 op1 = fold_convert (argtype, TREE_OPERAND (val, 0));
3190 return fold_build2 (POINTER_PLUS_EXPR, argtype, op1, op0);
3193 val = build1 (ADDR_EXPR, argtype, arg);
3202 argtype = TREE_TYPE (arg);
3203 return require_constant_value ? fold_build1_initializer (code, argtype, arg)
3204 : fold_build1 (code, argtype, arg);
3207 /* Return nonzero if REF is an lvalue valid for this language.
3208 Lvalues can be assigned, unless their type has TYPE_READONLY.
3209 Lvalues can have their address taken, unless they have C_DECL_REGISTER. */
3212 lvalue_p (const_tree ref)
3214 const enum tree_code code = TREE_CODE (ref);
3221 return lvalue_p (TREE_OPERAND (ref, 0));
3223 case COMPOUND_LITERAL_EXPR:
3233 return (TREE_CODE (TREE_TYPE (ref)) != FUNCTION_TYPE
3234 && TREE_CODE (TREE_TYPE (ref)) != METHOD_TYPE);
3237 return TREE_CODE (TREE_TYPE (ref)) == ARRAY_TYPE;
3244 /* Give an error for storing in something that is 'const'. */
3247 readonly_error (tree arg, enum lvalue_use use)
3249 gcc_assert (use == lv_assign || use == lv_increment || use == lv_decrement
3251 /* Using this macro rather than (for example) arrays of messages
3252 ensures that all the format strings are checked at compile
3254 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
3255 : (use == lv_increment ? (I) \
3256 : (use == lv_decrement ? (D) : (AS))))
3257 if (TREE_CODE (arg) == COMPONENT_REF)
3259 if (TYPE_READONLY (TREE_TYPE (TREE_OPERAND (arg, 0))))
3260 readonly_error (TREE_OPERAND (arg, 0), use);
3262 error (READONLY_MSG (G_("assignment of read-only member %qD"),
3263 G_("increment of read-only member %qD"),
3264 G_("decrement of read-only member %qD"),
3265 G_("read-only member %qD used as %<asm%> output")),
3266 TREE_OPERAND (arg, 1));
3268 else if (TREE_CODE (arg) == VAR_DECL)
3269 error (READONLY_MSG (G_("assignment of read-only variable %qD"),
3270 G_("increment of read-only variable %qD"),
3271 G_("decrement of read-only variable %qD"),
3272 G_("read-only variable %qD used as %<asm%> output")),
3275 error (READONLY_MSG (G_("assignment of read-only location %qE"),
3276 G_("increment of read-only location %qE"),
3277 G_("decrement of read-only location %qE"),
3278 G_("read-only location %qE used as %<asm%> output")),
3283 /* Return nonzero if REF is an lvalue valid for this language;
3284 otherwise, print an error message and return zero. USE says
3285 how the lvalue is being used and so selects the error message. */
3288 lvalue_or_else (const_tree ref, enum lvalue_use use)
3290 int win = lvalue_p (ref);
3298 /* Mark EXP saying that we need to be able to take the
3299 address of it; it should not be allocated in a register.
3300 Returns true if successful. */
3303 c_mark_addressable (tree exp)
3308 switch (TREE_CODE (x))
3311 if (DECL_C_BIT_FIELD (TREE_OPERAND (x, 1)))
3314 ("cannot take address of bit-field %qD", TREE_OPERAND (x, 1));
3318 /* ... fall through ... */
3324 x = TREE_OPERAND (x, 0);
3327 case COMPOUND_LITERAL_EXPR:
3329 TREE_ADDRESSABLE (x) = 1;
3336 if (C_DECL_REGISTER (x)
3337 && DECL_NONLOCAL (x))
3339 if (TREE_PUBLIC (x) || TREE_STATIC (x) || DECL_EXTERNAL (x))
3342 ("global register variable %qD used in nested function", x);
3345 pedwarn ("register variable %qD used in nested function", x);
3347 else if (C_DECL_REGISTER (x))
3349 if (TREE_PUBLIC (x) || TREE_STATIC (x) || DECL_EXTERNAL (x))
3350 error ("address of global register variable %qD requested", x);
3352 error ("address of register variable %qD requested", x);
3358 TREE_ADDRESSABLE (x) = 1;
3365 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
3368 build_conditional_expr (tree ifexp, tree op1, tree op2)
3372 enum tree_code code1;
3373 enum tree_code code2;
3374 tree result_type = NULL;
3375 tree orig_op1 = op1, orig_op2 = op2;
3377 /* Promote both alternatives. */
3379 if (TREE_CODE (TREE_TYPE (op1)) != VOID_TYPE)
3380 op1 = default_conversion (op1);
3381 if (TREE_CODE (TREE_TYPE (op2)) != VOID_TYPE)
3382 op2 = default_conversion (op2);
3384 if (TREE_CODE (ifexp) == ERROR_MARK
3385 || TREE_CODE (TREE_TYPE (op1)) == ERROR_MARK
3386 || TREE_CODE (TREE_TYPE (op2)) == ERROR_MARK)
3387 return error_mark_node;
3389 type1 = TREE_TYPE (op1);
3390 code1 = TREE_CODE (type1);
3391 type2 = TREE_TYPE (op2);
3392 code2 = TREE_CODE (type2);
3394 /* C90 does not permit non-lvalue arrays in conditional expressions.
3395 In C99 they will be pointers by now. */
3396 if (code1 == ARRAY_TYPE || code2 == ARRAY_TYPE)
3398 error ("non-lvalue array in conditional expression");
3399 return error_mark_node;
3402 /* Quickly detect the usual case where op1 and op2 have the same type
3404 if (TYPE_MAIN_VARIANT (type1) == TYPE_MAIN_VARIANT (type2))
3407 result_type = type1;
3409 result_type = TYPE_MAIN_VARIANT (type1);
3411 else if ((code1 == INTEGER_TYPE || code1 == REAL_TYPE
3412 || code1 == COMPLEX_TYPE)
3413 && (code2 == INTEGER_TYPE || code2 == REAL_TYPE
3414 || code2 == COMPLEX_TYPE))
3416 result_type = c_common_type (type1, type2);
3418 /* If -Wsign-compare, warn here if type1 and type2 have
3419 different signedness. We'll promote the signed to unsigned
3420 and later code won't know it used to be different.
3421 Do this check on the original types, so that explicit casts
3422 will be considered, but default promotions won't. */
3423 if (warn_sign_compare && !skip_evaluation)
3425 int unsigned_op1 = TYPE_UNSIGNED (TREE_TYPE (orig_op1));
3426 int unsigned_op2 = TYPE_UNSIGNED (TREE_TYPE (orig_op2));
3428 if (unsigned_op1 ^ unsigned_op2)
3432 /* Do not warn if the result type is signed, since the
3433 signed type will only be chosen if it can represent
3434 all the values of the unsigned type. */
3435 if (!TYPE_UNSIGNED (result_type))
3437 /* Do not warn if the signed quantity is an unsuffixed
3438 integer literal (or some static constant expression
3439 involving such literals) and it is non-negative. */
3440 else if ((unsigned_op2
3441 && tree_expr_nonnegative_warnv_p (op1, &ovf))
3443 && tree_expr_nonnegative_warnv_p (op2, &ovf)))
3446 warning (OPT_Wsign_compare, "signed and unsigned type in conditional expression");
3450 else if (code1 == VOID_TYPE || code2 == VOID_TYPE)
3452 if (pedantic && (code1 != VOID_TYPE || code2 != VOID_TYPE))
3453 pedwarn ("ISO C forbids conditional expr with only one void side");
3454 result_type = void_type_node;
3456 else if (code1 == POINTER_TYPE && code2 == POINTER_TYPE)
3458 if (comp_target_types (type1, type2))
3459 result_type = common_pointer_type (type1, type2);
3460 else if (null_pointer_constant_p (orig_op1))
3461 result_type = qualify_type (type2, type1);
3462 else if (null_pointer_constant_p (orig_op2))
3463 result_type = qualify_type (type1, type2);
3464 else if (VOID_TYPE_P (TREE_TYPE (type1)))
3466 if (pedantic && TREE_CODE (TREE_TYPE (type2)) == FUNCTION_TYPE)
3467 pedwarn ("ISO C forbids conditional expr between "
3468 "%<void *%> and function pointer");
3469 result_type = build_pointer_type (qualify_type (TREE_TYPE (type1),
3470 TREE_TYPE (type2)));
3472 else if (VOID_TYPE_P (TREE_TYPE (type2)))
3474 if (pedantic && TREE_CODE (TREE_TYPE (type1)) == FUNCTION_TYPE)
3475 pedwarn ("ISO C forbids conditional expr between "
3476 "%<void *%> and function pointer");
3477 result_type = build_pointer_type (qualify_type (TREE_TYPE (type2),
3478 TREE_TYPE (type1)));
3482 pedwarn ("pointer type mismatch in conditional expression");
3483 result_type = build_pointer_type (void_type_node);
3486 else if (code1 == POINTER_TYPE && code2 == INTEGER_TYPE)
3488 if (!null_pointer_constant_p (orig_op2))
3489 pedwarn ("pointer/integer type mismatch in conditional expression");
3492 op2 = null_pointer_node;
3494 result_type = type1;
3496 else if (code2 == POINTER_TYPE && code1 == INTEGER_TYPE)
3498 if (!null_pointer_constant_p (orig_op1))
3499 pedwarn ("pointer/integer type mismatch in conditional expression");
3502 op1 = null_pointer_node;
3504 result_type = type2;
3509 if (flag_cond_mismatch)
3510 result_type = void_type_node;
3513 error ("type mismatch in conditional expression");
3514 return error_mark_node;
3518 /* Merge const and volatile flags of the incoming types. */
3520 = build_type_variant (result_type,
3521 TREE_READONLY (op1) || TREE_READONLY (op2),
3522 TREE_THIS_VOLATILE (op1) || TREE_THIS_VOLATILE (op2));
3524 if (result_type != TREE_TYPE (op1))
3525 op1 = convert_and_check (result_type, op1);
3526 if (result_type != TREE_TYPE (op2))
3527 op2 = convert_and_check (result_type, op2);
3529 return fold_build3 (COND_EXPR, result_type, ifexp, op1, op2);
3532 /* Return a compound expression that performs two expressions and
3533 returns the value of the second of them. */
3536 build_compound_expr (tree expr1, tree expr2)
3538 if (!TREE_SIDE_EFFECTS (expr1))
3540 /* The left-hand operand of a comma expression is like an expression
3541 statement: with -Wunused, we should warn if it doesn't have
3542 any side-effects, unless it was explicitly cast to (void). */
3543 if (warn_unused_value)
3545 if (VOID_TYPE_P (TREE_TYPE (expr1))
3546 && (TREE_CODE (expr1) == NOP_EXPR
3547 || TREE_CODE (expr1) == CONVERT_EXPR))
3549 else if (VOID_TYPE_P (TREE_TYPE (expr1))
3550 && TREE_CODE (expr1) == COMPOUND_EXPR
3551 && (TREE_CODE (TREE_OPERAND (expr1, 1)) == CONVERT_EXPR
3552 || TREE_CODE (TREE_OPERAND (expr1, 1)) == NOP_EXPR))
3553 ; /* (void) a, (void) b, c */
3555 warning (OPT_Wunused_value,
3556 "left-hand operand of comma expression has no effect");
3560 /* With -Wunused, we should also warn if the left-hand operand does have
3561 side-effects, but computes a value which is not used. For example, in
3562 `foo() + bar(), baz()' the result of the `+' operator is not used,
3563 so we should issue a warning. */
3564 else if (warn_unused_value)
3565 warn_if_unused_value (expr1, input_location);
3567 if (expr2 == error_mark_node)
3568 return error_mark_node;
3570 return build2 (COMPOUND_EXPR, TREE_TYPE (expr2), expr1, expr2);
3573 /* Build an expression representing a cast to type TYPE of expression EXPR. */
3576 build_c_cast (tree type, tree expr)
3580 if (type == error_mark_node || expr == error_mark_node)
3581 return error_mark_node;
3583 /* The ObjC front-end uses TYPE_MAIN_VARIANT to tie together types differing
3584 only in <protocol> qualifications. But when constructing cast expressions,
3585 the protocols do matter and must be kept around. */
3586 if (objc_is_object_ptr (type) && objc_is_object_ptr (TREE_TYPE (expr)))
3587 return build1 (NOP_EXPR, type, expr);
3589 type = TYPE_MAIN_VARIANT (type);
3591 if (TREE_CODE (type) == ARRAY_TYPE)
3593 error ("cast specifies array type");
3594 return error_mark_node;
3597 if (TREE_CODE (type) == FUNCTION_TYPE)
3599 error ("cast specifies function type");
3600 return error_mark_node;
3603 if (!VOID_TYPE_P (type))
3605 value = require_complete_type (value);
3606 if (value == error_mark_node)
3607 return error_mark_node;
3610 if (type == TYPE_MAIN_VARIANT (TREE_TYPE (value)))
3614 if (TREE_CODE (type) == RECORD_TYPE
3615 || TREE_CODE (type) == UNION_TYPE)
3616 pedwarn ("ISO C forbids casting nonscalar to the same type");
3619 else if (TREE_CODE (type) == UNION_TYPE)
3623 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
3624 if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (field)),
3625 TYPE_MAIN_VARIANT (TREE_TYPE (value))))
3633 pedwarn ("ISO C forbids casts to union type");
3634 t = digest_init (type,
3635 build_constructor_single (type, field, value),
3637 TREE_CONSTANT (t) = TREE_CONSTANT (value);
3638 TREE_INVARIANT (t) = TREE_INVARIANT (value);
3641 error ("cast to union type from type not present in union");
3642 return error_mark_node;
3648 if (type == void_type_node)
3649 return build1 (CONVERT_EXPR, type, value);
3651 otype = TREE_TYPE (value);
3653 /* Optionally warn about potentially worrisome casts. */
3656 && TREE_CODE (type) == POINTER_TYPE
3657 && TREE_CODE (otype) == POINTER_TYPE)
3659 tree in_type = type;
3660 tree in_otype = otype;
3664 /* Check that the qualifiers on IN_TYPE are a superset of
3665 the qualifiers of IN_OTYPE. The outermost level of
3666 POINTER_TYPE nodes is uninteresting and we stop as soon
3667 as we hit a non-POINTER_TYPE node on either type. */
3670 in_otype = TREE_TYPE (in_otype);
3671 in_type = TREE_TYPE (in_type);
3673 /* GNU C allows cv-qualified function types. 'const'
3674 means the function is very pure, 'volatile' means it
3675 can't return. We need to warn when such qualifiers
3676 are added, not when they're taken away. */
3677 if (TREE_CODE (in_otype) == FUNCTION_TYPE
3678 && TREE_CODE (in_type) == FUNCTION_TYPE)
3679 added |= (TYPE_QUALS (in_type) & ~TYPE_QUALS (in_otype));
3681 discarded |= (TYPE_QUALS (in_otype) & ~TYPE_QUALS (in_type));
3683 while (TREE_CODE (in_type) == POINTER_TYPE
3684 && TREE_CODE (in_otype) == POINTER_TYPE);
3687 warning (OPT_Wcast_qual, "cast adds new qualifiers to function type");
3690 /* There are qualifiers present in IN_OTYPE that are not
3691 present in IN_TYPE. */
3692 warning (OPT_Wcast_qual, "cast discards qualifiers from pointer target type");
3695 /* Warn about possible alignment problems. */
3696 if (STRICT_ALIGNMENT
3697 && TREE_CODE (type) == POINTER_TYPE
3698 && TREE_CODE (otype) == POINTER_TYPE
3699 && TREE_CODE (TREE_TYPE (otype)) != VOID_TYPE
3700 && TREE_CODE (TREE_TYPE (otype)) != FUNCTION_TYPE
3701 /* Don't warn about opaque types, where the actual alignment
3702 restriction is unknown. */
3703 && !((TREE_CODE (TREE_TYPE (otype)) == UNION_TYPE
3704 || TREE_CODE (TREE_TYPE (otype)) == RECORD_TYPE)
3705 && TYPE_MODE (TREE_TYPE (otype)) == VOIDmode)
3706 && TYPE_ALIGN (TREE_TYPE (type)) > TYPE_ALIGN (TREE_TYPE (otype)))
3707 warning (OPT_Wcast_align,
3708 "cast increases required alignment of target type");
3710 if (TREE_CODE (type) == INTEGER_TYPE
3711 && TREE_CODE (otype) == POINTER_TYPE
3712 && TYPE_PRECISION (type) != TYPE_PRECISION (otype))
3713 /* Unlike conversion of integers to pointers, where the
3714 warning is disabled for converting constants because
3715 of cases such as SIG_*, warn about converting constant
3716 pointers to integers. In some cases it may cause unwanted
3717 sign extension, and a warning is appropriate. */
3718 warning (OPT_Wpointer_to_int_cast,
3719 "cast from pointer to integer of different size");
3721 if (TREE_CODE (value) == CALL_EXPR
3722 && TREE_CODE (type) != TREE_CODE (otype))
3723 warning (OPT_Wbad_function_cast, "cast from function call of type %qT "
3724 "to non-matching type %qT", otype, type);
3726 if (TREE_CODE (type) == POINTER_TYPE
3727 && TREE_CODE (otype) == INTEGER_TYPE
3728 && TYPE_PRECISION (type) != TYPE_PRECISION (otype)
3729 /* Don't warn about converting any constant. */
3730 && !TREE_CONSTANT (value))
3731 warning (OPT_Wint_to_pointer_cast, "cast to pointer from integer "
3732 "of different size");
3734 if (warn_strict_aliasing <= 2)
3735 strict_aliasing_warning (otype, type, expr);
3737 /* If pedantic, warn for conversions between function and object
3738 pointer types, except for converting a null pointer constant
3739 to function pointer type. */
3741 && TREE_CODE (type) == POINTER_TYPE
3742 && TREE_CODE (otype) == POINTER_TYPE
3743 && TREE_CODE (TREE_TYPE (otype)) == FUNCTION_TYPE
3744 && TREE_CODE (TREE_TYPE (type)) != FUNCTION_TYPE)
3745 pedwarn ("ISO C forbids conversion of function pointer to object pointer type");
3748 && TREE_CODE (type) == POINTER_TYPE
3749 && TREE_CODE (otype) == POINTER_TYPE
3750 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE
3751 && TREE_CODE (TREE_TYPE (otype)) != FUNCTION_TYPE
3752 && !null_pointer_constant_p (value))
3753 pedwarn ("ISO C forbids conversion of object pointer to function pointer type");
3756 value = convert (type, value);
3758 /* Ignore any integer overflow caused by the cast. */
3759 if (TREE_CODE (value) == INTEGER_CST)
3761 if (CONSTANT_CLASS_P (ovalue) && TREE_OVERFLOW (ovalue))
3763 if (!TREE_OVERFLOW (value))
3765 /* Avoid clobbering a shared constant. */
3766 value = copy_node (value);
3767 TREE_OVERFLOW (value) = TREE_OVERFLOW (ovalue);
3770 else if (TREE_OVERFLOW (value))
3771 /* Reset VALUE's overflow flags, ensuring constant sharing. */
3772 value = build_int_cst_wide (TREE_TYPE (value),
3773 TREE_INT_CST_LOW (value),
3774 TREE_INT_CST_HIGH (value));
3778 /* Don't let a cast be an lvalue. */
3780 value = non_lvalue (value);
3785 /* Interpret a cast of expression EXPR to type TYPE. */
3787 c_cast_expr (struct c_type_name *type_name, tree expr)
3790 int saved_wsp = warn_strict_prototypes;
3792 /* This avoids warnings about unprototyped casts on
3793 integers. E.g. "#define SIG_DFL (void(*)())0". */
3794 if (TREE_CODE (expr) == INTEGER_CST)
3795 warn_strict_prototypes = 0;
3796 type = groktypename (type_name);
3797 warn_strict_prototypes = saved_wsp;
3799 return build_c_cast (type, expr);
3802 /* Build an assignment expression of lvalue LHS from value RHS.
3803 MODIFYCODE is the code for a binary operator that we use
3804 to combine the old value of LHS with RHS to get the new value.
3805 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment. */
3808 build_modify_expr (tree lhs, enum tree_code modifycode, tree rhs)
3812 tree lhstype = TREE_TYPE (lhs);
3813 tree olhstype = lhstype;
3815 /* Types that aren't fully specified cannot be used in assignments. */
3816 lhs = require_complete_type (lhs);
3818 /* Avoid duplicate error messages from operands that had errors. */
3819 if (TREE_CODE (lhs) == ERROR_MARK || TREE_CODE (rhs) == ERROR_MARK)
3820 return error_mark_node;
3822 if (!lvalue_or_else (lhs, lv_assign))
3823 return error_mark_node;
3825 STRIP_TYPE_NOPS (rhs);
3829 /* If a binary op has been requested, combine the old LHS value with the RHS
3830 producing the value we should actually store into the LHS. */
3832 if (modifycode != NOP_EXPR)
3834 lhs = stabilize_reference (lhs);
3835 newrhs = build_binary_op (modifycode, lhs, rhs, 1);
3838 /* Give an error for storing in something that is 'const'. */
3840 if (TREE_READONLY (lhs) || TYPE_READONLY (lhstype)
3841 || ((TREE_CODE (lhstype) == RECORD_TYPE
3842 || TREE_CODE (lhstype) == UNION_TYPE)
3843 && C_TYPE_FIELDS_READONLY (lhstype)))
3845 readonly_error (lhs, lv_assign);
3846 return error_mark_node;
3849 /* If storing into a structure or union member,
3850 it has probably been given type `int'.
3851 Compute the type that would go with
3852 the actual amount of storage the member occupies. */
3854 if (TREE_CODE (lhs) == COMPONENT_REF
3855 && (TREE_CODE (lhstype) == INTEGER_TYPE
3856 || TREE_CODE (lhstype) == BOOLEAN_TYPE
3857 || TREE_CODE (lhstype) == REAL_TYPE
3858 || TREE_CODE (lhstype) == ENUMERAL_TYPE))
3859 lhstype = TREE_TYPE (get_unwidened (lhs, 0));
3861 /* If storing in a field that is in actuality a short or narrower than one,
3862 we must store in the field in its actual type. */
3864 if (lhstype != TREE_TYPE (lhs))
3866 lhs = copy_node (lhs);
3867 TREE_TYPE (lhs) = lhstype;
3870 /* Convert new value to destination type. */
3872 newrhs = convert_for_assignment (lhstype, newrhs, ic_assign,
3873 NULL_TREE, NULL_TREE, 0);
3874 if (TREE_CODE (newrhs) == ERROR_MARK)
3875 return error_mark_node;
3877 /* Emit ObjC write barrier, if necessary. */
3878 if (c_dialect_objc () && flag_objc_gc)
3880 result = objc_generate_write_barrier (lhs, modifycode, newrhs);
3885 /* Scan operands. */
3887 result = build2 (MODIFY_EXPR, lhstype, lhs, newrhs);
3888 TREE_SIDE_EFFECTS (result) = 1;
3890 /* If we got the LHS in a different type for storing in,
3891 convert the result back to the nominal type of LHS
3892 so that the value we return always has the same type
3893 as the LHS argument. */
3895 if (olhstype == TREE_TYPE (result))
3897 return convert_for_assignment (olhstype, result, ic_assign,
3898 NULL_TREE, NULL_TREE, 0);
3901 /* Convert value RHS to type TYPE as preparation for an assignment
3902 to an lvalue of type TYPE.
3903 The real work of conversion is done by `convert'.
3904 The purpose of this function is to generate error messages
3905 for assignments that are not allowed in C.
3906 ERRTYPE says whether it is argument passing, assignment,
3907 initialization or return.
3909 FUNCTION is a tree for the function being called.
3910 PARMNUM is the number of the argument, for printing in error messages. */
3913 convert_for_assignment (tree type, tree rhs, enum impl_conv errtype,
3914 tree fundecl, tree function, int parmnum)
3916 enum tree_code codel = TREE_CODE (type);
3918 enum tree_code coder;
3919 tree rname = NULL_TREE;
3920 bool objc_ok = false;
3922 if (errtype == ic_argpass || errtype == ic_argpass_nonproto)
3925 /* Change pointer to function to the function itself for
3927 if (TREE_CODE (function) == ADDR_EXPR
3928 && TREE_CODE (TREE_OPERAND (function, 0)) == FUNCTION_DECL)
3929 function = TREE_OPERAND (function, 0);
3931 /* Handle an ObjC selector specially for diagnostics. */
3932 selector = objc_message_selector ();
3934 if (selector && parmnum > 2)
3941 /* This macro is used to emit diagnostics to ensure that all format
3942 strings are complete sentences, visible to gettext and checked at
3944 #define WARN_FOR_ASSIGNMENT(AR, AS, IN, RE) \
3949 pedwarn (AR, parmnum, rname); \
3951 case ic_argpass_nonproto: \
3952 warning (0, AR, parmnum, rname); \
3964 gcc_unreachable (); \
3968 STRIP_TYPE_NOPS (rhs);
3970 if (optimize && TREE_CODE (rhs) == VAR_DECL
3971 && TREE_CODE (TREE_TYPE (rhs)) != ARRAY_TYPE)
3972 rhs = decl_constant_value_for_broken_optimization (rhs);
3974 rhstype = TREE_TYPE (rhs);
3975 coder = TREE_CODE (rhstype);
3977 if (coder == ERROR_MARK)
3978 return error_mark_node;
3980 if (c_dialect_objc ())
4003 objc_ok = objc_compare_types (type, rhstype, parmno, rname);
4006 if (TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (rhstype))
4009 if (coder == VOID_TYPE)
4011 /* Except for passing an argument to an unprototyped function,
4012 this is a constraint violation. When passing an argument to
4013 an unprototyped function, it is compile-time undefined;
4014 making it a constraint in that case was rejected in
4016 error ("void value not ignored as it ought to be");
4017 return error_mark_node;
4019 rhs = require_complete_type (rhs);
4020 if (rhs == error_mark_node)
4021 return error_mark_node;
4022 /* A type converts to a reference to it.
4023 This code doesn't fully support references, it's just for the
4024 special case of va_start and va_copy. */
4025 if (codel == REFERENCE_TYPE
4026 && comptypes (TREE_TYPE (type), TREE_TYPE (rhs)) == 1)
4028 if (!lvalue_p (rhs))
4030 error ("cannot pass rvalue to reference parameter");
4031 return error_mark_node;
4033 if (!c_mark_addressable (rhs))
4034 return error_mark_node;
4035 rhs = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (rhs)), rhs);
4037 /* We already know that these two types are compatible, but they
4038 may not be exactly identical. In fact, `TREE_TYPE (type)' is
4039 likely to be __builtin_va_list and `TREE_TYPE (rhs)' is
4040 likely to be va_list, a typedef to __builtin_va_list, which
4041 is different enough that it will cause problems later. */
4042 if (TREE_TYPE (TREE_TYPE (rhs)) != TREE_TYPE (type))
4043 rhs = build1 (NOP_EXPR, build_pointer_type (TREE_TYPE (type)), rhs);
4045 rhs = build1 (NOP_EXPR, type, rhs);
4048 /* Some types can interconvert without explicit casts. */
4049 else if (codel == VECTOR_TYPE && coder == VECTOR_TYPE
4050 && vector_types_convertible_p (type, TREE_TYPE (rhs), true))
4051 return convert (type, rhs);
4052 /* Arithmetic types all interconvert, and enum is treated like int. */
4053 else if ((codel == INTEGER_TYPE || codel == REAL_TYPE
4054 || codel == FIXED_POINT_TYPE
4055 || codel == ENUMERAL_TYPE || codel == COMPLEX_TYPE
4056 || codel == BOOLEAN_TYPE)
4057 && (coder == INTEGER_TYPE || coder == REAL_TYPE
4058 || coder == FIXED_POINT_TYPE
4059 || coder == ENUMERAL_TYPE || coder == COMPLEX_TYPE
4060 || coder == BOOLEAN_TYPE))
4061 return convert_and_check (type, rhs);
4063 /* Aggregates in different TUs might need conversion. */
4064 if ((codel == RECORD_TYPE || codel == UNION_TYPE)
4066 && comptypes (type, rhstype))
4067 return convert_and_check (type, rhs);
4069 /* Conversion to a transparent union from its member types.
4070 This applies only to function arguments. */
4071 if (codel == UNION_TYPE && TYPE_TRANSPARENT_UNION (type)
4072 && (errtype == ic_argpass || errtype == ic_argpass_nonproto))
4074 tree memb, marginal_memb = NULL_TREE;
4076 for (memb = TYPE_FIELDS (type); memb ; memb = TREE_CHAIN (memb))
4078 tree memb_type = TREE_TYPE (memb);
4080 if (comptypes (TYPE_MAIN_VARIANT (memb_type),
4081 TYPE_MAIN_VARIANT (rhstype)))
4084 if (TREE_CODE (memb_type) != POINTER_TYPE)
4087 if (coder == POINTER_TYPE)
4089 tree ttl = TREE_TYPE (memb_type);
4090 tree ttr = TREE_TYPE (rhstype);
4092 /* Any non-function converts to a [const][volatile] void *
4093 and vice versa; otherwise, targets must be the same.
4094 Meanwhile, the lhs target must have all the qualifiers of
4096 if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
4097 || comp_target_types (memb_type, rhstype))
4099 /* If this type won't generate any warnings, use it. */
4100 if (TYPE_QUALS (ttl) == TYPE_QUALS (ttr)
4101 || ((TREE_CODE (ttr) == FUNCTION_TYPE
4102 && TREE_CODE (ttl) == FUNCTION_TYPE)
4103 ? ((TYPE_QUALS (ttl) | TYPE_QUALS (ttr))
4104 == TYPE_QUALS (ttr))
4105 : ((TYPE_QUALS (ttl) | TYPE_QUALS (ttr))
4106 == TYPE_QUALS (ttl))))
4109 /* Keep looking for a better type, but remember this one. */
4111 marginal_memb = memb;
4115 /* Can convert integer zero to any pointer type. */
4116 if (null_pointer_constant_p (rhs))
4118 rhs = null_pointer_node;
4123 if (memb || marginal_memb)
4127 /* We have only a marginally acceptable member type;
4128 it needs a warning. */
4129 tree ttl = TREE_TYPE (TREE_TYPE (marginal_memb));
4130 tree ttr = TREE_TYPE (rhstype);
4132 /* Const and volatile mean something different for function
4133 types, so the usual warnings are not appropriate. */
4134 if (TREE_CODE (ttr) == FUNCTION_TYPE
4135 && TREE_CODE (ttl) == FUNCTION_TYPE)
4137 /* Because const and volatile on functions are
4138 restrictions that say the function will not do
4139 certain things, it is okay to use a const or volatile
4140 function where an ordinary one is wanted, but not
4142 if (TYPE_QUALS (ttl) & ~TYPE_QUALS (ttr))
4143 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE "
4144 "makes qualified function "
4145 "pointer from unqualified"),
4146 G_("assignment makes qualified "
4147 "function pointer from "
4149 G_("initialization makes qualified "
4150 "function pointer from "
4152 G_("return makes qualified function "
4153 "pointer from unqualified"));
4155 else if (TYPE_QUALS (ttr) & ~TYPE_QUALS (ttl))
4156 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE discards "
4157 "qualifiers from pointer target type"),
4158 G_("assignment discards qualifiers "
4159 "from pointer target type"),
4160 G_("initialization discards qualifiers "
4161 "from pointer target type"),
4162 G_("return discards qualifiers from "
4163 "pointer target type"));
4165 memb = marginal_memb;
4168 if (pedantic && (!fundecl || !DECL_IN_SYSTEM_HEADER (fundecl)))
4169 pedwarn ("ISO C prohibits argument conversion to union type");
4171 rhs = fold_convert (TREE_TYPE (memb), rhs);
4172 return build_constructor_single (type, memb, rhs);
4176 /* Conversions among pointers */
4177 else if ((codel == POINTER_TYPE || codel == REFERENCE_TYPE)
4178 && (coder == codel))
4180 tree ttl = TREE_TYPE (type);
4181 tree ttr = TREE_TYPE (rhstype);
4184 bool is_opaque_pointer;
4185 int target_cmp = 0; /* Cache comp_target_types () result. */
4187 if (TREE_CODE (mvl) != ARRAY_TYPE)
4188 mvl = TYPE_MAIN_VARIANT (mvl);
4189 if (TREE_CODE (mvr) != ARRAY_TYPE)
4190 mvr = TYPE_MAIN_VARIANT (mvr);
4191 /* Opaque pointers are treated like void pointers. */
4192 is_opaque_pointer = (targetm.vector_opaque_p (type)
4193 || targetm.vector_opaque_p (rhstype))
4194 && TREE_CODE (ttl) == VECTOR_TYPE
4195 && TREE_CODE (ttr) == VECTOR_TYPE;
4197 /* C++ does not allow the implicit conversion void* -> T*. However,
4198 for the purpose of reducing the number of false positives, we
4199 tolerate the special case of
4203 where NULL is typically defined in C to be '(void *) 0'. */
4204 if (VOID_TYPE_P (ttr) && rhs != null_pointer_node && !VOID_TYPE_P (ttl))
4205 warning (OPT_Wc___compat, "request for implicit conversion from "
4206 "%qT to %qT not permitted in C++", rhstype, type);
4208 /* Check if the right-hand side has a format attribute but the
4209 left-hand side doesn't. */
4210 if (warn_missing_format_attribute
4211 && check_missing_format_attribute (type, rhstype))
4216 case ic_argpass_nonproto:
4217 warning (OPT_Wmissing_format_attribute,
4218 "argument %d of %qE might be "
4219 "a candidate for a format attribute",
4223 warning (OPT_Wmissing_format_attribute,
4224 "assignment left-hand side might be "
4225 "a candidate for a format attribute");
4228 warning (OPT_Wmissing_format_attribute,
4229 "initialization left-hand side might be "
4230 "a candidate for a format attribute");
4233 warning (OPT_Wmissing_format_attribute,
4234 "return type might be "
4235 "a candidate for a format attribute");
4242 /* Any non-function converts to a [const][volatile] void *
4243 and vice versa; otherwise, targets must be the same.
4244 Meanwhile, the lhs target must have all the qualifiers of the rhs. */
4245 if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
4246 || (target_cmp = comp_target_types (type, rhstype))
4247 || is_opaque_pointer
4248 || (c_common_unsigned_type (mvl)
4249 == c_common_unsigned_type (mvr)))
4252 && ((VOID_TYPE_P (ttl) && TREE_CODE (ttr) == FUNCTION_TYPE)
4255 && !null_pointer_constant_p (rhs)
4256 && TREE_CODE (ttl) == FUNCTION_TYPE)))
4257 WARN_FOR_ASSIGNMENT (G_("ISO C forbids passing argument %d of "
4258 "%qE between function pointer "
4260 G_("ISO C forbids assignment between "
4261 "function pointer and %<void *%>"),
4262 G_("ISO C forbids initialization between "
4263 "function pointer and %<void *%>"),
4264 G_("ISO C forbids return between function "
4265 "pointer and %<void *%>"));
4266 /* Const and volatile mean something different for function types,
4267 so the usual warnings are not appropriate. */
4268 else if (TREE_CODE (ttr) != FUNCTION_TYPE
4269 && TREE_CODE (ttl) != FUNCTION_TYPE)
4271 if (TYPE_QUALS (ttr) & ~TYPE_QUALS (ttl))
4273 /* Types differing only by the presence of the 'volatile'
4274 qualifier are acceptable if the 'volatile' has been added
4275 in by the Objective-C EH machinery. */
4276 if (!objc_type_quals_match (ttl, ttr))
4277 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE discards "
4278 "qualifiers from pointer target type"),
4279 G_("assignment discards qualifiers "
4280 "from pointer target type"),
4281 G_("initialization discards qualifiers "
4282 "from pointer target type"),
4283 G_("return discards qualifiers from "
4284 "pointer target type"));
4286 /* If this is not a case of ignoring a mismatch in signedness,
4288 else if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
4291 /* If there is a mismatch, do warn. */
4292 else if (warn_pointer_sign)
4293 WARN_FOR_ASSIGNMENT (G_("pointer targets in passing argument "
4294 "%d of %qE differ in signedness"),
4295 G_("pointer targets in assignment "
4296 "differ in signedness"),
4297 G_("pointer targets in initialization "
4298 "differ in signedness"),
4299 G_("pointer targets in return differ "
4302 else if (TREE_CODE (ttl) == FUNCTION_TYPE
4303 && TREE_CODE (ttr) == FUNCTION_TYPE)
4305 /* Because const and volatile on functions are restrictions
4306 that say the function will not do certain things,
4307 it is okay to use a const or volatile function
4308 where an ordinary one is wanted, but not vice-versa. */
4309 if (TYPE_QUALS (ttl) & ~TYPE_QUALS (ttr))
4310 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE makes "
4311 "qualified function pointer "
4312 "from unqualified"),
4313 G_("assignment makes qualified function "
4314 "pointer from unqualified"),
4315 G_("initialization makes qualified "
4316 "function pointer from unqualified"),
4317 G_("return makes qualified function "
4318 "pointer from unqualified"));
4322 /* Avoid warning about the volatile ObjC EH puts on decls. */
4324 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE from "
4325 "incompatible pointer type"),
4326 G_("assignment from incompatible pointer type"),
4327 G_("initialization from incompatible "
4329 G_("return from incompatible pointer type"));
4331 return convert (type, rhs);
4333 else if (codel == POINTER_TYPE && coder == ARRAY_TYPE)
4335 /* ??? This should not be an error when inlining calls to
4336 unprototyped functions. */
4337 error ("invalid use of non-lvalue array");
4338 return error_mark_node;
4340 else if (codel == POINTER_TYPE && coder == INTEGER_TYPE)
4342 /* An explicit constant 0 can convert to a pointer,
4343 or one that results from arithmetic, even including
4344 a cast to integer type. */
4345 if (!null_pointer_constant_p (rhs))
4346 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE makes "
4347 "pointer from integer without a cast"),
4348 G_("assignment makes pointer from integer "
4350 G_("initialization makes pointer from "
4351 "integer without a cast"),
4352 G_("return makes pointer from integer "
4355 return convert (type, rhs);
4357 else if (codel == INTEGER_TYPE && coder == POINTER_TYPE)
4359 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE makes integer "
4360 "from pointer without a cast"),
4361 G_("assignment makes integer from pointer "
4363 G_("initialization makes integer from pointer "
4365 G_("return makes integer from pointer "
4367 return convert (type, rhs);
4369 else if (codel == BOOLEAN_TYPE && coder == POINTER_TYPE)
4370 return convert (type, rhs);
4375 case ic_argpass_nonproto:
4376 /* ??? This should not be an error when inlining calls to
4377 unprototyped functions. */
4378 error ("incompatible type for argument %d of %qE", parmnum, rname);
4381 error ("incompatible types in assignment");
4384 error ("incompatible types in initialization");
4387 error ("incompatible types in return");
4393 return error_mark_node;
4396 /* If VALUE is a compound expr all of whose expressions are constant, then
4397 return its value. Otherwise, return error_mark_node.
4399 This is for handling COMPOUND_EXPRs as initializer elements
4400 which is allowed with a warning when -pedantic is specified. */
4403 valid_compound_expr_initializer (tree value, tree endtype)
4405 if (TREE_CODE (value) == COMPOUND_EXPR)
4407 if (valid_compound_expr_initializer (TREE_OPERAND (value, 0), endtype)
4409 return error_mark_node;
4410 return valid_compound_expr_initializer (TREE_OPERAND (value, 1),
4413 else if (!initializer_constant_valid_p (value, endtype))
4414 return error_mark_node;
4419 /* Perform appropriate conversions on the initial value of a variable,
4420 store it in the declaration DECL,
4421 and print any error messages that are appropriate.
4422 If the init is invalid, store an ERROR_MARK. */
4425 store_init_value (tree decl, tree init)
4429 /* If variable's type was invalidly declared, just ignore it. */
4431 type = TREE_TYPE (decl);
4432 if (TREE_CODE (type) == ERROR_MARK)
4435 /* Digest the specified initializer into an expression. */
4437 value = digest_init (type, init, true, TREE_STATIC (decl));
4439 /* Store the expression if valid; else report error. */
4441 if (!in_system_header
4442 && AGGREGATE_TYPE_P (TREE_TYPE (decl)) && !TREE_STATIC (decl))
4443 warning (OPT_Wtraditional, "traditional C rejects automatic "
4444 "aggregate initialization");
4446 DECL_INITIAL (decl) = value;
4448 /* ANSI wants warnings about out-of-range constant initializers. */
4449 STRIP_TYPE_NOPS (value);
4450 if (TREE_STATIC (decl))
4451 constant_expression_warning (value);
4453 /* Check if we need to set array size from compound literal size. */
4454 if (TREE_CODE (type) == ARRAY_TYPE
4455 && TYPE_DOMAIN (type) == 0
4456 && value != error_mark_node)
4458 tree inside_init = init;
4460 STRIP_TYPE_NOPS (inside_init);
4461 inside_init = fold (inside_init);
4463 if (TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
4465 tree cldecl = COMPOUND_LITERAL_EXPR_DECL (inside_init);
4467 if (TYPE_DOMAIN (TREE_TYPE (cldecl)))
4469 /* For int foo[] = (int [3]){1}; we need to set array size
4470 now since later on array initializer will be just the
4471 brace enclosed list of the compound literal. */
4472 type = build_distinct_type_copy (TYPE_MAIN_VARIANT (type));
4473 TREE_TYPE (decl) = type;
4474 TYPE_DOMAIN (type) = TYPE_DOMAIN (TREE_TYPE (cldecl));
4476 layout_decl (cldecl, 0);
4482 /* Methods for storing and printing names for error messages. */
4484 /* Implement a spelling stack that allows components of a name to be pushed
4485 and popped. Each element on the stack is this structure. */
4492 unsigned HOST_WIDE_INT i;
4497 #define SPELLING_STRING 1
4498 #define SPELLING_MEMBER 2
4499 #define SPELLING_BOUNDS 3
4501 static struct spelling *spelling; /* Next stack element (unused). */
4502 static struct spelling *spelling_base; /* Spelling stack base. */
4503 static int spelling_size; /* Size of the spelling stack. */
4505 /* Macros to save and restore the spelling stack around push_... functions.
4506 Alternative to SAVE_SPELLING_STACK. */
4508 #define SPELLING_DEPTH() (spelling - spelling_base)
4509 #define RESTORE_SPELLING_DEPTH(DEPTH) (spelling = spelling_base + (DEPTH))
4511 /* Push an element on the spelling stack with type KIND and assign VALUE
4514 #define PUSH_SPELLING(KIND, VALUE, MEMBER) \
4516 int depth = SPELLING_DEPTH (); \
4518 if (depth >= spelling_size) \
4520 spelling_size += 10; \
4521 spelling_base = XRESIZEVEC (struct spelling, spelling_base, \
4523 RESTORE_SPELLING_DEPTH (depth); \
4526 spelling->kind = (KIND); \
4527 spelling->MEMBER = (VALUE); \
4531 /* Push STRING on the stack. Printed literally. */
4534 push_string (const char *string)
4536 PUSH_SPELLING (SPELLING_STRING, string, u.s);
4539 /* Push a member name on the stack. Printed as '.' STRING. */
4542 push_member_name (tree decl)
4544 const char *const string
4545 = DECL_NAME (decl) ? IDENTIFIER_POINTER (DECL_NAME (decl)) : "<anonymous>";
4546 PUSH_SPELLING (SPELLING_MEMBER, string, u.s);
4549 /* Push an array bounds on the stack. Printed as [BOUNDS]. */
4552 push_array_bounds (unsigned HOST_WIDE_INT bounds)
4554 PUSH_SPELLING (SPELLING_BOUNDS, bounds, u.i);
4557 /* Compute the maximum size in bytes of the printed spelling. */
4560 spelling_length (void)
4565 for (p = spelling_base; p < spelling; p++)
4567 if (p->kind == SPELLING_BOUNDS)
4570 size += strlen (p->u.s) + 1;
4576 /* Print the spelling to BUFFER and return it. */
4579 print_spelling (char *buffer)
4584 for (p = spelling_base; p < spelling; p++)
4585 if (p->kind == SPELLING_BOUNDS)
4587 sprintf (d, "[" HOST_WIDE_INT_PRINT_UNSIGNED "]", p->u.i);
4593 if (p->kind == SPELLING_MEMBER)
4595 for (s = p->u.s; (*d = *s++); d++)
4602 /* Issue an error message for a bad initializer component.
4603 MSGID identifies the message.
4604 The component name is taken from the spelling stack. */
4607 error_init (const char *msgid)
4611 error ("%s", _(msgid));
4612 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4614 error ("(near initialization for %qs)", ofwhat);
4617 /* Issue a pedantic warning for a bad initializer component.
4618 MSGID identifies the message.
4619 The component name is taken from the spelling stack. */
4622 pedwarn_init (const char *msgid)
4626 pedwarn ("%s", _(msgid));
4627 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4629 pedwarn ("(near initialization for %qs)", ofwhat);
4632 /* Issue a warning for a bad initializer component.
4633 MSGID identifies the message.
4634 The component name is taken from the spelling stack. */
4637 warning_init (const char *msgid)
4641 warning (0, "%s", _(msgid));
4642 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4644 warning (0, "(near initialization for %qs)", ofwhat);
4647 /* If TYPE is an array type and EXPR is a parenthesized string
4648 constant, warn if pedantic that EXPR is being used to initialize an
4649 object of type TYPE. */
4652 maybe_warn_string_init (tree type, struct c_expr expr)
4655 && TREE_CODE (type) == ARRAY_TYPE
4656 && TREE_CODE (expr.value) == STRING_CST
4657 && expr.original_code != STRING_CST)
4658 pedwarn_init ("array initialized from parenthesized string constant");
4661 /* Digest the parser output INIT as an initializer for type TYPE.
4662 Return a C expression of type TYPE to represent the initial value.
4664 If INIT is a string constant, STRICT_STRING is true if it is
4665 unparenthesized or we should not warn here for it being parenthesized.
4666 For other types of INIT, STRICT_STRING is not used.
4668 REQUIRE_CONSTANT requests an error if non-constant initializers or
4669 elements are seen. */
4672 digest_init (tree type, tree init, bool strict_string, int require_constant)
4674 enum tree_code code = TREE_CODE (type);
4675 tree inside_init = init;
4677 if (type == error_mark_node
4679 || init == error_mark_node
4680 || TREE_TYPE (init) == error_mark_node)
4681 return error_mark_node;
4683 STRIP_TYPE_NOPS (inside_init);
4685 inside_init = fold (inside_init);
4687 /* Initialization of an array of chars from a string constant
4688 optionally enclosed in braces. */
4690 if (code == ARRAY_TYPE && inside_init
4691 && TREE_CODE (inside_init) == STRING_CST)
4693 tree typ1 = TYPE_MAIN_VARIANT (TREE_TYPE (type));
4694 /* Note that an array could be both an array of character type
4695 and an array of wchar_t if wchar_t is signed char or unsigned
4697 bool char_array = (typ1 == char_type_node
4698 || typ1 == signed_char_type_node
4699 || typ1 == unsigned_char_type_node);
4700 bool wchar_array = !!comptypes (typ1, wchar_type_node);
4701 if (char_array || wchar_array)
4705 expr.value = inside_init;
4706 expr.original_code = (strict_string ? STRING_CST : ERROR_MARK);
4707 maybe_warn_string_init (type, expr);
4710 = (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (inside_init)))
4713 if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
4714 TYPE_MAIN_VARIANT (type)))
4717 if (!wchar_array && !char_string)
4719 error_init ("char-array initialized from wide string");
4720 return error_mark_node;
4722 if (char_string && !char_array)
4724 error_init ("wchar_t-array initialized from non-wide string");
4725 return error_mark_node;
4728 TREE_TYPE (inside_init) = type;
4729 if (TYPE_DOMAIN (type) != 0
4730 && TYPE_SIZE (type) != 0
4731 && TREE_CODE (TYPE_SIZE (type)) == INTEGER_CST
4732 /* Subtract 1 (or sizeof (wchar_t))
4733 because it's ok to ignore the terminating null char
4734 that is counted in the length of the constant. */
4735 && 0 > compare_tree_int (TYPE_SIZE_UNIT (type),
4736 TREE_STRING_LENGTH (inside_init)
4737 - ((TYPE_PRECISION (typ1)
4738 != TYPE_PRECISION (char_type_node))
4739 ? (TYPE_PRECISION (wchar_type_node)
4742 pedwarn_init ("initializer-string for array of chars is too long");
4746 else if (INTEGRAL_TYPE_P (typ1))
4748 error_init ("array of inappropriate type initialized "
4749 "from string constant");
4750 return error_mark_node;
4754 /* Build a VECTOR_CST from a *constant* vector constructor. If the
4755 vector constructor is not constant (e.g. {1,2,3,foo()}) then punt
4756 below and handle as a constructor. */
4757 if (code == VECTOR_TYPE
4758 && TREE_CODE (TREE_TYPE (inside_init)) == VECTOR_TYPE
4759 && vector_types_convertible_p (TREE_TYPE (inside_init), type, true)
4760 && TREE_CONSTANT (inside_init))
4762 if (TREE_CODE (inside_init) == VECTOR_CST
4763 && comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
4764 TYPE_MAIN_VARIANT (type)))
4767 if (TREE_CODE (inside_init) == CONSTRUCTOR)
4769 unsigned HOST_WIDE_INT ix;
4771 bool constant_p = true;
4773 /* Iterate through elements and check if all constructor
4774 elements are *_CSTs. */
4775 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (inside_init), ix, value)
4776 if (!CONSTANT_CLASS_P (value))
4783 return build_vector_from_ctor (type,
4784 CONSTRUCTOR_ELTS (inside_init));
4788 /* Any type can be initialized
4789 from an expression of the same type, optionally with braces. */
4791 if (inside_init && TREE_TYPE (inside_init) != 0
4792 && (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
4793 TYPE_MAIN_VARIANT (type))
4794 || (code == ARRAY_TYPE
4795 && comptypes (TREE_TYPE (inside_init), type))
4796 || (code == VECTOR_TYPE
4797 && comptypes (TREE_TYPE (inside_init), type))
4798 || (code == POINTER_TYPE
4799 && TREE_CODE (TREE_TYPE (inside_init)) == ARRAY_TYPE
4800 && comptypes (TREE_TYPE (TREE_TYPE (inside_init)),
4801 TREE_TYPE (type)))))
4803 if (code == POINTER_TYPE)
4805 if (TREE_CODE (TREE_TYPE (inside_init)) == ARRAY_TYPE)
4807 if (TREE_CODE (inside_init) == STRING_CST
4808 || TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
4809 inside_init = array_to_pointer_conversion (inside_init);
4812 error_init ("invalid use of non-lvalue array");
4813 return error_mark_node;
4818 if (code == VECTOR_TYPE)
4819 /* Although the types are compatible, we may require a
4821 inside_init = convert (type, inside_init);
4823 if (require_constant
4824 && (code == VECTOR_TYPE || !flag_isoc99)
4825 && TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
4827 /* As an extension, allow initializing objects with static storage
4828 duration with compound literals (which are then treated just as
4829 the brace enclosed list they contain). Also allow this for
4830 vectors, as we can only assign them with compound literals. */
4831 tree decl = COMPOUND_LITERAL_EXPR_DECL (inside_init);
4832 inside_init = DECL_INITIAL (decl);
4835 if (code == ARRAY_TYPE && TREE_CODE (inside_init) != STRING_CST
4836 && TREE_CODE (inside_init) != CONSTRUCTOR)
4838 error_init ("array initialized from non-constant array expression");
4839 return error_mark_node;
4842 if (optimize && TREE_CODE (inside_init) == VAR_DECL)
4843 inside_init = decl_constant_value_for_broken_optimization (inside_init);
4845 /* Compound expressions can only occur here if -pedantic or
4846 -pedantic-errors is specified. In the later case, we always want
4847 an error. In the former case, we simply want a warning. */
4848 if (require_constant && pedantic
4849 && TREE_CODE (inside_init) == COMPOUND_EXPR)
4852 = valid_compound_expr_initializer (inside_init,
4853 TREE_TYPE (inside_init));
4854 if (inside_init == error_mark_node)
4855 error_init ("initializer element is not constant");
4857 pedwarn_init ("initializer element is not constant");
4858 if (flag_pedantic_errors)
4859 inside_init = error_mark_node;
4861 else if (require_constant
4862 && !initializer_constant_valid_p (inside_init,
4863 TREE_TYPE (inside_init)))
4865 error_init ("initializer element is not constant");
4866 inside_init = error_mark_node;
4869 /* Added to enable additional -Wmissing-format-attribute warnings. */
4870 if (TREE_CODE (TREE_TYPE (inside_init)) == POINTER_TYPE)
4871 inside_init = convert_for_assignment (type, inside_init, ic_init, NULL_TREE,
4876 /* Handle scalar types, including conversions. */
4878 if (code == INTEGER_TYPE || code == REAL_TYPE || code == FIXED_POINT_TYPE
4879 || code == POINTER_TYPE || code == ENUMERAL_TYPE || code == BOOLEAN_TYPE
4880 || code == COMPLEX_TYPE || code == VECTOR_TYPE)
4882 if (TREE_CODE (TREE_TYPE (init)) == ARRAY_TYPE
4883 && (TREE_CODE (init) == STRING_CST
4884 || TREE_CODE (init) == COMPOUND_LITERAL_EXPR))
4885 init = array_to_pointer_conversion (init);
4887 = convert_for_assignment (type, init, ic_init,
4888 NULL_TREE, NULL_TREE, 0);
4890 /* Check to see if we have already given an error message. */
4891 if (inside_init == error_mark_node)
4893 else if (require_constant && !TREE_CONSTANT (inside_init))
4895 error_init ("initializer element is not constant");
4896 inside_init = error_mark_node;
4898 else if (require_constant
4899 && !initializer_constant_valid_p (inside_init,
4900 TREE_TYPE (inside_init)))
4902 error_init ("initializer element is not computable at load time");
4903 inside_init = error_mark_node;
4909 /* Come here only for records and arrays. */
4911 if (COMPLETE_TYPE_P (type) && TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST)
4913 error_init ("variable-sized object may not be initialized");
4914 return error_mark_node;
4917 error_init ("invalid initializer");
4918 return error_mark_node;
4921 /* Handle initializers that use braces. */
4923 /* Type of object we are accumulating a constructor for.
4924 This type is always a RECORD_TYPE, UNION_TYPE or ARRAY_TYPE. */
4925 static tree constructor_type;
4927 /* For a RECORD_TYPE or UNION_TYPE, this is the chain of fields
4929 static tree constructor_fields;
4931 /* For an ARRAY_TYPE, this is the specified index
4932 at which to store the next element we get. */
4933 static tree constructor_index;
4935 /* For an ARRAY_TYPE, this is the maximum index. */
4936 static tree constructor_max_index;
4938 /* For a RECORD_TYPE, this is the first field not yet written out. */
4939 static tree constructor_unfilled_fields;
4941 /* For an ARRAY_TYPE, this is the index of the first element
4942 not yet written out. */
4943 static tree constructor_unfilled_index;
4945 /* In a RECORD_TYPE, the byte index of the next consecutive field.
4946 This is so we can generate gaps between fields, when appropriate. */
4947 static tree constructor_bit_index;
4949 /* If we are saving up the elements rather than allocating them,
4950 this is the list of elements so far (in reverse order,
4951 most recent first). */
4952 static VEC(constructor_elt,gc) *constructor_elements;
4954 /* 1 if constructor should be incrementally stored into a constructor chain,
4955 0 if all the elements should be kept in AVL tree. */
4956 static int constructor_incremental;
4958 /* 1 if so far this constructor's elements are all compile-time constants. */
4959 static int constructor_constant;
4961 /* 1 if so far this constructor's elements are all valid address constants. */
4962 static int constructor_simple;
4964 /* 1 if this constructor is erroneous so far. */
4965 static int constructor_erroneous;
4967 /* Structure for managing pending initializer elements, organized as an
4972 struct init_node *left, *right;
4973 struct init_node *parent;
4979 /* Tree of pending elements at this constructor level.
4980 These are elements encountered out of order
4981 which belong at places we haven't reached yet in actually
4983 Will never hold tree nodes across GC runs. */
4984 static struct init_node *constructor_pending_elts;
4986 /* The SPELLING_DEPTH of this constructor. */
4987 static int constructor_depth;
4989 /* DECL node for which an initializer is being read.
4990 0 means we are reading a constructor expression
4991 such as (struct foo) {...}. */
4992 static tree constructor_decl;
4994 /* Nonzero if this is an initializer for a top-level decl. */
4995 static int constructor_top_level;
4997 /* Nonzero if there were any member designators in this initializer. */
4998 static int constructor_designated;
5000 /* Nesting depth of designator list. */
5001 static int designator_depth;
5003 /* Nonzero if there were diagnosed errors in this designator list. */
5004 static int designator_erroneous;
5007 /* This stack has a level for each implicit or explicit level of
5008 structuring in the initializer, including the outermost one. It
5009 saves the values of most of the variables above. */
5011 struct constructor_range_stack;
5013 struct constructor_stack
5015 struct constructor_stack *next;
5020 tree unfilled_index;
5021 tree unfilled_fields;
5023 VEC(constructor_elt,gc) *elements;
5024 struct init_node *pending_elts;
5027 /* If value nonzero, this value should replace the entire
5028 constructor at this level. */
5029 struct c_expr replacement_value;
5030 struct constructor_range_stack *range_stack;
5040 static struct constructor_stack *constructor_stack;
5042 /* This stack represents designators from some range designator up to
5043 the last designator in the list. */
5045 struct constructor_range_stack
5047 struct constructor_range_stack *next, *prev;
5048 struct constructor_stack *stack;
5055 static struct constructor_range_stack *constructor_range_stack;
5057 /* This stack records separate initializers that are nested.
5058 Nested initializers can't happen in ANSI C, but GNU C allows them
5059 in cases like { ... (struct foo) { ... } ... }. */
5061 struct initializer_stack
5063 struct initializer_stack *next;
5065 struct constructor_stack *constructor_stack;
5066 struct constructor_range_stack *constructor_range_stack;
5067 VEC(constructor_elt,gc) *elements;
5068 struct spelling *spelling;
5069 struct spelling *spelling_base;
5072 char require_constant_value;
5073 char require_constant_elements;
5076 static struct initializer_stack *initializer_stack;
5078 /* Prepare to parse and output the initializer for variable DECL. */
5081 start_init (tree decl, tree asmspec_tree ATTRIBUTE_UNUSED, int top_level)
5084 struct initializer_stack *p = XNEW (struct initializer_stack);
5086 p->decl = constructor_decl;
5087 p->require_constant_value = require_constant_value;
5088 p->require_constant_elements = require_constant_elements;
5089 p->constructor_stack = constructor_stack;
5090 p->constructor_range_stack = constructor_range_stack;
5091 p->elements = constructor_elements;
5092 p->spelling = spelling;
5093 p->spelling_base = spelling_base;
5094 p->spelling_size = spelling_size;
5095 p->top_level = constructor_top_level;
5096 p->next = initializer_stack;
5097 initializer_stack = p;
5099 constructor_decl = decl;
5100 constructor_designated = 0;
5101 constructor_top_level = top_level;
5103 if (decl != 0 && decl != error_mark_node)
5105 require_constant_value = TREE_STATIC (decl);
5106 require_constant_elements
5107 = ((TREE_STATIC (decl) || (pedantic && !flag_isoc99))
5108 /* For a scalar, you can always use any value to initialize,
5109 even within braces. */
5110 && (TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE
5111 || TREE_CODE (TREE_TYPE (decl)) == RECORD_TYPE
5112 || TREE_CODE (TREE_TYPE (decl)) == UNION_TYPE
5113 || TREE_CODE (TREE_TYPE (decl)) == QUAL_UNION_TYPE));
5114 locus = IDENTIFIER_POINTER (DECL_NAME (decl));
5118 require_constant_value = 0;
5119 require_constant_elements = 0;
5120 locus = "(anonymous)";
5123 constructor_stack = 0;
5124 constructor_range_stack = 0;
5126 missing_braces_mentioned = 0;
5130 RESTORE_SPELLING_DEPTH (0);
5133 push_string (locus);
5139 struct initializer_stack *p = initializer_stack;
5141 /* Free the whole constructor stack of this initializer. */
5142 while (constructor_stack)
5144 struct constructor_stack *q = constructor_stack;
5145 constructor_stack = q->next;
5149 gcc_assert (!constructor_range_stack);
5151 /* Pop back to the data of the outer initializer (if any). */
5152 free (spelling_base);
5154 constructor_decl = p->decl;
5155 require_constant_value = p->require_constant_value;
5156 require_constant_elements = p->require_constant_elements;
5157 constructor_stack = p->constructor_stack;
5158 constructor_range_stack = p->constructor_range_stack;
5159 constructor_elements = p->elements;
5160 spelling = p->spelling;
5161 spelling_base = p->spelling_base;
5162 spelling_size = p->spelling_size;
5163 constructor_top_level = p->top_level;
5164 initializer_stack = p->next;
5168 /* Call here when we see the initializer is surrounded by braces.
5169 This is instead of a call to push_init_level;
5170 it is matched by a call to pop_init_level.
5172 TYPE is the type to initialize, for a constructor expression.
5173 For an initializer for a decl, TYPE is zero. */
5176 really_start_incremental_init (tree type)
5178 struct constructor_stack *p = XNEW (struct constructor_stack);
5181 type = TREE_TYPE (constructor_decl);
5183 if (targetm.vector_opaque_p (type))
5184 error ("opaque vector types cannot be initialized");
5186 p->type = constructor_type;
5187 p->fields = constructor_fields;
5188 p->index = constructor_index;
5189 p->max_index = constructor_max_index;
5190 p->unfilled_index = constructor_unfilled_index;
5191 p->unfilled_fields = constructor_unfilled_fields;
5192 p->bit_index = constructor_bit_index;
5193 p->elements = constructor_elements;
5194 p->constant = constructor_constant;
5195 p->simple = constructor_simple;
5196 p->erroneous = constructor_erroneous;
5197 p->pending_elts = constructor_pending_elts;
5198 p->depth = constructor_depth;
5199 p->replacement_value.value = 0;
5200 p->replacement_value.original_code = ERROR_MARK;
5204 p->incremental = constructor_incremental;
5205 p->designated = constructor_designated;
5207 constructor_stack = p;
5209 constructor_constant = 1;
5210 constructor_simple = 1;
5211 constructor_depth = SPELLING_DEPTH ();
5212 constructor_elements = 0;
5213 constructor_pending_elts = 0;
5214 constructor_type = type;
5215 constructor_incremental = 1;
5216 constructor_designated = 0;
5217 designator_depth = 0;
5218 designator_erroneous = 0;
5220 if (TREE_CODE (constructor_type) == RECORD_TYPE
5221 || TREE_CODE (constructor_type) == UNION_TYPE)
5223 constructor_fields = TYPE_FIELDS (constructor_type);
5224 /* Skip any nameless bit fields at the beginning. */
5225 while (constructor_fields != 0 && DECL_C_BIT_FIELD (constructor_fields)
5226 && DECL_NAME (constructor_fields) == 0)
5227 constructor_fields = TREE_CHAIN (constructor_fields);
5229 constructor_unfilled_fields = constructor_fields;
5230 constructor_bit_index = bitsize_zero_node;
5232 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5234 if (TYPE_DOMAIN (constructor_type))
5236 constructor_max_index
5237 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type));
5239 /* Detect non-empty initializations of zero-length arrays. */
5240 if (constructor_max_index == NULL_TREE
5241 && TYPE_SIZE (constructor_type))
5242 constructor_max_index = build_int_cst (NULL_TREE, -1);
5244 /* constructor_max_index needs to be an INTEGER_CST. Attempts
5245 to initialize VLAs will cause a proper error; avoid tree
5246 checking errors as well by setting a safe value. */
5247 if (constructor_max_index
5248 && TREE_CODE (constructor_max_index) != INTEGER_CST)
5249 constructor_max_index = build_int_cst (NULL_TREE, -1);
5252 = convert (bitsizetype,
5253 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
5257 constructor_index = bitsize_zero_node;
5258 constructor_max_index = NULL_TREE;
5261 constructor_unfilled_index = constructor_index;
5263 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
5265 /* Vectors are like simple fixed-size arrays. */
5266 constructor_max_index =
5267 build_int_cst (NULL_TREE, TYPE_VECTOR_SUBPARTS (constructor_type) - 1);
5268 constructor_index = bitsize_zero_node;
5269 constructor_unfilled_index = constructor_index;
5273 /* Handle the case of int x = {5}; */
5274 constructor_fields = constructor_type;
5275 constructor_unfilled_fields = constructor_type;
5279 /* Push down into a subobject, for initialization.
5280 If this is for an explicit set of braces, IMPLICIT is 0.
5281 If it is because the next element belongs at a lower level,
5282 IMPLICIT is 1 (or 2 if the push is because of designator list). */
5285 push_init_level (int implicit)
5287 struct constructor_stack *p;
5288 tree value = NULL_TREE;
5290 /* If we've exhausted any levels that didn't have braces,
5291 pop them now. If implicit == 1, this will have been done in
5292 process_init_element; do not repeat it here because in the case
5293 of excess initializers for an empty aggregate this leads to an
5294 infinite cycle of popping a level and immediately recreating
5298 while (constructor_stack->implicit)
5300 if ((TREE_CODE (constructor_type) == RECORD_TYPE
5301 || TREE_CODE (constructor_type) == UNION_TYPE)
5302 && constructor_fields == 0)
5303 process_init_element (pop_init_level (1));
5304 else if (TREE_CODE (constructor_type) == ARRAY_TYPE
5305 && constructor_max_index
5306 && tree_int_cst_lt (constructor_max_index,
5308 process_init_element (pop_init_level (1));
5314 /* Unless this is an explicit brace, we need to preserve previous
5318 if ((TREE_CODE (constructor_type) == RECORD_TYPE
5319 || TREE_CODE (constructor_type) == UNION_TYPE)
5320 && constructor_fields)
5321 value = find_init_member (constructor_fields);
5322 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5323 value = find_init_member (constructor_index);
5326 p = XNEW (struct constructor_stack);
5327 p->type = constructor_type;
5328 p->fields = constructor_fields;
5329 p->index = constructor_index;
5330 p->max_index = constructor_max_index;
5331 p->unfilled_index = constructor_unfilled_index;
5332 p->unfilled_fields = constructor_unfilled_fields;
5333 p->bit_index = constructor_bit_index;
5334 p->elements = constructor_elements;
5335 p->constant = constructor_constant;
5336 p->simple = constructor_simple;
5337 p->erroneous = constructor_erroneous;
5338 p->pending_elts = constructor_pending_elts;
5339 p->depth = constructor_depth;
5340 p->replacement_value.value = 0;
5341 p->replacement_value.original_code = ERROR_MARK;
5342 p->implicit = implicit;
5344 p->incremental = constructor_incremental;
5345 p->designated = constructor_designated;
5346 p->next = constructor_stack;
5348 constructor_stack = p;
5350 constructor_constant = 1;
5351 constructor_simple = 1;
5352 constructor_depth = SPELLING_DEPTH ();
5353 constructor_elements = 0;
5354 constructor_incremental = 1;
5355 constructor_designated = 0;
5356 constructor_pending_elts = 0;
5359 p->range_stack = constructor_range_stack;
5360 constructor_range_stack = 0;
5361 designator_depth = 0;
5362 designator_erroneous = 0;
5365 /* Don't die if an entire brace-pair level is superfluous
5366 in the containing level. */
5367 if (constructor_type == 0)
5369 else if (TREE_CODE (constructor_type) == RECORD_TYPE
5370 || TREE_CODE (constructor_type) == UNION_TYPE)
5372 /* Don't die if there are extra init elts at the end. */
5373 if (constructor_fields == 0)
5374 constructor_type = 0;
5377 constructor_type = TREE_TYPE (constructor_fields);
5378 push_member_name (constructor_fields);
5379 constructor_depth++;
5382 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5384 constructor_type = TREE_TYPE (constructor_type);
5385 push_array_bounds (tree_low_cst (constructor_index, 1));
5386 constructor_depth++;
5389 if (constructor_type == 0)
5391 error_init ("extra brace group at end of initializer");
5392 constructor_fields = 0;
5393 constructor_unfilled_fields = 0;
5397 if (value && TREE_CODE (value) == CONSTRUCTOR)
5399 constructor_constant = TREE_CONSTANT (value);
5400 constructor_simple = TREE_STATIC (value);
5401 constructor_elements = CONSTRUCTOR_ELTS (value);
5402 if (!VEC_empty (constructor_elt, constructor_elements)
5403 && (TREE_CODE (constructor_type) == RECORD_TYPE
5404 || TREE_CODE (constructor_type) == ARRAY_TYPE))
5405 set_nonincremental_init ();
5408 if (implicit == 1 && warn_missing_braces && !missing_braces_mentioned)
5410 missing_braces_mentioned = 1;
5411 warning_init ("missing braces around initializer");
5414 if (TREE_CODE (constructor_type) == RECORD_TYPE
5415 || TREE_CODE (constructor_type) == UNION_TYPE)
5417 constructor_fields = TYPE_FIELDS (constructor_type);
5418 /* Skip any nameless bit fields at the beginning. */
5419 while (constructor_fields != 0 && DECL_C_BIT_FIELD (constructor_fields)
5420 && DECL_NAME (constructor_fields) == 0)
5421 constructor_fields = TREE_CHAIN (constructor_fields);
5423 constructor_unfilled_fields = constructor_fields;
5424 constructor_bit_index = bitsize_zero_node;
5426 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
5428 /* Vectors are like simple fixed-size arrays. */
5429 constructor_max_index =
5430 build_int_cst (NULL_TREE, TYPE_VECTOR_SUBPARTS (constructor_type) - 1);
5431 constructor_index = convert (bitsizetype, integer_zero_node);
5432 constructor_unfilled_index = constructor_index;
5434 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5436 if (TYPE_DOMAIN (constructor_type))
5438 constructor_max_index
5439 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type));
5441 /* Detect non-empty initializations of zero-length arrays. */
5442 if (constructor_max_index == NULL_TREE
5443 && TYPE_SIZE (constructor_type))
5444 constructor_max_index = build_int_cst (NULL_TREE, -1);
5446 /* constructor_max_index needs to be an INTEGER_CST. Attempts
5447 to initialize VLAs will cause a proper error; avoid tree
5448 checking errors as well by setting a safe value. */
5449 if (constructor_max_index
5450 && TREE_CODE (constructor_max_index) != INTEGER_CST)
5451 constructor_max_index = build_int_cst (NULL_TREE, -1);
5454 = convert (bitsizetype,
5455 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
5458 constructor_index = bitsize_zero_node;
5460 constructor_unfilled_index = constructor_index;
5461 if (value && TREE_CODE (value) == STRING_CST)
5463 /* We need to split the char/wchar array into individual
5464 characters, so that we don't have to special case it
5466 set_nonincremental_init_from_string (value);
5471 if (constructor_type != error_mark_node)
5472 warning_init ("braces around scalar initializer");
5473 constructor_fields = constructor_type;
5474 constructor_unfilled_fields = constructor_type;
5478 /* At the end of an implicit or explicit brace level,
5479 finish up that level of constructor. If a single expression
5480 with redundant braces initialized that level, return the
5481 c_expr structure for that expression. Otherwise, the original_code
5482 element is set to ERROR_MARK.
5483 If we were outputting the elements as they are read, return 0 as the value
5484 from inner levels (process_init_element ignores that),
5485 but return error_mark_node as the value from the outermost level
5486 (that's what we want to put in DECL_INITIAL).
5487 Otherwise, return a CONSTRUCTOR expression as the value. */
5490 pop_init_level (int implicit)
5492 struct constructor_stack *p;
5495 ret.original_code = ERROR_MARK;
5499 /* When we come to an explicit close brace,
5500 pop any inner levels that didn't have explicit braces. */
5501 while (constructor_stack->implicit)
5502 process_init_element (pop_init_level (1));
5504 gcc_assert (!constructor_range_stack);
5507 /* Now output all pending elements. */
5508 constructor_incremental = 1;
5509 output_pending_init_elements (1);
5511 p = constructor_stack;
5513 /* Error for initializing a flexible array member, or a zero-length
5514 array member in an inappropriate context. */
5515 if (constructor_type && constructor_fields
5516 && TREE_CODE (constructor_type) == ARRAY_TYPE
5517 && TYPE_DOMAIN (constructor_type)
5518 && !TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type)))
5520 /* Silently discard empty initializations. The parser will
5521 already have pedwarned for empty brackets. */
5522 if (integer_zerop (constructor_unfilled_index))
5523 constructor_type = NULL_TREE;
5526 gcc_assert (!TYPE_SIZE (constructor_type));
5528 if (constructor_depth > 2)
5529 error_init ("initialization of flexible array member in a nested context");
5531 pedwarn_init ("initialization of a flexible array member");
5533 /* We have already issued an error message for the existence
5534 of a flexible array member not at the end of the structure.
5535 Discard the initializer so that we do not die later. */
5536 if (TREE_CHAIN (constructor_fields) != NULL_TREE)
5537 constructor_type = NULL_TREE;
5541 /* Warn when some struct elements are implicitly initialized to zero. */
5542 if (warn_missing_field_initializers
5544 && TREE_CODE (constructor_type) == RECORD_TYPE
5545 && constructor_unfilled_fields)
5547 /* Do not warn for flexible array members or zero-length arrays. */
5548 while (constructor_unfilled_fields
5549 && (!DECL_SIZE (constructor_unfilled_fields)
5550 || integer_zerop (DECL_SIZE (constructor_unfilled_fields))))
5551 constructor_unfilled_fields = TREE_CHAIN (constructor_unfilled_fields);
5553 /* Do not warn if this level of the initializer uses member
5554 designators; it is likely to be deliberate. */
5555 if (constructor_unfilled_fields && !constructor_designated)
5557 push_member_name (constructor_unfilled_fields);
5558 warning_init ("missing initializer");
5559 RESTORE_SPELLING_DEPTH (constructor_depth);
5563 /* Pad out the end of the structure. */
5564 if (p->replacement_value.value)
5565 /* If this closes a superfluous brace pair,
5566 just pass out the element between them. */
5567 ret = p->replacement_value;
5568 else if (constructor_type == 0)
5570 else if (TREE_CODE (constructor_type) != RECORD_TYPE
5571 && TREE_CODE (constructor_type) != UNION_TYPE
5572 && TREE_CODE (constructor_type) != ARRAY_TYPE
5573 && TREE_CODE (constructor_type) != VECTOR_TYPE)
5575 /* A nonincremental scalar initializer--just return
5576 the element, after verifying there is just one. */
5577 if (VEC_empty (constructor_elt,constructor_elements))
5579 if (!constructor_erroneous)
5580 error_init ("empty scalar initializer");
5581 ret.value = error_mark_node;
5583 else if (VEC_length (constructor_elt,constructor_elements) != 1)
5585 error_init ("extra elements in scalar initializer");
5586 ret.value = VEC_index (constructor_elt,constructor_elements,0)->value;
5589 ret.value = VEC_index (constructor_elt,constructor_elements,0)->value;
5593 if (constructor_erroneous)
5594 ret.value = error_mark_node;
5597 ret.value = build_constructor (constructor_type,
5598 constructor_elements);
5599 if (constructor_constant)
5600 TREE_CONSTANT (ret.value) = TREE_INVARIANT (ret.value) = 1;
5601 if (constructor_constant && constructor_simple)
5602 TREE_STATIC (ret.value) = 1;
5606 constructor_type = p->type;
5607 constructor_fields = p->fields;
5608 constructor_index = p->index;
5609 constructor_max_index = p->max_index;
5610 constructor_unfilled_index = p->unfilled_index;
5611 constructor_unfilled_fields = p->unfilled_fields;
5612 constructor_bit_index = p->bit_index;
5613 constructor_elements = p->elements;
5614 constructor_constant = p->constant;
5615 constructor_simple = p->simple;
5616 constructor_erroneous = p->erroneous;
5617 constructor_incremental = p->incremental;
5618 constructor_designated = p->designated;
5619 constructor_pending_elts = p->pending_elts;
5620 constructor_depth = p->depth;
5622 constructor_range_stack = p->range_stack;
5623 RESTORE_SPELLING_DEPTH (constructor_depth);
5625 constructor_stack = p->next;
5628 if (ret.value == 0 && constructor_stack == 0)
5629 ret.value = error_mark_node;
5633 /* Common handling for both array range and field name designators.
5634 ARRAY argument is nonzero for array ranges. Returns zero for success. */
5637 set_designator (int array)
5640 enum tree_code subcode;
5642 /* Don't die if an entire brace-pair level is superfluous
5643 in the containing level. */
5644 if (constructor_type == 0)
5647 /* If there were errors in this designator list already, bail out
5649 if (designator_erroneous)
5652 if (!designator_depth)
5654 gcc_assert (!constructor_range_stack);
5656 /* Designator list starts at the level of closest explicit
5658 while (constructor_stack->implicit)
5659 process_init_element (pop_init_level (1));
5660 constructor_designated = 1;
5664 switch (TREE_CODE (constructor_type))
5668 subtype = TREE_TYPE (constructor_fields);
5669 if (subtype != error_mark_node)
5670 subtype = TYPE_MAIN_VARIANT (subtype);
5673 subtype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
5679 subcode = TREE_CODE (subtype);
5680 if (array && subcode != ARRAY_TYPE)
5682 error_init ("array index in non-array initializer");
5685 else if (!array && subcode != RECORD_TYPE && subcode != UNION_TYPE)
5687 error_init ("field name not in record or union initializer");
5691 constructor_designated = 1;
5692 push_init_level (2);
5696 /* If there are range designators in designator list, push a new designator
5697 to constructor_range_stack. RANGE_END is end of such stack range or
5698 NULL_TREE if there is no range designator at this level. */
5701 push_range_stack (tree range_end)
5703 struct constructor_range_stack *p;
5705 p = GGC_NEW (struct constructor_range_stack);
5706 p->prev = constructor_range_stack;
5708 p->fields = constructor_fields;
5709 p->range_start = constructor_index;
5710 p->index = constructor_index;
5711 p->stack = constructor_stack;
5712 p->range_end = range_end;
5713 if (constructor_range_stack)
5714 constructor_range_stack->next = p;
5715 constructor_range_stack = p;
5718 /* Within an array initializer, specify the next index to be initialized.
5719 FIRST is that index. If LAST is nonzero, then initialize a range
5720 of indices, running from FIRST through LAST. */
5723 set_init_index (tree first, tree last)
5725 if (set_designator (1))
5728 designator_erroneous = 1;
5730 if (!INTEGRAL_TYPE_P (TREE_TYPE (first))
5731 || (last && !INTEGRAL_TYPE_P (TREE_TYPE (last))))
5733 error_init ("array index in initializer not of integer type");
5737 if (TREE_CODE (first) != INTEGER_CST)
5738 error_init ("nonconstant array index in initializer");
5739 else if (last != 0 && TREE_CODE (last) != INTEGER_CST)
5740 error_init ("nonconstant array index in initializer");
5741 else if (TREE_CODE (constructor_type) != ARRAY_TYPE)
5742 error_init ("array index in non-array initializer");
5743 else if (tree_int_cst_sgn (first) == -1)
5744 error_init ("array index in initializer exceeds array bounds");
5745 else if (constructor_max_index
5746 && tree_int_cst_lt (constructor_max_index, first))
5747 error_init ("array index in initializer exceeds array bounds");
5750 constructor_index = convert (bitsizetype, first);
5754 if (tree_int_cst_equal (first, last))
5756 else if (tree_int_cst_lt (last, first))
5758 error_init ("empty index range in initializer");
5763 last = convert (bitsizetype, last);
5764 if (constructor_max_index != 0
5765 && tree_int_cst_lt (constructor_max_index, last))
5767 error_init ("array index range in initializer exceeds array bounds");
5774 designator_erroneous = 0;
5775 if (constructor_range_stack || last)
5776 push_range_stack (last);
5780 /* Within a struct initializer, specify the next field to be initialized. */
5783 set_init_label (tree fieldname)
5787 if (set_designator (0))
5790 designator_erroneous = 1;
5792 if (TREE_CODE (constructor_type) != RECORD_TYPE
5793 && TREE_CODE (constructor_type) != UNION_TYPE)
5795 error_init ("field name not in record or union initializer");
5799 for (tail = TYPE_FIELDS (constructor_type); tail;
5800 tail = TREE_CHAIN (tail))
5802 if (DECL_NAME (tail) == fieldname)
5807 error ("unknown field %qE specified in initializer", fieldname);
5810 constructor_fields = tail;
5812 designator_erroneous = 0;
5813 if (constructor_range_stack)
5814 push_range_stack (NULL_TREE);
5818 /* Add a new initializer to the tree of pending initializers. PURPOSE
5819 identifies the initializer, either array index or field in a structure.
5820 VALUE is the value of that index or field. */
5823 add_pending_init (tree purpose, tree value)
5825 struct init_node *p, **q, *r;
5827 q = &constructor_pending_elts;
5830 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5835 if (tree_int_cst_lt (purpose, p->purpose))
5837 else if (tree_int_cst_lt (p->purpose, purpose))
5841 if (TREE_SIDE_EFFECTS (p->value))
5842 warning_init ("initialized field with side-effects overwritten");
5843 else if (warn_override_init)
5844 warning_init ("initialized field overwritten");
5854 bitpos = bit_position (purpose);
5858 if (tree_int_cst_lt (bitpos, bit_position (p->purpose)))
5860 else if (p->purpose != purpose)
5864 if (TREE_SIDE_EFFECTS (p->value))
5865 warning_init ("initialized field with side-effects overwritten");
5866 else if (warn_override_init)
5867 warning_init ("initialized field overwritten");
5874 r = GGC_NEW (struct init_node);
5875 r->purpose = purpose;
5886 struct init_node *s;
5890 if (p->balance == 0)
5892 else if (p->balance < 0)
5899 p->left->parent = p;
5916 constructor_pending_elts = r;
5921 struct init_node *t = r->right;
5925 r->right->parent = r;
5930 p->left->parent = p;
5933 p->balance = t->balance < 0;
5934 r->balance = -(t->balance > 0);
5949 constructor_pending_elts = t;
5955 /* p->balance == +1; growth of left side balances the node. */
5960 else /* r == p->right */
5962 if (p->balance == 0)
5963 /* Growth propagation from right side. */
5965 else if (p->balance > 0)
5972 p->right->parent = p;
5989 constructor_pending_elts = r;
5991 else /* r->balance == -1 */
5994 struct init_node *t = r->left;
5998 r->left->parent = r;
6003 p->right->parent = p;
6006 r->balance = (t->balance < 0);
6007 p->balance = -(t->balance > 0);
6022 constructor_pending_elts = t;
6028 /* p->balance == -1; growth of right side balances the node. */
6039 /* Build AVL tree from a sorted chain. */
6042 set_nonincremental_init (void)
6044 unsigned HOST_WIDE_INT ix;
6047 if (TREE_CODE (constructor_type) != RECORD_TYPE
6048 && TREE_CODE (constructor_type) != ARRAY_TYPE)
6051 FOR_EACH_CONSTRUCTOR_ELT (constructor_elements, ix, index, value)
6052 add_pending_init (index, value);
6053 constructor_elements = 0;
6054 if (TREE_CODE (constructor_type) == RECORD_TYPE)
6056 constructor_unfilled_fields = TYPE_FIELDS (constructor_type);
6057 /* Skip any nameless bit fields at the beginning. */
6058 while (constructor_unfilled_fields != 0
6059 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
6060 && DECL_NAME (constructor_unfilled_fields) == 0)
6061 constructor_unfilled_fields = TREE_CHAIN (constructor_unfilled_fields);
6064 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6066 if (TYPE_DOMAIN (constructor_type))
6067 constructor_unfilled_index
6068 = convert (bitsizetype,
6069 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
6071 constructor_unfilled_index = bitsize_zero_node;
6073 constructor_incremental = 0;
6076 /* Build AVL tree from a string constant. */
6079 set_nonincremental_init_from_string (tree str)
6081 tree value, purpose, type;
6082 HOST_WIDE_INT val[2];
6083 const char *p, *end;
6084 int byte, wchar_bytes, charwidth, bitpos;
6086 gcc_assert (TREE_CODE (constructor_type) == ARRAY_TYPE);
6088 if (TYPE_PRECISION (TREE_TYPE (TREE_TYPE (str)))
6089 == TYPE_PRECISION (char_type_node))
6093 gcc_assert (TYPE_PRECISION (TREE_TYPE (TREE_TYPE (str)))
6094 == TYPE_PRECISION (wchar_type_node));
6095 wchar_bytes = TYPE_PRECISION (wchar_type_node) / BITS_PER_UNIT;
6097 charwidth = TYPE_PRECISION (char_type_node);
6098 type = TREE_TYPE (constructor_type);
6099 p = TREE_STRING_POINTER (str);
6100 end = p + TREE_STRING_LENGTH (str);
6102 for (purpose = bitsize_zero_node;
6103 p < end && !tree_int_cst_lt (constructor_max_index, purpose);
6104 purpose = size_binop (PLUS_EXPR, purpose, bitsize_one_node))
6106 if (wchar_bytes == 1)
6108 val[1] = (unsigned char) *p++;
6115 for (byte = 0; byte < wchar_bytes; byte++)
6117 if (BYTES_BIG_ENDIAN)
6118 bitpos = (wchar_bytes - byte - 1) * charwidth;
6120 bitpos = byte * charwidth;
6121 val[bitpos < HOST_BITS_PER_WIDE_INT]
6122 |= ((unsigned HOST_WIDE_INT) ((unsigned char) *p++))
6123 << (bitpos % HOST_BITS_PER_WIDE_INT);
6127 if (!TYPE_UNSIGNED (type))
6129 bitpos = ((wchar_bytes - 1) * charwidth) + HOST_BITS_PER_CHAR;
6130 if (bitpos < HOST_BITS_PER_WIDE_INT)
6132 if (val[1] & (((HOST_WIDE_INT) 1) << (bitpos - 1)))
6134 val[1] |= ((HOST_WIDE_INT) -1) << bitpos;
6138 else if (bitpos == HOST_BITS_PER_WIDE_INT)
6143 else if (val[0] & (((HOST_WIDE_INT) 1)
6144 << (bitpos - 1 - HOST_BITS_PER_WIDE_INT)))
6145 val[0] |= ((HOST_WIDE_INT) -1)
6146 << (bitpos - HOST_BITS_PER_WIDE_INT);
6149 value = build_int_cst_wide (type, val[1], val[0]);
6150 add_pending_init (purpose, value);
6153 constructor_incremental = 0;
6156 /* Return value of FIELD in pending initializer or zero if the field was
6157 not initialized yet. */
6160 find_init_member (tree field)
6162 struct init_node *p;
6164 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6166 if (constructor_incremental
6167 && tree_int_cst_lt (field, constructor_unfilled_index))
6168 set_nonincremental_init ();
6170 p = constructor_pending_elts;
6173 if (tree_int_cst_lt (field, p->purpose))
6175 else if (tree_int_cst_lt (p->purpose, field))
6181 else if (TREE_CODE (constructor_type) == RECORD_TYPE)
6183 tree bitpos = bit_position (field);
6185 if (constructor_incremental
6186 && (!constructor_unfilled_fields
6187 || tree_int_cst_lt (bitpos,
6188 bit_position (constructor_unfilled_fields))))
6189 set_nonincremental_init ();
6191 p = constructor_pending_elts;
6194 if (field == p->purpose)
6196 else if (tree_int_cst_lt (bitpos, bit_position (p->purpose)))
6202 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6204 if (!VEC_empty (constructor_elt, constructor_elements)
6205 && (VEC_last (constructor_elt, constructor_elements)->index
6207 return VEC_last (constructor_elt, constructor_elements)->value;
6212 /* "Output" the next constructor element.
6213 At top level, really output it to assembler code now.
6214 Otherwise, collect it in a list from which we will make a CONSTRUCTOR.
6215 TYPE is the data type that the containing data type wants here.
6216 FIELD is the field (a FIELD_DECL) or the index that this element fills.
6217 If VALUE is a string constant, STRICT_STRING is true if it is
6218 unparenthesized or we should not warn here for it being parenthesized.
6219 For other types of VALUE, STRICT_STRING is not used.
6221 PENDING if non-nil means output pending elements that belong
6222 right after this element. (PENDING is normally 1;
6223 it is 0 while outputting pending elements, to avoid recursion.) */
6226 output_init_element (tree value, bool strict_string, tree type, tree field,
6229 constructor_elt *celt;
6231 if (type == error_mark_node || value == error_mark_node)
6233 constructor_erroneous = 1;
6236 if (TREE_CODE (TREE_TYPE (value)) == ARRAY_TYPE
6237 && (TREE_CODE (value) == STRING_CST
6238 || TREE_CODE (value) == COMPOUND_LITERAL_EXPR)
6239 && !(TREE_CODE (value) == STRING_CST
6240 && TREE_CODE (type) == ARRAY_TYPE
6241 && INTEGRAL_TYPE_P (TREE_TYPE (type)))
6242 && !comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (value)),
6243 TYPE_MAIN_VARIANT (type)))
6244 value = array_to_pointer_conversion (value);
6246 if (TREE_CODE (value) == COMPOUND_LITERAL_EXPR
6247 && require_constant_value && !flag_isoc99 && pending)
6249 /* As an extension, allow initializing objects with static storage
6250 duration with compound literals (which are then treated just as
6251 the brace enclosed list they contain). */
6252 tree decl = COMPOUND_LITERAL_EXPR_DECL (value);
6253 value = DECL_INITIAL (decl);
6256 if (value == error_mark_node)
6257 constructor_erroneous = 1;
6258 else if (!TREE_CONSTANT (value))
6259 constructor_constant = 0;
6260 else if (!initializer_constant_valid_p (value, TREE_TYPE (value))
6261 || ((TREE_CODE (constructor_type) == RECORD_TYPE
6262 || TREE_CODE (constructor_type) == UNION_TYPE)
6263 && DECL_C_BIT_FIELD (field)
6264 && TREE_CODE (value) != INTEGER_CST))
6265 constructor_simple = 0;
6267 if (!initializer_constant_valid_p (value, TREE_TYPE (value)))
6269 if (require_constant_value)
6271 error_init ("initializer element is not constant");
6272 value = error_mark_node;
6274 else if (require_constant_elements)
6275 pedwarn ("initializer element is not computable at load time");
6278 /* If this field is empty (and not at the end of structure),
6279 don't do anything other than checking the initializer. */
6281 && (TREE_TYPE (field) == error_mark_node
6282 || (COMPLETE_TYPE_P (TREE_TYPE (field))
6283 && integer_zerop (TYPE_SIZE (TREE_TYPE (field)))
6284 && (TREE_CODE (constructor_type) == ARRAY_TYPE
6285 || TREE_CHAIN (field)))))
6288 value = digest_init (type, value, strict_string, require_constant_value);
6289 if (value == error_mark_node)
6291 constructor_erroneous = 1;
6295 /* If this element doesn't come next in sequence,
6296 put it on constructor_pending_elts. */
6297 if (TREE_CODE (constructor_type) == ARRAY_TYPE
6298 && (!constructor_incremental
6299 || !tree_int_cst_equal (field, constructor_unfilled_index)))
6301 if (constructor_incremental
6302 && tree_int_cst_lt (field, constructor_unfilled_index))
6303 set_nonincremental_init ();
6305 add_pending_init (field, value);
6308 else if (TREE_CODE (constructor_type) == RECORD_TYPE
6309 && (!constructor_incremental
6310 || field != constructor_unfilled_fields))
6312 /* We do this for records but not for unions. In a union,
6313 no matter which field is specified, it can be initialized
6314 right away since it starts at the beginning of the union. */
6315 if (constructor_incremental)
6317 if (!constructor_unfilled_fields)
6318 set_nonincremental_init ();
6321 tree bitpos, unfillpos;
6323 bitpos = bit_position (field);
6324 unfillpos = bit_position (constructor_unfilled_fields);
6326 if (tree_int_cst_lt (bitpos, unfillpos))
6327 set_nonincremental_init ();
6331 add_pending_init (field, value);
6334 else if (TREE_CODE (constructor_type) == UNION_TYPE
6335 && !VEC_empty (constructor_elt, constructor_elements))
6337 if (TREE_SIDE_EFFECTS (VEC_last (constructor_elt,
6338 constructor_elements)->value))
6339 warning_init ("initialized field with side-effects overwritten");
6340 else if (warn_override_init)
6341 warning_init ("initialized field overwritten");
6343 /* We can have just one union field set. */
6344 constructor_elements = 0;
6347 /* Otherwise, output this element either to
6348 constructor_elements or to the assembler file. */
6350 celt = VEC_safe_push (constructor_elt, gc, constructor_elements, NULL);
6351 celt->index = field;
6352 celt->value = value;
6354 /* Advance the variable that indicates sequential elements output. */
6355 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6356 constructor_unfilled_index
6357 = size_binop (PLUS_EXPR, constructor_unfilled_index,
6359 else if (TREE_CODE (constructor_type) == RECORD_TYPE)
6361 constructor_unfilled_fields
6362 = TREE_CHAIN (constructor_unfilled_fields);
6364 /* Skip any nameless bit fields. */
6365 while (constructor_unfilled_fields != 0
6366 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
6367 && DECL_NAME (constructor_unfilled_fields) == 0)
6368 constructor_unfilled_fields =
6369 TREE_CHAIN (constructor_unfilled_fields);
6371 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6372 constructor_unfilled_fields = 0;
6374 /* Now output any pending elements which have become next. */
6376 output_pending_init_elements (0);
6379 /* Output any pending elements which have become next.
6380 As we output elements, constructor_unfilled_{fields,index}
6381 advances, which may cause other elements to become next;
6382 if so, they too are output.
6384 If ALL is 0, we return when there are
6385 no more pending elements to output now.
6387 If ALL is 1, we output space as necessary so that
6388 we can output all the pending elements. */
6391 output_pending_init_elements (int all)
6393 struct init_node *elt = constructor_pending_elts;
6398 /* Look through the whole pending tree.
6399 If we find an element that should be output now,
6400 output it. Otherwise, set NEXT to the element
6401 that comes first among those still pending. */
6406 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6408 if (tree_int_cst_equal (elt->purpose,
6409 constructor_unfilled_index))
6410 output_init_element (elt->value, true,
6411 TREE_TYPE (constructor_type),
6412 constructor_unfilled_index, 0);
6413 else if (tree_int_cst_lt (constructor_unfilled_index,
6416 /* Advance to the next smaller node. */
6421 /* We have reached the smallest node bigger than the
6422 current unfilled index. Fill the space first. */
6423 next = elt->purpose;
6429 /* Advance to the next bigger node. */
6434 /* We have reached the biggest node in a subtree. Find
6435 the parent of it, which is the next bigger node. */
6436 while (elt->parent && elt->parent->right == elt)
6439 if (elt && tree_int_cst_lt (constructor_unfilled_index,
6442 next = elt->purpose;
6448 else if (TREE_CODE (constructor_type) == RECORD_TYPE
6449 || TREE_CODE (constructor_type) == UNION_TYPE)
6451 tree ctor_unfilled_bitpos, elt_bitpos;
6453 /* If the current record is complete we are done. */
6454 if (constructor_unfilled_fields == 0)
6457 ctor_unfilled_bitpos = bit_position (constructor_unfilled_fields);
6458 elt_bitpos = bit_position (elt->purpose);
6459 /* We can't compare fields here because there might be empty
6460 fields in between. */
6461 if (tree_int_cst_equal (elt_bitpos, ctor_unfilled_bitpos))
6463 constructor_unfilled_fields = elt->purpose;
6464 output_init_element (elt->value, true, TREE_TYPE (elt->purpose),
6467 else if (tree_int_cst_lt (ctor_unfilled_bitpos, elt_bitpos))
6469 /* Advance to the next smaller node. */
6474 /* We have reached the smallest node bigger than the
6475 current unfilled field. Fill the space first. */
6476 next = elt->purpose;
6482 /* Advance to the next bigger node. */
6487 /* We have reached the biggest node in a subtree. Find
6488 the parent of it, which is the next bigger node. */
6489 while (elt->parent && elt->parent->right == elt)
6493 && (tree_int_cst_lt (ctor_unfilled_bitpos,
6494 bit_position (elt->purpose))))
6496 next = elt->purpose;
6504 /* Ordinarily return, but not if we want to output all
6505 and there are elements left. */
6506 if (!(all && next != 0))
6509 /* If it's not incremental, just skip over the gap, so that after
6510 jumping to retry we will output the next successive element. */
6511 if (TREE_CODE (constructor_type) == RECORD_TYPE
6512 || TREE_CODE (constructor_type) == UNION_TYPE)
6513 constructor_unfilled_fields = next;
6514 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6515 constructor_unfilled_index = next;
6517 /* ELT now points to the node in the pending tree with the next
6518 initializer to output. */
6522 /* Add one non-braced element to the current constructor level.
6523 This adjusts the current position within the constructor's type.
6524 This may also start or terminate implicit levels
6525 to handle a partly-braced initializer.
6527 Once this has found the correct level for the new element,
6528 it calls output_init_element. */
6531 process_init_element (struct c_expr value)
6533 tree orig_value = value.value;
6534 int string_flag = orig_value != 0 && TREE_CODE (orig_value) == STRING_CST;
6535 bool strict_string = value.original_code == STRING_CST;
6537 designator_depth = 0;
6538 designator_erroneous = 0;
6540 /* Handle superfluous braces around string cst as in
6541 char x[] = {"foo"}; */
6544 && TREE_CODE (constructor_type) == ARRAY_TYPE
6545 && INTEGRAL_TYPE_P (TREE_TYPE (constructor_type))
6546 && integer_zerop (constructor_unfilled_index))
6548 if (constructor_stack->replacement_value.value)
6549 error_init ("excess elements in char array initializer");
6550 constructor_stack->replacement_value = value;
6554 if (constructor_stack->replacement_value.value != 0)
6556 error_init ("excess elements in struct initializer");
6560 /* Ignore elements of a brace group if it is entirely superfluous
6561 and has already been diagnosed. */
6562 if (constructor_type == 0)
6565 /* If we've exhausted any levels that didn't have braces,
6567 while (constructor_stack->implicit)
6569 if ((TREE_CODE (constructor_type) == RECORD_TYPE
6570 || TREE_CODE (constructor_type) == UNION_TYPE)
6571 && constructor_fields == 0)
6572 process_init_element (pop_init_level (1));
6573 else if (TREE_CODE (constructor_type) == ARRAY_TYPE
6574 && (constructor_max_index == 0
6575 || tree_int_cst_lt (constructor_max_index,
6576 constructor_index)))
6577 process_init_element (pop_init_level (1));
6582 /* In the case of [LO ... HI] = VALUE, only evaluate VALUE once. */
6583 if (constructor_range_stack)
6585 /* If value is a compound literal and we'll be just using its
6586 content, don't put it into a SAVE_EXPR. */
6587 if (TREE_CODE (value.value) != COMPOUND_LITERAL_EXPR
6588 || !require_constant_value
6590 value.value = save_expr (value.value);
6595 if (TREE_CODE (constructor_type) == RECORD_TYPE)
6598 enum tree_code fieldcode;
6600 if (constructor_fields == 0)
6602 pedwarn_init ("excess elements in struct initializer");
6606 fieldtype = TREE_TYPE (constructor_fields);
6607 if (fieldtype != error_mark_node)
6608 fieldtype = TYPE_MAIN_VARIANT (fieldtype);
6609 fieldcode = TREE_CODE (fieldtype);
6611 /* Error for non-static initialization of a flexible array member. */
6612 if (fieldcode == ARRAY_TYPE
6613 && !require_constant_value
6614 && TYPE_SIZE (fieldtype) == NULL_TREE
6615 && TREE_CHAIN (constructor_fields) == NULL_TREE)
6617 error_init ("non-static initialization of a flexible array member");
6621 /* Accept a string constant to initialize a subarray. */
6622 if (value.value != 0
6623 && fieldcode == ARRAY_TYPE
6624 && INTEGRAL_TYPE_P (TREE_TYPE (fieldtype))
6626 value.value = orig_value;
6627 /* Otherwise, if we have come to a subaggregate,
6628 and we don't have an element of its type, push into it. */
6629 else if (value.value != 0
6630 && value.value != error_mark_node
6631 && TYPE_MAIN_VARIANT (TREE_TYPE (value.value)) != fieldtype
6632 && (fieldcode == RECORD_TYPE || fieldcode == ARRAY_TYPE
6633 || fieldcode == UNION_TYPE))
6635 push_init_level (1);
6641 push_member_name (constructor_fields);
6642 output_init_element (value.value, strict_string,
6643 fieldtype, constructor_fields, 1);
6644 RESTORE_SPELLING_DEPTH (constructor_depth);
6647 /* Do the bookkeeping for an element that was
6648 directly output as a constructor. */
6650 /* For a record, keep track of end position of last field. */
6651 if (DECL_SIZE (constructor_fields))
6652 constructor_bit_index
6653 = size_binop (PLUS_EXPR,
6654 bit_position (constructor_fields),
6655 DECL_SIZE (constructor_fields));
6657 /* If the current field was the first one not yet written out,
6658 it isn't now, so update. */
6659 if (constructor_unfilled_fields == constructor_fields)
6661 constructor_unfilled_fields = TREE_CHAIN (constructor_fields);
6662 /* Skip any nameless bit fields. */
6663 while (constructor_unfilled_fields != 0
6664 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
6665 && DECL_NAME (constructor_unfilled_fields) == 0)
6666 constructor_unfilled_fields =
6667 TREE_CHAIN (constructor_unfilled_fields);
6671 constructor_fields = TREE_CHAIN (constructor_fields);
6672 /* Skip any nameless bit fields at the beginning. */
6673 while (constructor_fields != 0
6674 && DECL_C_BIT_FIELD (constructor_fields)
6675 && DECL_NAME (constructor_fields) == 0)
6676 constructor_fields = TREE_CHAIN (constructor_fields);
6678 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6681 enum tree_code fieldcode;
6683 if (constructor_fields == 0)
6685 pedwarn_init ("excess elements in union initializer");
6689 fieldtype = TREE_TYPE (constructor_fields);
6690 if (fieldtype != error_mark_node)
6691 fieldtype = TYPE_MAIN_VARIANT (fieldtype);
6692 fieldcode = TREE_CODE (fieldtype);
6694 /* Warn that traditional C rejects initialization of unions.
6695 We skip the warning if the value is zero. This is done
6696 under the assumption that the zero initializer in user
6697 code appears conditioned on e.g. __STDC__ to avoid
6698 "missing initializer" warnings and relies on default
6699 initialization to zero in the traditional C case.
6700 We also skip the warning if the initializer is designated,
6701 again on the assumption that this must be conditional on
6702 __STDC__ anyway (and we've already complained about the
6703 member-designator already). */
6704 if (!in_system_header && !constructor_designated
6705 && !(value.value && (integer_zerop (value.value)
6706 || real_zerop (value.value))))
6707 warning (OPT_Wtraditional, "traditional C rejects initialization "
6710 /* Accept a string constant to initialize a subarray. */
6711 if (value.value != 0
6712 && fieldcode == ARRAY_TYPE
6713 && INTEGRAL_TYPE_P (TREE_TYPE (fieldtype))
6715 value.value = orig_value;
6716 /* Otherwise, if we have come to a subaggregate,
6717 and we don't have an element of its type, push into it. */
6718 else if (value.value != 0
6719 && value.value != error_mark_node
6720 && TYPE_MAIN_VARIANT (TREE_TYPE (value.value)) != fieldtype
6721 && (fieldcode == RECORD_TYPE || fieldcode == ARRAY_TYPE
6722 || fieldcode == UNION_TYPE))
6724 push_init_level (1);
6730 push_member_name (constructor_fields);
6731 output_init_element (value.value, strict_string,
6732 fieldtype, constructor_fields, 1);
6733 RESTORE_SPELLING_DEPTH (constructor_depth);
6736 /* Do the bookkeeping for an element that was
6737 directly output as a constructor. */
6739 constructor_bit_index = DECL_SIZE (constructor_fields);
6740 constructor_unfilled_fields = TREE_CHAIN (constructor_fields);
6743 constructor_fields = 0;
6745 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6747 tree elttype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
6748 enum tree_code eltcode = TREE_CODE (elttype);
6750 /* Accept a string constant to initialize a subarray. */
6751 if (value.value != 0
6752 && eltcode == ARRAY_TYPE
6753 && INTEGRAL_TYPE_P (TREE_TYPE (elttype))
6755 value.value = orig_value;
6756 /* Otherwise, if we have come to a subaggregate,
6757 and we don't have an element of its type, push into it. */
6758 else if (value.value != 0
6759 && value.value != error_mark_node
6760 && TYPE_MAIN_VARIANT (TREE_TYPE (value.value)) != elttype
6761 && (eltcode == RECORD_TYPE || eltcode == ARRAY_TYPE
6762 || eltcode == UNION_TYPE))
6764 push_init_level (1);
6768 if (constructor_max_index != 0
6769 && (tree_int_cst_lt (constructor_max_index, constructor_index)
6770 || integer_all_onesp (constructor_max_index)))
6772 pedwarn_init ("excess elements in array initializer");
6776 /* Now output the actual element. */
6779 push_array_bounds (tree_low_cst (constructor_index, 1));
6780 output_init_element (value.value, strict_string,
6781 elttype, constructor_index, 1);
6782 RESTORE_SPELLING_DEPTH (constructor_depth);
6786 = size_binop (PLUS_EXPR, constructor_index, bitsize_one_node);
6789 /* If we are doing the bookkeeping for an element that was
6790 directly output as a constructor, we must update
6791 constructor_unfilled_index. */
6792 constructor_unfilled_index = constructor_index;
6794 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
6796 tree elttype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
6798 /* Do a basic check of initializer size. Note that vectors
6799 always have a fixed size derived from their type. */
6800 if (tree_int_cst_lt (constructor_max_index, constructor_index))
6802 pedwarn_init ("excess elements in vector initializer");
6806 /* Now output the actual element. */
6808 output_init_element (value.value, strict_string,
6809 elttype, constructor_index, 1);
6812 = size_binop (PLUS_EXPR, constructor_index, bitsize_one_node);
6815 /* If we are doing the bookkeeping for an element that was
6816 directly output as a constructor, we must update
6817 constructor_unfilled_index. */
6818 constructor_unfilled_index = constructor_index;
6821 /* Handle the sole element allowed in a braced initializer
6822 for a scalar variable. */
6823 else if (constructor_type != error_mark_node
6824 && constructor_fields == 0)
6826 pedwarn_init ("excess elements in scalar initializer");
6832 output_init_element (value.value, strict_string,
6833 constructor_type, NULL_TREE, 1);
6834 constructor_fields = 0;
6837 /* Handle range initializers either at this level or anywhere higher
6838 in the designator stack. */
6839 if (constructor_range_stack)
6841 struct constructor_range_stack *p, *range_stack;
6844 range_stack = constructor_range_stack;
6845 constructor_range_stack = 0;
6846 while (constructor_stack != range_stack->stack)
6848 gcc_assert (constructor_stack->implicit);
6849 process_init_element (pop_init_level (1));
6851 for (p = range_stack;
6852 !p->range_end || tree_int_cst_equal (p->index, p->range_end);
6855 gcc_assert (constructor_stack->implicit);
6856 process_init_element (pop_init_level (1));
6859 p->index = size_binop (PLUS_EXPR, p->index, bitsize_one_node);
6860 if (tree_int_cst_equal (p->index, p->range_end) && !p->prev)
6865 constructor_index = p->index;
6866 constructor_fields = p->fields;
6867 if (finish && p->range_end && p->index == p->range_start)
6875 push_init_level (2);
6876 p->stack = constructor_stack;
6877 if (p->range_end && tree_int_cst_equal (p->index, p->range_end))
6878 p->index = p->range_start;
6882 constructor_range_stack = range_stack;
6889 constructor_range_stack = 0;
6892 /* Build a complete asm-statement, whose components are a CV_QUALIFIER
6893 (guaranteed to be 'volatile' or null) and ARGS (represented using
6894 an ASM_EXPR node). */
6896 build_asm_stmt (tree cv_qualifier, tree args)
6898 if (!ASM_VOLATILE_P (args) && cv_qualifier)
6899 ASM_VOLATILE_P (args) = 1;
6900 return add_stmt (args);
6903 /* Build an asm-expr, whose components are a STRING, some OUTPUTS,
6904 some INPUTS, and some CLOBBERS. The latter three may be NULL.
6905 SIMPLE indicates whether there was anything at all after the
6906 string in the asm expression -- asm("blah") and asm("blah" : )
6907 are subtly different. We use a ASM_EXPR node to represent this. */
6909 build_asm_expr (tree string, tree outputs, tree inputs, tree clobbers,
6915 const char *constraint;
6916 const char **oconstraints;
6917 bool allows_mem, allows_reg, is_inout;
6918 int ninputs, noutputs;
6920 ninputs = list_length (inputs);
6921 noutputs = list_length (outputs);
6922 oconstraints = (const char **) alloca (noutputs * sizeof (const char *));
6924 string = resolve_asm_operand_names (string, outputs, inputs);
6926 /* Remove output conversions that change the type but not the mode. */
6927 for (i = 0, tail = outputs; tail; ++i, tail = TREE_CHAIN (tail))
6929 tree output = TREE_VALUE (tail);
6931 /* ??? Really, this should not be here. Users should be using a
6932 proper lvalue, dammit. But there's a long history of using casts
6933 in the output operands. In cases like longlong.h, this becomes a
6934 primitive form of typechecking -- if the cast can be removed, then
6935 the output operand had a type of the proper width; otherwise we'll
6936 get an error. Gross, but ... */
6937 STRIP_NOPS (output);
6939 if (!lvalue_or_else (output, lv_asm))
6940 output = error_mark_node;
6942 if (output != error_mark_node
6943 && (TREE_READONLY (output)
6944 || TYPE_READONLY (TREE_TYPE (output))
6945 || ((TREE_CODE (TREE_TYPE (output)) == RECORD_TYPE
6946 || TREE_CODE (TREE_TYPE (output)) == UNION_TYPE)
6947 && C_TYPE_FIELDS_READONLY (TREE_TYPE (output)))))
6948 readonly_error (output, lv_asm);
6950 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
6951 oconstraints[i] = constraint;
6953 if (parse_output_constraint (&constraint, i, ninputs, noutputs,
6954 &allows_mem, &allows_reg, &is_inout))
6956 /* If the operand is going to end up in memory,
6957 mark it addressable. */
6958 if (!allows_reg && !c_mark_addressable (output))
6959 output = error_mark_node;
6962 output = error_mark_node;
6964 TREE_VALUE (tail) = output;
6967 for (i = 0, tail = inputs; tail; ++i, tail = TREE_CHAIN (tail))
6971 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
6972 input = TREE_VALUE (tail);
6974 if (parse_input_constraint (&constraint, i, ninputs, noutputs, 0,
6975 oconstraints, &allows_mem, &allows_reg))
6977 /* If the operand is going to end up in memory,
6978 mark it addressable. */
6979 if (!allows_reg && allows_mem)
6981 /* Strip the nops as we allow this case. FIXME, this really
6982 should be rejected or made deprecated. */
6984 if (!c_mark_addressable (input))
6985 input = error_mark_node;
6989 input = error_mark_node;
6991 TREE_VALUE (tail) = input;
6994 args = build_stmt (ASM_EXPR, string, outputs, inputs, clobbers);
6996 /* asm statements without outputs, including simple ones, are treated
6998 ASM_INPUT_P (args) = simple;
6999 ASM_VOLATILE_P (args) = (noutputs == 0);
7004 /* Generate a goto statement to LABEL. */
7007 c_finish_goto_label (tree label)
7009 tree decl = lookup_label (label);
7013 if (C_DECL_UNJUMPABLE_STMT_EXPR (decl))
7015 error ("jump into statement expression");
7019 if (C_DECL_UNJUMPABLE_VM (decl))
7021 error ("jump into scope of identifier with variably modified type");
7025 if (!C_DECL_UNDEFINABLE_STMT_EXPR (decl))
7027 /* No jump from outside this statement expression context, so
7028 record that there is a jump from within this context. */
7029 struct c_label_list *nlist;
7030 nlist = XOBNEW (&parser_obstack, struct c_label_list);
7031 nlist->next = label_context_stack_se->labels_used;
7032 nlist->label = decl;
7033 label_context_stack_se->labels_used = nlist;
7036 if (!C_DECL_UNDEFINABLE_VM (decl))
7038 /* No jump from outside this context context of identifiers with
7039 variably modified type, so record that there is a jump from
7040 within this context. */
7041 struct c_label_list *nlist;
7042 nlist = XOBNEW (&parser_obstack, struct c_label_list);
7043 nlist->next = label_context_stack_vm->labels_used;
7044 nlist->label = decl;
7045 label_context_stack_vm->labels_used = nlist;
7048 TREE_USED (decl) = 1;
7049 return add_stmt (build1 (GOTO_EXPR, void_type_node, decl));
7052 /* Generate a computed goto statement to EXPR. */
7055 c_finish_goto_ptr (tree expr)
7058 pedwarn ("ISO C forbids %<goto *expr;%>");
7059 expr = convert (ptr_type_node, expr);
7060 return add_stmt (build1 (GOTO_EXPR, void_type_node, expr));
7063 /* Generate a C `return' statement. RETVAL is the expression for what
7064 to return, or a null pointer for `return;' with no value. */
7067 c_finish_return (tree retval)
7069 tree valtype = TREE_TYPE (TREE_TYPE (current_function_decl)), ret_stmt;
7070 bool no_warning = false;
7072 if (TREE_THIS_VOLATILE (current_function_decl))
7073 warning (0, "function declared %<noreturn%> has a %<return%> statement");
7077 current_function_returns_null = 1;
7078 if ((warn_return_type || flag_isoc99)
7079 && valtype != 0 && TREE_CODE (valtype) != VOID_TYPE)
7081 pedwarn_c99 ("%<return%> with no value, in "
7082 "function returning non-void");
7086 else if (valtype == 0 || TREE_CODE (valtype) == VOID_TYPE)
7088 current_function_returns_null = 1;
7089 if (TREE_CODE (TREE_TYPE (retval)) != VOID_TYPE)
7090 pedwarn ("%<return%> with a value, in function returning void");
7092 pedwarn ("ISO C forbids %<return%> with expression, in function returning void");
7096 tree t = convert_for_assignment (valtype, retval, ic_return,
7097 NULL_TREE, NULL_TREE, 0);
7098 tree res = DECL_RESULT (current_function_decl);
7101 current_function_returns_value = 1;
7102 if (t == error_mark_node)
7105 inner = t = convert (TREE_TYPE (res), t);
7107 /* Strip any conversions, additions, and subtractions, and see if
7108 we are returning the address of a local variable. Warn if so. */
7111 switch (TREE_CODE (inner))
7113 case NOP_EXPR: case NON_LVALUE_EXPR: case CONVERT_EXPR:
7115 inner = TREE_OPERAND (inner, 0);
7119 /* If the second operand of the MINUS_EXPR has a pointer
7120 type (or is converted from it), this may be valid, so
7121 don't give a warning. */
7123 tree op1 = TREE_OPERAND (inner, 1);
7125 while (!POINTER_TYPE_P (TREE_TYPE (op1))
7126 && (TREE_CODE (op1) == NOP_EXPR
7127 || TREE_CODE (op1) == NON_LVALUE_EXPR
7128 || TREE_CODE (op1) == CONVERT_EXPR))
7129 op1 = TREE_OPERAND (op1, 0);
7131 if (POINTER_TYPE_P (TREE_TYPE (op1)))
7134 inner = TREE_OPERAND (inner, 0);
7139 inner = TREE_OPERAND (inner, 0);
7141 while (REFERENCE_CLASS_P (inner)
7142 && TREE_CODE (inner) != INDIRECT_REF)
7143 inner = TREE_OPERAND (inner, 0);
7146 && !DECL_EXTERNAL (inner)
7147 && !TREE_STATIC (inner)
7148 && DECL_CONTEXT (inner) == current_function_decl)
7149 warning (0, "function returns address of local variable");
7159 retval = build2 (MODIFY_EXPR, TREE_TYPE (res), res, t);
7162 ret_stmt = build_stmt (RETURN_EXPR, retval);
7163 TREE_NO_WARNING (ret_stmt) |= no_warning;
7164 return add_stmt (ret_stmt);
7168 /* The SWITCH_EXPR being built. */
7171 /* The original type of the testing expression, i.e. before the
7172 default conversion is applied. */
7175 /* A splay-tree mapping the low element of a case range to the high
7176 element, or NULL_TREE if there is no high element. Used to
7177 determine whether or not a new case label duplicates an old case
7178 label. We need a tree, rather than simply a hash table, because
7179 of the GNU case range extension. */
7182 /* Number of nested statement expressions within this switch
7183 statement; if nonzero, case and default labels may not
7185 unsigned int blocked_stmt_expr;
7187 /* Scope of outermost declarations of identifiers with variably
7188 modified type within this switch statement; if nonzero, case and
7189 default labels may not appear. */
7190 unsigned int blocked_vm;
7192 /* The next node on the stack. */
7193 struct c_switch *next;
7196 /* A stack of the currently active switch statements. The innermost
7197 switch statement is on the top of the stack. There is no need to
7198 mark the stack for garbage collection because it is only active
7199 during the processing of the body of a function, and we never
7200 collect at that point. */
7202 struct c_switch *c_switch_stack;
7204 /* Start a C switch statement, testing expression EXP. Return the new
7208 c_start_case (tree exp)
7210 tree orig_type = error_mark_node;
7211 struct c_switch *cs;
7213 if (exp != error_mark_node)
7215 orig_type = TREE_TYPE (exp);
7217 if (!INTEGRAL_TYPE_P (orig_type))
7219 if (orig_type != error_mark_node)
7221 error ("switch quantity not an integer");
7222 orig_type = error_mark_node;
7224 exp = integer_zero_node;
7228 tree type = TYPE_MAIN_VARIANT (orig_type);
7230 if (!in_system_header
7231 && (type == long_integer_type_node
7232 || type == long_unsigned_type_node))
7233 warning (OPT_Wtraditional, "%<long%> switch expression not "
7234 "converted to %<int%> in ISO C");
7236 exp = default_conversion (exp);
7240 /* Add this new SWITCH_EXPR to the stack. */
7241 cs = XNEW (struct c_switch);
7242 cs->switch_expr = build3 (SWITCH_EXPR, orig_type, exp, NULL_TREE, NULL_TREE);
7243 cs->orig_type = orig_type;
7244 cs->cases = splay_tree_new (case_compare, NULL, NULL);
7245 cs->blocked_stmt_expr = 0;
7247 cs->next = c_switch_stack;
7248 c_switch_stack = cs;
7250 return add_stmt (cs->switch_expr);
7253 /* Process a case label. */
7256 do_case (tree low_value, tree high_value)
7258 tree label = NULL_TREE;
7260 if (c_switch_stack && !c_switch_stack->blocked_stmt_expr
7261 && !c_switch_stack->blocked_vm)
7263 label = c_add_case_label (c_switch_stack->cases,
7264 SWITCH_COND (c_switch_stack->switch_expr),
7265 c_switch_stack->orig_type,
7266 low_value, high_value);
7267 if (label == error_mark_node)
7270 else if (c_switch_stack && c_switch_stack->blocked_stmt_expr)
7273 error ("case label in statement expression not containing "
7274 "enclosing switch statement");
7276 error ("%<default%> label in statement expression not containing "
7277 "enclosing switch statement");
7279 else if (c_switch_stack && c_switch_stack->blocked_vm)
7282 error ("case label in scope of identifier with variably modified "
7283 "type not containing enclosing switch statement");
7285 error ("%<default%> label in scope of identifier with variably "
7286 "modified type not containing enclosing switch statement");
7289 error ("case label not within a switch statement");
7291 error ("%<default%> label not within a switch statement");
7296 /* Finish the switch statement. */
7299 c_finish_case (tree body)
7301 struct c_switch *cs = c_switch_stack;
7302 location_t switch_location;
7304 SWITCH_BODY (cs->switch_expr) = body;
7306 /* We must not be within a statement expression nested in the switch
7307 at this point; we might, however, be within the scope of an
7308 identifier with variably modified type nested in the switch. */
7309 gcc_assert (!cs->blocked_stmt_expr);
7311 /* Emit warnings as needed. */
7312 if (EXPR_HAS_LOCATION (cs->switch_expr))
7313 switch_location = EXPR_LOCATION (cs->switch_expr);
7315 switch_location = input_location;
7316 c_do_switch_warnings (cs->cases, switch_location,
7317 TREE_TYPE (cs->switch_expr),
7318 SWITCH_COND (cs->switch_expr));
7320 /* Pop the stack. */
7321 c_switch_stack = cs->next;
7322 splay_tree_delete (cs->cases);
7326 /* Emit an if statement. IF_LOCUS is the location of the 'if'. COND,
7327 THEN_BLOCK and ELSE_BLOCK are expressions to be used; ELSE_BLOCK
7328 may be null. NESTED_IF is true if THEN_BLOCK contains another IF
7329 statement, and was not surrounded with parenthesis. */
7332 c_finish_if_stmt (location_t if_locus, tree cond, tree then_block,
7333 tree else_block, bool nested_if)
7337 /* Diagnose an ambiguous else if if-then-else is nested inside if-then. */
7338 if (warn_parentheses && nested_if && else_block == NULL)
7340 tree inner_if = then_block;
7342 /* We know from the grammar productions that there is an IF nested
7343 within THEN_BLOCK. Due to labels and c99 conditional declarations,
7344 it might not be exactly THEN_BLOCK, but should be the last
7345 non-container statement within. */
7347 switch (TREE_CODE (inner_if))
7352 inner_if = BIND_EXPR_BODY (inner_if);
7354 case STATEMENT_LIST:
7355 inner_if = expr_last (then_block);
7357 case TRY_FINALLY_EXPR:
7358 case TRY_CATCH_EXPR:
7359 inner_if = TREE_OPERAND (inner_if, 0);
7366 if (COND_EXPR_ELSE (inner_if))
7367 warning (OPT_Wparentheses,
7368 "%Hsuggest explicit braces to avoid ambiguous %<else%>",
7372 empty_if_body_warning (then_block, else_block);
7374 stmt = build3 (COND_EXPR, void_type_node, cond, then_block, else_block);
7375 SET_EXPR_LOCATION (stmt, if_locus);
7379 /* Emit a general-purpose loop construct. START_LOCUS is the location of
7380 the beginning of the loop. COND is the loop condition. COND_IS_FIRST
7381 is false for DO loops. INCR is the FOR increment expression. BODY is
7382 the statement controlled by the loop. BLAB is the break label. CLAB is
7383 the continue label. Everything is allowed to be NULL. */
7386 c_finish_loop (location_t start_locus, tree cond, tree incr, tree body,
7387 tree blab, tree clab, bool cond_is_first)
7389 tree entry = NULL, exit = NULL, t;
7391 /* If the condition is zero don't generate a loop construct. */
7392 if (cond && integer_zerop (cond))
7396 t = build_and_jump (&blab);
7397 SET_EXPR_LOCATION (t, start_locus);
7403 tree top = build1 (LABEL_EXPR, void_type_node, NULL_TREE);
7405 /* If we have an exit condition, then we build an IF with gotos either
7406 out of the loop, or to the top of it. If there's no exit condition,
7407 then we just build a jump back to the top. */
7408 exit = build_and_jump (&LABEL_EXPR_LABEL (top));
7410 if (cond && !integer_nonzerop (cond))
7412 /* Canonicalize the loop condition to the end. This means
7413 generating a branch to the loop condition. Reuse the
7414 continue label, if possible. */
7419 entry = build1 (LABEL_EXPR, void_type_node, NULL_TREE);
7420 t = build_and_jump (&LABEL_EXPR_LABEL (entry));
7423 t = build1 (GOTO_EXPR, void_type_node, clab);
7424 SET_EXPR_LOCATION (t, start_locus);
7428 t = build_and_jump (&blab);
7429 exit = fold_build3 (COND_EXPR, void_type_node, cond, exit, t);
7431 SET_EXPR_LOCATION (exit, start_locus);
7433 SET_EXPR_LOCATION (exit, input_location);
7442 add_stmt (build1 (LABEL_EXPR, void_type_node, clab));
7450 add_stmt (build1 (LABEL_EXPR, void_type_node, blab));
7454 c_finish_bc_stmt (tree *label_p, bool is_break)
7457 tree label = *label_p;
7459 /* In switch statements break is sometimes stylistically used after
7460 a return statement. This can lead to spurious warnings about
7461 control reaching the end of a non-void function when it is
7462 inlined. Note that we are calling block_may_fallthru with
7463 language specific tree nodes; this works because
7464 block_may_fallthru returns true when given something it does not
7466 skip = !block_may_fallthru (cur_stmt_list);
7471 *label_p = label = create_artificial_label ();
7473 else if (TREE_CODE (label) == LABEL_DECL)
7475 else switch (TREE_INT_CST_LOW (label))
7479 error ("break statement not within loop or switch");
7481 error ("continue statement not within a loop");
7485 gcc_assert (is_break);
7486 error ("break statement used with OpenMP for loop");
7496 return add_stmt (build1 (GOTO_EXPR, void_type_node, label));
7499 /* A helper routine for c_process_expr_stmt and c_finish_stmt_expr. */
7502 emit_side_effect_warnings (tree expr)
7504 if (expr == error_mark_node)
7506 else if (!TREE_SIDE_EFFECTS (expr))
7508 if (!VOID_TYPE_P (TREE_TYPE (expr)) && !TREE_NO_WARNING (expr))
7509 warning (OPT_Wunused_value, "%Hstatement with no effect",
7510 EXPR_HAS_LOCATION (expr) ? EXPR_LOCUS (expr) : &input_location);
7513 warn_if_unused_value (expr, input_location);
7516 /* Process an expression as if it were a complete statement. Emit
7517 diagnostics, but do not call ADD_STMT. */
7520 c_process_expr_stmt (tree expr)
7525 if (warn_sequence_point)
7526 verify_sequence_points (expr);
7528 if (TREE_TYPE (expr) != error_mark_node
7529 && !COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (expr))
7530 && TREE_CODE (TREE_TYPE (expr)) != ARRAY_TYPE)
7531 error ("expression statement has incomplete type");
7533 /* If we're not processing a statement expression, warn about unused values.
7534 Warnings for statement expressions will be emitted later, once we figure
7535 out which is the result. */
7536 if (!STATEMENT_LIST_STMT_EXPR (cur_stmt_list)
7537 && warn_unused_value)
7538 emit_side_effect_warnings (expr);
7540 /* If the expression is not of a type to which we cannot assign a line
7541 number, wrap the thing in a no-op NOP_EXPR. */
7542 if (DECL_P (expr) || CONSTANT_CLASS_P (expr))
7543 expr = build1 (NOP_EXPR, TREE_TYPE (expr), expr);
7545 if (CAN_HAVE_LOCATION_P (expr))
7546 SET_EXPR_LOCATION (expr, input_location);
7551 /* Emit an expression as a statement. */
7554 c_finish_expr_stmt (tree expr)
7557 return add_stmt (c_process_expr_stmt (expr));
7562 /* Do the opposite and emit a statement as an expression. To begin,
7563 create a new binding level and return it. */
7566 c_begin_stmt_expr (void)
7569 struct c_label_context_se *nstack;
7570 struct c_label_list *glist;
7572 /* We must force a BLOCK for this level so that, if it is not expanded
7573 later, there is a way to turn off the entire subtree of blocks that
7574 are contained in it. */
7576 ret = c_begin_compound_stmt (true);
7579 c_switch_stack->blocked_stmt_expr++;
7580 gcc_assert (c_switch_stack->blocked_stmt_expr != 0);
7582 for (glist = label_context_stack_se->labels_used;
7584 glist = glist->next)
7586 C_DECL_UNDEFINABLE_STMT_EXPR (glist->label) = 1;
7588 nstack = XOBNEW (&parser_obstack, struct c_label_context_se);
7589 nstack->labels_def = NULL;
7590 nstack->labels_used = NULL;
7591 nstack->next = label_context_stack_se;
7592 label_context_stack_se = nstack;
7594 /* Mark the current statement list as belonging to a statement list. */
7595 STATEMENT_LIST_STMT_EXPR (ret) = 1;
7601 c_finish_stmt_expr (tree body)
7603 tree last, type, tmp, val;
7605 struct c_label_list *dlist, *glist, *glist_prev = NULL;
7607 body = c_end_compound_stmt (body, true);
7610 gcc_assert (c_switch_stack->blocked_stmt_expr != 0);
7611 c_switch_stack->blocked_stmt_expr--;
7613 /* It is no longer possible to jump to labels defined within this
7614 statement expression. */
7615 for (dlist = label_context_stack_se->labels_def;
7617 dlist = dlist->next)
7619 C_DECL_UNJUMPABLE_STMT_EXPR (dlist->label) = 1;
7621 /* It is again possible to define labels with a goto just outside
7622 this statement expression. */
7623 for (glist = label_context_stack_se->next->labels_used;
7625 glist = glist->next)
7627 C_DECL_UNDEFINABLE_STMT_EXPR (glist->label) = 0;
7630 if (glist_prev != NULL)
7631 glist_prev->next = label_context_stack_se->labels_used;
7633 label_context_stack_se->next->labels_used
7634 = label_context_stack_se->labels_used;
7635 label_context_stack_se = label_context_stack_se->next;
7637 /* Locate the last statement in BODY. See c_end_compound_stmt
7638 about always returning a BIND_EXPR. */
7639 last_p = &BIND_EXPR_BODY (body);
7640 last = BIND_EXPR_BODY (body);
7643 if (TREE_CODE (last) == STATEMENT_LIST)
7645 tree_stmt_iterator i;
7647 /* This can happen with degenerate cases like ({ }). No value. */
7648 if (!TREE_SIDE_EFFECTS (last))
7651 /* If we're supposed to generate side effects warnings, process
7652 all of the statements except the last. */
7653 if (warn_unused_value)
7655 for (i = tsi_start (last); !tsi_one_before_end_p (i); tsi_next (&i))
7656 emit_side_effect_warnings (tsi_stmt (i));
7659 i = tsi_last (last);
7660 last_p = tsi_stmt_ptr (i);
7664 /* If the end of the list is exception related, then the list was split
7665 by a call to push_cleanup. Continue searching. */
7666 if (TREE_CODE (last) == TRY_FINALLY_EXPR
7667 || TREE_CODE (last) == TRY_CATCH_EXPR)
7669 last_p = &TREE_OPERAND (last, 0);
7671 goto continue_searching;
7674 /* In the case that the BIND_EXPR is not necessary, return the
7675 expression out from inside it. */
7676 if (last == error_mark_node
7677 || (last == BIND_EXPR_BODY (body)
7678 && BIND_EXPR_VARS (body) == NULL))
7680 /* Do not warn if the return value of a statement expression is
7682 if (CAN_HAVE_LOCATION_P (last))
7683 TREE_NO_WARNING (last) = 1;
7687 /* Extract the type of said expression. */
7688 type = TREE_TYPE (last);
7690 /* If we're not returning a value at all, then the BIND_EXPR that
7691 we already have is a fine expression to return. */
7692 if (!type || VOID_TYPE_P (type))
7695 /* Now that we've located the expression containing the value, it seems
7696 silly to make voidify_wrapper_expr repeat the process. Create a
7697 temporary of the appropriate type and stick it in a TARGET_EXPR. */
7698 tmp = create_tmp_var_raw (type, NULL);
7700 /* Unwrap a no-op NOP_EXPR as added by c_finish_expr_stmt. This avoids
7701 tree_expr_nonnegative_p giving up immediately. */
7703 if (TREE_CODE (val) == NOP_EXPR
7704 && TREE_TYPE (val) == TREE_TYPE (TREE_OPERAND (val, 0)))
7705 val = TREE_OPERAND (val, 0);
7707 *last_p = build2 (MODIFY_EXPR, void_type_node, tmp, val);
7708 SET_EXPR_LOCUS (*last_p, EXPR_LOCUS (last));
7710 return build4 (TARGET_EXPR, type, tmp, body, NULL_TREE, NULL_TREE);
7713 /* Begin the scope of an identifier of variably modified type, scope
7714 number SCOPE. Jumping from outside this scope to inside it is not
7718 c_begin_vm_scope (unsigned int scope)
7720 struct c_label_context_vm *nstack;
7721 struct c_label_list *glist;
7723 gcc_assert (scope > 0);
7725 /* At file_scope, we don't have to do any processing. */
7726 if (label_context_stack_vm == NULL)
7729 if (c_switch_stack && !c_switch_stack->blocked_vm)
7730 c_switch_stack->blocked_vm = scope;
7731 for (glist = label_context_stack_vm->labels_used;
7733 glist = glist->next)
7735 C_DECL_UNDEFINABLE_VM (glist->label) = 1;
7737 nstack = XOBNEW (&parser_obstack, struct c_label_context_vm);
7738 nstack->labels_def = NULL;
7739 nstack->labels_used = NULL;
7740 nstack->scope = scope;
7741 nstack->next = label_context_stack_vm;
7742 label_context_stack_vm = nstack;
7745 /* End a scope which may contain identifiers of variably modified
7746 type, scope number SCOPE. */
7749 c_end_vm_scope (unsigned int scope)
7751 if (label_context_stack_vm == NULL)
7753 if (c_switch_stack && c_switch_stack->blocked_vm == scope)
7754 c_switch_stack->blocked_vm = 0;
7755 /* We may have a number of nested scopes of identifiers with
7756 variably modified type, all at this depth. Pop each in turn. */
7757 while (label_context_stack_vm->scope == scope)
7759 struct c_label_list *dlist, *glist, *glist_prev = NULL;
7761 /* It is no longer possible to jump to labels defined within this
7763 for (dlist = label_context_stack_vm->labels_def;
7765 dlist = dlist->next)
7767 C_DECL_UNJUMPABLE_VM (dlist->label) = 1;
7769 /* It is again possible to define labels with a goto just outside
7771 for (glist = label_context_stack_vm->next->labels_used;
7773 glist = glist->next)
7775 C_DECL_UNDEFINABLE_VM (glist->label) = 0;
7778 if (glist_prev != NULL)
7779 glist_prev->next = label_context_stack_vm->labels_used;
7781 label_context_stack_vm->next->labels_used
7782 = label_context_stack_vm->labels_used;
7783 label_context_stack_vm = label_context_stack_vm->next;
7787 /* Begin and end compound statements. This is as simple as pushing
7788 and popping new statement lists from the tree. */
7791 c_begin_compound_stmt (bool do_scope)
7793 tree stmt = push_stmt_list ();
7800 c_end_compound_stmt (tree stmt, bool do_scope)
7806 if (c_dialect_objc ())
7807 objc_clear_super_receiver ();
7808 block = pop_scope ();
7811 stmt = pop_stmt_list (stmt);
7812 stmt = c_build_bind_expr (block, stmt);
7814 /* If this compound statement is nested immediately inside a statement
7815 expression, then force a BIND_EXPR to be created. Otherwise we'll
7816 do the wrong thing for ({ { 1; } }) or ({ 1; { } }). In particular,
7817 STATEMENT_LISTs merge, and thus we can lose track of what statement
7820 && STATEMENT_LIST_STMT_EXPR (cur_stmt_list)
7821 && TREE_CODE (stmt) != BIND_EXPR)
7823 stmt = build3 (BIND_EXPR, void_type_node, NULL, stmt, NULL);
7824 TREE_SIDE_EFFECTS (stmt) = 1;
7830 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
7831 when the current scope is exited. EH_ONLY is true when this is not
7832 meant to apply to normal control flow transfer. */
7835 push_cleanup (tree ARG_UNUSED (decl), tree cleanup, bool eh_only)
7837 enum tree_code code;
7841 code = eh_only ? TRY_CATCH_EXPR : TRY_FINALLY_EXPR;
7842 stmt = build_stmt (code, NULL, cleanup);
7844 stmt_expr = STATEMENT_LIST_STMT_EXPR (cur_stmt_list);
7845 list = push_stmt_list ();
7846 TREE_OPERAND (stmt, 0) = list;
7847 STATEMENT_LIST_STMT_EXPR (list) = stmt_expr;
7850 /* Build a binary-operation expression without default conversions.
7851 CODE is the kind of expression to build.
7852 This function differs from `build' in several ways:
7853 the data type of the result is computed and recorded in it,
7854 warnings are generated if arg data types are invalid,
7855 special handling for addition and subtraction of pointers is known,
7856 and some optimization is done (operations on narrow ints
7857 are done in the narrower type when that gives the same result).
7858 Constant folding is also done before the result is returned.
7860 Note that the operands will never have enumeral types, or function
7861 or array types, because either they will have the default conversions
7862 performed or they have both just been converted to some other type in which
7863 the arithmetic is to be done. */
7866 build_binary_op (enum tree_code code, tree orig_op0, tree orig_op1,
7870 enum tree_code code0, code1;
7872 const char *invalid_op_diag;
7874 /* Expression code to give to the expression when it is built.
7875 Normally this is CODE, which is what the caller asked for,
7876 but in some special cases we change it. */
7877 enum tree_code resultcode = code;
7879 /* Data type in which the computation is to be performed.
7880 In the simplest cases this is the common type of the arguments. */
7881 tree result_type = NULL;
7883 /* Nonzero means operands have already been type-converted
7884 in whatever way is necessary.
7885 Zero means they need to be converted to RESULT_TYPE. */
7888 /* Nonzero means create the expression with this type, rather than
7890 tree build_type = 0;
7892 /* Nonzero means after finally constructing the expression
7893 convert it to this type. */
7894 tree final_type = 0;
7896 /* Nonzero if this is an operation like MIN or MAX which can
7897 safely be computed in short if both args are promoted shorts.
7898 Also implies COMMON.
7899 -1 indicates a bitwise operation; this makes a difference
7900 in the exact conditions for when it is safe to do the operation
7901 in a narrower mode. */
7904 /* Nonzero if this is a comparison operation;
7905 if both args are promoted shorts, compare the original shorts.
7906 Also implies COMMON. */
7907 int short_compare = 0;
7909 /* Nonzero if this is a right-shift operation, which can be computed on the
7910 original short and then promoted if the operand is a promoted short. */
7911 int short_shift = 0;
7913 /* Nonzero means set RESULT_TYPE to the common type of the args. */
7916 /* True means types are compatible as far as ObjC is concerned. */
7921 op0 = default_conversion (orig_op0);
7922 op1 = default_conversion (orig_op1);
7930 type0 = TREE_TYPE (op0);
7931 type1 = TREE_TYPE (op1);
7933 /* The expression codes of the data types of the arguments tell us
7934 whether the arguments are integers, floating, pointers, etc. */
7935 code0 = TREE_CODE (type0);
7936 code1 = TREE_CODE (type1);
7938 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
7939 STRIP_TYPE_NOPS (op0);
7940 STRIP_TYPE_NOPS (op1);
7942 /* If an error was already reported for one of the arguments,
7943 avoid reporting another error. */
7945 if (code0 == ERROR_MARK || code1 == ERROR_MARK)
7946 return error_mark_node;
7948 if ((invalid_op_diag
7949 = targetm.invalid_binary_op (code, type0, type1)))
7951 error (invalid_op_diag);
7952 return error_mark_node;
7955 objc_ok = objc_compare_types (type0, type1, -3, NULL_TREE);
7960 /* Handle the pointer + int case. */
7961 if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
7962 return pointer_int_sum (PLUS_EXPR, op0, op1);
7963 else if (code1 == POINTER_TYPE && code0 == INTEGER_TYPE)
7964 return pointer_int_sum (PLUS_EXPR, op1, op0);
7970 /* Subtraction of two similar pointers.
7971 We must subtract them as integers, then divide by object size. */
7972 if (code0 == POINTER_TYPE && code1 == POINTER_TYPE
7973 && comp_target_types (type0, type1))
7974 return pointer_diff (op0, op1);
7975 /* Handle pointer minus int. Just like pointer plus int. */
7976 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
7977 return pointer_int_sum (MINUS_EXPR, op0, op1);
7986 case TRUNC_DIV_EXPR:
7988 case FLOOR_DIV_EXPR:
7989 case ROUND_DIV_EXPR:
7990 case EXACT_DIV_EXPR:
7991 warn_for_div_by_zero (op1);
7993 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
7994 || code0 == FIXED_POINT_TYPE
7995 || code0 == COMPLEX_TYPE || code0 == VECTOR_TYPE)
7996 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
7997 || code1 == FIXED_POINT_TYPE
7998 || code1 == COMPLEX_TYPE || code1 == VECTOR_TYPE))
8000 enum tree_code tcode0 = code0, tcode1 = code1;
8002 if (code0 == COMPLEX_TYPE || code0 == VECTOR_TYPE)
8003 tcode0 = TREE_CODE (TREE_TYPE (TREE_TYPE (op0)));
8004 if (code1 == COMPLEX_TYPE || code1 == VECTOR_TYPE)
8005 tcode1 = TREE_CODE (TREE_TYPE (TREE_TYPE (op1)));
8007 if (!((tcode0 == INTEGER_TYPE && tcode1 == INTEGER_TYPE)
8008 || (tcode0 == FIXED_POINT_TYPE && tcode1 == FIXED_POINT_TYPE)))
8009 resultcode = RDIV_EXPR;
8011 /* Although it would be tempting to shorten always here, that
8012 loses on some targets, since the modulo instruction is
8013 undefined if the quotient can't be represented in the
8014 computation mode. We shorten only if unsigned or if
8015 dividing by something we know != -1. */
8016 shorten = (TYPE_UNSIGNED (TREE_TYPE (orig_op0))
8017 || (TREE_CODE (op1) == INTEGER_CST
8018 && !integer_all_onesp (op1)));
8026 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
8028 /* Allow vector types which are not floating point types. */
8029 else if (code0 == VECTOR_TYPE
8030 && code1 == VECTOR_TYPE
8031 && !VECTOR_FLOAT_TYPE_P (type0)
8032 && !VECTOR_FLOAT_TYPE_P (type1))
8036 case TRUNC_MOD_EXPR:
8037 case FLOOR_MOD_EXPR:
8038 warn_for_div_by_zero (op1);
8040 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
8042 /* Although it would be tempting to shorten always here, that loses
8043 on some targets, since the modulo instruction is undefined if the
8044 quotient can't be represented in the computation mode. We shorten
8045 only if unsigned or if dividing by something we know != -1. */
8046 shorten = (TYPE_UNSIGNED (TREE_TYPE (orig_op0))
8047 || (TREE_CODE (op1) == INTEGER_CST
8048 && !integer_all_onesp (op1)));
8053 case TRUTH_ANDIF_EXPR:
8054 case TRUTH_ORIF_EXPR:
8055 case TRUTH_AND_EXPR:
8057 case TRUTH_XOR_EXPR:
8058 if ((code0 == INTEGER_TYPE || code0 == POINTER_TYPE
8059 || code0 == REAL_TYPE || code0 == COMPLEX_TYPE
8060 || code0 == FIXED_POINT_TYPE)
8061 && (code1 == INTEGER_TYPE || code1 == POINTER_TYPE
8062 || code1 == REAL_TYPE || code1 == COMPLEX_TYPE
8063 || code1 == FIXED_POINT_TYPE))
8065 /* Result of these operations is always an int,
8066 but that does not mean the operands should be
8067 converted to ints! */
8068 result_type = integer_type_node;
8069 op0 = c_common_truthvalue_conversion (op0);
8070 op1 = c_common_truthvalue_conversion (op1);
8075 /* Shift operations: result has same type as first operand;
8076 always convert second operand to int.
8077 Also set SHORT_SHIFT if shifting rightward. */
8080 if ((code0 == INTEGER_TYPE || code0 == FIXED_POINT_TYPE)
8081 && code1 == INTEGER_TYPE)
8083 if (TREE_CODE (op1) == INTEGER_CST && skip_evaluation == 0)
8085 if (tree_int_cst_sgn (op1) < 0)
8086 warning (0, "right shift count is negative");
8089 if (!integer_zerop (op1))
8092 if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
8093 warning (0, "right shift count >= width of type");
8097 /* Use the type of the value to be shifted. */
8098 result_type = type0;
8099 /* Convert the shift-count to an integer, regardless of size
8100 of value being shifted. */
8101 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
8102 op1 = convert (integer_type_node, op1);
8103 /* Avoid converting op1 to result_type later. */
8109 if ((code0 == INTEGER_TYPE || code0 == FIXED_POINT_TYPE)
8110 && code1 == INTEGER_TYPE)
8112 if (TREE_CODE (op1) == INTEGER_CST && skip_evaluation == 0)
8114 if (tree_int_cst_sgn (op1) < 0)
8115 warning (0, "left shift count is negative");
8117 else if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
8118 warning (0, "left shift count >= width of type");
8121 /* Use the type of the value to be shifted. */
8122 result_type = type0;
8123 /* Convert the shift-count to an integer, regardless of size
8124 of value being shifted. */
8125 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
8126 op1 = convert (integer_type_node, op1);
8127 /* Avoid converting op1 to result_type later. */
8134 if (code0 == REAL_TYPE || code1 == REAL_TYPE)
8135 warning (OPT_Wfloat_equal,
8136 "comparing floating point with == or != is unsafe");
8137 /* Result of comparison is always int,
8138 but don't convert the args to int! */
8139 build_type = integer_type_node;
8140 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
8141 || code0 == FIXED_POINT_TYPE || code0 == COMPLEX_TYPE)
8142 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
8143 || code1 == FIXED_POINT_TYPE || code1 == COMPLEX_TYPE))
8145 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
8147 tree tt0 = TREE_TYPE (type0);
8148 tree tt1 = TREE_TYPE (type1);
8149 /* Anything compares with void *. void * compares with anything.
8150 Otherwise, the targets must be compatible
8151 and both must be object or both incomplete. */
8152 if (comp_target_types (type0, type1))
8153 result_type = common_pointer_type (type0, type1);
8154 else if (VOID_TYPE_P (tt0))
8156 /* op0 != orig_op0 detects the case of something
8157 whose value is 0 but which isn't a valid null ptr const. */
8158 if (pedantic && !null_pointer_constant_p (orig_op0)
8159 && TREE_CODE (tt1) == FUNCTION_TYPE)
8160 pedwarn ("ISO C forbids comparison of %<void *%>"
8161 " with function pointer");
8163 else if (VOID_TYPE_P (tt1))
8165 if (pedantic && !null_pointer_constant_p (orig_op1)
8166 && TREE_CODE (tt0) == FUNCTION_TYPE)
8167 pedwarn ("ISO C forbids comparison of %<void *%>"
8168 " with function pointer");
8171 /* Avoid warning about the volatile ObjC EH puts on decls. */
8173 pedwarn ("comparison of distinct pointer types lacks a cast");
8175 if (result_type == NULL_TREE)
8176 result_type = ptr_type_node;
8178 else if (code0 == POINTER_TYPE && null_pointer_constant_p (orig_op1))
8180 if (TREE_CODE (op0) == ADDR_EXPR
8181 && decl_with_nonnull_addr_p (TREE_OPERAND (op0, 0)))
8182 warning (OPT_Waddress, "the address of %qD will never be NULL",
8183 TREE_OPERAND (op0, 0));
8184 result_type = type0;
8186 else if (code1 == POINTER_TYPE && null_pointer_constant_p (orig_op0))
8188 if (TREE_CODE (op1) == ADDR_EXPR
8189 && decl_with_nonnull_addr_p (TREE_OPERAND (op1, 0)))
8190 warning (OPT_Waddress, "the address of %qD will never be NULL",
8191 TREE_OPERAND (op1, 0));
8192 result_type = type1;
8194 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
8196 result_type = type0;
8197 pedwarn ("comparison between pointer and integer");
8199 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
8201 result_type = type1;
8202 pedwarn ("comparison between pointer and integer");
8210 build_type = integer_type_node;
8211 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
8212 || code0 == FIXED_POINT_TYPE)
8213 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
8214 || code1 == FIXED_POINT_TYPE))
8216 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
8218 if (comp_target_types (type0, type1))
8220 result_type = common_pointer_type (type0, type1);
8221 if (!COMPLETE_TYPE_P (TREE_TYPE (type0))
8222 != !COMPLETE_TYPE_P (TREE_TYPE (type1)))
8223 pedwarn ("comparison of complete and incomplete pointers");
8225 && TREE_CODE (TREE_TYPE (type0)) == FUNCTION_TYPE)
8226 pedwarn ("ISO C forbids ordered comparisons of pointers to functions");
8230 result_type = ptr_type_node;
8231 pedwarn ("comparison of distinct pointer types lacks a cast");
8234 else if (code0 == POINTER_TYPE && null_pointer_constant_p (orig_op1))
8236 result_type = type0;
8237 if (pedantic || extra_warnings)
8238 pedwarn ("ordered comparison of pointer with integer zero");
8240 else if (code1 == POINTER_TYPE && null_pointer_constant_p (orig_op0))
8242 result_type = type1;
8244 pedwarn ("ordered comparison of pointer with integer zero");
8246 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
8248 result_type = type0;
8249 pedwarn ("comparison between pointer and integer");
8251 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
8253 result_type = type1;
8254 pedwarn ("comparison between pointer and integer");
8262 if (code0 == ERROR_MARK || code1 == ERROR_MARK)
8263 return error_mark_node;
8265 if (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE
8266 && (!tree_int_cst_equal (TYPE_SIZE (type0), TYPE_SIZE (type1))
8267 || !same_scalar_type_ignoring_signedness (TREE_TYPE (type0),
8268 TREE_TYPE (type1))))
8270 binary_op_error (code, type0, type1);
8271 return error_mark_node;
8274 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE || code0 == COMPLEX_TYPE
8275 || code0 == FIXED_POINT_TYPE || code0 == VECTOR_TYPE)
8277 (code1 == INTEGER_TYPE || code1 == REAL_TYPE || code1 == COMPLEX_TYPE
8278 || code1 == FIXED_POINT_TYPE || code1 == VECTOR_TYPE))
8280 int none_complex = (code0 != COMPLEX_TYPE && code1 != COMPLEX_TYPE);
8282 if (shorten || common || short_compare)
8284 result_type = c_common_type (type0, type1);
8285 if (result_type == error_mark_node)
8286 return error_mark_node;
8289 /* For certain operations (which identify themselves by shorten != 0)
8290 if both args were extended from the same smaller type,
8291 do the arithmetic in that type and then extend.
8293 shorten !=0 and !=1 indicates a bitwise operation.
8294 For them, this optimization is safe only if
8295 both args are zero-extended or both are sign-extended.
8296 Otherwise, we might change the result.
8297 Eg, (short)-1 | (unsigned short)-1 is (int)-1
8298 but calculated in (unsigned short) it would be (unsigned short)-1. */
8300 if (shorten && none_complex)
8302 int unsigned0, unsigned1;
8307 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
8308 excessive narrowing when we call get_narrower below. For
8309 example, suppose that OP0 is of unsigned int extended
8310 from signed char and that RESULT_TYPE is long long int.
8311 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
8314 (long long int) (unsigned int) signed_char
8316 which get_narrower would narrow down to
8318 (unsigned int) signed char
8320 If we do not cast OP0 first, get_narrower would return
8321 signed_char, which is inconsistent with the case of the
8323 op0 = convert (result_type, op0);
8324 op1 = convert (result_type, op1);
8326 arg0 = get_narrower (op0, &unsigned0);
8327 arg1 = get_narrower (op1, &unsigned1);
8329 /* UNS is 1 if the operation to be done is an unsigned one. */
8330 uns = TYPE_UNSIGNED (result_type);
8332 final_type = result_type;
8334 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
8335 but it *requires* conversion to FINAL_TYPE. */
8337 if ((TYPE_PRECISION (TREE_TYPE (op0))
8338 == TYPE_PRECISION (TREE_TYPE (arg0)))
8339 && TREE_TYPE (op0) != final_type)
8340 unsigned0 = TYPE_UNSIGNED (TREE_TYPE (op0));
8341 if ((TYPE_PRECISION (TREE_TYPE (op1))
8342 == TYPE_PRECISION (TREE_TYPE (arg1)))
8343 && TREE_TYPE (op1) != final_type)
8344 unsigned1 = TYPE_UNSIGNED (TREE_TYPE (op1));
8346 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
8348 /* For bitwise operations, signedness of nominal type
8349 does not matter. Consider only how operands were extended. */
8353 /* Note that in all three cases below we refrain from optimizing
8354 an unsigned operation on sign-extended args.
8355 That would not be valid. */
8357 /* Both args variable: if both extended in same way
8358 from same width, do it in that width.
8359 Do it unsigned if args were zero-extended. */
8360 if ((TYPE_PRECISION (TREE_TYPE (arg0))
8361 < TYPE_PRECISION (result_type))
8362 && (TYPE_PRECISION (TREE_TYPE (arg1))
8363 == TYPE_PRECISION (TREE_TYPE (arg0)))
8364 && unsigned0 == unsigned1
8365 && (unsigned0 || !uns))
8367 = c_common_signed_or_unsigned_type
8368 (unsigned0, common_type (TREE_TYPE (arg0), TREE_TYPE (arg1)));
8369 else if (TREE_CODE (arg0) == INTEGER_CST
8370 && (unsigned1 || !uns)
8371 && (TYPE_PRECISION (TREE_TYPE (arg1))
8372 < TYPE_PRECISION (result_type))
8374 = c_common_signed_or_unsigned_type (unsigned1,
8376 && !POINTER_TYPE_P (type)
8377 && int_fits_type_p (arg0, type))
8379 else if (TREE_CODE (arg1) == INTEGER_CST
8380 && (unsigned0 || !uns)
8381 && (TYPE_PRECISION (TREE_TYPE (arg0))
8382 < TYPE_PRECISION (result_type))
8384 = c_common_signed_or_unsigned_type (unsigned0,
8386 && !POINTER_TYPE_P (type)
8387 && int_fits_type_p (arg1, type))
8391 /* Shifts can be shortened if shifting right. */
8396 tree arg0 = get_narrower (op0, &unsigned_arg);
8398 final_type = result_type;
8400 if (arg0 == op0 && final_type == TREE_TYPE (op0))
8401 unsigned_arg = TYPE_UNSIGNED (TREE_TYPE (op0));
8403 if (TYPE_PRECISION (TREE_TYPE (arg0)) < TYPE_PRECISION (result_type)
8404 /* We can shorten only if the shift count is less than the
8405 number of bits in the smaller type size. */
8406 && compare_tree_int (op1, TYPE_PRECISION (TREE_TYPE (arg0))) < 0
8407 /* We cannot drop an unsigned shift after sign-extension. */
8408 && (!TYPE_UNSIGNED (final_type) || unsigned_arg))
8410 /* Do an unsigned shift if the operand was zero-extended. */
8412 = c_common_signed_or_unsigned_type (unsigned_arg,
8414 /* Convert value-to-be-shifted to that type. */
8415 if (TREE_TYPE (op0) != result_type)
8416 op0 = convert (result_type, op0);
8421 /* Comparison operations are shortened too but differently.
8422 They identify themselves by setting short_compare = 1. */
8426 /* Don't write &op0, etc., because that would prevent op0
8427 from being kept in a register.
8428 Instead, make copies of the our local variables and
8429 pass the copies by reference, then copy them back afterward. */
8430 tree xop0 = op0, xop1 = op1, xresult_type = result_type;
8431 enum tree_code xresultcode = resultcode;
8433 = shorten_compare (&xop0, &xop1, &xresult_type, &xresultcode);
8438 op0 = xop0, op1 = xop1;
8440 resultcode = xresultcode;
8442 if (warn_sign_compare && skip_evaluation == 0)
8444 int op0_signed = !TYPE_UNSIGNED (TREE_TYPE (orig_op0));
8445 int op1_signed = !TYPE_UNSIGNED (TREE_TYPE (orig_op1));
8446 int unsignedp0, unsignedp1;
8447 tree primop0 = get_narrower (op0, &unsignedp0);
8448 tree primop1 = get_narrower (op1, &unsignedp1);
8452 STRIP_TYPE_NOPS (xop0);
8453 STRIP_TYPE_NOPS (xop1);
8455 /* Give warnings for comparisons between signed and unsigned
8456 quantities that may fail.
8458 Do the checking based on the original operand trees, so that
8459 casts will be considered, but default promotions won't be.
8461 Do not warn if the comparison is being done in a signed type,
8462 since the signed type will only be chosen if it can represent
8463 all the values of the unsigned type. */
8464 if (!TYPE_UNSIGNED (result_type))
8466 /* Do not warn if both operands are the same signedness. */
8467 else if (op0_signed == op1_signed)
8475 sop = xop0, uop = xop1;
8477 sop = xop1, uop = xop0;
8479 /* Do not warn if the signed quantity is an
8480 unsuffixed integer literal (or some static
8481 constant expression involving such literals or a
8482 conditional expression involving such literals)
8483 and it is non-negative. */
8484 if (tree_expr_nonnegative_warnv_p (sop, &ovf))
8486 /* Do not warn if the comparison is an equality operation,
8487 the unsigned quantity is an integral constant, and it
8488 would fit in the result if the result were signed. */
8489 else if (TREE_CODE (uop) == INTEGER_CST
8490 && (resultcode == EQ_EXPR || resultcode == NE_EXPR)
8492 (uop, c_common_signed_type (result_type)))
8494 /* Do not warn if the unsigned quantity is an enumeration
8495 constant and its maximum value would fit in the result
8496 if the result were signed. */
8497 else if (TREE_CODE (uop) == INTEGER_CST
8498 && TREE_CODE (TREE_TYPE (uop)) == ENUMERAL_TYPE
8500 (TYPE_MAX_VALUE (TREE_TYPE (uop)),
8501 c_common_signed_type (result_type)))
8504 warning (OPT_Wsign_compare, "comparison between signed and unsigned");
8507 /* Warn if two unsigned values are being compared in a size
8508 larger than their original size, and one (and only one) is the
8509 result of a `~' operator. This comparison will always fail.
8511 Also warn if one operand is a constant, and the constant
8512 does not have all bits set that are set in the ~ operand
8513 when it is extended. */
8515 if ((TREE_CODE (primop0) == BIT_NOT_EXPR)
8516 != (TREE_CODE (primop1) == BIT_NOT_EXPR))
8518 if (TREE_CODE (primop0) == BIT_NOT_EXPR)
8519 primop0 = get_narrower (TREE_OPERAND (primop0, 0),
8522 primop1 = get_narrower (TREE_OPERAND (primop1, 0),
8525 if (host_integerp (primop0, 0) || host_integerp (primop1, 0))
8528 HOST_WIDE_INT constant, mask;
8529 int unsignedp, bits;
8531 if (host_integerp (primop0, 0))
8534 unsignedp = unsignedp1;
8535 constant = tree_low_cst (primop0, 0);
8540 unsignedp = unsignedp0;
8541 constant = tree_low_cst (primop1, 0);
8544 bits = TYPE_PRECISION (TREE_TYPE (primop));
8545 if (bits < TYPE_PRECISION (result_type)
8546 && bits < HOST_BITS_PER_WIDE_INT && unsignedp)
8548 mask = (~(HOST_WIDE_INT) 0) << bits;
8549 if ((mask & constant) != mask)
8550 warning (OPT_Wsign_compare, "comparison of promoted ~unsigned with constant");
8553 else if (unsignedp0 && unsignedp1
8554 && (TYPE_PRECISION (TREE_TYPE (primop0))
8555 < TYPE_PRECISION (result_type))
8556 && (TYPE_PRECISION (TREE_TYPE (primop1))
8557 < TYPE_PRECISION (result_type)))
8558 warning (OPT_Wsign_compare, "comparison of promoted ~unsigned with unsigned");
8564 /* At this point, RESULT_TYPE must be nonzero to avoid an error message.
8565 If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
8566 Then the expression will be built.
8567 It will be given type FINAL_TYPE if that is nonzero;
8568 otherwise, it will be given type RESULT_TYPE. */
8572 binary_op_error (code, TREE_TYPE (op0), TREE_TYPE (op1));
8573 return error_mark_node;
8578 if (TREE_TYPE (op0) != result_type)
8579 op0 = convert_and_check (result_type, op0);
8580 if (TREE_TYPE (op1) != result_type)
8581 op1 = convert_and_check (result_type, op1);
8583 /* This can happen if one operand has a vector type, and the other
8584 has a different type. */
8585 if (TREE_CODE (op0) == ERROR_MARK || TREE_CODE (op1) == ERROR_MARK)
8586 return error_mark_node;
8589 if (build_type == NULL_TREE)
8590 build_type = result_type;
8593 /* Treat expressions in initializers specially as they can't trap. */
8594 tree result = require_constant_value ? fold_build2_initializer (resultcode,
8597 : fold_build2 (resultcode, build_type,
8600 if (final_type != 0)
8601 result = convert (final_type, result);
8607 /* Convert EXPR to be a truth-value, validating its type for this
8611 c_objc_common_truthvalue_conversion (tree expr)
8613 switch (TREE_CODE (TREE_TYPE (expr)))
8616 error ("used array that cannot be converted to pointer where scalar is required");
8617 return error_mark_node;
8620 error ("used struct type value where scalar is required");
8621 return error_mark_node;
8624 error ("used union type value where scalar is required");
8625 return error_mark_node;
8634 /* ??? Should we also give an error for void and vectors rather than
8635 leaving those to give errors later? */
8636 return c_common_truthvalue_conversion (expr);
8640 /* Convert EXPR to a contained DECL, updating *TC, *TI and *SE as
8644 c_expr_to_decl (tree expr, bool *tc ATTRIBUTE_UNUSED,
8645 bool *ti ATTRIBUTE_UNUSED, bool *se)
8647 if (TREE_CODE (expr) == COMPOUND_LITERAL_EXPR)
8649 tree decl = COMPOUND_LITERAL_EXPR_DECL (expr);
8650 /* Executing a compound literal inside a function reinitializes
8652 if (!TREE_STATIC (decl))
8660 /* Like c_begin_compound_stmt, except force the retention of the BLOCK. */
8663 c_begin_omp_parallel (void)
8668 block = c_begin_compound_stmt (true);
8674 c_finish_omp_parallel (tree clauses, tree block)
8678 block = c_end_compound_stmt (block, true);
8680 stmt = make_node (OMP_PARALLEL);
8681 TREE_TYPE (stmt) = void_type_node;
8682 OMP_PARALLEL_CLAUSES (stmt) = clauses;
8683 OMP_PARALLEL_BODY (stmt) = block;
8685 return add_stmt (stmt);
8688 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
8689 Remove any elements from the list that are invalid. */
8692 c_finish_omp_clauses (tree clauses)
8694 bitmap_head generic_head, firstprivate_head, lastprivate_head;
8695 tree c, t, *pc = &clauses;
8698 bitmap_obstack_initialize (NULL);
8699 bitmap_initialize (&generic_head, &bitmap_default_obstack);
8700 bitmap_initialize (&firstprivate_head, &bitmap_default_obstack);
8701 bitmap_initialize (&lastprivate_head, &bitmap_default_obstack);
8703 for (pc = &clauses, c = clauses; c ; c = *pc)
8705 bool remove = false;
8706 bool need_complete = false;
8707 bool need_implicitly_determined = false;
8709 switch (OMP_CLAUSE_CODE (c))
8711 case OMP_CLAUSE_SHARED:
8713 need_implicitly_determined = true;
8714 goto check_dup_generic;
8716 case OMP_CLAUSE_PRIVATE:
8718 need_complete = true;
8719 need_implicitly_determined = true;
8720 goto check_dup_generic;
8722 case OMP_CLAUSE_REDUCTION:
8724 need_implicitly_determined = true;
8725 t = OMP_CLAUSE_DECL (c);
8726 if (AGGREGATE_TYPE_P (TREE_TYPE (t))
8727 || POINTER_TYPE_P (TREE_TYPE (t)))
8729 error ("%qE has invalid type for %<reduction%>", t);
8732 else if (FLOAT_TYPE_P (TREE_TYPE (t)))
8734 enum tree_code r_code = OMP_CLAUSE_REDUCTION_CODE (c);
8735 const char *r_name = NULL;
8752 case TRUTH_ANDIF_EXPR:
8755 case TRUTH_ORIF_EXPR:
8763 error ("%qE has invalid type for %<reduction(%s)%>",
8768 goto check_dup_generic;
8770 case OMP_CLAUSE_COPYPRIVATE:
8771 name = "copyprivate";
8772 goto check_dup_generic;
8774 case OMP_CLAUSE_COPYIN:
8776 t = OMP_CLAUSE_DECL (c);
8777 if (TREE_CODE (t) != VAR_DECL || !DECL_THREAD_LOCAL_P (t))
8779 error ("%qE must be %<threadprivate%> for %<copyin%>", t);
8782 goto check_dup_generic;
8785 t = OMP_CLAUSE_DECL (c);
8786 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
8788 error ("%qE is not a variable in clause %qs", t, name);
8791 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
8792 || bitmap_bit_p (&firstprivate_head, DECL_UID (t))
8793 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
8795 error ("%qE appears more than once in data clauses", t);
8799 bitmap_set_bit (&generic_head, DECL_UID (t));
8802 case OMP_CLAUSE_FIRSTPRIVATE:
8803 name = "firstprivate";
8804 t = OMP_CLAUSE_DECL (c);
8805 need_complete = true;
8806 need_implicitly_determined = true;
8807 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
8809 error ("%qE is not a variable in clause %<firstprivate%>", t);
8812 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
8813 || bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
8815 error ("%qE appears more than once in data clauses", t);
8819 bitmap_set_bit (&firstprivate_head, DECL_UID (t));
8822 case OMP_CLAUSE_LASTPRIVATE:
8823 name = "lastprivate";
8824 t = OMP_CLAUSE_DECL (c);
8825 need_complete = true;
8826 need_implicitly_determined = true;
8827 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
8829 error ("%qE is not a variable in clause %<lastprivate%>", t);
8832 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
8833 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
8835 error ("%qE appears more than once in data clauses", t);
8839 bitmap_set_bit (&lastprivate_head, DECL_UID (t));
8843 case OMP_CLAUSE_NUM_THREADS:
8844 case OMP_CLAUSE_SCHEDULE:
8845 case OMP_CLAUSE_NOWAIT:
8846 case OMP_CLAUSE_ORDERED:
8847 case OMP_CLAUSE_DEFAULT:
8848 pc = &OMP_CLAUSE_CHAIN (c);
8857 t = OMP_CLAUSE_DECL (c);
8861 t = require_complete_type (t);
8862 if (t == error_mark_node)
8866 if (need_implicitly_determined)
8868 const char *share_name = NULL;
8870 if (TREE_CODE (t) == VAR_DECL && DECL_THREAD_LOCAL_P (t))
8871 share_name = "threadprivate";
8872 else switch (c_omp_predetermined_sharing (t))
8874 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
8876 case OMP_CLAUSE_DEFAULT_SHARED:
8877 share_name = "shared";
8879 case OMP_CLAUSE_DEFAULT_PRIVATE:
8880 share_name = "private";
8887 error ("%qE is predetermined %qs for %qs",
8888 t, share_name, name);
8895 *pc = OMP_CLAUSE_CHAIN (c);
8897 pc = &OMP_CLAUSE_CHAIN (c);
8900 bitmap_obstack_release (NULL);
8904 /* Make a variant type in the proper way for C/C++, propagating qualifiers
8905 down to the element type of an array. */
8908 c_build_qualified_type (tree type, int type_quals)
8910 if (type == error_mark_node)
8913 if (TREE_CODE (type) == ARRAY_TYPE)
8916 tree element_type = c_build_qualified_type (TREE_TYPE (type),
8919 /* See if we already have an identically qualified type. */
8920 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
8922 if (TYPE_QUALS (strip_array_types (t)) == type_quals
8923 && TYPE_NAME (t) == TYPE_NAME (type)
8924 && TYPE_CONTEXT (t) == TYPE_CONTEXT (type)
8925 && attribute_list_equal (TYPE_ATTRIBUTES (t),
8926 TYPE_ATTRIBUTES (type)))
8931 tree domain = TYPE_DOMAIN (type);
8933 t = build_variant_type_copy (type);
8934 TREE_TYPE (t) = element_type;
8936 if (TYPE_STRUCTURAL_EQUALITY_P (element_type)
8937 || (domain && TYPE_STRUCTURAL_EQUALITY_P (domain)))
8938 SET_TYPE_STRUCTURAL_EQUALITY (t);
8939 else if (TYPE_CANONICAL (element_type) != element_type
8940 || (domain && TYPE_CANONICAL (domain) != domain))
8942 tree unqualified_canon
8943 = build_array_type (TYPE_CANONICAL (element_type),
8944 domain? TYPE_CANONICAL (domain)
8947 = c_build_qualified_type (unqualified_canon, type_quals);
8950 TYPE_CANONICAL (t) = t;
8955 /* A restrict-qualified pointer type must be a pointer to object or
8956 incomplete type. Note that the use of POINTER_TYPE_P also allows
8957 REFERENCE_TYPEs, which is appropriate for C++. */
8958 if ((type_quals & TYPE_QUAL_RESTRICT)
8959 && (!POINTER_TYPE_P (type)
8960 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type))))
8962 error ("invalid use of %<restrict%>");
8963 type_quals &= ~TYPE_QUAL_RESTRICT;
8966 return build_qualified_type (type, type_quals);