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
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 2, 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 COPYING. If not, write to the Free
20 Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
24 /* This file is part of the C front end.
25 It contains routines to build C expressions given their operands,
26 including computing the types of the result, C-specific error checks,
27 and some optimization. */
31 #include "coretypes.h"
35 #include "langhooks.h"
45 #include "tree-iterator.h"
46 #include "tree-gimple.h"
47 #include "tree-flow.h"
49 /* Possible cases of implicit bad conversions. Used to select
50 diagnostic messages in convert_for_assignment. */
59 /* The level of nesting inside "__alignof__". */
62 /* The level of nesting inside "sizeof". */
65 /* The level of nesting inside "typeof". */
68 struct c_label_context_se *label_context_stack_se;
69 struct c_label_context_vm *label_context_stack_vm;
71 /* Nonzero if we've already printed a "missing braces around initializer"
72 message within this initializer. */
73 static int missing_braces_mentioned;
75 static int require_constant_value;
76 static int require_constant_elements;
78 static bool null_pointer_constant_p (tree);
79 static tree qualify_type (tree, tree);
80 static int tagged_types_tu_compatible_p (tree, tree);
81 static int comp_target_types (tree, tree);
82 static int function_types_compatible_p (tree, tree);
83 static int type_lists_compatible_p (tree, tree);
84 static tree decl_constant_value_for_broken_optimization (tree);
85 static tree lookup_field (tree, tree);
86 static tree convert_arguments (tree, tree, tree, tree);
87 static tree pointer_diff (tree, tree);
88 static tree convert_for_assignment (tree, tree, enum impl_conv, tree, tree,
90 static tree valid_compound_expr_initializer (tree, tree);
91 static void push_string (const char *);
92 static void push_member_name (tree);
93 static int spelling_length (void);
94 static char *print_spelling (char *);
95 static void warning_init (const char *);
96 static tree digest_init (tree, tree, bool, int);
97 static void output_init_element (tree, bool, tree, tree, int);
98 static void output_pending_init_elements (int);
99 static int set_designator (int);
100 static void push_range_stack (tree);
101 static void add_pending_init (tree, tree);
102 static void set_nonincremental_init (void);
103 static void set_nonincremental_init_from_string (tree);
104 static tree find_init_member (tree);
105 static void readonly_error (tree, enum lvalue_use);
106 static int lvalue_or_else (tree, enum lvalue_use);
107 static int lvalue_p (tree);
108 static void record_maybe_used_decl (tree);
109 static int comptypes_internal (tree, tree);
111 /* Return true if EXP is a null pointer constant, false otherwise. */
114 null_pointer_constant_p (tree expr)
116 /* This should really operate on c_expr structures, but they aren't
117 yet available everywhere required. */
118 tree type = TREE_TYPE (expr);
119 return (TREE_CODE (expr) == INTEGER_CST
120 && !TREE_CONSTANT_OVERFLOW (expr)
121 && integer_zerop (expr)
122 && (INTEGRAL_TYPE_P (type)
123 || (TREE_CODE (type) == POINTER_TYPE
124 && VOID_TYPE_P (TREE_TYPE (type))
125 && TYPE_QUALS (TREE_TYPE (type)) == TYPE_UNQUALIFIED)));
127 \f/* This is a cache to hold if two types are compatible or not. */
129 struct tagged_tu_seen_cache {
130 const struct tagged_tu_seen_cache * next;
133 /* The return value of tagged_types_tu_compatible_p if we had seen
134 these two types already. */
138 static const struct tagged_tu_seen_cache * tagged_tu_seen_base;
139 static void free_all_tagged_tu_seen_up_to (const struct tagged_tu_seen_cache *);
141 /* Do `exp = require_complete_type (exp);' to make sure exp
142 does not have an incomplete type. (That includes void types.) */
145 require_complete_type (tree value)
147 tree type = TREE_TYPE (value);
149 if (value == error_mark_node || type == error_mark_node)
150 return error_mark_node;
152 /* First, detect a valid value with a complete type. */
153 if (COMPLETE_TYPE_P (type))
156 c_incomplete_type_error (value, type);
157 return error_mark_node;
160 /* Print an error message for invalid use of an incomplete type.
161 VALUE is the expression that was used (or 0 if that isn't known)
162 and TYPE is the type that was invalid. */
165 c_incomplete_type_error (tree value, tree type)
167 const char *type_code_string;
169 /* Avoid duplicate error message. */
170 if (TREE_CODE (type) == ERROR_MARK)
173 if (value != 0 && (TREE_CODE (value) == VAR_DECL
174 || TREE_CODE (value) == PARM_DECL))
175 error ("%qD has an incomplete type", value);
179 /* We must print an error message. Be clever about what it says. */
181 switch (TREE_CODE (type))
184 type_code_string = "struct";
188 type_code_string = "union";
192 type_code_string = "enum";
196 error ("invalid use of void expression");
200 if (TYPE_DOMAIN (type))
202 if (TYPE_MAX_VALUE (TYPE_DOMAIN (type)) == NULL)
204 error ("invalid use of flexible array member");
207 type = TREE_TYPE (type);
210 error ("invalid use of array with unspecified bounds");
217 if (TREE_CODE (TYPE_NAME (type)) == IDENTIFIER_NODE)
218 error ("invalid use of undefined type %<%s %E%>",
219 type_code_string, TYPE_NAME (type));
221 /* If this type has a typedef-name, the TYPE_NAME is a TYPE_DECL. */
222 error ("invalid use of incomplete typedef %qD", TYPE_NAME (type));
226 /* Given a type, apply default promotions wrt unnamed function
227 arguments and return the new type. */
230 c_type_promotes_to (tree type)
232 if (TYPE_MAIN_VARIANT (type) == float_type_node)
233 return double_type_node;
235 if (c_promoting_integer_type_p (type))
237 /* Preserve unsignedness if not really getting any wider. */
238 if (TYPE_UNSIGNED (type)
239 && (TYPE_PRECISION (type) == TYPE_PRECISION (integer_type_node)))
240 return unsigned_type_node;
241 return integer_type_node;
247 /* Return a variant of TYPE which has all the type qualifiers of LIKE
248 as well as those of TYPE. */
251 qualify_type (tree type, tree like)
253 return c_build_qualified_type (type,
254 TYPE_QUALS (type) | TYPE_QUALS (like));
257 /* Return true iff the given tree T is a variable length array. */
260 c_vla_type_p (tree t)
262 if (TREE_CODE (t) == ARRAY_TYPE
263 && C_TYPE_VARIABLE_SIZE (t))
268 /* Return the composite type of two compatible types.
270 We assume that comptypes has already been done and returned
271 nonzero; if that isn't so, this may crash. In particular, we
272 assume that qualifiers match. */
275 composite_type (tree t1, tree t2)
277 enum tree_code code1;
278 enum tree_code code2;
281 /* Save time if the two types are the same. */
283 if (t1 == t2) return t1;
285 /* If one type is nonsense, use the other. */
286 if (t1 == error_mark_node)
288 if (t2 == error_mark_node)
291 code1 = TREE_CODE (t1);
292 code2 = TREE_CODE (t2);
294 /* Merge the attributes. */
295 attributes = targetm.merge_type_attributes (t1, t2);
297 /* If one is an enumerated type and the other is the compatible
298 integer type, the composite type might be either of the two
299 (DR#013 question 3). For consistency, use the enumerated type as
300 the composite type. */
302 if (code1 == ENUMERAL_TYPE && code2 == INTEGER_TYPE)
304 if (code2 == ENUMERAL_TYPE && code1 == INTEGER_TYPE)
307 gcc_assert (code1 == code2);
312 /* For two pointers, do this recursively on the target type. */
314 tree pointed_to_1 = TREE_TYPE (t1);
315 tree pointed_to_2 = TREE_TYPE (t2);
316 tree target = composite_type (pointed_to_1, pointed_to_2);
317 t1 = build_pointer_type (target);
318 t1 = build_type_attribute_variant (t1, attributes);
319 return qualify_type (t1, t2);
324 tree elt = composite_type (TREE_TYPE (t1), TREE_TYPE (t2));
327 tree d1 = TYPE_DOMAIN (t1);
328 tree d2 = TYPE_DOMAIN (t2);
329 bool d1_variable, d2_variable;
330 bool d1_zero, d2_zero;
332 /* We should not have any type quals on arrays at all. */
333 gcc_assert (!TYPE_QUALS (t1) && !TYPE_QUALS (t2));
335 d1_zero = d1 == 0 || !TYPE_MAX_VALUE (d1);
336 d2_zero = d2 == 0 || !TYPE_MAX_VALUE (d2);
338 d1_variable = (!d1_zero
339 && (TREE_CODE (TYPE_MIN_VALUE (d1)) != INTEGER_CST
340 || TREE_CODE (TYPE_MAX_VALUE (d1)) != INTEGER_CST));
341 d2_variable = (!d2_zero
342 && (TREE_CODE (TYPE_MIN_VALUE (d2)) != INTEGER_CST
343 || TREE_CODE (TYPE_MAX_VALUE (d2)) != INTEGER_CST));
344 d1_variable = d1_variable || (d1_zero && c_vla_type_p (t1));
345 d2_variable = d2_variable || (d2_zero && c_vla_type_p (t2));
347 /* Save space: see if the result is identical to one of the args. */
348 if (elt == TREE_TYPE (t1) && TYPE_DOMAIN (t1)
349 && (d2_variable || d2_zero || !d1_variable))
350 return build_type_attribute_variant (t1, attributes);
351 if (elt == TREE_TYPE (t2) && TYPE_DOMAIN (t2)
352 && (d1_variable || d1_zero || !d2_variable))
353 return build_type_attribute_variant (t2, attributes);
355 if (elt == TREE_TYPE (t1) && !TYPE_DOMAIN (t2) && !TYPE_DOMAIN (t1))
356 return build_type_attribute_variant (t1, attributes);
357 if (elt == TREE_TYPE (t2) && !TYPE_DOMAIN (t2) && !TYPE_DOMAIN (t1))
358 return build_type_attribute_variant (t2, attributes);
360 /* Merge the element types, and have a size if either arg has
361 one. We may have qualifiers on the element types. To set
362 up TYPE_MAIN_VARIANT correctly, we need to form the
363 composite of the unqualified types and add the qualifiers
365 quals = TYPE_QUALS (strip_array_types (elt));
366 unqual_elt = c_build_qualified_type (elt, TYPE_UNQUALIFIED);
367 t1 = build_array_type (unqual_elt,
368 TYPE_DOMAIN ((TYPE_DOMAIN (t1)
374 t1 = c_build_qualified_type (t1, quals);
375 return build_type_attribute_variant (t1, attributes);
381 if (attributes != NULL)
383 /* Try harder not to create a new aggregate type. */
384 if (attribute_list_equal (TYPE_ATTRIBUTES (t1), attributes))
386 if (attribute_list_equal (TYPE_ATTRIBUTES (t2), attributes))
389 return build_type_attribute_variant (t1, attributes);
392 /* Function types: prefer the one that specified arg types.
393 If both do, merge the arg types. Also merge the return types. */
395 tree valtype = composite_type (TREE_TYPE (t1), TREE_TYPE (t2));
396 tree p1 = TYPE_ARG_TYPES (t1);
397 tree p2 = TYPE_ARG_TYPES (t2);
402 /* Save space: see if the result is identical to one of the args. */
403 if (valtype == TREE_TYPE (t1) && !TYPE_ARG_TYPES (t2))
404 return build_type_attribute_variant (t1, attributes);
405 if (valtype == TREE_TYPE (t2) && !TYPE_ARG_TYPES (t1))
406 return build_type_attribute_variant (t2, attributes);
408 /* Simple way if one arg fails to specify argument types. */
409 if (TYPE_ARG_TYPES (t1) == 0)
411 t1 = build_function_type (valtype, TYPE_ARG_TYPES (t2));
412 t1 = build_type_attribute_variant (t1, attributes);
413 return qualify_type (t1, t2);
415 if (TYPE_ARG_TYPES (t2) == 0)
417 t1 = build_function_type (valtype, TYPE_ARG_TYPES (t1));
418 t1 = build_type_attribute_variant (t1, attributes);
419 return qualify_type (t1, t2);
422 /* If both args specify argument types, we must merge the two
423 lists, argument by argument. */
424 /* Tell global_bindings_p to return false so that variable_size
425 doesn't die on VLAs in parameter types. */
426 c_override_global_bindings_to_false = true;
428 len = list_length (p1);
431 for (i = 0; i < len; i++)
432 newargs = tree_cons (NULL_TREE, NULL_TREE, newargs);
437 p1 = TREE_CHAIN (p1), p2 = TREE_CHAIN (p2), n = TREE_CHAIN (n))
439 /* A null type means arg type is not specified.
440 Take whatever the other function type has. */
441 if (TREE_VALUE (p1) == 0)
443 TREE_VALUE (n) = TREE_VALUE (p2);
446 if (TREE_VALUE (p2) == 0)
448 TREE_VALUE (n) = TREE_VALUE (p1);
452 /* Given wait (union {union wait *u; int *i} *)
453 and wait (union wait *),
454 prefer union wait * as type of parm. */
455 if (TREE_CODE (TREE_VALUE (p1)) == UNION_TYPE
456 && TREE_VALUE (p1) != TREE_VALUE (p2))
459 tree mv2 = TREE_VALUE (p2);
460 if (mv2 && mv2 != error_mark_node
461 && TREE_CODE (mv2) != ARRAY_TYPE)
462 mv2 = TYPE_MAIN_VARIANT (mv2);
463 for (memb = TYPE_FIELDS (TREE_VALUE (p1));
464 memb; memb = TREE_CHAIN (memb))
466 tree mv3 = TREE_TYPE (memb);
467 if (mv3 && mv3 != error_mark_node
468 && TREE_CODE (mv3) != ARRAY_TYPE)
469 mv3 = TYPE_MAIN_VARIANT (mv3);
470 if (comptypes (mv3, mv2))
472 TREE_VALUE (n) = composite_type (TREE_TYPE (memb),
475 pedwarn ("function types not truly compatible in ISO C");
480 if (TREE_CODE (TREE_VALUE (p2)) == UNION_TYPE
481 && TREE_VALUE (p2) != TREE_VALUE (p1))
484 tree mv1 = TREE_VALUE (p1);
485 if (mv1 && mv1 != error_mark_node
486 && TREE_CODE (mv1) != ARRAY_TYPE)
487 mv1 = TYPE_MAIN_VARIANT (mv1);
488 for (memb = TYPE_FIELDS (TREE_VALUE (p2));
489 memb; memb = TREE_CHAIN (memb))
491 tree mv3 = TREE_TYPE (memb);
492 if (mv3 && mv3 != error_mark_node
493 && TREE_CODE (mv3) != ARRAY_TYPE)
494 mv3 = TYPE_MAIN_VARIANT (mv3);
495 if (comptypes (mv3, mv1))
497 TREE_VALUE (n) = composite_type (TREE_TYPE (memb),
500 pedwarn ("function types not truly compatible in ISO C");
505 TREE_VALUE (n) = composite_type (TREE_VALUE (p1), TREE_VALUE (p2));
509 c_override_global_bindings_to_false = false;
510 t1 = build_function_type (valtype, newargs);
511 t1 = qualify_type (t1, t2);
512 /* ... falls through ... */
516 return build_type_attribute_variant (t1, attributes);
521 /* Return the type of a conditional expression between pointers to
522 possibly differently qualified versions of compatible types.
524 We assume that comp_target_types has already been done and returned
525 nonzero; if that isn't so, this may crash. */
528 common_pointer_type (tree t1, tree t2)
531 tree pointed_to_1, mv1;
532 tree pointed_to_2, mv2;
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);
561 t1 = build_pointer_type (c_build_qualified_type
563 TYPE_QUALS (pointed_to_1) |
564 TYPE_QUALS (pointed_to_2)));
565 return build_type_attribute_variant (t1, attributes);
568 /* Return the common type for two arithmetic types under the usual
569 arithmetic conversions. The default conversions have already been
570 applied, and enumerated types converted to their compatible integer
571 types. The resulting type is unqualified and has no attributes.
573 This is the type for the result of most arithmetic operations
574 if the operands have the given two types. */
577 c_common_type (tree t1, tree t2)
579 enum tree_code code1;
580 enum tree_code code2;
582 /* If one type is nonsense, use the other. */
583 if (t1 == error_mark_node)
585 if (t2 == error_mark_node)
588 if (TYPE_QUALS (t1) != TYPE_UNQUALIFIED)
589 t1 = TYPE_MAIN_VARIANT (t1);
591 if (TYPE_QUALS (t2) != TYPE_UNQUALIFIED)
592 t2 = TYPE_MAIN_VARIANT (t2);
594 if (TYPE_ATTRIBUTES (t1) != NULL_TREE)
595 t1 = build_type_attribute_variant (t1, NULL_TREE);
597 if (TYPE_ATTRIBUTES (t2) != NULL_TREE)
598 t2 = build_type_attribute_variant (t2, NULL_TREE);
600 /* Save time if the two types are the same. */
602 if (t1 == t2) return t1;
604 code1 = TREE_CODE (t1);
605 code2 = TREE_CODE (t2);
607 gcc_assert (code1 == VECTOR_TYPE || code1 == COMPLEX_TYPE
608 || code1 == REAL_TYPE || code1 == INTEGER_TYPE);
609 gcc_assert (code2 == VECTOR_TYPE || code2 == COMPLEX_TYPE
610 || code2 == REAL_TYPE || code2 == INTEGER_TYPE);
612 /* When one operand is a decimal float type, the other operand cannot be
613 a generic float type or a complex type. We also disallow vector types
615 if ((DECIMAL_FLOAT_TYPE_P (t1) || DECIMAL_FLOAT_TYPE_P (t2))
616 && !(DECIMAL_FLOAT_TYPE_P (t1) && DECIMAL_FLOAT_TYPE_P (t2)))
618 if (code1 == VECTOR_TYPE || code2 == VECTOR_TYPE)
620 error ("can%'t mix operands of decimal float and vector types");
621 return error_mark_node;
623 if (code1 == COMPLEX_TYPE || code2 == COMPLEX_TYPE)
625 error ("can%'t mix operands of decimal float and complex types");
626 return error_mark_node;
628 if (code1 == REAL_TYPE && code2 == REAL_TYPE)
630 error ("can%'t mix operands of decimal float and other float types");
631 return error_mark_node;
635 /* If one type is a vector type, return that type. (How the usual
636 arithmetic conversions apply to the vector types extension is not
637 precisely specified.) */
638 if (code1 == VECTOR_TYPE)
641 if (code2 == VECTOR_TYPE)
644 /* If one type is complex, form the common type of the non-complex
645 components, then make that complex. Use T1 or T2 if it is the
647 if (code1 == COMPLEX_TYPE || code2 == COMPLEX_TYPE)
649 tree subtype1 = code1 == COMPLEX_TYPE ? TREE_TYPE (t1) : t1;
650 tree subtype2 = code2 == COMPLEX_TYPE ? TREE_TYPE (t2) : t2;
651 tree subtype = c_common_type (subtype1, subtype2);
653 if (code1 == COMPLEX_TYPE && TREE_TYPE (t1) == subtype)
655 else if (code2 == COMPLEX_TYPE && TREE_TYPE (t2) == subtype)
658 return build_complex_type (subtype);
661 /* If only one is real, use it as the result. */
663 if (code1 == REAL_TYPE && code2 != REAL_TYPE)
666 if (code2 == REAL_TYPE && code1 != REAL_TYPE)
669 /* If both are real and either are decimal floating point types, use
670 the decimal floating point type with the greater precision. */
672 if (code1 == REAL_TYPE && code2 == REAL_TYPE)
674 if (TYPE_MAIN_VARIANT (t1) == dfloat128_type_node
675 || TYPE_MAIN_VARIANT (t2) == dfloat128_type_node)
676 return dfloat128_type_node;
677 else if (TYPE_MAIN_VARIANT (t1) == dfloat64_type_node
678 || TYPE_MAIN_VARIANT (t2) == dfloat64_type_node)
679 return dfloat64_type_node;
680 else if (TYPE_MAIN_VARIANT (t1) == dfloat32_type_node
681 || TYPE_MAIN_VARIANT (t2) == dfloat32_type_node)
682 return dfloat32_type_node;
685 /* Both real or both integers; use the one with greater precision. */
687 if (TYPE_PRECISION (t1) > TYPE_PRECISION (t2))
689 else if (TYPE_PRECISION (t2) > TYPE_PRECISION (t1))
692 /* Same precision. Prefer long longs to longs to ints when the
693 same precision, following the C99 rules on integer type rank
694 (which are equivalent to the C90 rules for C90 types). */
696 if (TYPE_MAIN_VARIANT (t1) == long_long_unsigned_type_node
697 || TYPE_MAIN_VARIANT (t2) == long_long_unsigned_type_node)
698 return long_long_unsigned_type_node;
700 if (TYPE_MAIN_VARIANT (t1) == long_long_integer_type_node
701 || TYPE_MAIN_VARIANT (t2) == long_long_integer_type_node)
703 if (TYPE_UNSIGNED (t1) || TYPE_UNSIGNED (t2))
704 return long_long_unsigned_type_node;
706 return long_long_integer_type_node;
709 if (TYPE_MAIN_VARIANT (t1) == long_unsigned_type_node
710 || TYPE_MAIN_VARIANT (t2) == long_unsigned_type_node)
711 return long_unsigned_type_node;
713 if (TYPE_MAIN_VARIANT (t1) == long_integer_type_node
714 || TYPE_MAIN_VARIANT (t2) == long_integer_type_node)
716 /* But preserve unsignedness from the other type,
717 since long cannot hold all the values of an unsigned int. */
718 if (TYPE_UNSIGNED (t1) || TYPE_UNSIGNED (t2))
719 return long_unsigned_type_node;
721 return long_integer_type_node;
724 /* Likewise, prefer long double to double even if same size. */
725 if (TYPE_MAIN_VARIANT (t1) == long_double_type_node
726 || TYPE_MAIN_VARIANT (t2) == long_double_type_node)
727 return long_double_type_node;
729 /* Otherwise prefer the unsigned one. */
731 if (TYPE_UNSIGNED (t1))
737 /* Wrapper around c_common_type that is used by c-common.c and other
738 front end optimizations that remove promotions. ENUMERAL_TYPEs
739 are allowed here and are converted to their compatible integer types.
740 BOOLEAN_TYPEs are allowed here and return either boolean_type_node or
741 preferably a non-Boolean type as the common type. */
743 common_type (tree t1, tree t2)
745 if (TREE_CODE (t1) == ENUMERAL_TYPE)
746 t1 = c_common_type_for_size (TYPE_PRECISION (t1), 1);
747 if (TREE_CODE (t2) == ENUMERAL_TYPE)
748 t2 = c_common_type_for_size (TYPE_PRECISION (t2), 1);
750 /* If both types are BOOLEAN_TYPE, then return boolean_type_node. */
751 if (TREE_CODE (t1) == BOOLEAN_TYPE
752 && TREE_CODE (t2) == BOOLEAN_TYPE)
753 return boolean_type_node;
755 /* If either type is BOOLEAN_TYPE, then return the other. */
756 if (TREE_CODE (t1) == BOOLEAN_TYPE)
758 if (TREE_CODE (t2) == BOOLEAN_TYPE)
761 return c_common_type (t1, t2);
764 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
765 or various other operations. Return 2 if they are compatible
766 but a warning may be needed if you use them together. */
769 comptypes (tree type1, tree type2)
771 const struct tagged_tu_seen_cache * tagged_tu_seen_base1 = tagged_tu_seen_base;
774 val = comptypes_internal (type1, type2);
775 free_all_tagged_tu_seen_up_to (tagged_tu_seen_base1);
780 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
781 or various other operations. Return 2 if they are compatible
782 but a warning may be needed if you use them together. This
783 differs from comptypes, in that we don't free the seen types. */
786 comptypes_internal (tree type1, tree type2)
792 /* Suppress errors caused by previously reported errors. */
794 if (t1 == t2 || !t1 || !t2
795 || TREE_CODE (t1) == ERROR_MARK || TREE_CODE (t2) == ERROR_MARK)
798 /* If either type is the internal version of sizetype, return the
800 if (TREE_CODE (t1) == INTEGER_TYPE && TYPE_IS_SIZETYPE (t1)
801 && TYPE_ORIG_SIZE_TYPE (t1))
802 t1 = TYPE_ORIG_SIZE_TYPE (t1);
804 if (TREE_CODE (t2) == INTEGER_TYPE && TYPE_IS_SIZETYPE (t2)
805 && TYPE_ORIG_SIZE_TYPE (t2))
806 t2 = TYPE_ORIG_SIZE_TYPE (t2);
809 /* Enumerated types are compatible with integer types, but this is
810 not transitive: two enumerated types in the same translation unit
811 are compatible with each other only if they are the same type. */
813 if (TREE_CODE (t1) == ENUMERAL_TYPE && TREE_CODE (t2) != ENUMERAL_TYPE)
814 t1 = c_common_type_for_size (TYPE_PRECISION (t1), TYPE_UNSIGNED (t1));
815 else if (TREE_CODE (t2) == ENUMERAL_TYPE && TREE_CODE (t1) != ENUMERAL_TYPE)
816 t2 = c_common_type_for_size (TYPE_PRECISION (t2), TYPE_UNSIGNED (t2));
821 /* Different classes of types can't be compatible. */
823 if (TREE_CODE (t1) != TREE_CODE (t2))
826 /* Qualifiers must match. C99 6.7.3p9 */
828 if (TYPE_QUALS (t1) != TYPE_QUALS (t2))
831 /* Allow for two different type nodes which have essentially the same
832 definition. Note that we already checked for equality of the type
833 qualifiers (just above). */
835 if (TREE_CODE (t1) != ARRAY_TYPE
836 && TYPE_MAIN_VARIANT (t1) == TYPE_MAIN_VARIANT (t2))
839 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
840 if (!(attrval = targetm.comp_type_attributes (t1, t2)))
843 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
846 switch (TREE_CODE (t1))
849 /* Do not remove mode or aliasing information. */
850 if (TYPE_MODE (t1) != TYPE_MODE (t2)
851 || TYPE_REF_CAN_ALIAS_ALL (t1) != TYPE_REF_CAN_ALIAS_ALL (t2))
853 val = (TREE_TYPE (t1) == TREE_TYPE (t2)
854 ? 1 : comptypes_internal (TREE_TYPE (t1), TREE_TYPE (t2)));
858 val = function_types_compatible_p (t1, t2);
863 tree d1 = TYPE_DOMAIN (t1);
864 tree d2 = TYPE_DOMAIN (t2);
865 bool d1_variable, d2_variable;
866 bool d1_zero, d2_zero;
869 /* Target types must match incl. qualifiers. */
870 if (TREE_TYPE (t1) != TREE_TYPE (t2)
871 && 0 == (val = comptypes_internal (TREE_TYPE (t1), TREE_TYPE (t2))))
874 /* Sizes must match unless one is missing or variable. */
875 if (d1 == 0 || d2 == 0 || d1 == d2)
878 d1_zero = !TYPE_MAX_VALUE (d1);
879 d2_zero = !TYPE_MAX_VALUE (d2);
881 d1_variable = (!d1_zero
882 && (TREE_CODE (TYPE_MIN_VALUE (d1)) != INTEGER_CST
883 || TREE_CODE (TYPE_MAX_VALUE (d1)) != INTEGER_CST));
884 d2_variable = (!d2_zero
885 && (TREE_CODE (TYPE_MIN_VALUE (d2)) != INTEGER_CST
886 || TREE_CODE (TYPE_MAX_VALUE (d2)) != INTEGER_CST));
887 d1_variable = d1_variable || (d1_zero && c_vla_type_p (t1));
888 d2_variable = d2_variable || (d2_zero && c_vla_type_p (t2));
890 if (d1_variable || d2_variable)
892 if (d1_zero && d2_zero)
894 if (d1_zero || d2_zero
895 || !tree_int_cst_equal (TYPE_MIN_VALUE (d1), TYPE_MIN_VALUE (d2))
896 || !tree_int_cst_equal (TYPE_MAX_VALUE (d1), TYPE_MAX_VALUE (d2)))
905 if (val != 1 && !same_translation_unit_p (t1, t2))
907 tree a1 = TYPE_ATTRIBUTES (t1);
908 tree a2 = TYPE_ATTRIBUTES (t2);
910 if (! attribute_list_contained (a1, a2)
911 && ! attribute_list_contained (a2, a1))
915 return tagged_types_tu_compatible_p (t1, t2);
916 val = tagged_types_tu_compatible_p (t1, t2);
921 val = TYPE_VECTOR_SUBPARTS (t1) == TYPE_VECTOR_SUBPARTS (t2)
922 && comptypes_internal (TREE_TYPE (t1), TREE_TYPE (t2));
928 return attrval == 2 && val == 1 ? 2 : val;
931 /* Return 1 if TTL and TTR are pointers to types that are equivalent,
932 ignoring their qualifiers. */
935 comp_target_types (tree ttl, tree ttr)
940 /* Do not lose qualifiers on element types of array types that are
941 pointer targets by taking their TYPE_MAIN_VARIANT. */
942 mvl = TREE_TYPE (ttl);
943 mvr = TREE_TYPE (ttr);
944 if (TREE_CODE (mvl) != ARRAY_TYPE)
945 mvl = TYPE_MAIN_VARIANT (mvl);
946 if (TREE_CODE (mvr) != ARRAY_TYPE)
947 mvr = TYPE_MAIN_VARIANT (mvr);
948 val = comptypes (mvl, mvr);
950 if (val == 2 && pedantic)
951 pedwarn ("types are not quite compatible");
955 /* Subroutines of `comptypes'. */
957 /* Determine whether two trees derive from the same translation unit.
958 If the CONTEXT chain ends in a null, that tree's context is still
959 being parsed, so if two trees have context chains ending in null,
960 they're in the same translation unit. */
962 same_translation_unit_p (tree t1, tree t2)
964 while (t1 && TREE_CODE (t1) != TRANSLATION_UNIT_DECL)
965 switch (TREE_CODE_CLASS (TREE_CODE (t1)))
967 case tcc_declaration:
968 t1 = DECL_CONTEXT (t1); break;
970 t1 = TYPE_CONTEXT (t1); break;
971 case tcc_exceptional:
972 t1 = BLOCK_SUPERCONTEXT (t1); break; /* assume block */
973 default: gcc_unreachable ();
976 while (t2 && TREE_CODE (t2) != TRANSLATION_UNIT_DECL)
977 switch (TREE_CODE_CLASS (TREE_CODE (t2)))
979 case tcc_declaration:
980 t2 = DECL_CONTEXT (t2); break;
982 t2 = TYPE_CONTEXT (t2); break;
983 case tcc_exceptional:
984 t2 = BLOCK_SUPERCONTEXT (t2); break; /* assume block */
985 default: gcc_unreachable ();
991 /* Allocate the seen two types, assuming that they are compatible. */
993 static struct tagged_tu_seen_cache *
994 alloc_tagged_tu_seen_cache (tree t1, tree t2)
996 struct tagged_tu_seen_cache *tu = XNEW (struct tagged_tu_seen_cache);
997 tu->next = tagged_tu_seen_base;
1001 tagged_tu_seen_base = tu;
1003 /* The C standard says that two structures in different translation
1004 units are compatible with each other only if the types of their
1005 fields are compatible (among other things). We assume that they
1006 are compatible until proven otherwise when building the cache.
1007 An example where this can occur is:
1012 If we are comparing this against a similar struct in another TU,
1013 and did not assume they were compatible, we end up with an infinite
1019 /* Free the seen types until we get to TU_TIL. */
1022 free_all_tagged_tu_seen_up_to (const struct tagged_tu_seen_cache *tu_til)
1024 const struct tagged_tu_seen_cache *tu = tagged_tu_seen_base;
1025 while (tu != tu_til)
1027 struct tagged_tu_seen_cache *tu1 = (struct tagged_tu_seen_cache*)tu;
1031 tagged_tu_seen_base = tu_til;
1034 /* Return 1 if two 'struct', 'union', or 'enum' types T1 and T2 are
1035 compatible. If the two types are not the same (which has been
1036 checked earlier), this can only happen when multiple translation
1037 units are being compiled. See C99 6.2.7 paragraph 1 for the exact
1041 tagged_types_tu_compatible_p (tree t1, tree t2)
1044 bool needs_warning = false;
1046 /* We have to verify that the tags of the types are the same. This
1047 is harder than it looks because this may be a typedef, so we have
1048 to go look at the original type. It may even be a typedef of a
1050 In the case of compiler-created builtin structs the TYPE_DECL
1051 may be a dummy, with no DECL_ORIGINAL_TYPE. Don't fault. */
1052 while (TYPE_NAME (t1)
1053 && TREE_CODE (TYPE_NAME (t1)) == TYPE_DECL
1054 && DECL_ORIGINAL_TYPE (TYPE_NAME (t1)))
1055 t1 = DECL_ORIGINAL_TYPE (TYPE_NAME (t1));
1057 while (TYPE_NAME (t2)
1058 && TREE_CODE (TYPE_NAME (t2)) == TYPE_DECL
1059 && DECL_ORIGINAL_TYPE (TYPE_NAME (t2)))
1060 t2 = DECL_ORIGINAL_TYPE (TYPE_NAME (t2));
1062 /* C90 didn't have the requirement that the two tags be the same. */
1063 if (flag_isoc99 && TYPE_NAME (t1) != TYPE_NAME (t2))
1066 /* C90 didn't say what happened if one or both of the types were
1067 incomplete; we choose to follow C99 rules here, which is that they
1069 if (TYPE_SIZE (t1) == NULL
1070 || TYPE_SIZE (t2) == NULL)
1074 const struct tagged_tu_seen_cache * tts_i;
1075 for (tts_i = tagged_tu_seen_base; tts_i != NULL; tts_i = tts_i->next)
1076 if (tts_i->t1 == t1 && tts_i->t2 == t2)
1080 switch (TREE_CODE (t1))
1084 struct tagged_tu_seen_cache *tu = alloc_tagged_tu_seen_cache (t1, t2);
1085 /* Speed up the case where the type values are in the same order. */
1086 tree tv1 = TYPE_VALUES (t1);
1087 tree tv2 = TYPE_VALUES (t2);
1094 for (;tv1 && tv2; tv1 = TREE_CHAIN (tv1), tv2 = TREE_CHAIN (tv2))
1096 if (TREE_PURPOSE (tv1) != TREE_PURPOSE (tv2))
1098 if (simple_cst_equal (TREE_VALUE (tv1), TREE_VALUE (tv2)) != 1)
1105 if (tv1 == NULL_TREE && tv2 == NULL_TREE)
1109 if (tv1 == NULL_TREE || tv2 == NULL_TREE)
1115 if (list_length (TYPE_VALUES (t1)) != list_length (TYPE_VALUES (t2)))
1121 for (s1 = TYPE_VALUES (t1); s1; s1 = TREE_CHAIN (s1))
1123 s2 = purpose_member (TREE_PURPOSE (s1), TYPE_VALUES (t2));
1125 || simple_cst_equal (TREE_VALUE (s1), TREE_VALUE (s2)) != 1)
1136 struct tagged_tu_seen_cache *tu = alloc_tagged_tu_seen_cache (t1, t2);
1137 if (list_length (TYPE_FIELDS (t1)) != list_length (TYPE_FIELDS (t2)))
1143 /* Speed up the common case where the fields are in the same order. */
1144 for (s1 = TYPE_FIELDS (t1), s2 = TYPE_FIELDS (t2); s1 && s2;
1145 s1 = TREE_CHAIN (s1), s2 = TREE_CHAIN (s2))
1150 if (DECL_NAME (s1) == NULL
1151 || DECL_NAME (s1) != DECL_NAME (s2))
1153 result = comptypes_internal (TREE_TYPE (s1), TREE_TYPE (s2));
1160 needs_warning = true;
1162 if (TREE_CODE (s1) == FIELD_DECL
1163 && simple_cst_equal (DECL_FIELD_BIT_OFFSET (s1),
1164 DECL_FIELD_BIT_OFFSET (s2)) != 1)
1172 tu->val = needs_warning ? 2 : 1;
1176 for (s1 = TYPE_FIELDS (t1); s1; s1 = TREE_CHAIN (s1))
1180 if (DECL_NAME (s1) != NULL)
1181 for (s2 = TYPE_FIELDS (t2); s2; s2 = TREE_CHAIN (s2))
1182 if (DECL_NAME (s1) == DECL_NAME (s2))
1185 result = comptypes_internal (TREE_TYPE (s1), TREE_TYPE (s2));
1192 needs_warning = true;
1194 if (TREE_CODE (s1) == FIELD_DECL
1195 && simple_cst_equal (DECL_FIELD_BIT_OFFSET (s1),
1196 DECL_FIELD_BIT_OFFSET (s2)) != 1)
1208 tu->val = needs_warning ? 2 : 10;
1214 struct tagged_tu_seen_cache *tu = alloc_tagged_tu_seen_cache (t1, t2);
1216 for (s1 = TYPE_FIELDS (t1), s2 = TYPE_FIELDS (t2);
1218 s1 = TREE_CHAIN (s1), s2 = TREE_CHAIN (s2))
1221 if (TREE_CODE (s1) != TREE_CODE (s2)
1222 || DECL_NAME (s1) != DECL_NAME (s2))
1224 result = comptypes_internal (TREE_TYPE (s1), TREE_TYPE (s2));
1228 needs_warning = true;
1230 if (TREE_CODE (s1) == FIELD_DECL
1231 && simple_cst_equal (DECL_FIELD_BIT_OFFSET (s1),
1232 DECL_FIELD_BIT_OFFSET (s2)) != 1)
1238 tu->val = needs_warning ? 2 : 1;
1247 /* Return 1 if two function types F1 and F2 are compatible.
1248 If either type specifies no argument types,
1249 the other must specify a fixed number of self-promoting arg types.
1250 Otherwise, if one type specifies only the number of arguments,
1251 the other must specify that number of self-promoting arg types.
1252 Otherwise, the argument types must match. */
1255 function_types_compatible_p (tree f1, tree f2)
1258 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1263 ret1 = TREE_TYPE (f1);
1264 ret2 = TREE_TYPE (f2);
1266 /* 'volatile' qualifiers on a function's return type used to mean
1267 the function is noreturn. */
1268 if (TYPE_VOLATILE (ret1) != TYPE_VOLATILE (ret2))
1269 pedwarn ("function return types not compatible due to %<volatile%>");
1270 if (TYPE_VOLATILE (ret1))
1271 ret1 = build_qualified_type (TYPE_MAIN_VARIANT (ret1),
1272 TYPE_QUALS (ret1) & ~TYPE_QUAL_VOLATILE);
1273 if (TYPE_VOLATILE (ret2))
1274 ret2 = build_qualified_type (TYPE_MAIN_VARIANT (ret2),
1275 TYPE_QUALS (ret2) & ~TYPE_QUAL_VOLATILE);
1276 val = comptypes_internal (ret1, ret2);
1280 args1 = TYPE_ARG_TYPES (f1);
1281 args2 = TYPE_ARG_TYPES (f2);
1283 /* An unspecified parmlist matches any specified parmlist
1284 whose argument types don't need default promotions. */
1288 if (!self_promoting_args_p (args2))
1290 /* If one of these types comes from a non-prototype fn definition,
1291 compare that with the other type's arglist.
1292 If they don't match, ask for a warning (but no error). */
1293 if (TYPE_ACTUAL_ARG_TYPES (f1)
1294 && 1 != type_lists_compatible_p (args2, TYPE_ACTUAL_ARG_TYPES (f1)))
1300 if (!self_promoting_args_p (args1))
1302 if (TYPE_ACTUAL_ARG_TYPES (f2)
1303 && 1 != type_lists_compatible_p (args1, TYPE_ACTUAL_ARG_TYPES (f2)))
1308 /* Both types have argument lists: compare them and propagate results. */
1309 val1 = type_lists_compatible_p (args1, args2);
1310 return val1 != 1 ? val1 : val;
1313 /* Check two lists of types for compatibility,
1314 returning 0 for incompatible, 1 for compatible,
1315 or 2 for compatible with warning. */
1318 type_lists_compatible_p (tree args1, tree args2)
1320 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1326 tree a1, mv1, a2, mv2;
1327 if (args1 == 0 && args2 == 0)
1329 /* If one list is shorter than the other,
1330 they fail to match. */
1331 if (args1 == 0 || args2 == 0)
1333 mv1 = a1 = TREE_VALUE (args1);
1334 mv2 = a2 = TREE_VALUE (args2);
1335 if (mv1 && mv1 != error_mark_node && TREE_CODE (mv1) != ARRAY_TYPE)
1336 mv1 = TYPE_MAIN_VARIANT (mv1);
1337 if (mv2 && mv2 != error_mark_node && TREE_CODE (mv2) != ARRAY_TYPE)
1338 mv2 = TYPE_MAIN_VARIANT (mv2);
1339 /* A null pointer instead of a type
1340 means there is supposed to be an argument
1341 but nothing is specified about what type it has.
1342 So match anything that self-promotes. */
1345 if (c_type_promotes_to (a2) != a2)
1350 if (c_type_promotes_to (a1) != a1)
1353 /* If one of the lists has an error marker, ignore this arg. */
1354 else if (TREE_CODE (a1) == ERROR_MARK
1355 || TREE_CODE (a2) == ERROR_MARK)
1357 else if (!(newval = comptypes_internal (mv1, mv2)))
1359 /* Allow wait (union {union wait *u; int *i} *)
1360 and wait (union wait *) to be compatible. */
1361 if (TREE_CODE (a1) == UNION_TYPE
1362 && (TYPE_NAME (a1) == 0
1363 || TYPE_TRANSPARENT_UNION (a1))
1364 && TREE_CODE (TYPE_SIZE (a1)) == INTEGER_CST
1365 && tree_int_cst_equal (TYPE_SIZE (a1),
1369 for (memb = TYPE_FIELDS (a1);
1370 memb; memb = TREE_CHAIN (memb))
1372 tree mv3 = TREE_TYPE (memb);
1373 if (mv3 && mv3 != error_mark_node
1374 && TREE_CODE (mv3) != ARRAY_TYPE)
1375 mv3 = TYPE_MAIN_VARIANT (mv3);
1376 if (comptypes_internal (mv3, mv2))
1382 else if (TREE_CODE (a2) == UNION_TYPE
1383 && (TYPE_NAME (a2) == 0
1384 || TYPE_TRANSPARENT_UNION (a2))
1385 && TREE_CODE (TYPE_SIZE (a2)) == INTEGER_CST
1386 && tree_int_cst_equal (TYPE_SIZE (a2),
1390 for (memb = TYPE_FIELDS (a2);
1391 memb; memb = TREE_CHAIN (memb))
1393 tree mv3 = TREE_TYPE (memb);
1394 if (mv3 && mv3 != error_mark_node
1395 && TREE_CODE (mv3) != ARRAY_TYPE)
1396 mv3 = TYPE_MAIN_VARIANT (mv3);
1397 if (comptypes_internal (mv3, mv1))
1407 /* comptypes said ok, but record if it said to warn. */
1411 args1 = TREE_CHAIN (args1);
1412 args2 = TREE_CHAIN (args2);
1416 /* Compute the size to increment a pointer by. */
1419 c_size_in_bytes (tree type)
1421 enum tree_code code = TREE_CODE (type);
1423 if (code == FUNCTION_TYPE || code == VOID_TYPE || code == ERROR_MARK)
1424 return size_one_node;
1426 if (!COMPLETE_OR_VOID_TYPE_P (type))
1428 error ("arithmetic on pointer to an incomplete type");
1429 return size_one_node;
1432 /* Convert in case a char is more than one unit. */
1433 return size_binop (CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type),
1434 size_int (TYPE_PRECISION (char_type_node)
1438 /* Return either DECL or its known constant value (if it has one). */
1441 decl_constant_value (tree decl)
1443 if (/* Don't change a variable array bound or initial value to a constant
1444 in a place where a variable is invalid. Note that DECL_INITIAL
1445 isn't valid for a PARM_DECL. */
1446 current_function_decl != 0
1447 && TREE_CODE (decl) != PARM_DECL
1448 && !TREE_THIS_VOLATILE (decl)
1449 && TREE_READONLY (decl)
1450 && DECL_INITIAL (decl) != 0
1451 && TREE_CODE (DECL_INITIAL (decl)) != ERROR_MARK
1452 /* This is invalid if initial value is not constant.
1453 If it has either a function call, a memory reference,
1454 or a variable, then re-evaluating it could give different results. */
1455 && TREE_CONSTANT (DECL_INITIAL (decl))
1456 /* Check for cases where this is sub-optimal, even though valid. */
1457 && TREE_CODE (DECL_INITIAL (decl)) != CONSTRUCTOR)
1458 return DECL_INITIAL (decl);
1462 /* Return either DECL or its known constant value (if it has one), but
1463 return DECL if pedantic or DECL has mode BLKmode. This is for
1464 bug-compatibility with the old behavior of decl_constant_value
1465 (before GCC 3.0); every use of this function is a bug and it should
1466 be removed before GCC 3.1. It is not appropriate to use pedantic
1467 in a way that affects optimization, and BLKmode is probably not the
1468 right test for avoiding misoptimizations either. */
1471 decl_constant_value_for_broken_optimization (tree decl)
1475 if (pedantic || DECL_MODE (decl) == BLKmode)
1478 ret = decl_constant_value (decl);
1479 /* Avoid unwanted tree sharing between the initializer and current
1480 function's body where the tree can be modified e.g. by the
1482 if (ret != decl && TREE_STATIC (decl))
1483 ret = unshare_expr (ret);
1487 /* Convert the array expression EXP to a pointer. */
1489 array_to_pointer_conversion (tree exp)
1491 tree orig_exp = exp;
1492 tree type = TREE_TYPE (exp);
1494 tree restype = TREE_TYPE (type);
1497 gcc_assert (TREE_CODE (type) == ARRAY_TYPE);
1499 STRIP_TYPE_NOPS (exp);
1501 if (TREE_NO_WARNING (orig_exp))
1502 TREE_NO_WARNING (exp) = 1;
1504 ptrtype = build_pointer_type (restype);
1506 if (TREE_CODE (exp) == INDIRECT_REF)
1507 return convert (ptrtype, TREE_OPERAND (exp, 0));
1509 if (TREE_CODE (exp) == VAR_DECL)
1511 /* We are making an ADDR_EXPR of ptrtype. This is a valid
1512 ADDR_EXPR because it's the best way of representing what
1513 happens in C when we take the address of an array and place
1514 it in a pointer to the element type. */
1515 adr = build1 (ADDR_EXPR, ptrtype, exp);
1516 if (!c_mark_addressable (exp))
1517 return error_mark_node;
1518 TREE_SIDE_EFFECTS (adr) = 0; /* Default would be, same as EXP. */
1522 /* This way is better for a COMPONENT_REF since it can
1523 simplify the offset for a component. */
1524 adr = build_unary_op (ADDR_EXPR, exp, 1);
1525 return convert (ptrtype, adr);
1528 /* Convert the function expression EXP to a pointer. */
1530 function_to_pointer_conversion (tree exp)
1532 tree orig_exp = exp;
1534 gcc_assert (TREE_CODE (TREE_TYPE (exp)) == FUNCTION_TYPE);
1536 STRIP_TYPE_NOPS (exp);
1538 if (TREE_NO_WARNING (orig_exp))
1539 TREE_NO_WARNING (exp) = 1;
1541 return build_unary_op (ADDR_EXPR, exp, 0);
1544 /* Perform the default conversion of arrays and functions to pointers.
1545 Return the result of converting EXP. For any other expression, just
1546 return EXP after removing NOPs. */
1549 default_function_array_conversion (struct c_expr exp)
1551 tree orig_exp = exp.value;
1552 tree type = TREE_TYPE (exp.value);
1553 enum tree_code code = TREE_CODE (type);
1559 bool not_lvalue = false;
1560 bool lvalue_array_p;
1562 while ((TREE_CODE (exp.value) == NON_LVALUE_EXPR
1563 || TREE_CODE (exp.value) == NOP_EXPR
1564 || TREE_CODE (exp.value) == CONVERT_EXPR)
1565 && TREE_TYPE (TREE_OPERAND (exp.value, 0)) == type)
1567 if (TREE_CODE (exp.value) == NON_LVALUE_EXPR)
1569 exp.value = TREE_OPERAND (exp.value, 0);
1572 if (TREE_NO_WARNING (orig_exp))
1573 TREE_NO_WARNING (exp.value) = 1;
1575 lvalue_array_p = !not_lvalue && lvalue_p (exp.value);
1576 if (!flag_isoc99 && !lvalue_array_p)
1578 /* Before C99, non-lvalue arrays do not decay to pointers.
1579 Normally, using such an array would be invalid; but it can
1580 be used correctly inside sizeof or as a statement expression.
1581 Thus, do not give an error here; an error will result later. */
1585 exp.value = array_to_pointer_conversion (exp.value);
1589 exp.value = function_to_pointer_conversion (exp.value);
1592 STRIP_TYPE_NOPS (exp.value);
1593 if (TREE_NO_WARNING (orig_exp))
1594 TREE_NO_WARNING (exp.value) = 1;
1602 /* EXP is an expression of integer type. Apply the integer promotions
1603 to it and return the promoted value. */
1606 perform_integral_promotions (tree exp)
1608 tree type = TREE_TYPE (exp);
1609 enum tree_code code = TREE_CODE (type);
1611 gcc_assert (INTEGRAL_TYPE_P (type));
1613 /* Normally convert enums to int,
1614 but convert wide enums to something wider. */
1615 if (code == ENUMERAL_TYPE)
1617 type = c_common_type_for_size (MAX (TYPE_PRECISION (type),
1618 TYPE_PRECISION (integer_type_node)),
1619 ((TYPE_PRECISION (type)
1620 >= TYPE_PRECISION (integer_type_node))
1621 && TYPE_UNSIGNED (type)));
1623 return convert (type, exp);
1626 /* ??? This should no longer be needed now bit-fields have their
1628 if (TREE_CODE (exp) == COMPONENT_REF
1629 && DECL_C_BIT_FIELD (TREE_OPERAND (exp, 1))
1630 /* If it's thinner than an int, promote it like a
1631 c_promoting_integer_type_p, otherwise leave it alone. */
1632 && 0 > compare_tree_int (DECL_SIZE (TREE_OPERAND (exp, 1)),
1633 TYPE_PRECISION (integer_type_node)))
1634 return convert (integer_type_node, exp);
1636 if (c_promoting_integer_type_p (type))
1638 /* Preserve unsignedness if not really getting any wider. */
1639 if (TYPE_UNSIGNED (type)
1640 && TYPE_PRECISION (type) == TYPE_PRECISION (integer_type_node))
1641 return convert (unsigned_type_node, exp);
1643 return convert (integer_type_node, exp);
1650 /* Perform default promotions for C data used in expressions.
1651 Enumeral types or short or char are converted to int.
1652 In addition, manifest constants symbols are replaced by their values. */
1655 default_conversion (tree exp)
1658 tree type = TREE_TYPE (exp);
1659 enum tree_code code = TREE_CODE (type);
1661 /* Functions and arrays have been converted during parsing. */
1662 gcc_assert (code != FUNCTION_TYPE);
1663 if (code == ARRAY_TYPE)
1666 /* Constants can be used directly unless they're not loadable. */
1667 if (TREE_CODE (exp) == CONST_DECL)
1668 exp = DECL_INITIAL (exp);
1670 /* Replace a nonvolatile const static variable with its value unless
1671 it is an array, in which case we must be sure that taking the
1672 address of the array produces consistent results. */
1673 else if (optimize && TREE_CODE (exp) == VAR_DECL && code != ARRAY_TYPE)
1675 exp = decl_constant_value_for_broken_optimization (exp);
1676 type = TREE_TYPE (exp);
1679 /* Strip no-op conversions. */
1681 STRIP_TYPE_NOPS (exp);
1683 if (TREE_NO_WARNING (orig_exp))
1684 TREE_NO_WARNING (exp) = 1;
1686 if (INTEGRAL_TYPE_P (type))
1687 return perform_integral_promotions (exp);
1689 if (code == VOID_TYPE)
1691 error ("void value not ignored as it ought to be");
1692 return error_mark_node;
1697 /* Look up COMPONENT in a structure or union DECL.
1699 If the component name is not found, returns NULL_TREE. Otherwise,
1700 the return value is a TREE_LIST, with each TREE_VALUE a FIELD_DECL
1701 stepping down the chain to the component, which is in the last
1702 TREE_VALUE of the list. Normally the list is of length one, but if
1703 the component is embedded within (nested) anonymous structures or
1704 unions, the list steps down the chain to the component. */
1707 lookup_field (tree decl, tree component)
1709 tree type = TREE_TYPE (decl);
1712 /* If TYPE_LANG_SPECIFIC is set, then it is a sorted array of pointers
1713 to the field elements. Use a binary search on this array to quickly
1714 find the element. Otherwise, do a linear search. TYPE_LANG_SPECIFIC
1715 will always be set for structures which have many elements. */
1717 if (TYPE_LANG_SPECIFIC (type) && TYPE_LANG_SPECIFIC (type)->s)
1720 tree *field_array = &TYPE_LANG_SPECIFIC (type)->s->elts[0];
1722 field = TYPE_FIELDS (type);
1724 top = TYPE_LANG_SPECIFIC (type)->s->len;
1725 while (top - bot > 1)
1727 half = (top - bot + 1) >> 1;
1728 field = field_array[bot+half];
1730 if (DECL_NAME (field) == NULL_TREE)
1732 /* Step through all anon unions in linear fashion. */
1733 while (DECL_NAME (field_array[bot]) == NULL_TREE)
1735 field = field_array[bot++];
1736 if (TREE_CODE (TREE_TYPE (field)) == RECORD_TYPE
1737 || TREE_CODE (TREE_TYPE (field)) == UNION_TYPE)
1739 tree anon = lookup_field (field, component);
1742 return tree_cons (NULL_TREE, field, anon);
1746 /* Entire record is only anon unions. */
1750 /* Restart the binary search, with new lower bound. */
1754 if (DECL_NAME (field) == component)
1756 if (DECL_NAME (field) < component)
1762 if (DECL_NAME (field_array[bot]) == component)
1763 field = field_array[bot];
1764 else if (DECL_NAME (field) != component)
1769 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
1771 if (DECL_NAME (field) == NULL_TREE
1772 && (TREE_CODE (TREE_TYPE (field)) == RECORD_TYPE
1773 || TREE_CODE (TREE_TYPE (field)) == UNION_TYPE))
1775 tree anon = lookup_field (field, component);
1778 return tree_cons (NULL_TREE, field, anon);
1781 if (DECL_NAME (field) == component)
1785 if (field == NULL_TREE)
1789 return tree_cons (NULL_TREE, field, NULL_TREE);
1792 /* Make an expression to refer to the COMPONENT field of
1793 structure or union value DATUM. COMPONENT is an IDENTIFIER_NODE. */
1796 build_component_ref (tree datum, tree component)
1798 tree type = TREE_TYPE (datum);
1799 enum tree_code code = TREE_CODE (type);
1803 if (!objc_is_public (datum, component))
1804 return error_mark_node;
1806 /* See if there is a field or component with name COMPONENT. */
1808 if (code == RECORD_TYPE || code == UNION_TYPE)
1810 if (!COMPLETE_TYPE_P (type))
1812 c_incomplete_type_error (NULL_TREE, type);
1813 return error_mark_node;
1816 field = lookup_field (datum, component);
1820 error ("%qT has no member named %qE", type, component);
1821 return error_mark_node;
1824 /* Chain the COMPONENT_REFs if necessary down to the FIELD.
1825 This might be better solved in future the way the C++ front
1826 end does it - by giving the anonymous entities each a
1827 separate name and type, and then have build_component_ref
1828 recursively call itself. We can't do that here. */
1831 tree subdatum = TREE_VALUE (field);
1835 if (TREE_TYPE (subdatum) == error_mark_node)
1836 return error_mark_node;
1838 quals = TYPE_QUALS (strip_array_types (TREE_TYPE (subdatum)));
1839 quals |= TYPE_QUALS (TREE_TYPE (datum));
1840 subtype = c_build_qualified_type (TREE_TYPE (subdatum), quals);
1842 ref = build3 (COMPONENT_REF, subtype, datum, subdatum,
1844 if (TREE_READONLY (datum) || TREE_READONLY (subdatum))
1845 TREE_READONLY (ref) = 1;
1846 if (TREE_THIS_VOLATILE (datum) || TREE_THIS_VOLATILE (subdatum))
1847 TREE_THIS_VOLATILE (ref) = 1;
1849 if (TREE_DEPRECATED (subdatum))
1850 warn_deprecated_use (subdatum);
1854 field = TREE_CHAIN (field);
1860 else if (code != ERROR_MARK)
1861 error ("request for member %qE in something not a structure or union",
1864 return error_mark_node;
1867 /* Given an expression PTR for a pointer, return an expression
1868 for the value pointed to.
1869 ERRORSTRING is the name of the operator to appear in error messages. */
1872 build_indirect_ref (tree ptr, const char *errorstring)
1874 tree pointer = default_conversion (ptr);
1875 tree type = TREE_TYPE (pointer);
1877 if (TREE_CODE (type) == POINTER_TYPE)
1879 if (TREE_CODE (pointer) == CONVERT_EXPR
1880 || TREE_CODE (pointer) == NOP_EXPR
1881 || TREE_CODE (pointer) == VIEW_CONVERT_EXPR)
1883 /* If a warning is issued, mark it to avoid duplicates from
1884 the backend. This only needs to be done at
1885 warn_strict_aliasing > 2. */
1886 if (warn_strict_aliasing > 2)
1887 if (strict_aliasing_warning (TREE_TYPE (TREE_OPERAND (pointer, 0)),
1888 type, TREE_OPERAND (pointer, 0)))
1889 TREE_NO_WARNING (pointer) = 1;
1892 if (TREE_CODE (pointer) == ADDR_EXPR
1893 && (TREE_TYPE (TREE_OPERAND (pointer, 0))
1894 == TREE_TYPE (type)))
1895 return TREE_OPERAND (pointer, 0);
1898 tree t = TREE_TYPE (type);
1901 ref = build1 (INDIRECT_REF, t, pointer);
1903 if (!COMPLETE_OR_VOID_TYPE_P (t) && TREE_CODE (t) != ARRAY_TYPE)
1905 error ("dereferencing pointer to incomplete type");
1906 return error_mark_node;
1908 if (VOID_TYPE_P (t) && skip_evaluation == 0)
1909 warning (0, "dereferencing %<void *%> pointer");
1911 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
1912 so that we get the proper error message if the result is used
1913 to assign to. Also, &* is supposed to be a no-op.
1914 And ANSI C seems to specify that the type of the result
1915 should be the const type. */
1916 /* A de-reference of a pointer to const is not a const. It is valid
1917 to change it via some other pointer. */
1918 TREE_READONLY (ref) = TYPE_READONLY (t);
1919 TREE_SIDE_EFFECTS (ref)
1920 = TYPE_VOLATILE (t) || TREE_SIDE_EFFECTS (pointer);
1921 TREE_THIS_VOLATILE (ref) = TYPE_VOLATILE (t);
1925 else if (TREE_CODE (pointer) != ERROR_MARK)
1926 error ("invalid type argument of %qs (have %qT)", errorstring, type);
1927 return error_mark_node;
1930 /* This handles expressions of the form "a[i]", which denotes
1933 This is logically equivalent in C to *(a+i), but we may do it differently.
1934 If A is a variable or a member, we generate a primitive ARRAY_REF.
1935 This avoids forcing the array out of registers, and can work on
1936 arrays that are not lvalues (for example, members of structures returned
1940 build_array_ref (tree array, tree index)
1942 bool swapped = false;
1943 if (TREE_TYPE (array) == error_mark_node
1944 || TREE_TYPE (index) == error_mark_node)
1945 return error_mark_node;
1947 if (TREE_CODE (TREE_TYPE (array)) != ARRAY_TYPE
1948 && TREE_CODE (TREE_TYPE (array)) != POINTER_TYPE)
1951 if (TREE_CODE (TREE_TYPE (index)) != ARRAY_TYPE
1952 && TREE_CODE (TREE_TYPE (index)) != POINTER_TYPE)
1954 error ("subscripted value is neither array nor pointer");
1955 return error_mark_node;
1963 if (!INTEGRAL_TYPE_P (TREE_TYPE (index)))
1965 error ("array subscript is not an integer");
1966 return error_mark_node;
1969 if (TREE_CODE (TREE_TYPE (TREE_TYPE (array))) == FUNCTION_TYPE)
1971 error ("subscripted value is pointer to function");
1972 return error_mark_node;
1975 /* ??? Existing practice has been to warn only when the char
1976 index is syntactically the index, not for char[array]. */
1978 warn_array_subscript_with_type_char (index);
1980 /* Apply default promotions *after* noticing character types. */
1981 index = default_conversion (index);
1983 gcc_assert (TREE_CODE (TREE_TYPE (index)) == INTEGER_TYPE);
1985 if (TREE_CODE (TREE_TYPE (array)) == ARRAY_TYPE)
1989 /* An array that is indexed by a non-constant
1990 cannot be stored in a register; we must be able to do
1991 address arithmetic on its address.
1992 Likewise an array of elements of variable size. */
1993 if (TREE_CODE (index) != INTEGER_CST
1994 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array)))
1995 && TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array)))) != INTEGER_CST))
1997 if (!c_mark_addressable (array))
1998 return error_mark_node;
2000 /* An array that is indexed by a constant value which is not within
2001 the array bounds cannot be stored in a register either; because we
2002 would get a crash in store_bit_field/extract_bit_field when trying
2003 to access a non-existent part of the register. */
2004 if (TREE_CODE (index) == INTEGER_CST
2005 && TYPE_DOMAIN (TREE_TYPE (array))
2006 && !int_fits_type_p (index, TYPE_DOMAIN (TREE_TYPE (array))))
2008 if (!c_mark_addressable (array))
2009 return error_mark_node;
2015 while (TREE_CODE (foo) == COMPONENT_REF)
2016 foo = TREE_OPERAND (foo, 0);
2017 if (TREE_CODE (foo) == VAR_DECL && C_DECL_REGISTER (foo))
2018 pedwarn ("ISO C forbids subscripting %<register%> array");
2019 else if (!flag_isoc99 && !lvalue_p (foo))
2020 pedwarn ("ISO C90 forbids subscripting non-lvalue array");
2023 type = TREE_TYPE (TREE_TYPE (array));
2024 if (TREE_CODE (type) != ARRAY_TYPE)
2025 type = TYPE_MAIN_VARIANT (type);
2026 rval = build4 (ARRAY_REF, type, array, index, NULL_TREE, NULL_TREE);
2027 /* Array ref is const/volatile if the array elements are
2028 or if the array is. */
2029 TREE_READONLY (rval)
2030 |= (TYPE_READONLY (TREE_TYPE (TREE_TYPE (array)))
2031 | TREE_READONLY (array));
2032 TREE_SIDE_EFFECTS (rval)
2033 |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array)))
2034 | TREE_SIDE_EFFECTS (array));
2035 TREE_THIS_VOLATILE (rval)
2036 |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array)))
2037 /* This was added by rms on 16 Nov 91.
2038 It fixes vol struct foo *a; a->elts[1]
2039 in an inline function.
2040 Hope it doesn't break something else. */
2041 | TREE_THIS_VOLATILE (array));
2042 return require_complete_type (fold (rval));
2046 tree ar = default_conversion (array);
2048 if (ar == error_mark_node)
2051 gcc_assert (TREE_CODE (TREE_TYPE (ar)) == POINTER_TYPE);
2052 gcc_assert (TREE_CODE (TREE_TYPE (TREE_TYPE (ar))) != FUNCTION_TYPE);
2054 return build_indirect_ref (build_binary_op (PLUS_EXPR, ar, index, 0),
2059 /* Build an external reference to identifier ID. FUN indicates
2060 whether this will be used for a function call. LOC is the source
2061 location of the identifier. */
2063 build_external_ref (tree id, int fun, location_t loc)
2066 tree decl = lookup_name (id);
2068 /* In Objective-C, an instance variable (ivar) may be preferred to
2069 whatever lookup_name() found. */
2070 decl = objc_lookup_ivar (decl, id);
2072 if (decl && decl != error_mark_node)
2075 /* Implicit function declaration. */
2076 ref = implicitly_declare (id);
2077 else if (decl == error_mark_node)
2078 /* Don't complain about something that's already been
2079 complained about. */
2080 return error_mark_node;
2083 undeclared_variable (id, loc);
2084 return error_mark_node;
2087 if (TREE_TYPE (ref) == error_mark_node)
2088 return error_mark_node;
2090 if (TREE_DEPRECATED (ref))
2091 warn_deprecated_use (ref);
2093 if (!skip_evaluation)
2094 assemble_external (ref);
2095 TREE_USED (ref) = 1;
2097 if (TREE_CODE (ref) == FUNCTION_DECL && !in_alignof)
2099 if (!in_sizeof && !in_typeof)
2100 C_DECL_USED (ref) = 1;
2101 else if (DECL_INITIAL (ref) == 0
2102 && DECL_EXTERNAL (ref)
2103 && !TREE_PUBLIC (ref))
2104 record_maybe_used_decl (ref);
2107 if (TREE_CODE (ref) == CONST_DECL)
2109 used_types_insert (TREE_TYPE (ref));
2110 ref = DECL_INITIAL (ref);
2111 TREE_CONSTANT (ref) = 1;
2112 TREE_INVARIANT (ref) = 1;
2114 else if (current_function_decl != 0
2115 && !DECL_FILE_SCOPE_P (current_function_decl)
2116 && (TREE_CODE (ref) == VAR_DECL
2117 || TREE_CODE (ref) == PARM_DECL
2118 || TREE_CODE (ref) == FUNCTION_DECL))
2120 tree context = decl_function_context (ref);
2122 if (context != 0 && context != current_function_decl)
2123 DECL_NONLOCAL (ref) = 1;
2125 /* C99 6.7.4p3: An inline definition of a function with external
2126 linkage ... shall not contain a reference to an identifier with
2127 internal linkage. */
2128 else if (current_function_decl != 0
2129 && DECL_DECLARED_INLINE_P (current_function_decl)
2130 && DECL_EXTERNAL (current_function_decl)
2131 && VAR_OR_FUNCTION_DECL_P (ref)
2132 && DECL_FILE_SCOPE_P (ref)
2134 && (TREE_CODE (ref) != VAR_DECL || TREE_STATIC (ref))
2135 && ! TREE_PUBLIC (ref))
2136 pedwarn ("%H%qD is static but used in inline function %qD "
2137 "which is not static", &loc, ref, current_function_decl);
2142 /* Record details of decls possibly used inside sizeof or typeof. */
2143 struct maybe_used_decl
2147 /* The level seen at (in_sizeof + in_typeof). */
2149 /* The next one at this level or above, or NULL. */
2150 struct maybe_used_decl *next;
2153 static struct maybe_used_decl *maybe_used_decls;
2155 /* Record that DECL, an undefined static function reference seen
2156 inside sizeof or typeof, might be used if the operand of sizeof is
2157 a VLA type or the operand of typeof is a variably modified
2161 record_maybe_used_decl (tree decl)
2163 struct maybe_used_decl *t = XOBNEW (&parser_obstack, struct maybe_used_decl);
2165 t->level = in_sizeof + in_typeof;
2166 t->next = maybe_used_decls;
2167 maybe_used_decls = t;
2170 /* Pop the stack of decls possibly used inside sizeof or typeof. If
2171 USED is false, just discard them. If it is true, mark them used
2172 (if no longer inside sizeof or typeof) or move them to the next
2173 level up (if still inside sizeof or typeof). */
2176 pop_maybe_used (bool used)
2178 struct maybe_used_decl *p = maybe_used_decls;
2179 int cur_level = in_sizeof + in_typeof;
2180 while (p && p->level > cur_level)
2185 C_DECL_USED (p->decl) = 1;
2187 p->level = cur_level;
2191 if (!used || cur_level == 0)
2192 maybe_used_decls = p;
2195 /* Return the result of sizeof applied to EXPR. */
2198 c_expr_sizeof_expr (struct c_expr expr)
2201 if (expr.value == error_mark_node)
2203 ret.value = error_mark_node;
2204 ret.original_code = ERROR_MARK;
2205 pop_maybe_used (false);
2209 ret.value = c_sizeof (TREE_TYPE (expr.value));
2210 ret.original_code = ERROR_MARK;
2211 if (c_vla_type_p (TREE_TYPE (expr.value)))
2213 /* sizeof is evaluated when given a vla (C99 6.5.3.4p2). */
2214 ret.value = build2 (COMPOUND_EXPR, TREE_TYPE (ret.value), expr.value, ret.value);
2216 pop_maybe_used (C_TYPE_VARIABLE_SIZE (TREE_TYPE (expr.value)));
2221 /* Return the result of sizeof applied to T, a structure for the type
2222 name passed to sizeof (rather than the type itself). */
2225 c_expr_sizeof_type (struct c_type_name *t)
2229 type = groktypename (t);
2230 ret.value = c_sizeof (type);
2231 ret.original_code = ERROR_MARK;
2232 pop_maybe_used (type != error_mark_node
2233 ? C_TYPE_VARIABLE_SIZE (type) : false);
2237 /* Build a function call to function FUNCTION with parameters PARAMS.
2238 PARAMS is a list--a chain of TREE_LIST nodes--in which the
2239 TREE_VALUE of each node is a parameter-expression.
2240 FUNCTION's data type may be a function type or a pointer-to-function. */
2243 build_function_call (tree function, tree params)
2245 tree fntype, fundecl = 0;
2246 tree coerced_params;
2247 tree name = NULL_TREE, result;
2250 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
2251 STRIP_TYPE_NOPS (function);
2253 /* Convert anything with function type to a pointer-to-function. */
2254 if (TREE_CODE (function) == FUNCTION_DECL)
2256 /* Implement type-directed function overloading for builtins.
2257 resolve_overloaded_builtin and targetm.resolve_overloaded_builtin
2258 handle all the type checking. The result is a complete expression
2259 that implements this function call. */
2260 tem = resolve_overloaded_builtin (function, params);
2264 name = DECL_NAME (function);
2267 if (TREE_CODE (TREE_TYPE (function)) == FUNCTION_TYPE)
2268 function = function_to_pointer_conversion (function);
2270 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
2271 expressions, like those used for ObjC messenger dispatches. */
2272 function = objc_rewrite_function_call (function, params);
2274 fntype = TREE_TYPE (function);
2276 if (TREE_CODE (fntype) == ERROR_MARK)
2277 return error_mark_node;
2279 if (!(TREE_CODE (fntype) == POINTER_TYPE
2280 && TREE_CODE (TREE_TYPE (fntype)) == FUNCTION_TYPE))
2282 error ("called object %qE is not a function", function);
2283 return error_mark_node;
2286 if (fundecl && TREE_THIS_VOLATILE (fundecl))
2287 current_function_returns_abnormally = 1;
2289 /* fntype now gets the type of function pointed to. */
2290 fntype = TREE_TYPE (fntype);
2292 /* Check that the function is called through a compatible prototype.
2293 If it is not, replace the call by a trap, wrapped up in a compound
2294 expression if necessary. This has the nice side-effect to prevent
2295 the tree-inliner from generating invalid assignment trees which may
2296 blow up in the RTL expander later. */
2297 if ((TREE_CODE (function) == NOP_EXPR
2298 || TREE_CODE (function) == CONVERT_EXPR)
2299 && TREE_CODE (tem = TREE_OPERAND (function, 0)) == ADDR_EXPR
2300 && TREE_CODE (tem = TREE_OPERAND (tem, 0)) == FUNCTION_DECL
2301 && !comptypes (fntype, TREE_TYPE (tem)))
2303 tree return_type = TREE_TYPE (fntype);
2304 tree trap = build_function_call (built_in_decls[BUILT_IN_TRAP],
2307 /* This situation leads to run-time undefined behavior. We can't,
2308 therefore, simply error unless we can prove that all possible
2309 executions of the program must execute the code. */
2310 warning (0, "function called through a non-compatible type");
2312 /* We can, however, treat "undefined" any way we please.
2313 Call abort to encourage the user to fix the program. */
2314 inform ("if this code is reached, the program will abort");
2316 if (VOID_TYPE_P (return_type))
2322 if (AGGREGATE_TYPE_P (return_type))
2323 rhs = build_compound_literal (return_type,
2324 build_constructor (return_type, 0));
2326 rhs = fold_convert (return_type, integer_zero_node);
2328 return build2 (COMPOUND_EXPR, return_type, trap, rhs);
2332 /* Convert the parameters to the types declared in the
2333 function prototype, or apply default promotions. */
2336 = convert_arguments (TYPE_ARG_TYPES (fntype), params, function, fundecl);
2338 if (coerced_params == error_mark_node)
2339 return error_mark_node;
2341 /* Check that the arguments to the function are valid. */
2343 check_function_arguments (TYPE_ATTRIBUTES (fntype), coerced_params,
2344 TYPE_ARG_TYPES (fntype));
2346 if (require_constant_value)
2348 result = fold_build3_initializer (CALL_EXPR, TREE_TYPE (fntype),
2349 function, coerced_params, NULL_TREE);
2351 if (TREE_CONSTANT (result)
2352 && (name == NULL_TREE
2353 || strncmp (IDENTIFIER_POINTER (name), "__builtin_", 10) != 0))
2354 pedwarn_init ("initializer element is not constant");
2357 result = fold_build3 (CALL_EXPR, TREE_TYPE (fntype),
2358 function, coerced_params, NULL_TREE);
2360 if (VOID_TYPE_P (TREE_TYPE (result)))
2362 return require_complete_type (result);
2365 /* Convert the argument expressions in the list VALUES
2366 to the types in the list TYPELIST. The result is a list of converted
2367 argument expressions, unless there are too few arguments in which
2368 case it is error_mark_node.
2370 If TYPELIST is exhausted, or when an element has NULL as its type,
2371 perform the default conversions.
2373 PARMLIST is the chain of parm decls for the function being called.
2374 It may be 0, if that info is not available.
2375 It is used only for generating error messages.
2377 FUNCTION is a tree for the called function. It is used only for
2378 error messages, where it is formatted with %qE.
2380 This is also where warnings about wrong number of args are generated.
2382 Both VALUES and the returned value are chains of TREE_LIST nodes
2383 with the elements of the list in the TREE_VALUE slots of those nodes. */
2386 convert_arguments (tree typelist, tree values, tree function, tree fundecl)
2388 tree typetail, valtail;
2393 /* Change pointer to function to the function itself for
2395 if (TREE_CODE (function) == ADDR_EXPR
2396 && TREE_CODE (TREE_OPERAND (function, 0)) == FUNCTION_DECL)
2397 function = TREE_OPERAND (function, 0);
2399 /* Handle an ObjC selector specially for diagnostics. */
2400 selector = objc_message_selector ();
2402 /* Scan the given expressions and types, producing individual
2403 converted arguments and pushing them on RESULT in reverse order. */
2405 for (valtail = values, typetail = typelist, parmnum = 0;
2407 valtail = TREE_CHAIN (valtail), parmnum++)
2409 tree type = typetail ? TREE_VALUE (typetail) : 0;
2410 tree val = TREE_VALUE (valtail);
2411 tree rname = function;
2412 int argnum = parmnum + 1;
2413 const char *invalid_func_diag;
2415 if (type == void_type_node)
2417 error ("too many arguments to function %qE", function);
2421 if (selector && argnum > 2)
2427 STRIP_TYPE_NOPS (val);
2429 val = require_complete_type (val);
2433 /* Formal parm type is specified by a function prototype. */
2436 if (type == error_mark_node || !COMPLETE_TYPE_P (type))
2438 error ("type of formal parameter %d is incomplete", parmnum + 1);
2443 /* Optionally warn about conversions that
2444 differ from the default conversions. */
2445 if (warn_conversion || warn_traditional)
2447 unsigned int formal_prec = TYPE_PRECISION (type);
2449 if (INTEGRAL_TYPE_P (type)
2450 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
2451 warning (0, "passing argument %d of %qE as integer "
2452 "rather than floating due to prototype",
2454 if (INTEGRAL_TYPE_P (type)
2455 && TREE_CODE (TREE_TYPE (val)) == COMPLEX_TYPE)
2456 warning (0, "passing argument %d of %qE as integer "
2457 "rather than complex due to prototype",
2459 else if (TREE_CODE (type) == COMPLEX_TYPE
2460 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
2461 warning (0, "passing argument %d of %qE as complex "
2462 "rather than floating due to prototype",
2464 else if (TREE_CODE (type) == REAL_TYPE
2465 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
2466 warning (0, "passing argument %d of %qE as floating "
2467 "rather than integer due to prototype",
2469 else if (TREE_CODE (type) == COMPLEX_TYPE
2470 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
2471 warning (0, "passing argument %d of %qE as complex "
2472 "rather than integer due to prototype",
2474 else if (TREE_CODE (type) == REAL_TYPE
2475 && TREE_CODE (TREE_TYPE (val)) == COMPLEX_TYPE)
2476 warning (0, "passing argument %d of %qE as floating "
2477 "rather than complex due to prototype",
2479 /* ??? At some point, messages should be written about
2480 conversions between complex types, but that's too messy
2482 else if (TREE_CODE (type) == REAL_TYPE
2483 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
2485 /* Warn if any argument is passed as `float',
2486 since without a prototype it would be `double'. */
2487 if (formal_prec == TYPE_PRECISION (float_type_node)
2488 && type != dfloat32_type_node)
2489 warning (0, "passing argument %d of %qE as %<float%> "
2490 "rather than %<double%> due to prototype",
2493 /* Warn if mismatch between argument and prototype
2494 for decimal float types. Warn of conversions with
2495 binary float types and of precision narrowing due to
2497 else if (type != TREE_TYPE (val)
2498 && (type == dfloat32_type_node
2499 || type == dfloat64_type_node
2500 || type == dfloat128_type_node
2501 || TREE_TYPE (val) == dfloat32_type_node
2502 || TREE_TYPE (val) == dfloat64_type_node
2503 || TREE_TYPE (val) == dfloat128_type_node)
2505 <= TYPE_PRECISION (TREE_TYPE (val))
2506 || (type == dfloat128_type_node
2508 != dfloat64_type_node
2510 != dfloat32_type_node)))
2511 || (type == dfloat64_type_node
2513 != dfloat32_type_node))))
2514 warning (0, "passing argument %d of %qE as %qT "
2515 "rather than %qT due to prototype",
2516 argnum, rname, type, TREE_TYPE (val));
2519 /* Detect integer changing in width or signedness.
2520 These warnings are only activated with
2521 -Wconversion, not with -Wtraditional. */
2522 else if (warn_conversion && INTEGRAL_TYPE_P (type)
2523 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
2525 tree would_have_been = default_conversion (val);
2526 tree type1 = TREE_TYPE (would_have_been);
2528 if (TREE_CODE (type) == ENUMERAL_TYPE
2529 && (TYPE_MAIN_VARIANT (type)
2530 == TYPE_MAIN_VARIANT (TREE_TYPE (val))))
2531 /* No warning if function asks for enum
2532 and the actual arg is that enum type. */
2534 else if (formal_prec != TYPE_PRECISION (type1))
2535 warning (OPT_Wconversion, "passing argument %d of %qE "
2536 "with different width due to prototype",
2538 else if (TYPE_UNSIGNED (type) == TYPE_UNSIGNED (type1))
2540 /* Don't complain if the formal parameter type
2541 is an enum, because we can't tell now whether
2542 the value was an enum--even the same enum. */
2543 else if (TREE_CODE (type) == ENUMERAL_TYPE)
2545 else if (TREE_CODE (val) == INTEGER_CST
2546 && int_fits_type_p (val, type))
2547 /* Change in signedness doesn't matter
2548 if a constant value is unaffected. */
2550 /* If the value is extended from a narrower
2551 unsigned type, it doesn't matter whether we
2552 pass it as signed or unsigned; the value
2553 certainly is the same either way. */
2554 else if (TYPE_PRECISION (TREE_TYPE (val)) < TYPE_PRECISION (type)
2555 && TYPE_UNSIGNED (TREE_TYPE (val)))
2557 else if (TYPE_UNSIGNED (type))
2558 warning (OPT_Wconversion, "passing argument %d of %qE "
2559 "as unsigned due to prototype",
2562 warning (OPT_Wconversion, "passing argument %d of %qE "
2563 "as signed due to prototype", argnum, rname);
2567 parmval = convert_for_assignment (type, val, ic_argpass,
2571 if (targetm.calls.promote_prototypes (fundecl ? TREE_TYPE (fundecl) : 0)
2572 && INTEGRAL_TYPE_P (type)
2573 && (TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node)))
2574 parmval = default_conversion (parmval);
2576 result = tree_cons (NULL_TREE, parmval, result);
2578 else if (TREE_CODE (TREE_TYPE (val)) == REAL_TYPE
2579 && (TYPE_PRECISION (TREE_TYPE (val))
2580 < TYPE_PRECISION (double_type_node))
2581 && !DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (val))))
2582 /* Convert `float' to `double'. */
2583 result = tree_cons (NULL_TREE, convert (double_type_node, val), result);
2584 else if ((invalid_func_diag =
2585 targetm.calls.invalid_arg_for_unprototyped_fn (typelist, fundecl, val)))
2587 error (invalid_func_diag, "");
2588 return error_mark_node;
2591 /* Convert `short' and `char' to full-size `int'. */
2592 result = tree_cons (NULL_TREE, default_conversion (val), result);
2595 typetail = TREE_CHAIN (typetail);
2598 if (typetail != 0 && TREE_VALUE (typetail) != void_type_node)
2600 error ("too few arguments to function %qE", function);
2601 return error_mark_node;
2604 return nreverse (result);
2607 /* This is the entry point used by the parser to build unary operators
2608 in the input. CODE, a tree_code, specifies the unary operator, and
2609 ARG is the operand. For unary plus, the C parser currently uses
2610 CONVERT_EXPR for code. */
2613 parser_build_unary_op (enum tree_code code, struct c_expr arg)
2615 struct c_expr result;
2617 result.original_code = ERROR_MARK;
2618 result.value = build_unary_op (code, arg.value, 0);
2620 if (TREE_OVERFLOW_P (result.value) && !TREE_OVERFLOW_P (arg.value))
2621 overflow_warning (result.value);
2626 /* This is the entry point used by the parser to build binary operators
2627 in the input. CODE, a tree_code, specifies the binary operator, and
2628 ARG1 and ARG2 are the operands. In addition to constructing the
2629 expression, we check for operands that were written with other binary
2630 operators in a way that is likely to confuse the user. */
2633 parser_build_binary_op (enum tree_code code, struct c_expr arg1,
2636 struct c_expr result;
2638 enum tree_code code1 = arg1.original_code;
2639 enum tree_code code2 = arg2.original_code;
2641 result.value = build_binary_op (code, arg1.value, arg2.value, 1);
2642 result.original_code = code;
2644 if (TREE_CODE (result.value) == ERROR_MARK)
2647 /* Check for cases such as x+y<<z which users are likely
2649 if (warn_parentheses)
2650 warn_about_parentheses (code, code1, code2);
2652 /* Warn about comparisons against string literals, with the exception
2653 of testing for equality or inequality of a string literal with NULL. */
2654 if (code == EQ_EXPR || code == NE_EXPR)
2656 if ((code1 == STRING_CST && !integer_zerop (arg2.value))
2657 || (code2 == STRING_CST && !integer_zerop (arg1.value)))
2658 warning (OPT_Waddress,
2659 "comparison with string literal results in unspecified behaviour");
2661 else if (TREE_CODE_CLASS (code) == tcc_comparison
2662 && (code1 == STRING_CST || code2 == STRING_CST))
2663 warning (OPT_Waddress,
2664 "comparison with string literal results in unspecified behaviour");
2666 if (TREE_OVERFLOW_P (result.value)
2667 && !TREE_OVERFLOW_P (arg1.value)
2668 && !TREE_OVERFLOW_P (arg2.value))
2669 overflow_warning (result.value);
2674 /* Return a tree for the difference of pointers OP0 and OP1.
2675 The resulting tree has type int. */
2678 pointer_diff (tree op0, tree op1)
2680 tree restype = ptrdiff_type_node;
2682 tree target_type = TREE_TYPE (TREE_TYPE (op0));
2683 tree con0, con1, lit0, lit1;
2684 tree orig_op1 = op1;
2686 if (pedantic || warn_pointer_arith)
2688 if (TREE_CODE (target_type) == VOID_TYPE)
2689 pedwarn ("pointer of type %<void *%> used in subtraction");
2690 if (TREE_CODE (target_type) == FUNCTION_TYPE)
2691 pedwarn ("pointer to a function used in subtraction");
2694 /* If the conversion to ptrdiff_type does anything like widening or
2695 converting a partial to an integral mode, we get a convert_expression
2696 that is in the way to do any simplifications.
2697 (fold-const.c doesn't know that the extra bits won't be needed.
2698 split_tree uses STRIP_SIGN_NOPS, which leaves conversions to a
2699 different mode in place.)
2700 So first try to find a common term here 'by hand'; we want to cover
2701 at least the cases that occur in legal static initializers. */
2702 if ((TREE_CODE (op0) == NOP_EXPR || TREE_CODE (op0) == CONVERT_EXPR)
2703 && (TYPE_PRECISION (TREE_TYPE (op0))
2704 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op0, 0)))))
2705 con0 = TREE_OPERAND (op0, 0);
2708 if ((TREE_CODE (op1) == NOP_EXPR || TREE_CODE (op1) == CONVERT_EXPR)
2709 && (TYPE_PRECISION (TREE_TYPE (op1))
2710 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op1, 0)))))
2711 con1 = TREE_OPERAND (op1, 0);
2715 if (TREE_CODE (con0) == PLUS_EXPR)
2717 lit0 = TREE_OPERAND (con0, 1);
2718 con0 = TREE_OPERAND (con0, 0);
2721 lit0 = integer_zero_node;
2723 if (TREE_CODE (con1) == PLUS_EXPR)
2725 lit1 = TREE_OPERAND (con1, 1);
2726 con1 = TREE_OPERAND (con1, 0);
2729 lit1 = integer_zero_node;
2731 if (operand_equal_p (con0, con1, 0))
2738 /* First do the subtraction as integers;
2739 then drop through to build the divide operator.
2740 Do not do default conversions on the minus operator
2741 in case restype is a short type. */
2743 op0 = build_binary_op (MINUS_EXPR, convert (restype, op0),
2744 convert (restype, op1), 0);
2745 /* This generates an error if op1 is pointer to incomplete type. */
2746 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (TREE_TYPE (orig_op1))))
2747 error ("arithmetic on pointer to an incomplete type");
2749 /* This generates an error if op0 is pointer to incomplete type. */
2750 op1 = c_size_in_bytes (target_type);
2752 /* Divide by the size, in easiest possible way. */
2753 return fold_build2 (EXACT_DIV_EXPR, restype, op0, convert (restype, op1));
2756 /* Construct and perhaps optimize a tree representation
2757 for a unary operation. CODE, a tree_code, specifies the operation
2758 and XARG is the operand.
2759 For any CODE other than ADDR_EXPR, FLAG nonzero suppresses
2760 the default promotions (such as from short to int).
2761 For ADDR_EXPR, the default promotions are not applied; FLAG nonzero
2762 allows non-lvalues; this is only used to handle conversion of non-lvalue
2763 arrays to pointers in C99. */
2766 build_unary_op (enum tree_code code, tree xarg, int flag)
2768 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
2771 enum tree_code typecode = TREE_CODE (TREE_TYPE (arg));
2773 int noconvert = flag;
2774 const char *invalid_op_diag;
2776 if (typecode == ERROR_MARK)
2777 return error_mark_node;
2778 if (typecode == ENUMERAL_TYPE || typecode == BOOLEAN_TYPE)
2779 typecode = INTEGER_TYPE;
2781 if ((invalid_op_diag
2782 = targetm.invalid_unary_op (code, TREE_TYPE (xarg))))
2784 error (invalid_op_diag, "");
2785 return error_mark_node;
2791 /* This is used for unary plus, because a CONVERT_EXPR
2792 is enough to prevent anybody from looking inside for
2793 associativity, but won't generate any code. */
2794 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2795 || typecode == COMPLEX_TYPE
2796 || typecode == VECTOR_TYPE))
2798 error ("wrong type argument to unary plus");
2799 return error_mark_node;
2801 else if (!noconvert)
2802 arg = default_conversion (arg);
2803 arg = non_lvalue (arg);
2807 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2808 || typecode == COMPLEX_TYPE
2809 || typecode == VECTOR_TYPE))
2811 error ("wrong type argument to unary minus");
2812 return error_mark_node;
2814 else if (!noconvert)
2815 arg = default_conversion (arg);
2819 if (typecode == INTEGER_TYPE || typecode == VECTOR_TYPE)
2822 arg = default_conversion (arg);
2824 else if (typecode == COMPLEX_TYPE)
2828 pedwarn ("ISO C does not support %<~%> for complex conjugation");
2830 arg = default_conversion (arg);
2834 error ("wrong type argument to bit-complement");
2835 return error_mark_node;
2840 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE))
2842 error ("wrong type argument to abs");
2843 return error_mark_node;
2845 else if (!noconvert)
2846 arg = default_conversion (arg);
2850 /* Conjugating a real value is a no-op, but allow it anyway. */
2851 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2852 || typecode == COMPLEX_TYPE))
2854 error ("wrong type argument to conjugation");
2855 return error_mark_node;
2857 else if (!noconvert)
2858 arg = default_conversion (arg);
2861 case TRUTH_NOT_EXPR:
2862 if (typecode != INTEGER_TYPE
2863 && typecode != REAL_TYPE && typecode != POINTER_TYPE
2864 && typecode != COMPLEX_TYPE)
2866 error ("wrong type argument to unary exclamation mark");
2867 return error_mark_node;
2869 arg = c_objc_common_truthvalue_conversion (arg);
2870 return invert_truthvalue (arg);
2873 if (TREE_CODE (arg) == COMPLEX_CST)
2874 return TREE_REALPART (arg);
2875 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
2876 return fold_build1 (REALPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg);
2881 if (TREE_CODE (arg) == COMPLEX_CST)
2882 return TREE_IMAGPART (arg);
2883 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
2884 return fold_build1 (IMAGPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg);
2886 return convert (TREE_TYPE (arg), integer_zero_node);
2888 case PREINCREMENT_EXPR:
2889 case POSTINCREMENT_EXPR:
2890 case PREDECREMENT_EXPR:
2891 case POSTDECREMENT_EXPR:
2893 /* Increment or decrement the real part of the value,
2894 and don't change the imaginary part. */
2895 if (typecode == COMPLEX_TYPE)
2900 pedwarn ("ISO C does not support %<++%> and %<--%>"
2901 " on complex types");
2903 arg = stabilize_reference (arg);
2904 real = build_unary_op (REALPART_EXPR, arg, 1);
2905 imag = build_unary_op (IMAGPART_EXPR, arg, 1);
2906 return build2 (COMPLEX_EXPR, TREE_TYPE (arg),
2907 build_unary_op (code, real, 1), imag);
2910 /* Report invalid types. */
2912 if (typecode != POINTER_TYPE
2913 && typecode != INTEGER_TYPE && typecode != REAL_TYPE)
2915 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
2916 error ("wrong type argument to increment");
2918 error ("wrong type argument to decrement");
2920 return error_mark_node;
2925 tree result_type = TREE_TYPE (arg);
2927 arg = get_unwidened (arg, 0);
2928 argtype = TREE_TYPE (arg);
2930 /* Compute the increment. */
2932 if (typecode == POINTER_TYPE)
2934 /* If pointer target is an undefined struct,
2935 we just cannot know how to do the arithmetic. */
2936 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (result_type)))
2938 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
2939 error ("increment of pointer to unknown structure");
2941 error ("decrement of pointer to unknown structure");
2943 else if ((pedantic || warn_pointer_arith)
2944 && (TREE_CODE (TREE_TYPE (result_type)) == FUNCTION_TYPE
2945 || TREE_CODE (TREE_TYPE (result_type)) == VOID_TYPE))
2947 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
2948 pedwarn ("wrong type argument to increment");
2950 pedwarn ("wrong type argument to decrement");
2953 inc = c_size_in_bytes (TREE_TYPE (result_type));
2956 inc = integer_one_node;
2958 inc = convert (argtype, inc);
2960 /* Complain about anything else that is not a true lvalue. */
2961 if (!lvalue_or_else (arg, ((code == PREINCREMENT_EXPR
2962 || code == POSTINCREMENT_EXPR)
2965 return error_mark_node;
2967 /* Report a read-only lvalue. */
2968 if (TREE_READONLY (arg))
2970 readonly_error (arg,
2971 ((code == PREINCREMENT_EXPR
2972 || code == POSTINCREMENT_EXPR)
2973 ? lv_increment : lv_decrement));
2974 return error_mark_node;
2977 if (TREE_CODE (TREE_TYPE (arg)) == BOOLEAN_TYPE)
2978 val = boolean_increment (code, arg);
2980 val = build2 (code, TREE_TYPE (arg), arg, inc);
2981 TREE_SIDE_EFFECTS (val) = 1;
2982 val = convert (result_type, val);
2983 if (TREE_CODE (val) != code)
2984 TREE_NO_WARNING (val) = 1;
2989 /* Note that this operation never does default_conversion. */
2991 /* Let &* cancel out to simplify resulting code. */
2992 if (TREE_CODE (arg) == INDIRECT_REF)
2994 /* Don't let this be an lvalue. */
2995 if (lvalue_p (TREE_OPERAND (arg, 0)))
2996 return non_lvalue (TREE_OPERAND (arg, 0));
2997 return TREE_OPERAND (arg, 0);
3000 /* For &x[y], return x+y */
3001 if (TREE_CODE (arg) == ARRAY_REF)
3003 tree op0 = TREE_OPERAND (arg, 0);
3004 if (!c_mark_addressable (op0))
3005 return error_mark_node;
3006 return build_binary_op (PLUS_EXPR,
3007 (TREE_CODE (TREE_TYPE (op0)) == ARRAY_TYPE
3008 ? array_to_pointer_conversion (op0)
3010 TREE_OPERAND (arg, 1), 1);
3013 /* Anything not already handled and not a true memory reference
3014 or a non-lvalue array is an error. */
3015 else if (typecode != FUNCTION_TYPE && !flag
3016 && !lvalue_or_else (arg, lv_addressof))
3017 return error_mark_node;
3019 /* Ordinary case; arg is a COMPONENT_REF or a decl. */
3020 argtype = TREE_TYPE (arg);
3022 /* If the lvalue is const or volatile, merge that into the type
3023 to which the address will point. Note that you can't get a
3024 restricted pointer by taking the address of something, so we
3025 only have to deal with `const' and `volatile' here. */
3026 if ((DECL_P (arg) || REFERENCE_CLASS_P (arg))
3027 && (TREE_READONLY (arg) || TREE_THIS_VOLATILE (arg)))
3028 argtype = c_build_type_variant (argtype,
3029 TREE_READONLY (arg),
3030 TREE_THIS_VOLATILE (arg));
3032 if (!c_mark_addressable (arg))
3033 return error_mark_node;
3035 gcc_assert (TREE_CODE (arg) != COMPONENT_REF
3036 || !DECL_C_BIT_FIELD (TREE_OPERAND (arg, 1)));
3038 argtype = build_pointer_type (argtype);
3040 /* ??? Cope with user tricks that amount to offsetof. Delete this
3041 when we have proper support for integer constant expressions. */
3042 val = get_base_address (arg);
3043 if (val && TREE_CODE (val) == INDIRECT_REF
3044 && TREE_CONSTANT (TREE_OPERAND (val, 0)))
3046 tree op0 = fold_convert (argtype, fold_offsetof (arg, val)), op1;
3048 op1 = fold_convert (argtype, TREE_OPERAND (val, 0));
3049 return fold_build2 (PLUS_EXPR, argtype, op0, op1);
3052 val = build1 (ADDR_EXPR, argtype, arg);
3061 argtype = TREE_TYPE (arg);
3062 return require_constant_value ? fold_build1_initializer (code, argtype, arg)
3063 : fold_build1 (code, argtype, arg);
3066 /* Return nonzero if REF is an lvalue valid for this language.
3067 Lvalues can be assigned, unless their type has TYPE_READONLY.
3068 Lvalues can have their address taken, unless they have C_DECL_REGISTER. */
3073 enum tree_code code = TREE_CODE (ref);
3080 return lvalue_p (TREE_OPERAND (ref, 0));
3082 case COMPOUND_LITERAL_EXPR:
3092 return (TREE_CODE (TREE_TYPE (ref)) != FUNCTION_TYPE
3093 && TREE_CODE (TREE_TYPE (ref)) != METHOD_TYPE);
3096 return TREE_CODE (TREE_TYPE (ref)) == ARRAY_TYPE;
3103 /* Give an error for storing in something that is 'const'. */
3106 readonly_error (tree arg, enum lvalue_use use)
3108 gcc_assert (use == lv_assign || use == lv_increment || use == lv_decrement
3110 /* Using this macro rather than (for example) arrays of messages
3111 ensures that all the format strings are checked at compile
3113 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
3114 : (use == lv_increment ? (I) \
3115 : (use == lv_decrement ? (D) : (AS))))
3116 if (TREE_CODE (arg) == COMPONENT_REF)
3118 if (TYPE_READONLY (TREE_TYPE (TREE_OPERAND (arg, 0))))
3119 readonly_error (TREE_OPERAND (arg, 0), use);
3121 error (READONLY_MSG (G_("assignment of read-only member %qD"),
3122 G_("increment of read-only member %qD"),
3123 G_("decrement of read-only member %qD"),
3124 G_("read-only member %qD used as %<asm%> output")),
3125 TREE_OPERAND (arg, 1));
3127 else if (TREE_CODE (arg) == VAR_DECL)
3128 error (READONLY_MSG (G_("assignment of read-only variable %qD"),
3129 G_("increment of read-only variable %qD"),
3130 G_("decrement of read-only variable %qD"),
3131 G_("read-only variable %qD used as %<asm%> output")),
3134 error (READONLY_MSG (G_("assignment of read-only location"),
3135 G_("increment of read-only location"),
3136 G_("decrement of read-only location"),
3137 G_("read-only location used as %<asm%> output")));
3141 /* Return nonzero if REF is an lvalue valid for this language;
3142 otherwise, print an error message and return zero. USE says
3143 how the lvalue is being used and so selects the error message. */
3146 lvalue_or_else (tree ref, enum lvalue_use use)
3148 int win = lvalue_p (ref);
3156 /* Mark EXP saying that we need to be able to take the
3157 address of it; it should not be allocated in a register.
3158 Returns true if successful. */
3161 c_mark_addressable (tree exp)
3166 switch (TREE_CODE (x))
3169 if (DECL_C_BIT_FIELD (TREE_OPERAND (x, 1)))
3172 ("cannot take address of bit-field %qD", TREE_OPERAND (x, 1));
3176 /* ... fall through ... */
3182 x = TREE_OPERAND (x, 0);
3185 case COMPOUND_LITERAL_EXPR:
3187 TREE_ADDRESSABLE (x) = 1;
3194 if (C_DECL_REGISTER (x)
3195 && DECL_NONLOCAL (x))
3197 if (TREE_PUBLIC (x) || TREE_STATIC (x) || DECL_EXTERNAL (x))
3200 ("global register variable %qD used in nested function", x);
3203 pedwarn ("register variable %qD used in nested function", x);
3205 else if (C_DECL_REGISTER (x))
3207 if (TREE_PUBLIC (x) || TREE_STATIC (x) || DECL_EXTERNAL (x))
3208 error ("address of global register variable %qD requested", x);
3210 error ("address of register variable %qD requested", x);
3216 TREE_ADDRESSABLE (x) = 1;
3223 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
3226 build_conditional_expr (tree ifexp, tree op1, tree op2)
3230 enum tree_code code1;
3231 enum tree_code code2;
3232 tree result_type = NULL;
3233 tree orig_op1 = op1, orig_op2 = op2;
3235 /* Promote both alternatives. */
3237 if (TREE_CODE (TREE_TYPE (op1)) != VOID_TYPE)
3238 op1 = default_conversion (op1);
3239 if (TREE_CODE (TREE_TYPE (op2)) != VOID_TYPE)
3240 op2 = default_conversion (op2);
3242 if (TREE_CODE (ifexp) == ERROR_MARK
3243 || TREE_CODE (TREE_TYPE (op1)) == ERROR_MARK
3244 || TREE_CODE (TREE_TYPE (op2)) == ERROR_MARK)
3245 return error_mark_node;
3247 type1 = TREE_TYPE (op1);
3248 code1 = TREE_CODE (type1);
3249 type2 = TREE_TYPE (op2);
3250 code2 = TREE_CODE (type2);
3252 /* C90 does not permit non-lvalue arrays in conditional expressions.
3253 In C99 they will be pointers by now. */
3254 if (code1 == ARRAY_TYPE || code2 == ARRAY_TYPE)
3256 error ("non-lvalue array in conditional expression");
3257 return error_mark_node;
3260 /* Quickly detect the usual case where op1 and op2 have the same type
3262 if (TYPE_MAIN_VARIANT (type1) == TYPE_MAIN_VARIANT (type2))
3265 result_type = type1;
3267 result_type = TYPE_MAIN_VARIANT (type1);
3269 else if ((code1 == INTEGER_TYPE || code1 == REAL_TYPE
3270 || code1 == COMPLEX_TYPE)
3271 && (code2 == INTEGER_TYPE || code2 == REAL_TYPE
3272 || code2 == COMPLEX_TYPE))
3274 result_type = c_common_type (type1, type2);
3276 /* If -Wsign-compare, warn here if type1 and type2 have
3277 different signedness. We'll promote the signed to unsigned
3278 and later code won't know it used to be different.
3279 Do this check on the original types, so that explicit casts
3280 will be considered, but default promotions won't. */
3281 if (warn_sign_compare && !skip_evaluation)
3283 int unsigned_op1 = TYPE_UNSIGNED (TREE_TYPE (orig_op1));
3284 int unsigned_op2 = TYPE_UNSIGNED (TREE_TYPE (orig_op2));
3286 if (unsigned_op1 ^ unsigned_op2)
3290 /* Do not warn if the result type is signed, since the
3291 signed type will only be chosen if it can represent
3292 all the values of the unsigned type. */
3293 if (!TYPE_UNSIGNED (result_type))
3295 /* Do not warn if the signed quantity is an unsuffixed
3296 integer literal (or some static constant expression
3297 involving such literals) and it is non-negative. */
3298 else if ((unsigned_op2
3299 && tree_expr_nonnegative_warnv_p (op1, &ovf))
3301 && tree_expr_nonnegative_warnv_p (op2, &ovf)))
3304 warning (0, "signed and unsigned type in conditional expression");
3308 else if (code1 == VOID_TYPE || code2 == VOID_TYPE)
3310 if (pedantic && (code1 != VOID_TYPE || code2 != VOID_TYPE))
3311 pedwarn ("ISO C forbids conditional expr with only one void side");
3312 result_type = void_type_node;
3314 else if (code1 == POINTER_TYPE && code2 == POINTER_TYPE)
3316 if (comp_target_types (type1, type2))
3317 result_type = common_pointer_type (type1, type2);
3318 else if (null_pointer_constant_p (orig_op1))
3319 result_type = qualify_type (type2, type1);
3320 else if (null_pointer_constant_p (orig_op2))
3321 result_type = qualify_type (type1, type2);
3322 else if (VOID_TYPE_P (TREE_TYPE (type1)))
3324 if (pedantic && TREE_CODE (TREE_TYPE (type2)) == FUNCTION_TYPE)
3325 pedwarn ("ISO C forbids conditional expr between "
3326 "%<void *%> and function pointer");
3327 result_type = build_pointer_type (qualify_type (TREE_TYPE (type1),
3328 TREE_TYPE (type2)));
3330 else if (VOID_TYPE_P (TREE_TYPE (type2)))
3332 if (pedantic && TREE_CODE (TREE_TYPE (type1)) == FUNCTION_TYPE)
3333 pedwarn ("ISO C forbids conditional expr between "
3334 "%<void *%> and function pointer");
3335 result_type = build_pointer_type (qualify_type (TREE_TYPE (type2),
3336 TREE_TYPE (type1)));
3340 pedwarn ("pointer type mismatch in conditional expression");
3341 result_type = build_pointer_type (void_type_node);
3344 else if (code1 == POINTER_TYPE && code2 == INTEGER_TYPE)
3346 if (!null_pointer_constant_p (orig_op2))
3347 pedwarn ("pointer/integer type mismatch in conditional expression");
3350 op2 = null_pointer_node;
3352 result_type = type1;
3354 else if (code2 == POINTER_TYPE && code1 == INTEGER_TYPE)
3356 if (!null_pointer_constant_p (orig_op1))
3357 pedwarn ("pointer/integer type mismatch in conditional expression");
3360 op1 = null_pointer_node;
3362 result_type = type2;
3367 if (flag_cond_mismatch)
3368 result_type = void_type_node;
3371 error ("type mismatch in conditional expression");
3372 return error_mark_node;
3376 /* Merge const and volatile flags of the incoming types. */
3378 = build_type_variant (result_type,
3379 TREE_READONLY (op1) || TREE_READONLY (op2),
3380 TREE_THIS_VOLATILE (op1) || TREE_THIS_VOLATILE (op2));
3382 if (result_type != TREE_TYPE (op1))
3383 op1 = convert_and_check (result_type, op1);
3384 if (result_type != TREE_TYPE (op2))
3385 op2 = convert_and_check (result_type, op2);
3387 return fold_build3 (COND_EXPR, result_type, ifexp, op1, op2);
3390 /* Return a compound expression that performs two expressions and
3391 returns the value of the second of them. */
3394 build_compound_expr (tree expr1, tree expr2)
3396 if (!TREE_SIDE_EFFECTS (expr1))
3398 /* The left-hand operand of a comma expression is like an expression
3399 statement: with -Wextra or -Wunused, we should warn if it doesn't have
3400 any side-effects, unless it was explicitly cast to (void). */
3401 if (warn_unused_value)
3403 if (VOID_TYPE_P (TREE_TYPE (expr1))
3404 && (TREE_CODE (expr1) == NOP_EXPR
3405 || TREE_CODE (expr1) == CONVERT_EXPR))
3407 else if (VOID_TYPE_P (TREE_TYPE (expr1))
3408 && TREE_CODE (expr1) == COMPOUND_EXPR
3409 && (TREE_CODE (TREE_OPERAND (expr1, 1)) == CONVERT_EXPR
3410 || TREE_CODE (TREE_OPERAND (expr1, 1)) == NOP_EXPR))
3411 ; /* (void) a, (void) b, c */
3413 warning (0, "left-hand operand of comma expression has no effect");
3417 /* With -Wunused, we should also warn if the left-hand operand does have
3418 side-effects, but computes a value which is not used. For example, in
3419 `foo() + bar(), baz()' the result of the `+' operator is not used,
3420 so we should issue a warning. */
3421 else if (warn_unused_value)
3422 warn_if_unused_value (expr1, input_location);
3424 if (expr2 == error_mark_node)
3425 return error_mark_node;
3427 return build2 (COMPOUND_EXPR, TREE_TYPE (expr2), expr1, expr2);
3430 /* Build an expression representing a cast to type TYPE of expression EXPR. */
3433 build_c_cast (tree type, tree expr)
3437 if (type == error_mark_node || expr == error_mark_node)
3438 return error_mark_node;
3440 /* The ObjC front-end uses TYPE_MAIN_VARIANT to tie together types differing
3441 only in <protocol> qualifications. But when constructing cast expressions,
3442 the protocols do matter and must be kept around. */
3443 if (objc_is_object_ptr (type) && objc_is_object_ptr (TREE_TYPE (expr)))
3444 return build1 (NOP_EXPR, type, expr);
3446 type = TYPE_MAIN_VARIANT (type);
3448 if (TREE_CODE (type) == ARRAY_TYPE)
3450 error ("cast specifies array type");
3451 return error_mark_node;
3454 if (TREE_CODE (type) == FUNCTION_TYPE)
3456 error ("cast specifies function type");
3457 return error_mark_node;
3460 if (type == TYPE_MAIN_VARIANT (TREE_TYPE (value)))
3464 if (TREE_CODE (type) == RECORD_TYPE
3465 || TREE_CODE (type) == UNION_TYPE)
3466 pedwarn ("ISO C forbids casting nonscalar to the same type");
3469 else if (TREE_CODE (type) == UNION_TYPE)
3473 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
3474 if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (field)),
3475 TYPE_MAIN_VARIANT (TREE_TYPE (value))))
3483 pedwarn ("ISO C forbids casts to union type");
3484 t = digest_init (type,
3485 build_constructor_single (type, field, value),
3487 TREE_CONSTANT (t) = TREE_CONSTANT (value);
3488 TREE_INVARIANT (t) = TREE_INVARIANT (value);
3491 error ("cast to union type from type not present in union");
3492 return error_mark_node;
3498 if (type == void_type_node)
3499 return build1 (CONVERT_EXPR, type, value);
3501 otype = TREE_TYPE (value);
3503 /* Optionally warn about potentially worrisome casts. */
3506 && TREE_CODE (type) == POINTER_TYPE
3507 && TREE_CODE (otype) == POINTER_TYPE)
3509 tree in_type = type;
3510 tree in_otype = otype;
3514 /* Check that the qualifiers on IN_TYPE are a superset of
3515 the qualifiers of IN_OTYPE. The outermost level of
3516 POINTER_TYPE nodes is uninteresting and we stop as soon
3517 as we hit a non-POINTER_TYPE node on either type. */
3520 in_otype = TREE_TYPE (in_otype);
3521 in_type = TREE_TYPE (in_type);
3523 /* GNU C allows cv-qualified function types. 'const'
3524 means the function is very pure, 'volatile' means it
3525 can't return. We need to warn when such qualifiers
3526 are added, not when they're taken away. */
3527 if (TREE_CODE (in_otype) == FUNCTION_TYPE
3528 && TREE_CODE (in_type) == FUNCTION_TYPE)
3529 added |= (TYPE_QUALS (in_type) & ~TYPE_QUALS (in_otype));
3531 discarded |= (TYPE_QUALS (in_otype) & ~TYPE_QUALS (in_type));
3533 while (TREE_CODE (in_type) == POINTER_TYPE
3534 && TREE_CODE (in_otype) == POINTER_TYPE);
3537 warning (0, "cast adds new qualifiers to function type");
3540 /* There are qualifiers present in IN_OTYPE that are not
3541 present in IN_TYPE. */
3542 warning (0, "cast discards qualifiers from pointer target type");
3545 /* Warn about possible alignment problems. */
3546 if (STRICT_ALIGNMENT
3547 && TREE_CODE (type) == POINTER_TYPE
3548 && TREE_CODE (otype) == POINTER_TYPE
3549 && TREE_CODE (TREE_TYPE (otype)) != VOID_TYPE
3550 && TREE_CODE (TREE_TYPE (otype)) != FUNCTION_TYPE
3551 /* Don't warn about opaque types, where the actual alignment
3552 restriction is unknown. */
3553 && !((TREE_CODE (TREE_TYPE (otype)) == UNION_TYPE
3554 || TREE_CODE (TREE_TYPE (otype)) == RECORD_TYPE)
3555 && TYPE_MODE (TREE_TYPE (otype)) == VOIDmode)
3556 && TYPE_ALIGN (TREE_TYPE (type)) > TYPE_ALIGN (TREE_TYPE (otype)))
3557 warning (OPT_Wcast_align,
3558 "cast increases required alignment of target type");
3560 if (TREE_CODE (type) == INTEGER_TYPE
3561 && TREE_CODE (otype) == POINTER_TYPE
3562 && TYPE_PRECISION (type) != TYPE_PRECISION (otype))
3563 /* Unlike conversion of integers to pointers, where the
3564 warning is disabled for converting constants because
3565 of cases such as SIG_*, warn about converting constant
3566 pointers to integers. In some cases it may cause unwanted
3567 sign extension, and a warning is appropriate. */
3568 warning (OPT_Wpointer_to_int_cast,
3569 "cast from pointer to integer of different size");
3571 if (TREE_CODE (value) == CALL_EXPR
3572 && TREE_CODE (type) != TREE_CODE (otype))
3573 warning (OPT_Wbad_function_cast, "cast from function call of type %qT "
3574 "to non-matching type %qT", otype, type);
3576 if (TREE_CODE (type) == POINTER_TYPE
3577 && TREE_CODE (otype) == INTEGER_TYPE
3578 && TYPE_PRECISION (type) != TYPE_PRECISION (otype)
3579 /* Don't warn about converting any constant. */
3580 && !TREE_CONSTANT (value))
3581 warning (OPT_Wint_to_pointer_cast, "cast to pointer from integer "
3582 "of different size");
3584 if (warn_strict_aliasing <= 2)
3585 strict_aliasing_warning (otype, type, expr);
3587 /* If pedantic, warn for conversions between function and object
3588 pointer types, except for converting a null pointer constant
3589 to function pointer type. */
3591 && TREE_CODE (type) == POINTER_TYPE
3592 && TREE_CODE (otype) == POINTER_TYPE
3593 && TREE_CODE (TREE_TYPE (otype)) == FUNCTION_TYPE
3594 && TREE_CODE (TREE_TYPE (type)) != FUNCTION_TYPE)
3595 pedwarn ("ISO C forbids conversion of function pointer to object pointer type");
3598 && TREE_CODE (type) == POINTER_TYPE
3599 && TREE_CODE (otype) == POINTER_TYPE
3600 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE
3601 && TREE_CODE (TREE_TYPE (otype)) != FUNCTION_TYPE
3602 && !null_pointer_constant_p (value))
3603 pedwarn ("ISO C forbids conversion of object pointer to function pointer type");
3606 value = convert (type, value);
3608 /* Ignore any integer overflow caused by the cast. */
3609 if (TREE_CODE (value) == INTEGER_CST)
3611 if (CONSTANT_CLASS_P (ovalue)
3612 && (TREE_OVERFLOW (ovalue) || TREE_CONSTANT_OVERFLOW (ovalue)))
3614 /* Avoid clobbering a shared constant. */
3615 value = copy_node (value);
3616 TREE_OVERFLOW (value) = TREE_OVERFLOW (ovalue);
3617 TREE_CONSTANT_OVERFLOW (value) = TREE_CONSTANT_OVERFLOW (ovalue);
3619 else if (TREE_OVERFLOW (value) || TREE_CONSTANT_OVERFLOW (value))
3620 /* Reset VALUE's overflow flags, ensuring constant sharing. */
3621 value = build_int_cst_wide (TREE_TYPE (value),
3622 TREE_INT_CST_LOW (value),
3623 TREE_INT_CST_HIGH (value));
3627 /* Don't let a cast be an lvalue. */
3629 value = non_lvalue (value);
3634 /* Interpret a cast of expression EXPR to type TYPE. */
3636 c_cast_expr (struct c_type_name *type_name, tree expr)
3639 int saved_wsp = warn_strict_prototypes;
3641 /* This avoids warnings about unprototyped casts on
3642 integers. E.g. "#define SIG_DFL (void(*)())0". */
3643 if (TREE_CODE (expr) == INTEGER_CST)
3644 warn_strict_prototypes = 0;
3645 type = groktypename (type_name);
3646 warn_strict_prototypes = saved_wsp;
3648 return build_c_cast (type, expr);
3651 /* Build an assignment expression of lvalue LHS from value RHS.
3652 MODIFYCODE is the code for a binary operator that we use
3653 to combine the old value of LHS with RHS to get the new value.
3654 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment. */
3657 build_modify_expr (tree lhs, enum tree_code modifycode, tree rhs)
3661 tree lhstype = TREE_TYPE (lhs);
3662 tree olhstype = lhstype;
3664 /* Types that aren't fully specified cannot be used in assignments. */
3665 lhs = require_complete_type (lhs);
3667 /* Avoid duplicate error messages from operands that had errors. */
3668 if (TREE_CODE (lhs) == ERROR_MARK || TREE_CODE (rhs) == ERROR_MARK)
3669 return error_mark_node;
3671 if (!lvalue_or_else (lhs, lv_assign))
3672 return error_mark_node;
3674 STRIP_TYPE_NOPS (rhs);
3678 /* If a binary op has been requested, combine the old LHS value with the RHS
3679 producing the value we should actually store into the LHS. */
3681 if (modifycode != NOP_EXPR)
3683 lhs = stabilize_reference (lhs);
3684 newrhs = build_binary_op (modifycode, lhs, rhs, 1);
3687 /* Give an error for storing in something that is 'const'. */
3689 if (TREE_READONLY (lhs) || TYPE_READONLY (lhstype)
3690 || ((TREE_CODE (lhstype) == RECORD_TYPE
3691 || TREE_CODE (lhstype) == UNION_TYPE)
3692 && C_TYPE_FIELDS_READONLY (lhstype)))
3694 readonly_error (lhs, lv_assign);
3695 return error_mark_node;
3698 /* If storing into a structure or union member,
3699 it has probably been given type `int'.
3700 Compute the type that would go with
3701 the actual amount of storage the member occupies. */
3703 if (TREE_CODE (lhs) == COMPONENT_REF
3704 && (TREE_CODE (lhstype) == INTEGER_TYPE
3705 || TREE_CODE (lhstype) == BOOLEAN_TYPE
3706 || TREE_CODE (lhstype) == REAL_TYPE
3707 || TREE_CODE (lhstype) == ENUMERAL_TYPE))
3708 lhstype = TREE_TYPE (get_unwidened (lhs, 0));
3710 /* If storing in a field that is in actuality a short or narrower than one,
3711 we must store in the field in its actual type. */
3713 if (lhstype != TREE_TYPE (lhs))
3715 lhs = copy_node (lhs);
3716 TREE_TYPE (lhs) = lhstype;
3719 /* Convert new value to destination type. */
3721 newrhs = convert_for_assignment (lhstype, newrhs, ic_assign,
3722 NULL_TREE, NULL_TREE, 0);
3723 if (TREE_CODE (newrhs) == ERROR_MARK)
3724 return error_mark_node;
3726 /* Emit ObjC write barrier, if necessary. */
3727 if (c_dialect_objc () && flag_objc_gc)
3729 result = objc_generate_write_barrier (lhs, modifycode, newrhs);
3734 /* Scan operands. */
3736 result = build2 (MODIFY_EXPR, lhstype, lhs, newrhs);
3737 TREE_SIDE_EFFECTS (result) = 1;
3739 /* If we got the LHS in a different type for storing in,
3740 convert the result back to the nominal type of LHS
3741 so that the value we return always has the same type
3742 as the LHS argument. */
3744 if (olhstype == TREE_TYPE (result))
3746 return convert_for_assignment (olhstype, result, ic_assign,
3747 NULL_TREE, NULL_TREE, 0);
3750 /* Convert value RHS to type TYPE as preparation for an assignment
3751 to an lvalue of type TYPE.
3752 The real work of conversion is done by `convert'.
3753 The purpose of this function is to generate error messages
3754 for assignments that are not allowed in C.
3755 ERRTYPE says whether it is argument passing, assignment,
3756 initialization or return.
3758 FUNCTION is a tree for the function being called.
3759 PARMNUM is the number of the argument, for printing in error messages. */
3762 convert_for_assignment (tree type, tree rhs, enum impl_conv errtype,
3763 tree fundecl, tree function, int parmnum)
3765 enum tree_code codel = TREE_CODE (type);
3767 enum tree_code coder;
3768 tree rname = NULL_TREE;
3769 bool objc_ok = false;
3771 if (errtype == ic_argpass || errtype == ic_argpass_nonproto)
3774 /* Change pointer to function to the function itself for
3776 if (TREE_CODE (function) == ADDR_EXPR
3777 && TREE_CODE (TREE_OPERAND (function, 0)) == FUNCTION_DECL)
3778 function = TREE_OPERAND (function, 0);
3780 /* Handle an ObjC selector specially for diagnostics. */
3781 selector = objc_message_selector ();
3783 if (selector && parmnum > 2)
3790 /* This macro is used to emit diagnostics to ensure that all format
3791 strings are complete sentences, visible to gettext and checked at
3793 #define WARN_FOR_ASSIGNMENT(AR, AS, IN, RE) \
3798 pedwarn (AR, parmnum, rname); \
3800 case ic_argpass_nonproto: \
3801 warning (0, AR, parmnum, rname); \
3813 gcc_unreachable (); \
3817 STRIP_TYPE_NOPS (rhs);
3819 if (optimize && TREE_CODE (rhs) == VAR_DECL
3820 && TREE_CODE (TREE_TYPE (rhs)) != ARRAY_TYPE)
3821 rhs = decl_constant_value_for_broken_optimization (rhs);
3823 rhstype = TREE_TYPE (rhs);
3824 coder = TREE_CODE (rhstype);
3826 if (coder == ERROR_MARK)
3827 return error_mark_node;
3829 if (c_dialect_objc ())
3852 objc_ok = objc_compare_types (type, rhstype, parmno, rname);
3855 if (TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (rhstype))
3858 if (coder == VOID_TYPE)
3860 /* Except for passing an argument to an unprototyped function,
3861 this is a constraint violation. When passing an argument to
3862 an unprototyped function, it is compile-time undefined;
3863 making it a constraint in that case was rejected in
3865 error ("void value not ignored as it ought to be");
3866 return error_mark_node;
3868 /* A type converts to a reference to it.
3869 This code doesn't fully support references, it's just for the
3870 special case of va_start and va_copy. */
3871 if (codel == REFERENCE_TYPE
3872 && comptypes (TREE_TYPE (type), TREE_TYPE (rhs)) == 1)
3874 if (!lvalue_p (rhs))
3876 error ("cannot pass rvalue to reference parameter");
3877 return error_mark_node;
3879 if (!c_mark_addressable (rhs))
3880 return error_mark_node;
3881 rhs = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (rhs)), rhs);
3883 /* We already know that these two types are compatible, but they
3884 may not be exactly identical. In fact, `TREE_TYPE (type)' is
3885 likely to be __builtin_va_list and `TREE_TYPE (rhs)' is
3886 likely to be va_list, a typedef to __builtin_va_list, which
3887 is different enough that it will cause problems later. */
3888 if (TREE_TYPE (TREE_TYPE (rhs)) != TREE_TYPE (type))
3889 rhs = build1 (NOP_EXPR, build_pointer_type (TREE_TYPE (type)), rhs);
3891 rhs = build1 (NOP_EXPR, type, rhs);
3894 /* Some types can interconvert without explicit casts. */
3895 else if (codel == VECTOR_TYPE && coder == VECTOR_TYPE
3896 && vector_types_convertible_p (type, TREE_TYPE (rhs)))
3897 return convert (type, rhs);
3898 /* Arithmetic types all interconvert, and enum is treated like int. */
3899 else if ((codel == INTEGER_TYPE || codel == REAL_TYPE
3900 || codel == ENUMERAL_TYPE || codel == COMPLEX_TYPE
3901 || codel == BOOLEAN_TYPE)
3902 && (coder == INTEGER_TYPE || coder == REAL_TYPE
3903 || coder == ENUMERAL_TYPE || coder == COMPLEX_TYPE
3904 || coder == BOOLEAN_TYPE))
3905 return convert_and_check (type, rhs);
3907 /* Aggregates in different TUs might need conversion. */
3908 if ((codel == RECORD_TYPE || codel == UNION_TYPE)
3910 && comptypes (type, rhstype))
3911 return convert_and_check (type, rhs);
3913 /* Conversion to a transparent union from its member types.
3914 This applies only to function arguments. */
3915 if (codel == UNION_TYPE && TYPE_TRANSPARENT_UNION (type)
3916 && (errtype == ic_argpass || errtype == ic_argpass_nonproto))
3918 tree memb, marginal_memb = NULL_TREE;
3920 for (memb = TYPE_FIELDS (type); memb ; memb = TREE_CHAIN (memb))
3922 tree memb_type = TREE_TYPE (memb);
3924 if (comptypes (TYPE_MAIN_VARIANT (memb_type),
3925 TYPE_MAIN_VARIANT (rhstype)))
3928 if (TREE_CODE (memb_type) != POINTER_TYPE)
3931 if (coder == POINTER_TYPE)
3933 tree ttl = TREE_TYPE (memb_type);
3934 tree ttr = TREE_TYPE (rhstype);
3936 /* Any non-function converts to a [const][volatile] void *
3937 and vice versa; otherwise, targets must be the same.
3938 Meanwhile, the lhs target must have all the qualifiers of
3940 if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
3941 || comp_target_types (memb_type, rhstype))
3943 /* If this type won't generate any warnings, use it. */
3944 if (TYPE_QUALS (ttl) == TYPE_QUALS (ttr)
3945 || ((TREE_CODE (ttr) == FUNCTION_TYPE
3946 && TREE_CODE (ttl) == FUNCTION_TYPE)
3947 ? ((TYPE_QUALS (ttl) | TYPE_QUALS (ttr))
3948 == TYPE_QUALS (ttr))
3949 : ((TYPE_QUALS (ttl) | TYPE_QUALS (ttr))
3950 == TYPE_QUALS (ttl))))
3953 /* Keep looking for a better type, but remember this one. */
3955 marginal_memb = memb;
3959 /* Can convert integer zero to any pointer type. */
3960 if (null_pointer_constant_p (rhs))
3962 rhs = null_pointer_node;
3967 if (memb || marginal_memb)
3971 /* We have only a marginally acceptable member type;
3972 it needs a warning. */
3973 tree ttl = TREE_TYPE (TREE_TYPE (marginal_memb));
3974 tree ttr = TREE_TYPE (rhstype);
3976 /* Const and volatile mean something different for function
3977 types, so the usual warnings are not appropriate. */
3978 if (TREE_CODE (ttr) == FUNCTION_TYPE
3979 && TREE_CODE (ttl) == FUNCTION_TYPE)
3981 /* Because const and volatile on functions are
3982 restrictions that say the function will not do
3983 certain things, it is okay to use a const or volatile
3984 function where an ordinary one is wanted, but not
3986 if (TYPE_QUALS (ttl) & ~TYPE_QUALS (ttr))
3987 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE "
3988 "makes qualified function "
3989 "pointer from unqualified"),
3990 G_("assignment makes qualified "
3991 "function pointer from "
3993 G_("initialization makes qualified "
3994 "function pointer from "
3996 G_("return makes qualified function "
3997 "pointer from unqualified"));
3999 else if (TYPE_QUALS (ttr) & ~TYPE_QUALS (ttl))
4000 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE discards "
4001 "qualifiers from pointer target type"),
4002 G_("assignment discards qualifiers "
4003 "from pointer target type"),
4004 G_("initialization discards qualifiers "
4005 "from pointer target type"),
4006 G_("return discards qualifiers from "
4007 "pointer target type"));
4009 memb = marginal_memb;
4012 if (pedantic && (!fundecl || !DECL_IN_SYSTEM_HEADER (fundecl)))
4013 pedwarn ("ISO C prohibits argument conversion to union type");
4015 return build_constructor_single (type, memb, rhs);
4019 /* Conversions among pointers */
4020 else if ((codel == POINTER_TYPE || codel == REFERENCE_TYPE)
4021 && (coder == codel))
4023 tree ttl = TREE_TYPE (type);
4024 tree ttr = TREE_TYPE (rhstype);
4027 bool is_opaque_pointer;
4028 int target_cmp = 0; /* Cache comp_target_types () result. */
4030 if (TREE_CODE (mvl) != ARRAY_TYPE)
4031 mvl = TYPE_MAIN_VARIANT (mvl);
4032 if (TREE_CODE (mvr) != ARRAY_TYPE)
4033 mvr = TYPE_MAIN_VARIANT (mvr);
4034 /* Opaque pointers are treated like void pointers. */
4035 is_opaque_pointer = (targetm.vector_opaque_p (type)
4036 || targetm.vector_opaque_p (rhstype))
4037 && TREE_CODE (ttl) == VECTOR_TYPE
4038 && TREE_CODE (ttr) == VECTOR_TYPE;
4040 /* C++ does not allow the implicit conversion void* -> T*. However,
4041 for the purpose of reducing the number of false positives, we
4042 tolerate the special case of
4046 where NULL is typically defined in C to be '(void *) 0'. */
4047 if (VOID_TYPE_P (ttr) && rhs != null_pointer_node && !VOID_TYPE_P (ttl))
4048 warning (OPT_Wc___compat, "request for implicit conversion from "
4049 "%qT to %qT not permitted in C++", rhstype, type);
4051 /* Check if the right-hand side has a format attribute but the
4052 left-hand side doesn't. */
4053 if (warn_missing_format_attribute
4054 && check_missing_format_attribute (type, rhstype))
4059 case ic_argpass_nonproto:
4060 warning (OPT_Wmissing_format_attribute,
4061 "argument %d of %qE might be "
4062 "a candidate for a format attribute",
4066 warning (OPT_Wmissing_format_attribute,
4067 "assignment left-hand side might be "
4068 "a candidate for a format attribute");
4071 warning (OPT_Wmissing_format_attribute,
4072 "initialization left-hand side might be "
4073 "a candidate for a format attribute");
4076 warning (OPT_Wmissing_format_attribute,
4077 "return type might be "
4078 "a candidate for a format attribute");
4085 /* Any non-function converts to a [const][volatile] void *
4086 and vice versa; otherwise, targets must be the same.
4087 Meanwhile, the lhs target must have all the qualifiers of the rhs. */
4088 if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
4089 || (target_cmp = comp_target_types (type, rhstype))
4090 || is_opaque_pointer
4091 || (c_common_unsigned_type (mvl)
4092 == c_common_unsigned_type (mvr)))
4095 && ((VOID_TYPE_P (ttl) && TREE_CODE (ttr) == FUNCTION_TYPE)
4098 && !null_pointer_constant_p (rhs)
4099 && TREE_CODE (ttl) == FUNCTION_TYPE)))
4100 WARN_FOR_ASSIGNMENT (G_("ISO C forbids passing argument %d of "
4101 "%qE between function pointer "
4103 G_("ISO C forbids assignment between "
4104 "function pointer and %<void *%>"),
4105 G_("ISO C forbids initialization between "
4106 "function pointer and %<void *%>"),
4107 G_("ISO C forbids return between function "
4108 "pointer and %<void *%>"));
4109 /* Const and volatile mean something different for function types,
4110 so the usual warnings are not appropriate. */
4111 else if (TREE_CODE (ttr) != FUNCTION_TYPE
4112 && TREE_CODE (ttl) != FUNCTION_TYPE)
4114 if (TYPE_QUALS (ttr) & ~TYPE_QUALS (ttl))
4116 /* Types differing only by the presence of the 'volatile'
4117 qualifier are acceptable if the 'volatile' has been added
4118 in by the Objective-C EH machinery. */
4119 if (!objc_type_quals_match (ttl, ttr))
4120 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE discards "
4121 "qualifiers from pointer target type"),
4122 G_("assignment discards qualifiers "
4123 "from pointer target type"),
4124 G_("initialization discards qualifiers "
4125 "from pointer target type"),
4126 G_("return discards qualifiers from "
4127 "pointer target type"));
4129 /* If this is not a case of ignoring a mismatch in signedness,
4131 else if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
4134 /* If there is a mismatch, do warn. */
4135 else if (warn_pointer_sign)
4136 WARN_FOR_ASSIGNMENT (G_("pointer targets in passing argument "
4137 "%d of %qE differ in signedness"),
4138 G_("pointer targets in assignment "
4139 "differ in signedness"),
4140 G_("pointer targets in initialization "
4141 "differ in signedness"),
4142 G_("pointer targets in return differ "
4145 else if (TREE_CODE (ttl) == FUNCTION_TYPE
4146 && TREE_CODE (ttr) == FUNCTION_TYPE)
4148 /* Because const and volatile on functions are restrictions
4149 that say the function will not do certain things,
4150 it is okay to use a const or volatile function
4151 where an ordinary one is wanted, but not vice-versa. */
4152 if (TYPE_QUALS (ttl) & ~TYPE_QUALS (ttr))
4153 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE makes "
4154 "qualified function pointer "
4155 "from unqualified"),
4156 G_("assignment makes qualified function "
4157 "pointer from unqualified"),
4158 G_("initialization makes qualified "
4159 "function pointer from unqualified"),
4160 G_("return makes qualified function "
4161 "pointer from unqualified"));
4165 /* Avoid warning about the volatile ObjC EH puts on decls. */
4167 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE from "
4168 "incompatible pointer type"),
4169 G_("assignment from incompatible pointer type"),
4170 G_("initialization from incompatible "
4172 G_("return from incompatible pointer type"));
4174 return convert (type, rhs);
4176 else if (codel == POINTER_TYPE && coder == ARRAY_TYPE)
4178 /* ??? This should not be an error when inlining calls to
4179 unprototyped functions. */
4180 error ("invalid use of non-lvalue array");
4181 return error_mark_node;
4183 else if (codel == POINTER_TYPE && coder == INTEGER_TYPE)
4185 /* An explicit constant 0 can convert to a pointer,
4186 or one that results from arithmetic, even including
4187 a cast to integer type. */
4188 if (!null_pointer_constant_p (rhs))
4189 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE makes "
4190 "pointer from integer without a cast"),
4191 G_("assignment makes pointer from integer "
4193 G_("initialization makes pointer from "
4194 "integer without a cast"),
4195 G_("return makes pointer from integer "
4198 return convert (type, rhs);
4200 else if (codel == INTEGER_TYPE && coder == POINTER_TYPE)
4202 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE makes integer "
4203 "from pointer without a cast"),
4204 G_("assignment makes integer from pointer "
4206 G_("initialization makes integer from pointer "
4208 G_("return makes integer from pointer "
4210 return convert (type, rhs);
4212 else if (codel == BOOLEAN_TYPE && coder == POINTER_TYPE)
4213 return convert (type, rhs);
4218 case ic_argpass_nonproto:
4219 /* ??? This should not be an error when inlining calls to
4220 unprototyped functions. */
4221 error ("incompatible type for argument %d of %qE", parmnum, rname);
4224 error ("incompatible types in assignment");
4227 error ("incompatible types in initialization");
4230 error ("incompatible types in return");
4236 return error_mark_node;
4239 /* Convert VALUE for assignment into inlined parameter PARM. ARGNUM
4240 is used for error and warning reporting and indicates which argument
4241 is being processed. */
4244 c_convert_parm_for_inlining (tree parm, tree value, tree fn, int argnum)
4248 /* If FN was prototyped at the call site, the value has been converted
4249 already in convert_arguments.
4250 However, we might see a prototype now that was not in place when
4251 the function call was seen, so check that the VALUE actually matches
4252 PARM before taking an early exit. */
4254 || (TYPE_ARG_TYPES (TREE_TYPE (fn))
4255 && (TYPE_MAIN_VARIANT (TREE_TYPE (parm))
4256 == TYPE_MAIN_VARIANT (TREE_TYPE (value)))))
4259 type = TREE_TYPE (parm);
4260 ret = convert_for_assignment (type, value,
4261 ic_argpass_nonproto, fn,
4263 if (targetm.calls.promote_prototypes (TREE_TYPE (fn))
4264 && INTEGRAL_TYPE_P (type)
4265 && (TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node)))
4266 ret = default_conversion (ret);
4270 /* If VALUE is a compound expr all of whose expressions are constant, then
4271 return its value. Otherwise, return error_mark_node.
4273 This is for handling COMPOUND_EXPRs as initializer elements
4274 which is allowed with a warning when -pedantic is specified. */
4277 valid_compound_expr_initializer (tree value, tree endtype)
4279 if (TREE_CODE (value) == COMPOUND_EXPR)
4281 if (valid_compound_expr_initializer (TREE_OPERAND (value, 0), endtype)
4283 return error_mark_node;
4284 return valid_compound_expr_initializer (TREE_OPERAND (value, 1),
4287 else if (!initializer_constant_valid_p (value, endtype))
4288 return error_mark_node;
4293 /* Perform appropriate conversions on the initial value of a variable,
4294 store it in the declaration DECL,
4295 and print any error messages that are appropriate.
4296 If the init is invalid, store an ERROR_MARK. */
4299 store_init_value (tree decl, tree init)
4303 /* If variable's type was invalidly declared, just ignore it. */
4305 type = TREE_TYPE (decl);
4306 if (TREE_CODE (type) == ERROR_MARK)
4309 /* Digest the specified initializer into an expression. */
4311 value = digest_init (type, init, true, TREE_STATIC (decl));
4313 /* Store the expression if valid; else report error. */
4315 if (!in_system_header
4316 && AGGREGATE_TYPE_P (TREE_TYPE (decl)) && !TREE_STATIC (decl))
4317 warning (OPT_Wtraditional, "traditional C rejects automatic "
4318 "aggregate initialization");
4320 DECL_INITIAL (decl) = value;
4322 /* ANSI wants warnings about out-of-range constant initializers. */
4323 STRIP_TYPE_NOPS (value);
4324 constant_expression_warning (value);
4326 /* Check if we need to set array size from compound literal size. */
4327 if (TREE_CODE (type) == ARRAY_TYPE
4328 && TYPE_DOMAIN (type) == 0
4329 && value != error_mark_node)
4331 tree inside_init = init;
4333 STRIP_TYPE_NOPS (inside_init);
4334 inside_init = fold (inside_init);
4336 if (TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
4338 tree cldecl = COMPOUND_LITERAL_EXPR_DECL (inside_init);
4340 if (TYPE_DOMAIN (TREE_TYPE (cldecl)))
4342 /* For int foo[] = (int [3]){1}; we need to set array size
4343 now since later on array initializer will be just the
4344 brace enclosed list of the compound literal. */
4345 type = build_distinct_type_copy (TYPE_MAIN_VARIANT (type));
4346 TREE_TYPE (decl) = type;
4347 TYPE_DOMAIN (type) = TYPE_DOMAIN (TREE_TYPE (cldecl));
4349 layout_decl (cldecl, 0);
4355 /* Methods for storing and printing names for error messages. */
4357 /* Implement a spelling stack that allows components of a name to be pushed
4358 and popped. Each element on the stack is this structure. */
4365 unsigned HOST_WIDE_INT i;
4370 #define SPELLING_STRING 1
4371 #define SPELLING_MEMBER 2
4372 #define SPELLING_BOUNDS 3
4374 static struct spelling *spelling; /* Next stack element (unused). */
4375 static struct spelling *spelling_base; /* Spelling stack base. */
4376 static int spelling_size; /* Size of the spelling stack. */
4378 /* Macros to save and restore the spelling stack around push_... functions.
4379 Alternative to SAVE_SPELLING_STACK. */
4381 #define SPELLING_DEPTH() (spelling - spelling_base)
4382 #define RESTORE_SPELLING_DEPTH(DEPTH) (spelling = spelling_base + (DEPTH))
4384 /* Push an element on the spelling stack with type KIND and assign VALUE
4387 #define PUSH_SPELLING(KIND, VALUE, MEMBER) \
4389 int depth = SPELLING_DEPTH (); \
4391 if (depth >= spelling_size) \
4393 spelling_size += 10; \
4394 spelling_base = XRESIZEVEC (struct spelling, spelling_base, \
4396 RESTORE_SPELLING_DEPTH (depth); \
4399 spelling->kind = (KIND); \
4400 spelling->MEMBER = (VALUE); \
4404 /* Push STRING on the stack. Printed literally. */
4407 push_string (const char *string)
4409 PUSH_SPELLING (SPELLING_STRING, string, u.s);
4412 /* Push a member name on the stack. Printed as '.' STRING. */
4415 push_member_name (tree decl)
4417 const char *const string
4418 = DECL_NAME (decl) ? IDENTIFIER_POINTER (DECL_NAME (decl)) : "<anonymous>";
4419 PUSH_SPELLING (SPELLING_MEMBER, string, u.s);
4422 /* Push an array bounds on the stack. Printed as [BOUNDS]. */
4425 push_array_bounds (unsigned HOST_WIDE_INT bounds)
4427 PUSH_SPELLING (SPELLING_BOUNDS, bounds, u.i);
4430 /* Compute the maximum size in bytes of the printed spelling. */
4433 spelling_length (void)
4438 for (p = spelling_base; p < spelling; p++)
4440 if (p->kind == SPELLING_BOUNDS)
4443 size += strlen (p->u.s) + 1;
4449 /* Print the spelling to BUFFER and return it. */
4452 print_spelling (char *buffer)
4457 for (p = spelling_base; p < spelling; p++)
4458 if (p->kind == SPELLING_BOUNDS)
4460 sprintf (d, "[" HOST_WIDE_INT_PRINT_UNSIGNED "]", p->u.i);
4466 if (p->kind == SPELLING_MEMBER)
4468 for (s = p->u.s; (*d = *s++); d++)
4475 /* Issue an error message for a bad initializer component.
4476 MSGID identifies the message.
4477 The component name is taken from the spelling stack. */
4480 error_init (const char *msgid)
4484 error ("%s", _(msgid));
4485 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4487 error ("(near initialization for %qs)", ofwhat);
4490 /* Issue a pedantic warning for a bad initializer component.
4491 MSGID identifies the message.
4492 The component name is taken from the spelling stack. */
4495 pedwarn_init (const char *msgid)
4499 pedwarn ("%s", _(msgid));
4500 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4502 pedwarn ("(near initialization for %qs)", ofwhat);
4505 /* Issue a warning for a bad initializer component.
4506 MSGID identifies the message.
4507 The component name is taken from the spelling stack. */
4510 warning_init (const char *msgid)
4514 warning (0, "%s", _(msgid));
4515 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4517 warning (0, "(near initialization for %qs)", ofwhat);
4520 /* If TYPE is an array type and EXPR is a parenthesized string
4521 constant, warn if pedantic that EXPR is being used to initialize an
4522 object of type TYPE. */
4525 maybe_warn_string_init (tree type, struct c_expr expr)
4528 && TREE_CODE (type) == ARRAY_TYPE
4529 && TREE_CODE (expr.value) == STRING_CST
4530 && expr.original_code != STRING_CST)
4531 pedwarn_init ("array initialized from parenthesized string constant");
4534 /* Digest the parser output INIT as an initializer for type TYPE.
4535 Return a C expression of type TYPE to represent the initial value.
4537 If INIT is a string constant, STRICT_STRING is true if it is
4538 unparenthesized or we should not warn here for it being parenthesized.
4539 For other types of INIT, STRICT_STRING is not used.
4541 REQUIRE_CONSTANT requests an error if non-constant initializers or
4542 elements are seen. */
4545 digest_init (tree type, tree init, bool strict_string, int require_constant)
4547 enum tree_code code = TREE_CODE (type);
4548 tree inside_init = init;
4550 if (type == error_mark_node
4552 || init == error_mark_node
4553 || TREE_TYPE (init) == error_mark_node)
4554 return error_mark_node;
4556 STRIP_TYPE_NOPS (inside_init);
4558 inside_init = fold (inside_init);
4560 /* Initialization of an array of chars from a string constant
4561 optionally enclosed in braces. */
4563 if (code == ARRAY_TYPE && inside_init
4564 && TREE_CODE (inside_init) == STRING_CST)
4566 tree typ1 = TYPE_MAIN_VARIANT (TREE_TYPE (type));
4567 /* Note that an array could be both an array of character type
4568 and an array of wchar_t if wchar_t is signed char or unsigned
4570 bool char_array = (typ1 == char_type_node
4571 || typ1 == signed_char_type_node
4572 || typ1 == unsigned_char_type_node);
4573 bool wchar_array = !!comptypes (typ1, wchar_type_node);
4574 if (char_array || wchar_array)
4578 expr.value = inside_init;
4579 expr.original_code = (strict_string ? STRING_CST : ERROR_MARK);
4580 maybe_warn_string_init (type, expr);
4583 = (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (inside_init)))
4586 if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
4587 TYPE_MAIN_VARIANT (type)))
4590 if (!wchar_array && !char_string)
4592 error_init ("char-array initialized from wide string");
4593 return error_mark_node;
4595 if (char_string && !char_array)
4597 error_init ("wchar_t-array initialized from non-wide string");
4598 return error_mark_node;
4601 TREE_TYPE (inside_init) = type;
4602 if (TYPE_DOMAIN (type) != 0
4603 && TYPE_SIZE (type) != 0
4604 && TREE_CODE (TYPE_SIZE (type)) == INTEGER_CST
4605 /* Subtract 1 (or sizeof (wchar_t))
4606 because it's ok to ignore the terminating null char
4607 that is counted in the length of the constant. */
4608 && 0 > compare_tree_int (TYPE_SIZE_UNIT (type),
4609 TREE_STRING_LENGTH (inside_init)
4610 - ((TYPE_PRECISION (typ1)
4611 != TYPE_PRECISION (char_type_node))
4612 ? (TYPE_PRECISION (wchar_type_node)
4615 pedwarn_init ("initializer-string for array of chars is too long");
4619 else if (INTEGRAL_TYPE_P (typ1))
4621 error_init ("array of inappropriate type initialized "
4622 "from string constant");
4623 return error_mark_node;
4627 /* Build a VECTOR_CST from a *constant* vector constructor. If the
4628 vector constructor is not constant (e.g. {1,2,3,foo()}) then punt
4629 below and handle as a constructor. */
4630 if (code == VECTOR_TYPE
4631 && TREE_CODE (TREE_TYPE (inside_init)) == VECTOR_TYPE
4632 && vector_types_convertible_p (TREE_TYPE (inside_init), type)
4633 && TREE_CONSTANT (inside_init))
4635 if (TREE_CODE (inside_init) == VECTOR_CST
4636 && comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
4637 TYPE_MAIN_VARIANT (type)))
4640 if (TREE_CODE (inside_init) == CONSTRUCTOR)
4642 unsigned HOST_WIDE_INT ix;
4644 bool constant_p = true;
4646 /* Iterate through elements and check if all constructor
4647 elements are *_CSTs. */
4648 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (inside_init), ix, value)
4649 if (!CONSTANT_CLASS_P (value))
4656 return build_vector_from_ctor (type,
4657 CONSTRUCTOR_ELTS (inside_init));
4661 /* Any type can be initialized
4662 from an expression of the same type, optionally with braces. */
4664 if (inside_init && TREE_TYPE (inside_init) != 0
4665 && (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
4666 TYPE_MAIN_VARIANT (type))
4667 || (code == ARRAY_TYPE
4668 && comptypes (TREE_TYPE (inside_init), type))
4669 || (code == VECTOR_TYPE
4670 && comptypes (TREE_TYPE (inside_init), type))
4671 || (code == POINTER_TYPE
4672 && TREE_CODE (TREE_TYPE (inside_init)) == ARRAY_TYPE
4673 && comptypes (TREE_TYPE (TREE_TYPE (inside_init)),
4674 TREE_TYPE (type)))))
4676 if (code == POINTER_TYPE)
4678 if (TREE_CODE (TREE_TYPE (inside_init)) == ARRAY_TYPE)
4680 if (TREE_CODE (inside_init) == STRING_CST
4681 || TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
4682 inside_init = array_to_pointer_conversion (inside_init);
4685 error_init ("invalid use of non-lvalue array");
4686 return error_mark_node;
4691 if (code == VECTOR_TYPE)
4692 /* Although the types are compatible, we may require a
4694 inside_init = convert (type, inside_init);
4696 if (require_constant
4697 && (code == VECTOR_TYPE || !flag_isoc99)
4698 && TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
4700 /* As an extension, allow initializing objects with static storage
4701 duration with compound literals (which are then treated just as
4702 the brace enclosed list they contain). Also allow this for
4703 vectors, as we can only assign them with compound literals. */
4704 tree decl = COMPOUND_LITERAL_EXPR_DECL (inside_init);
4705 inside_init = DECL_INITIAL (decl);
4708 if (code == ARRAY_TYPE && TREE_CODE (inside_init) != STRING_CST
4709 && TREE_CODE (inside_init) != CONSTRUCTOR)
4711 error_init ("array initialized from non-constant array expression");
4712 return error_mark_node;
4715 if (optimize && TREE_CODE (inside_init) == VAR_DECL)
4716 inside_init = decl_constant_value_for_broken_optimization (inside_init);
4718 /* Compound expressions can only occur here if -pedantic or
4719 -pedantic-errors is specified. In the later case, we always want
4720 an error. In the former case, we simply want a warning. */
4721 if (require_constant && pedantic
4722 && TREE_CODE (inside_init) == COMPOUND_EXPR)
4725 = valid_compound_expr_initializer (inside_init,
4726 TREE_TYPE (inside_init));
4727 if (inside_init == error_mark_node)
4728 error_init ("initializer element is not constant");
4730 pedwarn_init ("initializer element is not constant");
4731 if (flag_pedantic_errors)
4732 inside_init = error_mark_node;
4734 else if (require_constant
4735 && !initializer_constant_valid_p (inside_init,
4736 TREE_TYPE (inside_init)))
4738 error_init ("initializer element is not constant");
4739 inside_init = error_mark_node;
4742 /* Added to enable additional -Wmissing-format-attribute warnings. */
4743 if (TREE_CODE (TREE_TYPE (inside_init)) == POINTER_TYPE)
4744 inside_init = convert_for_assignment (type, inside_init, ic_init, NULL_TREE,
4749 /* Handle scalar types, including conversions. */
4751 if (code == INTEGER_TYPE || code == REAL_TYPE || code == POINTER_TYPE
4752 || code == ENUMERAL_TYPE || code == BOOLEAN_TYPE || code == COMPLEX_TYPE
4753 || code == VECTOR_TYPE)
4755 if (TREE_CODE (TREE_TYPE (init)) == ARRAY_TYPE
4756 && (TREE_CODE (init) == STRING_CST
4757 || TREE_CODE (init) == COMPOUND_LITERAL_EXPR))
4758 init = array_to_pointer_conversion (init);
4760 = convert_for_assignment (type, init, ic_init,
4761 NULL_TREE, NULL_TREE, 0);
4763 /* Check to see if we have already given an error message. */
4764 if (inside_init == error_mark_node)
4766 else if (require_constant && !TREE_CONSTANT (inside_init))
4768 error_init ("initializer element is not constant");
4769 inside_init = error_mark_node;
4771 else if (require_constant
4772 && !initializer_constant_valid_p (inside_init,
4773 TREE_TYPE (inside_init)))
4775 error_init ("initializer element is not computable at load time");
4776 inside_init = error_mark_node;
4782 /* Come here only for records and arrays. */
4784 if (COMPLETE_TYPE_P (type) && TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST)
4786 error_init ("variable-sized object may not be initialized");
4787 return error_mark_node;
4790 error_init ("invalid initializer");
4791 return error_mark_node;
4794 /* Handle initializers that use braces. */
4796 /* Type of object we are accumulating a constructor for.
4797 This type is always a RECORD_TYPE, UNION_TYPE or ARRAY_TYPE. */
4798 static tree constructor_type;
4800 /* For a RECORD_TYPE or UNION_TYPE, this is the chain of fields
4802 static tree constructor_fields;
4804 /* For an ARRAY_TYPE, this is the specified index
4805 at which to store the next element we get. */
4806 static tree constructor_index;
4808 /* For an ARRAY_TYPE, this is the maximum index. */
4809 static tree constructor_max_index;
4811 /* For a RECORD_TYPE, this is the first field not yet written out. */
4812 static tree constructor_unfilled_fields;
4814 /* For an ARRAY_TYPE, this is the index of the first element
4815 not yet written out. */
4816 static tree constructor_unfilled_index;
4818 /* In a RECORD_TYPE, the byte index of the next consecutive field.
4819 This is so we can generate gaps between fields, when appropriate. */
4820 static tree constructor_bit_index;
4822 /* If we are saving up the elements rather than allocating them,
4823 this is the list of elements so far (in reverse order,
4824 most recent first). */
4825 static VEC(constructor_elt,gc) *constructor_elements;
4827 /* 1 if constructor should be incrementally stored into a constructor chain,
4828 0 if all the elements should be kept in AVL tree. */
4829 static int constructor_incremental;
4831 /* 1 if so far this constructor's elements are all compile-time constants. */
4832 static int constructor_constant;
4834 /* 1 if so far this constructor's elements are all valid address constants. */
4835 static int constructor_simple;
4837 /* 1 if this constructor is erroneous so far. */
4838 static int constructor_erroneous;
4840 /* Structure for managing pending initializer elements, organized as an
4845 struct init_node *left, *right;
4846 struct init_node *parent;
4852 /* Tree of pending elements at this constructor level.
4853 These are elements encountered out of order
4854 which belong at places we haven't reached yet in actually
4856 Will never hold tree nodes across GC runs. */
4857 static struct init_node *constructor_pending_elts;
4859 /* The SPELLING_DEPTH of this constructor. */
4860 static int constructor_depth;
4862 /* DECL node for which an initializer is being read.
4863 0 means we are reading a constructor expression
4864 such as (struct foo) {...}. */
4865 static tree constructor_decl;
4867 /* Nonzero if this is an initializer for a top-level decl. */
4868 static int constructor_top_level;
4870 /* Nonzero if there were any member designators in this initializer. */
4871 static int constructor_designated;
4873 /* Nesting depth of designator list. */
4874 static int designator_depth;
4876 /* Nonzero if there were diagnosed errors in this designator list. */
4877 static int designator_erroneous;
4880 /* This stack has a level for each implicit or explicit level of
4881 structuring in the initializer, including the outermost one. It
4882 saves the values of most of the variables above. */
4884 struct constructor_range_stack;
4886 struct constructor_stack
4888 struct constructor_stack *next;
4893 tree unfilled_index;
4894 tree unfilled_fields;
4896 VEC(constructor_elt,gc) *elements;
4897 struct init_node *pending_elts;
4900 /* If value nonzero, this value should replace the entire
4901 constructor at this level. */
4902 struct c_expr replacement_value;
4903 struct constructor_range_stack *range_stack;
4913 static struct constructor_stack *constructor_stack;
4915 /* This stack represents designators from some range designator up to
4916 the last designator in the list. */
4918 struct constructor_range_stack
4920 struct constructor_range_stack *next, *prev;
4921 struct constructor_stack *stack;
4928 static struct constructor_range_stack *constructor_range_stack;
4930 /* This stack records separate initializers that are nested.
4931 Nested initializers can't happen in ANSI C, but GNU C allows them
4932 in cases like { ... (struct foo) { ... } ... }. */
4934 struct initializer_stack
4936 struct initializer_stack *next;
4938 struct constructor_stack *constructor_stack;
4939 struct constructor_range_stack *constructor_range_stack;
4940 VEC(constructor_elt,gc) *elements;
4941 struct spelling *spelling;
4942 struct spelling *spelling_base;
4945 char require_constant_value;
4946 char require_constant_elements;
4949 static struct initializer_stack *initializer_stack;
4951 /* Prepare to parse and output the initializer for variable DECL. */
4954 start_init (tree decl, tree asmspec_tree ATTRIBUTE_UNUSED, int top_level)
4957 struct initializer_stack *p = XNEW (struct initializer_stack);
4959 p->decl = constructor_decl;
4960 p->require_constant_value = require_constant_value;
4961 p->require_constant_elements = require_constant_elements;
4962 p->constructor_stack = constructor_stack;
4963 p->constructor_range_stack = constructor_range_stack;
4964 p->elements = constructor_elements;
4965 p->spelling = spelling;
4966 p->spelling_base = spelling_base;
4967 p->spelling_size = spelling_size;
4968 p->top_level = constructor_top_level;
4969 p->next = initializer_stack;
4970 initializer_stack = p;
4972 constructor_decl = decl;
4973 constructor_designated = 0;
4974 constructor_top_level = top_level;
4976 if (decl != 0 && decl != error_mark_node)
4978 require_constant_value = TREE_STATIC (decl);
4979 require_constant_elements
4980 = ((TREE_STATIC (decl) || (pedantic && !flag_isoc99))
4981 /* For a scalar, you can always use any value to initialize,
4982 even within braces. */
4983 && (TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE
4984 || TREE_CODE (TREE_TYPE (decl)) == RECORD_TYPE
4985 || TREE_CODE (TREE_TYPE (decl)) == UNION_TYPE
4986 || TREE_CODE (TREE_TYPE (decl)) == QUAL_UNION_TYPE));
4987 locus = IDENTIFIER_POINTER (DECL_NAME (decl));
4991 require_constant_value = 0;
4992 require_constant_elements = 0;
4993 locus = "(anonymous)";
4996 constructor_stack = 0;
4997 constructor_range_stack = 0;
4999 missing_braces_mentioned = 0;
5003 RESTORE_SPELLING_DEPTH (0);
5006 push_string (locus);
5012 struct initializer_stack *p = initializer_stack;
5014 /* Free the whole constructor stack of this initializer. */
5015 while (constructor_stack)
5017 struct constructor_stack *q = constructor_stack;
5018 constructor_stack = q->next;
5022 gcc_assert (!constructor_range_stack);
5024 /* Pop back to the data of the outer initializer (if any). */
5025 free (spelling_base);
5027 constructor_decl = p->decl;
5028 require_constant_value = p->require_constant_value;
5029 require_constant_elements = p->require_constant_elements;
5030 constructor_stack = p->constructor_stack;
5031 constructor_range_stack = p->constructor_range_stack;
5032 constructor_elements = p->elements;
5033 spelling = p->spelling;
5034 spelling_base = p->spelling_base;
5035 spelling_size = p->spelling_size;
5036 constructor_top_level = p->top_level;
5037 initializer_stack = p->next;
5041 /* Call here when we see the initializer is surrounded by braces.
5042 This is instead of a call to push_init_level;
5043 it is matched by a call to pop_init_level.
5045 TYPE is the type to initialize, for a constructor expression.
5046 For an initializer for a decl, TYPE is zero. */
5049 really_start_incremental_init (tree type)
5051 struct constructor_stack *p = XNEW (struct constructor_stack);
5054 type = TREE_TYPE (constructor_decl);
5056 if (targetm.vector_opaque_p (type))
5057 error ("opaque vector types cannot be initialized");
5059 p->type = constructor_type;
5060 p->fields = constructor_fields;
5061 p->index = constructor_index;
5062 p->max_index = constructor_max_index;
5063 p->unfilled_index = constructor_unfilled_index;
5064 p->unfilled_fields = constructor_unfilled_fields;
5065 p->bit_index = constructor_bit_index;
5066 p->elements = constructor_elements;
5067 p->constant = constructor_constant;
5068 p->simple = constructor_simple;
5069 p->erroneous = constructor_erroneous;
5070 p->pending_elts = constructor_pending_elts;
5071 p->depth = constructor_depth;
5072 p->replacement_value.value = 0;
5073 p->replacement_value.original_code = ERROR_MARK;
5077 p->incremental = constructor_incremental;
5078 p->designated = constructor_designated;
5080 constructor_stack = p;
5082 constructor_constant = 1;
5083 constructor_simple = 1;
5084 constructor_depth = SPELLING_DEPTH ();
5085 constructor_elements = 0;
5086 constructor_pending_elts = 0;
5087 constructor_type = type;
5088 constructor_incremental = 1;
5089 constructor_designated = 0;
5090 designator_depth = 0;
5091 designator_erroneous = 0;
5093 if (TREE_CODE (constructor_type) == RECORD_TYPE
5094 || TREE_CODE (constructor_type) == UNION_TYPE)
5096 constructor_fields = TYPE_FIELDS (constructor_type);
5097 /* Skip any nameless bit fields at the beginning. */
5098 while (constructor_fields != 0 && DECL_C_BIT_FIELD (constructor_fields)
5099 && DECL_NAME (constructor_fields) == 0)
5100 constructor_fields = TREE_CHAIN (constructor_fields);
5102 constructor_unfilled_fields = constructor_fields;
5103 constructor_bit_index = bitsize_zero_node;
5105 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5107 if (TYPE_DOMAIN (constructor_type))
5109 constructor_max_index
5110 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type));
5112 /* Detect non-empty initializations of zero-length arrays. */
5113 if (constructor_max_index == NULL_TREE
5114 && TYPE_SIZE (constructor_type))
5115 constructor_max_index = build_int_cst (NULL_TREE, -1);
5117 /* constructor_max_index needs to be an INTEGER_CST. Attempts
5118 to initialize VLAs will cause a proper error; avoid tree
5119 checking errors as well by setting a safe value. */
5120 if (constructor_max_index
5121 && TREE_CODE (constructor_max_index) != INTEGER_CST)
5122 constructor_max_index = build_int_cst (NULL_TREE, -1);
5125 = convert (bitsizetype,
5126 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
5130 constructor_index = bitsize_zero_node;
5131 constructor_max_index = NULL_TREE;
5134 constructor_unfilled_index = constructor_index;
5136 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
5138 /* Vectors are like simple fixed-size arrays. */
5139 constructor_max_index =
5140 build_int_cst (NULL_TREE, TYPE_VECTOR_SUBPARTS (constructor_type) - 1);
5141 constructor_index = bitsize_zero_node;
5142 constructor_unfilled_index = constructor_index;
5146 /* Handle the case of int x = {5}; */
5147 constructor_fields = constructor_type;
5148 constructor_unfilled_fields = constructor_type;
5152 /* Push down into a subobject, for initialization.
5153 If this is for an explicit set of braces, IMPLICIT is 0.
5154 If it is because the next element belongs at a lower level,
5155 IMPLICIT is 1 (or 2 if the push is because of designator list). */
5158 push_init_level (int implicit)
5160 struct constructor_stack *p;
5161 tree value = NULL_TREE;
5163 /* If we've exhausted any levels that didn't have braces,
5164 pop them now. If implicit == 1, this will have been done in
5165 process_init_element; do not repeat it here because in the case
5166 of excess initializers for an empty aggregate this leads to an
5167 infinite cycle of popping a level and immediately recreating
5171 while (constructor_stack->implicit)
5173 if ((TREE_CODE (constructor_type) == RECORD_TYPE
5174 || TREE_CODE (constructor_type) == UNION_TYPE)
5175 && constructor_fields == 0)
5176 process_init_element (pop_init_level (1));
5177 else if (TREE_CODE (constructor_type) == ARRAY_TYPE
5178 && constructor_max_index
5179 && tree_int_cst_lt (constructor_max_index,
5181 process_init_element (pop_init_level (1));
5187 /* Unless this is an explicit brace, we need to preserve previous
5191 if ((TREE_CODE (constructor_type) == RECORD_TYPE
5192 || TREE_CODE (constructor_type) == UNION_TYPE)
5193 && constructor_fields)
5194 value = find_init_member (constructor_fields);
5195 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5196 value = find_init_member (constructor_index);
5199 p = XNEW (struct constructor_stack);
5200 p->type = constructor_type;
5201 p->fields = constructor_fields;
5202 p->index = constructor_index;
5203 p->max_index = constructor_max_index;
5204 p->unfilled_index = constructor_unfilled_index;
5205 p->unfilled_fields = constructor_unfilled_fields;
5206 p->bit_index = constructor_bit_index;
5207 p->elements = constructor_elements;
5208 p->constant = constructor_constant;
5209 p->simple = constructor_simple;
5210 p->erroneous = constructor_erroneous;
5211 p->pending_elts = constructor_pending_elts;
5212 p->depth = constructor_depth;
5213 p->replacement_value.value = 0;
5214 p->replacement_value.original_code = ERROR_MARK;
5215 p->implicit = implicit;
5217 p->incremental = constructor_incremental;
5218 p->designated = constructor_designated;
5219 p->next = constructor_stack;
5221 constructor_stack = p;
5223 constructor_constant = 1;
5224 constructor_simple = 1;
5225 constructor_depth = SPELLING_DEPTH ();
5226 constructor_elements = 0;
5227 constructor_incremental = 1;
5228 constructor_designated = 0;
5229 constructor_pending_elts = 0;
5232 p->range_stack = constructor_range_stack;
5233 constructor_range_stack = 0;
5234 designator_depth = 0;
5235 designator_erroneous = 0;
5238 /* Don't die if an entire brace-pair level is superfluous
5239 in the containing level. */
5240 if (constructor_type == 0)
5242 else if (TREE_CODE (constructor_type) == RECORD_TYPE
5243 || TREE_CODE (constructor_type) == UNION_TYPE)
5245 /* Don't die if there are extra init elts at the end. */
5246 if (constructor_fields == 0)
5247 constructor_type = 0;
5250 constructor_type = TREE_TYPE (constructor_fields);
5251 push_member_name (constructor_fields);
5252 constructor_depth++;
5255 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5257 constructor_type = TREE_TYPE (constructor_type);
5258 push_array_bounds (tree_low_cst (constructor_index, 1));
5259 constructor_depth++;
5262 if (constructor_type == 0)
5264 error_init ("extra brace group at end of initializer");
5265 constructor_fields = 0;
5266 constructor_unfilled_fields = 0;
5270 if (value && TREE_CODE (value) == CONSTRUCTOR)
5272 constructor_constant = TREE_CONSTANT (value);
5273 constructor_simple = TREE_STATIC (value);
5274 constructor_elements = CONSTRUCTOR_ELTS (value);
5275 if (!VEC_empty (constructor_elt, constructor_elements)
5276 && (TREE_CODE (constructor_type) == RECORD_TYPE
5277 || TREE_CODE (constructor_type) == ARRAY_TYPE))
5278 set_nonincremental_init ();
5281 if (implicit == 1 && warn_missing_braces && !missing_braces_mentioned)
5283 missing_braces_mentioned = 1;
5284 warning_init ("missing braces around initializer");
5287 if (TREE_CODE (constructor_type) == RECORD_TYPE
5288 || TREE_CODE (constructor_type) == UNION_TYPE)
5290 constructor_fields = TYPE_FIELDS (constructor_type);
5291 /* Skip any nameless bit fields at the beginning. */
5292 while (constructor_fields != 0 && DECL_C_BIT_FIELD (constructor_fields)
5293 && DECL_NAME (constructor_fields) == 0)
5294 constructor_fields = TREE_CHAIN (constructor_fields);
5296 constructor_unfilled_fields = constructor_fields;
5297 constructor_bit_index = bitsize_zero_node;
5299 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
5301 /* Vectors are like simple fixed-size arrays. */
5302 constructor_max_index =
5303 build_int_cst (NULL_TREE, TYPE_VECTOR_SUBPARTS (constructor_type) - 1);
5304 constructor_index = convert (bitsizetype, integer_zero_node);
5305 constructor_unfilled_index = constructor_index;
5307 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5309 if (TYPE_DOMAIN (constructor_type))
5311 constructor_max_index
5312 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type));
5314 /* Detect non-empty initializations of zero-length arrays. */
5315 if (constructor_max_index == NULL_TREE
5316 && TYPE_SIZE (constructor_type))
5317 constructor_max_index = build_int_cst (NULL_TREE, -1);
5319 /* constructor_max_index needs to be an INTEGER_CST. Attempts
5320 to initialize VLAs will cause a proper error; avoid tree
5321 checking errors as well by setting a safe value. */
5322 if (constructor_max_index
5323 && TREE_CODE (constructor_max_index) != INTEGER_CST)
5324 constructor_max_index = build_int_cst (NULL_TREE, -1);
5327 = convert (bitsizetype,
5328 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
5331 constructor_index = bitsize_zero_node;
5333 constructor_unfilled_index = constructor_index;
5334 if (value && TREE_CODE (value) == STRING_CST)
5336 /* We need to split the char/wchar array into individual
5337 characters, so that we don't have to special case it
5339 set_nonincremental_init_from_string (value);
5344 if (constructor_type != error_mark_node)
5345 warning_init ("braces around scalar initializer");
5346 constructor_fields = constructor_type;
5347 constructor_unfilled_fields = constructor_type;
5351 /* At the end of an implicit or explicit brace level,
5352 finish up that level of constructor. If a single expression
5353 with redundant braces initialized that level, return the
5354 c_expr structure for that expression. Otherwise, the original_code
5355 element is set to ERROR_MARK.
5356 If we were outputting the elements as they are read, return 0 as the value
5357 from inner levels (process_init_element ignores that),
5358 but return error_mark_node as the value from the outermost level
5359 (that's what we want to put in DECL_INITIAL).
5360 Otherwise, return a CONSTRUCTOR expression as the value. */
5363 pop_init_level (int implicit)
5365 struct constructor_stack *p;
5368 ret.original_code = ERROR_MARK;
5372 /* When we come to an explicit close brace,
5373 pop any inner levels that didn't have explicit braces. */
5374 while (constructor_stack->implicit)
5375 process_init_element (pop_init_level (1));
5377 gcc_assert (!constructor_range_stack);
5380 /* Now output all pending elements. */
5381 constructor_incremental = 1;
5382 output_pending_init_elements (1);
5384 p = constructor_stack;
5386 /* Error for initializing a flexible array member, or a zero-length
5387 array member in an inappropriate context. */
5388 if (constructor_type && constructor_fields
5389 && TREE_CODE (constructor_type) == ARRAY_TYPE
5390 && TYPE_DOMAIN (constructor_type)
5391 && !TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type)))
5393 /* Silently discard empty initializations. The parser will
5394 already have pedwarned for empty brackets. */
5395 if (integer_zerop (constructor_unfilled_index))
5396 constructor_type = NULL_TREE;
5399 gcc_assert (!TYPE_SIZE (constructor_type));
5401 if (constructor_depth > 2)
5402 error_init ("initialization of flexible array member in a nested context");
5404 pedwarn_init ("initialization of a flexible array member");
5406 /* We have already issued an error message for the existence
5407 of a flexible array member not at the end of the structure.
5408 Discard the initializer so that we do not die later. */
5409 if (TREE_CHAIN (constructor_fields) != NULL_TREE)
5410 constructor_type = NULL_TREE;
5414 /* Warn when some struct elements are implicitly initialized to zero. */
5415 if (warn_missing_field_initializers
5417 && TREE_CODE (constructor_type) == RECORD_TYPE
5418 && constructor_unfilled_fields)
5420 /* Do not warn for flexible array members or zero-length arrays. */
5421 while (constructor_unfilled_fields
5422 && (!DECL_SIZE (constructor_unfilled_fields)
5423 || integer_zerop (DECL_SIZE (constructor_unfilled_fields))))
5424 constructor_unfilled_fields = TREE_CHAIN (constructor_unfilled_fields);
5426 /* Do not warn if this level of the initializer uses member
5427 designators; it is likely to be deliberate. */
5428 if (constructor_unfilled_fields && !constructor_designated)
5430 push_member_name (constructor_unfilled_fields);
5431 warning_init ("missing initializer");
5432 RESTORE_SPELLING_DEPTH (constructor_depth);
5436 /* Pad out the end of the structure. */
5437 if (p->replacement_value.value)
5438 /* If this closes a superfluous brace pair,
5439 just pass out the element between them. */
5440 ret = p->replacement_value;
5441 else if (constructor_type == 0)
5443 else if (TREE_CODE (constructor_type) != RECORD_TYPE
5444 && TREE_CODE (constructor_type) != UNION_TYPE
5445 && TREE_CODE (constructor_type) != ARRAY_TYPE
5446 && TREE_CODE (constructor_type) != VECTOR_TYPE)
5448 /* A nonincremental scalar initializer--just return
5449 the element, after verifying there is just one. */
5450 if (VEC_empty (constructor_elt,constructor_elements))
5452 if (!constructor_erroneous)
5453 error_init ("empty scalar initializer");
5454 ret.value = error_mark_node;
5456 else if (VEC_length (constructor_elt,constructor_elements) != 1)
5458 error_init ("extra elements in scalar initializer");
5459 ret.value = VEC_index (constructor_elt,constructor_elements,0)->value;
5462 ret.value = VEC_index (constructor_elt,constructor_elements,0)->value;
5466 if (constructor_erroneous)
5467 ret.value = error_mark_node;
5470 ret.value = build_constructor (constructor_type,
5471 constructor_elements);
5472 if (constructor_constant)
5473 TREE_CONSTANT (ret.value) = TREE_INVARIANT (ret.value) = 1;
5474 if (constructor_constant && constructor_simple)
5475 TREE_STATIC (ret.value) = 1;
5479 constructor_type = p->type;
5480 constructor_fields = p->fields;
5481 constructor_index = p->index;
5482 constructor_max_index = p->max_index;
5483 constructor_unfilled_index = p->unfilled_index;
5484 constructor_unfilled_fields = p->unfilled_fields;
5485 constructor_bit_index = p->bit_index;
5486 constructor_elements = p->elements;
5487 constructor_constant = p->constant;
5488 constructor_simple = p->simple;
5489 constructor_erroneous = p->erroneous;
5490 constructor_incremental = p->incremental;
5491 constructor_designated = p->designated;
5492 constructor_pending_elts = p->pending_elts;
5493 constructor_depth = p->depth;
5495 constructor_range_stack = p->range_stack;
5496 RESTORE_SPELLING_DEPTH (constructor_depth);
5498 constructor_stack = p->next;
5501 if (ret.value == 0 && constructor_stack == 0)
5502 ret.value = error_mark_node;
5506 /* Common handling for both array range and field name designators.
5507 ARRAY argument is nonzero for array ranges. Returns zero for success. */
5510 set_designator (int array)
5513 enum tree_code subcode;
5515 /* Don't die if an entire brace-pair level is superfluous
5516 in the containing level. */
5517 if (constructor_type == 0)
5520 /* If there were errors in this designator list already, bail out
5522 if (designator_erroneous)
5525 if (!designator_depth)
5527 gcc_assert (!constructor_range_stack);
5529 /* Designator list starts at the level of closest explicit
5531 while (constructor_stack->implicit)
5532 process_init_element (pop_init_level (1));
5533 constructor_designated = 1;
5537 switch (TREE_CODE (constructor_type))
5541 subtype = TREE_TYPE (constructor_fields);
5542 if (subtype != error_mark_node)
5543 subtype = TYPE_MAIN_VARIANT (subtype);
5546 subtype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
5552 subcode = TREE_CODE (subtype);
5553 if (array && subcode != ARRAY_TYPE)
5555 error_init ("array index in non-array initializer");
5558 else if (!array && subcode != RECORD_TYPE && subcode != UNION_TYPE)
5560 error_init ("field name not in record or union initializer");
5564 constructor_designated = 1;
5565 push_init_level (2);
5569 /* If there are range designators in designator list, push a new designator
5570 to constructor_range_stack. RANGE_END is end of such stack range or
5571 NULL_TREE if there is no range designator at this level. */
5574 push_range_stack (tree range_end)
5576 struct constructor_range_stack *p;
5578 p = GGC_NEW (struct constructor_range_stack);
5579 p->prev = constructor_range_stack;
5581 p->fields = constructor_fields;
5582 p->range_start = constructor_index;
5583 p->index = constructor_index;
5584 p->stack = constructor_stack;
5585 p->range_end = range_end;
5586 if (constructor_range_stack)
5587 constructor_range_stack->next = p;
5588 constructor_range_stack = p;
5591 /* Within an array initializer, specify the next index to be initialized.
5592 FIRST is that index. If LAST is nonzero, then initialize a range
5593 of indices, running from FIRST through LAST. */
5596 set_init_index (tree first, tree last)
5598 if (set_designator (1))
5601 designator_erroneous = 1;
5603 if (!INTEGRAL_TYPE_P (TREE_TYPE (first))
5604 || (last && !INTEGRAL_TYPE_P (TREE_TYPE (last))))
5606 error_init ("array index in initializer not of integer type");
5610 if (TREE_CODE (first) != INTEGER_CST)
5611 error_init ("nonconstant array index in initializer");
5612 else if (last != 0 && TREE_CODE (last) != INTEGER_CST)
5613 error_init ("nonconstant array index in initializer");
5614 else if (TREE_CODE (constructor_type) != ARRAY_TYPE)
5615 error_init ("array index in non-array initializer");
5616 else if (tree_int_cst_sgn (first) == -1)
5617 error_init ("array index in initializer exceeds array bounds");
5618 else if (constructor_max_index
5619 && tree_int_cst_lt (constructor_max_index, first))
5620 error_init ("array index in initializer exceeds array bounds");
5623 constructor_index = convert (bitsizetype, first);
5627 if (tree_int_cst_equal (first, last))
5629 else if (tree_int_cst_lt (last, first))
5631 error_init ("empty index range in initializer");
5636 last = convert (bitsizetype, last);
5637 if (constructor_max_index != 0
5638 && tree_int_cst_lt (constructor_max_index, last))
5640 error_init ("array index range in initializer exceeds array bounds");
5647 designator_erroneous = 0;
5648 if (constructor_range_stack || last)
5649 push_range_stack (last);
5653 /* Within a struct initializer, specify the next field to be initialized. */
5656 set_init_label (tree fieldname)
5660 if (set_designator (0))
5663 designator_erroneous = 1;
5665 if (TREE_CODE (constructor_type) != RECORD_TYPE
5666 && TREE_CODE (constructor_type) != UNION_TYPE)
5668 error_init ("field name not in record or union initializer");
5672 for (tail = TYPE_FIELDS (constructor_type); tail;
5673 tail = TREE_CHAIN (tail))
5675 if (DECL_NAME (tail) == fieldname)
5680 error ("unknown field %qE specified in initializer", fieldname);
5683 constructor_fields = tail;
5685 designator_erroneous = 0;
5686 if (constructor_range_stack)
5687 push_range_stack (NULL_TREE);
5691 /* Add a new initializer to the tree of pending initializers. PURPOSE
5692 identifies the initializer, either array index or field in a structure.
5693 VALUE is the value of that index or field. */
5696 add_pending_init (tree purpose, tree value)
5698 struct init_node *p, **q, *r;
5700 q = &constructor_pending_elts;
5703 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5708 if (tree_int_cst_lt (purpose, p->purpose))
5710 else if (tree_int_cst_lt (p->purpose, purpose))
5714 if (TREE_SIDE_EFFECTS (p->value))
5715 warning_init ("initialized field with side-effects overwritten");
5716 else if (warn_override_init)
5717 warning_init ("initialized field overwritten");
5727 bitpos = bit_position (purpose);
5731 if (tree_int_cst_lt (bitpos, bit_position (p->purpose)))
5733 else if (p->purpose != purpose)
5737 if (TREE_SIDE_EFFECTS (p->value))
5738 warning_init ("initialized field with side-effects overwritten");
5739 else if (warn_override_init)
5740 warning_init ("initialized field overwritten");
5747 r = GGC_NEW (struct init_node);
5748 r->purpose = purpose;
5759 struct init_node *s;
5763 if (p->balance == 0)
5765 else if (p->balance < 0)
5772 p->left->parent = p;
5789 constructor_pending_elts = r;
5794 struct init_node *t = r->right;
5798 r->right->parent = r;
5803 p->left->parent = p;
5806 p->balance = t->balance < 0;
5807 r->balance = -(t->balance > 0);
5822 constructor_pending_elts = t;
5828 /* p->balance == +1; growth of left side balances the node. */
5833 else /* r == p->right */
5835 if (p->balance == 0)
5836 /* Growth propagation from right side. */
5838 else if (p->balance > 0)
5845 p->right->parent = p;
5862 constructor_pending_elts = r;
5864 else /* r->balance == -1 */
5867 struct init_node *t = r->left;
5871 r->left->parent = r;
5876 p->right->parent = p;
5879 r->balance = (t->balance < 0);
5880 p->balance = -(t->balance > 0);
5895 constructor_pending_elts = t;
5901 /* p->balance == -1; growth of right side balances the node. */
5912 /* Build AVL tree from a sorted chain. */
5915 set_nonincremental_init (void)
5917 unsigned HOST_WIDE_INT ix;
5920 if (TREE_CODE (constructor_type) != RECORD_TYPE
5921 && TREE_CODE (constructor_type) != ARRAY_TYPE)
5924 FOR_EACH_CONSTRUCTOR_ELT (constructor_elements, ix, index, value)
5925 add_pending_init (index, value);
5926 constructor_elements = 0;
5927 if (TREE_CODE (constructor_type) == RECORD_TYPE)
5929 constructor_unfilled_fields = TYPE_FIELDS (constructor_type);
5930 /* Skip any nameless bit fields at the beginning. */
5931 while (constructor_unfilled_fields != 0
5932 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
5933 && DECL_NAME (constructor_unfilled_fields) == 0)
5934 constructor_unfilled_fields = TREE_CHAIN (constructor_unfilled_fields);
5937 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5939 if (TYPE_DOMAIN (constructor_type))
5940 constructor_unfilled_index
5941 = convert (bitsizetype,
5942 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
5944 constructor_unfilled_index = bitsize_zero_node;
5946 constructor_incremental = 0;
5949 /* Build AVL tree from a string constant. */
5952 set_nonincremental_init_from_string (tree str)
5954 tree value, purpose, type;
5955 HOST_WIDE_INT val[2];
5956 const char *p, *end;
5957 int byte, wchar_bytes, charwidth, bitpos;
5959 gcc_assert (TREE_CODE (constructor_type) == ARRAY_TYPE);
5961 if (TYPE_PRECISION (TREE_TYPE (TREE_TYPE (str)))
5962 == TYPE_PRECISION (char_type_node))
5966 gcc_assert (TYPE_PRECISION (TREE_TYPE (TREE_TYPE (str)))
5967 == TYPE_PRECISION (wchar_type_node));
5968 wchar_bytes = TYPE_PRECISION (wchar_type_node) / BITS_PER_UNIT;
5970 charwidth = TYPE_PRECISION (char_type_node);
5971 type = TREE_TYPE (constructor_type);
5972 p = TREE_STRING_POINTER (str);
5973 end = p + TREE_STRING_LENGTH (str);
5975 for (purpose = bitsize_zero_node;
5976 p < end && !tree_int_cst_lt (constructor_max_index, purpose);
5977 purpose = size_binop (PLUS_EXPR, purpose, bitsize_one_node))
5979 if (wchar_bytes == 1)
5981 val[1] = (unsigned char) *p++;
5988 for (byte = 0; byte < wchar_bytes; byte++)
5990 if (BYTES_BIG_ENDIAN)
5991 bitpos = (wchar_bytes - byte - 1) * charwidth;
5993 bitpos = byte * charwidth;
5994 val[bitpos < HOST_BITS_PER_WIDE_INT]
5995 |= ((unsigned HOST_WIDE_INT) ((unsigned char) *p++))
5996 << (bitpos % HOST_BITS_PER_WIDE_INT);
6000 if (!TYPE_UNSIGNED (type))
6002 bitpos = ((wchar_bytes - 1) * charwidth) + HOST_BITS_PER_CHAR;
6003 if (bitpos < HOST_BITS_PER_WIDE_INT)
6005 if (val[1] & (((HOST_WIDE_INT) 1) << (bitpos - 1)))
6007 val[1] |= ((HOST_WIDE_INT) -1) << bitpos;
6011 else if (bitpos == HOST_BITS_PER_WIDE_INT)
6016 else if (val[0] & (((HOST_WIDE_INT) 1)
6017 << (bitpos - 1 - HOST_BITS_PER_WIDE_INT)))
6018 val[0] |= ((HOST_WIDE_INT) -1)
6019 << (bitpos - HOST_BITS_PER_WIDE_INT);
6022 value = build_int_cst_wide (type, val[1], val[0]);
6023 add_pending_init (purpose, value);
6026 constructor_incremental = 0;
6029 /* Return value of FIELD in pending initializer or zero if the field was
6030 not initialized yet. */
6033 find_init_member (tree field)
6035 struct init_node *p;
6037 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6039 if (constructor_incremental
6040 && tree_int_cst_lt (field, constructor_unfilled_index))
6041 set_nonincremental_init ();
6043 p = constructor_pending_elts;
6046 if (tree_int_cst_lt (field, p->purpose))
6048 else if (tree_int_cst_lt (p->purpose, field))
6054 else if (TREE_CODE (constructor_type) == RECORD_TYPE)
6056 tree bitpos = bit_position (field);
6058 if (constructor_incremental
6059 && (!constructor_unfilled_fields
6060 || tree_int_cst_lt (bitpos,
6061 bit_position (constructor_unfilled_fields))))
6062 set_nonincremental_init ();
6064 p = constructor_pending_elts;
6067 if (field == p->purpose)
6069 else if (tree_int_cst_lt (bitpos, bit_position (p->purpose)))
6075 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6077 if (!VEC_empty (constructor_elt, constructor_elements)
6078 && (VEC_last (constructor_elt, constructor_elements)->index
6080 return VEC_last (constructor_elt, constructor_elements)->value;
6085 /* "Output" the next constructor element.
6086 At top level, really output it to assembler code now.
6087 Otherwise, collect it in a list from which we will make a CONSTRUCTOR.
6088 TYPE is the data type that the containing data type wants here.
6089 FIELD is the field (a FIELD_DECL) or the index that this element fills.
6090 If VALUE is a string constant, STRICT_STRING is true if it is
6091 unparenthesized or we should not warn here for it being parenthesized.
6092 For other types of VALUE, STRICT_STRING is not used.
6094 PENDING if non-nil means output pending elements that belong
6095 right after this element. (PENDING is normally 1;
6096 it is 0 while outputting pending elements, to avoid recursion.) */
6099 output_init_element (tree value, bool strict_string, tree type, tree field,
6102 constructor_elt *celt;
6104 if (type == error_mark_node || value == error_mark_node)
6106 constructor_erroneous = 1;
6109 if (TREE_CODE (TREE_TYPE (value)) == ARRAY_TYPE
6110 && (TREE_CODE (value) == STRING_CST
6111 || TREE_CODE (value) == COMPOUND_LITERAL_EXPR)
6112 && !(TREE_CODE (value) == STRING_CST
6113 && TREE_CODE (type) == ARRAY_TYPE
6114 && INTEGRAL_TYPE_P (TREE_TYPE (type)))
6115 && !comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (value)),
6116 TYPE_MAIN_VARIANT (type)))
6117 value = array_to_pointer_conversion (value);
6119 if (TREE_CODE (value) == COMPOUND_LITERAL_EXPR
6120 && require_constant_value && !flag_isoc99 && pending)
6122 /* As an extension, allow initializing objects with static storage
6123 duration with compound literals (which are then treated just as
6124 the brace enclosed list they contain). */
6125 tree decl = COMPOUND_LITERAL_EXPR_DECL (value);
6126 value = DECL_INITIAL (decl);
6129 if (value == error_mark_node)
6130 constructor_erroneous = 1;
6131 else if (!TREE_CONSTANT (value))
6132 constructor_constant = 0;
6133 else if (!initializer_constant_valid_p (value, TREE_TYPE (value))
6134 || ((TREE_CODE (constructor_type) == RECORD_TYPE
6135 || TREE_CODE (constructor_type) == UNION_TYPE)
6136 && DECL_C_BIT_FIELD (field)
6137 && TREE_CODE (value) != INTEGER_CST))
6138 constructor_simple = 0;
6140 if (!initializer_constant_valid_p (value, TREE_TYPE (value)))
6142 if (require_constant_value)
6144 error_init ("initializer element is not constant");
6145 value = error_mark_node;
6147 else if (require_constant_elements)
6148 pedwarn ("initializer element is not computable at load time");
6151 /* If this field is empty (and not at the end of structure),
6152 don't do anything other than checking the initializer. */
6154 && (TREE_TYPE (field) == error_mark_node
6155 || (COMPLETE_TYPE_P (TREE_TYPE (field))
6156 && integer_zerop (TYPE_SIZE (TREE_TYPE (field)))
6157 && (TREE_CODE (constructor_type) == ARRAY_TYPE
6158 || TREE_CHAIN (field)))))
6161 value = digest_init (type, value, strict_string, require_constant_value);
6162 if (value == error_mark_node)
6164 constructor_erroneous = 1;
6168 /* If this element doesn't come next in sequence,
6169 put it on constructor_pending_elts. */
6170 if (TREE_CODE (constructor_type) == ARRAY_TYPE
6171 && (!constructor_incremental
6172 || !tree_int_cst_equal (field, constructor_unfilled_index)))
6174 if (constructor_incremental
6175 && tree_int_cst_lt (field, constructor_unfilled_index))
6176 set_nonincremental_init ();
6178 add_pending_init (field, value);
6181 else if (TREE_CODE (constructor_type) == RECORD_TYPE
6182 && (!constructor_incremental
6183 || field != constructor_unfilled_fields))
6185 /* We do this for records but not for unions. In a union,
6186 no matter which field is specified, it can be initialized
6187 right away since it starts at the beginning of the union. */
6188 if (constructor_incremental)
6190 if (!constructor_unfilled_fields)
6191 set_nonincremental_init ();
6194 tree bitpos, unfillpos;
6196 bitpos = bit_position (field);
6197 unfillpos = bit_position (constructor_unfilled_fields);
6199 if (tree_int_cst_lt (bitpos, unfillpos))
6200 set_nonincremental_init ();
6204 add_pending_init (field, value);
6207 else if (TREE_CODE (constructor_type) == UNION_TYPE
6208 && !VEC_empty (constructor_elt, constructor_elements))
6210 if (TREE_SIDE_EFFECTS (VEC_last (constructor_elt,
6211 constructor_elements)->value))
6212 warning_init ("initialized field with side-effects overwritten");
6213 else if (warn_override_init)
6214 warning_init ("initialized field overwritten");
6216 /* We can have just one union field set. */
6217 constructor_elements = 0;
6220 /* Otherwise, output this element either to
6221 constructor_elements or to the assembler file. */
6223 celt = VEC_safe_push (constructor_elt, gc, constructor_elements, NULL);
6224 celt->index = field;
6225 celt->value = value;
6227 /* Advance the variable that indicates sequential elements output. */
6228 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6229 constructor_unfilled_index
6230 = size_binop (PLUS_EXPR, constructor_unfilled_index,
6232 else if (TREE_CODE (constructor_type) == RECORD_TYPE)
6234 constructor_unfilled_fields
6235 = TREE_CHAIN (constructor_unfilled_fields);
6237 /* Skip any nameless bit fields. */
6238 while (constructor_unfilled_fields != 0
6239 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
6240 && DECL_NAME (constructor_unfilled_fields) == 0)
6241 constructor_unfilled_fields =
6242 TREE_CHAIN (constructor_unfilled_fields);
6244 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6245 constructor_unfilled_fields = 0;
6247 /* Now output any pending elements which have become next. */
6249 output_pending_init_elements (0);
6252 /* Output any pending elements which have become next.
6253 As we output elements, constructor_unfilled_{fields,index}
6254 advances, which may cause other elements to become next;
6255 if so, they too are output.
6257 If ALL is 0, we return when there are
6258 no more pending elements to output now.
6260 If ALL is 1, we output space as necessary so that
6261 we can output all the pending elements. */
6264 output_pending_init_elements (int all)
6266 struct init_node *elt = constructor_pending_elts;
6271 /* Look through the whole pending tree.
6272 If we find an element that should be output now,
6273 output it. Otherwise, set NEXT to the element
6274 that comes first among those still pending. */
6279 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6281 if (tree_int_cst_equal (elt->purpose,
6282 constructor_unfilled_index))
6283 output_init_element (elt->value, true,
6284 TREE_TYPE (constructor_type),
6285 constructor_unfilled_index, 0);
6286 else if (tree_int_cst_lt (constructor_unfilled_index,
6289 /* Advance to the next smaller node. */
6294 /* We have reached the smallest node bigger than the
6295 current unfilled index. Fill the space first. */
6296 next = elt->purpose;
6302 /* Advance to the next bigger node. */
6307 /* We have reached the biggest node in a subtree. Find
6308 the parent of it, which is the next bigger node. */
6309 while (elt->parent && elt->parent->right == elt)
6312 if (elt && tree_int_cst_lt (constructor_unfilled_index,
6315 next = elt->purpose;
6321 else if (TREE_CODE (constructor_type) == RECORD_TYPE
6322 || TREE_CODE (constructor_type) == UNION_TYPE)
6324 tree ctor_unfilled_bitpos, elt_bitpos;
6326 /* If the current record is complete we are done. */
6327 if (constructor_unfilled_fields == 0)
6330 ctor_unfilled_bitpos = bit_position (constructor_unfilled_fields);
6331 elt_bitpos = bit_position (elt->purpose);
6332 /* We can't compare fields here because there might be empty
6333 fields in between. */
6334 if (tree_int_cst_equal (elt_bitpos, ctor_unfilled_bitpos))
6336 constructor_unfilled_fields = elt->purpose;
6337 output_init_element (elt->value, true, TREE_TYPE (elt->purpose),
6340 else if (tree_int_cst_lt (ctor_unfilled_bitpos, elt_bitpos))
6342 /* Advance to the next smaller node. */
6347 /* We have reached the smallest node bigger than the
6348 current unfilled field. Fill the space first. */
6349 next = elt->purpose;
6355 /* Advance to the next bigger node. */
6360 /* We have reached the biggest node in a subtree. Find
6361 the parent of it, which is the next bigger node. */
6362 while (elt->parent && elt->parent->right == elt)
6366 && (tree_int_cst_lt (ctor_unfilled_bitpos,
6367 bit_position (elt->purpose))))
6369 next = elt->purpose;
6377 /* Ordinarily return, but not if we want to output all
6378 and there are elements left. */
6379 if (!(all && next != 0))
6382 /* If it's not incremental, just skip over the gap, so that after
6383 jumping to retry we will output the next successive element. */
6384 if (TREE_CODE (constructor_type) == RECORD_TYPE
6385 || TREE_CODE (constructor_type) == UNION_TYPE)
6386 constructor_unfilled_fields = next;
6387 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6388 constructor_unfilled_index = next;
6390 /* ELT now points to the node in the pending tree with the next
6391 initializer to output. */
6395 /* Add one non-braced element to the current constructor level.
6396 This adjusts the current position within the constructor's type.
6397 This may also start or terminate implicit levels
6398 to handle a partly-braced initializer.
6400 Once this has found the correct level for the new element,
6401 it calls output_init_element. */
6404 process_init_element (struct c_expr value)
6406 tree orig_value = value.value;
6407 int string_flag = orig_value != 0 && TREE_CODE (orig_value) == STRING_CST;
6408 bool strict_string = value.original_code == STRING_CST;
6410 designator_depth = 0;
6411 designator_erroneous = 0;
6413 /* Handle superfluous braces around string cst as in
6414 char x[] = {"foo"}; */
6417 && TREE_CODE (constructor_type) == ARRAY_TYPE
6418 && INTEGRAL_TYPE_P (TREE_TYPE (constructor_type))
6419 && integer_zerop (constructor_unfilled_index))
6421 if (constructor_stack->replacement_value.value)
6422 error_init ("excess elements in char array initializer");
6423 constructor_stack->replacement_value = value;
6427 if (constructor_stack->replacement_value.value != 0)
6429 error_init ("excess elements in struct initializer");
6433 /* Ignore elements of a brace group if it is entirely superfluous
6434 and has already been diagnosed. */
6435 if (constructor_type == 0)
6438 /* If we've exhausted any levels that didn't have braces,
6440 while (constructor_stack->implicit)
6442 if ((TREE_CODE (constructor_type) == RECORD_TYPE
6443 || TREE_CODE (constructor_type) == UNION_TYPE)
6444 && constructor_fields == 0)
6445 process_init_element (pop_init_level (1));
6446 else if (TREE_CODE (constructor_type) == ARRAY_TYPE
6447 && (constructor_max_index == 0
6448 || tree_int_cst_lt (constructor_max_index,
6449 constructor_index)))
6450 process_init_element (pop_init_level (1));
6455 /* In the case of [LO ... HI] = VALUE, only evaluate VALUE once. */
6456 if (constructor_range_stack)
6458 /* If value is a compound literal and we'll be just using its
6459 content, don't put it into a SAVE_EXPR. */
6460 if (TREE_CODE (value.value) != COMPOUND_LITERAL_EXPR
6461 || !require_constant_value
6463 value.value = save_expr (value.value);
6468 if (TREE_CODE (constructor_type) == RECORD_TYPE)
6471 enum tree_code fieldcode;
6473 if (constructor_fields == 0)
6475 pedwarn_init ("excess elements in struct initializer");
6479 fieldtype = TREE_TYPE (constructor_fields);
6480 if (fieldtype != error_mark_node)
6481 fieldtype = TYPE_MAIN_VARIANT (fieldtype);
6482 fieldcode = TREE_CODE (fieldtype);
6484 /* Error for non-static initialization of a flexible array member. */
6485 if (fieldcode == ARRAY_TYPE
6486 && !require_constant_value
6487 && TYPE_SIZE (fieldtype) == NULL_TREE
6488 && TREE_CHAIN (constructor_fields) == NULL_TREE)
6490 error_init ("non-static initialization of a flexible array member");
6494 /* Accept a string constant to initialize a subarray. */
6495 if (value.value != 0
6496 && fieldcode == ARRAY_TYPE
6497 && INTEGRAL_TYPE_P (TREE_TYPE (fieldtype))
6499 value.value = orig_value;
6500 /* Otherwise, if we have come to a subaggregate,
6501 and we don't have an element of its type, push into it. */
6502 else if (value.value != 0
6503 && value.value != error_mark_node
6504 && TYPE_MAIN_VARIANT (TREE_TYPE (value.value)) != fieldtype
6505 && (fieldcode == RECORD_TYPE || fieldcode == ARRAY_TYPE
6506 || fieldcode == UNION_TYPE))
6508 push_init_level (1);
6514 push_member_name (constructor_fields);
6515 output_init_element (value.value, strict_string,
6516 fieldtype, constructor_fields, 1);
6517 RESTORE_SPELLING_DEPTH (constructor_depth);
6520 /* Do the bookkeeping for an element that was
6521 directly output as a constructor. */
6523 /* For a record, keep track of end position of last field. */
6524 if (DECL_SIZE (constructor_fields))
6525 constructor_bit_index
6526 = size_binop (PLUS_EXPR,
6527 bit_position (constructor_fields),
6528 DECL_SIZE (constructor_fields));
6530 /* If the current field was the first one not yet written out,
6531 it isn't now, so update. */
6532 if (constructor_unfilled_fields == constructor_fields)
6534 constructor_unfilled_fields = TREE_CHAIN (constructor_fields);
6535 /* Skip any nameless bit fields. */
6536 while (constructor_unfilled_fields != 0
6537 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
6538 && DECL_NAME (constructor_unfilled_fields) == 0)
6539 constructor_unfilled_fields =
6540 TREE_CHAIN (constructor_unfilled_fields);
6544 constructor_fields = TREE_CHAIN (constructor_fields);
6545 /* Skip any nameless bit fields at the beginning. */
6546 while (constructor_fields != 0
6547 && DECL_C_BIT_FIELD (constructor_fields)
6548 && DECL_NAME (constructor_fields) == 0)
6549 constructor_fields = TREE_CHAIN (constructor_fields);
6551 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6554 enum tree_code fieldcode;
6556 if (constructor_fields == 0)
6558 pedwarn_init ("excess elements in union initializer");
6562 fieldtype = TREE_TYPE (constructor_fields);
6563 if (fieldtype != error_mark_node)
6564 fieldtype = TYPE_MAIN_VARIANT (fieldtype);
6565 fieldcode = TREE_CODE (fieldtype);
6567 /* Warn that traditional C rejects initialization of unions.
6568 We skip the warning if the value is zero. This is done
6569 under the assumption that the zero initializer in user
6570 code appears conditioned on e.g. __STDC__ to avoid
6571 "missing initializer" warnings and relies on default
6572 initialization to zero in the traditional C case.
6573 We also skip the warning if the initializer is designated,
6574 again on the assumption that this must be conditional on
6575 __STDC__ anyway (and we've already complained about the
6576 member-designator already). */
6577 if (!in_system_header && !constructor_designated
6578 && !(value.value && (integer_zerop (value.value)
6579 || real_zerop (value.value))))
6580 warning (OPT_Wtraditional, "traditional C rejects initialization "
6583 /* Accept a string constant to initialize a subarray. */
6584 if (value.value != 0
6585 && fieldcode == ARRAY_TYPE
6586 && INTEGRAL_TYPE_P (TREE_TYPE (fieldtype))
6588 value.value = orig_value;
6589 /* Otherwise, if we have come to a subaggregate,
6590 and we don't have an element of its type, push into it. */
6591 else if (value.value != 0
6592 && value.value != error_mark_node
6593 && TYPE_MAIN_VARIANT (TREE_TYPE (value.value)) != fieldtype
6594 && (fieldcode == RECORD_TYPE || fieldcode == ARRAY_TYPE
6595 || fieldcode == UNION_TYPE))
6597 push_init_level (1);
6603 push_member_name (constructor_fields);
6604 output_init_element (value.value, strict_string,
6605 fieldtype, constructor_fields, 1);
6606 RESTORE_SPELLING_DEPTH (constructor_depth);
6609 /* Do the bookkeeping for an element that was
6610 directly output as a constructor. */
6612 constructor_bit_index = DECL_SIZE (constructor_fields);
6613 constructor_unfilled_fields = TREE_CHAIN (constructor_fields);
6616 constructor_fields = 0;
6618 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6620 tree elttype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
6621 enum tree_code eltcode = TREE_CODE (elttype);
6623 /* Accept a string constant to initialize a subarray. */
6624 if (value.value != 0
6625 && eltcode == ARRAY_TYPE
6626 && INTEGRAL_TYPE_P (TREE_TYPE (elttype))
6628 value.value = orig_value;
6629 /* Otherwise, if we have come to a subaggregate,
6630 and we don't have an element of its type, push into it. */
6631 else if (value.value != 0
6632 && value.value != error_mark_node
6633 && TYPE_MAIN_VARIANT (TREE_TYPE (value.value)) != elttype
6634 && (eltcode == RECORD_TYPE || eltcode == ARRAY_TYPE
6635 || eltcode == UNION_TYPE))
6637 push_init_level (1);
6641 if (constructor_max_index != 0
6642 && (tree_int_cst_lt (constructor_max_index, constructor_index)
6643 || integer_all_onesp (constructor_max_index)))
6645 pedwarn_init ("excess elements in array initializer");
6649 /* Now output the actual element. */
6652 push_array_bounds (tree_low_cst (constructor_index, 1));
6653 output_init_element (value.value, strict_string,
6654 elttype, constructor_index, 1);
6655 RESTORE_SPELLING_DEPTH (constructor_depth);
6659 = size_binop (PLUS_EXPR, constructor_index, bitsize_one_node);
6662 /* If we are doing the bookkeeping for an element that was
6663 directly output as a constructor, we must update
6664 constructor_unfilled_index. */
6665 constructor_unfilled_index = constructor_index;
6667 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
6669 tree elttype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
6671 /* Do a basic check of initializer size. Note that vectors
6672 always have a fixed size derived from their type. */
6673 if (tree_int_cst_lt (constructor_max_index, constructor_index))
6675 pedwarn_init ("excess elements in vector initializer");
6679 /* Now output the actual element. */
6681 output_init_element (value.value, strict_string,
6682 elttype, constructor_index, 1);
6685 = size_binop (PLUS_EXPR, constructor_index, bitsize_one_node);
6688 /* If we are doing the bookkeeping for an element that was
6689 directly output as a constructor, we must update
6690 constructor_unfilled_index. */
6691 constructor_unfilled_index = constructor_index;
6694 /* Handle the sole element allowed in a braced initializer
6695 for a scalar variable. */
6696 else if (constructor_type != error_mark_node
6697 && constructor_fields == 0)
6699 pedwarn_init ("excess elements in scalar initializer");
6705 output_init_element (value.value, strict_string,
6706 constructor_type, NULL_TREE, 1);
6707 constructor_fields = 0;
6710 /* Handle range initializers either at this level or anywhere higher
6711 in the designator stack. */
6712 if (constructor_range_stack)
6714 struct constructor_range_stack *p, *range_stack;
6717 range_stack = constructor_range_stack;
6718 constructor_range_stack = 0;
6719 while (constructor_stack != range_stack->stack)
6721 gcc_assert (constructor_stack->implicit);
6722 process_init_element (pop_init_level (1));
6724 for (p = range_stack;
6725 !p->range_end || tree_int_cst_equal (p->index, p->range_end);
6728 gcc_assert (constructor_stack->implicit);
6729 process_init_element (pop_init_level (1));
6732 p->index = size_binop (PLUS_EXPR, p->index, bitsize_one_node);
6733 if (tree_int_cst_equal (p->index, p->range_end) && !p->prev)
6738 constructor_index = p->index;
6739 constructor_fields = p->fields;
6740 if (finish && p->range_end && p->index == p->range_start)
6748 push_init_level (2);
6749 p->stack = constructor_stack;
6750 if (p->range_end && tree_int_cst_equal (p->index, p->range_end))
6751 p->index = p->range_start;
6755 constructor_range_stack = range_stack;
6762 constructor_range_stack = 0;
6765 /* Build a complete asm-statement, whose components are a CV_QUALIFIER
6766 (guaranteed to be 'volatile' or null) and ARGS (represented using
6767 an ASM_EXPR node). */
6769 build_asm_stmt (tree cv_qualifier, tree args)
6771 if (!ASM_VOLATILE_P (args) && cv_qualifier)
6772 ASM_VOLATILE_P (args) = 1;
6773 return add_stmt (args);
6776 /* Build an asm-expr, whose components are a STRING, some OUTPUTS,
6777 some INPUTS, and some CLOBBERS. The latter three may be NULL.
6778 SIMPLE indicates whether there was anything at all after the
6779 string in the asm expression -- asm("blah") and asm("blah" : )
6780 are subtly different. We use a ASM_EXPR node to represent this. */
6782 build_asm_expr (tree string, tree outputs, tree inputs, tree clobbers,
6788 const char *constraint;
6789 const char **oconstraints;
6790 bool allows_mem, allows_reg, is_inout;
6791 int ninputs, noutputs;
6793 ninputs = list_length (inputs);
6794 noutputs = list_length (outputs);
6795 oconstraints = (const char **) alloca (noutputs * sizeof (const char *));
6797 string = resolve_asm_operand_names (string, outputs, inputs);
6799 /* Remove output conversions that change the type but not the mode. */
6800 for (i = 0, tail = outputs; tail; ++i, tail = TREE_CHAIN (tail))
6802 tree output = TREE_VALUE (tail);
6804 /* ??? Really, this should not be here. Users should be using a
6805 proper lvalue, dammit. But there's a long history of using casts
6806 in the output operands. In cases like longlong.h, this becomes a
6807 primitive form of typechecking -- if the cast can be removed, then
6808 the output operand had a type of the proper width; otherwise we'll
6809 get an error. Gross, but ... */
6810 STRIP_NOPS (output);
6812 if (!lvalue_or_else (output, lv_asm))
6813 output = error_mark_node;
6815 if (output != error_mark_node
6816 && (TREE_READONLY (output)
6817 || TYPE_READONLY (TREE_TYPE (output))
6818 || ((TREE_CODE (TREE_TYPE (output)) == RECORD_TYPE
6819 || TREE_CODE (TREE_TYPE (output)) == UNION_TYPE)
6820 && C_TYPE_FIELDS_READONLY (TREE_TYPE (output)))))
6821 readonly_error (output, lv_asm);
6823 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
6824 oconstraints[i] = constraint;
6826 if (parse_output_constraint (&constraint, i, ninputs, noutputs,
6827 &allows_mem, &allows_reg, &is_inout))
6829 /* If the operand is going to end up in memory,
6830 mark it addressable. */
6831 if (!allows_reg && !c_mark_addressable (output))
6832 output = error_mark_node;
6835 output = error_mark_node;
6837 TREE_VALUE (tail) = output;
6840 for (i = 0, tail = inputs; tail; ++i, tail = TREE_CHAIN (tail))
6844 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
6845 input = TREE_VALUE (tail);
6847 if (parse_input_constraint (&constraint, i, ninputs, noutputs, 0,
6848 oconstraints, &allows_mem, &allows_reg))
6850 /* If the operand is going to end up in memory,
6851 mark it addressable. */
6852 if (!allows_reg && allows_mem)
6854 /* Strip the nops as we allow this case. FIXME, this really
6855 should be rejected or made deprecated. */
6857 if (!c_mark_addressable (input))
6858 input = error_mark_node;
6862 input = error_mark_node;
6864 TREE_VALUE (tail) = input;
6867 args = build_stmt (ASM_EXPR, string, outputs, inputs, clobbers);
6869 /* asm statements without outputs, including simple ones, are treated
6871 ASM_INPUT_P (args) = simple;
6872 ASM_VOLATILE_P (args) = (noutputs == 0);
6877 /* Generate a goto statement to LABEL. */
6880 c_finish_goto_label (tree label)
6882 tree decl = lookup_label (label);
6886 if (C_DECL_UNJUMPABLE_STMT_EXPR (decl))
6888 error ("jump into statement expression");
6892 if (C_DECL_UNJUMPABLE_VM (decl))
6894 error ("jump into scope of identifier with variably modified type");
6898 if (!C_DECL_UNDEFINABLE_STMT_EXPR (decl))
6900 /* No jump from outside this statement expression context, so
6901 record that there is a jump from within this context. */
6902 struct c_label_list *nlist;
6903 nlist = XOBNEW (&parser_obstack, struct c_label_list);
6904 nlist->next = label_context_stack_se->labels_used;
6905 nlist->label = decl;
6906 label_context_stack_se->labels_used = nlist;
6909 if (!C_DECL_UNDEFINABLE_VM (decl))
6911 /* No jump from outside this context context of identifiers with
6912 variably modified type, so record that there is a jump from
6913 within this context. */
6914 struct c_label_list *nlist;
6915 nlist = XOBNEW (&parser_obstack, struct c_label_list);
6916 nlist->next = label_context_stack_vm->labels_used;
6917 nlist->label = decl;
6918 label_context_stack_vm->labels_used = nlist;
6921 TREE_USED (decl) = 1;
6922 return add_stmt (build1 (GOTO_EXPR, void_type_node, decl));
6925 /* Generate a computed goto statement to EXPR. */
6928 c_finish_goto_ptr (tree expr)
6931 pedwarn ("ISO C forbids %<goto *expr;%>");
6932 expr = convert (ptr_type_node, expr);
6933 return add_stmt (build1 (GOTO_EXPR, void_type_node, expr));
6936 /* Generate a C `return' statement. RETVAL is the expression for what
6937 to return, or a null pointer for `return;' with no value. */
6940 c_finish_return (tree retval)
6942 tree valtype = TREE_TYPE (TREE_TYPE (current_function_decl)), ret_stmt;
6943 bool no_warning = false;
6945 if (TREE_THIS_VOLATILE (current_function_decl))
6946 warning (0, "function declared %<noreturn%> has a %<return%> statement");
6950 current_function_returns_null = 1;
6951 if ((warn_return_type || flag_isoc99)
6952 && valtype != 0 && TREE_CODE (valtype) != VOID_TYPE)
6954 pedwarn_c99 ("%<return%> with no value, in "
6955 "function returning non-void");
6959 else if (valtype == 0 || TREE_CODE (valtype) == VOID_TYPE)
6961 current_function_returns_null = 1;
6962 if (pedantic || TREE_CODE (TREE_TYPE (retval)) != VOID_TYPE)
6963 pedwarn ("%<return%> with a value, in function returning void");
6967 tree t = convert_for_assignment (valtype, retval, ic_return,
6968 NULL_TREE, NULL_TREE, 0);
6969 tree res = DECL_RESULT (current_function_decl);
6972 current_function_returns_value = 1;
6973 if (t == error_mark_node)
6976 inner = t = convert (TREE_TYPE (res), t);
6978 /* Strip any conversions, additions, and subtractions, and see if
6979 we are returning the address of a local variable. Warn if so. */
6982 switch (TREE_CODE (inner))
6984 case NOP_EXPR: case NON_LVALUE_EXPR: case CONVERT_EXPR:
6986 inner = TREE_OPERAND (inner, 0);
6990 /* If the second operand of the MINUS_EXPR has a pointer
6991 type (or is converted from it), this may be valid, so
6992 don't give a warning. */
6994 tree op1 = TREE_OPERAND (inner, 1);
6996 while (!POINTER_TYPE_P (TREE_TYPE (op1))
6997 && (TREE_CODE (op1) == NOP_EXPR
6998 || TREE_CODE (op1) == NON_LVALUE_EXPR
6999 || TREE_CODE (op1) == CONVERT_EXPR))
7000 op1 = TREE_OPERAND (op1, 0);
7002 if (POINTER_TYPE_P (TREE_TYPE (op1)))
7005 inner = TREE_OPERAND (inner, 0);
7010 inner = TREE_OPERAND (inner, 0);
7012 while (REFERENCE_CLASS_P (inner)
7013 && TREE_CODE (inner) != INDIRECT_REF)
7014 inner = TREE_OPERAND (inner, 0);
7017 && !DECL_EXTERNAL (inner)
7018 && !TREE_STATIC (inner)
7019 && DECL_CONTEXT (inner) == current_function_decl)
7020 warning (0, "function returns address of local variable");
7030 retval = build2 (MODIFY_EXPR, TREE_TYPE (res), res, t);
7033 ret_stmt = build_stmt (RETURN_EXPR, retval);
7034 TREE_NO_WARNING (ret_stmt) |= no_warning;
7035 return add_stmt (ret_stmt);
7039 /* The SWITCH_EXPR being built. */
7042 /* The original type of the testing expression, i.e. before the
7043 default conversion is applied. */
7046 /* A splay-tree mapping the low element of a case range to the high
7047 element, or NULL_TREE if there is no high element. Used to
7048 determine whether or not a new case label duplicates an old case
7049 label. We need a tree, rather than simply a hash table, because
7050 of the GNU case range extension. */
7053 /* Number of nested statement expressions within this switch
7054 statement; if nonzero, case and default labels may not
7056 unsigned int blocked_stmt_expr;
7058 /* Scope of outermost declarations of identifiers with variably
7059 modified type within this switch statement; if nonzero, case and
7060 default labels may not appear. */
7061 unsigned int blocked_vm;
7063 /* The next node on the stack. */
7064 struct c_switch *next;
7067 /* A stack of the currently active switch statements. The innermost
7068 switch statement is on the top of the stack. There is no need to
7069 mark the stack for garbage collection because it is only active
7070 during the processing of the body of a function, and we never
7071 collect at that point. */
7073 struct c_switch *c_switch_stack;
7075 /* Start a C switch statement, testing expression EXP. Return the new
7079 c_start_case (tree exp)
7081 tree orig_type = error_mark_node;
7082 struct c_switch *cs;
7084 if (exp != error_mark_node)
7086 orig_type = TREE_TYPE (exp);
7088 if (!INTEGRAL_TYPE_P (orig_type))
7090 if (orig_type != error_mark_node)
7092 error ("switch quantity not an integer");
7093 orig_type = error_mark_node;
7095 exp = integer_zero_node;
7099 tree type = TYPE_MAIN_VARIANT (orig_type);
7101 if (!in_system_header
7102 && (type == long_integer_type_node
7103 || type == long_unsigned_type_node))
7104 warning (OPT_Wtraditional, "%<long%> switch expression not "
7105 "converted to %<int%> in ISO C");
7107 exp = default_conversion (exp);
7111 /* Add this new SWITCH_EXPR to the stack. */
7112 cs = XNEW (struct c_switch);
7113 cs->switch_expr = build3 (SWITCH_EXPR, orig_type, exp, NULL_TREE, NULL_TREE);
7114 cs->orig_type = orig_type;
7115 cs->cases = splay_tree_new (case_compare, NULL, NULL);
7116 cs->blocked_stmt_expr = 0;
7118 cs->next = c_switch_stack;
7119 c_switch_stack = cs;
7121 return add_stmt (cs->switch_expr);
7124 /* Process a case label. */
7127 do_case (tree low_value, tree high_value)
7129 tree label = NULL_TREE;
7131 if (c_switch_stack && !c_switch_stack->blocked_stmt_expr
7132 && !c_switch_stack->blocked_vm)
7134 label = c_add_case_label (c_switch_stack->cases,
7135 SWITCH_COND (c_switch_stack->switch_expr),
7136 c_switch_stack->orig_type,
7137 low_value, high_value);
7138 if (label == error_mark_node)
7141 else if (c_switch_stack && c_switch_stack->blocked_stmt_expr)
7144 error ("case label in statement expression not containing "
7145 "enclosing switch statement");
7147 error ("%<default%> label in statement expression not containing "
7148 "enclosing switch statement");
7150 else if (c_switch_stack && c_switch_stack->blocked_vm)
7153 error ("case label in scope of identifier with variably modified "
7154 "type not containing enclosing switch statement");
7156 error ("%<default%> label in scope of identifier with variably "
7157 "modified type not containing enclosing switch statement");
7160 error ("case label not within a switch statement");
7162 error ("%<default%> label not within a switch statement");
7167 /* Finish the switch statement. */
7170 c_finish_case (tree body)
7172 struct c_switch *cs = c_switch_stack;
7173 location_t switch_location;
7175 SWITCH_BODY (cs->switch_expr) = body;
7177 /* We must not be within a statement expression nested in the switch
7178 at this point; we might, however, be within the scope of an
7179 identifier with variably modified type nested in the switch. */
7180 gcc_assert (!cs->blocked_stmt_expr);
7182 /* Emit warnings as needed. */
7183 if (EXPR_HAS_LOCATION (cs->switch_expr))
7184 switch_location = EXPR_LOCATION (cs->switch_expr);
7186 switch_location = input_location;
7187 c_do_switch_warnings (cs->cases, switch_location,
7188 TREE_TYPE (cs->switch_expr),
7189 SWITCH_COND (cs->switch_expr));
7191 /* Pop the stack. */
7192 c_switch_stack = cs->next;
7193 splay_tree_delete (cs->cases);
7197 /* Emit an if statement. IF_LOCUS is the location of the 'if'. COND,
7198 THEN_BLOCK and ELSE_BLOCK are expressions to be used; ELSE_BLOCK
7199 may be null. NESTED_IF is true if THEN_BLOCK contains another IF
7200 statement, and was not surrounded with parenthesis. */
7203 c_finish_if_stmt (location_t if_locus, tree cond, tree then_block,
7204 tree else_block, bool nested_if)
7208 /* Diagnose an ambiguous else if if-then-else is nested inside if-then. */
7209 if (warn_parentheses && nested_if && else_block == NULL)
7211 tree inner_if = then_block;
7213 /* We know from the grammar productions that there is an IF nested
7214 within THEN_BLOCK. Due to labels and c99 conditional declarations,
7215 it might not be exactly THEN_BLOCK, but should be the last
7216 non-container statement within. */
7218 switch (TREE_CODE (inner_if))
7223 inner_if = BIND_EXPR_BODY (inner_if);
7225 case STATEMENT_LIST:
7226 inner_if = expr_last (then_block);
7228 case TRY_FINALLY_EXPR:
7229 case TRY_CATCH_EXPR:
7230 inner_if = TREE_OPERAND (inner_if, 0);
7237 if (COND_EXPR_ELSE (inner_if))
7238 warning (OPT_Wparentheses,
7239 "%Hsuggest explicit braces to avoid ambiguous %<else%>",
7243 empty_body_warning (then_block, else_block);
7245 stmt = build3 (COND_EXPR, void_type_node, cond, then_block, else_block);
7246 SET_EXPR_LOCATION (stmt, if_locus);
7250 /* Emit a general-purpose loop construct. START_LOCUS is the location of
7251 the beginning of the loop. COND is the loop condition. COND_IS_FIRST
7252 is false for DO loops. INCR is the FOR increment expression. BODY is
7253 the statement controlled by the loop. BLAB is the break label. CLAB is
7254 the continue label. Everything is allowed to be NULL. */
7257 c_finish_loop (location_t start_locus, tree cond, tree incr, tree body,
7258 tree blab, tree clab, bool cond_is_first)
7260 tree entry = NULL, exit = NULL, t;
7262 /* If the condition is zero don't generate a loop construct. */
7263 if (cond && integer_zerop (cond))
7267 t = build_and_jump (&blab);
7268 SET_EXPR_LOCATION (t, start_locus);
7274 tree top = build1 (LABEL_EXPR, void_type_node, NULL_TREE);
7276 /* If we have an exit condition, then we build an IF with gotos either
7277 out of the loop, or to the top of it. If there's no exit condition,
7278 then we just build a jump back to the top. */
7279 exit = build_and_jump (&LABEL_EXPR_LABEL (top));
7281 if (cond && !integer_nonzerop (cond))
7283 /* Canonicalize the loop condition to the end. This means
7284 generating a branch to the loop condition. Reuse the
7285 continue label, if possible. */
7290 entry = build1 (LABEL_EXPR, void_type_node, NULL_TREE);
7291 t = build_and_jump (&LABEL_EXPR_LABEL (entry));
7294 t = build1 (GOTO_EXPR, void_type_node, clab);
7295 SET_EXPR_LOCATION (t, start_locus);
7299 t = build_and_jump (&blab);
7300 exit = fold_build3 (COND_EXPR, void_type_node, cond, exit, t);
7302 SET_EXPR_LOCATION (exit, start_locus);
7304 SET_EXPR_LOCATION (exit, input_location);
7313 add_stmt (build1 (LABEL_EXPR, void_type_node, clab));
7321 add_stmt (build1 (LABEL_EXPR, void_type_node, blab));
7325 c_finish_bc_stmt (tree *label_p, bool is_break)
7328 tree label = *label_p;
7330 /* In switch statements break is sometimes stylistically used after
7331 a return statement. This can lead to spurious warnings about
7332 control reaching the end of a non-void function when it is
7333 inlined. Note that we are calling block_may_fallthru with
7334 language specific tree nodes; this works because
7335 block_may_fallthru returns true when given something it does not
7337 skip = !block_may_fallthru (cur_stmt_list);
7342 *label_p = label = create_artificial_label ();
7344 else if (TREE_CODE (label) == LABEL_DECL)
7346 else switch (TREE_INT_CST_LOW (label))
7350 error ("break statement not within loop or switch");
7352 error ("continue statement not within a loop");
7356 gcc_assert (is_break);
7357 error ("break statement used with OpenMP for loop");
7367 return add_stmt (build1 (GOTO_EXPR, void_type_node, label));
7370 /* A helper routine for c_process_expr_stmt and c_finish_stmt_expr. */
7373 emit_side_effect_warnings (tree expr)
7375 if (expr == error_mark_node)
7377 else if (!TREE_SIDE_EFFECTS (expr))
7379 if (!VOID_TYPE_P (TREE_TYPE (expr)) && !TREE_NO_WARNING (expr))
7380 warning (0, "%Hstatement with no effect",
7381 EXPR_HAS_LOCATION (expr) ? EXPR_LOCUS (expr) : &input_location);
7383 else if (warn_unused_value)
7384 warn_if_unused_value (expr, input_location);
7387 /* Process an expression as if it were a complete statement. Emit
7388 diagnostics, but do not call ADD_STMT. */
7391 c_process_expr_stmt (tree expr)
7396 if (warn_sequence_point)
7397 verify_sequence_points (expr);
7399 if (TREE_TYPE (expr) != error_mark_node
7400 && !COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (expr))
7401 && TREE_CODE (TREE_TYPE (expr)) != ARRAY_TYPE)
7402 error ("expression statement has incomplete type");
7404 /* If we're not processing a statement expression, warn about unused values.
7405 Warnings for statement expressions will be emitted later, once we figure
7406 out which is the result. */
7407 if (!STATEMENT_LIST_STMT_EXPR (cur_stmt_list)
7408 && (extra_warnings || warn_unused_value))
7409 emit_side_effect_warnings (expr);
7411 /* If the expression is not of a type to which we cannot assign a line
7412 number, wrap the thing in a no-op NOP_EXPR. */
7413 if (DECL_P (expr) || CONSTANT_CLASS_P (expr))
7414 expr = build1 (NOP_EXPR, TREE_TYPE (expr), expr);
7417 SET_EXPR_LOCATION (expr, input_location);
7422 /* Emit an expression as a statement. */
7425 c_finish_expr_stmt (tree expr)
7428 return add_stmt (c_process_expr_stmt (expr));
7433 /* Do the opposite and emit a statement as an expression. To begin,
7434 create a new binding level and return it. */
7437 c_begin_stmt_expr (void)
7440 struct c_label_context_se *nstack;
7441 struct c_label_list *glist;
7443 /* We must force a BLOCK for this level so that, if it is not expanded
7444 later, there is a way to turn off the entire subtree of blocks that
7445 are contained in it. */
7447 ret = c_begin_compound_stmt (true);
7450 c_switch_stack->blocked_stmt_expr++;
7451 gcc_assert (c_switch_stack->blocked_stmt_expr != 0);
7453 for (glist = label_context_stack_se->labels_used;
7455 glist = glist->next)
7457 C_DECL_UNDEFINABLE_STMT_EXPR (glist->label) = 1;
7459 nstack = XOBNEW (&parser_obstack, struct c_label_context_se);
7460 nstack->labels_def = NULL;
7461 nstack->labels_used = NULL;
7462 nstack->next = label_context_stack_se;
7463 label_context_stack_se = nstack;
7465 /* Mark the current statement list as belonging to a statement list. */
7466 STATEMENT_LIST_STMT_EXPR (ret) = 1;
7472 c_finish_stmt_expr (tree body)
7474 tree last, type, tmp, val;
7476 struct c_label_list *dlist, *glist, *glist_prev = NULL;
7478 body = c_end_compound_stmt (body, true);
7481 gcc_assert (c_switch_stack->blocked_stmt_expr != 0);
7482 c_switch_stack->blocked_stmt_expr--;
7484 /* It is no longer possible to jump to labels defined within this
7485 statement expression. */
7486 for (dlist = label_context_stack_se->labels_def;
7488 dlist = dlist->next)
7490 C_DECL_UNJUMPABLE_STMT_EXPR (dlist->label) = 1;
7492 /* It is again possible to define labels with a goto just outside
7493 this statement expression. */
7494 for (glist = label_context_stack_se->next->labels_used;
7496 glist = glist->next)
7498 C_DECL_UNDEFINABLE_STMT_EXPR (glist->label) = 0;
7501 if (glist_prev != NULL)
7502 glist_prev->next = label_context_stack_se->labels_used;
7504 label_context_stack_se->next->labels_used
7505 = label_context_stack_se->labels_used;
7506 label_context_stack_se = label_context_stack_se->next;
7508 /* Locate the last statement in BODY. See c_end_compound_stmt
7509 about always returning a BIND_EXPR. */
7510 last_p = &BIND_EXPR_BODY (body);
7511 last = BIND_EXPR_BODY (body);
7514 if (TREE_CODE (last) == STATEMENT_LIST)
7516 tree_stmt_iterator i;
7518 /* This can happen with degenerate cases like ({ }). No value. */
7519 if (!TREE_SIDE_EFFECTS (last))
7522 /* If we're supposed to generate side effects warnings, process
7523 all of the statements except the last. */
7524 if (extra_warnings || warn_unused_value)
7526 for (i = tsi_start (last); !tsi_one_before_end_p (i); tsi_next (&i))
7527 emit_side_effect_warnings (tsi_stmt (i));
7530 i = tsi_last (last);
7531 last_p = tsi_stmt_ptr (i);
7535 /* If the end of the list is exception related, then the list was split
7536 by a call to push_cleanup. Continue searching. */
7537 if (TREE_CODE (last) == TRY_FINALLY_EXPR
7538 || TREE_CODE (last) == TRY_CATCH_EXPR)
7540 last_p = &TREE_OPERAND (last, 0);
7542 goto continue_searching;
7545 /* In the case that the BIND_EXPR is not necessary, return the
7546 expression out from inside it. */
7547 if (last == error_mark_node
7548 || (last == BIND_EXPR_BODY (body)
7549 && BIND_EXPR_VARS (body) == NULL))
7551 /* Do not warn if the return value of a statement expression is
7554 TREE_NO_WARNING (last) = 1;
7558 /* Extract the type of said expression. */
7559 type = TREE_TYPE (last);
7561 /* If we're not returning a value at all, then the BIND_EXPR that
7562 we already have is a fine expression to return. */
7563 if (!type || VOID_TYPE_P (type))
7566 /* Now that we've located the expression containing the value, it seems
7567 silly to make voidify_wrapper_expr repeat the process. Create a
7568 temporary of the appropriate type and stick it in a TARGET_EXPR. */
7569 tmp = create_tmp_var_raw (type, NULL);
7571 /* Unwrap a no-op NOP_EXPR as added by c_finish_expr_stmt. This avoids
7572 tree_expr_nonnegative_p giving up immediately. */
7574 if (TREE_CODE (val) == NOP_EXPR
7575 && TREE_TYPE (val) == TREE_TYPE (TREE_OPERAND (val, 0)))
7576 val = TREE_OPERAND (val, 0);
7578 *last_p = build2 (MODIFY_EXPR, void_type_node, tmp, val);
7579 SET_EXPR_LOCUS (*last_p, EXPR_LOCUS (last));
7581 return build4 (TARGET_EXPR, type, tmp, body, NULL_TREE, NULL_TREE);
7584 /* Begin the scope of an identifier of variably modified type, scope
7585 number SCOPE. Jumping from outside this scope to inside it is not
7589 c_begin_vm_scope (unsigned int scope)
7591 struct c_label_context_vm *nstack;
7592 struct c_label_list *glist;
7594 gcc_assert (scope > 0);
7596 /* At file_scope, we don't have to do any processing. */
7597 if (label_context_stack_vm == NULL)
7600 if (c_switch_stack && !c_switch_stack->blocked_vm)
7601 c_switch_stack->blocked_vm = scope;
7602 for (glist = label_context_stack_vm->labels_used;
7604 glist = glist->next)
7606 C_DECL_UNDEFINABLE_VM (glist->label) = 1;
7608 nstack = XOBNEW (&parser_obstack, struct c_label_context_vm);
7609 nstack->labels_def = NULL;
7610 nstack->labels_used = NULL;
7611 nstack->scope = scope;
7612 nstack->next = label_context_stack_vm;
7613 label_context_stack_vm = nstack;
7616 /* End a scope which may contain identifiers of variably modified
7617 type, scope number SCOPE. */
7620 c_end_vm_scope (unsigned int scope)
7622 if (label_context_stack_vm == NULL)
7624 if (c_switch_stack && c_switch_stack->blocked_vm == scope)
7625 c_switch_stack->blocked_vm = 0;
7626 /* We may have a number of nested scopes of identifiers with
7627 variably modified type, all at this depth. Pop each in turn. */
7628 while (label_context_stack_vm->scope == scope)
7630 struct c_label_list *dlist, *glist, *glist_prev = NULL;
7632 /* It is no longer possible to jump to labels defined within this
7634 for (dlist = label_context_stack_vm->labels_def;
7636 dlist = dlist->next)
7638 C_DECL_UNJUMPABLE_VM (dlist->label) = 1;
7640 /* It is again possible to define labels with a goto just outside
7642 for (glist = label_context_stack_vm->next->labels_used;
7644 glist = glist->next)
7646 C_DECL_UNDEFINABLE_VM (glist->label) = 0;
7649 if (glist_prev != NULL)
7650 glist_prev->next = label_context_stack_vm->labels_used;
7652 label_context_stack_vm->next->labels_used
7653 = label_context_stack_vm->labels_used;
7654 label_context_stack_vm = label_context_stack_vm->next;
7658 /* Begin and end compound statements. This is as simple as pushing
7659 and popping new statement lists from the tree. */
7662 c_begin_compound_stmt (bool do_scope)
7664 tree stmt = push_stmt_list ();
7671 c_end_compound_stmt (tree stmt, bool do_scope)
7677 if (c_dialect_objc ())
7678 objc_clear_super_receiver ();
7679 block = pop_scope ();
7682 stmt = pop_stmt_list (stmt);
7683 stmt = c_build_bind_expr (block, stmt);
7685 /* If this compound statement is nested immediately inside a statement
7686 expression, then force a BIND_EXPR to be created. Otherwise we'll
7687 do the wrong thing for ({ { 1; } }) or ({ 1; { } }). In particular,
7688 STATEMENT_LISTs merge, and thus we can lose track of what statement
7691 && STATEMENT_LIST_STMT_EXPR (cur_stmt_list)
7692 && TREE_CODE (stmt) != BIND_EXPR)
7694 stmt = build3 (BIND_EXPR, void_type_node, NULL, stmt, NULL);
7695 TREE_SIDE_EFFECTS (stmt) = 1;
7701 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
7702 when the current scope is exited. EH_ONLY is true when this is not
7703 meant to apply to normal control flow transfer. */
7706 push_cleanup (tree ARG_UNUSED (decl), tree cleanup, bool eh_only)
7708 enum tree_code code;
7712 code = eh_only ? TRY_CATCH_EXPR : TRY_FINALLY_EXPR;
7713 stmt = build_stmt (code, NULL, cleanup);
7715 stmt_expr = STATEMENT_LIST_STMT_EXPR (cur_stmt_list);
7716 list = push_stmt_list ();
7717 TREE_OPERAND (stmt, 0) = list;
7718 STATEMENT_LIST_STMT_EXPR (list) = stmt_expr;
7721 /* Build a binary-operation expression without default conversions.
7722 CODE is the kind of expression to build.
7723 This function differs from `build' in several ways:
7724 the data type of the result is computed and recorded in it,
7725 warnings are generated if arg data types are invalid,
7726 special handling for addition and subtraction of pointers is known,
7727 and some optimization is done (operations on narrow ints
7728 are done in the narrower type when that gives the same result).
7729 Constant folding is also done before the result is returned.
7731 Note that the operands will never have enumeral types, or function
7732 or array types, because either they will have the default conversions
7733 performed or they have both just been converted to some other type in which
7734 the arithmetic is to be done. */
7737 build_binary_op (enum tree_code code, tree orig_op0, tree orig_op1,
7741 enum tree_code code0, code1;
7743 const char *invalid_op_diag;
7745 /* Expression code to give to the expression when it is built.
7746 Normally this is CODE, which is what the caller asked for,
7747 but in some special cases we change it. */
7748 enum tree_code resultcode = code;
7750 /* Data type in which the computation is to be performed.
7751 In the simplest cases this is the common type of the arguments. */
7752 tree result_type = NULL;
7754 /* Nonzero means operands have already been type-converted
7755 in whatever way is necessary.
7756 Zero means they need to be converted to RESULT_TYPE. */
7759 /* Nonzero means create the expression with this type, rather than
7761 tree build_type = 0;
7763 /* Nonzero means after finally constructing the expression
7764 convert it to this type. */
7765 tree final_type = 0;
7767 /* Nonzero if this is an operation like MIN or MAX which can
7768 safely be computed in short if both args are promoted shorts.
7769 Also implies COMMON.
7770 -1 indicates a bitwise operation; this makes a difference
7771 in the exact conditions for when it is safe to do the operation
7772 in a narrower mode. */
7775 /* Nonzero if this is a comparison operation;
7776 if both args are promoted shorts, compare the original shorts.
7777 Also implies COMMON. */
7778 int short_compare = 0;
7780 /* Nonzero if this is a right-shift operation, which can be computed on the
7781 original short and then promoted if the operand is a promoted short. */
7782 int short_shift = 0;
7784 /* Nonzero means set RESULT_TYPE to the common type of the args. */
7787 /* True means types are compatible as far as ObjC is concerned. */
7792 op0 = default_conversion (orig_op0);
7793 op1 = default_conversion (orig_op1);
7801 type0 = TREE_TYPE (op0);
7802 type1 = TREE_TYPE (op1);
7804 /* The expression codes of the data types of the arguments tell us
7805 whether the arguments are integers, floating, pointers, etc. */
7806 code0 = TREE_CODE (type0);
7807 code1 = TREE_CODE (type1);
7809 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
7810 STRIP_TYPE_NOPS (op0);
7811 STRIP_TYPE_NOPS (op1);
7813 /* If an error was already reported for one of the arguments,
7814 avoid reporting another error. */
7816 if (code0 == ERROR_MARK || code1 == ERROR_MARK)
7817 return error_mark_node;
7819 if ((invalid_op_diag
7820 = targetm.invalid_binary_op (code, type0, type1)))
7822 error (invalid_op_diag, "");
7823 return error_mark_node;
7826 objc_ok = objc_compare_types (type0, type1, -3, NULL_TREE);
7831 /* Handle the pointer + int case. */
7832 if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
7833 return pointer_int_sum (PLUS_EXPR, op0, op1);
7834 else if (code1 == POINTER_TYPE && code0 == INTEGER_TYPE)
7835 return pointer_int_sum (PLUS_EXPR, op1, op0);
7841 /* Subtraction of two similar pointers.
7842 We must subtract them as integers, then divide by object size. */
7843 if (code0 == POINTER_TYPE && code1 == POINTER_TYPE
7844 && comp_target_types (type0, type1))
7845 return pointer_diff (op0, op1);
7846 /* Handle pointer minus int. Just like pointer plus int. */
7847 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
7848 return pointer_int_sum (MINUS_EXPR, op0, op1);
7857 case TRUNC_DIV_EXPR:
7859 case FLOOR_DIV_EXPR:
7860 case ROUND_DIV_EXPR:
7861 case EXACT_DIV_EXPR:
7862 /* Floating point division by zero is a legitimate way to obtain
7863 infinities and NaNs. */
7864 if (skip_evaluation == 0 && integer_zerop (op1))
7865 warning (OPT_Wdiv_by_zero, "division by zero");
7867 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
7868 || code0 == COMPLEX_TYPE || code0 == VECTOR_TYPE)
7869 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
7870 || code1 == COMPLEX_TYPE || code1 == VECTOR_TYPE))
7872 enum tree_code tcode0 = code0, tcode1 = code1;
7874 if (code0 == COMPLEX_TYPE || code0 == VECTOR_TYPE)
7875 tcode0 = TREE_CODE (TREE_TYPE (TREE_TYPE (op0)));
7876 if (code1 == COMPLEX_TYPE || code1 == VECTOR_TYPE)
7877 tcode1 = TREE_CODE (TREE_TYPE (TREE_TYPE (op1)));
7879 if (!(tcode0 == INTEGER_TYPE && tcode1 == INTEGER_TYPE))
7880 resultcode = RDIV_EXPR;
7882 /* Although it would be tempting to shorten always here, that
7883 loses on some targets, since the modulo instruction is
7884 undefined if the quotient can't be represented in the
7885 computation mode. We shorten only if unsigned or if
7886 dividing by something we know != -1. */
7887 shorten = (TYPE_UNSIGNED (TREE_TYPE (orig_op0))
7888 || (TREE_CODE (op1) == INTEGER_CST
7889 && !integer_all_onesp (op1)));
7897 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
7899 else if (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE)
7903 case TRUNC_MOD_EXPR:
7904 case FLOOR_MOD_EXPR:
7905 if (skip_evaluation == 0 && integer_zerop (op1))
7906 warning (OPT_Wdiv_by_zero, "division by zero");
7908 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
7910 /* Although it would be tempting to shorten always here, that loses
7911 on some targets, since the modulo instruction is undefined if the
7912 quotient can't be represented in the computation mode. We shorten
7913 only if unsigned or if dividing by something we know != -1. */
7914 shorten = (TYPE_UNSIGNED (TREE_TYPE (orig_op0))
7915 || (TREE_CODE (op1) == INTEGER_CST
7916 && !integer_all_onesp (op1)));
7921 case TRUTH_ANDIF_EXPR:
7922 case TRUTH_ORIF_EXPR:
7923 case TRUTH_AND_EXPR:
7925 case TRUTH_XOR_EXPR:
7926 if ((code0 == INTEGER_TYPE || code0 == POINTER_TYPE
7927 || code0 == REAL_TYPE || code0 == COMPLEX_TYPE)
7928 && (code1 == INTEGER_TYPE || code1 == POINTER_TYPE
7929 || code1 == REAL_TYPE || code1 == COMPLEX_TYPE))
7931 /* Result of these operations is always an int,
7932 but that does not mean the operands should be
7933 converted to ints! */
7934 result_type = integer_type_node;
7935 op0 = c_common_truthvalue_conversion (op0);
7936 op1 = c_common_truthvalue_conversion (op1);
7941 /* Shift operations: result has same type as first operand;
7942 always convert second operand to int.
7943 Also set SHORT_SHIFT if shifting rightward. */
7946 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
7948 if (TREE_CODE (op1) == INTEGER_CST && skip_evaluation == 0)
7950 if (tree_int_cst_sgn (op1) < 0)
7951 warning (0, "right shift count is negative");
7954 if (!integer_zerop (op1))
7957 if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
7958 warning (0, "right shift count >= width of type");
7962 /* Use the type of the value to be shifted. */
7963 result_type = type0;
7964 /* Convert the shift-count to an integer, regardless of size
7965 of value being shifted. */
7966 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
7967 op1 = convert (integer_type_node, op1);
7968 /* Avoid converting op1 to result_type later. */
7974 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
7976 if (TREE_CODE (op1) == INTEGER_CST && skip_evaluation == 0)
7978 if (tree_int_cst_sgn (op1) < 0)
7979 warning (0, "left shift count is negative");
7981 else if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
7982 warning (0, "left shift count >= width of type");
7985 /* Use the type of the value to be shifted. */
7986 result_type = type0;
7987 /* Convert the shift-count to an integer, regardless of size
7988 of value being shifted. */
7989 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
7990 op1 = convert (integer_type_node, op1);
7991 /* Avoid converting op1 to result_type later. */
7998 if (code0 == REAL_TYPE || code1 == REAL_TYPE)
7999 warning (OPT_Wfloat_equal,
8000 "comparing floating point with == or != is unsafe");
8001 /* Result of comparison is always int,
8002 but don't convert the args to int! */
8003 build_type = integer_type_node;
8004 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
8005 || code0 == COMPLEX_TYPE)
8006 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
8007 || code1 == COMPLEX_TYPE))
8009 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
8011 tree tt0 = TREE_TYPE (type0);
8012 tree tt1 = TREE_TYPE (type1);
8013 /* Anything compares with void *. void * compares with anything.
8014 Otherwise, the targets must be compatible
8015 and both must be object or both incomplete. */
8016 if (comp_target_types (type0, type1))
8017 result_type = common_pointer_type (type0, type1);
8018 else if (VOID_TYPE_P (tt0))
8020 /* op0 != orig_op0 detects the case of something
8021 whose value is 0 but which isn't a valid null ptr const. */
8022 if (pedantic && !null_pointer_constant_p (orig_op0)
8023 && TREE_CODE (tt1) == FUNCTION_TYPE)
8024 pedwarn ("ISO C forbids comparison of %<void *%>"
8025 " with function pointer");
8027 else if (VOID_TYPE_P (tt1))
8029 if (pedantic && !null_pointer_constant_p (orig_op1)
8030 && TREE_CODE (tt0) == FUNCTION_TYPE)
8031 pedwarn ("ISO C forbids comparison of %<void *%>"
8032 " with function pointer");
8035 /* Avoid warning about the volatile ObjC EH puts on decls. */
8037 pedwarn ("comparison of distinct pointer types lacks a cast");
8039 if (result_type == NULL_TREE)
8040 result_type = ptr_type_node;
8042 else if (code0 == POINTER_TYPE && null_pointer_constant_p (orig_op1))
8044 if (TREE_CODE (op0) == ADDR_EXPR
8045 && DECL_P (TREE_OPERAND (op0, 0))
8046 && (TREE_CODE (TREE_OPERAND (op0, 0)) == PARM_DECL
8047 || TREE_CODE (TREE_OPERAND (op0, 0)) == LABEL_DECL
8048 || !DECL_WEAK (TREE_OPERAND (op0, 0))))
8049 warning (OPT_Waddress, "the address of %qD will never be NULL",
8050 TREE_OPERAND (op0, 0));
8051 result_type = type0;
8053 else if (code1 == POINTER_TYPE && null_pointer_constant_p (orig_op0))
8055 if (TREE_CODE (op1) == ADDR_EXPR
8056 && DECL_P (TREE_OPERAND (op1, 0))
8057 && (TREE_CODE (TREE_OPERAND (op1, 0)) == PARM_DECL
8058 || TREE_CODE (TREE_OPERAND (op1, 0)) == LABEL_DECL
8059 || !DECL_WEAK (TREE_OPERAND (op1, 0))))
8060 warning (OPT_Waddress, "the address of %qD will never be NULL",
8061 TREE_OPERAND (op1, 0));
8062 result_type = type1;
8064 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
8066 result_type = type0;
8067 pedwarn ("comparison between pointer and integer");
8069 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
8071 result_type = type1;
8072 pedwarn ("comparison between pointer and integer");
8080 build_type = integer_type_node;
8081 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE)
8082 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE))
8084 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
8086 if (comp_target_types (type0, type1))
8088 result_type = common_pointer_type (type0, type1);
8089 if (!COMPLETE_TYPE_P (TREE_TYPE (type0))
8090 != !COMPLETE_TYPE_P (TREE_TYPE (type1)))
8091 pedwarn ("comparison of complete and incomplete pointers");
8093 && TREE_CODE (TREE_TYPE (type0)) == FUNCTION_TYPE)
8094 pedwarn ("ISO C forbids ordered comparisons of pointers to functions");
8098 result_type = ptr_type_node;
8099 pedwarn ("comparison of distinct pointer types lacks a cast");
8102 else if (code0 == POINTER_TYPE && null_pointer_constant_p (orig_op1))
8104 result_type = type0;
8105 if (pedantic || extra_warnings)
8106 pedwarn ("ordered comparison of pointer with integer zero");
8108 else if (code1 == POINTER_TYPE && null_pointer_constant_p (orig_op0))
8110 result_type = type1;
8112 pedwarn ("ordered comparison of pointer with integer zero");
8114 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
8116 result_type = type0;
8117 pedwarn ("comparison between pointer and integer");
8119 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
8121 result_type = type1;
8122 pedwarn ("comparison between pointer and integer");
8130 if (code0 == ERROR_MARK || code1 == ERROR_MARK)
8131 return error_mark_node;
8133 if (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE
8134 && (!tree_int_cst_equal (TYPE_SIZE (type0), TYPE_SIZE (type1))
8135 || !same_scalar_type_ignoring_signedness (TREE_TYPE (type0),
8136 TREE_TYPE (type1))))
8138 binary_op_error (code, type0, type1);
8139 return error_mark_node;
8142 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE || code0 == COMPLEX_TYPE
8143 || code0 == VECTOR_TYPE)
8145 (code1 == INTEGER_TYPE || code1 == REAL_TYPE || code1 == COMPLEX_TYPE
8146 || code1 == VECTOR_TYPE))
8148 int none_complex = (code0 != COMPLEX_TYPE && code1 != COMPLEX_TYPE);
8150 if (shorten || common || short_compare)
8151 result_type = c_common_type (type0, type1);
8153 /* For certain operations (which identify themselves by shorten != 0)
8154 if both args were extended from the same smaller type,
8155 do the arithmetic in that type and then extend.
8157 shorten !=0 and !=1 indicates a bitwise operation.
8158 For them, this optimization is safe only if
8159 both args are zero-extended or both are sign-extended.
8160 Otherwise, we might change the result.
8161 Eg, (short)-1 | (unsigned short)-1 is (int)-1
8162 but calculated in (unsigned short) it would be (unsigned short)-1. */
8164 if (shorten && none_complex)
8166 int unsigned0, unsigned1;
8171 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
8172 excessive narrowing when we call get_narrower below. For
8173 example, suppose that OP0 is of unsigned int extended
8174 from signed char and that RESULT_TYPE is long long int.
8175 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
8178 (long long int) (unsigned int) signed_char
8180 which get_narrower would narrow down to
8182 (unsigned int) signed char
8184 If we do not cast OP0 first, get_narrower would return
8185 signed_char, which is inconsistent with the case of the
8187 op0 = convert (result_type, op0);
8188 op1 = convert (result_type, op1);
8190 arg0 = get_narrower (op0, &unsigned0);
8191 arg1 = get_narrower (op1, &unsigned1);
8193 /* UNS is 1 if the operation to be done is an unsigned one. */
8194 uns = TYPE_UNSIGNED (result_type);
8196 final_type = result_type;
8198 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
8199 but it *requires* conversion to FINAL_TYPE. */
8201 if ((TYPE_PRECISION (TREE_TYPE (op0))
8202 == TYPE_PRECISION (TREE_TYPE (arg0)))
8203 && TREE_TYPE (op0) != final_type)
8204 unsigned0 = TYPE_UNSIGNED (TREE_TYPE (op0));
8205 if ((TYPE_PRECISION (TREE_TYPE (op1))
8206 == TYPE_PRECISION (TREE_TYPE (arg1)))
8207 && TREE_TYPE (op1) != final_type)
8208 unsigned1 = TYPE_UNSIGNED (TREE_TYPE (op1));
8210 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
8212 /* For bitwise operations, signedness of nominal type
8213 does not matter. Consider only how operands were extended. */
8217 /* Note that in all three cases below we refrain from optimizing
8218 an unsigned operation on sign-extended args.
8219 That would not be valid. */
8221 /* Both args variable: if both extended in same way
8222 from same width, do it in that width.
8223 Do it unsigned if args were zero-extended. */
8224 if ((TYPE_PRECISION (TREE_TYPE (arg0))
8225 < TYPE_PRECISION (result_type))
8226 && (TYPE_PRECISION (TREE_TYPE (arg1))
8227 == TYPE_PRECISION (TREE_TYPE (arg0)))
8228 && unsigned0 == unsigned1
8229 && (unsigned0 || !uns))
8231 = c_common_signed_or_unsigned_type
8232 (unsigned0, common_type (TREE_TYPE (arg0), TREE_TYPE (arg1)));
8233 else if (TREE_CODE (arg0) == INTEGER_CST
8234 && (unsigned1 || !uns)
8235 && (TYPE_PRECISION (TREE_TYPE (arg1))
8236 < TYPE_PRECISION (result_type))
8238 = c_common_signed_or_unsigned_type (unsigned1,
8240 int_fits_type_p (arg0, type)))
8242 else if (TREE_CODE (arg1) == INTEGER_CST
8243 && (unsigned0 || !uns)
8244 && (TYPE_PRECISION (TREE_TYPE (arg0))
8245 < TYPE_PRECISION (result_type))
8247 = c_common_signed_or_unsigned_type (unsigned0,
8249 int_fits_type_p (arg1, type)))
8253 /* Shifts can be shortened if shifting right. */
8258 tree arg0 = get_narrower (op0, &unsigned_arg);
8260 final_type = result_type;
8262 if (arg0 == op0 && final_type == TREE_TYPE (op0))
8263 unsigned_arg = TYPE_UNSIGNED (TREE_TYPE (op0));
8265 if (TYPE_PRECISION (TREE_TYPE (arg0)) < TYPE_PRECISION (result_type)
8266 /* We can shorten only if the shift count is less than the
8267 number of bits in the smaller type size. */
8268 && compare_tree_int (op1, TYPE_PRECISION (TREE_TYPE (arg0))) < 0
8269 /* We cannot drop an unsigned shift after sign-extension. */
8270 && (!TYPE_UNSIGNED (final_type) || unsigned_arg))
8272 /* Do an unsigned shift if the operand was zero-extended. */
8274 = c_common_signed_or_unsigned_type (unsigned_arg,
8276 /* Convert value-to-be-shifted to that type. */
8277 if (TREE_TYPE (op0) != result_type)
8278 op0 = convert (result_type, op0);
8283 /* Comparison operations are shortened too but differently.
8284 They identify themselves by setting short_compare = 1. */
8288 /* Don't write &op0, etc., because that would prevent op0
8289 from being kept in a register.
8290 Instead, make copies of the our local variables and
8291 pass the copies by reference, then copy them back afterward. */
8292 tree xop0 = op0, xop1 = op1, xresult_type = result_type;
8293 enum tree_code xresultcode = resultcode;
8295 = shorten_compare (&xop0, &xop1, &xresult_type, &xresultcode);
8300 op0 = xop0, op1 = xop1;
8302 resultcode = xresultcode;
8304 if (warn_sign_compare && skip_evaluation == 0)
8306 int op0_signed = !TYPE_UNSIGNED (TREE_TYPE (orig_op0));
8307 int op1_signed = !TYPE_UNSIGNED (TREE_TYPE (orig_op1));
8308 int unsignedp0, unsignedp1;
8309 tree primop0 = get_narrower (op0, &unsignedp0);
8310 tree primop1 = get_narrower (op1, &unsignedp1);
8314 STRIP_TYPE_NOPS (xop0);
8315 STRIP_TYPE_NOPS (xop1);
8317 /* Give warnings for comparisons between signed and unsigned
8318 quantities that may fail.
8320 Do the checking based on the original operand trees, so that
8321 casts will be considered, but default promotions won't be.
8323 Do not warn if the comparison is being done in a signed type,
8324 since the signed type will only be chosen if it can represent
8325 all the values of the unsigned type. */
8326 if (!TYPE_UNSIGNED (result_type))
8328 /* Do not warn if both operands are the same signedness. */
8329 else if (op0_signed == op1_signed)
8337 sop = xop0, uop = xop1;
8339 sop = xop1, uop = xop0;
8341 /* Do not warn if the signed quantity is an
8342 unsuffixed integer literal (or some static
8343 constant expression involving such literals or a
8344 conditional expression involving such literals)
8345 and it is non-negative. */
8346 if (tree_expr_nonnegative_warnv_p (sop, &ovf))
8348 /* Do not warn if the comparison is an equality operation,
8349 the unsigned quantity is an integral constant, and it
8350 would fit in the result if the result were signed. */
8351 else if (TREE_CODE (uop) == INTEGER_CST
8352 && (resultcode == EQ_EXPR || resultcode == NE_EXPR)
8354 (uop, c_common_signed_type (result_type)))
8356 /* Do not warn if the unsigned quantity is an enumeration
8357 constant and its maximum value would fit in the result
8358 if the result were signed. */
8359 else if (TREE_CODE (uop) == INTEGER_CST
8360 && TREE_CODE (TREE_TYPE (uop)) == ENUMERAL_TYPE
8362 (TYPE_MAX_VALUE (TREE_TYPE (uop)),
8363 c_common_signed_type (result_type)))
8366 warning (0, "comparison between signed and unsigned");
8369 /* Warn if two unsigned values are being compared in a size
8370 larger than their original size, and one (and only one) is the
8371 result of a `~' operator. This comparison will always fail.
8373 Also warn if one operand is a constant, and the constant
8374 does not have all bits set that are set in the ~ operand
8375 when it is extended. */
8377 if ((TREE_CODE (primop0) == BIT_NOT_EXPR)
8378 != (TREE_CODE (primop1) == BIT_NOT_EXPR))
8380 if (TREE_CODE (primop0) == BIT_NOT_EXPR)
8381 primop0 = get_narrower (TREE_OPERAND (primop0, 0),
8384 primop1 = get_narrower (TREE_OPERAND (primop1, 0),
8387 if (host_integerp (primop0, 0) || host_integerp (primop1, 0))
8390 HOST_WIDE_INT constant, mask;
8391 int unsignedp, bits;
8393 if (host_integerp (primop0, 0))
8396 unsignedp = unsignedp1;
8397 constant = tree_low_cst (primop0, 0);
8402 unsignedp = unsignedp0;
8403 constant = tree_low_cst (primop1, 0);
8406 bits = TYPE_PRECISION (TREE_TYPE (primop));
8407 if (bits < TYPE_PRECISION (result_type)
8408 && bits < HOST_BITS_PER_WIDE_INT && unsignedp)
8410 mask = (~(HOST_WIDE_INT) 0) << bits;
8411 if ((mask & constant) != mask)
8412 warning (0, "comparison of promoted ~unsigned with constant");
8415 else if (unsignedp0 && unsignedp1
8416 && (TYPE_PRECISION (TREE_TYPE (primop0))
8417 < TYPE_PRECISION (result_type))
8418 && (TYPE_PRECISION (TREE_TYPE (primop1))
8419 < TYPE_PRECISION (result_type)))
8420 warning (0, "comparison of promoted ~unsigned with unsigned");
8426 /* At this point, RESULT_TYPE must be nonzero to avoid an error message.
8427 If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
8428 Then the expression will be built.
8429 It will be given type FINAL_TYPE if that is nonzero;
8430 otherwise, it will be given type RESULT_TYPE. */
8434 binary_op_error (code, TREE_TYPE (op0), TREE_TYPE (op1));
8435 return error_mark_node;
8440 if (TREE_TYPE (op0) != result_type)
8441 op0 = convert_and_check (result_type, op0);
8442 if (TREE_TYPE (op1) != result_type)
8443 op1 = convert_and_check (result_type, op1);
8445 /* This can happen if one operand has a vector type, and the other
8446 has a different type. */
8447 if (TREE_CODE (op0) == ERROR_MARK || TREE_CODE (op1) == ERROR_MARK)
8448 return error_mark_node;
8451 if (build_type == NULL_TREE)
8452 build_type = result_type;
8455 /* Treat expressions in initializers specially as they can't trap. */
8456 tree result = require_constant_value ? fold_build2_initializer (resultcode,
8459 : fold_build2 (resultcode, build_type,
8462 if (final_type != 0)
8463 result = convert (final_type, result);
8469 /* Convert EXPR to be a truth-value, validating its type for this
8473 c_objc_common_truthvalue_conversion (tree expr)
8475 switch (TREE_CODE (TREE_TYPE (expr)))
8478 error ("used array that cannot be converted to pointer where scalar is required");
8479 return error_mark_node;
8482 error ("used struct type value where scalar is required");
8483 return error_mark_node;
8486 error ("used union type value where scalar is required");
8487 return error_mark_node;
8496 /* ??? Should we also give an error for void and vectors rather than
8497 leaving those to give errors later? */
8498 return c_common_truthvalue_conversion (expr);
8502 /* Convert EXPR to a contained DECL, updating *TC, *TI and *SE as
8506 c_expr_to_decl (tree expr, bool *tc ATTRIBUTE_UNUSED,
8507 bool *ti ATTRIBUTE_UNUSED, bool *se)
8509 if (TREE_CODE (expr) == COMPOUND_LITERAL_EXPR)
8511 tree decl = COMPOUND_LITERAL_EXPR_DECL (expr);
8512 /* Executing a compound literal inside a function reinitializes
8514 if (!TREE_STATIC (decl))
8522 /* Like c_begin_compound_stmt, except force the retention of the BLOCK. */
8525 c_begin_omp_parallel (void)
8530 block = c_begin_compound_stmt (true);
8536 c_finish_omp_parallel (tree clauses, tree block)
8540 block = c_end_compound_stmt (block, true);
8542 stmt = make_node (OMP_PARALLEL);
8543 TREE_TYPE (stmt) = void_type_node;
8544 OMP_PARALLEL_CLAUSES (stmt) = clauses;
8545 OMP_PARALLEL_BODY (stmt) = block;
8547 return add_stmt (stmt);
8550 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
8551 Remove any elements from the list that are invalid. */
8554 c_finish_omp_clauses (tree clauses)
8556 bitmap_head generic_head, firstprivate_head, lastprivate_head;
8557 tree c, t, *pc = &clauses;
8560 bitmap_obstack_initialize (NULL);
8561 bitmap_initialize (&generic_head, &bitmap_default_obstack);
8562 bitmap_initialize (&firstprivate_head, &bitmap_default_obstack);
8563 bitmap_initialize (&lastprivate_head, &bitmap_default_obstack);
8565 for (pc = &clauses, c = clauses; c ; c = *pc)
8567 bool remove = false;
8568 bool need_complete = false;
8569 bool need_implicitly_determined = false;
8571 switch (OMP_CLAUSE_CODE (c))
8573 case OMP_CLAUSE_SHARED:
8575 need_implicitly_determined = true;
8576 goto check_dup_generic;
8578 case OMP_CLAUSE_PRIVATE:
8580 need_complete = true;
8581 need_implicitly_determined = true;
8582 goto check_dup_generic;
8584 case OMP_CLAUSE_REDUCTION:
8586 need_implicitly_determined = true;
8587 t = OMP_CLAUSE_DECL (c);
8588 if (AGGREGATE_TYPE_P (TREE_TYPE (t))
8589 || POINTER_TYPE_P (TREE_TYPE (t)))
8591 error ("%qE has invalid type for %<reduction%>", t);
8594 else if (FLOAT_TYPE_P (TREE_TYPE (t)))
8596 enum tree_code r_code = OMP_CLAUSE_REDUCTION_CODE (c);
8597 const char *r_name = NULL;
8614 case TRUTH_ANDIF_EXPR:
8617 case TRUTH_ORIF_EXPR:
8625 error ("%qE has invalid type for %<reduction(%s)%>",
8630 goto check_dup_generic;
8632 case OMP_CLAUSE_COPYPRIVATE:
8633 name = "copyprivate";
8634 goto check_dup_generic;
8636 case OMP_CLAUSE_COPYIN:
8638 t = OMP_CLAUSE_DECL (c);
8639 if (TREE_CODE (t) != VAR_DECL || !DECL_THREAD_LOCAL_P (t))
8641 error ("%qE must be %<threadprivate%> for %<copyin%>", t);
8644 goto check_dup_generic;
8647 t = OMP_CLAUSE_DECL (c);
8648 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
8650 error ("%qE is not a variable in clause %qs", t, name);
8653 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
8654 || bitmap_bit_p (&firstprivate_head, DECL_UID (t))
8655 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
8657 error ("%qE appears more than once in data clauses", t);
8661 bitmap_set_bit (&generic_head, DECL_UID (t));
8664 case OMP_CLAUSE_FIRSTPRIVATE:
8665 name = "firstprivate";
8666 t = OMP_CLAUSE_DECL (c);
8667 need_complete = true;
8668 need_implicitly_determined = true;
8669 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
8671 error ("%qE is not a variable in clause %<firstprivate%>", t);
8674 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
8675 || bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
8677 error ("%qE appears more than once in data clauses", t);
8681 bitmap_set_bit (&firstprivate_head, DECL_UID (t));
8684 case OMP_CLAUSE_LASTPRIVATE:
8685 name = "lastprivate";
8686 t = OMP_CLAUSE_DECL (c);
8687 need_complete = true;
8688 need_implicitly_determined = true;
8689 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
8691 error ("%qE is not a variable in clause %<lastprivate%>", t);
8694 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
8695 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
8697 error ("%qE appears more than once in data clauses", t);
8701 bitmap_set_bit (&lastprivate_head, DECL_UID (t));
8705 case OMP_CLAUSE_NUM_THREADS:
8706 case OMP_CLAUSE_SCHEDULE:
8707 case OMP_CLAUSE_NOWAIT:
8708 case OMP_CLAUSE_ORDERED:
8709 case OMP_CLAUSE_DEFAULT:
8710 pc = &OMP_CLAUSE_CHAIN (c);
8719 t = OMP_CLAUSE_DECL (c);
8723 t = require_complete_type (t);
8724 if (t == error_mark_node)
8728 if (need_implicitly_determined)
8730 const char *share_name = NULL;
8732 if (TREE_CODE (t) == VAR_DECL && DECL_THREAD_LOCAL_P (t))
8733 share_name = "threadprivate";
8734 else switch (c_omp_predetermined_sharing (t))
8736 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
8738 case OMP_CLAUSE_DEFAULT_SHARED:
8739 share_name = "shared";
8741 case OMP_CLAUSE_DEFAULT_PRIVATE:
8742 share_name = "private";
8749 error ("%qE is predetermined %qs for %qs",
8750 t, share_name, name);
8757 *pc = OMP_CLAUSE_CHAIN (c);
8759 pc = &OMP_CLAUSE_CHAIN (c);
8762 bitmap_obstack_release (NULL);