1 /* Build expressions with type checking for C compiler.
2 Copyright (C) 1987, 1988, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008
4 Free Software Foundation, Inc.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 3, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
23 /* This file is part of the C front end.
24 It contains routines to build C expressions given their operands,
25 including computing the types of the result, C-specific error checks,
26 and some optimization. */
30 #include "coretypes.h"
34 #include "langhooks.h"
44 #include "tree-iterator.h"
45 #include "tree-gimple.h"
46 #include "tree-flow.h"
48 /* Possible cases of implicit bad conversions. Used to select
49 diagnostic messages in convert_for_assignment. */
58 /* The level of nesting inside "__alignof__". */
61 /* The level of nesting inside "sizeof". */
64 /* The level of nesting inside "typeof". */
67 struct c_label_context_se *label_context_stack_se;
68 struct c_label_context_vm *label_context_stack_vm;
70 /* Nonzero if we've already printed a "missing braces around initializer"
71 message within this initializer. */
72 static int missing_braces_mentioned;
74 static int require_constant_value;
75 static int require_constant_elements;
77 static bool null_pointer_constant_p (const_tree);
78 static tree qualify_type (tree, tree);
79 static int tagged_types_tu_compatible_p (const_tree, const_tree);
80 static int comp_target_types (tree, tree);
81 static int function_types_compatible_p (const_tree, const_tree);
82 static int type_lists_compatible_p (const_tree, const_tree);
83 static tree decl_constant_value_for_broken_optimization (tree);
84 static tree lookup_field (tree, tree);
85 static int convert_arguments (int, tree *, tree, tree, tree, tree);
86 static tree pointer_diff (tree, tree);
87 static tree convert_for_assignment (tree, tree, enum impl_conv, tree, tree,
89 static tree valid_compound_expr_initializer (tree, tree);
90 static void push_string (const char *);
91 static void push_member_name (tree);
92 static int spelling_length (void);
93 static char *print_spelling (char *);
94 static void warning_init (int, const char *);
95 static tree digest_init (tree, tree, bool, int);
96 static void output_init_element (tree, bool, tree, tree, int);
97 static void output_pending_init_elements (int);
98 static int set_designator (int);
99 static void push_range_stack (tree);
100 static void add_pending_init (tree, tree);
101 static void set_nonincremental_init (void);
102 static void set_nonincremental_init_from_string (tree);
103 static tree find_init_member (tree);
104 static void readonly_error (tree, enum lvalue_use);
105 static int lvalue_or_else (const_tree, enum lvalue_use);
106 static int lvalue_p (const_tree);
107 static void record_maybe_used_decl (tree);
108 static int comptypes_internal (const_tree, const_tree);
110 /* Return true if EXP is a null pointer constant, false otherwise. */
113 null_pointer_constant_p (const_tree expr)
115 /* This should really operate on c_expr structures, but they aren't
116 yet available everywhere required. */
117 tree type = TREE_TYPE (expr);
118 return (TREE_CODE (expr) == INTEGER_CST
119 && !TREE_OVERFLOW (expr)
120 && integer_zerop (expr)
121 && (INTEGRAL_TYPE_P (type)
122 || (TREE_CODE (type) == POINTER_TYPE
123 && VOID_TYPE_P (TREE_TYPE (type))
124 && TYPE_QUALS (TREE_TYPE (type)) == TYPE_UNQUALIFIED)));
126 \f/* This is a cache to hold if two types are compatible or not. */
128 struct tagged_tu_seen_cache {
129 const struct tagged_tu_seen_cache * next;
132 /* The return value of tagged_types_tu_compatible_p if we had seen
133 these two types already. */
137 static const struct tagged_tu_seen_cache * tagged_tu_seen_base;
138 static void free_all_tagged_tu_seen_up_to (const struct tagged_tu_seen_cache *);
140 /* Do `exp = require_complete_type (exp);' to make sure exp
141 does not have an incomplete type. (That includes void types.) */
144 require_complete_type (tree value)
146 tree type = TREE_TYPE (value);
148 if (value == error_mark_node || type == error_mark_node)
149 return error_mark_node;
151 /* First, detect a valid value with a complete type. */
152 if (COMPLETE_TYPE_P (type))
155 c_incomplete_type_error (value, type);
156 return error_mark_node;
159 /* Print an error message for invalid use of an incomplete type.
160 VALUE is the expression that was used (or 0 if that isn't known)
161 and TYPE is the type that was invalid. */
164 c_incomplete_type_error (const_tree value, const_tree type)
166 const char *type_code_string;
168 /* Avoid duplicate error message. */
169 if (TREE_CODE (type) == ERROR_MARK)
172 if (value != 0 && (TREE_CODE (value) == VAR_DECL
173 || TREE_CODE (value) == PARM_DECL))
174 error ("%qD has an incomplete type", value);
178 /* We must print an error message. Be clever about what it says. */
180 switch (TREE_CODE (type))
183 type_code_string = "struct";
187 type_code_string = "union";
191 type_code_string = "enum";
195 error ("invalid use of void expression");
199 if (TYPE_DOMAIN (type))
201 if (TYPE_MAX_VALUE (TYPE_DOMAIN (type)) == NULL)
203 error ("invalid use of flexible array member");
206 type = TREE_TYPE (type);
209 error ("invalid use of array with unspecified bounds");
216 if (TREE_CODE (TYPE_NAME (type)) == IDENTIFIER_NODE)
217 error ("invalid use of undefined type %<%s %E%>",
218 type_code_string, TYPE_NAME (type));
220 /* If this type has a typedef-name, the TYPE_NAME is a TYPE_DECL. */
221 error ("invalid use of incomplete typedef %qD", TYPE_NAME (type));
225 /* Given a type, apply default promotions wrt unnamed function
226 arguments and return the new type. */
229 c_type_promotes_to (tree type)
231 if (TYPE_MAIN_VARIANT (type) == float_type_node)
232 return double_type_node;
234 if (c_promoting_integer_type_p (type))
236 /* Preserve unsignedness if not really getting any wider. */
237 if (TYPE_UNSIGNED (type)
238 && (TYPE_PRECISION (type) == TYPE_PRECISION (integer_type_node)))
239 return unsigned_type_node;
240 return integer_type_node;
246 /* Return a variant of TYPE which has all the type qualifiers of LIKE
247 as well as those of TYPE. */
250 qualify_type (tree type, tree like)
252 return c_build_qualified_type (type,
253 TYPE_QUALS (type) | TYPE_QUALS (like));
256 /* Return true iff the given tree T is a variable length array. */
259 c_vla_type_p (const_tree t)
261 if (TREE_CODE (t) == ARRAY_TYPE
262 && C_TYPE_VARIABLE_SIZE (t))
267 /* Return the composite type of two compatible types.
269 We assume that comptypes has already been done and returned
270 nonzero; if that isn't so, this may crash. In particular, we
271 assume that qualifiers match. */
274 composite_type (tree t1, tree t2)
276 enum tree_code code1;
277 enum tree_code code2;
280 /* Save time if the two types are the same. */
282 if (t1 == t2) return t1;
284 /* If one type is nonsense, use the other. */
285 if (t1 == error_mark_node)
287 if (t2 == error_mark_node)
290 code1 = TREE_CODE (t1);
291 code2 = TREE_CODE (t2);
293 /* Merge the attributes. */
294 attributes = targetm.merge_type_attributes (t1, t2);
296 /* If one is an enumerated type and the other is the compatible
297 integer type, the composite type might be either of the two
298 (DR#013 question 3). For consistency, use the enumerated type as
299 the composite type. */
301 if (code1 == ENUMERAL_TYPE && code2 == INTEGER_TYPE)
303 if (code2 == ENUMERAL_TYPE && code1 == INTEGER_TYPE)
306 gcc_assert (code1 == code2);
311 /* For two pointers, do this recursively on the target type. */
313 tree pointed_to_1 = TREE_TYPE (t1);
314 tree pointed_to_2 = TREE_TYPE (t2);
315 tree target = composite_type (pointed_to_1, pointed_to_2);
316 t1 = build_pointer_type (target);
317 t1 = build_type_attribute_variant (t1, attributes);
318 return qualify_type (t1, t2);
323 tree elt = composite_type (TREE_TYPE (t1), TREE_TYPE (t2));
326 tree d1 = TYPE_DOMAIN (t1);
327 tree d2 = TYPE_DOMAIN (t2);
328 bool d1_variable, d2_variable;
329 bool d1_zero, d2_zero;
331 /* We should not have any type quals on arrays at all. */
332 gcc_assert (!TYPE_QUALS (t1) && !TYPE_QUALS (t2));
334 d1_zero = d1 == 0 || !TYPE_MAX_VALUE (d1);
335 d2_zero = d2 == 0 || !TYPE_MAX_VALUE (d2);
337 d1_variable = (!d1_zero
338 && (TREE_CODE (TYPE_MIN_VALUE (d1)) != INTEGER_CST
339 || TREE_CODE (TYPE_MAX_VALUE (d1)) != INTEGER_CST));
340 d2_variable = (!d2_zero
341 && (TREE_CODE (TYPE_MIN_VALUE (d2)) != INTEGER_CST
342 || TREE_CODE (TYPE_MAX_VALUE (d2)) != INTEGER_CST));
343 d1_variable = d1_variable || (d1_zero && c_vla_type_p (t1));
344 d2_variable = d2_variable || (d2_zero && c_vla_type_p (t2));
346 /* Save space: see if the result is identical to one of the args. */
347 if (elt == TREE_TYPE (t1) && TYPE_DOMAIN (t1)
348 && (d2_variable || d2_zero || !d1_variable))
349 return build_type_attribute_variant (t1, attributes);
350 if (elt == TREE_TYPE (t2) && TYPE_DOMAIN (t2)
351 && (d1_variable || d1_zero || !d2_variable))
352 return build_type_attribute_variant (t2, attributes);
354 if (elt == TREE_TYPE (t1) && !TYPE_DOMAIN (t2) && !TYPE_DOMAIN (t1))
355 return build_type_attribute_variant (t1, attributes);
356 if (elt == TREE_TYPE (t2) && !TYPE_DOMAIN (t2) && !TYPE_DOMAIN (t1))
357 return build_type_attribute_variant (t2, attributes);
359 /* Merge the element types, and have a size if either arg has
360 one. We may have qualifiers on the element types. To set
361 up TYPE_MAIN_VARIANT correctly, we need to form the
362 composite of the unqualified types and add the qualifiers
364 quals = TYPE_QUALS (strip_array_types (elt));
365 unqual_elt = c_build_qualified_type (elt, TYPE_UNQUALIFIED);
366 t1 = build_array_type (unqual_elt,
367 TYPE_DOMAIN ((TYPE_DOMAIN (t1)
373 t1 = c_build_qualified_type (t1, quals);
374 return build_type_attribute_variant (t1, attributes);
380 if (attributes != NULL)
382 /* Try harder not to create a new aggregate type. */
383 if (attribute_list_equal (TYPE_ATTRIBUTES (t1), attributes))
385 if (attribute_list_equal (TYPE_ATTRIBUTES (t2), attributes))
388 return build_type_attribute_variant (t1, attributes);
391 /* Function types: prefer the one that specified arg types.
392 If both do, merge the arg types. Also merge the return types. */
394 tree valtype = composite_type (TREE_TYPE (t1), TREE_TYPE (t2));
395 tree p1 = TYPE_ARG_TYPES (t1);
396 tree p2 = TYPE_ARG_TYPES (t2);
401 /* Save space: see if the result is identical to one of the args. */
402 if (valtype == TREE_TYPE (t1) && !TYPE_ARG_TYPES (t2))
403 return build_type_attribute_variant (t1, attributes);
404 if (valtype == TREE_TYPE (t2) && !TYPE_ARG_TYPES (t1))
405 return build_type_attribute_variant (t2, attributes);
407 /* Simple way if one arg fails to specify argument types. */
408 if (TYPE_ARG_TYPES (t1) == 0)
410 t1 = build_function_type (valtype, TYPE_ARG_TYPES (t2));
411 t1 = build_type_attribute_variant (t1, attributes);
412 return qualify_type (t1, t2);
414 if (TYPE_ARG_TYPES (t2) == 0)
416 t1 = build_function_type (valtype, TYPE_ARG_TYPES (t1));
417 t1 = build_type_attribute_variant (t1, attributes);
418 return qualify_type (t1, t2);
421 /* If both args specify argument types, we must merge the two
422 lists, argument by argument. */
423 /* Tell global_bindings_p to return false so that variable_size
424 doesn't die on VLAs in parameter types. */
425 c_override_global_bindings_to_false = true;
427 len = list_length (p1);
430 for (i = 0; i < len; i++)
431 newargs = tree_cons (NULL_TREE, NULL_TREE, newargs);
436 p1 = TREE_CHAIN (p1), p2 = TREE_CHAIN (p2), n = TREE_CHAIN (n))
438 /* A null type means arg type is not specified.
439 Take whatever the other function type has. */
440 if (TREE_VALUE (p1) == 0)
442 TREE_VALUE (n) = TREE_VALUE (p2);
445 if (TREE_VALUE (p2) == 0)
447 TREE_VALUE (n) = TREE_VALUE (p1);
451 /* Given wait (union {union wait *u; int *i} *)
452 and wait (union wait *),
453 prefer union wait * as type of parm. */
454 if (TREE_CODE (TREE_VALUE (p1)) == UNION_TYPE
455 && TREE_VALUE (p1) != TREE_VALUE (p2))
458 tree mv2 = TREE_VALUE (p2);
459 if (mv2 && mv2 != error_mark_node
460 && TREE_CODE (mv2) != ARRAY_TYPE)
461 mv2 = TYPE_MAIN_VARIANT (mv2);
462 for (memb = TYPE_FIELDS (TREE_VALUE (p1));
463 memb; memb = TREE_CHAIN (memb))
465 tree mv3 = TREE_TYPE (memb);
466 if (mv3 && mv3 != error_mark_node
467 && TREE_CODE (mv3) != ARRAY_TYPE)
468 mv3 = TYPE_MAIN_VARIANT (mv3);
469 if (comptypes (mv3, mv2))
471 TREE_VALUE (n) = composite_type (TREE_TYPE (memb),
474 pedwarn ("function types not truly compatible in ISO C");
479 if (TREE_CODE (TREE_VALUE (p2)) == UNION_TYPE
480 && TREE_VALUE (p2) != TREE_VALUE (p1))
483 tree mv1 = TREE_VALUE (p1);
484 if (mv1 && mv1 != error_mark_node
485 && TREE_CODE (mv1) != ARRAY_TYPE)
486 mv1 = TYPE_MAIN_VARIANT (mv1);
487 for (memb = TYPE_FIELDS (TREE_VALUE (p2));
488 memb; memb = TREE_CHAIN (memb))
490 tree mv3 = TREE_TYPE (memb);
491 if (mv3 && mv3 != error_mark_node
492 && TREE_CODE (mv3) != ARRAY_TYPE)
493 mv3 = TYPE_MAIN_VARIANT (mv3);
494 if (comptypes (mv3, mv1))
496 TREE_VALUE (n) = composite_type (TREE_TYPE (memb),
499 pedwarn ("function types not truly compatible in ISO C");
504 TREE_VALUE (n) = composite_type (TREE_VALUE (p1), TREE_VALUE (p2));
508 c_override_global_bindings_to_false = false;
509 t1 = build_function_type (valtype, newargs);
510 t1 = qualify_type (t1, t2);
511 /* ... falls through ... */
515 return build_type_attribute_variant (t1, attributes);
520 /* Return the type of a conditional expression between pointers to
521 possibly differently qualified versions of compatible types.
523 We assume that comp_target_types has already been done and returned
524 nonzero; if that isn't so, this may crash. */
527 common_pointer_type (tree t1, tree t2)
530 tree pointed_to_1, mv1;
531 tree pointed_to_2, mv2;
533 unsigned target_quals;
535 /* Save time if the two types are the same. */
537 if (t1 == t2) return t1;
539 /* If one type is nonsense, use the other. */
540 if (t1 == error_mark_node)
542 if (t2 == error_mark_node)
545 gcc_assert (TREE_CODE (t1) == POINTER_TYPE
546 && TREE_CODE (t2) == POINTER_TYPE);
548 /* Merge the attributes. */
549 attributes = targetm.merge_type_attributes (t1, t2);
551 /* Find the composite type of the target types, and combine the
552 qualifiers of the two types' targets. Do not lose qualifiers on
553 array element types by taking the TYPE_MAIN_VARIANT. */
554 mv1 = pointed_to_1 = TREE_TYPE (t1);
555 mv2 = pointed_to_2 = TREE_TYPE (t2);
556 if (TREE_CODE (mv1) != ARRAY_TYPE)
557 mv1 = TYPE_MAIN_VARIANT (pointed_to_1);
558 if (TREE_CODE (mv2) != ARRAY_TYPE)
559 mv2 = TYPE_MAIN_VARIANT (pointed_to_2);
560 target = composite_type (mv1, mv2);
562 /* For function types do not merge const qualifiers, but drop them
563 if used inconsistently. The middle-end uses these to mark const
564 and noreturn functions. */
565 if (TREE_CODE (pointed_to_1) == FUNCTION_TYPE)
566 target_quals = TYPE_QUALS (pointed_to_1) & TYPE_QUALS (pointed_to_2);
568 target_quals = TYPE_QUALS (pointed_to_1) | TYPE_QUALS (pointed_to_2);
569 t1 = build_pointer_type (c_build_qualified_type (target, target_quals));
570 return build_type_attribute_variant (t1, attributes);
573 /* Return the common type for two arithmetic types under the usual
574 arithmetic conversions. The default conversions have already been
575 applied, and enumerated types converted to their compatible integer
576 types. The resulting type is unqualified and has no attributes.
578 This is the type for the result of most arithmetic operations
579 if the operands have the given two types. */
582 c_common_type (tree t1, tree t2)
584 enum tree_code code1;
585 enum tree_code code2;
587 /* If one type is nonsense, use the other. */
588 if (t1 == error_mark_node)
590 if (t2 == error_mark_node)
593 if (TYPE_QUALS (t1) != TYPE_UNQUALIFIED)
594 t1 = TYPE_MAIN_VARIANT (t1);
596 if (TYPE_QUALS (t2) != TYPE_UNQUALIFIED)
597 t2 = TYPE_MAIN_VARIANT (t2);
599 if (TYPE_ATTRIBUTES (t1) != NULL_TREE)
600 t1 = build_type_attribute_variant (t1, NULL_TREE);
602 if (TYPE_ATTRIBUTES (t2) != NULL_TREE)
603 t2 = build_type_attribute_variant (t2, NULL_TREE);
605 /* Save time if the two types are the same. */
607 if (t1 == t2) return t1;
609 code1 = TREE_CODE (t1);
610 code2 = TREE_CODE (t2);
612 gcc_assert (code1 == VECTOR_TYPE || code1 == COMPLEX_TYPE
613 || code1 == FIXED_POINT_TYPE || code1 == REAL_TYPE
614 || code1 == INTEGER_TYPE);
615 gcc_assert (code2 == VECTOR_TYPE || code2 == COMPLEX_TYPE
616 || code2 == FIXED_POINT_TYPE || code2 == REAL_TYPE
617 || code2 == INTEGER_TYPE);
619 /* When one operand is a decimal float type, the other operand cannot be
620 a generic float type or a complex type. We also disallow vector types
622 if ((DECIMAL_FLOAT_TYPE_P (t1) || DECIMAL_FLOAT_TYPE_P (t2))
623 && !(DECIMAL_FLOAT_TYPE_P (t1) && DECIMAL_FLOAT_TYPE_P (t2)))
625 if (code1 == VECTOR_TYPE || code2 == VECTOR_TYPE)
627 error ("can%'t mix operands of decimal float and vector types");
628 return error_mark_node;
630 if (code1 == COMPLEX_TYPE || code2 == COMPLEX_TYPE)
632 error ("can%'t mix operands of decimal float and complex types");
633 return error_mark_node;
635 if (code1 == REAL_TYPE && code2 == REAL_TYPE)
637 error ("can%'t mix operands of decimal float and other float types");
638 return error_mark_node;
642 /* If one type is a vector type, return that type. (How the usual
643 arithmetic conversions apply to the vector types extension is not
644 precisely specified.) */
645 if (code1 == VECTOR_TYPE)
648 if (code2 == VECTOR_TYPE)
651 /* If one type is complex, form the common type of the non-complex
652 components, then make that complex. Use T1 or T2 if it is the
654 if (code1 == COMPLEX_TYPE || code2 == COMPLEX_TYPE)
656 tree subtype1 = code1 == COMPLEX_TYPE ? TREE_TYPE (t1) : t1;
657 tree subtype2 = code2 == COMPLEX_TYPE ? TREE_TYPE (t2) : t2;
658 tree subtype = c_common_type (subtype1, subtype2);
660 if (code1 == COMPLEX_TYPE && TREE_TYPE (t1) == subtype)
662 else if (code2 == COMPLEX_TYPE && TREE_TYPE (t2) == subtype)
665 return build_complex_type (subtype);
668 /* If only one is real, use it as the result. */
670 if (code1 == REAL_TYPE && code2 != REAL_TYPE)
673 if (code2 == REAL_TYPE && code1 != REAL_TYPE)
676 /* If both are real and either are decimal floating point types, use
677 the decimal floating point type with the greater precision. */
679 if (code1 == REAL_TYPE && code2 == REAL_TYPE)
681 if (TYPE_MAIN_VARIANT (t1) == dfloat128_type_node
682 || TYPE_MAIN_VARIANT (t2) == dfloat128_type_node)
683 return dfloat128_type_node;
684 else if (TYPE_MAIN_VARIANT (t1) == dfloat64_type_node
685 || TYPE_MAIN_VARIANT (t2) == dfloat64_type_node)
686 return dfloat64_type_node;
687 else if (TYPE_MAIN_VARIANT (t1) == dfloat32_type_node
688 || TYPE_MAIN_VARIANT (t2) == dfloat32_type_node)
689 return dfloat32_type_node;
692 /* Deal with fixed-point types. */
693 if (code1 == FIXED_POINT_TYPE || code2 == FIXED_POINT_TYPE)
695 unsigned int unsignedp = 0, satp = 0;
696 enum machine_mode m1, m2;
697 unsigned int fbit1, ibit1, fbit2, ibit2, max_fbit, max_ibit;
702 /* If one input type is saturating, the result type is saturating. */
703 if (TYPE_SATURATING (t1) || TYPE_SATURATING (t2))
706 /* If both fixed-point types are unsigned, the result type is unsigned.
707 When mixing fixed-point and integer types, follow the sign of the
709 Otherwise, the result type is signed. */
710 if ((TYPE_UNSIGNED (t1) && TYPE_UNSIGNED (t2)
711 && code1 == FIXED_POINT_TYPE && code2 == FIXED_POINT_TYPE)
712 || (code1 == FIXED_POINT_TYPE && code2 != FIXED_POINT_TYPE
713 && TYPE_UNSIGNED (t1))
714 || (code1 != FIXED_POINT_TYPE && code2 == FIXED_POINT_TYPE
715 && TYPE_UNSIGNED (t2)))
718 /* The result type is signed. */
721 /* If the input type is unsigned, we need to convert to the
723 if (code1 == FIXED_POINT_TYPE && TYPE_UNSIGNED (t1))
725 unsigned char mclass = 0;
726 if (GET_MODE_CLASS (m1) == MODE_UFRACT)
728 else if (GET_MODE_CLASS (m1) == MODE_UACCUM)
732 m1 = mode_for_size (GET_MODE_PRECISION (m1), mclass, 0);
734 if (code2 == FIXED_POINT_TYPE && TYPE_UNSIGNED (t2))
736 unsigned char mclass = 0;
737 if (GET_MODE_CLASS (m2) == MODE_UFRACT)
739 else if (GET_MODE_CLASS (m2) == MODE_UACCUM)
743 m2 = mode_for_size (GET_MODE_PRECISION (m2), mclass, 0);
747 if (code1 == FIXED_POINT_TYPE)
749 fbit1 = GET_MODE_FBIT (m1);
750 ibit1 = GET_MODE_IBIT (m1);
755 /* Signed integers need to subtract one sign bit. */
756 ibit1 = TYPE_PRECISION (t1) - (!TYPE_UNSIGNED (t1));
759 if (code2 == FIXED_POINT_TYPE)
761 fbit2 = GET_MODE_FBIT (m2);
762 ibit2 = GET_MODE_IBIT (m2);
767 /* Signed integers need to subtract one sign bit. */
768 ibit2 = TYPE_PRECISION (t2) - (!TYPE_UNSIGNED (t2));
771 max_ibit = ibit1 >= ibit2 ? ibit1 : ibit2;
772 max_fbit = fbit1 >= fbit2 ? fbit1 : fbit2;
773 return c_common_fixed_point_type_for_size (max_ibit, max_fbit, unsignedp,
777 /* Both real or both integers; use the one with greater precision. */
779 if (TYPE_PRECISION (t1) > TYPE_PRECISION (t2))
781 else if (TYPE_PRECISION (t2) > TYPE_PRECISION (t1))
784 /* Same precision. Prefer long longs to longs to ints when the
785 same precision, following the C99 rules on integer type rank
786 (which are equivalent to the C90 rules for C90 types). */
788 if (TYPE_MAIN_VARIANT (t1) == long_long_unsigned_type_node
789 || TYPE_MAIN_VARIANT (t2) == long_long_unsigned_type_node)
790 return long_long_unsigned_type_node;
792 if (TYPE_MAIN_VARIANT (t1) == long_long_integer_type_node
793 || TYPE_MAIN_VARIANT (t2) == long_long_integer_type_node)
795 if (TYPE_UNSIGNED (t1) || TYPE_UNSIGNED (t2))
796 return long_long_unsigned_type_node;
798 return long_long_integer_type_node;
801 if (TYPE_MAIN_VARIANT (t1) == long_unsigned_type_node
802 || TYPE_MAIN_VARIANT (t2) == long_unsigned_type_node)
803 return long_unsigned_type_node;
805 if (TYPE_MAIN_VARIANT (t1) == long_integer_type_node
806 || TYPE_MAIN_VARIANT (t2) == long_integer_type_node)
808 /* But preserve unsignedness from the other type,
809 since long cannot hold all the values of an unsigned int. */
810 if (TYPE_UNSIGNED (t1) || TYPE_UNSIGNED (t2))
811 return long_unsigned_type_node;
813 return long_integer_type_node;
816 /* Likewise, prefer long double to double even if same size. */
817 if (TYPE_MAIN_VARIANT (t1) == long_double_type_node
818 || TYPE_MAIN_VARIANT (t2) == long_double_type_node)
819 return long_double_type_node;
821 /* Otherwise prefer the unsigned one. */
823 if (TYPE_UNSIGNED (t1))
829 /* Wrapper around c_common_type that is used by c-common.c and other
830 front end optimizations that remove promotions. ENUMERAL_TYPEs
831 are allowed here and are converted to their compatible integer types.
832 BOOLEAN_TYPEs are allowed here and return either boolean_type_node or
833 preferably a non-Boolean type as the common type. */
835 common_type (tree t1, tree t2)
837 if (TREE_CODE (t1) == ENUMERAL_TYPE)
838 t1 = c_common_type_for_size (TYPE_PRECISION (t1), 1);
839 if (TREE_CODE (t2) == ENUMERAL_TYPE)
840 t2 = c_common_type_for_size (TYPE_PRECISION (t2), 1);
842 /* If both types are BOOLEAN_TYPE, then return boolean_type_node. */
843 if (TREE_CODE (t1) == BOOLEAN_TYPE
844 && TREE_CODE (t2) == BOOLEAN_TYPE)
845 return boolean_type_node;
847 /* If either type is BOOLEAN_TYPE, then return the other. */
848 if (TREE_CODE (t1) == BOOLEAN_TYPE)
850 if (TREE_CODE (t2) == BOOLEAN_TYPE)
853 return c_common_type (t1, t2);
856 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
857 or various other operations. Return 2 if they are compatible
858 but a warning may be needed if you use them together. */
861 comptypes (tree type1, tree type2)
863 const struct tagged_tu_seen_cache * tagged_tu_seen_base1 = tagged_tu_seen_base;
866 val = comptypes_internal (type1, type2);
867 free_all_tagged_tu_seen_up_to (tagged_tu_seen_base1);
872 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
873 or various other operations. Return 2 if they are compatible
874 but a warning may be needed if you use them together. This
875 differs from comptypes, in that we don't free the seen types. */
878 comptypes_internal (const_tree type1, const_tree type2)
880 const_tree t1 = type1;
881 const_tree t2 = type2;
884 /* Suppress errors caused by previously reported errors. */
886 if (t1 == t2 || !t1 || !t2
887 || TREE_CODE (t1) == ERROR_MARK || TREE_CODE (t2) == ERROR_MARK)
890 /* If either type is the internal version of sizetype, return the
892 if (TREE_CODE (t1) == INTEGER_TYPE && TYPE_IS_SIZETYPE (t1)
893 && TYPE_ORIG_SIZE_TYPE (t1))
894 t1 = TYPE_ORIG_SIZE_TYPE (t1);
896 if (TREE_CODE (t2) == INTEGER_TYPE && TYPE_IS_SIZETYPE (t2)
897 && TYPE_ORIG_SIZE_TYPE (t2))
898 t2 = TYPE_ORIG_SIZE_TYPE (t2);
901 /* Enumerated types are compatible with integer types, but this is
902 not transitive: two enumerated types in the same translation unit
903 are compatible with each other only if they are the same type. */
905 if (TREE_CODE (t1) == ENUMERAL_TYPE && TREE_CODE (t2) != ENUMERAL_TYPE)
906 t1 = c_common_type_for_size (TYPE_PRECISION (t1), TYPE_UNSIGNED (t1));
907 else if (TREE_CODE (t2) == ENUMERAL_TYPE && TREE_CODE (t1) != ENUMERAL_TYPE)
908 t2 = c_common_type_for_size (TYPE_PRECISION (t2), TYPE_UNSIGNED (t2));
913 /* Different classes of types can't be compatible. */
915 if (TREE_CODE (t1) != TREE_CODE (t2))
918 /* Qualifiers must match. C99 6.7.3p9 */
920 if (TYPE_QUALS (t1) != TYPE_QUALS (t2))
923 /* Allow for two different type nodes which have essentially the same
924 definition. Note that we already checked for equality of the type
925 qualifiers (just above). */
927 if (TREE_CODE (t1) != ARRAY_TYPE
928 && TYPE_MAIN_VARIANT (t1) == TYPE_MAIN_VARIANT (t2))
931 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
932 if (!(attrval = targetm.comp_type_attributes (t1, t2)))
935 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
938 switch (TREE_CODE (t1))
941 /* Do not remove mode or aliasing information. */
942 if (TYPE_MODE (t1) != TYPE_MODE (t2)
943 || TYPE_REF_CAN_ALIAS_ALL (t1) != TYPE_REF_CAN_ALIAS_ALL (t2))
945 val = (TREE_TYPE (t1) == TREE_TYPE (t2)
946 ? 1 : comptypes_internal (TREE_TYPE (t1), TREE_TYPE (t2)));
950 val = function_types_compatible_p (t1, t2);
955 tree d1 = TYPE_DOMAIN (t1);
956 tree d2 = TYPE_DOMAIN (t2);
957 bool d1_variable, d2_variable;
958 bool d1_zero, d2_zero;
961 /* Target types must match incl. qualifiers. */
962 if (TREE_TYPE (t1) != TREE_TYPE (t2)
963 && 0 == (val = comptypes_internal (TREE_TYPE (t1), TREE_TYPE (t2))))
966 /* Sizes must match unless one is missing or variable. */
967 if (d1 == 0 || d2 == 0 || d1 == d2)
970 d1_zero = !TYPE_MAX_VALUE (d1);
971 d2_zero = !TYPE_MAX_VALUE (d2);
973 d1_variable = (!d1_zero
974 && (TREE_CODE (TYPE_MIN_VALUE (d1)) != INTEGER_CST
975 || TREE_CODE (TYPE_MAX_VALUE (d1)) != INTEGER_CST));
976 d2_variable = (!d2_zero
977 && (TREE_CODE (TYPE_MIN_VALUE (d2)) != INTEGER_CST
978 || TREE_CODE (TYPE_MAX_VALUE (d2)) != INTEGER_CST));
979 d1_variable = d1_variable || (d1_zero && c_vla_type_p (t1));
980 d2_variable = d2_variable || (d2_zero && c_vla_type_p (t2));
982 if (d1_variable || d2_variable)
984 if (d1_zero && d2_zero)
986 if (d1_zero || d2_zero
987 || !tree_int_cst_equal (TYPE_MIN_VALUE (d1), TYPE_MIN_VALUE (d2))
988 || !tree_int_cst_equal (TYPE_MAX_VALUE (d1), TYPE_MAX_VALUE (d2)))
997 if (val != 1 && !same_translation_unit_p (t1, t2))
999 tree a1 = TYPE_ATTRIBUTES (t1);
1000 tree a2 = TYPE_ATTRIBUTES (t2);
1002 if (! attribute_list_contained (a1, a2)
1003 && ! attribute_list_contained (a2, a1))
1007 return tagged_types_tu_compatible_p (t1, t2);
1008 val = tagged_types_tu_compatible_p (t1, t2);
1013 val = TYPE_VECTOR_SUBPARTS (t1) == TYPE_VECTOR_SUBPARTS (t2)
1014 && comptypes_internal (TREE_TYPE (t1), TREE_TYPE (t2));
1020 return attrval == 2 && val == 1 ? 2 : val;
1023 /* Return 1 if TTL and TTR are pointers to types that are equivalent,
1024 ignoring their qualifiers. */
1027 comp_target_types (tree ttl, tree ttr)
1032 /* Do not lose qualifiers on element types of array types that are
1033 pointer targets by taking their TYPE_MAIN_VARIANT. */
1034 mvl = TREE_TYPE (ttl);
1035 mvr = TREE_TYPE (ttr);
1036 if (TREE_CODE (mvl) != ARRAY_TYPE)
1037 mvl = TYPE_MAIN_VARIANT (mvl);
1038 if (TREE_CODE (mvr) != ARRAY_TYPE)
1039 mvr = TYPE_MAIN_VARIANT (mvr);
1040 val = comptypes (mvl, mvr);
1042 if (val == 2 && pedantic)
1043 pedwarn ("types are not quite compatible");
1047 /* Subroutines of `comptypes'. */
1049 /* Determine whether two trees derive from the same translation unit.
1050 If the CONTEXT chain ends in a null, that tree's context is still
1051 being parsed, so if two trees have context chains ending in null,
1052 they're in the same translation unit. */
1054 same_translation_unit_p (const_tree t1, const_tree t2)
1056 while (t1 && TREE_CODE (t1) != TRANSLATION_UNIT_DECL)
1057 switch (TREE_CODE_CLASS (TREE_CODE (t1)))
1059 case tcc_declaration:
1060 t1 = DECL_CONTEXT (t1); break;
1062 t1 = TYPE_CONTEXT (t1); break;
1063 case tcc_exceptional:
1064 t1 = BLOCK_SUPERCONTEXT (t1); break; /* assume block */
1065 default: gcc_unreachable ();
1068 while (t2 && TREE_CODE (t2) != TRANSLATION_UNIT_DECL)
1069 switch (TREE_CODE_CLASS (TREE_CODE (t2)))
1071 case tcc_declaration:
1072 t2 = DECL_CONTEXT (t2); break;
1074 t2 = TYPE_CONTEXT (t2); break;
1075 case tcc_exceptional:
1076 t2 = BLOCK_SUPERCONTEXT (t2); break; /* assume block */
1077 default: gcc_unreachable ();
1083 /* Allocate the seen two types, assuming that they are compatible. */
1085 static struct tagged_tu_seen_cache *
1086 alloc_tagged_tu_seen_cache (const_tree t1, const_tree t2)
1088 struct tagged_tu_seen_cache *tu = XNEW (struct tagged_tu_seen_cache);
1089 tu->next = tagged_tu_seen_base;
1093 tagged_tu_seen_base = tu;
1095 /* The C standard says that two structures in different translation
1096 units are compatible with each other only if the types of their
1097 fields are compatible (among other things). We assume that they
1098 are compatible until proven otherwise when building the cache.
1099 An example where this can occur is:
1104 If we are comparing this against a similar struct in another TU,
1105 and did not assume they were compatible, we end up with an infinite
1111 /* Free the seen types until we get to TU_TIL. */
1114 free_all_tagged_tu_seen_up_to (const struct tagged_tu_seen_cache *tu_til)
1116 const struct tagged_tu_seen_cache *tu = tagged_tu_seen_base;
1117 while (tu != tu_til)
1119 const struct tagged_tu_seen_cache *const tu1
1120 = (const struct tagged_tu_seen_cache *) tu;
1122 free (CONST_CAST (struct tagged_tu_seen_cache *, tu1));
1124 tagged_tu_seen_base = tu_til;
1127 /* Return 1 if two 'struct', 'union', or 'enum' types T1 and T2 are
1128 compatible. If the two types are not the same (which has been
1129 checked earlier), this can only happen when multiple translation
1130 units are being compiled. See C99 6.2.7 paragraph 1 for the exact
1134 tagged_types_tu_compatible_p (const_tree t1, const_tree t2)
1137 bool needs_warning = false;
1139 /* We have to verify that the tags of the types are the same. This
1140 is harder than it looks because this may be a typedef, so we have
1141 to go look at the original type. It may even be a typedef of a
1143 In the case of compiler-created builtin structs the TYPE_DECL
1144 may be a dummy, with no DECL_ORIGINAL_TYPE. Don't fault. */
1145 while (TYPE_NAME (t1)
1146 && TREE_CODE (TYPE_NAME (t1)) == TYPE_DECL
1147 && DECL_ORIGINAL_TYPE (TYPE_NAME (t1)))
1148 t1 = DECL_ORIGINAL_TYPE (TYPE_NAME (t1));
1150 while (TYPE_NAME (t2)
1151 && TREE_CODE (TYPE_NAME (t2)) == TYPE_DECL
1152 && DECL_ORIGINAL_TYPE (TYPE_NAME (t2)))
1153 t2 = DECL_ORIGINAL_TYPE (TYPE_NAME (t2));
1155 /* C90 didn't have the requirement that the two tags be the same. */
1156 if (flag_isoc99 && TYPE_NAME (t1) != TYPE_NAME (t2))
1159 /* C90 didn't say what happened if one or both of the types were
1160 incomplete; we choose to follow C99 rules here, which is that they
1162 if (TYPE_SIZE (t1) == NULL
1163 || TYPE_SIZE (t2) == NULL)
1167 const struct tagged_tu_seen_cache * tts_i;
1168 for (tts_i = tagged_tu_seen_base; tts_i != NULL; tts_i = tts_i->next)
1169 if (tts_i->t1 == t1 && tts_i->t2 == t2)
1173 switch (TREE_CODE (t1))
1177 struct tagged_tu_seen_cache *tu = alloc_tagged_tu_seen_cache (t1, t2);
1178 /* Speed up the case where the type values are in the same order. */
1179 tree tv1 = TYPE_VALUES (t1);
1180 tree tv2 = TYPE_VALUES (t2);
1187 for (;tv1 && tv2; tv1 = TREE_CHAIN (tv1), tv2 = TREE_CHAIN (tv2))
1189 if (TREE_PURPOSE (tv1) != TREE_PURPOSE (tv2))
1191 if (simple_cst_equal (TREE_VALUE (tv1), TREE_VALUE (tv2)) != 1)
1198 if (tv1 == NULL_TREE && tv2 == NULL_TREE)
1202 if (tv1 == NULL_TREE || tv2 == NULL_TREE)
1208 if (list_length (TYPE_VALUES (t1)) != list_length (TYPE_VALUES (t2)))
1214 for (s1 = TYPE_VALUES (t1); s1; s1 = TREE_CHAIN (s1))
1216 s2 = purpose_member (TREE_PURPOSE (s1), TYPE_VALUES (t2));
1218 || simple_cst_equal (TREE_VALUE (s1), TREE_VALUE (s2)) != 1)
1229 struct tagged_tu_seen_cache *tu = alloc_tagged_tu_seen_cache (t1, t2);
1230 if (list_length (TYPE_FIELDS (t1)) != list_length (TYPE_FIELDS (t2)))
1236 /* Speed up the common case where the fields are in the same order. */
1237 for (s1 = TYPE_FIELDS (t1), s2 = TYPE_FIELDS (t2); s1 && s2;
1238 s1 = TREE_CHAIN (s1), s2 = TREE_CHAIN (s2))
1242 if (DECL_NAME (s1) != DECL_NAME (s2))
1244 result = comptypes_internal (TREE_TYPE (s1), TREE_TYPE (s2));
1246 if (result != 1 && !DECL_NAME (s1))
1254 needs_warning = true;
1256 if (TREE_CODE (s1) == FIELD_DECL
1257 && simple_cst_equal (DECL_FIELD_BIT_OFFSET (s1),
1258 DECL_FIELD_BIT_OFFSET (s2)) != 1)
1266 tu->val = needs_warning ? 2 : 1;
1270 for (s1 = TYPE_FIELDS (t1); s1; s1 = TREE_CHAIN (s1))
1274 for (s2 = TYPE_FIELDS (t2); s2; s2 = TREE_CHAIN (s2))
1275 if (DECL_NAME (s1) == DECL_NAME (s2))
1279 result = comptypes_internal (TREE_TYPE (s1), TREE_TYPE (s2));
1281 if (result != 1 && !DECL_NAME (s1))
1289 needs_warning = true;
1291 if (TREE_CODE (s1) == FIELD_DECL
1292 && simple_cst_equal (DECL_FIELD_BIT_OFFSET (s1),
1293 DECL_FIELD_BIT_OFFSET (s2)) != 1)
1305 tu->val = needs_warning ? 2 : 10;
1311 struct tagged_tu_seen_cache *tu = alloc_tagged_tu_seen_cache (t1, t2);
1313 for (s1 = TYPE_FIELDS (t1), s2 = TYPE_FIELDS (t2);
1315 s1 = TREE_CHAIN (s1), s2 = TREE_CHAIN (s2))
1318 if (TREE_CODE (s1) != TREE_CODE (s2)
1319 || DECL_NAME (s1) != DECL_NAME (s2))
1321 result = comptypes_internal (TREE_TYPE (s1), TREE_TYPE (s2));
1325 needs_warning = true;
1327 if (TREE_CODE (s1) == FIELD_DECL
1328 && simple_cst_equal (DECL_FIELD_BIT_OFFSET (s1),
1329 DECL_FIELD_BIT_OFFSET (s2)) != 1)
1335 tu->val = needs_warning ? 2 : 1;
1344 /* Return 1 if two function types F1 and F2 are compatible.
1345 If either type specifies no argument types,
1346 the other must specify a fixed number of self-promoting arg types.
1347 Otherwise, if one type specifies only the number of arguments,
1348 the other must specify that number of self-promoting arg types.
1349 Otherwise, the argument types must match. */
1352 function_types_compatible_p (const_tree f1, const_tree f2)
1355 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1360 ret1 = TREE_TYPE (f1);
1361 ret2 = TREE_TYPE (f2);
1363 /* 'volatile' qualifiers on a function's return type used to mean
1364 the function is noreturn. */
1365 if (TYPE_VOLATILE (ret1) != TYPE_VOLATILE (ret2))
1366 pedwarn ("function return types not compatible due to %<volatile%>");
1367 if (TYPE_VOLATILE (ret1))
1368 ret1 = build_qualified_type (TYPE_MAIN_VARIANT (ret1),
1369 TYPE_QUALS (ret1) & ~TYPE_QUAL_VOLATILE);
1370 if (TYPE_VOLATILE (ret2))
1371 ret2 = build_qualified_type (TYPE_MAIN_VARIANT (ret2),
1372 TYPE_QUALS (ret2) & ~TYPE_QUAL_VOLATILE);
1373 val = comptypes_internal (ret1, ret2);
1377 args1 = TYPE_ARG_TYPES (f1);
1378 args2 = TYPE_ARG_TYPES (f2);
1380 /* An unspecified parmlist matches any specified parmlist
1381 whose argument types don't need default promotions. */
1385 if (!self_promoting_args_p (args2))
1387 /* If one of these types comes from a non-prototype fn definition,
1388 compare that with the other type's arglist.
1389 If they don't match, ask for a warning (but no error). */
1390 if (TYPE_ACTUAL_ARG_TYPES (f1)
1391 && 1 != type_lists_compatible_p (args2, TYPE_ACTUAL_ARG_TYPES (f1)))
1397 if (!self_promoting_args_p (args1))
1399 if (TYPE_ACTUAL_ARG_TYPES (f2)
1400 && 1 != type_lists_compatible_p (args1, TYPE_ACTUAL_ARG_TYPES (f2)))
1405 /* Both types have argument lists: compare them and propagate results. */
1406 val1 = type_lists_compatible_p (args1, args2);
1407 return val1 != 1 ? val1 : val;
1410 /* Check two lists of types for compatibility,
1411 returning 0 for incompatible, 1 for compatible,
1412 or 2 for compatible with warning. */
1415 type_lists_compatible_p (const_tree args1, const_tree args2)
1417 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1423 tree a1, mv1, a2, mv2;
1424 if (args1 == 0 && args2 == 0)
1426 /* If one list is shorter than the other,
1427 they fail to match. */
1428 if (args1 == 0 || args2 == 0)
1430 mv1 = a1 = TREE_VALUE (args1);
1431 mv2 = a2 = TREE_VALUE (args2);
1432 if (mv1 && mv1 != error_mark_node && TREE_CODE (mv1) != ARRAY_TYPE)
1433 mv1 = TYPE_MAIN_VARIANT (mv1);
1434 if (mv2 && mv2 != error_mark_node && TREE_CODE (mv2) != ARRAY_TYPE)
1435 mv2 = TYPE_MAIN_VARIANT (mv2);
1436 /* A null pointer instead of a type
1437 means there is supposed to be an argument
1438 but nothing is specified about what type it has.
1439 So match anything that self-promotes. */
1442 if (c_type_promotes_to (a2) != a2)
1447 if (c_type_promotes_to (a1) != a1)
1450 /* If one of the lists has an error marker, ignore this arg. */
1451 else if (TREE_CODE (a1) == ERROR_MARK
1452 || TREE_CODE (a2) == ERROR_MARK)
1454 else if (!(newval = comptypes_internal (mv1, mv2)))
1456 /* Allow wait (union {union wait *u; int *i} *)
1457 and wait (union wait *) to be compatible. */
1458 if (TREE_CODE (a1) == UNION_TYPE
1459 && (TYPE_NAME (a1) == 0
1460 || TYPE_TRANSPARENT_UNION (a1))
1461 && TREE_CODE (TYPE_SIZE (a1)) == INTEGER_CST
1462 && tree_int_cst_equal (TYPE_SIZE (a1),
1466 for (memb = TYPE_FIELDS (a1);
1467 memb; memb = TREE_CHAIN (memb))
1469 tree mv3 = TREE_TYPE (memb);
1470 if (mv3 && mv3 != error_mark_node
1471 && TREE_CODE (mv3) != ARRAY_TYPE)
1472 mv3 = TYPE_MAIN_VARIANT (mv3);
1473 if (comptypes_internal (mv3, mv2))
1479 else if (TREE_CODE (a2) == UNION_TYPE
1480 && (TYPE_NAME (a2) == 0
1481 || TYPE_TRANSPARENT_UNION (a2))
1482 && TREE_CODE (TYPE_SIZE (a2)) == INTEGER_CST
1483 && tree_int_cst_equal (TYPE_SIZE (a2),
1487 for (memb = TYPE_FIELDS (a2);
1488 memb; memb = TREE_CHAIN (memb))
1490 tree mv3 = TREE_TYPE (memb);
1491 if (mv3 && mv3 != error_mark_node
1492 && TREE_CODE (mv3) != ARRAY_TYPE)
1493 mv3 = TYPE_MAIN_VARIANT (mv3);
1494 if (comptypes_internal (mv3, mv1))
1504 /* comptypes said ok, but record if it said to warn. */
1508 args1 = TREE_CHAIN (args1);
1509 args2 = TREE_CHAIN (args2);
1513 /* Compute the size to increment a pointer by. */
1516 c_size_in_bytes (const_tree type)
1518 enum tree_code code = TREE_CODE (type);
1520 if (code == FUNCTION_TYPE || code == VOID_TYPE || code == ERROR_MARK)
1521 return size_one_node;
1523 if (!COMPLETE_OR_VOID_TYPE_P (type))
1525 error ("arithmetic on pointer to an incomplete type");
1526 return size_one_node;
1529 /* Convert in case a char is more than one unit. */
1530 return size_binop (CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type),
1531 size_int (TYPE_PRECISION (char_type_node)
1535 /* Return either DECL or its known constant value (if it has one). */
1538 decl_constant_value (tree decl)
1540 if (/* Don't change a variable array bound or initial value to a constant
1541 in a place where a variable is invalid. Note that DECL_INITIAL
1542 isn't valid for a PARM_DECL. */
1543 current_function_decl != 0
1544 && TREE_CODE (decl) != PARM_DECL
1545 && !TREE_THIS_VOLATILE (decl)
1546 && TREE_READONLY (decl)
1547 && DECL_INITIAL (decl) != 0
1548 && TREE_CODE (DECL_INITIAL (decl)) != ERROR_MARK
1549 /* This is invalid if initial value is not constant.
1550 If it has either a function call, a memory reference,
1551 or a variable, then re-evaluating it could give different results. */
1552 && TREE_CONSTANT (DECL_INITIAL (decl))
1553 /* Check for cases where this is sub-optimal, even though valid. */
1554 && TREE_CODE (DECL_INITIAL (decl)) != CONSTRUCTOR)
1555 return DECL_INITIAL (decl);
1559 /* Return either DECL or its known constant value (if it has one), but
1560 return DECL if pedantic or DECL has mode BLKmode. This is for
1561 bug-compatibility with the old behavior of decl_constant_value
1562 (before GCC 3.0); every use of this function is a bug and it should
1563 be removed before GCC 3.1. It is not appropriate to use pedantic
1564 in a way that affects optimization, and BLKmode is probably not the
1565 right test for avoiding misoptimizations either. */
1568 decl_constant_value_for_broken_optimization (tree decl)
1572 if (pedantic || DECL_MODE (decl) == BLKmode)
1575 ret = decl_constant_value (decl);
1576 /* Avoid unwanted tree sharing between the initializer and current
1577 function's body where the tree can be modified e.g. by the
1579 if (ret != decl && TREE_STATIC (decl))
1580 ret = unshare_expr (ret);
1584 /* Convert the array expression EXP to a pointer. */
1586 array_to_pointer_conversion (tree exp)
1588 tree orig_exp = exp;
1589 tree type = TREE_TYPE (exp);
1591 tree restype = TREE_TYPE (type);
1594 gcc_assert (TREE_CODE (type) == ARRAY_TYPE);
1596 STRIP_TYPE_NOPS (exp);
1598 if (TREE_NO_WARNING (orig_exp))
1599 TREE_NO_WARNING (exp) = 1;
1601 ptrtype = build_pointer_type (restype);
1603 if (TREE_CODE (exp) == INDIRECT_REF)
1604 return convert (ptrtype, TREE_OPERAND (exp, 0));
1606 if (TREE_CODE (exp) == VAR_DECL)
1608 /* We are making an ADDR_EXPR of ptrtype. This is a valid
1609 ADDR_EXPR because it's the best way of representing what
1610 happens in C when we take the address of an array and place
1611 it in a pointer to the element type. */
1612 adr = build1 (ADDR_EXPR, ptrtype, exp);
1613 if (!c_mark_addressable (exp))
1614 return error_mark_node;
1615 TREE_SIDE_EFFECTS (adr) = 0; /* Default would be, same as EXP. */
1619 /* This way is better for a COMPONENT_REF since it can
1620 simplify the offset for a component. */
1621 adr = build_unary_op (ADDR_EXPR, exp, 1);
1622 return convert (ptrtype, adr);
1625 /* Convert the function expression EXP to a pointer. */
1627 function_to_pointer_conversion (tree exp)
1629 tree orig_exp = exp;
1631 gcc_assert (TREE_CODE (TREE_TYPE (exp)) == FUNCTION_TYPE);
1633 STRIP_TYPE_NOPS (exp);
1635 if (TREE_NO_WARNING (orig_exp))
1636 TREE_NO_WARNING (exp) = 1;
1638 return build_unary_op (ADDR_EXPR, exp, 0);
1641 /* Perform the default conversion of arrays and functions to pointers.
1642 Return the result of converting EXP. For any other expression, just
1643 return EXP after removing NOPs. */
1646 default_function_array_conversion (struct c_expr exp)
1648 tree orig_exp = exp.value;
1649 tree type = TREE_TYPE (exp.value);
1650 enum tree_code code = TREE_CODE (type);
1656 bool not_lvalue = false;
1657 bool lvalue_array_p;
1659 while ((TREE_CODE (exp.value) == NON_LVALUE_EXPR
1660 || TREE_CODE (exp.value) == NOP_EXPR
1661 || TREE_CODE (exp.value) == CONVERT_EXPR)
1662 && TREE_TYPE (TREE_OPERAND (exp.value, 0)) == type)
1664 if (TREE_CODE (exp.value) == NON_LVALUE_EXPR)
1666 exp.value = TREE_OPERAND (exp.value, 0);
1669 if (TREE_NO_WARNING (orig_exp))
1670 TREE_NO_WARNING (exp.value) = 1;
1672 lvalue_array_p = !not_lvalue && lvalue_p (exp.value);
1673 if (!flag_isoc99 && !lvalue_array_p)
1675 /* Before C99, non-lvalue arrays do not decay to pointers.
1676 Normally, using such an array would be invalid; but it can
1677 be used correctly inside sizeof or as a statement expression.
1678 Thus, do not give an error here; an error will result later. */
1682 exp.value = array_to_pointer_conversion (exp.value);
1686 exp.value = function_to_pointer_conversion (exp.value);
1689 STRIP_TYPE_NOPS (exp.value);
1690 if (TREE_NO_WARNING (orig_exp))
1691 TREE_NO_WARNING (exp.value) = 1;
1699 /* EXP is an expression of integer type. Apply the integer promotions
1700 to it and return the promoted value. */
1703 perform_integral_promotions (tree exp)
1705 tree type = TREE_TYPE (exp);
1706 enum tree_code code = TREE_CODE (type);
1708 gcc_assert (INTEGRAL_TYPE_P (type));
1710 /* Normally convert enums to int,
1711 but convert wide enums to something wider. */
1712 if (code == ENUMERAL_TYPE)
1714 type = c_common_type_for_size (MAX (TYPE_PRECISION (type),
1715 TYPE_PRECISION (integer_type_node)),
1716 ((TYPE_PRECISION (type)
1717 >= TYPE_PRECISION (integer_type_node))
1718 && TYPE_UNSIGNED (type)));
1720 return convert (type, exp);
1723 /* ??? This should no longer be needed now bit-fields have their
1725 if (TREE_CODE (exp) == COMPONENT_REF
1726 && DECL_C_BIT_FIELD (TREE_OPERAND (exp, 1))
1727 /* If it's thinner than an int, promote it like a
1728 c_promoting_integer_type_p, otherwise leave it alone. */
1729 && 0 > compare_tree_int (DECL_SIZE (TREE_OPERAND (exp, 1)),
1730 TYPE_PRECISION (integer_type_node)))
1731 return convert (integer_type_node, exp);
1733 if (c_promoting_integer_type_p (type))
1735 /* Preserve unsignedness if not really getting any wider. */
1736 if (TYPE_UNSIGNED (type)
1737 && TYPE_PRECISION (type) == TYPE_PRECISION (integer_type_node))
1738 return convert (unsigned_type_node, exp);
1740 return convert (integer_type_node, exp);
1747 /* Perform default promotions for C data used in expressions.
1748 Enumeral types or short or char are converted to int.
1749 In addition, manifest constants symbols are replaced by their values. */
1752 default_conversion (tree exp)
1755 tree type = TREE_TYPE (exp);
1756 enum tree_code code = TREE_CODE (type);
1758 /* Functions and arrays have been converted during parsing. */
1759 gcc_assert (code != FUNCTION_TYPE);
1760 if (code == ARRAY_TYPE)
1763 /* Constants can be used directly unless they're not loadable. */
1764 if (TREE_CODE (exp) == CONST_DECL)
1765 exp = DECL_INITIAL (exp);
1767 /* Replace a nonvolatile const static variable with its value unless
1768 it is an array, in which case we must be sure that taking the
1769 address of the array produces consistent results. */
1770 else if (optimize && TREE_CODE (exp) == VAR_DECL && code != ARRAY_TYPE)
1772 exp = decl_constant_value_for_broken_optimization (exp);
1773 type = TREE_TYPE (exp);
1776 /* Strip no-op conversions. */
1778 STRIP_TYPE_NOPS (exp);
1780 if (TREE_NO_WARNING (orig_exp))
1781 TREE_NO_WARNING (exp) = 1;
1783 if (code == VOID_TYPE)
1785 error ("void value not ignored as it ought to be");
1786 return error_mark_node;
1789 exp = require_complete_type (exp);
1790 if (exp == error_mark_node)
1791 return error_mark_node;
1793 if (INTEGRAL_TYPE_P (type))
1794 return perform_integral_promotions (exp);
1799 /* Look up COMPONENT in a structure or union DECL.
1801 If the component name is not found, returns NULL_TREE. Otherwise,
1802 the return value is a TREE_LIST, with each TREE_VALUE a FIELD_DECL
1803 stepping down the chain to the component, which is in the last
1804 TREE_VALUE of the list. Normally the list is of length one, but if
1805 the component is embedded within (nested) anonymous structures or
1806 unions, the list steps down the chain to the component. */
1809 lookup_field (tree decl, tree component)
1811 tree type = TREE_TYPE (decl);
1814 /* If TYPE_LANG_SPECIFIC is set, then it is a sorted array of pointers
1815 to the field elements. Use a binary search on this array to quickly
1816 find the element. Otherwise, do a linear search. TYPE_LANG_SPECIFIC
1817 will always be set for structures which have many elements. */
1819 if (TYPE_LANG_SPECIFIC (type) && TYPE_LANG_SPECIFIC (type)->s)
1822 tree *field_array = &TYPE_LANG_SPECIFIC (type)->s->elts[0];
1824 field = TYPE_FIELDS (type);
1826 top = TYPE_LANG_SPECIFIC (type)->s->len;
1827 while (top - bot > 1)
1829 half = (top - bot + 1) >> 1;
1830 field = field_array[bot+half];
1832 if (DECL_NAME (field) == NULL_TREE)
1834 /* Step through all anon unions in linear fashion. */
1835 while (DECL_NAME (field_array[bot]) == NULL_TREE)
1837 field = field_array[bot++];
1838 if (TREE_CODE (TREE_TYPE (field)) == RECORD_TYPE
1839 || TREE_CODE (TREE_TYPE (field)) == UNION_TYPE)
1841 tree anon = lookup_field (field, component);
1844 return tree_cons (NULL_TREE, field, anon);
1848 /* Entire record is only anon unions. */
1852 /* Restart the binary search, with new lower bound. */
1856 if (DECL_NAME (field) == component)
1858 if (DECL_NAME (field) < component)
1864 if (DECL_NAME (field_array[bot]) == component)
1865 field = field_array[bot];
1866 else if (DECL_NAME (field) != component)
1871 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
1873 if (DECL_NAME (field) == NULL_TREE
1874 && (TREE_CODE (TREE_TYPE (field)) == RECORD_TYPE
1875 || TREE_CODE (TREE_TYPE (field)) == UNION_TYPE))
1877 tree anon = lookup_field (field, component);
1880 return tree_cons (NULL_TREE, field, anon);
1883 if (DECL_NAME (field) == component)
1887 if (field == NULL_TREE)
1891 return tree_cons (NULL_TREE, field, NULL_TREE);
1894 /* Make an expression to refer to the COMPONENT field of
1895 structure or union value DATUM. COMPONENT is an IDENTIFIER_NODE. */
1898 build_component_ref (tree datum, tree component)
1900 tree type = TREE_TYPE (datum);
1901 enum tree_code code = TREE_CODE (type);
1905 if (!objc_is_public (datum, component))
1906 return error_mark_node;
1908 /* See if there is a field or component with name COMPONENT. */
1910 if (code == RECORD_TYPE || code == UNION_TYPE)
1912 if (!COMPLETE_TYPE_P (type))
1914 c_incomplete_type_error (NULL_TREE, type);
1915 return error_mark_node;
1918 field = lookup_field (datum, component);
1922 error ("%qT has no member named %qE", type, component);
1923 return error_mark_node;
1926 /* Chain the COMPONENT_REFs if necessary down to the FIELD.
1927 This might be better solved in future the way the C++ front
1928 end does it - by giving the anonymous entities each a
1929 separate name and type, and then have build_component_ref
1930 recursively call itself. We can't do that here. */
1933 tree subdatum = TREE_VALUE (field);
1937 if (TREE_TYPE (subdatum) == error_mark_node)
1938 return error_mark_node;
1940 quals = TYPE_QUALS (strip_array_types (TREE_TYPE (subdatum)));
1941 quals |= TYPE_QUALS (TREE_TYPE (datum));
1942 subtype = c_build_qualified_type (TREE_TYPE (subdatum), quals);
1944 ref = build3 (COMPONENT_REF, subtype, datum, subdatum,
1946 if (TREE_READONLY (datum) || TREE_READONLY (subdatum))
1947 TREE_READONLY (ref) = 1;
1948 if (TREE_THIS_VOLATILE (datum) || TREE_THIS_VOLATILE (subdatum))
1949 TREE_THIS_VOLATILE (ref) = 1;
1951 if (TREE_DEPRECATED (subdatum))
1952 warn_deprecated_use (subdatum);
1956 field = TREE_CHAIN (field);
1962 else if (code != ERROR_MARK)
1963 error ("request for member %qE in something not a structure or union",
1966 return error_mark_node;
1969 /* Given an expression PTR for a pointer, return an expression
1970 for the value pointed to.
1971 ERRORSTRING is the name of the operator to appear in error messages. */
1974 build_indirect_ref (tree ptr, const char *errorstring)
1976 tree pointer = default_conversion (ptr);
1977 tree type = TREE_TYPE (pointer);
1979 if (TREE_CODE (type) == POINTER_TYPE)
1981 if (TREE_CODE (pointer) == CONVERT_EXPR
1982 || TREE_CODE (pointer) == NOP_EXPR
1983 || TREE_CODE (pointer) == VIEW_CONVERT_EXPR)
1985 /* If a warning is issued, mark it to avoid duplicates from
1986 the backend. This only needs to be done at
1987 warn_strict_aliasing > 2. */
1988 if (warn_strict_aliasing > 2)
1989 if (strict_aliasing_warning (TREE_TYPE (TREE_OPERAND (pointer, 0)),
1990 type, TREE_OPERAND (pointer, 0)))
1991 TREE_NO_WARNING (pointer) = 1;
1994 if (TREE_CODE (pointer) == ADDR_EXPR
1995 && (TREE_TYPE (TREE_OPERAND (pointer, 0))
1996 == TREE_TYPE (type)))
1997 return TREE_OPERAND (pointer, 0);
2000 tree t = TREE_TYPE (type);
2003 ref = build1 (INDIRECT_REF, t, pointer);
2005 if (!COMPLETE_OR_VOID_TYPE_P (t) && TREE_CODE (t) != ARRAY_TYPE)
2007 error ("dereferencing pointer to incomplete type");
2008 return error_mark_node;
2010 if (VOID_TYPE_P (t) && skip_evaluation == 0)
2011 warning (0, "dereferencing %<void *%> pointer");
2013 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
2014 so that we get the proper error message if the result is used
2015 to assign to. Also, &* is supposed to be a no-op.
2016 And ANSI C seems to specify that the type of the result
2017 should be the const type. */
2018 /* A de-reference of a pointer to const is not a const. It is valid
2019 to change it via some other pointer. */
2020 TREE_READONLY (ref) = TYPE_READONLY (t);
2021 TREE_SIDE_EFFECTS (ref)
2022 = TYPE_VOLATILE (t) || TREE_SIDE_EFFECTS (pointer);
2023 TREE_THIS_VOLATILE (ref) = TYPE_VOLATILE (t);
2027 else if (TREE_CODE (pointer) != ERROR_MARK)
2028 error ("invalid type argument of %qs (have %qT)", errorstring, type);
2029 return error_mark_node;
2032 /* This handles expressions of the form "a[i]", which denotes
2035 This is logically equivalent in C to *(a+i), but we may do it differently.
2036 If A is a variable or a member, we generate a primitive ARRAY_REF.
2037 This avoids forcing the array out of registers, and can work on
2038 arrays that are not lvalues (for example, members of structures returned
2042 build_array_ref (tree array, tree index)
2044 bool swapped = false;
2045 if (TREE_TYPE (array) == error_mark_node
2046 || TREE_TYPE (index) == error_mark_node)
2047 return error_mark_node;
2049 if (TREE_CODE (TREE_TYPE (array)) != ARRAY_TYPE
2050 && TREE_CODE (TREE_TYPE (array)) != POINTER_TYPE)
2053 if (TREE_CODE (TREE_TYPE (index)) != ARRAY_TYPE
2054 && TREE_CODE (TREE_TYPE (index)) != POINTER_TYPE)
2056 error ("subscripted value is neither array nor pointer");
2057 return error_mark_node;
2065 if (!INTEGRAL_TYPE_P (TREE_TYPE (index)))
2067 error ("array subscript is not an integer");
2068 return error_mark_node;
2071 if (TREE_CODE (TREE_TYPE (TREE_TYPE (array))) == FUNCTION_TYPE)
2073 error ("subscripted value is pointer to function");
2074 return error_mark_node;
2077 /* ??? Existing practice has been to warn only when the char
2078 index is syntactically the index, not for char[array]. */
2080 warn_array_subscript_with_type_char (index);
2082 /* Apply default promotions *after* noticing character types. */
2083 index = default_conversion (index);
2085 gcc_assert (TREE_CODE (TREE_TYPE (index)) == INTEGER_TYPE);
2087 if (TREE_CODE (TREE_TYPE (array)) == ARRAY_TYPE)
2089 tree rval, type, ref;
2090 bool has_warned_on_bounds_check = false;
2092 /* Warn about any obvious array bounds errors for fixed size arrays that
2093 are indexed by a constant. */
2094 has_warned_on_bounds_check = warn_array_subscript_range (array, index);
2096 /* An array that is indexed by a non-constant
2097 cannot be stored in a register; we must be able to do
2098 address arithmetic on its address.
2099 Likewise an array of elements of variable size. */
2100 if (TREE_CODE (index) != INTEGER_CST
2101 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array)))
2102 && TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array)))) != INTEGER_CST))
2104 if (!c_mark_addressable (array))
2105 return error_mark_node;
2107 /* An array that is indexed by a constant value which is not within
2108 the array bounds cannot be stored in a register either; because we
2109 would get a crash in store_bit_field/extract_bit_field when trying
2110 to access a non-existent part of the register. */
2111 if (TREE_CODE (index) == INTEGER_CST
2112 && TYPE_DOMAIN (TREE_TYPE (array))
2113 && !int_fits_type_p (index, TYPE_DOMAIN (TREE_TYPE (array))))
2115 if (!c_mark_addressable (array))
2116 return error_mark_node;
2122 while (TREE_CODE (foo) == COMPONENT_REF)
2123 foo = TREE_OPERAND (foo, 0);
2124 if (TREE_CODE (foo) == VAR_DECL && C_DECL_REGISTER (foo))
2125 pedwarn ("ISO C forbids subscripting %<register%> array");
2126 else if (!flag_isoc99 && !lvalue_p (foo))
2127 pedwarn ("ISO C90 forbids subscripting non-lvalue array");
2130 type = TREE_TYPE (TREE_TYPE (array));
2131 rval = build4 (ARRAY_REF, type, array, index, NULL_TREE, NULL_TREE);
2132 /* Array ref is const/volatile if the array elements are
2133 or if the array is. */
2134 TREE_READONLY (rval)
2135 |= (TYPE_READONLY (TREE_TYPE (TREE_TYPE (array)))
2136 | TREE_READONLY (array));
2137 TREE_SIDE_EFFECTS (rval)
2138 |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array)))
2139 | TREE_SIDE_EFFECTS (array));
2140 TREE_THIS_VOLATILE (rval)
2141 |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array)))
2142 /* This was added by rms on 16 Nov 91.
2143 It fixes vol struct foo *a; a->elts[1]
2144 in an inline function.
2145 Hope it doesn't break something else. */
2146 | TREE_THIS_VOLATILE (array));
2147 ref = require_complete_type (fold (rval));
2149 /* Suppress bounds warning in tree-vrp.c if already warned here. */
2150 if (has_warned_on_bounds_check)
2151 TREE_NO_WARNING (ref) = 1;
2156 tree ar = default_conversion (array);
2158 if (ar == error_mark_node)
2161 gcc_assert (TREE_CODE (TREE_TYPE (ar)) == POINTER_TYPE);
2162 gcc_assert (TREE_CODE (TREE_TYPE (TREE_TYPE (ar))) != FUNCTION_TYPE);
2164 return build_indirect_ref (build_binary_op (PLUS_EXPR, ar, index, 0),
2169 /* Build an external reference to identifier ID. FUN indicates
2170 whether this will be used for a function call. LOC is the source
2171 location of the identifier. */
2173 build_external_ref (tree id, int fun, location_t loc)
2176 tree decl = lookup_name (id);
2178 /* In Objective-C, an instance variable (ivar) may be preferred to
2179 whatever lookup_name() found. */
2180 decl = objc_lookup_ivar (decl, id);
2182 if (decl && decl != error_mark_node)
2185 /* Implicit function declaration. */
2186 ref = implicitly_declare (id);
2187 else if (decl == error_mark_node)
2188 /* Don't complain about something that's already been
2189 complained about. */
2190 return error_mark_node;
2193 undeclared_variable (id, loc);
2194 return error_mark_node;
2197 if (TREE_TYPE (ref) == error_mark_node)
2198 return error_mark_node;
2200 if (TREE_DEPRECATED (ref))
2201 warn_deprecated_use (ref);
2203 /* Recursive call does not count as usage. */
2204 if (ref != current_function_decl)
2206 if (!skip_evaluation)
2207 assemble_external (ref);
2208 TREE_USED (ref) = 1;
2211 if (TREE_CODE (ref) == FUNCTION_DECL && !in_alignof)
2213 if (!in_sizeof && !in_typeof)
2214 C_DECL_USED (ref) = 1;
2215 else if (DECL_INITIAL (ref) == 0
2216 && DECL_EXTERNAL (ref)
2217 && !TREE_PUBLIC (ref))
2218 record_maybe_used_decl (ref);
2221 if (TREE_CODE (ref) == CONST_DECL)
2223 used_types_insert (TREE_TYPE (ref));
2224 ref = DECL_INITIAL (ref);
2225 TREE_CONSTANT (ref) = 1;
2227 else if (current_function_decl != 0
2228 && !DECL_FILE_SCOPE_P (current_function_decl)
2229 && (TREE_CODE (ref) == VAR_DECL
2230 || TREE_CODE (ref) == PARM_DECL
2231 || TREE_CODE (ref) == FUNCTION_DECL))
2233 tree context = decl_function_context (ref);
2235 if (context != 0 && context != current_function_decl)
2236 DECL_NONLOCAL (ref) = 1;
2238 /* C99 6.7.4p3: An inline definition of a function with external
2239 linkage ... shall not contain a reference to an identifier with
2240 internal linkage. */
2241 else if (current_function_decl != 0
2242 && DECL_DECLARED_INLINE_P (current_function_decl)
2243 && DECL_EXTERNAL (current_function_decl)
2244 && VAR_OR_FUNCTION_DECL_P (ref)
2245 && (TREE_CODE (ref) != VAR_DECL || TREE_STATIC (ref))
2246 && ! TREE_PUBLIC (ref)
2247 && DECL_CONTEXT (ref) != current_function_decl)
2248 pedwarn ("%H%qD is static but used in inline function %qD "
2249 "which is not static", &loc, ref, current_function_decl);
2254 /* Record details of decls possibly used inside sizeof or typeof. */
2255 struct maybe_used_decl
2259 /* The level seen at (in_sizeof + in_typeof). */
2261 /* The next one at this level or above, or NULL. */
2262 struct maybe_used_decl *next;
2265 static struct maybe_used_decl *maybe_used_decls;
2267 /* Record that DECL, an undefined static function reference seen
2268 inside sizeof or typeof, might be used if the operand of sizeof is
2269 a VLA type or the operand of typeof is a variably modified
2273 record_maybe_used_decl (tree decl)
2275 struct maybe_used_decl *t = XOBNEW (&parser_obstack, struct maybe_used_decl);
2277 t->level = in_sizeof + in_typeof;
2278 t->next = maybe_used_decls;
2279 maybe_used_decls = t;
2282 /* Pop the stack of decls possibly used inside sizeof or typeof. If
2283 USED is false, just discard them. If it is true, mark them used
2284 (if no longer inside sizeof or typeof) or move them to the next
2285 level up (if still inside sizeof or typeof). */
2288 pop_maybe_used (bool used)
2290 struct maybe_used_decl *p = maybe_used_decls;
2291 int cur_level = in_sizeof + in_typeof;
2292 while (p && p->level > cur_level)
2297 C_DECL_USED (p->decl) = 1;
2299 p->level = cur_level;
2303 if (!used || cur_level == 0)
2304 maybe_used_decls = p;
2307 /* Return the result of sizeof applied to EXPR. */
2310 c_expr_sizeof_expr (struct c_expr expr)
2313 if (expr.value == error_mark_node)
2315 ret.value = error_mark_node;
2316 ret.original_code = ERROR_MARK;
2317 pop_maybe_used (false);
2321 ret.value = c_sizeof (TREE_TYPE (expr.value));
2322 ret.original_code = ERROR_MARK;
2323 if (c_vla_type_p (TREE_TYPE (expr.value)))
2325 /* sizeof is evaluated when given a vla (C99 6.5.3.4p2). */
2326 ret.value = build2 (COMPOUND_EXPR, TREE_TYPE (ret.value), expr.value, ret.value);
2328 pop_maybe_used (C_TYPE_VARIABLE_SIZE (TREE_TYPE (expr.value)));
2333 /* Return the result of sizeof applied to T, a structure for the type
2334 name passed to sizeof (rather than the type itself). */
2337 c_expr_sizeof_type (struct c_type_name *t)
2341 type = groktypename (t);
2342 ret.value = c_sizeof (type);
2343 ret.original_code = ERROR_MARK;
2344 pop_maybe_used (type != error_mark_node
2345 ? C_TYPE_VARIABLE_SIZE (type) : false);
2349 /* Build a function call to function FUNCTION with parameters PARAMS.
2350 PARAMS is a list--a chain of TREE_LIST nodes--in which the
2351 TREE_VALUE of each node is a parameter-expression.
2352 FUNCTION's data type may be a function type or a pointer-to-function. */
2355 build_function_call (tree function, tree params)
2357 tree fntype, fundecl = 0;
2358 tree name = NULL_TREE, result;
2364 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
2365 STRIP_TYPE_NOPS (function);
2367 /* Convert anything with function type to a pointer-to-function. */
2368 if (TREE_CODE (function) == FUNCTION_DECL)
2370 /* Implement type-directed function overloading for builtins.
2371 resolve_overloaded_builtin and targetm.resolve_overloaded_builtin
2372 handle all the type checking. The result is a complete expression
2373 that implements this function call. */
2374 tem = resolve_overloaded_builtin (function, params);
2378 name = DECL_NAME (function);
2381 if (TREE_CODE (TREE_TYPE (function)) == FUNCTION_TYPE)
2382 function = function_to_pointer_conversion (function);
2384 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
2385 expressions, like those used for ObjC messenger dispatches. */
2386 function = objc_rewrite_function_call (function, params);
2388 fntype = TREE_TYPE (function);
2390 if (TREE_CODE (fntype) == ERROR_MARK)
2391 return error_mark_node;
2393 if (!(TREE_CODE (fntype) == POINTER_TYPE
2394 && TREE_CODE (TREE_TYPE (fntype)) == FUNCTION_TYPE))
2396 error ("called object %qE is not a function", function);
2397 return error_mark_node;
2400 if (fundecl && TREE_THIS_VOLATILE (fundecl))
2401 current_function_returns_abnormally = 1;
2403 /* fntype now gets the type of function pointed to. */
2404 fntype = TREE_TYPE (fntype);
2406 /* Check that the function is called through a compatible prototype.
2407 If it is not, replace the call by a trap, wrapped up in a compound
2408 expression if necessary. This has the nice side-effect to prevent
2409 the tree-inliner from generating invalid assignment trees which may
2410 blow up in the RTL expander later. */
2411 if ((TREE_CODE (function) == NOP_EXPR
2412 || TREE_CODE (function) == CONVERT_EXPR)
2413 && TREE_CODE (tem = TREE_OPERAND (function, 0)) == ADDR_EXPR
2414 && TREE_CODE (tem = TREE_OPERAND (tem, 0)) == FUNCTION_DECL
2415 && !comptypes (fntype, TREE_TYPE (tem)))
2417 tree return_type = TREE_TYPE (fntype);
2418 tree trap = build_function_call (built_in_decls[BUILT_IN_TRAP],
2421 /* This situation leads to run-time undefined behavior. We can't,
2422 therefore, simply error unless we can prove that all possible
2423 executions of the program must execute the code. */
2424 warning (0, "function called through a non-compatible type");
2426 /* We can, however, treat "undefined" any way we please.
2427 Call abort to encourage the user to fix the program. */
2428 inform ("if this code is reached, the program will abort");
2430 if (VOID_TYPE_P (return_type))
2436 if (AGGREGATE_TYPE_P (return_type))
2437 rhs = build_compound_literal (return_type,
2438 build_constructor (return_type, 0));
2440 rhs = fold_convert (return_type, integer_zero_node);
2442 return build2 (COMPOUND_EXPR, return_type, trap, rhs);
2446 /* Convert the parameters to the types declared in the
2447 function prototype, or apply default promotions. */
2449 nargs = list_length (params);
2450 argarray = (tree *) alloca (nargs * sizeof (tree));
2451 nargs = convert_arguments (nargs, argarray, TYPE_ARG_TYPES (fntype),
2452 params, function, fundecl);
2454 return error_mark_node;
2456 /* Check that arguments to builtin functions match the expectations. */
2458 && DECL_BUILT_IN (fundecl)
2459 && DECL_BUILT_IN_CLASS (fundecl) == BUILT_IN_NORMAL
2460 && !check_builtin_function_arguments (fundecl, nargs, argarray))
2461 return error_mark_node;
2463 /* Check that the arguments to the function are valid. */
2464 check_function_arguments (TYPE_ATTRIBUTES (fntype), nargs, argarray,
2465 TYPE_ARG_TYPES (fntype));
2467 if (require_constant_value)
2469 result = fold_build_call_array_initializer (TREE_TYPE (fntype),
2470 function, nargs, argarray);
2471 if (TREE_CONSTANT (result)
2472 && (name == NULL_TREE
2473 || strncmp (IDENTIFIER_POINTER (name), "__builtin_", 10) != 0))
2474 pedwarn_init ("initializer element is not constant");
2477 result = fold_build_call_array (TREE_TYPE (fntype),
2478 function, nargs, argarray);
2480 if (VOID_TYPE_P (TREE_TYPE (result)))
2482 return require_complete_type (result);
2485 /* Convert the argument expressions in the list VALUES
2486 to the types in the list TYPELIST. The resulting arguments are
2487 stored in the array ARGARRAY which has size NARGS.
2489 If TYPELIST is exhausted, or when an element has NULL as its type,
2490 perform the default conversions.
2492 PARMLIST is the chain of parm decls for the function being called.
2493 It may be 0, if that info is not available.
2494 It is used only for generating error messages.
2496 FUNCTION is a tree for the called function. It is used only for
2497 error messages, where it is formatted with %qE.
2499 This is also where warnings about wrong number of args are generated.
2501 VALUES is a chain of TREE_LIST nodes with the elements of the list
2502 in the TREE_VALUE slots of those nodes.
2504 Returns the actual number of arguments processed (which may be less
2505 than NARGS in some error situations), or -1 on failure. */
2508 convert_arguments (int nargs, tree *argarray,
2509 tree typelist, tree values, tree function, tree fundecl)
2511 tree typetail, valtail;
2513 const bool type_generic = fundecl
2514 && lookup_attribute ("type generic", TYPE_ATTRIBUTES(TREE_TYPE (fundecl)));
2517 /* Change pointer to function to the function itself for
2519 if (TREE_CODE (function) == ADDR_EXPR
2520 && TREE_CODE (TREE_OPERAND (function, 0)) == FUNCTION_DECL)
2521 function = TREE_OPERAND (function, 0);
2523 /* Handle an ObjC selector specially for diagnostics. */
2524 selector = objc_message_selector ();
2526 /* Scan the given expressions and types, producing individual
2527 converted arguments and storing them in ARGARRAY. */
2529 for (valtail = values, typetail = typelist, parmnum = 0;
2531 valtail = TREE_CHAIN (valtail), parmnum++)
2533 tree type = typetail ? TREE_VALUE (typetail) : 0;
2534 tree val = TREE_VALUE (valtail);
2535 tree rname = function;
2536 int argnum = parmnum + 1;
2537 const char *invalid_func_diag;
2539 if (type == void_type_node)
2541 error ("too many arguments to function %qE", function);
2545 if (selector && argnum > 2)
2551 STRIP_TYPE_NOPS (val);
2553 val = require_complete_type (val);
2557 /* Formal parm type is specified by a function prototype. */
2560 if (type == error_mark_node || !COMPLETE_TYPE_P (type))
2562 error ("type of formal parameter %d is incomplete", parmnum + 1);
2567 /* Optionally warn about conversions that
2568 differ from the default conversions. */
2569 if (warn_traditional_conversion || warn_traditional)
2571 unsigned int formal_prec = TYPE_PRECISION (type);
2573 if (INTEGRAL_TYPE_P (type)
2574 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
2575 warning (0, "passing argument %d of %qE as integer "
2576 "rather than floating due to prototype",
2578 if (INTEGRAL_TYPE_P (type)
2579 && TREE_CODE (TREE_TYPE (val)) == COMPLEX_TYPE)
2580 warning (0, "passing argument %d of %qE as integer "
2581 "rather than complex due to prototype",
2583 else if (TREE_CODE (type) == COMPLEX_TYPE
2584 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
2585 warning (0, "passing argument %d of %qE as complex "
2586 "rather than floating due to prototype",
2588 else if (TREE_CODE (type) == REAL_TYPE
2589 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
2590 warning (0, "passing argument %d of %qE as floating "
2591 "rather than integer due to prototype",
2593 else if (TREE_CODE (type) == COMPLEX_TYPE
2594 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
2595 warning (0, "passing argument %d of %qE as complex "
2596 "rather than integer due to prototype",
2598 else if (TREE_CODE (type) == REAL_TYPE
2599 && TREE_CODE (TREE_TYPE (val)) == COMPLEX_TYPE)
2600 warning (0, "passing argument %d of %qE as floating "
2601 "rather than complex due to prototype",
2603 /* ??? At some point, messages should be written about
2604 conversions between complex types, but that's too messy
2606 else if (TREE_CODE (type) == REAL_TYPE
2607 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
2609 /* Warn if any argument is passed as `float',
2610 since without a prototype it would be `double'. */
2611 if (formal_prec == TYPE_PRECISION (float_type_node)
2612 && type != dfloat32_type_node)
2613 warning (0, "passing argument %d of %qE as %<float%> "
2614 "rather than %<double%> due to prototype",
2617 /* Warn if mismatch between argument and prototype
2618 for decimal float types. Warn of conversions with
2619 binary float types and of precision narrowing due to
2621 else if (type != TREE_TYPE (val)
2622 && (type == dfloat32_type_node
2623 || type == dfloat64_type_node
2624 || type == dfloat128_type_node
2625 || TREE_TYPE (val) == dfloat32_type_node
2626 || TREE_TYPE (val) == dfloat64_type_node
2627 || TREE_TYPE (val) == dfloat128_type_node)
2629 <= TYPE_PRECISION (TREE_TYPE (val))
2630 || (type == dfloat128_type_node
2632 != dfloat64_type_node
2634 != dfloat32_type_node)))
2635 || (type == dfloat64_type_node
2637 != dfloat32_type_node))))
2638 warning (0, "passing argument %d of %qE as %qT "
2639 "rather than %qT due to prototype",
2640 argnum, rname, type, TREE_TYPE (val));
2643 /* Detect integer changing in width or signedness.
2644 These warnings are only activated with
2645 -Wtraditional-conversion, not with -Wtraditional. */
2646 else if (warn_traditional_conversion && INTEGRAL_TYPE_P (type)
2647 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
2649 tree would_have_been = default_conversion (val);
2650 tree type1 = TREE_TYPE (would_have_been);
2652 if (TREE_CODE (type) == ENUMERAL_TYPE
2653 && (TYPE_MAIN_VARIANT (type)
2654 == TYPE_MAIN_VARIANT (TREE_TYPE (val))))
2655 /* No warning if function asks for enum
2656 and the actual arg is that enum type. */
2658 else if (formal_prec != TYPE_PRECISION (type1))
2659 warning (OPT_Wtraditional_conversion, "passing argument %d of %qE "
2660 "with different width due to prototype",
2662 else if (TYPE_UNSIGNED (type) == TYPE_UNSIGNED (type1))
2664 /* Don't complain if the formal parameter type
2665 is an enum, because we can't tell now whether
2666 the value was an enum--even the same enum. */
2667 else if (TREE_CODE (type) == ENUMERAL_TYPE)
2669 else if (TREE_CODE (val) == INTEGER_CST
2670 && int_fits_type_p (val, type))
2671 /* Change in signedness doesn't matter
2672 if a constant value is unaffected. */
2674 /* If the value is extended from a narrower
2675 unsigned type, it doesn't matter whether we
2676 pass it as signed or unsigned; the value
2677 certainly is the same either way. */
2678 else if (TYPE_PRECISION (TREE_TYPE (val)) < TYPE_PRECISION (type)
2679 && TYPE_UNSIGNED (TREE_TYPE (val)))
2681 else if (TYPE_UNSIGNED (type))
2682 warning (OPT_Wtraditional_conversion, "passing argument %d of %qE "
2683 "as unsigned due to prototype",
2686 warning (OPT_Wtraditional_conversion, "passing argument %d of %qE "
2687 "as signed due to prototype", argnum, rname);
2691 parmval = convert_for_assignment (type, val, ic_argpass,
2695 if (targetm.calls.promote_prototypes (fundecl ? TREE_TYPE (fundecl) : 0)
2696 && INTEGRAL_TYPE_P (type)
2697 && (TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node)))
2698 parmval = default_conversion (parmval);
2700 argarray[parmnum] = parmval;
2702 else if (TREE_CODE (TREE_TYPE (val)) == REAL_TYPE
2703 && (TYPE_PRECISION (TREE_TYPE (val))
2704 < TYPE_PRECISION (double_type_node))
2705 && !DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (val))))
2708 argarray[parmnum] = val;
2710 /* Convert `float' to `double'. */
2711 argarray[parmnum] = convert (double_type_node, val);
2713 else if ((invalid_func_diag =
2714 targetm.calls.invalid_arg_for_unprototyped_fn (typelist, fundecl, val)))
2716 error (invalid_func_diag);
2720 /* Convert `short' and `char' to full-size `int'. */
2721 argarray[parmnum] = default_conversion (val);
2724 typetail = TREE_CHAIN (typetail);
2727 gcc_assert (parmnum == nargs);
2729 if (typetail != 0 && TREE_VALUE (typetail) != void_type_node)
2731 error ("too few arguments to function %qE", function);
2738 /* This is the entry point used by the parser to build unary operators
2739 in the input. CODE, a tree_code, specifies the unary operator, and
2740 ARG is the operand. For unary plus, the C parser currently uses
2741 CONVERT_EXPR for code. */
2744 parser_build_unary_op (enum tree_code code, struct c_expr arg)
2746 struct c_expr result;
2748 result.original_code = ERROR_MARK;
2749 result.value = build_unary_op (code, arg.value, 0);
2751 if (TREE_OVERFLOW_P (result.value) && !TREE_OVERFLOW_P (arg.value))
2752 overflow_warning (result.value);
2757 /* This is the entry point used by the parser to build binary operators
2758 in the input. CODE, a tree_code, specifies the binary operator, and
2759 ARG1 and ARG2 are the operands. In addition to constructing the
2760 expression, we check for operands that were written with other binary
2761 operators in a way that is likely to confuse the user. */
2764 parser_build_binary_op (enum tree_code code, struct c_expr arg1,
2767 struct c_expr result;
2769 enum tree_code code1 = arg1.original_code;
2770 enum tree_code code2 = arg2.original_code;
2772 result.value = build_binary_op (code, arg1.value, arg2.value, 1);
2773 result.original_code = code;
2775 if (TREE_CODE (result.value) == ERROR_MARK)
2778 /* Check for cases such as x+y<<z which users are likely
2780 if (warn_parentheses)
2781 warn_about_parentheses (code, code1, code2);
2783 if (code1 != tcc_comparison)
2784 warn_logical_operator (code, arg1.value, arg2.value);
2786 /* Warn about comparisons against string literals, with the exception
2787 of testing for equality or inequality of a string literal with NULL. */
2788 if (code == EQ_EXPR || code == NE_EXPR)
2790 if ((code1 == STRING_CST && !integer_zerop (arg2.value))
2791 || (code2 == STRING_CST && !integer_zerop (arg1.value)))
2792 warning (OPT_Waddress, "comparison with string literal results in unspecified behavior");
2794 else if (TREE_CODE_CLASS (code) == tcc_comparison
2795 && (code1 == STRING_CST || code2 == STRING_CST))
2796 warning (OPT_Waddress, "comparison with string literal results in unspecified behavior");
2798 if (TREE_OVERFLOW_P (result.value)
2799 && !TREE_OVERFLOW_P (arg1.value)
2800 && !TREE_OVERFLOW_P (arg2.value))
2801 overflow_warning (result.value);
2806 /* Return a tree for the difference of pointers OP0 and OP1.
2807 The resulting tree has type int. */
2810 pointer_diff (tree op0, tree op1)
2812 tree restype = ptrdiff_type_node;
2814 tree target_type = TREE_TYPE (TREE_TYPE (op0));
2815 tree con0, con1, lit0, lit1;
2816 tree orig_op1 = op1;
2818 if (pedantic || warn_pointer_arith)
2820 if (TREE_CODE (target_type) == VOID_TYPE)
2821 pedwarn ("pointer of type %<void *%> used in subtraction");
2822 if (TREE_CODE (target_type) == FUNCTION_TYPE)
2823 pedwarn ("pointer to a function used in subtraction");
2826 /* If the conversion to ptrdiff_type does anything like widening or
2827 converting a partial to an integral mode, we get a convert_expression
2828 that is in the way to do any simplifications.
2829 (fold-const.c doesn't know that the extra bits won't be needed.
2830 split_tree uses STRIP_SIGN_NOPS, which leaves conversions to a
2831 different mode in place.)
2832 So first try to find a common term here 'by hand'; we want to cover
2833 at least the cases that occur in legal static initializers. */
2834 if ((TREE_CODE (op0) == NOP_EXPR || TREE_CODE (op0) == CONVERT_EXPR)
2835 && (TYPE_PRECISION (TREE_TYPE (op0))
2836 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op0, 0)))))
2837 con0 = TREE_OPERAND (op0, 0);
2840 if ((TREE_CODE (op1) == NOP_EXPR || TREE_CODE (op1) == CONVERT_EXPR)
2841 && (TYPE_PRECISION (TREE_TYPE (op1))
2842 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op1, 0)))))
2843 con1 = TREE_OPERAND (op1, 0);
2847 if (TREE_CODE (con0) == PLUS_EXPR)
2849 lit0 = TREE_OPERAND (con0, 1);
2850 con0 = TREE_OPERAND (con0, 0);
2853 lit0 = integer_zero_node;
2855 if (TREE_CODE (con1) == PLUS_EXPR)
2857 lit1 = TREE_OPERAND (con1, 1);
2858 con1 = TREE_OPERAND (con1, 0);
2861 lit1 = integer_zero_node;
2863 if (operand_equal_p (con0, con1, 0))
2870 /* First do the subtraction as integers;
2871 then drop through to build the divide operator.
2872 Do not do default conversions on the minus operator
2873 in case restype is a short type. */
2875 op0 = build_binary_op (MINUS_EXPR, convert (restype, op0),
2876 convert (restype, op1), 0);
2877 /* This generates an error if op1 is pointer to incomplete type. */
2878 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (TREE_TYPE (orig_op1))))
2879 error ("arithmetic on pointer to an incomplete type");
2881 /* This generates an error if op0 is pointer to incomplete type. */
2882 op1 = c_size_in_bytes (target_type);
2884 /* Divide by the size, in easiest possible way. */
2885 return fold_build2 (EXACT_DIV_EXPR, restype, op0, convert (restype, op1));
2888 /* Construct and perhaps optimize a tree representation
2889 for a unary operation. CODE, a tree_code, specifies the operation
2890 and XARG is the operand.
2891 For any CODE other than ADDR_EXPR, FLAG nonzero suppresses
2892 the default promotions (such as from short to int).
2893 For ADDR_EXPR, the default promotions are not applied; FLAG nonzero
2894 allows non-lvalues; this is only used to handle conversion of non-lvalue
2895 arrays to pointers in C99. */
2898 build_unary_op (enum tree_code code, tree xarg, int flag)
2900 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
2903 enum tree_code typecode;
2905 int noconvert = flag;
2906 const char *invalid_op_diag;
2908 if (code != ADDR_EXPR)
2909 arg = require_complete_type (arg);
2911 typecode = TREE_CODE (TREE_TYPE (arg));
2912 if (typecode == ERROR_MARK)
2913 return error_mark_node;
2914 if (typecode == ENUMERAL_TYPE || typecode == BOOLEAN_TYPE)
2915 typecode = INTEGER_TYPE;
2917 if ((invalid_op_diag
2918 = targetm.invalid_unary_op (code, TREE_TYPE (xarg))))
2920 error (invalid_op_diag);
2921 return error_mark_node;
2927 /* This is used for unary plus, because a CONVERT_EXPR
2928 is enough to prevent anybody from looking inside for
2929 associativity, but won't generate any code. */
2930 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2931 || typecode == FIXED_POINT_TYPE || typecode == COMPLEX_TYPE
2932 || typecode == VECTOR_TYPE))
2934 error ("wrong type argument to unary plus");
2935 return error_mark_node;
2937 else if (!noconvert)
2938 arg = default_conversion (arg);
2939 arg = non_lvalue (arg);
2943 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2944 || typecode == FIXED_POINT_TYPE || typecode == COMPLEX_TYPE
2945 || typecode == VECTOR_TYPE))
2947 error ("wrong type argument to unary minus");
2948 return error_mark_node;
2950 else if (!noconvert)
2951 arg = default_conversion (arg);
2955 /* ~ works on integer types and non float vectors. */
2956 if (typecode == INTEGER_TYPE
2957 || (typecode == VECTOR_TYPE
2958 && !VECTOR_FLOAT_TYPE_P (TREE_TYPE (arg))))
2961 arg = default_conversion (arg);
2963 else if (typecode == COMPLEX_TYPE)
2967 pedwarn ("ISO C does not support %<~%> for complex conjugation");
2969 arg = default_conversion (arg);
2973 error ("wrong type argument to bit-complement");
2974 return error_mark_node;
2979 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE))
2981 error ("wrong type argument to abs");
2982 return error_mark_node;
2984 else if (!noconvert)
2985 arg = default_conversion (arg);
2989 /* Conjugating a real value is a no-op, but allow it anyway. */
2990 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2991 || typecode == COMPLEX_TYPE))
2993 error ("wrong type argument to conjugation");
2994 return error_mark_node;
2996 else if (!noconvert)
2997 arg = default_conversion (arg);
3000 case TRUTH_NOT_EXPR:
3001 if (typecode != INTEGER_TYPE && typecode != FIXED_POINT_TYPE
3002 && typecode != REAL_TYPE && typecode != POINTER_TYPE
3003 && typecode != COMPLEX_TYPE)
3005 error ("wrong type argument to unary exclamation mark");
3006 return error_mark_node;
3008 arg = c_objc_common_truthvalue_conversion (arg);
3009 return invert_truthvalue (arg);
3012 if (TREE_CODE (arg) == COMPLEX_CST)
3013 return TREE_REALPART (arg);
3014 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
3015 return fold_build1 (REALPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg);
3020 if (TREE_CODE (arg) == COMPLEX_CST)
3021 return TREE_IMAGPART (arg);
3022 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
3023 return fold_build1 (IMAGPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg);
3025 return convert (TREE_TYPE (arg), integer_zero_node);
3027 case PREINCREMENT_EXPR:
3028 case POSTINCREMENT_EXPR:
3029 case PREDECREMENT_EXPR:
3030 case POSTDECREMENT_EXPR:
3032 /* Increment or decrement the real part of the value,
3033 and don't change the imaginary part. */
3034 if (typecode == COMPLEX_TYPE)
3039 pedwarn ("ISO C does not support %<++%> and %<--%>"
3040 " on complex types");
3042 arg = stabilize_reference (arg);
3043 real = build_unary_op (REALPART_EXPR, arg, 1);
3044 imag = build_unary_op (IMAGPART_EXPR, arg, 1);
3045 real = build_unary_op (code, real, 1);
3046 if (real == error_mark_node || imag == error_mark_node)
3047 return error_mark_node;
3048 return build2 (COMPLEX_EXPR, TREE_TYPE (arg),
3052 /* Report invalid types. */
3054 if (typecode != POINTER_TYPE && typecode != FIXED_POINT_TYPE
3055 && typecode != INTEGER_TYPE && typecode != REAL_TYPE)
3057 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
3058 error ("wrong type argument to increment");
3060 error ("wrong type argument to decrement");
3062 return error_mark_node;
3067 tree result_type = TREE_TYPE (arg);
3069 arg = get_unwidened (arg, 0);
3070 argtype = TREE_TYPE (arg);
3072 /* Compute the increment. */
3074 if (typecode == POINTER_TYPE)
3076 /* If pointer target is an undefined struct,
3077 we just cannot know how to do the arithmetic. */
3078 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (result_type)))
3080 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
3081 error ("increment of pointer to unknown structure");
3083 error ("decrement of pointer to unknown structure");
3085 else if ((pedantic || warn_pointer_arith)
3086 && (TREE_CODE (TREE_TYPE (result_type)) == FUNCTION_TYPE
3087 || TREE_CODE (TREE_TYPE (result_type)) == VOID_TYPE))
3089 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
3090 pedwarn ("wrong type argument to increment");
3092 pedwarn ("wrong type argument to decrement");
3095 inc = c_size_in_bytes (TREE_TYPE (result_type));
3096 inc = fold_convert (sizetype, inc);
3098 else if (FRACT_MODE_P (TYPE_MODE (result_type)))
3100 /* For signed fract types, we invert ++ to -- or
3101 -- to ++, and change inc from 1 to -1, because
3102 it is not possible to represent 1 in signed fract constants.
3103 For unsigned fract types, the result always overflows and
3104 we get an undefined (original) or the maximum value. */
3105 if (code == PREINCREMENT_EXPR)
3106 code = PREDECREMENT_EXPR;
3107 else if (code == PREDECREMENT_EXPR)
3108 code = PREINCREMENT_EXPR;
3109 else if (code == POSTINCREMENT_EXPR)
3110 code = POSTDECREMENT_EXPR;
3111 else /* code == POSTDECREMENT_EXPR */
3112 code = POSTINCREMENT_EXPR;
3114 inc = integer_minus_one_node;
3115 inc = convert (argtype, inc);
3119 inc = integer_one_node;
3120 inc = convert (argtype, inc);
3123 /* Complain about anything else that is not a true lvalue. */
3124 if (!lvalue_or_else (arg, ((code == PREINCREMENT_EXPR
3125 || code == POSTINCREMENT_EXPR)
3128 return error_mark_node;
3130 /* Report a read-only lvalue. */
3131 if (TREE_READONLY (arg))
3133 readonly_error (arg,
3134 ((code == PREINCREMENT_EXPR
3135 || code == POSTINCREMENT_EXPR)
3136 ? lv_increment : lv_decrement));
3137 return error_mark_node;
3140 if (TREE_CODE (TREE_TYPE (arg)) == BOOLEAN_TYPE)
3141 val = boolean_increment (code, arg);
3143 val = build2 (code, TREE_TYPE (arg), arg, inc);
3144 TREE_SIDE_EFFECTS (val) = 1;
3145 val = convert (result_type, val);
3146 if (TREE_CODE (val) != code)
3147 TREE_NO_WARNING (val) = 1;
3152 /* Note that this operation never does default_conversion. */
3154 /* Let &* cancel out to simplify resulting code. */
3155 if (TREE_CODE (arg) == INDIRECT_REF)
3157 /* Don't let this be an lvalue. */
3158 if (lvalue_p (TREE_OPERAND (arg, 0)))
3159 return non_lvalue (TREE_OPERAND (arg, 0));
3160 return TREE_OPERAND (arg, 0);
3163 /* For &x[y], return x+y */
3164 if (TREE_CODE (arg) == ARRAY_REF)
3166 tree op0 = TREE_OPERAND (arg, 0);
3167 if (!c_mark_addressable (op0))
3168 return error_mark_node;
3169 return build_binary_op (PLUS_EXPR,
3170 (TREE_CODE (TREE_TYPE (op0)) == ARRAY_TYPE
3171 ? array_to_pointer_conversion (op0)
3173 TREE_OPERAND (arg, 1), 1);
3176 /* Anything not already handled and not a true memory reference
3177 or a non-lvalue array is an error. */
3178 else if (typecode != FUNCTION_TYPE && !flag
3179 && !lvalue_or_else (arg, lv_addressof))
3180 return error_mark_node;
3182 /* Ordinary case; arg is a COMPONENT_REF or a decl. */
3183 argtype = TREE_TYPE (arg);
3185 /* If the lvalue is const or volatile, merge that into the type
3186 to which the address will point. Note that you can't get a
3187 restricted pointer by taking the address of something, so we
3188 only have to deal with `const' and `volatile' here. */
3189 if ((DECL_P (arg) || REFERENCE_CLASS_P (arg))
3190 && (TREE_READONLY (arg) || TREE_THIS_VOLATILE (arg)))
3191 argtype = c_build_type_variant (argtype,
3192 TREE_READONLY (arg),
3193 TREE_THIS_VOLATILE (arg));
3195 if (!c_mark_addressable (arg))
3196 return error_mark_node;
3198 gcc_assert (TREE_CODE (arg) != COMPONENT_REF
3199 || !DECL_C_BIT_FIELD (TREE_OPERAND (arg, 1)));
3201 argtype = build_pointer_type (argtype);
3203 /* ??? Cope with user tricks that amount to offsetof. Delete this
3204 when we have proper support for integer constant expressions. */
3205 val = get_base_address (arg);
3206 if (val && TREE_CODE (val) == INDIRECT_REF
3207 && TREE_CONSTANT (TREE_OPERAND (val, 0)))
3209 tree op0 = fold_convert (sizetype, fold_offsetof (arg, val)), op1;
3211 op1 = fold_convert (argtype, TREE_OPERAND (val, 0));
3212 return fold_build2 (POINTER_PLUS_EXPR, argtype, op1, op0);
3215 val = build1 (ADDR_EXPR, argtype, arg);
3224 argtype = TREE_TYPE (arg);
3225 return require_constant_value ? fold_build1_initializer (code, argtype, arg)
3226 : fold_build1 (code, argtype, arg);
3229 /* Return nonzero if REF is an lvalue valid for this language.
3230 Lvalues can be assigned, unless their type has TYPE_READONLY.
3231 Lvalues can have their address taken, unless they have C_DECL_REGISTER. */
3234 lvalue_p (const_tree ref)
3236 const enum tree_code code = TREE_CODE (ref);
3243 return lvalue_p (TREE_OPERAND (ref, 0));
3245 case COMPOUND_LITERAL_EXPR:
3255 return (TREE_CODE (TREE_TYPE (ref)) != FUNCTION_TYPE
3256 && TREE_CODE (TREE_TYPE (ref)) != METHOD_TYPE);
3259 return TREE_CODE (TREE_TYPE (ref)) == ARRAY_TYPE;
3266 /* Give an error for storing in something that is 'const'. */
3269 readonly_error (tree arg, enum lvalue_use use)
3271 gcc_assert (use == lv_assign || use == lv_increment || use == lv_decrement
3273 /* Using this macro rather than (for example) arrays of messages
3274 ensures that all the format strings are checked at compile
3276 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
3277 : (use == lv_increment ? (I) \
3278 : (use == lv_decrement ? (D) : (AS))))
3279 if (TREE_CODE (arg) == COMPONENT_REF)
3281 if (TYPE_READONLY (TREE_TYPE (TREE_OPERAND (arg, 0))))
3282 readonly_error (TREE_OPERAND (arg, 0), use);
3284 error (READONLY_MSG (G_("assignment of read-only member %qD"),
3285 G_("increment of read-only member %qD"),
3286 G_("decrement of read-only member %qD"),
3287 G_("read-only member %qD used as %<asm%> output")),
3288 TREE_OPERAND (arg, 1));
3290 else if (TREE_CODE (arg) == VAR_DECL)
3291 error (READONLY_MSG (G_("assignment of read-only variable %qD"),
3292 G_("increment of read-only variable %qD"),
3293 G_("decrement of read-only variable %qD"),
3294 G_("read-only variable %qD used as %<asm%> output")),
3297 error (READONLY_MSG (G_("assignment of read-only location %qE"),
3298 G_("increment of read-only location %qE"),
3299 G_("decrement of read-only location %qE"),
3300 G_("read-only location %qE used as %<asm%> output")),
3305 /* Return nonzero if REF is an lvalue valid for this language;
3306 otherwise, print an error message and return zero. USE says
3307 how the lvalue is being used and so selects the error message. */
3310 lvalue_or_else (const_tree ref, enum lvalue_use use)
3312 int win = lvalue_p (ref);
3320 /* Mark EXP saying that we need to be able to take the
3321 address of it; it should not be allocated in a register.
3322 Returns true if successful. */
3325 c_mark_addressable (tree exp)
3330 switch (TREE_CODE (x))
3333 if (DECL_C_BIT_FIELD (TREE_OPERAND (x, 1)))
3336 ("cannot take address of bit-field %qD", TREE_OPERAND (x, 1));
3340 /* ... fall through ... */
3346 x = TREE_OPERAND (x, 0);
3349 case COMPOUND_LITERAL_EXPR:
3351 TREE_ADDRESSABLE (x) = 1;
3358 if (C_DECL_REGISTER (x)
3359 && DECL_NONLOCAL (x))
3361 if (TREE_PUBLIC (x) || TREE_STATIC (x) || DECL_EXTERNAL (x))
3364 ("global register variable %qD used in nested function", x);
3367 pedwarn ("register variable %qD used in nested function", x);
3369 else if (C_DECL_REGISTER (x))
3371 if (TREE_PUBLIC (x) || TREE_STATIC (x) || DECL_EXTERNAL (x))
3372 error ("address of global register variable %qD requested", x);
3374 error ("address of register variable %qD requested", x);
3380 TREE_ADDRESSABLE (x) = 1;
3387 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
3390 build_conditional_expr (tree ifexp, tree op1, tree op2)
3394 enum tree_code code1;
3395 enum tree_code code2;
3396 tree result_type = NULL;
3397 tree orig_op1 = op1, orig_op2 = op2;
3399 /* Promote both alternatives. */
3401 if (TREE_CODE (TREE_TYPE (op1)) != VOID_TYPE)
3402 op1 = default_conversion (op1);
3403 if (TREE_CODE (TREE_TYPE (op2)) != VOID_TYPE)
3404 op2 = default_conversion (op2);
3406 if (TREE_CODE (ifexp) == ERROR_MARK
3407 || TREE_CODE (TREE_TYPE (op1)) == ERROR_MARK
3408 || TREE_CODE (TREE_TYPE (op2)) == ERROR_MARK)
3409 return error_mark_node;
3411 type1 = TREE_TYPE (op1);
3412 code1 = TREE_CODE (type1);
3413 type2 = TREE_TYPE (op2);
3414 code2 = TREE_CODE (type2);
3416 /* C90 does not permit non-lvalue arrays in conditional expressions.
3417 In C99 they will be pointers by now. */
3418 if (code1 == ARRAY_TYPE || code2 == ARRAY_TYPE)
3420 error ("non-lvalue array in conditional expression");
3421 return error_mark_node;
3424 /* Quickly detect the usual case where op1 and op2 have the same type
3426 if (TYPE_MAIN_VARIANT (type1) == TYPE_MAIN_VARIANT (type2))
3429 result_type = type1;
3431 result_type = TYPE_MAIN_VARIANT (type1);
3433 else if ((code1 == INTEGER_TYPE || code1 == REAL_TYPE
3434 || code1 == COMPLEX_TYPE)
3435 && (code2 == INTEGER_TYPE || code2 == REAL_TYPE
3436 || code2 == COMPLEX_TYPE))
3438 result_type = c_common_type (type1, type2);
3440 /* If -Wsign-compare, warn here if type1 and type2 have
3441 different signedness. We'll promote the signed to unsigned
3442 and later code won't know it used to be different.
3443 Do this check on the original types, so that explicit casts
3444 will be considered, but default promotions won't. */
3445 if (warn_sign_compare && !skip_evaluation)
3447 int unsigned_op1 = TYPE_UNSIGNED (TREE_TYPE (orig_op1));
3448 int unsigned_op2 = TYPE_UNSIGNED (TREE_TYPE (orig_op2));
3450 if (unsigned_op1 ^ unsigned_op2)
3454 /* Do not warn if the result type is signed, since the
3455 signed type will only be chosen if it can represent
3456 all the values of the unsigned type. */
3457 if (!TYPE_UNSIGNED (result_type))
3459 /* Do not warn if the signed quantity is an unsuffixed
3460 integer literal (or some static constant expression
3461 involving such literals) and it is non-negative. */
3462 else if ((unsigned_op2
3463 && tree_expr_nonnegative_warnv_p (op1, &ovf))
3465 && tree_expr_nonnegative_warnv_p (op2, &ovf)))
3468 warning (OPT_Wsign_compare, "signed and unsigned type in conditional expression");
3472 else if (code1 == VOID_TYPE || code2 == VOID_TYPE)
3474 if (pedantic && (code1 != VOID_TYPE || code2 != VOID_TYPE))
3475 pedwarn ("ISO C forbids conditional expr with only one void side");
3476 result_type = void_type_node;
3478 else if (code1 == POINTER_TYPE && code2 == POINTER_TYPE)
3480 if (comp_target_types (type1, type2))
3481 result_type = common_pointer_type (type1, type2);
3482 else if (null_pointer_constant_p (orig_op1))
3483 result_type = qualify_type (type2, type1);
3484 else if (null_pointer_constant_p (orig_op2))
3485 result_type = qualify_type (type1, type2);
3486 else if (VOID_TYPE_P (TREE_TYPE (type1)))
3488 if (pedantic && TREE_CODE (TREE_TYPE (type2)) == FUNCTION_TYPE)
3489 pedwarn ("ISO C forbids conditional expr between "
3490 "%<void *%> and function pointer");
3491 result_type = build_pointer_type (qualify_type (TREE_TYPE (type1),
3492 TREE_TYPE (type2)));
3494 else if (VOID_TYPE_P (TREE_TYPE (type2)))
3496 if (pedantic && TREE_CODE (TREE_TYPE (type1)) == FUNCTION_TYPE)
3497 pedwarn ("ISO C forbids conditional expr between "
3498 "%<void *%> and function pointer");
3499 result_type = build_pointer_type (qualify_type (TREE_TYPE (type2),
3500 TREE_TYPE (type1)));
3504 pedwarn ("pointer type mismatch in conditional expression");
3505 result_type = build_pointer_type (void_type_node);
3508 else if (code1 == POINTER_TYPE && code2 == INTEGER_TYPE)
3510 if (!null_pointer_constant_p (orig_op2))
3511 pedwarn ("pointer/integer type mismatch in conditional expression");
3514 op2 = null_pointer_node;
3516 result_type = type1;
3518 else if (code2 == POINTER_TYPE && code1 == INTEGER_TYPE)
3520 if (!null_pointer_constant_p (orig_op1))
3521 pedwarn ("pointer/integer type mismatch in conditional expression");
3524 op1 = null_pointer_node;
3526 result_type = type2;
3531 if (flag_cond_mismatch)
3532 result_type = void_type_node;
3535 error ("type mismatch in conditional expression");
3536 return error_mark_node;
3540 /* Merge const and volatile flags of the incoming types. */
3542 = build_type_variant (result_type,
3543 TREE_READONLY (op1) || TREE_READONLY (op2),
3544 TREE_THIS_VOLATILE (op1) || TREE_THIS_VOLATILE (op2));
3546 if (result_type != TREE_TYPE (op1))
3547 op1 = convert_and_check (result_type, op1);
3548 if (result_type != TREE_TYPE (op2))
3549 op2 = convert_and_check (result_type, op2);
3551 return fold_build3 (COND_EXPR, result_type, ifexp, op1, op2);
3554 /* Return a compound expression that performs two expressions and
3555 returns the value of the second of them. */
3558 build_compound_expr (tree expr1, tree expr2)
3560 if (!TREE_SIDE_EFFECTS (expr1))
3562 /* The left-hand operand of a comma expression is like an expression
3563 statement: with -Wunused, we should warn if it doesn't have
3564 any side-effects, unless it was explicitly cast to (void). */
3565 if (warn_unused_value)
3567 if (VOID_TYPE_P (TREE_TYPE (expr1))
3568 && (TREE_CODE (expr1) == NOP_EXPR
3569 || TREE_CODE (expr1) == CONVERT_EXPR))
3571 else if (VOID_TYPE_P (TREE_TYPE (expr1))
3572 && TREE_CODE (expr1) == COMPOUND_EXPR
3573 && (TREE_CODE (TREE_OPERAND (expr1, 1)) == CONVERT_EXPR
3574 || TREE_CODE (TREE_OPERAND (expr1, 1)) == NOP_EXPR))
3575 ; /* (void) a, (void) b, c */
3577 warning (OPT_Wunused_value,
3578 "left-hand operand of comma expression has no effect");
3582 /* With -Wunused, we should also warn if the left-hand operand does have
3583 side-effects, but computes a value which is not used. For example, in
3584 `foo() + bar(), baz()' the result of the `+' operator is not used,
3585 so we should issue a warning. */
3586 else if (warn_unused_value)
3587 warn_if_unused_value (expr1, input_location);
3589 if (expr2 == error_mark_node)
3590 return error_mark_node;
3592 return build2 (COMPOUND_EXPR, TREE_TYPE (expr2), expr1, expr2);
3595 /* Build an expression representing a cast to type TYPE of expression EXPR. */
3598 build_c_cast (tree type, tree expr)
3602 if (type == error_mark_node || expr == error_mark_node)
3603 return error_mark_node;
3605 /* The ObjC front-end uses TYPE_MAIN_VARIANT to tie together types differing
3606 only in <protocol> qualifications. But when constructing cast expressions,
3607 the protocols do matter and must be kept around. */
3608 if (objc_is_object_ptr (type) && objc_is_object_ptr (TREE_TYPE (expr)))
3609 return build1 (NOP_EXPR, type, expr);
3611 type = TYPE_MAIN_VARIANT (type);
3613 if (TREE_CODE (type) == ARRAY_TYPE)
3615 error ("cast specifies array type");
3616 return error_mark_node;
3619 if (TREE_CODE (type) == FUNCTION_TYPE)
3621 error ("cast specifies function type");
3622 return error_mark_node;
3625 if (!VOID_TYPE_P (type))
3627 value = require_complete_type (value);
3628 if (value == error_mark_node)
3629 return error_mark_node;
3632 if (type == TYPE_MAIN_VARIANT (TREE_TYPE (value)))
3636 if (TREE_CODE (type) == RECORD_TYPE
3637 || TREE_CODE (type) == UNION_TYPE)
3638 pedwarn ("ISO C forbids casting nonscalar to the same type");
3641 else if (TREE_CODE (type) == UNION_TYPE)
3645 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
3646 if (TREE_TYPE (field) != error_mark_node
3647 && comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (field)),
3648 TYPE_MAIN_VARIANT (TREE_TYPE (value))))
3656 pedwarn ("ISO C forbids casts to union type");
3657 t = digest_init (type,
3658 build_constructor_single (type, field, value),
3660 TREE_CONSTANT (t) = TREE_CONSTANT (value);
3663 error ("cast to union type from type not present in union");
3664 return error_mark_node;
3670 if (type == void_type_node)
3671 return build1 (CONVERT_EXPR, type, value);
3673 otype = TREE_TYPE (value);
3675 /* Optionally warn about potentially worrisome casts. */
3678 && TREE_CODE (type) == POINTER_TYPE
3679 && TREE_CODE (otype) == POINTER_TYPE)
3681 tree in_type = type;
3682 tree in_otype = otype;
3686 /* Check that the qualifiers on IN_TYPE are a superset of
3687 the qualifiers of IN_OTYPE. The outermost level of
3688 POINTER_TYPE nodes is uninteresting and we stop as soon
3689 as we hit a non-POINTER_TYPE node on either type. */
3692 in_otype = TREE_TYPE (in_otype);
3693 in_type = TREE_TYPE (in_type);
3695 /* GNU C allows cv-qualified function types. 'const'
3696 means the function is very pure, 'volatile' means it
3697 can't return. We need to warn when such qualifiers
3698 are added, not when they're taken away. */
3699 if (TREE_CODE (in_otype) == FUNCTION_TYPE
3700 && TREE_CODE (in_type) == FUNCTION_TYPE)
3701 added |= (TYPE_QUALS (in_type) & ~TYPE_QUALS (in_otype));
3703 discarded |= (TYPE_QUALS (in_otype) & ~TYPE_QUALS (in_type));
3705 while (TREE_CODE (in_type) == POINTER_TYPE
3706 && TREE_CODE (in_otype) == POINTER_TYPE);
3709 warning (OPT_Wcast_qual, "cast adds new qualifiers to function type");
3712 /* There are qualifiers present in IN_OTYPE that are not
3713 present in IN_TYPE. */
3714 warning (OPT_Wcast_qual, "cast discards qualifiers from pointer target type");
3717 /* Warn about possible alignment problems. */
3718 if (STRICT_ALIGNMENT
3719 && TREE_CODE (type) == POINTER_TYPE
3720 && TREE_CODE (otype) == POINTER_TYPE
3721 && TREE_CODE (TREE_TYPE (otype)) != VOID_TYPE
3722 && TREE_CODE (TREE_TYPE (otype)) != FUNCTION_TYPE
3723 /* Don't warn about opaque types, where the actual alignment
3724 restriction is unknown. */
3725 && !((TREE_CODE (TREE_TYPE (otype)) == UNION_TYPE
3726 || TREE_CODE (TREE_TYPE (otype)) == RECORD_TYPE)
3727 && TYPE_MODE (TREE_TYPE (otype)) == VOIDmode)
3728 && TYPE_ALIGN (TREE_TYPE (type)) > TYPE_ALIGN (TREE_TYPE (otype)))
3729 warning (OPT_Wcast_align,
3730 "cast increases required alignment of target type");
3732 if (TREE_CODE (type) == INTEGER_TYPE
3733 && TREE_CODE (otype) == POINTER_TYPE
3734 && TYPE_PRECISION (type) != TYPE_PRECISION (otype))
3735 /* Unlike conversion of integers to pointers, where the
3736 warning is disabled for converting constants because
3737 of cases such as SIG_*, warn about converting constant
3738 pointers to integers. In some cases it may cause unwanted
3739 sign extension, and a warning is appropriate. */
3740 warning (OPT_Wpointer_to_int_cast,
3741 "cast from pointer to integer of different size");
3743 if (TREE_CODE (value) == CALL_EXPR
3744 && TREE_CODE (type) != TREE_CODE (otype))
3745 warning (OPT_Wbad_function_cast, "cast from function call of type %qT "
3746 "to non-matching type %qT", otype, type);
3748 if (TREE_CODE (type) == POINTER_TYPE
3749 && TREE_CODE (otype) == INTEGER_TYPE
3750 && TYPE_PRECISION (type) != TYPE_PRECISION (otype)
3751 /* Don't warn about converting any constant. */
3752 && !TREE_CONSTANT (value))
3753 warning (OPT_Wint_to_pointer_cast, "cast to pointer from integer "
3754 "of different size");
3756 if (warn_strict_aliasing <= 2)
3757 strict_aliasing_warning (otype, type, expr);
3759 /* If pedantic, warn for conversions between function and object
3760 pointer types, except for converting a null pointer constant
3761 to function pointer type. */
3763 && TREE_CODE (type) == POINTER_TYPE
3764 && TREE_CODE (otype) == POINTER_TYPE
3765 && TREE_CODE (TREE_TYPE (otype)) == FUNCTION_TYPE
3766 && TREE_CODE (TREE_TYPE (type)) != FUNCTION_TYPE)
3767 pedwarn ("ISO C forbids conversion of function pointer to object pointer type");
3770 && TREE_CODE (type) == POINTER_TYPE
3771 && TREE_CODE (otype) == POINTER_TYPE
3772 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE
3773 && TREE_CODE (TREE_TYPE (otype)) != FUNCTION_TYPE
3774 && !null_pointer_constant_p (value))
3775 pedwarn ("ISO C forbids conversion of object pointer to function pointer type");
3778 value = convert (type, value);
3780 /* Ignore any integer overflow caused by the cast. */
3781 if (TREE_CODE (value) == INTEGER_CST)
3783 if (CONSTANT_CLASS_P (ovalue) && TREE_OVERFLOW (ovalue))
3785 if (!TREE_OVERFLOW (value))
3787 /* Avoid clobbering a shared constant. */
3788 value = copy_node (value);
3789 TREE_OVERFLOW (value) = TREE_OVERFLOW (ovalue);
3792 else if (TREE_OVERFLOW (value))
3793 /* Reset VALUE's overflow flags, ensuring constant sharing. */
3794 value = build_int_cst_wide (TREE_TYPE (value),
3795 TREE_INT_CST_LOW (value),
3796 TREE_INT_CST_HIGH (value));
3800 /* Don't let a cast be an lvalue. */
3802 value = non_lvalue (value);
3807 /* Interpret a cast of expression EXPR to type TYPE. */
3809 c_cast_expr (struct c_type_name *type_name, tree expr)
3812 int saved_wsp = warn_strict_prototypes;
3814 /* This avoids warnings about unprototyped casts on
3815 integers. E.g. "#define SIG_DFL (void(*)())0". */
3816 if (TREE_CODE (expr) == INTEGER_CST)
3817 warn_strict_prototypes = 0;
3818 type = groktypename (type_name);
3819 warn_strict_prototypes = saved_wsp;
3821 return build_c_cast (type, expr);
3824 /* Build an assignment expression of lvalue LHS from value RHS.
3825 MODIFYCODE is the code for a binary operator that we use
3826 to combine the old value of LHS with RHS to get the new value.
3827 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment. */
3830 build_modify_expr (tree lhs, enum tree_code modifycode, tree rhs)
3834 tree lhstype = TREE_TYPE (lhs);
3835 tree olhstype = lhstype;
3837 /* Types that aren't fully specified cannot be used in assignments. */
3838 lhs = require_complete_type (lhs);
3840 /* Avoid duplicate error messages from operands that had errors. */
3841 if (TREE_CODE (lhs) == ERROR_MARK || TREE_CODE (rhs) == ERROR_MARK)
3842 return error_mark_node;
3844 if (!lvalue_or_else (lhs, lv_assign))
3845 return error_mark_node;
3847 STRIP_TYPE_NOPS (rhs);
3851 /* If a binary op has been requested, combine the old LHS value with the RHS
3852 producing the value we should actually store into the LHS. */
3854 if (modifycode != NOP_EXPR)
3856 lhs = stabilize_reference (lhs);
3857 newrhs = build_binary_op (modifycode, lhs, rhs, 1);
3860 /* Give an error for storing in something that is 'const'. */
3862 if (TREE_READONLY (lhs) || TYPE_READONLY (lhstype)
3863 || ((TREE_CODE (lhstype) == RECORD_TYPE
3864 || TREE_CODE (lhstype) == UNION_TYPE)
3865 && C_TYPE_FIELDS_READONLY (lhstype)))
3867 readonly_error (lhs, lv_assign);
3868 return error_mark_node;
3871 /* If storing into a structure or union member,
3872 it has probably been given type `int'.
3873 Compute the type that would go with
3874 the actual amount of storage the member occupies. */
3876 if (TREE_CODE (lhs) == COMPONENT_REF
3877 && (TREE_CODE (lhstype) == INTEGER_TYPE
3878 || TREE_CODE (lhstype) == BOOLEAN_TYPE
3879 || TREE_CODE (lhstype) == REAL_TYPE
3880 || TREE_CODE (lhstype) == ENUMERAL_TYPE))
3881 lhstype = TREE_TYPE (get_unwidened (lhs, 0));
3883 /* If storing in a field that is in actuality a short or narrower than one,
3884 we must store in the field in its actual type. */
3886 if (lhstype != TREE_TYPE (lhs))
3888 lhs = copy_node (lhs);
3889 TREE_TYPE (lhs) = lhstype;
3892 /* Convert new value to destination type. */
3894 newrhs = convert_for_assignment (lhstype, newrhs, ic_assign,
3895 NULL_TREE, NULL_TREE, 0);
3896 if (TREE_CODE (newrhs) == ERROR_MARK)
3897 return error_mark_node;
3899 /* Emit ObjC write barrier, if necessary. */
3900 if (c_dialect_objc () && flag_objc_gc)
3902 result = objc_generate_write_barrier (lhs, modifycode, newrhs);
3907 /* Scan operands. */
3909 result = build2 (MODIFY_EXPR, lhstype, lhs, newrhs);
3910 TREE_SIDE_EFFECTS (result) = 1;
3912 /* If we got the LHS in a different type for storing in,
3913 convert the result back to the nominal type of LHS
3914 so that the value we return always has the same type
3915 as the LHS argument. */
3917 if (olhstype == TREE_TYPE (result))
3919 return convert_for_assignment (olhstype, result, ic_assign,
3920 NULL_TREE, NULL_TREE, 0);
3923 /* Convert value RHS to type TYPE as preparation for an assignment
3924 to an lvalue of type TYPE.
3925 The real work of conversion is done by `convert'.
3926 The purpose of this function is to generate error messages
3927 for assignments that are not allowed in C.
3928 ERRTYPE says whether it is argument passing, assignment,
3929 initialization or return.
3931 FUNCTION is a tree for the function being called.
3932 PARMNUM is the number of the argument, for printing in error messages. */
3935 convert_for_assignment (tree type, tree rhs, enum impl_conv errtype,
3936 tree fundecl, tree function, int parmnum)
3938 enum tree_code codel = TREE_CODE (type);
3940 enum tree_code coder;
3941 tree rname = NULL_TREE;
3942 bool objc_ok = false;
3944 if (errtype == ic_argpass || errtype == ic_argpass_nonproto)
3947 /* Change pointer to function to the function itself for
3949 if (TREE_CODE (function) == ADDR_EXPR
3950 && TREE_CODE (TREE_OPERAND (function, 0)) == FUNCTION_DECL)
3951 function = TREE_OPERAND (function, 0);
3953 /* Handle an ObjC selector specially for diagnostics. */
3954 selector = objc_message_selector ();
3956 if (selector && parmnum > 2)
3963 /* This macro is used to emit diagnostics to ensure that all format
3964 strings are complete sentences, visible to gettext and checked at
3966 #define WARN_FOR_ASSIGNMENT(AR, AS, IN, RE) \
3971 pedwarn (AR, parmnum, rname); \
3973 case ic_argpass_nonproto: \
3974 warning (0, AR, parmnum, rname); \
3986 gcc_unreachable (); \
3990 STRIP_TYPE_NOPS (rhs);
3992 if (optimize && TREE_CODE (rhs) == VAR_DECL
3993 && TREE_CODE (TREE_TYPE (rhs)) != ARRAY_TYPE)
3994 rhs = decl_constant_value_for_broken_optimization (rhs);
3996 rhstype = TREE_TYPE (rhs);
3997 coder = TREE_CODE (rhstype);
3999 if (coder == ERROR_MARK)
4000 return error_mark_node;
4002 if (c_dialect_objc ())
4025 objc_ok = objc_compare_types (type, rhstype, parmno, rname);
4028 if (TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (rhstype))
4031 if (coder == VOID_TYPE)
4033 /* Except for passing an argument to an unprototyped function,
4034 this is a constraint violation. When passing an argument to
4035 an unprototyped function, it is compile-time undefined;
4036 making it a constraint in that case was rejected in
4038 error ("void value not ignored as it ought to be");
4039 return error_mark_node;
4041 rhs = require_complete_type (rhs);
4042 if (rhs == error_mark_node)
4043 return error_mark_node;
4044 /* A type converts to a reference to it.
4045 This code doesn't fully support references, it's just for the
4046 special case of va_start and va_copy. */
4047 if (codel == REFERENCE_TYPE
4048 && comptypes (TREE_TYPE (type), TREE_TYPE (rhs)) == 1)
4050 if (!lvalue_p (rhs))
4052 error ("cannot pass rvalue to reference parameter");
4053 return error_mark_node;
4055 if (!c_mark_addressable (rhs))
4056 return error_mark_node;
4057 rhs = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (rhs)), rhs);
4059 /* We already know that these two types are compatible, but they
4060 may not be exactly identical. In fact, `TREE_TYPE (type)' is
4061 likely to be __builtin_va_list and `TREE_TYPE (rhs)' is
4062 likely to be va_list, a typedef to __builtin_va_list, which
4063 is different enough that it will cause problems later. */
4064 if (TREE_TYPE (TREE_TYPE (rhs)) != TREE_TYPE (type))
4065 rhs = build1 (NOP_EXPR, build_pointer_type (TREE_TYPE (type)), rhs);
4067 rhs = build1 (NOP_EXPR, type, rhs);
4070 /* Some types can interconvert without explicit casts. */
4071 else if (codel == VECTOR_TYPE && coder == VECTOR_TYPE
4072 && vector_types_convertible_p (type, TREE_TYPE (rhs), true))
4073 return convert (type, rhs);
4074 /* Arithmetic types all interconvert, and enum is treated like int. */
4075 else if ((codel == INTEGER_TYPE || codel == REAL_TYPE
4076 || codel == FIXED_POINT_TYPE
4077 || codel == ENUMERAL_TYPE || codel == COMPLEX_TYPE
4078 || codel == BOOLEAN_TYPE)
4079 && (coder == INTEGER_TYPE || coder == REAL_TYPE
4080 || coder == FIXED_POINT_TYPE
4081 || coder == ENUMERAL_TYPE || coder == COMPLEX_TYPE
4082 || coder == BOOLEAN_TYPE))
4083 return convert_and_check (type, rhs);
4085 /* Aggregates in different TUs might need conversion. */
4086 if ((codel == RECORD_TYPE || codel == UNION_TYPE)
4088 && comptypes (type, rhstype))
4089 return convert_and_check (type, rhs);
4091 /* Conversion to a transparent union from its member types.
4092 This applies only to function arguments. */
4093 if (codel == UNION_TYPE && TYPE_TRANSPARENT_UNION (type)
4094 && (errtype == ic_argpass || errtype == ic_argpass_nonproto))
4096 tree memb, marginal_memb = NULL_TREE;
4098 for (memb = TYPE_FIELDS (type); memb ; memb = TREE_CHAIN (memb))
4100 tree memb_type = TREE_TYPE (memb);
4102 if (comptypes (TYPE_MAIN_VARIANT (memb_type),
4103 TYPE_MAIN_VARIANT (rhstype)))
4106 if (TREE_CODE (memb_type) != POINTER_TYPE)
4109 if (coder == POINTER_TYPE)
4111 tree ttl = TREE_TYPE (memb_type);
4112 tree ttr = TREE_TYPE (rhstype);
4114 /* Any non-function converts to a [const][volatile] void *
4115 and vice versa; otherwise, targets must be the same.
4116 Meanwhile, the lhs target must have all the qualifiers of
4118 if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
4119 || comp_target_types (memb_type, rhstype))
4121 /* If this type won't generate any warnings, use it. */
4122 if (TYPE_QUALS (ttl) == TYPE_QUALS (ttr)
4123 || ((TREE_CODE (ttr) == FUNCTION_TYPE
4124 && TREE_CODE (ttl) == FUNCTION_TYPE)
4125 ? ((TYPE_QUALS (ttl) | TYPE_QUALS (ttr))
4126 == TYPE_QUALS (ttr))
4127 : ((TYPE_QUALS (ttl) | TYPE_QUALS (ttr))
4128 == TYPE_QUALS (ttl))))
4131 /* Keep looking for a better type, but remember this one. */
4133 marginal_memb = memb;
4137 /* Can convert integer zero to any pointer type. */
4138 if (null_pointer_constant_p (rhs))
4140 rhs = null_pointer_node;
4145 if (memb || marginal_memb)
4149 /* We have only a marginally acceptable member type;
4150 it needs a warning. */
4151 tree ttl = TREE_TYPE (TREE_TYPE (marginal_memb));
4152 tree ttr = TREE_TYPE (rhstype);
4154 /* Const and volatile mean something different for function
4155 types, so the usual warnings are not appropriate. */
4156 if (TREE_CODE (ttr) == FUNCTION_TYPE
4157 && TREE_CODE (ttl) == FUNCTION_TYPE)
4159 /* Because const and volatile on functions are
4160 restrictions that say the function will not do
4161 certain things, it is okay to use a const or volatile
4162 function where an ordinary one is wanted, but not
4164 if (TYPE_QUALS (ttl) & ~TYPE_QUALS (ttr))
4165 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE "
4166 "makes qualified function "
4167 "pointer from unqualified"),
4168 G_("assignment makes qualified "
4169 "function pointer from "
4171 G_("initialization makes qualified "
4172 "function pointer from "
4174 G_("return makes qualified function "
4175 "pointer from unqualified"));
4177 else if (TYPE_QUALS (ttr) & ~TYPE_QUALS (ttl))
4178 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE discards "
4179 "qualifiers from pointer target type"),
4180 G_("assignment discards qualifiers "
4181 "from pointer target type"),
4182 G_("initialization discards qualifiers "
4183 "from pointer target type"),
4184 G_("return discards qualifiers from "
4185 "pointer target type"));
4187 memb = marginal_memb;
4190 if (pedantic && (!fundecl || !DECL_IN_SYSTEM_HEADER (fundecl)))
4191 pedwarn ("ISO C prohibits argument conversion to union type");
4193 rhs = fold_convert (TREE_TYPE (memb), rhs);
4194 return build_constructor_single (type, memb, rhs);
4198 /* Conversions among pointers */
4199 else if ((codel == POINTER_TYPE || codel == REFERENCE_TYPE)
4200 && (coder == codel))
4202 tree ttl = TREE_TYPE (type);
4203 tree ttr = TREE_TYPE (rhstype);
4206 bool is_opaque_pointer;
4207 int target_cmp = 0; /* Cache comp_target_types () result. */
4209 if (TREE_CODE (mvl) != ARRAY_TYPE)
4210 mvl = TYPE_MAIN_VARIANT (mvl);
4211 if (TREE_CODE (mvr) != ARRAY_TYPE)
4212 mvr = TYPE_MAIN_VARIANT (mvr);
4213 /* Opaque pointers are treated like void pointers. */
4214 is_opaque_pointer = (targetm.vector_opaque_p (type)
4215 || targetm.vector_opaque_p (rhstype))
4216 && TREE_CODE (ttl) == VECTOR_TYPE
4217 && TREE_CODE (ttr) == VECTOR_TYPE;
4219 /* C++ does not allow the implicit conversion void* -> T*. However,
4220 for the purpose of reducing the number of false positives, we
4221 tolerate the special case of
4225 where NULL is typically defined in C to be '(void *) 0'. */
4226 if (VOID_TYPE_P (ttr) && rhs != null_pointer_node && !VOID_TYPE_P (ttl))
4227 warning (OPT_Wc___compat, "request for implicit conversion from "
4228 "%qT to %qT not permitted in C++", rhstype, type);
4230 /* Check if the right-hand side has a format attribute but the
4231 left-hand side doesn't. */
4232 if (warn_missing_format_attribute
4233 && check_missing_format_attribute (type, rhstype))
4238 case ic_argpass_nonproto:
4239 warning (OPT_Wmissing_format_attribute,
4240 "argument %d of %qE might be "
4241 "a candidate for a format attribute",
4245 warning (OPT_Wmissing_format_attribute,
4246 "assignment left-hand side might be "
4247 "a candidate for a format attribute");
4250 warning (OPT_Wmissing_format_attribute,
4251 "initialization left-hand side might be "
4252 "a candidate for a format attribute");
4255 warning (OPT_Wmissing_format_attribute,
4256 "return type might be "
4257 "a candidate for a format attribute");
4264 /* Any non-function converts to a [const][volatile] void *
4265 and vice versa; otherwise, targets must be the same.
4266 Meanwhile, the lhs target must have all the qualifiers of the rhs. */
4267 if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
4268 || (target_cmp = comp_target_types (type, rhstype))
4269 || is_opaque_pointer
4270 || (c_common_unsigned_type (mvl)
4271 == c_common_unsigned_type (mvr)))
4274 && ((VOID_TYPE_P (ttl) && TREE_CODE (ttr) == FUNCTION_TYPE)
4277 && !null_pointer_constant_p (rhs)
4278 && TREE_CODE (ttl) == FUNCTION_TYPE)))
4279 WARN_FOR_ASSIGNMENT (G_("ISO C forbids passing argument %d of "
4280 "%qE between function pointer "
4282 G_("ISO C forbids assignment between "
4283 "function pointer and %<void *%>"),
4284 G_("ISO C forbids initialization between "
4285 "function pointer and %<void *%>"),
4286 G_("ISO C forbids return between function "
4287 "pointer and %<void *%>"));
4288 /* Const and volatile mean something different for function types,
4289 so the usual warnings are not appropriate. */
4290 else if (TREE_CODE (ttr) != FUNCTION_TYPE
4291 && TREE_CODE (ttl) != FUNCTION_TYPE)
4293 if (TYPE_QUALS (ttr) & ~TYPE_QUALS (ttl))
4295 /* Types differing only by the presence of the 'volatile'
4296 qualifier are acceptable if the 'volatile' has been added
4297 in by the Objective-C EH machinery. */
4298 if (!objc_type_quals_match (ttl, ttr))
4299 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE discards "
4300 "qualifiers from pointer target type"),
4301 G_("assignment discards qualifiers "
4302 "from pointer target type"),
4303 G_("initialization discards qualifiers "
4304 "from pointer target type"),
4305 G_("return discards qualifiers from "
4306 "pointer target type"));
4308 /* If this is not a case of ignoring a mismatch in signedness,
4310 else if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
4313 /* If there is a mismatch, do warn. */
4314 else if (warn_pointer_sign)
4315 WARN_FOR_ASSIGNMENT (G_("pointer targets in passing argument "
4316 "%d of %qE differ in signedness"),
4317 G_("pointer targets in assignment "
4318 "differ in signedness"),
4319 G_("pointer targets in initialization "
4320 "differ in signedness"),
4321 G_("pointer targets in return differ "
4324 else if (TREE_CODE (ttl) == FUNCTION_TYPE
4325 && TREE_CODE (ttr) == FUNCTION_TYPE)
4327 /* Because const and volatile on functions are restrictions
4328 that say the function will not do certain things,
4329 it is okay to use a const or volatile function
4330 where an ordinary one is wanted, but not vice-versa. */
4331 if (TYPE_QUALS (ttl) & ~TYPE_QUALS (ttr))
4332 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE makes "
4333 "qualified function pointer "
4334 "from unqualified"),
4335 G_("assignment makes qualified function "
4336 "pointer from unqualified"),
4337 G_("initialization makes qualified "
4338 "function pointer from unqualified"),
4339 G_("return makes qualified function "
4340 "pointer from unqualified"));
4344 /* Avoid warning about the volatile ObjC EH puts on decls. */
4346 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE from "
4347 "incompatible pointer type"),
4348 G_("assignment from incompatible pointer type"),
4349 G_("initialization from incompatible "
4351 G_("return from incompatible pointer type"));
4353 return convert (type, rhs);
4355 else if (codel == POINTER_TYPE && coder == ARRAY_TYPE)
4357 /* ??? This should not be an error when inlining calls to
4358 unprototyped functions. */
4359 error ("invalid use of non-lvalue array");
4360 return error_mark_node;
4362 else if (codel == POINTER_TYPE && coder == INTEGER_TYPE)
4364 /* An explicit constant 0 can convert to a pointer,
4365 or one that results from arithmetic, even including
4366 a cast to integer type. */
4367 if (!null_pointer_constant_p (rhs))
4368 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE makes "
4369 "pointer from integer without a cast"),
4370 G_("assignment makes pointer from integer "
4372 G_("initialization makes pointer from "
4373 "integer without a cast"),
4374 G_("return makes pointer from integer "
4377 return convert (type, rhs);
4379 else if (codel == INTEGER_TYPE && coder == POINTER_TYPE)
4381 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE makes integer "
4382 "from pointer without a cast"),
4383 G_("assignment makes integer from pointer "
4385 G_("initialization makes integer from pointer "
4387 G_("return makes integer from pointer "
4389 return convert (type, rhs);
4391 else if (codel == BOOLEAN_TYPE && coder == POINTER_TYPE)
4392 return convert (type, rhs);
4397 case ic_argpass_nonproto:
4398 /* ??? This should not be an error when inlining calls to
4399 unprototyped functions. */
4400 error ("incompatible type for argument %d of %qE", parmnum, rname);
4403 error ("incompatible types in assignment");
4406 error ("incompatible types in initialization");
4409 error ("incompatible types in return");
4415 return error_mark_node;
4418 /* If VALUE is a compound expr all of whose expressions are constant, then
4419 return its value. Otherwise, return error_mark_node.
4421 This is for handling COMPOUND_EXPRs as initializer elements
4422 which is allowed with a warning when -pedantic is specified. */
4425 valid_compound_expr_initializer (tree value, tree endtype)
4427 if (TREE_CODE (value) == COMPOUND_EXPR)
4429 if (valid_compound_expr_initializer (TREE_OPERAND (value, 0), endtype)
4431 return error_mark_node;
4432 return valid_compound_expr_initializer (TREE_OPERAND (value, 1),
4435 else if (!initializer_constant_valid_p (value, endtype))
4436 return error_mark_node;
4441 /* Perform appropriate conversions on the initial value of a variable,
4442 store it in the declaration DECL,
4443 and print any error messages that are appropriate.
4444 If the init is invalid, store an ERROR_MARK. */
4447 store_init_value (tree decl, tree init)
4451 /* If variable's type was invalidly declared, just ignore it. */
4453 type = TREE_TYPE (decl);
4454 if (TREE_CODE (type) == ERROR_MARK)
4457 /* Digest the specified initializer into an expression. */
4459 value = digest_init (type, init, true, TREE_STATIC (decl));
4461 /* Store the expression if valid; else report error. */
4463 if (!in_system_header
4464 && AGGREGATE_TYPE_P (TREE_TYPE (decl)) && !TREE_STATIC (decl))
4465 warning (OPT_Wtraditional, "traditional C rejects automatic "
4466 "aggregate initialization");
4468 DECL_INITIAL (decl) = value;
4470 /* ANSI wants warnings about out-of-range constant initializers. */
4471 STRIP_TYPE_NOPS (value);
4472 if (TREE_STATIC (decl))
4473 constant_expression_warning (value);
4475 /* Check if we need to set array size from compound literal size. */
4476 if (TREE_CODE (type) == ARRAY_TYPE
4477 && TYPE_DOMAIN (type) == 0
4478 && value != error_mark_node)
4480 tree inside_init = init;
4482 STRIP_TYPE_NOPS (inside_init);
4483 inside_init = fold (inside_init);
4485 if (TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
4487 tree cldecl = COMPOUND_LITERAL_EXPR_DECL (inside_init);
4489 if (TYPE_DOMAIN (TREE_TYPE (cldecl)))
4491 /* For int foo[] = (int [3]){1}; we need to set array size
4492 now since later on array initializer will be just the
4493 brace enclosed list of the compound literal. */
4494 type = build_distinct_type_copy (TYPE_MAIN_VARIANT (type));
4495 TREE_TYPE (decl) = type;
4496 TYPE_DOMAIN (type) = TYPE_DOMAIN (TREE_TYPE (cldecl));
4498 layout_decl (cldecl, 0);
4504 /* Methods for storing and printing names for error messages. */
4506 /* Implement a spelling stack that allows components of a name to be pushed
4507 and popped. Each element on the stack is this structure. */
4514 unsigned HOST_WIDE_INT i;
4519 #define SPELLING_STRING 1
4520 #define SPELLING_MEMBER 2
4521 #define SPELLING_BOUNDS 3
4523 static struct spelling *spelling; /* Next stack element (unused). */
4524 static struct spelling *spelling_base; /* Spelling stack base. */
4525 static int spelling_size; /* Size of the spelling stack. */
4527 /* Macros to save and restore the spelling stack around push_... functions.
4528 Alternative to SAVE_SPELLING_STACK. */
4530 #define SPELLING_DEPTH() (spelling - spelling_base)
4531 #define RESTORE_SPELLING_DEPTH(DEPTH) (spelling = spelling_base + (DEPTH))
4533 /* Push an element on the spelling stack with type KIND and assign VALUE
4536 #define PUSH_SPELLING(KIND, VALUE, MEMBER) \
4538 int depth = SPELLING_DEPTH (); \
4540 if (depth >= spelling_size) \
4542 spelling_size += 10; \
4543 spelling_base = XRESIZEVEC (struct spelling, spelling_base, \
4545 RESTORE_SPELLING_DEPTH (depth); \
4548 spelling->kind = (KIND); \
4549 spelling->MEMBER = (VALUE); \
4553 /* Push STRING on the stack. Printed literally. */
4556 push_string (const char *string)
4558 PUSH_SPELLING (SPELLING_STRING, string, u.s);
4561 /* Push a member name on the stack. Printed as '.' STRING. */
4564 push_member_name (tree decl)
4566 const char *const string
4567 = DECL_NAME (decl) ? IDENTIFIER_POINTER (DECL_NAME (decl)) : "<anonymous>";
4568 PUSH_SPELLING (SPELLING_MEMBER, string, u.s);
4571 /* Push an array bounds on the stack. Printed as [BOUNDS]. */
4574 push_array_bounds (unsigned HOST_WIDE_INT bounds)
4576 PUSH_SPELLING (SPELLING_BOUNDS, bounds, u.i);
4579 /* Compute the maximum size in bytes of the printed spelling. */
4582 spelling_length (void)
4587 for (p = spelling_base; p < spelling; p++)
4589 if (p->kind == SPELLING_BOUNDS)
4592 size += strlen (p->u.s) + 1;
4598 /* Print the spelling to BUFFER and return it. */
4601 print_spelling (char *buffer)
4606 for (p = spelling_base; p < spelling; p++)
4607 if (p->kind == SPELLING_BOUNDS)
4609 sprintf (d, "[" HOST_WIDE_INT_PRINT_UNSIGNED "]", p->u.i);
4615 if (p->kind == SPELLING_MEMBER)
4617 for (s = p->u.s; (*d = *s++); d++)
4624 /* Issue an error message for a bad initializer component.
4625 MSGID identifies the message.
4626 The component name is taken from the spelling stack. */
4629 error_init (const char *msgid)
4633 error ("%s", _(msgid));
4634 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4636 error ("(near initialization for %qs)", ofwhat);
4639 /* Issue a pedantic warning for a bad initializer component.
4640 MSGID identifies the message.
4641 The component name is taken from the spelling stack. */
4644 pedwarn_init (const char *msgid)
4648 pedwarn ("%s", _(msgid));
4649 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4651 pedwarn ("(near initialization for %qs)", ofwhat);
4654 /* Issue a warning for a bad initializer component.
4656 OPT is the OPT_W* value corresponding to the warning option that
4657 controls this warning. MSGID identifies the message. The
4658 component name is taken from the spelling stack. */
4661 warning_init (int opt, const char *msgid)
4665 warning (opt, "%s", _(msgid));
4666 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4668 warning (opt, "(near initialization for %qs)", ofwhat);
4671 /* If TYPE is an array type and EXPR is a parenthesized string
4672 constant, warn if pedantic that EXPR is being used to initialize an
4673 object of type TYPE. */
4676 maybe_warn_string_init (tree type, struct c_expr expr)
4679 && TREE_CODE (type) == ARRAY_TYPE
4680 && TREE_CODE (expr.value) == STRING_CST
4681 && expr.original_code != STRING_CST)
4682 pedwarn_init ("array initialized from parenthesized string constant");
4685 /* Digest the parser output INIT as an initializer for type TYPE.
4686 Return a C expression of type TYPE to represent the initial value.
4688 If INIT is a string constant, STRICT_STRING is true if it is
4689 unparenthesized or we should not warn here for it being parenthesized.
4690 For other types of INIT, STRICT_STRING is not used.
4692 REQUIRE_CONSTANT requests an error if non-constant initializers or
4693 elements are seen. */
4696 digest_init (tree type, tree init, bool strict_string, int require_constant)
4698 enum tree_code code = TREE_CODE (type);
4699 tree inside_init = init;
4701 if (type == error_mark_node
4703 || init == error_mark_node
4704 || TREE_TYPE (init) == error_mark_node)
4705 return error_mark_node;
4707 STRIP_TYPE_NOPS (inside_init);
4709 inside_init = fold (inside_init);
4711 /* Initialization of an array of chars from a string constant
4712 optionally enclosed in braces. */
4714 if (code == ARRAY_TYPE && inside_init
4715 && TREE_CODE (inside_init) == STRING_CST)
4717 tree typ1 = TYPE_MAIN_VARIANT (TREE_TYPE (type));
4718 /* Note that an array could be both an array of character type
4719 and an array of wchar_t if wchar_t is signed char or unsigned
4721 bool char_array = (typ1 == char_type_node
4722 || typ1 == signed_char_type_node
4723 || typ1 == unsigned_char_type_node);
4724 bool wchar_array = !!comptypes (typ1, wchar_type_node);
4725 if (char_array || wchar_array)
4729 expr.value = inside_init;
4730 expr.original_code = (strict_string ? STRING_CST : ERROR_MARK);
4731 maybe_warn_string_init (type, expr);
4734 = (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (inside_init)))
4737 if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
4738 TYPE_MAIN_VARIANT (type)))
4741 if (!wchar_array && !char_string)
4743 error_init ("char-array initialized from wide string");
4744 return error_mark_node;
4746 if (char_string && !char_array)
4748 error_init ("wchar_t-array initialized from non-wide string");
4749 return error_mark_node;
4752 TREE_TYPE (inside_init) = type;
4753 if (TYPE_DOMAIN (type) != 0
4754 && TYPE_SIZE (type) != 0
4755 && TREE_CODE (TYPE_SIZE (type)) == INTEGER_CST
4756 /* Subtract 1 (or sizeof (wchar_t))
4757 because it's ok to ignore the terminating null char
4758 that is counted in the length of the constant. */
4759 && 0 > compare_tree_int (TYPE_SIZE_UNIT (type),
4760 TREE_STRING_LENGTH (inside_init)
4761 - ((TYPE_PRECISION (typ1)
4762 != TYPE_PRECISION (char_type_node))
4763 ? (TYPE_PRECISION (wchar_type_node)
4766 pedwarn_init ("initializer-string for array of chars is too long");
4770 else if (INTEGRAL_TYPE_P (typ1))
4772 error_init ("array of inappropriate type initialized "
4773 "from string constant");
4774 return error_mark_node;
4778 /* Build a VECTOR_CST from a *constant* vector constructor. If the
4779 vector constructor is not constant (e.g. {1,2,3,foo()}) then punt
4780 below and handle as a constructor. */
4781 if (code == VECTOR_TYPE
4782 && TREE_CODE (TREE_TYPE (inside_init)) == VECTOR_TYPE
4783 && vector_types_convertible_p (TREE_TYPE (inside_init), type, true)
4784 && TREE_CONSTANT (inside_init))
4786 if (TREE_CODE (inside_init) == VECTOR_CST
4787 && comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
4788 TYPE_MAIN_VARIANT (type)))
4791 if (TREE_CODE (inside_init) == CONSTRUCTOR)
4793 unsigned HOST_WIDE_INT ix;
4795 bool constant_p = true;
4797 /* Iterate through elements and check if all constructor
4798 elements are *_CSTs. */
4799 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (inside_init), ix, value)
4800 if (!CONSTANT_CLASS_P (value))
4807 return build_vector_from_ctor (type,
4808 CONSTRUCTOR_ELTS (inside_init));
4812 /* Any type can be initialized
4813 from an expression of the same type, optionally with braces. */
4815 if (inside_init && TREE_TYPE (inside_init) != 0
4816 && (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
4817 TYPE_MAIN_VARIANT (type))
4818 || (code == ARRAY_TYPE
4819 && comptypes (TREE_TYPE (inside_init), type))
4820 || (code == VECTOR_TYPE
4821 && comptypes (TREE_TYPE (inside_init), type))
4822 || (code == POINTER_TYPE
4823 && TREE_CODE (TREE_TYPE (inside_init)) == ARRAY_TYPE
4824 && comptypes (TREE_TYPE (TREE_TYPE (inside_init)),
4825 TREE_TYPE (type)))))
4827 if (code == POINTER_TYPE)
4829 if (TREE_CODE (TREE_TYPE (inside_init)) == ARRAY_TYPE)
4831 if (TREE_CODE (inside_init) == STRING_CST
4832 || TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
4833 inside_init = array_to_pointer_conversion (inside_init);
4836 error_init ("invalid use of non-lvalue array");
4837 return error_mark_node;
4842 if (code == VECTOR_TYPE)
4843 /* Although the types are compatible, we may require a
4845 inside_init = convert (type, inside_init);
4847 if (require_constant
4848 && (code == VECTOR_TYPE || !flag_isoc99)
4849 && TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
4851 /* As an extension, allow initializing objects with static storage
4852 duration with compound literals (which are then treated just as
4853 the brace enclosed list they contain). Also allow this for
4854 vectors, as we can only assign them with compound literals. */
4855 tree decl = COMPOUND_LITERAL_EXPR_DECL (inside_init);
4856 inside_init = DECL_INITIAL (decl);
4859 if (code == ARRAY_TYPE && TREE_CODE (inside_init) != STRING_CST
4860 && TREE_CODE (inside_init) != CONSTRUCTOR)
4862 error_init ("array initialized from non-constant array expression");
4863 return error_mark_node;
4866 if (optimize && TREE_CODE (inside_init) == VAR_DECL)
4867 inside_init = decl_constant_value_for_broken_optimization (inside_init);
4869 /* Compound expressions can only occur here if -pedantic or
4870 -pedantic-errors is specified. In the later case, we always want
4871 an error. In the former case, we simply want a warning. */
4872 if (require_constant && pedantic
4873 && TREE_CODE (inside_init) == COMPOUND_EXPR)
4876 = valid_compound_expr_initializer (inside_init,
4877 TREE_TYPE (inside_init));
4878 if (inside_init == error_mark_node)
4879 error_init ("initializer element is not constant");
4881 pedwarn_init ("initializer element is not constant");
4882 if (flag_pedantic_errors)
4883 inside_init = error_mark_node;
4885 else if (require_constant
4886 && !initializer_constant_valid_p (inside_init,
4887 TREE_TYPE (inside_init)))
4889 error_init ("initializer element is not constant");
4890 inside_init = error_mark_node;
4893 /* Added to enable additional -Wmissing-format-attribute warnings. */
4894 if (TREE_CODE (TREE_TYPE (inside_init)) == POINTER_TYPE)
4895 inside_init = convert_for_assignment (type, inside_init, ic_init, NULL_TREE,
4900 /* Handle scalar types, including conversions. */
4902 if (code == INTEGER_TYPE || code == REAL_TYPE || code == FIXED_POINT_TYPE
4903 || code == POINTER_TYPE || code == ENUMERAL_TYPE || code == BOOLEAN_TYPE
4904 || code == COMPLEX_TYPE || code == VECTOR_TYPE)
4906 if (TREE_CODE (TREE_TYPE (init)) == ARRAY_TYPE
4907 && (TREE_CODE (init) == STRING_CST
4908 || TREE_CODE (init) == COMPOUND_LITERAL_EXPR))
4909 init = array_to_pointer_conversion (init);
4911 = convert_for_assignment (type, init, ic_init,
4912 NULL_TREE, NULL_TREE, 0);
4914 /* Check to see if we have already given an error message. */
4915 if (inside_init == error_mark_node)
4917 else if (require_constant && !TREE_CONSTANT (inside_init))
4919 error_init ("initializer element is not constant");
4920 inside_init = error_mark_node;
4922 else if (require_constant
4923 && !initializer_constant_valid_p (inside_init,
4924 TREE_TYPE (inside_init)))
4926 error_init ("initializer element is not computable at load time");
4927 inside_init = error_mark_node;
4933 /* Come here only for records and arrays. */
4935 if (COMPLETE_TYPE_P (type) && TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST)
4937 error_init ("variable-sized object may not be initialized");
4938 return error_mark_node;
4941 error_init ("invalid initializer");
4942 return error_mark_node;
4945 /* Handle initializers that use braces. */
4947 /* Type of object we are accumulating a constructor for.
4948 This type is always a RECORD_TYPE, UNION_TYPE or ARRAY_TYPE. */
4949 static tree constructor_type;
4951 /* For a RECORD_TYPE or UNION_TYPE, this is the chain of fields
4953 static tree constructor_fields;
4955 /* For an ARRAY_TYPE, this is the specified index
4956 at which to store the next element we get. */
4957 static tree constructor_index;
4959 /* For an ARRAY_TYPE, this is the maximum index. */
4960 static tree constructor_max_index;
4962 /* For a RECORD_TYPE, this is the first field not yet written out. */
4963 static tree constructor_unfilled_fields;
4965 /* For an ARRAY_TYPE, this is the index of the first element
4966 not yet written out. */
4967 static tree constructor_unfilled_index;
4969 /* In a RECORD_TYPE, the byte index of the next consecutive field.
4970 This is so we can generate gaps between fields, when appropriate. */
4971 static tree constructor_bit_index;
4973 /* If we are saving up the elements rather than allocating them,
4974 this is the list of elements so far (in reverse order,
4975 most recent first). */
4976 static VEC(constructor_elt,gc) *constructor_elements;
4978 /* 1 if constructor should be incrementally stored into a constructor chain,
4979 0 if all the elements should be kept in AVL tree. */
4980 static int constructor_incremental;
4982 /* 1 if so far this constructor's elements are all compile-time constants. */
4983 static int constructor_constant;
4985 /* 1 if so far this constructor's elements are all valid address constants. */
4986 static int constructor_simple;
4988 /* 1 if this constructor is erroneous so far. */
4989 static int constructor_erroneous;
4991 /* Structure for managing pending initializer elements, organized as an
4996 struct init_node *left, *right;
4997 struct init_node *parent;
5003 /* Tree of pending elements at this constructor level.
5004 These are elements encountered out of order
5005 which belong at places we haven't reached yet in actually
5007 Will never hold tree nodes across GC runs. */
5008 static struct init_node *constructor_pending_elts;
5010 /* The SPELLING_DEPTH of this constructor. */
5011 static int constructor_depth;
5013 /* DECL node for which an initializer is being read.
5014 0 means we are reading a constructor expression
5015 such as (struct foo) {...}. */
5016 static tree constructor_decl;
5018 /* Nonzero if this is an initializer for a top-level decl. */
5019 static int constructor_top_level;
5021 /* Nonzero if there were any member designators in this initializer. */
5022 static int constructor_designated;
5024 /* Nesting depth of designator list. */
5025 static int designator_depth;
5027 /* Nonzero if there were diagnosed errors in this designator list. */
5028 static int designator_erroneous;
5031 /* This stack has a level for each implicit or explicit level of
5032 structuring in the initializer, including the outermost one. It
5033 saves the values of most of the variables above. */
5035 struct constructor_range_stack;
5037 struct constructor_stack
5039 struct constructor_stack *next;
5044 tree unfilled_index;
5045 tree unfilled_fields;
5047 VEC(constructor_elt,gc) *elements;
5048 struct init_node *pending_elts;
5051 /* If value nonzero, this value should replace the entire
5052 constructor at this level. */
5053 struct c_expr replacement_value;
5054 struct constructor_range_stack *range_stack;
5064 static struct constructor_stack *constructor_stack;
5066 /* This stack represents designators from some range designator up to
5067 the last designator in the list. */
5069 struct constructor_range_stack
5071 struct constructor_range_stack *next, *prev;
5072 struct constructor_stack *stack;
5079 static struct constructor_range_stack *constructor_range_stack;
5081 /* This stack records separate initializers that are nested.
5082 Nested initializers can't happen in ANSI C, but GNU C allows them
5083 in cases like { ... (struct foo) { ... } ... }. */
5085 struct initializer_stack
5087 struct initializer_stack *next;
5089 struct constructor_stack *constructor_stack;
5090 struct constructor_range_stack *constructor_range_stack;
5091 VEC(constructor_elt,gc) *elements;
5092 struct spelling *spelling;
5093 struct spelling *spelling_base;
5096 char require_constant_value;
5097 char require_constant_elements;
5100 static struct initializer_stack *initializer_stack;
5102 /* Prepare to parse and output the initializer for variable DECL. */
5105 start_init (tree decl, tree asmspec_tree ATTRIBUTE_UNUSED, int top_level)
5108 struct initializer_stack *p = XNEW (struct initializer_stack);
5110 p->decl = constructor_decl;
5111 p->require_constant_value = require_constant_value;
5112 p->require_constant_elements = require_constant_elements;
5113 p->constructor_stack = constructor_stack;
5114 p->constructor_range_stack = constructor_range_stack;
5115 p->elements = constructor_elements;
5116 p->spelling = spelling;
5117 p->spelling_base = spelling_base;
5118 p->spelling_size = spelling_size;
5119 p->top_level = constructor_top_level;
5120 p->next = initializer_stack;
5121 initializer_stack = p;
5123 constructor_decl = decl;
5124 constructor_designated = 0;
5125 constructor_top_level = top_level;
5127 if (decl != 0 && decl != error_mark_node)
5129 require_constant_value = TREE_STATIC (decl);
5130 require_constant_elements
5131 = ((TREE_STATIC (decl) || (pedantic && !flag_isoc99))
5132 /* For a scalar, you can always use any value to initialize,
5133 even within braces. */
5134 && (TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE
5135 || TREE_CODE (TREE_TYPE (decl)) == RECORD_TYPE
5136 || TREE_CODE (TREE_TYPE (decl)) == UNION_TYPE
5137 || TREE_CODE (TREE_TYPE (decl)) == QUAL_UNION_TYPE));
5138 locus = IDENTIFIER_POINTER (DECL_NAME (decl));
5142 require_constant_value = 0;
5143 require_constant_elements = 0;
5144 locus = "(anonymous)";
5147 constructor_stack = 0;
5148 constructor_range_stack = 0;
5150 missing_braces_mentioned = 0;
5154 RESTORE_SPELLING_DEPTH (0);
5157 push_string (locus);
5163 struct initializer_stack *p = initializer_stack;
5165 /* Free the whole constructor stack of this initializer. */
5166 while (constructor_stack)
5168 struct constructor_stack *q = constructor_stack;
5169 constructor_stack = q->next;
5173 gcc_assert (!constructor_range_stack);
5175 /* Pop back to the data of the outer initializer (if any). */
5176 free (spelling_base);
5178 constructor_decl = p->decl;
5179 require_constant_value = p->require_constant_value;
5180 require_constant_elements = p->require_constant_elements;
5181 constructor_stack = p->constructor_stack;
5182 constructor_range_stack = p->constructor_range_stack;
5183 constructor_elements = p->elements;
5184 spelling = p->spelling;
5185 spelling_base = p->spelling_base;
5186 spelling_size = p->spelling_size;
5187 constructor_top_level = p->top_level;
5188 initializer_stack = p->next;
5192 /* Call here when we see the initializer is surrounded by braces.
5193 This is instead of a call to push_init_level;
5194 it is matched by a call to pop_init_level.
5196 TYPE is the type to initialize, for a constructor expression.
5197 For an initializer for a decl, TYPE is zero. */
5200 really_start_incremental_init (tree type)
5202 struct constructor_stack *p = XNEW (struct constructor_stack);
5205 type = TREE_TYPE (constructor_decl);
5207 if (targetm.vector_opaque_p (type))
5208 error ("opaque vector types cannot be initialized");
5210 p->type = constructor_type;
5211 p->fields = constructor_fields;
5212 p->index = constructor_index;
5213 p->max_index = constructor_max_index;
5214 p->unfilled_index = constructor_unfilled_index;
5215 p->unfilled_fields = constructor_unfilled_fields;
5216 p->bit_index = constructor_bit_index;
5217 p->elements = constructor_elements;
5218 p->constant = constructor_constant;
5219 p->simple = constructor_simple;
5220 p->erroneous = constructor_erroneous;
5221 p->pending_elts = constructor_pending_elts;
5222 p->depth = constructor_depth;
5223 p->replacement_value.value = 0;
5224 p->replacement_value.original_code = ERROR_MARK;
5228 p->incremental = constructor_incremental;
5229 p->designated = constructor_designated;
5231 constructor_stack = p;
5233 constructor_constant = 1;
5234 constructor_simple = 1;
5235 constructor_depth = SPELLING_DEPTH ();
5236 constructor_elements = 0;
5237 constructor_pending_elts = 0;
5238 constructor_type = type;
5239 constructor_incremental = 1;
5240 constructor_designated = 0;
5241 designator_depth = 0;
5242 designator_erroneous = 0;
5244 if (TREE_CODE (constructor_type) == RECORD_TYPE
5245 || TREE_CODE (constructor_type) == UNION_TYPE)
5247 constructor_fields = TYPE_FIELDS (constructor_type);
5248 /* Skip any nameless bit fields at the beginning. */
5249 while (constructor_fields != 0 && DECL_C_BIT_FIELD (constructor_fields)
5250 && DECL_NAME (constructor_fields) == 0)
5251 constructor_fields = TREE_CHAIN (constructor_fields);
5253 constructor_unfilled_fields = constructor_fields;
5254 constructor_bit_index = bitsize_zero_node;
5256 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5258 if (TYPE_DOMAIN (constructor_type))
5260 constructor_max_index
5261 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type));
5263 /* Detect non-empty initializations of zero-length arrays. */
5264 if (constructor_max_index == NULL_TREE
5265 && TYPE_SIZE (constructor_type))
5266 constructor_max_index = build_int_cst (NULL_TREE, -1);
5268 /* constructor_max_index needs to be an INTEGER_CST. Attempts
5269 to initialize VLAs will cause a proper error; avoid tree
5270 checking errors as well by setting a safe value. */
5271 if (constructor_max_index
5272 && TREE_CODE (constructor_max_index) != INTEGER_CST)
5273 constructor_max_index = build_int_cst (NULL_TREE, -1);
5276 = convert (bitsizetype,
5277 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
5281 constructor_index = bitsize_zero_node;
5282 constructor_max_index = NULL_TREE;
5285 constructor_unfilled_index = constructor_index;
5287 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
5289 /* Vectors are like simple fixed-size arrays. */
5290 constructor_max_index =
5291 build_int_cst (NULL_TREE, TYPE_VECTOR_SUBPARTS (constructor_type) - 1);
5292 constructor_index = bitsize_zero_node;
5293 constructor_unfilled_index = constructor_index;
5297 /* Handle the case of int x = {5}; */
5298 constructor_fields = constructor_type;
5299 constructor_unfilled_fields = constructor_type;
5303 /* Push down into a subobject, for initialization.
5304 If this is for an explicit set of braces, IMPLICIT is 0.
5305 If it is because the next element belongs at a lower level,
5306 IMPLICIT is 1 (or 2 if the push is because of designator list). */
5309 push_init_level (int implicit)
5311 struct constructor_stack *p;
5312 tree value = NULL_TREE;
5314 /* If we've exhausted any levels that didn't have braces,
5315 pop them now. If implicit == 1, this will have been done in
5316 process_init_element; do not repeat it here because in the case
5317 of excess initializers for an empty aggregate this leads to an
5318 infinite cycle of popping a level and immediately recreating
5322 while (constructor_stack->implicit)
5324 if ((TREE_CODE (constructor_type) == RECORD_TYPE
5325 || TREE_CODE (constructor_type) == UNION_TYPE)
5326 && constructor_fields == 0)
5327 process_init_element (pop_init_level (1));
5328 else if (TREE_CODE (constructor_type) == ARRAY_TYPE
5329 && constructor_max_index
5330 && tree_int_cst_lt (constructor_max_index,
5332 process_init_element (pop_init_level (1));
5338 /* Unless this is an explicit brace, we need to preserve previous
5342 if ((TREE_CODE (constructor_type) == RECORD_TYPE
5343 || TREE_CODE (constructor_type) == UNION_TYPE)
5344 && constructor_fields)
5345 value = find_init_member (constructor_fields);
5346 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5347 value = find_init_member (constructor_index);
5350 p = XNEW (struct constructor_stack);
5351 p->type = constructor_type;
5352 p->fields = constructor_fields;
5353 p->index = constructor_index;
5354 p->max_index = constructor_max_index;
5355 p->unfilled_index = constructor_unfilled_index;
5356 p->unfilled_fields = constructor_unfilled_fields;
5357 p->bit_index = constructor_bit_index;
5358 p->elements = constructor_elements;
5359 p->constant = constructor_constant;
5360 p->simple = constructor_simple;
5361 p->erroneous = constructor_erroneous;
5362 p->pending_elts = constructor_pending_elts;
5363 p->depth = constructor_depth;
5364 p->replacement_value.value = 0;
5365 p->replacement_value.original_code = ERROR_MARK;
5366 p->implicit = implicit;
5368 p->incremental = constructor_incremental;
5369 p->designated = constructor_designated;
5370 p->next = constructor_stack;
5372 constructor_stack = p;
5374 constructor_constant = 1;
5375 constructor_simple = 1;
5376 constructor_depth = SPELLING_DEPTH ();
5377 constructor_elements = 0;
5378 constructor_incremental = 1;
5379 constructor_designated = 0;
5380 constructor_pending_elts = 0;
5383 p->range_stack = constructor_range_stack;
5384 constructor_range_stack = 0;
5385 designator_depth = 0;
5386 designator_erroneous = 0;
5389 /* Don't die if an entire brace-pair level is superfluous
5390 in the containing level. */
5391 if (constructor_type == 0)
5393 else if (TREE_CODE (constructor_type) == RECORD_TYPE
5394 || TREE_CODE (constructor_type) == UNION_TYPE)
5396 /* Don't die if there are extra init elts at the end. */
5397 if (constructor_fields == 0)
5398 constructor_type = 0;
5401 constructor_type = TREE_TYPE (constructor_fields);
5402 push_member_name (constructor_fields);
5403 constructor_depth++;
5406 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5408 constructor_type = TREE_TYPE (constructor_type);
5409 push_array_bounds (tree_low_cst (constructor_index, 1));
5410 constructor_depth++;
5413 if (constructor_type == 0)
5415 error_init ("extra brace group at end of initializer");
5416 constructor_fields = 0;
5417 constructor_unfilled_fields = 0;
5421 if (value && TREE_CODE (value) == CONSTRUCTOR)
5423 constructor_constant = TREE_CONSTANT (value);
5424 constructor_simple = TREE_STATIC (value);
5425 constructor_elements = CONSTRUCTOR_ELTS (value);
5426 if (!VEC_empty (constructor_elt, constructor_elements)
5427 && (TREE_CODE (constructor_type) == RECORD_TYPE
5428 || TREE_CODE (constructor_type) == ARRAY_TYPE))
5429 set_nonincremental_init ();
5432 if (implicit == 1 && warn_missing_braces && !missing_braces_mentioned)
5434 missing_braces_mentioned = 1;
5435 warning_init (OPT_Wmissing_braces, "missing braces around initializer");
5438 if (TREE_CODE (constructor_type) == RECORD_TYPE
5439 || TREE_CODE (constructor_type) == UNION_TYPE)
5441 constructor_fields = TYPE_FIELDS (constructor_type);
5442 /* Skip any nameless bit fields at the beginning. */
5443 while (constructor_fields != 0 && DECL_C_BIT_FIELD (constructor_fields)
5444 && DECL_NAME (constructor_fields) == 0)
5445 constructor_fields = TREE_CHAIN (constructor_fields);
5447 constructor_unfilled_fields = constructor_fields;
5448 constructor_bit_index = bitsize_zero_node;
5450 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
5452 /* Vectors are like simple fixed-size arrays. */
5453 constructor_max_index =
5454 build_int_cst (NULL_TREE, TYPE_VECTOR_SUBPARTS (constructor_type) - 1);
5455 constructor_index = convert (bitsizetype, integer_zero_node);
5456 constructor_unfilled_index = constructor_index;
5458 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5460 if (TYPE_DOMAIN (constructor_type))
5462 constructor_max_index
5463 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type));
5465 /* Detect non-empty initializations of zero-length arrays. */
5466 if (constructor_max_index == NULL_TREE
5467 && TYPE_SIZE (constructor_type))
5468 constructor_max_index = build_int_cst (NULL_TREE, -1);
5470 /* constructor_max_index needs to be an INTEGER_CST. Attempts
5471 to initialize VLAs will cause a proper error; avoid tree
5472 checking errors as well by setting a safe value. */
5473 if (constructor_max_index
5474 && TREE_CODE (constructor_max_index) != INTEGER_CST)
5475 constructor_max_index = build_int_cst (NULL_TREE, -1);
5478 = convert (bitsizetype,
5479 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
5482 constructor_index = bitsize_zero_node;
5484 constructor_unfilled_index = constructor_index;
5485 if (value && TREE_CODE (value) == STRING_CST)
5487 /* We need to split the char/wchar array into individual
5488 characters, so that we don't have to special case it
5490 set_nonincremental_init_from_string (value);
5495 if (constructor_type != error_mark_node)
5496 warning_init (0, "braces around scalar initializer");
5497 constructor_fields = constructor_type;
5498 constructor_unfilled_fields = constructor_type;
5502 /* At the end of an implicit or explicit brace level,
5503 finish up that level of constructor. If a single expression
5504 with redundant braces initialized that level, return the
5505 c_expr structure for that expression. Otherwise, the original_code
5506 element is set to ERROR_MARK.
5507 If we were outputting the elements as they are read, return 0 as the value
5508 from inner levels (process_init_element ignores that),
5509 but return error_mark_node as the value from the outermost level
5510 (that's what we want to put in DECL_INITIAL).
5511 Otherwise, return a CONSTRUCTOR expression as the value. */
5514 pop_init_level (int implicit)
5516 struct constructor_stack *p;
5519 ret.original_code = ERROR_MARK;
5523 /* When we come to an explicit close brace,
5524 pop any inner levels that didn't have explicit braces. */
5525 while (constructor_stack->implicit)
5526 process_init_element (pop_init_level (1));
5528 gcc_assert (!constructor_range_stack);
5531 /* Now output all pending elements. */
5532 constructor_incremental = 1;
5533 output_pending_init_elements (1);
5535 p = constructor_stack;
5537 /* Error for initializing a flexible array member, or a zero-length
5538 array member in an inappropriate context. */
5539 if (constructor_type && constructor_fields
5540 && TREE_CODE (constructor_type) == ARRAY_TYPE
5541 && TYPE_DOMAIN (constructor_type)
5542 && !TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type)))
5544 /* Silently discard empty initializations. The parser will
5545 already have pedwarned for empty brackets. */
5546 if (integer_zerop (constructor_unfilled_index))
5547 constructor_type = NULL_TREE;
5550 gcc_assert (!TYPE_SIZE (constructor_type));
5552 if (constructor_depth > 2)
5553 error_init ("initialization of flexible array member in a nested context");
5555 pedwarn_init ("initialization of a flexible array member");
5557 /* We have already issued an error message for the existence
5558 of a flexible array member not at the end of the structure.
5559 Discard the initializer so that we do not die later. */
5560 if (TREE_CHAIN (constructor_fields) != NULL_TREE)
5561 constructor_type = NULL_TREE;
5565 /* Warn when some struct elements are implicitly initialized to zero. */
5566 if (warn_missing_field_initializers
5568 && TREE_CODE (constructor_type) == RECORD_TYPE
5569 && constructor_unfilled_fields)
5571 /* Do not warn for flexible array members or zero-length arrays. */
5572 while (constructor_unfilled_fields
5573 && (!DECL_SIZE (constructor_unfilled_fields)
5574 || integer_zerop (DECL_SIZE (constructor_unfilled_fields))))
5575 constructor_unfilled_fields = TREE_CHAIN (constructor_unfilled_fields);
5577 /* Do not warn if this level of the initializer uses member
5578 designators; it is likely to be deliberate. */
5579 if (constructor_unfilled_fields && !constructor_designated)
5581 push_member_name (constructor_unfilled_fields);
5582 warning_init (OPT_Wmissing_field_initializers,
5583 "missing initializer");
5584 RESTORE_SPELLING_DEPTH (constructor_depth);
5588 /* Pad out the end of the structure. */
5589 if (p->replacement_value.value)
5590 /* If this closes a superfluous brace pair,
5591 just pass out the element between them. */
5592 ret = p->replacement_value;
5593 else if (constructor_type == 0)
5595 else if (TREE_CODE (constructor_type) != RECORD_TYPE
5596 && TREE_CODE (constructor_type) != UNION_TYPE
5597 && TREE_CODE (constructor_type) != ARRAY_TYPE
5598 && TREE_CODE (constructor_type) != VECTOR_TYPE)
5600 /* A nonincremental scalar initializer--just return
5601 the element, after verifying there is just one. */
5602 if (VEC_empty (constructor_elt,constructor_elements))
5604 if (!constructor_erroneous)
5605 error_init ("empty scalar initializer");
5606 ret.value = error_mark_node;
5608 else if (VEC_length (constructor_elt,constructor_elements) != 1)
5610 error_init ("extra elements in scalar initializer");
5611 ret.value = VEC_index (constructor_elt,constructor_elements,0)->value;
5614 ret.value = VEC_index (constructor_elt,constructor_elements,0)->value;
5618 if (constructor_erroneous)
5619 ret.value = error_mark_node;
5622 ret.value = build_constructor (constructor_type,
5623 constructor_elements);
5624 if (constructor_constant)
5625 TREE_CONSTANT (ret.value) = 1;
5626 if (constructor_constant && constructor_simple)
5627 TREE_STATIC (ret.value) = 1;
5631 constructor_type = p->type;
5632 constructor_fields = p->fields;
5633 constructor_index = p->index;
5634 constructor_max_index = p->max_index;
5635 constructor_unfilled_index = p->unfilled_index;
5636 constructor_unfilled_fields = p->unfilled_fields;
5637 constructor_bit_index = p->bit_index;
5638 constructor_elements = p->elements;
5639 constructor_constant = p->constant;
5640 constructor_simple = p->simple;
5641 constructor_erroneous = p->erroneous;
5642 constructor_incremental = p->incremental;
5643 constructor_designated = p->designated;
5644 constructor_pending_elts = p->pending_elts;
5645 constructor_depth = p->depth;
5647 constructor_range_stack = p->range_stack;
5648 RESTORE_SPELLING_DEPTH (constructor_depth);
5650 constructor_stack = p->next;
5653 if (ret.value == 0 && constructor_stack == 0)
5654 ret.value = error_mark_node;
5658 /* Common handling for both array range and field name designators.
5659 ARRAY argument is nonzero for array ranges. Returns zero for success. */
5662 set_designator (int array)
5665 enum tree_code subcode;
5667 /* Don't die if an entire brace-pair level is superfluous
5668 in the containing level. */
5669 if (constructor_type == 0)
5672 /* If there were errors in this designator list already, bail out
5674 if (designator_erroneous)
5677 if (!designator_depth)
5679 gcc_assert (!constructor_range_stack);
5681 /* Designator list starts at the level of closest explicit
5683 while (constructor_stack->implicit)
5684 process_init_element (pop_init_level (1));
5685 constructor_designated = 1;
5689 switch (TREE_CODE (constructor_type))
5693 subtype = TREE_TYPE (constructor_fields);
5694 if (subtype != error_mark_node)
5695 subtype = TYPE_MAIN_VARIANT (subtype);
5698 subtype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
5704 subcode = TREE_CODE (subtype);
5705 if (array && subcode != ARRAY_TYPE)
5707 error_init ("array index in non-array initializer");
5710 else if (!array && subcode != RECORD_TYPE && subcode != UNION_TYPE)
5712 error_init ("field name not in record or union initializer");
5716 constructor_designated = 1;
5717 push_init_level (2);
5721 /* If there are range designators in designator list, push a new designator
5722 to constructor_range_stack. RANGE_END is end of such stack range or
5723 NULL_TREE if there is no range designator at this level. */
5726 push_range_stack (tree range_end)
5728 struct constructor_range_stack *p;
5730 p = GGC_NEW (struct constructor_range_stack);
5731 p->prev = constructor_range_stack;
5733 p->fields = constructor_fields;
5734 p->range_start = constructor_index;
5735 p->index = constructor_index;
5736 p->stack = constructor_stack;
5737 p->range_end = range_end;
5738 if (constructor_range_stack)
5739 constructor_range_stack->next = p;
5740 constructor_range_stack = p;
5743 /* Within an array initializer, specify the next index to be initialized.
5744 FIRST is that index. If LAST is nonzero, then initialize a range
5745 of indices, running from FIRST through LAST. */
5748 set_init_index (tree first, tree last)
5750 if (set_designator (1))
5753 designator_erroneous = 1;
5755 if (!INTEGRAL_TYPE_P (TREE_TYPE (first))
5756 || (last && !INTEGRAL_TYPE_P (TREE_TYPE (last))))
5758 error_init ("array index in initializer not of integer type");
5762 if (TREE_CODE (first) != INTEGER_CST)
5763 error_init ("nonconstant array index in initializer");
5764 else if (last != 0 && TREE_CODE (last) != INTEGER_CST)
5765 error_init ("nonconstant array index in initializer");
5766 else if (TREE_CODE (constructor_type) != ARRAY_TYPE)
5767 error_init ("array index in non-array initializer");
5768 else if (tree_int_cst_sgn (first) == -1)
5769 error_init ("array index in initializer exceeds array bounds");
5770 else if (constructor_max_index
5771 && tree_int_cst_lt (constructor_max_index, first))
5772 error_init ("array index in initializer exceeds array bounds");
5775 constructor_index = convert (bitsizetype, first);
5779 if (tree_int_cst_equal (first, last))
5781 else if (tree_int_cst_lt (last, first))
5783 error_init ("empty index range in initializer");
5788 last = convert (bitsizetype, last);
5789 if (constructor_max_index != 0
5790 && tree_int_cst_lt (constructor_max_index, last))
5792 error_init ("array index range in initializer exceeds array bounds");
5799 designator_erroneous = 0;
5800 if (constructor_range_stack || last)
5801 push_range_stack (last);
5805 /* Within a struct initializer, specify the next field to be initialized. */
5808 set_init_label (tree fieldname)
5812 if (set_designator (0))
5815 designator_erroneous = 1;
5817 if (TREE_CODE (constructor_type) != RECORD_TYPE
5818 && TREE_CODE (constructor_type) != UNION_TYPE)
5820 error_init ("field name not in record or union initializer");
5824 for (tail = TYPE_FIELDS (constructor_type); tail;
5825 tail = TREE_CHAIN (tail))
5827 if (DECL_NAME (tail) == fieldname)
5832 error ("unknown field %qE specified in initializer", fieldname);
5835 constructor_fields = tail;
5837 designator_erroneous = 0;
5838 if (constructor_range_stack)
5839 push_range_stack (NULL_TREE);
5843 /* Add a new initializer to the tree of pending initializers. PURPOSE
5844 identifies the initializer, either array index or field in a structure.
5845 VALUE is the value of that index or field. */
5848 add_pending_init (tree purpose, tree value)
5850 struct init_node *p, **q, *r;
5852 q = &constructor_pending_elts;
5855 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5860 if (tree_int_cst_lt (purpose, p->purpose))
5862 else if (tree_int_cst_lt (p->purpose, purpose))
5866 if (TREE_SIDE_EFFECTS (p->value))
5867 warning_init (0, "initialized field with side-effects overwritten");
5868 else if (warn_override_init)
5869 warning_init (OPT_Woverride_init, "initialized field overwritten");
5879 bitpos = bit_position (purpose);
5883 if (tree_int_cst_lt (bitpos, bit_position (p->purpose)))
5885 else if (p->purpose != purpose)
5889 if (TREE_SIDE_EFFECTS (p->value))
5890 warning_init (0, "initialized field with side-effects overwritten");
5891 else if (warn_override_init)
5892 warning_init (OPT_Woverride_init, "initialized field overwritten");
5899 r = GGC_NEW (struct init_node);
5900 r->purpose = purpose;
5911 struct init_node *s;
5915 if (p->balance == 0)
5917 else if (p->balance < 0)
5924 p->left->parent = p;
5941 constructor_pending_elts = r;
5946 struct init_node *t = r->right;
5950 r->right->parent = r;
5955 p->left->parent = p;
5958 p->balance = t->balance < 0;
5959 r->balance = -(t->balance > 0);
5974 constructor_pending_elts = t;
5980 /* p->balance == +1; growth of left side balances the node. */
5985 else /* r == p->right */
5987 if (p->balance == 0)
5988 /* Growth propagation from right side. */
5990 else if (p->balance > 0)
5997 p->right->parent = p;
6014 constructor_pending_elts = r;
6016 else /* r->balance == -1 */
6019 struct init_node *t = r->left;
6023 r->left->parent = r;
6028 p->right->parent = p;
6031 r->balance = (t->balance < 0);
6032 p->balance = -(t->balance > 0);
6047 constructor_pending_elts = t;
6053 /* p->balance == -1; growth of right side balances the node. */
6064 /* Build AVL tree from a sorted chain. */
6067 set_nonincremental_init (void)
6069 unsigned HOST_WIDE_INT ix;
6072 if (TREE_CODE (constructor_type) != RECORD_TYPE
6073 && TREE_CODE (constructor_type) != ARRAY_TYPE)
6076 FOR_EACH_CONSTRUCTOR_ELT (constructor_elements, ix, index, value)
6077 add_pending_init (index, value);
6078 constructor_elements = 0;
6079 if (TREE_CODE (constructor_type) == RECORD_TYPE)
6081 constructor_unfilled_fields = TYPE_FIELDS (constructor_type);
6082 /* Skip any nameless bit fields at the beginning. */
6083 while (constructor_unfilled_fields != 0
6084 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
6085 && DECL_NAME (constructor_unfilled_fields) == 0)
6086 constructor_unfilled_fields = TREE_CHAIN (constructor_unfilled_fields);
6089 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6091 if (TYPE_DOMAIN (constructor_type))
6092 constructor_unfilled_index
6093 = convert (bitsizetype,
6094 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
6096 constructor_unfilled_index = bitsize_zero_node;
6098 constructor_incremental = 0;
6101 /* Build AVL tree from a string constant. */
6104 set_nonincremental_init_from_string (tree str)
6106 tree value, purpose, type;
6107 HOST_WIDE_INT val[2];
6108 const char *p, *end;
6109 int byte, wchar_bytes, charwidth, bitpos;
6111 gcc_assert (TREE_CODE (constructor_type) == ARRAY_TYPE);
6113 if (TYPE_PRECISION (TREE_TYPE (TREE_TYPE (str)))
6114 == TYPE_PRECISION (char_type_node))
6118 gcc_assert (TYPE_PRECISION (TREE_TYPE (TREE_TYPE (str)))
6119 == TYPE_PRECISION (wchar_type_node));
6120 wchar_bytes = TYPE_PRECISION (wchar_type_node) / BITS_PER_UNIT;
6122 charwidth = TYPE_PRECISION (char_type_node);
6123 type = TREE_TYPE (constructor_type);
6124 p = TREE_STRING_POINTER (str);
6125 end = p + TREE_STRING_LENGTH (str);
6127 for (purpose = bitsize_zero_node;
6128 p < end && !tree_int_cst_lt (constructor_max_index, purpose);
6129 purpose = size_binop (PLUS_EXPR, purpose, bitsize_one_node))
6131 if (wchar_bytes == 1)
6133 val[1] = (unsigned char) *p++;
6140 for (byte = 0; byte < wchar_bytes; byte++)
6142 if (BYTES_BIG_ENDIAN)
6143 bitpos = (wchar_bytes - byte - 1) * charwidth;
6145 bitpos = byte * charwidth;
6146 val[bitpos < HOST_BITS_PER_WIDE_INT]
6147 |= ((unsigned HOST_WIDE_INT) ((unsigned char) *p++))
6148 << (bitpos % HOST_BITS_PER_WIDE_INT);
6152 if (!TYPE_UNSIGNED (type))
6154 bitpos = ((wchar_bytes - 1) * charwidth) + HOST_BITS_PER_CHAR;
6155 if (bitpos < HOST_BITS_PER_WIDE_INT)
6157 if (val[1] & (((HOST_WIDE_INT) 1) << (bitpos - 1)))
6159 val[1] |= ((HOST_WIDE_INT) -1) << bitpos;
6163 else if (bitpos == HOST_BITS_PER_WIDE_INT)
6168 else if (val[0] & (((HOST_WIDE_INT) 1)
6169 << (bitpos - 1 - HOST_BITS_PER_WIDE_INT)))
6170 val[0] |= ((HOST_WIDE_INT) -1)
6171 << (bitpos - HOST_BITS_PER_WIDE_INT);
6174 value = build_int_cst_wide (type, val[1], val[0]);
6175 add_pending_init (purpose, value);
6178 constructor_incremental = 0;
6181 /* Return value of FIELD in pending initializer or zero if the field was
6182 not initialized yet. */
6185 find_init_member (tree field)
6187 struct init_node *p;
6189 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6191 if (constructor_incremental
6192 && tree_int_cst_lt (field, constructor_unfilled_index))
6193 set_nonincremental_init ();
6195 p = constructor_pending_elts;
6198 if (tree_int_cst_lt (field, p->purpose))
6200 else if (tree_int_cst_lt (p->purpose, field))
6206 else if (TREE_CODE (constructor_type) == RECORD_TYPE)
6208 tree bitpos = bit_position (field);
6210 if (constructor_incremental
6211 && (!constructor_unfilled_fields
6212 || tree_int_cst_lt (bitpos,
6213 bit_position (constructor_unfilled_fields))))
6214 set_nonincremental_init ();
6216 p = constructor_pending_elts;
6219 if (field == p->purpose)
6221 else if (tree_int_cst_lt (bitpos, bit_position (p->purpose)))
6227 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6229 if (!VEC_empty (constructor_elt, constructor_elements)
6230 && (VEC_last (constructor_elt, constructor_elements)->index
6232 return VEC_last (constructor_elt, constructor_elements)->value;
6237 /* "Output" the next constructor element.
6238 At top level, really output it to assembler code now.
6239 Otherwise, collect it in a list from which we will make a CONSTRUCTOR.
6240 TYPE is the data type that the containing data type wants here.
6241 FIELD is the field (a FIELD_DECL) or the index that this element fills.
6242 If VALUE is a string constant, STRICT_STRING is true if it is
6243 unparenthesized or we should not warn here for it being parenthesized.
6244 For other types of VALUE, STRICT_STRING is not used.
6246 PENDING if non-nil means output pending elements that belong
6247 right after this element. (PENDING is normally 1;
6248 it is 0 while outputting pending elements, to avoid recursion.) */
6251 output_init_element (tree value, bool strict_string, tree type, tree field,
6254 constructor_elt *celt;
6256 if (type == error_mark_node || value == error_mark_node)
6258 constructor_erroneous = 1;
6261 if (TREE_CODE (TREE_TYPE (value)) == ARRAY_TYPE
6262 && (TREE_CODE (value) == STRING_CST
6263 || TREE_CODE (value) == COMPOUND_LITERAL_EXPR)
6264 && !(TREE_CODE (value) == STRING_CST
6265 && TREE_CODE (type) == ARRAY_TYPE
6266 && INTEGRAL_TYPE_P (TREE_TYPE (type)))
6267 && !comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (value)),
6268 TYPE_MAIN_VARIANT (type)))
6269 value = array_to_pointer_conversion (value);
6271 if (TREE_CODE (value) == COMPOUND_LITERAL_EXPR
6272 && require_constant_value && !flag_isoc99 && pending)
6274 /* As an extension, allow initializing objects with static storage
6275 duration with compound literals (which are then treated just as
6276 the brace enclosed list they contain). */
6277 tree decl = COMPOUND_LITERAL_EXPR_DECL (value);
6278 value = DECL_INITIAL (decl);
6281 if (value == error_mark_node)
6282 constructor_erroneous = 1;
6283 else if (!TREE_CONSTANT (value))
6284 constructor_constant = 0;
6285 else if (!initializer_constant_valid_p (value, TREE_TYPE (value))
6286 || ((TREE_CODE (constructor_type) == RECORD_TYPE
6287 || TREE_CODE (constructor_type) == UNION_TYPE)
6288 && DECL_C_BIT_FIELD (field)
6289 && TREE_CODE (value) != INTEGER_CST))
6290 constructor_simple = 0;
6292 if (!initializer_constant_valid_p (value, TREE_TYPE (value)))
6294 if (require_constant_value)
6296 error_init ("initializer element is not constant");
6297 value = error_mark_node;
6299 else if (require_constant_elements)
6300 pedwarn ("initializer element is not computable at load time");
6303 /* If this field is empty (and not at the end of structure),
6304 don't do anything other than checking the initializer. */
6306 && (TREE_TYPE (field) == error_mark_node
6307 || (COMPLETE_TYPE_P (TREE_TYPE (field))
6308 && integer_zerop (TYPE_SIZE (TREE_TYPE (field)))
6309 && (TREE_CODE (constructor_type) == ARRAY_TYPE
6310 || TREE_CHAIN (field)))))
6313 value = digest_init (type, value, strict_string, require_constant_value);
6314 if (value == error_mark_node)
6316 constructor_erroneous = 1;
6320 /* If this element doesn't come next in sequence,
6321 put it on constructor_pending_elts. */
6322 if (TREE_CODE (constructor_type) == ARRAY_TYPE
6323 && (!constructor_incremental
6324 || !tree_int_cst_equal (field, constructor_unfilled_index)))
6326 if (constructor_incremental
6327 && tree_int_cst_lt (field, constructor_unfilled_index))
6328 set_nonincremental_init ();
6330 add_pending_init (field, value);
6333 else if (TREE_CODE (constructor_type) == RECORD_TYPE
6334 && (!constructor_incremental
6335 || field != constructor_unfilled_fields))
6337 /* We do this for records but not for unions. In a union,
6338 no matter which field is specified, it can be initialized
6339 right away since it starts at the beginning of the union. */
6340 if (constructor_incremental)
6342 if (!constructor_unfilled_fields)
6343 set_nonincremental_init ();
6346 tree bitpos, unfillpos;
6348 bitpos = bit_position (field);
6349 unfillpos = bit_position (constructor_unfilled_fields);
6351 if (tree_int_cst_lt (bitpos, unfillpos))
6352 set_nonincremental_init ();
6356 add_pending_init (field, value);
6359 else if (TREE_CODE (constructor_type) == UNION_TYPE
6360 && !VEC_empty (constructor_elt, constructor_elements))
6362 if (TREE_SIDE_EFFECTS (VEC_last (constructor_elt,
6363 constructor_elements)->value))
6364 warning_init (0, "initialized field with side-effects overwritten");
6365 else if (warn_override_init)
6366 warning_init (OPT_Woverride_init, "initialized field overwritten");
6368 /* We can have just one union field set. */
6369 constructor_elements = 0;
6372 /* Otherwise, output this element either to
6373 constructor_elements or to the assembler file. */
6375 celt = VEC_safe_push (constructor_elt, gc, constructor_elements, NULL);
6376 celt->index = field;
6377 celt->value = value;
6379 /* Advance the variable that indicates sequential elements output. */
6380 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6381 constructor_unfilled_index
6382 = size_binop (PLUS_EXPR, constructor_unfilled_index,
6384 else if (TREE_CODE (constructor_type) == RECORD_TYPE)
6386 constructor_unfilled_fields
6387 = TREE_CHAIN (constructor_unfilled_fields);
6389 /* Skip any nameless bit fields. */
6390 while (constructor_unfilled_fields != 0
6391 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
6392 && DECL_NAME (constructor_unfilled_fields) == 0)
6393 constructor_unfilled_fields =
6394 TREE_CHAIN (constructor_unfilled_fields);
6396 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6397 constructor_unfilled_fields = 0;
6399 /* Now output any pending elements which have become next. */
6401 output_pending_init_elements (0);
6404 /* Output any pending elements which have become next.
6405 As we output elements, constructor_unfilled_{fields,index}
6406 advances, which may cause other elements to become next;
6407 if so, they too are output.
6409 If ALL is 0, we return when there are
6410 no more pending elements to output now.
6412 If ALL is 1, we output space as necessary so that
6413 we can output all the pending elements. */
6416 output_pending_init_elements (int all)
6418 struct init_node *elt = constructor_pending_elts;
6423 /* Look through the whole pending tree.
6424 If we find an element that should be output now,
6425 output it. Otherwise, set NEXT to the element
6426 that comes first among those still pending. */
6431 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6433 if (tree_int_cst_equal (elt->purpose,
6434 constructor_unfilled_index))
6435 output_init_element (elt->value, true,
6436 TREE_TYPE (constructor_type),
6437 constructor_unfilled_index, 0);
6438 else if (tree_int_cst_lt (constructor_unfilled_index,
6441 /* Advance to the next smaller node. */
6446 /* We have reached the smallest node bigger than the
6447 current unfilled index. Fill the space first. */
6448 next = elt->purpose;
6454 /* Advance to the next bigger node. */
6459 /* We have reached the biggest node in a subtree. Find
6460 the parent of it, which is the next bigger node. */
6461 while (elt->parent && elt->parent->right == elt)
6464 if (elt && tree_int_cst_lt (constructor_unfilled_index,
6467 next = elt->purpose;
6473 else if (TREE_CODE (constructor_type) == RECORD_TYPE
6474 || TREE_CODE (constructor_type) == UNION_TYPE)
6476 tree ctor_unfilled_bitpos, elt_bitpos;
6478 /* If the current record is complete we are done. */
6479 if (constructor_unfilled_fields == 0)
6482 ctor_unfilled_bitpos = bit_position (constructor_unfilled_fields);
6483 elt_bitpos = bit_position (elt->purpose);
6484 /* We can't compare fields here because there might be empty
6485 fields in between. */
6486 if (tree_int_cst_equal (elt_bitpos, ctor_unfilled_bitpos))
6488 constructor_unfilled_fields = elt->purpose;
6489 output_init_element (elt->value, true, TREE_TYPE (elt->purpose),
6492 else if (tree_int_cst_lt (ctor_unfilled_bitpos, elt_bitpos))
6494 /* Advance to the next smaller node. */
6499 /* We have reached the smallest node bigger than the
6500 current unfilled field. Fill the space first. */
6501 next = elt->purpose;
6507 /* Advance to the next bigger node. */
6512 /* We have reached the biggest node in a subtree. Find
6513 the parent of it, which is the next bigger node. */
6514 while (elt->parent && elt->parent->right == elt)
6518 && (tree_int_cst_lt (ctor_unfilled_bitpos,
6519 bit_position (elt->purpose))))
6521 next = elt->purpose;
6529 /* Ordinarily return, but not if we want to output all
6530 and there are elements left. */
6531 if (!(all && next != 0))
6534 /* If it's not incremental, just skip over the gap, so that after
6535 jumping to retry we will output the next successive element. */
6536 if (TREE_CODE (constructor_type) == RECORD_TYPE
6537 || TREE_CODE (constructor_type) == UNION_TYPE)
6538 constructor_unfilled_fields = next;
6539 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6540 constructor_unfilled_index = next;
6542 /* ELT now points to the node in the pending tree with the next
6543 initializer to output. */
6547 /* Add one non-braced element to the current constructor level.
6548 This adjusts the current position within the constructor's type.
6549 This may also start or terminate implicit levels
6550 to handle a partly-braced initializer.
6552 Once this has found the correct level for the new element,
6553 it calls output_init_element. */
6556 process_init_element (struct c_expr value)
6558 tree orig_value = value.value;
6559 int string_flag = orig_value != 0 && TREE_CODE (orig_value) == STRING_CST;
6560 bool strict_string = value.original_code == STRING_CST;
6562 designator_depth = 0;
6563 designator_erroneous = 0;
6565 /* Handle superfluous braces around string cst as in
6566 char x[] = {"foo"}; */
6569 && TREE_CODE (constructor_type) == ARRAY_TYPE
6570 && INTEGRAL_TYPE_P (TREE_TYPE (constructor_type))
6571 && integer_zerop (constructor_unfilled_index))
6573 if (constructor_stack->replacement_value.value)
6574 error_init ("excess elements in char array initializer");
6575 constructor_stack->replacement_value = value;
6579 if (constructor_stack->replacement_value.value != 0)
6581 error_init ("excess elements in struct initializer");
6585 /* Ignore elements of a brace group if it is entirely superfluous
6586 and has already been diagnosed. */
6587 if (constructor_type == 0)
6590 /* If we've exhausted any levels that didn't have braces,
6592 while (constructor_stack->implicit)
6594 if ((TREE_CODE (constructor_type) == RECORD_TYPE
6595 || TREE_CODE (constructor_type) == UNION_TYPE)
6596 && constructor_fields == 0)
6597 process_init_element (pop_init_level (1));
6598 else if (TREE_CODE (constructor_type) == ARRAY_TYPE
6599 && (constructor_max_index == 0
6600 || tree_int_cst_lt (constructor_max_index,
6601 constructor_index)))
6602 process_init_element (pop_init_level (1));
6607 /* In the case of [LO ... HI] = VALUE, only evaluate VALUE once. */
6608 if (constructor_range_stack)
6610 /* If value is a compound literal and we'll be just using its
6611 content, don't put it into a SAVE_EXPR. */
6612 if (TREE_CODE (value.value) != COMPOUND_LITERAL_EXPR
6613 || !require_constant_value
6615 value.value = save_expr (value.value);
6620 if (TREE_CODE (constructor_type) == RECORD_TYPE)
6623 enum tree_code fieldcode;
6625 if (constructor_fields == 0)
6627 pedwarn_init ("excess elements in struct initializer");
6631 fieldtype = TREE_TYPE (constructor_fields);
6632 if (fieldtype != error_mark_node)
6633 fieldtype = TYPE_MAIN_VARIANT (fieldtype);
6634 fieldcode = TREE_CODE (fieldtype);
6636 /* Error for non-static initialization of a flexible array member. */
6637 if (fieldcode == ARRAY_TYPE
6638 && !require_constant_value
6639 && TYPE_SIZE (fieldtype) == NULL_TREE
6640 && TREE_CHAIN (constructor_fields) == NULL_TREE)
6642 error_init ("non-static initialization of a flexible array member");
6646 /* Accept a string constant to initialize a subarray. */
6647 if (value.value != 0
6648 && fieldcode == ARRAY_TYPE
6649 && INTEGRAL_TYPE_P (TREE_TYPE (fieldtype))
6651 value.value = orig_value;
6652 /* Otherwise, if we have come to a subaggregate,
6653 and we don't have an element of its type, push into it. */
6654 else if (value.value != 0
6655 && value.value != error_mark_node
6656 && TYPE_MAIN_VARIANT (TREE_TYPE (value.value)) != fieldtype
6657 && (fieldcode == RECORD_TYPE || fieldcode == ARRAY_TYPE
6658 || fieldcode == UNION_TYPE))
6660 push_init_level (1);
6666 push_member_name (constructor_fields);
6667 output_init_element (value.value, strict_string,
6668 fieldtype, constructor_fields, 1);
6669 RESTORE_SPELLING_DEPTH (constructor_depth);
6672 /* Do the bookkeeping for an element that was
6673 directly output as a constructor. */
6675 /* For a record, keep track of end position of last field. */
6676 if (DECL_SIZE (constructor_fields))
6677 constructor_bit_index
6678 = size_binop (PLUS_EXPR,
6679 bit_position (constructor_fields),
6680 DECL_SIZE (constructor_fields));
6682 /* If the current field was the first one not yet written out,
6683 it isn't now, so update. */
6684 if (constructor_unfilled_fields == constructor_fields)
6686 constructor_unfilled_fields = TREE_CHAIN (constructor_fields);
6687 /* Skip any nameless bit fields. */
6688 while (constructor_unfilled_fields != 0
6689 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
6690 && DECL_NAME (constructor_unfilled_fields) == 0)
6691 constructor_unfilled_fields =
6692 TREE_CHAIN (constructor_unfilled_fields);
6696 constructor_fields = TREE_CHAIN (constructor_fields);
6697 /* Skip any nameless bit fields at the beginning. */
6698 while (constructor_fields != 0
6699 && DECL_C_BIT_FIELD (constructor_fields)
6700 && DECL_NAME (constructor_fields) == 0)
6701 constructor_fields = TREE_CHAIN (constructor_fields);
6703 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6706 enum tree_code fieldcode;
6708 if (constructor_fields == 0)
6710 pedwarn_init ("excess elements in union initializer");
6714 fieldtype = TREE_TYPE (constructor_fields);
6715 if (fieldtype != error_mark_node)
6716 fieldtype = TYPE_MAIN_VARIANT (fieldtype);
6717 fieldcode = TREE_CODE (fieldtype);
6719 /* Warn that traditional C rejects initialization of unions.
6720 We skip the warning if the value is zero. This is done
6721 under the assumption that the zero initializer in user
6722 code appears conditioned on e.g. __STDC__ to avoid
6723 "missing initializer" warnings and relies on default
6724 initialization to zero in the traditional C case.
6725 We also skip the warning if the initializer is designated,
6726 again on the assumption that this must be conditional on
6727 __STDC__ anyway (and we've already complained about the
6728 member-designator already). */
6729 if (!in_system_header && !constructor_designated
6730 && !(value.value && (integer_zerop (value.value)
6731 || real_zerop (value.value))))
6732 warning (OPT_Wtraditional, "traditional C rejects initialization "
6735 /* Accept a string constant to initialize a subarray. */
6736 if (value.value != 0
6737 && fieldcode == ARRAY_TYPE
6738 && INTEGRAL_TYPE_P (TREE_TYPE (fieldtype))
6740 value.value = orig_value;
6741 /* Otherwise, if we have come to a subaggregate,
6742 and we don't have an element of its type, push into it. */
6743 else if (value.value != 0
6744 && value.value != error_mark_node
6745 && TYPE_MAIN_VARIANT (TREE_TYPE (value.value)) != fieldtype
6746 && (fieldcode == RECORD_TYPE || fieldcode == ARRAY_TYPE
6747 || fieldcode == UNION_TYPE))
6749 push_init_level (1);
6755 push_member_name (constructor_fields);
6756 output_init_element (value.value, strict_string,
6757 fieldtype, constructor_fields, 1);
6758 RESTORE_SPELLING_DEPTH (constructor_depth);
6761 /* Do the bookkeeping for an element that was
6762 directly output as a constructor. */
6764 constructor_bit_index = DECL_SIZE (constructor_fields);
6765 constructor_unfilled_fields = TREE_CHAIN (constructor_fields);
6768 constructor_fields = 0;
6770 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6772 tree elttype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
6773 enum tree_code eltcode = TREE_CODE (elttype);
6775 /* Accept a string constant to initialize a subarray. */
6776 if (value.value != 0
6777 && eltcode == ARRAY_TYPE
6778 && INTEGRAL_TYPE_P (TREE_TYPE (elttype))
6780 value.value = orig_value;
6781 /* Otherwise, if we have come to a subaggregate,
6782 and we don't have an element of its type, push into it. */
6783 else if (value.value != 0
6784 && value.value != error_mark_node
6785 && TYPE_MAIN_VARIANT (TREE_TYPE (value.value)) != elttype
6786 && (eltcode == RECORD_TYPE || eltcode == ARRAY_TYPE
6787 || eltcode == UNION_TYPE))
6789 push_init_level (1);
6793 if (constructor_max_index != 0
6794 && (tree_int_cst_lt (constructor_max_index, constructor_index)
6795 || integer_all_onesp (constructor_max_index)))
6797 pedwarn_init ("excess elements in array initializer");
6801 /* Now output the actual element. */
6804 push_array_bounds (tree_low_cst (constructor_index, 1));
6805 output_init_element (value.value, strict_string,
6806 elttype, constructor_index, 1);
6807 RESTORE_SPELLING_DEPTH (constructor_depth);
6811 = size_binop (PLUS_EXPR, constructor_index, bitsize_one_node);
6814 /* If we are doing the bookkeeping for an element that was
6815 directly output as a constructor, we must update
6816 constructor_unfilled_index. */
6817 constructor_unfilled_index = constructor_index;
6819 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
6821 tree elttype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
6823 /* Do a basic check of initializer size. Note that vectors
6824 always have a fixed size derived from their type. */
6825 if (tree_int_cst_lt (constructor_max_index, constructor_index))
6827 pedwarn_init ("excess elements in vector initializer");
6831 /* Now output the actual element. */
6833 output_init_element (value.value, strict_string,
6834 elttype, constructor_index, 1);
6837 = size_binop (PLUS_EXPR, constructor_index, bitsize_one_node);
6840 /* If we are doing the bookkeeping for an element that was
6841 directly output as a constructor, we must update
6842 constructor_unfilled_index. */
6843 constructor_unfilled_index = constructor_index;
6846 /* Handle the sole element allowed in a braced initializer
6847 for a scalar variable. */
6848 else if (constructor_type != error_mark_node
6849 && constructor_fields == 0)
6851 pedwarn_init ("excess elements in scalar initializer");
6857 output_init_element (value.value, strict_string,
6858 constructor_type, NULL_TREE, 1);
6859 constructor_fields = 0;
6862 /* Handle range initializers either at this level or anywhere higher
6863 in the designator stack. */
6864 if (constructor_range_stack)
6866 struct constructor_range_stack *p, *range_stack;
6869 range_stack = constructor_range_stack;
6870 constructor_range_stack = 0;
6871 while (constructor_stack != range_stack->stack)
6873 gcc_assert (constructor_stack->implicit);
6874 process_init_element (pop_init_level (1));
6876 for (p = range_stack;
6877 !p->range_end || tree_int_cst_equal (p->index, p->range_end);
6880 gcc_assert (constructor_stack->implicit);
6881 process_init_element (pop_init_level (1));
6884 p->index = size_binop (PLUS_EXPR, p->index, bitsize_one_node);
6885 if (tree_int_cst_equal (p->index, p->range_end) && !p->prev)
6890 constructor_index = p->index;
6891 constructor_fields = p->fields;
6892 if (finish && p->range_end && p->index == p->range_start)
6900 push_init_level (2);
6901 p->stack = constructor_stack;
6902 if (p->range_end && tree_int_cst_equal (p->index, p->range_end))
6903 p->index = p->range_start;
6907 constructor_range_stack = range_stack;
6914 constructor_range_stack = 0;
6917 /* Build a complete asm-statement, whose components are a CV_QUALIFIER
6918 (guaranteed to be 'volatile' or null) and ARGS (represented using
6919 an ASM_EXPR node). */
6921 build_asm_stmt (tree cv_qualifier, tree args)
6923 if (!ASM_VOLATILE_P (args) && cv_qualifier)
6924 ASM_VOLATILE_P (args) = 1;
6925 return add_stmt (args);
6928 /* Build an asm-expr, whose components are a STRING, some OUTPUTS,
6929 some INPUTS, and some CLOBBERS. The latter three may be NULL.
6930 SIMPLE indicates whether there was anything at all after the
6931 string in the asm expression -- asm("blah") and asm("blah" : )
6932 are subtly different. We use a ASM_EXPR node to represent this. */
6934 build_asm_expr (tree string, tree outputs, tree inputs, tree clobbers,
6940 const char *constraint;
6941 const char **oconstraints;
6942 bool allows_mem, allows_reg, is_inout;
6943 int ninputs, noutputs;
6945 ninputs = list_length (inputs);
6946 noutputs = list_length (outputs);
6947 oconstraints = (const char **) alloca (noutputs * sizeof (const char *));
6949 string = resolve_asm_operand_names (string, outputs, inputs);
6951 /* Remove output conversions that change the type but not the mode. */
6952 for (i = 0, tail = outputs; tail; ++i, tail = TREE_CHAIN (tail))
6954 tree output = TREE_VALUE (tail);
6956 /* ??? Really, this should not be here. Users should be using a
6957 proper lvalue, dammit. But there's a long history of using casts
6958 in the output operands. In cases like longlong.h, this becomes a
6959 primitive form of typechecking -- if the cast can be removed, then
6960 the output operand had a type of the proper width; otherwise we'll
6961 get an error. Gross, but ... */
6962 STRIP_NOPS (output);
6964 if (!lvalue_or_else (output, lv_asm))
6965 output = error_mark_node;
6967 if (output != error_mark_node
6968 && (TREE_READONLY (output)
6969 || TYPE_READONLY (TREE_TYPE (output))
6970 || ((TREE_CODE (TREE_TYPE (output)) == RECORD_TYPE
6971 || TREE_CODE (TREE_TYPE (output)) == UNION_TYPE)
6972 && C_TYPE_FIELDS_READONLY (TREE_TYPE (output)))))
6973 readonly_error (output, lv_asm);
6975 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
6976 oconstraints[i] = constraint;
6978 if (parse_output_constraint (&constraint, i, ninputs, noutputs,
6979 &allows_mem, &allows_reg, &is_inout))
6981 /* If the operand is going to end up in memory,
6982 mark it addressable. */
6983 if (!allows_reg && !c_mark_addressable (output))
6984 output = error_mark_node;
6987 output = error_mark_node;
6989 TREE_VALUE (tail) = output;
6992 for (i = 0, tail = inputs; tail; ++i, tail = TREE_CHAIN (tail))
6996 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
6997 input = TREE_VALUE (tail);
6999 if (parse_input_constraint (&constraint, i, ninputs, noutputs, 0,
7000 oconstraints, &allows_mem, &allows_reg))
7002 /* If the operand is going to end up in memory,
7003 mark it addressable. */
7004 if (!allows_reg && allows_mem)
7006 /* Strip the nops as we allow this case. FIXME, this really
7007 should be rejected or made deprecated. */
7009 if (!c_mark_addressable (input))
7010 input = error_mark_node;
7014 input = error_mark_node;
7016 TREE_VALUE (tail) = input;
7019 args = build_stmt (ASM_EXPR, string, outputs, inputs, clobbers);
7021 /* asm statements without outputs, including simple ones, are treated
7023 ASM_INPUT_P (args) = simple;
7024 ASM_VOLATILE_P (args) = (noutputs == 0);
7029 /* Generate a goto statement to LABEL. */
7032 c_finish_goto_label (tree label)
7034 tree decl = lookup_label (label);
7038 if (C_DECL_UNJUMPABLE_STMT_EXPR (decl))
7040 error ("jump into statement expression");
7044 if (C_DECL_UNJUMPABLE_VM (decl))
7046 error ("jump into scope of identifier with variably modified type");
7050 if (!C_DECL_UNDEFINABLE_STMT_EXPR (decl))
7052 /* No jump from outside this statement expression context, so
7053 record that there is a jump from within this context. */
7054 struct c_label_list *nlist;
7055 nlist = XOBNEW (&parser_obstack, struct c_label_list);
7056 nlist->next = label_context_stack_se->labels_used;
7057 nlist->label = decl;
7058 label_context_stack_se->labels_used = nlist;
7061 if (!C_DECL_UNDEFINABLE_VM (decl))
7063 /* No jump from outside this context context of identifiers with
7064 variably modified type, so record that there is a jump from
7065 within this context. */
7066 struct c_label_list *nlist;
7067 nlist = XOBNEW (&parser_obstack, struct c_label_list);
7068 nlist->next = label_context_stack_vm->labels_used;
7069 nlist->label = decl;
7070 label_context_stack_vm->labels_used = nlist;
7073 TREE_USED (decl) = 1;
7074 return add_stmt (build1 (GOTO_EXPR, void_type_node, decl));
7077 /* Generate a computed goto statement to EXPR. */
7080 c_finish_goto_ptr (tree expr)
7083 pedwarn ("ISO C forbids %<goto *expr;%>");
7084 expr = convert (ptr_type_node, expr);
7085 return add_stmt (build1 (GOTO_EXPR, void_type_node, expr));
7088 /* Generate a C `return' statement. RETVAL is the expression for what
7089 to return, or a null pointer for `return;' with no value. */
7092 c_finish_return (tree retval)
7094 tree valtype = TREE_TYPE (TREE_TYPE (current_function_decl)), ret_stmt;
7095 bool no_warning = false;
7097 if (TREE_THIS_VOLATILE (current_function_decl))
7098 warning (0, "function declared %<noreturn%> has a %<return%> statement");
7102 current_function_returns_null = 1;
7103 if ((warn_return_type || flag_isoc99)
7104 && valtype != 0 && TREE_CODE (valtype) != VOID_TYPE)
7106 pedwarn_c99 ("%<return%> with no value, in "
7107 "function returning non-void");
7111 else if (valtype == 0 || TREE_CODE (valtype) == VOID_TYPE)
7113 current_function_returns_null = 1;
7114 if (TREE_CODE (TREE_TYPE (retval)) != VOID_TYPE)
7115 pedwarn ("%<return%> with a value, in function returning void");
7117 pedwarn ("ISO C forbids %<return%> with expression, in function returning void");
7121 tree t = convert_for_assignment (valtype, retval, ic_return,
7122 NULL_TREE, NULL_TREE, 0);
7123 tree res = DECL_RESULT (current_function_decl);
7126 current_function_returns_value = 1;
7127 if (t == error_mark_node)
7130 inner = t = convert (TREE_TYPE (res), t);
7132 /* Strip any conversions, additions, and subtractions, and see if
7133 we are returning the address of a local variable. Warn if so. */
7136 switch (TREE_CODE (inner))
7138 case NOP_EXPR: case NON_LVALUE_EXPR: case CONVERT_EXPR:
7140 inner = TREE_OPERAND (inner, 0);
7144 /* If the second operand of the MINUS_EXPR has a pointer
7145 type (or is converted from it), this may be valid, so
7146 don't give a warning. */
7148 tree op1 = TREE_OPERAND (inner, 1);
7150 while (!POINTER_TYPE_P (TREE_TYPE (op1))
7151 && (TREE_CODE (op1) == NOP_EXPR
7152 || TREE_CODE (op1) == NON_LVALUE_EXPR
7153 || TREE_CODE (op1) == CONVERT_EXPR))
7154 op1 = TREE_OPERAND (op1, 0);
7156 if (POINTER_TYPE_P (TREE_TYPE (op1)))
7159 inner = TREE_OPERAND (inner, 0);
7164 inner = TREE_OPERAND (inner, 0);
7166 while (REFERENCE_CLASS_P (inner)
7167 && TREE_CODE (inner) != INDIRECT_REF)
7168 inner = TREE_OPERAND (inner, 0);
7171 && !DECL_EXTERNAL (inner)
7172 && !TREE_STATIC (inner)
7173 && DECL_CONTEXT (inner) == current_function_decl)
7174 warning (0, "function returns address of local variable");
7184 retval = build2 (MODIFY_EXPR, TREE_TYPE (res), res, t);
7187 ret_stmt = build_stmt (RETURN_EXPR, retval);
7188 TREE_NO_WARNING (ret_stmt) |= no_warning;
7189 return add_stmt (ret_stmt);
7193 /* The SWITCH_EXPR being built. */
7196 /* The original type of the testing expression, i.e. before the
7197 default conversion is applied. */
7200 /* A splay-tree mapping the low element of a case range to the high
7201 element, or NULL_TREE if there is no high element. Used to
7202 determine whether or not a new case label duplicates an old case
7203 label. We need a tree, rather than simply a hash table, because
7204 of the GNU case range extension. */
7207 /* Number of nested statement expressions within this switch
7208 statement; if nonzero, case and default labels may not
7210 unsigned int blocked_stmt_expr;
7212 /* Scope of outermost declarations of identifiers with variably
7213 modified type within this switch statement; if nonzero, case and
7214 default labels may not appear. */
7215 unsigned int blocked_vm;
7217 /* The next node on the stack. */
7218 struct c_switch *next;
7221 /* A stack of the currently active switch statements. The innermost
7222 switch statement is on the top of the stack. There is no need to
7223 mark the stack for garbage collection because it is only active
7224 during the processing of the body of a function, and we never
7225 collect at that point. */
7227 struct c_switch *c_switch_stack;
7229 /* Start a C switch statement, testing expression EXP. Return the new
7233 c_start_case (tree exp)
7235 tree orig_type = error_mark_node;
7236 struct c_switch *cs;
7238 if (exp != error_mark_node)
7240 orig_type = TREE_TYPE (exp);
7242 if (!INTEGRAL_TYPE_P (orig_type))
7244 if (orig_type != error_mark_node)
7246 error ("switch quantity not an integer");
7247 orig_type = error_mark_node;
7249 exp = integer_zero_node;
7253 tree type = TYPE_MAIN_VARIANT (orig_type);
7255 if (!in_system_header
7256 && (type == long_integer_type_node
7257 || type == long_unsigned_type_node))
7258 warning (OPT_Wtraditional, "%<long%> switch expression not "
7259 "converted to %<int%> in ISO C");
7261 exp = default_conversion (exp);
7265 /* Add this new SWITCH_EXPR to the stack. */
7266 cs = XNEW (struct c_switch);
7267 cs->switch_expr = build3 (SWITCH_EXPR, orig_type, exp, NULL_TREE, NULL_TREE);
7268 cs->orig_type = orig_type;
7269 cs->cases = splay_tree_new (case_compare, NULL, NULL);
7270 cs->blocked_stmt_expr = 0;
7272 cs->next = c_switch_stack;
7273 c_switch_stack = cs;
7275 return add_stmt (cs->switch_expr);
7278 /* Process a case label. */
7281 do_case (tree low_value, tree high_value)
7283 tree label = NULL_TREE;
7285 if (c_switch_stack && !c_switch_stack->blocked_stmt_expr
7286 && !c_switch_stack->blocked_vm)
7288 label = c_add_case_label (c_switch_stack->cases,
7289 SWITCH_COND (c_switch_stack->switch_expr),
7290 c_switch_stack->orig_type,
7291 low_value, high_value);
7292 if (label == error_mark_node)
7295 else if (c_switch_stack && c_switch_stack->blocked_stmt_expr)
7298 error ("case label in statement expression not containing "
7299 "enclosing switch statement");
7301 error ("%<default%> label in statement expression not containing "
7302 "enclosing switch statement");
7304 else if (c_switch_stack && c_switch_stack->blocked_vm)
7307 error ("case label in scope of identifier with variably modified "
7308 "type not containing enclosing switch statement");
7310 error ("%<default%> label in scope of identifier with variably "
7311 "modified type not containing enclosing switch statement");
7314 error ("case label not within a switch statement");
7316 error ("%<default%> label not within a switch statement");
7321 /* Finish the switch statement. */
7324 c_finish_case (tree body)
7326 struct c_switch *cs = c_switch_stack;
7327 location_t switch_location;
7329 SWITCH_BODY (cs->switch_expr) = body;
7331 /* We must not be within a statement expression nested in the switch
7332 at this point; we might, however, be within the scope of an
7333 identifier with variably modified type nested in the switch. */
7334 gcc_assert (!cs->blocked_stmt_expr);
7336 /* Emit warnings as needed. */
7337 if (EXPR_HAS_LOCATION (cs->switch_expr))
7338 switch_location = EXPR_LOCATION (cs->switch_expr);
7340 switch_location = input_location;
7341 c_do_switch_warnings (cs->cases, switch_location,
7342 TREE_TYPE (cs->switch_expr),
7343 SWITCH_COND (cs->switch_expr));
7345 /* Pop the stack. */
7346 c_switch_stack = cs->next;
7347 splay_tree_delete (cs->cases);
7351 /* Emit an if statement. IF_LOCUS is the location of the 'if'. COND,
7352 THEN_BLOCK and ELSE_BLOCK are expressions to be used; ELSE_BLOCK
7353 may be null. NESTED_IF is true if THEN_BLOCK contains another IF
7354 statement, and was not surrounded with parenthesis. */
7357 c_finish_if_stmt (location_t if_locus, tree cond, tree then_block,
7358 tree else_block, bool nested_if)
7362 /* Diagnose an ambiguous else if if-then-else is nested inside if-then. */
7363 if (warn_parentheses && nested_if && else_block == NULL)
7365 tree inner_if = then_block;
7367 /* We know from the grammar productions that there is an IF nested
7368 within THEN_BLOCK. Due to labels and c99 conditional declarations,
7369 it might not be exactly THEN_BLOCK, but should be the last
7370 non-container statement within. */
7372 switch (TREE_CODE (inner_if))
7377 inner_if = BIND_EXPR_BODY (inner_if);
7379 case STATEMENT_LIST:
7380 inner_if = expr_last (then_block);
7382 case TRY_FINALLY_EXPR:
7383 case TRY_CATCH_EXPR:
7384 inner_if = TREE_OPERAND (inner_if, 0);
7391 if (COND_EXPR_ELSE (inner_if))
7392 warning (OPT_Wparentheses,
7393 "%Hsuggest explicit braces to avoid ambiguous %<else%>",
7397 empty_if_body_warning (then_block, else_block);
7399 stmt = build3 (COND_EXPR, void_type_node, cond, then_block, else_block);
7400 SET_EXPR_LOCATION (stmt, if_locus);
7404 /* Emit a general-purpose loop construct. START_LOCUS is the location of
7405 the beginning of the loop. COND is the loop condition. COND_IS_FIRST
7406 is false for DO loops. INCR is the FOR increment expression. BODY is
7407 the statement controlled by the loop. BLAB is the break label. CLAB is
7408 the continue label. Everything is allowed to be NULL. */
7411 c_finish_loop (location_t start_locus, tree cond, tree incr, tree body,
7412 tree blab, tree clab, bool cond_is_first)
7414 tree entry = NULL, exit = NULL, t;
7416 /* If the condition is zero don't generate a loop construct. */
7417 if (cond && integer_zerop (cond))
7421 t = build_and_jump (&blab);
7422 SET_EXPR_LOCATION (t, start_locus);
7428 tree top = build1 (LABEL_EXPR, void_type_node, NULL_TREE);
7430 /* If we have an exit condition, then we build an IF with gotos either
7431 out of the loop, or to the top of it. If there's no exit condition,
7432 then we just build a jump back to the top. */
7433 exit = build_and_jump (&LABEL_EXPR_LABEL (top));
7435 if (cond && !integer_nonzerop (cond))
7437 /* Canonicalize the loop condition to the end. This means
7438 generating a branch to the loop condition. Reuse the
7439 continue label, if possible. */
7444 entry = build1 (LABEL_EXPR, void_type_node, NULL_TREE);
7445 t = build_and_jump (&LABEL_EXPR_LABEL (entry));
7448 t = build1 (GOTO_EXPR, void_type_node, clab);
7449 SET_EXPR_LOCATION (t, start_locus);
7453 t = build_and_jump (&blab);
7454 exit = fold_build3 (COND_EXPR, void_type_node, cond, exit, t);
7456 SET_EXPR_LOCATION (exit, start_locus);
7458 SET_EXPR_LOCATION (exit, input_location);
7467 add_stmt (build1 (LABEL_EXPR, void_type_node, clab));
7475 add_stmt (build1 (LABEL_EXPR, void_type_node, blab));
7479 c_finish_bc_stmt (tree *label_p, bool is_break)
7482 tree label = *label_p;
7484 /* In switch statements break is sometimes stylistically used after
7485 a return statement. This can lead to spurious warnings about
7486 control reaching the end of a non-void function when it is
7487 inlined. Note that we are calling block_may_fallthru with
7488 language specific tree nodes; this works because
7489 block_may_fallthru returns true when given something it does not
7491 skip = !block_may_fallthru (cur_stmt_list);
7496 *label_p = label = create_artificial_label ();
7498 else if (TREE_CODE (label) == LABEL_DECL)
7500 else switch (TREE_INT_CST_LOW (label))
7504 error ("break statement not within loop or switch");
7506 error ("continue statement not within a loop");
7510 gcc_assert (is_break);
7511 error ("break statement used with OpenMP for loop");
7522 add_stmt (build_predict_expr (PRED_CONTINUE, NOT_TAKEN));
7524 return add_stmt (build1 (GOTO_EXPR, void_type_node, label));
7527 /* A helper routine for c_process_expr_stmt and c_finish_stmt_expr. */
7530 emit_side_effect_warnings (tree expr)
7532 if (expr == error_mark_node)
7534 else if (!TREE_SIDE_EFFECTS (expr))
7536 if (!VOID_TYPE_P (TREE_TYPE (expr)) && !TREE_NO_WARNING (expr))
7537 warning (OPT_Wunused_value, "%Hstatement with no effect",
7538 EXPR_HAS_LOCATION (expr) ? EXPR_LOCUS (expr) : &input_location);
7541 warn_if_unused_value (expr, input_location);
7544 /* Process an expression as if it were a complete statement. Emit
7545 diagnostics, but do not call ADD_STMT. */
7548 c_process_expr_stmt (tree expr)
7553 if (warn_sequence_point)
7554 verify_sequence_points (expr);
7556 if (TREE_TYPE (expr) != error_mark_node
7557 && !COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (expr))
7558 && TREE_CODE (TREE_TYPE (expr)) != ARRAY_TYPE)
7559 error ("expression statement has incomplete type");
7561 /* If we're not processing a statement expression, warn about unused values.
7562 Warnings for statement expressions will be emitted later, once we figure
7563 out which is the result. */
7564 if (!STATEMENT_LIST_STMT_EXPR (cur_stmt_list)
7565 && warn_unused_value)
7566 emit_side_effect_warnings (expr);
7568 /* If the expression is not of a type to which we cannot assign a line
7569 number, wrap the thing in a no-op NOP_EXPR. */
7570 if (DECL_P (expr) || CONSTANT_CLASS_P (expr))
7571 expr = build1 (NOP_EXPR, TREE_TYPE (expr), expr);
7573 if (CAN_HAVE_LOCATION_P (expr))
7574 SET_EXPR_LOCATION (expr, input_location);
7579 /* Emit an expression as a statement. */
7582 c_finish_expr_stmt (tree expr)
7585 return add_stmt (c_process_expr_stmt (expr));
7590 /* Do the opposite and emit a statement as an expression. To begin,
7591 create a new binding level and return it. */
7594 c_begin_stmt_expr (void)
7597 struct c_label_context_se *nstack;
7598 struct c_label_list *glist;
7600 /* We must force a BLOCK for this level so that, if it is not expanded
7601 later, there is a way to turn off the entire subtree of blocks that
7602 are contained in it. */
7604 ret = c_begin_compound_stmt (true);
7607 c_switch_stack->blocked_stmt_expr++;
7608 gcc_assert (c_switch_stack->blocked_stmt_expr != 0);
7610 for (glist = label_context_stack_se->labels_used;
7612 glist = glist->next)
7614 C_DECL_UNDEFINABLE_STMT_EXPR (glist->label) = 1;
7616 nstack = XOBNEW (&parser_obstack, struct c_label_context_se);
7617 nstack->labels_def = NULL;
7618 nstack->labels_used = NULL;
7619 nstack->next = label_context_stack_se;
7620 label_context_stack_se = nstack;
7622 /* Mark the current statement list as belonging to a statement list. */
7623 STATEMENT_LIST_STMT_EXPR (ret) = 1;
7629 c_finish_stmt_expr (tree body)
7631 tree last, type, tmp, val;
7633 struct c_label_list *dlist, *glist, *glist_prev = NULL;
7635 body = c_end_compound_stmt (body, true);
7638 gcc_assert (c_switch_stack->blocked_stmt_expr != 0);
7639 c_switch_stack->blocked_stmt_expr--;
7641 /* It is no longer possible to jump to labels defined within this
7642 statement expression. */
7643 for (dlist = label_context_stack_se->labels_def;
7645 dlist = dlist->next)
7647 C_DECL_UNJUMPABLE_STMT_EXPR (dlist->label) = 1;
7649 /* It is again possible to define labels with a goto just outside
7650 this statement expression. */
7651 for (glist = label_context_stack_se->next->labels_used;
7653 glist = glist->next)
7655 C_DECL_UNDEFINABLE_STMT_EXPR (glist->label) = 0;
7658 if (glist_prev != NULL)
7659 glist_prev->next = label_context_stack_se->labels_used;
7661 label_context_stack_se->next->labels_used
7662 = label_context_stack_se->labels_used;
7663 label_context_stack_se = label_context_stack_se->next;
7665 /* Locate the last statement in BODY. See c_end_compound_stmt
7666 about always returning a BIND_EXPR. */
7667 last_p = &BIND_EXPR_BODY (body);
7668 last = BIND_EXPR_BODY (body);
7671 if (TREE_CODE (last) == STATEMENT_LIST)
7673 tree_stmt_iterator i;
7675 /* This can happen with degenerate cases like ({ }). No value. */
7676 if (!TREE_SIDE_EFFECTS (last))
7679 /* If we're supposed to generate side effects warnings, process
7680 all of the statements except the last. */
7681 if (warn_unused_value)
7683 for (i = tsi_start (last); !tsi_one_before_end_p (i); tsi_next (&i))
7684 emit_side_effect_warnings (tsi_stmt (i));
7687 i = tsi_last (last);
7688 last_p = tsi_stmt_ptr (i);
7692 /* If the end of the list is exception related, then the list was split
7693 by a call to push_cleanup. Continue searching. */
7694 if (TREE_CODE (last) == TRY_FINALLY_EXPR
7695 || TREE_CODE (last) == TRY_CATCH_EXPR)
7697 last_p = &TREE_OPERAND (last, 0);
7699 goto continue_searching;
7702 /* In the case that the BIND_EXPR is not necessary, return the
7703 expression out from inside it. */
7704 if (last == error_mark_node
7705 || (last == BIND_EXPR_BODY (body)
7706 && BIND_EXPR_VARS (body) == NULL))
7708 /* Do not warn if the return value of a statement expression is
7710 if (CAN_HAVE_LOCATION_P (last))
7711 TREE_NO_WARNING (last) = 1;
7715 /* Extract the type of said expression. */
7716 type = TREE_TYPE (last);
7718 /* If we're not returning a value at all, then the BIND_EXPR that
7719 we already have is a fine expression to return. */
7720 if (!type || VOID_TYPE_P (type))
7723 /* Now that we've located the expression containing the value, it seems
7724 silly to make voidify_wrapper_expr repeat the process. Create a
7725 temporary of the appropriate type and stick it in a TARGET_EXPR. */
7726 tmp = create_tmp_var_raw (type, NULL);
7728 /* Unwrap a no-op NOP_EXPR as added by c_finish_expr_stmt. This avoids
7729 tree_expr_nonnegative_p giving up immediately. */
7731 if (TREE_CODE (val) == NOP_EXPR
7732 && TREE_TYPE (val) == TREE_TYPE (TREE_OPERAND (val, 0)))
7733 val = TREE_OPERAND (val, 0);
7735 *last_p = build2 (MODIFY_EXPR, void_type_node, tmp, val);
7736 SET_EXPR_LOCUS (*last_p, EXPR_LOCUS (last));
7738 return build4 (TARGET_EXPR, type, tmp, body, NULL_TREE, NULL_TREE);
7741 /* Begin the scope of an identifier of variably modified type, scope
7742 number SCOPE. Jumping from outside this scope to inside it is not
7746 c_begin_vm_scope (unsigned int scope)
7748 struct c_label_context_vm *nstack;
7749 struct c_label_list *glist;
7751 gcc_assert (scope > 0);
7753 /* At file_scope, we don't have to do any processing. */
7754 if (label_context_stack_vm == NULL)
7757 if (c_switch_stack && !c_switch_stack->blocked_vm)
7758 c_switch_stack->blocked_vm = scope;
7759 for (glist = label_context_stack_vm->labels_used;
7761 glist = glist->next)
7763 C_DECL_UNDEFINABLE_VM (glist->label) = 1;
7765 nstack = XOBNEW (&parser_obstack, struct c_label_context_vm);
7766 nstack->labels_def = NULL;
7767 nstack->labels_used = NULL;
7768 nstack->scope = scope;
7769 nstack->next = label_context_stack_vm;
7770 label_context_stack_vm = nstack;
7773 /* End a scope which may contain identifiers of variably modified
7774 type, scope number SCOPE. */
7777 c_end_vm_scope (unsigned int scope)
7779 if (label_context_stack_vm == NULL)
7781 if (c_switch_stack && c_switch_stack->blocked_vm == scope)
7782 c_switch_stack->blocked_vm = 0;
7783 /* We may have a number of nested scopes of identifiers with
7784 variably modified type, all at this depth. Pop each in turn. */
7785 while (label_context_stack_vm->scope == scope)
7787 struct c_label_list *dlist, *glist, *glist_prev = NULL;
7789 /* It is no longer possible to jump to labels defined within this
7791 for (dlist = label_context_stack_vm->labels_def;
7793 dlist = dlist->next)
7795 C_DECL_UNJUMPABLE_VM (dlist->label) = 1;
7797 /* It is again possible to define labels with a goto just outside
7799 for (glist = label_context_stack_vm->next->labels_used;
7801 glist = glist->next)
7803 C_DECL_UNDEFINABLE_VM (glist->label) = 0;
7806 if (glist_prev != NULL)
7807 glist_prev->next = label_context_stack_vm->labels_used;
7809 label_context_stack_vm->next->labels_used
7810 = label_context_stack_vm->labels_used;
7811 label_context_stack_vm = label_context_stack_vm->next;
7815 /* Begin and end compound statements. This is as simple as pushing
7816 and popping new statement lists from the tree. */
7819 c_begin_compound_stmt (bool do_scope)
7821 tree stmt = push_stmt_list ();
7828 c_end_compound_stmt (tree stmt, bool do_scope)
7834 if (c_dialect_objc ())
7835 objc_clear_super_receiver ();
7836 block = pop_scope ();
7839 stmt = pop_stmt_list (stmt);
7840 stmt = c_build_bind_expr (block, stmt);
7842 /* If this compound statement is nested immediately inside a statement
7843 expression, then force a BIND_EXPR to be created. Otherwise we'll
7844 do the wrong thing for ({ { 1; } }) or ({ 1; { } }). In particular,
7845 STATEMENT_LISTs merge, and thus we can lose track of what statement
7848 && STATEMENT_LIST_STMT_EXPR (cur_stmt_list)
7849 && TREE_CODE (stmt) != BIND_EXPR)
7851 stmt = build3 (BIND_EXPR, void_type_node, NULL, stmt, NULL);
7852 TREE_SIDE_EFFECTS (stmt) = 1;
7858 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
7859 when the current scope is exited. EH_ONLY is true when this is not
7860 meant to apply to normal control flow transfer. */
7863 push_cleanup (tree ARG_UNUSED (decl), tree cleanup, bool eh_only)
7865 enum tree_code code;
7869 code = eh_only ? TRY_CATCH_EXPR : TRY_FINALLY_EXPR;
7870 stmt = build_stmt (code, NULL, cleanup);
7872 stmt_expr = STATEMENT_LIST_STMT_EXPR (cur_stmt_list);
7873 list = push_stmt_list ();
7874 TREE_OPERAND (stmt, 0) = list;
7875 STATEMENT_LIST_STMT_EXPR (list) = stmt_expr;
7878 /* Build a binary-operation expression without default conversions.
7879 CODE is the kind of expression to build.
7880 This function differs from `build' in several ways:
7881 the data type of the result is computed and recorded in it,
7882 warnings are generated if arg data types are invalid,
7883 special handling for addition and subtraction of pointers is known,
7884 and some optimization is done (operations on narrow ints
7885 are done in the narrower type when that gives the same result).
7886 Constant folding is also done before the result is returned.
7888 Note that the operands will never have enumeral types, or function
7889 or array types, because either they will have the default conversions
7890 performed or they have both just been converted to some other type in which
7891 the arithmetic is to be done. */
7894 build_binary_op (enum tree_code code, tree orig_op0, tree orig_op1,
7898 enum tree_code code0, code1;
7900 const char *invalid_op_diag;
7902 /* Expression code to give to the expression when it is built.
7903 Normally this is CODE, which is what the caller asked for,
7904 but in some special cases we change it. */
7905 enum tree_code resultcode = code;
7907 /* Data type in which the computation is to be performed.
7908 In the simplest cases this is the common type of the arguments. */
7909 tree result_type = NULL;
7911 /* Nonzero means operands have already been type-converted
7912 in whatever way is necessary.
7913 Zero means they need to be converted to RESULT_TYPE. */
7916 /* Nonzero means create the expression with this type, rather than
7918 tree build_type = 0;
7920 /* Nonzero means after finally constructing the expression
7921 convert it to this type. */
7922 tree final_type = 0;
7924 /* Nonzero if this is an operation like MIN or MAX which can
7925 safely be computed in short if both args are promoted shorts.
7926 Also implies COMMON.
7927 -1 indicates a bitwise operation; this makes a difference
7928 in the exact conditions for when it is safe to do the operation
7929 in a narrower mode. */
7932 /* Nonzero if this is a comparison operation;
7933 if both args are promoted shorts, compare the original shorts.
7934 Also implies COMMON. */
7935 int short_compare = 0;
7937 /* Nonzero if this is a right-shift operation, which can be computed on the
7938 original short and then promoted if the operand is a promoted short. */
7939 int short_shift = 0;
7941 /* Nonzero means set RESULT_TYPE to the common type of the args. */
7944 /* True means types are compatible as far as ObjC is concerned. */
7949 op0 = default_conversion (orig_op0);
7950 op1 = default_conversion (orig_op1);
7958 type0 = TREE_TYPE (op0);
7959 type1 = TREE_TYPE (op1);
7961 /* The expression codes of the data types of the arguments tell us
7962 whether the arguments are integers, floating, pointers, etc. */
7963 code0 = TREE_CODE (type0);
7964 code1 = TREE_CODE (type1);
7966 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
7967 STRIP_TYPE_NOPS (op0);
7968 STRIP_TYPE_NOPS (op1);
7970 /* If an error was already reported for one of the arguments,
7971 avoid reporting another error. */
7973 if (code0 == ERROR_MARK || code1 == ERROR_MARK)
7974 return error_mark_node;
7976 if ((invalid_op_diag
7977 = targetm.invalid_binary_op (code, type0, type1)))
7979 error (invalid_op_diag);
7980 return error_mark_node;
7983 objc_ok = objc_compare_types (type0, type1, -3, NULL_TREE);
7988 /* Handle the pointer + int case. */
7989 if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
7990 return pointer_int_sum (PLUS_EXPR, op0, op1);
7991 else if (code1 == POINTER_TYPE && code0 == INTEGER_TYPE)
7992 return pointer_int_sum (PLUS_EXPR, op1, op0);
7998 /* Subtraction of two similar pointers.
7999 We must subtract them as integers, then divide by object size. */
8000 if (code0 == POINTER_TYPE && code1 == POINTER_TYPE
8001 && comp_target_types (type0, type1))
8002 return pointer_diff (op0, op1);
8003 /* Handle pointer minus int. Just like pointer plus int. */
8004 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
8005 return pointer_int_sum (MINUS_EXPR, op0, op1);
8014 case TRUNC_DIV_EXPR:
8016 case FLOOR_DIV_EXPR:
8017 case ROUND_DIV_EXPR:
8018 case EXACT_DIV_EXPR:
8019 warn_for_div_by_zero (op1);
8021 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
8022 || code0 == FIXED_POINT_TYPE
8023 || code0 == COMPLEX_TYPE || code0 == VECTOR_TYPE)
8024 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
8025 || code1 == FIXED_POINT_TYPE
8026 || code1 == COMPLEX_TYPE || code1 == VECTOR_TYPE))
8028 enum tree_code tcode0 = code0, tcode1 = code1;
8030 if (code0 == COMPLEX_TYPE || code0 == VECTOR_TYPE)
8031 tcode0 = TREE_CODE (TREE_TYPE (TREE_TYPE (op0)));
8032 if (code1 == COMPLEX_TYPE || code1 == VECTOR_TYPE)
8033 tcode1 = TREE_CODE (TREE_TYPE (TREE_TYPE (op1)));
8035 if (!((tcode0 == INTEGER_TYPE && tcode1 == INTEGER_TYPE)
8036 || (tcode0 == FIXED_POINT_TYPE && tcode1 == FIXED_POINT_TYPE)))
8037 resultcode = RDIV_EXPR;
8039 /* Although it would be tempting to shorten always here, that
8040 loses on some targets, since the modulo instruction is
8041 undefined if the quotient can't be represented in the
8042 computation mode. We shorten only if unsigned or if
8043 dividing by something we know != -1. */
8044 shorten = (TYPE_UNSIGNED (TREE_TYPE (orig_op0))
8045 || (TREE_CODE (op1) == INTEGER_CST
8046 && !integer_all_onesp (op1)));
8054 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
8056 /* Allow vector types which are not floating point types. */
8057 else if (code0 == VECTOR_TYPE
8058 && code1 == VECTOR_TYPE
8059 && !VECTOR_FLOAT_TYPE_P (type0)
8060 && !VECTOR_FLOAT_TYPE_P (type1))
8064 case TRUNC_MOD_EXPR:
8065 case FLOOR_MOD_EXPR:
8066 warn_for_div_by_zero (op1);
8068 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
8070 /* Although it would be tempting to shorten always here, that loses
8071 on some targets, since the modulo instruction is undefined if the
8072 quotient can't be represented in the computation mode. We shorten
8073 only if unsigned or if dividing by something we know != -1. */
8074 shorten = (TYPE_UNSIGNED (TREE_TYPE (orig_op0))
8075 || (TREE_CODE (op1) == INTEGER_CST
8076 && !integer_all_onesp (op1)));
8081 case TRUTH_ANDIF_EXPR:
8082 case TRUTH_ORIF_EXPR:
8083 case TRUTH_AND_EXPR:
8085 case TRUTH_XOR_EXPR:
8086 if ((code0 == INTEGER_TYPE || code0 == POINTER_TYPE
8087 || code0 == REAL_TYPE || code0 == COMPLEX_TYPE
8088 || code0 == FIXED_POINT_TYPE)
8089 && (code1 == INTEGER_TYPE || code1 == POINTER_TYPE
8090 || code1 == REAL_TYPE || code1 == COMPLEX_TYPE
8091 || code1 == FIXED_POINT_TYPE))
8093 /* Result of these operations is always an int,
8094 but that does not mean the operands should be
8095 converted to ints! */
8096 result_type = integer_type_node;
8097 op0 = c_common_truthvalue_conversion (op0);
8098 op1 = c_common_truthvalue_conversion (op1);
8103 /* Shift operations: result has same type as first operand;
8104 always convert second operand to int.
8105 Also set SHORT_SHIFT if shifting rightward. */
8108 if ((code0 == INTEGER_TYPE || code0 == FIXED_POINT_TYPE)
8109 && code1 == INTEGER_TYPE)
8111 if (TREE_CODE (op1) == INTEGER_CST && skip_evaluation == 0)
8113 if (tree_int_cst_sgn (op1) < 0)
8114 warning (0, "right shift count is negative");
8117 if (!integer_zerop (op1))
8120 if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
8121 warning (0, "right shift count >= width of type");
8125 /* Use the type of the value to be shifted. */
8126 result_type = type0;
8127 /* Convert the shift-count to an integer, regardless of size
8128 of value being shifted. */
8129 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
8130 op1 = convert (integer_type_node, op1);
8131 /* Avoid converting op1 to result_type later. */
8137 if ((code0 == INTEGER_TYPE || code0 == FIXED_POINT_TYPE)
8138 && code1 == INTEGER_TYPE)
8140 if (TREE_CODE (op1) == INTEGER_CST && skip_evaluation == 0)
8142 if (tree_int_cst_sgn (op1) < 0)
8143 warning (0, "left shift count is negative");
8145 else if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
8146 warning (0, "left shift count >= width of type");
8149 /* Use the type of the value to be shifted. */
8150 result_type = type0;
8151 /* Convert the shift-count to an integer, regardless of size
8152 of value being shifted. */
8153 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
8154 op1 = convert (integer_type_node, op1);
8155 /* Avoid converting op1 to result_type later. */
8162 if (FLOAT_TYPE_P (type0) || FLOAT_TYPE_P (type1))
8163 warning (OPT_Wfloat_equal,
8164 "comparing floating point with == or != is unsafe");
8165 /* Result of comparison is always int,
8166 but don't convert the args to int! */
8167 build_type = integer_type_node;
8168 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
8169 || code0 == FIXED_POINT_TYPE || code0 == COMPLEX_TYPE)
8170 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
8171 || code1 == FIXED_POINT_TYPE || code1 == COMPLEX_TYPE))
8173 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
8175 tree tt0 = TREE_TYPE (type0);
8176 tree tt1 = TREE_TYPE (type1);
8177 /* Anything compares with void *. void * compares with anything.
8178 Otherwise, the targets must be compatible
8179 and both must be object or both incomplete. */
8180 if (comp_target_types (type0, type1))
8181 result_type = common_pointer_type (type0, type1);
8182 else if (VOID_TYPE_P (tt0))
8184 /* op0 != orig_op0 detects the case of something
8185 whose value is 0 but which isn't a valid null ptr const. */
8186 if (pedantic && !null_pointer_constant_p (orig_op0)
8187 && TREE_CODE (tt1) == FUNCTION_TYPE)
8188 pedwarn ("ISO C forbids comparison of %<void *%>"
8189 " with function pointer");
8191 else if (VOID_TYPE_P (tt1))
8193 if (pedantic && !null_pointer_constant_p (orig_op1)
8194 && TREE_CODE (tt0) == FUNCTION_TYPE)
8195 pedwarn ("ISO C forbids comparison of %<void *%>"
8196 " with function pointer");
8199 /* Avoid warning about the volatile ObjC EH puts on decls. */
8201 pedwarn ("comparison of distinct pointer types lacks a cast");
8203 if (result_type == NULL_TREE)
8204 result_type = ptr_type_node;
8206 else if (code0 == POINTER_TYPE && null_pointer_constant_p (orig_op1))
8208 if (TREE_CODE (op0) == ADDR_EXPR
8209 && decl_with_nonnull_addr_p (TREE_OPERAND (op0, 0)))
8210 warning (OPT_Waddress, "the address of %qD will never be NULL",
8211 TREE_OPERAND (op0, 0));
8212 result_type = type0;
8214 else if (code1 == POINTER_TYPE && null_pointer_constant_p (orig_op0))
8216 if (TREE_CODE (op1) == ADDR_EXPR
8217 && decl_with_nonnull_addr_p (TREE_OPERAND (op1, 0)))
8218 warning (OPT_Waddress, "the address of %qD will never be NULL",
8219 TREE_OPERAND (op1, 0));
8220 result_type = type1;
8222 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
8224 result_type = type0;
8225 pedwarn ("comparison between pointer and integer");
8227 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
8229 result_type = type1;
8230 pedwarn ("comparison between pointer and integer");
8238 build_type = integer_type_node;
8239 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
8240 || code0 == FIXED_POINT_TYPE)
8241 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
8242 || code1 == FIXED_POINT_TYPE))
8244 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
8246 if (comp_target_types (type0, type1))
8248 result_type = common_pointer_type (type0, type1);
8249 if (!COMPLETE_TYPE_P (TREE_TYPE (type0))
8250 != !COMPLETE_TYPE_P (TREE_TYPE (type1)))
8251 pedwarn ("comparison of complete and incomplete pointers");
8253 && TREE_CODE (TREE_TYPE (type0)) == FUNCTION_TYPE)
8254 pedwarn ("ISO C forbids ordered comparisons of pointers to functions");
8258 result_type = ptr_type_node;
8259 pedwarn ("comparison of distinct pointer types lacks a cast");
8262 else if (code0 == POINTER_TYPE && null_pointer_constant_p (orig_op1))
8264 result_type = type0;
8265 if (pedantic || extra_warnings)
8266 pedwarn ("ordered comparison of pointer with integer zero");
8268 else if (code1 == POINTER_TYPE && null_pointer_constant_p (orig_op0))
8270 result_type = type1;
8272 pedwarn ("ordered comparison of pointer with integer zero");
8274 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
8276 result_type = type0;
8277 pedwarn ("comparison between pointer and integer");
8279 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
8281 result_type = type1;
8282 pedwarn ("comparison between pointer and integer");
8290 if (code0 == ERROR_MARK || code1 == ERROR_MARK)
8291 return error_mark_node;
8293 if (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE
8294 && (!tree_int_cst_equal (TYPE_SIZE (type0), TYPE_SIZE (type1))
8295 || !same_scalar_type_ignoring_signedness (TREE_TYPE (type0),
8296 TREE_TYPE (type1))))
8298 binary_op_error (code, type0, type1);
8299 return error_mark_node;
8302 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE || code0 == COMPLEX_TYPE
8303 || code0 == FIXED_POINT_TYPE || code0 == VECTOR_TYPE)
8305 (code1 == INTEGER_TYPE || code1 == REAL_TYPE || code1 == COMPLEX_TYPE
8306 || code1 == FIXED_POINT_TYPE || code1 == VECTOR_TYPE))
8308 int none_complex = (code0 != COMPLEX_TYPE && code1 != COMPLEX_TYPE);
8310 if (shorten || common || short_compare)
8312 result_type = c_common_type (type0, type1);
8313 if (result_type == error_mark_node)
8314 return error_mark_node;
8317 /* For certain operations (which identify themselves by shorten != 0)
8318 if both args were extended from the same smaller type,
8319 do the arithmetic in that type and then extend.
8321 shorten !=0 and !=1 indicates a bitwise operation.
8322 For them, this optimization is safe only if
8323 both args are zero-extended or both are sign-extended.
8324 Otherwise, we might change the result.
8325 Eg, (short)-1 | (unsigned short)-1 is (int)-1
8326 but calculated in (unsigned short) it would be (unsigned short)-1. */
8328 if (shorten && none_complex)
8330 int unsigned0, unsigned1;
8335 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
8336 excessive narrowing when we call get_narrower below. For
8337 example, suppose that OP0 is of unsigned int extended
8338 from signed char and that RESULT_TYPE is long long int.
8339 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
8342 (long long int) (unsigned int) signed_char
8344 which get_narrower would narrow down to
8346 (unsigned int) signed char
8348 If we do not cast OP0 first, get_narrower would return
8349 signed_char, which is inconsistent with the case of the
8351 op0 = convert (result_type, op0);
8352 op1 = convert (result_type, op1);
8354 arg0 = get_narrower (op0, &unsigned0);
8355 arg1 = get_narrower (op1, &unsigned1);
8357 /* UNS is 1 if the operation to be done is an unsigned one. */
8358 uns = TYPE_UNSIGNED (result_type);
8360 final_type = result_type;
8362 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
8363 but it *requires* conversion to FINAL_TYPE. */
8365 if ((TYPE_PRECISION (TREE_TYPE (op0))
8366 == TYPE_PRECISION (TREE_TYPE (arg0)))
8367 && TREE_TYPE (op0) != final_type)
8368 unsigned0 = TYPE_UNSIGNED (TREE_TYPE (op0));
8369 if ((TYPE_PRECISION (TREE_TYPE (op1))
8370 == TYPE_PRECISION (TREE_TYPE (arg1)))
8371 && TREE_TYPE (op1) != final_type)
8372 unsigned1 = TYPE_UNSIGNED (TREE_TYPE (op1));
8374 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
8376 /* For bitwise operations, signedness of nominal type
8377 does not matter. Consider only how operands were extended. */
8381 /* Note that in all three cases below we refrain from optimizing
8382 an unsigned operation on sign-extended args.
8383 That would not be valid. */
8385 /* Both args variable: if both extended in same way
8386 from same width, do it in that width.
8387 Do it unsigned if args were zero-extended. */
8388 if ((TYPE_PRECISION (TREE_TYPE (arg0))
8389 < TYPE_PRECISION (result_type))
8390 && (TYPE_PRECISION (TREE_TYPE (arg1))
8391 == TYPE_PRECISION (TREE_TYPE (arg0)))
8392 && unsigned0 == unsigned1
8393 && (unsigned0 || !uns))
8395 = c_common_signed_or_unsigned_type
8396 (unsigned0, common_type (TREE_TYPE (arg0), TREE_TYPE (arg1)));
8397 else if (TREE_CODE (arg0) == INTEGER_CST
8398 && (unsigned1 || !uns)
8399 && (TYPE_PRECISION (TREE_TYPE (arg1))
8400 < TYPE_PRECISION (result_type))
8402 = c_common_signed_or_unsigned_type (unsigned1,
8404 && !POINTER_TYPE_P (type)
8405 && int_fits_type_p (arg0, type))
8407 else if (TREE_CODE (arg1) == INTEGER_CST
8408 && (unsigned0 || !uns)
8409 && (TYPE_PRECISION (TREE_TYPE (arg0))
8410 < TYPE_PRECISION (result_type))
8412 = c_common_signed_or_unsigned_type (unsigned0,
8414 && !POINTER_TYPE_P (type)
8415 && int_fits_type_p (arg1, type))
8419 /* Shifts can be shortened if shifting right. */
8424 tree arg0 = get_narrower (op0, &unsigned_arg);
8426 final_type = result_type;
8428 if (arg0 == op0 && final_type == TREE_TYPE (op0))
8429 unsigned_arg = TYPE_UNSIGNED (TREE_TYPE (op0));
8431 if (TYPE_PRECISION (TREE_TYPE (arg0)) < TYPE_PRECISION (result_type)
8432 /* We can shorten only if the shift count is less than the
8433 number of bits in the smaller type size. */
8434 && compare_tree_int (op1, TYPE_PRECISION (TREE_TYPE (arg0))) < 0
8435 /* We cannot drop an unsigned shift after sign-extension. */
8436 && (!TYPE_UNSIGNED (final_type) || unsigned_arg))
8438 /* Do an unsigned shift if the operand was zero-extended. */
8440 = c_common_signed_or_unsigned_type (unsigned_arg,
8442 /* Convert value-to-be-shifted to that type. */
8443 if (TREE_TYPE (op0) != result_type)
8444 op0 = convert (result_type, op0);
8449 /* Comparison operations are shortened too but differently.
8450 They identify themselves by setting short_compare = 1. */
8454 /* Don't write &op0, etc., because that would prevent op0
8455 from being kept in a register.
8456 Instead, make copies of the our local variables and
8457 pass the copies by reference, then copy them back afterward. */
8458 tree xop0 = op0, xop1 = op1, xresult_type = result_type;
8459 enum tree_code xresultcode = resultcode;
8461 = shorten_compare (&xop0, &xop1, &xresult_type, &xresultcode);
8466 op0 = xop0, op1 = xop1;
8468 resultcode = xresultcode;
8470 if (warn_sign_compare && skip_evaluation == 0)
8472 int op0_signed = !TYPE_UNSIGNED (TREE_TYPE (orig_op0));
8473 int op1_signed = !TYPE_UNSIGNED (TREE_TYPE (orig_op1));
8474 int unsignedp0, unsignedp1;
8475 tree primop0 = get_narrower (op0, &unsignedp0);
8476 tree primop1 = get_narrower (op1, &unsignedp1);
8480 STRIP_TYPE_NOPS (xop0);
8481 STRIP_TYPE_NOPS (xop1);
8483 /* Give warnings for comparisons between signed and unsigned
8484 quantities that may fail.
8486 Do the checking based on the original operand trees, so that
8487 casts will be considered, but default promotions won't be.
8489 Do not warn if the comparison is being done in a signed type,
8490 since the signed type will only be chosen if it can represent
8491 all the values of the unsigned type. */
8492 if (!TYPE_UNSIGNED (result_type))
8494 /* Do not warn if both operands are the same signedness. */
8495 else if (op0_signed == op1_signed)
8503 sop = xop0, uop = xop1;
8505 sop = xop1, uop = xop0;
8507 /* Do not warn if the signed quantity is an
8508 unsuffixed integer literal (or some static
8509 constant expression involving such literals or a
8510 conditional expression involving such literals)
8511 and it is non-negative. */
8512 if (tree_expr_nonnegative_warnv_p (sop, &ovf))
8514 /* Do not warn if the comparison is an equality operation,
8515 the unsigned quantity is an integral constant, and it
8516 would fit in the result if the result were signed. */
8517 else if (TREE_CODE (uop) == INTEGER_CST
8518 && (resultcode == EQ_EXPR || resultcode == NE_EXPR)
8520 (uop, c_common_signed_type (result_type)))
8522 /* Do not warn if the unsigned quantity is an enumeration
8523 constant and its maximum value would fit in the result
8524 if the result were signed. */
8525 else if (TREE_CODE (uop) == INTEGER_CST
8526 && TREE_CODE (TREE_TYPE (uop)) == ENUMERAL_TYPE
8528 (TYPE_MAX_VALUE (TREE_TYPE (uop)),
8529 c_common_signed_type (result_type)))
8532 warning (OPT_Wsign_compare, "comparison between signed and unsigned");
8535 /* Warn if two unsigned values are being compared in a size
8536 larger than their original size, and one (and only one) is the
8537 result of a `~' operator. This comparison will always fail.
8539 Also warn if one operand is a constant, and the constant
8540 does not have all bits set that are set in the ~ operand
8541 when it is extended. */
8543 if ((TREE_CODE (primop0) == BIT_NOT_EXPR)
8544 != (TREE_CODE (primop1) == BIT_NOT_EXPR))
8546 if (TREE_CODE (primop0) == BIT_NOT_EXPR)
8547 primop0 = get_narrower (TREE_OPERAND (primop0, 0),
8550 primop1 = get_narrower (TREE_OPERAND (primop1, 0),
8553 if (host_integerp (primop0, 0) || host_integerp (primop1, 0))
8556 HOST_WIDE_INT constant, mask;
8557 int unsignedp, bits;
8559 if (host_integerp (primop0, 0))
8562 unsignedp = unsignedp1;
8563 constant = tree_low_cst (primop0, 0);
8568 unsignedp = unsignedp0;
8569 constant = tree_low_cst (primop1, 0);
8572 bits = TYPE_PRECISION (TREE_TYPE (primop));
8573 if (bits < TYPE_PRECISION (result_type)
8574 && bits < HOST_BITS_PER_WIDE_INT && unsignedp)
8576 mask = (~(HOST_WIDE_INT) 0) << bits;
8577 if ((mask & constant) != mask)
8578 warning (OPT_Wsign_compare, "comparison of promoted ~unsigned with constant");
8581 else if (unsignedp0 && unsignedp1
8582 && (TYPE_PRECISION (TREE_TYPE (primop0))
8583 < TYPE_PRECISION (result_type))
8584 && (TYPE_PRECISION (TREE_TYPE (primop1))
8585 < TYPE_PRECISION (result_type)))
8586 warning (OPT_Wsign_compare, "comparison of promoted ~unsigned with unsigned");
8592 /* At this point, RESULT_TYPE must be nonzero to avoid an error message.
8593 If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
8594 Then the expression will be built.
8595 It will be given type FINAL_TYPE if that is nonzero;
8596 otherwise, it will be given type RESULT_TYPE. */
8600 binary_op_error (code, TREE_TYPE (op0), TREE_TYPE (op1));
8601 return error_mark_node;
8606 if (TREE_TYPE (op0) != result_type)
8607 op0 = convert_and_check (result_type, op0);
8608 if (TREE_TYPE (op1) != result_type)
8609 op1 = convert_and_check (result_type, op1);
8611 /* This can happen if one operand has a vector type, and the other
8612 has a different type. */
8613 if (TREE_CODE (op0) == ERROR_MARK || TREE_CODE (op1) == ERROR_MARK)
8614 return error_mark_node;
8617 if (build_type == NULL_TREE)
8618 build_type = result_type;
8621 /* Treat expressions in initializers specially as they can't trap. */
8622 tree result = require_constant_value ? fold_build2_initializer (resultcode,
8625 : fold_build2 (resultcode, build_type,
8628 if (final_type != 0)
8629 result = convert (final_type, result);
8635 /* Convert EXPR to be a truth-value, validating its type for this
8639 c_objc_common_truthvalue_conversion (tree expr)
8641 switch (TREE_CODE (TREE_TYPE (expr)))
8644 error ("used array that cannot be converted to pointer where scalar is required");
8645 return error_mark_node;
8648 error ("used struct type value where scalar is required");
8649 return error_mark_node;
8652 error ("used union type value where scalar is required");
8653 return error_mark_node;
8662 /* ??? Should we also give an error for void and vectors rather than
8663 leaving those to give errors later? */
8664 return c_common_truthvalue_conversion (expr);
8668 /* Convert EXPR to a contained DECL, updating *TC, *TI and *SE as
8672 c_expr_to_decl (tree expr, bool *tc ATTRIBUTE_UNUSED, bool *se)
8674 if (TREE_CODE (expr) == COMPOUND_LITERAL_EXPR)
8676 tree decl = COMPOUND_LITERAL_EXPR_DECL (expr);
8677 /* Executing a compound literal inside a function reinitializes
8679 if (!TREE_STATIC (decl))
8687 /* Like c_begin_compound_stmt, except force the retention of the BLOCK. */
8690 c_begin_omp_parallel (void)
8695 block = c_begin_compound_stmt (true);
8701 c_finish_omp_parallel (tree clauses, tree block)
8705 block = c_end_compound_stmt (block, true);
8707 stmt = make_node (OMP_PARALLEL);
8708 TREE_TYPE (stmt) = void_type_node;
8709 OMP_PARALLEL_CLAUSES (stmt) = clauses;
8710 OMP_PARALLEL_BODY (stmt) = block;
8712 return add_stmt (stmt);
8715 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
8716 Remove any elements from the list that are invalid. */
8719 c_finish_omp_clauses (tree clauses)
8721 bitmap_head generic_head, firstprivate_head, lastprivate_head;
8722 tree c, t, *pc = &clauses;
8725 bitmap_obstack_initialize (NULL);
8726 bitmap_initialize (&generic_head, &bitmap_default_obstack);
8727 bitmap_initialize (&firstprivate_head, &bitmap_default_obstack);
8728 bitmap_initialize (&lastprivate_head, &bitmap_default_obstack);
8730 for (pc = &clauses, c = clauses; c ; c = *pc)
8732 bool remove = false;
8733 bool need_complete = false;
8734 bool need_implicitly_determined = false;
8736 switch (OMP_CLAUSE_CODE (c))
8738 case OMP_CLAUSE_SHARED:
8740 need_implicitly_determined = true;
8741 goto check_dup_generic;
8743 case OMP_CLAUSE_PRIVATE:
8745 need_complete = true;
8746 need_implicitly_determined = true;
8747 goto check_dup_generic;
8749 case OMP_CLAUSE_REDUCTION:
8751 need_implicitly_determined = true;
8752 t = OMP_CLAUSE_DECL (c);
8753 if (AGGREGATE_TYPE_P (TREE_TYPE (t))
8754 || POINTER_TYPE_P (TREE_TYPE (t)))
8756 error ("%qE has invalid type for %<reduction%>", t);
8759 else if (FLOAT_TYPE_P (TREE_TYPE (t)))
8761 enum tree_code r_code = OMP_CLAUSE_REDUCTION_CODE (c);
8762 const char *r_name = NULL;
8779 case TRUTH_ANDIF_EXPR:
8782 case TRUTH_ORIF_EXPR:
8790 error ("%qE has invalid type for %<reduction(%s)%>",
8795 goto check_dup_generic;
8797 case OMP_CLAUSE_COPYPRIVATE:
8798 name = "copyprivate";
8799 goto check_dup_generic;
8801 case OMP_CLAUSE_COPYIN:
8803 t = OMP_CLAUSE_DECL (c);
8804 if (TREE_CODE (t) != VAR_DECL || !DECL_THREAD_LOCAL_P (t))
8806 error ("%qE must be %<threadprivate%> for %<copyin%>", t);
8809 goto check_dup_generic;
8812 t = OMP_CLAUSE_DECL (c);
8813 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
8815 error ("%qE is not a variable in clause %qs", t, name);
8818 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
8819 || bitmap_bit_p (&firstprivate_head, DECL_UID (t))
8820 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
8822 error ("%qE appears more than once in data clauses", t);
8826 bitmap_set_bit (&generic_head, DECL_UID (t));
8829 case OMP_CLAUSE_FIRSTPRIVATE:
8830 name = "firstprivate";
8831 t = OMP_CLAUSE_DECL (c);
8832 need_complete = true;
8833 need_implicitly_determined = true;
8834 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
8836 error ("%qE is not a variable in clause %<firstprivate%>", t);
8839 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
8840 || bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
8842 error ("%qE appears more than once in data clauses", t);
8846 bitmap_set_bit (&firstprivate_head, DECL_UID (t));
8849 case OMP_CLAUSE_LASTPRIVATE:
8850 name = "lastprivate";
8851 t = OMP_CLAUSE_DECL (c);
8852 need_complete = true;
8853 need_implicitly_determined = true;
8854 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
8856 error ("%qE is not a variable in clause %<lastprivate%>", t);
8859 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
8860 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
8862 error ("%qE appears more than once in data clauses", t);
8866 bitmap_set_bit (&lastprivate_head, DECL_UID (t));
8870 case OMP_CLAUSE_NUM_THREADS:
8871 case OMP_CLAUSE_SCHEDULE:
8872 case OMP_CLAUSE_NOWAIT:
8873 case OMP_CLAUSE_ORDERED:
8874 case OMP_CLAUSE_DEFAULT:
8875 pc = &OMP_CLAUSE_CHAIN (c);
8884 t = OMP_CLAUSE_DECL (c);
8888 t = require_complete_type (t);
8889 if (t == error_mark_node)
8893 if (need_implicitly_determined)
8895 const char *share_name = NULL;
8897 if (TREE_CODE (t) == VAR_DECL && DECL_THREAD_LOCAL_P (t))
8898 share_name = "threadprivate";
8899 else switch (c_omp_predetermined_sharing (t))
8901 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
8903 case OMP_CLAUSE_DEFAULT_SHARED:
8904 share_name = "shared";
8906 case OMP_CLAUSE_DEFAULT_PRIVATE:
8907 share_name = "private";
8914 error ("%qE is predetermined %qs for %qs",
8915 t, share_name, name);
8922 *pc = OMP_CLAUSE_CHAIN (c);
8924 pc = &OMP_CLAUSE_CHAIN (c);
8927 bitmap_obstack_release (NULL);
8931 /* Make a variant type in the proper way for C/C++, propagating qualifiers
8932 down to the element type of an array. */
8935 c_build_qualified_type (tree type, int type_quals)
8937 if (type == error_mark_node)
8940 if (TREE_CODE (type) == ARRAY_TYPE)
8943 tree element_type = c_build_qualified_type (TREE_TYPE (type),
8946 /* See if we already have an identically qualified type. */
8947 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
8949 if (TYPE_QUALS (strip_array_types (t)) == type_quals
8950 && TYPE_NAME (t) == TYPE_NAME (type)
8951 && TYPE_CONTEXT (t) == TYPE_CONTEXT (type)
8952 && attribute_list_equal (TYPE_ATTRIBUTES (t),
8953 TYPE_ATTRIBUTES (type)))
8958 tree domain = TYPE_DOMAIN (type);
8960 t = build_variant_type_copy (type);
8961 TREE_TYPE (t) = element_type;
8963 if (TYPE_STRUCTURAL_EQUALITY_P (element_type)
8964 || (domain && TYPE_STRUCTURAL_EQUALITY_P (domain)))
8965 SET_TYPE_STRUCTURAL_EQUALITY (t);
8966 else if (TYPE_CANONICAL (element_type) != element_type
8967 || (domain && TYPE_CANONICAL (domain) != domain))
8969 tree unqualified_canon
8970 = build_array_type (TYPE_CANONICAL (element_type),
8971 domain? TYPE_CANONICAL (domain)
8974 = c_build_qualified_type (unqualified_canon, type_quals);
8977 TYPE_CANONICAL (t) = t;
8982 /* A restrict-qualified pointer type must be a pointer to object or
8983 incomplete type. Note that the use of POINTER_TYPE_P also allows
8984 REFERENCE_TYPEs, which is appropriate for C++. */
8985 if ((type_quals & TYPE_QUAL_RESTRICT)
8986 && (!POINTER_TYPE_P (type)
8987 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type))))
8989 error ("invalid use of %<restrict%>");
8990 type_quals &= ~TYPE_QUAL_RESTRICT;
8993 return build_qualified_type (type, type_quals);